1-D hydrogen-bonded organization of hexanuclear {3d-4f-5d} complexes: evidence for slow relaxation of the magnetization for [{LMe2Ni(H2O)Ln(H2O)4.5}2{W(CN)8}2] with Ln = Tb and Dy

Heterometallic {3d-4f-5d} aggregates with formula [{LMe2Ni(H2O)Ln(H2O)4.5}2{W(CN)8}2]·15H2O, (LMe2 stands for N,N-2,2-dimethylpropylenedi(3-methoxysalicylideneiminato) Schiff-base ligand) with Ln = Gd, Tb, Dy, have been obtained by reacting bimetallic [LMe2Ni(H2O)2Ln(NO3)3] and Cs3{W(CN)8} in H2O. The hexanuclear complexes are organized in 1-D arrays by means of hydrogen bonds established between the solvent molecules coordinated to Ln and the CN ligands of an octacyanometallate moiety. The X-ray structure was solved for the Tb derivative. Magnetic behavior indicates ferromagnetic {W–Ni} and {Ni–Ln} interactions (JNiW = 18.5 cm-1, JNiGd = 1.85 cm-1) as well as ferromagnetic intermolecular interactions mediated by the H-bonds. Dynamic magnetic susceptibility studies reveal slow magnetic relaxation processes for the Tb and Dy derivatives, suggesting SMM type behavior for these compounds.

Knoevenagel condensation of 2-carbethoxycyclohexanone and malononitrile: Synthesis of 4-cyano-3-ethoxy-1-hydroxy-5,6,7,8-tetrahydroisoquinoline, an isomer of the abnormal product

The structure of the abnormal product 1a formed in the Knoevenagel condensation of 2-carbethoxycyclohexanone and malononitrile has been further confirmed. Oxidation of the tetrahydroisoquinoline 3b using Na2Cr2O-AcOH-H2SO4 gave the keto isoquinoline 3d and the isoquinoline-1-carboxylic acid 5a. The acid chloride of 5a was condensed with diethyl ethoxymagnesiomalonate to afford after decarbethoxylation the methyl ketone 5d which on Baeyer-Villiger oxidation gave a mixture of the acetate 1g and the title compound 1b. The unambiguous synthesis of 1b confirms the structure assigned earlier to the title compound also formed during the partial hydrolysis of the diethoxy compound 1c. Condensation of 2-acetylcyclohexane-1,3-dione with malononitrile gave the quinoline derivative 4c which on ethylation yielded the ketoquinoline 4d. The present studies have confirmed that the quinoline compound 4a is also formed in the condensation of 2-acetylcyclohexanone and cyanoacetamide.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Spin-1 Kitaev model in one dimension

We study a one-dimensional version of the Kitaev model on a ring of size N, in which there is a spin S > 1/2 on each site and the Hamiltonian is J Sigma(nSnSn+1y)-S-x. The cases where S is integer and half-odd integer are qualitatively different. We show that there is a Z(2)-valued conserved quantity W-n for each bond (n, n + 1) of the system. For integer S, the Hilbert space can be decomposed into 2N sectors, of unequal sizes. The number of states in most of the sectors grows as d(N), where d depends on the sector. The largest sector contains the ground state, and for this sector, for S=1, d=(root 5+1)/2. We carry out exact diagonalization for small systems. The extrapolation of our results to large N indicates that the energy gap remains finite in this limit. In the ground-state sector, the system can be mapped to a spin-1/2 model. We develop variational wave functions to study the lowest energy states in the ground state and other sectors. The first excited state of the system is the lowest energy state of a different sector and we estimate its excitation energy. We consider a more general Hamiltonian, adding a term lambda Sigma W-n(n), and show that this has gapless excitations in the range lambda(c)(1)<=lambda <=lambda(c)(2). We use the variational wave functions to study how the ground-state energy and the defect density vary near the two critical points lambda(c)(1) and lambda(c)(2).

Insights into conformational and packing features in a series of aryl substituted ethyl-6-methyl-4-phenyl-2-oxo-1,2,3,4-tetrahydropyrimidine-5-carboxylate

