ppxscal/embedding_network huggingface dataset:
Intelligent mobile robots in the workplace: leaving the guide behind
Authors: Ronald C. Arkin
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

Flexible manufacturing systems (FMS) that incorporate transport robots are currently dominated by the use of automatic guided vehicles. These AGVs generally require significant restructuring of the workplace in order for them to be useful. The concept of flexibility in manufacturing is somewhat compromised by this strategy. Our previous work in mobile robots, resulting in the Autonomous Robot Architecture (AuRA), is applied to the manufacturing domain. This approach, contrary to the AGV methodology, embeds significant amounts of knowledge (both environmental and behavioral) to ultimately give a mobile robot far greater latitude in interacting with its environment. This paper presents the motivation and subsequent simulation studies that demonstrate the feasibility of migrating schema-based navigation into an FMS. In particular, the creation of a docking motor schema to accomplish interaction with the workplace is detailed.
Education for Computing Professionals
Authors: David Lorge Parnas
Venue: Computer (1990)

The author examines the state of computer science education and discusses the trend whereby computer science graduates are ending up in engineering jobs. He questions whether this back door to engineering is in the best interests of the students, their employers, and society. He argues that computer science programs must return to a classical engineering approach that emphasizes fundamentals.
Implementation of a Prolog-INGRES interface
Authors: S. Ghosh, C. C. Lin, T. Sellis
Venue: ACM SIGMOD Record (1988)

This report describes a working prototype of a Prolog-INGRES interface based on external semantic query simplification. Semantic query simplification employs integrity constraints enforced in a database system for reducing the number of tuple variables and terms in a relational query. This type of query simplifier is useful in providing very high level user interfaces to existing database systems. The system employes a graph theoretic approach to simplify arbitrary conjunctive queries with inequalities. One very interesting feature of the system is to provide meaningful error messages in case of an empty query result resulting from contradiction. In addition to data, rules are stored in the database as well and are retrieved automatically if the Prolog program references them but they are not defined in the Prolog rulebase.
A finite and real-time processor for natural language
Authors: Glenn D. Blank
Venue: Communications of the ACM (1989)

People process natural language in real time and with very limited short-term memories. This article describes a computational architecture for syntactic performance that also requires fixed finite resources.
Chess on a hypercube
Authors: E. W. Felten, S. W. Otto
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

We report our progress on computer chess last described at the Second Conference on Hypercubes. Our program follows the strategy of currently successful sequential chess programs: searching of an alpha-beta pruned game tree, iterative deepening, transposition and history tables, specialized endgame evaluators, and so on. The search tree is decomposed onto the hypercube (an NCUBE) using a recursive version of the principal-variation-splitting algorithm. Roughly speaking, subtrees are searched by teams of processors in a self-scheduled manner. A crucial feature of the program is the global hashtable. Hashtables are important in the sequential case, but are even more central for a parallel chess algorithm. The table not only stores knowledge but also makes the decision at each node of the chess tree whether to stay sequential or to split up the work in parallel. In the language of Knuth and Moore, the transposition table decides whether each node of the chess tree is a type 2 or a type 3 node and acts accordingly. For this data structure the hypercube is used as a shared-memory machine. Multiple writes to the same location are resolved using a priority system which decides which entry is of more value to the program. The hashtable is implemented as &ldquo;smart&rdquo; shared memory. Search times for related subtrees vary widely (up to a factor of 100) so dynamic reconfiguration of processors is necessary to concentrate on such &ldquo;hot spots&rdquo; in the tree. A first version of the program with dynamic load balancing has recently been completed and out-performs the non-load-balancing program by a factor of three. The current speedup of the program is 101 out of a possible 256 processors. The program has played in several tournaments, facing both computers and people. Most recently it scored 2-2 in the ACM North American Computer Chess Championship.
Planning in an expert system for automated information retrieval
Authors: C. Barthes, P. Glize
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

Searching online databases requires an information retrieval strategy formalized in the EURISKO expert system. This search strategy is based on different kinds of planning: at the highest level a plan orders a linear and hierarchical planning for the request interrogation and a dynamic planning for the request modification. The recent development of the system has allowed to supply some new judgements on this approach.
Modified structured decision table and its complexity
Authors: A. K. Misra, B. D. Chaudhary
Venue: ACM SIGPLAN Notices (1989)

