ppxscal/embedding_network huggingface dataset:
Code generation for expressions with common subexpressions (Extended Abstract)
Authors: A. V. Aho, S. C. Johnson, J. D. Ullman
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

Easy as the task may seem, many compilers generate rather inefficient code. Some of the difficulty of generating good code may arise from the lack of realistic models for programming language and machine semantics. In this paper we show that the computational complexity of generating efficient code in realistic situations may also be a major cause of difficulty in the design of good compilers. We consider the problem of generating optimal code for a set of expressions. If the set of expressions has no common sub-expressions, then a number of efficient optimal code generation algorithms are known for wide classes of machines [SU, AJ, BL].
Further results on m-RMC expansions for m-valued functions
Authors: K. L. Kodandapani, Dhiraj K. Pradhan
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Reed-Muller like canonic (m-RMC) expansions for multivalued functions have been proposed earlier. For a n-variable m-valued function there are mnexpansions. This paper is related to the problem of finding minimal m-RMC expansions. Each of the expansions are determined by mn unknown coefficients in them. Thus there are altogether m2n coefficients. It is shown that only m(m+1)/n2 coefficients are distinct and hence by computing these coefficients one can determine all the mn expansions. Further, it is shown that the number of distinct coefficients for symmetric functions is reduced to [equation].
Computer commands labelled by users versus imposed commands and the effect of structuring rules on recall
Authors: Dominique L. Scapin
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

In the office of the future, computers will be found in the work environment to accomplish many various tasks. Often times, one will find computer command languages built from words of natural language, thereby facilitating the use of these new office automation systems for users inexperienced with computers. The study presented here focuses on very simple languages, without embedded features and where each computer command label corresponds to only one function. Three different approaches have been taken in order to improve the design of such simple languages: evaluation of existing languages (Scapin [1]); study of experimental languages that differ on linguistic or semantic variables (Hammond et al. [2]; Carroll [3]; Scapin [4]); research on the design of languages by the users themselves (Carroll [3]; Bisseret et Scapin [5]).
Speech synthesis for computer assisted instruction: The MISS system and its applications
Authors: William R. Sanders, Gerard V. Benbassat, Robert L. Smith
Venue: ACM SIGCUE Outlook (1976)

The Institute for Mathematical Studies in the Social Sciences at Stanford (IMSSS) has developed a synthesis system, MISS (Microprogrammed Intoned Speech Synthesizer), designed to test the effectiveness of computer-generated speech in the context of complex CAI programs. No one method of computer controlled speech production is completely satisfactory for all the uses of computer-assisted instruction (CAI). The choice of synthesis method is strongly related to the kinds of curriculums and instructional designs that will use speech. We chose to use acoustic modelling by linear predictive coding as the method of synthesis for MISS.(1) In Section 2 we describe criteria appropriate for organizing the comparison of voice response systems for use with instructional computers. Then we describe the particular requirements imposed by curriculums at IMSSS, review general voice synthesis techniques, and finally discuss our actual choice. In Sections 3 and 4 we outline the hardware and software that have been created to support MISS in operational CAI at Stanford. In Section 5 we discuss the applications of audio to CAI.
The case for capability based computers (Extended Abstract)
Authors: R. S. Fabry
Venue: ACM SIGOPS Operating Systems Review (1973)

The idea of a capability which acts like a ticket authorizing the use of some resource was developed by Dennis and Van Horn as a generalization of addressing and protection schemes such as the code- words of the Rice computer, the descriptors of the Burroughs machines, and the segment and page tables in computers such as the GE-645 and IBM 360/67. Dennis and Van Horn generalized the earlier schemes by extending them to include not just memory, but all systems resources: memory, processes, input/output devices, and so on; and by stressing the explicit manipulation of access control by nonsystem programs. The idea is that a capability is a special kind of address for an object, that these addresses can be created only by the supervisor, and that in order to use any object, one must address it via one of these addresses. The name comes from the fact that having one of these special kinds of addresses for a resource provides one with the capability to use the resource. The use of capabilities as a protection mechanism has been the subject of considerable interest and is now fairly well understood. Access control schemes using capabilities and capability -like notions are, as a whole, the most flexible and general schemes available. It will in fact be assumed that the reader is familiar with the advantages of capabilities for protection put-poses; a somewhat different advantage of capabilities will be developed here.
Stereographic displays of atmospheric model data
Authors: Mary desJardins, A. Frederick Hasler
Venue: ACM SIGGRAPH Computer Graphics (1980)

