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

Sensing With Random Communication Signals

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Lu, Shihang Liu, Fan Xiong, Yifeng Du, Zhen Cui, Yuanhao Li, Shuangyang Yuan, Weijie Yang, Jie Jin, Shi National Mobile Communications Research Laboratory Southeast University Nanjing210096 China School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China School of Electronic and Information Engineering Nanjing University of Information Science and Technology Nanjing210044 China Faculty of Electrical Engineering and Computer Science Technical University of Berlin Berlin10587 Germany Southern University of Science and Technology Shenzhen518055 China Frontiers Science Center for Mobile Information Communication and Security and also The Key Laboratory of Measurement and Control of Complex Systems of Engineering Southeast University Nanjing211189 China

Communication-centric Integrated Sensing and Communication (ISAC) has been recognized as a promising methodology to implement wireless sensing functionality over existing network architectures, due to its cost-effectiveness and backward compatibility to legacy cellular systems. However, the inherent randomness of the communication signal may incur huge fluctuations in sensing capabilities, leading to unfavorable detection and estimation performance. To address this issue, we elaborate on random ISAC signal processing methods in this article, aiming at improving the sensing performance without unduly deteriorating the communication functionality. Specifically, we commence by discussing the fundamentals of sensing with random communication signals, including the performance metrics and optimal ranging waveforms. Building on these concepts, we then present a general framework for random ISAC signal transmission, followed by an in-depth exploration of time-domain pulse shaping, frequency-domain constellation shaping, and spatial-domain precoding methods. We provide a comprehensive overview of each of these topics, including models, results, and design guidelines. Finally, we conclude this article by identifying several promising research directions for random ISAC signal transmission. © 2025, CC BY-SA.

关键词： Signaling

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

学校读者我要写书评

暂无评论

IEEE Transactions on Automatic Control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

Business Process Remaining Time Prediction Based on Incremental Event Logs

学校读者我要写书评

暂无评论

IEEE Transactions on Services computing 2025年

作者： Guo, Na Liu, Cong Mo, Qi Cao, Jian Ouyang, Chun Lu, Xixi Zeng, Qingtian Shandong University of Technology School of Electrical and Electronic Engineering Zibo255000 China Nova University of Lisbon NOVA Information Management School Lisbon1070-312 Portugal Shandong University of Technology School of Computer Science and Technology Zibo255000 China Yunnan University School of Software Kunming650091 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200030 China Queensland University of Technology School of Information Systems BrisbaneQLD4000 Australia Utrecht University Department of Information and Computing Sciences CS Utrecht3584 Netherlands Shandong University of Science and Technology College of Computer Science and Engineering Qingdao266590 China

Predictive Process Monitoring (PPM) aims to predict the future state of running process instances to enable timely interventions to mitigate potential risks. As one of the most fundamental tasks in PPM, process remaining time prediction focuses on preventing timeout occurrences. While various deep learning-based approaches have been developed for this purpose, they often rely on pre-established static prediction models and struggle to maintain accurate predictions when the process undergoes dynamic changes, such as an expanding sales channels. To tackle this challenge, this paper proposes an incremental process remaining time prediction framework by continuously updating the prediction model based on an incremental event log. Specifically, a feature selection strategy is first introduced to extract effective features from event logs. Leveraging effective features can significantly improve the prediction quality by capturing the changes in process information. Then, three incremental log-based updating mechanisms, including period-based updating, quantity-based updating, and concept-drift-based updating, along with a reconstruction strategy, are proposed to dynamically adjust the prediction model in response to business changes. Finally, LSTM, Transformer, and Auto-encoder models are adapted and integrated into the proposed framework. The approach has been implemented and publicly released. Experimental evaluation using nine real-life event logs demonstrate that the proposed framework and its three instantiations (i.e., LSTM-based, Transformer-based, and Auto-encoder-based ones) outperform state-of-the-art techniques in terms of prediction accuracy. © 2008-2012 IEEE.

关键词： incremental event log Predictive process monitoring process mining remaining time prediction

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

Hybrid phase-locked loop with fast locking time and low spur in a 0.18-μm CMOS process

学校读者我要写书评

暂无评论

Chinese Physics B 2014年第7期23卷 748-753页

作者：朱思衡司黎明郭超史君宇朱卫仁 Beijing Key Laboratory of Millimeter Wave and Terahertz Technology Department of Electronic Engineering School of Information and ElectronicsBeijing Institute of Technology Advanced Computing and Simulation Laboratory (AχL) Department of Electrical and Computer Systems EngineeringMonash University

We propose a novel hybrid phase-locked loop （PLL） architecture for overcoming the trade-off between fast locking time and low spur. To reduce the settling time and meanwhile suppress the reference spurs, we employ a wide-band single-path PLL and a narrow-band dual-path PLL in a transient state and a steady state, respectively, by changing the loop bandwidth according to the gain of voltage controlled oscillator （VCO） and the resister of the loop filter. The hybrid PLL is implemented in a 0.18-μm complementary metal oxide semiconductor （CMOS） process with a total die area of 1.4×0.46 mm2. The measured results exhibit a reference spur level of lower than -73 dB with a reference frequency of 10 MHz and a settling time of 20 μs with 40 MHz frequency jump at 2 GHz. The total power consumption of the hybrid PLL is less than 27 mW with a supply voltage of 1.8 V.

