Discovering the underlying structures present in large real world graphs is a fundamental scienti€c problem. Recent work at the intersection of formal language theory and graph theory has found that a Hyperedge Replacement Grammar (HRG) can be extracted from a tree decomposition of any graph. Œis HRG can be used to generate new graphs that share properties that are similar to the original graph...

A technique is presented for verifying real-time system speciications. A visual conceptual modeling language called ECM is used as a real-time speciication language. Speciications are translated into augmented Petri nets with timing and temporal logic constraints. A reachability tree of legal system states is generated from the timing constraints in the Petri net. Past temporal logic constraint...

MODIS data is of significant for the classification of regional forest cover due to its high temporal resolution and high spectral resolution. Forest cover is an important parameter for forest ecosystem. The objective of this preliminary study is to mapping forest cover from mutli-temporal MODIS data with decision tree. The classification forest samples were selected from four global land cover...

Temporal databases introduce the concept of time into underlying data, and provide built-in facilities that allow users to store and retrieve time-varying data. The aggregation in temporal databases, that is, temporal aggregation is an extension of conventional aggregation on the domain and range of aggregates to include time concept. Temporal aggregation is important for various applications, ...

Given an untrimmed video, temporal sentence localization (TSL) aims to localize a specific segment according given query. Though respectable works have made decent achievements in this task, they severely rely on dense video frame annotations, which require tremendous amount of human effort collect. In paper, we target another more practical and challenging setting: one-shot (one-shot TSL), lea...

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

We consider two symbolic approaches to bounded model checking (BMC) of distributed time Petri nets (DTPNs). We focus on the properties expressed in Linear Temporal Logic without the neXt-time operator (LTL−X) and the existential fragment of Computation Tree Logic without the neXt-time operator (ECTL−X). We give a translation of BMC to SAT and describe a BDD-based BMC for both LTL−X and ECTL−X. ...

With the ever-growing digital libraries and video databases, it is increasingly important to understand and mine the knowledge from video database automatically. Video association mining is a relatively new and emerging research trend used to discover and describe interesting patterns in video. The traditional classical association rule mining algorithms can not apply directly to the video. It ...