Random locomotion and chemotaxis of human blood polymorphonuclear leukocytes (PMN) in the presence of EDTA: PMN in close quarters require neither leukocyte integrins nor external divalent cations

Divalent cations are thought essential for motile function of leukocytes in general, and for the function of critical adhesion molecules in particular. In the current study, under direct microscopic observation with concomitant time-lapse video recording, we examined the effects of 10 mM EDTA on locomotion of human blood polymorphonuclear leukocytes (PMN). In very thin slide preparations, EDTA did not impair either random locomotion or chemotaxis; motile behavior appeared to benefit from the close approximation of slide and coverslip (“chimneying”). In preparations twice as thick, PMN in EDTA first exhibited active deformability with little or no displacement, then rounded up and became motionless. However, on creation of a chemotactic gradient, the same cells were able to orient and make their way to the target, often, however, losing momentarily their purchase on the substrate. In either of these preparations without EDTA, specific antibodies to β2 integrins did not prevent random locomotion or chemotaxis, even when we added antibodies to β1 and αvβ3 integrins and to integrin-associated protein, and none of these antibodies added anything to the effects of EDTA. In the more turbulent environment of even more media, effects of anti-β2 integrins became evident: PMN still could locomote but adhered to substrate largely by their uropods and by uropod-associated filaments. We relate these findings to the reported independence from integrins of PMN in certain experimental and disease states. Moreover, we suggest that PMN locomotion in close quarters is not only integrin-independent, but independent of external divalent cations as well.

A general method for determining helix packing in membrane proteins in situ: Helices I and II are close to helix VII in the lactose permease of Escherichia coli

It was previously shown that coexpression of the lactose permease of Escherichia coli in two contiguous fragments leads to functional complementation. We demonstrate here that site-directed thiol crosslinking of coexpressed permease fragments can be used to determine helix proximity in situ without the necessity of purifying the permease. After coexpression of the six N-terminal (N6) and six C-terminal (C6) transmembrane helices, each with a single Cys residue, crosslinking was carried out in native membranes and assessed by the mobility of anti-C-terminal-reactive polypeptides on immunoblots. A Cys residue at position 242 or 245 (helix VII) forms a disulfide with a Cys residue at either position 28 or 29 (helix I), but not with a Cys residue at position 27, which is on the opposite face of helix I, thereby indicating that the face of helix I containing Pro-28 and Phe-29 is close to helix VII. Similarly, a Cys residue at position 242 or 245 (helix VII) forms a disulfide with a Cys residue at either position 52 or 53 (helix II), but not with a Cys residue at position 54. Furthermore, low-efficiency crosslinking is observed between a Cys residue at position 52 or 53 and a Cys residue at position 361 (helix XI). The results indicate that helix VII lies in close proximity to both helices I and II and that helix II is also close to helix XI. The method should be applicable to a number of different polytopic membrane proteins.

Native protein sequences are close to optimal for their structures

How large is the volume of sequence space that is compatible with a given protein structure? Starting from random sequences, low free energy sequences were generated for 108 protein backbone structures by using a Monte Carlo optimization procedure and a free energy function based primarily on Lennard–Jones packing interactions and the Lazaridis–Karplus implicit solvation model. Remarkably, in the designed sequences 51% of the core residues and 27% of all residues were identical to the amino acids in the corresponding positions in the native sequences. The lowest free energy sequences obtained for ensembles of native-like backbone structures were also similar to the native sequence. Furthermore, both the individual residue frequencies and the covariances between pairs of positions observed in the very large SH3 domain family were recapitulated in core sequences designed for SH3 domain structures. Taken together, these results suggest that the volume of sequence space optimal for a protein structure is surprisingly restricted to a region around the native sequence.

Advances in random matrix theory, zeta functions, and sphere packing

Over four hundred years ago, Sir Walter Raleigh asked his mathematical assistant to find formulas for the number of cannonballs in regularly stacked piles. These investigations aroused the curiosity of the astronomer Johannes Kepler and led to a problem that has gone centuries without a solution: why is the familiar cannonball stack the most efficient arrangement possible? Here we discuss the solution that Hales found in 1998. Almost every part of the 282-page proof relies on long computer verifications. Random matrix theory was developed by physicists to describe the spectra of complex nuclei. In particular, the statistical fluctuations of the eigenvalues (“the energy levels”) follow certain universal laws based on symmetry types. We describe these and then discuss the remarkable appearance of these laws for zeros of the Riemann zeta function (which is the generating function for prime numbers and is the last special function from the last century that is not understood today.) Explaining this phenomenon is a central problem. These topics are distinct, so we present them separately with their own introductory remarks.

