Small strong epsilon nets

Let P be a set of n points in R-d. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than dn/d+1 points of P. We call a point x a strong centerpoint for a family of objects C if x is an element of P is contained in every object C is an element of C that contains more than a constant fraction of points of P. A strong centerpoint does not exist even for halfspaces in R-2. We prove that a strong centerpoint exists for axis-parallel boxes in Rd and give exact bounds. We then extend this to small strong epsilon-nets in the plane. Let epsilon(S)(i) represent the smallest real number in 0, 1] such that there exists an epsilon(S)(i)-net of size i with respect to S. We prove upper and lower bounds for epsilon(S)(i) where S is the family of axis-parallel rectangles, halfspaces and disks. (C) 2014 Elsevier B.V. All rights reserved.

Holographic stress tensor at finite coupling

We calculate one, two and three point functions of the holographic stress tensor for any bulk Lagrangian of the form L (g(ab), R-abcd, del(e) R-abcd). Using the first law of entanglement, a simple method has recently been proposed to compute the holographic stress tensor arising from a higher derivative gravity dual. The stress tensor is proportional to a dimension dependent factor which depends on the higher derivative couplings. In this paper, we identify this proportionality constant with a B-type trace anomaly in even dimensions for any bulk Lagrangian of the above form. This in turn relates to C-T, the coefficient appearing in the two point function of stress tensors. We use a background field method to compute the two and three point function of stress tensors for any bulk Lagrangian of the above form in arbitrary dimensions. As an application we consider general situations where eta/s for holographic plasmas is less than the KSS bound.

Numerical modeling of the non-isothermal liquid droplet impact on a hot solid substrate

The heat transfer from a solid phase to an impinging non-isothermal liquid droplet is studied numerically. A new approach based on an arbitrary Lagrangian-Eulerian (ALE) finite element method for solving the incompressible Navier Stokes equations in the liquid and the energy equation within the solid and the liquid is presented. The novelty of the method consists in using the ALE-formulation also in the solid phase to guarantee matching grids along the liquid solid interface. Moreover, a new technique is developed to compute the heat flux without differentiating the numerical solution. The free surface and the liquid solid interface of the droplet are represented by a moving mesh which can handle jumps in the material parameter and a temperature dependent surface tension. Further, the application of the Laplace-Beltrami operator technique for the curvature approximation allows a natural inclusion of the contact angle. Numerical simulation for varying Reynold, Weber, Peclet and Biot numbers are performed to demonstrate the capabilities of the new approach. (C) 2014 Elsevier Ltd. All rights reserved.

Large deformation dynamic finite element analysis of delaminated composite plates using contact-impact conditions

A new C-0 composite plate finite element based on Reddy's third order theory is used for large deformation dynamic analysis of delaminated composite plates. The inter-laminar contact is modeled with an augmented Lagrangian approach. Numerical results show that the widely used ``unconditionally stable'' beta-Newmark method presents instability problems in the transient simulation of delaminated composite plate structures with large deformation. To overcome this instability issue, an energy and momentum conserving composite implicit time integration scheme presented by Bathe and Baig is used. It is found that a proper selection of the penalty parameter is very crucial in the contact simulation. (C) 2014 Elsevier Ltd. All rights reserved.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

On entanglement entropy functionals in higher-derivative gravity theories

In arXiv:1310.5713 1] and arXiv:1310.6659 2] a formula was proposed as the entanglement entropy functional for a general higher-derivative theory of gravity, whose lagrangian consists of terms containing contractions of the Riemann tensor. In this paper, we carry out some tests of this proposal. First, we find the surface equation of motion for general four-derivative gravity theory by minimizing the holographic entanglement entropy functional resulting from this proposed formula. Then we calculate the surface equation for the same theory using the generalized gravitational entropy method of arXiv:1304.4926 3]. We find that the two do not match in their entirety. We also construct the holographic entropy functional for quasi-topological gravity, which is a six-derivative gravity theory. We find that this functional gives the correct universal terms. However, as in the R-2 case, the generalized gravitational entropy method applied to this theory does not give exactly the surface equation of motion coming from minimizing the entropy functional.

Tailoring the second mode of Euler-Bernoulli beams: an analytical approach