关键词： phase-locked loop （PLL） fast locking time low spur complementary metal oxide semiconductor（CMOS）

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan The Beijing Key Laboratory of Network System Architecture and Convergence The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing China Singapore The Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Department of Industrial and Systems Engineering University of Miami Coral GablesFL33146 United States The College of Information Science and Electronic Engineering Zhejiang University Zhejiang Hangzhou310027 China The Department of Computer Science North Carolina State University RaleighNC27695 United States The Beijing Key Laboratory of Network System Architecture and Convergence China The Beijing Advanced Information Network Laboratory Beijing University of Posts and Telecommunications Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025, CC BY-NC-SA.

关键词： Markov processes

A Dynamic Transformer Network for Vehicle Detection

学校读者我要写书评

暂无评论

IEEE Transactions on Consumer Electronics 2025年

作者： Tian, Chunwei Liu, Kai Zhang, Bob Huang, Zhixiang Lin, Chia-Wen Zhang, David Harbin Institute of Technology School of Computer Science and Technology Harbin15001 China Macao Special Administrative Region of China PAMI Research Group University of Macau 999078 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Key Laboratory of Electromagnetic Environmental Sensing Hefei230601 China National Tsing Hua University Department of Electrical Engineering Institute of Communications Engineering Hsinchu Taiwan School of Data Science Shenzhen518172 China

Stable consumer electronic systems can assist traffic better. Good traffic consumer electronic systems require collaborative work between traffic algorithms and hardware. However, performance of popular traffic algorithms containing vehicle detection methods based on deep networks via learning data relation rather than learning differences in different lighting and occlusions is limited. In this paper, we present a dynamic Transformer network for vehicle detection (DTNet). DTNet utilizes a dynamic convolution to guide a deep network to dynamically generate weights to enhance adaptability of an obtained detector. Taking into relations of different information account, a mixed attention mechanism based channel attention and Transformer is exploited to strengthen relations of channels and pixels to extract more salient information for vehicle detection. To overcome the drawback of difference in an image account, a translation-variant convolution relies on spatial location information to refine obtained structural information for vehicle detection. Experimental results illustrate that our DTNet is competitive for vehicle detection. Code of the proposed DTNet can be obtained at https://***/hellloxiaotian/DTNet. © 2025 IEEE.

关键词： Dynamic convolution Hybrid Attention Mechanism Transformer Vehicle Detection

Empirical topological investigation of practical supply chains based on complex networks

学校读者我要写书评

暂无评论

Chinese Physics B 2017年第11期26卷 144-150页

作者：廖好沈婧吴兴桐陈博奎周明洋 National Engineering Laboratory for Big Data Computing Systems Guangdong Province Key Laboratory of Popular High Performance ComputersCollege of Computer Science and Software Engineering Shenzhen University Department of Computer Science School of Computing National University of Singapore

The industrial supply chain networks basically capture the circulation of social resource, dominating the stability and efficiency of the industrial system. In this paper, we provide an empirical study of the topology of smartphone supply chain network. The supply chain network is constructed using open online data. Our experimental results show that the smartphone supply chain network has small-world feature with scale-free degree distribution, in which a few high degree nodes play a key role in the function and can effectively reduce the communication cost. We also detect the community structure to find the basic functional unit. It shows that information communication between nodes is crucial to improve the resource utilization. We should pay attention to the global resource configuration for such electronic production management.

关键词： China supply chain networks complex networks data science network science

Adaptive Backdoor Attacks with Reasonable Constraints on Graph Neural Networks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Dong, Xuewen Li, Jiachen Li, Shujun You, Zhichao Qu, Qiang Kholodov, Yaroslav Shen, Yulong School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi’an710071 China University of Kent CanterburyCT2 7NP United Kingdom Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China Intelligent Transportation Systems Lab Innopolis University Innopolis Russia School of Computer Science and Technology Xidian University China The Shaanxi Key Laboratory of Network and System Security Xi’an710071 China

Recent studies show that graph neural networks (GNNs) are vulnerable to backdoor attacks. Existing backdoor attacks against GNNs use fixed-pattern triggers and lack reasonable trigger constraints, overlooking individual graph characteristics and rendering insufficient evasiveness. To tackle the above issues, we propose ABARC, the first Adaptive Backdoor Attack with Reasonable Constraints, applying to both graph-level and node-level tasks in GNNs. For graph-level tasks, we propose a subgraph backdoor attack independent of the graph’s topology. It dynamically selects trigger nodes for each target graph and modifies node features with constraints based on graph similarity, feature range, and feature type. For node-level tasks, our attack begins with an analysis of node features, followed by selecting and modifying trigger features, which are then constrained by node similarity, feature range, and feature type. Furthermore, an adaptive edge-pruning mechanism is designed to reduce the impact of neighbors on target nodes, ensuring a high attack success rate (ASR). Experimental results show that even with reasonable constraints for attack evasiveness, our attack achieves a high ASR while incurring a marginal clean accuracy drop (CAD). When combined with the state-of-the-art defense randomized smoothing (RS) method, our attack maintains an ASR over 94%, surpassing existing attacks by more than 7%. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph neural networks