Decomposition unit Patent

Unit for generating thrust from catalytic decomposition of hydrogen peroxide, for high altitude aircraft or spacecraft reaction contro

Order preserving pattern matching on trees and DAGs

The order preserving pattern matching (OPPM) problem is, given a pattern string $p$ and a text string $t$, find all substrings of $t$ which have the same relative orders as $p$. In this paper, we consider two variants of the OPPM problem where a set of text strings is given as a tree or a DAG. We show that the OPPM problem for a single pattern $p$ of length $m$ and a text tree $T$ of size $N$ can be solved in $O(m+N)$ time if the characters of $p$ are drawn from an integer alphabet of polynomial size. The time complexity becomes $O(m \log m + N)$ if the pattern $p$ is over a general ordered alphabet. We then show that the OPPM problem for a single pattern and a text DAG is NP-complete

Concentrations of 137Cs^{137}Cs, 40K^{40}K radionuclides and some heavy metals in soil samples of Chochołowska Valley from Tatra National Park

This paper presents the results of determination of artificial $^{137}Cs$ and natural $^{40}K$ activity concentrations and some heavy metals in soil samples from the region of one of the main valleys of Tatra National Park (Chochołowska). Our investigation concentrated on $^{137}Cs$ and heavy metal levels in mountain soil taken from Chochołowska Valley, which revealed great variability in their concentration. The results show considerably small amounts of radionuclides $^{137}Cs$ and $^{40}K$ in the soils. Larger amounts of those elements can be found in the organic surface horizons of the soils. The evaluation of the content of those elements must be based on the bulk density analysis of the soil

Orbit Determination with the two-body Integrals

We investigate a method to compute a finite set of preliminary orbits for solar system bodies using the first integrals of the Kepler problem. This method is thought for the applications to the modern sets of astrometric observations, where often the information contained in the observations allows only to compute, by interpolation, two angular positions of the observed body and their time derivatives at a given epoch; we call this set of data attributable. Given two attributables of the same body at two different epochs we can use the energy and angular momentum integrals of the two-body problem to write a system of polynomial equations for the topocentric distance and the radial velocity at the two epochs. We define two different algorithms for the computation of the solutions, based on different ways to perform elimination of variables and obtain a univariate polynomial. Moreover we use the redundancy of the data to test the hypothesis that two attributables belong to the same body (linkage problem). It is also possible to compute a covariance matrix, describing the uncertainty of the preliminary orbits which results from the observation error statistics. The performance of this method has been investigated by using a large set of simulated observations of the Pan-STARRS project.Comment: 23 pages, 1 figur

Duel and sweep algorithm for order-preserving pattern matching

Given a text $T$ and a pattern $P$ over alphabet $\Sigma$, the classic exact matching problem searches for all occurrences of pattern $P$ in text $T$. Unlike exact matching problem, order-preserving pattern matching (OPPM) considers the relative order of elements, rather than their real values. In this paper, we propose an efficient algorithm for OPPM problem using the "duel-and-sweep" paradigm. Our algorithm runs in $O(n + m\log m)$ time in general and $O(n + m)$ time under an assumption that the characters in a string can be sorted in linear time with respect to the string size. We also perform experiments and show that our algorithm is faster that KMP-based algorithm. Last, we introduce the two-dimensional order preserved pattern matching and give a duel and sweep algorithm that runs in $O(n^2)$ time for duel stage and $O(n^2 m)$ time for sweeping time with $O(m^3)$ preprocessing time.Comment: 13 pages, 5 figure

Assessing availability and greenhouse gas emissions of lignocellulosic biomass feedstock supply – case study for a catchment in England

© 2019 Society of Chemical Industry and John Wiley & Sons, Ltd.Feedstocks from lignocellulosic biomass (LCB) include crop residues and dedicated per¬ennial biomass crops. The latter are often considered superior in terms of climate change mitigation potential. Uncertainty remains over their availability as feedstocks for biomass provision and the net greenhouse gas emissions (GHG) during crop production. Our objective was to assess the optimal land allocation to wheat and Miscanthus in a specific case study located in England, to increase bio¬mass availability, improve the carbon balance (and reduce the consequent GHG emissions), and mini¬mally constrain grain production losses from wheat. Using soil and climate variables for a catchment in east England, biomass yields and direct nitrogen emissions were simulated with validated process-based models. A ‘Field to up-stream factory gate’ life-cycle assessment was conducted to estimate indirect management-related GHG emissions. Results show that feedstock supply from wheat straw can be supplemented beneficially with LCB from Miscanthus grown on selected low-quality soils. In our study, 8% of the less productive arable land area was dedicated to Miscanthus, increasing total LCB provision by about 150%, with a 52% reduction in GHG emission per ton LCB delivered and only a minor effect on wheat grain production (−3%). In conclusion, even without considering the likely carbon sequestration in impoverished soils, agriculture should embrace the opportunities to provide the bioeconomy with LCB from dedicated, perennial crops.Peer reviewe

Computing Covers under Substring Consistent Equivalence Relations

Covers are a kind of quasiperiodicity in strings. A string $C$ is a cover of another string $T$ if any position of $T$ is inside some occurrence of $C$ in $T$. The shortest and longest cover arrays of $T$ have the lengths of the shortest and longest covers of each prefix of $T$, respectively. The literature has proposed linear-time algorithms computing longest and shortest cover arrays taking border arrays as input. An equivalence relation $\approx$ over strings is called a substring consistent equivalence relation (SCER) iff $X \approx Y$ implies (1) $|X| = |Y|$ and (2) $X[i:j] \approx Y[i:j]$ for all $1 \le i \le j \le |X|$. In this paper, we generalize the notion of covers for SCERs and prove that existing algorithms to compute the shortest cover array and the longest cover array of a string $T$ under the identity relation will work for any SCERs taking the accordingly generalized border arrays.Comment: 16 page

The Pan-STARRS Moving Object Processing System

We describe the Pan-STARRS Moving Object Processing System (MOPS), a modern software package that produces automatic asteroid discoveries and identifications from catalogs of transient detections from next-generation astronomical survey telescopes. MOPS achieves > 99.5% efficiency in producing orbits from a synthetic but realistic population of asteroids whose measurements were simulated for a Pan-STARRS4-class telescope. Additionally, using a non-physical grid population, we demonstrate that MOPS can detect populations of currently unknown objects such as interstellar asteroids. MOPS has been adapted successfully to the prototype Pan-STARRS1 telescope despite differences in expected false detection rates, fill-factor loss and relatively sparse observing cadence compared to a hypothetical Pan-STARRS4 telescope and survey. MOPS remains >99.5% efficient at detecting objects on a single night but drops to 80% efficiency at producing orbits for objects detected on multiple nights. This loss is primarily due to configurable MOPS processing limits that are not yet tuned for the Pan-STARRS1 mission. The core MOPS software package is the product of more than 15 person-years of software development and incorporates countless additional years of effort in third-party software to perform lower-level functions such as spatial searching or orbit determination. We describe the high-level design of MOPS and essential subcomponents, the suitability of MOPS for other survey programs, and suggest a road map for future MOPS development.Comment: 57 Pages, 26 Figures, 13 Table