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

AsyCo: an asymmetric dual-task co-training model for partial-label learning

science China(Information sciences) 2025年第5期68卷 332-347页

作者： Beibei LI Yiyuan ZHENG Beihong JIN Tao XIANG Haobo WANG Lei FENG College of Computer Science Chongqing University State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences School of Software Technology Zhejiang University School of Computer Science and Engineering Nanyang Technological University

Partial-label learning(PLL) is a typical problem of weakly supervised learning, where each training instance is annotated with a set of candidate labels. Self-training PLL models achieve state-of-the-art performance but suffer from error accumulation problems caused by mistakenly disambiguated instances. Although co-training can alleviate this issue by training two networks simultaneously and allowing them to interact with each other, most existing co-training methods train two structurally identical networks with the same task, i.e., are symmetric, rendering it insufficient for them to correct each other due to their similar limitations. Therefore, in this paper, we propose an asymmetric dual-task co-training PLL model called AsyCo,which forces its two networks, i.e., a disambiguation network and an auxiliary network, to learn from different views explicitly by optimizing distinct tasks. Specifically, the disambiguation network is trained with a self-training PLL task to learn label confidence, while the auxiliary network is trained in a supervised learning paradigm to learn from the noisy pairwise similarity labels that are constructed according to the learned label confidence. Finally, the error accumulation problem is mitigated via information distillation and confidence refinement. Extensive experiments on both uniform and instance-dependent partially labeled datasets demonstrate the effectiveness of AsyCo.

关键词： machine learning weakly supervised learning partial-label learning co-training models candidate label sets

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An infrastructure software perspective toward computation offloading between executable specifications and foundation models

引用

science China(Information sciences) 2025年第4期68卷 380-382页

作者： Dezhi RAN Mengzhou WU Yuan CAO Assaf MARRON David HAREL Tao XIE Key Laboratory of High Confidence Software Technologies (PKU) Ministry of Education School of Computer SciencePeking University School of Electronics Engineering and Computer Science Peking University Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Formalization of Android Activity-Fragment Multitasking Mechanism and Static Analysis of Mobile Apps

引用

Formal Aspects of Computing 2025年第2期37卷 1-86页

作者： He, Jinlong Wu, Zhilin Chen, Taolue Key Laboratory of System Software Chinese Academy of Sciences Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China School of Computing and Mathematical Sciences Birkbeck University of London Northern Ireland London United Kingdom

The multitasking mechanism between activities and fragments plays a fundamental role in the Android operating system, which involves a wide range of features, including launch modes, intent flags, task affinities, and structured activities containing fragments. All of them are being widely used in Android apps, both open source and commercial ones. In this article, we present a formal semantics of the Android multitasking mechanism between activities and fragments, which accommodates all the important features and gives insofar the most comprehensive and accurate formalization. In particular, our semantics is formulated based on multi-stack systems, and fully captures the behavior of task stacks and activity stacks regarding fragments. Based on the semantics, we provide new static analysis algorithms, which are both multi-stack aware and fragment sensitive, thus achieve more precise static analysis for Android apps. We validate our approach by extensive experiments on both open source and commercial Android apps. The results highlight the benefits of the considering the semantics of the multitasking mechanism between activities and fragments in static analysis, and confirm the efficacy of our approach. © 2025 Copyright held by the owner/author(s).

关键词： Android multitasking mechanism activities and fragments formal semantics stack unboundedness static analysis

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Invariants for Polynomial Programs by Semidefinite Programming

引用

ACM Transactions on Programming Languages and Systems 2025年第1期47卷 1-35页

作者： Wu, Hao Wang, Qiuye Xue, Bai Zhan, Naijun Zhi, Lihong Yang, Zhi-Hong State Key Lab. of Computer Sciences Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Fermat Labs Huawei Inc. Dongguan China Key Lab. of System Software and State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Key Laboratory of High Confidence Software Technology School of Computer Science Peking University Beijing China School of Mathematics and Statistics Central South University Changsha China

