检索结果-南通市图书馆

What can we learn from quality assurance badges in open-source software?

science China(Information sciences) 2024年第4期67卷 146-163页

作者： Feng LI Yiling LOU Xin TAN Zhenpeng CHEN Jinhao DONG Yang LI Xuanzhi WANG Dan HAO Lu ZHANG MoE Key lab of HCST School of Computer SciencePeking University department of computer science Purdue University School of computer science & Engineering Beihang University(BUAA) department of computer science University College London(UCL)

In the development of open-source software(OSS), many developers use badges to give an overview of the software and share some key features/metrics conveniently. Among various badges, quality assurance(QA) badges make up a large proportion and are the most prevalent because QA is of vital importance in software development, and ineffective QA may lead to anomalies or defects. In this paper, we focus on QA badges in open-source projects, which present quality assurance information directly and instantly,and aim to produce some interesting findings and provide practical implications. We collect and analyze 100000 projects written in popular programming languages from GitHub and conduct a comprehensive empirical study both inside and outside QA badges. Inside QA badges, we build a category classification for all QA badges based on the properties they focus on, which shows the types of QA badges developers use. Then,we analyze the frequency of the properties that QA badges focus on, and property combinations, too, which present their use status. We find that QA badges focus on various properties while developers give different preferences to different properties. The use status also differs between different programming languages. For example, projects written in C focus on Security to a great extent. Our findings also provide implications for developers and badge providers. Outside QA badges, we conduct a correlation analysis between QA badges and some software metrics that have potential relationships with code quality, contribution quality, and popularity. We find that QA badges have statistically significant correlations with various software metrics.

关键词： quality assurance badge open-source software code quality empirical study

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Unbalanced private set intersection with linear communication complexity

引用

science China(Information sciences) 2024年第3期67卷 79-93页

作者： Quanyu ZHAO Bingbing JIANG Yuan ZHANG Heng WANG Yunlong MAO Sheng ZHONG department of computer science and Technology Nanjing University Purple Mountain lab

The private set intersection(PSI) protocol allows two parties holding a set of integers to compute the intersection of their sets without revealing any additional information to each other. The unbalanced PSI schemes consider a specific setting where a client holds a small set of the size n and a server holds a much larger set of the size m(n ■ m). The communication overhead of state-of-the-art balanced PSI schemes is O(m + n) and the unbalanced PSI schemes are O(nlogm). In this paper, we propose a novel secure unbalanced PSI protocol based on a hash proof system. The communication complexity of our protocol grows only linearly with the size of the small set. In other words, our protocol achieves communication overhead of O(n). We test the performance on a personal computer(PC) machine with a local area network(LAN)setting for the network. The experimental results demonstrate that the client only takes 2.01 s of online computation, 4.27 MB of round trip communication to intersect 1600 pieces of 32-bit integers with 220pieces of 32-bit integers with the security parameter λ = 512. Our protocol is efficient and can be applied to resource-constrained devices, such as cell phones.

关键词： unbalanced private set intersection Hash proof system linear communication complexity small set resource-constrained devices

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

An artificial intelligence framework for explainable drift detection in energy forecasting

引用

Energy and AI 2024年第3期17卷 368-379页

作者： Chamod Samarajeewa Daswin De Silva Milos Manic Nishan Mills Harsha Moraliyage Damminda Alahakoon Andrew Jennings Centre for Data analytics and Cognition La Trobe UniversityAustralia department of computer science Virginia Commonwealth UniversityRichmondUSA

