Let （Xn）n∈EN be a sequence of arbitrary continuous random variables, by the notion of relative entropy hμ^μ（w） as a measure of dissimilarity between probability measure # and reference measure μ, the explicit,...Let （Xn）n∈EN be a sequence of arbitrary continuous random variables, by the notion of relative entropy hμ^μ（w） as a measure of dissimilarity between probability measure # and reference measure μ, the explicit, general bounds for the partial sums of arbitrary continuous random variables under suitable conditions are developed. The argument uses the known and elementary lcmma of convergence for likelihood ratio.展开更多
This paper investigates the problem of almost sure limit theorem for the maximum of quasi-stationary sequence based on the result of Turkman and Walker. We prove an almost sure limit theorem for the maximum of a class...This paper investigates the problem of almost sure limit theorem for the maximum of quasi-stationary sequence based on the result of Turkman and Walker. We prove an almost sure limit theorem for the maximum of a class of quasi-stationary sequence under weak dependence conditions of D （uk, un） and αtm,ln = 0 （（log log n）-（1＋ε））.展开更多
As known, the method to obtain a sequence space by using convergence field of an infinite matrix is an old method in the theory of sequence spaces. However, the study of convergence field of an infinite matrix in the ...As known, the method to obtain a sequence space by using convergence field of an infinite matrix is an old method in the theory of sequence spaces. However, the study of convergence field of an infinite matrix in the space of almost convergent sequences is so new （see [15]）. The purpose of this paper is to introduce the new spaces ^ ～f and fo consisting of all sequences whose Ceshro transforms of order one are in the spaces f and ^ ～ f0, respectively. Also, in this paper, we show that ^ ～f and ^ ～f0 are linearly isomorphic to the spaces f and f0, respectively. The β- and γ-duals of the spaces ^ ～f and 2% are computed. Furthermore, the classes （^ ～f： μ） and （μ ： f） of infinite matrices are characterized for any given sequence space μ, and determined the necessary and sufficient conditions on a matrix A to satisfy Bc-core（Ax） K-core（x）, K-core（Ax） Bg-core（x）, Bc-core（Ax） Be-core（x）, Bc-core（Ax） t-core（x） for all x ∈ t∞.展开更多
We study the connection between the central limit theorem and law of large numbers for exchangeable sequences, and provide a counterexample to the Gnedenko-Raikov theorem for such sequences.
Considering a sequence of standardized stationary Gaussian random variables, a universal result in the almost sure central limit theorem for maxima and partial sum is established. Our result generalizes and improves t...Considering a sequence of standardized stationary Gaussian random variables, a universal result in the almost sure central limit theorem for maxima and partial sum is established. Our result generalizes and improves that on the almost sure central limit theory previously obtained by Marcin Dudzinski [1]. Our result reaches the optimal form.展开更多
In this paper, we prove an almost sure central limit theorem for weighted sums of mixing sequences of random variables without stationary assumptions. We no longer restrict to logarithmic averages, but allow rather ar...In this paper, we prove an almost sure central limit theorem for weighted sums of mixing sequences of random variables without stationary assumptions. We no longer restrict to logarithmic averages, but allow rather arbitrary weight sequences. This extends the earlier work on mixing random variables展开更多
The four-circuit parallel line on the same tower effectively solves the problems faced by the line reconstruction and construction under the condition of the increasing shortage of transmission corridors.Optimizing th...The four-circuit parallel line on the same tower effectively solves the problems faced by the line reconstruction and construction under the condition of the increasing shortage of transmission corridors.Optimizing the conductor and phase sequence arrangement of multiple transmission lines is conducive to improving electromagnetic and electrostatic coupling caused by electromagnetic problems.This paper uses the ATP-EMTP simulation software to build a 500 kV multi-circuit transmission line on the same tower.It stimulates the induced voltage and current values of different line lengths,tower spacing,vertical and horizontal spacing between different circuits,phase sequence arrangement,and nominal tower height.Moreover,use the BP neural network optimized by a genetic algorithm to predict the induced voltage and current under the unknown conductor and phase sequence arrangement.Finally,based on multi-objective particle swarm algorithm to construct the optimization model of conductor arrangement scheme of overhead transmission line,combined with electromagnetic environment control index,determine the optimal conductor arrangement scheme by the size of particle fitness function,a significant reduction in induced voltages and currents between transmission lines and the four-circuit conductor layout scheme meeting the requirements of the electromagnetic environment is obtained,which provides a reference for the tower design of the transmission station project.展开更多
Let be a strictly stationary sequence of ρ?-mixing random variables. We proved the almost sure central limit theorem, containing the general weight sequences, for the partial sums , where , . The result generalizes a...Let be a strictly stationary sequence of ρ?-mixing random variables. We proved the almost sure central limit theorem, containing the general weight sequences, for the partial sums , where , . The result generalizes and improves the previous results.展开更多
The purpose of this paper is to establish a class of strong limit theorems for arbitrary stochastic sequences. As corollaries, we generalize some known results.
The Kuhn-Tucker theorem in nondifferential form is a well-known classical optimality criterion for a convex programming problems which is true for a convex problem in the case when a Kuhn-Tucker vector exists. It is n...The Kuhn-Tucker theorem in nondifferential form is a well-known classical optimality criterion for a convex programming problems which is true for a convex problem in the case when a Kuhn-Tucker vector exists. It is natural to extract two features connected with the classical theorem. The first of them consists in its possible “impracticability” (the Kuhn-Tucker vector does not exist). The second feature is connected with possible “instability” of the classical theorem with respect to the errors in the initial data. The article deals with the so-called regularized Kuhn-Tucker theorem in nondifferential sequential form which contains its classical analogue. A proof of the regularized theorem is based on the dual regularization method. This theorem is an assertion without regularity assumptions in terms of minimizing sequences about possibility of approximation of the solution of the convex programming problem by minimizers of its regular Lagrangian, that are constructively generated by means of the dual regularization method. The major distinctive property of the regularized Kuhn-Tucker theorem consists that it is free from two lacks of its classical analogue specified above. The last circumstance opens possibilities of its application for solving various ill-posed problems of optimization, optimal control, inverse problems.展开更多
基金Supported by the NNSF of China(10571076) Anhui High Education Research Grant( 2006Kj246B).
文摘Let （Xn）n∈EN be a sequence of arbitrary continuous random variables, by the notion of relative entropy hμ^μ（w） as a measure of dissimilarity between probability measure # and reference measure μ, the explicit, general bounds for the partial sums of arbitrary continuous random variables under suitable conditions are developed. The argument uses the known and elementary lcmma of convergence for likelihood ratio.
基金Project supported by the National Natural Science Foundation of China(11171275)the Natural Science Foundation Project of CQ(cstc2012jjA00029)Liaocheng University Foundation(X09005)
文摘This paper investigates the problem of almost sure limit theorem for the maximum of quasi-stationary sequence based on the result of Turkman and Walker. We prove an almost sure limit theorem for the maximum of a class of quasi-stationary sequence under weak dependence conditions of D （uk, un） and αtm,ln = 0 （（log log n）-（1＋ε））.
文摘As known, the method to obtain a sequence space by using convergence field of an infinite matrix is an old method in the theory of sequence spaces. However, the study of convergence field of an infinite matrix in the space of almost convergent sequences is so new （see [15]）. The purpose of this paper is to introduce the new spaces ^ ～f and fo consisting of all sequences whose Ceshro transforms of order one are in the spaces f and ^ ～ f0, respectively. Also, in this paper, we show that ^ ～f and ^ ～f0 are linearly isomorphic to the spaces f and f0, respectively. The β- and γ-duals of the spaces ^ ～f and 2% are computed. Furthermore, the classes （^ ～f： μ） and （μ ： f） of infinite matrices are characterized for any given sequence space μ, and determined the necessary and sufficient conditions on a matrix A to satisfy Bc-core（Ax） K-core（x）, K-core（Ax） Bg-core（x）, Bc-core（Ax） Be-core（x）, Bc-core（Ax） t-core（x） for all x ∈ t∞.
文摘We study the connection between the central limit theorem and law of large numbers for exchangeable sequences, and provide a counterexample to the Gnedenko-Raikov theorem for such sequences.
文摘Considering a sequence of standardized stationary Gaussian random variables, a universal result in the almost sure central limit theorem for maxima and partial sum is established. Our result generalizes and improves that on the almost sure central limit theory previously obtained by Marcin Dudzinski [1]. Our result reaches the optimal form.
文摘In this paper, we prove an almost sure central limit theorem for weighted sums of mixing sequences of random variables without stationary assumptions. We no longer restrict to logarithmic averages, but allow rather arbitrary weight sequences. This extends the earlier work on mixing random variables
文摘The four-circuit parallel line on the same tower effectively solves the problems faced by the line reconstruction and construction under the condition of the increasing shortage of transmission corridors.Optimizing the conductor and phase sequence arrangement of multiple transmission lines is conducive to improving electromagnetic and electrostatic coupling caused by electromagnetic problems.This paper uses the ATP-EMTP simulation software to build a 500 kV multi-circuit transmission line on the same tower.It stimulates the induced voltage and current values of different line lengths,tower spacing,vertical and horizontal spacing between different circuits,phase sequence arrangement,and nominal tower height.Moreover,use the BP neural network optimized by a genetic algorithm to predict the induced voltage and current under the unknown conductor and phase sequence arrangement.Finally,based on multi-objective particle swarm algorithm to construct the optimization model of conductor arrangement scheme of overhead transmission line,combined with electromagnetic environment control index,determine the optimal conductor arrangement scheme by the size of particle fitness function,a significant reduction in induced voltages and currents between transmission lines and the four-circuit conductor layout scheme meeting the requirements of the electromagnetic environment is obtained,which provides a reference for the tower design of the transmission station project.
基金supported by National Natural Science Foundation of China(11361019).
文摘Let be a strictly stationary sequence of ρ?-mixing random variables. We proved the almost sure central limit theorem, containing the general weight sequences, for the partial sums , where , . The result generalizes and improves the previous results.
基金supported by National Natural Science foundation of China(11071104)
文摘The purpose of this paper is to establish a class of strong limit theorems for arbitrary stochastic sequences. As corollaries, we generalize some known results.
文摘The Kuhn-Tucker theorem in nondifferential form is a well-known classical optimality criterion for a convex programming problems which is true for a convex problem in the case when a Kuhn-Tucker vector exists. It is natural to extract two features connected with the classical theorem. The first of them consists in its possible “impracticability” (the Kuhn-Tucker vector does not exist). The second feature is connected with possible “instability” of the classical theorem with respect to the errors in the initial data. The article deals with the so-called regularized Kuhn-Tucker theorem in nondifferential sequential form which contains its classical analogue. A proof of the regularized theorem is based on the dual regularization method. This theorem is an assertion without regularity assumptions in terms of minimizing sequences about possibility of approximation of the solution of the convex programming problem by minimizers of its regular Lagrangian, that are constructively generated by means of the dual regularization method. The major distinctive property of the regularized Kuhn-Tucker theorem consists that it is free from two lacks of its classical analogue specified above. The last circumstance opens possibilities of its application for solving various ill-posed problems of optimization, optimal control, inverse problems.
