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

29th IEEE International Conference on Parallel and Distributed systems, ICPADS 2023

作者： Shen, Runnan Wang, Liang Luo, Haotian Yang, Rui Yang, Jinqian Wang, Jinquan Sun, Qiancheng Xiao, Limin Dong, Jin Beihang University State Key Laboratory of Complex Key Software Environment Beijing100191 China Beihang University School of Computer Science and Engineering Beijing100191 China Beihang University Shen Yuan Honors College Beijing100191 China Beijing100190 China

ISBN: (纸本)9798350330717

Zero-knowledge proof (ZKP) is a popular cryptographic strategy for building a trusted environment, which can be applied to blockchain, electronic voting, and other scenarios. However, ZKP involves a number of computationally intensive operations that limit its widespread adoption in time-sensitive practical applications. The multi-scalar multiplication (MSM) dominates the computations and takes over 70% of the total computation time. This paper proposes a GPU-based acceleration method for ZKP by designing several optimization techniques for MSM. First, this paper constructs a formal mathematical formula of the Pippenger algorithm, which provides a theoretical optimization framework for MSM. Second, by parallelizing the prefix sum, the time complexity of the bucket reduction part of MSM is reduced from O( 3 ×2C ) to O( 2 ×2C ). Finally, this paper also analyzes the influence of group size on the final calculation time under different data scales and gives a suitable range of group sizes. Compared to the state-of-the-art method, our method can achieve 1.01× to 1.12× for throughput. © 2023 IEEE.

关键词： GPU MSM Pippenger zk-SNARK

来源：评论

学校读者我要写书评

暂无评论

Towards robust neural networks via a global and monotonically decreasing robustness training strategy

引用

Frontiers of Information Technology & Electronic engineering 2023年第10期24卷 1375-1389页

作者： Zhen LIANG Taoran WU Wanwei LIU Bai XUE Wenjing YANG Ji WANG Zhengbin PANG Institute for Quantum Information&State Key Laboratory of High Performance Computing National University of Defense TechnologyChangsha 410073China State Key Laboratory of Computer Science Institute of Software Chinese Academy of SciencesBeijing 100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100190China College of Computer Science and Technology National University of Defense TechnologyChangsha 410073China Key Laboratory of Software Engineering for Complex Systems National University of Defense TechnologyChangsha 410073China

Robustness of deep neural networks(DNNs)has caused great concerns in the academic and industrial communities,especially in safety-critical *** of verifying whether the robustness property holds or not in certain neural networks,this paper focuses on training robust neural networks with respect to given ***-of-the-art training methods,interval bound propagation(IBP)and CROWN-IBP,perform well with respect to small perturbations,but their performance declines significantly in large perturbation cases,which is termed“drawdown risk”in this ***,drawdown risk refers to the phenomenon that IBPfamily training methods cannot provide expected robust neural networks in larger perturbation cases,as in smaller perturbation *** alleviate the unexpected drawdown risk,we propose a global and monotonically decreasing robustness training strategy that takes multiple perturbations into account during each training epoch(global robustness training),and the corresponding robustness losses are combined with monotonically decreasing weights(monotonically decreasing robustness training).With experimental demonstrations,our presented strategy maintains performance on small perturbations and the drawdown risk on large perturbations is alleviated to a great *** is also noteworthy that our training method achieves higher model accuracy than the original training methods,which means that our presented training strategy gives more balanced consideration to robustness and accuracy.

关键词： Robust neural networks Training method Drawdown risk Global robustness training Monotonically decreasing robustness

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Interest Representation Network for Click-Through Rate Prediction

Evolutionary Interest Representation Network for Click-Throu...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Zhou, Renjie Jin, Zhenming Wan, Jian Zhang, Jilin Guo, Xingyu Liu, Qiang Hangzhou Dianzi University Key Laboratory of Complex Systems Modeling and Simulation of the Ministry of Education School of Computer Science and Technology Hangzhou China Hangzhou Dianzi University Key Laboratory of Complex Systems Modeling and Simulation of the Ministry of Education Itmo Joint Institute Hangzhou China Zhejiang University of Science and Technology School of Information and Electronic Engineering Hangzhou China Zhejiang Police College Dept. of Computer and Information Technology Hangzhou China

