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

(Rectified Version) Push-LSVRG-UP: Distributed Stochastic Optimization over Unbalanced Directed Networks with Uncoordinated Triggered Probabilities

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Shen, Zixiang Zhang, Weidong Department of Automation Central South University Changsha410083 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China School of Information and Communication Engineering Hainan University Haikou Hainan 570228 China Department of Automation Shanghai Jiaotong University Shanghai200240 China

Distributed stochastic optimization, arising in the crossing and integration of traditional stochastic optimization, distributed computing and storage, and network science, has advantages of high efficiency and a low per-iteration computational complexity in resolving large-scale optimization problems. This paper concentrates on resolving a large-scale convex finite-sum optimization problem in a multi-agent system over unbalanced directed networks. To tackle this problem in an efficient way, a distributed consensus optimization algorithm, adopting the push-sum technique and a distributed loopless stochastic variance-reduced gradient (LSVRG) method with uncoordinated triggered probabilities, is developed and named Push-LSVRG-UP. Each agent under this algorithmic framework performs only local computation and communicates only with its neighbors without leaking their private information. The convergence analysis of Push-LSVRG-UP is relied on analyzing the contraction relationships between four error terms associated with the multi-agent system. Theoretical results provide an explicit feasible range of the constant step-size, a linear convergence rate, and an iteration complexity of Push-LSVRG-UP when achieving the globally optimal solution. It is shown that Push-LSVRG-UP achieves the superior characteristics of accelerated linear convergence, fewer storage costs, and a lower per-iteration computational complexity than most existing works. Meanwhile, the introduction of an uncoordinated probabilistic triggered mechanism allows Push-LSVRG-UP to facilitate the independence and flexibility of agents in computing local batch gradients. In simulations, the practicability and improved performance of Push-LSVRG-UP are manifested via resolving two distributed learning problems based on real-world datasets. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic systems

On Secrecy Performance of MISO SWIPT Systems with TAS and Imperfect CSI

学校读者我要写书评

暂无评论

On Secrecy Performance of MISO SWIPT Systems with TAS and Im...

作者： Pan, Gaofeng Lei, Hongjiang Deng, Yansha Fan, Lisheng Yang, Jing Chen, Yunfei Ding, Zhiguo Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing School of Electronic and Information Engineering Southwest University Chongqing400715 China School of Computing and Communications Lancaster University LancasterLA14YW United Kingdom Chongqing Key Laboratory of Mobile Communications Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Centre for Telecommunications King's College London LondonWC2R2LS United Kingdom School of Computer Science and Educational Software Guangzhou University Guangzhou510000 China Department of Electronic Engineering Shantou University Guangdong515063 China School of Information Engineering Yangzhou University Yangzhou225009 China School of Engineering University of Warwick CoventryCV47AL United Kingdom

In this paper, a multiple-input single-output (MISO) simultaneous wireless information and power transfer (SWIPT) system, including one base station (BS) equipped with multiple antennas, one desired single-antenna information receiver (IR), and N (N > 1) single-antenna energy-harvesting receivers (ERs) is considered. Assuming that the information signal to the desired IR may be eavesdropped by ERs if ERs are malicious, we investigate the secrecy performance of the target MISO SWIPT system when imperfect channel state information (CSI) is available and adopted for transmit antenna selection at the BS. Considering that each eavesdropping link experiences independent but not necessarily identically distributed Rayleigh fading, the closed-form expressions for the exact and the asymptotic secrecy outage probability, and the average secrecy capacity are derived and verified by simulations. Furthermore, the optimal power splitting factor is derived for each ER to realize the tradeoff between the energy harvesting and the information eavesdropping. Our results reveal the impact of the imperfect CSI on the secrecy performance of MISO SWIPT systems in the presence of multiple wiretap channels. © 2016 IEEE.

关键词： Energy harvesting

