ppxscal/embedding_network huggingface dataset:
APL as an embedded language: the ultimate application?
Authors: Jean Jacques Girardot
Venue: Proceedings of the international conference on APL '91 (1991)

This paper describes a new approach to the development of customized applications. It first discusses two problems whith APL programming: writting efficient programs, and building user interfaces. It then describes the proposed solution, that consists in writting the skeleton of the application in an efficient compiled language, using some predefined building blocks, and developing the other parts in APL.This approach is closer to integrated systems, such as spreadsheets, or data-base managers, than to traditional APL applications executed under the control of an interpreter. It differs from these integrated systems in the fact that the development cost is kept low, so that new applications, highly customized for specific end users may be built from scratch, or more exactly, from predefined building blocks.
An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline
Authors: J. F. Pekny, D. L. Miller
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

The Resource Constrained Traveling Salesman Problem (RCTSP) is introduced and an optimal algorithm for its solution is presented. The RCTSP is shown to subsume the Prize Collecting TSP and Orienteering Problem. Computational results are presented for sequential and parallel computations for problems containing up to 200 cities. The RCTSP algorithm is used to optimally schedule a processing facility involving sequence dependent transition costs and an aggregate due date on all job completion times. A penalty is incurred for each job not completed by the aggregate due date.
Another Look into the Future of Information Processing, 20 Years Later
Authors: Heinz Zemanek
Venue: IEEE Annals of the History of Computing (1990)

The Friedrich-Alexander University in Erlangen-Nuremburg, Germany, celebrated in November 1988 the 20th anniversary of the opening of its computing center. In a text prepared for that occasion, the author reviews a 20-year forecast he made in 1968 for the opening ceremony and projects it for another 20 years.
Spoken language understanding for personal computers
Authors: George M. White, David Nagel
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Automatic speech recognition technology will soon allow users to converse with their computers. This paper describes an approach to improve the human interface through speech recognition; describes how our research benefits the DARPA Spoken Language Research program; and describes some research results in the area of merging Hidden Markov Models (HMM), and Artificial Neural Nets (ANN).We apply ANN techniques as a post-process to HMM recognizers such as Sphinx. We show that treating ANNs as a post-process to partially recognized speech from an HMM pre-processor is superior to using ANNs alone or to hybrid systems applying ANNs before HMM processing. A theory explaining the advantages of applying ANNs as a post-process is presented along with preliminary results.
Householder reduction of linear equations
Authors: Per Brinch Hansen
Venue: ACM Computing Surveys (CSUR) (1992)

This tutorial discusses Householder reduction of n linear equations to a triangular form which can be solved by back substitution. The main strength of the method is its unconditional numerical stability. We explain how Householder reduction can be derived from elementary-matrix algebra. The method is illustrated by a numerical example and a Pascal procedure. We assume that the reader has a general knowledge of vector and matrix algebra but is less familiar with linear transformation of a vector space. &mdash;Author's Abstract
\Phi DM-Dialog: An Experimental Speech-to-Speech Dialog Translation System
Authors: Hiroaki Kitano
Venue: Computer (1991)

\Phi DM-Dialog, one of the first experimental speech-to-speech systems and the first to demonstrate simultaneous interpretation possibilities, is described. An overview is given of the model behind \Phi DM-Dialog. It consists of a memory network for representing various knowledge levels and markers for inferencing. The markers have rich information content. The integration of speech and natural language processing in \Phi DM-Dialog and its cost-based scheme of ambiguity resolution are discussed. Its simultaneous interpretation capability, which is made possible by an incremental parsing and generation algorithm, is examined. Prototype system results are reported.
A subexponential bound for linear programming
Authors: Jiří Matoušek, Micha Sharir, Emo Welzl
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected O(nde(d ln(n+1))1/4) time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input). The expectation is over the internal randomizations performed by the algorithm, and holds for any input. The algorithm is presented in an abstract framework, which facilitates its application to several other related problems. The algorithm has been presented in a previous work by the authors [ShW], but its analysis and the subexponential complexity bound are new.
Data path tradeoffs using MABAL
Authors: Kayhan Küçükçakar, Alice C. Parker
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper describes a set of novel tradeoff experiments using MABAL, a Module And Bus ALlocation program. MABAL uses a simple heuristic algorithm to concurrently perform functional unit allocation, register allocation, interconnect allocation and module binding, while minimising overall cost. MABAL was used to produce over 3000 RTL designs from a specification which had been previously scheduled. Tradeoffs between buses and multiplexers and between data steering logic and functional logic were investigated. The results indicate data path tradeoffs are sensitive to the characteristics of the module library used, and illustrate the difficulty of integrating module generation or logic synthesis with high-level synthesis. This tradeoff study has also highlighted MABAL's capabilities and is unlike any other reported in the literature.
The first Moscow international workshop on human-computer interaction
Authors: Allen Cypher, Jonathan Grudin, Allan Maclean, Michael Naimark, Ken-Ichi Okada, Mukesh Patel, Larry Press, Blaine Price, Carlo Tarantola, Marilyn Welles
Venue: ACM SIGCHI Bulletin (1991)

