Cavitation in brittle metallic glasses - Effects of stress state and distributed weak zones

Experimental studies and atomistic simulations have shown that brittle metallic glasses fail by a cavitation mechanism whose origin has been traced to the presence of intrinsic atomic density fluctuations which give rise to weak zones with reduced yield strength. It has been shown recently through continuum analysis that the presence of these zones can lower the cavitation stress considerably under equibiaxial loading. The objective of the present work is to study the effect of the applied stress state on the cavitation behavior of such a heterogeneous plastic solid with distributed weak zones. To this end, 2D plane strain finite element simulations are performed by subjecting a unit cell containing a weak zone to different (biaxiality) stress ratios. The volume fraction and yield strength of the weak zone are varied over a wide range. The results show that unlike in a homogeneous plastic solid, the cavitation stress of the heterogeneous aggregate does not reduce appreciably as the stress ratio decreases from unity when the yield strength of the weak zone is low. It is found that a non-dimensional parameter characterizing the stress state prevailing in the weak zone and its yield properties uniquely control the cavitation stress. The nature of cavitation bifurcation may change from unstable bifurcation to the left at sufficiently low stress ratio to one involving snap cavitation at high stress ratio. (C) 2014 Elsevier Ltd. All rights reserved.

An interior penalty method for distributed optimal control problems governed by the biharmonic operator

In this paper, a C-0 interior penalty method has been proposed and analyzed for distributed optimal control problems governed by the biharmonic operator. The state and adjoint variables are discretized using continuous piecewise quadratic finite elements while the control variable is discretized using piecewise constant approximations. A priori and a posteriori error estimates are derived for the state, adjoint and control variables under minimal regularity assumptions. Numerical results justify the theoretical results obtained. The a posteriori error estimators are useful in adaptive finite element approximation and the numerical results indicate that the sharp error estimators work efficiently in guiding the mesh refinement. (C) 2014 Elsevier Ltd. All rights reserved.

Molecules support morphology: species status of South Indian populations of the widely distributed Hanuman langur

The taxonomy of the Hanuman langur (Semnopithecus spp.), a widely distributed Asian colobine monkey, has been in a flux for a long time due to much disagreement between various classification schemes. However, results from a recent field-based morphological study were consistent with Hill's (Ceylon J Sci 21:277-305, 1939) species level classification scheme. Here we tested the validity of S. hypoleucos and S. priam, the two South Indian species recognized by Hill. To this end, one mitochondrial and four nuclear markers were sequenced from over 72 non-invasive samples of Hanuman langurs and S. johnii collected from across India. The molecular data were subjected to various tree building methods. The nuclear data was also used in a Bayesian structure analysis and to determine the genealogical sorting index of each hypothesized species. Results from nuclear data suggest that the South Indian population of Hanuman langur consists of two units that correspond to the species recognized by Hill. However in the mitochondrial tree S. johnii and S. priam were polyphyletic probably due to retention of ancestral polymorphism and/or low levels of hybridization. Implications of these results on conservation of Hanuman langurs are also discussed.

Characterizing the Impact of Feedback Delays on Wideband Rate Adaptation

In contemporary orthogonal frequency division multiplexing (OFDM) systems, such as Long Term Evolution (LTE), LTE-Advanced, and WiMAX, a codeword is transmitted over a group of subcarriers. Since different subcarriers see different channel gains in frequency-selective channels, the modulation and coding scheme (MCS) of the codeword must be selected based on the vector of signal-to-noise-ratios (SNRs) of these subcarriers. Exponential effective SNR mapping (EESM) maps the vector of SNRs into an equivalent flat-fading SNR, and is widely used to simplify this problem. We develop a new analytical framework to characterize the throughput of EESM-based rate adaptation in such wideband channels in the presence of feedback delays. We derive a novel accurate approximation for the throughput as a function of feedback delay. We also propose a novel bivariate gamma distribution to model the time evolution of EESM between the times of estimation and data transmission, which facilitates the analysis. These are then generalized to a multi-cell, multi-user scenario with various frequency-domain schedulers. Unlike prior work, most of which is simulation-based, our framework encompasses both correlated and independent subcarriers and various multiple antenna diversity modes; it is accurate over a wide range of delays.

