1,288 research outputs found
No Effect of Steady Rotation on Solid He in a Torsional Oscillator
We have measured the response of a torsional oscillator containing
polycrystalline hcp solid He to applied steady rotation in an attempt to
verify the observations of several other groups that were initially interpreted
as evidence for macroscopic quantum effects. The geometry of the cell was that
of a simple annulus, with a fill line of relatively narrow diameter in the
centre of the torsion rod. Varying the angular velocity of rotation up to
2\,rad\,s showed that there were no step-like features in the resonant
frequency or dissipation of the oscillator and no history dependence, even
though we achieved the sensitivity required to detect the various effects seen
in earlier experiments on other rotating cryostats. All small changes during
rotation were consistent with those occurring with an empty cell. We thus
observed no effects on the samples of solid He attributable to steady
rotation.Comment: 8 pages, 3 figures, accepted in J. Low Temp. Phy
Kuusen ja männyn paksuuskasvu on sopeutunut paikalliseen ilmastoon
Artikkeli julkaistu alunperin metla.fi sivustoll
Recommended from our members
Risky bank guarantees
© 2019 Elsevier B.V. Applying standard portfolio-sort techniques to bank asset returns for 15 countries from 2004 to 2018, we uncover a risk premium associated with implicit government guarantees. This risk premium is intimately tied to sovereign risk, suggesting that guaranteed banks, defined as those of particular importance to the national economy, inherit the risk of the guarantor. Indeed, this premium does not exist in safe-haven countries. We rationalize these findings with a model in which implicit government guarantees are risky in the sense that they provide protection that depends on the aggregate state of the economy
Fast Label Extraction in the CDAWG
The compact directed acyclic word graph (CDAWG) of a string of length
takes space proportional just to the number of right extensions of the
maximal repeats of , and it is thus an appealing index for highly repetitive
datasets, like collections of genomes from similar species, in which grows
significantly more slowly than . We reduce from to
the time needed to count the number of occurrences of a pattern of
length , using an existing data structure that takes an amount of space
proportional to the size of the CDAWG. This implies a reduction from
to in the time needed to
locate all the occurrences of the pattern. We also reduce from
to the time needed to read the characters of the
label of an edge of the suffix tree of , and we reduce from
to the time needed to compute the matching
statistics between a query of length and , using an existing
representation of the suffix tree based on the CDAWG. All such improvements
derive from extracting the label of a vertex or of an arc of the CDAWG using a
straight-line program induced by the reversed CDAWG.Comment: 16 pages, 1 figure. In proceedings of the 24th International
Symposium on String Processing and Information Retrieval (SPIRE 2017). arXiv
admin note: text overlap with arXiv:1705.0864
Composite repetition-aware data structures
In highly repetitive strings, like collections of genomes from the same
species, distinct measures of repetition all grow sublinearly in the length of
the text, and indexes targeted to such strings typically depend only on one of
these measures. We describe two data structures whose size depends on multiple
measures of repetition at once, and that provide competitive tradeoffs between
the time for counting and reporting all the exact occurrences of a pattern, and
the space taken by the structure. The key component of our constructions is the
run-length encoded BWT (RLBWT), which takes space proportional to the number of
BWT runs: rather than augmenting RLBWT with suffix array samples, we combine it
with data structures from LZ77 indexes, which take space proportional to the
number of LZ77 factors, and with the compact directed acyclic word graph
(CDAWG), which takes space proportional to the number of extensions of maximal
repeats. The combination of CDAWG and RLBWT enables also a new representation
of the suffix tree, whose size depends again on the number of extensions of
maximal repeats, and that is powerful enough to support matching statistics and
constant-space traversal.Comment: (the name of the third co-author was inadvertently omitted from
previous version
Document Retrieval on Repetitive Collections
Document retrieval aims at finding the most important documents where a
pattern appears in a collection of strings. Traditional pattern-matching
techniques yield brute-force document retrieval solutions, which has motivated
the research on tailored indexes that offer near-optimal performance. However,
an experimental study establishing which alternatives are actually better than
brute force, and which perform best depending on the collection
characteristics, has not been carried out. In this paper we address this
shortcoming by exploring the relationship between the nature of the underlying
collection and the performance of current methods. Via extensive experiments we
show that established solutions are often beaten in practice by brute-force
alternatives. We also design new methods that offer superior time/space
trade-offs, particularly on repetitive collections.Comment: Accepted to ESA 2014. Implementation and experiments at
http://www.cs.helsinki.fi/group/suds/rlcsa
Роль маркетинга в сфере культуры
Сегодня все мы ощущаем завершение очередного этапа развития нашего общества, который выражается в многочисленных кризисах (политическом, экономическом, экологическом и т.д.), что в полной мере
отражает художественная культура
- …