Mycobacterium tuberculosis Expresses ftsE Gene Through Multiple Transcripts

Bacterial FtsE gene codes for the ATP-binding protein, FtsE, which in complex with the transmembrane protein, FtsX, participates in diverse cellular processes. Therefore, regulated expression of FtsE and FtsX might be critical to the human pathogen, Mycobacterium tuberculosis, under stress conditions. Although ftsX gene of M. tuberculosis (MtftsX) is known to be transcribed from a promoter inside the upstream gene, ftsE, the transcriptional status of ftsE gene of M. tuberculosis (MtftsE) remains unknown. Therefore, the authors initiated transcriptional analyses of MtftsE, using total RNA from M. tuberculosis cells that were grown under stress conditions, which the pathogen is exposed to, in granuloma in tuberculosis patients. Primer extension experiments showed the presence of putative transcripts, T1, T2, T3, and T4. T1 originated from the intergenic region between the upstream gene, MRA_3135, and MtftsE. T2 and T3 were found initiated from within MRA_3135. T4 was transcribed from a region upstream of MRA_3135. RT-PCR confirmed co-transcription of MRA_3135 and MtftsE. The cloned putative promoter regions for T1, T2, and T3 elicited transcriptional activity in Mycobacterium smegmatis transformants. T1, T2, and T3, but no new transcript, were present in the M. tuberculosis cells that were grown under the stress conditions, which the pathogen is exposed to in granuloma in tuberculosis patients. It showed lack of modulation of MtftsE transcripts under the stress conditions tested, indicating that ftsE may not have a stress response-specific function in M. tuberculosis.

An integrated model for optimal reservoir operation for irrigation of multiple crops

An integrated model is developed, based on seasonal inputs of reservoir inflow and rainfall in the irrigated area, to determine the optimal reservoir release policies and irrigation allocations to multiple crops. The model is conceptually made up of two modules, Module 1 is an intraseasonal allocation model to maximize the sum of relative yields of all crops, for a given state of the system, using linear programming (LP). The module takes into account reservoir storage continuity, soil moisture balance, and crop root growth with time. Module 2 is a seasonal allocation model to derive the steady state reservoir operating policy using stochastic dynamic programming (SDP). Reservoir storage, seasonal inflow, and seasonal rainfall are the state variables in the SDP. The objective in SDP is to maximize the expected sum of relative yields of all crops in a year. The results of module 1 and the transition probabilities of seasonal inflow and rainfall form the input for module 2. The use of seasonal inputs coupled with the LP-SDP solution strategy in the present formulation facilitates in relaxing the limitations of an earlier study, while affecting additional improvements. The model is applied to an existing reservoir in Karnataka State, India.

Blind separation of multiple co-channel BPSK signals arriving at an antenna array

In this letter, we propose a method for blind separation of d co-channel BPSK signals arriving at an antenna array. Our method involves two steps. In the first step, the received data vectors at the output of the array is grouped into 2d clusters. In the second step, we assign the 2d d-tuples with ±1 elements to these clusters in a consistent fashion. From the knowledge of the cluster to which a data vector belongs, we estimate the bits transmitted at that instant. Computer simulations are used to study the performance of our method

Cascades of Selective Pulses on Connected Single-Quantum Transitions Leading to the Selective Excitation of Multiple-Quantum Coherences

A symmetric cascade of selective pulses applied on connected transitions leads to the excitation of a selected multiple-quantum coherence by a well-defined angle. This cascade selectively operates on the subspace of the multiple-quantum coherence and acts as a generator of rotation selectively on the multiple-quantum subspace. Single-transition operator algebra has been used to explain these experiments. Experiments have been performed on two- and three-spin systems. It is shown that such experiments can be utilized to measure the relaxation times of selected multiple-quantum coherences or of a specifically prepared initial longitudinal state of the spin system.

Quasicrystals, crystals and multiple twins in rapidly solidified Al-Cr-Si, Al-Mn-Si and Al-Mn-Cr-Si alloys

