The R-Tree and variant indexes have been used for multidimensional indexing since 1984 and applied to temporal data since 1994. Despite this, there are few functional implementations of the index that can be applied directly to the temporal data. This paper explores the use of the index for temporal subsequence searches and identifies two implications that must be considered so the index can be...

IN THE TITLE COMPOUND (SYSTEMATIC NAME (R)-dimeth-yl{2-[1-phenyl-1-(pyridin-2-yl)eth-oxy]eth-yl}aza-nium (R,R)-3-carb-oxy-2,3-dihy-droxy-propano-ate), C(17)H(23)N(2)O(+)·C(4)H(5)O(6) (-), the doxylaminium cation is protonated at the N atom. The tartrate monoanions are linked by short, almost linear O-H⋯O hydrogen bonds into chains extended along [100]. These chains are inter-linked by anion-pyr...

In many scienti c and commercial applications such as Earth Observation System (EOSDIS) and mobile phone services tracking a large number of clients, it is a daunting task to archive and index ever increasing volume of complex data that are continuously added to databases. To eÆciently manage multidimensional data in scienti c and data warehousing environments, R-tree based index structures hav...

We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling and precedingsibling axes. We develop a family of index structures, which we refer to as transformed split-tree indexes, to address this problem, in which (i) XML data is horizontally split by a simple, yet efficient c...

Example 1 (Mixture of K Poisson distributions). The sample spaces are X = Z+ := {0, 1, 2, . . . } = and Y = [K] := {1, 2, . . . ,K}. The parameter space is Θ = ∆K−1 × R++, where ∆K−1 := {π = (π1, π2, . . . , πK) ∈ R+ : ∑K j=1 πj = 1}, R+ := {t ∈ R : t ≥ 0}, and R++ := {t ∈ R : t > 0}. Each distribution Pθ in P = {Pθ : θ ∈ Θ} is as follows. If (X,Y ) ∼ Pθ for θ = (π, λ1, λ2, . . . , λK), then Y ...

We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X . AMS Classification 54F15,54F05,20F65,20E08