Chain Length Effects on Helix-Hairpin Distribution in Short Peptides with Aib-(D)Ala and Aib-Aib Segments

The Aib-(D)Ala dipeptide segment has a tendency to form both type-I'/III' and type-I/III beta-turns. The occurrence of prime turns facilitates the formation of beta-hairpin conformations, while type-I/III turns can nucleate helix formation. The octapeptide Boc-Leu-Phe-Val-Aib-(D)Ala-Leu-Phe-Val-OMe (1) has been previously shown to form a beta-hairpin in the crystalline state and in solution. The effects of sequence truncation have been examined using the model peptides Boc-Phe-Val-Aib-Xxx-Leu-Phe-NHMe (2, 6), Boc-Val-Aib-Xxx-Leu-NHMe (3, 7), and Boc-Aib-Xxx-NHMe (4, 8), where Xxx = (D)Ala, Aib. For peptides with central Aib-Aib segments, Boc-Phe-Val-Aib-Aib-Leu-Phe-NHMe (6), Boc-Val-Aib-Aib-Leu-NHMe (7), and Boc-Aib-Aib-NHMe (8) helical conformations have been established by NMR studies in both hydrogen bonding (CD(3)OH) and non-hydrogen bonding (CDCl(3)) solvents. In contrast, the corresponding hexapeptide Boc-Phe-Val-Aib-(D)Ala-Leu-Phe-Val-NHMe (2) favors helical conformations in CDCl(3) and beta-hairpin conformations in CD(3)OH. The beta-turn conformations (type-I'/III) stabilized by intramolecular 4 -> 1 hydrogen bonds are observed for the peptide Boc-Aib-(D)Ala-NHMe (4) and Boc-Aib-Aib-NIiMe (8) in crystals. The tetrapeptide Boc-Val-Aib-Aib-Leu-NHMe (7) adopts an incipient 3(10)-helical conformation stabilized by three 4 -> 1 hydrogen bonds. The peptide Boc-Val-Aib-(D)Ala-Leu-NHMe (3) adopts a novel et-turn conformation, stabilized by three intramolecular hydrogen bonds (two 4 -> 1 and one 5 -> 1). The Aib-L(D)Ala segment adopts a type-I' beta-turn conformation. The observation of an NOE between Val (1) NH <-> HNCH(3) (5) in CD(3)OH suggests, that the solid state conformation is maintained in methanol solutions. (C) 2011 Wiley Periodicals, Inc. Biopolymers (Pept Sci) 96: 744-756, 2011.

On maximum entropy and minimum KL-divergence optimization by Grobner basis methods

In this paper we study constrained maximum entropy and minimum divergence optimization problems, in the cases where integer valued sufficient statistics exists, using tools from computational commutative algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. We give an implicit description of maximum entropy models by embedding them in algebraic varieties for which we give a Grobner basis method to compute it. In the cases of minimum KL-divergence models we show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner basis method to embed minimum KL-divergence models in algebraic varieties. (C) 2012 Elsevier Inc. All rights reserved.

Influence of stack geometry and resonator length on the performance of thermoacoustic engine

Thermoacoustic engines convert heat energy into high amplitude sound waves, which is used to drive thermoacoustic refrigerator or pulse tube cryocoolers by replacing the mechanical pistons such as compressors. The increasing interest in thermoacoustic technology is of its potentiality of no exotic materials, low cost and high reliability compared to vapor compression refrigeration systems. The experimental setup has been built based on the linear thermoacoustic model and some simple design parameters. The engines produce acoustic energy at the temperature difference of 325-450 K imposed along the stack of the system. This work illustrates the influence of stack parameters such as plate thickness (PT) and plate spacing (PS) with resonator length on the performance of thermoacoustic engine, which are measured in terms of onset temperature difference, resonance frequency and pressure amplitude using air as a working fluid. The results obtained from the experiments are in good agreement with the theoretical results from DeltaEc. (C) 2012 Elsevier Ltd. All rights reserved.

A full-length bifunctional protein involved in c-di-GMP turnover is required for long-term survival under nutrient starvation in Mycobacterium smegmatis

The bacterial second messenger cyclic diguanosine monophosphate (c-di-GMP) plays an important role in a variety of cellular functions, including biofilm formation, alterations in the cell surface, host colonization and regulation of bacterial flagellar motility, which enable bacteria to survive changing environmental conditions. The cellular level of c-di-GMP is regulated by a balance between opposing activities of diguanylate cyclases (DGCs) and cognate phosphodiesterases (PDE-As). Here, we report the presence and importance of a protein, MSDGC-1 (an orthologue of Rv1354c in Mycobacterium tuberculosis), involved in c-di-GMP turnover in Mycobacterium smegmatis. MSDGC-1 is a multidomain protein, having GAF, GGDEF and EAL domains arranged in tandem, and exhibits both c-di-GMP synthesis and degradation activities. Most other proteins containing GGDEF and EAL domains have been demonstrated to have either DGC or PDE-A activity. Unlike other bacteria, which harbour several copies of the protein involved in c-di-GMP turnover, M. smegmatis has a single genomic copy, deletion of which severely affects long-term survival under conditions of nutrient starvation. Overexpression of MSDGC-1 alters the colony morphology and growth profile of M. smegmatis. In order to gain insights into the regulation of the c-di-GMP level, we cloned individual domains and tested their activities. We observed a loss of activity in the separated domains, indicating the importance of full-length MSDGC-1 for controlling bifunctionality.

Performance and variability trade-off with gate-to-source/drain overlap length

The impact of gate-to-source/drain overlap length on performance and variability of 65 nm CMOS is presented. The device and circuit variability is investigated as a function of three significant process parameters, namely gate length, gate oxide thickness, and halo dose. The comparison is made with three different values of gate-to-source/drain overlap length namely 5 nm, 0 nm, and -5 nm and at two different leakage currents of 10 nA and 100 nA. The Worst-Case-Analysis approach is used to study the inverter delay fluctuations at the process corners. The drive current of the device for device robustness and stage delay of an inverter for circuit robustness are taken as performance metrics. The design trade-off between performance and variability is demonstrated both at the device level and circuit level. It is shown that larger overlap length leads to better performance, while smaller overlap length results in better variability. Performance trades with variability as overlap length is varied. An optimal value of overlap length of 0 nm is recommended at 65 nm gate length, for a reasonable combination of performance and variability.

A generalized geo-hazard warning system

An automated geo-hazard warning system is the need of the hour. It is integration of automation in hazard evaluation and warning communication. The primary objective of this paper is to explain a geo-hazard warning system based on Internet-resident concept and available cellular mobile infrastructure that makes use of geo-spatial data. The functionality of the system is modular in architecture having input, understanding, expert, output and warning modules. Thus, the system provides flexibility in integration between different types of hazard evaluation and communication systems leading to a generalized hazard warning system. The developed system has been validated for landslide hazard in Indian conditions. It has been realized through utilization of landslide causative factors, rainfall forecast from NASA's TRMM (Tropical Rainfall Measuring Mission) and knowledge base of landslide hazard intensity map and invokes the warning as warranted. The system evaluated hazard commensurate with expert evaluation within 5-6 % variability, and the warning message permeability has been found to be virtually instantaneous, with a maximum time lag recorded as 50 s, minimum of 10 s. So it could be concluded that a novel and stand-alone system for dynamic hazard warning has been developed and implemented. Such a handy system could be very useful in a densely populated country where people are unaware of the impending hazard.

Effect of length scale on mechanical properties of Al-Cu eutectic alloy

This paper attempts a quantitative understanding of the effect of length scale on two phase eutectic structure. We first develop a model that considers both the elastic and plastic properties of the interface. Using Al-Al2Cu lamellar eutectic as model system, the parameters of the model were experimentally determined using indentation technique. The model is further validated using the results of bulk compression testing of the eutectics having different length scales. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4761944]

