Synthesis, biological studies of linear and branched arabinofuranoside-containing glycolipids and their interaction with surfactant protein A

Oligoarabinofuranoside-containing glycolipids relevant to mycobacterial cell wall components were synthesized in order to understand the functional roles of such glycolipids. A series of linear tetra-, hexa-, octa-and a branched heptasaccharide oligoarabinofuranosides, with 1 -> 2 and 1 -> 5 a-linkages between the furanoside residues, were synthesized by chemical methods from readily available monomer building blocks. Upon the synthesis of glycolipids, constituted with a double alkyl chain-substituted sn-glycerol core and oligosaccharide fragments, biological studies were performed to identify the effect of synthetic glycolipids on the biofilm formation and sliding motilities of Mycobacterium smegmatis. Synthetic glycolipids and arabinofuranosides displayed an inhibitory effect on the growth profile, but mostly on the biofilm formation and maturation. Similarly, synthetic compounds also influenced the sliding motility of the bacteria. Further, biophysical studies were undertaken, so as to identify the interactions of the glycolipids with a pulmonary surfactant protein, namely surfactant protein A (SP-A), with the aid of the surface plasmon resonance technique. Specificities of each glycolipid interacting with SP-A were thus evaluated. From this study, glycolipids were found to exhibit higher apparent association constants than the corresponding oligosaccharide portion alone, without the double alkyl group-substituted glycerol core.

The biological and structural characterization of Mycobacterium tuberculosis UvrA provides novel insights into its mechanism of action

Mycobacterium tuberculosis is an extremely well adapted intracellular human pathogen that is exposed to multiple DNA damaging chemical assaults originating from the host defence mechanisms. As a consequence, this bacterium is thought to possess highly efficient DNA repair machineries, the nucleotide excision repair (NER) system amongst these. Although NER is of central importance to DNA repair in M. tuberculosis, our understanding of the processes in this species is limited. The conserved UvrABC endonuclease represents the multi-enzymatic core in bacterial NER, where the UvrA ATPase provides the DNA lesion-sensing function. The herein reported genetic analysis demonstrates that M. tuberculosis UvrA is important for the repair of nitrosative and oxidative DNA damage. Moreover, our biochemical and structural characterization of recombinant M. tuberculosis UvrA contributes new insights into its mechanism of action. In particular, the structural investigation reveals an unprecedented conformation of the UvrB-binding domain that we propose to be of functional relevance. Taken together, our data suggest UvrA as a potential target for the development of novel anti-tubercular agents and provide a biochemical framework for the identification of small-molecule inhibitors interfering with the NER activity in M. tuberculosis.

A Systematic Approach to Synthesis of Verification Test-suites for Modular SoC Designs

Verification is one of the important stages in designing an SoC (system on chips) that consumes upto 70% of the design time. In this work, we present a methodology to automatically generate verification test-cases to verify a class of SoCs and also enable re-use of verification resources created from one SoC to another. A prototype implementation for generating the test-cases is also presented.

V-Transform: “An Enhanced Polynomial Coefficient Based DC Test for Non-linear Analog Circuits

Abstract—DC testing of parametric faults in non-linear analog circuits based on a new transformation, entitled, V-Transform acting on polynomial coefficient expansion of the circuit function is presented. V-Transform serves the dual purpose of monotonizing polynomial coefficients of circuit function expansion and increasing the sensitivity of these coefficients to circuit parameters. The sensitivity of V-Transform Coefficients (VTC) to circuit parameters is up to 3x-5x more than sensitivity of polynomial coefficients. As a case study, we consider a benchmark elliptic filter to validate our method. The technique is shown to uncover hitherto untestable parametric faults whose sizes are smaller than 10 % of the nominal values. I.

Scan cell reordering to minimize peak power during test cycle: A graph theoretic approach

Scan circuit is widely practiced DFT technology. The scan testing procedure consist of state initialization, test application, response capture and observation process. During the state initialization process the scan vectors are shifted into the scan cells and simultaneously the responses captured in last cycle are shifted out. During this shift operation the transitions that arise in the scan cells are propagated to the combinational circuit, which inturn create many more toggling activities in the combinational block and hence increases the dynamic power consumption. The dynamic power consumed during scan shift operation is much more higher than that of normal mode operation.

A Fast Linear Separability Test by Projection of Positive Points on Subspaces

A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d

Analog/RF Built-in-Self-Test Subsystem for a Mobile Broadcast Video Receiver in 65-nm CMOS

A built-in-self-test (BIST) subsystem embedded in a 65-nm mobile broadcast video receiver is described. The subsystem is designed to perform analog and RF measurements at multiple internal nodes of the receiver. It uses a distributed network of CMOS sensors and a low bandwidth, 12-bit A/D converter to perform the measurements with a serial bus interface enabling a digital transfer of measured data to automatic test equipment (ATE). A perturbation/correlation based BIST method is described, which makes pass/fail determination on parts, resulting in significant test time and cost reduction.