Are more city dwellers caught drink driving than country folk? An analysis by random breath testing apprehension rates

Background Random Breath Testing (RBT) remains a central enforcement strategy to deter and apprehend drink drivers in Queensland (Australia). Despite this, there is little published research regarding the exact drink driving apprehension rates across the state as measured through RBT activities. Aims The aim of the current study was to examine the prevalence of apprehending drink drivers in urban versus rural areas. Methods The Queensland Police Service provided data relating to the number of RBT conducted and apprehensions for the period 1 January 2000 to 31 December 2011. Results In the period, 35,082,386 random breath tests (both mobile and stationary) were conducted in Queensland which resulted in 248,173 individuals being apprehended for drink driving offences. Overall drink driving apprehension rates appear to have decreased across time. Close examination of the data revealed that the highest proportion of drink driving apprehensions (when compared with RBT testing rates) was in the Northern and Far Northern regions of Queensland (e.g., rural areas). In contrast, the lowest proportions were observed within the two Brisbane metropolitan regions (e.g., urban areas). However, differences in enforcement styles across the urban and rural regions need to be considered. Discussion and conclusions The research presentation will further outline the major findings of the study in regards to maximising the efficiency of RBT operations both within urban and rural areas of Queensland, Australia.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽trandom collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

An identification tool for the Australian weedy Sporobolus species based on random amplified polymorphic DNA (RAPD) profiles

Based on morphological features alone, there is considerable difficulty in identifying the 5 most economically damaging weed species of Sporobolus [viz. S. pyramidalis P. Beauv., S. natalensis (Steud.) Dur and Schinz, S. fertilis (Steud.) Clayton, S. africanus (Poir.) Robyns and Tourney, and S. jacquemontii Kunth.] found in Australia. A polymerase chain reaction (PCR)-based random amplified polymorphic DNA (RAPD) technique was used to create a series of genetic markers that could positively identify the 5 major weeds from the other less damaging weedy and native Sporobolus species. In the initial RAPD profiling experiment, using arbitrarily selected primers and involving 12 species of Sporobolus, 12 genetic markers were found that, when used in combination, could consistently identify the 5 weedy species from all others. Of these 12 markers, the most diagnostic were UBC51490 for S. pyramidalis and S. natalensis; UBC43310.2000.2100 for S. fertilis and S. africanus; and ORA20850 and UBC43470 for S. jacquemontii. Species-specific markers could be found only for S. jacquemontii. In an effort to understand why there was difficulty in obtaining species-specific markers for some of the weedy species, a RAPD data matrix was created using 40 RAPD products. These 40 products amplified by 6 random primers from 45 individuals belonging to 12 species, were then subjected to numerical taxonomy and multivariate system (NTSYS pc version 1.70) analysis. The RAPD similarity matrix generated from the analysis indicated that S. pyramidalis was genetically more similar to S. natalensis than to other species of the 'S. indicus complex'. Similarly, S. jacquemontii was more similar to S. pyramidalis, and S. fertilis was more similar to S. africanus than to other species of the complex. Sporobolus pyramidalis, S. jacquemontii, S. africanus, and S. creber exhibited a low within-species genetic diversity, whereas high genetic diversity was observed within S. natalensis, S. fertilis, S. sessilis, S. elongates, and S. laxus. Cluster analysis placed all of the introduced species (major and minor weedy species) into one major cluster, with S. pyramidalis and S. natalensis in one distinct subcluster and S. fertilis and S. africanus in another. The native species formed separate clusters in the phenograms. The close genetic similarity of S. pyramidalis to S. natalensis, and S. fertilis to S. africanus may explain the difficulty in obtaining RAPD species-specific markers. The importance of these results will be within the Australian dairy and beef industries and will aid in the development of integrated management strategy for these weeds.

Dilute Solution Properties of Methyl Methacrylate/Acrylonitrile Random Copolymers, 2a)

The Stockmayer-Fixman relation was used to evaluate the short range and long range interaction parameters for methyl methacrylate/acrylonitrile copolymers of 0,566 and 0,657 mole fraction of monomeric units of acrylonitrile in the solvents acetonitrile, 2-butanone, dimethyl formamide, and y-butyrolactone, at different temperatures (30, 45, and 60 “C). The values of KO were found to be lower than those of the parent homopolymers, and their values depend on both solvent and temperature. Even negative Ko-values were obtained, in cases in which the Mark Houwink exponent a is nearly unity. The values of the polymer-solvent interaction parameter, x, , are high and close to 0,5, indicating that these solvents are not good. The values of the excess interaction parameter, xAB, are negative and are not affected by temperature. The large extension of these copolymer chains, as exhibited by a and a;-values, can be understood in terms of unusual short range interactions only. Similar results were obtained for some cellulose derivatives.