A system has been developed to display color stereographic time-lapsed sequences of outputs of three-dimensional atmospheric models. Contour lines and wind vectors derived from a model can be overlaid on a geostationary satellite image or displayed with map boundaries. The colors of these graphics can be changed interactively to highlight any desired feature or aid in interpreting relationships between parameters. The viewing portion of the system consists of a raster scan image display terminal with split screen capability and a stereoscopic viewing hood. The user of the system can observe model outputs in color and stereo as a function of time and in a manner which permits easy visualization and comparison. The system permits a meteorologist to visualize atmospheric parameters in a three-dimensional representation and correlate these parameters with information derived from satellite observations. This capability can significantly increase the user's ability to interact with and understand complex meteorological relationships.
The revision of &ldquo;Curriculum '68'&rdquo; (An Abstract)
Authors: Gerald L. Engel
Venue: Proceedings of the sixth SIGCSE technical symposium on Computer science education (1976)

Over the past several years the Curriculum Committee on Computer Science (C3S) of the Association for Computing Machinery has been preparing updates and revisions for &ldquo;Curriculum '68'&rdquo;. This has resulted in a number of surveys, and the preparation of three major interim reports. A series of topics is presented which represents the curriculum in the first two years. These topics fall in the general areas of (1) Programming Topics, (2) Software Organization, (3) Hardware Organization, and (4) Data Structures and File Processing.
A layout system for the random logic portion of MOS LSI
Authors: Isao Shirakawa, Noboru Okuda, Takashi Harada, Sadahiro Tani, Hiroshi Ozaki
Venue: Proceedings of the 17th Design Automation Conference (1980)

The random logic portion of an MOS LSI chip intended mainly for a calculator is constructed of an array of MOS complex gates, each composed of an MOS ratioless circuit with a multi-phase clocking system, and occupies ordinarily a considerable part of chip area. In this paper, a layout system for this portion of an LSI is described, which is constructed on the basis of a set of optimization heuristics. Experimental results of the layout system are also shown so as to reveal that the random logic portion can be realized in much the same area as can be done by manual layout.
Incorporating load dependent servers in approximate mean value analysis
Authors: John Zahorjan, Edward D. Lazowska
Venue: Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1984)

Queueing network performance modelling technology has made tremendous strides in recent years. Two of the most important developments in facilitating the modelling of large and complex systems are hierarchical modelling, in which a single load dependent server is used as a surrogate for a subsystem, and approximate mean value analysis, in which reliable approximate solutions of separable models are efficiently obtained. Unfortunately, there has been no successful marriage of these two developments; that is, existing algorithms for approximate mean value analysis do not accommodate load dependent servers reliably. This paper presents a successful technique for incorporating load dependent servers in approximate mean value analysis. We consider multiple class models in which the service rate of each load dependent server is a function of the queue length at that server. In other words, load dependent center k delivers &ldquo;service units&rdquo; at a total rate of f@@@@ (n@@@@) when n@@@@ customers are present. We present extensive experimental validation which indicates that our algorithm contributes an average error in response times of less than 1% compared to the (much more expensive) exact solution. In addition to the practical value of our algorithm, several of the techniques that it employs are of independent interest.
An Introduction To DIAM Levels Of Abstraction In Accessing Information
Authors: Michael Levin
Venue: Proceedings of the 1978 annual conference (1978)

There has been a great deal of interest in information models that are independent of all considerations of implementation. But such models cannot be exploited to their fullest potential without a theory for modeling implementations and the mapping of information models into implementations. DIAM (Data Independent Access Model) is such a theory, describing implementations on several levels of abstraction and the mappings from level to level. This paper is a tutorial which provides the reader with a quick introduction to DIAM by using it to model a textbook example of several implementations of a database. Areas for future research are then suggested.
Simulation of inventory space factor for various operating policies
Authors: Edward A. Siecienski
Venue: Proceedings of the 5th conference on Winter simulation (1971)

An inventory space factor is a measure of the interactions between individual products competing for space in a warehouse. The value of this factor will be dependent on the operating environment of each warehouse. Such factors as fixed interval ordering, bulk arrivals and bulk receivals will affect the amount of warehouse space required to store the many types of items. This paper discusses a GPSS model of the factors which describe the operating conditions of normal warehouse, and the resulting space factor, which would then define the interaction of products. This factor would then be useful to estimate warehouse size requirements for various operating policies.
SIGDA Human factors engineering issues in design automation systems (Panel Discussion)
Venue: Proceedings of the 1975 annual conference (1975)

