Enhanced Pair Hydrophobicity in the Water-Dimethylsulfoxide (DMSO) Binary Mixture at Low DMSO Concentrations

We observe a surprisingly sharp increase in the pair hydrophobicity in the water climethylsulfoxide (DMSO) binary mixture at small DMSO concentrations, with the mole fraction of DMSO (x(D)) in the range 0.12-0.16. The increase in pair hydrophobicity is measured by an increase in the depth of the first minimum in the potential of mean force (PMF) between two methane molecules. However, this enhanced hydrophobicity again weakens at higher DMSO concentrations. We find markedly unusual behavior of the pure binary mixture (in the same composition range) in the diffusion coefficient of DMSO and in the local composition fluctuation of water, We find that, in the said composition range, the average coordination number of the methyl groups (of distinct DMSO) varies between 2.4 and 2.6, indicating the onset of the formation of a chain-like extended connectivity in an otherwise stable tetrahedral network comprising of water and DMSO molecules. We propose that the enhanced pair hydrophobicity of the binary mixture at low DMSO concentrations is due to the participation of the two methane molecules in the local structural order and the emerging molecular associations in the water-DMSO mixture.

Patterns in permuted binary matrices

Reorganizing a dataset so that its hidden structure can be observed is useful in any data analysis task. For example, detecting a regularity in a dataset helps us to interpret the data, compress the data, and explain the processes behind the data. We study datasets that come in the form of binary matrices (tables with 0s and 1s). Our goal is to develop automatic methods that bring out certain patterns by permuting the rows and columns. We concentrate on the following patterns in binary matrices: consecutive-ones (C1P), simultaneous consecutive-ones (SC1P), nestedness, k-nestedness, and bandedness. These patterns reflect specific types of interplay and variation between the rows and columns, such as continuity and hierarchies. Furthermore, their combinatorial properties are interlinked, which helps us to develop the theory of binary matrices and efficient algorithms. Indeed, we can detect all these patterns in a binary matrix efficiently, that is, in polynomial time in the size of the matrix. Since real-world datasets often contain noise and errors, we rarely witness perfect patterns. Therefore we also need to assess how far an input matrix is from a pattern: we count the number of flips (from 0s to 1s or vice versa) needed to bring out the perfect pattern in the matrix. Unfortunately, for most patterns it is an NP-complete problem to find the minimum distance to a matrix that has the perfect pattern, which means that the existence of a polynomial-time algorithm is unlikely. To find patterns in datasets with noise, we need methods that are noise-tolerant and work in practical time with large datasets. The theory of binary matrices gives rise to robust heuristics that have good performance with synthetic data and discover easily interpretable structures in real-world datasets: dialectical variation in the spoken Finnish language, division of European locations by the hierarchies found in mammal occurrences, and co-occuring groups in network data. In addition to determining the distance from a dataset to a pattern, we need to determine whether the pattern is significant or a mere occurrence of a random chance. To this end, we use significance testing: we deem a dataset significant if it appears exceptional when compared to datasets generated from a certain null hypothesis. After detecting a significant pattern in a dataset, it is up to domain experts to interpret the results in the terms of the application.

A possible role for a low molecular weight peptide in regulation of testosterone production by rat Leydig cells

Sodium dodecyl sulphate-polyacrylamide gel electrophoresis of Percoll purified Leydig cell proteins from 20- and 120-day-old rats revealed a significant decrease in a low molecular weight peptide in the adult rats. Administration of human chorionic gonadotropin to immature rats resulted in a decrease in the low molecular weight peptide along with increase in testosterone production. Modulation of the peptide by human chorionic gonadotropin could be confirmed by Western blotting. The presence of a similar peptide could be detected by Western blotting in testes of immature mouse, hamster, guinea pig but not in adrenal, placenta and corpus luteum. Administration of testosterone propionate which is known to inhibit the pituitary luteinizing hormone levels in adult rats resulted in an increase in the low molecular weight peptide, as checked by Western blotting. It is suggested that this peptide may have a role in regulation of acquisition of responsiveness to luteinizing hormone by immature rat Leydig cells.

Diffusion coefficients for selected binary liquid systems: cyclohexanes and n-alkyl alcohols

