Variants Of Miyachi’S Theorem For Nilpotent Lie Groups

We formulate and prove two versions of Miyachi’s theorem for connected, simply connected nilpotent Lie groups. This allows us to prove the sharpness of the constant 1/4 in the theorems of Hardy and of Cowling and Price for any nilpotent Lie group. These theorems are proved using a variant of Miyachi’s theorem for the group Fourier transform.

On the Production of Anorexic Plan Diagrams

A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently that, for industrial-strength database engines, these diagrams are often remarkably complex and dense, with a large number of plans covering the space. However, they can often be reduced to much simpler pictures, featuring significantly fewer plans, without materially affecting the query processing quality. Plan reduction has useful implications for the design and usage of query optimizers, including quantifying redundancy in the plan search space, enhancing useability of parametric query optimization, identifying error-resistant and least-expected-cost plans, and minimizing the overheads of multi-plan approaches. We investigate here the plan reduction issue from theoretical, statistical and empirical perspectives. Our analysis shows that optimal plan reduction, w.r.t. minimizing the number of plans, is an NP-hard problem in general, and remains so even for a storage-constrained variant. We then present a greedy reduction algorithm with tight and optimal performance guarantees, whose complexity scales linearly with the number of plans in the diagram for a given resolution. Next, we devise fast estimators for locating the best tradeoff between the reduction in plan cardinality and the impact on query processing quality. Finally, extensive experimentation with a suite of multi-dimensional TPCH-based query templates on industrial-strength optimizers demonstrates that complex plan diagrams easily reduce to "anorexic" (small absolute number of plans) levels incurring only marginal increases in the estimated query processing costs.

(Dimethylamino)borylene and Related Complexes of Electron-Rich Metal Fragments: Generation of Nucleophile-Resistant Cations by Spontaneous Halide Ejection

Spontaneous halide ejection from a three-coordinate Lewis acid has been shown to offer a remarkable new route to cationic metal complexes featuring a linear, multiply bonded boron-donor Ligand. The exploitation of electron-rich [CpM(PR3)(2)] fragments within boryl systems of the type LnMB(hal)NR2 leads to the spontaneous formation in polar solvents of chemically robust borylene complexes, [LnM(BNR2)](+), with exceptionally low electrophilicity and short M-B bonds. This is reflected by M-B distances (ca. 1.80 angstrom for FeB systems) which are more akin to alkyl-/aryl-substituted borylene complexes and, perhaps most strikingly, by the very low exothermicity associated with the binding of pyridine to the two-coordinate boron center (Delta H = -7.4 kcal mol(-1), cf. -40.7 kcal mol(-1) for BCl3). Despite the strong pi electron release from the metal fragment implied by this suppressed reactivity and by such short M-B bonds, the barrier to rotation about the Fe=B bond in the unsymmetrical variant [CpFe(dmpe)(BN{C6H4OMe-4}Me)](+) is found to be very small (ca. 2.9 kcal mol(-1)). This apparent contradiction is rationalized by the orthogonal orientations of the HOMO and HOMO-2 orbitals of the [CpML2](+) fragment, which mean that the M-B pi interaction does not fall to zero even in the highest energy conformation.

Designed Cyclic Permutants of HIV-1 gp120: Implications for Envelope Trimer Structure and Immunogen Design

Most HIV-1 broadly neutralizing antibodies are directed against the gp120 subunit of the env surface protein. Native env consists of a trimer of gp120-gp41 heterodimers, and in contrast to monomeric gp120, preferentially binds CD4 binding site (CD4bs)-directed neutralizing antibodies over non-neutralizing ones. Some cryo-electron tomography studies have suggested that the V1V2 loop regions of gp120 are located close to the trimer interface. We have therefore designed cyclically permuted variants of gp120 with and without the h-CMP and SUMO2a trimerization domains inserted into the V1V2 loop. h-CMP-V1cyc is one such variant in which residues 153 and 142 are the N- and C-terminal residues, respectively, of cyclically permuted gp120 and h-CMP is fused to the N-terminus. This molecule forms a trimer under native conditions and binds CD4 and the neutralizing CD4bs antibodies b12 with significantly higher affinity than wild-type gp120. It binds non-neutralizing CD4bs antibody F105 with lower affinity than gp120. A similar derivative, h-CMP-V1cycl, bound the V1V2 loop-directed broadly neutralizing antibodies PG9 and PG16 with similar to 20-fold higher affinity than wild-type JRCSF gp120. These cyclic permutants of gp120 are properly folded and are potential immunogens. The data also support env models in which the V1V2 loops are proximal to the trimer interface.

