Recently people proved that every f∈C[0, 1] can be uniformly approximated by polynomial sequences {P_n}, {Q_n} such for any x∈[0,1] and n=1,2,…that Q_n(x)<Q_(n+1)(x)<f(x)<P_(n+1)(x)<P_n(x). For example...Recently people proved that every f∈C[0, 1] can be uniformly approximated by polynomial sequences {P_n}, {Q_n} such for any x∈[0,1] and n=1,2,…that Q_n(x)<Q_(n+1)(x)<f(x)<P_(n+1)(x)<P_n(x). For example, Xie and Zhou showed that one can construct such monotone polynomial sequences which do achieve the best uniform approximation rate for a continuous func- tion. Actually they obtained a result as ‖P_n(x)-Q_n(x)‖≤42E_n (f), (1) which essentially improved a conclusion in Gal and Szabados. The present paper, by optimal procedure, improves this inequality to ‖[P_n(x)-Q_n(x)‖≤(18+ε)E_n(f), where εis any positive real number.展开更多
This paper presents a high efficiency spread spectrum scheme using approximate orthogonal complex (AOC) sequences. In this scheme, the 64 AOC sequences picked up from 84 complex sequences space are employed for spread...This paper presents a high efficiency spread spectrum scheme using approximate orthogonal complex (AOC) sequences. In this scheme, the 64 AOC sequences picked up from 84 complex sequences space are employed for spreading spectrum. In modulation, 6 input bits is used to select one AOC sequence, and the selected sequence is then phase-rotated by another 2 input bits. In demodulator, a complex correlator detects the transmitted AOC sequence. Simulation results show that the proposed scheme has better BER performance than the existing complementary code keying (CCK) modulation scheme. For AOC, additional processing gain of 1.79dB can be obtained when the sequence length is 8.展开更多
The AR-quiver and derived equivalence are two important subjects in the repre- sentation theory of finite dimensional algebras, and for them there are two important research tools-AR-sequences and ：D-split sequences....The AR-quiver and derived equivalence are two important subjects in the repre- sentation theory of finite dimensional algebras, and for them there are two important research tools-AR-sequences and ：D-split sequences. So in order to study the representations of triangular matrix algebra T2（T） - （T O,T T）whereTis a finite dimensional algebra over afield, it is important to determine its AR-sequences and ：D-split sequences. The aim of this paper is to construct the right（left） almost split morphisms, irreducible morphisms, almost split sequences and V-split sequences of T2（T） through the corresponding morphisms and sequences of T. Some interesting results are obtained.展开更多
In this present paper, firstly, the modified positive operators and their discrete operators are constructed. Then, we investigate the statistical approximation properties and rates of convergence by using modulus of ...In this present paper, firstly, the modified positive operators and their discrete operators are constructed. Then, we investigate the statistical approximation properties and rates of convergence by using modulus of continuity of these positive linear operators. Finally, we obtain the rate of statistical convergence of truncated operators.展开更多
In uncertainty analysis and reliability-based multidisciplinary design and optimization(RBMDO)of engineering structures,the saddlepoint approximation(SA)method can be utilized to enhance the accuracy and efficiency of...In uncertainty analysis and reliability-based multidisciplinary design and optimization(RBMDO)of engineering structures,the saddlepoint approximation(SA)method can be utilized to enhance the accuracy and efficiency of reliability evaluation.However,the random variables involved in SA should be easy to handle.Additionally,the corresponding saddlepoint equation should not be complicated.Both of them limit the application of SA for engineering problems.The moment method can construct an approximate cumulative distribution function of the performance function based on the first few statistical moments.However,the traditional moment matching method is not very accurate generally.In order to take advantage of the SA method and the moment matching method to enhance the efficiency of design and optimization,a fourth-moment saddlepoint approximation(FMSA)method is introduced into RBMDO.In FMSA,the approximate cumulative generating functions are constructed based on the first four moments of the limit state function.The probability density function and cumulative distribution function are estimated based on this approximate cumulative generating function.Furthermore,the FMSA method is introduced and combined into RBMDO within the framework of sequence optimization and reliability assessment,which is based on the performance measure approach strategy.Two engineering examples are introduced to verify the effectiveness of proposed method.展开更多
We establish strong invariance principles for sums of stationary p-mixing random variables with finite and infinite second moments under weaker mixing rates. Some earlier results are improved. As applications, some re...We establish strong invariance principles for sums of stationary p-mixing random variables with finite and infinite second moments under weaker mixing rates. Some earlier results are improved. As applications, some results of the law of the iterated logarithm with finite and infinite variance are obtained, also a conjecture raised by Shao in 1993 is solved展开更多
文摘Recently people proved that every f∈C[0, 1] can be uniformly approximated by polynomial sequences {P_n}, {Q_n} such for any x∈[0,1] and n=1,2,…that Q_n(x)<Q_(n+1)(x)<f(x)<P_(n+1)(x)<P_n(x). For example, Xie and Zhou showed that one can construct such monotone polynomial sequences which do achieve the best uniform approximation rate for a continuous func- tion. Actually they obtained a result as ‖P_n(x)-Q_n(x)‖≤42E_n (f), (1) which essentially improved a conclusion in Gal and Szabados. The present paper, by optimal procedure, improves this inequality to ‖[P_n(x)-Q_n(x)‖≤(18+ε)E_n(f), where εis any positive real number.
文摘This paper presents a high efficiency spread spectrum scheme using approximate orthogonal complex (AOC) sequences. In this scheme, the 64 AOC sequences picked up from 84 complex sequences space are employed for spreading spectrum. In modulation, 6 input bits is used to select one AOC sequence, and the selected sequence is then phase-rotated by another 2 input bits. In demodulator, a complex correlator detects the transmitted AOC sequence. Simulation results show that the proposed scheme has better BER performance than the existing complementary code keying (CCK) modulation scheme. For AOC, additional processing gain of 1.79dB can be obtained when the sequence length is 8.
基金Supported by the National Natural Science Foundation of China(Grant No.10971172)the Natural Science Foundation of Beijing(Grant Nos.10920021122002)
文摘The AR-quiver and derived equivalence are two important subjects in the repre- sentation theory of finite dimensional algebras, and for them there are two important research tools-AR-sequences and ：D-split sequences. So in order to study the representations of triangular matrix algebra T2（T） - （T O,T T）whereTis a finite dimensional algebra over afield, it is important to determine its AR-sequences and ：D-split sequences. The aim of this paper is to construct the right（left） almost split morphisms, irreducible morphisms, almost split sequences and V-split sequences of T2（T） through the corresponding morphisms and sequences of T. Some interesting results are obtained.
文摘In this present paper, firstly, the modified positive operators and their discrete operators are constructed. Then, we investigate the statistical approximation properties and rates of convergence by using modulus of continuity of these positive linear operators. Finally, we obtain the rate of statistical convergence of truncated operators.
基金support from the Key R&D Program of Shandong Province(Grant No.2019JZZY010431)the National Natural Science Foundation of China(Grant No.52175130)+1 种基金the Sichuan Science and Technology Program(Grant No.2022YFQ0087)the Sichuan Science and Technology Innovation Seedling Project Funding Projeet(Grant No.2021112)are gratefully acknowledged.
文摘In uncertainty analysis and reliability-based multidisciplinary design and optimization(RBMDO)of engineering structures,the saddlepoint approximation(SA)method can be utilized to enhance the accuracy and efficiency of reliability evaluation.However,the random variables involved in SA should be easy to handle.Additionally,the corresponding saddlepoint equation should not be complicated.Both of them limit the application of SA for engineering problems.The moment method can construct an approximate cumulative distribution function of the performance function based on the first few statistical moments.However,the traditional moment matching method is not very accurate generally.In order to take advantage of the SA method and the moment matching method to enhance the efficiency of design and optimization,a fourth-moment saddlepoint approximation(FMSA)method is introduced into RBMDO.In FMSA,the approximate cumulative generating functions are constructed based on the first four moments of the limit state function.The probability density function and cumulative distribution function are estimated based on this approximate cumulative generating function.Furthermore,the FMSA method is introduced and combined into RBMDO within the framework of sequence optimization and reliability assessment,which is based on the performance measure approach strategy.Two engineering examples are introduced to verify the effectiveness of proposed method.
基金supported by National Natural Science Foundation of China(Grant Nos. 11171303 and 60974006)the Specialized Research Fund for the Doctor Program of Higher Education(Grant No.20090101110020)the Natural Science Foundation of Zhejiang Province(Grant No.Y6100176)
文摘We establish strong invariance principles for sums of stationary p-mixing random variables with finite and infinite second moments under weaker mixing rates. Some earlier results are improved. As applications, some results of the law of the iterated logarithm with finite and infinite variance are obtained, also a conjecture raised by Shao in 1993 is solved
