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

arXiv 2025年

作者： de Heij, Vincent Niazi, M.B. Umar Johansson, Karl H. Ahmed, Saeed Faculty of Science and Engineering University of Groningen Groningen9747 AG Netherlands Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology StockholmSE-100 44 Sweden Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States

This paper proposes 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. Copyright © 2025, The Authors. All rights reserved.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Certificate-Less Healthcare Signature Scheme for Secure Consumer technology-Centric Wireless Medical Sensor Devices

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Vimal, Vrince Raina, Vikas Alghamdi, Azzah Majumdar, Parijata Shabaz, Mohammad Rao, G Siva Nageswara Nimma, Divya Keshta, Ismail Soni, Mukesh Mody University of Science and technology Department of CSE SET Laxmangarh Rajasthan SikarNH-52 India Imam Abdalrhman Bin Faisal University College of Computer Science and Information Technology Computer Information Systems Department Khobar Saudi Arabia Indian Institute of Information Technology Department of Computer Science and Engineering Agartala India Model Institute of Engineering and Technology J and K Jammu India Koneru Lakshmaiah Education Foundation Department of Computer Science and Engineering AP Vaddeswaram India The University of Southern Mississippi United States AlMaarefa University College of Applied Sciences Computer Science and Information Systems Department Riyadh Saudi Arabia Lovely Professional University Division of Research and Development Phagwara India

The application of Consumer-Centric Wireless Medical Sensor Devices in the medical field has brought great convenience to doctors and patients. However, the transmission process may compromise patient privacy, making the authenticity and integrity of medical data a significant challenge in the healthcare industry. To address this issue, a certificate-less Healthcare Signature scheme is proposed to protect patient privacy. However, most schemes are unable to resist fully selective cipher text attacks and suffer from key exposure problems. To mitigate these issues, a scheme is proposed to resist fully selective attacks in real-time processing of Consumer-Centric Wireless Medical Sensor Devices with high latency issues, while utilizing parallel key isolation methods to address key exposure problems. The scheme's enforceability is proven based on the random oracle model and the computational Diffie-Hellman assumption, and its resistance to fully selective key attacks is proven based on hash-based collision resistance. It is shown that this plan works well for wireless sensor networks in the medical field. Sensor nodes have limited resources, and sending vast volumes of patient medical data online significantly raises processing and communication costs. The low processing power of edge devices limits the effectiveness and performance of medical services. Efficiency analysis using the MIRACL library demonstrates that the proposed scheme outperforms other relevant schemes in terms of efficiency at each stage, while also having lower communication overhead. © 1975-2011 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization with Finite Bit Adaptive Quantization for Efficient Communication and Precision Enhancement 63

Distributed Optimization with Finite Bit Adaptive Quantizati...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Rikos, Apostolos I. Jiang, Wei Charalambous, Themistoklis Johansson, Karl H. Artificial Intelligence Thrust of the Information Hub Guangzhou China The Hong Kong University of Science and Technology Department of Computer Science and Engineering Clear Water Bay Hong Kong Aalto University School of Electrical Engineering Department of Electrical Engineering and Automation Espoo Finland University of Cyprus School of Engineering Department of Electrical and Computer Engineering Nicosia1678 Cyprus Kth Royal Institute of Technology Division of Decision and Control Systems StockholmSE-100 44 Sweden

ISBN: (纸本)9798350316339

In realistic distributed optimization scenarios, individual nodes possess only partial information and communicate over bandwidth constrained channels. For this reason, the development of efficient distributed algorithms is essential. In our paper we addresses the challenge of unconstrained distributed optimization. In our scenario each node's local function exhibits strong convexity with Lipschitz continuous gradients. The exchange of information between nodes occurs through 3-bit bandwidth-limited channels (i.e., nodes exchange messages represented by a only 3 -bits). Our proposed algorithm respects the network's bandwidth constraints by leveraging zoom-in and zoom-out operations to adjust quantizer parameters dynamically. We show that during our algorithm's operation nodes are able to converge to the exact optimal solution. Furthermore, we show that our algorithm achieves a linear convergence rate to the optimal solution. We conclude the paper with simulations that highlight our algorithm's unique characteristics. © 2024 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

FadePrint - Satellite Spoofing Detection via Fading Fingerprinting

FadePrint - Satellite Spoofing Detection via Fading Fingerpr...

引用

Consumer Communications and Networking Conference, CCNC IEEE

作者： Gabriele Oligeri Savio Sciancalepore Alireza Sadighian Division of Information and Computing Technology (ICT) College of Science and Engineering (CSE) Hamad Bin Khalifa University (HBKU) Doha Qatar Eindhoven University of Technology and Eindhoven Artificial Intelligence Systems Institute (EAISI) Netherlands