On secure mixed RF-FSO systems with TAS and imperfect CSI

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Lei, Hongjiang Luo, Haolun Park, Ki-Hong Ansari, Imran Shafique Lei, Weijia Pan, Gaofeng Alouini, Mohamed-Slim School of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China School of Engineering University of Glasgow GlasgowG12 8QQ United Kingdom Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Southwest University Chongqing400715 Thuwal23955-6900 Saudi Arabia

In this work, we analyze the secrecy outage performance of a dual-hop relay system composed of multiple-input-multiple-output radio-frequency (RF) links and a free-space optical (FSO) link while a multiple-antenna eavesdropper wiretaps the confidential information by decoding the received signals from the resource node. The channel state information (CSI) of the RF and FSO links is considered to be outdated. We propose three transmit antenna selection (TAS) schemes to enhance the secrecy performance of the considered systems. The secrecy outage performance with different TAS schemes is analyzed and the effects of misalignment and detection technology on the secrecy outage performance of mixed systems are studied. We derive the closed-form expressions for probability density function (PDF) and cumulative distribution function (CDF) over Málaga channel with imperfect CSI. Then the closed-form expressions for the CDF and PDF of the equivalent signal-to-noise ratio (SNR) at the legitimate receiver over Nakagami-m and Málaga channels are derived. Furthermore, the lower bound of the secrecy outage probability (SOP) with different TAS schemes are derived. Besides, the asymptotic results for SOP are investigated by exploiting the unfolding of Meijer's G-function when the electrical SNR of FSO link approaches infinity. Finally, Monte-Carlo simulation results are presented to testify the correctness of the proposed analysis. The results illustrate that the outdated CSI shows a strong effect on the secrecy outage performance. In addition, increasing the number of antennas at the source cannot significantly enhance the secrecy performance of the considered systems. Copyright © 2018, The Authors. All rights reserved.

关键词： Signal to noise ratio

Distributed Generalized Nash Equilibria Seeking Algorithms Involving Synchronous and Asynchronous Schemes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Huaqing Ran, Liang Zheng, Lifeng Li, Zhe Hu, Jinhui Li, Jun Huang, Tingwen The Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China The Department of Automation Central South University Changsha410083 China The Department of Biomedical Engineering City University of Hong Kong Hong Kong Texas A & M University at Qatar Doha23874 Qatar

This paper considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce a new local edge-based equilibrium condition and develop a distributed primal-dual proximal algorithm with full information. Considering challenges when communication delays occur, we devise an asynchronous distributed algorithm to seek a generalized Nash equilibrium. This asynchronous scheme arbitrarily activates one player to start new computations independently at different iteration instants, which means that the picked player can use the involved out-dated information from itself and its neighbors to perform new updates. A distinctive attribute is that the proposed algorithms enable the derivation of new distributed forward-backward-like extensions. In theoretical aspect, we provide explicit conditions on algorithm parameters, for instance, the step-sizes to establish a sublinear convergence rate for the proposed synchronous algorithm. Moreover, the asynchronous algorithm guarantees almost sure convergence in expectation under the same step-size conditions and some standard assumptions. An interesting observation is that our analysis approach improves the convergence rate of prior synchronous distributed forward-backward-based algorithms. Finally, the viability and performance of the proposed algorithms are demonstrated by numerical studies on the networked Cournot competition. Copyright © 2024, The Authors. All rights reserved.

关键词： Iterative methods

A Color Image Encryption Using One Quaternion-Valued Neural Network

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Lin, Dongyuan Zhang, Qiangqiang Chen, Xiaofeng Li, Zhongshan Wang, Shiyuan College of Electronic and Information Engineering Southwest University Chongqing 400715 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing 400715 China College of Mathematics and Statistics Chongqing Jiaotong University Chongqing 400074 China College of Mathematics and Statistics Georgia State University AtlantaGA30302 United States

