Further results on geometric properties of a family of relative entropies

This paper extends some geometric properties of a one-parameter family of relative entropies. These arise as redundancies when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the Kullback-Leibler divergence. They satisfy the Pythagorean property and behave like squared distances. This property, which was known for finite alphabet spaces, is now extended for general measure spaces. Existence of projections onto convex and certain closed sets is also established. Our results may have applications in the Rényi entropy maximization rule of statistical physics.

New Insights into Electronic and Geometric Effects in the Enhanced Photoelectrooxidation of Ethanol Using ZnO Nanorod/Ultrathin Au Nanowire Hybrids

Oxidation of small organic molecules in a fuel cell is a viable method for energy production. However, the key issue is the development of suitable catalysts that exhibit high efficiencies and remain stable during operation. Here, we demonstrate that amine-modified ZnO nanorods on which ultrathin Au nanowires are grown act as an excellent catalyst for the oxidation of ethanol. We show that the modification of the ZnO nanorods with oleylamine not only modifies the electronic structure favorably but also serves to anchor the Au nanowires on the nanorods. The adsorption of OH- species on the Au nanowires that is essential for ethanol oxidation is facilitated at much lower potentials as compared to bare Au nanowires leading to high activity. While ZnO shows negligible electrocatalytic activity under normal conditions, there is significant enhancement in the activity under light irradiation. We demonstrate a synergistic enhancement in the photoelectrocatalytic activity of the ZnO/Au nanowire hybrid and provide mechanistic explanation for this enhancement based on both electronic as well as geometric effects. The principles developed are applicable for tuning the properties of other metal/semiconductor hybrids with potentially interesting applications beyond the fuel cell application demonstrated here.

Synthesis, DNA binding, docking and photocleavage studies of quinolinyl chalcones

A series of simple quinoline-chalcone conjugates have been synthesized by Claisen-Schmidt condensation reactions of substituted acetophenones with 2-chloro-3-formyl-quinoline and evaluated for their nucleolytic activity. The structures of the synthesized quinoline-chalcone conjugates were confirmed by IR, H-1 NMR, C-13 NMR and mass spectral analyses. Most of the prepared compounds showed significant DNA binding and photocleavage activities. The incorporation of an electron-donating group into ring A caused a moderate increase in the DNA binding and photocleavage activities. Compounds 3c and 3d exhibited promising DNA photocleavage against pUC 19 DNA with 85% inhibition at 100 mu M concentration. A structure-activity relationship analysis of these compounds was performed; compounds 3c and 3d are potential candidates for future drug discovery and development.

Synthesis, molecular docking and anti-mycobacterial evaluation of new imidazo1,2-a]pyridine-2-carboxamide derivatives

New anti-tubercular agents, imidazo1,2-a]pyridine-2-carboxamide derivatives (5a-q) have been designed and synthesized. The structural considerations of the designed molecules were further supported by the docking study with a long-chain enoyl-acyl carrier protein reductase (InhA). The chemical structures of the new compounds were characterized by IR, H-1 NMR, C-13 NMR, HRMS and elemental analysis. In addition, single crystal X-ray diffraction has also been recorded for compound 5f. Compounds were evaluated in vitro against Mycobacterium tuberculosis H37Rv, and cytotoxicity against HEK-293T cell line. Amongst the tested compounds 5j, 5l and 5q were emerged as good anti-tubercular agents with low cytotoxicity. The structure-anti TB activity relationship of these derivatives was explained by molecular docking. (C) 2014 Elsevier Masson SAS. All rights reserved.

Lower bounds on Ricci flow invariant curvatures and geometric applications

