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

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

来源：评论

学校读者我要写书评

暂无评论

Exploring the Feasibility and Challenges of Treating Follow-up Patients via a Mobile Platform in China

引用

Proceedings of the ACM on Human-computer Interaction 2025年第2期9卷 1-31页

作者： Fu, Jiaojiao Zhou, Yangfan Wang, Xin Guo, Yi School of Information Science and Engineering East China University of Science and Technology School of Computer Science Fudan University China School of Computer Science Fudan University China Shanghai Key Lab. of Intelligent Information Processing China

Mobile technology is being increasingly adopted in teleconsultation for its convenience and mobility. Although widely accepted by physicians for informal online consultations, the effectiveness of mobile platforms in formal medical interventions, such as follow-up treatments, remains largely underexplored. This research presents a case study from a Chinese hospital, examining how physicians use mobile platforms to treat chronic patients, the challenges they encounter, and their overall experience. The study aims to determine whether mobile technology can enable physicians to fulfill their responsibilities in managing chronic disease follow-ups online. Through observations and interviews, we found that using mobile platforms introduces significant challenges. Physicians operate in complex and varying environments, such as workplaces, homes, and even public areas, making them struggle to access comprehensive information, communicate effectively, and maintain detailed medical records. As a result, physicians face poor working conditions, reduced efficiency, and struggle to make accurate treatment decisions. This study highlights the need for policy reforms and technological innovations to ensure sustainable teleconsultation practices on mobile platforms. It contributes to the HCI and CSCW communities by highlighting the feasibility of using mobile platforms in online chronic disease follow-ups. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： mHealth

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Poster Abstract: IMU-assisted Image Stitching for Scenes with Obstructions Based on Camera Motion Sensing 25

Poster Abstract: IMU-assisted Image Stitching for Scenes wit...

引用

Proceedings of the 23rd ACM Conference on Embedded Networked Sensor Systems

作者： Saibing Han Yanling Bu Yanchao Zhao Lei Xie College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China State Key Lab. for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9798400714795

Image stitching is often affected by obstructions such as pedestrians and vehicles. Traditional methods often ignore obstructions or retain them, leading to artifacts. They also cause edge distortion due to fixed-perspective stitching. To address above issues, this poster presents IIS, an IMU-assisted Image Stitching method. It uses IMU data for perspective pre-alignment, projecting images to an intermediate perspective to reduce edge distortion. It simultaneously removes obstructions and mitigating their impact. A weighted target scene stitching strategy is integrated to further enhance stitching quality. IIS effectively reduces artifacts and maintains high computational efficiency.

关键词： image stitching

来源：评论

学校读者我要写书评

暂无评论

Automated Clinical Summary Generation via Integrating Structured and Unstructured Data 12th

Automated Clinical Summary Generation via Integrating Struct...

引用

12th CCF Conference on BigData, BigData 2024

作者： Fu, Jiaojiao Yang, Bowen Guo, Yi Zhou, Yangfan Wang, Xin School of Information Science and Engineering East China University of Science and Technology Shanghai China Shanghai Key Lab. of Intelligent Information Processing Fudan University Shanghai China School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9789819610235

Automatically generating clinical texts can significantly reduce the time physicians spend on clinical data recording, which is particularly important for developing countries where physicians are extremely busy due to a severe shortage. This work automatically generates discharge summaries as a case to explore the methods and feasibilities of automatic clinical text summarization. Existing work typically uses either structured or unstructured data alone to generate discharge summaries. However, the content generated often has issues such as being overly verbose, lacking focus, or omitting significant information, especially key indicators and medications. This work innovatively proposes a data integration-based clinical text generation approach, using content generated from unstructured clinical data as the basis and supplementing it with text generated from structured clinical data. This study utilizes advanced natural language processing algorithms and models to create clinical texts. It addresses the challenges of lacking datasets suitable for fine-tuning pre-trained models and combining the advantages rather than the disadvantages of both types to produce discharge summaries. Experimental results show that the structured supplementation approach can effectively improve the generation of clinical texts. This work demonstrates that clinical texts generated using existing natural language processing technologies still do not meet the demands of medical practice, pointing out the need to develop further text generation technologies tailored to the characteristics of clinical data. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

The NeRF Signature: Codebook-Aided Watermarking for Neural Radiance Fields

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第6期47卷 4652-4667页

作者： Ziyuan Luo Anderson Rocha Boxin Shi Qing Guo Haoliang Li Renjie Wan Department of Computer Science Hong Kong Baptist University Hong Kong SAR China Artificial Intelligence Lab. Recod.ai Institute of Computing University of Campinas Campinas Brazil State Key Laboratory of Multimedia Information Processing and National Engineering Research Center of Visual Technology School of Computer Science Peking University Beijing China IHPC and CFAR Agency for Science Technology and Research (A*STAR) Singapore Department of Electrical Engineering City University of Hong Kong Kowloon Hong Kong

Neural Radiance Fields (NeRF) have been gaining attention as a significant form of 3D content representation. With the proliferation of NeRF-based creations, the need for copyright protection has emerged as a critical issue. Although some approaches have been proposed to embed digital watermarks into NeRF, they often neglect essential model-level considerations and incur substantial time overheads, resulting in reduced imperceptibility and robustness, along with user inconvenience. In this paper, we extend the previous criteria for image watermarking to the model level and propose NeRF Signature, a novel watermarking method for NeRF. We employ a Codebook-aided Signature Embedding (CSE) that does not alter the model structure, thereby maintaining imperceptibility and enhancing robustness at the model level. Furthermore, after optimization, any desired signatures can be embedded through the CSE, and no fine-tuning is required when NeRF owners want to use new binary signatures. Then, we introduce a joint pose-patch encryption watermarking strategy to hide signatures into patches rendered from a specific viewpoint for higher robustness. In addition, we explore a Complexity-Aware key Selection (CAKS) scheme to embed signatures in high visual complexity patches to enhance imperceptibility. The experimental results demonstrate that our method outperforms other baseline methods in terms of imperceptibility and robustness.

