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

Primary familial brain calcification linked to deletion of 5' noncoding region of SLC20A2

OBJECTIVES: Primary familial brain calcification (PFBC) is a rare neurological disease often inherited as a dominant trait. Mutations in four genes (SLC20A2, PDGFB, PDGFRB, and XPR1) have been reported in patients with PFBC. Of these, point mutations or small deletions in SLC20A2 are most common. Thus far, only one large deletion covering entire SLC20A2 and several smaller, exonic deletions of SLC20A2 have been reported. The aim of this study was to identify the causative gene defect in a Finnish PFBC family with three affected patients. MATERIALS AND METHODS: A Finnish family with three PFBC patients and five unaffected subjects was studied. Sanger sequencing was used to exclude mutations in the coding and splice site regions of SLC20A2, PDGFRB, and PDGFB. Whole-exome (WES) and whole-genome sequencing (WGS) were performed to identify the causative mutation. A SNP array was used in segregation analysis. RESULTS: Copy number analysis of the WGS data revealed a heterozygous deletion of ~578 kb on chromosome 8. The deletion removes the 5' UTR region, the noncoding exon 1 and the putative promoter region of SLC20A2 as well as the coding regions of six other genes. CONCLUSIONS: Our results support haploinsufficiency of SLC20A2 as a pathogenetic mechanism in PFBC. Analysis of copy number variations (CNVs) is emerging as a crucial step in the molecular genetic diagnostics of PFBC, and it should not be limited to coding regions, as causative variants may reside in the noncoding parts of known disease-associated genes

The growth pattern and microvasculature of pancreatic tumours induced with cultured carcinoma cells

Pancreatic cancer is one of the most frustrating problems in gastroenterological surgery, since there is little we can do to improve the survival of patients with current treatment strategies. If one is to elucidate factors related to carcinogenesis, tumour biology, diagnostics and new treatment modalities of this malignant disease, then it is essential to develop a suitable animal model. In the present study we investigated rat pancreatic tumour growth after intrapancreatic injection of cultured pancreatic carcinoma cells (DSL-6A/C1), originally derived from an azaserine-induced tumour, as well as the features of tumour microcirculation using the microangiography technique. After intrapancreatic inoculation, tumours were detected in 64% of animals. A 1 cm3tumour volume was reached within 20 weeks after inoculation. The tumours were ductal adenocarcinomas. Larger tumours showed invasive growth and spreading into the surrounding tissues, mainly into spleen and peritoneum. Microangiography revealed that the pancreatic tumours had an irregular and scanty vessel network and there were avascular areas in the center of the tumour. The area between normal pancreas and the induced tumour had dense vascularization. Intrapancreatic tumour induction with cultured pancreatic carcinoma cells produced a solid and uniformly growing tumour in Lewis rats and it thus provides a possible model for pancreatic cancer studies. © 2000 Cancer Research Campaig

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

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

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

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

ExoMars entry, descent and landing science

The entry, descent and landing of ExoMars offer a rare (once-per-mission) opportunity to perform in situ investigation of the martian environment over a wide altitude range. Entry, Descent and Landing System (EDLS) measurements can provide essential data for atmospheric scientific investigations. We intend to perform atmospheric science measurements by exploiting data from EDLS engineering sensors and exploiting their readings beyond the expected engineering information

Using Sifting for k-Layer Straightline Crossing Minimization

We present a new algorithm for k-layer straightline crossing minimization which is based on sifting that is a heuristic for dynamic reordering of decision diagrams used during logic synthesis and formal verification of logic circuits. The experiments prove sifting to be very efficient. In particular it outperforms the traditional layer by layer sweep based heuristics known from literature by far when applied to k-layered graphs with k \ge 3