The supramolecular structures of eight aryl protected ethyl-6-methyl-4-phenyl-2-oxo-1,2,3,4-tetrahydropyrimidine- 5-carboxylates have been analyzed to determine the role of different functional groups on the molecular geometry, conformational characteristics and the packing of these molecules in the crystal lattice. Out of these the para fluoro substituted compound on the aryl ring exhibits conformational polymorphism, due to the different conformation of the ester moiety. This behaviour has been characterized using both powder and single-crystal X-ray diffraction, optical microscopy and differential scanning calorimetry performed on both these polymorphs. The compounds pack via the cooperative interplay of strong N-H center dot center dot center dot O=C intermolecular dimers and chains forming a sheet like structure. In addition, weak C-H center dot center dot center dot O=C and C-H center dot center dot center dot pi interactions impart additional stability to the crystal packing.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V(G) and edge set E(C). A k-dimensional box is a Cartesian product of closed intervals a(1), b(1)] x a(2), b(2)] x ... x a(k), b(k)]. The boxicity of G, box(G) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes, i.e. each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset where S is the ground set and P is a reflexive, anti-symmetric and transitive binary relation on S. The dimension of P, dim(P) is the minimum integer l such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with its extended double cover, denoted as G(c). Let P-c be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P-c) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension. In the other direction, using the already known bounds for partial order dimension we get the following: (I) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta) which is an improvement over the best known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0, unless NP=ZPP.

Bi2W1–xCuxO6–x(0.7[less-than-or-eq]x[less-than-or-eq]0.8): a new oxide-ion conductor

Anion-deficient Aurivillius phases of the general formula, Bi2Wi-xCuxO6-2x, possessing orthorhombic/tetragonal Bi2WO6-like structures, have been synthesized by quenching the oxide melts. The tetragonal phase stabilized for the compositions 0.7 less-than-or-equal-to x less-than-or-equal-to 0.8 is a good oxide-ion conductor in the temperature range 500-900 K, the x = 0.7 composition exhibiting the highest conductivity in the series.

Use of running fractal dimension for the analysis of changing patterns in electroencephalograms

Running fractal dimensions were measured on four channels of an electroencephalogram (EEG) recorded from a normal volunteer. The changes in the background activity due to eye closure were clearly differentiated by the fractal method. The compressed spectral array (CSA) and the running fractal dimensions of the EEG showed corresponding changes with respect to change in the background activity. The fractal method was also successful in detecting low amplitude spikes and the changes in the patterns in the EEG. The effects of different window lengths and shifts on the running fractal dimension have also been studied. The utility of fractal method for EEG data compression is highlighted.

13C-1H HSQC Experiment of Probe Molecules Aligned in Thermotropic Liquid Crystals: Sensitivity and Resolution Enhancement in the Indirect Dimension

The spectra of molecules oriented in liquid crystalline media are dominated by partially averaged dipolar couplings. In the 13C–1H HSQC, due to the inefficient hetero-nuclear dipolar decoupling in the indirect dimension, normally carried out by using a π pulse, there is a considerable loss of resolution. Furthermore, in such strongly orienting media the 1H–1H and 13C–1H dipolar couplings leads to fast dephasing of transverse magnetization causing inefficient polarization transfer and hence the loss of sensitivity in the indirect dimension. In this study we have carried out 13C–1H HSQC experiment with efficient polarization transfer from 1H to 13C for molecules aligned in liquid crystalline media. The homonuclear dipolar decoupling using FFLG during the INEPT transfer delays and also during evolution period combined with the π pulse heteronuclear decoupling in the t1 period has been applied. The studies showed a significant reduction in partially averaged dipolar couplings and thereby enhancement in the resolution and sensitivity in the indirect dimension. This has been demonstrated on pyridazine and pyrimidine oriented in the liquid crystal. The two closely resonating carbons in pyrimidine are better resolved in the present study compared to the earlier work [H.S. Vinay Deepak, Anu Joy, N. Suryaprakash, Determination of natural abundance 15N–1H and 13C–1H dipolar couplings of molecules in a strongly orienting media using two-dimensional inverse experiments, Magn. Reson. Chem. 44 (2006) 553–565].

