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.

Effect of high-temperature shock-wave compression on few-layer MoS2, WS2 and MoSe2

Exposure of few-layer MoS2, WS2 and MoSe2 to high-temperature shock waves causes morphological changes and a significant decrease in the interlayer separation between the (002) planes, the decrease being greatest in MoSe2. Raman spectra show softening of both the A(1g) and the E-2g(1) modes initially, followed by a slightly stiffening. Using first-principles density functional theoretical analysis of the response of few-layer MoS2 to shock waves, we propose that a combination of shear and uniaxial compressive deformation leads to flattening of MoS2 sheets which is responsible for the changes in the vibrational spectra. (C) 2013 Elsevier B.V. All rights reserved.

An 8-to-1 bit 1-MS/s SAR ADC With VGA and Integrated Data Compression for Neural Recording

Low power consumption per channel and data rate minimization are two key challenges which need to be addressed in future generations of neural recording systems (NRS). Power consumption can be reduced by avoiding unnecessary processing whereas data rate is greatly decreased by sending spike time-stamps along with spike features as opposed to raw digitized data. Dynamic range in NRS can vary with time due to change in electrode-neuron distance or background noise, which demands adaptability. An analog-to-digital converter (ADC) is one of the most important blocks in a NRS. This paper presents an 8-bit SAR ADC in 0.13-mu m CMOS technology along with input and reference buffer. A novel energy efficient digital-to-analog converter switching scheme is proposed, which consumes 37% less energy than the present state-of-the-art. The use of a ping-pong input sampling scheme is emphasized for multichannel input to alleviate the bandwidth requirement of the input buffer. To reduce the data rate, the A/D process is only enabled through the in-built background noise rejection logic to ensure that the noise is not processed. The ADC resolution can be adjusted from 8 to 1 bit in 1-bit step based on the input dynamic range. The ADC consumes 8.8 mu W from 1 V supply at 1 MS/s speed. It achieves effective number of bits of 7.7 bits and FoM of 42.3 fJ/conversion-step.

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.

On the absence of shear cracking and grain boundary cavitation in secondary tensile regions of Ti-6Al-4V-0.1B alloy during hot (alpha plus beta)-compression

Deformation instabilities, such as shear cracking and grain boundary cavitation, which are observed in the secondary tensile region of Ti-6Al-4V alloy during compressive deformation in the (+)-phase field, do not form in Ti-6Al-4V-0.1B alloy when processed under the same conditions. This has been attributed to the microstructural modifications, e.g. the absence of grain boundary and adjacent grain boundary retained layers and a lower proportion of 90(o)-misoriented -colonies that occur with boron addition.

Crystallographic texture and microstructure evolution during hot compression of Ti-6Al-4V-0.1B alloy in the (alpha plus beta)-regime

Microstructure and texture are known to undergo drastic modifications due to trace hypoeutectic boron addition (similar to 0.1wt.%) for various titanium alloys e.g. Ti-6Al-4V. The deformation behaviour of such an alloy Ti-6Al-4V-0.1B is investigated in the (+) phase field and compared against that of the base alloy Ti-6Al-4V studied under selfsame conditions. The deformation microstructures for the two alloys display bending and kinking of lamellae in near and softening via globularization of lamella in near phase regimes, respectively. The transition temperature at which pure slip based deformation changes to softening is lower for the boron added alloy. The presence of TiB particles is largely held attributable for the early softening of Ti-6Al-4V-0.1B alloy. The compression texture of both the alloys carry signature of pure phase defamation at lower temperature and phase transformation near the transus temperature. Texture is influenced by a complex interplay of the deformation and transformation processes in the intermediate temperature range. The contribution from phase transformation is prominent for Ti-6Al-4V-0.1B alloy at comparatively lower temperature.

Micropillar and macropillar compression responses of magnesium single crystals oriented for single slip or extension twinning

