ppxscal/embedding_network huggingface dataset:
Automatic program generation using sequent calculus
Authors: Talal Maghrabi, Forouzan Golshani
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

Program development can be made amenable to formal methods by using a logical framework. A logic specification, whose operational semantics is based on proof theory, provides an abstract and &ldquo;implementation independent&rdquo; definition of the problem, the data domains and the associated operators. Unlike many of the current efforts in this area that use resolution, our approach is based on natural deduction, more specifically, sequent calculus. Following the methodology proposed by Manna and Waldinger, we propose the synthesis tableau technique by which we construct a proof for the well formed formula representing the specification. The desired program is obtained as a side effect of the proof process.
Teaching concurrent programming with Pascal-FC
Authors: G. L. Davies
Venue: ACM SIGCSE Bulletin (1990)

This paper describes a dialect of Pascal which has been specially developed to provide students with practical experience in courses on concurrent programming. It describes the facilities of the language, and discusses the importance of the scheduler which is provided in language implementations used for teaching.
Understanding spontaneous speech
Authors: Wayne Ward
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

When speech understanding systems are used in real applications, they will have to deal with phenomena peculiar to spontaneous speech. People use language differently when they speak than when they write. Spoken language contains many interjections, filled pauses, etc. Speakers often don't use well-formed sentences. They speak in phrases, have restarts, etc. Systems designed for written or read text will encounter serious difficulties processing such input. This paper outlines our strategy for dealing with spontaneous spoken input in a speech recognition system.
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
Authors: Dror Lapidot, Adi Shamir
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A major open problem in the theory of multiprover protocols is to characterize the languages which can be accepted by fully parallelized protocols which achieve an exponentially low probability of cheating in a single round. The problem was motivated by the observation that the probability of cheating the n parallel executions of a multiprover protocol can be exponentially higher than the probability of cheating in n sequential executions of the same protocol. The problem is solved by proving that any language in NEXP-time has a fully parallelized multiprover protocol. By combining this result with a fully parallelized version of the protocol of M. Ben-Or et al. (ACM Symp. on Theory of Computing, 1988), a one-round perfect zero-knowledge protocol (under no cryptographic assumptions) can be obtained for every NEXPTIME language.
Checking the correctness of memories
Authors: Manuel Blum, Will Evans, Peter Gemmell, Sampath Kannan, Moni Naor
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

The notion of program checking is extended to include programs that alter their environment, in particular, programs that store and retrieve data from memory. The model considered allows the checker a small amount of reliable memory. The checker is presented with a sequence of requests (online) to a data structure which must reside in a large but unreliable memory. The data structure is viewed as being controlled by an adversary. The checker is to perform each operation in the input sequence using its reliable memory and the unreliable data structure so that any error in the operation of the structure will be detected by the checker with high probability. Checkers for various data structures are presented. Lower bounds of log n on the amount of reliable memory needed by these checkers, where n is the size of the structure, are proved.
Mapping Computer-Vision-Related Tasks onto Reconfigurable Parallel-Processing Systems
Authors: Howard Jay Siegel, James B. Armstrong, Daniel W. Watson
Venue: Computer (1992)

A tutorial overview of how selected computer-vision-related algorithms can be mapped onto reconfigurable parallel-processing systems is presented. The reconfigurable parallel-processing system assumed for the discussions is a multiprocessor system capable of mixed-mode parallelism; that is, it can operate in either the SIMD or MIMD modes of parallelism and can dynamically switch between modes at instruction-level granularity with generally negligible overhead. In addition, it can be partitioned into independent or communicating submachines, each having the same characteristics as the original machine. Furthermore, this reconfigurable system model uses a flexible multistage cube interconnection network, which allows the connection patterns among the processors to be varied. It is demonstrated how reconfigurability can be used by reviewing and examining five computer-vision-related algorithms, each one emphasizing a different aspect of reconfigurability.
Multiple uses of scenarios: a reply to Campbell
Authors: Richard M. Young, Philip J. Barnard
Venue: ACM SIGCHI Bulletin (1992)

Robert Campbell performs a valuable service to the HCI community in pointing out the several different uses of "scenarios". While the diversity certainly exists, we believe he has mis-ananlyzed it and missed an important commonality. Although he begins his summary by claiming that "scenario" has four major meanings, the examples in his article in fact demonstrate a number of different purposes and applications of scenarios-- which is surely not something to complain about -- drawn from sources which exhibit a significant commonality of meaning.
Computing with group homomorphisms
Authors: Charles R. Leedham-Green, Cheryl E. Praeger, Leonard H. Soicher
Venue: Journal of Symbolic Computation (1991)