In this paper, we study the inverse mode shape problem for an Euler-Bernoulli beam, using an analytical approach. The mass and stiffness variations are determined for a beam, having various boundary conditions, which has a prescribed polynomial second mode shape with an internal node. It is found that physically feasible rectangular cross-section beams which satisfy the inverse problem exist for a variety of boundary conditions. The effect of the location of the internal node on the mass and stiffness variations and on the deflection of the beam is studied. The derived functions are used to verify the p-version finite element code, for the cantilever boundary condition. The paper also presents the bounds on the location of the internal node, for a valid mass and stiffness variation, for any given boundary condition. The derived property variations, corresponding to a given mode shape and boundary condition, also provides a simple closed-form solution for a class of non-uniform Euler-Bernoulli beams. These closed-form solutions can also be used to check optimization algorithms proposed for modal tailoring.

Exact Phase Retrieval for a Class of 2-D Parametric Signals

We address the problem of two-dimensional (2-D) phase retrieval from magnitude of the Fourier spectrum. We consider 2-D signals that are characterized by first-order difference equations, which have a parametric representation in the Fourier domain. We show that, under appropriate stability conditions, such signals can be reconstructed uniquely from the Fourier transform magnitude. We formulate the phase retrieval problem as one of computing the parameters that uniquely determine the signal. We show that the problem can be solved by employing the annihilating filter method, particularly for the case when the parameters are distinct. For the more general case of the repeating parameters, the annihilating filter method is not applicable. We circumvent the problem by employing the algebraically coupled matrix pencil (ACMP) method. In the noiseless measurement setup, exact phase retrieval is possible. We also establish a link between the proposed analysis and 2-D cepstrum. In the noisy case, we derive Cramer-Rao lower bounds (CRLBs) on the estimates of the parameters and present Monte Carlo performance analysis as a function of the noise level. Comparisons with state-of-the-art techniques in terms of signal reconstruction accuracy show that the proposed technique outperforms the Fienup and relaxed averaged alternating reflections (RAAR) algorithms in the presence of noise.

Constraints on the omega pi form factor from analyticity and unitarity

Motivated by the discrepancies noted recently between the theoretical calculations of the electromagnetic omega pi form factor and certain experimental data, we investigate this form factor using analyticity and unitarity in a framework known as the method of unitarity bounds. We use a QCD correlator computed on the spacelike axis by operator product expansion and perturbative QCD as input, and exploit unitarity and the positivity of its spectral function, including the two-pion contribution that can be reliably calculated using high-precision data on the pion form factor. From this information, we derive upper and lower bounds on the modulus of the omega pi form factor in the elastic region. The results provide a significant check on those obtained with standard dispersion relations, confirming the existence of a disagreement with experimental data in the region around 0.6 GeV.

Limiting two-Higgs-doublet models

We update the constraints on two-Higgs-doublet models (2HDMs) focusing on the parameter space relevant to explain the present muon g - 2 anomaly, Delta alpha(mu), in four different types of models, type I, II, ``lepton specific'' (or X) and ``flipped'' (or Y). We show that the strong constraints provided by the electroweak precision data on the mass of the pseudoscalar Higgs, whose contribution may account for Delta alpha(mu), are evaded in regions where the charged scalar is degenerate with the heavy neutral one and the mixing angles alpha and beta satisfy the Standard Model limit beta - alpha approximate to pi/2. We combine theoretical constraints from vacuum stability and perturbativity with direct and indirect bounds arising from collider and B physics. Possible future constraints from the electron g - 2 are also considered. If the 126 GeV resonance discovered at the LHC is interpreted as the light CP-even Higgs boson of the 2HDM, we find that only models of type X can satisfy all the considered theoretical and experimental constraints.

Energy-efficient, delay-constrained, QoS-aware broadcast for cooperative wireless sensor networks

The problem of delay-constrained, energy-efficient broadcast in cooperative wireless networks is NP-complete. While centralised setting allows some heuristic solutions, designing heuristics in distributed implementation poses significant challenges. This is more so in wireless sensor networks (WSNs) where nodes are deployed randomly and topology changes dynamically due to node failure/join and environment conditions. This paper demonstrates that careful design of network infrastructure can achieve guaranteed delay bounds and energy-efficiency, and even meet quality of service requirements during broadcast. The paper makes three prime contributions. First, we present an optimal lower bound on energy consumption for broadcast that is tighter than what has been previously proposed. Next, iSteiner, a lightweight, distributed and deterministic algorithm for creation of network infrastructure is discussed. iPercolate is the algorithm that exploits this structure to cooperatively broadcast information with guaranteed delivery and delay bounds, while allowing real-time traffic to pass undisturbed.

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated with small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan et al, in which recovery from a single erasure is considered. By studying the generalized Hamming weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Turan graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from 2 erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