How Does the Spacer Length of Cationic Gemini Lipids Influence the Lipoplex Formation with Plasmid DNA? Physicochemical and Biochemical Characterizations and their Relevance in Gene Therapy

Lipoplexes formed by the pEGFP-C3 plasmid DNA (pDNA) and lipid mixtures containing cationic gemini surfactant of the 1,2-bis(hexadecyl dimethyl ammonium) Acmes family referred to as C16CnC16, where n = 2 3, 5, or 12, and the zwitterionic helper lipid, 1,2-dioleoyl-sn-glycero-3-phosphatidylethanolamine (DOPE) have been studied from a wide variety of physical, chemical, and biological standpoints. The study has been carried out using several experimental methods, such as zeta potential, gel electrophoresis, small-angle X-ray scattering (SAXS), cryo-TEM, gene transfection, cell viability/cytotoxicity, and confocal fluorescence microscopy. As reported recently in a communication (J. Am. Chem. Soc. 2011, 133, 18014), the detailed physicochemical and biological studies confirm that, in the presence of the studied series lipid mixtures, plasmid DNA is compacted with a large number of its associated Na+ counterions. This in turn yields a much lower effective negative charge, q(pDNA)(-), a value that has been experimentally obtained for each mixed lipid mixture. Consequently, the cationic lipid (CL) complexes prepared with pDNA and CL/DOPE mixtures to be used in gene transfection require significantly less amount of CL than the one estimated assuming a value of q(DNA)(-) = -2. This drives to a considerably lower cytotoxicity of the gene vector. Depending on the CL molar composition, alpha, of the lipid mixture, and the effective charge ratio of the lipoplex, rho(eff), the reported SAXS data indicate the presence of two or three structures in the same lipoplex, one in the DOPE-rich region, other in the CL-rich region, and another one present at any CL composition. Cryo-TEM and SAXS studies with C16CnC16/DOPE-pDNA lipoplexes indicate that pDNA is localized between the mixed lipid bilayers of lamellar structures within a monolayer of similar to 2 nm. This is consistent with a highly compacted supercoiled pDNA conformation compared with that of linear DNA. Transfection studies were carried out with HEK293T, HeLa, CHO, U343, and H460 cells. The alpha and rho(eff) values for each lipid mixture were optimized on HEK293T cells for transfection, and using these values, the remaining cells were also transfected in absence (-FBS-FBS) and presence (-FBS+FBS) of serum. The transfection efficiency was higher with the CLs of shorter gemini spacers (n = 2 or 3). Each formulation expressed GFP on pDNA transfection and confocal fluorescence microscopy corroborated the results. C16C2C16/DOPE mixtures were the most efficient toward transfection among all the lipid mixtures and, in presence of serum, even better than the Lipofectamine2000, a commercial transfecting agent Each lipid combination was safe and did not show any significant levels of toxicity. Probably, the presence of two coexisting lamellar structures in lipoplexes synergizes the transfection efficiency of the lipid mixtures which are plentiful in the lipoplexes formed by CLs with short spacer (n = 2, 3) than those with the long spacer (n = 5, 12).

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