ISBN: (纸本)9798350304855

The rapid development of the Internet has revo-lutionized our lives, providing us with an array of convenient services. However, this revolution has also led to the problem of data overload. Personalized recommendation services have been widely recognized as an effective solution to this problem by both the industrial and academic communities. Accurate prediction of click-through rate (CTR) is a critical task in personalized recommendation systems since it can improve the user's shopping experience, ultimately increasing revenue for the platform. To achieve accurate CTR prediction, it is crucial to capture user interests. While several methods for interest modeling exist, challenges related to user interest evolution and user behavior noise need further attention. This paper proposes a novel CTR prediction model named the Evolutionary Interest Representation Network (EIRN), which learns the evolving interest representation of users from their behaviors, profiles, and environmental attributes. In the model, we introduce an advertisement correlation graph decomposition layer and a noise filter layer to enhance and purify the user behavior representation. An interest extraction layer is designed to capture sequential correlations and common characteristics between user behaviors, representing their interests. Additionally, as user interests evolve over time and their importance changes, an attention-based interest evolution layer is designed to track the evolution of user interests. Our proposed method is validated using four public datasets and an industrial dataset, showing its superiority over existing CTR prediction methods. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Evaluating the usage of fault localization in automated program repair:an empirical study

引用

Frontiers of computer Science 2021年第1期15卷 53-67页

作者： Deheng YANG Yuhua QI Xiaoguang MAO Yan LEI College of Computer National University of Defense TechnologyChangsha 410073China Laboratory of Software Engineering for Complex Systems Changsha 410073China Beijing Institute of Tracking and Communication Technology Beijing 100094China School of Big Data&Software Engineering Chongqing UniversityChongqing 400044China

Fault localization techniques are originally proposed to assist in manual debugging by generally producing a rank list of suspicious *** the increasing popularity of automated program repair,the fault localization techniques have been introduced to effectively reduce the search space of automated program *** developers who mainly focus on the rank information,current automated program repair has two strategies to use the fault localization information:suspiciousness-first algorithm(SFA)based on the suspiciousness accuracy and rank-first algorithm(RFA)relying on the rank ***,despite the fact that the two different usages are widely adopted by current automated program repair and may result in different repair results,little is known about the impacts of the two strategies on automated program *** this paper we empirically compare the performance of SFA and RFA in the context of automated program ***,we implement the two strategies and six well-studied fault localization techniques into four state-of-the-art automated program repair tools,and then use these tools to perform repair experiments on 60 real-world bugs from *** study presents a number of interesting findings:RFA outperforms SFA in 70.02%of cases when measured by the number of candidate patches generated before a valid patch is found(NCP),while SFA performs better in parallel repair and patch diversity;the performance of SFA can be improved by increasing the suspiciousness accuracy of fault localization techniques;finally,we use SimFix that deploys SFA to successfully repair four extra Defects4J bugs which cannot be repaired by SimFix originally using *** observations provide a new perspective for future research on the usage and improvement of fault localization in automated program repair.

关键词： automated program repair fault localization empirical study

来源：评论

学校读者我要写书评

暂无评论

Gradient Projection Differential Neural Solution for Quadratic Optimization with Quadratic Constraints: An ACP Perspective

Gradient Projection Differential Neural Solution for Quadrat...

引用

2023 IEEE International Conference on systems, Man, and Cybernetics, SMC 2023

作者： Liufu, Ying Liu, Mei Jin, Long Wang, Feiyue School of Information Science and Engineering Lanzhou University Lanzhou China College of Computer Qinghai Normal University Xining China Institute of Automation The State Key Laboratory for Management and Control of Complex Systems Chinese Academy of Sciences Beijing China

ISBN: (纸本)9798350337020

