Heat shock protein 90 as a potential drug target against surra

Trypanosomiasis is caused by Trypanosoma species which affect both human and animal populations and pose a major threat to developing countries. The incidence of animal trypanosomiasis is on the rise. Surra is a type of animal trypanosomiasis, caused by Trypanosoma evansi, and has been included in priority list B of significant diseases by the World Organization of Animal Health (OIE). Control of surra has been a challenge due to the lack of effective drugs and vaccines and emergence of resistance towards existing drugs. Our laboratory has previously implicated Heat shock protein 90 (Hsp90) from protozoan parasites as a potential drug target and successfully demonstrated efficacy of an Hsp90 inhibitor in cell culture as well as a pre-clinical mouse model of trypanosomiasis. This article explores the role of Hsp90 in the Trypanosoma life cycle and its potential as a drug target. It appears plausible that the repertoire of Hsp90 inhibitors available in academia and industry may have value for treatment of surra and other animal trypanosomiasis.

A framework for post-silicon realization of arbitrary instruction extensions on reconfigurable data-paths

In this paper we present a framework for realizing arbitrary instruction set extensions (IE) that are identified post-silicon. The proposed framework has two components viz., an IE synthesis methodology and the architecture of a reconfigurable data-path for realization of the such IEs. The IE synthesis methodology ensures maximal utilization of resources on the reconfigurable data-path. In this context we present the techniques used to realize IEs for applications that demand high throughput or those that must process data streams. The reconfigurable hardware called HyperCell comprises a reconfigurable execution fabric. The fabric is a collection of interconnected compute units. A typical use case of HyperCell is where it acts as a co-processor with a host and accelerates execution of IEs that are defined post-silicon. We demonstrate the effectiveness of our approach by evaluating the performance of some well-known integer kernels that are realized as IEs on HyperCell. Our methodology for realizing IEs through HyperCells permits overlapping of potentially all memory transactions with computations. We show significant improvement in performance for streaming applications over general purpose processor based solutions, by fully pipelining the data-path. (C) 2014 Elsevier B.V. All rights reserved.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q >= 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Formulation of nanotized curcumin and demonstration of its antimalarial efficacy

Aim: The present study was conducted to overcome the disadvantages associated with the poor water solubility and low bioavailability of curcumin by synthesizing nanotized curcumin and demonstrating its efficacy in treating malaria. Materials and methods: Nanotized curcumin was prepared by a modified emulsion-diffusion-evaporation method and was characterized by means of transmission electron microscopy, atomic force microscopy, dynamic light scattering, Zetasizer, Fourier transform infrared spectroscopy, and differential thermal analysis. The novelty of the prepared nanoformulation lies in the fact that it was devoid of any polymeric matrices used in conventional carriers. The antimalarial efficacy of the prepared nanotized curcumin was then checked both in vitro and in vivo. Results: The nanopreparation was found to be non-toxic and had a particle size distribution of 20-50 nm along with improved aqueous dispersibility and an entrapment efficiency of 45%. Nanotized curcumin (half maximal inhibitory concentration IC50]: 0.5 mu M) was also found to be ten-fold more effective for growth inhibition of Plasmodium falciparum in vitro as compared to its native counterpart (IC50: 5 mu M). Oral bioavailability of nanotized curcumin was found to be superior to that of its native counterpart. Moreover, when Plasmodium berghei-infected mice were orally treated with nanotized curcumin, it prolonged their survival by more than 2 months with complete clearance of parasites in comparison to the untreated animals, which survived for 8 days only. Conclusion: Nanotized curcumin holds a considerable promise in therapeutics as demonstrated here for treating malaria as a test system.

Polynomial Decompositions in Polynomial Time

Fix a prime p. Given a positive integer k, a vector of positive integers Delta = (Delta(1), Delta(2), ... , Delta(k)) and a function Gamma : F-p(k) -> F-p, we say that a function P : F-p(n) -> F-p is (k, Delta, Gamma)-structured if there exist polynomials P-1, P-2, ..., P-k : F-p(n) -> F-p with each deg(P-i) <= Delta(i) such that for all x is an element of F-p(n), P(x) = Gamma(P-1(x), P-2(x), ..., P-k(x)). For instance, an n-variate polynomial over the field Fp of total degree d factors nontrivially exactly when it is (2, (d - 1, d - 1), prod)- structured where prod(a, b) = a . b. We show that if p > d, then for any fixed k, Delta, Gamma, we can decide whether a given polynomial P(x(1), x(2), ..., x(n)) of degree d is (k, Delta, Gamma)-structured and if so, find a witnessing decomposition. The algorithm takes poly(n) time. Our approach is based on higher-order Fourier analysis.