A modified structured decision table (MSDT) is introduced [7] which is a modification of Structured decision Table (SDT) [6] to document stages of the topdown program development. The level definition of MSDT is kept such as to maintain conformation with the top-down methodology of program construction. Further, the MSDT besides functionally converting any flowchart, exposes the construction of a program by considering one basic program construct at a time. In a Conventional Decision Tables (CDT) the conditions are assumed to be independent of execution of action and the fact that execution of an action may affect the outcome of a condition test is not considered. It is also not taken into account that there may be an action defining a variable without which condition test is not possisble. But in case of MSDT such an assumption is not made and the construction of a MSDT proceeds in such a way that these facts are always taken into account. Further in a CDT conditions can be tested in any sequence independent of their occurences, where as in a MSDT conditions are tested in a sequence totally dependent of their occurences, and there exists a definite ordering in testing of conditions in MSDT. It has been shown that MSDT is also capable of representing both structured as well as unstructured flowcharts or programs without any change in the basic notions used for the construction of MSDT. It is possible to convert unstructured flowcharts where unstructuredness is due to intersecting Ifs, Loop with multiple exit and multiple entry and Loop with mid exit, to MSDT without any change in execution sequence with c+1 levels where c is the number of basic program constructs in a program or flowchart. It is also possible to obtain CDT or decision table suggested in [4] from SDT. The two complexity measures defined in [4] for decision tables are level complexity ( and;) which is the number of values its sequencing variable assumes when infin; is not counted and cyclomatic complexity (V<sub>T</sub>) is equal to rho; minus; and; where rho; is the number of rules in a decision table. Applying these measures, complexities of different example decision tables has also been evaluated and it has been shown that complexity of a MSDT of program or flowchart is equal to the sum of complexities of the basic program constructs available in the program or flowchart. Further the level and cyclomatic complexities of these MSDT's compares very favourably with other decision tables.
Human-computer interface development: concepts and systems for its management
Authors: H. Rex Hartson, Deborah Hix
Venue: ACM Computing Surveys (CSUR) (1989)

Human-computer interface management, from a computer science viewpoint, focuses on the process of developing quality human-computer interfaces, including their representation, design, implementation, execution, evaluation, and maintenance. This survey presents important concepts of interface management: dialogue independence, structural modeling, representation, interactive tools, rapid prototyping, development methodologies, and control structures. Dialogue independence is the keystone concept upon which all the other concepts depend. It is a characteristic that separates design of the interface from design of the computational component of an application system so that modifications in either tend not to cause changes in the other. The role of a dialogue developer, whose main purpose is to create quality interfaces, is a direct result of the dialogue independence concept. Structural models of the human-computer interface serve as frameworks for understanding the elements of interfaces and for guiding the dialogue developer in their construction. Representation of the human-computer interface is accomplished by a variety of notational schemes for describing the interface. Numerous kinds of interactive tools for human-computer interface development free the dialogue developer from much of the tedium of "coding" dialogue. The early ability to observe behavior of the interface&mdash;and indeed that of the whole application system&mdash;provided by rapid prototyping increases communication among system designers, implementers, evaluators, and end-users. Methodologies for interactive system development consider interface management to be an integral part of the overall development process and give emphasis to evaluation in the development life cycle. Finally, several types of control structures govern how sequencing among dialogue and computational components is designed and executed. Numerous systems for human-computer interface management are presented t o illustrate these concepts.
Access by content of documents in an office information system
Authors: C. Jimenez Guarin
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

This paper presents the integration of retrieval functions of an Information Retrieval System, IOTA, in an Office Information Server. Besides the linear scanning of the text (using a software and a hardware filter), two access methods are proposed. The first one is based on a simple indexing of documents based on signatures. Here, texts are treated as character strings. We call this method Textual Search. The second one is based on the extention of Signature Methods for implementing the Indexing Relation of IOTA, where meaningful terms (noun groups, for example) are identified in the text together with grammatical information. We call this method of signature computation the Indexing-Term Signature. The resulting access method is called Semantic Search. We present the current experimentations using the SCHUSS hardware filter as a scanning accelerator and the results of different alternatives of implementation of these Retrieval functions.
A tutorial introduction to object-oriented simulation and SIM+ +
Authors: G. Lomow, D. Baezner
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The key benefits of object-oriented programming, object-oriented simulation, and object-oriented parallel simulation are presented. This is followed by a tutorial introduction of Sim++TM, an object-oriented parallel simulation language developed by Jade Simulations.
Rough sets and information retrieval
Authors: P. Das-Gupta
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