In recent years, quadratic optimizations have become increasingly popular in engineering. However, conventional methods that investigate this problem from the perspective of a canonical form with linear constraints are not effective in dealing with the significant challenges posed by quadratic constraints in practice. This paper proposes a solution framework for the quadratic optimization with quadratic constraints (QOQC) based on innovative artificial societies, computational experiments, and parallel execution (ACP) framework. Then, a gradient projection differential neural solution (GPDNS) is proposed to address this. To illustrate the effectiveness of the GPDNS model in solving the QOQC system, numerical simulations are provided. Overall, this paper presents the potential of innovative approaches like the ACP framework to enhance our capabilities in addressing challenging optimization systems. © 2023 IEEE.

关键词： ACP constraints differential neural solution numerical simulation Quadratic optimization with quadratic

来源：评论

学校读者我要写书评

暂无评论

Optimal Strategies for the Game with Two Faster 3D Pursuers and One Slower 2D Evader 41

Optimal Strategies for the Game with Two Faster 3D Pursuers ...

引用

第41届中国控制会议

作者： Runqi Zhang Shuai Li Chen Wang Guangming Xie State Key Laboratory of Turbulence and Complex Systems Intelligent Biomimetic Design LabCollege of EngineeringPeking University National Engineering Research Center of Software Engineering Peking University Center for Multi-Agent Research Institute for Artificial IntelligencePeking University

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

A pursuit-evasion differential game with two faster pursuers in 3 D space and one slower evader in a 2 D plane is *** pursuers,which have different speeds,attempt to cooperate to capture the evader while the evader struggles to avoid or delay the *** differential games and the concept of isochron,we present a complete solution to this game and develop the optimal strategies for both the pursuers and the *** order to guarantee the optimality of the proposed strategies,the value function of the game is given and is further proved to be the solution of the corresponding Hamilton-Jacobi-Isaacs ***,simulations are carried out with comparisons between the proposed strategies and other typical strategies,the results of which show the optimality of the proposed strategies.

关键词： Pursuit-evasion differential games multi-agent system optimal strategy

来源：评论

学校读者我要写书评

暂无评论

MUSE: A Multi-Feature Semantic Fusion Method for ROS Node Search Based on Knowledge Graph

MUSE: A Multi-Feature Semantic Fusion Method for ROS Node Se...

引用

Asia-Pacific Conference on software engineering

作者： Yuxin Zhao Xinjun Mao Tanghaoran Zhang Zhang Zhang College of Computer National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha China

Reusing ROS components, specifically ROS Nodes, is crucial for improving the efficiency and quality of robotic software development. However, developers face challenges in finding the desired ROS Nodes for reuse due to scattered organization of ROS Nodes and the ambiguity in their ROS Node name. To address these challenges, this paper proposes a MUlti-feature SEmantic fusion method (MUSE) that leverages a domain-specific ROS knowledge graph for searching ROS Nodes. Firstly, a large dataset is constructed, comprising code files and textual descriptions related to ROS Nodes obtained from GitHub and ROS Wiki. Secondly, an in-depth analysis of user queries regarding the reuse of ROS Nodes is conducted, leading to the selection of multiple features that provide a comprehensive representation of ROS Node semantics, including Function, Hardware, Input, and Output. Subsequently, a knowledge graph of ROS Nodes is developed based on the dataset, incorporating the selected features. This knowledge graph effectively organizes scattered knowledge and resolves the issue of diverse mentions through entity disambiguation and resolution. To eliminate the semantic gap between the descriptions of features mentioned in user queries and the entities in the knowledge graph, a pretrained transformer-based model was used to measure the multi-feature semantic similarity between user queries and ROS Nodes knowledge. Finally, we employ a linear regression model to integrate the multi-feature knowledge between user queries and ROS Nodes knowledge. The proposed method has shown a 20% improvement in performance on NDCG@1 compared to other ROS Node search methods. Further evaluations highlight the effectiveness of each feature incorporated in the knowledge graph, as well as the significance of each parameter within the regression model. These findings underscore the robustness of this research in optimizing the reuse of ROS Nodes and facilitating the development of robotics software.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Symbolic Verification of Fuzzy Logic Models 23

Symbolic Verification of Fuzzy Logic Models

引用

Proceedings of the 38th IEEE/ACM International Conference on Automated software engineering

