- Email: [email protected]
ACM Computer Science Conference
428
ConferenceReports
The Proceedings of the Conference have been edited by M.E. Nicholson and published by ASM International under the title Electronic Packaging and Corrosion in Microelectronics. 1987. v i i i + 2 9 6 pages. ISBN: 0-87170-291-6; SAN 204-7586. Price: US $ 69.00 list and $ 55.20 ASM member. Order from ASM's Customer Service Dept., Metals Park, OH 44073. Code: 6085.
ACM Computer Science Conference The 1987 ACM Fifteenth Annual Computer Science Conference was held in St Louis, Missouri from 17-19 February, 1987. The Conference was sponsored and organized by the Association for Computing Machinery. The Co-Chairs were A.R. Dekock (McDonell Douglas Research Laboratory, St Louis, U.S.A.) and J. W. Hamblen (University of Missouri-Rolla, Rolla, MO, U.S.A.). The Program Chair was G.W. Zobrist (University of Missouri-Rolla, Rolla, MO, U.S.A.). 58 refereed papers were presented in 19 sessions with one invited abstract session. In addition, 124 abstracts were presented in 19 sessions. The topics covered ranged from: Expert Systems, Software Engineering, Systems Applications, Databases, Algorithms, Education, Information Processing, Graphics, Parallel Processing, Computer Science Theory and Networks and Architectures. We present below a report on the lectures presented at the Conference.
Refereed Papers Unix Text Formatters G. Biswas, M.M. Matthews and A. Huang (University of South Carolina, Columbia, sc, U.S.A.) described an active assistance system for the text formatters on the Unix system. They explained how a complete user model was designed to determine
user proficiency in the use of text formatters. The model has two components: an overlay model and a process model. They described both and explained that using them a prompting mechanism provides the user with messages that explain how certain tasks can be done in an efficient way.
Graphics Oriented Software A workstation-based monolingual programming environment which supports design, implementation, documentation and maintenance within the software production process was described by G. Blaschek (Johannes Kepler University, Linz, Austria) and G. Pomberger (University of Zurich, Switzerland). They explained that the most important features are the graphic oriented program development, the design of the user interface and the adaptibility to various programming languages.
User Interface Generator A. Heirich (Applied Dynamic International, Ann Arbor, uI, U.S.A. and University of Michigan, Ann Arbor, ul, U.S.A.) explained that um is a mixed control model (Tanner) user interface management system for interactive command-driven programs. He described its features and the specification process and stated that UIG generates end-user documentation and is streamlined to make maintenance chores easy. Interactive Digital Simulation Laboratory Using interactive simulation preserves the experimental nature of digital-logic and computer-design laboratories. Components providing special features and design challenges extend a simulator to enhance this mode of simulation. R.J. Reid (Michigan State University, MI, U.S.A.) described these special components and explained how they provide powerful diagnostic tools, multi-element displays, and animated devices.
Conservative Codes Y. Ofek (University of Illinois at Urbana, IL, U.S.A.) explained that the family of conservative codes is a
Conference Reports
new scheme for encoding and decoding digital data for very high speed serial communication. These codes are characterized by having a constant number of transitions in each codeword and a known delimiting transition (rising or falling edge) at the end of each codeword. The conservative encoding scheme is primarily intended for binary data transmission in a single mode fiber optic network.
429
two distinct and frequently-used high-level concepts in parallel programming: condition synchronization and scheduling and, in most of the useful cases, users can simply specify the synchronization constraints imposed by these concepts in a given problem, without having to implement the constraints with some lower-level primitives.
Data Structures Improved Parallel Algorithms Parallel algorithms for ordered depth-first search and the monotone circuit value on parallel random access machines and single bus multiprocessors were presented by P. Varman and K. Doshi (Rice University, Houston, TX, U.S.A.). They explained that their technique permits them to implement to these algorithms efficiently on single bus multiprocessor architectures in time O(n2/p) for l < p < n.
Large-grained Data Flow EASY-FLOW, a data-flow language above the level of a traditional high level language was presented by H.M. Standley (The University of Toledo, OH, U.S.A.) for the purpose of adapting programs written in a conventional programming language to a parallel environment. She explained that a program written in EASY-FLOWconsists of a set of subprogram calls as units, structured by iteration, branching and distribution constructs. The sequencing of execution within these structures is dictated by the data dependencies between units.
Interprocess Synchronization and Communication A new linguistic mechanism for expressing and controlling interprocess interactions was presented by C.S. Hsieh and E.A. Unger (Kansas State University, Manhatten, KS, U.S.A.). Unlike existent designs such as monitor- or message-based mechanisms, which generally provides a set of relatively low-level primitives for users to implement various interprocess synchronization constraints, this mechanism provides a general conceptual framework to help users visualize and specify interprocess synchronization and communication from a higher-level vantage point. This conceptual framework highlights
J.C. Thompson and R. Sanati-Mehrizy (University of Oklahoma, Norman, OR, U.S.A.) presented a method for the formalization of operations on a certain class of syntactically represented linked data structures and then defined a set of functions to perform the operations. The function definitions are based on the idea of functional programming originated by John Backus. These function definitions will provide more functions for the implementation of extended functional progamming language designed for operations on data structures. Model of Software Reliability K.J. Dotson (NASA Langley Research Center, Hampton, VA, U.S,A.) established the utility of pivotal functions for assessing the reliability of software that has undergone a testing and development process. Testing and Debugging In their presentation M~,4. O'Connor (Prime Computer, Inc., Framingham, MA, U.S.A.) and K.A. Lemone (Worcester Polytechnique Institute, Worcester, MA, tJ.s.g.) described an attributed grammar for an IF THEN ELSEconstruct which can easily be extended to other control flow statements such as a WHILEDO construct. They explained that the development of robot programs is a tricky and complex process. Incremental computation aids a programmer by preventing the continuing of execution of code sequences which cannot accomplish any useful task. Also, this method may prevent damage from occurring due to a code sequence executed with critical sensory input missing. Attribute grammars proved to be an effective method to achieve this incremental compilation system.
430
Conference Reports
A Parallel Algorithm Liwu Li and T.A. Marsland (University of Alberta, Edmonton, Canada) presented a parallel algorithm for finding the maximum flow in 0-1-networks. Their design is for a mesh-connected processor array and is based on the observation that an augmenting path in a 0-l-network can be found in time proportional to the number of vertices in the given network, rather than to the number of edges. They explained that ifn is the number of vertices in a 0-1network then the time complexity of the parallel algorithm is O(n2+~'), where can be any small positive real number. A Routing Algorithm A heuristic algorithm was introduced by R.W. Wilkerson (University of Missouri-Rolla, Mo, U.S.A.) that obtains the connections for switches of arbitrary size with less use of backtracking. Furthermore the algorithm can be applied to three stage rearrangeable Clos networks. He explained that the algorithm depends heavily upon some basic theorems about systems of distinctive representatives.
Improved Sorting Algorithms Observations that improve processor utilization and decrease communication overhead for several sorting algorithms were made by A. Park and K. Balasubramanian (Princeton University, New Jersey, U.S.A.). These lead to constant factor improvements on the best previous parallel sorting bounds for both mesh-connected and linearly parallel architectures.
Petri Nets Modified M-timed Petri nets are Petri nets with exponentially distributed firing times and with generalized inhibitor arcs to interupt firing transitions. W.M. Zuberek showed (Memorial University of Newfoundland, St John's, Canada) that the behaviour of modified free-choice M-timed Petri nets can be represented by probabilistic state graphs, stationary probabilities of states can thus be obtained by standard techniques used for analysis of
continuous Markov chains. Simple models of computer systems with different scheduling strategies were used as an illustration of modelling and performance analysis,
Exploring Operating System Internals C.M. Shub (University of Colorado, at Colorado Springs, V.S.A.) described an innovative project involving the use of workstations as a laboratory tool in the required undergraduate operating systems course as well as in an elective performance evaluation course. This particular use allows students hands-on experience working with the internals of a modern operating system. It also allows students to perform experiments comparing the performance aspects of different implementations of operating system internals. Operating System Nucleus A concept of an operating system nucleus was introduced and its synthesis discussed by J. Kazimierczak (Technical University of Wroclaw, Poland). According to this concept the operating system nucleus should be realized as hardware that generates the operation code and address parts of the programs belonging to the os-nucleus. Some advantages of the presented approach to a new type of the os-nucleus were discussed.
Bringing Algorithms to Life J. Sigle (Louisiana State University, Shreveport, LA, U.S.A.) presented a systematic approach to augmenting the code of a program so that it becomes self-illustrating. When this augmented code is run it renders the algorithmic behaviour highly visible. Two versions of this approach were presented. The first, and simpler, shows the data being manipulated by the algorithm; the second additionally shows the program going through its paces. Teaching Principles A first course of two semesters in computer science that is based on mathematical principles of computer program analysis and design, rather than on
Conference Reports
apprenticeship programming was described by H.D. Mills (IBM Corporation, and University of Maryland, MD, U.S.A.), V.R. Basili and J.D. Gannon (University of Maryland, MD, U.S.A.) and R.G. Hamlet (Oregon Graduate Center, OR, U.S.A.). They explained that the course is modelled on elementary mathematics courses in both content and pedagogy.
Introductory Course A. Tellep (The Pennsylvania State University, Schuylkill Campus, PA, U.S.A.) stated that it seems obvious that if learning about computers and computer applications is here to stay, then we should recognize the fact that we need to look for better ways to instruct students or trainees in computer science. He presented an experiment in which language oriented and non-language oriented methods were analysed and presented the results concluding that the experiment was not able to show a clear cut best method and that more research should be done.
431
A Parallel Inference Engine A development environment focused on real-time embedded systems with AJ. was described by H. Lee and W. Moseley (North Texas State University, Denton, TX, U.S.A.) as a part of the deliverable system. This environment will support object-oriented design and object-oriented programming, generic knowledge packages such as frames, and a very flexible inference engine.
Theorem Proving Techniques D. Y.Y. Yun and C.N. Zhang (Southern Methodist University, Dallas, TX, U.S.A.) illustrated that the formal verification of the systolic network can be carried out using techniques developed in the theorem proving by production systems. This is achieved by partitioning the original network into two or more parts and applying the method of the symbolic induction to it. Run Time
Abstract Sessions
A Package Capturing System D.S. Mok (Western Illinois University, m, u.s.a.) described the design of a package capturing system useful in measuring and analysing the performance of networks conforming to the mEE 802.5 TokenRing Local Area Networking Standard. Hardware Verification There are currently several approaches to deciding whether or not the hardware design meets its functional specifications. Wei Si Jiang and W.G. Wee (University of Cincinnati, oH, U.S.A.) explained that their approach was to design the system and prove formally that it meets its functional specifications. Given the behaviour of the components of a system and their interconnections, it is possible for a computer program to derive a description of the behaviour of the whole system, which can be then compared with the design specifications. They stated that this was the keypoint of their approach.
D.J. Pinto and S.K. Honda (Sacred Heart University, Fairfield, cv, U.S.A.) presented the basis for analytical research, examining the various effects of modifying or amending a particular program in both its basic structure and its degree of modularity on its ultimate run time. They began with a program which produces as output a series of tables of high card and distribution counts of 1000 bridge hands. The deal of each bridge hand is accomplished by a random number generator function and the program employs a test module to ascertain valid results. Size of a Program Module With reference to establishing a more comprehensive measure for module complexity that is easy to use, Yin-min Wei and E.N. Howell (Ohio University, Athens, OH, U.S.A.) discussed: counting the number of identifiers declared as constants, types, and variables; counting the number of operators in each active statement and considering the use of different operators as more complex than the repetition of the same operator; determining to what ex-
432
Conference Reports
tent some active statements, such as DO LOOP and conditional BRANCHES,should be assigned a larger count; because they appear to be more complex than assignment statement.
A Laser Videodisc Workstation D.V. Pigford and G.R. Baur (Western Illinois University, Macomb, [L, u.s.a.) presented the design of a programmer's development system for building aplications with such a laser videodisc workstation. They highlighted the workstation capabilities and the application tools. Structured Flowcharts D.A. Scanlan (California State University, Sacramento, CA, U.S.A.) investigated the preferences for graphical methods, such as structured flowcharts, and for verbal methods, such as pseudo-code, when learning short relatively complex algorithms. He summarized the data from six replications using 193 students and sixteen data structure classes. A preference for flowcharts was hypothesized under eight conditions and was supported by the research. Object-Oriented Design Methodologies A comparison of two object-oriented design methodologies was given by L. Rising (Indiana University-Purdue University at Fort Waye, Ia, U.S.A.). She described how at one Ada development site, the design and implementation approach was that proposed by Grady Booch, the Object-Oriented Design (OOD). She stated that a proposal has been made to compare the deliverables and the end results of the above method with that of David Parnas, the Software Cost Reduction Method (SCR).
Peer Group Software Reviews J.A. Cross (Indiana University of Pennsylvania, Indiana, Pi, U.S.A.) explained that in university education for software engineering, software reviewing is not only a valid object of study, it may also be a pedagogically useful activity. If a collection of individual comments and judgements about a software element from the members of a student review team
possess the fundamental qualities of complementary, useful insight, then it should be possible to use software reviewing as a valid learning activity for a variety of software engineering principles. He described an experimental study in Fall 1986 which compared three procedures for group software reviewing in an undergraduate class in software engineering principles.
Logic Programs One of the most appealing characteristics of logic programs is the natural and abundant non-determinism of execution. This non-determinism allows a non-conventional computer to pursue highly parallel computation. Considerable effort has been expended exploiting this potential. Wen-Kai Chung and W.B. Day (Auburn University, hE, U.S.A.) described this effort and proposed a distributed computation model based on static process allocation.
Object Labeling Problem The image object labeling problem plays an important role in the computer vision and artificial intelligence fields. Several parallel processing approaches have been proposed to obtain solutions in various stages involved in this problem. A new parallel object labeling algorithm, based on multi-processor systems with a hypercube interconnection network was described by Zhixi Fang (Wichita State University, KS, U.S.A.). The system could be either SIMt) or MIMD. The computation time complexity was discussed and compared with sequential methods and other parallel methods.
Compilers and Parallel Architectures The parallel optimizing compiler was offered as the only viable means of fully exploiting the power of parallel architectures and applying it to mainstream computing problems by R. Olmstead(San Diego State University, CA, U.S.A.).
Semantic Parallelization P. Jouvelot (Universite Paris 6, Paris, France) proposed the notion of semantic parallelization; the
Conference Reports
principle is to consider the program transformations induced by parallelization as a non-standard denotational semantics of the programming language. He showed how to apply this concept to a toy language ALL.
Parsing in a Multiprocessor Environment A.K. Insinga (Digital Equipment Corporation, Hudson, MA, U.S.A.) and K.A. Lemone (Worcester Polytechnic Institute, MA, U.S.A.) focused on parallel parsing using Parallel Piecewise-continuous LR parsing.
433
Software Engineering Nine content areas of a software engineering curriculum were presented by R. Gowda and L. Winslow (University of Dayton, OH, U.S.A.). They were: communication skills, software development and evaluation process, problem analysis and specification, system design, data engineering, software generation, system quality, project management and software engineering projects. They discussed how these areas are currently integrated into the University of Dayton curriculum.
Structural Software Testing The University Computer Center T.F. Higginbotham (Southeastern Louisiana University, LA, U.S.A.) argued that the role of the computer center is becoming that of the dinosaur, and unless the perception of them changes, they will go the same way. Further, he argued that their demize would be a disaster, but as many of them do not change, they will go - keeping at best, the appearance of being useful. Teaching Assembly Language As a part of its program of abandoning the IBM System/370 mainframe computer in favour of personal computers and UNIX workstations for undergraduate instruction, the Department of Computer and Information Science at Ohio State has decided to experiment with teaching assembly language on the Apple Macintosh, C.R. Foulk (The Ohio State University, Columbus, oH, U.S.A.) described the project so far.
Concurrent Processing The experience at the University of Florida with the use of personal computers in an undergraduate class in systems programming was described by H. Glass (University of South Florida, FL, U.S.A.). To illustrate the principles of concurrent processing, he explained that they had implemented a simple, compact, multi-tasking kernel in an exceptionally interactive programming environment.
Structural testing involves the methodical exercising of a programfaccording to selected criteria for coverage of the program flowgraph. J. Paul Myers Jr (Trinity University, San Antonio, TX, U.S.A.) described conventional and adaptive strategies.
An Operating Ethernet Network D.W. Jacobson (Iowa State University, Ames, IA, U.S.A.) explained that the object of his research was to design and implement a monitoring system for an operating Ethernet Network and that several existing monitoring techniques have been examined and contrasted. He stated that the proposed technique counters the drawbacks of existing hybrid techniques by relocating the interface between the node and monitor and establishing a master/slave relationship among the monitors. Communication Software Testing The past few years have seen a lot of activity m defining the functions provided by communication protocols and representing them in the form of layered architectures. S. Ahuja (raM Corporation, Research Triangle Park, NC, U.S.A.) discussed this and recommended that the path execution technique be applied at the abstract program part of the protocol as that will generate paths only at the protocol functional level rather than at the program control level, thereby providing a more efficient technique for error detection.
434
Conference Reports
A Local Area Network
Expert Systems Implementation1 (Session R2)
ThriftNet was created by Dr Tobin Maginnis and Dr Donald Miller in 1979 as a locally developed basic network for file transfer and establishment of a virtual terminal between two computers connected by a pair of Serial Line Units. S. Lesikar (University of Mississippi, U.S.A.) described its development.
Session Chair: R. Bogart (University of Southern Mississippi, U.S.A.)
Parallel A rchitecture Modelling
An Undergraduate Curriculum in Expert Systems Design or Knowledge Engineering M. Micco (Indiana University of Pennsylvania, PA, U.S.A.)
Traditionally two kinds of models - analytical and discrete event simulator have been used for functional modelling of multiple-microprocessor architectures. K.K. Bagchi (ccc Software Professionals Oy, Oulu, Finland), P.K. Das (Queen's University of Belfast, N. Ireland) and B.B. Bhaumik (Webel Computer Ltd, Calcutta, India) described the models and went on to explain that an incremental design methodology based on a modified access-graph technique could be the most ideal approach for such a reconfigurable simulator design. The Porting of XINU
An Intelligent Tutor for High-School Algebra N. Jurkovic (Southwest Texas State University, TX, U.S.A.) Advisor An Expert SystemJbr Student Advisement T.M. Rao, S. Colemen and C. Hollenbeck (State University Col-
lege, Brockport, yw, U.S.A.)
Expert System Implementation II (Session R3) Session Chair: R. Butler (University of North Florida, EL, U.S.A.) Natural Language Processing in a Japanese Text-to-Speech System Y. Ooyama, M. Miyazaki and S. Ikehara (NTT Communications
and Information Processing Laboratories, Yokosuka, Japan) Retirement Savings Plan Advisor: A Knowledge-Based Expert System for Tax Deferred Savings Investing L.M. Davis and J. Woodland (International Business Machines,
NC, U.S.A.)
XINU, a small but complete operating system written by Douglas Comer in the C programming language and its porting to the System 370 VM/CMS environment were described by Y.C. Pendarkar (University of Mississippi, U.S.A.).
Software Engineering II (Session R4)
Other Lectures
Database ! (Session R5)
Refereed Papers Expert System Theory (Session R1) Session Chair: B. Burd (Drew University, U.S.A.) Con/unctive Planning Problems with Constrained Goal Interactions P. C. Sheu (Purdue University, West Lafayette, IN, U.S.A.) Analysis of Heuristic Search Models 72 Sudkamp and R. Shanahan (Wright State University, Dayton,
OH, U.S.A.) A Methodology for Multiple Rule System Integration and Resolution Within a Singular Knowledge Base F.N. Kautzmann, HI (MITRE Corporation, Houston, TX, U.S.A.)
Session Chair: J. Hattemer (Southern Illinois University, Carbondale, m, U.S.A.)
Session Chair: P. Blackwell (University of Missouri-Columbia, MS,U.S.A.) Design Issues and an A rchitecture for a Heterogeneous Multidatabase System S. Pillai, R. Gudipati and L. Lilien (University of Illinois at Chi-
cago, m, U.S.A.) Incremental Conceptual Clustering From Existing Databases J.R. Rowland and G.T. Vesonder (AT&T Bell Laboratories,
Warren, NY, U.S.A.) Checkpointing Strategies for Database Systems R.S. Pamula and P.K. Srimani (Southern lllinois University-
Carbondale, IL, U.S.A.)
Conference Reports
Potpourri (Session R6) Session Chair: G. Stephen (Southern Illinois University-Edwardsville, IL, U.S.A.) A Symbolic Computation Method of Analytic Solution of the Mixed Dirichlet Neumann-Robin Problem for LaPlace's Equation H.H. Snyder (Southern Illinois University At Carbondale, IL, U.S.A.) and R.W. Wilkerson (University of Missouri-Rolla, MS, U,S.A.)
435
An Algebraic Language .for Graphical Query Formulation Using an Extended Entity-Relationship Model B, Czejdo, R. Elmasri and M. Rusinkiewicz (University of Houston, TX, U.S.A.) and D.W. Embley (Brigham Young University, UT, U.S.A.) A Pegging Method[or Decomposing Relations in Databases C. Alec Chang, M.S. Leonard, H. Brian Hwarng and Tzong-Huei Shiau (University of Missouri-Columbia, MO, U.S.A.)
Algorithms I (Session RI0) Expert Systems Applications (Session R7) Session Chair: L. Jehn (University of Dayton, OH, U.S.A.) Session Chair: G. Bailes (East Tennessee State University, TN, U.S.A.) Design ~?fa Pictorial Knowledgebase S.K. Karukonda. E.T, Lee and P.P. Chen (Louisiana State University, LA, U.S.A.) An Expert System for Bibliographic Retrieval Using Prolog C.R. Watters and M.A. Shepherd (Dalhousie University, Nova Scotia, Canada), W. Robertson and K.H. Jee (Technical University of Nova Scotia, Nova Scotia, Canada)
Heuristic Search in Networks with Modifiable Estimate A. Mahanti (Indian Institute of Management Calcutta, lndia) and K. Ray (Jadavpur University Campus, Calcutta, India) Quicksort Algorithms with an Early Exit for Sorted Subfiles R.L. Wainwright (The University of Tulsa, UK, U.S.A.)
Concurrent Programming (Session RI 1) Session Chair: O. Rechard (University of Wyoming, wY, U.S.A.)
A Response Generation MechanismJbr an Intelligent Active Assistance System R.L. Sobczak (University of South Carolina at Spartanburg, sc, U.S.A.) and M. Matthews and G. Biswas (University of South Carolina, sc, U.S.A.)
On Solving Large Maximum Concurrent Flow Problems F. Shahrokhi and D. 14/. Matula (Southern Methodist University, U.S.A.)
Algorithms !! (Session RI4) Expert System Design (Session R8) Session Chair: H. Tunnell (Missouri Southern College, MS,t~.S.A.) Session Chair: J. lsaacson (Southern Illinois University-Edwardsville, IL, U.S.A.) An Approach to Automated Knowledge Acquisition for Expert Systems: Annotated Traces - Diagnostic Hierarchies L.A. Becker and L. Immes (Worcester Polytechnic Institute, MA, U.S.A.) Commonsense Reasoning In PROLOG Wei-Si Jiang and W.G. Wee (University of Cincinnati, OH, U.S.A.) Coordinating Existing Expert Systems S.H. Hirshfield (Hamilton College, Clinton, NV, U.S.A.)
On Efficient Balanced Codes J. Guan and V.R. Lesser (University of Massachusetts, Amherst, MA, U.S.A.) A Computer Based Model of Life Transitions E.A. Hansen (Central Michigan University, Ml, U.S.A.)and M.R. Raines (Michigan State University, MI, U.S.A.) On Optimal Algorithms for Solving Bi- Valued Game Trees H.W. Martin and T.L. Seethoff (Northern Michigan University, MI, U.S.A.)
Software Engineering ! (Session RI6) Database II (Session R9) Session Chair: J. Kerlin (Scott Air Force Base, U.S.A.) Session Chair: C. Pfleeger (University of Tennessee-Knoxville, TN, U.S.A.) Sensitivity Problem in Dynamic File Organization Y. Y. Sung (University of Oklahoma, OK, U.S.A.)
An Extensible Static Analysis Tool for COBOLPrograms W. Harrison (University of Portland, OR, U.S.A.)
436
Conference Reports
Infuse: A Tool for Automatically Managing and Coordinating Source Changes in Large Systems D.E. Perry, (AT&T Bell Laboratories, Murray Hill, NJ, U.S.A.) and G.E. Kaiser (Columbia University, NJ, U.S.A.) A Multi-language Syntax-directed Editor D.J. Bagert, Jr (Northeast Louisiana University, LA, U.S.A.) and D.K. Friesen (Texas A&M University, TX, U.S.A.)
Education 1II (Session R17)
Session Chair: K. Duncan (Health Information Systems)
Abstract Sessions Expert Systems Applications I (Session A I)
Session Chair: C. Sabharwal (University of Missouri-Rolla, MO, U.S.A.) Intelligent Systems for Statistical Process Control in Steel M.A. Kamal (Central Missouri State University, MO,U.S.A.) Manhattanville College Expert Academic Advisor-Preliminary Report G. Kiernan, A. Kohun, G. Psihountas and E.N. Schwartz (Man°
hattanville College, Purchase, NV, U.S.A.) Information for Competitive Advantage - Implications for Computer Science Education R.E. Kobetich (University of Delaware, DE, U.S.A.) A Partnership-School and Computer Science Work Experiences A Career Component to the Curriculum M. W. Simms (Northeastern University, MA,U.S.A.) Brit Bits." Computer Science in British Further Education D.M. Kaminski (Western Michigan University, MI, tJ.S.A.)
Liability for Malfunction of Medical Expert Systems - Wtty an Expert System is Like a Power Saw E.S. Adams and M. W. Gray (American University, Washington, D.C., U.S.A.) ARMS: Arbitrary Robot Modelling System W.R. Gerlt (University of Missouri-Rolla, MO,U.S.A.) Project Management Expert System H. Sato, H. Matsumoto and H. Iciki (Fujitsu Ltd, Kawasaki, Ja-
Education I1 (Session RI8)
pan)
Session Chair: B,L. Jehn (Computing Consultant)
Human Factors Considerations in the Design of a Multiple Source Expert System for Military Applications G.F. Halkias and K.D. Reilly (University of Alabama at
Intelligent Computer-Based Instruction M.C. Lee (The Chinese University of Hong Kong, N. T., Hong Kong) and P.A. Samet (Computer Centre, University College,
Birmingham, AL, U.S.A.)
London, England) Potpourri 111 (Session A2) What is Computer Literacy: The Sham, The Imposter, and the Misdirected E. Cohen (California State University, Sacramento, CA, U.S.A.)
Session Chair: W.F, Lyle (Murray State University, U.S.A.)
Examining the Problems of Computer-Based Anxiety. A Systemic Approach S.R. Ruth, E.P. Gardner and B. Render (George Mason Univer-
A Fourth Order Spline Method for Singular Two-point Boundary Value Problems M.M. Chawla, R. Subramanian (Indian Institute of Technology, New Delhi, India) and H.L. Sathi (University of Southern Col-
sity, U.S.A.)
orado, co, U.S.A.)
Invited Abstract Session
An Algorithm to Minimally Decompose a Rectilinear Figure into Rectangles R. Shantaram and J. Stewart (University of Michigan-Flint, MI,
Model Based Reasoning (Session SS1)
U.S.A.)
Session Chair: A.R. DeKock (University of Missouri-Rolla, Mo, U.S.A.)
Computer Science Theory II (Session A3)
The Role o f Truth Maintenance in Model-Based Reasoning R. Fikes (lntelliCorp)
Session Chair: W.D. Smith (Mississippi State University, MS, U.S.A.) An Algebraic Approach to Multidimensional Convolution R. Ferre (Lund University, Sweden)
Conference Reports A Mixed Integer Mathematical Programming Model Solution Using Branch and Bound Techniques L.C. Wu and H.K. Edwards (University of Michigan-Flint, MI, U.S.A.) Min-Max Sort: A Simple Sorting Method N. Murthy (Pace University, Pleasantville, NV, U.S.A.) Property Computation in Grapple R.L. Sedlmeyer and M.J. Lipman (Indiana University-Purdue University at Fort Wayne, ID, U.S.A.) The Theoretical Distribution of the Goodman-Kruskal Statistic C. Nikolopoulos (Saginaw Valley State College, MI, U.S.A.) A Relational Data Model to Represent Meaning in Natural Language Sentences C.B. Balogh and M.E. Balogh (Portland State University, U.S.A.)
437
a Coherent Model: Basis of a Method of Application B. Huet (Universite Paris XIII, Paris, France) Implementing Knowledge Bases on Secondary Storage J.D. Smith (University of Tennessee, Chattanooga, TY, U.S.A.) Toward More Efficient and Flexible Expert Systems Via Database Design F.D. Anger and R.V. Rodriguez (University of Puerto Rico, Puerto Rico) and D.D. Dankel (University of Florida, FL, U.S.A.) MEND: A Self-Improving Diagnostic with Deep Knowledge M.L. Morgan and M.L. Arington (Magnavox Electronic Systems Company, Fort Wayne, IN, U.S.A.) A Journalistic Explanation Facilityfor an Expert System Shell J.R. Slag& and M.R. Wick (University of Minnesota, MN, U.S.A.)
Programming Languages (Session A6) Data Base (Session A4) Session Chair: P. Finney (Belmont College) Session Chair: R. Keller (University of Nebraska-Lincoln, NE, U.S.A.) Grammatical Relational Database Model B.K. Seyed-Abbassi and J. C. Thompson (University of Oklahoma, OK, U.S.A.) Database Prototyping and Implementation D.R. Beuerman (State University College at Oneonta, U.S.A.) Reliable Distributed Database Systems S.H. Son (University of Virginia, Charlottesville, VA, U.S.A.) Inter-Relational Information and Incompleteness in Relational Databases R.B. Abhyankar (Indiana State University, Terre Haute, ID, U.S.A.)and R.L. Kashyap (Purdue University, West Lafayette, to, U.S.A.) Comparative Analysis of dBase by Students J.E. Benjamin (Southern Illinois University-Edwardsville, IL, U.S.A.)
Modula-2 Input~Output Procedures Using Polymorphic and OpenEnded Data Type Extensions T.R. Leap (Elizabethtown College, PA, U.S.A.) The Adaptability of Ada as a Language for Expert Systems E.L. Bosworth, Jr (The University of Alabama in Huntsville, AL, U.S.A.) Simultaneous Presentation in Text Generation K.R. Lee (University of Pennsylvania, Philadelphia, PA, U.S.A.) A Functional Language Architecture that Supports Fine-Grain Parallelism J.A. Davis (Iowa State University, Ames, IA, U.S.A.) Critique o f SIMANaS a Programming Language D.J. Thuente (Indiana University-Purdue University at Fort Wayne, IN, U.S.A.) Combining Explanation Based Generalization with the Learning of Macro Operators G.A. Frascadore (University of Minnesota, MR, U.S.A.)
Space Saving Key-Lock Access Control System Trong Wu (Southern Illinois University-Edwardsville, m, U.S.A.)
Information Processing (Session A7) Expert Systems Design (Session A5)
Session Chair: C.S. Williams (Martin Marietta Energy Systems)
Session Chair: B. Barnes (Software Productivity Consortium)
In Search of Heuristics for Keyword Detection: My Source of Disconlenl A.O. Olagunju (North Carolina A&T State University, Greensboro, t~c, u.s.A.)
Logic Programming in LISPwith Controlled Search R.B. Abhyankar and N. Baharam (Indiana State University, Terre Haute, IN, U.s.a.) Integration of Problem-Solving Entities and Processing Entities in
Information Systems as Implementations R.L. Norton (Marist College, Poughkeepsie, NV, U.s.a.)
438
Conference Reports
SLAW." A Language Free Environment - Future Directions and Research M.V. Doran, S.W. Sheasby and V.J. Law (Tulane University, U.S.A.) Software Protection of Micro Computer Software T.F. Higginbotham (Southeastern Louisiana University, LA, U.S.A.) On the Identity of Decision Support Systems M.B. Ayati (California State University, LA, U.S.A.) A Probabilistic Similarity Index Between Binary' Vectors for Questionnaire Data Analysis X. Li (University of Alberta, Canada)
IGKSAn Integrated Image Processing and Graphics Environment G. Grinstein (The University of Lowell, MA,U.S.A.) Using Animated Color Graphics to Illustrate Software and Hardware Organizations T. Philip (Mississippi State University, MS,U.S.A.) Expert Systems in Lease Accounting J. Harris and G. Rupp (Pittsburg State University, PA, U.S.A.) PCDEC, An Interactive Decision Table System for Personal Computers B. Bi-Hsia Tai (Illinois State University, IL, U.S.A.) and L.H. Weiner (Texas Tech University, TX, U.S.A.)
Expert Systems (Session A 11) Graphics (Session A8) Session Chair: A. Dekhhoda (Xavier University of Louisiana, LA, U.S.A.) Computation o f Pressure Distribution on the Surface of a Vehicle C.L. Sabharwal (University of Missouri-Rolla, St. Louis, MO, U.S.A.) Representation of an Arbitrary Tubular Surface for CAD/CAM J.D. Factor (McDonnell Douglas - MOAIS,St Louis, MO, U.S.A.) and C.L. Sabharwal (University of Missouri-Rolla, St Louis, MO, U.S.A.) Syntactic Approach to Image Analysis T.K. Ho, E.T. Lee and T.T. Ho (Louisiana State University, Baton Rouge, LA, U.S.A.) Image Measurement and Recognition E.T. Lee, R.T. Wu and C.C. Huang (Louisiana State University, Baton Rouge, LA, U.S.A.) Qualitative Reasoning About Fit D.S. Green and D.C. Brown (Worcester Polytechnic Institute, MA,U.S.A.) A Geometry Package in Ada K. Rehmer and L. Rising (Magnavox Electronic Systems Company, Fort Wayne, IN, U,S.A.)
Intelligent Systems II (Session A9) Session Chair: B. Mayfield (University of Missouri-Rolla, MO, U.S.A.) Shape from Projected Light Grid N. Shrikhande (Central Michigan University, Detroit, MI, U.S.A.) A Polygon Matching Problem in Computer Vision L. W. Brinn (Wayne State University, Detroit, Mt, U.S.A.)
Session Chair: H. Glass (University of South Florida, FL, U.S.A.) An Expert Tutor in the SLA w Programming Environment M. V. Doran (Tulane University, U.S.A.) KAOS. A Knowledge Aided Operator's System jbr the V M Operator's Console K. O'Neil Lossau (Southern Illinois University at Carbondale, IL, U.S.A.) Towards Conceptualisation o f Physical Object Propositions R. Sadananda and N.U. Ahmed (Asian Institute of Technology, Bangkok, Thailand) Time Representation Based on Knowledge Partitioning M.N. Thakur and J. Dinsmore (Southern Illinois University at Carbondale, IL, U.S.A.) Knowledge and Reasoning in Graph Theory Research M.J. Lipman and R.L. Sedlmeyer (Indiana University-Purdue University at Fort Wayne, IL, U.S.A.)
Porpourri I (Session A12) Session Chair: C. Christopher (Jackson State University) A Multi-agent Planning System Kai-Hsiung Chang (Auburn University, AL, U.S.A,) Do Women Fear Computers J.M. Callan (Raymond Walters College, The University of Cincinnati, OH, U.S.A.) Expert-VSim." An Expert Simulation Environment E. V. Kortright (Western Illinois University, Macomb, IL, U.S.A,) A Fuzzy-Fower Factor Correction M.A, Manzoul and V.B. Rao (Southern Illinois University-Carbondale, IL, U.S.A.)
Conference Reports
Robots and Management Techniques R.A. Fleck, Jr (Columbus College, GA, U.S.A.) and R.A.P. Fleck
439
(The Victoria College, TX, U.S.A.)
Algorithms for Paths in the Lattice of Topologies on Finite Sets H. Levinson (Rutgers University, Newark NJ, U.S.A.)and R. Silverman (Towson State University, U.S.A.)
Lincoln Log Factory of the Future (LLFOF) P.D, Krolak (University of Lowell, MA,U.S.A.)
Surviving the Many-Person Dilemma R.P. Jones (Indiana University-Purdue University at Fort Way-
ne, IN, U.S.A.) Potpourri IV (Session AI4) Session Chair: J. Prater (University of Missouri-Rolla, MO, U.S.A.) Structured Techniques for tMtS (Integrated Maintenance Information System) Software Development - A Case Study R. Gowda (University of Dayton, OH, U.S.A.)
An Expert System for Tuning a Macroeconometric Model G.J. Stuzin (St John's University, U.S.A.) Computer Use and Grades P.K. Goeland B.R. Long (ISC Defense Systems, Inc., Lancaster,
PA, U.S.A.) Simulating Human Problem Solving Which Require Successive Decisions A. Waksman (Temple University, PA, U.S.A.)
Computer Science Theory (Session AI5) Session Chair: R. Boehning (Southwest Missouri State University, MO,U.S.A.)
Education(Session A 17) Session Chair: S.K. Dey (Eastern Illinois University, 1L, U.S.A.)
Realization of a Multi-valued Inner Product Step Processor Using CCD's. M.A. Manzoul and Jia- Yuan Han (Southern Illinois University-
Carbondale, IL, U.S.A.) A Quaternary Complex Number CCD Adder M.A. Manzoul (Southern Illinois University-Carbondale, IL,
U.S.A.) A Parallel Architecture for Rapid Image Generation and Analysis R. Nerheim (Indiana University, Bloomington, IL, U.S.A.) A Multiprogramming Stand Alone Systolic Data Flow Machine D. Tal (Ben Gurion University, Beersheva, Israel) On Rational Solution of the State Equation of a Fine Automaton R. Chaudhuri and H. Hoft (Eastern Michigan University, Ypsi-
A Demographic and Attitudinal Profile of General Education Students in a CS Survey Course P.J. WilI(SUNY College at Oswego, NY, U.S.A.) Associations of Student Characteristics to Measures of Introductory Pascal Computer Programming Achievement for Suburban Community College Students H.S. Austin (Oakland Community College, Farmington Hills,
M1,U.S.A.) Conducting a Survey of Community Computer Resources R. Leeper (Indiana University-Purdue University at Fort Way-
ne, IN, U.S.A.) An Evaluation of Presenlation Methods for CAL J.M. Fritz (University of New Brunswick, Canada)
lanti, MI, U.S.A.) Computing Multiple Modulo Summation. A New Algorithm, its VLSIDesigns and Applications C.N. Zhang. B. Shirazi and D. Y.Y. Yun (Southern Methodist
Predicting Success of a Beginning Computer Course Using Logistic Regression A.A. Chowdhury (Macon Junior College, GA, U.S.A.),C. Van Nelson, C.P. Fuelling and R.L. McCormick (Ball State University,
University, Dallas, TX, U.S.A.)
Muncie, lrq,U.S.A.)
Potpourri !I (Session AI6)
Professional Education for Secondary Computer Science K. Pearson (Southeastern Louisiana University, LA, U.S.A.)
Session Chair: S.R. Ruth (George Mason University, U.S.A.)
Conducting a Survey of Computer Technology Graduates D.K. Hockensmith (Indiana University-Purdue University at
Algorithms for Covering and Packing and Applications to CAD/ ca~" Preliminary Results D. Mount (University of Maryland, MD, U.S.A.)and R. Silverman
Fort Wayne, iN, U.s.a.)
(Towson State University, U.S.A.)
440
Conference Reports
Expert Systems Applications II (Session A18)
A Reconfigurable Software Style Expert System R.A. Schmitt (Canisius College, Buffalo, NY, U.S.A.)
Session Chair: J. Factor (McDonnell Douglas Corporation) An Expert System for Evaluation of Sports Injuries J.M. Gardner, J.H. Morrel and K.E. Lagle (Butler University, Indianapolis, IN, U.S.A.)
Networks and Architectures (Session A 19) Session Chair: T. Sager (University of Missouri-Rolla, MO,
U.S.A.) Groundwater Model Selector B. Pille and L.R. Medsker (Butler University, Indianapolis, IN,
U,S.A.)
Robustness of the Destination Tag Based Routing Algorithm ./"or the Control of Unique Path Networks A.Y. Al-Hallaq (The University of Oklahoma, Norman, oK,
An Expert System for Selecting a Development Tool S. Cole, L.R. Medsker and J.H. Morrel (Butler University, Indianapolis, IN, U.S.A.)
U.S.A.)
Programming Language Selector K,E. Lagle, J.M. Gardner, J.H. Morrel and L.R. Medsker (Butler University, Indianapolis, IN, U.S.A.)
U.S.A.)
College Guidance Counselor T. Reid and L.R. Medsker (Butler University, Indianapolis, IN,
U.S.A.)
Load Leveling for Control of Distributed Processing Systems H.W. Tyler and G. Ramakrishnan, (University of Missouri, MO,
The Proceedings of the Conference are available under the title: 1987 ACM Fifteenth Annual Computer Science Conference, February 17-19, 1987. *" + 473 pages. ISBN: 0-89791-218-7.
ConferenceReports
The Proceedings of the Conference have been edited by M.E. Nicholson and published by ASM International under the title Electronic Packaging and Corrosion in Microelectronics. 1987. v i i i + 2 9 6 pages. ISBN: 0-87170-291-6; SAN 204-7586. Price: US $ 69.00 list and $ 55.20 ASM member. Order from ASM's Customer Service Dept., Metals Park, OH 44073. Code: 6085.
ACM Computer Science Conference The 1987 ACM Fifteenth Annual Computer Science Conference was held in St Louis, Missouri from 17-19 February, 1987. The Conference was sponsored and organized by the Association for Computing Machinery. The Co-Chairs were A.R. Dekock (McDonell Douglas Research Laboratory, St Louis, U.S.A.) and J. W. Hamblen (University of Missouri-Rolla, Rolla, MO, U.S.A.). The Program Chair was G.W. Zobrist (University of Missouri-Rolla, Rolla, MO, U.S.A.). 58 refereed papers were presented in 19 sessions with one invited abstract session. In addition, 124 abstracts were presented in 19 sessions. The topics covered ranged from: Expert Systems, Software Engineering, Systems Applications, Databases, Algorithms, Education, Information Processing, Graphics, Parallel Processing, Computer Science Theory and Networks and Architectures. We present below a report on the lectures presented at the Conference.
Refereed Papers Unix Text Formatters G. Biswas, M.M. Matthews and A. Huang (University of South Carolina, Columbia, sc, U.S.A.) described an active assistance system for the text formatters on the Unix system. They explained how a complete user model was designed to determine
user proficiency in the use of text formatters. The model has two components: an overlay model and a process model. They described both and explained that using them a prompting mechanism provides the user with messages that explain how certain tasks can be done in an efficient way.
Graphics Oriented Software A workstation-based monolingual programming environment which supports design, implementation, documentation and maintenance within the software production process was described by G. Blaschek (Johannes Kepler University, Linz, Austria) and G. Pomberger (University of Zurich, Switzerland). They explained that the most important features are the graphic oriented program development, the design of the user interface and the adaptibility to various programming languages.
User Interface Generator A. Heirich (Applied Dynamic International, Ann Arbor, uI, U.S.A. and University of Michigan, Ann Arbor, ul, U.S.A.) explained that um is a mixed control model (Tanner) user interface management system for interactive command-driven programs. He described its features and the specification process and stated that UIG generates end-user documentation and is streamlined to make maintenance chores easy. Interactive Digital Simulation Laboratory Using interactive simulation preserves the experimental nature of digital-logic and computer-design laboratories. Components providing special features and design challenges extend a simulator to enhance this mode of simulation. R.J. Reid (Michigan State University, MI, U.S.A.) described these special components and explained how they provide powerful diagnostic tools, multi-element displays, and animated devices.
Conservative Codes Y. Ofek (University of Illinois at Urbana, IL, U.S.A.) explained that the family of conservative codes is a
Conference Reports
new scheme for encoding and decoding digital data for very high speed serial communication. These codes are characterized by having a constant number of transitions in each codeword and a known delimiting transition (rising or falling edge) at the end of each codeword. The conservative encoding scheme is primarily intended for binary data transmission in a single mode fiber optic network.
429
two distinct and frequently-used high-level concepts in parallel programming: condition synchronization and scheduling and, in most of the useful cases, users can simply specify the synchronization constraints imposed by these concepts in a given problem, without having to implement the constraints with some lower-level primitives.
Data Structures Improved Parallel Algorithms Parallel algorithms for ordered depth-first search and the monotone circuit value on parallel random access machines and single bus multiprocessors were presented by P. Varman and K. Doshi (Rice University, Houston, TX, U.S.A.). They explained that their technique permits them to implement to these algorithms efficiently on single bus multiprocessor architectures in time O(n2/p) for l < p < n.
Large-grained Data Flow EASY-FLOW, a data-flow language above the level of a traditional high level language was presented by H.M. Standley (The University of Toledo, OH, U.S.A.) for the purpose of adapting programs written in a conventional programming language to a parallel environment. She explained that a program written in EASY-FLOWconsists of a set of subprogram calls as units, structured by iteration, branching and distribution constructs. The sequencing of execution within these structures is dictated by the data dependencies between units.
Interprocess Synchronization and Communication A new linguistic mechanism for expressing and controlling interprocess interactions was presented by C.S. Hsieh and E.A. Unger (Kansas State University, Manhatten, KS, U.S.A.). Unlike existent designs such as monitor- or message-based mechanisms, which generally provides a set of relatively low-level primitives for users to implement various interprocess synchronization constraints, this mechanism provides a general conceptual framework to help users visualize and specify interprocess synchronization and communication from a higher-level vantage point. This conceptual framework highlights
J.C. Thompson and R. Sanati-Mehrizy (University of Oklahoma, Norman, OR, U.S.A.) presented a method for the formalization of operations on a certain class of syntactically represented linked data structures and then defined a set of functions to perform the operations. The function definitions are based on the idea of functional programming originated by John Backus. These function definitions will provide more functions for the implementation of extended functional progamming language designed for operations on data structures. Model of Software Reliability K.J. Dotson (NASA Langley Research Center, Hampton, VA, U.S,A.) established the utility of pivotal functions for assessing the reliability of software that has undergone a testing and development process. Testing and Debugging In their presentation M~,4. O'Connor (Prime Computer, Inc., Framingham, MA, U.S.A.) and K.A. Lemone (Worcester Polytechnique Institute, Worcester, MA, tJ.s.g.) described an attributed grammar for an IF THEN ELSEconstruct which can easily be extended to other control flow statements such as a WHILEDO construct. They explained that the development of robot programs is a tricky and complex process. Incremental computation aids a programmer by preventing the continuing of execution of code sequences which cannot accomplish any useful task. Also, this method may prevent damage from occurring due to a code sequence executed with critical sensory input missing. Attribute grammars proved to be an effective method to achieve this incremental compilation system.
430
Conference Reports
A Parallel Algorithm Liwu Li and T.A. Marsland (University of Alberta, Edmonton, Canada) presented a parallel algorithm for finding the maximum flow in 0-1-networks. Their design is for a mesh-connected processor array and is based on the observation that an augmenting path in a 0-l-network can be found in time proportional to the number of vertices in the given network, rather than to the number of edges. They explained that ifn is the number of vertices in a 0-1network then the time complexity of the parallel algorithm is O(n2+~'), where can be any small positive real number. A Routing Algorithm A heuristic algorithm was introduced by R.W. Wilkerson (University of Missouri-Rolla, Mo, U.S.A.) that obtains the connections for switches of arbitrary size with less use of backtracking. Furthermore the algorithm can be applied to three stage rearrangeable Clos networks. He explained that the algorithm depends heavily upon some basic theorems about systems of distinctive representatives.
Improved Sorting Algorithms Observations that improve processor utilization and decrease communication overhead for several sorting algorithms were made by A. Park and K. Balasubramanian (Princeton University, New Jersey, U.S.A.). These lead to constant factor improvements on the best previous parallel sorting bounds for both mesh-connected and linearly parallel architectures.
Petri Nets Modified M-timed Petri nets are Petri nets with exponentially distributed firing times and with generalized inhibitor arcs to interupt firing transitions. W.M. Zuberek showed (Memorial University of Newfoundland, St John's, Canada) that the behaviour of modified free-choice M-timed Petri nets can be represented by probabilistic state graphs, stationary probabilities of states can thus be obtained by standard techniques used for analysis of
continuous Markov chains. Simple models of computer systems with different scheduling strategies were used as an illustration of modelling and performance analysis,
Exploring Operating System Internals C.M. Shub (University of Colorado, at Colorado Springs, V.S.A.) described an innovative project involving the use of workstations as a laboratory tool in the required undergraduate operating systems course as well as in an elective performance evaluation course. This particular use allows students hands-on experience working with the internals of a modern operating system. It also allows students to perform experiments comparing the performance aspects of different implementations of operating system internals. Operating System Nucleus A concept of an operating system nucleus was introduced and its synthesis discussed by J. Kazimierczak (Technical University of Wroclaw, Poland). According to this concept the operating system nucleus should be realized as hardware that generates the operation code and address parts of the programs belonging to the os-nucleus. Some advantages of the presented approach to a new type of the os-nucleus were discussed.
Bringing Algorithms to Life J. Sigle (Louisiana State University, Shreveport, LA, U.S.A.) presented a systematic approach to augmenting the code of a program so that it becomes self-illustrating. When this augmented code is run it renders the algorithmic behaviour highly visible. Two versions of this approach were presented. The first, and simpler, shows the data being manipulated by the algorithm; the second additionally shows the program going through its paces. Teaching Principles A first course of two semesters in computer science that is based on mathematical principles of computer program analysis and design, rather than on
Conference Reports
apprenticeship programming was described by H.D. Mills (IBM Corporation, and University of Maryland, MD, U.S.A.), V.R. Basili and J.D. Gannon (University of Maryland, MD, U.S.A.) and R.G. Hamlet (Oregon Graduate Center, OR, U.S.A.). They explained that the course is modelled on elementary mathematics courses in both content and pedagogy.
Introductory Course A. Tellep (The Pennsylvania State University, Schuylkill Campus, PA, U.S.A.) stated that it seems obvious that if learning about computers and computer applications is here to stay, then we should recognize the fact that we need to look for better ways to instruct students or trainees in computer science. He presented an experiment in which language oriented and non-language oriented methods were analysed and presented the results concluding that the experiment was not able to show a clear cut best method and that more research should be done.
431
A Parallel Inference Engine A development environment focused on real-time embedded systems with AJ. was described by H. Lee and W. Moseley (North Texas State University, Denton, TX, U.S.A.) as a part of the deliverable system. This environment will support object-oriented design and object-oriented programming, generic knowledge packages such as frames, and a very flexible inference engine.
Theorem Proving Techniques D. Y.Y. Yun and C.N. Zhang (Southern Methodist University, Dallas, TX, U.S.A.) illustrated that the formal verification of the systolic network can be carried out using techniques developed in the theorem proving by production systems. This is achieved by partitioning the original network into two or more parts and applying the method of the symbolic induction to it. Run Time
Abstract Sessions
A Package Capturing System D.S. Mok (Western Illinois University, m, u.s.a.) described the design of a package capturing system useful in measuring and analysing the performance of networks conforming to the mEE 802.5 TokenRing Local Area Networking Standard. Hardware Verification There are currently several approaches to deciding whether or not the hardware design meets its functional specifications. Wei Si Jiang and W.G. Wee (University of Cincinnati, oH, U.S.A.) explained that their approach was to design the system and prove formally that it meets its functional specifications. Given the behaviour of the components of a system and their interconnections, it is possible for a computer program to derive a description of the behaviour of the whole system, which can be then compared with the design specifications. They stated that this was the keypoint of their approach.
D.J. Pinto and S.K. Honda (Sacred Heart University, Fairfield, cv, U.S.A.) presented the basis for analytical research, examining the various effects of modifying or amending a particular program in both its basic structure and its degree of modularity on its ultimate run time. They began with a program which produces as output a series of tables of high card and distribution counts of 1000 bridge hands. The deal of each bridge hand is accomplished by a random number generator function and the program employs a test module to ascertain valid results. Size of a Program Module With reference to establishing a more comprehensive measure for module complexity that is easy to use, Yin-min Wei and E.N. Howell (Ohio University, Athens, OH, U.S.A.) discussed: counting the number of identifiers declared as constants, types, and variables; counting the number of operators in each active statement and considering the use of different operators as more complex than the repetition of the same operator; determining to what ex-
432
Conference Reports
tent some active statements, such as DO LOOP and conditional BRANCHES,should be assigned a larger count; because they appear to be more complex than assignment statement.
A Laser Videodisc Workstation D.V. Pigford and G.R. Baur (Western Illinois University, Macomb, [L, u.s.a.) presented the design of a programmer's development system for building aplications with such a laser videodisc workstation. They highlighted the workstation capabilities and the application tools. Structured Flowcharts D.A. Scanlan (California State University, Sacramento, CA, U.S.A.) investigated the preferences for graphical methods, such as structured flowcharts, and for verbal methods, such as pseudo-code, when learning short relatively complex algorithms. He summarized the data from six replications using 193 students and sixteen data structure classes. A preference for flowcharts was hypothesized under eight conditions and was supported by the research. Object-Oriented Design Methodologies A comparison of two object-oriented design methodologies was given by L. Rising (Indiana University-Purdue University at Fort Waye, Ia, U.S.A.). She described how at one Ada development site, the design and implementation approach was that proposed by Grady Booch, the Object-Oriented Design (OOD). She stated that a proposal has been made to compare the deliverables and the end results of the above method with that of David Parnas, the Software Cost Reduction Method (SCR).
Peer Group Software Reviews J.A. Cross (Indiana University of Pennsylvania, Indiana, Pi, U.S.A.) explained that in university education for software engineering, software reviewing is not only a valid object of study, it may also be a pedagogically useful activity. If a collection of individual comments and judgements about a software element from the members of a student review team
possess the fundamental qualities of complementary, useful insight, then it should be possible to use software reviewing as a valid learning activity for a variety of software engineering principles. He described an experimental study in Fall 1986 which compared three procedures for group software reviewing in an undergraduate class in software engineering principles.
Logic Programs One of the most appealing characteristics of logic programs is the natural and abundant non-determinism of execution. This non-determinism allows a non-conventional computer to pursue highly parallel computation. Considerable effort has been expended exploiting this potential. Wen-Kai Chung and W.B. Day (Auburn University, hE, U.S.A.) described this effort and proposed a distributed computation model based on static process allocation.
Object Labeling Problem The image object labeling problem plays an important role in the computer vision and artificial intelligence fields. Several parallel processing approaches have been proposed to obtain solutions in various stages involved in this problem. A new parallel object labeling algorithm, based on multi-processor systems with a hypercube interconnection network was described by Zhixi Fang (Wichita State University, KS, U.S.A.). The system could be either SIMt) or MIMD. The computation time complexity was discussed and compared with sequential methods and other parallel methods.
Compilers and Parallel Architectures The parallel optimizing compiler was offered as the only viable means of fully exploiting the power of parallel architectures and applying it to mainstream computing problems by R. Olmstead(San Diego State University, CA, U.S.A.).
Semantic Parallelization P. Jouvelot (Universite Paris 6, Paris, France) proposed the notion of semantic parallelization; the
Conference Reports
principle is to consider the program transformations induced by parallelization as a non-standard denotational semantics of the programming language. He showed how to apply this concept to a toy language ALL.
Parsing in a Multiprocessor Environment A.K. Insinga (Digital Equipment Corporation, Hudson, MA, U.S.A.) and K.A. Lemone (Worcester Polytechnic Institute, MA, U.S.A.) focused on parallel parsing using Parallel Piecewise-continuous LR parsing.
433
Software Engineering Nine content areas of a software engineering curriculum were presented by R. Gowda and L. Winslow (University of Dayton, OH, U.S.A.). They were: communication skills, software development and evaluation process, problem analysis and specification, system design, data engineering, software generation, system quality, project management and software engineering projects. They discussed how these areas are currently integrated into the University of Dayton curriculum.
Structural Software Testing The University Computer Center T.F. Higginbotham (Southeastern Louisiana University, LA, U.S.A.) argued that the role of the computer center is becoming that of the dinosaur, and unless the perception of them changes, they will go the same way. Further, he argued that their demize would be a disaster, but as many of them do not change, they will go - keeping at best, the appearance of being useful. Teaching Assembly Language As a part of its program of abandoning the IBM System/370 mainframe computer in favour of personal computers and UNIX workstations for undergraduate instruction, the Department of Computer and Information Science at Ohio State has decided to experiment with teaching assembly language on the Apple Macintosh, C.R. Foulk (The Ohio State University, Columbus, oH, U.S.A.) described the project so far.
Concurrent Processing The experience at the University of Florida with the use of personal computers in an undergraduate class in systems programming was described by H. Glass (University of South Florida, FL, U.S.A.). To illustrate the principles of concurrent processing, he explained that they had implemented a simple, compact, multi-tasking kernel in an exceptionally interactive programming environment.
Structural testing involves the methodical exercising of a programfaccording to selected criteria for coverage of the program flowgraph. J. Paul Myers Jr (Trinity University, San Antonio, TX, U.S.A.) described conventional and adaptive strategies.
An Operating Ethernet Network D.W. Jacobson (Iowa State University, Ames, IA, U.S.A.) explained that the object of his research was to design and implement a monitoring system for an operating Ethernet Network and that several existing monitoring techniques have been examined and contrasted. He stated that the proposed technique counters the drawbacks of existing hybrid techniques by relocating the interface between the node and monitor and establishing a master/slave relationship among the monitors. Communication Software Testing The past few years have seen a lot of activity m defining the functions provided by communication protocols and representing them in the form of layered architectures. S. Ahuja (raM Corporation, Research Triangle Park, NC, U.S.A.) discussed this and recommended that the path execution technique be applied at the abstract program part of the protocol as that will generate paths only at the protocol functional level rather than at the program control level, thereby providing a more efficient technique for error detection.
434
Conference Reports
A Local Area Network
Expert Systems Implementation1 (Session R2)
ThriftNet was created by Dr Tobin Maginnis and Dr Donald Miller in 1979 as a locally developed basic network for file transfer and establishment of a virtual terminal between two computers connected by a pair of Serial Line Units. S. Lesikar (University of Mississippi, U.S.A.) described its development.
Session Chair: R. Bogart (University of Southern Mississippi, U.S.A.)
Parallel A rchitecture Modelling
An Undergraduate Curriculum in Expert Systems Design or Knowledge Engineering M. Micco (Indiana University of Pennsylvania, PA, U.S.A.)
Traditionally two kinds of models - analytical and discrete event simulator have been used for functional modelling of multiple-microprocessor architectures. K.K. Bagchi (ccc Software Professionals Oy, Oulu, Finland), P.K. Das (Queen's University of Belfast, N. Ireland) and B.B. Bhaumik (Webel Computer Ltd, Calcutta, India) described the models and went on to explain that an incremental design methodology based on a modified access-graph technique could be the most ideal approach for such a reconfigurable simulator design. The Porting of XINU
An Intelligent Tutor for High-School Algebra N. Jurkovic (Southwest Texas State University, TX, U.S.A.) Advisor An Expert SystemJbr Student Advisement T.M. Rao, S. Colemen and C. Hollenbeck (State University Col-
lege, Brockport, yw, U.S.A.)
Expert System Implementation II (Session R3) Session Chair: R. Butler (University of North Florida, EL, U.S.A.) Natural Language Processing in a Japanese Text-to-Speech System Y. Ooyama, M. Miyazaki and S. Ikehara (NTT Communications
and Information Processing Laboratories, Yokosuka, Japan) Retirement Savings Plan Advisor: A Knowledge-Based Expert System for Tax Deferred Savings Investing L.M. Davis and J. Woodland (International Business Machines,
NC, U.S.A.)
XINU, a small but complete operating system written by Douglas Comer in the C programming language and its porting to the System 370 VM/CMS environment were described by Y.C. Pendarkar (University of Mississippi, U.S.A.).
Software Engineering II (Session R4)
Other Lectures
Database ! (Session R5)
Refereed Papers Expert System Theory (Session R1) Session Chair: B. Burd (Drew University, U.S.A.) Con/unctive Planning Problems with Constrained Goal Interactions P. C. Sheu (Purdue University, West Lafayette, IN, U.S.A.) Analysis of Heuristic Search Models 72 Sudkamp and R. Shanahan (Wright State University, Dayton,
OH, U.S.A.) A Methodology for Multiple Rule System Integration and Resolution Within a Singular Knowledge Base F.N. Kautzmann, HI (MITRE Corporation, Houston, TX, U.S.A.)
Session Chair: J. Hattemer (Southern Illinois University, Carbondale, m, U.S.A.)
Session Chair: P. Blackwell (University of Missouri-Columbia, MS,U.S.A.) Design Issues and an A rchitecture for a Heterogeneous Multidatabase System S. Pillai, R. Gudipati and L. Lilien (University of Illinois at Chi-
cago, m, U.S.A.) Incremental Conceptual Clustering From Existing Databases J.R. Rowland and G.T. Vesonder (AT&T Bell Laboratories,
Warren, NY, U.S.A.) Checkpointing Strategies for Database Systems R.S. Pamula and P.K. Srimani (Southern lllinois University-
Carbondale, IL, U.S.A.)
Conference Reports
Potpourri (Session R6) Session Chair: G. Stephen (Southern Illinois University-Edwardsville, IL, U.S.A.) A Symbolic Computation Method of Analytic Solution of the Mixed Dirichlet Neumann-Robin Problem for LaPlace's Equation H.H. Snyder (Southern Illinois University At Carbondale, IL, U.S.A.) and R.W. Wilkerson (University of Missouri-Rolla, MS, U,S.A.)
435
An Algebraic Language .for Graphical Query Formulation Using an Extended Entity-Relationship Model B, Czejdo, R. Elmasri and M. Rusinkiewicz (University of Houston, TX, U.S.A.) and D.W. Embley (Brigham Young University, UT, U.S.A.) A Pegging Method[or Decomposing Relations in Databases C. Alec Chang, M.S. Leonard, H. Brian Hwarng and Tzong-Huei Shiau (University of Missouri-Columbia, MO, U.S.A.)
Algorithms I (Session RI0) Expert Systems Applications (Session R7) Session Chair: L. Jehn (University of Dayton, OH, U.S.A.) Session Chair: G. Bailes (East Tennessee State University, TN, U.S.A.) Design ~?fa Pictorial Knowledgebase S.K. Karukonda. E.T, Lee and P.P. Chen (Louisiana State University, LA, U.S.A.) An Expert System for Bibliographic Retrieval Using Prolog C.R. Watters and M.A. Shepherd (Dalhousie University, Nova Scotia, Canada), W. Robertson and K.H. Jee (Technical University of Nova Scotia, Nova Scotia, Canada)
Heuristic Search in Networks with Modifiable Estimate A. Mahanti (Indian Institute of Management Calcutta, lndia) and K. Ray (Jadavpur University Campus, Calcutta, India) Quicksort Algorithms with an Early Exit for Sorted Subfiles R.L. Wainwright (The University of Tulsa, UK, U.S.A.)
Concurrent Programming (Session RI 1) Session Chair: O. Rechard (University of Wyoming, wY, U.S.A.)
A Response Generation MechanismJbr an Intelligent Active Assistance System R.L. Sobczak (University of South Carolina at Spartanburg, sc, U.S.A.) and M. Matthews and G. Biswas (University of South Carolina, sc, U.S.A.)
On Solving Large Maximum Concurrent Flow Problems F. Shahrokhi and D. 14/. Matula (Southern Methodist University, U.S.A.)
Algorithms !! (Session RI4) Expert System Design (Session R8) Session Chair: H. Tunnell (Missouri Southern College, MS,t~.S.A.) Session Chair: J. lsaacson (Southern Illinois University-Edwardsville, IL, U.S.A.) An Approach to Automated Knowledge Acquisition for Expert Systems: Annotated Traces - Diagnostic Hierarchies L.A. Becker and L. Immes (Worcester Polytechnic Institute, MA, U.S.A.) Commonsense Reasoning In PROLOG Wei-Si Jiang and W.G. Wee (University of Cincinnati, OH, U.S.A.) Coordinating Existing Expert Systems S.H. Hirshfield (Hamilton College, Clinton, NV, U.S.A.)
On Efficient Balanced Codes J. Guan and V.R. Lesser (University of Massachusetts, Amherst, MA, U.S.A.) A Computer Based Model of Life Transitions E.A. Hansen (Central Michigan University, Ml, U.S.A.)and M.R. Raines (Michigan State University, MI, U.S.A.) On Optimal Algorithms for Solving Bi- Valued Game Trees H.W. Martin and T.L. Seethoff (Northern Michigan University, MI, U.S.A.)
Software Engineering ! (Session RI6) Database II (Session R9) Session Chair: J. Kerlin (Scott Air Force Base, U.S.A.) Session Chair: C. Pfleeger (University of Tennessee-Knoxville, TN, U.S.A.) Sensitivity Problem in Dynamic File Organization Y. Y. Sung (University of Oklahoma, OK, U.S.A.)
An Extensible Static Analysis Tool for COBOLPrograms W. Harrison (University of Portland, OR, U.S.A.)
436
Conference Reports
Infuse: A Tool for Automatically Managing and Coordinating Source Changes in Large Systems D.E. Perry, (AT&T Bell Laboratories, Murray Hill, NJ, U.S.A.) and G.E. Kaiser (Columbia University, NJ, U.S.A.) A Multi-language Syntax-directed Editor D.J. Bagert, Jr (Northeast Louisiana University, LA, U.S.A.) and D.K. Friesen (Texas A&M University, TX, U.S.A.)
Education 1II (Session R17)
Session Chair: K. Duncan (Health Information Systems)
Abstract Sessions Expert Systems Applications I (Session A I)
Session Chair: C. Sabharwal (University of Missouri-Rolla, MO, U.S.A.) Intelligent Systems for Statistical Process Control in Steel M.A. Kamal (Central Missouri State University, MO,U.S.A.) Manhattanville College Expert Academic Advisor-Preliminary Report G. Kiernan, A. Kohun, G. Psihountas and E.N. Schwartz (Man°
hattanville College, Purchase, NV, U.S.A.) Information for Competitive Advantage - Implications for Computer Science Education R.E. Kobetich (University of Delaware, DE, U.S.A.) A Partnership-School and Computer Science Work Experiences A Career Component to the Curriculum M. W. Simms (Northeastern University, MA,U.S.A.) Brit Bits." Computer Science in British Further Education D.M. Kaminski (Western Michigan University, MI, tJ.S.A.)
Liability for Malfunction of Medical Expert Systems - Wtty an Expert System is Like a Power Saw E.S. Adams and M. W. Gray (American University, Washington, D.C., U.S.A.) ARMS: Arbitrary Robot Modelling System W.R. Gerlt (University of Missouri-Rolla, MO,U.S.A.) Project Management Expert System H. Sato, H. Matsumoto and H. Iciki (Fujitsu Ltd, Kawasaki, Ja-
Education I1 (Session RI8)
pan)
Session Chair: B,L. Jehn (Computing Consultant)
Human Factors Considerations in the Design of a Multiple Source Expert System for Military Applications G.F. Halkias and K.D. Reilly (University of Alabama at
Intelligent Computer-Based Instruction M.C. Lee (The Chinese University of Hong Kong, N. T., Hong Kong) and P.A. Samet (Computer Centre, University College,
Birmingham, AL, U.S.A.)
London, England) Potpourri 111 (Session A2) What is Computer Literacy: The Sham, The Imposter, and the Misdirected E. Cohen (California State University, Sacramento, CA, U.S.A.)
Session Chair: W.F, Lyle (Murray State University, U.S.A.)
Examining the Problems of Computer-Based Anxiety. A Systemic Approach S.R. Ruth, E.P. Gardner and B. Render (George Mason Univer-
A Fourth Order Spline Method for Singular Two-point Boundary Value Problems M.M. Chawla, R. Subramanian (Indian Institute of Technology, New Delhi, India) and H.L. Sathi (University of Southern Col-
sity, U.S.A.)
orado, co, U.S.A.)
Invited Abstract Session
An Algorithm to Minimally Decompose a Rectilinear Figure into Rectangles R. Shantaram and J. Stewart (University of Michigan-Flint, MI,
Model Based Reasoning (Session SS1)
U.S.A.)
Session Chair: A.R. DeKock (University of Missouri-Rolla, Mo, U.S.A.)
Computer Science Theory II (Session A3)
The Role o f Truth Maintenance in Model-Based Reasoning R. Fikes (lntelliCorp)
Session Chair: W.D. Smith (Mississippi State University, MS, U.S.A.) An Algebraic Approach to Multidimensional Convolution R. Ferre (Lund University, Sweden)
Conference Reports A Mixed Integer Mathematical Programming Model Solution Using Branch and Bound Techniques L.C. Wu and H.K. Edwards (University of Michigan-Flint, MI, U.S.A.) Min-Max Sort: A Simple Sorting Method N. Murthy (Pace University, Pleasantville, NV, U.S.A.) Property Computation in Grapple R.L. Sedlmeyer and M.J. Lipman (Indiana University-Purdue University at Fort Wayne, ID, U.S.A.) The Theoretical Distribution of the Goodman-Kruskal Statistic C. Nikolopoulos (Saginaw Valley State College, MI, U.S.A.) A Relational Data Model to Represent Meaning in Natural Language Sentences C.B. Balogh and M.E. Balogh (Portland State University, U.S.A.)
437
a Coherent Model: Basis of a Method of Application B. Huet (Universite Paris XIII, Paris, France) Implementing Knowledge Bases on Secondary Storage J.D. Smith (University of Tennessee, Chattanooga, TY, U.S.A.) Toward More Efficient and Flexible Expert Systems Via Database Design F.D. Anger and R.V. Rodriguez (University of Puerto Rico, Puerto Rico) and D.D. Dankel (University of Florida, FL, U.S.A.) MEND: A Self-Improving Diagnostic with Deep Knowledge M.L. Morgan and M.L. Arington (Magnavox Electronic Systems Company, Fort Wayne, IN, U.S.A.) A Journalistic Explanation Facilityfor an Expert System Shell J.R. Slag& and M.R. Wick (University of Minnesota, MN, U.S.A.)
Programming Languages (Session A6) Data Base (Session A4) Session Chair: P. Finney (Belmont College) Session Chair: R. Keller (University of Nebraska-Lincoln, NE, U.S.A.) Grammatical Relational Database Model B.K. Seyed-Abbassi and J. C. Thompson (University of Oklahoma, OK, U.S.A.) Database Prototyping and Implementation D.R. Beuerman (State University College at Oneonta, U.S.A.) Reliable Distributed Database Systems S.H. Son (University of Virginia, Charlottesville, VA, U.S.A.) Inter-Relational Information and Incompleteness in Relational Databases R.B. Abhyankar (Indiana State University, Terre Haute, ID, U.S.A.)and R.L. Kashyap (Purdue University, West Lafayette, to, U.S.A.) Comparative Analysis of dBase by Students J.E. Benjamin (Southern Illinois University-Edwardsville, IL, U.S.A.)
Modula-2 Input~Output Procedures Using Polymorphic and OpenEnded Data Type Extensions T.R. Leap (Elizabethtown College, PA, U.S.A.) The Adaptability of Ada as a Language for Expert Systems E.L. Bosworth, Jr (The University of Alabama in Huntsville, AL, U.S.A.) Simultaneous Presentation in Text Generation K.R. Lee (University of Pennsylvania, Philadelphia, PA, U.S.A.) A Functional Language Architecture that Supports Fine-Grain Parallelism J.A. Davis (Iowa State University, Ames, IA, U.S.A.) Critique o f SIMANaS a Programming Language D.J. Thuente (Indiana University-Purdue University at Fort Wayne, IN, U.S.A.) Combining Explanation Based Generalization with the Learning of Macro Operators G.A. Frascadore (University of Minnesota, MR, U.S.A.)
Space Saving Key-Lock Access Control System Trong Wu (Southern Illinois University-Edwardsville, m, U.S.A.)
Information Processing (Session A7) Expert Systems Design (Session A5)
Session Chair: C.S. Williams (Martin Marietta Energy Systems)
Session Chair: B. Barnes (Software Productivity Consortium)
In Search of Heuristics for Keyword Detection: My Source of Disconlenl A.O. Olagunju (North Carolina A&T State University, Greensboro, t~c, u.s.A.)
Logic Programming in LISPwith Controlled Search R.B. Abhyankar and N. Baharam (Indiana State University, Terre Haute, IN, U.s.a.) Integration of Problem-Solving Entities and Processing Entities in
Information Systems as Implementations R.L. Norton (Marist College, Poughkeepsie, NV, U.s.a.)
438
Conference Reports
SLAW." A Language Free Environment - Future Directions and Research M.V. Doran, S.W. Sheasby and V.J. Law (Tulane University, U.S.A.) Software Protection of Micro Computer Software T.F. Higginbotham (Southeastern Louisiana University, LA, U.S.A.) On the Identity of Decision Support Systems M.B. Ayati (California State University, LA, U.S.A.) A Probabilistic Similarity Index Between Binary' Vectors for Questionnaire Data Analysis X. Li (University of Alberta, Canada)
IGKSAn Integrated Image Processing and Graphics Environment G. Grinstein (The University of Lowell, MA,U.S.A.) Using Animated Color Graphics to Illustrate Software and Hardware Organizations T. Philip (Mississippi State University, MS,U.S.A.) Expert Systems in Lease Accounting J. Harris and G. Rupp (Pittsburg State University, PA, U.S.A.) PCDEC, An Interactive Decision Table System for Personal Computers B. Bi-Hsia Tai (Illinois State University, IL, U.S.A.) and L.H. Weiner (Texas Tech University, TX, U.S.A.)
Expert Systems (Session A 11) Graphics (Session A8) Session Chair: A. Dekhhoda (Xavier University of Louisiana, LA, U.S.A.) Computation o f Pressure Distribution on the Surface of a Vehicle C.L. Sabharwal (University of Missouri-Rolla, St. Louis, MO, U.S.A.) Representation of an Arbitrary Tubular Surface for CAD/CAM J.D. Factor (McDonnell Douglas - MOAIS,St Louis, MO, U.S.A.) and C.L. Sabharwal (University of Missouri-Rolla, St Louis, MO, U.S.A.) Syntactic Approach to Image Analysis T.K. Ho, E.T. Lee and T.T. Ho (Louisiana State University, Baton Rouge, LA, U.S.A.) Image Measurement and Recognition E.T. Lee, R.T. Wu and C.C. Huang (Louisiana State University, Baton Rouge, LA, U.S.A.) Qualitative Reasoning About Fit D.S. Green and D.C. Brown (Worcester Polytechnic Institute, MA,U.S.A.) A Geometry Package in Ada K. Rehmer and L. Rising (Magnavox Electronic Systems Company, Fort Wayne, IN, U,S.A.)
Intelligent Systems II (Session A9) Session Chair: B. Mayfield (University of Missouri-Rolla, MO, U.S.A.) Shape from Projected Light Grid N. Shrikhande (Central Michigan University, Detroit, MI, U.S.A.) A Polygon Matching Problem in Computer Vision L. W. Brinn (Wayne State University, Detroit, Mt, U.S.A.)
Session Chair: H. Glass (University of South Florida, FL, U.S.A.) An Expert Tutor in the SLA w Programming Environment M. V. Doran (Tulane University, U.S.A.) KAOS. A Knowledge Aided Operator's System jbr the V M Operator's Console K. O'Neil Lossau (Southern Illinois University at Carbondale, IL, U.S.A.) Towards Conceptualisation o f Physical Object Propositions R. Sadananda and N.U. Ahmed (Asian Institute of Technology, Bangkok, Thailand) Time Representation Based on Knowledge Partitioning M.N. Thakur and J. Dinsmore (Southern Illinois University at Carbondale, IL, U.S.A.) Knowledge and Reasoning in Graph Theory Research M.J. Lipman and R.L. Sedlmeyer (Indiana University-Purdue University at Fort Wayne, IL, U.S.A.)
Porpourri I (Session A12) Session Chair: C. Christopher (Jackson State University) A Multi-agent Planning System Kai-Hsiung Chang (Auburn University, AL, U.S.A,) Do Women Fear Computers J.M. Callan (Raymond Walters College, The University of Cincinnati, OH, U.S.A.) Expert-VSim." An Expert Simulation Environment E. V. Kortright (Western Illinois University, Macomb, IL, U.S.A,) A Fuzzy-Fower Factor Correction M.A, Manzoul and V.B. Rao (Southern Illinois University-Carbondale, IL, U.S.A.)
Conference Reports
Robots and Management Techniques R.A. Fleck, Jr (Columbus College, GA, U.S.A.) and R.A.P. Fleck
439
(The Victoria College, TX, U.S.A.)
Algorithms for Paths in the Lattice of Topologies on Finite Sets H. Levinson (Rutgers University, Newark NJ, U.S.A.)and R. Silverman (Towson State University, U.S.A.)
Lincoln Log Factory of the Future (LLFOF) P.D, Krolak (University of Lowell, MA,U.S.A.)
Surviving the Many-Person Dilemma R.P. Jones (Indiana University-Purdue University at Fort Way-
ne, IN, U.S.A.) Potpourri IV (Session AI4) Session Chair: J. Prater (University of Missouri-Rolla, MO, U.S.A.) Structured Techniques for tMtS (Integrated Maintenance Information System) Software Development - A Case Study R. Gowda (University of Dayton, OH, U.S.A.)
An Expert System for Tuning a Macroeconometric Model G.J. Stuzin (St John's University, U.S.A.) Computer Use and Grades P.K. Goeland B.R. Long (ISC Defense Systems, Inc., Lancaster,
PA, U.S.A.) Simulating Human Problem Solving Which Require Successive Decisions A. Waksman (Temple University, PA, U.S.A.)
Computer Science Theory (Session AI5) Session Chair: R. Boehning (Southwest Missouri State University, MO,U.S.A.)
Education(Session A 17) Session Chair: S.K. Dey (Eastern Illinois University, 1L, U.S.A.)
Realization of a Multi-valued Inner Product Step Processor Using CCD's. M.A. Manzoul and Jia- Yuan Han (Southern Illinois University-
Carbondale, IL, U.S.A.) A Quaternary Complex Number CCD Adder M.A. Manzoul (Southern Illinois University-Carbondale, IL,
U.S.A.) A Parallel Architecture for Rapid Image Generation and Analysis R. Nerheim (Indiana University, Bloomington, IL, U.S.A.) A Multiprogramming Stand Alone Systolic Data Flow Machine D. Tal (Ben Gurion University, Beersheva, Israel) On Rational Solution of the State Equation of a Fine Automaton R. Chaudhuri and H. Hoft (Eastern Michigan University, Ypsi-
A Demographic and Attitudinal Profile of General Education Students in a CS Survey Course P.J. WilI(SUNY College at Oswego, NY, U.S.A.) Associations of Student Characteristics to Measures of Introductory Pascal Computer Programming Achievement for Suburban Community College Students H.S. Austin (Oakland Community College, Farmington Hills,
M1,U.S.A.) Conducting a Survey of Community Computer Resources R. Leeper (Indiana University-Purdue University at Fort Way-
ne, IN, U.S.A.) An Evaluation of Presenlation Methods for CAL J.M. Fritz (University of New Brunswick, Canada)
lanti, MI, U.S.A.) Computing Multiple Modulo Summation. A New Algorithm, its VLSIDesigns and Applications C.N. Zhang. B. Shirazi and D. Y.Y. Yun (Southern Methodist
Predicting Success of a Beginning Computer Course Using Logistic Regression A.A. Chowdhury (Macon Junior College, GA, U.S.A.),C. Van Nelson, C.P. Fuelling and R.L. McCormick (Ball State University,
University, Dallas, TX, U.S.A.)
Muncie, lrq,U.S.A.)
Potpourri !I (Session AI6)
Professional Education for Secondary Computer Science K. Pearson (Southeastern Louisiana University, LA, U.S.A.)
Session Chair: S.R. Ruth (George Mason University, U.S.A.)
Conducting a Survey of Computer Technology Graduates D.K. Hockensmith (Indiana University-Purdue University at
Algorithms for Covering and Packing and Applications to CAD/ ca~" Preliminary Results D. Mount (University of Maryland, MD, U.S.A.)and R. Silverman
Fort Wayne, iN, U.s.a.)
(Towson State University, U.S.A.)
440
Conference Reports
Expert Systems Applications II (Session A18)
A Reconfigurable Software Style Expert System R.A. Schmitt (Canisius College, Buffalo, NY, U.S.A.)
Session Chair: J. Factor (McDonnell Douglas Corporation) An Expert System for Evaluation of Sports Injuries J.M. Gardner, J.H. Morrel and K.E. Lagle (Butler University, Indianapolis, IN, U.S.A.)
Networks and Architectures (Session A 19) Session Chair: T. Sager (University of Missouri-Rolla, MO,
U.S.A.) Groundwater Model Selector B. Pille and L.R. Medsker (Butler University, Indianapolis, IN,
U,S.A.)
Robustness of the Destination Tag Based Routing Algorithm ./"or the Control of Unique Path Networks A.Y. Al-Hallaq (The University of Oklahoma, Norman, oK,
An Expert System for Selecting a Development Tool S. Cole, L.R. Medsker and J.H. Morrel (Butler University, Indianapolis, IN, U.S.A.)
U.S.A.)
Programming Language Selector K,E. Lagle, J.M. Gardner, J.H. Morrel and L.R. Medsker (Butler University, Indianapolis, IN, U.S.A.)
U.S.A.)
College Guidance Counselor T. Reid and L.R. Medsker (Butler University, Indianapolis, IN,
U.S.A.)
Load Leveling for Control of Distributed Processing Systems H.W. Tyler and G. Ramakrishnan, (University of Missouri, MO,
The Proceedings of the Conference are available under the title: 1987 ACM Fifteenth Annual Computer Science Conference, February 17-19, 1987. *" + 473 pages. ISBN: 0-89791-218-7.