Bounds on Defect Level and Fault Coverage in Linear Analog Circuit Testing

Transfer function coefficients (TFC) are widely used to test linear analog circuits for parametric and catastrophic faults. This paper presents closed form expressions for an upper bound on the defect level (DL) and a lower bound on fault coverage (FC) achievable in TFC based test method. The computed bounds have been tested and validated on several benchmark circuits. Further, application of these bounds to scalable RC ladder networks reveal a number of interesting characteristics. The approach adopted here is general and can be extended to find bounds of DL and FC of other parametric test methods for linear and non-linear circuits.

Total and inelastic cross sections at LHC at root s=7 TeV and beyond

We discuss expectations for the total and inelastic cross sections at LHC CM energies root s = 7 TeV and 14 TeV obtained in an eikonal minijet model augmented by soft gluon k(t)-resummation, which we describe in some detail. We present a band of predictions which encompass recent LHC data and suggest that the inelastic cross section described by two-channel eikonal models include only uncorrelated processes. We show that this interpretation of the model is supported by the LHC data.

Root cause diagnostics using temporal data mining

A method, system, and computer program product for fault data correlation in a diagnostic system are provided. The method includes receiving the fault data including a plurality of faults collected over a period of time, and identifying a plurality of episodes within the fault data, where each episode includes a sequence of the faults. The method further includes calculating a frequency of the episodes within the fault data, calculating a correlation confidence of the faults relative to the episodes as a function of the frequency of the episodes, and outputting a report of the faults with the correlation confidence.

Improved Detection of Remote Homologues Using Cascade PSI-BLAST: Influence of Neighbouring Protein Families on Sequence Coverage

Background: Development of sensitive sequence search procedures for the detection of distant relationships between proteins at superfamily/fold level is still a big challenge. The intermediate sequence search approach is the most frequently employed manner of identifying remote homologues effectively. In this study, examination of serine proteases of prolyl oligopeptidase, rhomboid and subtilisin protein families were carried out using plant serine proteases as queries from two genomes including A. thaliana and O. sativa and 13 other families of unrelated folds to identify the distant homologues which could not be obtained using PSI-BLAST. Methodology/Principal Findings: We have proposed to start with multiple queries of classical serine protease members to identify remote homologues in families, using a rigorous approach like Cascade PSI-BLAST. We found that classical sequence based approaches, like PSI-BLAST, showed very low sequence coverage in identifying plant serine proteases. The algorithm was applied on enriched sequence database of homologous domains and we obtained overall average coverage of 88% at family, 77% at superfamily or fold level along with specificity of similar to 100% and Mathew's correlation coefficient of 0.91. Similar approach was also implemented on 13 other protein families representing every structural class in SCOP database. Further investigation with statistical tests, like jackknifing, helped us to better understand the influence of neighbouring protein families. Conclusions/Significance: Our study suggests that employment of multiple queries of a family for the Cascade PSI-BLAST searches is useful for predicting distant relationships effectively even at superfamily level. We have proposed a generalized strategy to cover all the distant members of a particular family using multiple query sequences. Our findings reveal that prior selection of sequences as query and the presence of neighbouring families can be important for covering the search space effectively in minimal computational time. This study also provides an understanding of the `bridging' role of related families.

Limit laws for coverage in backbone-sensor networks

We study coverage in sensor networks having two types of nodes, namely, sensor nodes and backbone nodes. Each sensor is capable of transmitting information over relatively small distances. The backbone nodes collect information from the sensors. This information is processed and communicated over an ad hoc network formed by the backbone nodes, which are capable of transmitting over much larger distances. We consider two models of deployment for the sensor and backbone nodes. One is a PoissonPoisson cluster model and the other a dependently thinned Poisson point process. We deduce limit laws for functionals of vacancy in both models using properties of association for random measures.

Enhancing Surface Coverage and Growth in Layer-by-Layer Assembly of Protein Nanoparticles

Thin films of bovine serum albumin (BSA) nanoparticles are fabricated via layer-by-layer assembly. The surface of BSA nanoparticles have two oppositely acting functional groups on the surface: amine (NH2) and carboxylate (COO-). The protonation and deprotonation of these functional groups at different pH vary the charge density on the particle surface, and entirely different growth can be observed by varying the nature of the complementary polymer and the pH of the particles. The complementary polymers used in this study are poly(dimethyldiallylammonium chloride) (PDDAC) and poly(acrylic acid) (PAA). The assembly of BSA nanoparticles based on electrostatic interaction with PDDAC suffers from the poor loading of the nanoparticles. The assembly with PAA aided by a hydrogen bonding interaction shows tremendous improvement in the growth of the assembly over PDDAC. Moreover, the pH of the BSA nanoparticles was observed to affect the loading of nanoparticles in the LbL assembly with PAA significantly.

Asymptotics of Harish-Chandra expansions, bounded hypergeometric functions associated with root systems, and applications

