Polynomial Approximation, Local Polynomial convexity, and Degenerate CR Singularities- II

We provide some conditions for the graph of a Holder-continuous function on (D) over bar, where (D) over bar is a closed disk in C, to be polynomially convex. Almost all sufficient conditions known to date - provided the function (say F) is smooth - arise from versions of the Weierstrass Approximation Theorem on (D) over bar. These conditions often fail to yield any conclusion if rank(R)DF is not maximal on a sufficiently large subset of (D) over bar. We bypass this difficulty by introducing a technique that relies on the interplay of certain plurisubharmonic functions. This technique also allows us to make some observations on the polynomial hull of a graph in C(2) at an isolated complex tangency.

Curcumin-glucoside, A Novel Synthetic Derivative of Curcumin, Inhibits alpha-Synuclein Oligomer Formation: Relevance to Parkinson's Disease

alpha-Synuclein aggregation is centrally implicated in Parkinson's disease (PD). It involves multi-step nucleated polymerization process via the formation of dimers, soluble toxic oligomers and insoluble fibrils. In the present study, we synthesized a novel compound viz., Curcumin-glucoside (Curc-gluc), a modified form of curcumin and studied its anti-aggregating potential with alpha-synuclein. Under aggregating conditions in vitro, Curc-gluc prevents oligomer formation as well as inhibits fibril formation indicating favorable stoichiometry for inhibition. The binding efficacies of Curc-gluc to both alpha-synuclein monomeric and oligomeric forms were characterized by micro-calorimetry. It was observed that titration of Curc-gluc with alpha-synuclein monomer yielded very low heat values with low binding while, in case of oligomers, Curc-gluc showed significant binding. Addition of Curc-gluc inhibited aggregation in a dose-dependent manner and enhanced alpha-synuclein solubility, which propose that Curc-gluc solubilizes the oligomeric form by disintegrating preformed fibrils and this is a novel observation. Overall, the data suggest that Curc-gluc binds to alpha-synuclein oligomeric form and prevents further fibrillization of alpha-synuclein; this might aid the development of disease modifying agents in preventing or treating PD.

Dithienylcyclopentadienone derivative-co-benzothiadiazole: An alternating copolymer for organic photovoltaics

Alternating copolymer of 7,9-di(thiophen-2-yl)-8H-cyclopenta[a]acenaphthylen-8-one-co-benzothia diazole was synthesized by palladium(0) catalyzed Stille coupling reaction. This solution processable copolymer shows an excellent thermal stability and has a broad absorption range from 300 to 800 nm with a band gap of about 1.51 eV. High LUMO energy level and low band gap of the synthesized copolymers suggest that, this copolymer will be a suitable donor material for use in an organic photovoltaic device. Photovoltaic devices were fabricated from the blend of copolymer and phenyl-C61-butyric acid methyl ester as the active material. (C) 2011 Elsevier By. All rights reserved.

An Online Actor-Critic Algorithm with Function Approximation for Constrained Markov Decision Processes

We develop an online actor-critic reinforcement learning algorithm with function approximation for a problem of control under inequality constraints. We consider the long-run average cost Markov decision process (MDP) framework in which both the objective and the constraint functions are suitable policy-dependent long-run averages of certain sample path functions. The Lagrange multiplier method is used to handle the inequality constraints. We prove the asymptotic almost sure convergence of our algorithm to a locally optimal solution. We also provide the results of numerical experiments on a problem of routing in a multi-stage queueing network with constraints on long-run average queue lengths. We observe that our algorithm exhibits good performance on this setting and converges to a feasible point.

Stabilization of stochastic approximation by step size adaptation

A scheme for stabilizing stochastic approximation iterates by adaptively scaling the step sizes is proposed and analyzed. This scheme leads to the same limiting differential equation as the original scheme and therefore has the same limiting behavior, while avoiding the difficulties associated with projection schemes. The proof technique requires only that the limiting o.d.e. descend a certain Lyapunov function outside an arbitrarily large bounded set. (C) 2012 Elsevier B.V. All rights reserved.

A Rhodanine Derivative CCR-11 Inhibits Bacterial Proliferation by Inhibiting the Assembly and GTPase Activity of FtsZ

