Axial binding of 2-methylimidazole to the tetraarylcarboxylatodiruthenium (II, III) core: X-ray crystal structure of [Ru-2(O2CC6H4-p-OMe)(4)(2-mimH)(2)](ClO4). 1.75CH(2)Cl(2).H2O

Diruthenium (II. III) complexes of the type [Ru-2(O2CAr)(4) (2-mimH)(2)](ClO4) (Ar = C6H4-p-X : X=OMe,1, X=Me, 2, 2-mimH=2-methylimidazole) have been isolated from the reaction of Ru2Cl(O2CAr)(4) with 2-mimH in CH2Cl2 followed by the addition of NaClO4. The crystal structure of 1.1.75CH(2)Cl(2).H2O has been determined. The crystal belongs to the monoclinic space group p2(1)/c with the following unit cell dimensions for the C40H40N4O16ClRu2.1.75CH(2)Cl(2).H2O (M = 1237.0) : a = 12.347(3)Angstrom, b = 17.615(5)Angstrom, c = 26.148(2)Angstrom,beta = 92.88(1)degrees. v = 5679(2)Angstrom(3). Z=4, D-c = 1.45 g cm(-3). lambda(Mo-K-alpha) = 0.7107 Angstrom, mu(Mo-K-alpha) = 8.1 cm(-1), T = 293 K, R = 0.0815 (wR(2) = 0.2118) for 5834 reflections with 1 > 2 sigma(I). The complex has a tetracarboxylatodiruthenium (II, III) core and two axially bound 2-methylimidazole ligands. The Ru-Ru bond length is 2.290(1)Angstrom. The Ru-Ru bond order is 2.5 and the complex is three-electron paramagnetic. The complex shows an irreversible Ru-2(II,III)-->Ru-2(Il,II) reduction near -0.2 V vs SCE in CH2Cl2-0. 1 MTBAP. The complexes exemplify the first adduct of the tetracarboxylatodiruthenium (II,III) core having N-donor ligands

Texture Evolution in Boron Modified Ti-6Al-4V Alloy

Owing to their high strength-to-weight ratio, excellent mechanical properties and corrosion resistance, titanium (Ti) and its alloys, especially (alpha+beta) alloys like Ti-6Al-4V is the backbone materials for aerospace, energy, and chemical industries. Trace boron addition (similar to 0.1 wt. %) to the alloy Ti-6Al-4V produces a reduction in as-cast grain size by roughly an order of magnitude resulting in enhanced ductility, higher stiffness, strength and good fracture resistance. Boron addition could also affect the evolution of texture and microstructure in the material. The solidification microstructures of Boron free as well as Boron containing Ti-6Al-4V are found to be almost homogeneous from periphery towards the center of as-cast ingot in terms of both alpha-colony size and distribution. Boron addition substantially reduces alpha-colony size (similar to 50-80 mu m). A gradual change in alpha texture from periphery towards the center has been observed with orientations close to specific texture components suggesting the formation of texture zones. The mechanism of texture evolution can be visualized as a result of variant selection during solidification through (alpha+beta) phase field.

Evolution of Transformation Texture in a Metastable B - Titanium Alloy

Texture evolution in h. c. p. (alpha) phase derived from aging of a differently processed metastable b.c.c. (beta) titanium alloy was investigated. The study was aimed at examining (i) the effect of different b. c. c. cold rolling textures and (ii) the effect of different defect structures on the h. c. p transformation texture. The alloy metastable beta alloy Ti-10V-4.5Fe-1.5Al was rolled at room temperature by unidirectional (UDR) and multi-step cross rolling (MSCR). A piece of the as-rolled materials were subjected to aging in order to derive the h. c. p. (alpha) phase. In the other route, the as-rolled materials were recrystallized and then aged. Textures were measured using X-ray as well as Electron Back Scatter Diffraction. Rolling texture of beta phase, as characterized by the presence of a strong gamma fibre, was found stronger in M S C R compared to UDR, although they were qualitatively similar. The stronger texture of MSCR sample could be attributed to the inhomogeneous deformation taking place in the sample that might contribute to weakening of texture. Upon recrystallization in beta phase field close to beta-transus. the textures qualitatively resembled the corresponding beta deformation textures; however, they got strengthed. The aging of differently beta rolled samples resulted in the product alpha-phase with different textures. The (UDR + Aged) sample had a stronger texture than (MSCR + Aged) sample, which could be due to continuation of defect accumulation in UDR sample, thus providing more potential sites for the nucleation of alpha phase. The trend was reversed in samples recrystallized prior to aging. The (MSCR + Recrystallized + Aged) sample showed stronger texture of alpha phase than the (UDR + Recrystallized + Aged) sample. This could be attributed to extensive defect annihilation in the UDR sample on recrystallization prior to aging. The (MSCR + Aged) sample exhibited more alpha variants when compared to (MSCR + Recrystallized + Aged) sample. This has been attributed to the availability of more potential sites for nucleation of alpha phase in the former. It could be concluded that alpha transformation texture depends mainly on the defect structure of the parent phase.

