Universal correction to higher spin entanglement entropy

We consider conformal field theories in 1 + 1 dimensions with W-algebra symmetries, deformed by a chemical potential mu for the spin-three current. We show that the order mu(2) correction to the Renyi and entanglement entropies of a single interval in the deformed theory, on the infinite spatial line and at finite temperature, is universal. The correction is completely determined by the operator product expansion of two spin-three currents, and by the expectation values of the stress tensor, its descendants and its composites, evaluated on the n-sheeted Riemann surface branched along the interval. This explains the recently found agreement of the order mu(2) correction across distinct free field CFTs and higher spin black hole solutions holographically dual to CFTs with W symmetry.

Structural and functional analysis of two universal stress proteins YdaA and YnaF from Salmonella typhimurium: possible roles in microbial stress tolerance

In many organisms ``Universal Stress Proteins'' CUSPS) are induced in response to a variety of environmental stresses. Here we report the structures of two USPs, YnaF and YdaA from Salmonella typhimurium determined at 1.8 angstrom and 2.4 angstrom resolutions, respectively. YnaF consists of a single USP domain and forms a tetrameric organization stabilized by interactions mediated through chloride ions. YdaA is a larger protein consisting of two tandem USP domains. Two protomers of YdaA associate to form a structure similar to the YnaF tetramer. YdaA showed ATPase activity and an ATP binding motif G-2X-G-9X-G(S/T/N) was found in its C-terminal domain. The residues corresponding to this motif were not conserved in YnaF although YnaF could bind ATP. However, unlike YdaA, YnaF did not hydrolyse ATP in vitro. Disruption of interactions mediated through chloride ions by selected mutations converted YnaF into an ATPase. Residues that might be important for ATP hydrolysis could be identified by comparing the active sites of native and mutant structures. Only the C-terminal domain of YdaA appears to be involved in ATP hydrolysis. The structurally similar N-terminal domain was found to bind a zinc ion near the segment equivalent to the phosphate binding loop of the C-terminal domain. Mass spectrometric analysis showed that YdaA might bind a ligand of approximate molecular weight 800 daltons. Structural comparisons suggest that the ligand, probably related to an intermediate in lipid A biosynthesis, might bind at a site close to the zinc ion. Therefore, the N-terminal domain of YdaA binds zinc and might play a role in lipid metabolism. Thus, USPs appear to perform several distinct functions such as ATP hydrolysis, altering membrane properties and chloride sensing. (C) 2015 Elsevier Inc. All rights reserved.

Low Complexity Power and Scheduling Policies for Wireless Networks to Provide Quality of Service

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

A Universal Stress Protein (USP) in Mycobacteria Binds cAMP

Mycobacteria are endowed with rich and diverse machinery for the synthesis, utilization, and degradation of cAMP. The actions of cyclic nucleotides are generally mediated by binding of cAMP to conserved and well characterized cyclic nucleotide binding domains or structurally distinct cGMP-specific and -regulated cyclic nucleotide phosphodiesterase, adenylyl cyclase, and E. coli transcription factor FhlA (GAF) domain-containing proteins. Proteins with cyclic nucleotide binding and GAF domains can be identified in the genome of mycobacterial species, and some of them have been characterized. Here, we show that a significant fraction of intracellular cAMP is bound to protein in mycobacterial species, and by using affinity chromatography techniques, we identify specific universal stress proteins (USP) as abundantly expressed cAMP-binding proteins in slow growing as well as fast growing mycobacteria. We have characterized the biochemical and thermodynamic parameters for binding of cAMP, and we show that these USPs bind cAMP with a higher affinity than ATP, an established ligand for other USPs. We determined the structure of the USP MSMEG_3811 bound to cAMP, and we confirmed through structure-guided mutagenesis, the residues important for cAMP binding. This family of USPs is conserved in all mycobacteria, and we suggest that they serve as ``sinks'' for cAMP, making this second messenger available for downstream effectors as and when ATP levels are altered in the cell.

Simultaneous perturbation methods for adaptive labor staffing in service systems

