Note: Effect of fluid phase compositions on the formation of substitutionally ordered solid phases from a binary mixture of oppositely charged colloidal suspensions

A binary mixture of oppositely charged colloidal particles can self-assemble into either a substitutionally ordered or substitutionally disordered crystalline phase depending on the nature and strength of interactions among the particles. An earlier study had mapped out favorable inter-particle interactions for the formation of substitutionally ordered crystalline phases from a fluid phase using Monte Carlo molecular simulations along with the Gibbs-Duhem integration technique. In this paper, those studies are extended to determine the effect of fluid phase composition on formation of substitutionally ordered solid phases.

An equivalent undercooling model to account for flow effect on binary alloy dendrite growth rate

A theoretical analysis is carried out to observe the influence of important flow parameters such as Nusselt number and Sherwood number on the tip speed of an equiaxed dendrite growing in a convecting alloy melt. The effect of thermal and solutal transfer at the interface due to convection is equated to an undercooling of the melt, and an expression is derived for this equivalent undercooling in terms of the flow Nusselt number and Sherwood number. Results for the equivalent undercooling are compared with corresponding numerical values obtained by performing simulations based on the enthalpy method. This method represents a relatively simple procedure to analyze the effects of melt convection on the growth rate of dendrites. (C) 2013 Elsevier Ltd. All rights reserved.

An enthalpy-based model of dendritic growth in a convecting binary alloy melt

Purpose-In the present work, a numerical method, based on the well established enthalpy technique, is developed to simulate the growth of binary alloy equiaxed dendrites in presence of melt convection. The paper aims to discuss these issues. Design/methodology/approach-The principle of volume-averaging is used to formulate the governing equations (mass, momentum, energy and species conservation) which are solved using a coupled explicit-implicit method. The velocity and pressure fields are obtained using a fully implicit finite volume approach whereas the energy and species conservation equations are solved explicitly to obtain the enthalpy and solute concentration fields. As a model problem, simulation of the growth of a single crystal in a two-dimensional cavity filled with an undercooled melt is performed. Findings-Comparison of the simulation results with available solutions obtained using level set method and the phase field method shows good agreement. The effects of melt flow on dendrite growth rate and solute distribution along the solid-liquid interface are studied. A faster growth rate of the upstream dendrite arm in case of binary alloys is observed, which can be attributed to the enhanced heat transfer due to convection as well as lower solute pile-up at the solid-liquid interface. Subsequently, the influence of thermal and solutal Peclet number and undercooling on the dendrite tip velocity is investigated. Originality/value-As the present enthalpy based microscopic solidification model with melt convection is based on a framework similar to popularly used enthalpy models at the macroscopic scale, it lays the foundation to develop effective multiscale solidification.

Better QOS with W/T SPR codes for the transmission of multimedia signals in Optical CDMA networks

In this paper optical code-division multiple-access (O-CDMA) packet network is considered, which offers inherent security in the access networks. The application of O-CDMA to multimedia transmission (voice, data, and video) is investigated. The simultaneous transmission of various services is achieved by assigning to each user unique multiple code signatures. Thus, by applying a parallel mapping technique, we achieve multi-rate services. A random access protocol is proposed, here, where all distinct codes are used, for packet transmission. The codes, Optical Orthogonal Code (OOC), or 1D codes and Wavelength/Time Single-Pulse-per-Row (W/T SPR), or 2D codes, are analyzed. These 1D and 2D codes with varied weight are used to differentiate the Quality of Service (QoS). The theoretical bit error probability corresponding to the quality of each service is established using 1D and 2D codes in the receiver noiseless case and compared. The results show that, using 2D codes QoS in multimedia transmission is better than using 1D codes.

A matroidal framework for network-error correcting codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. The current work attempts to establish a connection between matroid theory and network-error correcting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of network-error correcting codes to arrive at the definition of a matroidal error correcting network. An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error correcting network code if and only if it is a matroidal error correcting network associated with a representable matroid. Therefore, constructing such network-error correcting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa.

