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

Distributed Prescribed-Time Observer for Nonlinear systems in Block-Triangular Form

IEEE Control systems Letters 2025年 9卷 222-227页

作者： Vincent de Heij M. Umar B. Niazi Karl H. Johansson Saeed Ahmed Jan C. Willems Center for Systems and Control and the Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen Groningen The Netherlands Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology Stockholm Sweden Department of Electrical Engineering and Computer Science Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA USA

This letter proposes a design of a distributed prescribed-time observer for nonlinear systems representable in a block-triangular observable canonical form. Using a weighted average of neighbor estimates exchanged over a strongly connected digraph, each observer estimates the system state despite the limited observability of local sensor measurements. The proposed design guarantees that distributed state estimation errors converge to zero at a user-specified convergence time, irrespective of observers’ initial conditions. To achieve this prescribed-time convergence, distributed observers implement time-varying local output injection gains that monotonically increase and approach infinity at the prescribed time. The theoretical convergence is rigorously proven and validated through numerical simulations, where some implementation issues due to increasing gains have also been clarified.

关键词： Observers Convergence Nonlinear systems Symmetric matrices Observability Directed graphs Control systems Vectors Linear systems Electronic mail

来源：评论

学校读者我要写书评

暂无评论

cVTS: A Constrained Voronoi Tree Search Method for High Dimensional Analog Circuit Synthesis 23

cVTS: A Constrained Voronoi Tree Search Method for High Dime...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Aidong Zhao Xianan Wang Zixiao Lin Zhaori Bi Xudong Li Changhao Yan Fan Yang Li Shang Dian Zhou Xuan Zeng State Key Laboratory of Integrated Chips and Systems Microelectronics Department Fudan University Shanghai China Department of Electrical Engineering University of Texas at Dallas USA Department of Electrical and Computer Engineering University of California at San Diego USA School of Data Science Fudan University Shanghai China School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9798350323481

A constrained Voronoi tree-based domain decomposition method for high-dimensional Bayesian optimization is proposed to solve large scale analog circuit synthesis problems, which can be formulated as high-dimensional heterogeneous black-box optimization. Hierarchical Voronoi tree progressively breaks down the design space into partitions with implicit performance boundaries such that promising regions are efficiently explored. Fast exploitation is ensured in Voronoi nest via local Bayesian optimization with a few observations. A slice-enhanced Gibbs sampling method is proposed to sample acquisition function cMES in irregular polyhedrons with design constraints. Compared with state-of-the-art methods, cVTS achieves significant speed up without loss of accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

False Sense of Security on Protected Wi-Fi Networks

arXiv

引用

arXiv 2025年

作者： Lim, Yong Zhi Rahman, Hazmei Bin Abdul Sikdar, Biplab Information Systems Technology and Design Singapore University of Technology and Design Singapore Department of Electrical & Computer Engineering National University of Singapore Singapore

The Wi-Fi technology (IEEE 802.11) was introduced in 1997. With the increasing use and deployment of such networks, their security has also attracted considerable attention. Current Wi-Fi networks use WPA2 (Wi-Fi Protected Access 2) for security (authentication and encryption) between access points and clients. According to the IEEE 802.11i-2004 standard, wireless networks secured with WPA2-PSK (Pre-Shared Key) are required to be protected with a passphrase between 8 to 63 ASCII characters. However, a poorly chosen passphrase significantly reduces the effectiveness of both WPA2 and WPA3-Personal Transition Mode. The objective of this paper is to empirically evaluate password choices in the wild and evaluate weakness in current common practices. We collected a total of 3,352 password hashes from Wi-Fi access points and determine the passphrases that were protecting them. We then analyze these passwords to investigate the impact of user’s behavior and preference for convenience on passphrase strength in secured private Wi-Fi networks in Singapore. We characterized the predictability of passphrases that use the minimum required length of 8 numeric or alphanumeric characters, and/or symbols stipulated in wireless security standards, and the usage of default passwords, and found that 16 percent of the passwords show such behavior. Our results also indicate the prevalence of the use of default passwords by hardware manufacturers. We correlate our results with our findings and recommend methods that will improve the overall security and future of our Wi-Fi networks. © 2025, CC BY.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

Efficient Multi-user Offloading of Personalized Diffusion Models: A DRL-Convex Hybrid Solution

引用

