We study the total -powered length of rooted edges in a random minimal directed spanning tree — first introduced Bhatt and Roy (2004) on Poisson process with intensity unit cube for . While Dickman limit was proved Penrose Wade case , dimensions three higher, Bai, Lee (2006) showed Gaussian central theorem when rate convergence order In this article, we extend these results prove any dimension ...

A predictive spatio-temporal query retrieves the set of moving objects that will intersect a query window during a future time interval. Currently, the only access method for processing such queries in practice is the TPR-tree. In this paper we first perform an analysis to determine the factors that affect the performance of predictive queries and show that several of these factors are not cons...

The artificial dendritic tree, as part of a silicon neuromorph, is modelled as a multibranched, passive cable structure. Synaptic activations are either depolarizing (excitatory), hyperpolarizing (inhibitory), or shunting. Contemporaneous synaptic activation at widely separated sites on the tree result in linear summation of their effects, as do neighboring excitatory and inhibitory activations...

The key notion for modelling calendar systems and many other periodic temporal notion is the mathematical concept of a partitioning of the real numbers. A partitioning of R splits the time axis into a sequence of intervals. Basic time units like seconds, minutes, hours, days, weeks, months, years etc. can all be represented as partitionings of R with finite partitions. Besides the basic time un...

JJ89] C. Jard and T. Jeron. On-line model-checking for nite linear temporal logic speciications. 6 Conclusions In this paper we showed that tree automata, which have been considered unsuitable for branching-time model checking, provide a neat and optimal framework for branching-time temporal logics and can handle, eeciently, model checking. The crucial point in our method is that when branching...

Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning trees of the ST network. The TSMST computation problem aims to identify a collection of distinct minimum spanning trees and their respective timesub-intervals under the constraint that the edge weight functions are piec...

We consider a rooted tree R to be a rooted subtree of a given tree T if the tree obtained by replacing the directed arcs of R by undirected edges is a subtree of T . In this work, we study the problem of assigning colors to a given set of rooted subtrees R of a given host tree T such that if any two rooted subtrees share a directed edge, then they are assigned different colors. The objective is...