Fungal hide and seek

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hide and seek in Arizona

Laboratory subjects repeatedly played one of two variations of a simple two-person zero-sum game of ‘‘hide and seek’’. Three puzzling departures from the prescriptions of equilibrium theory are found in the data: an asymmetry related to the player’s role in the game; an asymmetry across the game variations; and positive serial correlation in subjects’ play. Possible explanations for these depar...

متن کامل

Hide and Seek with Supersymmetry

This is the summary of a 90 minute introductory talk on Supersymmetry presented at the August 1998 Zuoz Summer School on “Hidden Symmetries and Higgs Phenomena”. I first review the hierarchy problem, and then discuss why we expect supersymmetry just around the corner, i.e. at or below 1TeV . I focus on the specific example of the anomalous magnetic moment of the muon to show how supersymmetry c...

متن کامل

R - parity violation : Hide & Seek

We point out that, if R-parity is broken spontaneously, the neutralino can decay to the final state majoron plus neutrino, which from the experimental point of view is indistinguishable from the standard missing momentum signal of supersymmetry. We identify the regions of parameter space where this decay mode is dominant and show that they are independent of R-parity conserving SUSY parameters....

متن کامل

Hide and Seek in a Complex World

Complex networks have become the key to uncover the patterns of interactions in man-made and complex systems in nature. The Internet, the proteins in our cells, our bonds of friendship and the web-pages we daily browse form networks. Despite their widely different origins the networks have many interesting features in common. We endeavor to a better understanding of both man-made structures, li...

متن کامل

Hide and Seek - a Naive Factoring

I present a factoring algorithm that factors N = U V , where U < V , provably in O(N 1/3+ǫ) time. I also discuss the potential for improving this to a sub-exponential algorithm. Along the way, I consider the distribution of solutions (x, y) to xy = N mod a. 1. Algorithm-hide and seek Let N be a positive integer that we wish to factor. Say N = U V where U and V are positive integers, not necessa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Reviews Microbiology

سال: 2007

ISSN: 1740-1526,1740-1534

DOI: 10.1038/nrmicro1625