|
1. |
TOWARD A COMMON STRUCTURAL LEVEL FOR SOFTWARE, DATABASE, AND KNOWLEDGE-BASED SYSTEMS |
|
Applied Artificial Intelligence,
Volume 3,
Issue 4,
1989,
Page 405-426
R. MOTSCHNIG-PITRIK,
Preview
|
PDF (618KB)
|
|
摘要:
Different languages, tools, and techniques are used for the development of software systems, including database and knowledge-based systems. Although underlying languages employ structuring concepts such as classification, modularization, generalization, and perspectives, these common concepts remain overshadowed by differing terminologies and notations, due to the separate histories of software engineering, databases, and knowledge representation. Currently the still more complex and ambitious requirements on software systems call for integrated solutions concerning software engineering environments. As a starting point toward integration, in this paper we aim at deriving a common structural level for software systems. To approach this goal we start by analyzing the human thought process on one hand and successfully applied structuring techniques on the other hand to derive a catalogue of 10 structuring concepts. Building on that, a self-contained language called SFW (structuring framework) is introduced to provide means for a general and uniform specification of the structure of software systems. SFW is aimed at providing a catalogue of reference for structuring concepts in today's languages as well as a suggestion to establish a uniform structural level in future approaches.
ISSN:0883-9514
DOI:10.1080/08839518908949934
出版商:Taylor & Francis Group
年代:1989
数据来源: Taylor
|
2. |
TWO-STAGE STRATEGY FOR MOTION PARAMETER ESTIMATION IN DYNAMIC IMAGES |
|
Applied Artificial Intelligence,
Volume 3,
Issue 4,
1989,
Page 427-438
HUA LI,
Preview
|
PDF (297KB)
|
|
摘要:
In this paper we consider motion parameter estimation in dynamic images with the constraint of using as little computation time as possible. We propose using a two-stage divide-and-conquer strategy to achieve this goal. At the first stage, moving objects are located with modest computation time. At the second stage, motion parameter estimation is performed on the localized region. This two-stage strategy reduces the extensive computation task and provides a flexible mechanism to allow termination between the two stages. It is designed to mimic certain features of human visual perception. The derived computation formulas have simplicity and nice regularity, as well as a good local structure that enables the computation to be performed locally.
ISSN:0883-9514
DOI:10.1080/08839518908949935
出版商:Taylor & Francis Group
年代:1989
数据来源: Taylor
|
3. |
COMBINING OPINIONS FROM SEVERAL EXPERTS |
|
Applied Artificial Intelligence,
Volume 3,
Issue 4,
1989,
Page 439-452
XIAONING LING,
W. G. RUDD,
Preview
|
PDF (412KB)
|
|
摘要:
This paper addresses the problem of aggregating a number of expert opinions that have been expressed in some numerical form. An important feature of sets of expert opinions is the possibility of stochastic dependence between members of the sets. We develop an approach for combining expert opinions that formally allows for such dependence. This approach is based on an extension of the Dempster-Shafer theory, a well-known calculus for reasoning with uncertainty in artificial intelligence.
ISSN:0883-9514
DOI:10.1080/08839518908949936
出版商:Taylor & Francis Group
年代:1989
数据来源: Taylor
|
4. |
SOLVING THE JIGSAW PUZZLE PROBLEM IN LINEAR TIME |
|
Applied Artificial Intelligence,
Volume 3,
Issue 4,
1989,
Page 453-462
TOM ALTMAN,
Preview
|
PDF (229KB)
|
|
摘要:
We introduce an algorithm that efficiently matches (fits together) parts of boundaries of two-dimensional objects in order to assemble apictorial jigsaw puzzles. A rotation-independent shape encoding allows us to find the best (longest) match between two shapes in time proportional to the sum of the lengths of their representations. In order to find this match, we use Weiner's string matching technique combined with compact position trees to find, in linear time, the longest shared pattern between two strings. The shape matching procedure is then used by two greedy algorithms to assemble the apictorial jigsaw puzzles.
ISSN:0883-9514
DOI:10.1080/08839518908949937
出版商:Taylor & Francis Group
年代:1989
数据来源: Taylor
|
5. |
A KNOWLEDGE-BASED SYSTEM FOR COURSE SCHEDULING |
|
Applied Artificial Intelligence,
Volume 3,
Issue 4,
1989,
Page 463-482
UDAYA GUNASENA,
SOUNDARR. T. KUMARA,
ALLENL. SOYSTER,
Preview
|
PDF (508KB)
|
|
摘要:
A knowledge-based scheduling system has been developed for the domain of university class scheduling. The problem addressed is how to schedule courses during the various time periods throughout the day. The class schedule must satisfy a variety of appropriate constraints. The system, written in Prolog, resolves conflicting assignments through backtracking. The inefficiency of Prolog's backtracking feature, with respect to this application, is partly circumvented by the use of a dynamic circular array. The system is now being used to help schedule industrial engineering classes at the Pennsylvania State University.
ISSN:0883-9514
DOI:10.1080/08839518908949938
出版商:Taylor & Francis Group
年代:1989
数据来源: Taylor
|
|