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

Abstraction-Free Control Synthesis to Satisfy Temporal Logic Constraints under Sensor Faults and Attacks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Niu, Luyao Li, Zhouchi Clark, Andrew The Network Security Lab Department of Electrical and Computer Engineering University of Washington SeattleWA98195-2500 United States The Department of Electrical and Computer Engineering Worcester Polytechnic Institute WorcesterMA01609 United States The Electrical and Systems Engineering Department McKelvey School of Engineering Washington University in St. Louis St. LouisMO63130 United States

We study the problem of synthesizing a controller to satisfy a complex task in the presence of sensor faults and attacks. We model the task using Gaussian distribution temporal logic (GDTL), and propose a solution approach that does not rely on computing any finite abstraction to model the system. We decompose the GDTL specification into a sequence of reach-avoid sub-tasks. We develop a class of fault-tolerant finite time convergence control barrier functions (CBFs) to guarantee that a dynamical system reaches a set within finite time almost surely in the presence of malicious attacks. We use the fault-tolerant finite time convergence CBFs to guarantee the satisfaction of 'reach' property. We ensure 'avoid' part in each sub-task using fault-tolerant zeroing CBFs. These fault-tolerant CBFs formulate a set of linear constraints on the control input for each sub-task. We prove that if the error incurred by system state estimation is bounded by a certain threshold, then our synthesized controller fulfills each reach-avoid sub-task almost surely for any possible sensor fault and attack, and thus the GDTL specification is satisfied with probability one. We demonstrate our proposed approach using a numerical study on the coordination of two wheeled mobile robots. © 2022, CC BY.

关键词： Temporal logic

Empowering Computing and networks Convergence System with Distributed Cooperative Routing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hu, Yujiao Jia, Qingmin Shen, Meng Xie, Renchao Huang, Tao Yu, F. Richard Future Network Research Center Purple Mountain Laboratories Nanjing211111 China Pervasive Communication Research Center Purple Mountain Laboratories Nanjing211111 China The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China The Department of Systems and Computer Engineering Carleton University Ottawa Canada

The emergence of intelligent applications and recent advances in the fields of computing and networks are driving the development of computing and networks convergence (CNC) system. However, existing researches failed to achieve comprehensive scheduling optimization of computing and network resources. This shortfall results in some requirements of computing requests unable to be guaranteed in an end-to-end service pattern, negatively impacting the development of CNC systems. In this article, we propose a distributed cooperative routing framework for the CNC system to ensure the deadline requirements and minimize the computation cost of requests. The framework includes trading plane, management plane, control plane and forwarding plane. The cross-plane cooperative end-to-end routing schemes consider both computation efficiency of heterogeneous servers and the network congestion degrees while making routing plan, thereby determining where to execute requests and corresponding routing paths. Simulations results substantiates the performance of our routing schemes in scheduling computing requests in the CNC system. © 2024, CC BY-NC-ND.

关键词： Routing protocols

Reliability-Latency-Rate Tradeoff in Low-Latency Communications with Finite-Blocklength Coding

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Lintao Chen, Wei Popovski, Petar Letaief, Khaled B. Department of Electronic Engineering Tsinghua University Beijing100084 China State Key Laboratory of Space Network and Communications The Beijing National Research Center for Information Science and Technology Beijing100084 China Department of Electronic Systems Aalborg University Aalborg9220 Denmark Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Clear Water Bay Hong Kong

Low-latency communication plays an increasingly important role in delay-sensitive applications by ensuring the real-time information exchange. However, due to the constraint on the maximum instantaneous power, guaranteeing bounded latency is challenging. In this paper, we investigate the reliability-latency-rate tradeoff in low-latency communication systems with finite-blocklength coding (FBC). Specifically, we are interested in the fundamental tradeoff between error probability, delay-violation probability (DVP), and service rate. Based on the effective capacity (EC), we present the gain-conservation equations to characterize the reliability-latency-rate tradeoffs in low-latency communication systems. In particular, we investigate the low-latency transmissions over an additive white Gaussian noise (AWGN) channel and a Nakagami-m fading channel. By defining the service rate gain, reliability gain, and real-time gain, we conduct an asymptotic analysis to reveal the fundamental reliability-latency-rate tradeoff of ultra-reliable and low-latency communications in the high signal-to-noise-ratio (SNR) regime. To analytically evaluate and optimize the quality-of-service-constrained throughput of low-latency communication systems adopting FBC, an EC-approximation method is conceived to derive the closed-form expression of that throughput. Our results may offer some insights into the efficient scheduling of low-latency wireless communications, in which statistical latency and reliability metrics are crucial. © 2023, CC BY.

关键词： Asymptotic analysis

