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.

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.

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.

Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design

We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT

Register Allocation and Optimal Spill code Scheduling in Software Pipelined Loops using 0-1 Integer Linear Programming Formulation

In achieving higher instruction level parallelism, software pipelining increases the register pressure in the loop. The usefulness of the generated schedule may be restricted to cases where the register pressure is less than the available number of registers. Spill instructions need to be introduced otherwise. But scheduling these spill instructions in the compact schedule is a difficult task. Several heuristics have been proposed to schedule spill code. These heuristics may generate more spill code than necessary, and scheduling them may necessitate increasing the initiation interval. We model the problem of register allocation with spill code generation and scheduling in software pipelined loops as a 0-1 integer linear program. The formulation minimizes the increase in initiation interval (II) by optimally placing spill code and simultaneously minimizes the amount of spill code produced. To the best of our knowledge, this is the first integrated formulation for register allocation, optimal spill code generation and scheduling for software pipelined loops. The proposed formulation performs better than the existing heuristics by preventing an increase in II in 11.11% of the loops and generating 18.48% less spill code on average among the loops extracted from Perfect Club and SPEC benchmarks with a moderate increase in compilation time.

Flux Partitioning of Species Approach in Binary Interdiffusion Process

Validation of the flux partitioning of species model has been illustrated. Various combinations of inequality expression for the fluxes of species A and B in two successively grown hypothetical intermetallic phases in the interdiffusion zone have been considered within the constraints of this concept. Furthermore, ratio of intrinsic diffusivities of the species A and B in those two phases has been correlated in four different cases. Moreover, complete and or partial validation or invalidation of this model with respect to both the species, has been proven theoretically and also discussed with the Co-Si system as an example.