Growth inhibitory, apoptotic and anti-inflammatory activities displayed by a novel modified triterpenoid, cyano enone of methyl boswellates

Triterpenoids are pentacyclic secondary metabolites present in many terrestrial plants. Natural triterpenoids have been reported to exhibit anti-inflammatory and anti-carcinogenic activities. Here, we show that modifications of ring A of boswellic acid (2 cyano, 3 enone) resulted in a highly active growth inhibitory, anti-inflammatory, pro-differentiative and anti-tumour triterpenoid compound called cyano enone of methyl boswellates (CEMB). This compound showed cytotoxic activity on a number of cancer cell lines with IC50 ranging from 0.2 to 0.6 mu M. CEMB inhibits DNA synthesis and induces apoptosis in A549 cell line at 0.25 mu M and 1 mu M concentrations, respectively. CEMB induces adipogenic differentiation in 3T3-L1 cells at a concentration of 0.1 mu M. Finally, administration of CEMB intra-tumourally significantly inhibited the growth of C6 glioma tumour xenograft in immuno-compromised mice. Collectively, these results suggest that CEMB is a very potent anti-tumour compound.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

Study of electrical conduction in polypyrrole by varying the doping level

Electrical conductivity and thermopower are studied in the conducting polymer polypyrrole doped with varying levels of the dopant hexafluoro phosphate (PF6). A single sample is prepared by galvanostatic electrochemical polymerization at -40 degreesC. From this sample, six samples having different dopant levels and correspondingly different conductivity are prepared by dedoping. Low temperature d.c. electrical conductivity measurement shows the metal-insulator transition from fully doped sample to dedoped samples. On the metallic side the data are fitted to the localization-interaction model. In critical regime, it follows the power law. On the insulating side, it is variable range hopping. Thermopower measurements are done in the temperature range 300 K to 20 K. Thermopower is linear for samples on the metallic side and becomes more and more non-linear on the insulating side. It is described using a combination of the linear metallic term and the non-linear hopping term. (C) 2002 Elsevier Science B.V. All rights reserved.

Effect of neodymium (Nd) doping on the dielectric and ferroelectric characteristics of sol-gel derived lead zirconate titanate (53/47) thin films

The results of the studies on the effect of rare earth Nd doping on the phase formation behavior and electrical properties of sol-gel derived Pb-1.05(Zr0.53Ti0.47)O-3 (PZT) thin films are presented. The perovskite phase is obtained up to 5 at. % doping and beyond that pyrochlore phase was found to coexist with the perovskite phase in all the films. The transition temperature of undoped lead zirconate titanate (PZT) film was found to be reduced with Nd doping. The Nd doped films also exhibited typical relaxor-type behavior and a diffuse phase transition, similar to that observed in relaxor materials. The introduction of Nd into the PZT lattice probably introduces disorder in the B site of ABO(3) lattice, which causes the observed dielectric relaxation. Efforts were made to isolate the irreversible component contributions in low field dielectric and high field polarization switching behavior. (C) 2001 American Institute of Physics.

A stereospecific approach to cis-anti-cis triquinanes

A methodology for the synthesis of compounds containing the cis-anti-cis fused triquinane system has been developed starting from tricyclo[5.2. 1.0(2.6)]deca-4,8-dien-3-(exo)ol 6 involving Ireland ester Claisen rearrangement and intramolecular diazo ketone cyclopropanation reactions as key steps.

Efficient statistical modeling for the compression of tree structured intermediate code

We propose a scheme for the compression of tree structured intermediate code consisting of a sequence of trees specified by a regular tree grammar. The scheme is based on arithmetic coding, and the model that works in conjunction with the coder is automatically generated from the syntactical specification of the tree language. Experiments on data sets consisting of intermediate code trees yield compression ratios ranging from 2.5 to 8, for file sizes ranging from 167 bytes to 1 megabyte.

A Low-Complexity, Full-Rate, Full-Diversity 2x2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multipleoutput (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation.Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 × 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations,compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for nonrectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

Tuning of dielectric properties and magnetism of SrTiO(3) by site-specific doping of Mn

Combining experiments with first-principles calculations, we show that site-specific doping of Mn into SrTiO(3) has a decisive influence on the dielectric properties of these doped systems. We find that phonon contributions to the dielectric constant invariably decrease sharply on doping at any site. However, a sizable, random dipolar contribution only for Mn at the Sr site arises from a strong off-centric displacement of Mn in spite of Mn being in a non-d(0) state; this leads to a large dielectric constant at higher temperatures and gives rise to a relaxor ferroelectric behavior at lower temperatures. We also investigate magnetic properties in detail and critically reevaluate the possibility of a true multiglass state in such systems.

Register Allocation and Optimal Spill code Scheduling in Software Pipelined Loops using 0-1 Integer Linear Programming Formulation

In achieving higher instruction level parallelism, software pipelining increases the register pressure in the loop. The usefulness of the generated schedule may be restricted to cases where the register pressure is less than the available number of registers. Spill instructions need to be introduced otherwise. But scheduling these spill instructions in the compact schedule is a difficult task. Several heuristics have been proposed to schedule spill code. These heuristics may generate more spill code than necessary, and scheduling them may necessitate increasing the initiation interval. We model the problem of register allocation with spill code generation and scheduling in software pipelined loops as a 0-1 integer linear program. The formulation minimizes the increase in initiation interval (II) by optimally placing spill code and simultaneously minimizes the amount of spill code produced. To the best of our knowledge, this is the first integrated formulation for register allocation, optimal spill code generation and scheduling for software pipelined loops. The proposed formulation performs better than the existing heuristics by preventing an increase in II in 11.11% of the loops and generating 18.48% less spill code on average among the loops extracted from Perfect Club and SPEC benchmarks with a moderate increase in compilation time.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction

In this second part of a two part series of papers, we construct a new class of Space-Time Block Codes (STBCs) for point-to-point MIMO channel and Distributed STBCs (DSTBCs) for the amplify-and-forward relay channel that give full-diversity with Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC) decoders. The proposed class of STBCs include most of the known full-diversity low complexity PIC/PIC-SIC decodable STBCs as special cases. We also show that a number of known full-diversity PIC/PIC-SIC decodable STBCs that were constructed for the point-topoint MIMO channel can be used as full-diversity PIC/PIC-SIC decodable DSTBCs in relay networks. For the same decoding complexity, the proposed STBCs and DSTBCs achieve higher rates than the known low decoding complexity codes. Simulation results show that the new codes have a better bit error rate performance than the low ML decoding complexity codes available in the literature.