A pseudo-time EnKF incorporating shape based reconstruction for diffuse optical tomography

Purpose: The authors aim at developing a pseudo-time, sub-optimal stochastic filtering approach based on a derivative free variant of the ensemble Kalman filter (EnKF) for solving the inverse problem of diffuse optical tomography (DOT) while making use of a shape based reconstruction strategy that enables representing a cross section of an inhomogeneous tumor boundary by a general closed curve. Methods: The optical parameter fields to be recovered are approximated via an expansion based on the circular harmonics (CH) (Fourier basis functions) and the EnKF is used to recover the coefficients in the expansion with both simulated and experimentally obtained photon fluence data on phantoms with inhomogeneous inclusions. The process and measurement equations in the pseudo-dynamic EnKF (PD-EnKF) presently yield a parsimonious representation of the filter variables, which consist of only the Fourier coefficients and the constant scalar parameter value within the inclusion. Using fictitious, low-intensity Wiener noise processes in suitably constructed ``measurement'' equations, the filter variables are treated as pseudo-stochastic processes so that their recovery within a stochastic filtering framework is made possible. Results: In our numerical simulations, we have considered both elliptical inclusions (two inhomogeneities) and those with more complex shapes (such as an annular ring and a dumbbell) in 2-D objects which are cross-sections of a cylinder with background absorption and (reduced) scattering coefficient chosen as mu(b)(a)=0.01mm(-1) and mu('b)(s)=1.0mm(-1), respectively. We also assume mu(a) = 0.02 mm(-1) within the inhomogeneity (for the single inhomogeneity case) and mu(a) = 0.02 and 0.03 mm(-1) (for the two inhomogeneities case). The reconstruction results by the PD-EnKF are shown to be consistently superior to those through a deterministic and explicitly regularized Gauss-Newton algorithm. We have also estimated the unknown mu(a) from experimentally gathered fluence data and verified the reconstruction by matching the experimental data with the computed one. Conclusions: The PD-EnKF, which exhibits little sensitivity against variations in the fictitiously introduced noise processes, is also proven to be accurate and robust in recovering a spatial map of the absorption coefficient from DOT data. With the help of shape based representation of the inhomogeneities and an appropriate scaling of the CH expansion coefficients representing the boundary, we have been able to recover inhomogeneities representative of the shape of malignancies in medical diagnostic imaging. (C) 2012 American Association of Physicists in Medicine. [DOI: 10.1118/1.3679855]

Optimal multi-layered congestion based pricing schemes for enhanced QoS

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes with multiple queues and multiple grades of service. We present a closed-loop multi-layered pricing scheme and propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. This is different from most adaptive pricing schemes in the literature that do not obtain a closed-loop state dependent pricing policy. The method that we propose finds optimal price levels that are functions of the queue lengths at individual queues. Further, we also propose a variant of the above scheme that assigns prices to incoming packets at each node according to a weighted average queue length at that node. This is done to reduce frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using both of our schemes over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our first scheme exhibits a throughput improvement in the range of 67-82% among all routes over the above scheme. (C) 2011 Elsevier B.V. All rights reserved.

Promiscuous restriction is a cellular defense strategy that confers fitness advantage to bacteria

Most bacterial genomes harbor restriction-modification systems, encoding a REase and its cognate MTase. On attack by a foreign DNA, the REase recognizes it as nonself and subjects it to restriction. Should REases be highly specific for targeting the invading foreign DNA? It is often considered to be the case. However, when bacteria harboring a promiscuous or high-fidelity variant of the REase were challenged with bacteriophages, fitness was maximal under conditions of catalytic promiscuity. We also delineate possible mechanisms by which the REase recognizes the chromosome as self at the noncanonical sites, thereby preventing lethal dsDNA breaks. This study provides a fundamental understanding of how bacteria exploit an existing defense system to gain fitness advantage during a host-parasite coevolutionary ``arms race.''

Enhanced J-protein interaction and compromised protein stability of mtHsp70 variants lead to mitochondrial dysfunction in Parkinsons disease

Parkinsons disease (PD) is the second most prevalent progressive neurological disorder commonly associated with impaired mitochondrial function in dopaminergic neurons. Although familial PD is multifactorial in nature, a recent genetic screen involving PD patients identified two mitochondrial Hsp70 variants (P509S and R126W) that are suggested in PD pathogenesis. However, molecular mechanisms underlying how mtHsp70 PD variants are centrally involved in PD progression is totally elusive. In this article, we provide mechanistic insights into the mitochondrial dysfunction associated with human mtHsp70 PD variants. Biochemically, the R126W variant showed severely compromised protein stability and was found highly susceptible to aggregation at physiological conditions. Strikingly, on the other hand, the P509S variant exhibits significantly enhanced interaction with J-protein cochaperones involved in folding and import machinery, thus altering the overall regulation of chaperone-mediated folding cycle and protein homeostasis. To assess the impact of mtHsp70 PD mutations at the cellular level, we developed yeast as a model system by making analogous mutations in Ssc1 ortholog. Interestingly, PD mutations in yeast (R103W and P486S) exhibit multiple in vivo phenotypes, which are associated with omitochondrial dysfunction', including compromised growth, impairment in protein translocation, reduced functional mitochondrial mass, mitochondrial DNA loss, respiratory incompetency and increased susceptibility to oxidative stress. In addition to that, R103W protein is prone to aggregate in vivo due to reduced stability, whereas P486S showed enhanced interaction with J-proteins, thus remarkably recapitulating the cellular defects that are observed in human PD variants. Taken together, our findings provide evidence in favor of direct involvement of mtHsp70 as a susceptibility factor in PD.

How Do Glassy Domains Grow?

We construct equations for the growth kinetics of structural glass within mode-coupling theory, through a nonstationary variant of the three-density correlator defined by G. Biroli et al. Phys. Rev. Lett. 97, 195701 (2006)]. We solve a schematic form of the resulting equations to obtain the coarsening of the three-point correlator chi(3)(t, t(w)) as a function of waiting time tw. For a quench into the glass, we find that chi(3) attains a peak value similar to t(w)(0.5) at t - t(w) similar to t(w)(0.8), providing a theoretical basis for the numerical observations of Parisi J. Phys. Chem. B 103, 4128 (1999)] and Kob and Barrat Phys. Rev. Lett. 78, 4581 (1997)]. The aging is not ``simple'': the t(w) dependence cannot be attributed to an evolving effective temperature.

