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

The benzoylarginine peptidase from Treponema denticola (strain ASLM), a human oral spirochaete: evidence for active-site carboxyl groups

The benzoylarginine peptidase of Treponema denticola (strain ASLM; a human oral spirochaete) was progressively and irreversibly inactivated by 1-(ethoxycarbonyl)-2-ethoxy-1, 2-dihydroquinoline, a carboxyl-group reagent. At acidic pH values, reaction of one mole of the modifier per active site of the enzyme resulted in total inactivation of the enzyme. Assuming that this modifier is a specific carboxyl reagent, the data suggest that the inactivation of the T. denticola benzoylarginine peptidase was caused by the modification of one carboxyl group located close to the active site of the enzyme. Results obtained with Woodward's reagent K ( N -ethyl-5-phenylisoxazolium 3’-sulphonate) supported these findings. Carbethoxylation with diethylpyrocarbonate effectively inactivated the enzyme, and addition of hydroxylamine at pH 7.0 restored the activity almost totally, suggesting that the pyrocarbonate had reacted with tyrosyl or histidyl residues.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/73886/1/j.1365-2958.1990.tb00721.x.pd

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

Suffix Tree of Alignment: An Efficient Index for Similar Data

We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings $A$ and $B$ is a compacted trie representing all suffixes in $A$ and $B$. It has $|A|+|B|$ leaves and can be constructed in $O(|A|+|B|)$ time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not exploit the similarity which is usually represented as an alignment of $A$ and $B$. In this paper we propose a space/time-efficient suffix tree of alignment which wisely exploits the similarity in an alignment. Our suffix tree for an alignment of $A$ and $B$ has $|A| + l_d + l_1$ leaves where $l_d$ is the sum of the lengths of all parts of $B$ different from $A$ and $l_1$ is the sum of the lengths of some common parts of $A$ and $B$. We did not compromise the pattern search to reduce the space. Our suffix tree can be searched for a pattern $P$ in $O(|P|+occ)$ time where $occ$ is the number of occurrences of $P$ in $A$ and $B$. We also present an efficient algorithm to construct the suffix tree of alignment. When the suffix tree is constructed from scratch, the algorithm requires $O(|A| + l_d + l_1 + l_2)$ time where $l_2$ is the sum of the lengths of other common substrings of $A$ and $B$. When the suffix tree of $A$ is already given, it requires $O(l_d + l_1 + l_2)$ time.Comment: 12 page

Wave Energy: a Pacific Perspective

This is the author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by The Royal Society and can be found at: http://rsta.royalsocietypublishing.org/.This paper illustrates the status of wave energy development in Pacific Rim countries by characterizing the available resource and introducing the region‟s current and potential future leaders in wave energy converter development. It also describes the existing licensing and permitting process as well as potential environmental concerns. Capabilities of Pacific Ocean testing facilities are described in addition to the region‟s vision of the future of wave energy

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck

Simultaneous Embeddability of Two Partitions

We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region that contains exactly those points that belong to the elements in the block and that is bounded by a simple closed curve. We establish three main classes of simultaneous embeddability (weak, strong, and full embeddability) that differ by increasingly strict well-formedness conditions on how different block regions are allowed to intersect. We show that these simultaneous embeddability classes are closely related to different planarity concepts of hypergraphs. For each embeddability class we give a full characterization. We show that (i) every pair of partitions has a weak simultaneous embedding, (ii) it is NP-complete to decide the existence of a strong simultaneous embedding, and (iii) the existence of a full simultaneous embedding can be tested in linear time.Comment: 17 pages, 7 figures, extended version of a paper to appear at GD 201

Identification of vacancy defects in compound semiconductors by core-electron annihilation: Application to InP

We show that the Doppler broadening of positron annihilation radiation can be used in the identification of vacancy defects in compound semiconductors. Annihilation of trapped positrons with surrounding core electrons reveals chemical information that becomes visible when the experimental backgorund is reduced by the coincidence technique. We also present a simple calculational scheme to predict the high-momentum part of the annihilation line. The utility of the method is demonstrated by providing results for vacancies in InP. In electron irradiated InP the isolated In and P vacancies are distinguished from each other by the magnitude of the core-electron annihilation. In heavily Zn-doped InP we detect a native vacancy defect and identify it to a P vacancy decorated by Zn atoms.Peer reviewe