Color image encryption via real-valued chaos system generally requires multiple real-value systems. To this end, this article presents a encryption algorithm for color image that requires only a quaternion-valued neural network system. First, an inertial memristor-based quaternion-valued neural network (IMQVNN) is proposed and the exponential synchronization criteria for the addressed systems are given. Then, an example and its simulation results are given to verify the rationality of the synchronization criteria. Based on the drive-response systems, a encryption algorithm for color image is therefore put forward. Finally, the effectiveness of the proposed cryptosystem is verified by the simulation results and security performance analysis. © 2022, The Authors. All rights reserved.

关键词： Memristors

Electroencephalogram Emotion Classification Method Based on Spatial Hierarchical Attention Mechanism

学校读者我要写书评

暂无评论

Electroencephalogram Emotion Classification Method Based on ...

Neuromorphic Computing (ICNC), International Conference on

作者： Hongxiao Tan Sheng Qin Xuanyu Zhao Jin Zeng Guangxi Key Laboratory of Brain-inspired Computing and Intelligent Chips School of Electronic and Information Engineering Guangxi Normal University Guilin China Education Department of Guangxi Zhuang Autonomous Region Key Laboratory of Nonlinear Circuits and Optical Communications (Guangxi Normal University) Guilin China

ISBN: (数字)9798331508661

ISBN: (纸本)9798331508678

Different odor sources result in various emotions and induce various Electroencephalogram (EEG) signals in the brain. Therefore, the classification of the EEG signals is important to understand brain activity. To solve this issue, an emotion classification method using olfactory EEG signals based on the convolutional neural network and spatial layered attention mechanism is proposed in this work. The convolutional neural network is employed to extract features of EEG signals from multiple vector spaces. The attention mechanism is used to fuse features, which can realize the judgment of human emotions. Experiments are conducted on Kato's dataset and compared with traditional machine algorithms using accuracy, precision, recall, and F1 scores. The performance is improved by 16.80%, 18.30%, 18.72%, and 24.80% respectively, which verifies the effectiveness of the proposed approach.

关键词： Brain Attention mechanisms Neuromorphic engineering Olfactory Feature extraction Electroencephalography Vectors Classification algorithms Convolutional neural networks Long short term memory

Femtosecond laser-induced flexible and highly sensitive capacitive pressure sensor with treefrog suckers bionic microstructure

学校读者我要写书评

暂无评论

Femtosecond laser-induced flexible and highly sensitive capa...

Sensor Technology and Control (ISSTC), International Symposium on

作者： Zhiyun Wang Mengyang Chu Yahui Su Xiaohui Guo Rui Liu School of Electronic and Information Engineering Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Hefei China School of Integrated Circuits Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China Anhui Xinhuai Electronics Co. Ltd Huaibei China

Flexible capacitive pressure sensors are optimal for wearable electronic equipment owing to their advantages of simplicity in architecture and low power consumption. However, fabricating a bionic flexible capacitive pressure sensor with high sensitivity and a wide dynamic range of detection is still a great challenge. In this article, we propose a flexible pressure sensor based on femtosecond laser ablation with a treefrog suckers bionic microstructure. The treefrog suckers capacitive pressure sensor (TSCPS) has high sensitivity (0-10 kPa, 0.0762 kPa -1 ), wide detection range (500 kPa), high repeatability (>12000 s at 10 kPa), and fast response time (62.5 ms). For practical applications, the TSCPS was positioned on the wrist, palm, and sole of the hand to detect the movements of each part accordingly. The experimental findings indicate that the TSCPS has broad promising applications in bionic wearable products such as human locomotion monitoring.

关键词：

Prox-DBRO-VR: A Unified Analysis on Decentralized Byzantine-Resilient Composite Stochastic Optimization with Variance Reduction and Non-Asymptotic Convergence Rates

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Guo, Xiaoyu Ran, Liang Huang, Tingwen School of Automation Central South University Changsha410083 China Department of Biomedical Engineering City University of Hong Kong Kowloon Hong Kong Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China Science Program Texas A&M University at Qatar Doha23874 Qatar