Stability of fluctuating and transient aggregates of amphiphilic solutes in aqueous binary mixtures: Studies of dimethylsulfoxide, ethanol, and tert-butyl alcohol

In aqueous binary mixtures, amphiphilic solutes such as dimethylsulfoxide (DMSO), ethanol, tertbutyl alcohol (TBA), etc., are known to form aggregates (or large clusters) at small to intermediate solute concentrations. These aggregates are transient in nature. Although the system remains homogeneous on macroscopic length and time scales, the microheterogeneous aggregation may profoundly affect the properties of the mixture in several distinct ways, particularly if the survival times of the aggregates are longer than density relaxation times of the binary liquid. Here we propose a theoretical scheme to quantify the lifetime and thus the stability of these microheterogeneous clusters, and apply the scheme to calculate the same for water-ethanol, water-DMSO, and water-TBA mixtures. We show that the lifetime of these clusters can range from less than a picosecond (ps) for ethanol clusters to few tens of ps for DMSO and TBA clusters. This helps explaining the absence of a strong composition dependent anomaly in water-ethanol mixtures but the presence of the same in water-DMSO and water-TBA mixtures. (C) 2013 AIP Publishing LLC.

Regenerating codes for errors and erasures in distributed storage

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures at the nodes or links, during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-Matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.

Codes for solving three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces

Three codes, that can solve three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces, are provided here. The file 'bemconst.m' contains a MATLAB code for solving three dimensional linear elastostatic problems using constant boundary elements while ignoring body forces. The file 'bemconst.f90' is a Fortran translation of the MATLAB code contained in the file 'bemconst.m'. The file 'bemconstp.f90' is a parallelized version of the Fortran code contained in the file 'bemconst.f90'. The file 'inbem96.txt' is the input file for the Fortran codes contained in the files 'bemconst.f90' and 'bemconstp.f90'. Author hereby declares that the present codes are the original works of the author. Further, author hereby declares that any of the present codes, in full or in part, is not a translation or a copy of any of the existing codes written by someone else. Author's institution (Indian Institute of Science) has informed the author in writing that the institution is not interested in claiming any copyright on the present codes. Author is hereby distributing the present codes under the MIT License; full text of the license is included in each of the files that contain the codes.

Improved perfect space-time block codes

Perfect space-time block codes (STBCs) are based on four design criteria-full-rateness, nonvanishing determinant, cubic shaping, and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at uniform average energy per antenna per time slot are important from the perspective of energy efficiency of STBCs. The shaping criterion demands that the generator matrix of the lattice from which each layer of the perfect STBC is carved be unitary. In this paper, it is shown that unitariness is not a necessary requirement for energy efficiency in the context of space-time coding with finite input constellations, and an alternative criterion is provided that enables one to obtain full-rate (rate of complex symbols per channel use for an transmit antenna system) STBCs with larger normalized minimum determinants than the perfect STBCs. Further, two such STBCs, one each for 4 and 6 transmit antennas, are presented and they are shown to have larger normalized minimum determinants than the comparable perfect STBCs which hitherto had the best-known normalized minimum determinants.

Asymptotically-good, multigroup decodable space-time block codes

For a family of Space-Time Block Codes (STBCs) C-1, C-2,..., with increasing number of transmit antennas N-i, with rates R-i complex symbols per channel use, i = 1, 2,..., we introduce the notion of asymptotic normalized rate which we define as lim(i ->infinity) R-i/N-i, and we say that a family of STBCs is asymptotically-good if its asymptotic normalized rate is non-zero, i. e., when the rate scales as a non-zero fraction of the number of transmit antennas. An STBC C is said to be g-group decodable, g >= 2, if the information symbols encoded by it can be partitioned into g groups, such that each group of symbols can be ML decoded independently of the others. In this paper we construct full-diversity g-group decodable codes with rates greater than one complex symbol per channel use for all g >= 2. Specifically, we construct delay-optimal, g-group decodable codes for number of transmit antennas N-t that are a multiple of g2left perpendicular(g-1/2)right perpendicular with rate N-t/g2(g-1) + g(2)-g/2N(t). Using these new codes as building blocks, we then construct non-delay-optimal g-group decodable codes with rate roughly g times that of the delay-optimal codes, for number of antennas N-t that are a multiple of 2left perpendicular(g-1/2)right perpendicular, with delay gN(t) and rate Nt/2(g-1) + g-1/2N(t). For each g >= 2, the new delay-optimal and non-delay- optimal families of STBCs are both asymptotically-good, with the latter family having the largest asymptotic normalized rates among all known families of multigroup decodable codes with delay T <= gN(t). Also, for g >= 3, these are the first instances of g-group decodable codes with rates greater than 1 reported in the literature.