IEEE Transactions on Mobile Computing 2025年

作者： Yang, Wanting Xiong, Zehui Guo, Song Mao, Shiwen Kim, Dong In Debbah, Merouane Singapore University of Technology and Design Pillar of Engineering Systems and Design Singapore Singapore University of Technology and Design Pillar of Information Systems Technology and Design Singapore The Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong Hong Kong Auburn University Department of Electrical and Computer Engineering Auburn36830 United States Sungkyunkwan University Department of Electrical and Computer Engineering Suwon16419 Korea Republic of Khalifa University KU 6G Research Center Department of Computer and Information Engineering Abu Dhabi127788 United Arab Emirates University Paris-Saclay CentraleSupelec Gif-sur-Yvette91192 France

Generative diffusion models like Stable Diffusion are at the forefront of the thriving field of generative models today, celebrated for their robust training methodologies and high-quality photorealistic generation capabilities. These models excel in producing rich content, establishing them as essential tools in the industry. Building on this foundation, the field has seen the rise of personalized content synthesis as a particularly exciting application. However, the large model sizes and iterative nature of inference make it difficult to deploy personalized diffusion models broadly on local devices with heterogeneous computational power. To address this, we propose a novel framework for efficient multi-user offloading of personalized diffusion models. This framework accommodates a variable number of users, each with different computational capabilities, and adapts to the fluctuating computational resources available on edge servers. To enhance computational efficiency and alleviate the storage burden on edge servers, we propose a tailored multi-user hybrid inference approach. This method splits the inference process for each user into two phases, with an optimizable split point. Initially, a cluster-wide model processes low-level semantic information for each user's prompt using batching techniques. Subsequently, users employ their personalized models to refine these details during the later phase of inference. Given the constraints on edge server computational resources and users' preferences for low latency and high accuracy, we model the joint optimization of each user's offloading request handling and split point as an extension of the Generalized Quadratic Assignment Problem (GQAP). Our objective is to maximize a comprehensive metric that balances both latency and accuracy across all users. To solve this NP-hard problem, we transform the GQAP into an adaptive decision sequence, model it as a Markov decision process, and develop a hybrid solution combining dee

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Active RIS-Aided Massive MIMO With Imperfect CSI and Phase Noise

引用

IEEE Transactions on Wireless Communications 2025年

作者： Peng, Zhangjie Zhu, Jianchen Pan, Cunhua Zhang, Zaichen Da Costa, Daniel Benevides Elkashlan, Maged Karagiannidis, George K. Shanghai Normal University College of Information Mechanical and Electrical Engineering Shanghai200234 China Southeast University National Mobile Communications Research Laboratory Nanjing210096 China Interdisciplinary Research Center for Communication Systems and Sensing Department of Electrical Engineering Dhahran31261 Saudi Arabia Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom Aristotle University of Thessaloniki Department of Electrical and Computer Engineering Greece Artificial Intelligence and Cyber Systems Research Center Lebanon

As a recently proposed reconfigurable intelligent surface (RIS) architecture, active RIS has drawn considerable interest. The important feature of the active RIS is its ability to strengthen the impinging signals to mitigate the multiplicative fading effect inherent in passive RIS-aided systems. Herein, we explore the performance of an active RIS-aided uplink multi-user massive multiple-input multiple-output (MIMO) system, considering the phase noise at the RIS. Furthermore, a two-timescale scheme is utilized, where the base station (BS) beamforming is designed based on the instantaneous aggregated channel state information (CSI), while the statistical CSI is used for designing the phase shifts of the active RIS. In addition, the linear minimum mean square error (LMMSE) estimator is adopted to estimate the aggregated channel, which combines both the cascaded and direct channels. According to the estimated channel, a closedform expression for the lower bound of achievable rate is derived. Based on the theoretical expressions, the power scaling laws for the considered system are also investigated. Specifically, when each user’s transmit power is proportionally reduced by the quantity of BS antennas M or RIS elements N, we find that the amplified thermal noise causes the lower bound of the achievable rate to approach zero as M or N tends to infinity. Moreover, an optimization approach based on a genetic algorithm (GA) is introduced to obtain the optimal phase shifts for maximizing the achievable rate. Numerical results reveal that the active RIS can greatly enhance the performance of the massive MIMO system compared to its passive counterpart. © 2002-2012 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Beamforming and Anti -Jamming with Intelligent Omni-Surfaces

