Phase nonequilibrium effects on the gain of a two-phase flow gasdynamic laser

Analysis of gas-particle nozzle flow is carried out with attention to the effect of dust particles on the vibrational relaxation phenomena and consequent effects on the gain of a gasdynamic laser. The phase nonequilibrium between the gas mixture and the particles during the nozzle expansion process is taken into account simultaneously. The governing equations of the two-phase nozzle flow have been transformed into similar form, and general correlating parameters have been obtained. It is shown from the present analysis that the particles present in the mixture affect the optimum gain obtainable from a gasdynamic laser adversely, and the effect depends on the size and loading of the particles in the mixture.

Gain calibration of CCD systems at VBO

The system gain of two CCD systems in regular use at the Vainu Bappu Observatory, Kavalur, is determined at a few gain settings. The procedure used for the determination of system gain and base-level noise is described in detail. The Photometrics CCD system at the 1-m reflector uses a Thomson-CSF TH 7882 CDA chip coated for increased ultraviolet sensitivity. The gain is programme-selected through the parameter 'cgain' varying between 0 and 4095 in steps of 1. The inverse system gain for this system varies almost linearly from 27.7 electrons DN-1 at cgain = 0 to 1.5 electrons DN-1 at cgain = 500. The readout noise is less than or similar 11 electrons at cgain = 66. The Astromed CCD system at 2.3-m Vainu Bappu Telescope uses a GEC P8603 chip which is also coated for enhanced ultraviolet sensitivity. The amplifier gain is selected in discrete steps using switches in the controller. The inverse system gain is 4.15 electrons DN-1 at the gain setting of 9.2, and the readout noise approximately 8 electrons.

Edge-sharing bioctahedral diruthenium(III) complexes containing methoxy and carboxylate bridges:x-ray structures, redox behavior, and core stability

