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

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

来源：评论

学校读者我要写书评

暂无评论

Improving prompt tuning-based software vulnerability assessment by fusing source code and vulnerability description

引用

Automated software Engineering 2025年第2期32卷 1-29页

作者： Wang, Jiyu Chen, Xiang Pei, Wenlong Yang, Shaoyu School of Artificial Intelligence and Computer Science Nantong University Jiangsu Nantong China State Key Lab. for Novel Software Technology Nanjing University Jiangsu Nanjing China

To effectively allocate resources for vulnerability remediation, it is crucial to prioritize vulnerability fixes based on vulnerability severity. With the increasingnumber of vulnerabilities in recent years, there is an urgent need for automated methods for software vulnerability assessment (SVA). Most of the previous SVA studies mainly rely on traditional machine learning methods. Recently, fine-tuning pre-trained language models has emerged as an intuitive method for improving performance. However, there is a gap between pre-training and fine-tuning, and their performance heavily depends on the dataset’s quality of the downstream task. Therefore, we propose a prompt tuning-based method PT-SVA. Different from the fine-tuning paradigm, the prompt-tuning paradigm involves adding prompts to make the training process similar to pre-training, thereby better adapting to downstream tasks. Moreover, previous research aimed to automatically predict severity by only analyzing either the vulnerability descriptions or the source code of the vulnerability. Therefore, we further consider both types of vulnerability information for designing hybrid prompts (i.e., a combination of hard and soft prompts). To evaluate PT-SVA, we construct the SVA dataset based on the CVSS V3 standard, while previous SVA studies only consider the CVSS V2 standard. Experimental results show that PT-SVA outperforms ten state-of-the-art SVA baselines, such as by 13.7% to 42.1% in terms of MCC. Finally, our ablation experiments confirm the effectiveness of PT-SVA’s design, specifically in replacing fine-tuning with prompt tuning, incorporating both types of vulnerability information, and adopting hybrid prompts. Our promising results indicate that prompt tuning-based SVA is a promising direction and needs more follow-up studies. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Bi-modal information Hybrid prompt Pre-trained language model Prompt tuning software vulnerability assessment

来源：评论

学校读者我要写书评

暂无评论

Characterizing the app recommendation relationships in the iOS app store: a complex network's perspective

引用

science China(Information sciences) 2025年第4期68卷 284-299页

作者： Gang HUANG Fuqi LIN Yun MA Haoyu WANG Qingxiang WANG Gareth TYSON Xuanzhe LIU Key Lab of High Confidence Software Technologies (Peking University) Ministry of Education School of Computer Science Peking University Institute for Artificial Intelligence Peking University School of Cyber Science and Engineering Huazhong University of Science and Technology Alibaba Group Hong Kong University of Science and Technology (Guangzhou)

Mobile apps have become widely adopted in our daily lives. To facilitate app discovery, most app markets provide recommendations for users, which may significantly impact how apps are accessed. However, little has been known about the underlying relationships and how they reflect(or affect) user behaviors. To fill this gap, we characterize the app recommendation relationships in the i OS app store from the perspective of the complex network. We collect a dataset containing over 1.3 million apps and 50 million app recommendations. This dataset enables us to construct a complex network that captures app recommendation relationships. Through this, we explore the recommendation relationships between mobile apps and how these relationships reflect or affect user behavior patterns. The insights gained from our research can be valuable for understanding typical user behaviors and identifying potential policy-violating apps.

关键词： mobile app recommendation complex network user behavior policy-violating app

来源：评论

学校读者我要写书评

暂无评论

A sharding blockchain-based UAV system for search and rescue missions

引用

Frontiers of computer science 2025年第3期19卷 103-118页

作者： Xihan ZHANG Jiashuo ZHANG Jianbo GAO Libin XIA Zhi GUAN Hao HU Zhong CHEN School of Computer Science Peking UniversityBeijing 100871China Peking University Chongqing Research Institute of Big Data Chongqing 401329China National Engineering Research Center for Software Engineering Peking UniversityBeijing 100871China State Key Lab for Novel Software Technology Nanjing UniversityNanjing 210023China

Sharding is a promising technique to tackle the critical weakness of scalab.lity in blockchain-based unmanned aerial vehicle(UAV)search and rescue(SAR)*** breaking up the blockchain network into smaller partitions called shards that run independently and in parallel,shardingbased UAV systems can support a large number of search and rescue UAVs with improved scalab.lity,thereby enhancing the rescue ***,the lack of adaptability and interoperability still hinder the application of sharded blockchain in UAV SAR *** refers to making adjustments to the blockchain towards real-time surrounding situations,while interoperability refers to making cross-shard interactions at the mission *** address the above challenges,we propose a blockchain UAV system for SAR missions based on dynamic sharding *** from the benefits in scalab.lity brought by sharding,our system improves adaptability by dynamically creating configurable and mission-exclusive shards,and improves interoperability by supporting calls between smart contracts that are deployed on different *** implement a prototype of our system based on Quorum,give an analysis of the improved adaptability and interoperability,and conduct experiments to evaluate the *** results show our system can achieve the above goals and overcome the weakness of blockchain-based UAV systems in SAR scenarios.

关键词： blockchain sharding unmanned aerial vehicle search and rescue blockchain interoperability

来源：评论

学校读者我要写书评

暂无评论

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 scalab.lity 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

来源：评论

学校读者我要写书评

暂无评论

PathActMarker:an R package for inferring pathway activity of complex diseases

引用

Frontiers of computer science 2025年第3期19卷 123-124页

