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

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game

IEEE/CAA Journal of Automatica Sinica 2023年第2期10卷 512-523页

作者： Jie Chen Kaiyi Luo Changbing Tang Zhao Zhang Xiang Li the Adaptive Networks and Control Laboratory Department of Electronic EngineeringFudan UniversityShanghai 200433China the College of Mathematics and Computer Science Zhejiang Normal UniversityJinhua 321004 Yuxi Middle School Taizhou 317399China IEEE the College of Physics and Electronics Information Engineering Zhejiang Normal UniversityJinhua 321004China the College of Mathematics and Computer Science Zhejiang Normal UniversityJinhua 321004China the Adaptive Networks and Control Laboratory Department of Electronic EngineeringFudan UniversityShanghai 200433 the Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous SystemsTongji UniversityShanghai 201210China

Weighted vertex cover(WVC)is one of the most important combinatorial optimization *** this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted *** first model the WVC problem as a general game on weighted *** the framework of a game,we newly define several cover states to describe the WVC ***,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the ***,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial ***,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the ***,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.

关键词： Game-based asynchronous algorithm(GAA) game optimization polynomial time strict Nash equilibrium(SNE) weighted vertex cover(WVC)

来源：评论

学校读者我要写书评

暂无评论

Solution to the Problem of Passing Over the Given Targets by an Unmanned Aerial Vehicle in an Unstable Environment

Solution to the Problem of Passing Over the Given Targets by...

引用

2023 International Russian Automation Conference, RusAutoCon 2023

作者： Khachumov, Mikhail Intelligent Control Laboratory Ailamazyan Program Systems Institute of Ras Pereslavl-Zalessky Russia Federal Research Center "Computer Science and Control"of Ras Moscow Russia Rudn University Moscow Russia

ISBN: (纸本)9798350345551

The paper gives a statement and considers the solution to an urgent problem of flying over the given targets by an unmanned aerial vehicle (UAV) in unstable conditions. A criterion is formulated for constructing efficient routes and passing arbitrary located sites according to a given formal description of the terrain map with the presence of interferences. Heuristic rules are proposed aimed at minimizing the graph of the initial map and reducing the number of alternative flight routes, given the time constraints for completing the task. The search of the solution in this case can be carried out according to the base tree of routes. A heuristic algorithm for searching efficient routes in a limited time is considered, which has the complexity that ensures its implementation on the UAV onboard computer. It is substantiated that the proposed approach can significantly reduce the number of comparing alternatives for flying around given arbitrary located targets in comparison with the well-known methods for solving this problem. The paper describes a successful example of solving the UAV route planning problem with the proposed approach, which is complicated by the presence of wind flows affecting the speed and trajectory. © 2023 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Heuristic Algorithm for Solving Travelling Salesman Problem: Adding the Endpoints of the Longest Edges 5

Heuristic Algorithm for Solving Travelling Salesman Problem:...

引用

5th International Conference on Problems of Cybernetics and Informatics, PCI 2023

作者： Nuriyeva, Fidan Dokuz Eylul University Department of Computer Science Izmir Turkey Institute of Control Systems Laboratory of Recognition Identification and Methods of Optimal Solutions Baku Azerbaijan

ISBN: (纸本)9798350319064

This study proposes, a new heuristic algorithm based on insertion heuristic to solve the symmetric Travelling Salesman Problem. In the proposed algorithm, firstly the two longest edges are selected and the starting tour passing through their endpoints is constructed, then the endpoints of the next longest edges are added to this tour and the solution passing through all the vertices is found. This problem is known to be NP-Hard. The proposed method was successfully tested on different-sized problems. The experimental results show that the proposed algorithm outperforms many existing methods. © 2023 IEEE.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Conservative-Progressive Collaborative Learning for Semi-Supervised Semantic Segmentation

引用

IEEE Transactions on Image Processing 2023年 32卷 6183-6194页

作者： Fan, Siqi Zhu, Fenghua Feng, Zunlei Lv, Yisheng Song, Mingli Wang, Fei-Yue Institute of Automation State Key Laboratory of Management and Control of Complex Systems Chinese Academy of Sciences Beijing100190 China Tsinghua University Beijing100190 China Zhejiang University College of Computer Science and Technology Hangzhou310027 China

