Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic. In [DGP05] it is shown that the theory of relational semantics is also available in the more general setting of substructural logic, at least in an algebraic guise. Building on these ideas, in [Geh06] a type of frames is described which generalise Kripke frames and provide semant...

Bilattices and d-frames are two different kinds of structures with a four-valued interpretation. Whereas d-frames were introduced with their topological semantics in mind, the theory of bilattices has a closer connection with logic. We consider a common generalisation of both structures and show that this not only still has a clear bitopological semantics, but that it also preserves most of the...

We present a novel, low-level scheme to analyze spatial and temporal change within a local support region. Assuming available region correspondences between two adjacent frames, we divide each region into a regular grid of patches. Depending on the change of an image function inside the patch over time, each patch is assigned weights for the following four labels: “C” for a constant patch, “O” ...

The first part of the paper proposes a formal foundation of a theory of frames. Frames are embedded into a general ontology. On this background, we introduce a formal model-theoretic semantics for frames and thereby an interface to formal semantics. The model-theoretic semantics allows us to define central notions of frame theory such as the “satisfaction type” for a node in a given frame, and ...

In recent years, with the amount of video data increasing rapidly, automatic methods are needed to deal with large-scale video data sets in various applications. A common and fundamental preprocess for these applications is video segmentation. Based on the segmentation results, video has a hierarchical representation structure of frames, shots, and scenes from the low level to high level. And f...

We describe an initial version of an algorithm for generating named references to locations of geographic scale. We base the algorithm design on evidence from corpora and experiments, which show that named entity usage is extremely frequent, even in less obvious scenes, and that names are normally used as the first focus on a global region. The current algorithm normally selects the Frames of R...

Scenes Vocabulary The abstract scenes interface developed by Antol et al. [1] consists of 20 “deformable” humans, 31 animals in different poses, and about 100 objects that can be found in indoor scenes (e.g., couch, picture, doll, door, window, plant, fireplace) or outdoor scenes (e.g., tree, pond, sun, clouds, bench, bike, campfire, grill, skateboard). In addition to the 8 different expression...

The paper discusses discrete frames as an attractive semantics for modal logic. We study questions of completeness, persistence, duality and definability. Notions of completeness, strong global completeness and complexity of dual varieties coincide for discrete frames; moreover, they are equivalent to conservativity of minimal hybrid extensions. The paper also provides some criteria of di-persi...

This paper presents an effective algorithm for occlusion culling using hardware occlusion queries. Number of queries is optimized according to the results of the queries from several preceeding frames. Parts of the scene which are found to be unoccluded in the recent frames, are tested less often thus reducing the number of queries performed per frame. The algorithm is applicable to any kind of...