Let G= and H be finite groups and let o : X -> H be a map from the generating set X of G into H. We describe a simple approach for deciding whether or not o determines a group homomorphism from G to H, and if it does, for computing the kernel of o. If G and H are permutation groups the algorithm is a simple application of standard algorithms for bases and strong generating sets. If G and H are soluble groups given in the usual way by PAG-systems and corresponding power conjugate presentations then the algorithm is a simple application of the non-commutative Gauss algorithm for constructing a subgroup of a soluble group. Further, a probabilistic algorithm is given for finding the kernel and image of o when each of G and H is given as a permutation group or a soluble group, |G| is known, and o is known to determine a homomorphism.
A Unified Framework for Simulating Markovian Models of Highly Dependable Systems
Authors: Ambuj Goyal, Perwez Shahabuddin, Philip Heidelberger, Victor F. Nicola, Peter W. Glynn
Venue: IEEE Transactions on Computers (1992)

The authors present a unified framework for simulating Markovian models of highly dependable systems. It is shown that a variance reduction technique called importance sampling can be used to speed up the simulation by many orders of magnitude over standard simulation. This technique can be combined very effectively with regenerative simulation to estimate measures such as steady-state availability and mean time to failure. Moveover, it can be combined with conditional Monte Carlo methods to quickly estimate transient measures such as reliability, expected interval availability, and the distribution of interval availability. The authors show the effectiveness of these methods by using them to simulate large dependability models. They discuss how these methods can be implemented in a software package to compute both transient and steady-state measures simultaneously from the same sample run.
The MIT SUMMIT Speech Recognition system: a progress report
Authors: Victor Zue, James Glass, Michael Phillips, Stephanie Seneff
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

Recently, we initiated a project to develop a phonetically-based spoken language understanding system called SUMMIT. In contrast to many of the past efforts that make use of heuristic rules whose development requires intense knowledge engineering, our approach attempts to express the speech knowledge within a formal framework using well-defined mathematical tools. In our system, features and decision strategies are discovered and trained automatically, using a large body of speech data. This paper describes the system, and documents its current performance.
An academic relational algebra database management system
Authors: Paula M. Logan, Clifford W. Hale, John M. Atkins
Venue: ACM SIGCSE Bulletin (1990)

This paper describes a relational algebra database management system written by two graduate students at West Virginia University. The system is designed to be used in an undergraduate database class to demonstrate queries posed in the relational algebra and to introduce the notions of integral constraints, referential integrity and functional dependencies. The system runs in either an interactive mode or interfaces with either Pascal or PL/1.
Theory and Design of t-Error Correcting/d-Error Detecting (d<t) and All Unidirectional Error Detecting Codes
Authors: Dimitris Nikolos
Venue: IEEE Transactions on Computers (1991)