It is safe to say that no one knew what to expect when approximately 15 non-Soviet and 75 Soviet computer professionals gathered for a week-long workshop at the International Center for Scientific and Technical Information (ICSTI) in Moscow. As it unfolded, the 50 paper presentations and 25 product and prototype demos were overshadowed for many of us by the numerous opportunities for individual and group contact. In the end, all of those polled for this report (including about two-thirds of the non-Soviets) strongly favored planning another workshop and hoped to attend.
Reduced offsets for two-level multi-valued logic minimization
Authors: Abdul A. Malik, Robert K. Brayton, A. Richard Newton, Alberto L. Sangiovanni-Vincentelli
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

The approaches to two-level logic minimization can be classified into two groups: those that use tautology for expansion of cubes and those that use the offset. Tautology based schemes are generally slower and often give somewhat inferior results, because of a limited global picture of the way in which the cube can be expanded. If the offset is used, usually the expansion can be done quickly and in a more global way because it is easier to see effective directions of expansion. The problem with this approach is that there are many functions that have a reasonable size onset and don't care set but the offset is unreasonably large. It was recently shown that for the minimization of such Boolean functions, a new approach using reduced offsets, provides the same global picture and can be computed much faster. In this paper we extend reduced offsets to logic functions with multi-valued inputs.
Synchronizing the presentation of multimedia objects-ODA extensions-
Authors: Petra Hoepner
Venue: ACM SIGOIS Bulletin (1991)

The presentation of Multimedia Objects requires simultaneous and/or sequential presentation of several representation types (text, graphics, images, audio and video sequences). Therefore the presentation has to he structured and the temporal relations of different actions have to be described. The temporal relations are realized by applying synchronization mechanisms. In this paper a general synchronization model for the description of presentation sequences of Multimedia Objects is introduced. This model is applied to the Open Document Architecture (ODA) Standard and ODA Extensions are defined to integrate temporal relationships into ODA.
The traveling-salesman problem (abstract)
Authors: Susan N. Twohig, Samuel O. Aletan
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

The traveling-salesman problem is one of the classical NP-Complete problems. No current algorithms are available which can solve these problems in polynomial time, that is, the number of steps grows as a polynomial according to the size of the input. The traveling-salesman problem involves a salesman who must make a tour of a number of cities using the shortest path available. For each number of cities n, the number of paths which must be explored is n!, causing this problem to grow exponentially rather than as a polynomial. Three separate algorithms are examined. These are an iterative algorithm, a recursive algorithm, and a branch and bound algorithm. The iterative algorithm generates tours as the permutations of the first n - 1 integers (where n is the number of cities). The recursive algorithm begins with a subtour consisting of the starting city and uses a recursive subroutine to build all tours. The branch and bound algorithm builds a tree which represents tours. Each node of the tree has an associated bound, and when the bound of a node becomes larger than the cost of the best tour found so far, that node is no longer eligible for exploration. This pruning process allows this algorithm to delay exponential growth longer than the other two algorithms do. Two algorithms which develop near optimal solutions are also examined.
Innovative teaching materials and methods for systems analysis and design
Authors: Lorne Olfman, Robert P. Bostrom
Venue: ACM SIGMIS Database (1992)

This article describes materials and methods for a course in systems analysis and design. While the article is prescriptive rather than empirical, it offers new directions for instructors who wish to adopt an action research approach to syllabus development. Information systems developers perform two roles in the process of managing a development project: the developer is both analyst/designer and facilitator. Traditional textbooks for systems analysis and design courses emphasize the analyst/designer role, but say little about the facilitator role. We have developed course materials and teaching methods to address facilitation skills: outcome thinking, group process, and communications. We also emphasize some analyst/designer skills that are not addressed in the traditional texts, such as creative thinking. socio-technical systems, and CASE tool concepts. Our teaching methods include the personal journal, which allows students to tailor classroom materials to their own needs, as well as other methods for providing experiential learning of course materials.
Progress measures for complementation of &ohgr;-automata with applications to temporal logic
Authors: Nils Klarlund
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A new approach to complementing omega -automata, which are finite-state automata defining languages of infinite words, is given. Instead of using usual combinatorial or algebraic properties of transition relations, it is shown that a graph-theoretic approach based on the notion of progress measures is a potent tool for complementing omega -automata. Progress measures are applied to the classical problem of complementing Buchi automata, and a simple method is obtained. The technique applies to Streett automata, for which an optimal complementation method is also obtained. As a consequence, it is seen that the powerful temporal logic ETLs is much more tractable than previously thought.
A constructive implementation of the Cartan-Kähler theory of exterior differential systems
Authors: David Hartley, Robin W. Tucker
Venue: Journal of Symbolic Computation (1991)

