The N-terminal region containing the zinc finger domain of tobacco streak virus coat protein is essential for the formation of virus-like particles

Tobacco streak virus (TSV), a member of the genus Ilarvirus (family Bromoviridae), has a tripartite genome and forms quasi-isometric virions. All three viral capsids, encapsidating RNA 1, RNA 2 or RNA 3 and subgenomic RNA 4, are constituted of a single species of coat protein (CP). Formation of virus-like particles (VLPs) could be observed when the TSV CP gene was cloned and the recombinant CP (rCP) was expressed in E. coli. TSV VLPs were found to be stabilized by Zn2+ ions and could be disassembled in the presence of 500 mM CaCl2. Mutational analysis corroborated previous studies that showed that an N-terminal arginine-rich motif was crucial for RNA binding; however, the results presented here demonstrate that the presence of RNA is not a prerequisite for assembly of TSV VLPs. Instead, the N-terminal region containing the zinc finger domain preceding the arginine-rich motif is essential for assembly of these VLPs.

Advancing biodiversity research in developing countries: the need for changing paradigms

The world is in the midst of a biodiversity crisis, threatening essential goods and services on which humanity depends. While there is an urgent need globally for biodiversity research, growing obstacles are severely limiting biodiversity research throughout the developing world, particularly in Southeast Asia. Facilities, funding, and expertise are often limited throughout this region, reducing the capacity for local biodiversity research. Although western scientists generally have more expertise and capacity, international research has sometimes been exploitative ``parachute science,'' creating a culture of suspicion and mistrust. These issues, combined with misplaced fears of biopiracy, have resulted in severe roadblocks to biodiversity research in the very countries that need it the most. Here, we present an overview of challenges to biodiversity research and case studies that provide productive models for advancing biodiversity research in developing countries. Key to success is integration of research and education, a model that fosters sustained collaboration by focusing on the process of conducting biodiversity research as well as research results. This model simultaneously expands biodiversity research capacity while building trust across national borders. It is critical that developing countries enact policies that protect their biodiversity capital without shutting down international and local biodiversity research that is essential to achieve the long-term sustainability of biodiversity, promoting food security and economic development.

Performance evaluation of typical approximation algorithms for nonconvex l(p)-minimization in diffuse optical tomography

The sparse estimation methods that utilize the l(p)-norm, with p being between 0 and 1, have shown better utility in providing optimal solutions to the inverse problem in diffuse optical tomography. These l(p)-norm-based regularizations make the optimization function nonconvex, and algorithms that implement l(p)-norm minimization utilize approximations to the original l(p)-norm function. In this work, three such typical methods for implementing the l(p)-norm were considered, namely, iteratively reweighted l(1)-minimization (IRL1), iteratively reweighted least squares (IRLS), and the iteratively thresholding method (ITM). These methods were deployed for performing diffuse optical tomographic image reconstruction, and a systematic comparison with the help of three numerical and gelatin phantom cases was executed. The results indicate that these three methods in the implementation of l(p)-minimization yields similar results, with IRL1 fairing marginally in cases considered here in terms of shape recovery and quantitative accuracy of the reconstructed diffuse optical tomographic images. (C) 2014 Optical Society of America

Growing Length Scales and Their Relation to Timescales in Glass-Forming Liquids

The question of whether the dramatic slowing down of the dynamics of glass-forming liquids near the structural glass transition is caused by the growth of one or more correlation lengths has received much attention in recent years. Several proposals have been made for both static and dynamic length scales that may be responsible for the growth of timescales as the glass transition is approached. These proposals are critically examined with emphasis on the dynamic length scale associated with spatial heterogeneity of local dynamics and the static point-to-set or mosaic length scale of the random first order transition theory of equilibrium glass transition. Available results for these length scales, obtained mostly from simulations, are summarized, and the relation of the growth of timescales near the glass transition with the growth of these length scales is examined. Some of the outstanding questions about length scales in glass-forming liquids are discussed, and studies in which these questions may be addressed are suggested.

Efficient simulation of unitary operators by combining two numerical algorithms: An NMR simulation of the mirror-inversion propagator of an XY spin chain

Precise experimental implementation of unitary operators is one of the most important tasks for quantum information processing. Numerical optimization techniques are widely used to find optimized control fields to realize a desired unitary operator. However, finding high-fidelity control pulses to realize an arbitrary unitary operator in larger spin systems is still a difficult task. In this work, we demonstrate that a combination of the GRAPE algorithm, which is a numerical pulse optimization technique, and a unitary operator decomposition algorithm Ajoy et al., Phys. Rev. A 85, 030303 (2012)] can realize unitary operators with high experimental fidelity. This is illustrated by simulating the mirror-inversion propagator of an XY spin chain in a five-spin dipolar coupled nuclear spin system. Further, this simulation has been used to demonstrate the transfer of entangled states from one end of the spin chain to the other end.