Histone H3K9 acetylation level modulates gene expression and may affect parasite growth in human malaria parasite Plasmodium falciparum

Three-dimensional positioning of the nuclear genome plays an important role in the epigenetic regulation of genes. Although nucleographic domain compartmentalization in the regulation of epigenetic state and gene expression is well established in higher organisms, it remains poorly understood in the pathogenic parasite Plasmodium falciparum. In the present study, we report that two histone tail modifications, H3K9Ac and H3K14Ac, are differentially distributed in the parasite nucleus. We find colocalization of active gene promoters such as Tu1 (tubulin-1 expressed in the asexual stages) with H3K9Ac marks at the nuclear periphery. By contrast, asexual stage inactive gene promoters such as Pfg27 (gametocyte marker) and Pfs28 (ookinete marker) occupy H3K9Ac devoid zones at the nuclear periphery. The histone H3K9 is predominantly acetylated by the PCAF/GCN5 class of lysine acetyltransferases, which is well characterized in the parasite. Interestingly, embelin, a specific inhibitor of PCAF/GCN5 family histone acetyltransferase, selectively decreases total H3K9Ac acetylation levels (but not H3K14Ac levels) around the var gene promoters, leading to the downregulation of var gene expression, suggesting interplay among histone acetylation status, as well as subnuclear compartmentalization of different genes and their activation in the parasites. Finally, we found that embelin inhibited parasitic growth at the low micromolar range, raising the possibility of using histone acetyltransferases as a target for antimalarial therapy.

Plasmodium berghei glycine cleavage system T-protein is non-essential for parasite survival in vertebrate and invertebrate hosts

T-protein, an aminomethyltransferase, represents one of the four components of glycine cleavage system (GCS) and catalyzes the transfer of methylene group from H-protein intermediate to tetrahydrofolate (THF) forming N-5, N-10-methylene THF (CH2-THF) with the release of ammonia. The malaria parasite genome encodes T-, H- and L-proteins, but not P-protein which is a glycine decarboxylase generating the aminomethylene group. A putative GCS has been considered to be functional in the parasite mitochondrion despite the absence of a detectable P-protein homologue. In the present study, the mitochondrial localization of T-protein in the malaria parasite was confirmed by immunofluorescence and its essentiality in the entire parasite life cycle was studied by targeting the T-protein locus in Plasmodium berghei (Pb). PbT knock out parasites did not show any growth defect in asexual, sexual and liver stages indicating that the T-protein is dispensable for parasite survival in vertebrate and invertebrate hosts. The absence of P-protein homologue and the non-essentiality of T protein suggest the possible redundancy of GCS activity in the malaria parasite. Nevertheless, the H- and L-proteins of GCS could be essential for malaria parasite because of their involvement in alpha-lcetoacid dehydrogenase reactions. (C) 2014 Elsevier B.V. All rights reserved.

An Algorithmic Characterization of Polynomial Functions over Z(pn)

In this paper we consider polynomial representability of functions defined over , where p is a prime and n is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to determine whether a given function over is polynomially representable or not, and (ii) finds the polynomial if it is polynomially representable. The previous characterizations given by Kempner (Trans. Am. Math. Soc. 22(2):240-266, 1921) and Carlitz (Acta Arith. 9(1), 67-78, 1964) are existential in nature and only lead to an exhaustive search method, i.e. algorithm with complexity exponential in size of the input. Our characterization leads to an algorithm whose running time is linear in size of input. We also extend our result to the multivariate case.

Multivariate juggling probabilities

We consider refined versions of Markov chains related to juggling introduced by Warrington. We further generalize the construction to juggling with arbitrary heights as well as infinitely many balls, which are expressed more succinctly in terms of Markov chains on integer partitions. In all cases, we give explicit product formulas for the stationary probabilities. The normalization factor in one case can be explicitly written as a homogeneous symmetric polynomial. We also refine and generalize enriched Markov chains on set partitions. Lastly, we prove that in one case, the stationary distribution is attained in bounded time.

