134 resultados para Half-bound
Resumo:
CONSPECTUS: Curcumin is a polyphenolic species. As an active ingredient of turmeric, it is well-known for its traditional medicinal properties. The therapeutic values include antioxidant, anti-inflammatory, antiseptic, and anticancer activity with the last being primarily due to inhibition of the transcription factor NF-kappa B besides affecting several biological pathways to arrest tumor growth and its progression. Curcumin with all these positive qualities has only remained a potential candidate for cancer treatment over the years without seeing any proper usage because of its hydrolytic instability involving the diketo moiety in a cellular medium and its poor bioavailability. The situation has changed considerably in recent years with the observation that curcumin in monoanionic form could be stabilized on binding to a metal ion. The reports from our group and other groups have shown that curcumin in the metal-bound form retains its therapeutic potential. This has opened up new avenues to develop curcumin-based metal complexes as anticancer agents. Zinc(II) complexes of curcumin are shown to be stable in a cellular medium. They display moderate cytotoxicity against prostate cancer and neuroblastoma cell lines. A similar stabilization and cytotoxic effect is reported for (arene)ruthenium(II) complexes of curcumin against a variety of cell lines. The half-sandwich 1,3,5-triaza-7-phosphatricyclo-3.3.1.1]decane (RAPTA)-type ruthenium(II) complexes of curcumin are shown to be promising cytotoxic agents with low micromolar concentrations for a series of cancer cell lines. In a different approach, cobalt(III) complexes of curcumin are used for its cellular delivery in hypoxic tumor cells using intracellular agents that reduce the metal and release curcumin as a cytotoxin. Utilizing the photophysical and photochemical properties of the curcumin dye, we have designed and synthesized photoactive curcumin metal complexes that are used for cellular imaging by fluorescence microscopy and damaging the cancer cells on photoactivation in visible light while being minimally toxic in darkness. In this Account, we have made an attempt to review the current status of the chemistry of metal curcumin complexes and present results from our recent studies on curcumin complexes showing remarkable in vitro photocytotoxicity. The undesirable dark toxicity of the complexes can be reduced with suitable choice of the metal and the ancillary ligands in a ternary structure. The complexes can be directed to specific subcellular organelles. Selectivity by targeting cancer cells over normal cells can be achieved with suitable ligand design. We expect that this methodology is likely to provide an impetus toward developing curcumin-based photochemotherapeutics for anticancer treatment and cure.
Resumo:
A computational study of the interaction half-sandwich metal fragments (metal=Re/W, electron count=d(6)), containing linear nitrosyl (NO+), carbon monoxide (CO), trifluorophosphine (PF3), N-heterocyclic carbene (NHC) ligands with alkanes are conducted using density functional theory employing the hybrid meta-GGA functional (M06). Electron deficiency on the metal increases with the ligand in the order NHC < CO < PF3 < NO+. Electron-withdrawing ligands like NO+ lead to more stable alkane complexes than NHC, a strong electron donor. Energy decomposition analysis shows that stabilization is due to orbital interaction involving charge transfer from the alkane to the metal. Reactivity and dynamics of the alkane fragment are facilitated by electron donors on the metal. These results match most of the experimental results known for CO and PF3 complexes. The study suggests activation of alkane in metal complexes to be facile with strong donor ligands like NHC. (C) 2015 Wiley Periodicals, Inc.
Resumo:
Kinases are ubiquitous enzymes that are pivotal to many biochemical processes. There are contrasting views on the phosphoryl-transfer mechanism in propionate kinase, an enzyme that reversibly transfers a phosphoryl group from propionyl phosphate to ADP in the final step of non-oxidative catabolism of L-threonine to propionate. Here, X-ray crystal structures of propionate- and nucleotide-bound Salmonella typhimurium propionate kinase are reported at 1.8-2.0 angstrom resolution. Although the mode of nucleotide binding is comparable to those of other members of the ASKHA superfamily, propionate is bound at a distinct site deeper in the hydrophobic pocket defining the active site. The propionate carboxyl is at a distance of approximate to 5 angstrom from the -phosphate of the nucleotide, supporting a direct in-line transfer mechanism. The phosphoryl-transfer reaction is likely to occur via an associative S(N)2-like transition state that involves a pentagonal bipyramidal structure with the axial positions occupied by the nucleophile of the substrate and the O atom between the - and the -phosphates, respectively. The proximity of the strictly conserved His175 and Arg236 to the carboxyl group of the propionate and the -phosphate of ATP suggests their involvement in catalysis. Moreover, ligand binding does not induce global domain movement as reported in some other members of the ASKHA superfamily. Instead, residues Arg86, Asp143 and Pro116-Leu117-His118 that define the active-site pocket move towards the substrate and expel water molecules from the active site. The role of Ala88, previously proposed to be the residue determining substrate specificity, was examined by determining the crystal structures of the propionate-bound Ala88 mutants A88V and A88G. Kinetic analysis and structural data are consistent with a significant role of Ala88 in substrate-specificity determination. The active-site pocket-defining residues Arg86, Asp143 and the Pro116-Leu117-His118 segment are also likely to contribute to substrate specificity.
Resumo:
A lower-bound limit analysis formulation, by using two-dimensional finite elements, the three-dimensional Mohr-Coulomb yield criterion, and nonlinear optimization, has been given to deal with an axisymmetric geomechanics stability problem. The optimization was performed using an interior point method based on the logarithmic barrier function. The yield surface was smoothened (1) by removing the tip singularity at the apex of the pyramid in the meridian plane and (2) by eliminating the stress discontinuities at the corners of the yield hexagon in the pi-plane. The circumferential stress (sigma(theta)) need not be assumed. With the proposed methodology, for a circular footing, the bearing-capacity factors N-c, N-q, and N-gamma for different values of phi have been computed. For phi = 0, the variation of N-c with changes in the factor m, which accounts for a linear increase of cohesion with depth, has been evaluated. Failure patterns for a few cases have also been drawn. The results from the formulation provide a good match with the solutions available from the literature. (C) 2014 American Society of Civil Engineers.
Resumo:
The ultimate bearing capacity of a circular footing, placed over rock mass, is evaluated by using the lower bound theorem of the limit analysis in conjunction with finite elements and nonlinear optimization. The generalized Hoek-Brown (HB) failure criterion, but by keeping a constant value of the exponent, alpha = 0.5, was used. The failure criterion was smoothened both in the meridian and pi planes. The nonlinear optimization was carried out by employing an interior point method based on the logarithmic barrier function. The results for the obtained bearing capacity were presented in a non-dimensional form for different values of GSI, m(i), sigma(ci)/(gamma b) and q/sigma(ci). Failure patterns were also examined for a few cases. For validating the results, computations were also performed for a strip footing as well. The results obtained from the analysis compare well with the data reported in literature. Since the equilibrium conditions are precisely satisfied only at the centroids of the elements, not everywhere in the domain, the obtained lower bound solution will be approximate not true. (C) 2015 Elsevier Ltd. All rights reserved.
Resumo:
This paper presents a lower bound limit analysis approach for solving an axisymmetric stability problem by using the Drucker-Prager (D-P) yield cone in conjunction with finite elements and nonlinear optimization. In principal stress space, the tip of the yield cone has been smoothened by applying the hyperbolic approximation. The nonlinear optimization has been performed by employing an interior point method based on the logarithmic barrier function. A new proposal has also been given to simulate the D-P yield cone with the Mohr-Coulomb hexagonal yield pyramid. For the sake of illustration, bearing capacity factors N-c, N-q and N-gamma have been computed, as a function of phi, both for smooth and rough circular foundations. The results obtained from the analysis compare quite well with the solutions reported from literature.
Resumo:
Bearing capacity factors, N-c, N-q, and N-gamma, for a conical footing are determined by using the lower and upper bound axisymmetric formulation of the limit analysis in combination with finite elements and optimization. These factors are obtained in a bound form for a wide range of the values of cone apex angle (beta) and phi with delta = 0, 0.5 phi, and phi. The bearing capacity factors for a perfectly rough (delta = phi) conical footing generally increase with a decrease in beta. On the contrary, for delta = 0 degrees, the factors N-c and N-q reduce gradually with a decrease in beta. For delta = 0 degrees, the factor N-gamma for phi >= 35 degrees becomes a minimum for beta approximate to 90 degrees. For delta = 0 degrees, N-gamma for phi <= 30 degrees, as in the case of delta = phi, generally reduces with an increase in beta. The failure and nodal velocity patterns are also examined. The results compare well with different numerical solutions and centrifuge tests' data available from the literature.
Resumo:
An in situ study of stress evolution and mechanical behavior of germanium as a lithium-ion battery electrode material is presented. Thin films of germanium are cycled in a half-cell configuration with lithium metal foil as counter/reference electrode, with 1M LiPF6 in ethylene carbonate, diethyl carbonate, dimethyl carbonate solution (1:1:1, wt%) as electrolyte. Real-time stress evolution in the germanium thin-film electrodes during electrochemical lithiation/delithiation is measured by monitoring the substrate curvature using the multi-beam optical sensing method. Upon lithiation a-Ge undergoes extensive plastic deformation, with a peak compressive stress reaching as high as -0.76 +/- 0.05 GPa (mean +/- standard deviation). The compressive stress decreases with lithium concentration reaching a value of approximately -0.3 GPa at the end of lithiation. Upon delithiation the stress quickly became tensile and follows a trend that mirrors the behavior on compressive side; the average peak tensile stress of the lithiated Ge samples was approximately 0.83 GPa. The peak tensile stress data along with the SEM analysis was used to estimate a lower bound fracture resistance of lithiated Ge, which is approximately 5.3 J/m(2). It was also observed that the lithiated Ge is rate sensitive, i.e., stress depends on how fast or slow the charging is carried out. (C) The Author(s) 2015. Published by ECS. This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 License (CC BY, http://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse of the work in any medium, provided the original work is properly cited. All rights reserved.
Resumo:
We show here a 2(Omega(root d.log N)) size lower bound for homogeneous depth four arithmetic formulas. That is, we give an explicit family of polynomials of degree d on N variables (with N = d(3) in our case) with 0, 1-coefficients such that for any representation of a polynomial f in this family of the form f = Sigma(i) Pi(j) Q(ij), where the Q(ij)'s are homogeneous polynomials (recall that a polynomial is said to be homogeneous if all its monomials have the same degree), it must hold that Sigma(i,j) (Number of monomials of Q(ij)) >= 2(Omega(root d.log N)). The above mentioned family, which we refer to as the Nisan-Wigderson design-based family of polynomials, is in the complexity class VNP. Our work builds on the recent lower bound results 1], 2], 3], 4], 5] and yields an improved quantitative bound as compared to the quasi-polynomial lower bound of 6] and the N-Omega(log log (N)) lower bound in the independent work of 7].
Resumo:
Coordination-driven self-assembly of dinuclear half-sandwich p-cymene ruthenium(II) complexes Ru-2(mu-eta(4)-C2O4)(CH3OH)(2)(eta(6)-p-cymene)(2)](O3SCF3)(2) (1a) and Ru-2(mu-eta(4)-C6H2O4)(CH3OH)(2)(eta(6)-p-cymene)(2)](O3SCF3)(2) (1b) separately with imidazole-based tritopic donors (L-1-L-2) in methanol yielded a series of hexanuclear 3+2] trigonal prismatic cages (2-5), respectively L-1 = 1,3,5-tris(imidazole-1-yl) benzene; L-2 = 4,4',4 `'-tris(imidazole-1-yl) triphenylamine]. All the self-assembled cages 2-5 were characterized by various spectroscopic techniques (multinuclear NMR, Infra-red and ESI-MS) and their sizes, shapes were obtained through geometry optimization using molecular mechanics universal force field (MMUFF) computation. Despite the possibility due to the free rotation of donor sites of imidazole ligands, of two different atropoisomeric prismatic cages (C-3h or C-s) and polymeric product, the self-selection of single (C(3)h) conformational isomeric cages as the only product is a noteworthy observation. (C) 2015 Elsevier B.V. All rights reserved.
Resumo:
The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represented as an intersection graph of axis-parallel k-dimensional boxes (respectively k-dimensional unit cubes) and is denoted by box(G) (respectively cub(G)). It was shown by Adiga and Chandran (2010) that for any graph G, cub(G) <= box(G) log(2) alpha(G], where alpha(G) is the maximum size of an independent set in G. In this note we show that cub(G) <= 2 log(2) X (G)] box(G) + X (G) log(2) alpha(G)], where x (G) is the chromatic number of G. This result can provide a much better upper bound than that of Adiga and Chandran for graph classes with bounded chromatic number. For example, for bipartite graphs we obtain cub(G) <= 2(box(G) + log(2) alpha(G)] Moreover, we show that for every positive integer k, there exist graphs with chromatic number k such that for every epsilon > 0, the value given by our upper bound is at most (1 + epsilon) times their cubicity. Thus, our upper bound is almost tight. (c) 2015 Elsevier B.V. All rights reserved.
Resumo:
An efficient density matrix renormalization group (DMRG) algorithm is presented and applied to Y junctions, systems with three arms of n sites that meet at a central site. The accuracy is comparable to DMRG of chains. As in chains, new sites are always bonded to the most recently added sites and the superblock Hamiltonian contains only new or once renormalized operators. Junctions of up to N = 3n + 1 approximate to 500 sites are studied with antiferromagnetic (AF) Heisenberg exchange J between nearest-neighbor spins S or electron transfer t between nearest neighbors in half-filled Hubbard models. Exchange or electron transfer is exclusively between sites in two sublattices with N-A not equal N-B. The ground state (GS) and spin densities rho(r) = < S-r(z)> at site r are quite different for junctions with S = 1/2, 1, 3/2, and 2. The GS has finite total spin S-G = 2S(S) for even (odd) N and for M-G = S-G in the S-G spin manifold, rho(r) > 0(< 0) at sites of the larger (smaller) sublattice. S = 1/2 junctions have delocalized states and decreasing spin densities with increasing N. S = 1 junctions have four localized S-z = 1/2 states at the end of each arm and centered on the junction, consistent with localized states in S = 1 chains with finite Haldane gap. The GS of S = 3/2 or 2 junctions of up to 500 spins is a spin density wave with increased amplitude at the ends of arms or near the junction. Quantum fluctuations completely suppress AF order in S = 1/2 or 1 junctions, as well as in half-filled Hubbard junctions, but reduce rather than suppress AF order in S = 3/2 or 2 junctions.
Resumo:
A discussion has been provided for the comments raised by the discusser (Clausen, 2015)1] on the article recently published by the authors (Chakraborty and Kumar, 2015). The effect of exponent alpha for values of GSI approximately smaller than 30 becomes more critical. On the other hand, for greater values of GSI, the results obtained by the authors earlier remain primarily independent of alpha and can be easily used. (C) 2015 Elsevier Ltd. All rights reserved.
Resumo:
Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.