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

39th ACM/IEEE International Conference on Automated software Engineering, ASE 2024

作者： Li, Zhilin Ma, Xutong Hu, Mengze Yan, Jun State Key Lab. of Computer Science Ins. of Software CAS University of Chinese Academy of Sciences Beijing China State Key Lab. of Computer Science Ins. of Software CAS Beijing China State Key Lab. of Computer Science Ins. of Software CAS Tech. Center of Software Eng. Ins. of Software CAS University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9798400712487

ISBN: (纸本)9798400712487

Sequence Containers (SC) in the C++ Standard Template Library (STL), such as the vector, are widely used in large-scale projects for their maintainability and flexibility. However, accessing the elements in an SC is bug-prone, as such operations will not check their boundaries during compilation or execution, which can lead to memory errors, such as buffer overflow problems. And these bugs are difficult to detect with availab.e static analyzers, since the size of SCs and the target of iterators cannot be precisely tracked without accurate analysis of the behavior of SCs and *** address this problem, we propose a combined model of SC sizes and iterator targets by tracking them simultaneously through a set of meta-operations extracted from corresponding method calls, and report improper operation usages according to three bug patterns. We implement the approach as a static analyzer, Scasa, on the top of the Clang Static Analyzer (CSA) framework, and evaluate its effectiveness and efficiency against.CSA and other state-of-the-art static analyzers on a benchmark composed of 2,230 manually created code snippets and eight popular open-source C++ projects with a lot of SC usages. The experimental results reveal that Scasa effectively identifies nearly all inherent bugs within the manual code snippets and generates 125 reports for these projects (with a time loss of 5 - 85%) where 72 of them are marked as correct with a manual revision. And to further confirm these correct reports, we also select some important ones for developers. These results show that accessing elements of SCs is bug-prone, and cooperatively tracking SC sizes and iterator targets can accurately detect these bugs with acceptable overhead. Copyright held by the owner/author(s).

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

FIFAWC:a dataset with detailed annotation and rich semantics for group activity recognition

引用

Frontiers of computer science 2024年第6期18卷 271-272页

作者： Duoxuan PEI Di HUANG Yunhong WANG State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Intelligent Recognition and Image Processing Lab. School of Computer Science and EngineeringBeihang UniversityBeijing 100191China

1 *** Activity Recognition(GAR),which aims to identify activities performed collectively in videos,has gained significant attention *** conventional action recognition centered on single individuals,GAR explores the c... 详细信息

关键词： has collective gained

来源：评论

学校读者我要写书评

暂无评论

Crowd2: Multi-agent Bandit-based Dispatch for Video Analytics upon Crowdsourcing 42

Crowd2: Multi-agent Bandit-based Dispatch for Video Analytic...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Chen, Yu Zhang, Sheng Yan, Yuting Jin, Yibo Chen, Ning Ji, Mingtao Xiao, Mingjun Nanjing University State Key Lab. for Novel Software Technology China University of Science and Technology of China School of Computer Science and Technology China

ISBN: (纸本)9798350334142

Many crowdsourcing platforms are emerging, leveraging the resources of recruited workers to execute various outsourcing tasks, mainly for those computing-intensive video analytics with high quality requirements. Although the profit of each platform is strongly related to the quality of analytics feedback, due to the uncertainty on diverse performance of workers and the conflicts of interest over platforms, it is non-trivial to determine the dispatch of tasks with maximum benefits. In this paper, we design a decentralized mechanism for a Crowd of Crowdsourcing platforms, denoted as Crowd2, optimizing the worker selection to maximize the social welfare of these platforms in a long-term scope, under the consideration of both proportional fairness and dynamic flexibility. Concretely, we propose a video analytics dispatch algorithm based on multi-agent bandit, for which the more accurate profit estimates are attained via the decoupling of multi-knapsack based mapping problem. Via rigorous proofs, a sub-linear regret bound for social welfare of crowdsourcing profits is achieved while both fairness and flexibility are ensured. Extensive trace-driven experiments demonstrate that Crowd2 improves the social welfare by 36.8%, compared with other alternatives. © 2023 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

Formally Verified C Code Generation from Hybrid Communicating Sequential Processes

arXiv

引用

arXiv 2024年

作者： Wang, Shuling Ji, Zekun Zhan, Bohua Xu, Xiong Gao, Qiang Zhan, Naijun State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

