ppxscal/embedding_network huggingface dataset:
HDTV and the computer industry
Authors: Karen A. Frenkel
Venue: Communications of the ACM (1989)

In the 1940s, television and radio combinations like the one on the left were the precursors of today's "entertainment centers ." About 25 years later, black and white television gave way to color. The next leap, high resolution television coupled with CD quality stereo may be coming soon. Last April, in the deep hours of the night, NBC, Channel 4 in New York City, announced a test: viewers would witness the first broadcast of the Sarnoff Research Center's Advanced Compatible Television system. The program of choice: the Saint Patrick's Day Parade. Researchers at the Sarnoff Center in Princeton, NJ, watched the signal, which emanated from WNBC at the World Trade Center in New York, on experimental high-definition monitors. The Sarnoff group, along with ABC and General Electric's consumer electronics division, has invested $60 million to develop a system that has twice the lines of regular TV screens (1050), scans at the same rate (29.97 frames per second), and enhances the current standard signal. A planned two-step approach to advanced television, the second phase would provide greater detail to those who bought wide-screen monitors, but it still would be compatible with today's TVs. The Sarnoff system is one of 20 advanced television research projects under way in this country, including those of the Zenith Electronics Group in cooperation with AT T Microelectronics, Massachusetts Institute of Technology's Advanced Television Research Program, the New York Institute of Technology, the Del-Ray Group, and North American Philips. Many have applied for matching funds from DARPA, which has earmarked $30 million for the next three years&mdash;half slated for transmission research and half for display technology. As of August 1989, five companies had been granted money for display technology. Newco Inc. of San Jose, CA, Raychem Corporation of Menlo Park, CA, Texas Instruments Inc. of Dallas, TX, and Projectavision Inc. of New York will receive money for projection display systems. Photonics Technology Inc. of Northwood, OH, was selected for flat panel display technology. More money may be forthcoming, as pressure is exerted to create systems to compete with or to supplant high-definition television (HDTV) as offered by Japan's national broadcasting organization Nippon Hoso Kyokai (NHK) and Europe's Eureka systems.
A characterization of sharing in parallel programs and its application to coherency protocol evaluation
Authors: S. J. Eggers, R. H. Katz
Venue: Proceedings of the 15th Annual International Symposium on Computer architecture (1988)

In this paper we use trace-driven simulation to analyze the memory reference patterns of write shared data in several parallel applications. We first develop a characterization of write sharing (based on the notion of a write run), and then examine the traces, using metrics derived from the characterization. The results indicate that the amount of write sharing in all programs is small; and that it is characterized by short to medium sequences of per processor references, with little contention for either data or locks. We determine to what extent this analysis can be used to predict the coherency overhead of write-invalidate and write-broadcast protocols. We develop a simple model of write sharing from the write run characterization. By applying the results of the sharing analysis to the model, weighted by machine-specific cycle costs for carrying out coherency-related bus operations, we can estimate relative protocol performance. We compare these results to those from detailed architectural simulations. The simulation results indicate that (1) neither protocol dominates in performance; and that (2) the write run model is a good predictor of protocol performance when the unit of the coherency operations matches that in the sharing analysis. This is the case for the write-broadcast protocols, in which one word is broadcast for each write to shared data. However, in Berkeley Ownership, a write-invalidate protocol, the unit of coherency is an entire cache block. When the block size is large, performance for this protocol is quite sensitive to the memory reference patterns within the block.
Bounding availability of repairable computer systems
Authors: R. R. Muntz, E. de Souza e Silva, A. Goyal
Venue: ACM SIGMETRICS Performance Evaluation Review (1989)

Markov models are widely used for the analysis of availability of computer/communication systems. Realistic models often involve state space cardinalities that are so large that it is impractical to generate the transition rate matrix let alone solve for availability measures. Various state space reduction methods have been developed, particularly for transient analysis. In this paper we present an approximation technique for determining steady state availability. Of particular interest is that the method also provides bounds on the error. Examples are given to illustrate the method.
Productivity tools in simulation: SIMSCRIPT 11.5 and SIMGRAPHICS
Authors: O. F. Bryan,  Jr.
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The SIMSCRIPT II. 5 simulation language with its integrated dynamic graphics package, SIMGRAPHICS, substantially reduces the time and effort to produce a simulation when compared to general purpose languages.Its structured English syntax improves readability and reduces some of the need for documentation. This syntax is supported by powerful libraries to relieve the programmer of substantial amounts of work by pushing it onto the computer.SIMGRAPHICS adds graphics to a program to display results dynamically. Graphics in most programs takes thousands of lines of code. SIMGRAPHICS reduces this task to a few lines of code with mouse-and-menu graphics editors.All of this adds up to major improvements in productivity in programming. Rapid prototypes with dynamic graphics can be written in a few days. Code is open to inspection by non-programmers. Results are faster and more reliable.
Electronic monitoring and the redundancy of control systems: The role of the supervisor
Authors: E. J. Eisenman
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

