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

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

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

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

(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

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

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

Effects of Negative Stimulation After Exercise on Frontal Asymmetry in Unregular Exercisers

学校读者我要写书评

暂无评论

IOP Conference Series: Materials Science and Engineering 2019年第5期612卷

作者： Tengfei Wang Guangyuan Liu School of Electronic and Information Engineering Southwest University Chongqing 400700 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing 400700 China

As a signal to recognize emotion, the electroencephalogram (EEG) is used widely. Frontal asymmetry is not only related to emotion, but also affected by exercise. The purpose of our research is to explore the effects of exercise for negative emotion, and how the activity of the frontal of the college students who did not exercise regularly is. We used the frontal asymmetry between F3 and F4 channels of the alpha band. The result showed that the power of frontal asymmetry increased after exercise compared to that before exercise within 3 seconds after stimulation, and the change of the power during the 2nd second was more obvious. The activity of the frontal of the students without exercise habits can be altered by exercise. The frontal asymmetry is related to emotion, which confirms that exercise has an effect on the students without exercise habits after negative stimulation.

关键词：

Decentralized nonconvex Robust Optimization over Unsafe Multiagent Systems: System Modeling, Utility, Resilience, and Privacy Analysis

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hu, Jinhui Chen, Guo Li, Huaqing Cheng, Huqiang Guo, Xiaoyu Huang, Tingwen School of Automation Central South University Changsha410083 China Department of Biomedical Engineering City University of Hong Kong Kowloon Hong Kong School of Electrical Engineering and Telecommunications University of New South Wales SydneyNSW2052 Australia Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China Key Laboratory of Dependable Services Computing in Cyber Physical Society Ministry of Education College of Computer Science Chongqing University Chongqing400044 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China

Privacy leakage and Byzantine failures are two adverse factors to the intelligent decision-making process of multiagent systems (MASs). Considering an unsafe MAS with these two issues, this paper targets the resolution of a class of nonconvex optimization problems under the Polyak-Lojasiewicz (P-L) condition. To address this problem, we first identify and construct the unsafe MAS model. Under this kind of unfavorable MASs, we mask the local gradients with Gaussian noises and adopt a resilient aggregation method self-centered clipping (SCC) to design a differentially private (DP) decentralized Byzantine-resilient algorithm, namely DP-SCC-PL, which simultaneously achieves differential privacy and Byzantine resilience. The convergence analysis of DP-SCC-PL is challenging since the convergence error can be contributed jointly by privacy-preserving and Byzantine-resilient mechanisms, as well as the nonconvex relaxation, which is addressed via seeking the contraction relationships among the disagreement measure of reliable agents before and after SCC aggregation, together with the optimal gap. Theoretical results reveal that DP-SCC-PL achieves consensus among all reliable agents and sublinear (inexact) convergence with well-designed step-sizes. It has also been proved that if there are no privacy issues and Byzantine agents, then the asymptotic exact convergence can be recovered. Numerical experiments verify the utility, resilience, and differential privacy of DP-SCC-PL by tackling a nonconvex optimization problem satisfying the P-L condition under various Byzantine attacks. Copyright © 2024, The Authors. All rights reserved.

关键词： Differential privacy

𝒮-asymptotically 𝓌-periodic mild solutions for noninstantaneous impulsive integro-differential equations with state-dependent delay

学校读者我要写书评

暂无评论

Mathematical Methods in the Applied Sciences 2023年第9期46卷

作者： Yinuo Wang Chuandong Li Hao Deng Hongjuan Wu Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing 400715 China Communicated by: J. Banasiak

A kind of nonlinear noninstantaneous impulsive equation with state-dependent delay is studied here. By utilizing suitable fixed point theorem and the theory of semigroup in Banach space, the uniqueness and existence results of S $$ \mathcal{S} $$ -asymptotically w $$ w $$ -periodic mild solutions are obtained, respectively. In the end, two examples are presented to demonstrate the validity of the obtained results.

关键词： fixed point theorem integro-differential equations noninstantaneous impulse S$$ \mathcal{S} $$-asymptotically w$$ w $$-periodic mild solution state-dependent delay