Solvent Sensitivity of Protein Unfolding: Dynamical Study of Chicken Villin Headpiece Subdomain in Water Ethanol Binary Mixture

We carry out a series of long atomistic molecular dynamics simulations to study the unfolding of a small protein, chicken villin headpiece (HP-36), in water-ethanol (EtOH) binary mixture. The prime objective of this work is to explore the sensitivity of protein unfolding dynamics toward increasing concentration of the cosolvent and unravel essential features of intermediates formed in search of a dynamical pathway toward unfolding. In water ethanol binary mixtures, HP-36 is found to unfold partially, under ambient conditions, that otherwise requires temperature as high as similar to 600 K to denature in pure aqueous solvent. However, an interesting course of pathway is observed to be followed in the process, guided by the formation of unique intermediates. The first step of unfolding is essentially the separation of the cluster formed by three hydrophobic (phenylalanine) residues, namely, Phe-7, Phe-11, and Phe-18, which constitute the hydrophobic core, thereby initiating melting of helix-2 of the protein. The initial steps are similar to temperature-induced unfolding as well as chemical unfolding using DMSO as cosolvent. Subsequent unfolding steps follow a unique path. As water-ethanol shows composition-dependent anomalies, so do the details of unfolding dynamics. With an increase in cosolvent concentration, different partially unfolded intermediates are found to be formed. This is reflected in a remarkable nonmonotonic composition dependence of several order parameters, including fraction of native contacts and protein-solvent interaction energy. The emergence of such partially unfolded states can be attributed to the preferential solvation of the hydrophobic residues by the ethyl groups of ethanol. We further quantify the local dynamics of unfolding by using a Marcus-type theory.

On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

Regenerating codes: A reformulated storage-bandwidth trade-off and a new construction

In this paper, the storage-repair-bandwidth (SRB) trade-off curve of regenerating codes is reformulated to yield a tradeoff between two global parameters of practical relevance, namely information rate and repair rate. The new information-repair-rate (IRR) tradeoff provides a different and insightful perspective on regenerating codes. For example, it provides a new motivation for seeking to investigate constructions corresponding to the interior of the SRB tradeoff. Interestingly, each point on the SRB tradeoff corresponds to a curve in the IRR tradeoff setup. We characterize completely, functional repair under the IRR framework, while for exact repair, an achievable region is presented. In the second part of this paper, a rate-half regenerating code for the minimum storage regenerating point is constructed that draws upon the theory of invariant subspaces. While the parameters of this rate-half code are the same as those of the MISER code, the construction itself is quite different.

Anomalous phase transitions in soft colloid-polymer binary mixtures

We have shown earlier [1] that these PGNPs resemble star polymers or spherical brushes in terms of their morphology in the melt. However, these particles show dynamics in melt which is quite different from other soft colloidal particles. Since most of the work on soft colloidal particles have been performed in solutions we have now explored the phase behavior of the PGNPs in good solvent using microscopic structural and dynamical measurements on binary mixtures of homopolymers and soft colloids consisting of polymer grafted nanoparticles. We observe anomalous structural and dynamical phase transitions of these binary mixtures, including appearance of spontaneous orientational alignment and logarithmic structural relaxations, as a function of added homopolymers of different molecular weights. Our experiments points to the possibility of exploiting the phase space in density and homopolymer size, of such hybrid systems, to create new materials with unique properties.