We consider Ricci flow invariant cones C in the space of curvature operators lying between the cones ``nonnegative Ricci curvature'' and ``nonnegative curvature operator''. Assuming some mild control on the scalar curvature of the Ricci flow, we show that if a solution to the Ricci flow has its curvature operator which satisfies R + epsilon I is an element of C at the initial time, then it satisfies R + epsilon I is an element of C on some time interval depending only on the scalar curvature control. This allows us to link Gromov-Hausdorff convergence and Ricci flow convergence when the limit is smooth and R + I is an element of C along the sequence of initial conditions. Another application is a stability result for manifolds whose curvature operator is almost in C. Finally, we study the case where C is contained in the cone of operators whose sectional curvature is nonnegative. This allows us to weaken the assumptions of the previously mentioned applications. In particular, we construct a Ricci flow for a class of (not too) singular Alexandrov spaces.

A note on D1-D5 entropy and geometric quantization

We quantize the space of 2-charge fuzzballs in IIB supergravity on K3. The resulting entropy precisely matches the D1-D5 black hole entropy, including a specific numerical coefficient. A partial match (ie., a smaller coefficient) was found by Rychkov a decade ago using the Lunin-Mathur subclass of solutions - we use a simple observation to generalize his approach to the full moduli space of K3 fuzzballs, filling a small gap in the literature.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

Synthesis, ABTS-Radical Scavenging Activity, and Antiproliferative and Molecular Docking Studies of Novel Pyrrolo1,2-a]quinoline Derivatives

A new 2,2-azinobis-(3-ethylbenzothiazoline-6-sulfonic acid) (ABTS)-radical scavenging and antiproliferative agents of pyrrolo1,2-a]quinoline derivatives have been synthesized. An efficient method for the synthesis of 14 novel diversified pyrrolo1,2-a]quinoline derivatives has been described using 4-(1,3-dioxolan-2-yl)quinoline and different phenacyl bromides in acetone and followed by reacting with different acetylenes in dimethylformamide/K2CO3. The structure of the newly synthesized compounds was determined by infrared, H-1 NMR, C-13 NMR, mass spectrometry, and elemental analysis. The in vitro antioxidant activity revealed that among all the tested compounds 5n exhibited maximum scavenging activity with ABTS. Compound 5b has showed good antiproliferative activity as an inhibitor of epidermal growth factor receptor (EGFR) tyrosine kinase.

Docking, molecular dynamics and QM/MM studies to delineate the mode of binding of CucurbitacinE to F-actin

CucurbitacinE (CurE) has been known to bind covalently to F-actin and inhibit depolymerization. However, the mode of binding of CurE to F-actin and the consequent changes in the F-actin dynamics have not been studied. Through quantum mechanical/molecular mechanical (QM/MM) and density function theory (DFT) simulations after the molecular dynamics (MD) simulations of the docked complex of F-actin and CurE, a detailed transition state (TS) model for the Michael reaction is proposed. The TS model shows nucleophilic attack of the sulphur of Cys257 at the beta-carbon of Michael Acceptor of CurE producing an enol intermediate that forms a covalent bond with CurE. The MD results show a clear difference between the structure of the F-actin in free form and F-actin complexed with CurE. CurE affects the conformation of the nucleotide binding pocket increasing the binding affinity between F-actin and ADP, which in turn could affect the nucleotide exchange. CurE binding also limits the correlated displacement of the relatively flexible domain 1 of F-actin causing the protein to retain a flat structure and to transform into a stable ``tense'' state. This structural transition could inhibit depolymerization of F-actin. In conclusion, CurE allosterically modulates ADP and stabilizes F-actin structure, thereby affecting nucleotide exchange and depolymerization of F-actin. (C) 2015 Elsevier Inc. All rights reserved.

The role of lysine-41 in RNase A catalysis - A quantum chemical study on the active site ligand complex