Constraint-solving-based program invariant synthesis takes a parametric invariant template and encodes the (inductive) invariant conditions into constraints. The problem of characterizing the set of all valid parameter assignments is referred to as the strong invariant synthesis problem, while the problem of finding a concrete valid parameter assignment is called the weak invariant synthesis problem. For both problems, the challenge lies in solving or reducing the encoded constraints, which are generally non-convex and lack efficient solvers. In this article, we propose two novel algorithms for synthesizing invariants of polynomial programs using semidefinite programming (SDP): (1) The Cluster algorithm targets the strong invariant synthesis problem for polynomial invariant templates. Leveraging robust optimization techniques, it solves a series of SDP relaxations and yields a sequence of increasingly precise under-approximations of the set of valid parameter assignments. We prove the algorithm’s soundness, convergence, and weak completeness under a specific robustness assumption on templates. Moreover, the outputs can simplify the weak invariant synthesis problem. (2) The Mask algorithm addresses the weak invariant synthesis problem in scenarios where the aforementioned robustness assumption does not hold, rendering the Cluster algorithm ineffective. It identifies a specific subclass of invariant templates, termed masked templates, involving parameterized polynomial equalities and known inequalities. By applying variable substitution, the algorithm transforms constraints into an equivalent form amenable to SDP relaxations. Both algorithms have been implemented and demonstrated superior performance compared to state-of-the-art methods in our empirical evaluation. © 2025 Copyright held by the owner/author(s).

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Block-gram:Mining knowledgeable features for efficiently smart contract vulnerability detection

引用

Digital Communications and Networks 2025年第1期11卷 1-12页

作者： Xueshuo Xie Haolong Wang Zhaolong Jian Yaozheng Fang Zichun Wang Tao Li Tianjin Key Laboratory of Network and Data Security Technology TianjinChina College of Computer Science Nankai UniversityTianjinChina Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesChina

Smart contracts are widely used on the blockchain to implement complex transactions,such as decentralized applications on *** vulnerability detection of large-scale smart contracts is critical,as attacks on smart contracts often cause huge economic *** it is difficult to repair and update smart contracts,it is necessary to find the vulnerabilities before they are ***,code analysis,which requires traversal paths,and learning methods,which require many features to be trained,are too time-consuming to detect large-scale on-chain ***-based methods will obtain detection models from a feature space compared to code analysis methods such as symbol *** the existing features lack the interpretability of the detection results and training model,even worse,the large-scale feature space also affects the efficiency of *** paper focuses on improving the detection efficiency by reducing the dimension of the features,combined with expert *** this paper,a feature extraction model Block-gram is proposed to form low-dimensional knowledge-based features from ***,the metadata is separated and the runtime code is converted into a sequence of opcodes,which are divided into segments based on some instructions(jumps,etc.).Then,scalable Block-gram features,including 4-dimensional block features and 8-dimensional attribute features,are mined for the learning-based model ***,feature contributions are calculated from SHAP values to measure the relationship between our features and the results of the detection *** addition,six types of vulnerability labels are made on a dataset containing 33,885 contracts,and these knowledge-based features are evaluated using seven state-of-the-art learning algorithms,which show that the average detection latency speeds up 25×to 650×,compared with the features extracted by N-gram,and also can enhance the interpretability of the detection model.

关键词： Smart contract Bytecode&opcode Knowledgeable features Vulnerability detection Feature contribution

来源：评论

学校读者我要写书评

暂无评论

Four-wave mixing Bragg scattering for small frequency shift from silicon coupled microrings

引用

Chinese Physics B 2025年第1期34卷 351-355页

作者： Chang Zhao Chao Wu Pingyu Zhu Yuxing Du Yan Wang Miaomiao Yu Kaikai Zhang Ping Xu Institute for Quantum Information&State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense TechnologyChangsha 410073China

Frequency conversion is pivotal in nonlinear optics and quantum optics for manipulating and translating light signals across different wavelength *** frequency conversion between two light beams with a small frequency interval is a central *** this work,we design a pair of coupled silicon microrings wherein coupled-induced modesplitting exists to achieve a small frequency shift by the process of four-wave mixing Bragg *** an example,the signal can be up or down converted to the idler which is 15.5 GHz spaced when two pumps align with another pair of split *** results unveil the potential of coupled microring resonators for small interval frequency conversion in a high-fidelity,all-optical,and signal processing quantum frequency interface.

关键词： four-wave mixing Bragg scattering silicon coupled microrings

来源：评论

学校读者我要写书评

暂无评论

Layout Decomposition via Boolean Satisfiability

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 1112-1125页

作者： Liu, Hongduo Liao, Peiyu Zou, Mengchuan Pang, Bowen Li, Xijun Yuan, Mingxuan Ho, Tsung-Yi Yu, Bei The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong Hong Kong Huawei Noah's Ark Lab Hong Kong Hong Kong Institute of Software Chinese Academy of Sciences State Key Laboratory of Computer Science Beijing100190 China

