System reliability of randomly vibrating structures: Computational modeling and laboratory testing

The problem of determination of system reliability of randomly vibrating structures arises in many application areas of engineering. We discuss in this paper approaches based on Monte Carlo simulations and laboratory testing to tackle problems of time variant system reliability estimation. The strategy we adopt is based on the application of Girsanov's transformation to the governing stochastic differential equations which enables estimation of probability of failure with significantly reduced number of samples than what is needed in a direct simulation study. Notably, we show that the ideas from Girsanov's transformation based Monte Carlo simulations can be extended to conduct laboratory testing to assess system reliability of engineering structures with reduced number of samples and hence with reduced testing times. Illustrative examples include computational studies on a 10 degree of freedom nonlinear system model and laboratory/computational investigations on road load response of an automotive system tested on a four post Lest rig. (C) 2015 Elsevier Ltd. All rights reserved.

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .

Computational modeling of reactive hot pressing of zirconium carbide

A model of reactive hot pressing of zirconium carbide (ZrCx, 0.5 < x < 1) has been constructed that incorporates four processes that occur in parallel: creep of zirconium (Zr), reaction of Zr and carbon (C), increase in volume fraction of hard phase with progressive reaction that reduces the creep of Zr and, finally, de-densification associated with volume reduction during reaction. The reasonable agreement of the model with experimental results verifies that plastic deformation of Zr is the main factor that is responsible for the low-temperature reactive densification of ZrC and that ZrC may be treated as a rigid inclusion that contributes little to densification. It predicts that densification is impaired by increasing carbon stoichiometry due to the increasing amount of starting hard phase and the greater contraction upon reaction. Additionally, the model predicts that mixtures of Zr and ZrC should show equal or better densification than Zr and C mixtures.

Human action recognition in H.264/AVC compressed domain using meta-cognitive radial basis function network

In this paper, we propose a H.264/AVC compressed domain human action recognition system with projection based metacognitive learning classifier (PBL-McRBFN). The features are extracted from the quantization parameters and the motion vectors of the compressed video stream for a time window and used as input to the classifier. Since compressed domain analysis is done with noisy, sparse compression parameters, it is a huge challenge to achieve performance comparable to pixel domain analysis. On the positive side, compressed domain allows rapid analysis of videos compared to pixel level analysis. The classification results are analyzed for different values of Group of Pictures (GOP) parameter, time window including full videos. The functional relationship between the features and action labels are established using PBL-McRBFN with a cognitive and meta-cognitive component. The cognitive component is a radial basis function, while the meta-cognitive component employs self-regulation to achieve better performance in subject independent action recognition task. The proposed approach is faster and shows comparable performance with respect to the state-of-the-art pixel domain counterparts. It employs partial decoding, which rules out the complexity of full decoding, and minimizes computational load and memory usage. This results in reduced hardware utilization and increased speed of classification. The results are compared with two benchmark datasets and show more than 90% accuracy using the PBL-McRBFN. The performance for various GOP parameters and group of frames are obtained with twenty random trials and compared with other well-known classifiers in machine learning literature. (C) 2015 Elsevier B.V. All rights reserved.

SInCRe-structural interactome computational resource for Mycobacterium tuberculosis

We have developed an integrated database for Mycobacterium tuberculosis H37Rv (Mtb) that collates information on protein sequences, domain assignments, functional annotation and 3D structural information along with protein-protein and protein-small molecule interactions. SInCRe (Structural Interactome Computational Resource) is developed out of CamBan (Cambridge and Bangalore) collaboration. The motivation for development of this database is to provide an integrated platform to allow easily access and interpretation of data and results obtained by all the groups in CamBan in the field of Mtb informatics. In-house algorithms and databases developed independently by various academic groups in CamBan are used to generate Mtb-specific datasets and are integrated in this database to provide a structural dimension to studies on tuberculosis. The SInCRe database readily provides information on identification of functional domains, genome-scale modelling of structures of Mtb proteins and characterization of the small-molecule binding sites within Mtb. The resource also provides structure-based function annotation, information on small-molecule binders including FDA (Food and Drug Administration)-approved drugs, protein-protein interactions (PPIs) and natural compounds that bind to pathogen proteins potentially and result in weakening or elimination of host-pathogen protein-protein interactions. Together they provide prerequisites for identification of off-target binding.

Compressed domain human action recognition in H.264/AVC video streams

This paper discusses a novel high-speed approach for human action recognition in H.264/AVC compressed domain. The proposed algorithm utilizes cues from quantization parameters and motion vectors extracted from the compressed video sequence for feature extraction and further classification using Support Vector Machines (SVM). The ultimate goal of the proposed work is to portray a much faster algorithm than pixel domain counterparts, with comparable accuracy, utilizing only the sparse information from compressed video. Partial decoding rules out the complexity of full decoding, and minimizes computational load and memory usage, which can result in reduced hardware utilization and faster recognition results. The proposed approach can handle illumination changes, scale, and appearance variations, and is robust to outdoor as well as indoor testing scenarios. We have evaluated the performance of the proposed method on two benchmark action datasets and achieved more than 85 % accuracy. The proposed algorithm classifies actions with speed (> 2,000 fps) approximately 100 times faster than existing state-of-the-art pixel-domain algorithms.