Several mechanisms have been proposed to explain the action of enzymes at the atomic level. Among them, the recent proposals involving short hydrogen bonds as a step in catalysis by Gerlt and Gassman [1] and proton transfer through low barrier hydrogen bonds (LBHBs) [2, 3] have attracted attention. There are several limitations to experimentally testing such hypotheses, Recent developments in computational methods facilitate the study of active site-ligand complexes to high levels of accuracy, Our previous studies, which involved the docking of the dinucleotide substrate UpA to the active site of RNase A [4, 5], enabled us to obtain a realistic model of the ligand-bound active site of RNase A. From these studies, based on empirical potential functions, we were able to obtain the molecular dynamics averaged coordinates of RNase A, bound to the ligand UpA. A quantum mechanical study is required to investigate the catalytic process which involves the cleavage and formation of covalent bonds. In the present study, we have investigated the strengths of some of the hydrogen bonds between the active site residues of RNase A and UpA at the ab initio quantum chemical level using the molecular dynamics averaged coordinates as the starting point. The 49 atom system and other model systems were optimized at the 3-21G level and the energies of the optimized systems were obtained at the 6-31G* level. The results clearly indicate the strengthening of hydrogen bonds between neutral residues due to the presence of charged species at appropriate positions. Such a strengthening manifests itself in the form of short hydrogen bonds and a low barrier for proton transfer. In the present study, the proton transfer between the 2'-OH of ribose (from the substrate) and the imidazole group from the H12 of RNase A is influenced by K41, which plays a crucial role in strengthening the neutral hydrogen bond, reducing the barrier for proton transfer.

CCD: Connected Component Descriptor for Robust Mosaicing of Camera-Captured Document Images

We propose a robust method for mosaicing of document images using features derived from connected components. Each connected component is described using the Angular Radial Tran. form (ART). To ensure geometric consistency during feature matching, the ART coefficients of a connected component are augmented with those of its two nearest neighbors. The proposed method addresses two critical issues often encountered in correspondence matching: (i) The stability of features and (ii) Robustness against false matches due to the multiple instances of characters in a document image. The use of connected components guarantees a stable localization across images. The augmented features ensure a successful correspondence matching even in the presence of multiple similar regions within the page. We illustrate the effectiveness of the proposed method on camera captured document images exhibiting large variations in viewpoint, illumination and scale.

Functional correlation of bacterial LuxS with their quaternary associations: interface analysis of the structure networks

Background The genome of a wide variety of prokaryotes contains the luxS gene homologue, which encodes for the protein S-ribosylhomocysteinelyase (LuxS). This protein is responsible for the production of the quorum sensing molecule, AI-2 and has been implicated in a variety of functions such as flagellar motility, metabolic regulation, toxin production and even in pathogenicity. A high structural similarity is present in the LuxS structures determined from a few species. In this study, we have modelled the structures from several other species and have investigated their dimer interfaces. We have attempted to correlate the interface features of LuxS with the phenotypic nature of the organisms. Results The protein structure networks (PSN) are constructed and graph theoretical analysis is performed on the structures obtained from X-ray crystallography and on the modelled ones. The interfaces, which are known to contain the active site, are characterized from the PSNs of these homodimeric proteins. The key features presented by the protein interfaces are investigated for the classification of the proteins in relation to their function. From our analysis, structural interface motifs are identified for each class in our dataset, which showed distinctly different pattern at the interface of LuxS for the probiotics and some extremophiles. Our analysis also reveals potential sites of mutation and geometric patterns at the interface that was not evident from conventional sequence alignment studies. Conclusion The structure network approach employed in this study for the analysis of dimeric interfaces in LuxS has brought out certain structural details at the side-chain interaction level, which were elusive from the conventional structure comparison methods. The results from this study provide a better understanding of the relation between the luxS gene and its functional role in the prokaryotes. This study also makes it possible to explore the potential direction towards the design of inhibitors of LuxS and thus towards a wide range of antimicrobials.

Efficient Output-Sensitive Construction of Reeb Graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these critical points in the second step to obtain the Reeb graph. A simplification mechanism based on topological persistence aids in the removal of noise and unimportant features. A radial layout scheme results in a feature-directed drawing of the Reeb graph. Experimental results demonstrate the efficiency of the Reeb graph construction in practice and its applications.