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.

LOWER BOUNDS FOR BOXICITY

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a closed interval of the form a(i),b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which are listed below: 1. The boxicity of a graph on n vertices with no universal vertices and minimum degree delta is at least n/2(n-delta-1). 2. Consider the g(n,p) model of random graphs. Let p <= 1 - 40logn/n(2.) Then with high `` probability, box(G) = Omega(np(1 - p)). On setting p = 1/2 we immediately infer that almost all graphs have boxicity Omega(n). Another consequence of this result is as follows: For any positive constant c < 1, almost all graphs on n vertices and m <= c((n)(2)) edges have boxicity Omega(m/n). 3. Let G be a connected k-regular graph on n vertices. Let lambda be the second largest eigenvalue in absolute value of the adjacency matrix of G. Then, the boxicity of G is a least (kappa(2)/lambda(2)/log(1+kappa(2)/lambda(2))) (n-kappa-1/2n). 4. For any positive constant c 1, almost all balanced bipartite graphs on 2n vertices and m <= cn(2) edges have boxicity Omega(m/n).

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.

One-Carbon Metabolic Pathway Rewiring in Escherichia coli Reveals an Evolutionary Advantage of 10-Formyltetrahydrofolate Synthetase (Fhs) in Survival under Hypoxia

In cells, N-10-formyltetrahydrofolate (N-10-fTHF) is required for formylation of eubacterial/organellar initiator tRNA and purine nucleotide biosynthesis. Biosynthesis of N-10-fTHF is catalyzed by 5,10-methylene-tetrahydrofolate dehydrogenase/cyclohydrolase (FolD) and/or 10-formyltetrahydrofolate synthetase (Fhs). All eubacteria possess FolD, but some possess both FolD and Fhs. However, the reasons for possessing Fhs in addition to FolD have remained unclear. We used Escherichia coli, which naturally lacks fhs, as our model. We show that in E. coli, the essential function of folD could be replaced by Clostridium perfringens fhs when it was provided on a medium-copy-number plasmid or integrated as a single-copy gene in the chromosome. The fhs-supported folD deletion (Delta folD) strains grow well in a complex medium. However, these strains require purines and glycine as supplements for growth in M9 minimal medium. The in vivo levels of N-10-fTHF in the Delta folD strain (supported by plasmid-borne fhs) were limiting despite the high capacity of the available Fhs to synthesize N-10-fTHF in vitro. Auxotrophy for purines could be alleviated by supplementing formate to the medium, and that for glycine was alleviated by engineering THF import into the cells. The Delta folD strain (harboring fhs on the chromosome) showed a high NADP(+)-to-NADPH ratio and hypersensitivity to trimethoprim. The presence of fhs in E. coli was disadvantageous for its aerobic growth. However, under hypoxia, E. coli strains harboring fhs outcompeted those lacking it. The computational analysis revealed a predominant natural occurrence of fhs in anaerobic and facultative anaerobic bacteria.

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.

Role of electrical resistance of electrodes in modeling of discharging and charging of flooded lead-acid batteries

Electrical resistance of both the electrodes of a lead-acid battery increases during discharge due to formation of lead sulfate, an insulator. Work of Metzendorf 1] shows that resistance increases sharply at about 65% conversion of active materials, and battery stops discharging once this critical conversion is reached. However, these aspects are not incorporated into existing mathematical models. Present work uses the results of Metzendorf 1], and develops a model that includes the effect of variable resistance. Further, it uses a reasonable expression to account for the decrease in active area during discharge instead of the empirical equations of previous work. The model's predictions are compared with observations of Cugnet et al. 2]. The model is as successful as the non-mechanistic models existing in literature. Inclusion of variation in resistance of electrodes in the model is important if one of the electrodes is a limiting reactant. If active materials are stoichiometrically balanced, resistance of electrodes can be very large at the end of discharge but has only a minor effect on charging of batteries. The model points to the significance of electrical conductivity of electrodes in the charging of deep discharged batteries. (C) 2014 Elsevier B.V. All rights reserved.

Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

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.

Quick, Decentralized, Energy-Efficient One-Shot Max Function Computation Using Timer-Based Selection

In several wireless sensor networks, it is of interest to determine the maximum of the sensor readings and identify the sensor responsible for it. We propose a novel, decentralized, scalable, energy-efficient, timer-based, one-shot max function computation (TMC) algorithm. In it, the sensor nodes do not transmit their readings in a centrally pre-defined sequence. Instead, the nodes are grouped into clusters, and computation occurs over two contention stages. First, the nodes in each cluster contend with each other using the timer scheme to transmit their reading to their cluster-heads. Thereafter, the cluster-heads use the timer scheme to transmit the highest sensor reading in their cluster to the fusion node. One new challenge is that the use of the timer scheme leads to collisions, which can make the algorithm fail. We optimize the algorithm to minimize the average time required to determine the maximum subject to a constraint on the probability that it fails to find the maximum. TMC significantly lowers average function computation time, average number of transmissions, and average energy consumption compared to approaches proposed in the literature.

Jet substructure and probes of CP violation in Vh production

We analyse the hVV (V = W, Z) vertex in a model independent way using Vh production. To that end, we consider possible corrections to the Standard Model Higgs Lagrangian, in the form of higher dimensional operators which parametrise the effects of new physics. In our analysis, we pay special attention to linear observables that can be used to probe CP violation in the same. By considering the associated production of a Higgs boson with a vector boson (W or Z), we use jet substructure methods to define angular observables which are sensitive to new physics effects, including an asymmetry which is linearly sensitive to the presence of CP odd effects. We demonstrate how to use these observables to place bounds on the presence of higher dimensional operators, and quantify these statements using a log likelihood analysis. Our approach allows one to probe separately the hZZ and hWW vertices, involving arbitrary combinations of BSM operators, at the Large Hadron Collider.