Decentralized stochastic gradient algorithms resolve efficiently large-scale finite-sum optimization problems when all agents in the network are reliable. However, most of these algorithms are not resilient to adverse conditions, such as malfunctioning agents, software bugs, and cyber attacks. This paper aims to handle a class of general composite finite-sum optimization problems over multi-agent systems (MASs) in the presence of an unknown number of Byzantine agents. Based on the proximal mapping method, variance-reduced (VR) techniques, and a norm-penalized approximation strategy, we propose a decentralized Byzantine-resilient and proximal-gradient algorithmic framework, dubbed Prox-DBRO-VR, which achieves an optimization and control goal using only local computations and communications. To remove asymptotically the variance generated by evaluating the local noisy stochastic gradients, we incorporate two localized VR techniques (SAGA and LSVRG) into Prox-DBRO-VR to design Prox-DBRO-SAGA and ProxDBRO-LSVRG. By analyzing the contraction relationships among the gradient-learning error, resilient consensus condition, and convergence error in a unified theoretical framework, it is demonstrated that both Prox-DBRO-SAGA and Prox-DBRO-LSVRG, with a well-designed constant (resp., decaying) step-size, converge linearly (resp., sub-linearly) inside an error ball around the optimal solution to the original problem under standard assumptions. A trade-off between the convergence accuracy and Byzantine resilience in both linear and sub-linear cases is also characterized. In numerical experiments, the effectiveness and practicability of the proposed algorithms are manifested via resolving a decentralized sparse machine-learning problem over MASs under various Byzantine attacks. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic systems

Secrecy outage analysis for cooperative NOMA systems with relay selection scheme

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Lei, Hongjiang Yang, Zixuan Park, Ki-Hong Ansari, Imran Shafique Guo, Yongcai Pan, Gaofeng Alouini, Mohamed-Slim School of Communication and Information Engineering Chongqing Key Lab of Mobile Communications Technology Chongqing University of Posts and Telecommunications Chongqing400065 China School of Engineering University of Glasgow GlasgowG12 8QQ United Kingdom Key Laboratory of Optoelectronic Technology and Systems Education Ministry of China Chongqing University Chongqing400044 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Southwest University Chongqing400715 Thuwal23955-6900 Saudi Arabia

This paper considers the secrecy outage performance of a multiple-relay assisted non-orthogonal multiple access (NOMA) network over Nakagami-m fading channels. Two slots are utilized to transmit signals from the base station to destination. At the first slot, the base station broadcasts the superposition signal of the two users to all decode-and-forward relays by message mapping strategy. Then the selected relay transmits superposition signal to the two users via power-domain NOMA technology. Three relay selection (RS) schemes, i.e., optimal single relay selection (OSRS) scheme, two-step single relay selection (TSRS) scheme, and optimal dual relay selection (ODRS) scheme, are proposed and the secrecy outage performance are analyzed. As a benchmark, we also examine the secrecy outage performance of the NOMA systems with traditional multiple relays combining (TMRC) scheme in which all the relay that successfully decode signals from the source forward signals to the NOMA users with equal power. Considering the correlation between the secrecy capacity of two users and different secrecy requirement for two NOMA users, the closed-form expressions for the security outage probability (SOP) of the proposed OSRS, TSRS, and ODRS schemes along with the TMRC scheme are derived and validated via simulations. To get more insights, we also derive the closed-form expressions for the asymptotic SOP for all the schemes with fixed and dynamic power allocations. Furthermore, the secrecy diversity order (SDO) of cooperative NOMA systems is obtained. The results demonstrate that our proposed schemes can significantly enhance the secrecy performance compared to the TMRC scheme and that all the RS schemes with fixed power allocation obtain zero SDO and the OSRS scheme with dynamic power allocation obtains the same SDO as TMRC. Copyright © 2018, The Authors. All rights reserved.

关键词： Cooperative communication