Accurate energy consumption forecasting is crucial for reducing operational costs, achieving net-zero carbon emissions, and ensuring sustainable buildings and cities of the future. Despite the frequent use of Artificial Intelligence (AI) algorithms for learning energy consumption patterns and predictions in Building science, relying solely on these techniques for energy demand prediction addresses only a fraction of the challenge. A drift in energy usage can lead to inaccuracies in these AI models and subsequently to poor decision-making and interventions. While drift detection techniques have been reported, a reliable and robust approach capable of explaining identified discrepancies with actionable insights has not been discussed in extant literature. Hence, this paper presents an Artificial Intelligence framework for energy consumption forecasting with explainable drift detection, aimed at addressing these challenges. The proposed framework is composed of energy embeddings, an optimized dimensional model integrated within a data warehouse, and scalable cloud implementation for effective drift detection with explainability capability. The framework is empirically evaluated in the real-world setting of a multi-campus, mixed-use tertiary education setting in Victoria, Australia. The results of these experiments highlight its capabilities in detecting concept drift, adapting forecast predictions, and providing an interpretation of the changes using energy embeddings.

关键词： Building energy consumption forecasting Explainable drift detection Energy embedding Dimensional modeling

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A Survey and Experimental Review on Data Distribution Strategies for Parallel Spatial Clustering Algorithms

引用

Journal of computer science & Technology 2024年第3期39卷 610-636页

作者： Jagat Sesh Challa Navneet Goyal Amogh Sharma Nikhil Sreekumar Sundar Balasubramaniam Poonam Goyal Advanced Data analytics and Parallel Technologies laboratory Birla Institute of Technology and Science Pilani 333031India Uber New York 11101U.S.A. computer science and Engineering department University of MinnesotaMinneapolis 55455U.S.A.

The advent of Big Data has led to the rapid growth in the usage of parallel clustering algorithms that work over distributed computing frameworks such as MPI,MapReduce,and *** important step for any parallel clustering algorithm is the distribution of data amongst the cluster *** step governs the methodology and performance of the entire *** typically use random,or a spatial/geometric distribution strategy like kd-tree based partitioning and grid-based partitioning,as per the requirements of the ***,these strategies are generic and are not tailor-made for any specific parallel clustering *** this paper,we give a very comprehensive literature survey of MPI-based parallel clustering algorithms with special reference to the specific data distribution strategies they *** also propose three new data distribution strategies namely Parameterized Dimensional Split for parallel density-based clustering algorithms like DBSCAN and OPTICS,Cell-Based Dimensional Split for dGridSLINK,which is a grid-based hierarchical clustering algorithm that exhibits efficiency for disjoint spatial distribution,and Projection-Based Split,which is a generic distribution *** of these preserve spatial locality,achieve disjoint partitioning,and ensure good data load *** experimental analysis shows the benefits of using the proposed data distribution strategies for algorithms they are designed for,based on which we give appropriate recommendations for their usage.

关键词： parallel data mining data distribution parallel clustering spatial locality preservation

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acquiring Weak Annotations for Tumor Localization in Temporal and Volumetric Data

引用

Machine Intelligence Research 2024年第2期21卷 318-330页

作者： Yu-Cheng Chou Bowen Li Deng-Ping Fan Alan Yuille Zongwei Zhou department of computer science Johns Hopkins UniversityBaltimore 21218USA computer Vision lab ETH ZurichZurich 8001Switzerland

Creating large-scale and well-annotated datasets to train AI algorithms is crucial for automated tumor detection and ***,with limited resources,it is challenging to determine the best type of annotations when annotating massive amounts of unlabeled *** address this issue,we focus on polyps in colonoscopy videos and pancreatic tumors in abdominal CT scans;Both applications require significant effort and time for pixel-wise annotation due to the high dimensional nature of the data,involving either temporary or spatial *** this paper,we develop a new annotation strategy,termed Drag&Drop,which simplifies the annotation process to drag and *** annotation strategy is more efficient,particularly for temporal and volumetric imaging,than other types of weak annotations,such as per-pixel,bounding boxes,scribbles,ellipses and ***,to exploit our Drag&Drop annotations,we develop a novel weakly supervised learning method based on the watershed *** results show that our method achieves better detection and localization performance than alternative weak annotations and,more importantly,achieves similar performance to that trained on detailed per-pixel ***,we find that,with limited resources,allocating weak annotations from a diverse patient population can foster models more robust to unseen images than allocating per-pixel annotations for a small set of *** summary,this research proposes an efficient annotation strategy for tumor detection and localization that is less accurate than per-pixel annotations but useful for creating large-scale datasets for screening tumors in various medical modalities.