Relationship between nonlinear resistivity and the varistor forming mechanism in ZnO ceramics

The use of a number of perovskite phases M� M�O3-x, as the only forming additive in ZnO ceramics, produces a high nonlinearity index, ?(up to 45), where M� is a multivalent transition?metal ion and M� is an alkaline earth or a rare?earth ion. From this study, the formation parameters crucial to high nonlinearity, such as nonstoichiometry in the as?received ZnO powder, low x values of the additives and fast cooling rate after the sintering, are explainable on the basis of a depletion layer formation at the presintering stage. This is because of the surface states arising out of the chemisorbed oxygen. The depletion layer is retained during sintering as a result of the higher valence state of M� ions, preferentially present at the grain?boundary regions. The fast cooling freezes in the high?temperature concentration of donor?type defects, thereby decreasing the depletion layer width.

Coloured Petri net models for automated manufacturing systems

In this paper, we propose an approach, using Coloured Petri Nets (CPN) for modelling flexible manufacturing systems. We illustrate our methodology for a Flexible Manufacturing Cell (FMC) with three machines and three robots. We also consider the analysis of the FMC for deadlocks using the invariant analysis of CPNs.

Functional Analysis of DNA Replication Fork Reversal Catalyzed by Mycobacterium tuberculosis RuvAB Proteins

Initially discovered in Escherichia coli, RuvAB proteins are ubiquitous in bacteria and play a dual role as molecular motor proteins responsible for branch migration of the Holliday junction(s) and reversal of stalled replication forks. Despite mounting genetic evidence for a crucial role of RuvA and RuvB proteins in reversal of stalled replication forks, the mechanistic aspects of this process are still not fully understood. Here, we elucidate the ability of Mycobacterium tuberculosis RuvAB (MtRuvAB) complex to catalyze the reversal of replication forks using a range of DNA replication fork substrates. Our studies show that MtRuvAB, unlike E. coli RuvAB, is able to drive replication fork reversal via the formation of Holliday junction intermediates, suggesting that RuvAB-catalyzed fork reversal involves concerted unwinding and annealing of nascent leading and lagging strands. We also demonstrate the reversal of replication forks carrying hemi-replicated DNA, indicating that MtRuvAB complex-catalyzed fork reversal is independent of symmetry at the fork junction. The fork reversal reaction catalyzed by MtRuvAB is coupled to ATP hydrolysis, is processive, and culminates in the formation of an extended reverse DNA arm. Notably, we found that sequence heterology failed to impede the fork reversal activity of MtRuvAB. We discuss the implications of these results in the context of recognition and processing of varied types of replication fork structures by RuvAB proteins.

A novel interrogation system for fiber Bragg grating sensor array

Interrogation techniques for fiber Bragg grating sensor arrays need particular attention in the case of structural health monitoring applications involving dynamic strain measurement. Typically the performance of the sensing system is dependent on both the sensor type and the interrogation method employed. A novel interrogation system is proposed here that consists of different interrogation units for each sensor in the array, each unit comprising of a circulator, chirped grating and a Mach-Zehnder interferometer. We present an analysis that consists of tracking the spectral changes as the light passes through various elements in the interrogation system. This is expected to help in the optimization of sensor and interrogation elements leading to improved performance of the health monitoring system.

q-Gaussian based Smoothed Functional Algorithms for Stochastic Optimization

