基于Bernstein Copula函数的随机变量序列的Max-Sum局部等价式

该文考虑一类具有局部长尾分布,但不一定具有相同分布的随机变量序列,其联合分布由Bernstein copula函数进行联系.研究其部分和及其最大值的局部分布的渐近性质.在假设诸随机变量服从局部次指数分布的条件下,得到了Max-Sum局部等价性.该等价性从局部和相依的角度描述了随机游动的一次大跳原理.数值实验表明所得结果稳定可行.

SOME LIMIT THEOREMS FOR WEIGHTED SUMS OF ARRAYS OF NOD RANDOM VARIABLES

In this paper the authors study the complete, weak and almost sure convergence for weighted sums of NOD random variables and obtain some new limit theorems for weighted sums of NOD random variables, which extend the corresponding theorems of Stout [1], Thrum [2] and Hu et al. [3].

SELF-NORMALIZED CENTRAL LIMIT THEOREM AND ESTIMATION OF VARIANCE OF PARTIAL SUMS FOR NEGATIVE DEPENDENT RANDOM VARIABLES

Let ｛X n,n≥1｝ be a stationary LNQD or NA sequence satisfying EX 1=μ,EX 2 1<∞ and (Var S n)/n→σ 2 as n→∞.In this paper a class of self-normalized central limit theorems and estimators of Var S n are studied.The weak and strong consistency of the estimators of Var S n are presented.

APPLICATIONS OF HYPERGEOMETRIC SUMMATION THEOREMS OF KUMMER AND DIXON INVOLVING DOUBLE SERIES

Using series iteration techniques identities and apply each of these identities in we derive a number of general double series order to deduce several hypergeometric reduction formulas involving the Srivastava-Daoust double hypergeometric function. The results presented in this article are based essentially upon the hypergeometric summation theorems of Kummer and Dixon.

Some generalized limit theorems concerning delayed sums of random sequence

For a sequence of arbitrarily dependent m-valued random variables （Xn） n∈N , the generalized strong limit theorem of the delayed average is investigated. In our proof, we improved the method proposed by Liu [6] . As an application, we also studied some limit properties of delayed average for inhomogeneous Markov chains.

EXACT EVALUATIONS OF FINITE TRIGONOMETRIC SUMS BY SAMPLING THEOREMS

We use the sampling representations associated with Sturm-Liouville difference operators to derive generalized integral-valued trigonometric sums. This extends the known results where zeros of Chebyshev polynomials of the first kind are involved to the use of the eigenvalues of difference operators, which leads to new identities. In these identities Bernoulli＇s numbers play a role similar to that of Euler＇s in the old ones. Our technique differs from that of Byrne-Smith （1997） and Berndt-Yeap （2002）.

A THEOREM ON THE CONVERGENCE OF SUMS OF INDEPENDENT RANDOM VARIABLES

Let Sigma (infinity)(n=1) X-n be a series of independent random variables with at least one non-degenerate X-n, and let F-n be the distribution function of its partial sums S-n = Sigma (n)(k=1) X-k. Motivated by Hildebrand's work in [1], the authors investigate the a.s. convergence of Sigma (infinity)(n=1) X-n under a hypothesis that Sigma (infinity)(n=1) rho (X-n, c(n)) = infinity whener Sigma (infinity)(n=1) c(n) diverges, where the notation rho (X,c) denotes the Levy distance between the random variable X and the constant c. The principal result of this paper shows that the hypothesis is the condition under which the convergence of F-n(x(0)) with the limit value 0 < L-0 < 1, together with the essential convergence of Sigma (infinity)(n=1) X-n, is both sufficient and necessary in order for the series Sigma (infinity)(n=1) X-n to a.s. coverage. Moreover, if the essential convergence of Sigma (infinity)(n=1) X-n is strengthened to limsup(n=infinity) P(\S-n\ < K) = 1 for some K > 0, the hypothesis is already equivalent to the a.s. convergence of Sigma (infinity)(n=1) X-n. Here they have not only founded a very general limit theorem, but improved the related result in Hildebrand([1]) as well.

An Almost Sure Central Limit Theorem for Weighted Sums of Mixing Sequences

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

A Note on the Almost Sure Central Limit Theorem in the Joint Version for the Maxima and Partial Sums of Certain Stationary Gaussian 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.

The Non-countable Summation Type Hahn-Schur Theorems

The classical countable summation type Hahn-Schur theorem is a famous result in summation theory and measure theory. An interesting problem is whether the theorem can be generalized to non-countable summation case? In this paper, we show that the answer is true.

Bayes Theorem Based Virtual Machine Scheduling for Optimal Energy Consumption