The theory of rough sets was introduced [PAWLAK82]. It allows us to classify objects into sets of equivalent members based on their attributes. We may then examine any combination of the same objects (or even their attributes) using the resultant classification. The theory has direct applications in the design and evaluation of classification schemes and the selection of discriminating attributes. Pawlak's papers discuss its application in the domain of medical diagnostic systems. Here we apply it to the design of information retrieval systems accessing collections of documents. Advantages offered by the theory are: the implicit inclusion of Boolean logic; term weighting; and the ability to rank retrieved documents. In the first section we describe the theory. This is derived from the work by [PAWLAK84, PAWLAK82] and includes only the most relevant aspects of the theory. In the second we apply it to information retrieval. Specifically, we design the approximation space, search strategies as well as illustrate the application of relevance feedback to improve document indexing. Following this in section three we compare the rough set formalism to the Boolean, vector and fuzzy models of information retrieval. Finally we present a small scale evaluation of rough sets which indicates its potential in information retrieval.
In search of cooperation: an historical analysis of work organization and management strategies
Authors: Joan Greenbaum
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

During the last decade, literature about work has increasingly focused on the importance of collective communication, tacit knowledge, and group activities. The idea of designing computer support for group-based work activities, which we loosely call 'cooperative work', is a useful and challenging one, for it represents a break from design approaches that focused on centralized and bureaucratic systems of communication and control. To get a clearer idea of the meaning of cooperative work, this article will look at historical patterns of work organization and management strategies. It will contrast user-centered concepts of cooperative work, with the idea of seeing cooperative work in the context of democracy in the workplace. The focus on workplace democracy has been a main theme in the Scandinavian systems tradition. The article uses the Scandinavian tradition, with its roots in a Labor Process Approach as a way to analyze the meaning of cooperation for workplace democracy and its implication for the design of computer support.
Applying process programming to the model
Authors: B. Boeh, F. Belz
Venue: Proceedings of the 4th international software process workshop on Representing and enacting the software process (1988)

The primary thesis of this position paper is that process programming is analogous to programming in an key respect not previously emphasized: that it will proceed more effectively if preceded by a set of activities to determine the requirements, architecture, and design of the process.
Animating simulations in RESQME
Authors: A. Aggarwal, K. J. Gordon, J. F. Kurose, R. F. Gordon, E. A. MacNair
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The RESearch Queueing Package Modeling Environment, RESQME, is a graphical environment for creating and modifying queueing models and for evaluating and analyzing the results. An animation facility is a natural adjunct to the graphics-oriented capabilities of this system. In such an environment, animation provides a powerful tool for effectively visualizing massive amounts of information. This makes it easier for the modeler to relate events in the model with processing in the real-world system. Animation enhances the modeler's ability to debug the model, to understand the model interactions and the impact of model changes, and to communicate the results to others. In this paper, we describe the animation facility in RESQME.
A Physical Database Design Evaluation System for CODASYL Databases
Authors: Herman Lam, Stanley Y. W. Su, Nageshwar R. Koganti
Venue: IEEE Transactions on Software Engineering (1988)

An interactive design tool for designing CODASYL databases is described. The system is composed of three main modules: a user interface, a transaction analyzer, and a core module. The user interface allows a designer to enter interactively information concerning a database design which is to be evaluated. The transaction analyzer allows the designer to specify the processing requirements in terms of typical logical transactions to be executed against the database and translates these logical transaction into physical transaction which access and manipulate the physical databases. The core module is the implementation of a set of analytical models and cost formulas developed for the manipulation of indexed sequential and hash-based files and CODASYL sets. These models and formulas account for the situation in which occurrences of multiple record types are stored in the same area. Also presented are the results of a series of experiments in which key design parameters are varied. The system is implemented in UCSD Pascal running on IBM PCs.
Camera Geometries for Image Matching in 3-D Machine Vision
Authors: N. Alvertos, D. Brzakovic, R. C. Gonzalez
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The location of a scene element can be determined from the disparity of two of its depicted entities (each in a different image). Prior to establishing disparity, however, the correspondence problem must be solved. It is shown that for the axial-motion stereo camera model the probability of determining unambiguous correspondence assignments is significantly greater than that for other stereo camera models. However, the mere geometry of the stereo camera system does not provide sufficient information for uniquely identifying correct correspondences. Therefore, additional constraints derived from justifiable assumptions about the scene domain and from the scene radiance model are utilized to reduce the number of potential matches. The measure for establishing the correct correspondence is shown to be a function of the geometrical constraints, scene constraints, and scene radiance model.
Concurrent Logic Programming as a Hardware Description Tool
Authors: Yoheved Dotan, Benjamin Arazi
Venue: IEEE Transactions on Computers (1990)

