检索结果-内蒙古大学图书馆

Re-quantization based binary graph neural networks

science China(Information sciences) 2024年第7期67卷 160-171页

作者： Kai-Lang YAO Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing University

Binary neural networks have become a promising research topic due to their advantages of fast inference speed and low energy consumption. However, most existing studies focus on binary convolutional neural networks, while less attention has been paid to binary graph neural networks. A common drawback of existing studies on binary graph neural networks is that they still include lots of inefficient full-precision operations in multiplying three matrices and are therefore not efficient enough. In this paper, we propose a novel method, called re-quantization-based binary graph neural networks(RQBGN), for binarizing graph neural networks. Specifically, re-quantization, a necessary procedure contributing to the further reduction of superfluous inefficient full-precision operations, quantizes the results of multiplication between any two matrices during the process of multiplying three matrices. To address the challenges introduced by requantization, in RQBGN we first study the impact of different computation orders to find an effective one and then introduce a mixture of experts to increase the model capacity. Experiments on five benchmark datasets show that performing re-quantization in different computation orders significantly impacts the performance of binary graph neural network models, and RQBGN can outperform other baselines to achieve state-of-the-art performance.

关键词： graph neural networks binary neural networks mixture of experts computation-efficient algorithms

来源：评论

学校读者我要写书评

暂无评论

Stochastic normalized gradient descent with momentum for large-batch training

引用

science China(Information sciences) 2024年第11期67卷 77-91页

作者： Shen-Yi ZHAO Chang-Wei SHI Yin-Peng XIE Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing University

Stochastic gradient descent(SGD) and its variants have been the dominating optimization methods in machine learning. Compared with SGD with small-batch training, SGD with large-batch training can better utilize the computational power of current multi-core systems such as graphics processing units(GPUs)and can reduce the number of communication rounds in distributed training settings. Thus, SGD with large-batch training has attracted considerable attention. However, existing empirical results showed that large-batch training typically leads to a drop in generalization accuracy. Hence, how to guarantee the generalization ability in large-batch training becomes a challenging task. In this paper, we propose a simple yet effective method, called stochastic normalized gradient descent with momentum(SNGM), for large-batch training. We prove that with the same number of gradient computations, SNGM can adopt a larger batch size than momentum SGD(MSGD), which is one of the most widely used variants of SGD, to converge to an?-stationary point. Empirical results on deep learning verify that when adopting the same large batch size,SNGM can achieve better test accuracy than MSGD and other state-of-the-art large-batch training methods.

关键词： non-convex problems large-batch training stochastic normalized gradient descent momentum

来源：评论

学校读者我要写书评

暂无评论

Orchestrating In-Network Aggregation for Distributed Machine Learning via In-Band Network Telemetry

引用

计算机科学技术学报（英文版） 2025年第1期40卷 196-214页

作者：吉明涛金熠波钱柱中曹拓叶保留 State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

Distributed machine learning systems train models via iterative updates between parallel workers and the pa-rameter *** expedite the transmissions,in-network aggregation of updates along with the packet forwarding at those programmable switches decreases the network traffic over these bottleneck ***,existing in-network ag-gregation schemas do not adequately prepare the most suitable switches for various worker distributions and fail to cap-ture the dynamic network *** on the status derived from in-band network telemetry,we aim to select the best switches upon the optimization we formulate with the objective of minimum transmission *** the problem is actually a non-linear integer program,by adopting delicate transformations,a substitute with totally unimodular con-straints and separable convex objective is then solved to obtain the integral *** implement our in-network ag-gregation protocol and reconstruct in-band network telemetry protocol upon real devices,i.e.,Barefoot Wedge100BF and Dell ***,we evaluate the performance of our proposed AGG algorithm and the results indicate that the comple-tion of related coflows decreases 40％on average compared with other strategies,improving at least 30％performance,compared with the state-of-the-art.

关键词： in-network aggregation distributed learning acceleration in-band network telemetry optimization data-center network

来源：评论

学校读者我要写书评

暂无评论

Detecting and Untangling Composite Commits via Attributed Graph Modeling

引用

计算机科学技术学报（英文版） 2025年第1期40卷 119-137页

作者：徐圣斌陈思宇姚远徐锋 State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

During software development,developers tend to tangle multiple concerns into a single commit,resulting in many composite *** paper studies the problem of detecting and untangling composite commits,so as to im-prove the maintainability and understandability of *** approach is built upon the observation that both the tex-tual content of code statements and the dependencies between code statements are helpful in comprehending the code *** on this observation,we first construct an attributed graph for each commit,where code statements and various code dependencies are modeled as nodes and edges,respectively,and the textual bodies of code statements are maintained as node *** on the attributed graph,we propose graph-based learning algorithms that first de-tect whether the given commit is a composite commit,and then untangle the composite commit into atomic *** evaluate our approach on nine C# projects,and the results demonstrate the effectiveness and efficiency of our approach.