关键词： Neural radiance field Watermarking Three-dimensional displays Training Robustness Pipelines Computational modeling Visualization Solid modeling Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Toward Covert and Reliable Communication for Anti-eavesdropping Transmission in V2X Networks

引用

IEEE Transactions on Wireless Communications 2025年

作者： Xu, Rui Li, Gaolei Wu, Jun Li, Jianhua Zhao, Yue Liu, Yuchen Chen, Mingzhe Shanghai Jiao Tong University School of Electronic Information and Electrical Engineering Shanghai200030 China Xidian University State Key Lab. of ISN School of Telecommunication Engineering Shaanxi 710071 China North Carolina State University Department of Computer Science Raleigh27607 United States University of Miami Department of Electrical and Computer Engineering Coral Gables33156 United States

The integration of covert communication in vehicle-to-everything (V2X) network has recently shown great potential to improve efficiency and reliability of data transmission under adversarial eavesdropping scenarios. In this paper, we propose a covert and reliable communication (CRC) framework for V2X networks, where the legitimate transmitter (Alice) attempts to communicate with a mobile receiver (Bob) in the presence of the location uncertainties of the eavesdropper (Willie). Specifically, the Bob adjusts the artificial noise power and position dynamically to communicate with Alice aided by full duplex antenna. In this context, we derive two key performance indicators of covert communication, namely the detection error probability and the effect covert throughput (ECT). Subsequently, we consider the worst case of CRC in the presence of single uncertain Willie, and derive the approximate maximum ECT expression by two-stage robust optimization. Building on this foundation, for more complex CRC scenario with multi uncertain Willies exist, we propose a deep reinforcement learning-empowered adaptation (DRLA) algorithm to maximize accumulated ECT. Extensive experiments compared to benchmarks (including stochastic selection, TD3 and DDPG) demonstrate the superiority of CRC. Specially, the designated DRLA algorithm not only can achieve a higher accumulated ECT but also can converge quickly compared with the benchmark schemes. © 2002-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Congestion Control Method for Campus Opportunity Network Based on Ant Colony Algorithm

引用

Chinese Journal of Electronics 2025年第2期34卷 576-585页

作者： Li, Peng Cao, Yumei Jia, Huan Wang, Xiaoming Wu, Xiaojun School of Computer Science Shaanxi Normal University Xi an710119 China Key Lab. of Intelligent Comp. and Service Technology for Folk Song Ministry of Culture and Tourism Xi'an710119 China Key Laboratory of Modern Teaching Technology Ministry of Education Xi'an710062 China Engineering Laboratory of Teaching Information Technology of Shaanxi Province Xi'an710119 China Xi'an Key Laboratory of Cultural Tourism Resources Development and Utilization Xi'an710062 China

Due to the limited storage resources of portable devices, congestion control has become a hot direction in opportunity networks. To address the issue of heavy loads on certain nodes, which can impact routing efficiency and overall network performance, this paper proposes a load-balancing opportunity routing algorithm based on ant colony optimization (LBOR) in a campus environment. The congestion status is represented by the ratio of message drop receptions within a certain period and the occupancy of the cache. Path selection is based on the concentration of pheromones and the pheromones on the path are updated when a data transmission is completed. In the event of congestion, the algorithm prevents a large amount of data from entering the node and unloads the data to other nodes, even if they are not the optimal relay nodes. Experimental results demonstrate that the proposed algorithm effectively improves data transmission success rates, reduces network loads, and decreases the number of packet losses, especially under low latency conditions. © 2015 Chinese Institute of Electronics.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Fairness-Aware Incentive Mechanism for Multi-Server Federated Learning in Edge-Enabled Wireless Networks with Differential Privacy

引用

IEEE Transactions on Mobile Computing 2025年

作者： Yang, Yu Peng, Kai Wang, Shangguang Xu, Xiaolong Xiao, Peiyun Leung, Victor C.M Huaqiao University College of Engineering Quanzhou362021 China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Nanjing University of Information Science and Technology School of Software Nanjing China Nanjing University State Key Lab. for Novel Software Technology Nanjing210093 China Shenzhen University College of the Computer Science and Software Engineering Shenzhen518060 China University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada

As a distributed machine learning method, federated learning (FL) can collab.ratively train a global model with multiple devices without sharing the original data, thus protecting certain privacy. However, due to the strong heterogeneity of edge nodes (ENs) participating in FL, the quality of data uploaded to the parameter server (PS) varies significantly. Without an appropriate incentive mechanism, low-quality contributors may receive disproportionately high rewards, while high-quality contributors may lack sufficient motivation, leading to inefficient participation and suboptimal global model performance. Consequently, it is critical to develop an effective incentive mechanism to promote fairness for the FL process. To address the issues of existing FL incentive mechanisms lacking privacy protection performance analysis, we propose a fairness-aware incentive mechanism for multi-server FL in edge-enabled wireless differential privacy (DP) networks. Specifically, the wireless channel noise is used to provide DP protection for the local model gradients uploaded by ENs. Next, the interaction between the PSs and ENs is modeled as a Stackelberg game. Furthermore, we solve the Stackelberg game process using backward induction and theoretically propose optimal strategies for both the PSs and ENs. Finally, extensive numerical simulations using real datasets demonstrate the superior performance of our theoretical analysis of the proposed scheme. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：