The coexistence of quasicrystals and rational approximant structures (RAS) has been observed in melt-spun Al80Cr14Si6, Al80Mn14Si6 and Al75Mn10Cr5Si10 alloys. The presence of a b.c.c. alpha-AlMnSi phase in Al-Mn-Si and alpha-AlMnSi(Cr) phase in Al-Mn-Cr-Si has been seen. A multiple twinning around an irrational axis of the RAS has been reported in an aggregate of fine size cubic crystallites in all three alloys. Selected area diffraction patterns show that the crystalline aggregate symmetry is linked to the icosahedral point group symmetry (m35). Various ways of expressing the twin relationship in the cubic crystalline aggregates have been discussed. The thermal stability of the icosahedral phase at high temperatures reveals that the icosahedral phase in Al-Mn-Si and Al-Mn-Cr-Si alloys transforms to alpha-AlMnSi at temperatures of 690 and 670 K, respectively. In Al-Cr-Si alloy, heating to a high temperature (615 K) leads to the transformation of the icosahedral phase into a new metastable phase having an ordered cubic structure equivalent to alpha-AlMnSi. The occurrence of multiple twinning leading to icosahedral symmetry in the as-spun Al-Cr-Si alloy is presumably due to this metastable phase. Copyright (C) 1996 Acta Metallurgica Inc.

The Folding Mechanism of Barstar: Evidence for Multiple Pathways and Multiple Intermediates

The mechanism of folding of the small protein barstar in the pre-transition zone at pH 7, 25 degrees C has been characterized using rapid mixing techniques. Earlier studies had established the validity of the three-state U-S reversible arrow U-F reversible arrow N mechanism for folding and unfolding in the presence of guanidine hydrochloride (GdnHCl) at concentrations greater than 2.0 M, where U-S and U-F are the slow-refolding and fast-refolding unfolded forms, respectively, and N is the fully folded form. It is now shown that early intermediates, I-S1 and I-S2 as well as a late native-like intermediate, I-N, are present on the folding pathways of U-S, and an early intermediate I-F1 on the folding pathway of U-F, when bars tar is refolded in concentrations of GdnHCl below 2.0 M. The rates of formation and disappearance of I-N, and the rates of formation of N at three different concentrations of GdnHCl in the pre-transition zone have been measured. The data indicate that in 1.5 M GdnHCl, I-N is not fully populated on the U-S --> I-S1 --> I-N --> N pathway because the rate of its formation is so slow that the U-S reversible arrow U-F reversible arrow N pathway can effectively compete with that pathway. In 1.0 M GdnHCl, the U-S --> I-S1 --> I-N transition is so fast that I-N is fully populated. In 0.6 M GdnHCl, I-N appears not to be fully populated because an alternative folding pathway, U-S --> I-S2 --> N, becomes available for the folding of U-S, in addition to the U-S --> I-S1 --> I-N --> N pathway Measurement of the binding of the hydrophobic dye 1-anilino-8-naphthalenesulphonate (ANS) during folding indicates that ANS binds to two distinct intermediates, I-M1 and I-M2, that form within 2 ms on the U-S --> I-M1 --> I-S1 --> I-N --> N and U-S --> I-M2 --> I-S2 --> N pathways. There is no evidence for the accumulation of intermediates that can bind ANS on the folding pathway of U-F.

Stability and throughput analysis of unslotted CDMA-ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA-ALOHA (with and without code sharing) and TDMA-ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis pf a continuous time Markov chain. Our results show how saturation throughput degrades with code-sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which "chips" can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA-ALOHA yields better capacity than TDMA-ALOHA.

Rearrangement approaches to sesquiterpenes containing multiple contiguous quaternary carbon atoms. Total synthesis of (+/-)-myltayl-8(12)-ene and (+/-)-6-epijunicedranol

Details of the first total syntheses of the sesquiterpenes myltayl-8(12)-ene and 6-epijunicedran-8-ol are described. The aldehyde 13, obtained by Claisen rearrangement of cyclogeraniol, was transformed into the dienones 12 and 18. Boron trifluoride-diethyl ether mediated cyclization and rearrangement transformed the dienones 12 and 18 into the tricyclic ketones 16 and 17, efficiently creating three and four contiguous quaternary carbon atoms, respectively. Wittig methylenation of 16 furnished (+/-)-myltayl-8(12)-ene (11), whereas reduction of the ketone 17 furnished (+/-)-6-epijunicedranol (23).

A game theoretical multiple resource interaction approach to resource allocation in an air campaign

In this paper we propose a multiple resource interaction model in a game-theoretical framework to solve resource allocation problems in theater level military campaigns. An air raid campaign using SEAD aircraft and bombers against an enemy target defended by air defense units is considered as the basic platform. Conditions for the existence of saddle point in pure strategies is proved and explicit feedback strategies are obtained for a simplified model with linear attrition function limited by resource availability. An illustrative example demonstrates the key features.

Novel subspace methods for blind estimation of multiple CFOs in MIMO-OFDM systems