NUMERICAL SIMULATIONS OF LIQUID JET BREAK UP IN A CROSSFLOW

Atomization is the process of disintegration of a liquid jet into ligaments and subsequently into smaller droplets. A liquid jet injected from a circular orifice into cross flow of air undergoes atomization primarily due to the interaction of the two phases rather than an intrinsic break up. Direct numerical simulation of this process resolving the finest droplets is computationally very expensive and impractical. In the present study, we resort to multiscale modelling to reduce the computational cost. The primary break up of the liquid jet is simulated using Gerris, an open source code, which employs Volume-of-Fluid (VOF) algorithm. The smallest droplets formed during primary atomization are modeled as Lagrangian particles. This one-way coupling approach is validated with the help of the simple test case of tracking a particle in a Taylor-Green vortex. The temporal evolution of the liquid jet forming the spray is captured and the flattening of the cylindrical liquid column prior to breakup is observed. The size distribution of the resultant droplets is presented at different distances downstream from the location of injection and their spatial evolution is analyzed.

Benchmarking sustainability of Indian electricity system: An indicator approach

India needs to significantly increase its electricity consumption levels, in a sustainable manner, if it has to ensure rapid economic development, a goal that remains the most potent tool for delivering adaptation capacity to its poor who will suffer the worst consequences of climate change. Resource/supply constraints faced by conventional energy sources, techno-economic constraints faced by renewable energy sources, and the bounds imposed by climate change on fossil fuel use are likely to undermine India's quest for having a robust electricity system that can effectively contribute to achieving accelerated, sustainable and inclusive economic growth. One possible way out could be transitioning into a sustainable electricity system, which is a trade-off solution having taken into account the economic, social and environmental concerns. As a first step toward understanding this transition, we contribute an indicator based hierarchical multidimensional framework as an analytical tool for sustainability assessment of electricity systems, and validate it for India's national electricity system. We evaluate Indian electricity system using this framework by comparing it with a hypothetical benchmark sustainable electrical system, which was created using best indicator values realized across national electricity systems in the world. This framework, we believe, can be used to examine the social, economic and environmental implications of the current Indian electricity system as well as setting targets for future development. The analysis with the indicator framework provides a deeper understanding of the system, identify and quantify the prevailing sustainability gaps and generate specific targets for interventions. We use this framework to compute national electricity system sustainability index (NESSI) for India. (C) 2014 Elsevier Ltd. All rights reserved.

Rainbow matchings in strongly edge-colored graphs

A rainbow matching of an edge-colored graph G is a matching in which no two edges have the same color. There have been several studies regarding the maximum size of a rainbow matching in a properly edge-colored graph G in terms of its minimum degree 3(G). Wang (2011) asked whether there exists a function f such that a properly edge-colored graph G with at least f (delta(G)) vertices is guaranteed to contain a rainbow matching of size delta(G). This was answered in the affirmative later: the best currently known function Lo and Tan (2014) is f(k) = 4k - 4, for k >= 4 and f (k) = 4k - 3, for k <= 3. Afterwards, the research was focused on finding lower bounds for the size of maximum rainbow matchings in properly edge-colored graphs with fewer than 4 delta(G) - 4 vertices. Strong edge-coloring of a graph G is a restriction of proper edge-coloring where every color class is required to be an induced matching, instead of just being a matching. In this paper, we give lower bounds for the size of a maximum rainbow matching in a strongly edge-colored graph Gin terms of delta(G). We show that for a strongly edge-colored graph G, if |V(G)| >= 2 |3 delta(G)/4|, then G has a rainbow matching of size |3 delta(G)/4|, and if |V(G)| < 2 |3 delta(G)/4|, then G has a rainbow matching of size |V(G)|/2] In addition, we prove that if G is a strongly edge-colored graph that is triangle-free, then it contains a rainbow matching of size at least delta(G). (C) 2015 Elsevier B.V. All rights reserved.