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

arXiv 2021年

作者： Yuan, Ye Liu, Jun Jin, Dou Yue, Zuogong Chen, Ruijuan Wang, Maolin Sun, Chuan Xu, Lei Hua, Feng He, Xin Yi, Xinlei Yang, Tao Zhang, Hai-Tao Sui, Shaochun Ding, Han School of Artificial Intelligence and Automation Huazhong University of Science and Technology School of Mechanical Science and Engineering Huazhong University of Science and Technology Department of Applied Mathematics University of Waterloo Canada State Key Laboratory of Synthetical Automation for Process Industries Northeastern University United States School of Electrical Engineering and Computer Science Digital Futures Kth Royal Institute of Technology Co. Ltd.

Traditional machine learning relies on a centralized data pipeline, i.e., data are provided to a central server for model training. In many applications, however, data are inherently fragmented. Such a decentralized nature of these databases presents the biggest challenge for collaboration: sending all decentralized datasets to a central server raises serious privacy concerns. Although there has been a joint effort in tackling such a critical issue by proposing privacy-preserving machine learning frameworks, such as federated learning, most state-of-the-art frameworks are built still in a centralized way, in which a central client is needed for collecting and distributing model information (instead of data itself) from every other client, leading to high communication pressure and high vulnerability when there exists a failure at or attack on the central client. Here we propose a principled decentralized federated learning algorithm (DeceFL), which does not require a central client and relies only on local information transmission between clients and their neighbors, representing a fully decentralized learning framework. It has been further proven that every client reaches the global minimum with zero performance gap and achieves the same convergence rate O(1/T) (where T is the number of iterations in gradient descent) as centralized federated learning when the loss function is smooth and strongly convex. Finally, the proposed algorithm has been applied to a number of applications to illustrate its effectiveness for both convex and nonconvex loss functions, demonstrating its applicability to a wide range of real-world medical and industrial applications. Copyright © 2021, The Authors. All rights reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

Stochastic Stability of Discrete-time Phase-coupled Oscillators over Uncertain and Random Networks

arXiv

引用

arXiv 2021年

作者： Jafarian, Matin Mamduhi, Mohammad H. Johansson, Karl H. The Delft Center for Systems and Control Delft University of Technology Netherlands The Automatic Control Laboratory ETH Zürich Switzerland The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Digital Futures Sweden

This article studies stochastic relative phase stability, i.e., stochastic phase-cohesiveness, of discrete-time phase-coupled oscillators. Stochastic phase-cohesiveness in two types of networks is studied. First, we consider oscillators coupled with 2π-periodic odd functions over underlying undirected graphs subject to both multiplicative and additive stochastic uncertainties. We prove stochastic phase-cohesiveness of the network with respect to two specific, namely in-phase and anti-phase, sets by deriving sufficient coupling conditions. We show the dependency of these conditions on the size of the mean values of additive and multiplicative uncertainties, as well as the sign of the mean values of multiplicative uncertainties. Furthermore, we discuss the results under a relaxation of the odd property of the coupling function. Second, we study an uncertain network in which the multiplicative uncertainties are governed by the Bernoulli process representing the well-known Erdös-Rényi network. We assume constant exogenous frequencies and derive sufficient conditions for achieving both stochastic phase-cohesive and phase-locked solutions, i.e., stochastic phase-cohesiveness with respect to the origin. For the latter case, where identical exogenous frequencies are assumed, we prove that any positive probability of connectivity leads to phase-locking. Thorough analyses are provided, and insights obtained from stochastic analysis are discussed, along with numerical simulations to validate the analytical results. © 2021, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Consistent Kalman flters for nonlinear uncertain systems over sensor networks

引用

control Theory and Technology 2020年第4期18卷 399-408页

作者： Xingkang He Wenchao Xue Haitao Fang Xiaoming Hu Division of Decision and Control Systems School of Electrical Engineering and Computer ScienceKTH Royal Institute of Technology10044 StockholmSweden LSC NCMISAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China Optimization and Systems Theory Department of MathematicsKTH Royal Institute of Technology10044 StockholmSweden

In this paper,we study how to design filters for nonlinear uncertain systems over sensor *** intoduce two Kalmantype nonlinear fitrs in centralied and dstrbute ***,the tuning method for the parameters of the filteres is established to ensure the consistency,i.e..the mean square error is upper bounded by a known parameter matrix at each *** apply the consistent fiters to the track to-track association analysis of multi targets with uncertain dynamics.A novel track to-track asocaion algoritm is proposed to idenify whether two tracks are from the same *** is proven that the resulting probability of *** is lower than the desired *** simulations on *** track association are given to show the ffetives of the methods.

关键词： Kalman fiter Consistencey Distributed fiter Track-to-rack asociation

来源：评论

学校读者我要写书评

暂无评论

Sampled-Data Observer Design for Space-Varying Distributed Parameter Systems