G2Face: High-Fidelity Reversible Face Anonymization via Generative and Geometric Priors

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yang, Haoxin Xu, Xuemiao Xu, Cheng Zhang, Huaidong Qin, Jing Wang, Yi Heng, Pheng-Ann He, Shengfeng The School of Computer Science and Engineering South China University of Technology Guangzhou China Guangdong Engineering Center for Large Model and GenAI Technology State Key Laboratory of Subtropical Building and Urban Science China The Centre for Smart Health The Hong Kong Polytechnic University Hong Kong The School of Future Technology South China University of Technology Guangzhou China The School of Computer Science and Network Security Dongguan University of Technology Dongguan China The Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong The School of Computing and Information Systems Singapore Management University Singapore

Reversible face anonymization, unlike traditional face pixelization, seeks to replace sensitive identity information in facial images with synthesized alternatives, preserving privacy without sacrificing image clarity. Traditional methods, such as encoder-decoder networks, often result in significant loss of facial details due to their limited learning capacity. Additionally, relying on latent manipulation in pre-trained GANs can lead to changes in ID-irrelevant attributes, adversely affecting data utility due to GAN inversion inaccuracies. This paper introduces G2Face, which leverages both generative and geometric priors to enhance identity manipulation, achieving high-quality reversible face anonymization without compromising data utility. We utilize a 3D face model to extract geometric information from the input face, integrating it with a pre-trained GAN-based decoder. This synergy of generative and geometric priors allows the decoder to produce realistic anonymized faces with consistent geometry. Moreover, multi-scale facial features are extracted from the original face and combined with the decoder using our novel identity-aware feature fusion blocks (IFF). This integration enables precise blending of the generated facial patterns with the original ID-irrelevant features, resulting in accurate identity manipulation. Extensive experiments demonstrate that our method outperforms existing state-of-the-art techniques in face anonymization and recovery, while preserving high data utility. Code is available at https://***/Harxis/G2Face. Copyright © 2024, The Authors. All rights reserved.

关键词： Anonymity

An Analytical Framework for Control Synthesis of Cyber-Physical systems with Safety Guarantee

学校读者我要写书评

暂无评论

An Analytical Framework for Control Synthesis of Cyber-Physi...

IEEE Conference on Decision and Control

作者： Luyao Niu Abdullah Al Maruf Andrew Clark J. Sukarno Mertoguno Radha Poovendran Department of Electrical and Computer Engineering Network Security Lab University of Washington Seattle WA Electrical and Systems Engineering Department McKelvey School of Engineering Washington University in St. Louis St. Louis MO School of Cybersecurity and Privacy Georgia Institute of Technology Atlanta GA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

Cyber-physical systems (CPS) are required to operate safely under fault and malicious attacks. The simplex architecture and the recently proposed cyber resilient architectures, e.g., Byzantine fault tolerant++ (BFT++), provide safety for CPS under faults and malicious cyber attacks, respectively. However, these existing architectures make use of different timing parameters and implementations to provide safety, and are seemingly unrelated. In this paper, we propose an analytical framework to represent the simplex, BFT++ and other practical cyber resilient architectures (CRAs). We construct a hybrid system that models CPS adopting any of these architectures. We derive sufficient conditions via our proposed framework under which a control policy is guaranteed to be safe. We present an algorithm to synthesize the control policy. We validate the proposed framework using a case study on lateral control of a Boeing 747, and demonstrate that our proposed approach ensures safety of the system.

关键词： Sufficient conditions Fault tolerance Computational modeling Fault tolerant systems computer architecture Cyber-physical systems Safety

Swin Transformer-Based Dynamic Semantic Communication for Multi-User with Different Computing Capacity

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Nguyen, Loc X. Tun, Ye Lin Tun, Yan Kyaw Nguyen, Minh N.H. Zhang, Chaoning Han, Zhu Hong, Choong Seon The Department of Computer Science and Engineering Kyung Hee University Gyeonggi-do Yongin-si17104 Korea Republic of The Division of Network and Systems Engineering School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Brinellvägen 8 Stockholm114 28 Sweden The Digital Science and Technology Institute The University of Danang Vietnam-Korea University of Information and Communication Technology Da Nang550000 Viet Nam The Department of Artificial Intelligence School of Computing Kyung Hee University Yongin-si17104 Korea Republic of The Electrical and Computer Engineering Department University of Houston HoustonTX77004 United States

Semantic communication has gained significant attention from researchers as a promising technique to replace conventional communication in the next generation of communication systems, primarily due to its ability to reduce communication costs. However, little literature has studied its effectiveness in multi-user scenarios, particularly when there are variations in the model architectures used by users and their computing capacities. To address this issue, we explore a semantic communication system that caters to multiple users with different model architectures by using a multi-purpose transmitter at the base station (BS). Specifically, the BS in the proposed framework employs semantic and channel encoders to encode the image for transmission, while the receiver utilizes its local channel and semantic decoder to reconstruct the original image. Our joint source-channel encoder at the BS can effectively extract and compress semantic features for specific users by considering the signal-to-noise ratio (SNR) and computing capacity of the user. Based on the network status, the joint source-channel encoder at the BS can adaptively adjust the length of the transmitted signal. A longer signal ensures more information for high-quality image reconstruction for the user, while a shorter signal helps avoid network congestion. In addition, we propose a hybrid loss function for training, which enhances the perceptual details of reconstructed images. Finally, we conduct a series of extensive evaluations and ablation studies to validate the effectiveness of the proposed system. Copyright © 2023, The Authors. All rights reserved.