Despite an increasing amount of research on the concerns of lower level computer workers who perform clerical work using Video Display Terminals, there has been virtually no attention paid to the concerns and behaviors of their supervisors. Consequently, little is known about actual supervisory methods in settings with computerized performance monitoring systems. This paper reports on the results of a field study focusing on the supervisor's role in computerized and non-computerized data entry settings. Both supervisors and their employees comprised the research sample. In general, the results of this study do not support prior research regarding the differences in perception of closeness in supervision between VDT and non-VDT workers. Furthermore, the results suggest that the supervisors are largely under-utilizing the monitoring capabilities of the system. Implications for systems design are discussed.
The design space of input devices
Authors: Stuart K. Card, Jock D. Mackinlay, George G. Robertson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

A bewildering variety of devices for communication from humans to computers now exists on the market. In order to make sense of this variety, and to aid in the design of new input devices, we propose a framework for describing and analyzing input devices. Following Mackinlay's semantic analysis of the design space for graphical presentations, our goal is to provide tools for the generation and test of input device designs. The descriptive tools we have created allow us to describe the semantics of a device and measure its expressiveness. Using these tools, we have built a taxonomy of input devices that goes beyond earlier taxonomies of Buxton Baecker and Foley, Wallace, Chan. In this paper, we build on these descriptive tools, and proceed to the use of human performance theories and data for evaluation of the effectiveness of points in this design space. We focus on two figures of merit, footprint and bandwidth, to illustrate this evaluation. The result is the systematic integration of methods for both generating and testing the design space of input devices.
Mail server for PC users
Authors: Takayuki Kushida, Noriyuki Shimizu
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

This paper describes the design and development of a software system for exchanging mail between a wide area network (BITNET) and individual personal computer users. Such users need network addresses in order to receive mail; this problem is considered and solved by splitting the user-id, so that a network user can send mail to a personal computer user at a simple address, &ldquo;user-id@node-id&rdquo;. Adoption of domain addresses is considered as an alternative method. There is also a description of an access validity mechanism for personal computers, which was developed because of the need to use public telephone lines. The system was installed at the Science University of Tokyo (SUT), and was evaluated by the faculty of Tokyo Denki University. The results of the evaluation are reported at the end of the paper.
What you look at is what you get: eye movement-based interaction techniques
Authors: Robert J. K. Jacob
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

In seeking hitherto-unused methods by which users and computers can communicate, we investigate the usefulness of eye movements as a fast and convenient auxiliary user-to-computer communication mode. The barrier to exploiting this medium has not been eye-tracking technology but the study of interaction techniques that incorporate eye movements into the user-computer dialogue in a natural and unobtrusive way. This paper discusses some of the human factors and technical considerations that arise in trying to use eye movements as an input medium, describes our approach and the first eye movement-based interaction techniques that we have devised and implemented in our laboratory, and reports our experiences and observations on them.
Coupling FORTH and GKS in monitoring processes
Authors: V. Milanese
Venue: ACM SIGPLAN Notices (1990)

Control processes usually require short and fast programs which are often joined with simple graphic activities. In such environments FORTH is used as a system language, since it adds the properties of modularity and structuring of high level programming to those of immediateness and speed which characterize assembler programming. In order to obtain similar performances by graphic modules, it is advisable to employ a low level graphics standard and to implement it by using FORTH itself.
A Software Science Model of Compile Time
Authors: Wade H. Shaw,  Jr., James W. Howatt, Robert S. Maness, Dennis M. Miller
Venue: IEEE Transactions on Software Engineering (1989)

The Halstead theory of software science is used to describe the compilation process and generate a compiler performance index. A nonlinear model of compile time is estimated for four Ada compilers. A fundamental relation between compile time and program modularity is proposed. Issues considered include data collection procedures, the development of a counting strategy, the analysis of the complexity measures used, and the investigation of significant relationships between program characteristics and compile time. The results indicate that the model has a high predictive power and provides interesting insights into compiler performance phenomena. The research suggests that the discrimination rate of a compiler is a valuable performance index and is preferred to average compile-time statistics.
Advances and trends in the design and construction of algebraic manipulation systems
Authors: R. J. Fateman
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We compare and contrast several techniques for the implementation of components of an algebraic manipulation system. On one hand is the mathematical-algebraic approach which characterizes (for example) IBM's Scratchpad II. On the other hand is the more ad hoc approach which characterizes many other popular systems (for example, Macsyma, Reduce, Maple, and Mathematica). While the algebraic approach has generally positive results, careful examination suggests that there are significant remaining problems, especially in the representation and manipulation of analytical, as opposed to algebraic mathematics. We describe some of these problems, and some general approaches for solutions.
An environment for performance experiment on multiprocessors
Authors: Y. Gaur, V. A. Guarna, D. Jablonowski
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