A Computational Study of the Factors Influencing the PVC-Triggering Ability of a Cluster of Early Afterdepolarization-Capable Myocytes

Premature ventricular complexes (PVCs), which are abnormal impulse propagations in cardiac tissue, can develop because of various reasons including early afterdepolarizations (EADs). We show how a cluster of EAD-generating cells (EAD clump) can lead to PVCs in a model of cardiac tissue, and also investigate the factors that assist such clumps in triggering PVCs. In particular, we study, through computer simulations, the effects of the following factors on the PVC-triggering ability of an EAD clump: (1) the repolarization reserve (RR) of the EAD cells; (2) the size of the EAD clump; (3) the coupling strength between the EAD cells in the clump; and (4) the presence of fibroblasts in the EAD clump. We find that, although a low value of RR is necessary to generate EADs and hence PVCs, a very low value of RR leads to low-amplitude EAD oscillations that decay with time and do not lead to PVCs. We demonstrate that a certain threshold size of the EAD clump, or a reduction in the coupling strength between the EAD cells, in the clump, is required to trigger PVCs. We illustrate how randomly distributed inexcitable obstacles, which we use to model collagen deposits, affect PVC-triggering by an EAD clump. We show that the gap-junctional coupling of fibroblasts with myocytes can either assist or impede the PVC-triggering ability of an EAD clump, depending on the resting membrane potential of the fibroblasts and the coupling strength between the myocyte and fibroblasts. We also find that the triggering of PVCs by an EAD clump depends sensitively on factors like the pacing cycle length and the distribution pattern of the fibroblasts.

Non-covalent C-Cl center dot center dot center dot pi interaction in acetylene-carbon tetrachloride adducts: Matrix isolation infrared and ab initio computational studies

Non-covalent halogen-bonding interactions between n cloud of acetylene (C2H2) and chlorine atom of carbon tetrachloride (CCl4) have been investigated using matrix isolation infrared spectroscopy and quantum chemical computations. The structure and the energies of the 1:1 C2H2-CCl4 adducts were computed at the B3LYP, MP2 and M05-2X levels of theory using 6-311++G(d,p) basis set. The computations indicated two minima for the 1:1 C2H2-CCl4 adducts; with the C-Cl center dot center dot center dot pi adduct being the global minimum, where pi cloud of C2H2 is the electron donor. The second minimum corresponded to a C-H...Cl adduct, in which C2H2 is the proton donor. The interaction energies for the adducts A and B were found to be nearly identical. Experimentally, both C-Cl center dot center dot center dot pi and C-H center dot center dot center dot Cl adducts were generated in Ar and N2 matrixes and characterized using infrared spectroscopy. This is the first report on halogen bonded adduct, stabilized through C-Cl center dot center dot center dot pi interaction being identified at low temperatures using matrix isolation infrared spectroscopy. Atoms in Molecules (AIM) and Natural Bond Orbital (NBO) analyses were performed to support the experimental results. The structures of 2:1 ((C2H2)(2)-CCl4) and 1:2 (C2H2-(CCl4)(2)) multimers and their identification in the low temperature matrixes were also discussed. (C) 2015 Elsevier B.V. All rights reserved.

Accelerating method of moments based package-board 3D parasitic extraction using FPGA

In this article, a Field Programmable Gate Array (FPGA)-based hardware accelerator for 3D electromagnetic extraction, using Method of Moments (MoM) is presented. As the number of nets or ports in a system increases, leading to a corresponding increase in the number of right-hand-side (RHS) vectors, the computational cost for multiple matrix-vector products presents a time bottleneck in a linear-complexity fast solver framework. In this work, an FPGA-based hardware implementation is proposed toward a two-level parallelization scheme: (i) matrix level parallelization for single RHS and (ii) pipelining for multiple-RHS. The method is applied to accelerate electrostatic parasitic capacitance extraction of multiple nets in a Ball Grid Array (BGA) package. The acceleration is shown to be linearly scalable with FPGA resources and speed-ups over 10x against equivalent software implementation on a 2.4GHz Intel Core i5 processor is achieved using a Virtex-6 XC6VLX240T FPGA on Xilinx's ML605 board with the implemented design operating at 200MHz clock frequency. (c) 2016 Wiley Periodicals, Inc. Microwave Opt Technol Lett 58:776-783, 2016

Visualisation of charge-transfer excitations in donor-acceptor molecules using the particle-hole map: a case study

Charge-transfer (CT) excitations are essential for photovoltaic phenomena in organic solar cells. Owing to the complexity of molecular geometries and orbital coupling, a detailed analysis and spatial visualisation of CT processes can be challenging. In this paper, a new detail-oriented visualisation scheme, the particle-hole map (PHM), is applied and explained for the purpose of spatial analysis of excitations in organic molecules. The PHM can be obtained from the output of a time-dependent density-functional theory calculation with negligible additional computational cost, and provides a useful physical picture for understanding the origins and destinations of electrons and holes during an excitation process. As an example, we consider intramolecular CT excitations in Diketopyrrolopyrrole-based molecules, and relate our findings to experimental results.