Unraveling the packing pattern leading to gelation using SS NMR and X-ray diffraction: direct observation of the evolution of self-assembled fibers

A detailed understanding of the mode of packing patterns that leads to the gelation of low molecular mass gelators derived from bile acid esters was carried out using solid state NMR along with complementary techniques such as powder X-ray diffraction (PXRD), differential scanning calorimetry (DSC), thermogravimetric analysis (TGA) and polarizing optical microscopy (POM). Solid state C-13{H-1} cross polarization (CP) magic angle spinning (MAS) NMR of the low molecularmass gel in its native state was recorded for the first time. A close resemblance in the packing patterns of the gel, xerogel and bulk solid states was revealed upon comparing their C-13{H-1} CPMAS NMR spectral pattern. A doublet resonance pattern of C-13 signals in C-13{H-1}CPMAS NMR spectra were observed for the gelator molecules, whereas the non-gelators showed simple singlet resonance or resulted inthe formation of inclusion complexes/solvates. PXRD patterns revealed a close isomorphous nature of the gelators indicating the similarity in the mode of the packing pattern in their solid state. Direct imaging of the evolution of nanofibers (sol-gel transition) was carried out using POM, which proved the presence of self-assembled fibrillar networks (SAFINs) in the gel. Finally powder X-ray structure determination revealed the presence of two non-equivalent molecules in an asymmetric unit which is responsible for the doublet resonance pattern in the solid state NMR spectra.

Search on a hypercubic lattice using a quantum random walk. I. d > 2

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighboring locations. We construct a quantum random walk algorithm, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice. The restriction on movement hardly matters for d > 2, and scaling behavior close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimize the proportionality constants of the scaling behavior, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean-field theory or the d -> infinity limit). In particular, the scaling behavior for d = 3 is only about 25% higher than the optimal d -> infinity value.

Random-Restart Reactive Tabu Search Algorithm for Detection in Large-MIMO Systems

We present a low-complexity algorithm based on reactive tabu search (RTS) for near maximum likelihood (ML) detection in large-MIMO systems. The conventional RTS algorithm achieves near-ML performance for 4-QAM in large-MIMO systems. But its performance for higher-order QAM is far from ML performance. Here, we propose a random-restart RTS (R3TS) algorithm which achieves significantly better bit error rate (BER) performance compared to that of the conventional RTS algorithm in higher-order QAM. The key idea is to run multiple tabu searches, each search starting with a random initial vector and choosing the best among the resulting solution vectors. A criterion to limit the number of searches is also proposed. Computer simulations show that the R3TS algorithm achieves almost the ML performance in 16 x 16 V-BLAST MIMO system with 16-QAM and 64-QAM at significantly less complexities than the sphere decoder. Also, in a 32 x 32 V-BLAST MIMO system, the R3TS performs close to ML lower bound within 1.6 dB for 16-QAM (128 bps/Hz), and within 2.4 dB for 64-QAM (192 bps/Hz) at 10(-3) BER.

Relation between Local Structure and Glass Forming Ability of Liquid Alloys

An attempt has been made to describe the glass forming ability (GFA) of liquid alloys, using the concepts of the short range order (SRO) and middle range order (MRO) characterizing the liquid structure.A new approach to obtain good GFA of liquid alloys is based on the following four main factors: (1) formation of new SRO and competitive correlation with two or more kinds of SROs for crystallization, (2) stabilization of dense random packing by interaction between different types of SRO, (3) formation of stable cluster (SC) or middle range order (MRO) by harmonious coupling of SROs, and (4) difference between SRO characterizing the liquid structure and the near-neighbor environment in the corresponding equilibrium crystalline phases. The atomic volume mismatch estimated from the cube of the atomic radius was found to be a close relation with the minimum solute concentration for glass formation. This empirical guideline enables us to provide the optimum solute concentration for good GFA in some ternary alloys. Model structures, denoted by Bernal type and the Chemical Order type, were again tested in the novel description for the glass structure as a function of solute concentration. We illustrated the related energetics of the completion between crystal embryo and different types of SRO. Recent systematic measurements also provide that thermal diffusivity of alloys in the liquid state may be a good indicator of their GFA.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.