A Note on Cactus Trees: Variational vs. Recursive Approach

In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent.     

Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Large deviation for the empirical eigenvalue density of truncated Haar unitary matrices

Let U_m be an m×m Haar unitary matrix and U_[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U_[m,n] as m/n→λ and n→∞. The rate function and the limit distribution are given explicitly. U_[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq.     

A computational strategy for multiscale systems with applications to Lorenz 96 model

Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model.     

The Asymmetric Avalanche Process

An asymmetric stochastic process describing the avalanche dynamics on a ring is proposed. A general kinetic equation which incorporates the exclusion and avalanche processes is considered. The Bethe ansatz method is used to calculate the generating function for the total distance covered by all particles. It gives the average velocity of particles which exhibits a phase transition from an intermittent to continuous flow. We calculated also higher cumulants and the large deviation function for the particle flow. The latter has the universal form obtained earlier for the asymmetric exclusion process and conjectured to be common for all models of the Kardar–Parisi–Zhang universality class.     

Enhancement of the Kerr effect for a quantum dot in a cavity

Nonlinear susceptibility of a quantum dot (QD) embedded in a two-sided cavity, is studied theoretically from a weak-coupling to a strong-coupling regime. In the relevance of a quantum logic gate, the corresponding nonlinear phase shifts (Kerr effect) are estimated for coherent wavepackets including one photon on average. In the weak-coupling regime, the phase shift enhances strongly as a function of a coupling constant between the cavity photon and QD, and eventually saturates in the strong-coupling regime. We also show transmission spectra to evaluate the efficiency of the phase shift. Although the efficiency decreases monotonically in the weak-coupling regime, it rises in the strong-coupling regime.     

证券价格按几何布朗运动变化的微观解释

金融市场研究中经常不加解释地假设证券价格按几何布朗运动变化 .本文通过假定投资者要求来自证券的期望收益率与证券价格无关 ,在理想市场的前提条件下 ,对证券价格运动将遵循有漂移率的几何布朗运动给予严格的证明 .     

A Novel Segmentation and Feedback Model for Resolving Contention in Optical Burst Switching

A novel segmentation and feedback model (SFM) applied to resolve contention is proposed. Simulation and performance analyses show that the SFM effectively avoids contentions in optical burst switching (OBS). The long delay time of deflection routing and the immature technology of wavelength converters and optical buffers are not deployed in the SFM. The SFM does not only realize fast switching but also allows preemption by higher priority bursts.     

移动式数据挖掘平台模型

本文提出了一种移动式网络海量数据挖掘平台，给出了数据挖掘任务的形式化描述，详细讨论了平台的体系结构、工作原理与流程。该平台克服了传统网络计算模式的缺陷，支持对异质、分散数据源和知识源的挖掘和检索，具有开放性、可伸缩性、灵活性、可扩展性、健壮性。