Small molecule inhibitors of HCV replication from Pomegranate

Hepatitis C virus (HCV) is the causative agent of end-stage liver disease. Recent advances in the last decade in anti HCV treatment strategies have dramatically increased the viral clearance rate. However, several limitations are still associated, which warrant a great need of novel, safe and selective drugs against HCV infection. Towards this objective, we explored highly potent and selective small molecule inhibitors, the ellagitannins, from the crude extract of Pomegranate (Punica granatum) fruit peel. The pure compounds, punicalagin, punicalin, and ellagic acid isolated from the extract specifically blocked the HCV NS3/4A protease activity in vitro. Structural analysis using computational approach also showed that ligand molecules interact with the catalytic and substrate binding residues of NS3/4A protease, leading to inhibition of the enzyme activity. Further, punicalagin and punicalin significantly reduced the HCV replication in cell culture system. More importantly, these compounds are well tolerated ex vivo and `no observed adverse effect level' (NOAEL) was established upto an acute dose of 5000 mg/kg in BALB/c mice. Additionally, pharmacokinetics study showed that the compounds are bioavailable. Taken together, our study provides a proof-of-concept approach for the potential use of antiviral and non-toxic principle ellagitannins from pomegranate in prevention and control of HCV induced complications.

An inhomogeneous multispecies TASEP on a ring

We reinterpret and generalize conjectures of Lam and Williams as statements about the stationary distribution of a multispecies exclusion process on the ring. The central objects in our study are the multiline queues of Ferrari and Martin. We make some progress on some of the conjectures in different directions. First, we prove Lam and Williams' conjectures in two special cases by generalizing the rates of the Ferrari-Martin transitions. Secondly, we define a new process on multiline queues, which have a certain minimality property. This gives another proof for one of the special cases; namely arbitrary jump rates for three species. (C) 2014 Elsevier Inc. All rights reserved.

Ontology analysis of global gene expression differences of human bone marrow stromal cells cultured on 3D scaffolds or 2D films

Differences in gene expression of human bone marrow stromal cells (hBMSCs) during culture in three-dimensional (3D) nanofiber scaffolds or on two-dimensional (2D) films were investigated via pathway analysis of microarray mRNA expression profiles. Previous work has shown that hBMSC culture in nanofiber scaffolds can induce osteogenic differentiation in the absence of osteogenic supplements (OS). Analysis using ontology databases revealed that nanofibers and OS regulated similar pathways and that both were enriched for TGF-beta and cell-adhesion/ECM-receptor pathways. The most notable difference between the two was that nanofibers had stronger enrichment for cell-adhesion/ECM-receptor pathways. Comparison of nanofibers scaffolds with flat films yielded stronger differences in gene expression than comparison of nanofibers made from different polymers, suggesting that substrate structure had stronger effects on cell function than substrate polymer composition. These results demonstrate that physical (nanofibers) and biochemical (OS) signals regulate similar ontological pathways, suggesting that these cues use similar molecular mechanisms to control hBMSC differentiation. Published by Elsevier Ltd.

Non-existence of tight neighborly triangulated manifolds with beta(1)=2

All triangulated d-manifolds satisfy the inequality ((f0-d-1)(2)) >= ((d+2)(2))beta(1) for d >= 3. A triangulated d-manifold is called tight neighborly if it attains equality in this bound. For each d >= 3, a (2d + 3)-vertex tight neighborly triangulation of the Sd-1-bundle over S-1 with beta(1) = 1 was constructed by Kuhnel in 1986. In this paper, it is shown that there does not exist a tight neighborly triangulated manifold with beta(1) = 2. In other words, there is no tight neighborly triangulation of (Sd-1 x S-1)(#2) or (Sd-1 (sic) S-1)(#2) for d >= 3. A short proof of the uniqueness of K hnel's complexes for d >= 4 under the assumption beta(1) not equal 0 is also presented.

De novo inference of protein function from coarse-grained dynamics

Inference of molecular function of proteins is the fundamental task in the quest for understanding cellular processes. The task is getting increasingly difficult with thousands of new proteins discovered each day. The difficulty arises primarily due to lack of high-throughput experimental technique for assessing protein molecular function, a lacunae that computational approaches are trying hard to fill. The latter too faces a major bottleneck in absence of clear evidence based on evolutionary information. Here we propose a de novo approach to annotate protein molecular function through structural dynamics match for a pair of segments from two dissimilar proteins, which may share even <10% sequence identity. To screen these matches, corresponding 1 mu s coarse-grained (CG) molecular dynamics trajectories were used to compute normalized root-mean-square-fluctuation graphs and select mobile segments, which were, thereafter, matched for all pairs using unweighted three-dimensional autocorrelation vectors. Our in-house custom-built forcefield (FF), extensively validated against dynamics information obtained from experimental nuclear magnetic resonance data, was specifically used to generate the CG dynamics trajectories. The test for correspondence of dynamics-signature of protein segments and function revealed 87% true positive rate and 93.5% true negative rate, on a dataset of 60 experimentally validated proteins, including moonlighting proteins and those with novel functional motifs. A random test against 315 unique fold/function proteins for a negative test gave >99% true recall. A blind prediction on a novel protein appears consistent with additional evidences retrieved therein. This is the first proof-of-principle of generalized use of structural dynamics for inferring protein molecular function leveraging our custom-made CG FF, useful to all. (C) 2014 Wiley Periodicals, Inc.

BELIEF PROPAGATION FOR OPTIMAL EDGE COVER IN THE RANDOM COMPLETE GRAPH

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wastlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the (2) limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

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.

Surrogate Regret Bounds for Bipartite Ranking via Strongly Proper Losses

The problem of bipartite ranking, where instances are labeled positive or negative and the goal is to learn a scoring function that minimizes the probability of mis-ranking a pair of positive and negative instances (or equivalently, that maximizes the area under the ROC curve), has been widely studied in recent years. A dominant theoretical and algorithmic framework for the problem has been to reduce bipartite ranking to pairwise classification; in particular, it is well known that the bipartite ranking regret can be formulated as a pairwise classification regret, which in turn can be upper bounded using usual regret bounds for classification problems. Recently, Kotlowski et al. (2011) showed regret bounds for bipartite ranking in terms of the regret associated with balanced versions of the standard (non-pairwise) logistic and exponential losses. In this paper, we show that such (non-pairwise) surrogate regret bounds for bipartite ranking can be obtained in terms of a broad class of proper (composite) losses that we term as strongly proper. Our proof technique is much simpler than that of Kotlowski et al. (2011), and relies on properties of proper (composite) losses as elucidated recently by Reid and Williamson (2010, 2011) and others. Our result yields explicit surrogate bounds (with no hidden balancing terms) in terms of a variety of strongly proper losses, including for example logistic, exponential, squared and squared hinge losses as special cases. An important consequence is that standard algorithms minimizing a (non-pairwise) strongly proper loss, such as logistic regression and boosting algorithms (assuming a universal function class and appropriate regularization), are in fact consistent for bipartite ranking; moreover, our results allow us to quantify the bipartite ranking regret in terms of the corresponding surrogate regret. We also obtain tighter surrogate bounds under certain low-noise conditions via a recent result of Clemencon and Robbiano (2011).

Synthesis of a new tungsten-free gamma-gamma ` cobalt-based superalloy by tuning alloying additions