While various methods exist to implement message authentication in different communication layers, the physical layer offers some unique and beneficial features for this purpose. Existing solutions authenticate transmitters at the physical layer by merging deep learning with physical-layer attributes, protecting against impersonation attacks. This approach requires a lengthy and resource-intensive training phase for every new transmitter that joins the network. However, for some scenarios (e.g. satellite communications), characterizing the channel experienced by the received signal might be effective in detecting impersonation. In this work, we propose FadePrint, a solution capable of detecting satellite spoofing attacks by fingerprinting the noise-fading process associated with the satellite communication channel. The fading characteristics of a satellite link differ significantly from terrestrial links (e.g., indoor), making it possible to distinguish between the two. Unlike other systems, FadePrint does not require retraining when new transducers are added to the network. We tested FadePrint with real satellite and indoor radio measurements and proved that FadePrint can effectively discriminate between a satellite transmitter and a fake indoor one, with an accuracy higher than 0.99 for all the considered configurations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning Feasibility Constraints for Control Barrier Functions

Learning Feasibility Constraints for Control Barrier Functio...

引用

European Control Conference (ECC)

作者： Wei Xiao Christos G. Cassandras Calin A. Belta Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology Division of Systems Engineering and Center for Information and Systems Engineering Boston University Brookline MA USA

It has been shown that optimizing quadratic costs while stabilizing affine control systems to desired (sets of) states subject to state and control constraints can be reduced to a sequence of Quadratic Programs (QPs) by using Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs). In this paper, we employ machine learning techniques to ensure the feasibility of these QPs, which is a challenging problem, especially for high relative degree constraints where High Order CBFs (HOCBFs) are required. To this end, we propose a sampling-based learning approach to learn a new feasibility constraint for CBFs; this constraint is then enforced by another HOCBF added to the QPs. The accuracy of the learned feasibility constraint is recursively improved by a recurrent training algorithm. We demonstrate the advantages of the proposed learning approach to constrained optimal control problems with specific focus on a robot control problem and on autonomous driving in an unknown environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TAPEMAN: Towards an Optimal Data Gathering Mechanism in Wireless Sensor Networks

引用

Chinese Journal of Electronics 2023年第4期19卷 594-598页

作者： Yu Gu Yusheng Ji Hongyang Chen Baohua Zhao Department of Computer Science University of Science and Technology of China Hefei China State Key Laboratory of Networking and Switching Technology Beijing China Information Systems Architecture Science Research Division NII Tokyo Japan Institute of Industrial Science University of Tokyo Tokyo Japan

In this paper, we study the lifetime optimization problem using a mobile sink node in a storage-constrained wireless sensor network, and propose an optimal data gathering mechanism named (TAPEMAN) which runs in three steps: first a tight upper bound of the network lifetime is derived through analysis of energy consumption, then we generate a Traveling salesman problem (TSP) solution based on a 2-approximation $O(n^{2})$ algorithm. A judgment will be made about whether this solution is optimal. If the answer is yes, TAPEMAN terminates. If not, a novel data diffusion scheme is used to distribute data to neighboring nodes, in order to avoid data leaking. We prove that under some reasonable assumptions, our algorithm can achieve this upperbound. Simulation results demonstrate the efficiency of our proposed solution and substantiate the importance of using sink mobility for energy-constrained sensor networks.

关键词： Wireless communication Wireless sensor networks Energy consumption Upper bound Simulation Traveling salesman problems Delays

来源：评论

学校读者我要写书评

暂无评论

Using Mobile Sinks in WSN: Computational Complexity and a Theoretical Bound

引用

Chinese Journal of Electronics 2023年第1期20卷 147-150页

In this paper, we study the lifetime optimization problem in wireless sensor networks using mobile sink nodes. This problem is inherently difficult since we need to consider both sink scheduling and data routing. Through a simple case study we develop a novel notation named the Placement pattern (PP) to bound traffic patterns with candidate locations. This significantly decreases the number of elements needed to be scheduled. Based on the PP, we mathematically formulate this optimization problem as a Mixed-integer non-linear programming (MINLP), which is very tough and time consuming to solve. By proving that the problem is NP-complete, we point out that instead of seeking an optimal algorithm, heuristic algorithms, especially those with performance guarantee, would be much more desirable to develop. Furthermore, in order to help identify performance gains of heuristic algorithms proposed in the future, we develop a Linear programming (LP) formulation which serves as an upper bound by adopting a reformulation and relaxation technique.

