Effect of mechanical cycling on the stress-strain response of a martensitic Nitinol shape memory alloy

An experimental investigation into the ambient temperature, load-controlled tension�tension fatigue behavior of a martensitic Nitinol shape memory alloy (SMA) was conducted. Fatigue life for several stress levels spanning the critical stress for detwinning was determined and compared with that obtained on an alloy similar in composition but in the austenitic state at room temperature. Results show that the fatigue life of the pseudo-plastic alloy is superior to superelastic shape memory alloy. The stress�strain hysteretic response, monitored throughout the fatigue loading, reveals progressive strain accumulation with the cyclic loading. In addition, the area of hysteresis and recoverable and frictional energies were found to decrease with increasing number of fatigue cycles. Post-mortem characterization of the fatigued specimens through calorimetry and fractography was conducted in order to get further insight into the fatigue micromechanisms. These results are discussed in terms of reversible and irreversible microstructural changes that take place during cyclic loading. Aspects associated with self-heating of martensitic alloy undergoing high frequency stress cycling are discussed.

Draft genome sequence of caloramator mitchellensis, a thermoanaerobe isolated from the waters of the Great Artesian Basin

The genome sequence of Caloramator mitchellensis strain VF08, a rod-shaped, heterotrophic, strictly anaerobic bacterium iso-lated from the free-flowing waters of a Great Artesian Basin (GAB) bore well located in Mitchell, an outback Queensland town in Australia, is reported here. The analysis of the 2.42-Mb genome sequence indicates that the attributes of the genome are consistent with its physiological and phenotypic traits.

Compact fiber Bragg grating dynamic strain sensor cum broadband thermometer for thermally unstable ambience

An instrument for simultaneous measurement of dynamic strain and temperature in a thermally unstable ambience has been proposed, based on fiber Bragg grating technology. The instrument can function as a compact and stand-alone broadband thermometer and a dynamic strain gauge. It employs a source wavelength tracking procedure for linear dependence of the output on the measurand, offering high dynamic range. Two schemes have been demonstrated with their relative merits. As a thermometer, the present instrumental configuration can offer a linear response in excess of 500 degrees C that can be easily extended by adding a suitable grating and source without any alteration in the procedure. Temperature sensitivity is about 0.06 degrees C for a bandwidth of 1 Hz. For the current grating, the upper limit of strain measurement is about 150 mu epsilon with a sensitivity of about 80 n epsilon Hz(-1/2). The major source of uncertainty associated with dynamic strain measurement is the laser source intensity noise, which is of broad spectral band. A low noise source device or the use of optical power regulators can offer improved performance. The total harmonic distortion is less than 0.5% up to about 50 mu epsilon, 1.2% at 100 mu epsilon and about 2.3% at 150 mu epsilon. Calibrated results of temperature and strain measurement with the instrument have been presented. Traces of ultrasound signals recorded by the system at 200 kHz, in an ambience of 100-200 degrees C temperature fluctuation, have been included. Also, the vibration spectrum and engine temperature of a running internal combustion engine has been recorded as a realistic application of the system.

Influence of spatial variability of permeability property on steady state seepage flow and slope stability analysis