The problem of estimating multiple Carrier Frequency Offsets (CFOs) in the uplink of MIMO-OFDM systems with Co-Channel (CC) and OFDMA based carrier allocation is considered. The tri-linear data model for generalized, multiuser OFDM system is formulated. Novel blind subspace based estimation of multiple CFOs in the case of arbitrary carrier allocation scheme in OFDMA systems and CC users in OFDM systems based on the Khatri-Rao product is proposed. The method works where the conventional subspace method fails. The performance of the proposed methods is compared with pilot based Least-Squares method.

Damped Belief Propagation Based Near-Optimal Equalization of Severely Delay-Spread UWB MIMO-ISI Channels

In this paper, we present a belief propagation (BP) based equalizer for ultrawideband (UWB) multiple-input multiple-output (MIMO) inter-symbol interference (ISI) channels characterized by severe delay spreads. We employ a Markov random field (MRF) graphical model of the system on which we carry out message passing. The proposed BP equalizer is shown to perform increasingly closer to optimal performance for increasing number of multipath components (MPC) at a much lesser complexity than that of the optimum equalizer. The proposed equalizer performs close to within 0.25 dB of SISO AWGN performance at 10-3 bit error rate on a severely delay-spread MIMO-ISI channel with 20 equal-energy MPCs. We point out that, although MIMO/UWB systems are characterized by fully/densely connected graphical models, the following two proposed features are instrumental in achieving near-optimal performance for large number of MPCs at low complexities: i) use of pairwise compatibility functions in densely connected MRFs, and ii) use of damping of messages.

BER Analysis of Uplink OFDMA in the Presence of Carrier Frequency and Timing Offsets on Rician Fading Channels

In uplink orthogonal frequency division multiple access (OFDMA), carrier frequency offsets (CFO) and/or timing offsets (TO) of other users with respect to a desired user can cause significant multiuser interference (MUI). In this paper, we derive an analytical bit error rate (BER) expression that quantify the degradation in BER due to the combined effect of both CFOs and TOs in uplink OFDMA on Rician fading channels. Such an analytical BER derivation for uplink OFDMA with CFOs and TOs on Rician fading channels has not been reported so far. For the case of non-zero CFOs/TOs, we obtain an approximate BER expression involving a single integral. Analytical and simulation BER results are shown to match very well.

Quasi-Orthogonal Design and Performance Analysis of Amplify-And-Forward Relay Networks with Multiple-Antennas

This paper is on the design and performance analysis of practical distributed space-time codes for wireless relay networks with multiple antennas terminals. The amplify-andforward scheme is used in a way that each relay transmits a scaled version of the linear combination of the received symbols. We propose distributed generalized quasi-orthogonal space-time codes which are distributed among the source antennas and relays, and valid for any number of relays. Assuming M-PSK and M-QAM signals, we derive a formula for the symbol error probability of the investigated scheme over Rayleigh fading channels. For sufficiently large SNR, this paper derives closed-form average SER expression. The simplicity of the asymptotic results provides valuable insights into the performance of cooperative networks and suggests means of optimizing them. Our analytical results have been confirmed by simulation results, using full-rate full-diversity distributed codes.

Performance analysis of single-symbol maximum likelihood decodable linear STBCs

Performance of space-time block codes can be improved using the coordinate interleaving of the input symbols from rotated M-ary phase shift keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) constellations. This paper is on the performance analysis of coordinate-interleaved space-time codes, which are a subset of single-symbol maximum likelihood decodable linear space-time block codes, for wireless multiple antenna terminals. The analytical and simulation results show that full diversity is achievable. Using the equivalent single-input single-output model, simple expressions for the average bit error rates are derived over flat uncorrelated Rayleigh fading channels. Optimum rotation angles are found by finding the minimum of the average bit error rate curves.

Improved large-MIMO detection based on damped belief propagation

In this paper, we consider the application of belief propagation (BP) to achieve near-optimal signal detection in large multiple-input multiple-output (MIMO) systems at low complexities. Large-MIMO architectures based on spatial multiplexing (V-BLAST) as well as non-orthogonal space-time block codes(STBC) from cyclic division algebra (CDA) are considered. We adopt graphical models based on Markov random fields (MRF) and factor graphs (FG). In the MRF based approach, we use pairwise compatibility functions although the graphical models of MIMO systems are fully/densely connected. In the FG approach, we employ a Gaussian approximation (GA) of the multi-antenna interference, which significantly reduces the complexity while achieving very good performance for large dimensions. We show that i) both MRF and FG based BP approaches exhibit large-system behavior, where increasingly closer to optimal performance is achieved with increasing number of dimensions, and ii) damping of messages/beliefs significantly improves the bit error performance.