Simultaneous Beamforming and Anti -Jamming with Intelligent ...

引用

IEEE Conference on Wireless Communications and Networking

作者： Yuhan Wang Shuhao Zeng Qingyu Liu Boya Di Hongliang Zhang School of Electronic and Computer Engineering Peking University Shenzhen Graduate School China Pengcheng Laboratory China Department of Electrical and Computer Engineering Princeton University USA School of Electronics Peking University China

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

Wireless transmission is vulnerable to malicious jamming attacks due to the openness of wireless channels, posing a severe threat to wireless communications. Current anti-jamming studies primarily focus on either enhancing desired signals or mitigating jamming, resulting in limited performance. To address this issue, intelligent omni-surface (lOS) is a promising solution. By jointly designing its reflective and refractive properties, the lOS can simultaneously nullify jamming and enhance desired signals. In this paper, we consider an lOS-aided multi-user anti-jamming communication system, aiming to improve desired signals and nullify jamming by optimizing lOS phase shifts and transmit beamforming. However, this is challenging due to the coupled and discrete lOS reflection and refraction phase shifts, the unknown jammer's beamformer, and imperfect jammer-related channel state information. To tackle this, we relax lOS phase shifts to continuous states and optimize with a coupling-aware algorithm using the Cauchy-Schwarz inequality and S-procedure, followed by a local search to recover discrete states. Simulation results show that the proposed scheme significantly improves the sum rate amid jamming attacks.

关键词： Wireless communication Array signal processing Simulation Reflection Jamming Channel state information

来源：评论

学校读者我要写书评

暂无评论

Dynamic Modeling and Fault Response Analysis of SMR-Integrated Power Grid

Dynamic Modeling and Fault Response Analysis of SMR-Integrat...

引用

IEEE Green Technologies Conference (IEEE-Green)

作者： Javier Bejarano Paras Mandal Department of Electrical and Computer Engineering Power and Renewable Energy Systems (PRES) Lab. The University of Texas at El Paso TX USA

ISBN: (数字)9798331520182

ISBN: (纸本)9798331520199

Small Modular Reactors (SMRs) are an emerging technology with load-following capabilities, offering significant potential for enhancing grid stability and resilience. This paper presents the development of an SMR model by replacing an existing generator in the IEEE 39-bus system with a synchronous machine round rotor configured to reflect the operational characteristics of an SMR. The paper focuses on analyzing the dynamic fault response of the SMR at various operating levels, including minimum generation, half, and maximum capacity. Key metrics such as terminal voltage (p.u.) are evaluated to assess the SMR's ability to maintain stability during and after fault scenarios. By examining the SMR's performance under different generation conditions, this paper provides valuable insights into the feasibility of integrating SMRs into modern power systems and their contributions to grid stability during transient events.

关键词： Power system dynamics Green products Power system stability Stability analysis Power system reliability Reliability Inductors Oscillators Resilience Load modeling

来源：评论

学校读者我要写书评

暂无评论

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time

arXiv

引用

arXiv 2025年

作者： Eden, Talya Levi, Reut Ron, Dana Rubinfeld, Ronitt Department of Computer Science Bar Ilan University Israel Efi Arazi School of Computer Science Reichman University Israel School of Electrical and Computer Engineering Tel Aviv University Israel Computer Science and Artificial Intelligence Laboratory MIT United States

Counting small subgraphs, referred to as motifs, in large graphs is a fundamental task in graph analysis, extensively studied across various contexts and computational models. In the sublinear-time regime, the relaxed problem of approximate counting has been explored within two prominent query frameworks: the standard model, which permits degree, neighbor, and pair queries, and the strictly more powerful augmented model, which additionally allows for uniform edge sampling. Currently, in the standard model, (optimal) results have been established only for approximately counting edges, stars, and cliques, all of which have a radius of one. This contrasts sharply with the state of affairs in the augmented model, where algorithmic results (some of which are optimal) are known for any input motif, leading to a disparity which we term the "scope gap" between the two models. In this work, we make significant progress in bridging this gap. Our approach draws inspiration from recent advancements in the augmented model and utilizes a framework centered on counting by uniform sampling, thus allowing us to establish new results in the standard model and simplify on previous results. In particular, our first, and main, contribution is a new algorithm in the standard model for approximately counting any Hamiltonian motif in sublinear time, where the complexity of the algorithm is the sum of two terms. One term equals the complexity of the known algorithms by Assadi, Kapralov, and Khanna (ITCS 2019) and Fichtenberger and Peng (ICALP 2020) in the (strictly stronger) augmented model and the other is an additional, necessary, additive overhead. Our second contribution is a variant of our algorithm that enables nearly uniform sampling of these motifs, a capability previously limited in the standard model to edges and cliques. Our third contribution is to introduce even simpler algorithms for stars and cliques by exploiting their radius-one property. As a result, we simplify all previo

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach to Smart Grid Energy Management Using the Osprey Optimization Algorithm 4