关键词： Wireless sensor networks Upper bound Heuristic algorithms Traffic control Programming Performance gain Routing

来源：评论

学校读者我要写书评

暂无评论

Sex Difference in Atrial Fibrillation Recurrence After Catheter Ablation

Sex Difference in Atrial Fibrillation Recurrence After Cathe...

引用

International Conference on Awareness science and technology (iCAST)

作者： Xue Zhou Xin Zhu Tianhui Li Keijiro Nakamura Ming Huang Division of Information Systems University of Aizu Aizu-Wakamatsu Japan Division of Cardiovascular Medicine Toho University Ohashi Medical Center Tokyo Japan Graduate School of Science and Technology Nara Institute of Science and Technology Ikoma Japan

Atrial fibrillation (AF) is a common sustained arrhythmia associated with increased risks of cardiovascular and renal diseases and adverse clinical outcomes, including mortality. Catheter ablation is an established method to restore sinus rhythm, but AF recurrence remains high. The impact of sex differences on recurrence after catheter ablation is poorly understood. This study investigated sex differences in AF recurrence using a propensity score matched cohort. A multiple imputation method, "Generates Multivariate Imputations by Chained Equations," addressed missing variables. Univariate Cox proportional hazards regression analysis identified variables significantly associated with AF recurrence (p < 0.05). Propensity score matching created a matched cohort with sex as the dependent variable and significant variables as independent variables. The study included 507 AF patients (143 females, 364 males), with 147 experiencing AF recurrence. Recurrence rates did not significantly differ between females and males (33.6% vs. 27.2%, p = 0.189). After 1:1 matching, 232 patients (116 females, 116 males) were included. AF recurrence was higher in females than males (33.6% vs. 12.9%, p < 0.001). The recurrence-free curves of females and males differed significantly (p < 0.001). Females had a higher risk of AF recurrence than males (hazard ratio: 2.70, 95% confidence interval: 1.49-4.90, p = 0.001).This study highlights the importance of considering sex disparities in AF management and treatment strategies to improve patient outcomes and personalize care.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Coordination and Synchronization of Multi-Robot systems Under Recurring Linear Temporal Logic

arXiv

引用

arXiv 2025年

作者： Peron, Davide Fernandez-Ayala, Victor Nan Vlahakis, Eleftherios E. Dimarogonas, Dimos V. Department of Information Engineering University of Padova Padova35122 Italy Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden

We consider multi-robot systems under recurring tasks formalized as linear temporal logic (LTL) specifications. To solve the planning problem efficiently, we propose a bottom-up approach combining offline plan synthesis with online coordination, dynamically adjusting plans via real-time communication. To address action delays, we introduce a synchronization mechanism ensuring coordinated task execution, leading to a multi-agent coordination and synchronization framework that is adaptable to a wide range of multi-robot applications. The software package is developed in Python and ROS2 for broad deployment. We validate our findings through lab experiments involving nine robots showing enhanced adaptability compared to previous methods. Additionally, we conduct simulations with up to ninety agents to demonstrate the reduced computational complexity and the scalability features of our work. © 2025, CC BY.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

Optimized Precoding for MU-MIMO With Fronthaul Quantization

arXiv

引用

arXiv 2022年

作者： Khorsandmanesh, Yasaman Björnson, Emil Jaldén, Joakim The Division of Communication Systems KTH Royal Institute of Technology Stockholm Sweden The Division of Information Science and Engineering KTH Royal Institute of Technology Stockholm Sweden

One of the first widespread uses of multi-user multiple-input multiple-output (MU-MIMO) is in 5G networks, where each base station has an advanced antenna system (AAS) that is connected to the baseband unit (BBU) with a capacity-constrained fronthaul. In the AAS configuration, multiple passive antenna elements and radio units are integrated into a single box. This paper considers precoded downlink transmission over a single-cell MU-MIMO system. We study optimized linear precoding for AAS with a limited-capacity fronthaul, which requires the precoding matrix to be quantized. We propose a new precoding design that is aware of the fronthaul quantization and minimizes the mean-squared error at the receiver side. We compute the precoding matrix using a sphere decoding (SD) approach. We also propose a heuristic low-complexity approach to quantized precoding. This heuristic is computationally efficient enough for massive MIMO systems. The numerical results show that our proposed precoding significantly outperforms quantization-unaware precoding and other previous approaches in terms of the sum rate. The performance loss for our heuristic method compared to quantization-aware precoding is insignificant considering the complexity reduction, which makes the heuristic method feasible for real-time applications. We consider both perfect and imperfect channel state information. Copyright © 2022, The Authors. All rights reserved.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：