The complete primary structure of a unique mannose/glucose-specific lectin from field bean (Dolichos lab lab)

The complete amino acid sequence of two non identical subunits of the glucose/mannose-specific lectin from Dolichos lab lab (field bean) has been determined by sequential Edman analyses of the intact subunits and peptides derived by enzymatic and chemical cleavage. Peptides were purified by reverse phase high performance liquid chromatography and ion pair chromatography. The D. lab lab lectin is a glycoprotein having two polypeptide chains of 132 and 105 amino acid residues. The amino acid sequence of the D. Lab lab lectin is compared with the various lectins of the family Leguminosae. The D. lab lab lectin is the only species of the tribe Phaseoleae that contains two nonidentical subunits of almost equal size and that shows a specificity to glucose/ mannose. The lectin shows a greater homology to the glucose/mannose specific lectins, especially concanavalin A. The unique subunit architecture of the D. lab lab lectin indicates the presence of new post translational cleavage sites.

Optimal blood glucose regulation of diabetic patients using single network adaptive critics

Diabetes is a long-term disease during which the body's production and use of insulin are impaired, causing glucose concentration level to increase in the bloodstream. Regulating blood glucose levels as close to normal as possible leads to a substantial decrease in long-term complications of diabetes. In this paper, an intelligent online feedback-treatment strategy is presented for the control of blood glucose levels in diabetic patients using single network adaptive critic (SNAC) neural networks (which is based on nonlinear optimal control theory). A recently developed mathematical model of the nonlinear dynamics of glucose and insulin interaction in the blood system has been revised and considered for synthesizing the neural network for feedback control. The idea is to replicate the function of pancreatic insulin, i.e. to have a fairly continuous measurement of blood glucose and a situation-dependent insulin injection to the body using an external device. Detailed studies are carried out to analyze the effectiveness of this adaptive critic-based feedback medication strategy. A comparison study with linear quadratic regulator (LQR) theory shows that the proposed nonlinear approach offers some important advantages such as quicker response, avoidance of hypoglycemia problems, etc. Robustness of the proposed approach is also demonstrated from a large number of simulations considering random initial conditions and parametric uncertainties. Copyright (C) 2009 John Wiley & Sons, Ltd.

Development of specific DNA probes and their usage in the detection of Plasmodium vivax infection in blood

The application of nucleic acid probes, in the detection of pathogenic micro-organisms, has become an integral part of diagnostic technologies. In this study, Plasmodium vivax-specific DNA probes have been identified by carrying out genomic subtractive hybridization. In this approach, the recombinant clones from a P. vivax genomic library are screened with radiolabelled human and P. falciparum DNA. The colonies which react with labelled P. falciparum and human DNA are eliminated and those which do not produce any autoradiographic signal have been subjected to further screening procedures. Three Fl vivax specific DNA probes have been obtained by these repeated screenings. Further analyses indicate that these probes are specific and sensitive enough to detect P. vivax infection in clinical blood samples when used in a non-radioactive DNA hybridization assay. (C) 1995 Academic Press Limited

Synthetic studies directed towards the potent cytotoxic natural product ottelione A: stereoselective construction of the complete framework

A stereoselective strategy for the rapid acquisition of the complete framework (dideoxyottelione A) of the promising cytotoxic agent ottelione A, with four contiguous stereogenic centres on a hydrindane skeleton and a sensitive 4-methylenecyclohex-2-enone functionality, from the readily available Diels-Alder adduct of 1,2,3,4-tetrachloro-5,5-dimethoxycyclopentadiene and norbornadiene, is delineated.

Synthetic studies towards novel terpenic natural products kelsoene and poduran: Construction of the complete 4-5-5-fused tricarbocyclic core

A common synthetic approach to the recently reported sesquiterpene kelsoene 1 and the tetraterpene poduran 5, bearing a novel tricyclo[6.2.0.0(2,6)]decane framework, from commercially available 1,5-COD and leading to the first construction of the carbocyclic core present in these natural products is delineated.

A Complete Characterization of an Optimal Timer Based Selection Scheme

Timer-based mechanisms are often used in several wireless systems to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a function of its local suitability metric. In practice, the best node gets selected successfully only if no other node's timer expires within a `vulnerability' window after its timer expiry. In this paper, we provide a complete closed-form characterization of the optimal metric-to-timer mapping that maximizes the probability of success for any probability distribution function of the metric. The optimal scheme is scalable, distributed, and much better than the popular inverse metric timer mapping. We also develop an asymptotic characterization of the optimal scheme that is elegant and insightful, and accurate even for a small number of nodes.

Tree structure for efficient data mining using rough sets

In data mining, an important goal is to generate an abstraction of the data. Such an abstraction helps in reducing the space and search time requirements of the overall decision making process. Further, it is important that the abstraction is generated from the data with a small number of disk scans. We propose a novel data structure, pattern count tree (PC-tree), that can be built by scanning the database only once. PC-tree is a minimal size complete representation of the data and it can be used to represent dynamic databases with the help of knowledge that is either static or changing. We show that further compactness can be achieved by constructing the PC-tree on segmented patterns. We exploit the flexibility offered by rough sets to realize a rough PC-tree and use it for efficient and effective rough classification. To be consistent with the sizes of the branches of the PC-tree, we use upper and lower approximations of feature sets in a manner different from the conventional rough set theory. We conducted experiments using the proposed classification scheme on a large-scale hand-written digit data set. We use the experimental results to establish the efficacy of the proposed approach. (C) 2002 Elsevier Science B.V. All rights reserved.

Complete 'melting' of charge order in hydrothermally grown Pr0.57Ca0.41Ba0.02MnO3 nanowires

