Anomalous Behavior of Linear Hydrocarbon Chains in Water-DMSO Binary Mixture at Low DMSO Concentration

We find that at a mole fraction 0.05 of DMSO (x(DMSO) = 0.05) in aqueous solution, a linear hydrocarbon chain of intermediate length (n = 30-40) adopts the most stable collapsed conformation. In pure water, the same chain exhibits an intermittent oscillation between the collapsed and the extended coiled conformations. Even when the mole fraction of DMSO in the bulk is 0.05, the concentration of the same in the first hydration layer around the hydrocarbon of chain length 30 (n = 30) is as large as 17%. Formation of such hydrophobic environment around the hydrocarbon chain may be viewed as the reason for the collapsed conformation gaining additional stability. We find a second anomalous behavior to emerge near x(DMSO) = 0.15, due to a chain-like aggregation of the methyl groups of DMSO in water that lowers the relative concentration of the DMSO molecules in the hydration layer. We further find that as the concentration of DMSO is gradually increased, it progressively attains the extended coiled structure as the stable conformation. Although Flory-Huggins theory (for binary mixture solvent) fails to predict the anomaly at x(DMSO) = 0.05, it seems to capture the essence of the anomaly at 0.15.

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.

Synthesis of single-walled carbon nanotubes using binary (Fe, Co, Ni) alloy nanoparticles prepared in situ by the reduction of oxide solid solutions

Passing a H-2-CH4 mixture over oxide spinels containing two transition elements as in Mg0.8MyMz'Al2O4 (M, M' = Fe, Co or Ni, y + z = 0.2) at 1070 degrees C produces small alloy nanoparticles which enable the formation of carbon nanotubes. Surface area measurements are found to be useful for assessing the yield and quality of the nanotubes. Good-quality single-walled nanotubes (SWNTs) have been obtained in high yields with the FeCo alloy nanoparticles, as evidenced by transmission electron microscope images and surface area measurements. The diameter of the SWNTs is in the 0.8-5 nm range, and the multiwalled nanotubes, found occasionally, possess very few graphite layers. (C) 1999 Elsevier Science B.V. All rights reserved.

On the achievable rates of sources having a group alphabet in a distributed source coding setting

We consider the problem of compression via homomorphic encoding of a source having a group alphabet. This is motivated by the problem of distributed function computation, where it is known that if one is only interested in computing a function of several sources, then one can at times improve upon the compression rate required by the Slepian-Wolf bound. The functions of interest are those which could be represented by the binary operation in the group. We first consider the case when the source alphabet is the cyclic Abelian group, Zpr. In this scenario, we show that the set of achievable rates provided by Krithivasan and Pradhan [1], is indeed the best possible. In addition to that, we provide a simpler proof of their achievability result. In the case of a general Abelian group, an improved achievable rate region is presented than what was obtained by Krithivasan and Pradhan. We then consider the case when the source alphabet is a non-Abelian group. We show that if all the source symbols have non-zero probability and the center of the group is trivial, then it is impossible to compress such a source if one employs a homomorphic encoder. Finally, we present certain non-homomorphic encoders, which also are suitable in the context of function computation over non-Abelian group sources and provide rate regions achieved by these encoders.

Cyclic Prefix Based Cooperative Sequential Spectrum Sensing Algorithms for OFDM

This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user is using Orthogonal Frequency Division Multiplexing (OFDM). For this we develop cooperative sequential detection algorithms that use the autocorrelation property of cyclic prefix (CP) used in OFDM systems. We study the effect of timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. We also modify the detector to mitigate the effects of these impairments. The performance of the proposed algorithms is studied via simulations. We show that sequential detection can significantly improve the performance over a fixed sample size detector.

Electrocatalytic efficiency of polyaniline by cyclic voltammetry and electrochemical impedance spectroscopy studies

Electrochemical redox reactions of ferrous/ferric (Fe2+/Fe3+) and hydroquinone/quinone (H(2)Q/Q) were studied on Pt and polyaniline (PANI)-deposited Pt electrodes in 0.5 M H2SO4-supporting electrolyte by cyclic voltammetry and ac impedance spectroscopy. A comparison of the experimental data obtained with the Pt and PANI/Pt electrodes suggested that the reactions were catalyzed by the PANI. Based on a relative increase in peak currents of cyclic voltammograms, catalytic efficiency (gamma(cv)) of the PANI was defined. There was an increase in gamma(cv) with an increase of scan rate and a decrease of concentration of Fe2+/Fe3+ or H(2)Q. The complex plane impedance spectrum of the electrode consisted of a semicircle in high frequency range and a linear spike in low frequency range. The exchange current density (i(0)) calculated using the semicircle part of the impedance showed Butler-Volmer kinetics with respect to concentration dependence. From a relative increase of i(0) on the PANI/Pt electrode, catalytic efficiency (gamma(eis)) was evaluated. (C) 2002 Elsevier Science B.V. All rights reserved.

Reaction of La2CuO4 with binary metal oxides in the solid state: Metathesis, addition, and redox metathesis pathways