Porous membranes designed from bi-phasic polymeric blends containing silver decorated reduced graphene oxide synthesized via a facile one-pot approach

In this work, porous membranes were designed by selectively etching the PEO phase, by water, from a melt-mixed PE/PEO blend. The pure water flux and the resistance across the membrane were systematically evaluated by employing an indigenously developed cross flow membrane setup. Both the phase morphology and the cross sectional morphology of the membranes was assessed by scanning electron microscopy and an attempt was made to correlate the observed morphology with the membrane performance. In order to design antibacterial membranes for water purification, partially reduced graphene oxide (rGO), silver nanoparticles (Ag) and silver nanoparticles decorated with rGO (rGO-Ag) were synthesized and incorporated directly into the blends during melt mixing. The loss of viability of bacterial cells was determined by the colony counting method using E. coli as a model bacterium. SEM images display that the direct contact with the rGO-Ag nanoparticles disrupts the cell membrane. In addition, the rGO-Ag nanoparticles exhibited a synergistic effect with respect to bacterial cell viability in comparison to both rGO and Ag nanoparticles. The possible mechanism associated with the antibacterial activity in the membranes was discussed. This study opens new avenues in designing antibacterial membranes for water purification.

One-pot synthesis of a TiO2-CdS nano-heterostructure assembly with enhanced photocatalytic activity

An unprecedented morphology of a titanium dioxide (TiO2) and cadmium sulfide (CdS) self-assembly obtained using a `truly' one-pot and highly cost effective method with a multi-gram scale yield is reported here. The TiO2-CdS assembly, comprising of TiO2 and CdS nanoparticles residing next to each other homogeneously self-assembling into `woollen knitting ball' like microspheres, exhibited remarkable potential as a visible light photocatalyst with high recyclability.

A matrix model for QCD

Gribov's observation that global gauge fixing is impossible has led to suggestions that there may be a deep connection between gauge fixing and confinement. We find an unexpected relation between the topological nontriviality of the gauge bundle and colored states in SU(N) Yang-Mills theory, and show that such states are necessarily impure. We approximate QCD by a rectangular matrix model that captures the essential topological features of the gauge bundle, and demonstrate the impure nature of colored states explicitly. Our matrix model also allows the inclusion of the QCD theta-term, as well as to perform explicit computations of low-lying glueball masses. This mass spectrum is gapped. Since an impure state cannot evolve to a pure one by a unitary transformation, our result shows that the solution to the confinement problem in pure QCD is fundamentally quantum information-theoretic.

Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs

Conditions for the existence of heterochromatic Hamiltonian paths and cycles in edge colored graphs are well investigated in literature. A related problem in this domain is to obtain good lower bounds for the length of a maximum heterochromatic path in an edge colored graph G. This problem is also well explored by now and the lower bounds are often specified as functions of the minimum color degree of G - the minimum number of distinct colors occurring at edges incident to any vertex of G - denoted by v(G). Initially, it was conjectured that the lower bound for the length of a maximum heterochromatic path for an edge colored graph G would be 2v(G)/3]. Chen and Li (2005) showed that the length of a maximum heterochromatic path in an edge colored graph G is at least v(G) - 1, if 1 <= v(G) <= 7, and at least 3v(G)/5] + 1 if v(G) >= 8. They conjectured that the tight lower bound would be v(G) - 1 and demonstrated some examples which achieve this bound. An unpublished manuscript from the same authors (Chen, Li) reported to show that if v(G) >= 8, then G contains a heterochromatic path of length at least 120 + 1. In this paper, we give lower bounds for the length of a maximum heterochromatic path in edge colored graphs without small cycles. We show that if G has no four cycles, then it contains a heterochromatic path of length at least v(G) - o(v(G)) and if the girth of G is at least 4 log(2)(v(G)) + 2, then it contains a heterochromatic path of length at least v(G) - 2, which is only one less than the bound conjectured by Chen and Li (2005). Other special cases considered include lower bounds for the length of a maximum heterochromatic path in edge colored bipartite graphs and triangle-free graphs: for triangle-free graphs we obtain a lower bound of 5v(G)/6] and for bipartite graphs we obtain a lower bound of 6v(G)-3/7]. In this paper, it is also shown that if the coloring is such that G has no heterochromatic triangles, then G contains a heterochromatic path of length at least 13v(G)/17)]. This improves the previously known 3v(G)/4] bound obtained by Chen and Li (2011). We also give a relatively shorter and simpler proof showing that any edge colored graph G contains a heterochromatic path of length at least (C) 2015 Elsevier Ltd. All rights reserved.

One-step synthesis of a cyclic 2,17-dioxo3,3](4,4 `)biphenylophane and first preparation of a microporous polymer network from a macrocyclic precursor by cyclotrimerization

One-step synthesis of a cyclic 2,17-dioxo3,3](4,4') biphenylophane (MC) was achieved in high yield; its structure was verified by single crystal X-ray analysis. As a first example, a microporous polymer network was formed from macrocycle MC via acid-catalysed cyclotrimerization yielding a BET surface area of ca. 570 m(2) g(-1).