关键词： Weak annotation detection localization segmentation colonoscopy abdomen

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Traffic Engineering and Quality of Service in Hybrid Software Defined Networks

引用

China Communications 2024年第2期21卷 96-121页

作者： Samiullah Mehraban Rajesh Kumar Yadav IOT lab Department of Computer Science&EngineeringDelhi Technological UniversityDelhi 110042India

For Future networks, many research projects have proposed different architectures around the globe;Software Defined Network(SDN) architectures, through separating Data and Control Layers, offer a crucial structure for it. With a worldwide view and centralized Control, the SDN network provides flexible and reliable network management that improves network throughput and increases link utilization. In addition, it supports an innovative flow scheduling system to help advance Traffic Engineering(TE). For Medium and large-scale networks migrating directly from a legacy network to an SDN Network seems more complicated & even impossible, as there are High potential challenges, including technical, financial, security, shortage of standards, and quality of service degradation challenges. These challenges cause the birth and pave the ground for Hybrid SDN networks, where SDN devices coexist with traditional network devices. This study explores a Hybrid SDN network’s Traffic Engineering and Quality of Services Issues. Quality of service is described by network characteristics such as latency, jitter, loss, bandwidth,and network link utilization, using industry standards and mechanisms in a Hybrid SDN Network. We have organized the related studies in a way that the Quality of Service may gain the most benefit from the concept of Hybrid SDN networks using different algorithms and mechanisms: Deep Reinforcement Learning(DRL), Heuristic algorithm, K path partition algorithm, Genetic algorithm, SOTE algorithm, ROAR method, and Routing Optimization with different optimization mechanisms that help to ensure high-quality performance in a Hybrid SDN Network.

关键词： DRL hSDN QoE QoS SDN TE

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A hybrid memory architecture supporting fine-grained data migration

引用

Frontiers of computer science 2024年第2期18卷 31-41页

作者： Ye CHI Jianhui YUE Xiaofei LIAO Haikun LIU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China department of computer science Michigan Technological UniversityMichigan 49931USA

Hybrid memory systems composed of dynamic random access memory(DRAM)and Non-volatile memory(NVM)often exploit page migration technologies to fully take the advantages of different memory *** previous proposals usually migrate data at a granularity of 4 KB pages,and thus waste memory bandwidth and DRAM *** this paper,we propose Mocha,a non-hierarchical architecture that organizes DRAM and NVM in a flat address space physically,but manages them in a cache/memory *** the commercial NVM device-Intel Optane DC Persistent Memory Modules(DCPMM)actually access the physical media at a granularity of 256 bytes(an Optane block),we manage the DRAM cache at the 256-byte size to adapt to this feature of *** design not only enables fine-grained data migration and management for the DRAM cache,but also avoids write amplification for Intel Optane *** also create an Indirect Address Cache(IAC)in Hybrid Memory Controller(HMC)and propose a reverse address mapping table in the DRAM to speed up address translation and cache ***,we exploit a utility-based caching mechanism to filter cold blocks in the NVM,and further improve the efficiency of the DRAM *** implement Mocha in an architectural *** results show that Mocha can improve application performance by 8.2%on average(up to 24.6%),reduce 6.9%energy consumption and 25.9%data migration traffic on average,compared with a typical hybrid memory architecture-HSCC.

关键词： non-volatile memory hybrid memory system data migration fine-grained caching

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A disk I/O optimized system for concurrent graph processing jobs

引用

Frontiers of computer science 2024年第3期18卷 13-29页

作者： Xianghao XU Fang WANG Hong JIANG Yongli CHENG Dan FENG Peng FANG School of computer science and Engineering Nanjing University of Science and TechnologyNanjing 210094China Wuhan National laboratory for Optoelectronics Huazhong University of Science and TechnologyWuhan 430074China department of computer science&Engineering University of Texas at ArlingtonArlingtonTX 76019USA College of computer and Data science Fuzhou UniversityFuzhou 350108China Zhejiang lab Hangzhou 311121China