Sampled-Data Observer Design for Space-Varying Distributed P...

引用

第三十九届中国控制会议

作者： Zi-Peng Wang Huai-Ning Wu Tingwen Huang School of Electrical Engineering University of Jinan Science and Technology on Aircraft Control Laboratory School of Automation Science and Electrical EngineeringBeihang University Science Program Texas A&M University at Qatar

This paper considers the sampled-data observer design problem of space-varying distributed parameter systems（DPSs）. By utilizing a Lyapunov functional, a sampled-data observer design is developed by spatial linear matrix inequalities（SLMIs） to guarantee the exponential stability for the estimation error DPS. Furthermore, to solve SLMIs, the sampled-data observer design for space-varying DPSs is formulated as an LMI feasibility problem. Lastly, simulation results of a numerical example are provided to illustrate the effectiveness of the proposed method.

关键词： Sampled-data observer distributed parameter systems（DPSs） spatial linear matrix inequality（SLMI）

来源：评论

学校读者我要写书评

暂无评论

Verifying Contracts for Perturbed control Systems using Linear Programming

arXiv

引用

arXiv 2021年

作者： Sharf, Miel Besselink, Bart Johansson, Karl Henrik Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden Bernoulli Institute for Mathematics Computer Science and Artificial Intelligence University of Groningen Groningen9700 AK Netherlands

Verifying specifications for large-scale control systems is of utmost importance, but can be hard in practice as most formal verification methods can not handle high-dimensional dynamics. Contract theory has been proposed as a modular alternative to formal verification in which specifications are defined by assumptions on the inputs to a component and guarantees on its outputs. In this paper, we present linear-programming-based tools for verifying contracts for control systems. We first consider the problem of verifying contracts defined by time-invariant inequalities for unperturbed systems. We use kinduction to show that contract verification can be achieved by considering a collection of implications between inequalities, which are then recast as linear programs. We then move our attention to perturbed systems. We present a comparison-based framework, verifying that a perturbed system satisfies a contract by checking that the corresponding unperturbed system satisfies a robustified (and ∊-approximated) contract. In both cases, we present explicit algorithms for contract verification, proving their correctness and analyzing their complexity. We also demonstrate the verification process for two case studies, one considering a two-vehicle autonomous driving scenario, and one considering formation control of a multi-agent system. Copyright © 2021, The Authors. All rights reserved.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

A new family of feasible methods for distributed resource allocation

arXiv

引用

arXiv 2021年

作者： Wu, Xuyang Magnússon, Sindri Johansson, Mikael The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-100 44 Sweden The Department of Computer and System Science Stockholm University StockholmSE-164 07 Sweden

Distributed resource allocation is a central task in network systems such as smart grids, water distribution networks, and urban transportation systems. When solving such problems in practice it is often important to have non-asymptotic feasibility guarantees for the iterates, since overallocation of resources easily causes systems to break down. In this paper, we develop a distributed resource reallocation algorithm where every iteration produces a feasible allocation. The algorithm is fully distributed in the sense that nodes communicate only with neighbors over a given communication network. We prove that under mild conditions the algorithm converges to a point arbitrarily close to the optimal resource allocation. Numerical experiments demonstrate the competitive practical performance of the algorithm. Copyright © 2021, The Authors. All rights reserved.

关键词： Water distribution systems

来源：评论

学校读者我要写书评

暂无评论

Improving the initialization speed for long-range NRTK in network solution mode

引用

Science China(Technological Sciences) 2020年第5期63卷 866-873页

作者： ZHANG Ming LÜJinHu BAI ZhengDong LIU Hui FAN ChengCheng Key Laboratory of Systems and Control Institute of Systems ScienceAcademy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China School of Automation Science and Electrical Engineering Beihang UniversityBeijing 100191China Institute of Geomatics Tsinghua UniversityBeijing 100084China GNSS Research Center Wuhan UniversityWuhan 430079China Guangxi Zhuang Autonomous Region Remote Sensing Information Surveying and Mapping Institute Nanning 530023China

Initialization speed is one of the most important factors in network real time kinematic(NRTK)*** to the low correlation among the error sources of reference stations,it is difficult to fix reference station ambiguities of long-range NRTK *** traditional reference stations ambiguity resolution(AR)methods,baselines are usually solved independently which is called baseline solution(BS)mode in this *** the correlations among baselines are not taken into consideration in ambiguities estimation,the AR speed is ***,tens of minutes or longer time is required to *** propose a network solution(NS)mode approach,in which the correlations among the double-difference ambiguities(DDAs)as well as double-difference ionospheric delays(DDIDs)of different baselines are considered in estimating float ambiguity *** results show that the float ambiguity solutions obtained are more accurate with an improved ***,initialization speed is significantly increased by 18%in NS mode.

关键词： initialization speed network real time kinematic(NRTK) reference station ambiguity resolution(AR) network solution(NS)mode baseline solution(BS)mode