Context dependent splicing functions of Bud31/Ycr063w define its role in budding and cell cycle progression

The yeast Bud31 protein, a Prp19 complex (NTC) member, aids spliceosome assembly and thus promotes efficient pre-mRNA splicing. The bud31 null cells show mild budding abnormalities at optimal growth temperatures and, at higher temperatures, have growth defects with aberrant budding. Here we have assessed cell cycle transitions which require Bud31. We find Bud31 facilitates passage through G1-S regulatory point (Start) but is not needed for G2-M transition or for exit from mitosis. To co-relate Bud31 functions in cell division with splicing, we studied the splicing status of transcripts that encode proteins involved in budding. We find Bud31 promotes efficient splicing of only some of these pre-mRNAs, for example, ARP2 and SRC1. Wild type cells have a long and a short isoform of SRC1 mRNA and protein, out of which the shorter mRNA splice variant is predominant. bud31 Delta cells show inefficient SRC1 splicing and entirely lack the shorter SRC1 spliced mRNA isoform. Yeast PRP17, another NTC sub-complex member, is also required for G1-S and G2-M cell cycle transitions. We examined genetic interactions between BUD31 and PRP17. While both factors were needed for efficient cell cycle dependent gene expression, our data indicate that distinct pre-mRNAs depend on each of these non-essential splicing factors.

