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

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

来源：评论

学校读者我要写书评

暂无评论

A novel approach to deriving adaboost classifier weights using squared loss function for overlapping speech detection

引用

Multimedia Tools and Applications 2025年 1-28页

作者： Asbai, Nassim Bounazou, Hadjer Zitouni, Sihem Department of Electronics Faculty of Sciences and Technology Mohamed El Bachir El Ibrahimi University Bordj Bou Arreridj City34030 Algeria Speech Com. & Signal Proc. Lab. Faculty of Electrical Engineering USTHB Bab Ezzouar City16111 Algeria Department of Computer Science Faculty of Mathematics and Computer Science Mohamed El Bachir El Ibrahimi University Bordj Bou Arreridj City34030 Algeria

In this paper, we address the complex problem of detecting overlapping speech segments, a key challenge in speech processing with applications in speaker diarization, automatic transcription, and multi-speaker recognition systems. Traditional approaches, often relying on exponential loss functions within the AdaBoost framework, struggle to maintain robustness in noisy or imbalanced data environments. To enhance detection accuracy, we propose a novel AdaBoost variant—SLFAdaBoost—utilizing a squared loss function specifically tailored for overlapping speech detection. This model demonstrates superior stability and convergence, significantly outperforming conventional methods. Experimental evaluation on the NIST 2005 corpus revealed that SLFAdaBoost achieves an accuracy range of 92.5% to 98.6%, with F1 scores between 95.4% and 99.2%, notably surpassing standard AdaBoost and Random Forest classifiers. Additionally, our model shows resilience in noisy conditions, maintaining precision and recall metrics at higher noise levels than other classifiers. These results underscore SLFAdaBoost's capacity to handle intricate data patterns, offering a more robust solution for real-world speech processing applications where overlapping segments are prevalent. This contribution provides an efficient, high-performing model, advancing the capabilities of ensemble methods in complex audio environments. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

XPM: eXplainable Process Mining 3rd

XPM: eXplainable Process Mining

引用

3rd International Conference on Advances in Information and Communication Technology, ICTA 2024

作者： Kim, Kwanghoon Pio CCSRI Kyonggi University Suwon Korea Republic of Data. Process Engineering Research Lab. Div. of AI Computer Science and Engineering Kyonggi University Gyeonggi Suwon16227 Korea Republic of

ISBN: (纸本)9783031809422

This keynote speech is to all intents and purposes introducing a new process mining approach and its implemented system, which are named as eXplainable process mining (XPM) approach and system, respectively. Through the XPM approach, we can selectively amalgamate a group of process event log traces, and through the XPM system, we can ultimately discover a series of complete and safe process models from a process enactment event log dataset. The XPM approach is theoretically based on the typical process modeling methodology of structured information control nets (abbreviated as SICN) and its algorithmic functionality is substantiated by the explainable ρ-Algorithm that is extended from the original ρ-Algorithm [6]. This keynote speech is also explicating the proven process mining algorithm that is able to discover the underlying SICN-oriented process model from a dataset of process enactment event logs and histories. More specifically, the concrete goal of this keynote speech is about an explainable way of discovering the complete structural formation of SICN-oriented process model. Assume that the structural formation is made up of an arbitrary number of combinational building blocks of the primitive process patterns such as linear (sequential), disjunctive (exclusive-OR), conjunctive (parallel-AND), and repetitive (iterative-LOOP) process patterns. Conclusively, it would be emphasized that the XPM approach and system ought to be very effective and well-fitted for managing life-cycles of very large-scale process models deployed in process-aware enterprises and organizations. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Ptychographic characterization of spatiotemporal wavepackets

引用

Optica 2025年第4期12卷 498-504页

作者： Liu, Yuanyuan Xu, Yingming Zhang, Nianjia Liu, Dawei Wei, Lijin Cao, Qian Shi, Junhui Zhan, Qiwen School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai200093 China Zhangjiang Laboratory 100 Haike Road Shanghai201204 China Research Center for Novel Computational Sensing and Intelligent Processing Zhejiang Lab. Hangzhou311100 China College of Mechatronics and Control Engineering Shenzhen University Shenzhen518060 China