The paper presents the synthesis of a new class of gamma-gamma' cobalt-based superalloy that is free of tungsten as an alloying addition. It has much lower density and higher specific strength than the existing cobalt-based superalloys. The current superalloys have a base composition of Co-10Al and are further tuned by the addition of a binary combination of molybdenum and niobium, with the optimum composition of Co-10Al-5Mo-2Nb. The solvus temperature of the alloy (866 degrees C) can be further enhanced above 950 C by the addition of Ni to give the form Co-xNi-10Al-5Mo-2Nb, where x can be from 0 to 30 at.%. After heat treatment, these alloys exhibit a duplex microstructure with coherent cuboidal L1(2)-ordered precipitates (gamma') throughout the face-centred cubic matrix (gamma), yielding a microstructure that is very similar to nickel-based superalloys as well as recently developed Co-Al-W-based alloys. We show that the stability of the gamma' phase improves significantly with the nickel addition, which can be attributed to the increase in solvus temperature. A very high specific 0.2% proof stress of 94.3 MPa g(-1) cm(-3) at room temperature and 63.8 MPa g(-1) cm(-3) at 870 degrees C were obtained for alloy Co-30Ni-10Al-5Mo-2Nb. The remarkably high specific strength of these alloys makes this class of alloy a promising material for use at high temperature, including gas turbine applications. (C) 2014 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