A perturbation of FtsZ assembly dynamics has been shown to inhibit bacterial cytokinesis. In this study, the antibacterial activity of 151 rhodanine compounds was assayed using Bacillus subtilis cells. Of 151 compounds, eight strongly inhibited bacterial proliferation at 2 mu M. Subsequently, we used the elongation of B. subtilis cells as a secondary screen to identify potential FtsZ-targeted antibacterial agents. We found that three compounds significantly increased bacterial cell length. One of the three compounds, namely, CCR-11 (E)-2-thioxo-5-({3-(trifluoromethyl)phenyl]furan-2-yl}methylene) thiazolidin-4-one], inhibited the assembly and GTPase activity of FtsZ in vitro. CCR-11 bound to FtsZ with a dissociation constant of 1.5 +/- 0.3 mu M. A docking analysis indicated that CCR-11 may bind to FtsZ in a cavity adjacent to the T7 loop and that short halogen oxygen, H-bonding, and hydrophobic interactions might be important for the binding of CCR-11 with FtsZ. CCR-11 inhibited the proliferation of B. subtilis cells with a half-maximal inhibitory concentration (IC50) of 1.2 +/- 0.2 mu M and a minimal inhibitory concentration of 3 mu M. It also potently inhibited proliferation of Mycobacterium smegmatis cells. Further, CCR-11 perturbed Z-ring formation in B. subtilis cells; however, it neither visibly affected nucleoid segregation nor altered the membrane integrity of the cells. CCR-11 inhibited HeLa cell proliferation with an IC50 value of 18.1 +/- 0.2,mu M (similar to 15 x IC50 of B. subtilis cell proliferation). The results suggested that CCR-11 inhibits bacterial cytokinesis by inhibiting FtsZ assembly, and it can be used as a lead molecule to develop FtsZ-targeted antibacterial agents.

Novel Levamisole Derivative Induces Extrinsic Pathway of Apoptosis in Cancer Cells and Inhibits Tumor Progression in Mice

Background: Levamisole, an imidazo(2,1-b) thiazole derivative, has been reported to be a potential antitumor agent. In the present study, we have investigated the mechanism of action of one of the recently identified analogues, 4a (2-benzyl-6-(4'-fluorophenyl)-5-thiocyanato-imidazo2,1-b]1,3,4]thi adiazole). Materials and Methods: ROS production and expression of various apoptotic proteins were measured following 4a treatment in leukemia cell lines. Tumor animal models were used to evaluate the effect of 4a in comparison with Levamisole on progression of breast adenocarcinoma and survival. Immunohistochemistry and western blotting studies were performed to understand the mechanism of 4a action both ex vivo and in vivo. Results: We have determined the IC50 value of 4a in many leukemic and breast cancer cell lines and found CEM cells most sensitive (IC50 5 mu M). Results showed that 4a treatment leads to the accumulation of ROS. Western blot analysis showed upregulation of pro-apoptotic proteins t-BID and BAX, upon treatment with 4a. Besides, dose-dependent activation of p53 along with FAS, FAS-L, and cleavage of CASPASE-8 suggest that it induces death receptor mediated apoptotic pathway in CEM cells. More importantly, we observed a reduction in tumor growth and significant increase in survival upon oral administration of 4a (20 mg/kg, six doses) in mice. In comparison, 4a was found to be more potent than its parental analogue Levamisole based on both ex vivo and in vivo studies. Further, immunohistochemistry and western blotting studies indicate that 4a treatment led to abrogation of tumor cell proliferation and activation of apoptosis by the extrinsic pathway even in animal models. Conclusion: Thus, our results suggest that 4a could be used as a potent chemotherapeutic agent.

Design and Synthesis of a Functional Derivative of the Triazinium Cation and Its Rhodium Complex that Shows Photoinduced DNA Cleavage Activity and Photocytotoxicity

The design and synthesis of an intensely blue rhodium(III) complex 3]+ of a new N,N-donor ligand, 8-(quinolin-8-ylamino)pyrido2,1-c]1,2,4]benzotriazin-11-ium, 2]+, which contains a planar pendant triazinium arm, is described. Structural characterization for 3]+ was carried out by using various spectroscopic techniques and single-crystal X-ray crystallography. The organometallic rhodium(III) compound shows a ligand-based reversible reduction at 0.65 V. The electrochemically reduced compound displays a single-line EPR spectrum that signifies the formation of ligand-based free radicals. Compound 3]+ shows a binding propensity to calf thymus DNA to give a Kapp value of 6.05X105 M1. The parent triazinium salt, pyrido2,1-c]1,2,4]benzotriazin-11-ium 1]+ and the ligand salt 2]+ exhibit photoinduced cleavage of DNA in UV-A light, whereas the reference Rh complex 3]+ photocleaves DNA with red light (647.1 nm). The compounds show photonuclease activities under both aerobic and anaerobic conditions. Mechanistic investigations under aerobic conditions with several inhibitors indicate the formation of hydroxyl radicals by means of a photoredox pathway. Under anaerobic conditions, it is believed that a photoinduced oxidation of DNA mechanism is operative. Compound 3]+ exhibits photocytotoxicity in HeLa cervical cancer cells to give IC50 values of (12+/-0.9) mu M in UV-A light at 365 nm and (31.4+/-1.1) mu M in the dark.