来源：评论

学校读者我要写书评

暂无评论

Improving audio embeddings with squeeze-and-excitation: Introducing SaEENet

引用

Knowledge-Based Systems 2025年 324卷

作者： Andrés Carofilis Laura Fernández-Robles Enrique Alegre Eduardo Fidalgo Dept. of Electrical Systems and Automation Engineering. School of Industrial Computer and Aerospace Engineering Universidad de León Campus Vegazana 24007 León Spain INCIBE (Spanish National Cybersecurity Institute) León Spain Dept. of Mechanical Computer and Aerospace Engineering Universidad de León Campus Vegazana 24007 León Spain

In this paper, we propose SaEENet, a novel neural network architecture to generate richer embeddings based on those generated by a pre-trained WavLM-large model and a set of convolutional layers fed by MFCCs. We employ 1D depthwise separable convolutions and GRU layers, and, to the best of our knowledge, we introduce for the first time the use of squeeze-and-excitation (SE) blocks for audio embedding weighting. The use of SE allows the model to assign a higher or lower relevance to each embedding generated from small audio segments and thus discard information generated from voiceless segments or segments with non-relevant information. In addition, we evaluated three different approaches for SE blocks to determine the most useful for the selected tasks. SaEENet outperforms similar models, such as the MEWHEV model, in the language identification, accent identification, and speaker identification tasks, achieving an improvement of 0.9%, 1.41%, and 4.01%, respectively, using 31.73% fewer trainable parameters. The results presented show that individual embeddings have varying effects on performance and that the integration of weighting mechanisms in SaEENet enhances accuracy in several speech classification tasks, highlighting the value of this approach for future applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust Transmission Scheduling for UAV-assisted Millimeter-Wave Train-Ground Communication System

arXiv

引用

arXiv 2022年

作者： Ma, Yunhan Niu, Yong Han, Zhu Ai, Bo Li, Kai Zhong, Zhangdui Wang, Ning The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China The Beijing Engineering Research Center of High-speed Railway Broadband Mobile Communications Beijing Jiaotong University Beijing100044 China The National Mobile Communications Research Laboratory Southeast University Nanjing211189 China The Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States The Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of Porto Portugal The School of Information Engineering Zhengzhou University Zhengzhou450001 China

With the explosive growth of mobile data, the demand of high-speed railway (HSR) passengers for broadband wireless access services urgently needs the support of ultra-high-speed scenario broadband wireless communication. Millimeter-wave (mmWave) can achieve high data transmission rates, but it is accompanied by high propagation loss and vulnerability to blockage. To address this issue, developments of directional antennas and unmanned aerial vehicles (UAVs) enhance the robustness of the mmWave train-ground communication system. In this paper, we propose a UAV and MRs relay assistance (UMRA) algorithm to effectively overcome link blockage, which can maximize the number of transmission flows on the premise of meeting QoS requirements and channel qualities. First, we formulate a mixed integer nonlinear programming (MINLP) problem for UAV trajectory design and transmission scheduling in the full-duplex (FD) mode. Then, in UMRA, the relay decision algorithm and transmission scheduling algorithm based on graph theory are proposed, which make a good tradeoff between computation complexity and system performance. Extensive simulation results show that a suitable UAV position will greatly improve the performance of the UMRA algorithm and make it close to the optimal solution. Compared with the other two existing benchmark schemes, with the high channel quality requirements and large-area blockage, UMRA can greatly improve the number of completed flows and system throughput. Copyright © 2022, The Authors. All rights reserved.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Dynamic Pricing for Power control in Remote State Estimation

引用

IFAC-PapersOnLine 2020年第2期53卷 11038-11043页

作者： Kemi Ding Xiaoqiang Ren Hongsheng Qi Guodong Shi Xiaofan Wang Ling Shi School of Electrical and Electronic Engineering Nanyang Technological University School of Mechatronic Engineering and Automation Shanghai University Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Aerospace Mechanical and Mechatronic Engineering The University of Sydney Department of Electronic and Computer Engineering Hong Kong University of Science and Technology

This paper considers the remote state estimation with multiple sensors. Each sensor transmits its sensing data to a remote estimator over a shared channel, where simultaneous transmissions are allowed. Regrading the transmission of other sensors as interference signals, the system designer should coordinate the sensors appropriately in order to maximize the overall estimation performance. Motivated by microeconomics, we treat sensors as self-interested power buyers under different unit prices announced by the system designer. Accordingly, the strategic interactions among sensors are formulated in a non-cooperative game, upon which the existence and uniqueness of a pure equilibrium solution are proved. Even if the game admits a conflict of interests among sensors, under well-designed prices, the game outcome aligns with the global optimal solution. We also devise an algorithm to compute these prices with simple iterations, which is given in explicit forms for ease of implementation. Numerical examples are given to demonstrate the developed results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：