Data-resolution based optimal choice of minimum required measurements for image-guided diffuse optical tomography

Image-guided diffuse optical tomography has the advantage of reducing the total number of optical parameters being reconstructed to the number of distinct tissue types identified by the traditional imaging modality, converting the optical image-reconstruction problem from underdetermined in nature to overdetermined. In such cases, the minimum required measurements might be far less compared to those of the traditional diffuse optical imaging. An approach to choose these optimally based on a data-resolution matrix is proposed, and it is shown that such a choice does not compromise the reconstruction performance. (C) 2013 Optical Society of America

Minimum power consumption for drag reduction on a circular cylinder by tangential surface motion

We investigate the effect of a prescribed tangential velocity on the drag force on a circular cylinder in a spanwise uniform cross flow. Using a combination of theoretical and numerical techniques we make an attempt at determining the optimal tangential velocity profiles which will reduce the drag force acting on the cylindrical body while minimizing the net power consumption characterized through a non-dimensional power loss coefficient (C-PL). A striking conclusion of our analysis is that the tangential velocity associated with the potential flow, which completely suppresses the drag force, is not optimal for both small and large, but finite Reynolds number. When inertial effects are negligible (R e << 1), theoretical analysis based on two-dimensional Oseen equations gives us the optimal tangential velocity profile which leads to energetically efficient drag reduction. Furthermore, in the limit of zero Reynolds number (Re -> 0), minimum power loss is achieved for a tangential velocity profile corresponding to a shear-free perfect slip boundary. At finite Re, results from numerical simulations indicate that perfect slip is not optimum and a further reduction in drag can be achieved for reduced power consumption. A gradual increase in the strength of a tangential velocity which involves only the first reflectionally symmetric mode leads to a monotonic reduction in drag and eventual thrust production. Simulations reveal the existence of an optimal strength for which the power consumption attains a minima. At a Reynolds number of 100, minimum value of the power loss coefficient (C-PL = 0.37) is obtained when the maximum in tangential surface velocity is about one and a half times the free stream uniform velocity corresponding to a percentage drag reduction of approximately 77 %; C-PL = 0.42 and 0.50 for perfect slip and potential flow cases, respectively. Our results suggest that potential flow tangential velocity enables energetically efficient propulsion at all Reynolds numbers but optimal drag reduction only for Re -> infinity. The two-dimensional strategy of reducing drag while minimizing net power consumption is shown to be effective in three dimensions via numerical simulation of flow past an infinite circular cylinder at a Reynolds number of 300. Finally a strategy of reducing drag, suitable for practical implementation and amenable to experimental testing, through piecewise constant tangential velocities distributed along the cylinder periphery is proposed and analysed.