Nanowires of Pr0.57Ca0.41Ba0.02MnO3 (PCBM) (diameter similar to 80-90 nm and length similar to 3.5 mu m) were synthesized by a low reaction temperature hydrothermal method. Single-phase nature of the sample was confirmed by XRD experiments. Scanning electron microscopy (SEM) and transmission electron microscopy (TEM) were used to characterize the morphology and microstructures of the nanowires. While the bulk PCBM is known to exhibit charge order (CO) below 230 K along with a ferromagnetic transition at 110 K, SQUID measurements on the nanowires of PCBM show that the charge order is completely absent and a ferromagnetic transition occurs at 115 K. However, the magnetization in the nanowires is observed to be less compared to that in the bulk. This observation of the complete 'melting' of the charge order in the PCBM nanowires is particularly significant in view of the observation of only a weakening of the CO in the nanowires of Pr0.5Ca0.5MnO3. Electron paramagnetic resonance experiments were also carried out on the PCBM nanowires using an X-band EPR spectrometer. Characteristic differences were observed in the line width of nanowires when compared with that of the bulk.

Selective double quantum resolved correlation experiment for the complete separation of entire proton NMR spectra of enantiomers

The present study reports a two dimensional NMR experiment which separates single quantum spectra of enantiomers from that of a racemic mixture. This is a blend of selective double quantum refocusing, for resolving couplings and chemical shift interactions along two dimensions followed by correlation of the selectively excited protons to the entire coupled spin network. The concept is solely based on the presence of distinct intra methyl dipolar couplings of different enantiomers when dissolved in chiral orienting media. The analysis of single enantiomer spectrum obtained from respective F-2 cross sections yield all the spectral information. (C) 2011 Elsevier Inc. All rights reserved.

A Unique Modification of the Eukaryotic Initiation Factor 5A Shows the Presence of the Complete Hypusine Pathway in Leishmania donovani

Deoxyhypusine hydroxylase (DOHH) catalyzes the final step in the post-translational synthesis of an unusual amino acid hypusine (N-(sic)-(4-amino-2-hydroxybutyl) lysine), which is present on only one cellular protein, eukaryotic initiation factor 5A (eIF5A). We present here the molecular and structural basis of the function of DOHH from the protozoan parasite, Leishmania donovani, which causes visceral leishmaniasis. The L. donovani DOHH gene is 981 bp and encodes a putative polypeptide of 326 amino acids. DOHH is a HEAT-repeat protein with eight tandem repeats of alpha-helical pairs. Four conserved histidine-glutamate sequences have been identified that may act as metal coordination sites. A similar to 42 kDa recombinant protein with a His-tag was obtained by heterologous expression of DOHH in Escherichia coli. Purified recombinant DOHH effectively catalyzed the hydroxylation of the intermediate, eIF5A-deoxyhypusine (eIF5A-Dhp), in vitro. L. donovani DOHH (LdDOHH) showed similar to 40.6% sequence identity with its human homolog. The alignment of L. donovani DOHH with the human homolog shows that there are two significant insertions in the former, corresponding to the alignment positions 159-162 (four amino acid residues) and 174-183 (ten amino acid residues) which are present in the variable loop connecting the N- and C-terminal halves of the protein, the latter being present near the substrate binding site. Deletion of the ten-amino-acid-long insertion decreased LdDOHH activity to 14% of the wild type recombinant LdDOHH. Metal chelators like ciclopirox olamine (CPX) and mimosine significantly inhibited the growth of L. donovani and DOHH activity in vitro. These inhibitors were more effective against the parasite enzyme than the human enzyme. This report, for the first time, confirms the presence of a complete hypusine pathway in a kinetoplastid unlike eubacteria and archaea. The structural differences between the L. donovani DOHH and the human homolog may be exploited for structure based design of selective inhibitors against the parasite.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

Relative roles of instruction count and cycles per instruction in WCET estimation

Most of the existing WCET estimation methods directly estimate execution time, ET, in cycles. We propose to study ET as a product of two factors, ET = IC * CPI, where IC is instruction count and CPI is cycles per instruction. Considering directly the estimation of ET may lead to a highly pessimistic estimate since implicitly these methods may be using worst case IC and worst case CPI. We hypothesize that there exists a functional relationship between CPI and IC such that CPI=f(IC). This is ascertained by computing the covariance matrix and studying the scatter plots of CPI versus IC. IC and CPI values are obtained by running benchmarks with a large number of inputs using the cycle accurate architectural simulator, Simplescalar on two different architectures. It is shown that the benchmarks can be grouped into different classes based on the CPI versus IC relationship. For some benchmarks like FFT, FIR etc., both IC and CPI are almost a constant irrespective of the input. There are other benchmarks that exhibit a direct or an inverse relationship between CPI and IC. In such a case, one can predict CPI for a given IC as CPI=f(IC). We derive the theoretical worst case IC for a program, denoted as SWIC, using integer linear programming(ILP) and estimate WCET as SWIC*f(SWIC). However, if CPI decreases sharply with IC then measured maximum cycles is observed to be a better estimate. For certain other benchmarks, it is observed that the CPI versus IC relationship is either random or CPI remains constant with varying IC. In such cases, WCET is estimated as the product of SWIC and measured maximum CPI. It is observed that use of the proposed method results in tighter WCET estimates than Chronos, a static WCET analyzer, for most benchmarks for the two architectures considered in this paper.

Border basis detection is NP-complete

Border basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to some order ideal. The motivation for this problem comes from a similar problem related to Grobner bases termed as Grobner basis detection (GBD) which was proposed by Gritzmann and Sturmfels (1993). GBD was shown to be NP-hard by Sturmfels and Wiegelmann (1996). In this paper, we investigate the computational complexity of BBD and show that it is NP-complete.