An efficient algorithm for the construction of a regular chain of involutive integral elements for a general exterior differential system is presented. It is based upon the existence theorems of the Cartan-Kahler theory, and may be used to analyse partial differential equations by formulating them as exterior differential systems.
Data path allocation based on bipartite weighted matching
Authors: Chu-Yi Huang, Yen-Shen Chen, Youn-Long Lin, Yu-Chin Hsu
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We propose a graph-theoretic approach for the data path allocation problem. We decompose the problem into three subproblems: (1) register allocation, (2) operation assignment, and (3) connection allocation. The first two subproblems are modeled as two bipartite weighted matching problems and solved using the Hungarian Method [Pap82]. The third subproblem is solved using a greedy method. While previous researches suffer controversy over which one of subproblems (1) and (2) should be done first, we show that, by taking the other into consideration while performing one, equally satisfactory results can be obtained. We have implemented two programs, LYRA and ARYL, to solve the subproblems in different orders, namely, &ldquo;(1), (2), then (3)&rdquo; and &ldquo;(2), (1), then (3)&rdquo;, respectively. The matching paradigm allows us to take a more global approach toward the problem than previous researches do. For register allocation, our approach is the first one to guarantee minimal usage of registers while being able to take the interconnection cost into account. For all the benchmarks from the literature, both LYRA and ARYL produced designs as good as, if not better than, those by others in very short time. This research has demonstrated that the bipartite weighted matching algorithm is indeed a very good solution for the data path allocation problem.
East meets West, North, and South
Authors: Pat Billingsley
Venue: ACM SIGCHI Bulletin (1992)

The paragraphs below summarize the recent activities of various national and international committees involved in UI standards development, as of mid-May 1992. Most of the information was gathered at ISO and ANSI standards meetings held in Monterey just prior to CHI'92. Additional updates were provided by Ken Holdaway of IBM and Beth Marshburn of AT T Bell Labs. As always, I encourage anyone with information about other relevant standards activities to contact me directly so I can include that material in a future column.
ISETL: a language for teaching discrete mathematics (abstract)
Authors: Gary Marc Levin
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

ISETL is an interactive implementation and extension of SETL1, a programming language built around mathematical notation and objects, primarily sets and functions. Just as an introductory chemistry course uses a laboratory to provide an arena for experimenting, an introductory mathematics class could use ISETL to provide a workplace for its students. When children first begin their study of mathematics &mdash; counting and simple arithmetic &mdash; it is easy to provide them with concrete examples suitable for manipulation: coins, sheep, apples and oranges. As the level of mathematics increases, however, it becomes harder to provide direct experience. ISETL implements some of the common objects used in mathematics, and so provides a place for students to experiment with immediate feedback. It is important to notice that, unlike the experience gained from most general purpose programming languages, ISETL provides transferrable knowledge, because it uses standard mathematical notations and ideas. E.g., the primes less than 50: {p: p in [2..50] | forall i in [2..p-1] | p mod i/=0} By providing functions as first class objects, both as sets of ordered pairs and as computational objects, ISETL permits students to manipulate functions, providing examples of higher order mathematical structures (such as groups of functions). Aside from its original application as a laboratory for experimentation in Discrete Mathematics, ISETL has been used for teaching calculus, introductory programming, programming languages, and abstract algebra. The first class functions provide support for many of the paradigms of programming in a single familiar context. ISETL is in use in more than 100 schools. ISETL is available for UNIX, VMS, MSDOS, and the Macintosh. Write to the author for more information.
Recognition of Arabic Characters
Authors: H. Al-Yousefi, S. S. Udpa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A statistical approach for the recognition of Arabic characters is introduced. As a first step, the character is segmented into primary and secondary parts (dots and zigzags). The secondary parts of the character are then isolated and identified separately, thereby reducing the number of classes from 28 to 18. The moments of the horizontal and vertical projections of the remaining primary characters are then calculated and normalized with respect to the zero-order moment. Simple measures of the shape are obtained from the normalized moments. A 9-D feature vector is obtained for each character. Classification is accomplished using quadratic discriminant functions. The approach was evaluated using isolated, handwritten, and printed characters from a database established for this purpose. The results indicate that the technique offers better classification rates in comparison with existing methods.
Development and preliminary evaluation of the MIT ATIS system
Authors: Stephanie Seneff, James Glass, David Goddeau, David Goodine, Lynette Hirschman, Hong Leung, Michael Phillips, Joseph Polifroni, Victor Zue
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper represents a status report on the MIT ATIS system. The most significant new achievement is that we now have a speech-input mode. It is based on the MIT SUMMIT system using context independent phone models, and includes a word-pair grammar with perplexity 92 (on the June-90 test set). In addition, we have completely redesigned the back-end component, in order to emphasize portability and extensibility. The parser now produces an intermediate semantic frame representation, which serves as the focal point for all back-end operations, such as history management, text generation, and SQL query generation. Most of those aspects of the system that are tied to a particular domain are now entered through a set of tables associated with a small artificial language for decoding them. We have also improved the display of the database table, making it considerably easier for a subject to comprehend the information given. We report here on the results of the official DARPA February-91 evaluation, as well as on results of an evaluation on data collected at MIT, for both speech input and text input.
How to manage large APL projects: a user interface management system approach
Authors: Richard R. N. Eller
Venue: ACM SIGAPL APL Quote Quad (1991)