Pseudo supervision is regarded as the core idea in semi-supervised learning for semantic segmentation, and there is always a tradeoff between utilizing only the high-quality pseudo labels and leveraging all the pseudo labels. Addressing that, we propose a novel learning approach, called Conservative-Progressive Collaborative Learning (CPCL), among which two predictive networks are trained in parallel, and the pseudo supervision is implemented based on both the agreement and disagreement of the two predictions. One network seeks common ground via intersection supervision and is supervised by the high-quality labels to ensure a more reliable supervision, while the other network reserves differences via union supervision and is supervised by all the pseudo labels to keep exploring with curiosity. Thus, the collaboration of conservative evolution and progressive exploration can be achieved. To reduce the influences of the suspicious pseudo labels, the loss is dynamic re-weighted according to the prediction confidence. Extensive experiments demonstrate that CPCL achieves state-of-the-art performance for semi-supervised semantic segmentation. © 1992-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Rethinking Distribution Alignment for Inter-class Fairness 1

引用

1st International Conference on Artificial Intelligence Security and Privacy, AIS and P 2023

作者： Ye, Jinhuang Wu, Jiawei Li, Zuoyong Zheng, Xianghan College of Computer and Big Data Fuzhou University Fuzhou350108 China School of Intelligent Systems Engineering Sun Yat-sen University Shenzhen518107 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou350121 China

ISBN: (数字)9789819997886

ISBN: (纸本)9789819997879

Semi-supervised learning (SSL) is a successful paradigm that can use unlabelled data to alleviate the labelling cost problem in supervised learning. However, the excellent performance brought by SSL does not transfer well to the task of class imbalance. The reason is that the class bias of pseudo-labelling further misleads the decision boundary. To solve this problem, we propose a new plug-and-play approach to handle the class imbalance problem based on a theoretical extension and analysis of distribution alignment. The method, called Basis Transformation Based Distribution Alignment (BTDA), efficiently aligns class distributions while taking into account inter-class *** implements the basis transformation through a learnable transfer matrix, thereby reducing the performance loss caused by pseudo-labelling biases. Extensive experiments show that our proposed BTDA approach can significantly improve performance in class imbalance tasks in terms of both accuracy and recall metrics when integrated with advanced SSL algorithms. Although the idea of BTDA is not complex, it can show advanced performance on datasets such as CIFAR and SVHN. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Variable Speed Limit control for Highway Scenarios a Multi-agent Reinforcement Learning Based Approach 2nd

Variable Speed Limit Control for Highway Scenarios a Multi...

引用

2nd International Conference on Cognitive Mobility, COGMOB 2023

作者： Kővári, Bálint Knáb, István Gellért Bécsi, Tamás Department of Control for Transportation and Vehicle Systems Budapest University of Technology and Economics Budapest Hungary Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

ISBN: (纸本)9783031876196

Modern road networks are critical in developing transportation infrastructures from the aspect of sustainability, thanks to the rapid increase in road users. The demand for mobility makes the existing infrastructure more crowded, boosting greenhouse gas emissions and delays in everyday commuting. Expanding the road network is only possible in some cases and is also not feasible, but Intelligent Transportation systems (ITS) can enhance the efficiency of the existing transportation network. From a management point of view, a proven algorithm is Variable Speed Limit control, which regulates the state of certain sectors by spatially distributing traffic in the form of dynamically varying speed limits. Combining this with a state-of-the-art predictive solution can make a big difference to performance. For the design of speed limits, this paper proposes an approach where deep reinforcement learning with the smallest industrial share not only resolves moving jams that arise during congested traffic situations, but also prevents them, thereby avoiding cumulative error from transients, all by abandoning physical equations and identified models. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Highway traffic control

来源：评论

学校读者我要写书评

暂无评论

Named Entity Recognition in Chinese Medical Texts Based on RoBERTa-WWM-IDCNN-CRF 25

Named Entity Recognition in Chinese Medical Texts Based on R...

引用

25th IEEE China Conference on System Simulation Technology and its Application, CCSSTA 2024

作者： Tang, Lan Kong, Jie Xu, Liang Xi'an Shiyou University School of Computer Xi'an China Tianjin University of Technology Tianjin Key Laboratory for Control Theory & Applications in Complicated Systems School of Electrical Engineering and Automation Tianjin China

ISBN: (纸本)9798350366600

Electronic medical records and doctor-patient conversations contain a wealth of useful information, such as disease symptoms, drug names, and cure cycles. Traditional deep learning approaches utilize bidirectional recurrent neural networks to encode text, which cannot effectively capture long-distance dependencies in text. In order to identify medical entity types in various texts more accurately, a named entity recognition approach based on RoBERTa-WWM-IDCNN-CRF is proposed. This approach introduces the RoBERTa-WWM pre-trained model, in order to improve the overall understanding of long Chinese texts for the first time. The model generates semantic representations containing prior knowledge. Then, the generated semantic representations are feed to the IDCNN to extract sentence level characteristics. Finally, the global optimal solution is obtained and the results of the named entity are produced through the CRF. The experiment indicates that the improvement of F1 score, accuracy, and recall of RoBERTa-WWM-IDCNN-CRF model are 7.94%, 4.52% and 10.02% comparing with the classical BiLSTM-CRF model. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Trust Establishment for the Role-Based Collaborative Multi-Robot systems

