A problem in dialogue research is that of finding and managing expectations. Adjacency pair theory has widespread acceptance, but traditional classification features (in particular, ‘previous-tag’ type features) do not exploit this information optimally. We suggest a method of dialogue segmentation that verifies adjacency pairs and allows us to use dialogue-level information within the entire s...

We study 2and 3-dimensional digital geometry in the context of almost arbitrary adjacency relations. (Previous authors have based their work on particular adjacency relations.) We define a binary digital picture to be a pair whose components are a set of lattice-points and an adjacency relation on the whole lattice. We show how a wide class of digital pictures have natural "continuous analogs."...

Adjacencies stand at the beginning of a multitude of planning tasks. Especially in hospital planning they are essential for describing relationships between different organizational units – e.g. ‘close’, ‘distant’ or ‘neutral’. Mathematically, these terms map to relative weights between each pair of units in the range [-1, 1] which are put into a (symmetric) adjacency matrix. This matrix subseq...

A normally regular digraph with parameters (v, k, λ, μ) is a directed graph on v vertices whose adjacency matrix A satisfies the equation AAt = kI + λ(A + At) + μ(J − I − A − At). This means that every vertex has out-degree k, a pair of nonadjacent vertices have μ common out-neighbours, a pair of vertices connected by an edge in one direction have λ common out-neighbours and a pair of vertices ...

In digital topology, Euclidean n-space Rn is usually modeled either by the set of points of a discrete grid, or by the set of n-cells in a convex cell complex whose union is Rn. For commonly used grids and complexes in the cases n = 2 and 3, certain pairs of adjacency relations (κ, λ) on the grid points or n-cells (such as (4,8) and (8,4) on Z2) are known to be “good pairs”. For these pairs of ...