Evidential-EM Algorithm Applied to Progressively Censored Observations

Evidential-EM (E2M) algorithm is an effective approach for computing maximum likelihood estimations under finite mixture models, especially when there is uncertain information about data. In this paper we present an extension of the E2M method in a particular case of incom-plete data, where the loss of information is due to both mixture models and censored observations. The prior uncertain information is expressed by belief functions, while the pseudo-likelihood function is derived based on imprecise observations and prior knowledge. Then E2M method is evoked to maximize the generalized likelihood function to obtain the optimal estimation of parameters. Numerical examples show that the proposed method could effectively integrate the uncertain prior infor-mation with the current imprecise knowledge conveyed by the observed data

Stochastic Analysis of a Churn-Tolerant Structured Peer-to-Peer Scheme

We present and analyze a simple and general scheme to build a churn (fault)-tolerant structured Peer-to-Peer (P2P) network. Our scheme shows how to "convert" a static network into a dynamic distributed hash table(DHT)-based P2P network such that all the good properties of the static network are guaranteed with high probability (w.h.p). Applying our scheme to a cube-connected cycles network, for example, yields a $O(\log N)$ degree connected network, in which every search succeeds in $O(\log N)$ hops w.h.p., using $O(\log N)$ messages, where $N$ is the expected stable network size. Our scheme has an constant storage overhead (the number of nodes responsible for servicing a data item) and an $O(\log N)$ overhead (messages and time) per insertion and essentially no overhead for deletions. All these bounds are essentially optimal. While DHT schemes with similar guarantees are already known in the literature, this work is new in the following aspects: (1) It presents a rigorous mathematical analysis of the scheme under a general stochastic model of churn and shows the above guarantees; (2) The theoretical analysis is complemented by a simulation-based analysis that validates the asymptotic bounds even in moderately sized networks and also studies performance under changing stable network size; (3) The presented scheme seems especially suitable for maintaining dynamic structures under churn efficiently. In particular, we show that a spanning tree of low diameter can be efficiently maintained in constant time and logarithmic number of messages per insertion or deletion w.h.p. Keywords: P2P Network, DHT Scheme, Churn, Dynamic Spanning Tree, Stochastic Analysis

Velocity Correlations, Diffusion and Stochasticity in a One-Dimensional System

We consider the motion of a test particle in a one-dimensional system of equal-mass point particles. The test particle plays the role of a microscopic "piston" that separates two hard-point gases with different concentrations and arbitrary initial velocity distributions. In the homogeneous case when the gases on either side of the piston are in the same macroscopic state, we compute and analyze the stationary velocity autocorrelation function C(t). Explicit expressions are obtained for certain typical velocity distributions, serving to elucidate in particular the asymptotic behavior of C(t). It is shown that the occurrence of a non-vanishing probability mass at zero velocity is necessary for the occurrence of a long-time tail in C(t). The conditions under which this is a $t^{-3}$ tail are determined. Turning to the inhomogeneous system with different macroscopic states on either side of the piston, we determine its effective diffusion coefficient from the asymptotic behavior of the variance of its position, as well as the leading behavior of the other moments about the mean. Finally, we present an interpretation of the effective noise arising from the dynamics of the two gases, and thence that of the stochastic process to which the position of any particle in the system reduces in the thermodynamic limit.Comment: 22 files, 2 eps figures. Submitted to PR

Precedence-type Test based on Progressively Censored Samples

In this paper, we introduce precedence-type tests for testing the hypothesis that two distribution functions are equal, which is an extension of the precedence life-test rst proposed by Nelson (1963), when the two samples are progressively Type-II censored. The null distributions of the test statistics are derived. Critical values for some combination of sample sizes and censoring schemes for the proposed tests are presented. Then, we present the exact power functions under the Lehmann alternative, and compare the exact power as well as simulated power (under location-shift) of the proposed precedence test based on nonparametric estimates of CDF with other precedence-type tests. We then examine the power properties of the proposed test procedures through Monte Carlo simulations. Two examples are presented to illustrate all the test procedures discussed here. Finally, we make some concluding remarks.Precedence test; Product-limit estimator; Type-II progressive censoring; Life-testing; level of significance; power; Lehmann alternative; Monte Carlo simulations

Self-assembly of iron nanoclusters on the Fe3O4(111) superstructured surface

We report on the self-organized growth of a regular array of Fe nanoclusters on a nanopatterned magnetite surface. Under oxidizing preparation conditions the (111) surface of magnetite exhibits a regular superstructure with three-fold symmetry and a 42 A periodicity. This superstructure represents an oxygen terminated (111) surface, which is reconstructed to form a periodically strained surface. This strain patterned surface has been used as a template for the growth of an ultrathin metal film. A Fe film of 0.5 A thickness was deposited on the substrate at room temperature. Fe nanoclusters are formed on top of the surface superstructure creating a regular array with the period of the superstructure. We also demonstrate that at least the initial stage of Fe growth occurs in two-dimensional mode. In the areas of the surface where the strain pattern is not formed, random nucleation of Fe was observed.Comment: 6 pages, 3 figure

A Probabilistic Analysis of Kademlia Networks

Kademlia is currently the most widely used searching algorithm in P2P (peer-to-peer) networks. This work studies an essential question about Kademlia from a mathematical perspective: how long does it take to locate a node in the network? To answer it, we introduce a random graph K and study how many steps are needed to locate a given vertex in K using Kademlia's algorithm, which we call the routing time. Two slightly different versions of K are studied. In the first one, vertices of K are labelled with fixed IDs. In the second one, vertices are assumed to have randomly selected IDs. In both cases, we show that the routing time is about c*log(n), where n is the number of nodes in the network and c is an explicitly described constant.Comment: ISAAC 201

Rate coefficients for rovibrational transitions in H_2 due to collisions with He

We present quantum mechanical and quasiclassical trajectory calculations of cross sections for rovibrational transitions in ortho- and para-H_2 induced by collisions with He atoms. Cross sections were obtained for kinetic energies between 10^-4 and 3 eV, and the corresponding rate coefficients were calculated for the temperature range 100<T<4000 K. Comparisons are made with previous calculations.Comment: 21 pages, 2 figures, AAS, eps