Lower bounds for testing triangle-freeness in Boolean functions

Given a Boolean function , we say a triple (x, y, x + y) is a triangle in f if . A triangle-free function contains no triangle. If f differs from every triangle-free function on at least points, then f is said to be -far from triangle-free. In this work, we analyze the query complexity of testers that, with constant probability, distinguish triangle-free functions from those -far from triangle-free. Let the canonical tester for triangle-freeness denotes the algorithm that repeatedly picks x and y uniformly and independently at random from , queries f(x), f(y) and f(x + y), and checks whether f(x) = f(y) = f(x + y) = 1. Green showed that the canonical tester rejects functions -far from triangle-free with constant probability if its query complexity is a tower of 2's whose height is polynomial in . Fox later improved the height of the tower in Green's upper bound to . A trivial lower bound of on the query complexity is immediate. In this paper, we give the first non-trivial lower bound for the number of queries needed. We show that, for every small enough , there exists an integer such that for all there exists a function depending on all n variables which is -far from being triangle-free and requires queries for the canonical tester. We also show that the query complexity of any general (possibly adaptive) one-sided tester for triangle-freeness is at least square root of the query complexity of the corresponding canonical tester. Consequently, this means that any one-sided tester for triangle-freeness must make at least queries.

A Statistical Model of Current Loops and Magnetic Monopoles

We formulate a natural model of loops and isolated vertices for arbitrary planar graphs, which we call the monopole-dimer model. We show that the partition function of this model can be expressed as a determinant. We then extend the method of Kasteleyn and Temperley-Fisher to calculate the partition function exactly in the case of rectangular grids. This partition function turns out to be a square of a polynomial with positive integer coefficients when the grid lengths are even. Finally, we analyse this formula in the infinite volume limit and show that the local monopole density, free energy and entropy can be expressed in terms of well-known elliptic functions. Our technique is a novel determinantal formula for the partition function of a model of isolated vertices and loops for arbitrary graphs.

Dynamics of Cricket Sound Production

The clever designs of natural transducers are a great source of inspiration for man-made systems. At small length scales, there are many transducers in nature that we are now beginning to understand and learn from. Here, we present an example of such a transducer that is used by field crickets to produce their characteristic song. This transducer uses two distinct components-a file of discrete teeth and a plectrum that engages intermittently to produce a series of impulses forming the loading, and an approximately triangular membrane, called the harp, that acts as a resonator and vibrates in response to the impulse-train loading. The file-and-plectrum act as a frequency multiplier taking the low wing beat frequency as the input and converting it into an impulse-train of sufficiently high frequency close to the resonant frequency of the harp. The forced vibration response results in beats producing the characteristic sound of the cricket song. With careful measurements of the harp geometry and experimental measurements of its mechanical properties (Young's modulus determined from nanoindentation tests), we construct a finite element (FE) model of the harp and carry out modal analysis to determine its natural frequency. We fine tune the model with appropriate elastic boundary conditions to match the natural frequency of the harp of a particular species-Gryllus bimaculatus. We model impulsive loading based on a loading scheme reported in literature and predict the transient response of the harp. We show that the harp indeed produces beats and its frequency content matches closely that of the recorded song. Subsequently, we use our FE model to show that the natural design is quite robust to perturbations in the file. The characteristic song frequency produced is unaffected by variations in the spacing of file-teeth and even by larger gaps. Based on the understanding of how this natural transducer works, one can design and fabricate efficient microscale acoustic devices such as microelectromechanical systems (MEMS) loudspeakers.

A Zero-Crossing Rate Property of Power Complementary Analysis Filterbank Outputs

We establish zero-crossing rate (ZCR) relations between the input and the subbands of a maximally decimated M-channel power complementary analysis filterbank when the input is a stationary Gaussian process. The ZCR at lag is defined as the number of sign changes between the samples of a sequence and its 1-sample shifted version, normalized by the sequence length. We derive the relationship between the ZCR of the Gaussian process at lags that are integer multiples of Al and the subband ZCRs. Based on this result, we propose a robust iterative autocorrelation estimator for a signal consisting of a sum of sinusoids of fixed amplitudes and uniformly distributed random phases. Simulation results show that the performance of the proposed estimator is better than the sample autocorrelation over the SNR range of -6 to 15 dB. Validation on a segment of a trumpet signal showed similar performance gains.