In the present work the integral diffusion coefficients are estimated by using the diaphragm cell technique. The diffusion coefficients are measured at various compositions for two sets binary systems: one of cyclohexane and n-paraffinic alcohols and the other of methylcyclohexane and n-paraffinic alcohols. The alcohols used are seven members of homologous series of n-paraffinic alcohols from ethanol to octanol. The maximum possible error in the experimental diffusion coefficient could be 8% for both the cyclohexane-n-alkyl alcohol system and methylcyclohexane-n-alkyl alcohol system. A correlation for each of the two sets of binary systems is given. The maximum deviation in the correlations was less than 6.5 and 3.5% for cyclohexane-n-alkyl alcohols and methylcyclohexane-n-alkyl alcohols, respectively.

Temperature response of trehalase from a mesophilic (Neurospora crassa) and a thermophilic (Thermomyces lanuginosus) fungus

The purified trehalases of the mesophilic fungus, Neurospora crassa, and the thermophilic fungus, Thermomyces lanuginosus, had similar temperature and pH optima for activity, but differed in molecular weight, electrophoretic mobility and Michaelis constant. At lower concentration, trehalases from both fungi were inactivated to similar extent at 60°C. While purified trehalase of T. lanuginosus was afforded protection against heat-inactivation by proteinaceous protective factor(s) present in mycelial extracts, by bovine serum albumin and by casein, these did not afford protection to N. crassa trehalase against heat inactivation. Both trehalases exhibited discontinuous Arrhenius plots with temperature of discontinuity at 40°C. The activation energy calculated from the slope of the Arrhenius plot was higher for the T. lanuginosus enzyme. The plots of apparent K m versus 1/T for trehalases of N. crassa and T. lanuginosus were linear from 30° to 60°C. The results show that purified trehalases of the mesophilic and the thermophilic fungus are distinct. Although, these exhibit similar thermostability of their catalytic function at low concentration, distinctive thermal stability characteristics of thermophilic enzyme become apparent at high protein concentration. This could be brought about in the cell by the enzyme itself, or by other proteins.

Communication: Unusual dynamics of hybrid nanoparticles and their binary mixtures

We present the results on the evolution of microscopic dynamics of hybrid nanoparticles and their binary mixtures as a function of temperature and wave vector. We find unexpectedly a nonmonotonic dependence of the structural relaxation time of the nanoparticles as a function of the morphology. In binary mixtures of two of the largest nanoparticles studied, we observe re-entrant vitrification as a function of the volume fraction of the smaller nanoparticle, which is unusual for such high diameter ratio. Possible explanation for the observed behavior is provided. (C) 2010 American Institute of Physics. doi:10.1063/1.3495480]

Studies on the biosynthesis of cytochrome P-450 in rat liver—A probe with phenobarbital

Cytochrome P-450 has been purified from phenobarbital-treated rat livers to a specific content of 17 nmol/mg protein. The major species purified has a molecular weight of 48,000. Using the purified antibody for the cytochrome P-450 preparation it has been shown that the major product synthesized in vivo and in the homologous cell-free system in vitro is the 48,000 molecular weight species. Poly(A)-containing RNA isolated from phenobarbital-treated animals codes for the synthesis of the 48,000 molecular weight species in the wheat germ and reticulocyte lysate cell-free systems. It is concluded that cytochrome P-450 synthesis does not involve processing of a polyprotein precursor, although certain minor modifications including glycosylation of the primary translation product are not ruled out. Phenobarbital treatment of the animal results in a significant increase in the cytochrome P-450 messenger activity as measured in the wheat germ cell-free system.

Structural synthesis by transformation of binary chains Strukturelle synthese durch umwandlung binaerer ketten

The paper presents a general method of structural synthesis which can be used to derive all possible simple- and multiple-jointed chains of positive, zero or negative degree-of-freedom. In this method all possible chains with N links and F degrees-of-freedom are derived by the transformation of the corresponding “binary chains” with N binary links and F degrees-of-freedom. The method is illustrated by applying to the case of chains with degrees-of-freedom 1,2,0 and −1.

Molecular theory of dielectric relaxation in a dense binary dipolar liquid

