Previous attempts to quantify the adequacy between phylogenetic trees (cladograms with a temporal dimension) and the fossil record failed because of inappropriate statistics. A general explanation for this failure is based on a hierarchical perception of the temporal scale. When time is conceived as a hierarchy and not as an arrow, it can be expressed by a pectinate-shaped tree. Comparison betw...

External dynamic hashing has been used in traditional database systems as a fast method to answer membership queries. Given a dynamic set S of objects, a membership query asks whether an object with identity k is in the most current S. This paper addresses the more general problem of Temporal Hashing. In this setting changes to the dynamic set are timestamped and the membership query has a temp...

This paper describes our participation in Temporal Intent Disambiguation (TID), which is a subtask of the pilot task of NTCIR’12 Temporal Information Access (Temporalia-2) task [6]. We considered the task as a slight variation of supervised machine learning classification problem. Our strategy involves building models on different standard classifiers based on probabilistic and entropy models f...

Several applications require management of data which is spatially dynamic, e.g., tracking of battle ships or moving cells in a blood sample. The capability of handling the temporal aspect, i.e., the history of such type of data, is also important. This paper presents and evaluates three temporal extensions of the R-tree, the 3D R-tree, the 2+3 R-tree and the HR-tree, which are capable of index...

To support temporal operators and to increase the efficiency of temporal queries, indexing based on temporal attributes is required. We consider the problem of indexing the temporal dimension in valid time databases. We assume that the temporal information of data objects are represented as valid time intervals that have to be managed dynamically by an efficient index structure. Unlike the time...

Monte-Carlo Tree Search is a very successful game playing algorithm. Unfortunately it suffers from the horizon effect: some important tactical sequences may be delayed beyond the depth of the search tree, causing evaluation errors. Temporal-difference search with a function approximation is a method that was proposed to overcome these weaknesses, by adaptively changing the simulation policy out...

A temporal database is essential to applications dealing with time-varying data [11], such as trend analysis and prediction in decision support systems, version management in computer aided designs, medical record management, and data warehousing. In this regard, a temporal database system is used to store and query time-varying information. There has been extensive research on temporal databas...

With the increasing of requirements from many aspects, various queries and analyses arise focusing on social network. Queries like finding users, friends or social activities satisfying a certain period gives temporal insights into retrieval or statistics, hence augmenting temporal query capability in such context, temporal social network (TSN), is meaningful. We propose three kinds temporal qu...

Many temporal and modal logic languages can be regarded as subsets of rst order logic i e the semantics of a temporal logic formula is given as a rst order condition on points of the underlying models Kripke structures Often the set of possible models is restricted to models which are trees A temporal logic language is rst order expressively complete if for every rst order condition for a node ...

Given modal logics 1, 2, their lexicographic product 1 ⇤ 2 is a new logic whose frames are the Cartesian products of a 1-frame and a 2-frame, but with the new accessibility relations reminiscent of a lexicographic ordering. This article considers the lexicographic products of several modal logics with linear temporal logic (LTL) based on “next” and “always in the future”. We provide axiomatizat...