关键词： Image reconstruction

50-km Weakly-Coupled Transmission with L-Band 4-LP-Mode FM-EDFA

学校读者我要写书评

暂无评论

50-km Weakly-Coupled Transmission with L-Band 4-LP-Mode FM-E...

Asia Communications and Photonics Conference and Exhibition (ACP)

作者： Shuailuo Huang Baolong Zhu Gang Qiao Yuyang Gao Mingqing Zuo Shikui Shen Zelin Wang Yongqi He Zhangyuan Chen Juhao Li China Unicom Research Institute Beijing China State Key Laboratory of Advanced Optical Communication Systems and Networks Peking University Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Department of Fundamental Network Technology China Mobile Research Institute Beijing China Pengcheng National Laboratory Shenzhen China

50-km weakly-coupled transmission based on a L-band 4-LP-mode FM-EDFA is experimentally demonstrated only adopting $\mathbf{2}\times \mathbf{2}$ or $\mathbf{4}\times \mathbf{4}$ MIMO-DSP.

ISBN: (数字)9798350379266

ISBN: (纸本)9798350379273

50-km weakly-coupled transmission based on a L-band 4-LP-mode FM-EDFA is experimentally demonstrated only adopting $\mathbf{2}\times \mathbf{2}$ or $\mathbf{4}\times \mathbf{4}$ MIMO-DSP.

关键词： Asia Gain measurement Optical fiber communication MIMO L-band Photonics

Collaborative Human-AI Decision-Making systems with Numerical Channels

学校读者我要写书评

暂无评论

Collaborative Human-AI Decision-Making Systems with Numerica...

International Conference on Advanced computer Information Technologies (ACIT)

作者： Mules Oksana Mykola Kotsipak Serge Dolgikh Yurii Bilak Tamara Radivilova Oleksii Baranovskyi Department of Software Systems Uzhhorod National University Uzhhorod Ukraine Department of Network Engineering Solana Networks Ottawa Canada Department of V.V.Popovskyy Infocommunication Engineering Kharkiv National University of Radio Electronics Kharkiv Ukraine Department of Computer Science Blekinge Institute of Technology Karlskrona Blekinge Sweden

ISBN: (数字)9781665410502

ISBN: (纸本)9781665466479

This work is devoted to the study of the features of functioning in Collaborative Human-AI Decision-Making systems with numerical channels. The system operates in automatic mode without external influences. The channels can be both artificial intelligence software and competent experts giving conclusions on the question under study. The cases considered are those in which an agreed solution must be numerical and logical. For each of these cases, decision rules for the system have been developed. The developed rules include the ability to take into account the reliability of the channels, which allows expanding their number in the system if necessary.

关键词： Decision making Collaboration Software Software reliability Artificial intelligence Information technology

Switching exploration modes in human mobility

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhong, Lu Dong, Lei Wang, Qi Song, Chaoming Gao, Jianxi Department of Computer Science Rensselaer Polytechnic Institute TroyNY United States Network Science and Technology Center Rensselaer Polytechnic Institute TroyNY United States Institute of Remote Sensing and Geographical Information Systems School of Earth and Space Sciences Peking University Beijing China Department of Civil and Environmental Engineering Northeastern University BostonMA United States Department of Physics University of Miami Coral GablesFL United States

Recent advances in human mobility research have revealed consistent pairwise characteristics in movement behavior, yet existing mobility models often overlook the spatial and topological structure of mobility networks. By analyzing millions of devices’ anonymized cell phone trajectories, we uncover a distinct modular organization within these networks, demonstrating that movements within spatial modules differ significantly from those between modules. This finding challenges the conventional assumption of uniform mobility dynamics and underscores the influence of heterogeneous environments on human movement. Inspired by switching behaviors in animal movement patterns, we introduce a novel"switch mechanism" to differentiate movement modes, allowing our model to accurately reproduce both the modular structures of trajectory networks and spatial mobility patterns. Our results provide new insights into the dynamics of human mobility and its impact on network formation, with broad applications in traffic prediction, disease transmission modeling, and urban planning. Beyond advancing the theoretical and practical understanding of mobility networks, this work opens new avenues for understanding societal dynamics at large. Copyright © 2025, The Authors. All rights reserved.

关键词： Urban planning