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

IEEE Journal of Emerging and Selected Topics in Power Electronics 2025年

作者： Liu, Huanli Lin, Weiyang Liu, Zhitai Yu, Xinghu Buccella, Concettina Cecati, Carlo Harbin Institute of Technology Research Institute of Intelligent Control and Systems Harbin150001 China Ningbo Institute of Intelligent Equipment Technology Company Ltd Ningbo315200 China University of L'Aquila DigiPower srl Department of Information Engineering Computer Science and Mathematics L'Aquila67100 Italy

Dual three-phase permanent magnet synchronous motor drives have gained considerable interest in those applications requiring high levels of reliability. However, they often suffer from high-order harmonic currents and mismatch of motor parameters, resulting in degraded performance and reduced efficiency. Therefore, this paper proposes a dual-mode disturbance observer based model predictive current controller. Not only direct current disturbances caused by motor parameters, but also alternating current disturbances caused by high-order harmonic currents are explicitly modeled and estimated to achieve improved model accuracy. In addition, the observer parameter design is given in detail. Furthermore, a generalized predictive current controller with the integration of the proposed observer is developed to provide satisfactory harmonic current suppression capability and parameter robustness simultaneously. Proof of the stability with the proposed controller is given and several experiments and comparisons demonstrate the effectiveness of the proposed method. © 2013 IEEE.

关键词： Permanent magnets

Innate Cyber-Immunity and Acquired Cyber-Immunity across Multi-Area Power systems

学校读者我要写书评

暂无评论

IEEE Transactions on Power systems 2025年

作者： Hou, Jiazuo Song, Yue Hou, Yunhe Peng, Jimmy Chih-Hsien National University of Singapore Department of Electrical and Computer Engineering Singapore Tongji University Department of Control Science and Engineering National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology Shanghai201804 China The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong University of Hong Kong Shenzhen Institute of Research and Innovation Shenzhen518057 China

Organisms have evolved innate and acquired immune systems to defend against pathogens like coronaviruses. Similarly, power networks, threatened by cyber-attacks, desire cyber-immunity. Inspired by the immunology research, this study develops a cyber-immune strategy-characterizing innate cyber-immunity and establishing acquired cyber-immunity-for any selected portion of a power network (termed as power subnetwork) against stealthy false data injection (FDI) cyberattacks. Therein, without extrinsic protection and information asymmetry, this paper for the first time confirms the existence and provides closed-form conditions for power subnetworks that are innately immune to FDI cyber-attacks despite all measurements being compromised. Single-leader-multi-follower bi-level optimization models are then developed to strategically allocate measurement protection, leading to the acquired cyber-immunity, whose conditions for existence and the least cost are explicitly formulated. More importantly, a bi-directional cyber-immunity propagation mechanism is presented to provide the optimal spatial allocation of defense resources across adjacent subnetworks. It also explicitly determines the temporal allocation sequence, revealing its sequential and cumulative impacts on establishing cyber-immunity. This is achieved by designing recursive traversal algorithms, one of which is modelled as a post-order depth-first-search problem of a multi-fork tree. The proposed subnetwork-specific cyber-immune strategy is verified in a modified Australian National Electricity Market. © 1969-2012 IEEE.

关键词： Phishing

Policy Design in Long-Run Welfare Dynamics

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wu, Jiduan Abebe, Rediet Hardt, Moritz Stoica, Ana-Andreea Max Planck Institute for Intelligent Systems Tübingen AI Center Tübingen Germany Department of Computer Science ETH Zürich Switzerland ELLIS Institute Tübingen Germany

Improving social welfare is a complex challenge requiring policymakers to optimize objectives across multiple time horizons. Evaluating the impact of such policies presents a fundamental challenge, as those that appear suboptimal in the short run may yield significant long-term benefits. We tackle this challenge by analyzing the long-term dynamics of two prominent policy frameworks: Rawlsian policies, which prioritize those with the greatest need, and utilitarian policies, which maximize immediate welfare gains. Conventional wisdom suggests these policies are at odds, as Rawlsian policies are assumed to come at the cost of reducing the average social welfare, which their utilitarian counterparts directly optimize. We challenge this assumption by analyzing these policies in a sequential decision-making framework where individuals’ welfare levels stochastically decay over time, and policymakers can intervene to prevent this decay. Under reasonable assumptions, we prove that interventions following Rawlsian policies can outperform utilitarian policies in the long run, even when the latter dominate in the short run. We characterize the exact conditions under which Rawlsian policies can outperform utilitarian policies. We further illustrate our theoretical findings using simulations, which highlight the risks of evaluating policies based solely on their short-term effects. Our results underscore the necessity of considering long-term horizons in designing and evaluating welfare policies;the true efficacy of even well-established policies may only emerge over time. © 2025, CC BY-NC-ND.

关键词： Stochastic systems