关键词： composite commit commit untangling code dependency graph attributed graph

来源：评论

学校读者我要写书评

暂无评论

Understanding and Detecting Inefficient Image Displaying Issues in Android Apps

引用

Journal of computer science & technology 2024年第2期39卷 434-459页

作者：李文杰马骏蒋炎岩许畅马晓星 State Key Laboratory of Novel Software Technology Nanjing UniversityNanjing 210023China Department of Computer Science and Technology Nanjing UniversityNanjing 210023China

Mobile applications(apps for short)often need to display ***,inefficient image displaying(IID)issues are pervasive in mobile apps,and can severely impact app performance and user *** paper first establishes a descriptive framework for the image displaying procedures of IID *** on the descriptive framework,we conduct an empirical study of 216 real-world IID issues collected from 243 popular open-source Android apps to validate the presence and severity of IID issues,and then shed light on these issues’characteristics to support research on effective issue *** the findings of this study,we propose a static IID issue detection tool TAPIR and evaluate it with 243 real-world Android ***,49 and 64 previously-unknown IID issues in two different versions of 16 apps reported by TAPIR are manually confirmed as true positives,respectively,and 16 previously-unknown IID issues reported by TAPIR have been confirmed by developers and 13 have been ***,we further evaluate the performance impact of these detected IID issues and the performance improvement if they are *** results demonstrate that the IID issues detected by TAPIR indeed cause significant performance degradation,which further show the effectiveness and efficiency of TAPIR.

关键词： Android application(app) inefficient image displaying(IID) performance empirical study static analysis

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Privacy Protection Scheme for Efficient Edge Computation Offloading in IoV

引用

Chinese Journal of Electronics 2024年第4期33卷 910-919页

作者： Liang YAO Xiaolong XU Wanchun DOU Muhammad Bilal School of Software Nanjing University of Information Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Department of Computer and Electronics Systems Engineering Hankuk University of Foreign Studies

As a pivotal enabler of intelligent transportation system(ITS), Internet of vehicles(Io V) has aroused extensive attention from academia and industry. The exponential growth of computation-intensive, latency-sensitive,and privacy-aware vehicular applications in Io V result in the transformation from cloud computing to edge computing,which enables tasks to be offloaded to edge nodes(ENs) closer to vehicles for efficient execution. In ITS environment,however, due to dynamic and stochastic computation offloading requests, it is challenging to efficiently orchestrate offloading decisions for application requirements. How to accomplish complex computation offloading of vehicles while ensuring data privacy remains challenging. In this paper, we propose an intelligent computation offloading with privacy protection scheme, named COPP. In particular, an Advanced Encryption Standard-based encryption method is utilized to implement privacy protection. Furthermore, an online offloading scheme is proposed to find optimal offloading policies. Finally, experimental results demonstrate that COPP significantly outperforms benchmark schemes in the performance of both delay and energy consumption.

关键词： Industries Privacy Energy consumption Transportation Computational efficiency Encryption Protection

来源：评论

学校读者我要写书评

暂无评论

Random Subspace Sampling for Classification with Missing Data

引用

Journal of computer science & technology 2024年第2期39卷 472-486页

作者：曹云浩吴建鑫 State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210093China

Many real-world datasets suffer from the unavoidable issue of missing values,and therefore classification with missing data has to be carefully handled since inadequate treatment of missing values will cause large *** this paper,we propose a random subspace sampling method,RSS,by sampling missing items from the corresponding feature histogram distributions in random subspaces,which is effective and efficient at different levels of missing *** most established approaches,RSS does not train on fixed imputed ***,we design a dynamic training strategy where the filled values change dynamically by resampling during ***,thanks to the sampling strategy,we design an ensemble testing strategy where we combine the results of multiple runs of a single model,which is more efficient and resource-saving than previous ensemble ***,we combine these two strategies with the random subspace method,which makes our estimations more robust and *** effectiveness of the proposed RSS method is well validated by experimental studies.

关键词： missing data random subspace neural network ensemble learning

来源：评论

学校读者我要写书评

暂无评论

A program logic for obstruction-freedom

引用

Frontiers of computer science 2024年第6期18卷 85-100页

作者： Zhao-Hui LI Xin-Yu FENG School of Computer Science and Technology University of Science and Technology of ChinaHefei 230026China Department of Computer Science and Technology Nanjing UniversityNanjing 210023China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