This paper describes an interactive tool for collecting and visualizing performance statistics for programs running on an Alliant FX/8 multiprocessor. The performance &ldquo;workbench&rdquo; presented is based on the gprof tool, supplied as a standard component with many Unix systems. The user-friendly environment presented does most of the bookkeeping necessary to compile, execute, and analyze application programs automatically. The environment also supports a graphical interface to review experimental data. The work reported here is a part of the ongoing work on the development of the Faust programming environment at the Center for Supercomputing Research and Development at the University of Illinois at Urbana-Champaign.
A System Design/Scheduling Strategy for Parallel Image Processing
Authors: S.-Y. Lee, J. K. Aggarwal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A system design/scheduling strategy is described for a real-time parallel image processing system. A parallel image processing model based on the spatial and temporal parallelisms extractable in image processing tasks is formulated. This model consists of linear pipeline stages, each of which is a multiprocessing module. The strategy is discussed for two cases: static and dynamic. The description of the detailed hardware structure of each module is not attempted because of its dependency on a specific task. In the static case, where the processing time is constant, the processing times of all the stages are adjusted to be identical. In the dynamic case, where the processing time varies with each image, the strategy needs to be modified to achieve the maximum possible processing speed. The strategy is demonstrated for the static case by implementing image processing tasks on two different multiprocessor systems.
Instruction-path coprocessing to solve some RISC problems
Authors: E. H. Debaere
Venue: ACM SIGARCH Computer Architecture News (1989)

Recent research in computer architecture has led to the development of Reduced Instruction Set Computers (RISCs). Such computers exploit the fast execution of a low number of low-level instructions. However, two problems arise: (i) as the RISC instruction set architectures are completely new and use specific look-ahead techniques, optimizing code generators of compilers must be developed from scratch to allow high level language programming; (ii) the high execution rate and low semantic instruction content inherent to RISCs requires extremely high instruction bandwidth in order to achieve maximal throughput. In this paper we propose to apply the concept of coprocessing in the instruction path and show how this technique, in particular in the RISC-case, greatly contributes to the solution of the two above problems.
A characterization of constant-time maintainability for BCNF database schemes
Authors: Héctor J. Hernández, Edward P. F. Chan
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

The maintenance problem (for database states) of a database scheme R with respect to a set of functional dependencies F is the following decision problem. Let r be a consistent state of R with respect to F and assume we insert a tuple t into rp &egr; r. Is r &cup; {t} a consistent state of R with respect to F? R is said to be constant-time-maintainable with respect to F if there is an algorithm that solves the maintenance problem of R with respect to F in time independent of the state size. A characterization of constant-time-maintainability for the class of BCNF database schemes is given. An efficient algorithm that tests this characterization is shown, as well as an algorithm for solving the maintenance problem in time independent of the state size. It is also proven that constant-time-maintainable BCNF database schemes are bounded. In particular, it is shown that total projections of the representative instance can be computed via unions of projections of extension joins. Throughout we assume that database schemes are cover embedding and BCNF, and that functional dependencies are given in the form of key dependencies.
Standard bases and geometric invariant theoryI. Initial ideals and state polytopes
Authors: David Bayer, Ian Morrison
Venue: Journal of Symbolic Computation (1988)

We characterise the set of monomial ideals that can occur as the initial ideals of a given homogeneous ideal Q in a polynomial ring, as one varies the monomial order used within a fixed coordinate system. This set is canonically bijective to the set of vertices of the state polytope of Q, a convex polytope arising in the geometric invariant theory of the Hilbert point of Q.
Red-Blue intersection detection algorithms, with applications to motion planning and collision detection
Authors: P. Agarwal, M. Sharir
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