ON ACCELERATING EDGE AI: OPTIMIZING RESOURCE-CONSTRAINED ENVIRONMENTS

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sander, Jacob Cohen, Achraf Dasari, Venkat R. Venable, Brent Jalaian, Brian Department of Computer Science University of West Florida PensacolaFL United States Department of Mathematics and Statistics University of West Florida PensacolaFL United States DEVCOM Army Research Laboratory Aberdeen Proving Ground MD United States Department of Intelligent Systems and Robotics University of West Florida Institute for Human & Machine Cognition PensacolaFL United States Department of Computer Science Department of Intelligent Systems and Robotics University of West Florida Institute for Human & Machine Cognition PensacolaFL United States

Resource-constrained edge deployments demand AI solutions that balance high performance with stringent compute, memory, and energy limitations. In this survey, we present a comprehensive overview of the primary strategies for accelerating deep learning models under such constraints. First, we examine model compression techniques-pruning, quantization, tensor decomposition, and knowledge distillation-that streamline large models into smaller, faster, and more efficient variants. Next, we explore Neural Architecture Search (NAS), a class of automated methods that discover architectures inherently optimized for particular tasks and hardware budgets. We then discuss compiler and deployment frameworks, such as TVM, TensorRT, and OpenVINO, which provide hardware-tailored optimizations at inference time. By integrating these three pillars into unified pipelines, practitioners can achieve multi-objective goals, including latency reduction, memory savings, and energy efficiency-all while maintaining competitive accuracy. We also highlight emerging frontiers in hierarchical NAS, neurosymbolic approaches, and advanced distillation tailored to large language models, underscoring open challenges like pre-training pruning for massive networks. Our survey offers practical insights, identifies current research gaps, and outlines promising directions for building scalable, platform-independent frameworks to accelerate deep learning models at the edge. © 2025, CC BY.

关键词： Budget control

Verifying Nonlinear Neural Feedback systems using Polyhedral Enclosures

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Akinwande, Samuel I. Sidrane, Chelsea Kochenderfer, Mykel J. Barrett, Clark Department of Aeronautical and Astronautical Engineering Stanford University StanfordCA94305 United States Department of Computer Science Stanford University StanfordCA94305 United States Division of Robotics Perception and Learning Intelligent Systems Department School of Electrical Engineering & Computer Science KTH Royal Institute of Technology Stockholm Sweden

As dynamical systems equipped with neural network controllers (neural feedback systems) become increasingly prevalent, it is critical to develop methods to ensure their safe operation. Verifying safety requires extending control theoretic analysis methods to these systems. Although existing techniques can efficiently handle linear neural feedback systems, relatively few scalable methods address the nonlinear case. We propose a novel algorithm for forward reachability analysis of nonlinear neural feedback systems. The approach leverages the structure of the nonlinear transition functions of the systems to compute tight polyhedral enclosures (i.e., abstractions). These enclosures, combined with the neural controller, are then encoded as a mixed-integer linear program (MILP). Optimizing this MILP yields a sound over-approximation of the forward-reachable set. We evaluate our algorithm on representative benchmarks and demonstrate an order of magnitude improvement over the current state of the art. Copyright © 2025, The Authors. All rights reserved.

关键词： Mixed-integer linear programming

Secure-by-Construction Synthesis for Control systems

学校读者我要写书评

暂无评论

IEEE Transactions on Automatic Control 2025年第6期70卷 4170-4177页

作者： Zhong, Bingzhuo Liu, Siyuan Caccamo, Marco Zamani, Majid Thrust of Artificial Intelligence Information Hub The Thrust of Intelligent Transportation System Hub China KTH Royal Institute of Technology Division of Decision and Control Systems Stockholm Sweden Technical University of Munich TUM School of Engineering and Design Germany University of Colorado Boulder Department of Computer Science United States Ludwig Maximilian University Department of Computer Science Munich Germany

In this note, we present the synthesis of secure-by-construction controllers that address safety and security properties simultaneously in cyber-physical systems. Our focus is on studying a specific security property called opacity, which characterizes the system's ability to maintain plausible deniability of its secret behavior in the presence of an intruder. These controllers are synthesized based on a concept of so-called (augmented) control barrier functions. We propose conditions that facilitate the construction of the desired (augmented) control barrier functions and their corresponding secure-by-construction controllers. To compute these functions, we propose an iterative scheme that leverages iterative sum-of-square programming techniques. This approach enables efficient computation of these functions, particularly for polynomial systems. Finally, we validate the effectiveness of our results through a case study of a vehicle. © 1963-2012 IEEE.

关键词： Iterative methods

Adaptive UAV-Assisted Hierarchical Federated Learning: Optimizing Energy, Latency, and Resilience for Dynamic Smart IoT Networks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yang, Xiaohong Liwang, Minghui Fu, Liqun Su, Yuhan Hosseinalipour, Seyyedali Wang, Xianbin Hong, Yiguang School of Informatics Xiamen University Fujian China Department of Control Science and Engineering The National Key Laboratory of Autonomous Intelligent Unmanned Systems China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Tongji University Shanghai China School of Electronic Science and Engineering Xiamen University Xiamen China Department of Electrical Engineering University at Buffalo-SUNY BuffaloNY United States Department of Electrical and Computer Engineering Western University ON Canada

