ppxscal/embedding_network huggingface dataset:
How to interface to advisory systems? Users request help with a very simple language
Authors: R. Guindon
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

Advisory systems can be very powerful general tools for users. Formal query languages, menus, and direct manipulation interfaces might not suffice to access advisory systems' full functionality. The capabilities of natural language interfaces could be required. Unfortunately, natural language interfaces are not meeting the needs yet. Wide syntactic coverage is often traded off against handling ungrammatical sentences. However, this study shows that users request help with a very simple and restricted English, characteristic of unplanned or of child language. Moreover, users' utterances are frequently ungrammatical. It is argued that the simple syntax and the ungrammaticalities are determined by features intrinsic to advisory systems: users request help by typing to perform another primary task under real-time production constraints. Because of intrinsic performance constraints, users naturally resort to earlier and simpler forms of syntax. Natural language interfaces to advisory systems need not cover a wide variety of syntactic constructions but they must emphasize robust parsing.
Correct flow analysis in continuation semantics
Authors: M. Montenyohl, M. Wand
Venue: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1988)

Three semantics-preserving transformations (static replacement, factoring, and combinator selection) are used to convert a continuation semantics into a formal description of a semantic analyzer and code generator. The result of this derivation is a compilation algorithm which performs type checking before code generation so that type-checking instructions are not generated in the target code. Both the flow analysis and the resulting optimizations are proved correct with respect to the original definition of the source language. The proof consists of showing that all restructuring transformations preserve the semantics of the source language. This transformational approach can be extended to derive correctness proofs of other flow analysis and code optimization techniques.
ASIC microprocessors
Authors: M. J. Flynn, R. I. Winner
Venue: ACM SIGMICRO Newsletter (1989)

ASIC microprocessors are becoming an important technology for the control of complex (&ldquo;embedded&rdquo;) systems. The advantage of such microprocessors is that they can be tailored to the application. This tailoring is quite non-intuitive and optimization is a complex process. Tools such as the Architect's Workbench (AWB) have been developed to assist in this optimization. An example study shows a more than two to one advantage of such assisted analysis.
Minimal Mesh Embeddings in Binary Hypercubes
Authors: D. S. Scott, J. Brandenburg
Venue: IEEE Transactions on Computers (1988)

The authors state and prove a result about minimal graph embeddings of meshes into hypercubes. This corrects a flaw in a previously published proof by D.W. Krumme and K.N. Venkataraman (1986).
Library networking: its value to education
Authors: Pat Molholt
Venue: ACM SIGUCCS Newsletter (1988)

I have been asked to talk about libraries in the network environment, the role of library networking, in the educational process, and my observations gained from a five month study sponsored by the Office of Library Programs, US Department of Education.
Defining the presentation of application data by a graphical language
Authors: Q. Mao, J. Tai
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

On the basis of a graphical language for defining a dynamic picture and the control actions applied to it, a system is built for developing the presentation of application data for user interfaces. This system provides user interface developers a friendly and high efficient programming environment.
Evaluating academic computing on campus and developing a 5-year plan
Authors: S. L. Prupis
Venue: Proceedings of the 17th annual ACM SIGUCCS conference on User Services (1989)

A comprehensive study of academic computing at Baruch College was recently completed. The purpose of the study was to draw a baseline picture of current computing resources and needs, and to propose a five year development plan in order to improve academic computing for students, faculty, and staff. The impetus for this study was preparation for the Middle States Self Study Accreditation to take place in Fall 1989. One of the requirements of the accreditation is a critical self evaluation of the state of academic on campus. The focus of this paper is the process by which the study was conducted. Part 1, describes the study process. Part 2 outlines the major impediments to computing and recommendations for the future of academic computing at Baruch, and Part 3 discusses the impact of the study on the College.
Solving systems of polynomial inequalities in subexponential time
Authors: D. Yu. Grigor'ev, N. N. Vorobjov,  Jr
Venue: Journal of Symbolic Computation (1988)

