منابع مشابه
Universal Ratios of Characteristic Lengths in Semidilute Polymer Solutions
We use experimental and simulation data from the literature to infer five characteristic lengths, denoted ξs, ξf , ξΠ, ξφ, and ξD of a semidilute polymer solution. The first two of these are defined in terms of scattering from the solution, the third is defined in terms of osmotic pressure, the fourth by the spatial monomer concentration profile, and the last by co-operative diffusion. In a giv...
متن کاملUniversal and idiosyncratic characteristic lengths in bacterial genomes.
In condensed matter physics, simplified descriptions are obtained by coarse-graining the features of a system at a certain characteristic length, defined as the typical length beyond which some properties are no longer correlated. From a physics standpoint, in vitro DNA has thus a characteristic length of 300 base pairs (bp), the Kuhn length of the molecule beyond which correlations in its orie...
متن کاملCharacteristic Lengths of Magnetic Field in Magnetohydrodynamic Turbulence
In the framework of turbulence dynamo, flow motions amplify a weak seed magnetic field through the stretching of field lines. Although the amplification process has been a topic of active research, less attention has been paid to the length scales of magnetic field. In this paper, we described a numerical study on characteristic lengths of magnetic field in magnetohydrodynamic turbulence. We co...
متن کاملFinding Characteristic Features in Stylometric Analysis
The usual focus in authorship studies is on authorship attribution, i.e. determining which author (of a given set) wrote a piece of unknown provenance. The usual setting involves a small number of candidate authors, which means that the focus quickly revolves around a search for features that discriminate among the candidates. Whether the features that serve to discriminate among the authors ar...
متن کاملFinding Characteristic Substrings from Compressed Texts
Text mining from large scaled data is of great importance in computer science. In this paper, we consider fundamental problems on text mining from compressed strings, i.e., computing a longest repeating substring, longest non-overlapping repeating substring, most frequent substring, and most frequent non-overlapping substring from a given compressed string. Also, we tackle the following novel p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1987
ISSN: 0028-0836,1476-4687
DOI: 10.1038/329483a0