The Indian Rope Trick

نویسندگان

چکیده

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

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

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

منابع مشابه

View from the Pennines: a Cosmic Indian Rope Trick

This year we have had both frogspawn and toadspawn in the pond. The tadpoles emerged first and very quickly started to eat the toadspawn. Since the toad tadpoles are poisonous to many creatures it is not clear whether the tadpoles were eating the developing toad tadpoles or just the jelly, but whichever combination they were eating, the carefully roped toadspawn was rapidly destroyed. It is pos...

متن کامل

The rope

We are aware that all information published by each issue of this journal needs the squeeze and sweat of thousands of people. On one end of the rope, researchers and higher education institutions work hard to produce science to the highest degree of excellence. On the other end, reviewers silently filter manuscripts, thus improving the quality and accuracy of information that has been approved....

متن کامل

rope ens

Comfort, W.W. and J. van Mill, Some topological groups with, and some without, proper dense subgroups, Topology and its Applications 41 (1991) 3-15. Continuing earlier investigations into the question cf the existence of a proper dense subgroup of a given topological group, the authors obtain some positive and some negative results, as follows: (a) Every non-degenerate connected Abelian group c...

متن کامل

The Kernel Trick for Distances

A method is described which, like the kernel trick in support vector machines (SVMs), lets us generalize distance-based algorithms to operate in feature spaces, usually nonlinearly related to the input space. This is done by identifying a class of kernels which can be represented as norm-based distances in Hilbert spaces. It turns out that common kernel algorithms, such as SVMs and kernel PCA, ...

متن کامل

The Birthday Trick with Lies

In this article, we determine the number of yes/no questions required to figure out a birthday (a number between 0 and 31) when up to r incorrect answers to these questions are allowed. In the language of error-correcting codes, we construct optimal (shortest possible length) codes of size 32 and minimal distance d for each positive integer d .

متن کامل

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


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

ژورنال

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

سال: 1919

ISSN: 0028-0836,1476-4687

DOI: 10.1038/102487a0