This paper proposes an algorithm for scheduling Virtual Machines(VM)with energy saving strategies in the physical servers of cloud data centers.Energy saving strategy along with a solution for productive resource utilizationfor VM deployment in cloud data centers is modeled by a combination of“VirtualMachine Scheduling using Bayes Theorem”algorithm(VMSBT)and Virtual Machine Migration(VMMIG)algorithm.It is shown that the overall data center’sconsumption of energy is minimized with a combination of VMSBT algorithmand Virtual Machine Migration(VMMIG)algorithm.Virtual machine migrationbetween the active physical servers in the data center is carried out at periodicalintervals as and when a physical server is identified to be under-utilized.In VMscheduling,the optimal data centers are clustered using Bayes Theorem and VMsare scheduled to appropriate data center using the selection policy that identifiesthe cluster with lesser energy consumption.Clustering using Bayes rule minimizesthe number of server choices for the selection policy.Application of Bayestheorem in clustering has enabled the proposed VMSBT algorithm to schedule thevirtual machines on to the physical server with minimal execution time.The proposedalgorithm is compared with other energy aware VM allocations algorithmsviz.“Ant-Colony”optimization-based(ACO)allocation scheme and“min-min”scheduling algorithm.The experimental simulation results prove that the proposedcombination of‘VMSBT’and‘VMMIG’algorithm outperforms othertwo strategies and is highly effective in scheduling VMs with reduced energy consumptionby utilizing the existing resources productively and by minimizing thenumber of active servers at any given point of time.

A Note on the Almost Sure Central Limit Theorem for Partial Sums of ρ^(−)-Mixing Sequences

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.

Products of Odd Numbers or Prime Number Can Generate the Three Members’ Families of Fermat Last Theorem and the Theorem Is Valid for Summation of Squares of More Than Two Natural Numbers

Fermat’s last theorem, had the statement that there are no natural numbers A, B, and C such that An + Bn = Cn, in which n is a natural number greater than 2. We have shown that any product of two odd numbers can generate Fermat or Pythagoras triple (A, B, C) following n = 2 and also it is applicable A2 + B2 + C2 + D2 + so on =An2 where all are natural numbers.

Dilation,discrimination and Uhlmann's theorem of link products of quantum channels

We establish the Stinespring dilation theorem of the link product of quantum channels in two different ways,discuss the discrimination of quantum channels,and show that the distinguishability can be improved by self-linking each quantum channel n times as n grows.We also find that the maximum value of Uhlmann's theorem can be achieved for diagonal channels.

New Asymptotic Results on Fermat-Wiles Theorem

We analyse the Diophantine equation of Fermat xp yp = zp with p > 2 a prime, x, y, z positive nonzero integers. We consider the hypothetical solution (a, b, c) of previous equation. We use Fermat main divisors, Diophantine remainders of (a, b, c), an asymptotic approach based on Balzano Weierstrass Analysis Theorem as tools. We construct convergent infinite sequences and establish asymptotic results including the following surprising one. If z y = 1 then there exists a tight bound N such that, for all prime exponents p > N , we have xp yp zp.

Intelligent reflecting surface for sum rate enhancement in MIMO systems

The research for the Intelligent Reflecting Surface(IRS)which has the advantages of cost and energy efficiency has been studied.Channel capacity can be effectively increased by appropriately setting the phase value of IRS elements according to the channel conditions.However,the problem of obtaining an appropriate phase value of IRs is difficult to solve due to the non-convex problem.This paper proposes an iterative algorithm for the alternating optimal solution in the Single User Multiple-Input-Multiple-Output(SU-MIMO)systems.The proposed iterative algorithm finds an alternating optimal solution that is the phase value of IRS one by one.The results show that the proposed method has better performance than that of the randomized IRS systems.The number of iterations for maximizing the performance of the proposed algorithm depends on the channel state between the IRS and the receiver.

Complete Convergenceand Complete Moment Convergence for Weighted Sums of ANA Random Variables

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.

基于BCUSUM的多参数变点估计

文章基于递归残差的逆序特征和隔离检测研究了回归模型多参数变点的检测方法。首先,构建带有变点的回归模型,考虑到多元正向CUSUM检验能防止协变量均值与偏移量正交时损失功效,但其变点检测效果并不理想的情况,引入修正的检验统计量BCUSUM。其次,结合快速高效的隔离检测技术,提出MCPDP算法用于估计变点数目及位置。最后,模拟结果表明,所提出的方法能较好地控制检验水平,有更高的功效;评价结果显示,MCPDP算法在变点估计性能方面表现较优;实例分析表明,交通流变点符合实际交通情况,验证了该方法的有效性,且所构建的模型可以作为交通参数确定性经验关系的一种修正。

Diophantine equations and Fermat's last theorem for multivariate(skew-)polynomials

Fermat’s Last Theorem is a famous theorem in number theory which is difficult to prove.However,it is known that the version of polynomials with one variable of Fermat’s Last Theorem over C can be proved very concisely.The aim of this paper is to study the similar problems about Fermat’s Last Theorem for multivariate(skew)-polynomials with any characteristic.

AAK Theorem and a Design of Multidimensional BIBO Stable Filters

Rational approximation theory occupies a significant place in signal processing and systems theory. This research paper proposes an optimal design of BIBO stable multidimensional Infinite Impulse Response filters with a realizable (rational) transfer function thanks to the Adamjan, Arov and Krein (AAK) theorem. It is well known that the one dimensional AAK results give the best approximation of a polynomial as a rational function in the Hankel semi norm. We suppose that the Hankel matrix associated to the transfer function has a finite rank.