Uniaxial compression experiments were conducted on two magnesium (Mg) single crystals whose crystallographic orientations facilitate the deformation either by basal slip or by extension twinning. Specimen size effects were examined by conducting experiments on mu m- and mm-sized samples. A marked specimen size effect was noticed, with micropillars exhibiting significantly higher flow stress than bulk samples. Further, it is observed that the twin nucleation stress exerts strong size dependence, with micropillars requiring substantially higher stress than the bulk samples. The flow curves obtained on the bulk samples are smooth whereas those obtained from micropillars exhibit intermittent and precipitous stress drops. Electron backscattered diffraction and microstructural analyses of the deformed samples reveal that the plastic deformation in basal slip oriented crystals occurs only by slip while twin oriented crystals deform by both slip and twinning modes. The twin oriented crystals exhibit a higher strain hardening during plastic deformation when compared to the single slip oriented crystals. The strain hardening rate, theta, of twin oriented crystals is considerably greater in micropillars compared to the bulk single crystals, suggesting the prevalence of different work hardening mechanisms at these different sample sizes. (C) 2013 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

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.

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.

Parallel Flow-Sensitive Pointer Analysis by Graph-Rewriting

Precise pointer analysis is a problem of interest to both the compiler and the program verification community. Flow-sensitivity is an important dimension of pointer analysis that affects the precision of the final result computed. Scaling flow-sensitive pointer analysis to millions of lines of code is a major challenge. Recently, staged flow-sensitive pointer analysis has been proposed, which exploits a sparse representation of program code created by staged analysis. In this paper we formulate the staged flow-sensitive pointer analysis as a graph-rewriting problem. Graph-rewriting has already been used for flow-insensitive analysis. However, formulating flow-sensitive pointer analysis as a graph-rewriting problem adds additional challenges due to the nature of flow-sensitivity. We implement our parallel algorithm using Intel Threading Building Blocks and demonstrate considerable scaling (upto 2.6x) for 8 threads on a set of 10 benchmarks. Compared to the sequential implementation of staged flow-sensitive analysis, a single threaded execution of our implementation performs better in 8 of the benchmarks.

Microstructure Development, Nanomechanical, and Dynamic Compression Properties of Spark Plasma Sintered TiB2-Ti-Based Homogeneous and Bi-layered Composites

The growing threats due to increased use of small-caliber armor piercing projectiles demand the development of new light-weight body armor materials. In this context, TiB2 appears to be a promising ceramic material. However, poor sinterability and low fracture toughness remain two major issues for TiB2. In order to address these issues together, Ti as a sinter-aid is used to develop TiB2-(x wt pct Ti), (x = 10, 20) homogeneous composites and a bi-layered composite (BLC) with each layer having Ti content of 10 and 20 wt pct. The present study uniquely demonstrates the efficacy of two-stage spark plasma sintering route to develop dense TiB2-Ti composites with an excellent combination of nanoscale hardness (similar to 36 GPa) and indentation fracture toughness (similar to 12 MPa m(1/2)). In case of BLC, these properties are not compromised w.r.t. homogeneous composites, suggesting the retention of baseline material properties even in the bi-layer design due to optimal relief of residual stresses. The better indentation toughness of TiB2-(10 wt pct Ti) and TiB2-(20 wt pct Ti) composites can be attributed to the observed crack deflection/arrest, indicating better damage tolerance. Transmission electron microscope investigation reveals the presence of dense dislocation networks and deformation twins in alpha-Ti at the grain boundaries and triple pockets, surrounded by TiB2 grains. The dynamic strength of around 4 GPa has been measured using Split Hopkinson Pressure Bar tests in a reproducible manner at strain rates of the order of 600 s(-1). The damage progression under high strain rate has been investigated by acquiring real time images for the entire test duration using ultra-high speed imaging. An attempt has been made to establish microstructure-property correlation and a simple analysis based on Mohr-Coulomb theory is used to rationalize the measured strength properties.

REPRESENTING A CUBIC GRAPH AS THE INTERSECTION GRAPH OF AXIS-PARALLEL BOXES IN THREE DIMENSIONS

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if their corresponding vertices are adjacent. In fact, we construct a representation in which any two intersecting boxes touch just at their boundaries.