The fundamental theory of t-error correcting/d-error-detecting (d
Porting PUNDIT to the resource management domain
Authors: Lynette Hirschman, Francois-Michel Lang, John Dowding, Carl Weir
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

This paper describes our experiences porting the PUNDIT natural language processing system to the Resource Management domain. PUNDIT has previously been applied to a range of messages (see the paper <i>Analyzing Explicitly Structured Discourse in a Limited Domain: Trouble and Failure Reports</i> by C. Ball (appearing in this volume), and also [Hirschman1989]. However, it had not not been tested on any significant corpus of queries, such as that represented by the Resource Management corpus. Our goal was to assess PUNDIT's portability, and to determine its coverage of syntax over this domain. Time constraints precluded testing of the semantic component, but we plan to report on this at subsequent meetings. We performed this port with the intention of coupling PUNDIT to the MIT SUMMIT speech recognition system. This work is described in another paper in this volume, <i>Reducing Search by Partitioning the Word Network</i>, by J. Dowding.
Mapping GUIs to auditory interfaces
Authors: Elizabeth D. Mynatt, W. Keith Edwards
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

This paper describes work to provide mappings between X-based graphical interfaces and auditory interfaces. In our system, dubbed Mercator, this mapping is transparent to applications. The primary motivation for this work is to provide accessibility to graphical applications for users who are blind or visually impaired. We describe the design of an auditory interface which simulates many of the features of graphical interfaces. We then describe the architecture we have built to model and transform graphical interfaces. Finally, we conclude with some indications of future research for improving our translation mechanisms and for creating an auditory &ldquo;desktop&rdquo; environment.
A nonce-based protocol for multiple authentications
Authors: A. Kehne, J. Schönwälder, H. Langendörfer
Venue: ACM SIGOPS Operating Systems Review (1992)

The Kerberos authentication service, a part of MIT's Project Athena, is based on the Needham and Schroeder protocol. Timestamps depending on reliable synchronized clocks are used to guarantee the freshness of messages. As an improvement, we present a nonce-based protocol offering the same features as Kerberos. We generate a ticket in an initial message exchange which includes a generalized timestamp. Checking this generalized timestamp is left to the principal who created it. Consequently we do not need synchronized clocks. Our protocol has the property of using a minimal number of messages to establish an authenticated session key.
Development trends in methods for efficiency evaluation of ES-based computer systems
Authors: S. M. Porotskiy, A. E. Fateev
Venue: ACM SIGMETRICS Performance Evaluation Review (1992)

This paper concerns some methods for efficiency evaluation of IBM-compatible universal ES computers, as being improved during their short life-time. The multi-level structure of computer efficiency is described, and the factors influencing its quantification are pointed out. The measured results are given on the capacity of individual computers with different loads.
A multi-disciplinary approach for digital systems design curricula
Authors: William T. Neumann, Marvin C. Woodfill
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

Historically, Digital Systems Design curricula have focused principally on the hardware design aspects of systems development. At Arizona State University, we have expanded our Digital Systems Design program to include aspects of computer architecture, assembly language programming, and operating systems fundamentals, as well. We feel that this larger focus provides the students with a comprehensive understanding of the overall system development process. In this paper, we discuss our philosophy and examine a course sequence that incorporates this multi-disciplinary approach.
Integrating Diverse Information Repositories: A Distributed Hypertext Approach
Authors: John Noll, Walt Scacchi
Venue: Computer (1991)

The authors address key problems of support for multiple, heterogeneous repositories, each under separate and autonomous administration with a variety of incompatible interfaces; diverse, unconventional data types; and different ways of viewing relations among the same information items. They present a solution to these problems that is radically different from existing systems. It is based on their distributed hypertext (DHT) architecture, which combines transparent access to autonomous, heterogeneous information repositories and a powerful, flexible organization technique. This approach requires no change to the structure or content of participating repositories.
Can computer programming improve problem-solving ability?
Authors: Jho-Ju Tu, John R. Johnson
Venue: ACM SIGCSE Bulletin (1990)

This paper reports the results of a study of the relationship between computer programming skills and problem-solving abilities. Students in two introductory programming courses (FORTRAN and PASCAL) of a large university served as the subjects for this study. Students' problem-solving abilities were assessed during the first month that each computer programming course commenced and again during the final month of the course. Analysis of pretest and posttest results indicated that students who had successfully completed all computer programming course requirements experienced significant improvement in their overall problem skills. Results also suggested that students who had successfully completed computer programming course requirements experienced significant improvement on the logical reasoning section of the problem-solving assessment.
A comparison of module constructs in programming languages
Authors: Frank W. Calliss
Venue: ACM SIGPLAN Notices (1991)

Modules are constructs that help implement the principle of information hiding. Some languages provide general purpose modules, while others provide modules that are more specialised. This paper compares the modules that are provided by some languages.
Telecommunications and computer science: two merging paradigms
Authors: Warren T. Jones, F. Mike McGuirt
Venue: ACM SIGCSE Bulletin (1991)

The purpose of this paper is to call attention to trends and curricula in the two areas of telecommunications and computer science. Telecommunications is in its infancy as an interdisciplinary academic subject which spans primarily the disciplines of electrical engineering, computer science and management. There are few telecommunications degree programs or identifiable specializations. Networks in the telecommunications industry are rapidly becoming very large distributed computing systems.In the computer industry, as well as the computer science research community, the dominant model for general purpose computing is also becoming distributed computing. However, in contrast to telecommunications, computer science is beginning to mature as an academic discipline also having interdisciplinary roots. Since many of the technologies which are critical to the successful development of the intelligent multimedia network of the future lie within the domain of computer science, there are opportunities for computer science to make a major impact on the emerging telecommunications field.
Using Fuzzy Sets to Diagnose Coronary Artery Stenosis
Authors: Krzysztof J. Cios, Inho Shin, Lucy S. Goodenday
Venue: Computer (1991)

The use of fuzzy sets to represent perfusion defects and to generate expert results to help in diagnosis is reported. Retrospective data collected from 91 patients who underwent both stress thallium-201 myocardial scintigraphy and coronary arteriography were used. Of the total, 64 scans were chosen at random for training, and the remaining 27 scans were used for testing data. It was found that 17 rules generated by fuzzy set theory performed as well as 68 rules specified by cardiologists in diagnosing coronary artery stenosis.
Communicating control knowledge to a deductive database system
Authors: Helmut Schmidt
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

In relational or deductive database systems the user can hardly (or only in a rather implicit way) change the deduction process used for answering a query. For example, the user cannot specify that&ndash;for a given query&ndash;some rules of a deductive database are irrelevant for computing the answer of that query and hence should be disregarded, or that&ndash;while computing the answer of a query&ndash;some tuples should be preferred over other tuples. In [Sch91] we have introduced a deductive database system which offers the user a framework for specifying such control knowledge. Thereby the user can adapt the deduction process of our deductive database system to the application at hand. In this paper we will briefly recapture the architecture of this system. Then we will present two examples, and we will show how these two examples can be solved more efficiently with our system.
Lectureroom demonstration of serial data communications
Authors: D. K. Walker, H. Chahryar, J. Chaudri, A. Lodgher, E. Majdalani, David S. Tucker
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

Some important concepts in serial data communications may be demonstrated &ldquo;live&rdquo; in the lectureroom using a PC equipped with videoprojector, analog input board, and pickup circuitry. The apparatus displays the wave-shape of the serial signal, along with characters sent or received. It has proven useful for &ldquo;seeing&rdquo; the signal and for exploring hardware/software setttings, cable type, cable length and other characteristics of a serial interface./
Fast search in main memory databases
Authors: Anastasia Analyti, Sakti Pramanik
Venue: ACM SIGMOD Record (1992)

The objective of this paper is to develop and analyze high performance hash based search methods for main memory databases. We define optimal search in main memory databases as the search that requires at most one key comparison to locate a record. Existing hashing techniques become impractical when they are adapted to yield optimal search in main memory databases because of their large directory size. Multi-directory hashing techniques can provide significantly improved directory utilization over single-directory hashing techniques. A multi-directory hashing scheme, called fast search multi-directory hashing, and its generalization, called controlled search multi-directory hashing, are presented. Both methods achieve linearly increasing expected directory size with the number of records. Their performance is compared to existing alternatives.
An introduction to object-oriented programming through Turbo Pascal
Authors: Chip Dixon
Venue: ACM SIGCSE Bulletin (1991)

This paper presents three introductory concepts of object-oriented programming: encapsulation, inheritance and polymorphism. The specific implementation for these concepts and other terms presented, is the language Turbo Pascal (5.5 or later). The examples illustrated have been successfully used as the first part of an introductory object-oriented programming class.
Conflict-Free Vector Access Using a Dynamic Storage Scheme
Authors: David T. Harper,  III, Darel A. Linebarger
Venue: IEEE Transactions on Computers (1991)

An approach whereby conflict-free access of any constant stride can be made by selecting a storage scheme for each vector based on the accessing patterns used with that vector is considered. By factoring the stride into two components, one a power of 2 and the other relatively prime to 2, a storage scheme that allows conflict-free access to the vector using the specified stride can be synthesized. All such schemes are based on a variation of the row rotation mechanism proposed by P. Budnik and D. Kuck. Each storage scheme is based on two parameters, one describing the type of rotation to perform and the other describing the amount of memory to be rotated as a single block. The performance of the memory under access strides other than the stride used to specify the storage scheme is also considered. Modeling these other strides represents a vector being accessed with multiple strides as well as situations when the stride cannot be determined prior to initializing the vector. Simulation results show that if a single buffer is added to each memory port, then the average performance of the dynamic scheme surpasses that of the interleaved scheme for arbitrary stride accesses.
Performability Analysis of Distributed Real-Time Systems
Authors: S. M. Rezaul Islam, Hany H. Ammar
Venue: IEEE Transactions on Computers (1991)

An algorithm and a methodology for the performability analysis of repairable distributed real-time systems are presented. The planning cycle of a real-time distributed system, which normally consists of several task invocations, is first identified. The performability distribution at the end of the planning cycle is determined by repeated convolutions of performability densities between task invocations. These convolution operations are efficiently carried out using the operational properties of Laguerre coefficients. The algorithm numerically determines both moments and distribution of performability in O(N/sub max//sup 3/), where N/sub max/ is the largest size of the state space between any task invocations. To illustrate the overall methodology, a simplified example of a radar system is analyzed, and the various performability measures are obtained using the algorithm.
Notes from COMDEX
Authors: Larry Press
Venue: Communications of the ACM (1991)

Finally, new and interesting ideas about documentation. It is kind of funny, really. Most documentation is written by technicians&mdash;not professional writers. And most technicians would include documentation among their top ten complaints regarding the software they use. Physician, heal thyself. This column describes ideas and suggestions from current literature on software documentation. I hope they will change the way you think about documentation. If you are in the software field, it is almost certain that you will have to write documentation, for either your peers or your users. If you are designing software, you owe it to those you serve to gain an enlightened attitude toward documentation, recognizing the interconnectedness of the software, its documentation, and the help system. Otherwise, you are not a &ldquo;practical programmer.&rdquo;