Trust Establishment for the Role-Based Collaborative Multi-R...

引用

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

作者： Akbari, Behzad Zhu, Haibin Pan, Ya-Jun Dalhousie University Advanced Control and Mechatronics Laboratory Department of Mechanical Engineering HalifaxNS Canada Nipissing University Collaborative Systems Laboratory Department of Computer Science and Mathematics North BayON Canada

ISBN: (纸本)9798350337020

Trust evaluation and trust establishment play crucial roles in the management of trust within a multi-agent system. When it comes to collaboration systems, trust becomes directly linked to the specific roles performed by agents. The Role-Based Collaboration (RBC) methodology serves as a framework for assigning roles that facilitate agent collaboration. Within this context, the behavior of an agent with respect to a role is referred to as a process role. This research paper introduces a role engine that incorporates a trust establishment algorithm aimed at identifying optimal and reliable process roles. In our study, we define trust as a continuous value ranging from 0 to 1. To optimize trustworthy process roles, we have developed a consensus-based Gaussian Process Factor Graph (GPFG) tool. Our simulations and experiments validate the feasibility and efficiency of our proposed approach with autonomous robots in unsignalized intersections and narrow hallways. © 2023 IEEE.

关键词： Gaussian process factor graph Multi-Agent systems (MASs) Role-based collaboration Trust management systems

来源：评论

学校读者我要写书评

暂无评论

Study on Landslide Susceptibility Evaluation Based on Improved Multivariable Weighted Model: A Case Study of Lushan County, China 3

Study on Landslide Susceptibility Evaluation Based on Improv...

引用

3rd IEEE International Conference on Software Engineering and Artificial Intelligence, SEAI 2023

作者： Zhao, Li Duan, Gonghao Wuhan Institute of Technology School of Computer Science and Engineering Wuhan China Automation for Complex Systems Hubei Key Laboratory of Advanced Control and Intelligent Wuhan China

ISBN: (纸本)9798350337952

The evaluation of regional geological hazard susceptibility is of great significance to the prevention and control of geological hazard. In this paper, the "4-20"Lushan earthquake disaster area as the research area, combined with GIS and characteristics of the research area, through correlation analysis, selected 9 influencing factors as the evaluation factors. The study was conducted using a weighted information volume-logistic regression model (WI-LR). The results were classified into five sensitivity levels: very low, low, medium, high and very high. The results show that the landslide prone areas in Lushan County are concentrated in the area below the middle of the county seat, mostly near rivers, faults and areas with peak acceleration greater than 0.4. Among them, WI-LR model (AUC=0.918) > deterministic factor model (CF =0.908) > weighted information quantity model (WI) (AUC=0.896) > information quantity model I (AUC=0.853) > information quantity logistic regression model I-LR (AUC=0.799). It indicates that WI-LR model has high evaluation accuracy. © 2023 IEEE.

关键词： Hazards

来源：评论

学校读者我要写书评

暂无评论

Optimal control of Constrained Trajectory Optimization Problem of UAV with Limited Sensing

Optimal Control of Constrained Trajectory Optimization Probl...

引用

2024 China Automation Congress, CAC 2024

作者： Xiao, Long Liu, Miao Wu, Xialai Guo, Shaopan Shi, Benyun Ci, Wenyan College of Computer and Information Engineering College of Artificial Intelligence Nanjing Tech University Nanjing China Huzhou Key Laboratory of Intelligent Sensing and Optimal Control for Industrial Systems Huzhou University Huzhou China

ISBN: (纸本)9798350368604

Optimal control of constrained unmanned aerial vehicle (UAV) trajectory optimization problem is one of the frontiers and hotspots of UAV research. The various constraints generated by physical limitations and obstacles in the environment increase the difficulties of solving the trajectory optimization problem, especially when the limited sensing ability is taken into consideration. This paper presents the receding horizon optimization method to obtain optimal control for the UAV with limited sensing range in a complex environment with obstacles. To improve efficiency, a path constraint processing method is proposed to reduce the number of constraints in the nonlinear programming problem (NLP). The proposed main structure and detailed algorithm are also given. The numerical results demonstrate the effectiveness of the proposed method compared with the classical Gauss pseudospectral method. © 2024 IEEE.

关键词： Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：