Showing papers on "Representation (systemics) published in 1986"

On derived domains in sentence phonology

Abstract: This paper deals with two distinct but inextricably connected sets of questions in the area of sentence phonology. The first concerns the organisation of sentence phonology and the nature of the phonological representation(s) of the sentence, and the second the relation between syntactic structure and phonological representation.

Constraint propagation algorithms for temporal reasoning

Abstract: This paper considers computational aspects of several temporal representation languages. It investigates an interval-based representation, and a point-based one. Computing the consequences of temporal assertions is shown to be computationally intractable in the interval-based representation, but not in the point-based one. However, a fragment of the interval language can be expressed using the point language and benefits from the tractability of the latter.

The appeal of parallel distributed processing

Abstract: This chapter contains sections titled: Parallel Distributed Processing, Examples Of PDP Models, Representation and Learning in PDP Models, Origins of Parallel Distributed Processing, Acknowledgments

Correspondence Analysis: Graphical Representation of Categorical Data in Marketing Research:

Abstract: Correspondence analysis is an exploratory data analysis technique for the graphical display of contingency tables and multivariate categorical data. Its history can be traced back at least 50 years...

Volume/surface octrees for the representation of three-dimensional objects

Abstract: The octree structure for the representation of 3D objects is an extension of the quadtree representation of 2D (binary) images. It is generated from the 3D binary array of the object it represents. However, the acquisition of a 3D array is not a trivial problem. In this study, we propose a scheme to generate an octree of an object from its three orthogonal views (silhouettes) exploiting a volume intersection technique. A multi-level boundary search algorithm is developed to incorporate surface information into the octree representation. This makes the octree representation compact, informative, and especially useful for graphic displays and object recognition tasks. An algorithm is also designed for computing the moment of inertia matrix, which is useful for object recognition. All the algorithms developed in this study are essentially tree traversal procedures and therefore are suitable for implementation on parallel processors.

A Step Towards Unification of Syntactic and Statistical Pattern Recognition

Abstract: The problem of pattern recognition is discussed in terms of single-entity representation versus multiple-entity representation. A combined syntactic-semantic approach based on attributed grammars is suggested. Syntax-semantics tradeoff in pattern representation is demonstrated. This approach is intended to be an initial step toward unification of syntactic and statistical approaches to pattern recognition.

Representing and Acquiring Geographic Knowledge

Abstract: : This thesis presents a computational model of memory for spatial relations; how knowledge of geography may be represented, retrieved, and acquired. We focus particularly on the problems of representing incomplete and inexact information in a knowledge base and of learning a large scale area from a sequence of small scale views of the area. Our model, called MERCATOR, includes an original representation scheme for two-dimensional space; routines that retrieve information from the knowledge base in useful form; and a routine (the assimilator) that builds up a knowledge base incrementally from a sequence of scene descriptions. All these have been implemented in a running computer program. The representation approximates object boundaries in terms of sequences of straight edges, and it records object positions in terms of the dimensions of edges. Inexactness information is represented by recording bounds on edge dimensions and on the maximal distance from an edge to a boundary, Incomplete information is represented by recording only part of the boundary and interior of an object. This scheme is capable of representing many kinds of situations and of partial states of knowledge. The assimilator consists of two parts. The matcher finds correspondences between a scene description and the knowledge base. The merger adds the new information from the scene description into the knowledge base. The major result of this thesis is that a representation of space should integrate shape and positional information, but should maintain an abstract level of geometric description separate from object descriptions.

Lexicon-grammar: the representation of compound words

Abstract: The essenti~d feature of a lexicon-grammar is that the elementary unit of computation and storage is the simple sentence: snbleet-verb-complement(s). -this type of representation is obviously needed for verbs: limiting a verb to its shape has no meaning other than typographic, ~ir]ce a verb cannot be separated from its subject and essential coreplemenl(s) 2. We have shown (M, Gross 1975) that given a verb, Or equivalent ly a simple sentence, the set of syntactic propert ies that describes its variations is unique: in general, no ether verb has an identical syntactic paradigm 3. As a consequence, the propert ies of each verbal construction must be represented in a texicon--grammar. The lexicon has no significance taken as an isolated component and the gr~rnmar tempera:at, viewed as independent of the lexicon, will have to be l imi ted to cer ta in complex sentences,

Content representation in teachers’ definitions of academic work

Abstract: (1986). Content representation in teachers’ definitions of academic work. Journal of Curriculum Studies: Vol. 18, No. 4, pp. 365-379.

A representation of parallel activity based on events, structure, and causality

Abstract: : Most AI domain representations have been based on state-oriented world models. In this paper we present an event-based model that focuses on domain events (both atomic and nonatomic) and on the causal and temporal relationships among them. Emphasis is also placed on representing locations of activity and using them to structure the domain representation. Our model is based on first-order temporal logic, which has a well-understood semantics and has been employed extensively in concurrency theory. We show how temporal-logic constraints on event histories (records of past activity) can facilitate the description of many of the complex synchronization properties of parallel, multiagent domains.

Algebraic properties of knowledge representation systems

Abstract: New concepts of knowledge representation systems, like object and attribute factors, connectedness relations, and seven kinds of homomorphisms of knowledge representation systems are introduced. Some properties of these homomorphisms, related to factors and connectedness, are shown. The theory presented here may be used to aggregate sets of objects, attributes, and descriptors of the original system in order to produce a simpler system, which preserves the description function of the original system. In some applications, the new system is sufficient representation of the original one.

Regenerative Representation for One-Dimensional Gibbs States

Abstract: On montre que les etats de Gibbs unidimensionnels peuvent etre representes comme des concatenations de listes infinies de «mots» iid

The representation of events in multiagent domains

Abstract: The purpose of this paper is to construct a model of actions and events suited to reasoning about domains involving multiple agents or dynamic environments. A model is constructed that provides for simultaneous action, and the kind of facts necessary for reasoning about such actions are described. A model-based law of persistence is introduced to describe how actions affect the world. No frame axioms or syntactic frame rules are involved in the specification of any given action, thus allowing a proper model-theoretic semantics for the representation. Some serious deficiencies with existing approaches to reasoning about multiple agents are also identified. Finally, it is shown how the law of persistence, together with a notion of causality, makes it possible to retain a simple model of action while avoiding most of the difficulties associated with the frame problem.

Violent transactions : the limits of personality

Abstract: Recent research has begun to focus on the particular circumstances which tend to elicit aggressive behaviour: an approach which coincides with an increased understanding of the cognitive factors involved with the internal representation of external situations. This book applies these tenets of interactionism' to aggressive behaviour.

Three Arguments for Extending the Framework of Probability

Abstract: The last few years has seen a growing debate about techniques for managing uncertainty in AI systems. Unfortunately this debate has been cast as a rivalry between AI methods and classical probability based ones. Three arguments for extending the probability framework of uncertainty are presented, none of which imply a challenge to classical methods. These are (1) explicit representation of several types of uncertainty, specifically possibility and plausibility, as well as probability, (2) the use of weak methods for uncertainty management in problems which are poorly defined, and (3) symbolic representation of different uncertainty calculi and methods for choosing between them.