Studies on the target conditioning for deposition of $LiCoO_{2}$ films

Deposition of good quality thin films of Lithium Cobalt Oxide (LiCoO2), by sputtering is preceded by target conditioning, which dictates the surface composition, morphology and electrochemical performance of the deposited film. Sputtering from a Virgin target surface, results in films with excess of the more reactive elements. The concentration of these reactive elements in the films decreases until the system reaches a steady state after sufficient sputtering from the target. This paper discusses the deposition kinetics in terms of target conditioning of LiCoO2. The composition, morphology and texturing of deposited film during various hours of sputtering were analyzed using X-ray photoelectron Spectroscopy (XPS) and Field Emission Scanning electron microscopy (FESEM). The compositional stability is not observed in the films formed during the initial hours or Sputtering from the fresh target, which becomes stable after several hours of sputtering. The Li and Co concentration in the Films deposited subsequently is found to be varying and possible causes are discussed. After the compositional stability is reached, electrochemical analysis of LiCoO2 thin films was performed, which shows a discharge capacity of 129 mu Ah/cm(2).

targetTB: A target identification pipeline for Mycobacterium tuberculosis through an interactome, reactome and genome-scale structural analysis

Background: Tuberculosis still remains one of the largest killer infectious diseases, warranting the identification of newer targets and drugs. Identification and validation of appropriate targets for designing drugs are critical steps in drug discovery, which are at present major bottle-necks. A majority of drugs in current clinical use for many diseases have been designed without the knowledge of the targets, perhaps because standard methodologies to identify such targets in a high-throughput fashion do not really exist. With different kinds of 'omics' data that are now available, computational approaches can be powerful means of obtaining short-lists of possible targets for further experimental validation. Results: We report a comprehensive in silico target identification pipeline, targetTB, for Mycobacterium tuberculosis. The pipeline incorporates a network analysis of the protein-protein interactome, a flux balance analysis of the reactome, experimentally derived phenotype essentiality data, sequence analyses and a structural assessment of targetability, using novel algorithms recently developed by us. Using flux balance analysis and network analysis, proteins critical for survival of M. tuberculosis are first identified, followed by comparative genomics with the host, finally incorporating a novel structural analysis of the binding sites to assess the feasibility of a protein as a target. Further analyses include correlation with expression data and non-similarity to gut flora proteins as well as 'anti-targets' in the host, leading to the identification of 451 high-confidence targets. Through phylogenetic profiling against 228 pathogen genomes, shortlisted targets have been further explored to identify broad-spectrum antibiotic targets, while also identifying those specific to tuberculosis. Targets that address mycobacterial persistence and drug resistance mechanisms are also analysed. Conclusion: The pipeline developed provides rational schema for drug target identification that are likely to have high rates of success, which is expected to save enormous amounts of money, resources and time in the drug discovery process. A thorough comparison with previously suggested targets in the literature demonstrates the usefulness of the integrated approach used in our study, highlighting the importance of systems-level analyses in particular. The method has the potential to be used as a general strategy for target identification and validation and hence significantly impact most drug discovery programmes.

An Algorithm for Tracking a Maneuvering Target in Clutter

We consider the problem of tracking a maneuvering target in clutter. In such an environment, missed detections and false alarms make it impossible to decide, with certainty, the origin of received echoes. Processing radar returns in cluttered environments consists of three functions: 1) target detection and plot formation, 2) plot-to-track association, and 3) track updating. Two inadequacies of the present approaches are 1) Optimization of detection characteristics have not been considered and 2) features that can be used in the plot-to-track correlation process are restricted to a specific class. This paper presents a new approach to overcome these limitations. This approach facilitates tracking of a maneuvering target in clutter and improves tracking performance for weak targets.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. An interval graph is a graph that can be represented as the intersection of intervals on the real line - i. e., the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.

Interval Data Classification under Partial Information: A Chance-Constraint Approach

