On the recursive sequence

We show that every positive solution of the equation

where , converges to a period two solution.

     

Device-Independent Certification of Maximal Randomness from Pure Entangled Two-Qutrit States Using Non-Projective Measurements

While it has recently been demonstrated how to certify the maximal amount of randomness from any pure two-qubit entangled state in a device-independent way, the problem of optimal randomness certification from entangled states of higher local dimension remains open. Here we introduce a method for device-independent certification of the maximal possible amount of 2log23 random bits using pure bipartite entangled two-qutrit states and extremal nine-outcome general non-projective measurements. To this aim, we exploit a device-independent method for certification of the full Weyl–Heisenberg basis in three-dimensional Hilbert spaces together with a one-sided device-independent method for certification of two-qutrit partially entangled states.     

Reliability formula &; limit law of the failure time of “<Emphasis Type="Italic">m</Emphasis>-consecutive-<Emphasis Type="Italic">k</Emphasis>-out-of-<Emphasis Type="Italic">n</Emphasis>:<Emphasis Type="Italic">F</Emphasis> system”

An “m-consecutive-k-out-of-n:F system” consists of n components ordered on a line; the system fails if and only if there are at least m nonoverlapping runs of k consecutive failed components. In this paper, we give a recursive formula to compute the reliability of such a system. Thereafter, we state two asymptotic results concerning the failure time Z _n of the system. The first result concerns a limit theorem for Z _n when the failure times of components are not necessarily with identical failure distributions. In the second one, we prove that, for an arbitrary common failure distribution of components, the limit system failure distribution is always of the Poisson class.      

Q-Learning Algorithms with Random Truncation Bounds and Applications to Effective Parallel Computing

Motivated by an important problem of load balancing in parallel computing, this paper examines a modified algorithm to enhance Q-learning methods, especially in asynchronous recursive procedures for self-adaptive load distribution at run-time. Unlike the existing projection method that utilizes a fixed region, our algorithm employs a sequence of growing truncation bounds to ensure the boundedness of the iterates. Convergence and rates of convergence of the proposed algorithm are established. This class of algorithms has broad applications in signal processing, learning, financial engineering, and other related fields. G. Yin’s research was supported in part by the National Science Foundation under Grants DMS-0603287 and DMS-0624849 and in part by the National Security Agency under Grant MSPF-068-029. C.Z. Xu’s research was supported in part by the National Science Foundation under Grants CCF-0611750, DMS-0624849, CNS-0702488, and CRI-0708232. L.Y. Wang’s research was supported in part by the National Science Foundation under Grants ECS-0329597 and DMS-0624849 and by the Michigan Economic Development Council.     

Modelling of three-dimensional mechanical systems using point coordinates with a recursive approach

In this paper, the dynamic simulation of constrained mechanical systems that are interconnected of rigid bodies is studied using projection recursive algorithm. The method uses the concepts of linear and angular momentums to generate the rigid body equations of motion in terms of the Cartesian coordinates of a dynamically equivalent constrained system of particles, without introducing any rotational coordinates and the corresponding rotational transformation matrix. Closed-chain system is transformed to open-chain by cutting suitable kinematical joints and introducing cut-joint constraints. For the resulting open-chain system, the equations of motion are generated recursively along the serial chains. An example is chosen to demonstrate the generality and simplicity of the developed formulation.     

Spectra of Anderson type models with decaying randomness

In this paper we consider some Anderson type models, with free parts having long range tails and with the random perturbations decaying at different rates in different directions and prove that there is a.c. spectrum in the model which is pure. In addition, we show that there is pure point spectrum outside some interval. Our models include potentials decaying in all directions in which case absence of singular continuous spectrum is also shown.     

A Note on Closed Degrees of Difficulty of the Medvedev Lattice

We consider some nonprincipal filters of the Medvedev lattice. We prove that the filter generated by the nonzero closed degrees of difficulty is not principal and we compare this filter, with respect to inclusion, with some other filters of the lattice. All the filters considered in this paper are disjoint from the prime ideal generated by the dense degrees of difficulty. Mathematics Subject Classification: 03D30.     

Computable Real-Valued Functions on Recursive Open and Closed Subsets of Euclidean Space

In this paper we study intrinsic notions of “computability” for open and closed subsets of Euclidean space. Here we combine together the two concepts, computability on abstract metric spaces and computability for continuous functions, and delineate the basic properties of computable open and closed sets. The paper concludes with a comprehensive examination of the Effective Riemann Mapping Theorem and related questions.     

用类同余法产生随机数及其检验

模拟随机过程的各种模型都需要用到大量随机数 ,而各种分布的随机样本又可以由U(0 ,1)来产生 ,所以如何产生性能好、成本低、使用方便的随机数具有重要意义。本文介绍了一种随机数的产生方法并对其进行了严格的检验。