In this paper,by utilizing the Marcinkiewicz-Zygmund inequality and Rosenthal-type inequality of negatively superadditive dependent(NSD)random arrays and truncated method,we investigate the complete f-moment convergen...In this paper,by utilizing the Marcinkiewicz-Zygmund inequality and Rosenthal-type inequality of negatively superadditive dependent(NSD)random arrays and truncated method,we investigate the complete f-moment convergence of NSD random variables.We establish and improve a general result on the complete f-moment convergence for Sung’s type randomly weighted sums of NSD random variables under some general assumptions.As an application,we show the complete consistency for the randomly weighted estimator in a nonparametric regression model based on NSD errors.展开更多
The complete convergence for weighted sums of sequences of independent,identically distributed random variables under sublinear expectation space is studied.By moment inequality and truncation methods,we establish the...The complete convergence for weighted sums of sequences of independent,identically distributed random variables under sublinear expectation space is studied.By moment inequality and truncation methods,we establish the equivalent conditions of complete convergence for weighted sums of sequences of independent,identically distributed random variables under sublinear expectation space.The results complement the corresponding results in probability space to those for sequences of independent,identically distributed random variables under sublinear expectation space.展开更多
Globally exponential stability （which implies convergence and uniqueness） of their classical iterative algorithm is established using methods of heat equations and energy integral after embedding the discrete iterat...Globally exponential stability （which implies convergence and uniqueness） of their classical iterative algorithm is established using methods of heat equations and energy integral after embedding the discrete iteration into a continuous flow. The stability condition depends explicitly on smoothness of the image sequence, size of image domain, value of the regularization parameter, and finally discretization step. Specifically, as the discretization step approaches to zero, stability holds unconditionally. The analysis also clarifies relations among the iterative algorithm, the original variation formulation and the PDE system. The proper regularity of solution and natural images is briefly surveyed and discussed. Experimental results validate the theoretical claims both on convergence and exponential stability.展开更多
In this paper,we investigate the complete convergence and complete moment conver-gence for weighted sums of arrays of rowwise asymptotically negatively associated(ANA)random variables,without assuming identical distri...In this paper,we investigate the complete convergence and complete moment conver-gence for weighted sums of arrays of rowwise asymptotically negatively associated(ANA)random variables,without assuming identical distribution.The obtained results not only extend those of An and Yuan[1]and Shen et al.[2]to the case of ANA random variables,but also partially improve them.展开更多
For deep tunnel projects,selecting an appropriate initial support distance is critical to improving the self-supporting capacity of surrounding rock.In this work,an intuitive method for determining the tunnel’s initi...For deep tunnel projects,selecting an appropriate initial support distance is critical to improving the self-supporting capacity of surrounding rock.In this work,an intuitive method for determining the tunnel’s initial support distance was proposed.First,based on the convergence-confinement method,a three-dimensional analytical model was constructed by combining an analytical solution of a non-circular tunnel with the Tecplot software.Then,according to the integral failure criteria of rock,the failure tendency coefficients of hard surrounding rock were computed and the spatial distribution plots of that were constructed.On this basis,the tunnel’s key failure positions were identified,and the relationship between the failure tendency coefficient at key failure positions and their distances from the working face was established.Finally,the distance from the working face that corresponds to the critical failure tendency coefficient was taken as the optimal support distance.A practical project was used as an example,and a reasonable initial support distance was successfully determined by applying the developed method.Moreover,it is found that the stability of hard surrounding rock decreases rapidly within the range of 1.0D(D is the tunnel diameter)from the working face,and tends to be stable outside the range of 1.0D.展开更多
Selection, crossover, and mutation are three main operators of the canonical genetic algorithm (CGA). This paper presents a new approach to the genetic algorithm. This new approach applies only to mutation and selecti...Selection, crossover, and mutation are three main operators of the canonical genetic algorithm (CGA). This paper presents a new approach to the genetic algorithm. This new approach applies only to mutation and selection operators. The paper proves that the search process of the non-crossover genetic algorithm (NCGA) is an ergodic homogeneous Markov chain. The proof of its convergence to global optimum is presented. Some nonlinear multi-modal optimization problems are applied to test the efficacy of the NCGA. NP-hard traveling salesman problem (TSP) is cited here as the benchmark problem to test the efficiency of the algorithm. The simulation result shows that NCGA achieves much faster convergence speed than CGA in terms of CPU time. The convergence speed per epoch of NCGA is also faster than that of CGA.展开更多
A global fast convergent integrated guidance and control design approach is proposed. A disturbance observer is utilized to estimate the uncertainties of integrated guidance and control model in finite time. According...A global fast convergent integrated guidance and control design approach is proposed. A disturbance observer is utilized to estimate the uncertainties of integrated guidance and control model in finite time. According to the multiple sliding-mode surface control, the independent nonsingular terminal sliding functions are presented in each step, and all the sliding-mode surfaces run parallel. These presented sliding-mode surfaces keep zero value from a certain time, and the system states converge quickly in sliding phase. Therefore, the system response speed is increased. The proposed method offers the global convergent time analytically, which is useful to optimize the transient performance of system. Simulation results are used to verify the proposed method.展开更多
With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem...With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem. The diversity of the evolutionary population and the convergence of GAs are studied by using the concept of negentropy based on the discussion of the characteristic of GA. Some test functions are used to test the convergence of GAs, and good results have been obtained. It is shown that the global optimization may be obtained by selecting appropriate parameters of simple GAs if the evolution time is enough.展开更多
In the process of meida Convergence,many researchers paid excessive attention to media technology, industry and management,and ignored the culture dimensions of media convergence. Therefore,to transcend media converge...In the process of meida Convergence,many researchers paid excessive attention to media technology, industry and management,and ignored the culture dimensions of media convergence. Therefore,to transcend media convergence technology, industrial thinking and more to the particularity attach importance to cultural media, it is a right way to achieve media convergence. But in the context of China's culture,media convergence should value the cultural uniqueness and the imbalance of the realistic problems,to reach innovation and breakthrough.展开更多
Some sufficient conditions for the global exponential stability and lower bounds on the rate of exponential convergence of the cellular neural networks with delay (DCNNs) are obtained by means of a method based on del...Some sufficient conditions for the global exponential stability and lower bounds on the rate of exponential convergence of the cellular neural networks with delay (DCNNs) are obtained by means of a method based on delay differential inequality. The method, which does not make use of any Lyapunov functional, is simple and valid for the stability analysis of neural networks with delay. Some previously established results in this paper are shown to be special casses of the presented result.展开更多
In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation...In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.展开更多
An idea of relaxing the effect of delay when computing the Runge-Kutta stages in the current step and a class of two-step continuity Runge-Kutta methods （TSCRK） is presented. Their construction, their order conditio...An idea of relaxing the effect of delay when computing the Runge-Kutta stages in the current step and a class of two-step continuity Runge-Kutta methods （TSCRK） is presented. Their construction, their order conditions and their convergence are studied. The two-step continuity Runge-Kutta methods possess good numerical stability properties and higher stage-order, and keep the explicit process of computing the Runge-Kutta stages. The numerical experiments show that the TSCRK methods are efficient.展开更多
Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is...Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is proved that inadequate parameters of mutation and crossover probabilities degenerate standard genetic algorithm to a class of random search algorithms without selection bias toward any solution based on fitness. After introducing elitist reservation, the stochastic matrix of Markov chain of the best-so-far individual with the highest fitness is derived.The average convergence velocity of genetic algorithms is defined as the mathematical expectation of the mean absorbing time steps that the best-so-far individual transfers from any initial solution to the global optimum. Using the stochastic matrix of the best-so-far individual, a theoretic method and the computing process of estimating the average convergence velocity are proposed.展开更多
Different attempts have been done to deduce the shortening of the Himalayan belt during the India\|Asia convergence. Dewey et al. (1989) and Le Pichon et al.(1992) calculated an India\|Asia shortening of 2300～2150km ...Different attempts have been done to deduce the shortening of the Himalayan belt during the India\|Asia convergence. Dewey et al. (1989) and Le Pichon et al.(1992) calculated an India\|Asia shortening of 2300～2150km and 2800～3000km in the western and eastern syntaxes, respectively, since the late 45Ma. According to seafloor\|spreading reconstruction, a total shortening of 3000～500km was estimated after the initial contact of the two plates at 55～50Ma (Molnar and Tapponier, 1975 ; Molnar et al., 1988 ; Replumaz, 1999). Since 40Ma, the part of shortening only accommodated by the Himalayan belt was estimated around 470km in the western part (Coward and Butler, 1985) and 550 to 630km to the east (Ratsbacher et al., 1994 ; Replumaz, 1999). In contrast, global plate reconstructions suggest that the shortening in the Himalaya is of about 1250～250km (Achache et al., 1984 ; Powell et al., 1988 ; Dewey et al.,1989 ; Klootwijk et al., 1992 ; Matte et al., 1997). This discrepancy between the amount of shortening estimated by balancing the Himalayan belt and by plate reconstruction favour the existence of a greater India buried up to 1000km north of the present\|day Indus suture zone and subducted before Middle Eocene time (Klootwijk et al., 1979 ; Patriat and Achache, 1984).展开更多
We study distributed optimization problems over a directed network,where nodes aim to minimize the sum of local objective functions via directed communications with neighbors.Many algorithms are designed to solve it f...We study distributed optimization problems over a directed network,where nodes aim to minimize the sum of local objective functions via directed communications with neighbors.Many algorithms are designed to solve it for synchronized or randomly activated implementation,which may create deadlocks in practice.In sharp contrast,we propose a fully asynchronous push-pull gradient(APPG) algorithm,where each node updates without waiting for any other node by using possibly delayed information from neighbors.Then,we construct two novel augmented networks to analyze asynchrony and delays,and quantify its convergence rate from the worst-case point of view.Particularly,all nodes of APPG converge to the same optimal solution at a linear rate of O(λ^(k)) if local functions have Lipschitz-continuous gradients and their sum satisfies the Polyak-?ojasiewicz condition(convexity is not required),where λ ∈(0,1) is explicitly given and the virtual counter k increases by one when any node updates.Finally,the advantage of APPG over the synchronous counterpart and its linear speedup efficiency are numerically validated via a logistic regression problem.展开更多
With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued no...With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square(LMS)algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error(MSE)performance among of complex kernel LMS(KLMS)methods according to the specified kernel bandwidth and the length of dictionary.展开更多
Some papers on stochastic adaptive control schemes have established convergence algorithm using a least-squares parameters. With the popular application of GPC, global convergence has become a key problem in automatic...Some papers on stochastic adaptive control schemes have established convergence algorithm using a least-squares parameters. With the popular application of GPC, global convergence has become a key problem in automatic control theory. However, now global convergence of GPC has not been established for algorithms in computing a least squares iteration. A generalized model of adaptive generalized predictive control is presented. The global convergebce is also given on the basis of estimating the parameters of GPC by least squares algorithm.展开更多
An improved genetic algorithm (GA) is proposed based on the analysis of population diversity within the framework of Markov chain. The chaos operator to combat premature convergence concerning two goals of maintaining...An improved genetic algorithm (GA) is proposed based on the analysis of population diversity within the framework of Markov chain. The chaos operator to combat premature convergence concerning two goals of maintaining diversity in the population and sustaining the convergence capacity of the GA is introduced. In the CHaos Genetic Algorithm (CHGA), the population is recycled dynamically whereas the most highly fit chromosome is intact so as to restore diversity and reserve the best schemata which may belong to the optimal solution. The characters of chaos as well as advanced operators and parameter settings can improve both exploration and exploitation capacities of the algorithm. The results of multimodal function optimization show that CHGA performs simple genetic algorithms and effectively alleviates the problem of premature convergence.展开更多
The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. ...The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.展开更多
基金supported by the National Social Science Fundation(Grant No.21BTJ040)the Project of Outstanding Young People in University of Anhui Province(Grant Nos.2023AH020037,SLXY2024A001).
文摘In this paper,by utilizing the Marcinkiewicz-Zygmund inequality and Rosenthal-type inequality of negatively superadditive dependent(NSD)random arrays and truncated method,we investigate the complete f-moment convergence of NSD random variables.We establish and improve a general result on the complete f-moment convergence for Sung’s type randomly weighted sums of NSD random variables under some general assumptions.As an application,we show the complete consistency for the randomly weighted estimator in a nonparametric regression model based on NSD errors.
基金supported by Doctoral Scientific Research Starting Foundation of Jingdezhen Ceramic University(Grant No.102/01003002031)Re-accompanying Funding Project of Academic Achievements of Jingdezhen Ceramic University(Grant Nos.215/20506277,215/20506341)。
文摘The complete convergence for weighted sums of sequences of independent,identically distributed random variables under sublinear expectation space is studied.By moment inequality and truncation methods,we establish the equivalent conditions of complete convergence for weighted sums of sequences of independent,identically distributed random variables under sublinear expectation space.The results complement the corresponding results in probability space to those for sequences of independent,identically distributed random variables under sublinear expectation space.
基金Foundation item： Projects（60835005, 90820302） supported by the National Natural Science Foundation of China Project（2007CB311001） supported by the National Basic Research Program of China
文摘Globally exponential stability （which implies convergence and uniqueness） of their classical iterative algorithm is established using methods of heat equations and energy integral after embedding the discrete iteration into a continuous flow. The stability condition depends explicitly on smoothness of the image sequence, size of image domain, value of the regularization parameter, and finally discretization step. Specifically, as the discretization step approaches to zero, stability holds unconditionally. The analysis also clarifies relations among the iterative algorithm, the original variation formulation and the PDE system. The proper regularity of solution and natural images is briefly surveyed and discussed. Experimental results validate the theoretical claims both on convergence and exponential stability.
基金National Natural Science Foundation of China (Grant Nos.12061028, 71871046)Support Program of the Guangxi China Science Foundation (Grant No.2018GXNSFAA281011)。
文摘In this paper,we investigate the complete convergence and complete moment conver-gence for weighted sums of arrays of rowwise asymptotically negatively associated(ANA)random variables,without assuming identical distribution.The obtained results not only extend those of An and Yuan[1]and Shen et al.[2]to the case of ANA random variables,but also partially improve them.
基金Project(2021JLM-49) supported by Natural Science Basic Research Program of Shaanxi-Joint Fund of Hanjiang to Weihe River Valley Water Diversion Project,ChinaProject(42077248) supported by the National Natural Science Foundation of China
文摘For deep tunnel projects,selecting an appropriate initial support distance is critical to improving the self-supporting capacity of surrounding rock.In this work,an intuitive method for determining the tunnel’s initial support distance was proposed.First,based on the convergence-confinement method,a three-dimensional analytical model was constructed by combining an analytical solution of a non-circular tunnel with the Tecplot software.Then,according to the integral failure criteria of rock,the failure tendency coefficients of hard surrounding rock were computed and the spatial distribution plots of that were constructed.On this basis,the tunnel’s key failure positions were identified,and the relationship between the failure tendency coefficient at key failure positions and their distances from the working face was established.Finally,the distance from the working face that corresponds to the critical failure tendency coefficient was taken as the optimal support distance.A practical project was used as an example,and a reasonable initial support distance was successfully determined by applying the developed method.Moreover,it is found that the stability of hard surrounding rock decreases rapidly within the range of 1.0D(D is the tunnel diameter)from the working face,and tends to be stable outside the range of 1.0D.
文摘Selection, crossover, and mutation are three main operators of the canonical genetic algorithm (CGA). This paper presents a new approach to the genetic algorithm. This new approach applies only to mutation and selection operators. The paper proves that the search process of the non-crossover genetic algorithm (NCGA) is an ergodic homogeneous Markov chain. The proof of its convergence to global optimum is presented. Some nonlinear multi-modal optimization problems are applied to test the efficacy of the NCGA. NP-hard traveling salesman problem (TSP) is cited here as the benchmark problem to test the efficiency of the algorithm. The simulation result shows that NCGA achieves much faster convergence speed than CGA in terms of CPU time. The convergence speed per epoch of NCGA is also faster than that of CGA.
基金Project(61673386)supported by the National Natural Science Foundation of ChinaProject(2018QNJJ006)supported by the High-Tech Institute of Xi’an,China
文摘A global fast convergent integrated guidance and control design approach is proposed. A disturbance observer is utilized to estimate the uncertainties of integrated guidance and control model in finite time. According to the multiple sliding-mode surface control, the independent nonsingular terminal sliding functions are presented in each step, and all the sliding-mode surfaces run parallel. These presented sliding-mode surfaces keep zero value from a certain time, and the system states converge quickly in sliding phase. Therefore, the system response speed is increased. The proposed method offers the global convergent time analytically, which is useful to optimize the transient performance of system. Simulation results are used to verify the proposed method.
文摘With its wide use in different fields, the problem of the convergence of simple genetic algorithms (GAs) has been concerned. In the past, the research on the convergence of GAs was based on Holland's model theorem. The diversity of the evolutionary population and the convergence of GAs are studied by using the concept of negentropy based on the discussion of the characteristic of GA. Some test functions are used to test the convergence of GAs, and good results have been obtained. It is shown that the global optimization may be obtained by selecting appropriate parameters of simple GAs if the evolution time is enough.
文摘In the process of meida Convergence,many researchers paid excessive attention to media technology, industry and management,and ignored the culture dimensions of media convergence. Therefore,to transcend media convergence technology, industrial thinking and more to the particularity attach importance to cultural media, it is a right way to achieve media convergence. But in the context of China's culture,media convergence should value the cultural uniqueness and the imbalance of the realistic problems,to reach innovation and breakthrough.
文摘Some sufficient conditions for the global exponential stability and lower bounds on the rate of exponential convergence of the cellular neural networks with delay (DCNNs) are obtained by means of a method based on delay differential inequality. The method, which does not make use of any Lyapunov functional, is simple and valid for the stability analysis of neural networks with delay. Some previously established results in this paper are shown to be special casses of the presented result.
文摘In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.
文摘An idea of relaxing the effect of delay when computing the Runge-Kutta stages in the current step and a class of two-step continuity Runge-Kutta methods （TSCRK） is presented. Their construction, their order conditions and their convergence are studied. The two-step continuity Runge-Kutta methods possess good numerical stability properties and higher stage-order, and keep the explicit process of computing the Runge-Kutta stages. The numerical experiments show that the TSCRK methods are efficient.
文摘Formulizations of mutation and crossover operators independent of representation of solutions are proposed. A kind of precisely quantitative Markov chain of populations of standard genetic algorithms is modeled. It is proved that inadequate parameters of mutation and crossover probabilities degenerate standard genetic algorithm to a class of random search algorithms without selection bias toward any solution based on fitness. After introducing elitist reservation, the stochastic matrix of Markov chain of the best-so-far individual with the highest fitness is derived.The average convergence velocity of genetic algorithms is defined as the mathematical expectation of the mean absorbing time steps that the best-so-far individual transfers from any initial solution to the global optimum. Using the stochastic matrix of the best-so-far individual, a theoretic method and the computing process of estimating the average convergence velocity are proposed.
文摘Different attempts have been done to deduce the shortening of the Himalayan belt during the India\|Asia convergence. Dewey et al. (1989) and Le Pichon et al.(1992) calculated an India\|Asia shortening of 2300～2150km and 2800～3000km in the western and eastern syntaxes, respectively, since the late 45Ma. According to seafloor\|spreading reconstruction, a total shortening of 3000～500km was estimated after the initial contact of the two plates at 55～50Ma (Molnar and Tapponier, 1975 ; Molnar et al., 1988 ; Replumaz, 1999). Since 40Ma, the part of shortening only accommodated by the Himalayan belt was estimated around 470km in the western part (Coward and Butler, 1985) and 550 to 630km to the east (Ratsbacher et al., 1994 ; Replumaz, 1999). In contrast, global plate reconstructions suggest that the shortening in the Himalaya is of about 1250～250km (Achache et al., 1984 ; Powell et al., 1988 ; Dewey et al.,1989 ; Klootwijk et al., 1992 ; Matte et al., 1997). This discrepancy between the amount of shortening estimated by balancing the Himalayan belt and by plate reconstruction favour the existence of a greater India buried up to 1000km north of the present\|day Indus suture zone and subducted before Middle Eocene time (Klootwijk et al., 1979 ; Patriat and Achache, 1984).
基金Supported by National Natural Science Foundation of China(62033006,62203254)。
文摘We study distributed optimization problems over a directed network,where nodes aim to minimize the sum of local objective functions via directed communications with neighbors.Many algorithms are designed to solve it for synchronized or randomly activated implementation,which may create deadlocks in practice.In sharp contrast,we propose a fully asynchronous push-pull gradient(APPG) algorithm,where each node updates without waiting for any other node by using possibly delayed information from neighbors.Then,we construct two novel augmented networks to analyze asynchrony and delays,and quantify its convergence rate from the worst-case point of view.Particularly,all nodes of APPG converge to the same optimal solution at a linear rate of O(λ^(k)) if local functions have Lipschitz-continuous gradients and their sum satisfies the Polyak-?ojasiewicz condition(convexity is not required),where λ ∈(0,1) is explicitly given and the virtual counter k increases by one when any node updates.Finally,the advantage of APPG over the synchronous counterpart and its linear speedup efficiency are numerically validated via a logistic regression problem.
基金supported by the National Natural Science Foundation of China(61001153,61271415,61401499,61531015)the Fundamental Research Funds for the Central Universities(3102014JCQ01010,3102014ZD0041)the Opening Research Foundation of State Key Laboratory of Underwater Information Processing and Control(9140C231002130C23085)
文摘With the vigorous expansion of nonlinear adaptive filtering with real-valued kernel functions,its counterpart complex kernel adaptive filtering algorithms were also sequentially proposed to solve the complex-valued nonlinear problems arising in almost all real-world applications.This paper firstly presents two schemes of the complex Gaussian kernel-based adaptive filtering algorithms to illustrate their respective characteristics.Then the theoretical convergence behavior of the complex Gaussian kernel least mean square(LMS)algorithm is studied by using the fixed dictionary strategy.The simulation results demonstrate that the theoretical curves predicted by the derived analytical models consistently coincide with the Monte Carlo simulation results in both transient and steady-state stages for two introduced complex Gaussian kernel LMS algonthms using non-circular complex data.The analytical models are able to be regard as a theoretical tool evaluating ability and allow to compare with mean square error(MSE)performance among of complex kernel LMS(KLMS)methods according to the specified kernel bandwidth and the length of dictionary.
基金This project was supported by the National Natural Science Foundation of China (60174021) Tianjin Advanced School Science and Technology Development Foundation (01 - 20403) .
文摘Some papers on stochastic adaptive control schemes have established convergence algorithm using a least-squares parameters. With the popular application of GPC, global convergence has become a key problem in automatic control theory. However, now global convergence of GPC has not been established for algorithms in computing a least squares iteration. A generalized model of adaptive generalized predictive control is presented. The global convergebce is also given on the basis of estimating the parameters of GPC by least squares algorithm.
基金The National Natural Science Foundation of China !(No .699740 43 )
文摘An improved genetic algorithm (GA) is proposed based on the analysis of population diversity within the framework of Markov chain. The chaos operator to combat premature convergence concerning two goals of maintaining diversity in the population and sustaining the convergence capacity of the GA is introduced. In the CHaos Genetic Algorithm (CHGA), the population is recycled dynamically whereas the most highly fit chromosome is intact so as to restore diversity and reserve the best schemata which may belong to the optimal solution. The characters of chaos as well as advanced operators and parameter settings can improve both exploration and exploitation capacities of the algorithm. The results of multimodal function optimization show that CHGA performs simple genetic algorithms and effectively alleviates the problem of premature convergence.
基金supported in part by the National Natural Science Foundation of China (10671170,60404022)the National Outstanding Youth Foundation of China (60525303)and the Natural Science Foundation of Hebei Province (07M005,F2008000864)
文摘The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.
