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

arXiv 2022年

作者： Li, Yuwei Yang, Bo Wu, Hao Han, Qiaoni Chen, Cailian Guan, Xinping The Department of Automation Shanghai Jiao Tong University Shanghai200240 China Huawei Technologies Co. Ltd China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China The Department of Automation Tianjin University Tianjin 300072 China

With the popularity of mobile devices and development of computationally intensive applications, researchers are focusing on offloading computation to Mobile Edge Computing (MEC) server due to its high computational efficiency and low communication delay. As the computing resources of an MEC server are limited, vehicles in the urban area who have abundant idle resources should be fully utilized. However, offloading computing tasks to vehicles faces many challenging issues. In this paper, we introduce a vehicular fog-edge computing paradigm and formulate it as a multi-stage Stackelberg game to deal with these issues. Specifically, vehicles are not obligated to share resources, let alone disclose their private information (e.g., stay time and the amount of resources). Therefore, in the first stage, we design a contract-based incentive mechanism to motivate vehicles to contribute their idle resources. Next, due to the complicated interactions among vehicles, road-side unit (RSU), MEC server and mobile device users, it is challenging to coordinate the resources of all parties and design a transaction mechanism to make all entities benefit. In the second and third stages, based on Stackelberg game, we develop pricing strategies that maximize the utilities of all parties. The analytical forms of optimal strategies for each stage are given. Simulation results demonstrate the effectiveness of our proposed incentive mechanism, reveal the trends of energy consumption and offloading decisions of users with various parameters, and present the performance comparison between our framework and existing MEC offloading paradigm in vehicular networks. © 2022, CC BY.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

Finite-size scaling of geometric renormalization flows in complex networks

引用

Physical Review E 2021年第3期104卷 034304-034304页

作者： Dan Chen Housheng Su Xiaofan Wang Gui-Jun Pan Guanrong Chen School of Artificial Intelligence and Automation Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Wuhan 430074 China Department of Automation Shanghai University Shanghai 200072 China Faculty of Physics and Electronic Science Hubei University Wuhan 430062 China Department of Electronic Engineering City University of Hong Kong 999077 Hong Kong

Some characteristics of complex networks need to be derived from global knowledge of the network topologies, which challenges the practice for studying many large-scale real-world networks. Recently, the geometric renormalization technique has provided a good approximation framework to significantly reduce the size and complexity of a network while retaining its “slow” degrees of freedom. However, due to the finite-size effect of real networks, excessive renormalization iterations will eventually cause these important “slow” degrees of freedom to be filtered out. In this paper, we systematically investigate the finite-size scaling of structural and dynamical observables in geometric renormalization flows of both synthetic and real evolutionary networks. Our results show that these observables can be well characterized by a certain scaling function. Specifically, we show that the critical exponent implied by the scaling function is independent of these observables but depends only on the structural properties of the network. To a certain extent, the results of this paper are of great significance for predicting the observable quantities of large-scale real systems and further suggest that the potential scale invariance of many real-world networks is often masked by finite-size effects.

关键词： Network structure Scale free & inhomogeneous networks Small-world networks Critical exponents Renormalization Renormalization group Self-organized criticality Self-similarity

来源：评论

学校读者我要写书评

暂无评论

Distributed Frequency controller for MT-HVDC Systems Via Adaptive Dynamic Programming

Distributed Frequency Controller for MT-HVDC Systems Via Ada...

引用

第32届中国控制与决策会议

作者： Zhongjie Hu Zhi-Wei Liu Xiong Hu Ming Chi College of Artificial Intelligence and Automation Huazhong University of Science and Technology the Key Laboratory of Image Processing and Intelligent Control Ministry of EducationHuazhong University of Science and Technology

The exact mathematical models of multi-terminal high-voltage direct current（MT-HVDC） systems are hard to be obtained in the practical application of HVDC *** overcome this challenge,a model-free distributed frequency controller for MT-HVDC systems is proposed based on Adaptive dynamic programming（ADP） in this ***,for each AC area,only the local and neighboring sampling data of frequency is required without the MT-HVDC system ***,the proposed controller is distributed which effectively balances the communication burden among the AC ***,the proposed controller makes the connected AC areas share their power reserves via HVDC grids to compensate load disturbances so that the necessary power reserves can be *** simulations carried out on a five-terminal HVDC system evaluate the performance of the proposed controller.

关键词： MT-HVDC system distributed frequency controller adaptive dynamic programming（ADP） neural network reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Control and Information Sciences

引用

Lecture Notes in control and Information Sciences 2023年 492卷 v-vi页

