Positron states at vacancy-impurity pairs in semiconductors

Positron states at pure monovacancies and divacancies and vacancy-phosphorus pairs in Si as well as at As vacancies and As-vacancy–As-antisite pairs in GaAs are calculated. The dependence of the positron lifetime on the lattice relaxation around the defects is studied, and the effects related to the screening of positrons are discussed. The calculations are based on superimposing free atoms. The ability of the method to describe positron states at charged defects is demonstrated.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

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

From Theory to Practice: Plug and Play with Succinct Data Structures

Engineering efficient implementations of compact and succinct structures is a time-consuming and challenging task, since there is no standard library of easy-to- use, highly optimized, and composable components. One consequence is that measuring the practical impact of new theoretical proposals is a difficult task, since older base- line implementations may not rely on the same basic components, and reimplementing from scratch can be very time-consuming. In this paper we present a framework for experimentation with succinct data structures, providing a large set of configurable components, together with tests, benchmarks, and tools to analyze resource requirements. We demonstrate the functionality of the framework by recomposing succinct solutions for document retrieval.Comment: 10 pages, 4 figures, 3 table

Screening of positrons in semiconductors and insulators

Theoretical models are presented for the enhancement of the electron density at a positron in a semiconductor or insulator host. The model better suited for typical semiconductors is based on the many-body theory for the screening of a positron in electron gas. The starting point of the model for insulators is the atomic polarizability. The common parameter in both models is the high-frequency dielectric constant. Moreover, the enhancement depends on the ambient electron density in the semiconductor model and on the unit-cell volume in the insulator model. With use of the models developed, positron lifetimes in perfect semiconductor and insulator crystals have been calculated. In the calculations, three-dimensional electron densities and electrostatic potentials are obtained by atomic superposition and the fully three-dimensional positron wave functions are solved by a relaxation method. The calculated positron lifetimes agree with the experimental ones within a few picoseconds. Moreover, we have used the model to predict lifetimes of positrons trapped by lattice defects such as vacancies and vacancy clusters.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

Investigating thermal properties of gas-filled planetary regoliths using a thermal probe

We introduce a general purpose penetrator, fitted with a heater, for measuring temperature and thermal diffusivity. Due to its simplicity of deployment and operation the penetrator is well suited for remote deployment by spacecraft into a planetary regolith. Thermal measurements in planetary regoliths are required to determine the surface energy balance and to measure their thermal properties. If the regolith is on a planet with an atmosphere a good understanding of the role of convection is required to properly interpret the measurements. This could also help to identify the significant heat and mass exchange mechanisms between the regolith and the atmosphere. To understand the role of convection in our regolith analogues we use a network of temperature sensors placed in the target. In practical applications a penetrator will push material out of the way as it enters a target possible changing its thermal properties. To investigate this effect a custom built test rig, that precisely controls and monitors the motion of the penetrator, is used. The thermal diffusivity of limestone powder and sand is derived by fitting a numerical thermal model to the temperature measurements. Convection seems to play an important role in the transfer of heat in this case. Firstly a diffusion-convection model fits the laboratory data better than a diffusivity-only model. Also the diffusivity derived from a diffusivity-convection model was found to be in good agreement with diffusivity derived using other methods published in the literature. Thermal diffusivity measurements, inspection of the horizontal temperature profiles and visual observations suggests that limestone powder is compacted more readily than sand during entry of the penetrator into the target. For both regolith analogues the disturbance of material around the penetrator was determined to have an insignificant effect on the diffusivity measurements in this case

Compressed Data Structures for Dynamic Sequences

We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: $\mathrm{access}(i,S)$ returns the $i$-th symbol in $S$, $\mathrm{rank}_a(i,S)$ counts how many times a symbol $a$ occurs among the first $i$ positions in $S$, and $\mathrm{select}_a(i,S)$ finds the position where a symbol $a$ occurs for the $i$-th time. We present the first fully-dynamic data structure for arbitrarily large alphabets that achieves optimal query times for all three operations and supports updates with worst-case time guarantees. Ours is also the first fully-dynamic data structure that needs only $nH_k+o(n\log\sigma)$ bits, where $H_k$ is the $k$-th order entropy and $n$ is the string length. Moreover our representation supports extraction of a substring $S[i..i+\ell]$ in optimal $O(\log n/\log\log n + \ell/\log_{\sigma}n)$ time