A Novel Approach to Smart Grid Energy Management Using the O...

引用

4th International Conference on Sentiment Analysis and Deep Learning, ICSADL 2025

作者： Rudrapogu, Nissisolomon Hemalatha, N. Warkad, Sanjay B Jayanthi, A. Vinoth, K. Jayaram, B. Lecturer in Eee Nissisolomon Rudrapogu Mbts Government Polytechnic College Department of Electrical and Electronics Engineering Section Andhra Pradesh Guntur522005 India Bharath Institute of Higher Education and Research Department of Electrical and Electronics Engineering Tamil Nadu Chennai600073 India P. R. Pote Patil College of Engineering & Management Department of Electrical Engineering Maharashtra Amravati444602 India Jeppiaar Institute of Technology Department of Physics Tamil Nadu Sriperumbudur631502 India Vel Tech Rangarajan Dr. Sagunthala R&d Institute of Science and Technology Department of Electrical and Electronics Engineering Tamil Nadu Chennai600062 India Rmk Engineering College Department of Computer Science and Business Systems Tamil Nadu Thiruvallur601206 India

ISBN: (纸本)9798331523923

Smart Grid Energy Management (SGEM) denotes the function of optimizing energy flow in the grid while enhancing grid efficiency and stability. One major issue is that increased integration of Renewable Energy Sources (RESs) may add a layer of complexity to EM, which may, in turn, reduce the reliability and stability of the grid. Keeping such challenges in mind, this paper proposes the Osprey Optimization Algorithm (OOA) on its part to enhance SGEM through various facets of load balancing and energy distribution. The objective of this method is to minimize the Mean Absolute Percentage Error (MAPE), enhancing the precision of energy predictions and optimizing grid performance. The OOA optimizes energy distribution in micro grids, improving efficiency and reducing power losses. The performance of the suggested OOA method is assessed by contrasting it with other optimization approaches that are currently in use, including Particle Swarm Optimization (PSO), Multi Objective Genetic Algorithm (MOGA), Sparrow Search Algorithm (SSA), and Multi Objective Wind Driven Optimization (MOWDO). The OOA method is implemented on the MATLAB platform. The outcomes show that the proposed OOA method provides superior performance in minimizing MAPE, achieving the lowest MAPE value of 0.28%, indicating its enhanced accuracy in energy demand forecasting and optimization. © 2025 IEEE.

关键词： Clean energy

来源：评论

学校读者我要写书评

暂无评论

Improved Scalable Lipschitz Bounds for Deep Neural Networks

arXiv

引用

arXiv 2025年

作者： Syed, Usman Hu, Bin The Coordinated Science Laboratory The Department of Electrical and Computer Engineering University of Illinois Urbana–Champaign ChampaignIL61801 United States

Computing tight Lipschitz bounds for deep neural networks is crucial for analyzing their robustness and stability, but existing approaches either produce relatively conservative estimates or rely on semidefinite programming (SDP) formulations (namely the LipSDP condition) that face scalability issues. Building upon ECLipsE-Fast, the state-of-the-art Lipschitz bound method that avoids SDP formulations, we derive a new family of improved scalable Lipschitz bounds that can be combined to outperform ECLipsE-Fast. Specifically, we leverage more general parameterizations of feasible points of LipSDP to derive various closed-form Lipschitz bounds, avoiding the use of SDP solvers. In addition, we show that our technique encompasses ECLipsE-Fast as a special case and leads to a much larger class of scalable Lipschitz bounds for deep neural networks. Our empirical study shows that our bounds improve ECLipsE-Fast, further advancing the scalability and precision of Lipschitz estimation for large neural networks. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：