Avoiding acidic region streaking in two-dimensional gel electrophoresis: Case study with two bacterial whole cell protein extracts

Acidic region streaking (ARS) is one of the lacunae in two-dimensional gel electrophoresis (2DE) of bacterial proteome. This streaking is primarily caused by nucleic acid (NuA) contamination and poses major problem in the downstream processes like image analysis and protein identification. Although cleanup and nuclease digestion are practiced as remedial options, these strategies may incur loss in protein recovery and perform incomplete removal of NuA. As a result, ARS has remained a common observation across publications, including the recent ones. In this work, we demonstrate how ultrasound wave can be used to shear NuA in plain ice-cooled water, facilitating the elimination of ARS in the 2DE gels without the need for any additional sample cleanup tasks. In combination with a suitable buffer recipe, IEF program and frequent paper-wick changing approach, we are able to reproducibly demonstrate the production of clean 2DE gels with improved protein recovery and negligible or no ARS. We illustrate our procedure using whole cell protein extracts from two diverse organisms, Escherichia coli and Mycobacterium smegmatis. Our designed protocols are straightforward and expected to provide good 2DE gels without ARS, with comparable times and significantly lower cost.

Growing dynamical facilitation on approaching the random pinning colloidal glass transition

Despite decades of research, it remains to be established whether the transformation of a liquid into a glass is fundamentally thermodynamic or dynamic in origin. Although observations of growing length scales are consistent with thermodynamic perspectives, the purely dynamic approach of the Dynamical Facilitation (DF) theory lacks experimental support. Further, for vitrification induced by randomly freezing a subset of particles in the liquid phase, simulations support the existence of an underlying thermodynamic phase transition, whereas the DF theory remains unexplored. Here, using video microscopy and holographic optical tweezers, we show that DF in a colloidal glass-forming liquid grows with density as well as the fraction of pinned particles. In addition, we observe that heterogeneous dynamics in the form of string-like cooperative motion emerges naturally within the framework of facilitation. Our findings suggest that a deeper understanding of the glass transition necessitates an amalgamation of existing theoretical approaches.

Smoothed Functional Algorithms for Stochastic Optimization Using q-Gaussian Distributions

Smoothed functional (SF) schemes for gradient estimation are known to be efficient in stochastic optimization algorithms, especially when the objective is to improve the performance of a stochastic system However, the performance of these methods depends on several parameters, such as the choice of a suitable smoothing kernel. Different kernels have been studied in the literature, which include Gaussian, Cauchy, and uniform distributions, among others. This article studies a new class of kernels based on the q-Gaussian distribution, which has gained popularity in statistical physics over the last decade. Though the importance of this family of distributions is attributed to its ability to generalize the Gaussian distribution, we observe that this class encompasses almost all existing smoothing kernels. This motivates us to study SF schemes for gradient estimation using the q-Gaussian distribution. Using the derived gradient estimates, we propose two-timescale algorithms for optimization of a stochastic objective function in a constrained setting with a projected gradient search approach. We prove the convergence of our algorithms to the set of stationary points of an associated ODE. We also demonstrate their performance numerically through simulations on a queuing model.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

Newton-based stochastic optimization using q-Gaussian smoothed functional algorithms

We present the first q-Gaussian smoothed functional (SF) estimator of the Hessian and the first Newton-based stochastic optimization algorithm that estimates both the Hessian and the gradient of the objective function using q-Gaussian perturbations. Our algorithm requires only two system simulations (regardless of the parameter dimension) and estimates both the gradient and the Hessian at each update epoch using these. We also present a proof of convergence of the proposed algorithm. In a related recent work (Ghoshdastidar, Dukkipati, & Bhatnagar, 2014), we presented gradient SF algorithms based on the q-Gaussian perturbations. Our work extends prior work on SF algorithms by generalizing the class of perturbation distributions as most distributions reported in the literature for which SF algorithms are known to work turn out to be special cases of the q-Gaussian distribution. Besides studying the convergence properties of our algorithm analytically, we also show the results of numerical simulations on a model of a queuing network, that illustrate the significance of the proposed method. In particular, we observe that our algorithm performs better in most cases, over a wide range of q-values, in comparison to Newton SF algorithms with the Gaussian and Cauchy perturbations, as well as the gradient q-Gaussian SF algorithms. (C) 2014 Elsevier Ltd. All rights reserved.

