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

arXiv 2023年

作者： Du, Hongyang Zhang, Ruichen Liu, Yinqiu Wang, Jiacheng Lin, Yijing Li, Zonghang Niyato, Dusit Kang, Jiawen Xiong, Zehui Cui, Shuguang Ai, Bo Zhou, Haibo Kim, Dong In The School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China The School of Information and Communication Engineering University of Electronic Sciences and Technology of China Chengdu China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Shenzhen China The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China School of Electronic Science and Engineering Nanjing University Jiangsu Nanjing210093 China The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Generative Diffusion Models (GDMs) have emerged as a transformative force in the realm of Generative Artificial Intelligence (GenAI), demonstrating their versatility and efficacy across various applications. The ability to model complex data distributions and generate high-quality samples has made GDMs particularly effective in tasks such as image generation and reinforcement learning. Furthermore, their iterative nature, which involves a series of noise addition and denoising steps, is a powerful and unique approach to learning and generating data. This paper serves as a comprehensive tutorial on applying GDMs in network optimization tasks. We delve into the strengths of GDMs, emphasizing their wide applicability across various domains, such as vision, text, and audio generation. We detail how GDMs can be effectively harnessed to solve complex optimization problems inherent in networks. The paper first provides a basic background of GDMs and their applications in network optimization. This is followed by a series of case studies, showcasing the integration of GDMs with Deep Reinforcement Learning (DRL), incentive mechanism design, Semantic Communications (SemCom), Internet of Vehicles (IoV) networks, etc. These case studies underscore the practicality and efficacy of GDMs in real-world scenarios, offering insights into network design. We conclude with a discussion on potential future directions for GDM research and applications, providing major insights into how they can continue to shape the future of network optimization. © 2023, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Multimodal Emotion Recognition Based on Multi-Scale Facial Features and Cross-Modal Attention 26

Multimodal Emotion Recognition Based on Multi-Scale Facial F...

引用

26th International Conference on Industrial Technology, ICIT 2025

作者： Bao, Chengao Chen, Luefeng Li, Min Wu, Min Pedrycz, Witold Hirota, Kaoru School of Automation China University of Geosciences Wuhan430074 China School of Automation Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6R 2G7 Canada Tokyo Institute of Technology Yokohama226-8502 Japan Tokyo Institute of Technology Tokyo226-8502 Japan

ISBN: (纸本)9798331521950

A multi-modal emotion recognition method based on facial multi-scale features and cross-modal attention (MS-FCA) network is proposed. The MSFCA model improves the traditional single-branch ViT network into a two-branch ViT architecture by using classification tokens in each branch to interact with picture embeddings in the other branch, which facilitates effective interactions between different scales of information. Subsequently, audio features are extracted using ResNet18 network. The cross-modal attention mechanism is used to obtain the weight matrices between different modal features, making full use of inter-modal correlation and effectively fusing visual and audio features for more accurate emotion recognition. Two datasets are used for the experiments: eNTERFACE'05 and REDVESS dataset. The experimental results show that the accuracy of the proposed method on the eNTERFACE'05 and REDVESS datasets is 85.42% and 83.84% respectively, which proves the effectiveness of the proposed method. © 2025 IEEE.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

arXiv

引用

arXiv 2022年

作者： Li, Zishuo Niazi, Muhammad Umar B. Liu, Changxin Mo, Yilin Johansson, Karl H. Department of Automation Tsinghua University Beijing100084 China Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States

This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. In other words, at each time, the attacker has the freedom to choose an arbitrary set of no more that p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observer for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. © 2022, CC BY-NC-ND.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Community Structure Recovery and Interaction Probability Estimation for Gossip Opinion Dynamics

arXiv

引用

arXiv 2021年

作者： Xing, Yu He, Xingkang Fang, Haitao Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology and Digital Futures Stockholm Sweden Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences Beijing China

We study how to jointly recover the community structure and estimate the interaction probabilities of gossip opinion dynamics. In this process, agents randomly interact pairwise, and there are stubborn agents never changing their states. Such a model illustrates how disagreement and opinion fluctuation arise in a social network. It is assumed that each agent is assigned with one of two community labels, and the agents interact with probabilities depending on their labels. The considered problem is to jointly recover the community labels of the agents and estimate interaction probabilities between the agents, based on a single trajectory of the model. We first study stability and limit theorems of the model, and then propose a joint recovery and estimation algorithm based on a trajectory. It is verified that the community recovery can be achieved in finite time, and the interaction estimator converges almost surely. We derive a sample-complexity result for the recovery, and analyze the estimator’s convergence rate. Simulations are presented for illustration of the performance of the proposed algorithm. © 2021, CC BY.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Tracking and Rejection using Linear Parameter-Varying control