We consider the problem of optimizing the workforce of a service system. Adapting the staffing levels in such systems is non-trivial due to large variations in workload and the large number of system parameters do not allow for a brute force search. Further, because these parameters change on a weekly basis, the optimization should not take longer than a few hours. Our aim is to find the optimum staffing levels from a discrete high-dimensional parameter set, that minimizes the long run average of the single-stage cost function, while adhering to the constraints relating to queue stability and service-level agreement (SLA) compliance. The single-stage cost function balances the conflicting objectives of utilizing workers better and attaining the target SLAs. We formulate this problem as a constrained parameterized Markov cost process parameterized by the (discrete) staffing levels. We propose novel simultaneous perturbation stochastic approximation (SPSA)-based algorithms for solving the above problem. The algorithms include both first-order as well as second-order methods and incorporate SPSA-based gradient/Hessian estimates for primal descent, while performing dual ascent for the Lagrange multipliers. Both algorithms are online and update the staffing levels in an incremental fashion. Further, they involve a certain generalized smooth projection operator, which is essential to project the continuous-valued worker parameter tuned by our algorithms onto the discrete set. The smoothness is necessary to ensure that the underlying transition dynamics of the constrained Markov cost process is itself smooth (as a function of the continuous-valued parameter): a critical requirement to prove the convergence of both algorithms. We validate our algorithms via performance simulations based on data from five real-life service systems. For the sake of comparison, we also implement a scatter search based algorithm using state-of-the-art optimization tool-kit OptQuest. From the experiments, we observe that both our algorithms converge empirically and consistently outperform OptQuest in most of the settings considered. This finding coupled with the computational advantage of our algorithms make them amenable for adaptive labor staffing in real-life service systems.

Universal Hashing for Information-Theoretic Security

The information-theoretic approach to security entails harnessing the correlated randomness available in nature to establish security. It uses tools from information theory and coding and yields provable security, even against an adversary with unbounded computational power. However, the feasibility of this approach in practice depends on the development of efficiently implementable schemes. In this paper, we review a special class of practical schemes for information-theoretic security that are based on 2-universal hash families. Specific cases of secret key agreement and wiretap coding are considered, and general themes are identified. The scheme presented for wiretap coding is modular and can be implemented easily by including an extra preprocessing layer over the existing transmission codes.

Universal buckling kinetics in drying nanoparticle-laden droplets on a hydrophobic substrate

We provide a comprehensive physical description of the vaporization, self-assembly, agglomeration, and buckling kinetics of sessile nanofluid droplets pinned on a hydrophobic substrate. We have deciphered five distinct regimes of the droplet life cycle. Regimes I-III consists of evaporation-induced preferential agglomeration that leads to the formation of a unique dome-shaped inhomogeneous shell with a stratified varying-density liquid core. Regime IV involves capillary-pressure-initiated shell buckling and stress-induced shell rupture. Regime V marks rupture-induced cavity inception and growth. We demonstrate through scaling arguments that the growth of the cavity (which controls the final morphology or structure) can be described by a universal function.

Universal anomalous dimensions at large spin and large twist

In this paper we consider anomalous dimensions of double trace operators at large spin (l) and large twist (tau) in CFTs in arbitrary dimensions (d >= 3). Using analytic conformal bootstrap methods, we show that the anomalous dimensions are universal in the limit l >> tau >> 1. In the course of the derivation, we extract an approximate closed form expression for the conformal blocks arising in the four point function of identical scalars in any dimension. We compare our results with two different calculations in holography and find perfect agreement.

CheepSync: A Time Synchronization Service for Resource Constrained Bluetooth LE Advertisers

Clock synchronization is highly desirable in distributed systems, including many applications in the Internet of Things and Humans. It improves the efficiency, modularity, and scalability of the system, and optimizes use of event triggers. For IoTH, BLE - a subset of the recent Bluetooth v4.0 stack - provides a low-power and loosely coupled mechanism for sensor data collection with ubiquitous units (e.g., smartphones and tablets) carried by humans. This fundamental design paradigm of BLE is enabled by a range of broadcast advertising modes. While its operational benefits are numerous, the lack of a common time reference in the broadcast mode of BLE has been a fundamental limitation. This article presents and describes CheepSync, a time synchronization service for BLE advertisers, especially tailored for applications requiring high time precision on resource constrained BLE platforms. Designed on top of the existing Bluetooth v4.0 standard, the CheepSync framework utilizes low-level time-stamping and comprehensive error compensation mechanisms for overcoming uncertainties in message transmission, clock drift, and other system-specific constraints. CheepSync was implemented on custom designed nRF24Cheep beacon platforms (as broadcasters) and commercial off-the-shelf Android ported smartphones (as passive listeners). We demonstrate the efficacy of CheepSync by numerous empirical evaluations in a variety of experimental setups, and show that its average (single-hop) time synchronization accuracy is in the 10 mu s range.