Geometric representations of graphs in low dimension

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (\Delta + 2) \ln n$ dimensions, where $\Delta$ is the maximum degree of G. We also show that $\boxi(G) \le (\Delta + 2) \ln n$ for any graph G. Our bound is tight up to a factor of $\ln n$. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree $\Delta$, we show that for almost all graphs on n vertices, its boxicity is upper bound by $c\cdot(d_{av} + 1) \ln n$ where d_{av} is the average degree and c is a small constant. Also, we show that for any graph G, $\boxi(G) \le \sqrt{8 n d_{av} \ln n}$, which is tight up to a factor of $b \sqrt{\ln n}$ for a constant b.

Low-Complexity Detection in Large-Dimension MIMO-ISI Channels Using Graphical Models

In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov random field (MRF)-based graphical model with pairwise interaction, in conjunction with message damping, and 2) use of factor graph (FG)-based graphical model with Gaussian approximation of interference (GAI). The per-symbol complexities are O(K(2)n(t)(2)) and O(Kn(t)) for the MRF and the FG with GAI approaches, respectively, where K and n(t) denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large Kn(t). From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing Kn(t). Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of M-QAM symbol detection.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

Artemisinin-based combination with curcumin adds a new dimension to malaria therapy

Malaria afflicts 300 million people worldwide, with over a million deaths every year. With no immediate prospect of a vaccine against the disease, drugs are the only choice to treat it. Unfortunately, the parasite has become resistant to most antimalarials, restricting the option to use artemisinins (ARTs) for effective cure. With the use of ARTs as the front-line antimalarials, reports are already available on the possible resistance development to these drugs as well. Therefore, it has become necessary to use ART-based combination therapies to delay emergence of resistance. It is also necessary to discover new pharmacophores to eventually replace ART. Studies in our laboratory have shown that curcumin not only synergizes with ART as an antimalarial to kill the parasite, but is also uniquely able to prime the immune system to protect against parasite recrudescence in the animal model. The results indicate a potential for the use of ART curcumin combination against recrudescence/relapse in falciparum and vivax malaria. In addition, studies have also suggested the use of curcumin as an adjunct therapy against cerebral malaria. In this review we have attempted to highlight these aspects as well as the studies directed to discover new pharmacophores as potential replacements for ART.

Synthesis of benzofuran based 1,3,5-substituted pyrazole derivatives: As a new class of potent antioxidants and antimicrobials-A novel accost to amend biocompatibility

In search for a new antioxidant and antimicrobial agent with improved potency, we synthesized a series of benzofuran based 1,3,5-substituted pyrazole analogues (5a-l) in five step reaction. Initially, o-alkyl derivative of salicyaldehyde readily furnish corresponding 2-acetyl benzofuran 2 in good yield, on treatment with 1,8-diaza bicyclo5.4.0]undec-7-ene (DBU) in the presence of molecular sieves. Further, aldol condensation with vanillin, Claisen-Schmidt condensation reaction with hydrazine hydrate followed by coupling of substituted anilines afforded target compounds. The structures of newly synthesized compounds were confirmed by IR, H-1 NMR, C-13 NMR, mass, elemental analysis and further screened for their antioxidant and antimicrobial activities. Among the tested compounds 5d and 5f exhibited good antioxidant property with 50% inhibitory concentration higher than that of reference while compounds 5h and 5l exhibited good antimicrobial activity at concentration 1.0 and 0.5 mg/mL compared with standard, streptomycin and fluconazole respectively. (C) 2012 Elsevier Ltd. All rights reserved.

Isolated singularities of polyharmonic operator in even dimension

We consider the equation Delta(2)u = g(x, u) >= 0 in the sense of distribution in Omega' = Omega\textbackslash {0} where u and -Delta u >= 0. Then it is known that u solves Delta(2)u = g(x, u) + alpha delta(0) - beta Delta delta(0), for some nonnegative constants alpha and beta. In this paper, we study the existence of singular solutions to Delta(2)u = a(x) f (u) + alpha delta(0) - beta Delta delta(0) in a domain Omega subset of R-4, a is a nonnegative measurable function in some Lebesgue space. If Delta(2)u = a(x) f (u) in Omega', then we find the growth of the nonlinearity f that determines alpha and beta to be 0. In case when alpha = beta = 0, we will establish regularity results when f (t) <= Ce-gamma t, for some C, gamma > 0. This paper extends the work of Soranzo (1997) where the author finds the barrier function in higher dimensions (N >= 5) with a specific weight function a(x) = |x|(sigma). Later, we discuss its analogous generalization for the polyharmonic operator.