Guns, germs, and stealing: exploring the link between infectious disease and crime.

Can variation in crime rates be traced to the threat of infectious disease? Pathogens pose an ongoing challenge to survival, leading humans to adapt defenses to manage this threat. In addition to the biological immune system, humans have psychological and behavioral responses designed to protect against disease. Under persistent disease threat, xenophobia increases and people constrict social interactions to known in-group members. Though these responses reduce disease transmission, they can generate favorable crime conditions in two ways. First, xenophobia reduces inhibitions against harming and exploiting out-group members. Second, segregation into in-group factions erodes people's concern for the welfare of their community and weakens the collective ability to prevent crime. The present study examined the effects of infection incidence on crime rates across the United States. Infection rates predicted violent and property crime more strongly than other crime covariates. Infections also predicted homicides against strangers but not family or acquaintances, supporting the hypothesis that in-group-out-group discrimination was responsible for the infections-crime link. Overall, the results add to evidence that disease threat shapes interpersonal behavior and structural characteristics of groups

Genome-wide inference of ancestral recombination graphs

The complex correlation structure of a collection of orthologous DNA sequences is uniquely captured by the "ancestral recombination graph" (ARG), a complete record of coalescence and recombination events in the history of the sample. However, existing methods for ARG inference are computationally intensive, highly approximate, or limited to small numbers of sequences, and, as a consequence, explicit ARG inference is rarely used in applied population genomics. Here, we introduce a new algorithm for ARG inference that is efficient enough to apply to dozens of complete mammalian genomes. The key idea of our approach is to sample an ARG of n chromosomes conditional on an ARG of n-1 chromosomes, an operation we call "threading." Using techniques based on hidden Markov models, we can perform this threading operation exactly, up to the assumptions of the sequentially Markov coalescent and a discretization of time. An extension allows for threading of subtrees instead of individual sequences. Repeated application of these threading operations results in highly efficient Markov chain Monte Carlo samplers for ARGs. We have implemented these methods in a computer program called ARGweaver. Experiments with simulated data indicate that ARGweaver converges rapidly to the true posterior distribution and is effective in recovering various features of the ARG for dozens of sequences generated under realistic parameters for human populations. In applications of ARGweaver to 54 human genome sequences from Complete Genomics, we find clear signatures of natural selection, including regions of unusually ancient ancestry associated with balancing selection and reductions in allele age in sites under directional selection. Preliminary results also indicate that our methods can be used to gain insight into complex features of human population structure, even with a noninformative prior distribution.Comment: 88 pages, 7 main figures, 22 supplementary figures. This version contains a substantially expanded genomic data analysi

A distributed algorithm to find k-dominating sets

We consider a connected undirected graph $G(n,m)$ with $n$ nodes and $m$ edges. A $k$-dominating set $D$ in $G$ is a set of nodes having the property that every node in $G$ is at most $k$ edges away from at least one node in $D$. Finding a $k$-dominating set of minimum size is NP-hard. We give a new synchronous distributed algorithm to find a $k$-dominating set in $G$ of size no greater than $\lfloor n/(k+1)\rfloor$. Our algorithm requires $O(k\log^*n)$ time and $O(m\log k+n\log k\log^*n)$ messages to run. It has the same time complexity as the best currently known algorithm, but improves on that algorithm's message complexity and is, in addition, conceptually simpler.Comment: To appear in Discrete Applied Mathematic

Theory of Magnetodynamics Induced by Spin Torque in Perpendicularly Magnetized Thin Films

A nonlinear model of spin wave excitation using a point contact in a thin ferromagnetic film is introduced. Large-amplitude magnetic solitary waves are computed, which help explain recent spin-torque experiments. Numerical simulations of the fully nonlinear model predict excitation frequencies in excess of 0.2 THz for contact diameters smaller than 6 nm. Simulations also predict a saturation and red shift of the frequency at currents large enough to invert the magnetization under the point contact. The theory is approximated by a cubic complex Ginzburg-Landau type equation. The mode's nonlinear frequency shift is found by use of perturbation techniques, whose results agree with those of direct numerical simulations.Comment: 5 pages, 4 figures, submitted to PR

Performance Evaluation and Optimization of Math-Similarity Search

Similarity search in math is to find mathematical expressions that are similar to a user's query. We conceptualized the similarity factors between mathematical expressions, and proposed an approach to math similarity search (MSS) by defining metrics based on those similarity factors [11]. Our preliminary implementation indicated the advantage of MSS compared to non-similarity based search. In order to more effectively and efficiently search similar math expressions, MSS is further optimized. This paper focuses on performance evaluation and optimization of MSS. Our results show that the proposed optimization process significantly improved the performance of MSS with respect to both relevance ranking and recall.Comment: 15 pages, 8 figure

Percolation in living neural networks

We study living neural networks by measuring the neurons' response to a global electrical stimulation. Neural connectivity is lowered by reducing the synaptic strength, chemically blocking neurotransmitter receptors. We use a graph-theoretic approach to show that the connectivity undergoes a percolation transition. This occurs as the giant component disintegrates, characterized by a power law with critical exponent $\beta \simeq 0.65$ is independent of the balance between excitatory and inhibitory neurons and indicates that the degree distribution is gaussian rather than scale freeComment: PACS numbers: 87.18.Sn, 87.19.La, 64.60.Ak http://www.weizmann.ac.il/complex/tlusty/papers/PhysRevLett2006.pd

Super-resolution of faces using texture mapping on a generic 3D model

This paper proposes a novel face texture mapping framework to transform faces with different poses into a unique texture map. Under this framework, texture mapping can be realized by utilizing a generic 3D face model, standard Haar-like feature based detector, active appearance model and pose estimation algorithm. By this texture map, correspondence of every pixel at the face across multiple distinct input images can then be established, which enables super-resolution algorithms to be applied directly on registered texture map to render high resolution faces. This paper details the proposed framework, and illustrates how the proposed super-resolution algorithm works with the help of weighted average and median filters. Convincing experimental results are also presented to validate the effectiveness of the proposed framework and superresolution algorithm. © 2009 IEEE.published_or_final_versio

Equations discovery of organized cloud fields: Stochastic generator and dynamical insights

The emergence of organized multiscale patterns resulting from convection is ubiquitous, observed throughout different cloud types. The reproduction of such patterns by general circulation models remains a challenge due to the complex nature of clouds, characterized by processes interacting over a wide range of spatio-temporal scales. The new advances in data-driven modeling techniques have raised a lot of promises to discover dynamical equations from partial observations of complex systems. This study presents such a discovery from high-resolution satellite datasets of continental cloud fields. The model is made of stochastic differential equations able to simulate with high fidelity the spatio-temporal coherence and variability of the cloud patterns such as the characteristic lifetime of individual clouds or global organizational features governed by convective inertia gravity waves. This feat is achieved through the model's lagged effects associated with convection recirculation times, and hidden variables parameterizing the unobserved processes and variables.Comment: 11 pages, 9 figure