In order to analyze and process the large graphs with high cost efficiency,researchers have developed a number of out-of-core graph processing systems in recent years based on just one commodity *** the other hand,with the rapidly growing need of analyzing graphs in the real-world,graph processing systems have to efficiently handle massive concurrent graph processing(CGP)***,due to the inherent design for single graph processing job,existing out-of-core graph processing systems usually incur unnecessary data accesses and severe competition of I/O bandwidth when handling the CGP *** this paper,we propose GraphCP,a disk I/O optimized out-of-core graph processing system that efficiently supports the processing of CGP *** proposes a benefit-aware sharing execution model to share the I/O access and processing of graph data among the CGP jobs and adaptively schedule the graph data loading based on the states of vertices,which efficiently overcomes above challenges faced by existing out-of-core graph processing ***,GraphCP adopts a dependency-based future-vertex updating model so as to reduce disk I/Os in the future *** addition,GraphCP organizes the graph data with a Source-Sorted Sub-Block graph representation for better processing capacity and I/O access *** evaluation results show that GraphCP is 20.5×and 8.9×faster than two out-of-core graph processing systems GridGraph and GraphZ,and 3.5×and 1.7×faster than two state-of-art concurrent graph processing systems Seraph and GraphSO.

关键词： graph processing disk I/O concurrent jobs

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Enhanced Steganalysis for Color Images Using Curvelet Features and Support Vector Machine

引用

computers, Materials & Continua 2024年第1期78卷 1311-1328页

作者： Arslan Akram Imran Khan Javed Rashid Mubbashar Saddique Muhammad Idrees Yazeed Yasin Ghadi Abdulmohsen Algarni Faculty of computer science and Information Technology Department of Computer ScienceSuperior UniversityLahore54000Pakistan Machine Learning Code(MLC)lab Meharban HouseHouse Number 209Zafar ColonyOkara56300Pakistan Information Technology Services University of OkaraOkara56310Pakistan department of computer science&Engineering University of Engineering&Technology LahoreNarowal CampusNarowal51601Pakistan department of computer science and Software Engineering Al Ain UniversityAl Ain11671Abu Dhabi department of computer science King Khalid UniversityAbha61421Saudi Arabia

Algorithms for steganography are methods of hiding data transfers in media *** machine learning architectures have been presented recently to improve stego image identification performance by using spatial information,and these methods have made it feasible to handle a wide range of problems associated with image *** with little information or low payload are used by information embedding methods,but the goal of all contemporary research is to employ high-payload images for *** address the need for both low-and high-payload images,this work provides a machine-learning approach to steganography image classification that uses Curvelet transformation to efficiently extract characteristics from both type of *** Vector Machine(SVM),a commonplace classification technique,has been employed to determine whether the image is a stego or *** Wavelet Obtained Weights(WOW),Spatial Universal Wavelet Relative Distortion(S-UNIWARD),Highly Undetectable Steganography(HUGO),and Minimizing the Power of Optimal Detector(MiPOD)steganography techniques are used in a variety of experimental scenarios to evaluate the performance of the *** WOW at several payloads,the proposed approach proves its classification accuracy of 98.60%.It exhibits its superiority over SOTA methods.

关键词： Curvelets fast fourier transformation support vector machine high pass filters steganography

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Interference mitigation and target detection for automotive FMCW radar with range-Doppler sparse regularization

引用

science China(Information sciences) 2024年第9期67卷 342-343页

作者： Yan HUANG Yunxuan WANG Xiao ZHOU Hui ZHANG Yuan MAO Guisheng LIAO Wei HONG State Key lab of Millimeter Waves Southeast University department of computer science University College London National Key lab of Radar Signal Processing Xidian University

The invention of vehicles has shaped our modern society and accelerated our economy while causing many tragic incidents simultaneously. Some advanced driver-assistance systems(ADAS) based on surrounding environment se... 详细信息

关键词： Radar interference

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：