arXiv

引用

arXiv 2021年

作者： Koelewijn, Patrick J.W. Tóth, Roland Nijmeijer, Henk Weiland, Siep Control Systems Group Department of Electrical Engineering Eindhoven University of Technology P.O. Box 513 Eindhoven5600 MB Netherlands Systems and Control Laboratory Institute for Computer Science and Control Budapest1111 Hungary Dynamics and Control Group Department of Mechanical Engineering Eindhoven University of Technology P.O. Box 513 Eindhoven5600 MB Netherlands

The Linear Parameter-Varying (LPV) framework has been introduced with the intention to provide stability and performance guarantees for analysis and controller synthesis for Nonlinear (NL) systems via convex methods. By extending results of the Linear Time-Invariant framework, mainly based on quadratic stability and performance using dissipativity theory, it has been assumed that they generalize tracking and disturbance rejection guarantees for NL systems. However, as has been shown in literature, stability and performance through standard dissipativity is not sufficient in order to satisfy the desired guarantees in case of reference tracking and disturbance rejection for nonlinear systems. We propose to solve this problem by the application of incremental dissipativity, which does ensure these specifications. A novel approach is proposed to synthesize and realize an NL controller which is able to guarantee incremental stability and performance for NL systems via convex optimization using methods from the LPV framework. Through simulations and experiments, the presented method is compared to standard LPV controller designs, showing significant performance improvements. Copyright © 2021, The Authors. All rights reserved.

关键词： Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

A Time-Series Higher-Order Network Hierarchical Evolution Model for Dynamic Interaction of Nodes

SSRN

引用

SSRN 2022年

作者： Yang, Xiaoteng Wu, Zhenqiang Zhang, WenBo Javaid, Shumaila School of Computer Science Shaanxi Normal University Xi’an710119 China Key Laboratory of Modern Teaching Technology Ministry of Education Xi’an710062 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China

The evolution of hierarchies in complex systems is an exciting phenomenon since hierarchies exist in many social and biological networks. So far, many approaches have been proposed, however, they are either based on the locality of the nodes or the cluster relationships between networks. These approaches often use traditional time-series network modeling methods that focus only on local static relationships between different nodes but ignore the dynamic interactions between real network nodes. Local static and dynamic global relationships should be considered to understand better the generation and maintenance of hierarchical phenomena in networks. To address this problem, we propose a long-term, flexible hierarchical evolution model for explaining the hierarchical phenomena arising in networks. Our model can integrate both local static and dynamic global information in the network and use time and higher-order inter-node interactions to integrate static and dynamic relationships. New interactions in the network are formed based on preference information between nodes, while old links fade out over time. In addition, we derive critical points for the hierarchical evolution of the system over long periods. Importantly, our model allows the comparison of network rank formation across different data as a way to perform rank evolution studies. © 2022, The Authors. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

An Efficient Spatial-Temporal Trajectory Planner for Autonomous Vehicles in Unstructured Environments

arXiv

引用

arXiv 2022年

作者： Han, Zhichao Wu, Yuwei Li, Tong Zhang, Lu Pei, Liuao Xu, Long Li, Chengyang Ma, Changjia Xu, Chao Shen, Shaojie Gao, Fei State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou310027 China Huzhou Institute of Zhejiang University Huzhou313000 China Department of Electrical and Systems Engineering University of Pennsylvania PhiladelphiaPA19104 United States Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong

As a core part of autonomous driving systems, motion planning has received extensive attention from academia and industry. However, real-time trajectory planning capable of spatial-temporal joint optimization is challenged by nonholonomic dynamics, particularly in the presence of unstructured environments and dynamic obstacles. To bridge the gap, we propose a real-time trajectory optimization method that can generate a high-quality whole-body trajectory under arbitrary environmental constraints. By leveraging the differential flatness property of car-like robots, we simplify the trajectory representation and analytically formulate the planning problem while maintaining the feasibility of the nonholonomic dynamics. Moreover, we achieve efficient obstacle avoidance with a safe driving corridor for unmodelled obstacles and signed distance approximations for dynamic moving objects. We present comprehensive benchmarks with State-of-the-Art methods, demonstrating the significance of the proposed method in terms of efficiency and trajectory quality. Real-world experiments verify the practicality of our algorithm. We will release our codes for the research community.1 Copyright © 2022, The Authors. All rights reserved.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Bioformers: Embedding Transformers for Ultra-Low Power sEMG-based Gesture Recognition

arXiv

引用

arXiv 2022年