The purpose of this panel session is to focus on the importance of human factors engineering considerations in the design of Design Automation environments, and to explore the applicability of human engineering techniques common to the mainstream of computer science to such environments.
ARIES: A workstation based, schematic driven system for circuit design
Authors: William H. Kao, Mohammad H. Movahed-Ezazi, Mark L. Sabiers
Venue: Proceedings of the 21st Design Automation Conference (1984)

ARIES is a workstation-based, schematic-driven software system for circuit design. It is divided into four major subsystems: SIZING, which generates transistor equivalents for logic gates (NMOS CMOS technologies) and calculates their sizes (Widths Lengths); PATHDELAY, which calculates path delays for circuits designed using standard cells; GRAPHICS, a 2-D plotting package that displays results from simulation programs such as SPICE, SUPREM, GEMINI and SUXES; and CANDETOSPICE, which generates, downloads remotely and executes circuit simulation input text files on a VAX 11/780. SIZING, PATHDELAY and CANDE2SPICE use CANDE, a schematic entry graphics editor and database as their front-end. ARIES runs interactively in a multiple overlapping bitmap window (concurrent processing) environment and is completely menu driven. All workstations and VAX 11/780's are connected together via several 10 MB Ethernet LANs.
Detection of Linear Bands in Gray-Scale Images Based on the Euclidean Distance Transform and the Hough Transform
Authors: Jeong-Hun Jang, Ki-Sang Hong
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A linear band, which is a straight line segment with some width (i.e., thickness), is a more structured, higher-level feature compared to edge or line features. In spite of the usefulness of linear bands as features, papers dealing with their detection problem are rare. In this paper, we propose a new method for detecting linear bands in gray-scale images. We first talk about our opinion on what types of linear bands a desirable detector should be able to detect, and then give a description on how we designed our detector to achieve the goal. Our method consists basically of four parts: edge detection, Euclidian distance transform, Hough transform, and line segment extraction. Experimental results show that our method is practical and applicable to real, natural images.
A new look at test generation and verification
Authors: Predrag G. Kovijanic
Venue: Proceedings of the 14th Design Automation Conference (1977)

The feasibility and major computational problem areas in test generation and verification are investigated. Alternate ways of higher level testing and state based modeling are envisioned.
Graphics in the classroom (Panel Discussion)
Authors: J. D. Robertson, D. D. Hearn, Dennis Anderson
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

(Panel will include three speakers from companies providing graphic support for the classroom.)
SEDL&mdash;A language for specifying integrity constraints on office forms
Authors: James C. Ferrans
Venue: ACM SIGOA Newsletter (1982)

ODIN is a system developed by Western Electric to automate the construction of electronic form entry, processing, and retrieval systems. An important component of ODIN is SEDL, the language used to define the logical structure of forms and the integrity constraints that each form must pass as it is entered. SEDL is a powerful, concise end-user language. Its integrity constraints are sophisticated assertions which are combined by using standard programming language constructs. Lists on forms are considered to be relations in a miniature relational database, and data manipulation language constructs are used to specify constraints involving them. SEDL's expressive power has been more than adequate for the complex office applications that have used it.
Virtual memories for mini-computers
Authors: Timothy D. Chase, Robert M. Glorioso
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This paper is concerned with the application and implementation of virtual memory systems on mini-computers. The system constraints and their effect on the design parameters are discussed in detail and a general design philosophy is developed. A specific implementation, both software and hardware, of a virtual memory system on a PDP-11/20 is described. The final system makes a machine with 8K of core and a small disk appear to the user as an off-the-shelf 32K computer with the capability of banking as many 32K sections as the disk can support. Memory protection is also available.
The Computer Software Products Industry in the '80s
Authors: Ellis Horowitz
Venue: Proceedings of the ACM '81 conference (1981)