A molecular theory of dielectric relaxation in a dense binary dipolar liquid is presented. The theory takes into account the effects of intra- and interspecies intermolecular interactions. It is shown that the relaxation is, in general, nonexponential. In certain limits, we recover the biexponential form traditionally used to analyze the experimental data of dielectric relaxation in a binary mixture. However, the relaxation times are widely different from the prediction of the noninteracting rotational diffusion model of Debye for a binary system. Detailed numerical evaluation of the frequency-dependent dielectric function epsilon-(omega) is carried out by using the known analytic solution of the mean spherical approximation (MSA) model for the two-particle direct correlation function for a polar mixture. A microscopic expression for both wave vector (k) and frequency (omega) dependent dielectric function, epsilon-(k,omega), of a binary mixture is also presented. The theoretical predictions on epsilon-(omega) (= epsilon-(k = 0, omega)) have been compared with the available experimental results. In particular, the present theory offers a molecular explanation of the phenomenon of fusing of the two relaxation channels of the neat liquids, observed by Schallamach many years ago.

Mutual diffusion coefficients of some binary liquid systems: benzene-n-alkyl alcohol

The mutual diffusion coefficients for binary liquid systems of benzene-n-alkyl alcohol at various compositions have been determined by the diaphragm cell method at 28-degrees-C. The alcohols used were the members of n-paraffinic alcohols ranging from C1 to C8. The maximum possible experimental error is 14%. The data were fitted with a generalized correlation, giving the deviation from the experimental data to within 2.75%, on average.

In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs

We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Theta(1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is Theta(root n) time units. We further extend our approach to a network with noisy links. While the refresh rate remains Theta(1) time units per sample, the delay increases to Theta(root n log n). The number of transmissions in both cases is Theta(n) per histogram sample. The achieved Theta(1) refresh rate for PAC histogram computation is a significant improvement over the refresh rate of Theta(1/log n) for histogram computation in noiseless networks. We achieve this by operating in the supercritical thermodynamic regime where large pathways for communication build up, but the network may have more than one component. The largest component however will have an arbitrarily large fraction of nodes in order to enable approximate computation of the histogram to the desired level of accuracy. Operation in the supercritical thermodynamic regime also reduces energy consumption. A key step in the proof of our achievability result is the construction of a connected component having bounded degree and any desired fraction of nodes. This construction may also prove useful in other communication settings on the random geometric graph.

Energy efficient asymmetric binary search switching technique for SAR ADC

An asymmetric binary search switching technique for a successive approximation register (SAR) ADC is presented, and trade-off between switching energy and conversion cycles is discussed. Without using any additional switches, the proposed technique consumes 46% less switching energy, for a small input swing (0.5 V-ref (P-P)), as compared to the last reported efficient switching technique in literature for an 8-bit SAR ADC. For a full input swing (2 V-ref (P-P)), the proposed technique consumes 16.5% less switching energy.

Almost Stable Matchings by Truncating the Gale–Shapley Algorithm

We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose–accept rounds executed by the Gale–Shapley algorithm for the stable marriage problem. Consequently, the participants can arrive at an almost stable matching even without full information about the problem instance; for each participant, knowing only its local neighbourhood is enough. In distributed-systems parlance, this means that if each person has only a constant number of acceptable partners, an almost stable matching emerges after a constant number of synchronous communication rounds. We apply our results to give a distributed (2 + ε)-approximation algorithm for maximum-weight matching in bicoloured graphs and a centralised randomised constant-time approximation scheme for estimating the size of a stable matching.

Optimisation problems in wireless sensor networks

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating–dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating–dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs – these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating–dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Impurity effects on the critical behaviour of the electrical resistance of binary liquid mixtures

The electrical resistance of the binary liquid system cyclohexane + acetic anhydride is measured, in the critical region, both in the pure mixture and when the mixture is doped with small amounts (≈ 100 ppm) of H2O/D2O impurities.T c was approached to aboutt=3×10−6 wheret=(T −T c )/T c . The critical exponentb ≈ 0.35 in the fit of the resistance data to the equationdR/dT ∼t −b does not seem to be affected appreciably by the impurities. There is a sign reversal ofdR/dt in the non-critical region. Binary liquid systems seem to violate the universality of the critical resistivity.