Let &Ggr; be a collection of n (possibly intersecting) &ldquo;red&rdquo; Jordan arcs of some simple shape in the plane and let &Ggr;' be a similar collection of m &ldquo;blue&rdquo; arcs. We present several efficient algorithms for detecting an intersection between an arc of &Ggr; and an arc of &Ggr;'. (i) If the arcs of &Ggr;' form the boundary of a simply connected region, then we can detect a &ldquo;red-blue&rdquo; intersection in time &Ogr; (&lgr;s(m)log2 m + (&lgr;a(m) + n)log(n + m)) where &lgr;s(m) is the (almost-linear) maximum length of (m, s) Davenport-Schinzel sequences, and where s is a fixed parameter, depending on the shape of the given arcs. Another case where we can detect an intersection in close to linear time is when the union of the arcs of &Ggr; and the union of the arcs of &Ggr;' are both connected. (ii) In the most general case, we can detect an intersection in time &Ogr; ((m&radic;&lgr;s(n) + n&radic;&lgr;s(m))log1.5(m+n)). For several special but useful cases, in which many faces in the arrangements of &Ggr; and &Ggr;' can be computed efficiently, we obtain randomized algorithms which are better than the general algorithm. In particular when all arcs in &Ggr; and &Ggr;' are line segments, we obtain a randomized &Ogr;((m+n)4/3+c) intersection detection algorithm. We apply the algorithm in (i) to obtain an &Ogr;(&lgr;s(n) log2 n) algorithm (for some small s > 0) for planning the motion of an n-sided simple polygon around a right-angle corner in a corridor, improving a previous &Ogr;(n2) algorithm of [MY86], and to derive an efficient technique for fast collision detection for a simple polygon moving (translating and rotating) in the plane along a prescribed path.
Online help systems: design and implementation issues (panel)
Authors: G. Kearsley, R. L. Campbell, J. Elkerton, W. Judd, J. Walker
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

This panel session examines major issues in the design and implementation of online help systems.
Interaction nets
Authors: Yves Lafont
Venue: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

We propose a new kind of programming language, with the following features: a simple graph rewriting semantics, a complete symmetry between constructors and destructors, a type discipline for deterministic and deadlock-free (microscopic) parallelism. Interaction nets generalize Girard's proof nets of linear logic and illustrate the advantage of an integrated logic approach, as opposed to the external one. In other words, we did not try to design a logic describing the behaviour of some given computational system, but a programming language for which the type discipline is already (almost) a logic. In fact, we shall scarcely refer to logic, because we adopt a na&iuml;ve and pragmatic style. A typical application we have in mind for this language is the design of interactive softwares such as editors or window managers.
Object management issues for software engineering environments workshop report
Authors: Maria H. Penedo, Erhard Ploedereder, Ian Thomas
Venue: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1989)

During recent years, several research efforts in the area of software development environments have focused on the provision of uniform Object Management Systems (OMS) as a framework for tool integration and communication. This paper summarizes discussions of an OMS Workshop on the issues that arise in defining an appropriate data model for an OMS.
Decomposing the Laplacian
Authors: M. A. Piech
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Correction is made and an elementary derivation is given of Clark's decomposition of the Laplacian Delta /sup 2/f(x,y) into a second directional derivative in the gradient direction of f, and a product of gradient magnitude by curvature of the level curve through f(x,y).
Utilizing Bandwidth Sharing in the Slotted Ring
Authors: Ahmed E. Kamal, V. Carl Hamacher
Venue: IEEE Transactions on Computers (1990)

A slotted-ring protocol that performs well across the full range of message length distributions is presented. The relative performance of the protocol is best at low to medium ring utilization, which is the most usual operating condition for local area computer networks. The protocol is not subject to the normal requirement for repeating source and destination addresses in each slot of a multiple-slot message. This reduced overhead feature is a main reason for the performance gains that are achieved. The protocol does not depend on any central control station for assigning slot usage to individual stations. However, it does require each ring station to keep track of the current status and source station usage of each slot on the ring. Implementation of the protocol would require significantly more complex logic circuits than are normally needed in either token rings or conventional slotted rings, and error recovery would be more difficult. Hence, its main value is that it serves as an indicator of the maximum achievable performance of the slotted format for local computer network rings operating at low to medium utilization levels under fully distributed access control.
VVDS: a verification/diagnosis system for VHDL
Authors: H. T. Liaw, K.-T. Tran, C.-S. Lin
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

In this paper, an interactive verification and diagnosis system for VHDL [Vm88], VVDS, is presented. In VVDS, hybrid simulation, which simulates with both numerical and symbolic data, is implemented to achieve an effective compromise of the enormous quantity of input test data in the conventional simulation and the complexity of symbolic expression in the symbolic execution. To support efficient user interface in the verification and diagnosis process, both on-line programming of commands and micro-probing capability to passively and actively probe any level of design hierarchy are provided.