作者： Burrello, Alessio Morghet, Francesco Bianco Scherer, Moritz Benatti, Simone Benini, Luca Macii, Enrico Poncino, Massimo Pagliari, Daniele Jahier DEI Università di Bologna Bologna Italy Department of Control and Computer Engineering Politecnico di Torino Turin Italy Integrated Systems Laboratory ETH Zurich Switzerland Department of Sciences and Methods for Engineering University of Modena and Reggio Emilia Italy Interuniversity Department of Regional and Urban Studies and Planning Politecnico di Torino Turin Italy

Human-machine interaction is gaining traction in rehabilitation tasks, such as controlling prosthetic hands or robotic arms. Gesture recognition exploiting surface electromyographic (sEMG) signals is one of the most promising approaches, given that sEMG signal acquisition is non-invasive and is directly related to muscle contraction. However, the analysis of these signals still presents many challenges since similar gestures result in similar muscle contractions. Thus the resulting signal shapes are almost identical, leading to low classification accuracy. To tackle this challenge, complex neural networks are employed, which require large memory footprints, consume relatively high energy and limit the maximum battery life of devices used for classification. This work addresses this problem with the introduction of the Bioformers. This new family of ultra-small attention-based architectures approaches state-of-the-art performance while reducing the number of parameters and operations of 4.9×. Additionally, by introducing a new inter-subjects pre-training, we improve the accuracy of our best Bioformer by 3.39%, matching state-of-the-art accuracy without any additional inference cost. Deploying our best performing Bioformer on a Parallel, Ultra-Low Power (PULP) microcontroller unit (MCU), the GreenWaves GAP8, we achieve an inference latency and energy of 2.72 ms and 0.14 mJ, respectively, 8.0× lower than the previous state-of-the-art neural network, while occupying just 94.2 kB of memory. © 2022, CC BY-SA.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

A Zeroth-Order Momentum Method for Risk-Averse Online Convex Games

A Zeroth-Order Momentum Method for Risk-Averse Online Convex...

引用

IEEE Conference on Decision and control

作者： Zifan Wang Yi Shen Zachary I. Bell Scott Nivison Michael M. Zavlanos Karl H. Johansson Division of Decision and Control Systems School of Electrical Enginnering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Mechanical Engineering and Materials Science Duke University Durham NC USA Air Force Research Laboratory Eglin AFB FL USA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

We consider risk-averse learning in repeated unknown games where the goal of the agents is to minimize their individual risk of incurring significantly high cost. Specifically, the agents use the conditional value at risk (CVaR) as a risk measure and rely on bandit feedback in the form of the cost values of the selected actions at every episode to estimate their CVaR values and update their actions. A major challenge in using bandit feedback to estimate CVaR is that the agents can only access their own cost values, which, however, depend on the actions of all agents. To address this challenge, we propose a new risk-averse learning algorithm with momentum that utilizes the full historical information on the cost values. We show that this algorithm achieves sub-linear regret and matches the best known algorithms in the literature. We provide numerical experiments for a Cournot game that show that our method outperforms existing methods.

关键词： Costs Estimation Games Numerical simulation Standards

来源：评论

学校读者我要写书评

暂无评论

Digital Map Generation Workflow Demonstrated on ZalaZONE Automotive Proving Ground Elements

Digital Map Generation Workflow Demonstrated on ZalaZONE Aut...

引用

IEEE Symposium on Network Operations and Management

作者： Árpád Somogyi Tamás Tettamanti Pál Varga Zsolt Szalay Dániel Baranyai Tamás Lovas Dept. of Photogrammetry and Geoinformatics Fac. of Civil Engineering Budapest University of Technology and Economics Budapest Hungary Systems and Control Laboratory Institute for Computer Science and Control of the Eötvös Loránd Research Network Budapest Hungary Dept. of Telecommunications and Media Informatics Fac. of Electrical Engineering and Informatics Budapest University of Technology and Economics Budapest Hungary Dept. of Automotive Technologies Fac. of Transportation Eng. and Vehicle Eng. Budapest University of Technology and Economics Budapest Hungary

One major goal of digital twin technology applied in the Architecture, engineering, and Construction (AEC) Industry is the mapping of roads and road environments with their associated information. Such digital twins can support cost-effective testing, simulations, and the production of mapping backgrounds for automated vehicles and generally for Cooperative, Connected and Automated Mobility (CCAM) developments. The efficient workflow that leads from data acquisition to finished products depends on a number of requirements and knowledge sets. The main contribution of the paper is a general methodology of creating HD-map from point cloud and image data set. Accordingly, the most widely used survey techniques are presented and the requirements for the objects to be derived are summarized. The paper then outlines a general implementation procedure as an expert knowledge through a real-life example, where the results obtained for the ZalaZONE Automotive Proving Ground are demonstrated.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：