DMT of parallel-path and layered networks under the half-duplex constraint

In this paper, we study the diversity-multiplexing-gain tradeoff (DMT) of wireless relay networks under the half-duplex constraint. It is often unclear what penalty if any, is imposed by the half-duplex constraint on the DMT of such networks. We study two classes of networks; the first class, called KPP(I) networks, is the class of networks with the relays organized in K parallel paths between the source and the destination. While we assume that there is no direct source-destination path, the K relaying paths can interfere with each other. The second class, termed as layered networks, is comprised of relays organized in layers, where links exist only between adjacent layers. We present a communication scheme based on static schedules and amplify-and-forward relaying for these networks. We also show that for KPP(I) networks with K >= 3, the proposed schemes can achieve full-duplex DMT performance, thus demonstrating that there is no performance hit on the DMT due to the half-duplex constraint. We also show that, for layered networks, a linear DMT of d(max)(1 - r)(+) between the maximum diversity d(max) and the maximum MG, r(max) = 1 is achievable. We adapt existing DMT optimal coding schemes to these networks, thus specifying the end-to-end communication strategy explicitly.

A Hybrid Parallel Algorithm for Computing and Tracking Level Set Topology

The contour tree is a topological abstraction of a scalar field that captures evolution in level set connectivity. It is an effective representation for visual exploration and analysis of scientific data. We describe a work-efficient, output sensitive, and scalable parallel algorithm for computing the contour tree of a scalar field defined on a domain that is represented using either an unstructured mesh or a structured grid. A hybrid implementation of the algorithm using the GPU and multi-core CPU can compute the contour tree of an input containing 16 million vertices in less than ten seconds with a speedup factor of upto 13. Experiments based on an implementation in a multi-core CPU environment show near-linear speedup for large data sets.

Inference for the Component and System Lifetime Distribution of a k-unit Parallel System Based on System Data

In this paper, we consider the inference for the component and system lifetime distribution of a k-unit parallel system with independent components based on system data. The components are assumed to have identical Weibull distribution. We obtain the maximum likelihood estimates of the unknown parameters based on system data. The Fisher information matrix has been derived. We propose -expectation tolerance interval and -content -level tolerance interval for the life distribution of the system. Performance of the estimators and tolerance intervals is investigated via simulation study. A simulated dataset is analyzed for illustration.

Structural Integrity of the Greek Key Motif in beta gamma-Crystallins Is Vital for Central Eye Lens Transparency