Though obstruction-free progress property is weaker than other non-blocking properties including lock-freedom and wait-freedom,it has advantages that have led to the use of obstruction-free implementations for software transactional memory(STM)and in anonymous and fault-tolerant distributed ***,existing work can only verify obstruction-freedom of specific data structures(e.g.,STM and list-based algorithms).In this paper,to fill this gap,we propose a program logic that can formally verify obstruction-freedom of practical implementations,as well as verify linearizability,a safety property,at the same *** also propose informal principles to extend a logic for verifying linearizability to verifying *** this approach,the existing proof for linearizability can be reused directly to construct the proof for both linearizability and ***,we have successfully applied our logic to verifying a practical obstruction-free double-ended queue implementation in the first classic paper that has proposed the definition of obstruction-freedom.

关键词： verification program logic progress properties obstruction-freedom concurrent objects

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study on Automated Test Generation Tools for Java:Effectiveness and Challenges

引用

Journal of computer science & technology 2024年第3期39卷 715-736页

作者：刘相君余萍马晓星 State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China Department of Computer Science and Technology Nanjing UniversityNanjing 210023China CCF ACM IEEE

Automated test generation tools enable test automation and further alleviate the low efficiency caused by writing hand-crafted test ***,existing automated tools are not mature enough to be widely used by software testing *** paper conducts an empirical study on the state-of-the-art automated tools for Java,i.e.,EvoSuite,Randoop,JDoop,JTeXpert,T3,and *** design a test workflow to facilitate the process,which can automatically run tools for test generation,collect data,and evaluate various ***,we conduct empirical analysis on these six tools and their related techniques from different aspects,i.e.,code coverage,mutation score,test suite size,readability,and real fault detection *** discuss about the benefits and drawbacks of hybrid techniques based on experimental ***,we introduce our experience in setting up and executing these tools,and summarize their usability and ***,we give some insights into automated tools in terms of test suite readability improvement,meaningful assertion generation,test suite reduction for random testing tools,and symbolic execution integration.

关键词： automated test generation search-based software testing random testing symbolic execution

来源：评论

学校读者我要写书评

暂无评论

Deep learning-based software engineering: progress,challenges, and opportunities

引用

science China(Information sciences) 2025年第1期68卷 57-144页

作者： Xiangping CHEN Xing HU Yuan HUANG He JIANG Weixing JI Yanjie JIANG Yanyan JIANG Bo LIU Hui LIU Xiaochen LI Xiaoli LIAN Guozhu MENG Xin PENG Hailong SUN Lin SHI Bo WANG Chong WANG Jiayi WANG Tiantian WANG Jifeng XUAN Xin XIA Yibiao YANG Yixin YANG Li ZHANG Yuming ZHOU Lu ZHANG School of Journalism and Communication Sun Yat-sen University School of Software Technology Zhejiang University School of Software Engineering Sun Yat-sen University School of Software Dalian University of Technology School of Computer Science and Technology Beijing Institute of Technology Key Laboratory of High Confidence Software Technologies (Peking University) Ministry of EducationSchool of Computer Science Peking University State Key Laboratory for Novel Software Technology Nanjing University School of Computer Science and Engineering Beihang University Institute of Information Engineering Chinese Academy of Sciences School of Computer Science Fudan University State Key Laboratory of Complex & Critical Software Environment (CCSE) School of Software Beihang University School of Computer and Information Technology Beijing Jiaotong University School of Computer Science and Technology Harbin Institute of Technology School of Computer Science Wuhan University Huawei Technologies

Researchers have recently achieved significant advances in deep learning techniques, which in turn has substantially advanced other research disciplines, such as natural language processing, image processing, speech recognition, and software engineering. Various deep learning techniques have been successfully employed to facilitate software engineering tasks, including code generation, software refactoring, and fault localization. Many studies have also been presented in top conferences and journals, demonstrating the applications of deep learning techniques in resolving various software engineering tasks. However,although several surveys have provided overall pictures of the application of deep learning techniques in software engineering,they focus more on learning techniques, that is, what kind of deep learning techniques are employed and how deep models are trained or fine-tuned for software engineering tasks. We still lack surveys explaining the advances of subareas in software engineering driven by deep learning techniques, as well as challenges and opportunities in each subarea. To this end, in this study, we present the first task-oriented survey on deep learning-based software engineering. It covers twelve major software engineering subareas significantly impacted by deep learning techniques. Such subareas spread out through the whole lifecycle of software development and maintenance, including requirements engineering, software development, testing, maintenance, and developer collaboration. As we believe that deep learning may provide an opportunity to revolutionize the whole discipline of software engineering, providing one survey covering as many subareas as possible in software engineering can help future research push forward the frontier of deep learning-based software engineering more systematically. For each of the selected subareas,we highlight the major advances achieved by applying deep learning techniques with pointers to the available datasets i

关键词： deep learning software engineering software benchmark software artifact representation survey

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：