Hybrid Communicating Sequential Processes (HCSP) is a formal model for hybrid systems, including primitives for evolution along an ordinary differential equation (ODE), communication, and parallel composition. Code generation is needed to convert HCSP models into code that can be executed in practice, and the correctness of this conversion is essential to ensure that the generated code accurately reflects the formal model. In this paper, we propose a code generation algorithm from HCSP to C with POSIX library for concurrency. The main difficulties include how to bridge the gap between the synchronized communication model in HCSP and the use of mutexes for synchronization in C, and how to discretize evolution along ODEs and support interrupt of ODE evolution by communication. To prove the correctness of code generation, we define a formal semantics for POSIX C, and build transition system models for both HCSP and C programs. We then define an approximate bisimulation relation between traces of transition systems, and show that under certain robustness conditions for HCSP, the generated C program is approximately bisimilar to the original model. Finally, we evaluate the code generation algorithm on a detailed model for automatic cruise control, showing its utility on real-world examples. Copyright © 2024, The Authors. All rights reserved.

关键词： Hybrid systems

来源：评论

学校读者我要写书评

暂无评论

Disentangled Hypergraph Collab.rative Filtering for Social Recommendation

Disentangled Hypergraph Collaborative Filtering for Social R...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Liu, Xiao Meng, Shunmei Li, Qianmu Xu, Xiaolong Qi, Lianyong Dou, Wanchun Zhang, Jing Zhang, Xuyun Nanjing University of Science and Technology China Nanjing University State Key Lab. for Novel Software Technology China Nanjing University of Information Science and Technology School of Computer and Software China College of Computer Science and Technology China Southeast University School of Cyber Science and Engineering China Macquarie University School of Computing Australia

ISBN: (纸本)9798350304855

In the current era of information overload, service recommendations have emerged as a valuable tool for enhancing the user experience. Among them, social recommendation models have shown promising results by incorporating social relationships to improve representation learning. However, most of these models lack fine-grained modeling of social user behavior, leading to a unified representation of users and a loss of expressiveness in user representations. To address this issue, we propose DisenHGCF, a new social recommendation approach based on disentangled hypergraph collab.rative filtering, to disentangle the representations of users and items at the granularity of social users' intents. This approach aims to provide a more nuanced understanding of the user, leading to more accurate and personalized recommendations. To be specific, DisenHGCF leverages hypergraphs to represent the complex relationships among users, friends, and items. By using the hypergraph disentangling module based on attention, it is able to disentangle the user's intents and generate users representations in cooperating their intents for recommendation tasks. Additionally, a contrastive learning task based on intent-weight perturbation is designed to enhance representational learning. The experimental results obtained from the BeiBei and Beidian datasets demonstrate the superiority of our proposed approach in comparison to previous baseline methods, as evidenced by higher Recall and NDCG scores. © 2023 IEEE.

关键词： Collab.rative filtering

来源：评论

学校读者我要写书评

暂无评论

Reach-avoid Controllers Synthesis for Safety Critical Systems

arXiv

引用

arXiv 2023年

作者： Xue, Bai State Key Lab. of Computer Science Institute of Software Cas Beijing China

In this paper we propose sufficient conditions to synthesizing reach-avoid controllers for deterministic systems modelled by ordinary differential equations and stochastic systems modeled by stochastic differential equations based on the notion of control guidance-barrier functions. We begin with considering deterministic systems. Given an open safe set, a target set and a nominal controller, we attempt to synthesize a reach-avoid controller, which modifies the nominal controller in a minimal way enforcing the reach-avoid objective, i.e., the system will enter the target set eventually while staying inside the safe set before the first target hitting time. Three control guidance-barrier functions are developed and three corresponding conditions for synthesizing reach-avoid controllers are constructed, which get progressively weaker and thus facilitate the optimal controller design. The first and second ones are termed exponential and asymptotic control guidance-barrier functions, which guarantee that every trajectory starting from the safe set will enter the target set respectively at an exponential rate and in an asymptotic way. However, it is observed that these two control guidance-barrier functions have one condition in common of enforcing invariance of its every positive sublevel set until the system enters the target set, which is strict and thus limits the space of admissible controllers. Consequently, a lax control guidance-barrier function is further developed such that only the safe set set is an invariance before the system enters the target set, expanding the space of admissible control inputs. Then, we extend the methodologies for deterministic systems to stochastic systems, which synthesize reach-avoid controllers in the probabilistic setting. Finally, several numerical examples demonstrate the performance of proposed methods. Copyright © 2023, The Authors. All rights reserved.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

On Efficient Packet Batching and Resource Allocation for GPU based NFV Acceleration 31

On Efficient Packet Batching and Resource Allocation for GPU...

