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

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

来源：评论

学校读者我要写书评

暂无评论

A Code Completion Approach Combining Pointer Network and Transformer-XL Network 19th

A Code Completion Approach Combining Pointer Network and Tr...

引用

19th EAI International Conference on Collab.rative Computing: Networking, Applications and Worksharing, Collab.rateCom 2023

作者： Zhang, Xiangping Liu, Jianxun Long, Teng Hu, Haize School of Computer Science and Engineering Hunan University of Science and Technology Hunan Xiangtan411100 China Hunan Key Lab. for Services Computing and Novel Software Technology Hunan University of Science and Technology Hunan Xiangtan411100 China

ISBN: (纸本)9783031545207

Code completion is an integral component of modern integrated development environments, as it not only facilitates the software development process but also enhances the quality of software products. By leveraging large-scale codes to learn the probability distribution among code token units, deep learning methods have demonstrated significant improvements in the accuracy of token unit recommendations. However, the effectiveness of code completion with deep learning techniques is hindered by information loss. To alleviate the above problem, we proposed a code language model which combines the pointer network and Transformer-XL network to overcome the limitations of existing approaches in code completion. The proposed model takes as input the original code fragment and its corresponding abstract syntax tree and leverages the Transformer-XL model as the basis model for capturing long-term dependencies. Furthermore, we integrate a pointer network as a local component to predict the out-of-vocabulary words. The proposed method is evaluated on real PY150 and JS150 datasets. The comparative experimental results demonstrate the effectiveness of our model in improving the accuracy of the code completion task at the token unit level. © ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Towards Dynamic Evolutionary Analysis of ProgrammableWeb for API-Mashup Ecosystem 26

Towards Dynamic Evolutionary Analysis of ProgrammableWeb for...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wang, Yang Xiang, Jiayan Cheng, Hangyu Chen, Wanjun Xiao, Yong Kang, Guosheng Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Hnust Xiangtan China

ISBN: (纸本)9798350331684

With the wide adoption of Web APIs released on Internet, users tend to reuse them for business requirements or software development. Mashup is a useful technology for composing Web APIs into a new and value-added application. With the increasing number of Web APIs and Mashups, the API-Mashup ecosystem has emerged based on the invocation relationship between Mashups and Web APIs. In this paper, we take ProgrammableWeb, a typical API-Mashup ecosystem, as an example to investigate its dynamic evolutionary analysis. Although there have been some works on the API-Mashup ecosystem, they mainly focus on static analysis, i.e., the static characteristics of the API- Mashup ecosystem on a fixed time point. This paper conducts a comprehensive study on the dynamic evolutionary analysis of the API-Mashup ecosystem with a long time range from 2005 to 2021. First, we conduct a dynamic statistical analysis based on the API-Mashup ecosystem dataset. Next, we construct two cooperation networks, one between Web APIs, and the other between their categories. And the general characteristics of the two cooperation networks are presented. Finally, we investigate the derived cooperation networks from four perspectives: dynamic characteristics, degree distribution, betweenness centrality, and assortative mixing. Meanwhile, the corresponding insights are uncovered. Our work provides a foundation for visualization and understanding of the API-Mashup ecosystem from the timeline. © 2023 IEEE.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Interactive Web API Recommendation for Mashup Development based on Light Neural Graph Collab.rative Filtering 26

Interactive Web API Recommendation for Mashup Development ba...

引用

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Xiang, Jiayan Chen, Wanjun Wang, Yang Liang, Bowen Liu, Zihao Kang, Guosheng Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan China Hnust Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China

ISBN: (纸本)9798350331684

With the development of Mashup technique, the number of Web APIs released on the Web continues to grow year by year. However, it is a challenging issue to find and select the desirable Web APIs among the large amount of Web APIs. Consequently, interactive Web API recommendation is used to alleviate the difficulty of service selection, when users or developers try to invoke Web APIs for solving their business requirements or software development requirements. Currently, there are several collab.rative filtering based approaches proposed for Web API recommendation, while their recommendation performance is limited on both optimality and scalab.lity. This paper proposes a light neural graph collab.rative filtering based Web API recommendation approach, named LNGCF. Specifically, LNGCF learns user and item embeddings by linearly propagating them on the user-item interaction graph, and uses the weighted summation of the embeddings learned at all layers as the final embedding. Such simple, linear, and neat model is much easier to implement and train. A set of experiments are conducted on a real-world dataset. Experimental results demonstrate the substantial improvements on both optimality and scalab.lity over the baselines. © 2023 IEEE.