Exciting advances in spatiotemporal wavepackets have shown great potential in a range of applications, including particle manipulation, time-resolved imaging, and unique light–matter interactions. In particular, spatiotemporal optical vortice (STOV) pulse beams characterized by a helical phase structure in space and time are a recently emerging type of complex structured ultrashort pulse. However, the high-resolution measurement and manipulation of ultrashort spatiotemporal wavepackets still face major challenges due to their inseparable properties in space and time. In this study, based on spectra-encoded ptychography, we implement a simple, compact, reference-free STOV characterization technique with a temporal resolution of 6 fs and a spatial resolution of 11.05 µm. This technique can be employed to analyze various intricate spatiotemporal structural beams, contributing to the growing field of spatiotemporally engineered ultrafast laser pulse beams. Additionally, as a lensless measurement technique, this characterization method may be extended to other spectral ranges, including the extreme ultraviolet and X-ray domains. © 2025 Optica Publishing Group.

关键词： Wave packets

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Parallel JPEG Pleno Baseline Block-Based Profile Light Field Encoder Using OpenMP

A Parallel JPEG Pleno Baseline Block-Based Profile Light Fie...

引用

IEEE Latin American Symposium on Circuits and Systems (LASCAS)

作者： Ismael Seidel André Filipe da Silva Fernandes José Luis Güntzel Dept. of Computer Science and Statistics (INE) Embedded Computing Lab. (ECL) Computer Science Graduate Program (PPGCC) Federal University of Santa Catarina (UFSC) Florianópolis Brazil

ISBN: (数字)9798331522124

ISBN: (纸本)9798331522131

Light Fields (LFs) are a plenoptic image modality that provides more information on light rays, making them an excellent representation for immersive media. To compress such a modality, the Joint Photographic Experts Group (JPEG) committee created the JPEG Pleno Part 2 standard with two profiles. This work focuses on the reference encoder implementation for the Baseline Block-Based Profile (BBBP), called JPEG Pleno Model (JPLM). Our main contribution lies in the proposal and analysis of a parallel implementation of JPLM using OpenMP. We show that it is possible to accelerate encoding from nearly 2 to 10 times when using 2 to 16 threads, with a memory overhead ranging from 15% up to 78%, depending on the LF size. Moreover, the speedup comes with no cost in terms of coding efficiency, i.e., the LFs encoded with the proposed parallel version are bit-exact matches to ones encoded with the sequential version.

关键词： Costs Instruction sets Transform coding Transforms Encoding Light fields Software Decoding Proposals Standards

来源：评论

学校读者我要写书评

暂无评论

Mock Deep Testing: Toward Separate Development of Data and Models for Deep Learning

arXiv

引用

arXiv 2025年

作者： Manke, Ruchira Wardat, Mohammad Khomh, Foutse Rajan, Hridesh Dept. of Computer Science Tulane University Louisiana United States Dept. of Computer Science and Engineering Oakland University Michigan United States SWAT Lab. Polytechnique Montréal Montréal Canada

While deep learning (DL) has permeated, and become an integral component of many critical software systems, today software engineering research hasn’t explored how to separately test data and models that are integral for DL approaches to work effectively. The main challenge in independently testing these components arises from the tight dependency between data and models. This research explores this gap, introducing our methodology of mock deep testing for unit testing of DL applications. To enable unit testing, we introduce a design paradigm that decomposes the workflow into distinct, manageable components, minimizes sequential dependencies, and modularizes key stages of the DL, including data preparation and model design. For unit testing these components, we propose modeling their dependencies using mocks. In the context of DL, mocks refer to mock data and mock model that mimic the behavior of the original data and model, respectively. This modular approach facilitates independent development and testing of the components, ensuring comprehensive quality assurance throughout the development process. We have developed KUnit, a framework for enabling mock deep testing for the Keras library, a popular library for developing DL applications. We empirically evaluated KUnit to determine the effectiveness of mocks in independently testing data and models. Our assessment of 50 DL programs obtained from Stack Overflow and GitHub shows that mocks effectively identified 10 issues in the data preparation stage and 53 issues in the model design stage. We also conducted a user study with 36 participants using KUnit to perceive the effectiveness of our approach. Participants using KUnit successfully resolved 25 issues in the data preparation stage and 38 issues in the model design stage. Our findings highlight that mock objects provide a lightweight emulation of the dependencies for unit testing, facilitating early bug detection. Lastly, to evaluate the usability of KUnit, we co

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：