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...

A query optimizer requires cost models to calculate the costs of various access plans for a query. An effective method to estimate the number of disk (or page) accesses for spatio-temporal queries has not yet been proposed. The TPR-tree is an efficient index that supports spatio-temporal queries for moving objects. Existing cost models for the spatial index such as the R-tree do not accurately ...

Tree shrews (Tupaia belangeri) are small diurnal mammals capable of quick and agile navigation. Electroretinographic and behavioral studies have indicated that tree shrews possess very good temporal vision, but the neuronal mechanisms underlying that temporal vision are not well understood. We used single-unit extracellular recording techniques to characterize the temporal response properties o...

Consider a dynamic set of multidimensional objects S, that evolves over time. A temporal membership query asks whether an object with given key attributes was in the set S at some time t. This paper provides efficient solutions to this temporal query. In particular, we present partially persistent extensions to (i) a hashing based scheme the BANG file and (ii) the hB -tree. The performance of b...

In this work, we present a Fuzzy Constraint Networks model for discrete domains, which generalizes the Disjunctive Fuzzy Temporal Constraint Networks model for temporal reasoning, and we propose the use of the seriesparallel and tree-decomposition approaches for simplifying its processing. After a separate empirical evaluation process of both techniques, a combined evaluation process over the s...

The representation of time in geographic information systems (GIS) has been subject of intense investigation in late years. Actual research involves from modeling techniques for spatio-temporal representation of reality to spatio-temporal data structures and file organizations. In this paper, we propose to explore the multidimensional structure of both the Kd-Tree and the Adaptive Kd-Tree in or...

The Disjunctive Fuzzy Temporal Constraint Networks model allows to express complex temporal constraints, but its general complexity is exponential. There is a subset of these networks, having a tree structure, which can be solved in polinomial time. Thus, it can be interesting to decide if a Disjunctive Fuzzy Temporal Constraint Network can be reduced to an equivalent network with tree structur...