引用

31st IEEE/ACM International Symposium on Quality of Service, IWQoS 2023

作者： Zeng, Deze Zhu, Andong Gu, Lin Chen, Quan Guo, Minyi School of Computer Science China University of Geosciences Hubei Wuhan China Nanjing University State Key Lab. for Novel Software Technology Nanjing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai China

ISBN: (纸本)9798350399738

Network Function Virtualization (NFV) has already become an essential technology for improving the scalab.lity and flexibility of modern computer networks. The performance gap has become the main issue that impedes the development of NFV. GPUs, with massive parallel processors, are advocated to accelerate the Virtualized Network Functions (VNFs). However, the special architecture and workflow of GPUs introduce new challenges, especially on the batched processing, and resource allocation. In this paper, we propose GPU-based NFV Acceleration framework (GNFA) with an efficient packet batching and resource allocation solution. Considering the increased latency caused by the accumulation of the GPU kernel invoking overhead, we first invent a latency reduction mechanism called SM Performance Compensation (SPC). A Partition and Adjustment based Batching and Resource Allocation (PABARA) algorithm that jointly considers batch size tuning and GPU thread allocation is also proposed. We have practically implemented GNFA and extensively evaluated its performance on some well-known VNFs. The experiment results show that GNFA can effectively promote the GPU resource utilization and improve the NFV performance in terms of per-packet latency. © 2023 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Compression of enumerations and gain

arXiv

引用

arXiv 2023年

作者： Barmpalias, George Zhang, Xiaoyan Zhan, Bohua State Key Lab of Computer Science Inst. of Software Chinese Acad. of Sciences Beijing China

We study the compressibility of enumerations, and its role in the relative Kolmogorov complexity of computably enumerable sets, with respect to density. With respect to a strong and a weak form of compression, we examine the gain: the amount of auxiliary information embedded in the compressed enumeration. Strong compression and weak gainless compression is shown for any computably enumerable set, and a positional game is studied toward understanding strong gainless compression. Copyright © 2023, The Authors. All rights reserved.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

Compression of Enumerations and Gain

SSRN

引用

SSRN 2023年

作者： Barmpalias, George Zhang, Xiaoyan Zhan, Bohua State Key Lab of Computer Science Inst. of Software Chinese Acad. of Sciences Beijing China

We study the compressibility of enumerations, and its role in the relative Kolmogorov complexity of computably enumerable sets, with respect to density. With repspect to a strong and a weak form of compression, we examine the gain: the amount of auxiliary information embedded in the compressed enumeration. Strong compression and weak gainless compression is shown for any computably enumerable set, and a positional game is studied toward understanding strong gainless compression. © 2023, The Authors. All rights reserved.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

Detecting Exception Handling Bugs in C++ Programs 23

Detecting Exception Handling Bugs in C++ Programs

引用

45th IEEE/ACM International Conference on software Engineering, ICSE 2023

作者： Zhang, Hao Luo, Ji Hu, Mengze Yan, Jun Zhang, Jian Qiu, Zongyan Institute of Software Cas China Univ. of Chinese Academy of Sciences State Key Lab. of Computer Science Beijing China Univ. of Chinese Academy of Sciences Tech. Center of Softw. Eng. Beijing China Hangzhou Institute for Advanced Study Univ. of Chinese Academy of Sciences State Key Lab. of Computer Science Beijing China School of Mathematical Sciences Peking University Beijing China

ISBN: (纸本)9781665457019

Exception handling is a mechanism in modern programming languages. Studies have shown that the exception handling code is error-prone. However, there is still limited research on detecting exception handling bugs, especially for C++ programs. To tackle the issue, we try to precisely represent the exception control flow in C++ programs and propose an analysis method that makes use of the control flow to detect such bugs. More specifically, we first extend control flow graph by introducing the concepts of five different kinds of basic blocks, and then modify the classic symbolic execution framework by extending the program state to a quadruple and properly processing try, throw and catch statements. Based on the above techniques, we develop a static analysis tool on the top of Clang Static Analyzer to detect exception handling bugs. We run our tool on projects with high stars from GitHub and find 36 exception handling bugs in 8 projects, with a precision of 84%. We compare our tool with four state-of-the-art static analysis tools (Cppcheck, Clang Static Analyzer, Facebook Infer and IKOS) on projects from GitHub and handmade benchmarks. On the GitHub projects, other tools are not able to detect any exception handling bugs found by our tool. On the handmade benchmarks, our tool has a significant higher recall. © 2023 IEEE.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：