Variable-Length Coding of Two-Sided Asymptotically Mean Stationary Measures

We collect several observations that concern variable-length coding of two-sided infinite sequences in a probabilistic setting. Attention is paid to images and preimages of asymptotically mean stationary measures defined on subsets of these sequences. We point out sufficient conditions under which the variable-length coding and its inverse preserve asymptotic mean stationarity. Moreover, conditions for preservation of shift-invariant $\sigma$-fields and the finite-energy property are discussed and the block entropies for stationary means of coded processes are related in some cases. Subsequently, we apply certain of these results to construct a stationary nonergodic process with a desired linguistic interpretation.Comment: 20 pages. A few typos corrected after the journal publicatio

Network synchronization: Optimal and Pessimal Scale-Free Topologies

By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency towards disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting ``pessimal networks'' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability.Comment: 11 pages, 4 figs, submitted to J. Phys. A (proceedings of Complex Networks 2007

Precise Descriptions of VLC Synchronization with CSP Semantic Models

Variable length codes (VLC) have found widespread applications due to their inherent coding efficiency. However, encoder-decoder synchronization becomes critically important for VLC to operate properly. Traditional treebased techniques lack the scalability to analyse the synchronization behaviours of VLC, and simulation techniques are typically used instead for large code sets. Building on an initial paper in which we first described an application of CSP to this domain, we present further advances in this paper. The contributions of this paper are twofold. First, we describe a novel application of the CSP stable failure model to completely describe the VLC synchronization mechanisms. Consequently, we concisely characterize bit patterns that can bring about rapid synchronization. The overall goal is to advance our understanding in this important area of research through an established formal description technique originally developed and used within the computing research community

Synchronization with permutation codes and Reed-Solomon codes

D.Ing. (Electrical And Electronic Engineering)We address the issue of synchronization, using sync-words (or markers), for encoded data. We focus on data that is encoded using permutation codes or Reed-Solomon codes. For each type of code (permutation code and Reed-Solomon code) we give a synchronization procedure or algorithm such that synchronization is improved compared to when the procedure is not employed. The gure of merit for judging the performance is probability of synchronization (acquisition). The word acquisition is used to indicate that a sync-word is acquired or found in the right place in a frame. A new synchronization procedure for permutation codes is presented. This procedure is about nding sync-words that can be used speci cally with permutation codes, such that acceptable synchronization performance is possible even under channels with frequency selective fading/jamming, such as the power line communication channel. Our new procedure is tested with permutation codes known as distance-preserving mappings (DPMs). DPMs were chosen because they have de ned encoding and decoding procedures. Another new procedure for avoiding symbols in Reed-Solomon codes is presented. We call the procedure symbol avoidance. The symbol avoidance procedure is then used to improve the synchronization performance of Reed-Solomon codes, where known binary sync-words are used for synchronization. We give performance comparison results, in terms of probability of synchronization, where we compare Reed-Solomon with and without symbol avoidance applied

Space programs summary no. 37-64, volume 2 for the period 1 June to 31 July 1970. The Deep Space Network

Mariner Mars 1971 mission support, engineering, and design of Deep Space Networ

Infinite anti-uniform sources

6 pagesInternational audienceIn this paper we consider the class of anti-uniform Huffman (AUH) codes for sources with infinite alphabet. Poisson, negative binomial, geometric and exponential distributions lead to infinite anti-uniform sources for some ranges of their parameters. Huffman coding of these sources results in AUH codes. We prove that as a result of this encoding, we obtain sources with memory. For these sources we attach the graph and derive the transition matrix between states, the state probabilities and the entropy. If c0 and c1 denote the costs for storing or transmission of symbols "0" and "1", respectively, we compute the average cost for these AUH codes

Analytical and Numerical Studies of Noise-induced Synchronization of Chaotic Systems

We study the effect that the injection of a common source of noise has on the trajectories of chaotic systems, addressing some contradictory results present in the literature. We present particular examples of 1-d maps and the Lorenz system, both in the chaotic region, and give numerical evidence showing that the addition of a common noise to different trajectories, which start from different initial conditions, leads eventually to their perfect synchronization. When synchronization occurs, the largest Lyapunov exponent becomes negative. For a simple map we are able to show this phenomenon analytically. Finally, we analyze the structural stability of the phenomenon.Comment: 10 pages including 12 postscript figures, revtex. Additional work in http://www.imedea.uib.es/Nonlinear . The paper with higher-resolution figures can be obtained from http://www.imedea.uib.es/PhysDept/publicationsDB/date.htm

Critical phenomena in complex networks

The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years, researchers have made important steps toward understanding the qualitatively new critical phenomena in complex networks. We review the results, concepts, and methods of this rapidly developing field. Here we mostly consider two closely related classes of these critical phenomena, namely structural phase transitions in the network architectures and transitions in cooperative models on networks as substrates. We also discuss systems where a network and interacting agents on it influence each other. We overview a wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, k-core percolation, phenomena near epidemic thresholds, condensation transitions, critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks. We also discuss strong finite size effects in these systems and highlight open problems and perspectives.Comment: Review article, 79 pages, 43 figures, 1 table, 508 references, extende

A feasibility study of a mobile app to treat insomnia

Insomnia is a major public health concern. Sleep restriction therapy (SRT) is an effective behavioral treatment but its delivery is impeded by a shortage of trained clinicians. We developed a mobile app delivering SRT to individuals with insomnia. This feasibility study employed a mixed-methods design to examine the engagement, acceptability, and potential efficacy of the mobile app. Fifteen participants diagnosed with insomnia disorder used the mobile app synchronized with a wearable device for 3 weeks. Those who persisted with the study (n = 12) found the mobile app to be highly acceptable and engaging, logging on average 19 nightly sleep diary entries across the 21 day period. Significant improvements were observed for sleep measures (insomnia severity and sleep efficiency) and daytime symptoms (fatigue and sleepiness). The results suggest that a mobile app delivering SRT to individuals with insomnia is engaging, acceptable, and potentially efficacious. Further, a full-scale effectiveness study is warranted