A Distributed TDMA Slot Scheduling Algorithm for Spatially Correlated Contention in WSNs

In WSNs the communication traffic is often time and space correlated, where multiple nodes in a proximity start transmitting simultaneously. Such a situation is known as spatially correlated contention. The random access method to resolve such contention suffers from high collision rate, whereas the traditional distributed TDMA scheduling techniques primarily try to improve the network capacity by reducing the schedule length. Usually, the situation of spatially correlated contention persists only for a short duration, and therefore generating an optimal or suboptimal schedule is not very useful. Additionally, if an algorithm takes very long time to schedule, it will not only introduce additional delay in the data transfer but also consume more energy. In this paper, we present a distributed TDMA slot scheduling (DTSS) algorithm, which considerably reduces the time required to perform scheduling, while restricting the schedule length to the maximum degree of interference graph. The DTSS algorithm supports unicast, multicast, and broadcast scheduling, simultaneously without any modification in the protocol. We have analyzed the protocol for average case performance and also simulated it using Castalia simulator to evaluate its runtime performance. Both analytical and simulation results show that our protocol is able to considerably reduce the time required for scheduling.

Timer-Based Distributed Node Selection Scheme Exploiting Power Control and Capture

Opportunistic selection in multi-node wireless systems improves system performance by selecting the ``best'' node and by using it for data transmission. In these systems, each node has a real-valued local metric, which is a measure of its ability to improve system performance. Our goal is to identify the best node, which has the largest metric. We propose, analyze, and optimize a new distributed, yet simple, node selection scheme that combines the timer scheme with power control. In it, each node sets a timer and transmit power level as a function of its metric. The power control is designed such that the best node is captured even if. other nodes simultaneously transmit with it. We develop several structural properties about the optimal metric-to-timer-and-power mapping, which maximizes the probability of selecting the best node. These significantly reduce the computational complexity of finding the optimal mapping and yield valuable insights about it. We show that the proposed scheme is scalable and significantly outperforms the conventional timer scheme. We investigate the effect of. and the number of receive power levels. Furthermore, we find that the practical peak power constraint has a negligible impact on the performance of the scheme.

Performance of OFDM Systems With Best-m Feedback, Scheduling, and Delays for Uniformly Correlated Subchannels

Contemporary cellular standards, such as Long Term Evolution (LTE) and LTE-Advanced, employ orthogonal frequency-division multiplexing (OFDM) and use frequency-domain scheduling and rate adaptation. In conjunction with feedback reduction schemes, high downlink spectral efficiencies are achieved while limiting the uplink feedback overhead. One such important scheme that has been adopted by these standards is best-m feedback, in which every user feeds back its m largest subchannel (SC) power gains and their corresponding indices. We analyze the single cell average throughput of an OFDM system with uniformly correlated SC gains that employs best-m feedback and discrete rate adaptation. Our model incorporates three schedulers that cover a wide range of the throughput versus fairness tradeoff and feedback delay. We show that, for small m, correlation significantly reduces average throughput with best-m feedback. This result is pertinent as even in typical dispersive channels, correlation is high. We observe that the schedulers exhibit varied sensitivities to correlation and feedback delay. The analysis also leads to insightful expressions for the average throughput in the asymptotic regime of a large number of users.

Temperature compensation in CNT-composite distributed strain sensors

A temperature compensation method is proposed for CNT-composite strain sensors. CNT-composite sensors are fabricated on an elastic polymer substrate having known thermo-mechanical properties to introduce thermo-mechanical strain and further calibration of the sensor. Strain is induced on the sensor by bending the substrate as a cantilever configuration. Response of the sensor is measured using a bridge circuit method. Induced strain in the beam is determined using beam theory. The sensors are characterized for different CNT concentrations and at various temperatures. A model based temperature compensation scheme is proposed and verified experimentally. The result proves the ability of CNT-nanocomposite strain sensors to be used under varying temperature applications. A method is proposed to determine the strain and temperature simultaneously. The CNT sensors are simple to fabricate in complex patterns with excellent repeatability and do not require bonding layer.

Throughput Analysis of Best-m Feedback in OFDM Systems with Uniformly Correlated Subchannels