The Computer Software Products Industry (sometimes called the independent packaged software industry) is composed of those companies which sell predefined and prepackaged computer software to the computer user community at large. Today software represents a major bottleneck in the further rapid spread of computers. The computer software products industry is poised in a crucial position with the chance of playing a pivotal role in eliminating this bottleneck. The overall purpose of this panel will be to discuss the various ways in which this industry is beginning to meet the challenge. Today the industry consists of essentially three groups. The first consists of the mainframe manufacturers. For example it is estimated that last year IBM sold &dollar;1.5 billion dollars of software or approximately 5% of its gross annual revenue. This figure should be compared with the total sales of the independent companies which is estimated to be around &dollar;1 billion. The second major group consists of those companies which are either totally devoted to software products or else they have substantial divisions devoted to software products. In addition these companies have major marketing forces which are nationally distributed. The larger ones are listed below along with their revenues from software product sales in 1980.
Segmenting Documents Using Multiple Lexical Features
Authors: A. C. Jobbins, L. J. Evett
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A method is presented for segmenting documents into conceptually related areas. Determining the equivalence of text is often based on the number of word repetitions. This approach is unsuitable for detecting short segments because terms tend not to be repeated across just a few sentences. In this paper we investigate the contribution of two other lexical features to find related words: collocation and relation weights (which identify semantic relations).An experiment was conducted on a set of test data with known topic changes; performances of the three features were independently compared. A combination of all features was the most reliable indicator of a topic change.In another experiment, CNN news summaries were segmented into their individual news stories. Precision and recall rates of around 90% are reported for news story boundary detection.
Use of design optimization techniques at Norden
Authors: Leon Feigin
Venue: Proceedings of the SHARE design automation project (1966)

The quality of any design can be expressed by certain numbers called merit factors. These merit factors are functions of other numbers called variables. The computer is used to manipulate these variables to obtain optimum merit factors. This manipulation process, called Design Optimization has been applied to a special optics problem that presents itself in the Norden Head-Up Display System.
On finding lowest common ancestors in trees
Authors: A. V. Aho, J. E. Hopcroft, J. D. Ullman
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Trees in an n node forest are to be merged according to instructions in a given sequence, while other instructions in the sequence ask for the lowest common ancestor of pairs of nodes. We show that any sequence of O(n) instructions can be processed &ldquo;on line&rdquo; in O(n log n) steps on a random access computer. If we can accept our answer &ldquo;off-line&rdquo;, that is, no answers need to be produced until the entire sequence of instructions has been seen seen, then we may perform the task in O(n G(n)) steps, where G(n) is the number of times we must apply log2 to n to obtain a number less than or equal to zero. A third algorithm solves a problem of intermediate complexity. We require the answers on line, but we suppose that all tree merging instructions precede the information requests. This algorithm requires O(n log log n) time. We apply the first on line algorithm to a problem in code optimization, that of computing immediate dominators in a reducible flow graph. We show how this computation can be performed in O(n log n) steps.
Digital computer simulation studies: Studies of information networks
Authors: Kevin D. Reilly
Venue: Proceedings of the second conference on Applications of simulations (1968)

Digital computer simulation models for analysis of information networks are being developed. Concepts from a variety of sources (2,3,6,8) provide the basis for formulation of the models. Several of the major aspects that are incorporated include: user behavior; scheduling within the information processing center; (machine- readable) file organization and maintenance; and distribution of conventional library resources. A single comprehensive model for the entire network is also being developed to allow for detailed study of special portions of the system, followed by a study of the effects of changes in the sub-system upon the entire system. Using a higher level programming language (GPS/360) was deemed to be essential because of the necessity of model change and adaptation imposed upon us in this area. Modelling must allow for many different detailed systems designs (corresponding to the variety of plans) and for changes in any single plan many of which cannot be foreseen.
A financial modeling language using Nested Arrays
Authors: Robert P. Noss
Venue: Proceedings of the international conference on APL (1982)

The imminent implementation of nested arrays concepts in APL offers a wide variety of potential applications for end users of APL-based financial systems. Historically, limitations of traditional APL tend to inhibit the non-APL programmer in using application packages based in APL, primarily due to syntax conventions which are unfamiliar to financial users who have experience in FORTRAN, BASIC, or higher-level packages based in those languages. A key element in gaining wider acceptance of APL for financial modeling is a simplification of the APL-based systems to minimize the effects of the idiosyncrasies of APL syntax. STSC's Nested Arrays System (NARS) offers several valuable features toward this end. This paper gives an overview of the APL Nested Arrays Modeling System (ANAMS), which uses NARS features to create an English-like modeling language incorporating features previously infeasible using traditional APL methods.
Computer technology at Case
Authors: Richard S. Varga
Venue: Proceedings of the 1964 19th ACM national conference (1964)

An undergraduate program in Computer Technology was instituted at Case Institute of Technology in the Fall of 1963. Prior to 1963, several efforts were made to develop a program of undergraduate studies in computing within the Department of Mathematics. At that time, except for one or two courses in pulse and digital circuits and an undergraduate course in digital computer design, all relevant courses were offered by the Department of Mathematics. These courses included numerical methods, programming, numerical analysis, a course in logical design and some more or less related work in logic.