A constant factor approximation algorithm for boxicity of circular arc graphs

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.

Fast acoustic likelihood computation using low-rank matrix approximation

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for LVCSR systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication.In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on a 1138 word vocabulary RM1 task using Sphinx 3.7 system show that, for a typical case the matrix multiplication approach leads to overall speedup of 46%. Both the low-rank approximation methods increase the speedup to around 60%, with the former method increasing the word error rate (WER) from 3.2% to 6.6%, while the latter increases the WER from 3.2% to 3.5%.

Quadrature approximation properties of the spiral-phase quadrature transform

The notion of the 1-D analytic signal is well understood and has found many applications. At the heart of the analytic signal concept is the Hilbert transform. The problem in extending the concept of analytic signal to higher dimensions is that there is no unique multidimensional definition of the Hilbert transform. Also, the notion of analyticity is not so well under stood in higher dimensions. Of the several 2-D extensions of the Hilbert transform, the spiral-phase quadrature transform or the Riesz transform seems to be the natural extension and has attracted a lot of attention mainly due to its isotropic properties. From the Riesz transform, Larkin et al. constructed a vortex operator, which approximates the quadratures based on asymptotic stationary-phase analysis. In this paper, we show an alternative proof for the quadrature approximation property by invoking the quasi-eigenfunction property of linear, shift-invariant systems. We show that the vortex operator comes up as a natural consequence of applying this property. We also characterize the quadrature approximation error in terms of its energy as well as the peak spatial-domain error. Such results are available for 1-D signals, but their counter part for 2-D signals have not been provided. We also provide simulation results to supplement the analytical calculations.

A fully discrete C-0 interior penalty Galerkin approximation of the extended Fisher-Kolmogorov equation

A fully discrete C-0 interior penalty finite element method is proposed and analyzed for the Extended Fisher-Kolmogorov (EFK) equation u(t) + gamma Delta(2)u - Delta u + u(3) - u = 0 with appropriate initial and boundary conditions, where gamma is a positive constant. We derive a regularity estimate for the solution u of the EFK equation that is explicit in gamma and as a consequence we derive a priori error estimates that are robust in gamma. (C) 2013 Elsevier B.V. All rights reserved.

Clusters of bound particles in the derivative delta-function Bose gas

In this paper we discuss a novel procedure for constructing clusters of bound particles in the case of a quantum integrable derivative delta-function Bose gas in one dimension. It is shown that clusters of bound particles can be constructed for this Bose gas for some special values of the coupling constant, by taking the quasi-momenta associated with the corresponding Bethe state to be equidistant points on a single circle in the complex momentum plane. We also establish a connection between these special values of the coupling constant and some fractions belonging to the Farey sequences in number theory. This connection leads to a classification of the clusters of bound particles associated with the derivative delta-function Bose gas and allows us to study various properties of these clusters like their size and their stability under the variation of the coupling constant. (C) 2013 Elsevier B.V. All rights reserved.

A novel Q-learning algorithm with function approximation for constrained Markov decision processes

We present a novel multi-timescale Q-learning algorithm for average cost control in a Markov decision process subject to multiple inequality constraints. We formulate a relaxed version of this problem through the Lagrange multiplier method. Our algorithm is different from Q-learning in that it updates two parameters - a Q-value parameter and a policy parameter. The Q-value parameter is updated on a slower time scale as compared to the policy parameter. Whereas Q-learning with function approximation can diverge in some cases, our algorithm is seen to be convergent as a result of the aforementioned timescale separation. We show the results of experiments on a problem of constrained routing in a multistage queueing network. Our algorithm is seen to exhibit good performance and the various inequality constraints are seen to be satisfied upon convergence of the algorithm.

Entanglement entropy in higher derivative holography

We consider holographic entanglement entropy in higher derivative gravity theories. Recently Lewkowycz and Maldacena 1] have provided a method to derive the equations for the entangling surface from first principles. We use this method to compute the entangling surface in four derivative gravity. Certain interesting differences compared to the two derivative case are pointed out. For Gauss-Bonnet gravity, we show that in the regime where this method is applicable, the resulting equations coincide with proposals in the literature as well as with what follows from considerations of the stress tensor on the entangling surface. Finally we demonstrate that the area functional in Gauss-Bonnet holography arises as a counterterm needed to make the Euclidean action free of power law divergences.