Edge-sharing bioctahedral (ESBO) complexes [Ru-2(OMe)(O2CC6H4-p-X)3(1-MeIm)(4)](ClO4)2 (X = OMe (1a), Me (1b)) and [Ru-2(O2CC6H4-P-X)(4)(1-MeIm)(4)](ClO4)(2) (X = OMe (2a), Me (2b)) are prepared by reacting Ru2Cl(O(2)CR)(4) with 1-methylimidazole (1-MeIm) in methanol followed by treatment with NaClO4. Complex 2a and the PF6- salt (1a') of 1a have been structurally characterized. Crystal data for 1a.1.5MeCN. 0.5Et(2)O: triclinic, P (1) over bar, a = 13.125(2) Angstrom, b = 15.529(3) Angstrom, c 17.314(5) Angstrom, a; 67.03(2)degrees, beta 68.05(2)degrees, gamma = 81.38(1)degrees, V 3014(1) Angstrom(3), Z = 2. Crystal data for 2a: triclinic, P (1) over bar, a 8.950(1) Angstrom, b = 12.089(3) Angstrom, c = 13.735(3) Angstrom, alpha 81.09(2)degrees, beta = 72.27(1)degrees, gamma = 83.15(2)degrees, V = 1394(1) Angstrom(3), Z = 1. The complexes consist of a diruthenium(III) unit held by two monoatomic and two three-atom bridging ligands. The 1-MeIm ligands are at the terminal sites of the [Ru-2(mu-L)(eta(1):mu-O(2)CR)(eta(1):eta(1):mu-O(2)CR)(2)](2+) core having a Ru-Ru single bond (L = OMe or eta(1)-O(2)CR). The Ru-Ru distance and the Ru-O-Ru angle in the core of 1a' and 2a are 2.49 Angstrom and similar to 76 degrees. The complexes undergo one-electron oxidation and reduction processes in MeCN-0.1 M TBAP to form mixed-valence diruthenium species with Ru-Ru bonds of orders 1.5 and 0.5, respectively.

A Low-Complexity, Full-Rate, Full-Diversity 2 x 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 x 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

On the improvement of diversity-multiplexing gain tradeoff in a training based TDD-simo system

This paper investigates the diversity-multiplexing gain tradeoff (DMT) of a time-division duplex (TDD) single-input multiple-output (SIMO) system with perfect channel state information (CSI) at the receiver (CSIR) and partial CSI at the transmitter (CSIT). The partial CSIT is acquired through a training sequence from the receiver to the transmitter. The training sequence is chosen in an intelligent manner based on the CSIR, to reduce the training length by a factor of r, the number of receive antennas. We show that, for the proposed training scheme and a given channel coherence time, the diversity order increases linearly with r for nonzero multiplexing gain. This is a significant improvement over conventional orthogonal training schemes.

Lazy structure sharing for query optimization

We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types, We investigate a number of strategies for implementing lazy structure sharing and provide upper and lower bounds on their performance (how quickly they effect ideal configurations of our data structure). In most cases when the strategies are applied to a restricted case of the problem, the bounds provide nontrivial improvements over the naive linear-time equivalence-testing strategy that employs no optimization. Only one strategy, however, which employs path compression, seems promising for the most general case of the problem.

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.

A Low-Complexity, Full-Rate, Full-Diversity 2x2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multipleoutput (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation.Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 × 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations,compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for nonrectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

Subcontracting Relationship of Indian SMEs with a Global TNC: Do SMEs Gain and How?

TNCs having their production bases in developing countries provide increasing opportunity for local SMEs to have subcontracting relationships with these TNCs.Even though some theoretical and a few empirical studies throw light on the nature of assistance provided by TNCs to local SMEs through subcontracting relationships,none of the studies so far analysed the diversity of assistance that subcontracting SMEs of India would be able to obtain from a TNC using quantitative measurement.This paper probes the extent of linkages and diversity of assistance that Indian subcontracting SMEs would be able to obtain from a TNC customer based on primary data from SME subcontractors of a major TNC automobile manufacturer. Statistical analysis of direct assistance revealed that SMEs receive more of product and purchase process assistance. The extent of assistance for their process related,marketing, human resource and financial requirements is low whereas the assistance for their organisational know-how requirements is moderate. The major indirect benefits these SMEs could achieve are knowledge transfer, business volume, superior work culture, reputation and quality improvement.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Theoretical gain optimization studies in 10.6 μm CO2–N2 gasdynamic lasers. IV. Further results of parametric study

Based on a method proposed by Reddy and Shanmugasundaram, similar solutions have been obtained for the steady inviscid quasi‐one‐dimensional nonreacting flow in the supersonic nozzle of CO2–N2–H2O and CO2–N2–He gasdynamic laser systems. Instead of using the correlations of a nonsimilar function NS for pure N2 gas, as is done in previous publications, the NS correlations are computed here for the actual gas mixtures used in the gasdynamic lasers. Optimum small‐signal optical gain and the corresponding optimum values of the operating parameters like reservoir pressure and temperature and nozzle area ratio are computed using these correlations. The present results are compared with the previous results and the main differences are discussed.

A High‐Gain Audiofrequency Amplifier

The design of a three‐stage high‐gain amplifier for laboratory use in audiofrequency investigations is described. Four‐electrode tubes are used as screen‐grid amplifiers and an amplification of the order of 200 per stage is obtained. The inaccuracy of McDonald's formula for calculation of stage‐gain has been pointed out. The gain‐frequency characteristics are given for power as well as voltage amplification. It is shown that extreme care is necessary in the design of shielding to obtain high‐voltage amplification of the order of 120 decibels as obtained in this three‐stage amplifier.

Cooperative Profit Sharing in Coalition-Based Resource Allocation in Wireless Networks

We consider a network in which several service providers offer wireless access to their respective subscribed customers through potentially multihop routes. If providers cooperate by jointly deploying and pooling their resources, such as spectrum and infrastructure (e.g., base stations) and agree to serve each others' customers, their aggregate payoffs, and individual shares, may substantially increase through opportunistic utilization of resources. The potential of such cooperation can, however, be realized only if each provider intelligently determines with whom it would cooperate, when it would cooperate, and how it would deploy and share its resources during such cooperation. Also, developing a rational basis for sharing the aggregate payoffs is imperative for the stability of the coalitions. We model such cooperation using the theory of transferable payoff coalitional games. We show that the optimum cooperation strategy, which involves the acquisition, deployment, and allocation of the channels and base stations (to customers), can be computed as the solution of a concave or an integer optimization. We next show that the grand coalition is stable in many different settings, i.e., if all providers cooperate, there is always an operating point that maximizes the providers' aggregate payoff, while offering each a share that removes any incentive to split from the coalition. The optimal cooperation strategy and the stabilizing payoff shares can be obtained in polynomial time by respectively solving the primals and the duals of the above optimizations, using distributed computations and limited exchange of confidential information among the providers. Numerical evaluations reveal that cooperation substantially enhances individual providers' payoffs under the optimal cooperation strategy and several different payoff sharing rules.