Background: We highlight an unrecognized physiological role for the Greek key motif, an evolutionarily conserved super-secondary structural topology of the beta gamma-crystallins. These proteins constitute the bulk of the human eye lens, packed at very high concentrations in a compact, globular, short-range order, generating transparency. Congenital cataract (affecting 400,000 newborns yearly worldwide), associated with 54 mutations in beta gamma-crystallins, occurs in two major phenotypes nuclear cataract, which blocks the central visual axis, hampering the development of the growing eye and demanding earliest intervention, and the milder peripheral progressive cataract where surgery can wait. In order to understand this phenotypic dichotomy at the molecular level, we have studied the structural and aggregation features of representative mutations. Methods: Wild type and several representative mutant proteins were cloned, expressed and purified and their secondary and tertiary structural details, as well as structural stability, were compared in solution, using spectroscopy. Their tendencies to aggregate in vitro and in cellulo were also compared. In addition, we analyzed their structural differences by molecular modeling in silico. Results: Based on their properties, mutants are seen to fall into two classes. Mutants A36P, L45PL54P, R140X, and G165fs display lowered solubility and structural stability, expose several buried residues to the surface, aggregate in vitro and in cellulo, and disturb/distort the Greek key motif. And they are associated with nuclear cataract. In contrast, mutants P24T and R77S, associated with peripheral cataract, behave quite similar to the wild type molecule, and do not affect the Greek key topology. Conclusion: When a mutation distorts even one of the four Greek key motifs, the protein readily self-aggregates and precipitates, consistent with the phenotype of nuclear cataract, while mutations not affecting the motif display `native state aggregation', leading to peripheral cataract, thus offering a protein structural rationale for the cataract phenotypic dichotomy ``distort motif, lose central vision''.

TCP: thread contention predictor for parallel programs

With proliferation of chip multicores (CMPs) on desktops and embedded platforms, multi-threaded programs have become ubiquitous. Existence of multiple threads may cause resource contention, such as, in on-chip shared cache and interconnects, depending upon how they access resources. Hence, we propose a tool - Thread Contention Predictor (TCP) to help quantify the number of threads sharing data and their sharing pattern. We demonstrate its use to predict a more profitable shared, last level on-chip cache (LLC) access policy on CMPs. Our cache configuration predictor is 2.2 times faster compared to the cycle-accurate simulations. We also demonstrate its use for identifying hot data structures in a program which may cause performance degradation due to false data sharing. We fix layout of such data structures and show up-to 10% and 18% improvement in execution time and energy-delay product (EDP), respectively.

Analysis of the degrees-of-freedom of spatial parallel manipulators in regular and singular configurations

This paper presents a study of the nature of the degrees-of-freedom of spatial manipulators based on the concept of partition of degrees-of-freedom. In particular, the partitioning of degrees-of-freedom is studied in five lower-mobility spatial parallel manipulators possessing different combinations of degrees-of-freedom. An extension of the existing theory is introduced so as to analyse the nature of the gained degree(s)-of-freedom at a gain-type singularity. The gain of one- and two-degrees-of-freedom is analysed in several well-studied, as well as newly developed manipulators. The formulations also present a basis for the analysis of the velocity kinematics of manipulators of any architecture. (C) 2013 Elsevier Ltd. All rights reserved.

Certificate-less on-demand public key management (CLPKM) for self-organized MANETs

In this paper, we have proposed a novel certificate-less on-demand public key management (CLPKM) protocol for self-organized MANETs. The protocol works on flat network architecture, and distinguishes between authentication layer and routing layer of the network. We put an upper limit on the length of verification route and use the end-to-end trust value of a route to evaluate its strength. The end-to-end trust value is used by the protocol to select the most trusted verification route for accomplishing public key verification. Also, the protocol uses MAC function instead of RSA certificates to perform public key verification. By doing this, the protocol saves considerable computation power, bandwidth and storage space. The saved storage space is utilized by the protocol to keep a number of pre-established routes in the network nodes, which helps in reducing the average verification delay of the protocol. Analysis and simulation results confirm the effectiveness of the proposed protocol.

Identification of key amino acid residues in the catalytic mechanism of diaminopropionate ammonialyase from Salmonella typhimurium

Diaminopropionate ammonialyase (DAPAL), a fold-typeII pyridoxal 5-phosphate-dependent enzyme, catalyzes the ,-elimination of diaminopropionate (DAP) to pyruvate and ammonia. DAPAL was able to utilize both d- and l-DAP as substrates with almost equal efficiency. Mutational analysis of functionally important residues such as Thr385, Asp125 and Asp194 was carried out to understand the mechanism by which the isomers are hydrolyzed. Further, the putative residues involved in the formation of disulfide bond Cys271 and Cys299 were also mutated. T385S, T385D sDAPAL were as active with dl-DAP as substrate as sDAPAL, whereas the later exhibited a threefold increase in catalytic efficiency with d-Ser as substrate. Further analysis of these mutants suggested that DAPAL might follow an anti-E-2 mechanism of catalysis that does not involve the formation of a quinonoid intermediate. Of the two mutants of Asp125, D125E showed complete loss of activity with d-DAP as substrate, whereas the reaction with l-DAP was not affected significantly, demonstrating that Asp125 was essential for abstraction of protons from the d-isomer. By contrast, mutational analysis of Asp194 showed that the residue may not be directly involved in proton abstraction from l-DAP. sDAPAL does not form a disulfide bond in solution, although the position of Cys299 and Cys271 in the modeled structure of sDAPAL favored the formation of a disulfide bond. Further, unlike eDAPAL, sDAPAL could be activated by monovalent cations. Mutation of the cysteine residues showed that Cys271 may be involved in coordinating the monovalent cation, as observed in the case of other fold-typeII enzymes.

Fault-tolerant secret key generation

Mobile nodes observing correlated data communicate using an insecure bidirectional switch to generate a secret key, which must remain concealed from the switch. We are interested in fault-tolerant secret key rates, i.e., the rates of secret key generated even if a subset of nodes drop out before the completion of the communication protocol. We formulate a new notion of fault-tolerant secret key capacity, and present an upper bound on it. This upper bound is shown to be tight when the random variables corresponding to the observations of nodes are exchangeable. Further, it is shown that one round of interaction achieves the fault-tolerant secret key capacity in this case. The upper bound is also tight for the case of a pairwise independent network model consisting of a complete graph, and can be attained by a noninteractive protocol.

Stable atmospheric methane in the 2000s: key-role of emissions from natural wetlands

Two atmospheric inversions (one fine-resolved and one process-discriminating) and a process-based model for land surface exchanges are brought together to analyse the variations of methane emissions from 1990 to 2009. A focus is put on the role of natural wetlands and on the years 2000-2006, a period of stable atmospheric concentrations. From 1990 to 2000, the top-down and bottom-up visions agree on the time-phasing of global total and wetland emission anomalies. The process-discriminating inversion indicates that wetlands dominate the time-variability of methane emissions (90% of the total variability). The contribution of tropical wetlands to the anomalies is found to be large, especially during the post-Pinatubo years (global negative anomalies with minima between -41 and -19 Tg yr(-1) in 1992) and during the alternate 1997-1998 El-Nino/1998-1999 La-Nina (maximal anomalies in tropical regions between +16 and +22 Tg yr(-1) for the inversions and anomalies due to tropical wetlands between +12 and +17 Tg yr(-1) for the process-based model). Between 2000 and 2006, during the stagnation of methane concentrations in the atmosphere, the top-down and bottom-up approaches agree on the fact that South America is the main region contributing to anomalies in natural wetland emissions, but they disagree on the sign and magnitude of the flux trend in the Amazon basin. A negative trend (-3.9 +/- 1.3 Tg yr(-1)) is inferred by the process-discriminating inversion whereas a positive trend (+1.3 +/- 0.3 Tg yr(-1)) is found by the process model. Although processed-based models have their own caveats and may not take into account all processes, the positive trend found by the B-U approach is considered more likely because it is a robust feature of the process-based model, consistent with analysed precipitations and the satellite-derived extent of inundated areas. On the contrary, the surface-data based inversions lack constraints for South America. This result suggests the need for a re-interpretation of the large increase found in anthropogenic methane inventories after 2000.

Insulin like growth factor binding protein 4 promotes GBM progression and regulates key factors involved in EMT and invasion

Insulin like growth factor binding protein 4 (IGFBP4) regulates growth and development of tissues and organs by negatively regulating IGF signaling. Among most cancers, IGFBP4 has growth inhibitory role and reported as a down-regulated gene, except for renal cell carcinoma, wherein IGFBP4 promotes tumor progression. IGFBP4 expression has been shown to be higher in increasing grades of astrocytoma. However, the functional role of IGFBP4 in gliomas has not been explored. Surgical biopsies of 20 normal brain and 198 astrocytoma samples were analyzed for IGFBP4 expression by qRT-PCR. Highest expression of IGFBP4 mRNA was seen in GBM tumors compared to control brain tissues (median log2 of 2.035, p < 0.0001). Immunohistochemical analysis of 53 tissue samples revealed predominant nuclear staining of IGFBP4, seen maximally in GBMs when compared to DA and AA tumors (median LI = 29.12 +/- A 16.943, p < 0.001). Over expression of IGFBP4 in U343 glioma cells resulted in up-regulation of molecules involved in tumor growth, EMT and invasion such as pAkt, pErk, Vimentin, and N-cadherin and down-regulation of E-cadherin. Functionally, IGFBP4 over expression in these cells resulted in increased proliferation, migration and invasion as assessed by MTT, transwell migration, and Matrigel invasion assays. These findings were confirmed upon IGFBP4 knockdown in U251 glioma cells. Our data suggest a pro-tumorigenic role for IGFBP4 in glioma.

Simulation of inhomogeneous distributions of ultracold atoms in an optical lattice via a massively parallel implementation of nonequilibrium strong-coupling perturbation theory

We present a nonequilibrium strong-coupling approach to inhomogeneous systems of ultracold atoms in optical lattices. We demonstrate its application to the Mott-insulating phase of a two-dimensional Fermi-Hubbard model in the presence of a trap potential. Since the theory is formulated self-consistently, the numerical implementation relies on a massively parallel evaluation of the self-energy and the Green's function at each lattice site, employing thousands of CPUs. While the computation of the self-energy is straightforward to parallelize, the evaluation of the Green's function requires the inversion of a large sparse 10(d) x 10(d) matrix, with d > 6. As a crucial ingredient, our solution heavily relies on the smallness of the hopping as compared to the interaction strength and yields a widely scalable realization of a rapidly converging iterative algorithm which evaluates all elements of the Green's function. Results are validated by comparing with the homogeneous case via the local-density approximation. These calculations also show that the local-density approximation is valid in nonequilibrium setups without mass transport.

Moisture Aided Degradation of Oil Impregnated Paper Insulation in Power Transformers

The presence of moisture in oil impregnated paper insulation (OIP) is detrimental to its long time performance. Until recently, it was thought insulation ageing was only a function of temperature and electrical stress. It has now been realized that moisture in all its forms causes rapid degradation of the electrical and mechanical properties with time. In this study, insulation paper samples were conditioned for desired level of moisture and were impregnated with premium quality transformer oil. The oil impregnated samples with 1 to 3 % moisture content were aged at 90 to 130 C. The indices for determining the extent of ageing considered in this work are degree of polymerization (DP), furan, carbon monoxide and carbon dioxide content. These quantities were monitored throughout the ageing experimental run. End-of-life (EOL) criterion used here is the reduction in the value of DP. Phenomenological models for estimating the service life of insulation are proposed and are validated against actual experimental data.

Alumina and Silica based Epoxy Nano-composites for Electrical Insulation

Plain epoxy resins or resin impregnated cellulose have found application as electrical insulation in power equipment. In the past, their performance was improved by the use of inorganic oxide fillers of microscopic dimensions. In the recent past nano-particle doped epoxy insulation came into use with a view to further enhance the dielectric properties. This paper reports dielectric investigations into epoxy nano-composites based on a class of metal oxides, Al2O3 and SiO2. In particular, consideration has been given to the partial discharge performance and electrical breakdown under different voltage profiles as a function of the volumetric composition of the nano-particles in epoxy resin.

PocketMatch (version 2.0): A parallel algorithm for the detection of structural similarities between protein ligand binding-sites

Knowledge of protein-ligand interactions is essential to understand several biological processes and important for applications ranging from understanding protein function to drug discovery and protein engineering. Here, we describe an algorithm for the comparison of three-dimensional ligand-binding sites in protein structures. A previously described algorithm, PocketMatch (version 1.0) is optimised, expanded, and MPI-enabled for parallel execution. PocketMatch (version 2.0) rapidly quantifies binding-site similarity based on structural descriptors such as residue nature and interatomic distances. Atomic-scale alignments may also be obtained from amino acid residue pairings generated. It allows an end-user to compute database-wide, all-to-all comparisons in a matter of hours. The use of our algorithm on a sample dataset, performance-analysis, and annotated source code is also included.