There is a common trend towards Graphical User Interfaces (GUI). Writing applications for such an environment puts new demands on designing software and managing its development. The applications software needs to be event based. It needs to have a special uniform "feel" and provide flexibility for both the novice and experienced user.Many of the new GUI oriented needs can be handled by traditional User Interface Toolkits or Libraries. However, using these will not solve the complexity of a good user interface design. Another approach is to choose or design a User Interface Management System (UIMS). UIMS is responsible for all user interface action and only when necessary will call actual application code for performing e.g. a calculation or data base operation.The paper describes the architecture of a large real-life UIMS based APL application project. Since a UIMS approach differs from traditional hierarchical programming, many of these differences are described in detail. Particular emphasis has been put on how this approach has affected project management and the various tasks of a software project. The paper ends by presenting some thoughts about future APL Application Development Systems.
Atomic broadcast in one phase
Authors: Pascale Minet, Emmanuelle Anceaume
Venue: ACM SIGOPS Operating Systems Review (1991)

An atomic broadcast protocol should meet the three properties of unanimity, order and termination. The protocol presented here assumes weak fail-silent Network Attachment Controllers (NACs) and a broadcast channel subject to omission failures. In a failure-free environment it consists of a single phase. The response time achieved is almost the same as for a simple broadcast. In case of receivers failures, the number of phases depends on failure occurrences. In case of a broadcaster failure all the correct receivers detect the failure and all the receivers ignore the broadcast. This protocol ensures that each correct NACs has the same view of the correct NACs' list.
Data/knowledge packets as a means of supporting semantic heterogeneity in multidatabase systems
Authors: Doyle Weishar, Larry Kerschberg
Venue: ACM SIGMOD Record (1991)

Semantic heterogeneiry in heterogeneous autonomous databases poses problems in instance matches, units conversion (value interpretation), contextual and structural mismatches, etc. In this work we examine some of the research issues in semantic heterogeniety and propose a novel architecture for resolving such problems. The approach involves the use of Artifical Intelligence tools and techniques to construct &ldquo;domain models,&rdquo; that is data and knowledge representations of the constituent databases and an overall domain model of the semantic interactions among the databases. These domain models are represented as knowledge sources (KSs) in a blackboard architecture. This architecture lends itself to an opportunistic approach to query processing and goal-directed problem solving. We introduce the notion of Data/Knowledge Packets as a means of supporting both operational and structural semantic heterogeneity.
Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector
Authors: Javier Campos, Giovanni Chiola, Manuel Silva
Venue: IEEE Transactions on Software Engineering (1991)

Ergodicity and throughput bound characterization are addressed for a subclass of timed and stochastic Petri nets, interleaving qualitative and quantitative theories. The nets considered represent an extension of the well-known subclass of marked graphs, defined as having a unique consistent firing count vector, independently of the stochastic interpretation of the net model. In particular, persistent and mono-T-semiflow net subclasses are considered. Upper and lower throughput bounds are computed using linear programming problems defined on the incidence matrix of the underlying net. The bounds proposed depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). From a different perspective, the considered subclasses of synchronized queuing networks; thus, the proposed bounds can be applied to these networks.