A Continuous Electrical Conductivity Model for Monolayer Graphene From Near Intrinsic to Far Extrinsic Region

We present a closed-form continuous model for the electrical conductivity of a single layer graphene (SLG) sheet in the presence of short-range impurities, long-range screened impurities, and acoustic phonons. The validity of the model extends from very low doping levels (chemical potential close to the Dirac cone vertex) to very high doping levels. We demonstrate complete functional relations of the chemical potential, polarization function, and conductivity with respect to both doping level and temperature (T), which were otherwise developed for SLG sheet only in the very low and very high doping levels. The advantage of the continuous conductivity model reported in this paper lies in its simple form which depends only on three adjustable parameters: the short-range impurity density, the long-range screened impurity density, and temperature T. The proposed theoretical model was successfully used to correlate various experiments in the midtemperature and moderate density regimes.

An iterative framework for sparse signal reconstruction algorithms

It has been shown that iterative re-weighted strategies will often improve the performance of many sparse reconstruction algorithms. However, these strategies are algorithm dependent and cannot be easily extended for an arbitrary sparse reconstruction algorithm. In this paper, we propose a general iterative framework and a novel algorithm which iteratively enhance the performance of any given arbitrary sparse reconstruction algorithm. We theoretically analyze the proposed method using restricted isometry property and derive sufficient conditions for convergence and performance improvement. We also evaluate the performance of the proposed method using numerical experiments with both synthetic and real-world data. (C) 2014 Elsevier B.V. All rights reserved.

Investigation of the separated region ahead of three-dimensional protuberances on plates and cones in hypersonic flows with laminar boundary layers

Heat transfer rate and pressure measurements were made upstream of surface pro-tuberances on a flat plate and a sharp cone subjected to hypersonic flow in a conventional shock tunnel. Heat flux was measured using platinum thin-film sensors deposited on macor substrate and the pressure measurements were made using fast acting piezoelectric sensors. A distinctive hot spot with highest heat flux was obtained near the foot of the protuberance due to heavy vortex activity in the recirculating region. Schlieren flow visualization was used to capture the shock structures and the separation distance ahead of the protrusions was quantitatively measured for varying protuberance heights. A computational analysis was conducted on the flat plate model using commercial computational fluid dynamics software and the obtained trends of heat flux and pressure were compared with the experimental observation. Experiments were also conducted by physically disturbing the laminar boundary layer to check its effect on the magnitude of the hot spot heat flux. In addition to air, argon was also used as test gas so that the Reynolds number can be varied. (C) 2014 AIP Publishing LLC.

Estimating the volume of glaciers in the Himalayan-Karakoram region using different methods

Ice volume estimates are crucial for assessing water reserves stored in glaciers. Due to its large glacier coverage, such estimates are of particular interest for the Himalayan-Karakoram (HK) region. In this study, different existing methodologies are used to estimate the ice reserves: three area-volume relations, one slope-dependent volume estimation method, and two ice-thickness distribution models are applied to a recent, detailed, and complete glacier inventory of the HK region, spanning over the period 2000-2010 and revealing an ice coverage of 40 775 km(2). An uncertainty and sensitivity assessment is performed to investigate the influence of the observed glacier area and important model parameters on the resulting total ice volume. Results of the two ice-thickness distribution models are validated with local ice-thickness measurements at six glaciers. The resulting ice volumes for the entire HK region range from 2955 to 4737 km(3), depending on the approach. This range is lower than most previous estimates. Results from the ice thickness distribution models and the slope-dependent thickness estimations agree well with measured local ice thicknesses. However, total volume estimates from area-related relations are larger than those from other approaches. The study provides evidence on the significant effect of the selected method on results and underlines the importance of a careful and critical evaluation.

Simultaneous Perturbation Newton Algorithms for Simulation Optimization

We present a new Hessian estimator based on the simultaneous perturbation procedure, that requires three system simulations regardless of the parameter dimension. We then present two Newton-based simulation optimization algorithms that incorporate this Hessian estimator. The two algorithms differ primarily in the manner in which the Hessian estimate is used. Both our algorithms do not compute the inverse Hessian explicitly, thereby saving on computational effort. While our first algorithm directly obtains the product of the inverse Hessian with the gradient of the objective, our second algorithm makes use of the Sherman-Morrison matrix inversion lemma to recursively estimate the inverse Hessian. We provide proofs of convergence for both our algorithms. Next, we consider an interesting application of our algorithms on a problem of road traffic control. Our algorithms are seen to exhibit better performance than two Newton algorithms from a recent prior work.