Renyi entropies of free bosons on the torus and holography

We analytically evaluate the Renyi entropies for the two dimensional free boson CFT. The CFT is considered to be compactified on a circle and at finite temperature. The Renyi entropies S-n are evaluated for a single interval using the two point function of bosonic twist fields on a torus. For the case of the compact boson, the sum over the classical saddle points results in the Riemann-Siegel theta function associated with the A(n-1) lattice. We then study the Renyi entropies in the decompactification regime. We show that in the limit when the size of the interval becomes the size of the spatial circle, the entanglement entropy reduces to the thermal entropy of free bosons on a circle. We then set up a systematic high temperature expansion of the Renyi entropies and evaluate the finite size corrections for free bosons. Finally we compare these finite size corrections both for the free boson CFT and the free fermion CFT with the one-loop corrections obtained from bulk three dimensional handlebody spacetimes which have higher genus Riemann surfaces as its boundary. One-loop corrections in these geometries are entirely determined by quantum numbers of the excitations present in the bulk. This implies that the leading finite size corrections contributions from one-loop determinants of the Chern-Simons gauge field and the Dirac field in the dual geometry should reproduce that of the free boson and the free fermion CFT respectively. By evaluating these corrections both in the bulk and in the CFT explicitly we show that this expectation is indeed true.

A little more gauge mediation and the light Higgs mass

We consider minimal models of gauge mediated supersymmetry breaking with an extra U(1) factor in addition to the Standard Model gauge group. A U(1) charged, Standard Model singlet is assumed to be present which allows for an additional NMSSM like coupling, lambda HuHdS. The U(1) is assumed to be flavour universal. Anomaly cancellation in the MSSM sector requires additional coloured degrees of freedom. The S field can get a large vacuum expectation value along with consistent electroweak symmetry breaking. It is shown that the lightest CP even Higgs boson can attain mass of the order of 125 GeV. (C) 2014 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/3.0/).

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

Desingularization of the Milne Universe

Resolution of cosmological singularities is an important problem in any full theory of quantum gravity. The Milne orbifold is a cosmology with a big-bang/big-crunch singularity, but being a quotient of flat space it holds potential for resolution in string theory. It is known, however, that some perturbative string amplitudes diverge in the Milne geometry. Here we show that flat space higher spin theories can effect a simple resolution of the Milne singularity when one embeds the latter in 2 + 1 dimensions. We explain how to reconcile this with the expectation that non-perturbative string effects are required for resolving Milne. Along the way, we introduce a Grassmann realization of the inonfi-Wigner contraction to export much of the AdS technology to -our flat space computation. (C) 2014 The Authors. Published by Elsevier BAT.

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.

Optimal control analysis of the dynamic growth behavior of microorganisms

Understanding the growth behavior of microorganisms using modeling and optimization techniques is an active area of research in the fields of biochemical engineering and systems biology. In this paper, we propose a general modeling framework, based on Monad model, to model the growth of microorganisms. Utilizing the general framework, we formulate an optimal control problem with the objective of maximizing a long-term cellular goal and solve it analytically under various constraints for the growth of microorganisms in a two substrate batch environment. We investigate the relation between long term and short term cellular goals and show that the objective of maximizing cellular concentration at a fixed final time is equivalent to maximization of instantaneous growth rate. We then establish the mathematical connection between the generalized framework and optimal and cybernetic modeling frameworks and derive generalized governing dynamic equations for optimal and cybernetic models. We finally illustrate the influence of various constraints in the cybernetic modeling framework on the optimal growth behavior of microorganisms by solving several dynamic optimization problems using genetic algorithms. (C) 2014 Published by Elsevier Inc.

Relative entropy in higher spin holography

We examine relative entropy in the context of the higher spin/CFT duality. We consider 3D bulk configurations in higher spin gravity which are dual to the vacuum and a high temperature state of a CFT with W-algebra symmetries in the presence of a chemical potential for a higher spin current. The relative entropy between these states is then evaluated using the Wilson line functional for holographic entanglement entropy. In the limit of small entangling intervals, the relative entropy should vanish for a generic quantum system. We confirm this behavior by showing that the difference in the expectation values of the modular Hamiltonian between the states matches with the difference in the entanglement entropy in the short-distance regime. Additionally, we compute the relative entropy of states corresponding to smooth solutions in the SL(2, Z) family with respect to the vacuum.

A Multi-phase Approach for Improving Information Diffusion in Social Networks

For maximizing influence spread in a social network, given a certain budget on the number of seed nodes, we investigate the effects of selecting and activating the seed nodes in multiple phases. In particular, we formulate an appropriate objective function for two-phase influence maximization under the independent cascade model, investigate its properties, and propose algorithms for determining the seed nodes in the two phases. We also study the problem of determining an optimal budget-split and delay between the two phases.

Probable maximum precipitation estimation for catchments in Mahanadi river basin

Probable maximum precipitation (PMP) is a theoretical concept that is widely used by hydrologists to arrive at estimates for probable maximum flood (PMF) that find use in planning, design and risk assessment of high-hazard hydrological structures such as flood control dams upstream of populated areas. The PMP represents the greatest depth of precipitation for a given duration that is meteorologically possible for a watershed or an area at a particular time of year, with no allowance made for long-term climatic trends. Various methods are in use for estimation of PMP over a target location corresponding to different durations. Moisture maximization method and Hershfield method are two widely used methods. The former method maximizes the observed storms assuming that the atmospheric moisture would rise up to a very high value estimated based on the maximum daily dew point temperature. On the other hand, the latter method is a statistical method based on a general frequency equation given by Chow. The present study provides one-day PMP estimates and PMP maps for Mahanadi river basin based on the aforementioned methods. There is a need for such estimates and maps, as the river basin is prone to frequent floods. Utility of the constructed PMP maps in computing PMP for various catchments in the river basin is demonstrated. The PMP estimates can eventually be used to arrive at PMF estimates for those catchments. (C) 2015 The Authors. Published by Elsevier B.V.

