Transformations in the space of almost convergent sequences

Under consideration is the space of almost convergent sequences as well as the operators acting on it. We prove that the space is invariant under the transformations of some class including, in particular, the Hardy and averaging operators.     

Analytic description of statistics of spectra of quantum graphs

We discuss how to obtain exact and approximate distributions for various statistical characteristics of the spectra of quantum graphs using previously found exact solutions of the spectral problem. We indicate the relation between the appearing spectral decompositions and the theory of weakly dependent random variables and indicate the relation between the known limit theorems for trigonometric sums and the universal statistical properties of the spectra of quantum chaotic systems. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 156, No. 1, pp. 38–66, July, 2008.     

Limit theorems for random processes with random time substitution

In this paper we prove a theorem on sufficient conditions for the convergence in the Skorokhod space D[0, 1] of a sequence of random processes with random time substitution. We obtain almost sure versions of this theorem.     

Almost sure comparison of birth and death processes with application to M/M/s queueing systems

Given conditions, which concern the infinitesimal parameters of two birth and death processes, the processes are constructed on the same probability space such that one process is almost surely larger than the other. Application is made to M/M/s queueing systems. Stochastic comparisons of queue length and virtual waiting time in two M/M/s systems are obtained.     

On large sets of almost Hamilton cycle decompositions

A large set of CS(v, k, λ), k‐cycle system of order v with index λ, is a partition of all k‐cycles of K_v into CS(v, k, λ)s, denoted by LCS(v, k, λ). A (v ? 1)‐cycle is called almost Hamilton. The completion of the existence spectrum for LCS(v, v ? 1, λ) only depends on one case: all v ≥ 4 for λ = 2. In this article, it is shown that there exists an LCS(v, v ? 1,2) for any v ≡ 0,1 (mod 4) except v = 5, and for v = 6,7,10,11. © 2006 Wiley Periodicals, Inc. J Combin Designs 16: 53–69, 2008     

Convergence in almost periodic cooperative systems with a first integral

This paper is to investigate the asymptotic dynamics in almost periodic cooperative systems with a first integral. By appealing to the theory of skew-product semiflows we establish the asymptotic almost periodicity of bounded solutions to such systems, which extends the existing convergence results for time independent and periodic cooperative systems with a first integral and proves a conjecture of B. Tang, Y. Kuang and H. Smith in SIAM J. Math. Anal., 24 (1993), 1331-1339.

     

Components identification based method for box constrained variational inequality problems with almost linear functions

We present a method for solving a class of box constrained variational inequality problems. The method makes use of a procedure for identifying some components of the solution by bounding it with an interval vector. It is shown that the method computes an approximate solution of the variational inequality problem by solving at most n reduced systems of equations, where n is the dimension of the problem. Among those systems, only the one of the smallest dimension has to be solved with high accuracy. The others are solved merely to identify some components of the solution, and so the computation can be done under a very mild requirement of accuracy. Numerical results are presented for the obstacle problem, to illustrate the efficiency of the method. AMS subject classification (2000)  90C33, 65G30, 65K10     

Status Set Sequential Pattern Mining Considering Time Windows and Periodic Analysis of Patterns

The traditional sequential pattern mining method is carried out considering the whole time period and often ignores the sequential patterns that only occur in local time windows, as well as possible periodicity. Therefore, in order to overcome the limitations of traditional methods, this paper proposes status set sequential pattern mining with time windows (SSPMTW). In contrast to traditional methods, the item status is considered, and time windows, minimum confidence, minimum coverage, minimum factor set ratios and other constraints are added to mine more valuable rules in local time windows. The periodicity of these rules is also analyzed. According to the proposed method, this paper improves the Apriori algorithm, proposes the TW-Apriori algorithm, and explains the basic idea of the algorithm. Then, the feasibility, validity and efficiency of the proposed method and algorithm are verified by small-scale and large-scale examples. In a large-scale numerical example solution, the influence of various constraints on the mining results is analyzed. Finally, the solution results of SSPM and SSPMTW are compared and analyzed, and it is suggested that SSPMTW can excavate the laws existing in local time windows and analyze the periodicity of the laws, which solves the problem of SSPM ignoring the laws existing in local time windows and overcomes the limitations of traditional sequential pattern mining algorithms. In addition, the rules mined by SSPMTW reduce the entropy of the system.     

REMARK ON STABILITY OF ISHIKAWA ITERATIVE PROCEDURES

1　ＩｎｔｒｏｄｕｃｔｉｏｎａｎｄＰｒｅｌｉｍｉｎａｒｉｅｓＳｕｐｐｏｓｅＥｉｓａｒｅａｌＢａｎａｃｈｓｐａｃｅａｎｄＴｉｓａｓｅｌｆｍａｐｏｆＥ .Ｓｕｐｐｏｓｅｘ0 ∈Ｅａｎｄｘｎ+1=ｆ(Ｔ ,ｘｎ)ｄｅｆｉｎｅｓａｎｉｔｅｒａｔｉｏｎｐｒｏｃｅｄｕｒｅｗｈｉｃｈｙｉｅｌｄｓａｓｅｑｕｅｎｃｅｏｆｐｏｉｎｔｓ ｘｎ ∞ｎ=0 ｉｎＥ .Ｆｏｒａｎｅｘａｍｐｌｅ ,ｔｈｅｆｕｎｃｔｉｏｎｉｔｅｒａｔｉｏｎｘｎ+1=ｆ(Ｔ ,ｘｎ) =Ｔｘ0 .ＳｕｐｐｏｓｅＦ(Ｔ) =ｘ∈Ｅ :Ｔｘ=ｘ ≠ ａｎｄｔｈａｔ ｘｎ ｃｏｎｖｅｒｇｅｓｓ…