MPI-based parallel synchronous vector evaluated particle swarm optimization for multi-objective design optimization of composite structures

This paper presents a decentralized/peer-to-peer architecture-based parallel version of the vector evaluated particle swarm optimization (VEPSO) algorithm for multi-objective design optimization of laminated composite plates using message passing interface (MPI). The design optimization of laminated composite plates being a combinatorially explosive constrained non-linear optimization problem (CNOP), with many design variables and a vast solution space, warrants the use of non-parametric and heuristic optimization algorithms like PSO. Optimization requires minimizing both the weight and cost of these composite plates, simultaneously, which renders the problem multi-objective. Hence VEPSO, a multi-objective variant of the PSO algorithm, is used. Despite the use of such a heuristic, the application problem, being computationally intensive, suffers from long execution times due to sequential computation. Hence, a parallel version of the PSO algorithm for the problem has been developed to run on several nodes of an IBM P720 cluster. The proposed parallel algorithm, using MPI's collective communication directives, establishes a peer-to-peer relationship between the constituent parallel processes, deviating from the more common master-slave approach, in achieving reduction of computation time by factor of up to 10. Finally we show the effectiveness of the proposed parallel algorithm by comparing it with a serial implementation of VEPSO and a parallel implementation of the vector evaluated genetic algorithm (VEGA) for the same design problem. (c) 2012 Elsevier Ltd. All rights reserved.

AN ITERATIVE ALGORITHM FOR PHASE RETRIEVAL WITH SPARSITY CONSTRAINTS: APPLICATION TO FREQUENCY DOMAIN OPTICAL COHERENCE TOMOGRAPHY

We address the problem of phase retrieval, which is frequently encountered in optical imaging. The measured quantity is the magnitude of the Fourier spectrum of a function (in optics, the function is also referred to as an object). The goal is to recover the object based on the magnitude measurements. In doing so, the standard assumptions are that the object is compactly supported and positive. In this paper, we consider objects that admit a sparse representation in some orthonormal basis. We develop a variant of the Fienup algorithm to incorporate the condition of sparsity and to successively estimate and refine the phase starting from the magnitude measurements. We show that the proposed iterative algorithm possesses Cauchy convergence properties. As far as the modality is concerned, we work with measurements obtained using a frequency-domain optical-coherence tomography experimental setup. The experimental results on real measured data show that the proposed technique exhibits good reconstruction performance even with fewer coefficients taken into account for reconstruction. It also suppresses the autocorrelation artifacts to a significant extent since it estimates the phase accurately.

Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].

On the Erdos-Szekeres n-interior point problem

The n-interior point variant of the Erdos-Szekeres problem is to show the following: For any n, n-1, every point set in the plane with sufficient number of interior points contains a convex polygon containing exactly n-interior points. This has been proved only for n-3. In this paper, we prove it for pointsets having atmost logarithmic number of convex layers. We also show that any pointset containing atleast n interior points, there exists a 2-convex polygon that contains exactly n-interior points.

Multifunctional microstrip antennas for wireless applications

Some possibilities of Antenna designs for multifunctional wireless terminals are presented here. A ring antenna with an electromagnetically coupled feed has been extended to systematically design a multi-frequency antenna using multiple rings. A variant of this approach uses one single ring with fractal and widened segments to design dual frequency antenna with choice of resonant frequencies. A different approach based on U-shaped slots is used for designing an antenna for onboard wireless applications, making use of materials presently used in a typical airplane. Several discrete bands up to 6 GHz, widely used for various standards are covered in this single-feed antenna.