We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotie...We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.展开更多
The linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are investigated.A new generalized cyclotomic sequence Sof length 2pqis defined with an imbalance p+1.The results show ...The linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are investigated.A new generalized cyclotomic sequence Sof length 2pqis defined with an imbalance p+1.The results show that this sequence has high linear complexity.展开更多
We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the s...We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O（r log ε1） iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras and ε is the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples.展开更多
In this article, we study the complex oscillation problems of entire solutions to homogeneous and nonhomogeneous linear difference equations, and obtain some relations of the exponent of convergence of zeros and the o...In this article, we study the complex oscillation problems of entire solutions to homogeneous and nonhomogeneous linear difference equations, and obtain some relations of the exponent of convergence of zeros and the order of growth of entire solutions to complex linear difference equations.展开更多
In this article, a synchronization problem for master-slave Markovian switching complex dynamical networks with time-varying delays in nonlinear function via sliding mode control is investigated. On the basis of the a...In this article, a synchronization problem for master-slave Markovian switching complex dynamical networks with time-varying delays in nonlinear function via sliding mode control is investigated. On the basis of the appropriate Lyapunov-Krasovskii functional, introducing some free weighting matrices, new synchronization criteria are derived in terms of linear matrix inequalities （LMIs）. Then, an integral sliding surface is designed to guarantee synchronization of master-slave Markovian switching complex dynamical networks, and the suitable controller is synthesized to ensure that the trajectory of the closed-loop error system can be driven onto the prescribed sliding mode surface. By using Dynkin＇s formula, we established the stochastic stablity of master-slave system. Finally, numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.展开更多
In this paper, the problem of exponential synchronization of complex dynamical networks with Markovian jumping parameters using sampled-data and Mode-dependent probabilistic time-varying coupling delays is investigate...In this paper, the problem of exponential synchronization of complex dynamical networks with Markovian jumping parameters using sampled-data and Mode-dependent probabilistic time-varying coupling delays is investigated. The sam- pling period is assumed to be time-varying and bounded. The information of probability distribution of the time-varying delay is considered and transformed into parameter matrices of the transferred complex dynamical network model. Based on the condition, the design method of the desired sampled data controller is proposed. By constructing a new Lyapunov functional with triple integral terms, delay-distribution-dependent exponential synchronization criteria are derived in the form of linear matrix inequalities. Finally, two numerical examples are given to illustrate the effectiveness of the proposed methods.展开更多
Nested linear array enables to enhance localization resolution and achieve under-determined direction of arrival(DOA)estimation.In this paper,the traditional two-level nested linear array is improved to achieve more d...Nested linear array enables to enhance localization resolution and achieve under-determined direction of arrival(DOA)estimation.In this paper,the traditional two-level nested linear array is improved to achieve more degrees of freedom(DOFs)and better angle estimation performance.Furthermore,a computationally efficient DOA estimation algorithm is proposed.The discrete Fourier transform(DFT)method is utilized to obtain coarse DOA estimates,and subsequently,fine DOA estimates are achieved by spatial smoothing multiple signals classification(SS-MUSIC)algorithm.Compared to SS-MUSIC algorithm,the proposed algorithm has the same estimation accuracy with lower computational complexity because the coarse DOA estimates enable to shrink the range of angle spectral search.In addition,the estimation of the number of signals is not required in advance by DFT method.Extensive simulation results testify the effectiveness of the proposed algorithm.展开更多
This paper deals with the cluster exponential synchronization of a class ot complex networks wlm nyorm coupm^g and time-varying delay. Through constructing an appropriate Lyapunov-Krasovskii functional and applying th...This paper deals with the cluster exponential synchronization of a class ot complex networks wlm nyorm coupm^g and time-varying delay. Through constructing an appropriate Lyapunov-Krasovskii functional and applying the theory of the Kronecker product of matrices and the linear matrix inequality （LMI） technique, several novel sufficient conditions for cluster exponential synchronization are obtained. These cluster exponential synchronization conditions adopt the bounds of both time delay and its derivative, which are less conservative. Finally, the numerical simulations are performed to show the effectiveness of the theoretical results.展开更多
In this paper, global synchronization of general delayed complex networks with stochastic disturbances, which is a zero-mean real scalar Wiener process, is investigated. The networks under consideration are continuous...In this paper, global synchronization of general delayed complex networks with stochastic disturbances, which is a zero-mean real scalar Wiener process, is investigated. The networks under consideration are continuous-time networks with time-varying delay. Based on the stochastic Lyapunov stability theory, Ito＇s differential rule and the linear matrix inequality （LMI） optimization technique, several delay-dependent synchronous criteria are established, which guarantee the asymptotical mean-square synchronization of drive networks and response networks with stochastic disturbances. The criteria are expressed in terms of LMI, which can be easily solved using the Matlab LMI Control Toolbox. Finally, two examples show the effectiveness and feasibility of the proposed synchronous conditions.展开更多
This paper deals with the issue of synchronization of delayed complex networks. Differing from previous results, the delay interval [0, d（t）] is divided into some variable subintervals by employing a new method of w...This paper deals with the issue of synchronization of delayed complex networks. Differing from previous results, the delay interval [0, d（t）] is divided into some variable subintervals by employing a new method of weighting delays. Thus, new synchronization criteria for complex networks with time-varying delays are derived by applying this weighting-delay method and introducing some free weighting matrices. The obtained results have proved to be less conservative than previous results. The sufficient conditions of asymptotical synchronization are derived in the form of linear matrix inequality, which are easy to verify. Finally, several simulation examples are provided to show the effectiveness of the proposed results.展开更多
This paper addresses the control problem of a class of complex dynamical networks with each node being a Lur＇e system whose nonlinearity satisfies a sector condition, by applying local feedback injections to a small ...This paper addresses the control problem of a class of complex dynamical networks with each node being a Lur＇e system whose nonlinearity satisfies a sector condition, by applying local feedback injections to a small fraction of the nodes. The pinning control problem is reformulated in the framework of the absolute stability theory. It is shown that the global stability of the controlled network can be reduced to the test of a set of linear matrix inequalities, which in turn guarantee the absolute stability of the corresponding Lur＇e systems whose dimensions are the same as that of a single node. A circle-type criterion in the frequency domain is further presented for checking the stability of the controlled network graphically. Finally, a network of Chua＇s oscillators is provided as a simulation example to illustrate the effectiveness of the theoretical results.展开更多
This article discusses the synchronization problem of singular neutral complex dynamical networks(SNCDN)with distributed delay and Markovian jump parameters via pinning control.Pinning control strategies are designed ...This article discusses the synchronization problem of singular neutral complex dynamical networks(SNCDN)with distributed delay and Markovian jump parameters via pinning control.Pinning control strategies are designed to make the singular neutral complex networks synchronized.Some delay-dependent synchronization criteria are derived in the form of linear matrix inequalities based on a modified Lyapunov-Krasovskii functional approach.By applying the Lyapunov stability theory,Jensen's inequality,Schur complement,and linear matrix inequality technique,some new delay-dependent conditions are derived to guarantee the stability of the system.Finally,numerical examples are presented to illustrate the effectiveness of the obtained results.展开更多
Generally,due to the limitation of the dimension of the array aperture,linear arrays cannot achieve two-dimensional(2D)direction of arrival(DOA)estimation.But the emergence of array motion provides a chance for that.I...Generally,due to the limitation of the dimension of the array aperture,linear arrays cannot achieve two-dimensional(2D)direction of arrival(DOA)estimation.But the emergence of array motion provides a chance for that.In this paper,a generalized motion scheme and a novel method of 2D DOA estimation are proposed by exploring the linear array motion.To be specific,the linear arrays are controlled to move along an arbitrary direction at a constant velocity and snap per fixed time delay.All the received signals are processed to synthesize the comprehensive observation vector for an extended 2D virtual aperture.Subsequently,since most of 2D DOA estimation methods are not universal to our proposed motion scheme and the reduced-dimensional(RD)method fails to handle the case of the coupled parameters,a decoupled reduced-complexity multiple signals classification(DRC MUSIC)algorithm is designed specifically.Simulation results demonstrate that:a)our proposed scheme can achieve underdetermined 2D DOA estimation just by the linear arrays;b)our designed DRC MUSIC algorithm has the good properties of high accuracy and low complexity;c)our proposed motion scheme with the DRC method has better universality in the motion direction.展开更多
In this paper,we first obtain the precise values of the univalent radius and the Bloch constant for harmonic mappings of the formL(f)=zfz-zfz,where f represents normalized harmonic mappings with bounded dilation.Then,...In this paper,we first obtain the precise values of the univalent radius and the Bloch constant for harmonic mappings of the formL(f)=zfz-zfz,where f represents normalized harmonic mappings with bounded dilation.Then,using these results,we present better estimations for the Bloch constants of certain harmonic mappings L(f),where f is a K-quasiregular harmonic or open harmonic.Finally,we establish three versions of BlochLandau type theorem for biharmonic mappings of the form L(f).These results are sharp in some given cases and improve the related results of earlier authors.展开更多
基金the National Natural Science Foundation of China，the Open Funds of State Key Laboratory of Information Security (Chinese Academy of Sciences)，the Program for New Century Excellent Talents in Fujian Province University
文摘We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.
基金Supported by the Natural Science Foundation of Hubei Province(2009CDZ004)the Scientific Research Fund of Hubei Provincial Education Department(B20104403)
文摘The linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are investigated.A new generalized cyclotomic sequence Sof length 2pqis defined with an imbalance p+1.The results show that this sequence has high linear complexity.
基金Supported by the National Natural Science Foundation of China(11471102,61301229)Supported by the Natural Science Foundation of Henan University of Science and Technology(2014QN039)
文摘We establish polynomial complexity corrector algorithms for linear programming over bounds of the Mehrotra-type predictor- symmetric cones. We first slightly modify the maximum step size in the predictor step of the safeguard based Mehrotra-type algorithm for linear programming, that was proposed by Salahi et al. Then, using the machinery of Euclidean Jordan algebras, we extend the modified algorithm to symmetric cones. Based on the Nesterov-Todd direction, we obtain O（r log ε1） iteration complexity bound of this algorithm, where r is the rank of the Jordan algebras and ε is the required precision. We also present a new variant of Mehrotra-type algorithm using a new adaptive updating scheme of centering parameter and show that this algorithm enjoys the same order of complexity bound as the safeguard algorithm. We illustrate the numerical behaviour of the methods on some small examples.
基金supported by the National Natural Science Foundation of China (11171119 and 10871076)
文摘In this article, we study the complex oscillation problems of entire solutions to homogeneous and nonhomogeneous linear difference equations, and obtain some relations of the exponent of convergence of zeros and the order of growth of entire solutions to complex linear difference equations.
文摘In this article, a synchronization problem for master-slave Markovian switching complex dynamical networks with time-varying delays in nonlinear function via sliding mode control is investigated. On the basis of the appropriate Lyapunov-Krasovskii functional, introducing some free weighting matrices, new synchronization criteria are derived in terms of linear matrix inequalities （LMIs）. Then, an integral sliding surface is designed to guarantee synchronization of master-slave Markovian switching complex dynamical networks, and the suitable controller is synthesized to ensure that the trajectory of the closed-loop error system can be driven onto the prescribed sliding mode surface. By using Dynkin＇s formula, we established the stochastic stablity of master-slave system. Finally, numerical example is provided to demonstrate the effectiveness of the obtained theoretical results.
基金Project supported by the NBHM Research Project (Grant Nos.2/48(7)/2012/NBHM(R.P.)/R and D II/12669)
文摘In this paper, the problem of exponential synchronization of complex dynamical networks with Markovian jumping parameters using sampled-data and Mode-dependent probabilistic time-varying coupling delays is investigated. The sam- pling period is assumed to be time-varying and bounded. The information of probability distribution of the time-varying delay is considered and transformed into parameter matrices of the transferred complex dynamical network model. Based on the condition, the design method of the desired sampled data controller is proposed. By constructing a new Lyapunov functional with triple integral terms, delay-distribution-dependent exponential synchronization criteria are derived in the form of linear matrix inequalities. Finally, two numerical examples are given to illustrate the effectiveness of the proposed methods.
基金supported by the Postgraduate Research & Practice Innovation Program of Jiangsu Province (No.SJCX18_0103)Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space (Nanjing University of Aeronautics and Astronautics), Ministry of Industry and Information Technology (No.KF20181915)
文摘Nested linear array enables to enhance localization resolution and achieve under-determined direction of arrival(DOA)estimation.In this paper,the traditional two-level nested linear array is improved to achieve more degrees of freedom(DOFs)and better angle estimation performance.Furthermore,a computationally efficient DOA estimation algorithm is proposed.The discrete Fourier transform(DFT)method is utilized to obtain coarse DOA estimates,and subsequently,fine DOA estimates are achieved by spatial smoothing multiple signals classification(SS-MUSIC)algorithm.Compared to SS-MUSIC algorithm,the proposed algorithm has the same estimation accuracy with lower computational complexity because the coarse DOA estimates enable to shrink the range of angle spectral search.In addition,the estimation of the number of signals is not required in advance by DFT method.Extensive simulation results testify the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China (Grant Nos. 61074073 and 61034005)the Fundamental Research Funds for the Central Universities of China (Grant No. N110504001)the Open Project of the State Key Laboratory of Management and Control for Complex Systems, China (Grant No. 20110107)
文摘This paper deals with the cluster exponential synchronization of a class ot complex networks wlm nyorm coupm^g and time-varying delay. Through constructing an appropriate Lyapunov-Krasovskii functional and applying the theory of the Kronecker product of matrices and the linear matrix inequality （LMI） technique, several novel sufficient conditions for cluster exponential synchronization are obtained. These cluster exponential synchronization conditions adopt the bounds of both time delay and its derivative, which are less conservative. Finally, the numerical simulations are performed to show the effectiveness of the theoretical results.
基金supported by the National Natural Science Foundation of China (Grant No. 60904060)the Open Foundation of Hubei Province Key Laboratory of Systems Science in Metallurgical Process,China (Grant No. C201010)
文摘In this paper, global synchronization of general delayed complex networks with stochastic disturbances, which is a zero-mean real scalar Wiener process, is investigated. The networks under consideration are continuous-time networks with time-varying delay. Based on the stochastic Lyapunov stability theory, Ito＇s differential rule and the linear matrix inequality （LMI） optimization technique, several delay-dependent synchronous criteria are established, which guarantee the asymptotical mean-square synchronization of drive networks and response networks with stochastic disturbances. The criteria are expressed in terms of LMI, which can be easily solved using the Matlab LMI Control Toolbox. Finally, two examples show the effectiveness and feasibility of the proposed synchronous conditions.
基金supported by the National Natural Science Foundation of China (Grant Nos. 50977008,60774048 and 61034005)the Research Fund for the Doctoral Program of China Higher Education (Grant No. 20070145015)the National High Technology Research and Development Program of China (Grant No. 2009AA04Z127)
文摘This paper deals with the issue of synchronization of delayed complex networks. Differing from previous results, the delay interval [0, d（t）] is divided into some variable subintervals by employing a new method of weighting delays. Thus, new synchronization criteria for complex networks with time-varying delays are derived by applying this weighting-delay method and introducing some free weighting matrices. The obtained results have proved to be less conservative than previous results. The sufficient conditions of asymptotical synchronization are derived in the form of linear matrix inequality, which are easy to verify. Finally, several simulation examples are provided to show the effectiveness of the proposed results.
基金Project supported by the Aviation Science Funds (Grant No 20080751019)
文摘This paper addresses the control problem of a class of complex dynamical networks with each node being a Lur＇e system whose nonlinearity satisfies a sector condition, by applying local feedback injections to a small fraction of the nodes. The pinning control problem is reformulated in the framework of the absolute stability theory. It is shown that the global stability of the controlled network can be reduced to the test of a set of linear matrix inequalities, which in turn guarantee the absolute stability of the corresponding Lur＇e systems whose dimensions are the same as that of a single node. A circle-type criterion in the frequency domain is further presented for checking the stability of the controlled network graphically. Finally, a network of Chua＇s oscillators is provided as a simulation example to illustrate the effectiveness of the theoretical results.
基金The work of author was supported by NBHM grant.2/48(5)/2016/NBHMR.P)/-R-D II/14088。
文摘This article discusses the synchronization problem of singular neutral complex dynamical networks(SNCDN)with distributed delay and Markovian jump parameters via pinning control.Pinning control strategies are designed to make the singular neutral complex networks synchronized.Some delay-dependent synchronization criteria are derived in the form of linear matrix inequalities based on a modified Lyapunov-Krasovskii functional approach.By applying the Lyapunov stability theory,Jensen's inequality,Schur complement,and linear matrix inequality technique,some new delay-dependent conditions are derived to guarantee the stability of the system.Finally,numerical examples are presented to illustrate the effectiveness of the obtained results.
基金This work was supported in part by the Key R&D Program of Shandong Province,China(No.2020CXGC010109)in part by the Beijing Municipal Science and Technology Project(Z181100003218015).
文摘Generally,due to the limitation of the dimension of the array aperture,linear arrays cannot achieve two-dimensional(2D)direction of arrival(DOA)estimation.But the emergence of array motion provides a chance for that.In this paper,a generalized motion scheme and a novel method of 2D DOA estimation are proposed by exploring the linear array motion.To be specific,the linear arrays are controlled to move along an arbitrary direction at a constant velocity and snap per fixed time delay.All the received signals are processed to synthesize the comprehensive observation vector for an extended 2D virtual aperture.Subsequently,since most of 2D DOA estimation methods are not universal to our proposed motion scheme and the reduced-dimensional(RD)method fails to handle the case of the coupled parameters,a decoupled reduced-complexity multiple signals classification(DRC MUSIC)algorithm is designed specifically.Simulation results demonstrate that:a)our proposed scheme can achieve underdetermined 2D DOA estimation just by the linear arrays;b)our designed DRC MUSIC algorithm has the good properties of high accuracy and low complexity;c)our proposed motion scheme with the DRC method has better universality in the motion direction.
基金supported by the Natural Science Foundation of Guangdong Province(2021A1515010058)。
文摘In this paper,we first obtain the precise values of the univalent radius and the Bloch constant for harmonic mappings of the formL(f)=zfz-zfz,where f represents normalized harmonic mappings with bounded dilation.Then,using these results,we present better estimations for the Bloch constants of certain harmonic mappings L(f),where f is a K-quasiregular harmonic or open harmonic.Finally,we establish three versions of BlochLandau type theorem for biharmonic mappings of the form L(f).These results are sharp in some given cases and improve the related results of earlier authors.