This paper presents a Chance-constraint Programming approach for constructing maximum-margin classifiers which are robust to interval-valued uncertainty in training examples. The methodology ensures that uncertain examples are classified correctly with high probability by employing chance-constraints. The main contribution of the paper is to pose the resultant optimization problem as a Second Order Cone Program by using large deviation inequalities, due to Bernstein. Apart from support and mean of the uncertain examples these Bernstein based relaxations make no further assumptions on the underlying uncertainty. Classifiers built using the proposed approach are less conservative, yield higher margins and hence are expected to generalize better than existing methods. Experimental results on synthetic and real-world datasets show that the proposed classifiers are better equipped to handle interval-valued uncertainty than state-of-the-art.

Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems

An error-free computational approach is employed for finding the integer solution to a system of linear equations, using finite-field arithmetic. This approach is also extended to find the optimum solution for linear inequalities such as those arising in interval linear programming probloms.

Launch Envelope Optimization of Virtual Sliding Target Guidance Scheme

This paper presents an optimization of the performance of a recently proposed virtual sliding target (VST) guidance scheme in terms of maximization of its launch envelope for three- dimensional (3-D) engagements. The objective is to obtain the launch envelope of the missile using the VST guidance scheme for different lateral launch angles with respect to the line of sight (LOS) and demonstrate its superiority over kinematics-based guidance laws like proportional navigation (PN). The VST scheme uses PN as its basic guidance scheme and exploits the relation between the atmospheric properties, missile aerodynamic characteristics, and the optimal trajectory of the missile. The missile trajectory is shaped by controlling the instantaneous position and the speed of a virtual target which the missile pursues during the midcourse phase. In the proposed method it is shown that an appropriate value of initial position for the virtual target in 3-D, combined with optimized virtual target parameters, can significantly improve the launch envelope performance. The paper presents the formulation of the optimization problem, obtains the approximate models used to make the optimization problem more tractable, and finally presents the optimized performance of the missile in terms of launch envelope and shows significant improvement over kinematic-based guidance laws. The paper also proposes modification to the basic VST scheme. Some simulations using the full-fledged six degrees-of-freedom (6-DOF) models are also presented to validate the models and technique used.

Computational systems approach for drug target discovery

Importance of the field: The shift in focus from ligand based design approaches to target based discovery over the last two to three decades has been a major milestone in drug discovery research. Currently, it is witnessing another major paradigm shift by leaning towards the holistic systems based approaches rather the reductionist single molecule based methods. The effect of this new trend is likely to be felt strongly in terms of new strategies for therapeutic intervention, new targets individually and in combinations, and design of specific and safer drugs. Computational modeling and simulation form important constituents of new-age biology because they are essential to comprehend the large-scale data generated by high-throughput experiments and to generate hypotheses, which are typically iterated with experimental validation. Areas covered in this review: This review focuses on the repertoire of systems-level computational approaches currently available for target identification. The review starts with a discussion on levels of abstraction of biological systems and describes different modeling methodologies that are available for this purpose. The review then focuses on how such modeling and simulations can be applied for drug target discovery. Finally, it discusses methods for studying other important issues such as understanding targetability, identifying target combinations and predicting drug resistance, and considering them during the target identification stage itself. What the reader will gain: The reader will get an account of the various approaches for target discovery and the need for systems approaches, followed by an overview of the different modeling and simulation approaches that have been developed. An idea of the promise and limitations of the various approaches and perspectives for future development will also be obtained. Take home message: Systems thinking has now come of age enabling a `bird's eye view' of the biological systems under study, at the same time allowing us to `zoom in', where necessary, for a detailed description of individual components. A number of different methods available for computational modeling and simulation of biological systems can be used effectively for drug target discovery.

Target reliability based design optimization of anchored cantilever sheet pile walls