作者： Xingyi LI Jun HAO Zhelin ZHAO Junming LI Xingyu LIAO Min LI Xuequn SHANG School of Computer Science Northwestern Polytechnical UniversityXi’an 710072China Research&Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen 518063China School of Software Northwestern Polytechnical UniversityXi’an 710072China Hunan Provincial Key Lab on Bioinformatics School of Computer Science and EngineeringCentral South UniversityChangsha 410083China

1 Introduction The process of complex diseases is closely linked to the disruption of key biological pathways,it is crucial to identify the dysfunctional pathways and quantify the degree of dysregulation at the indivi... 详细信息

关键词： pathway activity dysregulation complex diseases biological pathways disruption key biological pathwaysit identify dysfunctional pathways

来源：评论

学校读者我要写书评

暂无评论

SACM: spatial attributes of complex movements in multi-object tracking

引用

Multimedia Tools and Applications 2025年 1-20页

作者： Li, Hongjun Li, Jiaxin Sun, Xiaohu School of Information Science and Technology Nantong University Jiangsu Nantong226019 China State Key Lab. for Novel Software Technology Nanjing University Jiangsu Nantong210023 China Nantong Research Institute for Advanced Communication Technologies Jiangsu Nantong226019 China

Multi-object tracking is a crucial task in computer vision, but it faces significant challenges due to complex scenes and interactions between tracked objects. To address these challenges, we propose a complex movement-based spatial attribute tracking model (SACM). First, to enhance target detection, the model extracts both global and local features from the input feature maps to capture detailed spatial location information between different targets. Second, to strengthen the positional association of the same target across consecutive frames, position information from the previous frame is incorporated into the current frame, improving occlusion handling. Finally, a new target matching method is developed within the tracker, leveraging spatial relationships among targets to achieve precise matching of overlapping objects. Experimental results show that, compared to FairMOT, SACM achieves a 3.7% improvement in HOTA and a 4.8% improvement in IDF1 on the DanceTrack dataset. On the MOT17 dataset, SACM also improves HOTA by 3.7% and IDF1 by 4.8%. Furthermore, SACM achieves a processing speed of 30.5 FPS on a single GPU, resulting in improved tracking performance. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

CLIMS++: Cross Language Image Matching with Automatic Context Discovery for Weakly Supervised Semantic Segmentation

引用

International Journal of computer Vision 2025年 1-20页

作者： Xie, Jinheng Deng, Songhe Hou, Xianxu Luo, Zhaochuan Shen, Linlin Huang, Yawen Zheng, Yefeng Shou, Mike Zheng Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Computer Science Wenzhou-Kean University Wenzhou325060 China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Show Lab National University of Singapore Singapore639798 Singapore School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University Suzhou215400 China Jarvis Research Center Tencent YouTu Lab Shenzhen518703 China

While promising results have been achieved in weakly-supervised semantic segmentation (WSSS), limited supervision from image-level tags inevitably induces discriminative reliance and spurious relations between target classes and background regions. Thus, Class Activation Map (CAM) usually tends to activate discriminative object regions and falsely includes lots of class-related backgrounds. Without pixel-level supervisions, it could be very difficult to enlarge the foreground activation and suppress those false activation of background regions. In this paper, we propose a novel framework of Cross Language Image Matching with Automatic Context Discovery (CLIMS++), based on the recently introduced Contrastive Language-Image Pre-training (CLIP) model, for WSSS. The core idea of our framework is to introduce natural language supervision to activate more complete object regions and suppress class-related background regions in CAM. In particular, we design object, background region, and text lab.l matching losses to guide the model to excite more reasonable object regions of each category. In addition, we propose to automatically find spurious relations between foreground categories and backgrounds, through which a background suppression loss is designed to suppress the activation of class-related backgrounds. The above designs enable the proposed CLIMS++ to generate a more complete and compact activation map for the target objects. Extensive experiments on PASCAL VOC 2012 and MS COCO 2014 datasets show that our CLIMS++ significantly outperforms the previous state-of-the-art methods. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

ESA: Example Sieve Approach for Multi-Positive and Unlab.led Learning 25

ESA: Example Sieve Approach for Multi-Positive and Unlabeled...

引用

18th ACM International Conference on Web Search and Data Mining, WSDM 2025

作者： Li, Zhongnian Wei, Meng Ying, Peng Xu, Xinzheng School of Computer Science and Technology China University of Mining and Technology Xuzhou China Mine Digitization Engineering Research Center of the Ministry of Education Xuzhou China State Key Lab. for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9798400713293

Learning from Multi-Positive and Unlab.led (MPU) data has gradually attracted significant attention from practical applications. Unfortunately, the risk of MPU also suffer from the shift of minimum risk, particularly when the models are very flexible as shown in Fig.1. In this paper, to alleviate the shifting of minimum risk problem, we propose an Example Sieve Approach (ESA) to select examples for training a multi-class classifier. Specifically, we sieve out some examples by utilizing the Certain Loss (CL) value of each example in the training stage and analyze the consistency of the proposed risk estimator. Besides, we show that the estimation error of proposed ESA obtains the optimal parametric convergence rate. Extensive experiments on various real-world datasets show the proposed approach outperforms previous methods. Source code is availab.e at https://***/WilsonMqz/ESA. © 2025 Copyright held by the owner/author(s).

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Collision-resistant hash-shuffles on the reals

arXiv

引用

arXiv 2025年

作者： Barmpalias, George Zhang, Xiaoyan State Key Lab of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

Oneway real functions are effective maps on positive-measure sets of reals that preserve randomness and have no effective probabilistic inversions. We construct a oneway real function which is collision-resistant: the probability of effectively producing distinct reals with the same image is zero, and each real has uncountable inverse image. Copyright © 2025, The Authors. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：