Efficiency of initiating cell adhesion in hydrodynamic flow

We theoretically investigate the efficiency of initial binding between a receptor-coated sphere and a ligand-coated wall in linear shear flow. The mean first passage time for binding decreases monotonically with increasing shear rate. Above a saturation threshold of the order of a few 100 receptor patches, the binding efficiency is enhanced only weakly by increasing their number and size, but strongly by increasing their height. This explains why white blood cells in the blood flow adhere through receptor patches localized to the tips of microvilli, and why malaria-infected red blood cells form elevated receptor patches (knobs).Comment: 4 pages, Revtex, 4 Postscript figures included, to appear in PR

Cover Crop System to Control Charcoal Rot in Soybeans

This research compares methods of controlling charcoal rot in soybean cultivars from three maturity groups commonly grown in southeast Kansas. The results indicate that a mustard plant that produces high levels of glucosinolates can be used as a cover crop to reduce the charcoal rot disease in soybeans

Cover Crop System to Control Charcoal Rot in Soybeans

This research compares methods of controlling charcoal rot in soybean cultivars from three maturity groups commonly grown in southeast Kansas. The results indicate that a mustard plant that produces high levels of glucosinolates can be used as a cover crop to reduce the charcoal rot disease in soybeans

Self-consistent theory of reversible ligand binding to a spherical cell

In this article, we study the kinetics of reversible ligand binding to receptors on a spherical cell surface using a self-consistent stochastic theory. Binding, dissociation, diffusion and rebinding of ligands are incorporated into the theory in a systematic manner. We derive explicitly the time evolution of the ligand-bound receptor fraction p(t) in various regimes . Contrary to the commonly accepted view, we find that the well-known Berg-Purcell scaling for the association rate is modified as a function of time. Specifically, the effective on-rate changes non-monotonically as a function of time and equals the intrinsic rate at very early as well as late times, while being approximately equal to the Berg-Purcell value at intermediate times. The effective dissociation rate, as it appears in the binding curve or measured in a dissociation experiment, is strongly modified by rebinding events and assumes the Berg-Purcell value except at very late times, where the decay is algebraic and not exponential. In equilibrium, the ligand concentration everywhere in the solution is the same and equals its spatial mean, thus ensuring that there is no depletion in the vicinity of the cell. Implications of our results for binding experiments and numerical simulations of ligand-receptor systems are also discussed.Comment: 23 pages with 4 figure

An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups

Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in extraspecial groups. Our approach is quite different from the recent algorithms presented in [17] and [2] for the Heisenberg group, the extraspecial p-group of size p3 and exponent p. Exploiting certain nice automorphisms of the extraspecial groups we define specific group actions which are used to reduce the problem to hidden subgroup instances in abelian groups that can be dealt with directly.Comment: 10 page

Algorithms for zero-dimensional ideals using linear recurrent sequences

Inspired by Faug\`ere and Mou's sparse FGLM algorithm, we show how using linear recurrent multi-dimensional sequences can allow one to perform operations such as the primary decomposition of an ideal, by computing the annihilator of one or several such sequences.Comment: LNCS, Computer Algebra in Scientific Computing CASC 201

A Machine-Checked Formalization of the Generic Model and the Random Oracle Model

Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to rely on a weaker hypothesis on the computational cost of gaining information about the plaintext pertaining to a ciphertext without knowing the key. Such a view is permitted by the Generic Model and the Random Oracle Model which provide non-standard computational models in which one may reason about the computational cost of breaking a cryptographic scheme. Using the proof assistant Coq, we provide a machine-checked account of the Generic Model and the Random Oracle Mode

The Intrinsic Origin of Spin Echoes in Dipolar Solids Generated by Strong Pi Pulses

In spectroscopy, it is conventional to treat pulses much stronger than the linewidth as delta-functions. In NMR, this assumption leads to the prediction that pi pulses do not refocus the dipolar coupling. However, NMR spin echo measurements in dipolar solids defy these conventional expectations when more than one pi pulse is used. Observed effects include a long tail in the CPMG echo train for short delays between pi pulses, an even-odd asymmetry in the echo amplitudes for long delays, an unusual fingerprint pattern for intermediate delays, and a strong sensitivity to pi-pulse phase. Experiments that set limits on possible extrinsic causes for the phenomena are reported. We find that the action of the system's internal Hamiltonian during any real pulse is sufficient to cause the effects. Exact numerical calculations, combined with average Hamiltonian theory, identify novel terms that are sensitive to parameters such as pulse phase, dipolar coupling, and system size. Visualization of the entire density matrix shows a unique flow of quantum coherence from non-observable to observable channels when applying repeated pi pulses.Comment: 24 pages, 27 figures. Revised from helpful referee comments. Added new Table IV, new paragraphs on pages 3 and 1

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences

International audienceIn a seminal work at EUROCRYPT '96, Coppersmith showed how to find all small roots of a univariate polynomial congruence in polynomial time: this has found many applications in public-key cryptanalysis and in a few security proofs. However, the running time of the algorithm is a high-degree polynomial, which limits experiments: the bottleneck is an LLL reduction of a high-dimensional matrix with extra-large coefficients. We present in this paper the first significant speedups over Coppersmith's algorithm. The first speedup is based on a special property of the matrices used by Coppersmith's algorithm, which allows us to provably speed up the LLL reduction by rounding, and which can also be used to improve the complexity analysis of Coppersmith's original algorithm. The exact speedup depends on the LLL algorithm used: for instance, the speedup is asymptotically quadratic in the bit-size of the small-root bound if one uses the Nguyen-Stehlé L2 algorithm. The second speedup is heuristic and applies whenever one wants to enlarge the root size of Coppersmith's algorithm by exhaustive search. Instead of performing several LLL reductions independently, we exploit hidden relationships between these matrices so that the LLL reductions can be somewhat chained to decrease the global running time. When both speedups are combined, the new algorithm is in practice hundreds of times faster for typical parameters

TeV Gamma-Ray Sources from a Survey of the Galactic Plane with Milagro

A survey of Galactic gamma-ray sources at a median energy of ~20 TeV has been performed using the Milagro Gamma Ray Observatory. Eight candidate sources of TeV emission are detected with pre-trials significance $>4.5\sigma$ in the region of Galactic longitude $l\in[30^\circ,220^\circ]$ and latitude $b\in[-10^\circ,10^\circ]$. Four of these sources, including the Crab nebula and the recently published MGRO J2019+37, are observed with significances $>4\sigma$ after accounting for the trials involved in searching the 3800 square degree region. All four of these sources are also coincident with EGRET sources. Two of the lower significance sources are coincident with EGRET sources and one of these sources is Geminga. The other two candidates are in the Cygnus region of the Galaxy. Several of the sources appear to be spatially extended. The fluxes of the sources at 20 TeV range from ~25% of the Crab flux to nearly as bright as the Crab.Comment: Submitted to Ap