No Effect of Steady Rotation on Solid 4^4He in a Torsional Oscillator

We have measured the response of a torsional oscillator containing polycrystalline hcp solid $^{4}$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$^{-1}$ 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 $^4$He attributable to steady rotation.Comment: 8 pages, 3 figures, accepted in J. Low Temp. Phy

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

Elasticity of Poissonian fiber networks

An effective-medium model is introduced for the elasticity of two-dimensional random fiber networks. These networks are commonly used as basic models of heterogeneous fibrous structures such as paper. Using the exact Poissonian statistics to describe the microscopic geometry of the network, the tensile modulus can be expressed by a single-parameter function. This parameter depends on the network density and fiber dimensions, which relate the macroscopic modulus to the relative importance of axial and bending deformations of the fibers. The model agrees well with simulation results and experimental findings. We also discuss the possible generalizations of the model.Peer reviewe

Developing LCA-based benchmarks for sustainable consumption - for and with users

This article presents the development process of a consumer-oriented, illustrative benchmarking tool enabling consumers to use the results of environmental life cycle assessment (LCA) to make informed decisions. Active and environmentally conscious consumers and environmental communicators were identified as key target groups for this type of information. A brochure presenting the benchmarking tool was developed as an participatory, iterative process involving consumer focus groups, stakeholder workshops and questionnaire-based feedback. In addition to learning what works and what does not, detailed suggestions on improved wording and figures were obtained, as well as a wealth of ideas for future applications

A Faster Implementation of Online Run-Length Burrows-Wheeler Transform

Run-length encoding Burrows-Wheeler Transformed strings, resulting in Run-Length BWT (RLBWT), is a powerful tool for processing highly repetitive strings. We propose a new algorithm for online RLBWT working in run-compressed space, which runs in $O(n\lg r)$ time and $O(r\lg n)$ bits of space, where $n$ is the length of input string $S$ received so far and $r$ is the number of runs in the BWT of the reversed $S$. We improve the state-of-the-art algorithm for online RLBWT in terms of empirical construction time. Adopting the dynamic list for maintaining a total order, we can replace rank queries in a dynamic wavelet tree on a run-length compressed string by the direct comparison of labels in a dynamic list. The empirical result for various benchmarks show the efficiency of our algorithm, especially for highly repetitive strings.Comment: In Proc. IWOCA201

Reply to Comment on Saku et al. : Reasons and risk factors for ninety day re-admission following primary total knee arthroplasty in a high-volume centre

Non peer reviewe

Fast Label Extraction in the CDAWG

The compact directed acyclic word graph (CDAWG) of a string $T$ of length $n$ takes space proportional just to the number $e$ of right extensions of the maximal repeats of $T$, and it is thus an appealing index for highly repetitive datasets, like collections of genomes from similar species, in which $e$ grows significantly more slowly than $n$. We reduce from $O(m\log{\log{n}})$ to $O(m)$ the time needed to count the number of occurrences of a pattern of length $m$, using an existing data structure that takes an amount of space proportional to the size of the CDAWG. This implies a reduction from $O(m\log{\log{n}}+\mathtt{occ})$ to $O(m+\mathtt{occ})$ in the time needed to locate all the $\mathtt{occ}$ occurrences of the pattern. We also reduce from $O(k\log{\log{n}})$ to $O(k)$ the time needed to read the $k$ characters of the label of an edge of the suffix tree of $T$, and we reduce from $O(m\log{\log{n}})$ to $O(m)$ the time needed to compute the matching statistics between a query of length $m$ and $T$, 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

Avalanches in Wood Compression

Wood is a multiscale material exhibiting a complex viscoplastic response. We study avalanches in small wood samples in compression. “Woodquakes” measured by acoustic emission are surprisingly similar to earthquakes and crackling noise in rocks and laboratory tests on brittle materials. Both the distributions of event energies and of waiting (silent) times follow power laws. The stress-strain response exhibits clear signatures of localization of deformation to “weak spots” or softwood layers, as identified using digital image correlation. Even though material structure-dependent localization takes place, the avalanche behavior remains scale-free.Peer reviewe