MIMO Decode-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming

In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers P-S and P-R, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.

MIMO Decode-and-Forward Relay Beamforming for Secrecy with Cooperative Jamming

In this paper, we consider decode-and-forward (DF) relay beamforming for secrecy with cooperative jamming (CJ) in the presence of multiple eavesdroppers. The communication between a source-destination pair is aided by a multiple-input multiple-output (MIMO) relay. The source has one transmit antenna and the destination and eavesdroppers have one receive antenna each. The source and the MIMO relay are constrained with powers P-S and P-R, respectively. We relax the rank-1 constraint on the signal beamforming matrix and transform the secrecy rate max-min optimization problem to a single maximization problem, which is solved by semidefinite programming techniques. We obtain the optimum source power, signal relay weights, and jamming covariance matrix. We show that the solution of the rank-relaxed optimization problem has rank-1. Numerical results show that CJ can improve the secrecy rate.

Change in Mesoherbivore Browsing Is Mediated by Elephant and Hillslope Position

Elephant are considered major drivers of ecosystems, but their effects within small-scale landscape features and on other herbivores still remain unclear. Elephant impact on vegetation has been widely studied in areas where elephant have been present for many years. We therefore examined the combined effect of short-term elephant presence (< 4 years) and hillslope position on tree species assemblages, resource availability, browsing intensity and soil properties. Short-term elephant presence did not affect woody species assemblages, but did affect height distribution, with greater sapling densities in elephant access areas. Overall tree and stem densities were also not affected by elephant. By contrast, slope position affected woody species assemblages, but not height distributions and densities. Variation in species assemblages was statistically best explained by levels of total cations, Zinc, sand and clay. Although elephant and mesoherbivore browsing intensities were unaffected by slope position, we found lower mesoherbivore browsing intensity on crests with high elephant browsing intensity. Thus, elephant appear to indirectly facilitate the survival of saplings, via the displacement of mesoherbivores, providing a window of opportunity for saplings to grow into taller trees. In the short-term, effects of elephant can be minor and in the opposite direction of expectation. In addition, such behavioural displacement promotes recruitment of saplings into larger height classes. The interaction between slope position and elephant effect found here is in contrast with other studies, and illustrates the importance of examining ecosystem complexity as a function of variation in species presence and topography. The absence of a direct effect of elephant on vegetation, but the presence of an effect on mesoherbivore browsing, is relevant for conservation areas especially where both herbivore groups are actively managed.

Dynamics of Glass Forming Liquids with Randomly Pinned Particles

It is frequently assumed that in the limit of vanishing cooling rate, the glass transition phenomenon becomes a thermodynamic transition at a temperature T-K. However, with any finite cooling rate, the system falls out of equilibrium at temperatures near T-g(> T-K), implying that the very existence of the putative thermodynamic phase transition at T-K can be questioned. Recent studies of systems with randomly pinned particles have hinted that the thermodynamic glass transition may be observed for liquids with randomly pinned particles. This expectation is based on the results of approximate calculations that suggest that the thermodynamic glass transition temperature increases with increasing concentration of pinned particles and it may be possible to equilibrate the system at temperatures near the increased transition temperature. We test the validity of this prediction through extensive molecular dynamics simulations of two model glass-forming liquids in the presence of random pinning. We find that extrapolated thermodynamic transition temperature T-K does not show any sign of increasing with increasing pinning concentration. The main effect of pinning is found to be a rapid decrease in the kinetic fragility of the system with increasing pin concentration. Implications of these observations for current theories of the glass transition are discussed.

Multiobjective fuzzy optimization for sustainable groundwater management using particle swarm optimization and analytic element method

Groundwater management involves conflicting objectives as maximization of discharge contradicts the criteria of minimum pumping cost and minimum piping cost. In addition, available data contains uncertainties such as market fluctuations, variations in water levels of wells and variations of ground water policies. A fuzzy model is to be evolved to tackle the uncertainties, and a multiobjective optimization is to be conducted to simultaneously satisfy the contradicting objectives. Towards this end, a multiobjective fuzzy optimization model is evolved. To get at the upper and lower bounds of the individual objectives, particle Swarm optimization (PSO) is adopted. The analytic element method (AEM) is employed to obtain the operating potentio metric head. In this study, a multiobjective fuzzy optimization model considering three conflicting objectives is developed using PSO and AEM methods for obtaining a sustainable groundwater management policy. The developed model is applied to a case study, and it is demonstrated that the compromise solution satisfies all the objectives with adequate levels of satisfaction. Sensitivity analysis is carried out by varying the parameters, and it is shown that the effect of any such variation is quite significant. Copyright (c) 2015 John Wiley & Sons, Ltd.

Power Allocation in MIMO Wiretap Channel with Statistical CSI and Finite-Alphabet Input

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical knowledge of the eavesdroppers CSI are assumed. We first consider the MIMO wiretap channel with Gaussian input. Using Jensen's inequality, we transform the secrecy rate max-min optimization problem to a single maximization problem. We use generalized singular value decomposition and transform the problem to a concave maximization problem which maximizes the sum secrecy rate of scalar wiretap channels subject to linear constraints on the transmit covariance matrix. We then consider the MIMO wiretap channel with finite-alphabet input. We show that the transmit covariance matrix obtained for the case of Gaussian input, when used in the MIMO wiretap channel with finite-alphabet input, can lead to zero secrecy rate at high transmit powers. We then propose a power allocation scheme with an additional power constraint which alleviates this secrecy rate loss problem, and gives non-zero secrecy rates at high transmit powers.