986 resultados para Binary codes
Resumo:
A microscopic theory of the statics and the dynamics of solvation of an ion in a binary dipolar liquid is presented. The theory properly includes the different intermolecular correlations that are present in a binary mixture. As a result, the theory can explain several important aspects of both the statics and the dynamics of solvation that are observed in experiments. It provides a microscopic explanation of the preferential solvation of the more polar species by the solute ion. The dynamics of solvation is predicted to be highly non-exponential, in general. The average relaxation time is found to change nonlinearly with the composition of the mixture. These predictions are in qualitative agreement with the experimental results.
Resumo:
The surface tensions of binary mixtures of 1-alkanols (Cl-Cd with benzene, toluene, or xylene were measured. The results were correlated with the activity coefficients calculated through the group contribution method such as UNIFAC, with the maximum deviation from the experimental results less that 5%. The coefficients of the correlation are correlated with the chain length.
Resumo:
The constructional details of an 18-bit binary inductive voltage divider (IVD) for a.c. bridge applications is described. Simplified construction with less number of windings, interconnection of winding through SPDT solid state relays instead of DPDT relays, improves reliability of IVD. High accuracy for most precision measurement achieved without D/A converters. The checks for self consistency in voltage division shows that the error is less than 2 counts in 2(18).
Resumo:
Experiments have repeatedly observed both thermodynamic and dynamic anomalies in aqueous binary mixtures, surprisingly at low solute concentration. Examples of such binary mixtures include water-DMSO, water-ethanol, water-tertiary butyl alcohol (TBA), and water-dioxane, to name a few. The anomalies have often been attributed to the onset of a structural transition, whose nature, however, has been left rather unclear. Here we study the origin of such anomalies using large scale computer simulations and theoretical analysis in water-DMSO binary mixture. At very low DMSO concentration (below 10%), small aggregates of DMSO are solvated by water through the formation of DMSO-(H2O)(2) moieties. As the concentration is increased beyond 10-12% of DMSO, spanning clusters comprising the same moieties appear in the system. Those clusters are formed and stabilized not only through H-bonding but also through the association of CH3 groups of DMSO. We attribute the experimentally observed anomalies to a continuum percolation-like transition at DMSO concentration X-DMSO approximate to 12-15%. The largest cluster size of CH3-CH3 aggregation clearly indicates the formation of such percolating clusters. As a result, a significant slowing down is observed in the decay of associated rotational auto time correlation functions (of the S = O bond vector of DMSO and O-H bond vector of water). Markedly unusual behavior in the mean square fluctuation of total dipole moment again suggests a structural transition around the same concentration range. Furthermore, we map our findings to an interacting lattice model which substantiates the continuum percolation model as the reason for low concentration anomalies in binary mixtures where the solutes involved have both hydrophilic and hydrophobic moieties.
Resumo:
The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.
Explicit and Optimal Exact-Regenerating Codes for the Minimum-Bandwidth Point in Distributed Storage
Resumo:
In the distributed storage setting that we consider, data is stored across n nodes in the network such that the data can be recovered by connecting to any subset of k nodes. Additionally, one can repair a failed node by connecting to any d nodes while downloading beta units of data from each. Dimakis et al. show that the repair bandwidth d beta can be considerably reduced if each node stores slightly more than the minimum required and characterize the tradeoff between the amount of storage per node and the repair bandwidth. In the exact regeneration variation, unlike the functional regeneration, the replacement for a failed node is required to store data identical to that in the failed node. This greatly reduces the complexity of system maintenance. The main result of this paper is an explicit construction of codes for all values of the system parameters at one of the two most important and extreme points of the tradeoff - the Minimum Bandwidth Regenerating point, which performs optimal exact regeneration of any failed node. A second result is a non-existence proof showing that with one possible exception, no other point on the tradeoff can be achieved for exact regeneration.
Resumo:
In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.
Resumo:
Likely spatial distributions of network-modifying (and mobile) cations in (oxide) glasses are discussed here. At very low modifier concentrations, the ions form dipoles with non-bridging oxygen centres while, at higher levels of modification, the cations tend to order as a result of Coulombic interactions. Activation energies for cation migration are calculated, assuming that the ions occupy (face-sharing) octahedral sites. It is found that conductivity activation energy decreases markedly with increasing modifier content, in agreement with experiment.
Resumo:
Cooperative communication using rateless codes, in which the source transmits an infinite number of parity bits to the destination until the receipt of an acknowledgment, has recently attracted considerable interest. It provides a natural and efficient mechanism for accumulating mutual information from multiple transmitting relays. We develop an analysis of queued cooperative relay systems that combines the communication-theoretic transmission aspects of cooperative communication using rateless codes over Rayleigh fading channels with the queuing-theoretic aspects associated with buffering messages at the relays. Relay cooperation combined with queuing reduces the message transmission times and also helps distribute the traffic load in the network, which improves throughput significantly.
Resumo:
An energy landscape view of phase separation and nonideality in binary mixtures is developed by exploring their potential energy landscape (PEL) as functions of temperature and composition. We employ molecular dynamics simulations to study a model that promotes structure breaking in the solute-solvent parent binary liquid, at low temperatures. The PEL of the system captures the potential energy distribution of the inherent structures (IS) of the system and is obtained by removing the kinetic energy (including that of intermolecular vibrations). The broader distribution of the inherent structure energy for structure breaking liquid than that of the structure making liquid demonstrates the larger role of entropy in stabilizing the parent liquid of the structure breaking type of binary mixtures. At high temperature, although the parent structure of the structure breaking binary mixture is homogenous, the corresponding inherent structure is found to be always phase separated, with a density pattern that exhibits marked correlation with the energy of its inherent structure. Over a broad range of intermediate inherent structure energy, bicontinuous phase separation prevails with interpenetrating stripes as signatures of spinodal decomposition. At low inherent structure energy, the structure is largely phase separated with one interface where as at high inherent structure energy we find nucleation type growth. Interestingly, at low temperature, the average inherent structure energy (< EIS >) exhibits a drop with temperature which signals the onset of crystallization in one of the phases while the other remains in the liquid state. The nonideal composition dependence of viscosity is anticorrelated with average inherent structure energy.
Resumo:
We have carried out Brownian dynamics simulations of binary mixtures of charged colloidal suspensions of two different diameter particles with varying volume fractions phi and charged impurity concentrations n(i). For a given phi, the effective temperature is lowered in many steps by reducing n(i) to see how structure and dynamics evolve. The structural quantities studied are the partial and total pair distribution functions g(tau), the static structure factors, the time average g(<(tau)over bar>), and the Wendt-Abraham parameter. The dynamic quantity is the temporal evolution of the total meansquared displacement (MSD). All these parameters show that by lowering the effective temperature at phi = 0.2, liquid freezes into a body-centered-cubic crystal whereas at phi = 0.3, a glassy state is formed. The MSD at intermediate times shows significant subdiffusive behavior whose time span increases with a reduction in the effective temperature. The mean-squared displacements for the supercooled liquid with phi = 0.3 show staircase behavior indicating a strongly cooperative jump motion of the particles.
Resumo:
We report the Brownian dynamics simulation results on the translational and bond-angle-orientational correlations for charged colloidal binary suspensions as the interparticle interactions are increased to form a crystalline (for a volume fraction phi = 0.2) or a glassy (phi = 0.3) state. The translational order is quantified in terms of the two- and four-point density autocorrelation functions whose comparisons show that there is no growing correlation length near the glass transition. The nearest-neighbor orientational order is determined in terms of the quadratic rotational invariant Q(l) and the bond-orientational correlation functions g(l)(t). The l dependence of Q(l) indicates that icosahedral (l = 6) order predominates at the cost of the cubic order (l = 4) near the glass as well as the crystal transition. The density and orientational correlation functions for a supercooled liquid freezing towards a glass fit well to the streched-exponential form exp[-(t/tau)(beta)]. The average relaxation times extracted from the fitted stretched-exponential functions as a function of effective temperatures T* obey the Arrhenius law for liquids freezing to a crystal whereas these obey the Vogel-Tamman-Fulcher law exp[AT(0)*/(T* - T-0*)] for supercooled Liquids tending towards a glassy state. The value of the parameter A suggests that the colloidal suspensions are ''fragile'' glass formers like the organic and molecular liquids.
Resumo:
Code Division Multiple Access (CDMA) techniques, by far, had been applied to LAN problems by many investigators, An analytical study of well known algorithms for generation of Orthogonal codes used in FO-CDMA systems like those for prime, quasi-Prime, Optical Orthogonal and Matrix codes has been presented, Algorithms for OOCs like Greedy/Modified Greedy/Accelerated Greedy algorithms are implemented. Many speed-up enhancements. for these algorithms are suggested. A novel Synthetic Algorithm based on Difference Sets (SADS) is also proposed. Investigations are made to vectorise/parallelise SADS to implement the source code on parallel machines. A new matrix for code families of OOCs with different seed code-words but having the same (n,w,lambda) set is formulated.