This is a tutorial for the many-worlds theory by Everett, which includes some of my personal views. It has two main parts.The first part shows emergence many worlds in universe consisting only Mach-Zehnder interferometer. The second an abridgment Everett's long thesis, where his was originally elaborated detail with clarity and rigor. Some minor comments are added light recent developments. Eve...

The paper considers grid computing systems in which the resource management systems (RMS) can divide service tasks into subtasks and send the subtasks to different resources for parallel execution. In order to provide desired level of service reliability the RMS can assign the same subtasks to several independent resources for parallel execution. The service reliability and performance indices ...

We show that at the onset of a cyclic fold bifurcation, a birhythmic medium composed of glycolytic oscillators displays turbulent dynamics. By computing the largest Lyapunov exponent, the spatial correlation function, and the average transient lifetime, we classify it as weak turbulence of a transient nature. Virtual heterogeneities generating unstable fast oscillations account for the transien...

We consider planar maps with three boundaries, colloquially called pairs of pants. In the case bipartite controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively Collet Fusy. this paper, we obtain an even simpler formula tight pants, namely whose boundaries have minimal length in homotopy class. follow bijective approach based on slic...

A novel variant of NSN P systems, called numerical spiking neural systems with a variable consumption strategy (NSNVC systems), is proposed. Like the rules consuming spikes in NSNVC introduce by modifying form production functions used systems. Similar to delay feature rules, postponement into functions. The execution controlled two, i.e., polarization and threshold, conditions. Multiple synapt...

Many applications call for universal compression of strings over large, possibly infinite, alphabets. However, it has long been known that the resulting redundancy is infinite even for i.i.d. distributions. It was recently shown that the redudancy of the strings’ patterns, which abstract the values of the symbols, retaining only their relative precedence, is sublinear in the blocklength n, henc...

We study the problem of the generation of a continuous random variable when a source of independent fair coins is available. We first motivate the choice of a natural criterion for measuring accuracy, the Wasserstein L∞ metric, and then show a universal lower bound for the expected number of required fair coins as a function of the accuracy. In the case of an absolutely continuous random variab...

In this paper we obtain a universal lower bound on the 2-adic order of lacunary sums of binomial coefficients. By means of necessary and sufficient conditions, we determine the set of values for which the bound is achieved and show the periodicity of the set. We prove a congruential identity for the corresponding generating function. Our approach gives an alternative and transparent proof for s...

avalanches, and ζ the roughness exponent at the depinning transition. Measurement of the scaling function f(s) := sp(s) is compared with the predictions from a recent Functional RG (FRG) calculation, both at mean-field and one-loop level. The avalanche-size exponent τ is found in good agreement with the conjecture τ = 2− 2/(d+ ζ), recently confirmed to one loop via the FRG. The function f(s) ex...