A new tungsten-free gamma-gamma ` Co-Al-Mo-Nb-based superalloy

We present the first report of a tungsten-free cobalt-based superalloy having a composition Co-10Al-5Mo-2Nb. The alloy is strengthened by cuboidal precipitates of metastable Co-3(Al,Mo,Nb) distributed throughout the microstructure. The precipitates are coherent with the face-centred cubic gamma-Co matrix and possess ordered Ll(2) structure. The microstructure is identical to the popular gamma-gamma' type nickel-based superalloys and that of recently reported Co-Al-W-based alloys. Being tungsten free, the reported alloy has higher specific proof stress compared to existing cobalt-based superalloys. (C) 2014 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Remotely triggered micro-shock wave responsive drug delivery system for resolving diabetic wound infection and controlling blood sugar levels

A novel, micro-shock wave responsive spermidine and dextran sulfate microparticle was developed. Almost 90% of the drug release was observed when the particles were exposed to micro-shock waves 5 times. Micro-shock waves served two purposes; of releasing the antibiotic from the system and perhaps disrupting the S. aureus biofilm in the skin infection model. A combination of shock waves with ciprofloxacin loaded microparticles could completely cure the S. aureus infection lesion in a diabetic mouse model. As a proof of concept insulin release was triggered using micro-shock waves in diabetic mice to reduce the blood glucose level. Insulin release could be triggered for at least 3 days by exposing subcutaneously injected insulin loaded particles.

Detection of G-Quadruplex DNA Using Primer Extension as a Tool

DNA sequence and structure play a key role in imparting fragility to different regions of the genome. Recent studies have shown that non-B DNA structures play a key role in causing genomic instability, apart from their physiological roles at telomeres and promoters. Structures such as G-quadruplexes, cruciforms, and triplexes have been implicated in making DNA susceptible to breakage, resulting in genomic rearrangements. Hence, techniques that aid in the easy identification of such non-B DNA motifs will prove to be very useful in determining factors responsible for genomic instability. In this study, we provide evidence for the use of primer extension as a sensitive and specific tool to detect such altered DNA structures. We have used the G-quadruplex motif, recently characterized at the BCL2 major breakpoint region as a proof of principle to demonstrate the advantages of the technique. Our results show that pause sites corresponding to the non-B DNA are specific, since they are absent when the G-quadruplex motif is mutated and their positions change in tandem with that of the primers. The efficiency of primer extension pause sites varied according to the concentration of monovalant cations tested, which support G-quadruplex formation. Overall, our results demonstrate that primer extension is a strong in vitro tool to detect non-B DNA structures such as G-quadruplex on a plasmid DNA, which can be further adapted to identify non-B DNA structures, even at the genomic level.

Proper holomorphic mappings of balanced domains in C-n

We extend a well-known result, about the unit ball, by H. Alexander to a class of balanced domains in . Specifically: we prove that any proper holomorphic self-map of a certain type of balanced, finite-type domain in , is an automorphism. The main novelty of our proof is the use of a recent result of Opshtein on the behaviour of the iterates of holomorphic self-maps of a certain class of domains. We use Opshtein's theorem, together with the tools made available by finiteness of type, to deduce that the aforementioned map is unbranched. The monodromy theorem then delivers the result.

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.

A Polymatroid Approach to Separable Convex Optimization with Linear Ascending Constraints

We revisit a problem studied by Padakandla and Sundaresan SIAM J. Optim., August 2009] on the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation problems in wireless communication settings. It is also a special case of an optimization of a separable convex function over the bases of a specially structured polymatroid. We give an alternative proof of the correctness of the algorithm of Padakandla and Sundaresan. In the process we relax some of their restrictions placed on the objective function.