In recent years, spatial variability modeling of soil parameters using random field theory has gained distinct importance in geotechnical analysis. In the present Study, commercially available finite difference numerical code FLAC 5.0 is used for modeling the permeability parameter as spatially correlated log-normally distributed random variable and its influence on the steady state seepage flow and on the slope stability analysis are studied. Considering the case of a 5.0 m high cohesive-frictional soil slope of 30 degrees, a range of coefficients of variation (CoV%) from 60 to 90% in the permeability Values, and taking different values of correlation distance in the range of 0.5-15 m, parametric studies, using Monte Carlo simulations, are performed to study the following three aspects, i.e., (i) effect ostochastic soil permeability on the statistics of seepage flow in comparison to the analytic (Dupuit's) solution available for the uniformly constant permeability property; (ii) strain and deformation pattern, and (iii) stability of the given slope assessed in terms of factor of safety (FS). The results obtained in this study are useful to understand the role of permeability variations in slope stability analysis under different slope conditions and material properties. (C) 2009 Elsevier B.V. All rights reserved.

Algebraic distributed space-time codes with low ML decoding complexity

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

Distributed joint source channel coding on a multiple access channel with side information

We consider the problem of transmission of several discrete sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient conditions are provided for transmission of sources with a given distortion. The channel could have continuous alphabets (Gaussian MAC is a special case). Various previous results are obtained as special cases.

Detection of contiguous and distributed damage through contours of equal frequency change

The paper presents the results of a computational modeling for damage identification process for an axial rod representing an end-bearing pile foundation with known damage and a simply supported beam representing a bridge girder. The paper proposes a methodology for damage identification from measured natural frequencies of a contiguously damaged reinforced concrete axial rod and beam, idealized with distributed damage model. Identification of damage is from Equal_Eigen_value_change (Iso_Eigen_value_Change) contours, plotted between pairs of different frequencies. The performance of the method is checked for a wide variation of damage positions and extents. An experiment conducted on a free-free axially loaded reinforced concrete member and a flexural beam is shown as examples to prove the pros and cons of this method. (C) 2009 Elsevier Ltd. All rights reserved.

Distributed space-time codes for cooperative networks with partial CSI

Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are reported, when the relay nodes are assumed to have knowledge of the phase component of the source to relay channel gains. It is shown that this under this partial channel state information (CSI), several well known space time codes for the colocated MIMO (Multiple Input Multiple Output) channel become amenable for use as DSTCs. In particular, the well known complex orthogonal designs, generalized coordinate interleaved orthogonal designs (GCIODs) and unitary weight single symbol decodable (UW-SSD) codes are shown to satisfy the required design constraints for DSTCs. Exploiting the relaxed code design constraints, we propose DSTCs obtained from Clifford Algebras which have low ML decoding complexity.

Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems

Solving large-scale all-to-all comparison problems using distributed computing is increasingly significant for various applications. Previous efforts to implement distributed all-to-all comparison frameworks have treated the two phases of data distribution and comparison task scheduling separately. This leads to high storage demands as well as poor data locality for the comparison tasks, thus creating a need to redistribute the data at runtime. Furthermore, most previous methods have been developed for homogeneous computing environments, so their overall performance is degraded even further when they are used in heterogeneous distributed systems. To tackle these challenges, this paper presents a data-aware task scheduling approach for solving all-to-all comparison problems in heterogeneous distributed systems. The approach formulates the requirements for data distribution and comparison task scheduling simultaneously as a constrained optimization problem. Then, metaheuristic data pre-scheduling and dynamic task scheduling strategies are developed along with an algorithmic implementation to solve the problem. The approach provides perfect data locality for all comparison tasks, avoiding rearrangement of data at runtime. It achieves load balancing among heterogeneous computing nodes, thus enhancing the overall computation time. It also reduces data storage requirements across the network. The effectiveness of the approach is demonstrated through experimental studies.

High-level expression of biologically active glycoprotein hormones in Pichia pastoris strains—selection of strain GS115, and not X-33, for the production of biologically active N-glycosylated 15N-labeled phCG

The methylotrophic yeast Pichia pastoris is widely used for the production of recombinant glycoproteins. With the aim to generate biologically active 15N-labeled glycohormones for conformational studies focused on the unravelling of the NMR structures in solution, the P. pastoris strains GS115 and X-33 were explored for the expression of human chorionic gonadotropin (phCG) and human follicle-stimulating hormone (phFSH). In agreement with recent investigations on the N-glycosylation of phCG, produced in P. pastoris GS115, using ammonia/glycerol-methanol as nitrogen/carbon sources, the N-glycosylation pattern of phCG, synthesized using NH4Cl/glucose–glycerol–methanol, comprised neutral and charged, phosphorylated high-mannose-type N-glycans (Man8–15GlcNAc2). However, the changed culturing protocol led to much higher amounts of glycoprotein material, which is of importance for an economical realistic approach of the aimed NMR research. In the context of these studies, attention was also paid to the site specific N-glycosylation in phCG produced in P. pastoris GS115. In contrast to the rather simple N-glycosylation pattern of phCG expressed in the GS115 strain, phCG and phFSH expressed in the X-33 strain revealed, besides neutral high-mannose-type N-glycans, also high concentrations of neutral hypermannose-type N-glycans (Manup-to-30GlcNAc2). The latter finding made the X-33 strain not very suitable for generating 15N-labeled material. Therefore, 15N-phCG was expressed in the GS115 strain using the new optimized protocol. The 15N-enrichment was evaluated by 15N-HSQC NMR spectroscopy and GLC-EI/MS. Circular dichroism studies indicated that 15N-phCG/GS115 had the same folding as urinary hCG. Furthermore, 15N-phCG/GS115 was found to be similar to the unlabeled protein in every respect as judged by radioimmunoassay, radioreceptor assays, and in vitro bioassays.

High-rate, Single-Symbol Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of an the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2, which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.

Interactive Distributed Source Coding in Asymmetric Communication Scenarios

We provide a new unified framework, called "multiple correlated informants - single recipient" communication, to address the variations of the traditional Distributed Source Coding (DSC) problem. Different combinations of the assumptions about the communication scenarios and the objectives of communication result in different variations of the DSC problem. For each of these variations, the complexities of communication and computation of the optimal solution is determined by the combination of the underlying assumptions. In the proposed framework, we address the asymmetric, interactive, and lossless variant of the DSC problem, with various objectives of communication and provide optimal solutions for those. Also, we consider both, the worst-case and average-case scenarios.

OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time block code (DSTBC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DST-BCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time block codes applicable in this new transmission scheme for power of two number of relays are also provided.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Ductile deformation of single inclusions in simple shear with a finite-strain hyperelastoviscoplastic rheology

We examine the 2D plane-­strain deformation of initially round, matrix-­bonded, deformable single inclusions in isothermal simple shear using a recently introduced hyperelastoviscoplastic rheology. The broad parameter space spanned by the wide range of effective viscosities, yield stresses, relaxation times, and strain rates encountered in the ductile lithosphere is explored systematically for weak and strong inclusions, the effective viscosity of which varies with respect to the matrix. Most inclusion studies to date focused on elastic or purely viscous rheologies. Comparing our results with linear-­viscous inclusions in a linear-­viscous matrix, we observe significantly different shape evolution of weak and strong inclusions over most of the relevant parameter space. The evolution of inclusion inclination relative to the shear plane is more strongly affected by elastic and plastic contributions to rheology in the case of strong inclusions. In addition, we found that strong inclusions deform in the transient viscoelastic stress regime at high Weissenberg numbers (≥0.01) up to bulk shear strains larger than 3. Studies using the shapes of deformed objects for finite-­strain analysis or viscosity-­ratio estimation should establish carefully which rheology and loading conditions reflect material and deformation properties. We suggest that relatively strong, deformable clasts in shear zones retain stored energy up to fairly high shear strains. Hence, purely viscous models of clast deformation may overlook an important contribution to the energy budget, which may drive dissipation processes within and around natural inclusions.