180
Decision Support Systems Reports and Theses: .4bstracts
Institute of Computer Science, Polish Academy of Sciences, 00-901 Warsaw, Poland, (November 1983). Tri-partite graphs are the ones in which the node set can be presented in the form of a sum of three mutually disjoint subsets, called inner-stable, such that no pair of nodes belonging to the same subset is mutually adjacent. The graph is called strongly tri-partite if such a partition of its node set is unique (excepting the rearrangement of the labels). In the present paper there are considered some basic properties of tri-partite and of strongly tripartite graphs. The sufficient and necessary conditions for an algebraic sum, an intersection, an asymmetrical difference and a Cartesian product of graphs to become a tri-partite (strongly tri-parrite) graph are given in a series of theorems. Some possible applications of tri-partite graphs for the description of computer networks has been mentioned. Author's Abstract Burt Leavenworth: ADAPT.. A Tool for the Design
of Reusable Software, IBM Thomas J. Watson Research Center, Yorktown Heights, (Dec. 1982). The ADAPT package is an integrated set of tools and methodology for the design and development of software systems. As an introduction to the description of the ADAPT tools, we discuss and characterize some current software tools in a gerteral systems development setting. We then describe the major features of the ADAPT package, and illustrate how they are used to define a package of reusable software components. Finally, the benefits of the ADAPT package are discussed with emphasis on executable design, usability and modifiability. Author's Abstract Bengt Lundberg: A Reasoning System for Computer Aided Engineering, SYSLAB-S, University of Stockholm, (Feb. 1984). A reasoning system for a practical case is presented. General knowledge about a universe of discourse is represented and processed in the system. The general knowledge implicitly represents concrete knowledge which due to its volume is impossible to represent explicitly. The formal and informal aspects of the used representation scheme
are discussed. Further, the heuristic components of the reasoning system are explicated with respect to some of the identified processing requirements. Author's Abstract
Kalle Lyytinen: The Philosophical Natu're of Information Requirements and some Research Implications, SYSLAB-S, University of Stockholm, (May 1983). A good information requirements specification plays a decisive role in successful information systems development. A myriad of specification methods have been proposed with alternative scopes and levels of sophistication. In the paper we show that most of them are based on a set undisputed normative statements and beliefs concerning human social behaviour and the nature of "nformation systems. These postulates and conjectures determine the general content and objectives of information requirements, which are shown to be identical with the content and goals of technical practice manifested in technology. Another, augmenting, interpretation for information requirements is proposed, based on a different set of postulates and conjectures, where information requirements share characteristics of interpretations of human symbolic culture. There interpretations are normally studied and discussed in "human sciences" (Geisteswissenschaften). It is proposed that information requirements should be inte:'preted in both ways in order to assure the successfulness of requirements specification. It is shown that the derived interpretations correspond to the Popperian world 1 and worlds 2 and 3, respectively. Author's Abstract
Edward A. MacNair and Charles H. Sailer:. The Research Queueing Package: A Primer, IBM T.J. Watson Research Center, Yorktown Heights, (Jan. 1983). The Research Queueing Package (RESQ) is a tool for describing complex systems like computer systems, communication networks, office systems, manufacturing lines and distributed systems and for predicting their performance. RESQ provides facilities for representing the complexities which exist in these systems. Once these complexities are defined, performance measures can easily be produced to predict the behaviour of the system being investigated.