In this study, the stability of anchored cantilever sheet pile wall in sandy soils is investigated using reliability analysis. Targeted stability is formulated as an optimization problem in the framework of an inverse first order reliability method. A sensitivity analysis is conducted to investigate the effect of parameters influencing the stability of sheet pile wall. Backfill soil properties, soil - steel pile interface friction angle, depth of the water table from the top of the sheet pile wall, total depth of embedment below the dredge line, yield strength of steel, section modulus of steel sheet pile, and anchor pull are all treated as random variables. The sheet pile wall system is modeled as a series of failure mode combination. Penetration depth, anchor pull, and section modulus are calculated for various target component and system reliability indices based on three limit states. These are: rotational failure about the position of the anchor rod, expressed in terms of moment ratio; sliding failure mode, expressed in terms of force ratio; and flexural failure of the steel sheet pile wall, expressed in terms of the section modulus ratio. An attempt is made to propose reliability based design charts considering the failure criteria as well as the variability in the parameters. The results of the study are compared with studies in the literature.

Evidence for an association with type 2 diabetes mellitus at the PPARG locus in a South Indian population

Peroxisome proliferator activated receptor-gamma 2 (PPARG2) is a nuclear hormone receptor of ligand-dependent ranscription factor involved in adipogenesis and a molecular target of the insulin sensitizers thiazolidinediones. We addressed the question of whether the 3 variants (-1279G/A, Pro12Ala, and His478His) in the PPARG2 gene are associated with type 2 diabetes mellitus and its related traits in a South Indian population. The study subjects (1000 type 2 diabetes mellitus and 1000 normal glucose-tolerant subjects) were chosen randomly from the Chennai Urban Rural Epidemiology Study, an ongoing population-based study in southern India. The variants were screened by single-stranded conformational variant, direct sequencing, and restriction fragment length polymorphism. Linkage disequilibrium was estimated from the estimates of haplotypic frequencies. The -1279G/A, Pro12Ala, and His478His variants of the PPARG2 gene were not associated with type 2 diabetes mellitus. However, the 2-loci analyses showed that, in the presence of Pro/Pro genotype of the Pro12Ala variant, the -1279G/A promoter variant showed increased susceptibility to type 2 diabetes mellitus (odds ratio, 2.092; 95% confidence interval, 1.22-3.59; P = .008), whereas in the presence of 12Ala allele, the -1279G/A showed a protective effect against type 2 diabetes mellitus (odds ratio, 0.270; 95% confidence interval, 0.15-0.49; P < .0001). The 3-loci haplotype analysis showed that the A-Ala-T (-1279G/A-Pro12Ala-His478His) haplotype was associated with a reduced risk of type 2 diabetes mellitus (P < .0001). Although our data indicate that the PPARG2 gene variants, independently, have no association with type 2 diabetes mellitus, the 2-loci genotype analysis involving -1279G/A and Pro12Ala variants and the 3-loci haplotype analysis have shown a significant association with type 2 diabetes mellitus in this South Indian population. (C) 2010 Elsevier Inc. All rights reserved.

Diversity of DNA methyltransferases that recognize asymmetric target sequences

DNA methyltransferases (MTases) are a group of enzymes that catalyze the methyl group transfer from S-adenosyl-L-methionine in a sequence-specific manner. Orthodox Type II DNA MTases usually recognize palindromic DNA sequences and add a methyl group to the target base (either adenine or cytosine) on both strands. However, there are a number of MTases that recognize asymmetric target sequences and differ in their subunit organization. In a bacterial cell, after each round of replication, the substrate for any MTase is hemimethylated DNA, and it therefore needs only a single methylation event to restore the fully methylated state. This is in consistent with the fact that most of the DNA MTases studied exist as monomers in solution. Multiple lines of evidence suggest that some DNA MTases function as dimers. Further, functional analysis of many restriction-modification systems showed the presence of more than one or fused MTase genes. It was proposed that presence of two MTases responsible for the recognition and methylation of asymmetric sequences would protect the nascent strands generated during DNA replication from cognate restriction endonuclease. In this review, MTases recognizing asymmetric sequences have been grouped into different subgroups based on their unique properties. Detailed characterization of these unusual MTases would help in better understanding of their specific biological roles and mechanisms of action. The rapid progress made by the genome sequencing of bacteria and archaea may accelerate the identification and study of species- and strain-specific MTases of host-adapted bacteria and their roles in pathogenic mechanisms.

Diversity of DNA methyltransferases that recognize asymmetric target sequences