Let the polynomials f"1,..., f"k@? @?[X"1,..., X"n] have degrees deg (f"i) = 0,..., f"k >= 0. In the case of a positive answer the algorithm constructs a certain finite set of solutions (which is, in fact, a representative set for the family of components of connectivity of the set of all real solutions of the system). The algorithm runs in time polynomial in M(kd) ^n^2. The previously known upper time bound for this problem was Sh=(A"1+A"2log@?Re@?)Re@?^n.Sc^1^/^3.
Reliable servers: design and implementation in avalon/C++
Authors: R. A. Lerner
Venue: Proceedings of the first international symposium on Databases in parallel and distributed systems (2000)

Avalon/C++ is a programming language that supports the construction of reliable programs consisting of a set of servers communicating over a network. It provides high-level language support for user-defined data types with customized synchronization and fault-tolerance properties. These data types are encapsulated in servers, and accessed through exported server operations. Avalon/C++ greatly simplifies the programming of these servers by hiding the distributed nature of a server from both the implementor and callers of a server. Avalon/C++ exploits the similarity of servers and classes, making server definition and use look like that for C++ classes. A detailed description is given of a typical Avalon/C++ server, the catalog server, which is used by clients to locate servers.
Vector performance analysis of three supercomputers: Cray 2, Cray Y-MP, and ETA 10-Q
Authors: R. A. Fatoohi
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

This paper presents the results of a series of experiments to study the single processor performance of three supercomputers: Cray-2, Cray Y-MP, and ETA10-Q. The main object of this study is to determine the impact of certain architectural features on the performance of modern supercomputers. Features such as clock period, memory links, memory organization, multiple functional units, and chaining are considered here. A simple performance model is used to examine the impact of these features on the performance of a set of basic operations. The results of implementing this set on these machines for three vector lengths and three memory strides are presented and compared. For unit stride operations, the Cray Y-MP outperformed the Cray-2 by as much as three times and the ETA10-Q by as much as four times for these operations. Moreover, unlike the Cray-2 and ETA10-Q, even-numbered strides do not cause a major performance degradation on the Cray Y-MP. Two numerical algorithms are also used for comparison. For three problem sizes of both algorithms, the Cray Y-MP outperformed the Cray-2 by 43% to 68% and the ETA10-Q by four to eight times.
Series solutions of algebraic and differential equations: a comparison of linear and quadratic algebraic convergence
Authors: R. J. Fateman
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

Speed of convergence of Newton-like iterations in an algebraic domain can be affected heavily by the increasing cost of each step, so much so that a quadratically convergent algorithm with complex steps may be comparable to a slower one with simple steps. This note gives two examples: solving algebraic and first-order ordinary differential equations using the MACSYMA algebraic manipulation system, demonstrating this phenomenon. The relevant programs are exhibited in the hope that they might give rise to more widespread application of these techniques.
Cost Reduction in the CCD Realization of MVMT Functions
Authors: M. H. Abd-El-Barr, Z. G. Vranesic
Venue: IEEE Transactions on Computers (1990)

The cost effectiveness of using an overflow circuit for truncated difference operation and a metal line for charge replication in the charge-coupled device (CCD) realization of multivalue multithreshold (MVMT) functions is considered. It is shown that the use of these two circuits leads to improved realizations compared to those achieved by previous approaches.
An operating system for real-time Ada
Authors: H. Rabbie, D. Nelson-Gal
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

Many applications of Ada are being designed for multiple program environments, distributed among one or more loosely- or tightly-coupled embedded processors, with hard real-time requirements for interrupt responsiveness to real-world I/O devices. A special-purpose operating system has been designed and implemented to support multiple communicating Ada and foreign language programs on multiple embedded processors. In this operating system, the Ada task is the basic unit of process concurrency, and the inter-task, inter-program and inter-processor communication functions are provided not only by Ada rendezvous, but also by packages whose bodies are directly integrated with the Ada tasking scheduler. The operating system also provides the capability of servicing hardware interrupts in Ada with very low latency and high throughput.
In search of knowledge-based search tactics
Authors: P. J. Smith, S. J. Shute, D. Galdes
Venue: Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval (1989)

Knowledge-based search tactics are discussed in terms of their role in the functioning of a semantically-based search system for bibliographic information retrieval. This prototype system, EP-X, actively assists users in defining or refining their topics of interest. It does so by applying search tactics to a knowledge-base describing topics in a particular domain and a database describing the contents of individual documents. This paper reviews the empirical studies that lead to the two central concepts implemented in EP-X: Semantically-based search; Knowledge-based search tactics.
Toward synthesis from English descriptions
Authors: W. Cyre
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper reports on a research project to design a system for automatically interpreting English specifications of digital systems in terms of design representation formalisms currently employed in CAD systems. The necessary processes involve the machine analysis of English and the synthesis of models from the specifications. The approach being investigated is interactive and consists of syntactic scanning, semantic analysis, interpretation generation, and model integration.
Quotron II: An Early Multiprogrammed Multiprocessor for the Communication of Stock Market Data
Authors: Montgomery Phister,  Jr.
Venue: IEEE Annals of the History of Computing (1989)

The first stock market quotation systems were installed in brokers' offices in 1960 by Scantlin Electronics, Inc (SEI). These primitive, magnetic tape based systems were enthusiastically received, and in the next two years some 800 were installed. However, SEI's success attracted competition, which forced the company in late 1962 to inaugurate a new service based on a four-CPU Control Data 160A computer system located in New York City. This system processed and stored market data, meanwhile receiving requests and transmitting replies on eight 2000 bps Dataphone(tm) lines to SEI offices in some 20 cities. Low speed lines in those cities connected the offices to SE/ keyboard-printers on the brokers' desks.
Preliminary mesh checking for structural analysis
Authors: Renato Capra
Venue: ACM SIGAPL APL Quote Quad (1990)

The purpose of this work is to provide tools for checking the nodes and elements of a Finite Element Model for Structural Analysis. All the checks related to single elements (warping and stretch factor, interior angles) can be performed on the whole model with APL scalar functions (without any loop). Operations that involve comparison between elements (such as checking for coincident nodes and coincident elements) require a non-trivial approach. A simple algorithm for recursive space-splitting is described, along with performance considerations for large models. Graphic output obtained using the Graphics Support Library of RTPC and an interface to Interleaf Workstation Publishing System are also provided.
On a particular restricted five-body problem an analysis with computer algebra
Authors: Alexander Ollongren
Venue: Journal of Symbolic Computation (1988)

A generalization of the famous restricted problem of three bodies in celestial mechanics is considered, for which the existence of Lagrangian points of equilibrium is proved, their location is established and a linear stability analysis is carried out-all of this using (reproducible) computer algebra.
Service specification and protocol construction for the transport layer
Authors: S. L. Murphy, A. U. Shankar
Venue: Symposium proceedings on Communications architectures and protocols (1988)

In a computer network, the transport layer uses the service offered by the network layer and in turn offers its users the transport service of reliable connection management and data transfer. We provide a formal specification of the transport service in terms of an event-driven system and safety and progress properties. We construct three verified transport protocols that offer the transport service. The first transport protocol assumes a perfect network service, the second assumes loss-only network service, and the third assumes loss, reordering and duplication network service. Our transport service specifications are very realistic. Each user can be closed, listening, active opening, passive opening, open, or closing. A local incarnation number uniquely identifies every active opening and listening duration. Users can issue requests for connection, listening, closing, data send, etc. The transport layer issues indications for successful or unsuccessful connection, closing, data reception, etc. A connection is established only if one user requested the connection and the other was listening, or both requested the connection. A user receives data only from the appropriate incarnation of the distant user, and receives it insequence, without loss or duplication. Progress properties ensure that every outstanding user request is eventually responded to by an appropriate transport indication. Our protocols are constructed by stepwise refinement of the transport service. The construction method automatically generates a verification that the protocols satisfy the transport service. One distinctive feature of our protocol construction is that the events and verification of the data transfer function is directly obtained from any one of the numerous verified single-incarnation data transfer protocols already presented in the literature.
Rasterization of nonparametric curves
Authors: John D. Hobby
Venue: ACM Transactions on Graphics (TOG) (1990)

We examine a class of algorithms for rasterizing algebraic curves based on an implicit form that can be evaluated cheaply in integer arithmetic using finite differences. These algorithms run fast and produce &ldquo;optimal&rdquo; digital output, where previously known algorithms have had serious limitations. We extend previous work on conic sections to the cubic and higher order curves, and we solve an important undersampling problem.
Deriving a protocol converter: a top-down method
Authors: K. L. Calvert, S. S. Lam
Venue: ACM SIGCOMM Computer Communication Review (1989)

A protocol converter mediates the communication between implementations of different protocols, enabling them to achieve some form of useful interaction. The problem of deriving a protocol converter from specifications of the protocols and a desired service can be viewed as the problem of finding the &ldquo;quotient&rdquo; of two specifications. We define a class of finite-state specifications and present an algorithm for solving &ldquo;quotient&rdquo; problems for the class. The algorithm is applied to an example conversion problem. We also discuss its application in the context of layered network architectures.
Seven experiences with contextual field research
Authors: M. Good
Venue: ACM SIGCHI Bulletin (1989)

Contextual field research is a growing area of interest in human-computer interaction. At the CHI '88 conference, Karen Holtzblatt, Sandy Jones, and myself hosted a Special Interest Group on "Field Research Techniques for Building Usable Products." This overview of seven different experiences with contextual field research techniques grew out of the network we established at the conference.These contributions show a wide range of experience with contextual field research, including its use in academic research and the design of diverse computer products. We hope that this snapshot of contextual field work in mid-1988 may excite your curiosity about what may be possible from this perspective, currently out of the mainstream of human-computer interaction research. The bibliography at the end of this article includes sources for more information on contextual methods, as well as references from the individual contributions.
On the combination of hardware and software concurrency extraction methods
Authors: A. K. Uht, J. F. Kolen
Venue: ACM SIGMICRO Newsletter (1988)

It has been shown that parallelism is a very promising alternative for enhancing computer performance. Parallelism, however, introduces much complexity to the programming effort. This has lead to the development of automatic concurrency extraction techniques. Prior work has demonstrated that static program restructuring via compiler based techniques provides a large degree of parallelism to the target machine. Purely hardware based extraction techniques (without software preprocessing) have also demonstrated significant (but lesser) degrees of parallelism. This paper considers the performance effects of the combination of both hardware and software techniques. The concurrency extracted from a given set of benchmarks by each technique separately, and together, is determined via simulations and or analysis. The "common parallelism" extracted by the two methods is thus also considered, using new metrics. The analytic techniques for predicting the performance of specific programs are also described.
iSMILE: a novel circuit simulation program with emphasis on new device model development
Authors: A. T. Yang, S. M. Kang
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The laborious task of implementing a new device model in a circuit simulator has long been recognized as a painful bottleneck to device modeling. In contrast to the conventional circuit simulators which employ a built-in model library approach, iSMILE generates and links all the necessary codes automatically from a minimal set of model descriptions contained in a user's model input file. Users are completely shielded from the internal complexity of the program when implementing new models. This flexibility of extraction and by comparing circuit simulation results in terms of performance and accuracy. iSMILE has been used successfully as a CAD tool for the development of new models for high-speed optoelectronic integrated circuits.
Discrete-event simulation&mdash;a timley problem
Authors: P. M. Dorin
Venue: ACM SIGCSE Bulletin (1989)

In this paper we discuss an exercise that is used in a first-year workshop to illustrate the main issues of discrete-event simulation programming. The problem is to make a program that determines all the times of the day at which a clock's hands form a straight angle.
Design methodology and microdiagnostics development for a self-checking microprocessor
Authors: R. A. Parekhji, N. K. Nanda
Venue: Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture (1989)

The conventional design of electronic circuits is intolerant to operational faults. Self-checking logic is aimed at online fault detection and can hence be incorporated to achieve reliable operation. In this paper, the design of a self-checking microprocessor is discussed. Self-checking strategies for different functional units are selectively and judiciously applied, and also modified wherever necessary, for the design of the register section, the arithmetic logic unit and the control unit. A self-checking microprogrammed control unit, capable of supporting normal instruction execution concurrently with diagnostics, is developed. The design methodology has been applied to Intel's 8085A microprocessor as a case study to make it self-testing. Overheads involved have also been estimated.
CREW PRAMS and decision trees
Authors: N. Nisan
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

This paper gives a full characterization of the time needed to compute a Boolean function on a CREW PRAM with an unlimited number of processors. The characterization is given in terms of a new complexity measure of Boolean functions: the &ldquo;block sensitivity&rdquo;. This measure is a generalization of the well know &ldquo;critical sensitivity&rdquo; measure (see [W], [CDR], [Si]). The block sensitivity is also shown to relate to the Boolean decision tree complexity, and the implication is that the decision tree complexity also fully characterizes the CREW PRAM complexity. This solves an open problem of [W]. Our results imply that changes in the instruction set of the processors or in the capacity of the shared memory cells do not change by more than a constant factor the time required by a CREW PRAM to compute any Boolean function. Moreover, we even show that a seemingly weaker version of a CREW PRAM, the CROW PRAM ([DR]), can compute functions as quickly as a general CREW PRAM. This solves an open problem of [DR]. Finally, our results have implications regarding the power of randomization in the Boolean decision tree model. We show that in this model, randomization may only achieve a polynomial speedup over deterministic computation. This was known for Las-Vegas randomized computation; we prove it also for 1-sided error computation (a quadratic bound) and 2-sided error (a cubic bound).