A series expansion for Heckman-Opdam hypergeometric functions phi(lambda) is obtained for all lambda is an element of alpha(C)*. As a consequence, estimates for phi(lambda) away from the walls of a Weyl chamber are established. We also characterize the bounded hypergeometric functions and thus prove an analogue of the celebrated theorem of Helgason and Johnson on the bounded spherical functions on a Riemannian symmetric space of the noncompact type. The L-P-theory for the hypergeometric Fourier transform is developed for 0 < p < 2. In particular, an inversion formula is proved when 1 <= p < 2. (C) 2013 Elsevier Inc. All rights reserved.

In Vivo Genotoxicity Assessment of Titanium Dioxide Nanoparticles by Allium cepa Root Tip Assay at High Exposure Concentrations

The industrial production and commercial applications of titanium dioxide nanoparticles have increased considerably in recent times, which has increased the probability of environmental contamination with these agents and their adverse effects on living systems. This study was designed to assess the genotoxicity potential of TiO2 NPs at high exposure concentrations, its bio-uptake, and the oxidative stress it generated, a recognised cause of genotoxicity. Allium cepa root tips were treated with TiO2 NP dispersions at four different concentrations (12.5, 25, 50, 100 mu g/mL). A dose dependant decrease in the mitotic index (69 to 21) and an increase in the number of distinctive chromosomal aberrations were observed. Optical, fluorescence and confocal laser scanning microscopy revealed chromosomal aberrations, including chromosomal breaks and sticky, multipolar, and laggard chromosomes, and micronucleus formation. The chromosomal aberrations and DNA damage were also validated by the comet assay. The bio-uptake of TiO2 in particulate form was the key cause of reactive oxygen species generation, which in turn was probably the cause of the DNA aberrations and genotoxicity observed in this study.

LDPC Code Designs Based on root I Matrices

LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding.

Modifications in Trypsin Digestion Protocol for Increasing the Efficiency and Coverage

Standard trypsin digestion protocol of proteins followed by MALDI-MS analysis has been realized as an important tool for the identification and characterization of proteins. In this article, we proposed the elimination of the step of `staining/de-staining of gel pieces' in in-gel digestion protocol in order to improve the efficiency of trypsin digestion. Coomassie dye is known to interfere with digestion of proteins by trypsin and the procedure of staining-de-staining could result in loss of photoaffinity probe, post translational modifications and catalytic activities of enzymes. Further, we studied parameters like hydrophobicity and isoelectric point, and attempted to quantitatively relate it to the efficiency of trypsin digestion. We suggest that properties of proteins should be considered and trypsin digestion protocol should be appropriately modified as per sequence and other information.

Algorithm for Autonomous Reorganization of Mobile Wireless Camera Sensor Networks to Improve Coverage

In this paper, sensing coverage by wireless camera-embedded sensor networks (WCSNs), a class of directional sensors is studied. The proposed work facilitates the autonomous tuning of orientation parameters and displacement of camera-sensor nodes in the bounded field of interest (FoI), where the network coverage in terms of every point in the FoI is important. The proposed work is first of its kind to study the problem of maximizing coverage of randomly deployed mobile WCSNs which exploits their mobility. We propose an algorithm uncovered region exploration algorithm (UREA-CS) that can be executed in centralized and distributed modes. Further, the work is extended for two special scenarios: 1) to suit autonomous combing operations after initial random WCSN deployments and 2) to improve the network coverage with occlusions in the FoI. The extensive simulation results show that the performance of UREA-CS is consistent, robust, and versatile to achieve maximum coverage, both in centralized and distributed modes. The centralized and distributed modes are further analyzed with respect to the computational and communicational overheads.

Prior image based temporally constrained reconstruction algorithm for magnetic resonance guided high intensity focused ultrasound

Purpose: A prior image based temporally constrained reconstruction ( PITCR) algorithm was developed for obtaining accurate temperature maps having better volume coverage, and spatial, and temporal resolution than other algorithms for highly undersampled data in magnetic resonance (MR) thermometry. Methods: The proposed PITCR approach is an algorithm that gives weight to the prior image and performs accurate reconstruction in a dynamic imaging environment. The PITCR method is compared with the temporally constrained reconstruction (TCR) algorithm using pork muscle data. Results: The PITCR method provides superior performance compared to the TCR approach with highly undersampled data. The proposed approach is computationally expensive compared to the TCR approach, but this could be overcome by the advantage of reconstructing with fewer measurements. In the case of reconstruction of temperature maps from 16% of fully sampled data, the PITCR approach was 1.57x slower compared to the TCR approach, while the root mean square error using PITCR is 0.784 compared to 2.815 with the TCR scheme. Conclusions: The PITCR approach is able to perform more accurate reconstructions of temperature maps compared to the TCR approach with highly undersampled data in MR guided high intensity focused ultrasound. (C) 2015 American Association of Physicists in Medicine.