作者： Siang Zhao Zhongyang Li Zhenbang Chen Ji Wang College of Computer National University of Defense Technology China AND Key Laboratory of Software Engineering for Complex Systems National University of Defense Technology China College of Computer National University of Defense Technology China AND State Key Laboratory of High Performance Computing National University of Defense Technology China

ISBN: (纸本)9798350329964

Fuzzy logic is widely applied in various applications. However, verifying the correctness of fuzzy logic models can be difficult. This extended abstract presents our ongoing work on verifying fuzzy logic models. We treat a fuzzy logic model as a program and propose a verification method based on symbolic execution for fuzzy logic models. We have developed and implemented the environment models for the common functions and the inference rules in fuzzy logic models. Our preliminary evaluation shows the potential of our verification method.

关键词： fuzzy logic model

来源：评论

学校读者我要写书评

暂无评论

Toward Coordination Control of Multiple Fish-Like Robots:Real-Time Vision-Based Pose Estimation and Tracking via Deep Neural Networks

引用

IEEE/CAA Journal of Automatica Sinica 2021年第12期8卷 1964-1976页

作者： Tianhao Zhang Jiuhong Xiao Liang Li Chen Wang Guangming Xie State Key Laboratory of Turbulence and Complex Systems Intelligent Biomimetic Design LaboratoryCollege of EngineeringPeking UniversityBeijing 100871China National Engineering Research Center of Software Engineering Peking UniversityBeijing 100871 Institute of Ocean Research Peking UniversityBeijing100871 Peng Cheng Laboratory Shenzhen 518055China

Controlling multiple multi-joint fish-like robots has long captivated the attention of engineers and biologists,for which a fundamental but challenging topic is to robustly track the postures of the individuals in real *** requires detecting multiple robots,estimating multi-joint postures,and tracking identities,as well as processing fast in real *** the best of our knowledge,this challenge has not been tackled in the previous *** this paper,to precisely track the planar postures of multiple swimming multi-joint fish-like robots in real time,we propose a novel deep neural network-based method,named *** TAB part fuses the top-down and bottom-up approaches for vision-based pose estimation,while the IOL part with long short-term memory considers the motion constraints among joints for precise pose *** satisfying performance of our TAB-IOL is verified by testing on a group of freely swimming fish-like robots in various scenarios with strong disturbances and by a deed comparison of accuracy,speed,and robustness with most state-of-the-art ***,based on the precise pose estimation and tracking realized by our TAB-IOL,several formation control experiments are conducted for the group of fish-like *** results clearly demonstrate that our TAB-IOL lays a solid foundation for the coordination control of multiple fish-like robots in a real working *** believe our proposed method will facilitate the growth and development of related fields.

关键词： Deep neural networks formation control multiple fish-like robots pose estimation pose tracking

来源：评论

学校读者我要写书评

暂无评论

Forming Circle Formations of Multi-agent systems Under Actuator Faults 5th

Forming Circle Formations of Multi-agent Systems Under Actu...

引用

5th Chinese Conference on Swarm Intelligence and Cooperative Control, CCSICC 2021

作者： Liu, Jiajun Ru, Xinfeng Xia, Weiguo Wang, Chen China National Aeronautical Radio Electronic Research Institute and National Key Laboratory of Science and Technology on Avionics System Integration Shanghai China Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education and School of Control Science and Engineering Dalian University of Technology Dalian China National Engineering Research Center of Software Engineering and the State Key Laboratory of Turbulence and Complex Systems Intelligent Biomimetic Design Lab College of Engineering Peking University Beijing China

ISBN: (纸本)9789811939976

A distributed fault-tolerant formation control law is designed in this paper for multi-agent systems under external disturbances and actuator faults including time-varying loss of effectiveness faults. The initial position of each agent is already on a circle and the control purpose is to form a desired formation on this circle. Based on this local information, a distributed adaptive formation control law is designed by employing the congelation of variables method to deal with time-varying actuator faults. Finally, a simulation example is given to verify the effectiveness of the adaptive fault-tolerant control design method. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：