关键词： Collab.rative filtering

来源：评论

学校读者我要写书评

暂无评论

Safe Exit Controllers Synthesis for Continuous-time Stochastic systems

Safe Exit Controllers Synthesis for Continuous-time Stochast...

引用

IEEE Conference on Decision and Control

作者： Bai Xue Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Lab. of Computer Science Institute of Software CAS Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper tackles the problem of generating safe exit controllers for continuous-time systems described by stochastic differential equations (SDEs). The primary aim is to develop controllers that maximize the lower bounds of the exit probability that the system escapes from a safe but uncomfortable set within a specified time frame and guide it towards a comfortable set. The paper considers two distinct cases: one in which the boundary of the safe set is a subset of the boundary of the uncomfortable set, and the other where the boundaries of the two sets do not intersect. To begin, we present a sufficient condition for establishing lower bounds on the exit probability in the first case. This condition serves as a guideline for constructing a point-wise optimization using linear programs. The linear programming problem is designed to implicitly synthesize an optimal exit controller online that maximizes the lower bounds of the exit probability. The method employed in the first case is then extended to the second one. Finally, we demonstrate the effectiveness of the proposed approaches on one example.

关键词： Lower bound Sufficient conditions Stochastic systems Differential equations Linear programming Control systems Trajectory Optimization Guidelines

来源：评论

学校读者我要写书评

暂无评论

Graph-based Multi-view Clustering for Web services 21

Graph-based Multi-view Clustering for Web services

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Yang, Wang Zhenzhen, Yuan Guosheng, Kang Buqing, Cao Jianxun, Liu Yong, Xiao Hnust Xiangtan China Hunan University of Science and Technology Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China School of Computer Science and Engineering China

ISBN: (纸本)9798350329223

The number of Web services on the Internet has been steadily increasing in recent years due to their growing popularity. Under the big data environment, how to effectively manage Web services is of significance for service discovery, service recommendation, etc. It is widely studied that Web services clustering is an effective way for service management. However, most of the current Web service clustering only extracts the information of Web services for clustering from one view, such as Web service content descriptions, networks in which Web services participate, and so on. Extracting information from Web services only unilaterally will not be able to provide a three-dimensional and comprehensive description of Web services, which may diminish the effect of Web service clustering. In addition, some Web service resources will be wasted if other information of Web services is not used at the same time. We find that multi-view clustering can simultaneously consider multiple information of a data at the same time, and multiple information can complement and enhance each other according to the characteristics of multiview clustering. Therefore, in this paper, we apply Web services to graph-based multi-view clustering in multi-view clustering to improve the performance of Web service clustering by simultaneously considering multiple feature information about Web services and distributing different weights to different information in the clustering process. © 2023 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Measurement-based Path Loss Prediction and Analysis in Water Scenarios

Measurement-based Path Loss Prediction and Analysis in Water...

引用

2024 IEEE International Conference on Computational Electromagnetics, ICCEM 2024

作者： Li, Hanpeng Chen, Xiaomin Li, Hangang Ma, Jian Ye, Xuchao Song, Lixin Zhang, Taotao Zhong, Weizhi Zhu, Qiuming Nanjing University of Aeronautics and Astronautics College of Electronic and Information Engineering Nanjing211106 China Aviation Key Laboratory of Science and Technology On Aero Electromechanical System Integration Nanjing211106 China State Key Lab. of Complex Electromagnetic Environment Effects On Electronics and Information System Luoyang471003 China

ISBN: (纸本)9798350383317

Unmanned aerial vehicles (UAVs) have enabled the unmanned management of water areas. Path loss (PL) serves as a critical factor that affects the UAV communication quality. In this work, a PL model for UAV channel in water scenarios is proposed, aiming to explore the multidimensional relationship between transceiver distance, carrier frequency, UAV height, and PL by constructing an Artificial Neural Network (ANN). Moreover, channel measurements are conducted in a river area, and the obtained data are analyzed using the proposed ANN model as well as the close-in (CI) model. The analysis results demonstrates that the PL increases initially and then declines as the UAV height increases. The proposed ANN model has higher prediction accuracy than the classic empirical model, and can achieve precise prediction of the PL in water scenarios. © 2024 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：