The possibility of developing hardware description languages (HDLs) based on the principles of logic programming is discussed. The specific logic programming language used to demonstrate this possibility is Flat Concurrent Prolog (FCP). It is shown explicitly how FCP naturally satisfies the commonly accepted fundamental requirements of a hardware description language. It is then demonstrated how FCP overcomes known disadvantages of the highly acclaimed VHDL. Some other parallel logic programming languages beside FCP are also presented briefly, and the possibility of using them for hardware description is discussed.
An Efficient Digital Search Algorithm by Using a Double-Array Structure
Authors: Jun-ichi Aoe
Venue: IEEE Transactions on Software Engineering (1989)

An efficient digital search algorithm that is based on an internal array structure called a double array, which combines the fast access of a matrix form with the compactness of a list form, is presented. Each arc of a digital search tree, called a DS-tree, can be computed from the double array in 0(1) time; that is to say, the worst-case time complexity for retrieving a key becomes 0(k) for the length k of that key. The double array is modified to make the size compact while maintaining fast access, and algorithms for retrieval, insertion, and deletion are presented. If the size of the double array is n+cm, where n is the number of nodes of the DS-tree, m is the number of input symbols, and c is a constant particular to each double array, then it is theoretically proved that the worst-case times of deletion and insertion are proportional to cm and cm/sup 2/, respectively, and are independent of n. Experimental results of building the double array incrementally for various sets of keys show that c has an extremely small value, ranging from 0.17 to 1.13.
A Statistical Theory of Digital Circuit Testability
Authors: S. C. Seth, V. D. Agrawal, H. Farhat
Venue: IEEE Transactions on Computers (1990)

A relation between the average fault coverage and circuit testability is developed. The statistical formulation allows computation of coverage for deterministic and random vectors. The following applications of this analysis are discussed: determination of circuit testability from fault simulation, coverage prediction from testability analysis, prediction of test length, and test generation by fault sampling.
A Systematic Design of Cellular Permutation Arrays
Authors: A. Y. Oruç, A. Thirumalai
Venue: IEEE Transactions on Computers (1989)

A parametrized design technique is presented of cellular permutation arrays based on coset decompositions of symmetric groups. A type of permutation cell referred to as a coset generator is introduced to customize the propagation delay, fan-in, fan-out, and number of edges in the target network. To aid in the design process, a cost function is derived expressing the number of edges in terms of the number of inputs and the sizes of cells. The results provide a spectrum of networks which vary with the size of the coset generator used and range from a simple bipartite graph to several cellular permutation arrays reported in the literature.
Clustering a DAG for CAD Databases
Authors: J. Banerjee, W. Kim, S.-J. Kim, J. F. Garza
Venue: IEEE Transactions on Software Engineering (1988)

A DAG (direct acyclic graph) is an important data structure which requires efficient support in CAD (computer-aided design) databases. It typically arise from the design hierarchy, which describes complex designs in terms of subdesigns. A study is made of the properties of the three types of clustered sequences of nodes for hierarchies and DAGs, and algorithms are developed for generating the clustered sequences, retrieving the descendants of a given node, and inserting new nodes into existing clustered sequences of nodes which preserve their clustering properties. The performance of the clustering sequences is compared.
Informatics at the University of Grenoble
Authors: Jean Kuntzmann
Venue: IEEE Annals of the History of Computing (1990)

This article describes the development of applied mathematics and computer sciences at the University of Grenoble, beginning around 1948. It reviews the different teaching and research orientations as well as the computing equipment, which made Grenoble one of the first French center in this field.
APL for music
Authors: S. Jordan
Venue: Conference proceedings on APL as a tool of thought (1989)

"APL For MUSIC" is a multi-faceted computer music system currently under development. Its present capabilities include computer-assisted music instruction, algorithmic composition, granular synthesis, MIDI score-editing, and music theory and analysis. All these types of software are represented to some degree in currently available commercial systems, but the advantages of APL For MUSIC over other systems include powerful integration of system modules, access to the program's internals, and the power and fun of APL.