作者： Luan, Xiaoli He, Shuping Liu, Fei Key Laboratory of Advanced Process Control for Light Industry [Ministry of Education Institute of Automation Jiangnan University Jiangsu Wuxi China Key Laboratory of Intelligent Computing and Signal Processing [Ministry of Education School of Electrical Engineering and Automation Anhui University Anhui Hefei China

来源：评论

学校读者我要写书评

暂无评论

Scaling properties of scale-free networks in degree-thresholding renormalization flows

arXiv

引用

arXiv 2021年

作者： Chen, Dan Cai, Defu Su, Housheng The School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan430074 China The State Grid Hubei Electric Power Research Institute Wuhan China

We study the statistical properties of observables of scale-free networks in the degree-thresholding renormalization (DTR) flows. For BA scale-free networks with different sizes, we find that their structural and dynamical observables have similar scaling behavior in the DTR flow. The finite-size scaling analysis confirms this view and reveals a scaling function with a single scaling exponent that collectively captures the changes of these observables. Furthermore, for the scale-free network with a single initial size, we use its DTR snapshots as the original networks in the DTR flows, then perform a similar finite-size scaling analysis. Interestingly, the initial network and its snapshots share the same scaling exponent as the BA synthetic network. Our findings have important guiding significance for analyzing the structure and dynamic behavior of large-scale networks. Such as, in large-scale simulation scenarios with high time complexity, the DTR snapshot could serve as a substitute or guide for the initial network and then quickly explore the scaling behavior of initial networks. © 2021, CC BY.

关键词： Scaling laws

来源：评论

学校读者我要写书评

暂无评论

SUNet: Scale-aware Unified Network for Panoptic Segmentation

arXiv

引用

arXiv 2022年

作者： Yan, Weihao Qian, Yeqiang Wang, Chunxiang Yang, Ming The Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai Jiao Tong University Shanghai200240 China

Panoptic segmentation combines the advantages of semantic and instance segmentation, which can provide both pixel-level and instance-level environmental perception information for intelligent vehicles. However, it is challenged with segmenting objects of various scales, especially on extremely large and small ones. In this work, we propose two lightweight modules to mitigate this problem. First, Pixel-relation Block is designed to model global context information for large-scale things, which is based on a query-independent formulation and brings small parameter increments. Then, Convectional Network is constructed to collect extra high-resolution information for small-scale stuff, supplying more appropriate semantic features for the downstream segmentation branches. Based on these two modules, we present an end-to-end Scale-aware Unified Network (SUNet), which is more adaptable to multi-scale objects. Extensive experiments on Cityscapes and COCO demonstrate the effectiveness of the proposed methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Performing DNA Strand Displacement with DNA Polymerase 14th

Performing DNA Strand Displacement with DNA Polymerase

引用

14th International Conference on Bio-inspired Computing: Theories and Applications, BIC-TA 2019

作者： Wang, Zhiyu Hu, Yingxin Chen, Zhekun Liao, Sulin Huang, Yabing Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan730074 China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan730074 China Department of Pathology Renmin Hospital of Wuhan University Wuhan430060 China

ISBN: (纸本)9789811534140

Significant improvements to the dynamic DNA nano science have emerged in recent years, primarily due to the elaborate design of toehold-mediated DNA strand displacement (TMSD). However, it remains an ongoing challenge to design huge-scaled TMSD based sophisticated dynamic DNA structures without base-pair mismatching or unwanted secondary structures, because the sequence design complexity of TMSD will dramatically increase as the scale increases. Here we report a new polymerase triggered strand displacement (PTSD) mechanism to realize DNA strand displacement with the potential of constructing complicated dynamic DNA nanostructures. By employing proper polymerase with strand displacement activity, the target strand in a duplex will be displaced and freed during the polymerization. In this manner, DNA strand displacement takes place without considering the design complexity of branch migration domain. The mechanism was successfully applied in constructing one-layer and two-layer circuits in which the parameters involved were explored, suggesting that PTSD is feasible and able to be harnessed to construct cascading DNA circuits with high complexity. © 2020, Springer Nature Singapore Pte Ltd.

关键词： DNA

来源：评论

学校读者我要写书评

暂无评论

Indicators of Learning Ability of Autonomous Vehicles

Indicators of Learning Ability of Autonomous Vehicles

引用

Chinese Automation Congress (CAC)

作者： Yimin Su Junjie Zhou Hongrong Huang Lin Wang Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai Jiao Tong University Shanghai China Saie Volkswagen Automotive Co. Ltd. Shanghai China

ISBN: (纸本)9781665426480

With the increase of research on autonomous vehicles, the evaluation research of autonomous vehicles has gradually attracted attention. Effective evaluation of autonomous vehicles can ensure the safety of autonomous vehicles and improve their level of intelligence. The current related research focuses on the evaluation of vehicles in terms of safety and comfort, while there are few studies on the evaluation of the learning ability of autonomous vehicles from the time dimension. Therefore, this article proposes three learning indicators: learning time, learning speed and learning capacity. These three indicators are used to measure the learning ability of autonomous driving algorithms. By analyzing the learning curve of the vehicle algorithm, the evaluation results of three learning indicators can be obtained. Thus the learning ability of the automatic driving algorithm can be evaluated. The differences in different vehicle algorithms can also be compared. In this article, taking the parking algorithm based on reinforcement learning as an example, simulation examples and analysis of the three learning indicators proposed are carried out.

关键词： Couplings Analytical models Automation Time series analysis Reinforcement learning Benchmark testing Time measurement

来源：评论

学校读者我要写书评

暂无评论

Research on Public Opinion Guidance Strategy based on Interaction Constraints

Research on Public Opinion Guidance Strategy based on Intera...

引用

IEEE Information Technology and Mechatronics Engineering Conference (ITOEC)

作者： Yuanyuan Xu Zhan Wu Xi Chen School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Image Processing and Intelligent Control Key Laboratory of the Education Ministry of China Wuhan China

ISBN: (数字)9781728143231

ISBN: (纸本)9781728143248

The dissemination of public opinion has a considerable impact on people's social lives, and the question of how both the government and the media can correctly guide public opinion and restore social stability is an issue that requires urgent attention. Combining the characteristics of public opinion dissemination in the network society leads to individual interaction. Considering the interaction between individual views and network topology, this paper combines the collaborative network model with the distance-constrained Hegselmann-Krause (HK) model to propose a consensus-guided strategy based on interaction constraints. It does this by changing the network topology and limiting the scope of individual interactions, thereby affecting the spread of public opinion. Based on the small-world network, the collaborative network model introduces the two parameters of Connection edge probability p and broken edge probability q, while also proposing a collaborative network model for Connection edge's breaking of the network based on the difference of individual opinion values. This paper designs simulation experiments by changing p, q, and the interaction distance, while also analyzing the results of public opinion's evolution from the perspectives of timeliness and the diversity of viewpoints. The experimental results show that when individuals are restricted from interacting with the surrounding environment and the scope of interaction between individuals is restricted, this will slow down the evolution of public opinion and increase the number of opinion clusters. By contrast, when it is encouraged, the interaction between individuals and the surrounding environment will make the entire system communicate more effectively within a short period of time, promoting the evolutionary benefits of public opinion considerably, shortening the convergence time of public opinion evolution to reach a steady state, and reducing the number of opinion clusters. The strategy is consist

关键词： Network topology Collaborative work Social network services Economics Government Bridges Media

来源：评论

学校读者我要写书评

暂无评论

Decentralized Nonconvex Robust Optimization over Unsafe Multiagent Systems: System Modeling, Utility, Resilience, and Privacy Analysis

arXiv

引用

arXiv 2024年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Cheng, Huqiang Guo, Xiaoyu Huang, Tingwen School of Automation Central South University Changsha410083 China Department of Biomedical Engineering City University of Hong Kong Kowloon Hong Kong School of Electrical Engineering and Telecommunications University of New South Wales SydneyNSW2052 Australia Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China Key Laboratory of Dependable Services Computing in Cyber Physical Society Ministry of Education College of Computer Science Chongqing University Chongqing400044 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China

Privacy leakage and Byzantine failures are two adverse factors to the intelligent decision-making process of multiagent systems (MASs). Considering an unsafe MAS with these two issues, this paper targets the resolution of a class of nonconvex optimization problems under the Polyak-Lojasiewicz (P-L) condition. To address this problem, we first identify and construct the unsafe MAS model. Under this kind of unfavorable MASs, we mask the local gradients with Gaussian noises and adopt a resilient aggregation method self-centered clipping (SCC) to design a differentially private (DP) decentralized Byzantine-resilient algorithm, namely DP-SCC-PL, which simultaneously achieves differential privacy and Byzantine resilience. The convergence analysis of DP-SCC-PL is challenging since the convergence error can be contributed jointly by privacy-preserving and Byzantine-resilient mechanisms, as well as the nonconvex relaxation, which is addressed via seeking the contraction relationships among the disagreement measure of reliable agents before and after SCC aggregation, together with the optimal gap. Theoretical results reveal that DP-SCC-PL achieves consensus among all reliable agents and sublinear (inexact) convergence with well-designed step-sizes. It has also been proved that if there are no privacy issues and Byzantine agents, then the asymptotic exact convergence can be recovered. Numerical experiments verify the utility, resilience, and differential privacy of DP-SCC-PL by tackling a nonconvex optimization problem satisfying the P-L condition under various Byzantine attacks. Copyright © 2024, The Authors. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：