Investigation of the reaction of La2CuO4 with several binary metal oxides in the solid state at elevated temperatures has revealed three different reaction pathways. Reaction of La2CuO4 with strongly acidic oxides such as Re2O7, MoO3, and V2O5 follows a metathesis route, yielding a mixture of products: La3ReO8/La2MoO6/LaVO4 and CuO. Oxides such as TiO2, MnO2, and RuO2 which are not so acidic yield addition products: La2CuMO6 (M = Ti, Mn, Ru). SnO2 is a special case which appears to follow a metathesis route, giving La2Sn2O7 pyrochlore and CuO, which on prolonged reaction transform to the layered perovskite La2CuSnO6. The reaction of La2CuO4 with lower valence oxides VO2 and MoO2, on the other hand, follows a novel redox metathesis route, yielding a mixture of LaVO4/LaCuO2 and La2MoO6/Cu, respectively. This result indicates that it is the redox reactivity involving V-IV + Cu-II --> V-V + Cu-I and Mo-IV + Cu-II --> Mo-VI + Cu-0, and not the acidity of the binary oxide, that controls the nature of the products formed in these cases. The general significance of these results toward the synthesis of complex metal oxides containing several metal atoms is discussed.

Scaling analysis of momentum, heat, and mass transfer in binary alloy solidification problems

A systematic approach is developed for scaling analysis of momentum, heat and species conservation equations pertaining to the case of solidification of a binary mixture. The problem formulation and description of boundary conditions are kept fairly general, so that a large class of problems can be addressed. Analysis of the momentum equations coupled with phase change considerations leads to the establishment of an advection velocity scale. Analysis of the energy equation leads to an estimation of the solid layer thickness. Different regimes corresponding to different dominant modes of transport are simultaneously identified. A comparative study involving several cases of possible thermal boundary conditions is also performed. Finally, a scaling analysis of the species conservation equation is carried out, revealing the effect of a non-equilibrium solidification model on solute segregation and species distribution. It is shown that non-equilibrium effects result in an enhanced macrosegregation compared with the case of an equilibrium model. For the sake of assessment of the scaling analysis, the predictions are validated against corresponding computational results.

Analytical solutions for heat transfer during cyclic melting and freezing of a phase change material used in electronic or electrical packaging

In this paper we develop an analytical heat transfer model, which is capable of analyzing cyclic melting and solidification processes of a phase change material used in the context of electronics cooling systems. The model is essentially based on conduction heat transfer, with treatments for convection and radiation embedded inside. The whole solution domain is first divided into two main sub-domains, namely, the melting sub-domain and the solidification sub-domain. Each sub-domain is then analyzed for a number of temporal regimes. Accordingly, analytical solutions for temperature distribution within each subdomain are formulated either using a semi-infinity consideration, or employing a method of quasi-steady state, depending on the applicability. The solution modules are subsequently united, leading to a closed-form solution for the entire problem. The analytical solutions are then compared with experimental and numerical solutions for a benchmark problem quoted in the literature, and excellent agreements can be observed.

Efficient statistical modeling for the compression of tree structured intermediate code

We propose a scheme for the compression of tree structured intermediate code consisting of a sequence of trees specified by a regular tree grammar. The scheme is based on arithmetic coding, and the model that works in conjunction with the coder is automatically generated from the syntactical specification of the tree language. Experiments on data sets consisting of intermediate code trees yield compression ratios ranging from 2.5 to 8, for file sizes ranging from 167 bytes to 1 megabyte.

Three-dimensional double-diffusive convection and macrosegregation during non-equilibrium solidification of binary mixtures

A three-dimensional transient mathematical model (following a fixed-grid enthalpy-based continuum formulation) is used to study the interaction of double-diffusive natural convection and non-equilibrium solidification of a binary mixture in a cubic enclosure cooled from a side. Investigations are carried out for two separate test systems, one corresponding to a typical model "metal-alloy analogue" system and other corresponding to a real metal-alloy system. Due to stronger effects of solutal buoyancy in actual metal-alloy systems than in corresponding analogues, the convective transport mechanisms for the two cases are quite different. However, in both cases, similar elements of three-dimensionality are observed in the curvature and spacing of the projected streamlines. As a result of three-dimensional convective flow patterns, a significant solute macrosegregation is observed across the transverse sections of the cavity, which cannot be captured by two-dimensional simulations. (C) 2003 Elsevier Science Ltd. All rights reserved.

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.

On the Successive Refinability of MIMO channels: DMT and codes

Diversity embedded space time codes are high rate codes that are designed such that they have a high diversity code embedded within them. A recent work by Diggavi and Tse characterizes the performance limits that can be achieved by diversity embedded space-time codes in terms of the achievable Diversity Multiplexing Tradeoff (DMT). In particular, they have shown that the trade off is successively refinable for rayleigh fading channels with one degree of freedom using superposition coding and Successive Interference Cancellation (SIC). However, for Multiple-Input Multiple-Output (MIMO) channels, the questions of successive refinability remains open. We consider MIMO Channels under superposition coding and SIC. We derive an upper bound on the successive refinement characteristics of the DMT. We then construct explicit space time codes that achieve the derived upper bound. These codes, constructed from cyclic division algebras, have minimal delay. Our results establish that when the channel has more than one degree of freedom, the DMT is not successive refinable using superposition coding and SIC. The channels considered in this work can have arbitrary fading statistics.