Practical orthogonal frequency division multiplexing (OFDM) systems, such as Long Term Evolution (LTE), exploit multi-user diversity using very limited feedback. The best-m feedback scheme is one such limited feedback scheme, in which users report only the gains of their m best subchannels (SCs) and their indices. While the scheme has been extensively studied and adopted in standards such as LTE, an analysis of its throughput for the practically important case in which the SCs are correlated has received less attention. We derive new closed-form expressions for the throughput when the SC gains of a user are uniformly correlated. We analyze the performance of the greedy but unfair frequency-domain scheduler and the fair round-robin scheduler for the general case in which the users see statistically non-identical SCs. An asymptotic analysis is then developed to gain further insights. The analysis and extensive numerical results bring out how correlation reduces throughput.

Direct Link-Aware Optimal Relay Selection and a Low Feedback Variant for Underlay CR

Cooperative relaying combined with selection has been extensively studied in the literature to improve the performance of interference-constrained secondary users in underlay cognitive radio (CR). We present a novel symbol error probability (SEP)-optimal amplify-and-forward relay selection rule for an average interference-constrained underlay CR system. A fundamental principle, which is unique to average interference-constrained underlay CR, that the proposed rule brings out is that the choice of the optimal relay is affected not just by the source-to-relay, relay-to-destination, and relay-to-primary receiver links, which are local to the relay, but also by the direct source-to-destination (SD) link, even though it is not local to any relay. We also propose a simpler, practically amenable variant of the optimal rule called the 1-bit rule, which requires just one bit of feedback about the SD link gain to the relays, and incurs a marginal performance loss relative to the optimal rule. We analyze its SEP and develop an insightful asymptotic SEP analysis. The proposed rules markedly outperform several ad hoc SD link-unaware rules proposed in the literature. They also generalize the interference-unconstrained and SD link-unaware optimal rules considered in the literature.

Physical Layer Data Fusion Via Distributed Co-Phasing With General Signal Constellations

This paper studies a pilot-assisted physical layer data fusion technique known as Distributed Co-Phasing (DCP). In this two-phase scheme, the sensors first estimate the channel to the fusion center (FC) using pilots sent by the latter; and then they simultaneously transmit their common data by pre-rotating them by the estimated channel phase, thereby achieving physical layer data fusion. First, by analyzing the symmetric mutual information of the system, it is shown that the use of higher order constellations (HOC) can improve the throughput of DCP compared to the binary signaling considered heretofore. Using an HOC in the DCP setting requires the estimation of the composite DCP channel at the FC for data decoding. To this end, two blind algorithms are proposed: 1) power method, and 2) modified K-means algorithm. The latter algorithm is shown to be computationally efficient and converges significantly faster than the conventional K-means algorithm. Analytical expressions for the probability of error are derived, and it is found that even at moderate to low SNRs, the modified K-means algorithm achieves a probability of error comparable to that achievable with a perfect channel estimate at the FC, while requiring no pilot symbols to be transmitted from the sensor nodes. Also, the problem of signal corruption due to imperfect DCP is investigated, and constellation shaping to minimize the probability of signal corruption is proposed and analyzed. The analysis is validated, and the promising performance of DCP for energy-efficient physical layer data fusion is illustrated, using Monte Carlo simulations.

A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs

The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.

Co-Exploration of NLA Kernels and Specification of Compute Elements in Distributed Memory CGRAs

Coarse Grained Reconfigurable Architectures (CGRA) are emerging as embedded application processing units in computing platforms for Exascale computing. Such CGRAs are distributed memory multi- core compute elements on a chip that communicate over a Network-on-chip (NoC). Numerical Linear Algebra (NLA) kernels are key to several high performance computing applications. In this paper we propose a systematic methodology to obtain the specification of Compute Elements (CE) for such CGRAs. We analyze block Matrix Multiplication and block LU Decomposition algorithms in the context of a CGRA, and obtain theoretical bounds on communication requirements, and memory sizes for a CE. Support for high performance custom computations common to NLA kernels are met through custom function units (CFUs) in the CEs. We present results to justify the merits of such CFUs.

Plant reproductive traits mediate tritrophic feedback effects within an obligate brood-site pollination mutualism