Hierarchical Federated Learning (HFL) introduces intermediate aggregation layers, addressing the limitations of conventional Federated Learning (FL) in geographically dispersed environments with limited communication infrastructure. An application of HFL is in smart IoT systems, such as remote monitoring, disaster response, and battlefield operations, where cellular connectivity is often unreliable or unavailable. In these scenarios, UAVs serve as mobile aggregators, providing connectivity to the terrestrial IoT devices. This paper studies an HFL architecture for energy-constrained UAVs in smart IoT systems, pioneering a solution to minimize global training cost increased caused by UAV disconnection. In light of this, we formulate a joint optimization problem involving learning configuration, bandwidth allocation, and device-to-UAV association, and perform global aggregation in time before UAV drops disconnect and redeployment of UAVs. The problem explicitly accounts for the dynamic nature of IoT devices and their interruptible communications and is unveiled to be NP-hard. To address this, we decompose it into three subproblems. First, we optimize the learning configuration and bandwidth allocation using an augmented Lagrangian function to reduce training costs. Second, we propose a device fitness score, integrating data heterogeneity (via Kullback-Leibler divergence), device-to-UAV distances, and IoT device resources, and develop a twin-delayed deep deterministic policy gradient (TD3)-based algorithm for dynamic device-to-UAV assignment. Third, We introduce a low-complexity two-stage greedy strategy for finding the location of UAVs redeployment and selecting the appropriate global aggregator UAV. Experiments on real-world datasets demonstrate significant cost reductions and robust performance under communication interruptions. © 2025, CC BY-NC-ND.

关键词： Federated learning

Ontologies in Design: How Imagining a Tree Reveals Possibilities and Assumptions in Large Language Models 25

学校读者我要写书评

暂无评论

Ontologies in Design: How Imagining a Tree Reveals Possibili...

Proceedings of the 2025 CHI Conference on Human Factors in Computing systems

作者： Nava Haghighi Sunny Yu James A. Landay Daniela Rosner Computer Science Stanford University Stanford California USA Symbolic Systems Program Stanford University Stanford California USA Computer Science Department Stanford University Stanford California USA Human Centered Design & Engineering University of Washington Seattle Washington USA

Evolutionary Algorithm Based on Surrogate and Inverse Surrogate Models for Expensive Multiobjective Optimization

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2025年第5期12卷 961-973页

作者： Deng, Qi Kang, Qi Zhou, Mengchu Wang, Xiaoling Zhao, Shibing Wu, Siqi Ghahramani, Mohammadhossein Tongji University Department of Control Science and Engineering Shanghai 201804 China Macau University of Science and Technology Macao Institute of Systems Engineering Collaborative Laboratory for Intelligent Science and Systems 999078 Macao New Jersey Institute of Technology Helen and John C. Hartmann Department of Electrical and Computer Engineering Newark 07102 NJ United States Birmingham City University Birmingham B4 7RQ United Kingdom

When dealing with expensive multiobjective optimization problems, majority of existing surrogate-assisted evolutionary algorithms (SAEAs) generate solutions in decision space and screen candidate solutions mostly by using designed surrogate models. The generated solutions exhibit excessive randomness, which tends to reduce the likelihood of generating good-quality solutions and cause a long evolution to the optima. To improve SAEAs greatly, this work proposes an evolutionary algorithm based on surrogate and inverse surrogate models by 1) Employing a surrogate model in lieu of expensive (true) function evaluations;and 2) Proposing and using an inverse surrogate model to generate new solutions. By using the same training data but with its inputs and outputs being reversed, the latter is simple to train. It is then used to generate new vectors in objective space, which are mapped into decision space to obtain their corresponding solutions. Using a particular example, this work shows its advantages over existing SAEAs. The results of comparing it with state-of-the-art algorithms on expensive optimization problems show that it is highly competitive in both solution performance and efficiency. © 2014 Chinese Association of Automation.

关键词： Expensives multi-objective optimization reverse model surrogate-assisted evolutionary algorithms (SAEAs)

Generalized Interpolating Discrete Diffusion

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Rütte, Dimitri Von Fluri, Janis Ding, Yuhui Orvieto, Antonio Schölkopf, Bernhard Hofmann, Thomas Data Analytics Lab Department of Computer Science ETH Zurich Switzerland ELLIS Institute Tübingen Tübingen AI Center Germany Max Planck Institute for Intelligent Systems Tübingen Germany

While state-of-the-art language models achieve impressive results through next-token prediction, they have inherent limitations such as the inability to revise already generated tokens. This has prompted exploration of alternative approaches such as discrete diffusion. However, masked diffusion, which has emerged as a popular choice due to its simplicity and effectiveness, reintroduces this inability to revise words. To overcome this, we generalize masked diffusion and derive the theoretical backbone of a family of general interpolating discrete diffusion (GIDD) processes offering greater flexibility in the design of the noising processes. Leveraging a novel diffusion ELBO, we achieve compute-matched state-of-the-art performance in diffusion language modeling. Exploiting GIDD’s flexibility, we explore a hybrid approach combining masking and uniform noise, leading to improved sample quality and unlocking the ability for the model to correct its own mistakes, an area where autoregressive models notoriously have struggled. Our code and models are open-source: https://***/dvruette/gidd/ © 2025, CC BY.

关键词： Modeling languages