The q-Gaussian distribution results from maximizing certain generalizations of Shannon entropy under some constraints. The importance of q-Gaussian distributions stems from the fact that they exhibit power-law behavior, and also generalize Gaussian distributions. In this paper, we propose a Smoothed Functional (SF) scheme for gradient estimation using q-Gaussian distribution, and also propose an algorithm for optimization based on the above scheme. Convergence results of the algorithm are presented. Performance of the proposed algorithm is shown by simulation results on a queuing model.

Secure Computation in a Bidirectional Relay

Bidirectional relaying, where a relay helps two user nodes to exchange equal length binary messages, has been an active area of recent research. A popular strategy involves a modified Gaussian MAC, where the relay decodes the XOR of the two messages using the naturally-occurring sum of symbols simultaneously transmitted by user nodes. In this work, we consider the Gaussian MAC in bidirectional relaying with an additional secrecy constraint for protection against a honest but curious relay. The constraint is that, while the relay should decode the XOR, it should be fully ignorant of the individual messages of the users. We exploit the symbol addition that occurs in a Gaussian MAC to design explicit strategies that achieve perfect independence between the received symbols and individual transmitted messages. Our results actually hold for a more general scenario where the messages at the two user nodes come from a finite Abelian group G, and the relay must decode the sum within G of the two messages. We provide a lattice coding strategy and study optimal rate versus average power trade-offs for asymptotically large dimensions.

A Two Stage Selective Averaging LDPC Decoding

Low density parity-check (LDPC) codes are a class of linear block codes that are decoded by running belief propagation (BP) algorithm or log-likelihood ratio belief propagation (LLR-BP) over the factor graph of the code. One of the disadvantages of LDPC codes is the onset of an error floor at high values of signal to noise ratio caused by trapping sets. In this paper, we propose a two stage decoder to deal with different types of trapping sets. Oscillating trapping sets are taken care by the first stage of the decoder and the elementary trapping sets are handled by the second stage of the decoder. Simulation results on the regular PEG (504,252,3,6) code and the irregular PEG (1024,518,15,8) code shows that the proposed two stage decoder performs significantly better than the standard decoder.

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

DMT-optimal, Low ML-Complexity STBC-Schemes for Asymmetric MIMO Systems

For an n(t) transmit, nr receive antenna (n(t) x n(r)) MIMO system with quasi- static Rayleigh fading, it was shown by Elia et al. that space-time block code-schemes (STBC-schemes) which have the non-vanishing determinant (NVD) property and are based on minimal-delay STBCs (STBC block length equals n(t)) with a symbol rate of n(t) complex symbols per channel use (rate-n(t) STBC) are diversity-multiplexing gain tradeoff (DMT)-optimal for arbitrary values of n(r). Further, explicit linear STBC-schemes (LSTBC-schemes) with the NVD property were also constructed. However, for asymmetric MIMO systems (where n(r) < n(t)), with the exception of the Alamouti code-scheme for the 2 x 1 system and rate-1, diagonal STBC-schemes with NVD for an nt x 1 system, no known minimal-delay, rate-n(r) LSTBC-scheme has been shown to be DMT-optimal. In this paper, we first obtain an enhanced sufficient criterion for an STBC-scheme to be DMT optimal and using this result, we show that for certain asymmetric MIMO systems, many well-known LSTBC-schemes which have low ML-decoding complexity are DMT-optimal, a fact that was unknown hitherto.

Active Sequential Hypothesis Testing with Application to a Visual Search Problem

We consider a visual search problem studied by Sripati and Olson where the objective is to identify an oddball image embedded among multiple distractor images as quickly as possible. We model this visual search task as an active sequential hypothesis testing problem (ASHT problem). Chernoff in 1959 proposed a policy in which the expected delay to decision is asymptotically optimal. The asymptotics is under vanishing error probabilities. We first prove a stronger property on the moments of the delay until a decision, under the same asymptotics. Applying the result to the visual search problem, we then propose a ``neuronal metric'' on the measured neuronal responses that captures the discriminability between images. From empirical study we obtain a remarkable correlation (r = 0.90) between the proposed neuronal metric and speed of discrimination between the images. Although this correlation is lower than with the L-1 metric used by Sripati and Olson, this metric has the advantage of being firmly grounded in formal decision theory.