Multiple patterning lithography (MPL) has been introduced in the integrated circuits manufacturing industry to enhance feature density as the technology node advances. A crucial step of MPL is assigning layout features to different masks, namely layout decomposition. Exact algorithms like integer linear programming (ILP) can solve layout decomposition to optimality but lack scalability for dense patterns. Relaxation algorithms (e.g., linear programming and semi-definite programming) and heuristics (e.g., exact cover) are capable of handling large cases at the cost of inferior solution quality. These methods rely on different mathematical solvers and expert-designed heuristics to offer a balance between solution quality and computational efficiency. In this article, we propose a unified layout decomposition framework comprising three algorithms: 1) satisfiability (SAT)-exact;2) SAT-bilevel;and 3) SAT-fast, all leveraging the capabilities of Boolean SAT solvers. The SAT-exact ensures optimality, but with faster convergence than ILP, SAT-bilevel addresses the decomposition as a bilevel optimization problem for rapid near-optimal solutions, and SAT-fast handles very large layouts in an incremental manner. Experimental results demonstrate our framework's superiority over existing state-of-the-art methods in terms of solution quality and runtime. © 2024 IEEE.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Strain-modulated superconductivity of monolayer Tc_(2)B_(2)

引用

Chinese Physics B 2025年第4期34卷 221-227页

作者： Zhengtao Liu Zihan Zhang Hao Song Tian Cui Defang Duan Key Laboratory of Material Simulation Methods&Software of Ministry of Education State Key Laboratory of Superhard MaterialsCollege of PhysicsJilin UniversityChangchun 130012China Institute of High Pressure Physics School of Physical Science and TechnologyNingbo UniversityNingbo 315211China

Two-dimensional(2D)superconductors have attracted significant research interest due to their promising potential applications in optoelectronic and microelectronic ***,we employ first-principles calculations to predicted a new 2D conventional superconductor,Tc_(2)B_(2),demonstrating its stable structural ***,under biaxial strain,the superconducting transition temperature(T_(c))of Tc_(2)B_(2)demonstrates a significant enhancement,achieving 19.5 K under 3%compressive strain and 9.2 K under 11%tensile *** study reveals that strain-induced modifications in Fermi surface topology significantly enhance the Fermi surface nesting effect,which amplifies electron–phonon coupling interactions and consequently elevates ***,the presence of the Lifshitz transition results in a more pronounced rise in Tc under compressive strain compared to tensile *** insights offer important theoretical guidance for designing 2D superconductors with high-Tc through strain modulation.

关键词： two-dimensional superconductivity strain modulation first-principles calculation

来源：评论

学校读者我要写书评

暂无评论

FedMPS: A Robust Differential Privacy Federated Learning based on Local Model Partition and Sparsification for Heterogeneous IIoT Data

引用

IEEE Internet of Things Journal 2025年第10期12卷 13757-13768页

作者： Wang, Danxin Gao, Yuyang Pang, Shanchen Zhang, Chen Zhang, Xiaoman Li, Ming School of Qingdao Institute of Software College of Computer Science and Technology Shandong Key Laboratory of Intelligent Oil and Gas Industrial Software Qingdao China Shandong Inspur Database Technology Co. Ltd Jinan China

In the emerging Industrial Internet of Things (IIoT) applications, Federated Learning (FL) enables model training without the need to transmit raw data directly. Nevertheless, transmitting model parameters could still reveal private information. To further protect local model parameters, Differential Privacy combined with FL (DPFL) has been introduced. Nonetheless, adding noise in DPFL can severely impact model performance, especially in non-independent and identically distributed (non-iid) data scenarios typical of IIoT environments. It is necessary to carefully balance privacy preservation and utility. In this paper, we propose a robust differential privacy Federated learning scheme leveraging local Model Partition and Sparsification (namely, FedMPS) for heterogeneous IIoT scenarios. The local model is divided into a shared part, which is sparsified before adding noise to mitigate its impact, and a private part that remains on the client. We provide a theoretical analysis of the privacy guarantees. Extensive experiments on common datasets, including Fashion-MNIST, CIFAR-10 and CIFAR-100, demonstrate that the proposed approach achieves a better privacy-utility trade-off, with a 10 compared to baseline methods, and performs well especially in non-iid scenarios. © 2025 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：