Plants, herbivores and parasitoids affect each other directly and indirectly; however, feedback effects mediated by host plant traits have rarely been demonstrated in these tritrophic interactions. Brood-site pollination mutualisms (e.g. those involving figs and fig wasps) represent specialised tritrophic communities where the progeny of mutualistic pollinators and of non-mutualistic gallers (both herbivores) together with that of their parasitoids develop within enclosed inflorescences called syconia (hence termed brood-sites or microcosms). Plant reproductive phenology (which affects temporal brood-site availability) and inflorescence size (representing brood-site size) are plant traits that could affect reproductive resources, and hence relationships between trees, pollinators and non-pollinating wasps. Analysing wasp and seed contents of syconia, we examined direct, indirect, trophic and non-trophic relationships within the interaction web of the fig-fig wasp community of Ficus racemosa in the context of brood site size and availability. We demonstrate that in addition to direct resource competition and predator-prey (host-parasitoid) interactions, these communities display exploitative or apparent competition and trait-mediated indirect interactions. Inflorescence size and plant reproductive phenology impacted plant-herbivore and plant-parasitoid associations. These plant traits also influenced herbivore-herbivore and herbivore-parasitoid relationships via indirect effects. Most importantly, we found a reciprocal effect between within-tree reproductive asynchrony and fig wasp progeny abundances per syconium that drives a positive feedback cycle within the system. The impact of a multitrophic feedback cycle within a community built around a mutualistic core highlights the need for a holistic view of plant-herbivore-parasitoid interactions in the community ecology of mutualisms.

COOL CORE CYCLES: COLD GAS AND AGN JET FEEDBACK IN CLUSTER CORES

Using high-resolution 3D and 2D (axisymmetric) hydrodynamic simulations in spherical geometry, we study the evolution of cool cluster cores heated by feedback-driven bipolar active galactic nuclei (AGNs) jets. Condensation of cold gas, and the consequent enhanced accretion, is required for AGN feedback to balance radiative cooling with reasonable efficiencies, and to match the observed cool core properties. A feedback efficiency (mechanical luminosity approximate to epsilon(M) over dot(acc)c(2); where (M) over dot(acc). is the mass accretion rate at 1 kpc) as small as 6 x 10(-5) is sufficient to reduce the cooling/accretion rate by similar to 10 compared to a pure cooling flow in clusters (with M-200 less than or similar to 7 x 10(14) M-circle dot). This value is much smaller compared to the ones considered earlier, and is consistent with the jet efficiency and the fact that only a small fraction of gas at 1 kpc is accreted onto the supermassive black hole (SMBH). The feedback efficiency in earlier works was so high that the cluster core reached equilibrium in a hot state without much precipitation, unlike what is observed in cool-core clusters. We find hysteresis cycles in all our simulations with cold mode feedback: condensation of cold gas when the ratio of the cooling-time to the free-fall time (t(cool)/t(ff)) is less than or similar to 10 leads to a sudden enhancement in the accretion rate; a large accretion rate causes strong jets and overheating of the hot intracluster medium such that t(cool)/t(ff) > 10; further condensation of cold gas is suppressed and the accretion rate falls, leading to slow cooling of the core and condensation of cold gas, restarting the cycle. Therefore, there is a spread in core properties, such as the jet power, accretion rate, for the same value of core entropy t(cool)/t(ff). A smaller number of cycles is observed for higher efficiencies and for lower mass halos because the core is overheated to a longer cooling time. The 3D simulations show the formation of a few-kpc scale, rotationally supported, massive (similar to 10(11) M-circle dot) cold gas torus. Since the torus gas is not accreted onto the SMBH, it is largely decoupled from the feedback cycle. The radially dominant cold gas (T < 5 x 10(4) K; vertical bar v(r)vertical bar >vertical bar v(phi vertical bar)) consists of fast cold gas uplifted by AGN jets and freely infalling cold gas condensing out of the core. The radially dominant cold gas extends out to 25 kpc for the fiducial run (halo mass 7 x 10(14) M-circle dot and feedback efficiency 6 x 10(-5)), with the average mass inflow rate dominating the outflow rate by a factor of approximate to 2. We compare our simulation results with recent observations.