DNA methyltransferases (MTases) are a group of enzymes that catalyze the methyl group transfer from S-adenosyl-L-methionine in a sequence-specific manner. Orthodox Type II DNA MTases usually recognize palindromic DNA sequences and add a methyl group to the target base (either adenine or cytosine) on both strands. However, there are a number of MTases that recognize asymmetric target sequences and differ in their subunit organization. In a bacterial cell, after each round of replication, the substrate for any MTase is hemimethylated DNA, and it therefore needs only a single methylation event to restore the fully methylated state. This is in consistent with the fact that most of the DNA MTases studied exist as monomers in solution. Multiple lines of evidence suggest that some DNA MTases function as dimers. Further, functional analysis of many restriction-modification systems showed the presence of more than one or fused MTase genes. It was proposed that presence of two MTases responsible for the recognition and methylation of asymmetric sequences would protect the nascent strands generated during DNA replication from cognate restriction endonuclease. In this review, MTases recognizing asymmetric sequences have been grouped into different subgroups based on their unique properties. Detailed characterization of these unusual MTases would help in better understanding of their specific biological roles and mechanisms of action. The rapid progress made by the genome sequencing of bacteria and archaea may accelerate the identification and study of species- and strain-specific MTases of host-adapted bacteria and their roles in pathogenic mechanisms.

Voluntary Control of Multisaccade Gaze Shifts During Movement Preparation and Execution

Ramakrishnan A, Chokhandre S, Murthy A. Voluntary control of multisaccade gaze shifts during movement preparation and execution. J Neurophysiol 103: 2400-2416, 2010. First published February 17, 2010; doi: 10.1152/jn.00843.2009. Although the nature of gaze control regulating single saccades is relatively well documented, how such control is implemented to regulate multisaccade gaze shifts is not known. We used highly eccentric targets to elicit multisaccade gaze shifts and tested the ability of subjects to control the saccade sequence by presenting a second target on random trials. Their response allowed us to test the nature of control at many levels: before, during, and between saccades. Although the saccade sequence could be inhibited before it began, we observed clear signs of truncation of the first saccade, which confirmed that it could be inhibited in midflight as well. Using a race model that explains the control of single saccades, we estimated that it took about 100 ms to inhibit a planned saccade but took about 150 ms to inhibit a saccade during its execution. Although the time taken to inhibit was different, the high subject-wise correlation suggests a unitary inhibitory control acting at different levels in the oculomotor system. We also frequently observed responses that consisted of hypometric initial saccades, followed by secondary saccades to the initial target. Given the estimates of the inhibitory process provided by the model that also took into account the variances of the processes as well, the secondary saccades (average latency similar to 215 ms) should have been inhibited. Failure to inhibit the secondary saccade suggests that the intersaccadic interval in a multisaccade response is a ballistic stage. Collectively, these data indicate that the oculomotor system can control a response until a very late stage in its execution. However, if the response consists of multiple movements then the preparation of the second movement becomes refractory to new visual input, either because it is part of a preprogrammed sequence or as a consequence of being a corrective response to a motor error.

Source and target enzyme signature in serine protease inhibitor active site sequences

Amino acid sequences of proteinaceous proteinase inhibitors have been extensively analysed for deriving information regarding the molecular evolution and functional relationship of these proteins. These sequences have been grouped into several well defined families. It was found that the phylogeny constructed with the sequences corresponding to the exposed loop responsible for inhibition has several branches that resemble those obtained from comparisons using the entire sequence. The major branches of the unrooted tree corresponded to the families to which the inhibitors belonged. Further branching is related to the enzyme specificity of the inhibitor. Examination of the active site loop sequences of trypsin inhibitors revealed that there are strong preferences for specific amino acids at different positions of the loop. These preferences are inhibitor class specific. Inhibitors active against more than one enzyme occur within a class and confirm to class specific sequence in their loops. Hence, only a few positions in the loop seem to determine the specificity. The ability to inhibit the same enzyme by inhibitors that belong to different classes appears to be a result of convergent evolution

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010