Nodal length fluctuations for arithmetic random waves

Using the spectral multiplicities of the standard torus, we endow the Laplace eigenspaces with Gaussian probability measures. This induces a notion of random Gaussian Laplace eigenfunctions on the torus (''arithmetic random waves''). We study the distribution of the nodal length of random eigenfunctions for large eigenvalues, and our primary result is that the asymptotics for the variance is nonuniversal. Our result is intimately related to the arithmetic of lattice points lying on a circle with radius corresponding to the energy.

On the Selection of Optimum Savitzky-Golay Filters

Savitzky-Golay (S-G) filters are finite impulse response lowpass filters obtained while smoothing data using a local least-squares (LS) polynomial approximation. Savitzky and Golay proved in their hallmark paper that local LS fitting of polynomials and their evaluation at the mid-point of the approximation interval is equivalent to filtering with a fixed impulse response. The problem that we address here is, ``how to choose a pointwise minimum mean squared error (MMSE) S-G filter length or order for smoothing, while preserving the temporal structure of a time-varying signal.'' We solve the bias-variance tradeoff involved in the MMSE optimization using Stein's unbiased risk estimator (SURE). We observe that the 3-dB cutoff frequency of the SURE-optimal S-G filter is higher where the signal varies fast locally, and vice versa, essentially enabling us to suitably trade off the bias and variance, thereby resulting in near-MMSE performance. At low signal-to-noise ratios (SNRs), it is seen that the adaptive filter length algorithm performance improves by incorporating a regularization term in the SURE objective function. We consider the algorithm performance on real-world electrocardiogram (ECG) signals. The results exhibit considerable SNR improvement. Noise performance analysis shows that the proposed algorithms are comparable, and in some cases, better than some standard denoising techniques available in the literature.

Cubicity, degeneracy, and crossing number

A $k$-box $B=(R_1,...,R_k)$, where each $R_i$ is a closed interval on the real line, is defined to be the Cartesian product $R_1\times R_2\times ...\times R_k$. If each $R_i$ is a unit length interval, we call $B$ a $k$-cube. Boxicity of a graph $G$, denoted as $\boxi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-boxes. Similarly, the cubicity of $G$, denoted as $\cubi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-cubes. It was shown in [L. Sunil Chandran, Mathew C. Francis, and Naveen Sivadasan: Representing graphs as the intersection of axis-parallel cubes. MCDES-2008, IISc Centenary Conference, available at CoRR, abs/cs/ 0607092, 2006.] that, for a graph $G$ with maximum degree $\Delta$, $\cubi(G)\leq \lceil 4(\Delta +1)\log n\rceil$. In this paper, we show that, for a $k$-degenerate graph $G$, $\cubi(G) \leq (k+2) \lceil 2e \log n \rceil$. Since $k$ is at most $\Delta$ and can be much lower, this clearly is a stronger result. This bound is tight. We also give an efficient deterministic algorithm that runs in $O(n^2k)$ time to output a $8k(\lceil 2.42 \log n\rceil + 1)$ dimensional cube representation for $G$. An important consequence of the above result is that if the crossing number of a graph $G$ is $t$, then $\boxi(G)$ is $O(t^{1/4}{\lceil\log t\rceil}^{3/4})$ . This bound is tight up to a factor of $O((\log t)^{1/4})$. We also show that, if $G$ has $n$ vertices, then $\cubi(G)$ is $O(\log n + t^{1/4}\log t)$. Using our bound for the cubicity of $k$-degenerate graphs we show that cubicity of almost all graphs in $\mathcal{G}(n,m)$ model is $O(d_{av}\log n)$, where $d_{av}$ denotes the average degree of the graph under consideration. model is O(davlogn).

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.