ppxscal/embedding_network huggingface dataset:
A device able to get and play music
Authors: C. Aperghis-Tramoni
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

To process music might appear easy, but to exchange musical information, in real time, between a computer and a device seems more difficult. Our paper presents a realization of a musical peripheral built with an electronic organ and that allows a computer to get the information that comes from the keyboard or play music on the organ. The system is not too complex because our first preocupation was to encode music under a digital form, and then to create automatically the encoding. We present algorithms, realizations and perspectives.
Technical note for SIMSCRIPT users
Authors: W. V. Neisius, E. D. Katz, D. B. Townsend
Venue: Proceedings of the second conference on Applications of simulations (1968)

SIMSCRIPT is a very powerful and versatile language, however those who have used it will probably agree that its flexibility creates problems in learning to use it properly&mdash;at least, that was our experience. The purpose of this paper is to present our experiences and to share some of the things we have learned. This paper will be divided into three sections: &bull;Special Techniques &bull;SIMSCRIPT vs SIMSCRIPT I.5 &bull; Computer Comparisons
Proving the adequacy of protection in an operating system
Authors: Theodore A. Linden
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

The best that can be expected from traditional debugging and testing techniques is that the number of bugs will be reduced to a tolerable level. However, programs that either implement or relate to protection in an operating system are examples of programs for which: 1) the number of residual bugs that can be tolerated is zero; 2) it is necessary to know, or at least have convincing objective evidence, that the number of bugs is indeed zero; and 3) the concern extends to bugs which would not arise under normal circumstances and which may be very difficult to find either by testing or by normal use.
PPL - an extensible language that failed
Authors: Thomas A. Standish
Venue: Proceedings of the international symposium on Extensible languages (1971)

PPL, a conversational extensible language, has been running on the DEC PDP-10 for over a year now. Its applications have included: matrix, vector, polynomial, rational and complex arithmetic; formula, list, string, tree and graph manipulation; significant programs in real-time radar air traffic control simulation and parser generation for context-free languages; and a host of useful conversational tasks in population biology, algebra word problems and optimization of programs. Indeed, the parser for another extensible language(ECL) was generated in PPL(using the De Remer algorithm). PPL is now used by over 450 students in Harvard's introductory programming course. Needless to say, for me and a number of others, PPL is the preferred medium for writing programs and serves as an important and enjoyable tool of thought. To me, PPL is rich, highly versatile and easy to use As is the case for most other languages, PPL evokes both adoring remarks from its proponents and the usual scorn from its detractors. In analogy to the process of stellar evolution, if there is such a thing as a &ldquo;main sequence&rdquo; for the life of programming languages, PPL seems well launched on it (though programming languages probably die by fizzling out, not by exploding). Yet PPL is a failure. A few years ago, the vision of extensible languages held by some was that users could rapidly and cheaply extend the base of an extensible language to encompass the data, the operations, the notation and the control natural to many diverse application areas. In short, one was supposed to be able to manufacture personalized languages of reasonable efficiency and substantial utility with great ease just by applying some easily learned extension techniques. It was thought that just as programmers decree the organization of processes (by defining and calling subroutines),they should also decree appropriate organizations for data and for notation, in order to attain more clarity and efficiency.
Location of the Pupil-Iris Border in Slit-Lamp Images of the Cornea
Authors: Nicola Ritter, Robyn Owens, Paul P. Van Saarloos, James Cooper
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We present results for an active contour that finds the pupil-iris border in slit lamp images of the eye. Preprocessing involves producing a variance image from the original image and then locating the annulus, of a given size, which has the lowest mean variance. The center of this annulus falls inside the pupil, giving a starting position for a discrete circular active contour (DCAC). The DCAC is moved under the influence of two forces-external and internal. The external force is based on the gray-scales immediately inside and outside of the contour, at each vertex, in both the original and variance images and pushes the vertices inwards. The internal force acts to move the contour towards a perfect polygon, Æ larger than the current polygon. Repeated trials with decreasing values of Æ are performed until equilibrium is reached between the two forces and the pupil/iris border has been found.
Automatic load adjustment in time-sharing systems
Authors: M. V. Wilkes
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

The paper is concerned with the automatic adjustment of the number of console users on a time-sharing system according to the total load on the system. The control procedure comprises two algorithms. The first makes a periodic assessment ahead of time of the number of tasks that it would be necessary to insert into the system in order to keep the number of tasks actually within it (including those waiting on queues) under control. The second algorithm adjusts the number of users so that, when the system is under control, the number of tasks actually entering is, on the average, equal to the target number calculated in advance. The design of the first algorithm is critical from the point of view of stability and the greater part of the paper is devoted to a discussion of it based on the theory of linear recurrence relations. In designing the second algorithm, the main consideration is the avoidance of oscillation in the number of permitted users without, however, making the system so heavily damped that it is unresponsive.
Hierarchical Take-Grant Protection systems
Authors: Matt Bishop
Venue: ACM SIGOPS Operating Systems Review (1981)

The application of the Take-Grant Protection Model to hierarchical protection systems is explored. The proposed model extends the results of Wu [7] and applies the results of Bishop and Snyder [2] to obtain necessary and sufficient conditions for a hierarchical protection graph to be secure. In addition, restrictions on the take and grant rules are developed that ensure the security of all graphs generated by these restricted rules.
General river routing algorithm
Authors: Chi-Ping Hsu
Venue: Proceedings of the 20th Design Automation Conference (1983)

A general and practical river routing algorithm is described. It is assumed that there is one layer for routing and terminals are on the boundaries of an arbitrarily shaped rectilinear routing region. All nets are two-terminal nets with pre-assigned (may be different) widths and no crossover between nets is allowed. The minimum separation between the edges of two adjacent wires is input as the design rule. This algorithm assumes no grid on the plane and will always generate a solution if a solution exists. The number of corners is reduced by flipping of corners. An analysis to determine the minimum space required for a strait-type river routing problem is included. Let B be the number of boundary segments and T be the total number of terminals. The time complexity is of O(T(B+T)2) and the storage required is O((B+T)2). This algorithm is implemented as part of the design station under development at the University of California, Berkeley.
The lane tracing algorithm for constructing LR(k) parsers
Authors: David Pager
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

The paper presents, as far as the author is aware, the first practical general method for constructing LR(k) parsers. It has been used, without computational difficulty, to produce LR(1), LR(2) and LR(3) parsers for grammars of the size of ALGOL.
Incremental processing applied to Steinberg's placement procedure
Authors: H. W. Carter, M. A. Breuer, Z. A. Syed
Venue: Proceedings of the 16th Design Automation Conference (1979)

In this paper we indicate how the concept of incremental processing was applied to Steinberg's procedure for the placement of modules on aboard. In this procedure Munkres' algorithm is repeatedly used to solve linear assignment problems. We consider each assignment problem (matrix) to represent an incremental change with respect to the previous one, and present new techniques for solving a new assignment problem given the results of the previous one. We refer to this new algorithm as the Incremental Steinberg Algorithm. Experimental results indicate that this new algorithm produces equally good results as the classical technique but at a substantial reduction in CPU time.
The real world of design automation - part II or adapting to the joys of madness (Panel Session)
Authors: P. H. McDonald
Venue: Proceedings of the 16th Design Automation Conference (1979)

The real world of design automation is overflowing with innovative ideas, challenges, and accomplishments. In this fast-moving world, however, there are also many frustrations, tedious tasks, limitations of machines, inadequacy of languages, and scarcity of human resources. This panel session has been designed to bring into focus some of the key issues which we face today as managers, software designers, and system users. At the 1978 Design Automation Conference, there was a panel discussion entitled &ldquo;The Real World of Design Automation or A Funny Thing Happened on the the Way to Implementation.&rdquo; In that session we brought to light several topics covering various phases of implementation in the system design process. Some of the areas discussed were: Justification vs Reality, Batch vs Interaction, Design of a DA System, User-Oriented Systems, Data Base Management, and Portability.
A low cost plotting system for generating electrical/electronic drawings
Authors: Charles D. Martin
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

This paper discusses a process automation package developed by Technical Operations, Inc. to produce certain types of engineering drawings and associated data. The package described is fully operational and is being marketed to industrial concerns in the electronics group throughout the country. The principal component of the package is a computer program which enables low cost plotting equipment to produce high quality electrical/electronic engineering drawings. Specifically, the system is capable of producing a broad range of drawings including electronic schematic diagrams, logic diagrams, and cabling or interconnection diagrams. Accurate engineering parts lists and parts counts can also be printed out as a by-product by simply scanning the input data. Since this parts data is generated from the same code as the drawings, it corresponds uniquely to the information on the drawing.
Evaluation of alternate data base machine designs
Authors: V. Vemuri, R. A. Liuzzi, J. P. Cavano, P. B. Berra
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

The purpose of this paper is to point out the need for performance evaluation measures and techniques suitable for the evaluation of specialized architectural features in nonnumeric applications. Toward this end, problems associated with the use of data base machines are examined at three levels of detail: the user level, the system level and the device level.
Documentational analysis: Or Good Common Sense
Authors: Diana Patterson
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

Those who never documented their systems are suffering the consequences. In response your friendly marketplace has come up with some solutions to be purchased at the same price as a piece of software. It may or may not be partly software. It is a specific guide for generating documentation in as mechanical and predictable a method possible. If it is mechanical, it can be controlled, and that is what the product is: control. Control of system analysis and design. The necessary by-product is documentation. The kind of analysis that documentation requires, falls under that mysterious grace called &ldquo;Good Common Sense.&rdquo;
Data flow analysis techniques for test data selection
Authors: Sandra Rapps, Elaine J. Weyuker
Venue: Proceedings of the 6th international conference on Software engineering (1982)

This paper examines a family of program test data selection criteria derived from data flow analysis techniques similar to those used in compiler optimization. It is argued that currently used path selection criteria which examine only the control flow of a program are inadequate. Our procedure associates with each point in a program at which a variable is defined, those points at which the value is used. Several related path criteria, which differ in the number of these associations needed to adequately test the program, are defined and compared.
A discrete, stochastic simulation model for the analysis and design of solar energy heating systems
Authors: Gerard F. Lameiro, Robert A. Rademacher
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

This paper presents a stochastic simulation approach to the generalized solar energy space heating performance analysis and design problem. Specifically, Markov chain models are developed to represent ambient temperature, insolation, hot water load and system performance. From the Markov transition probability matrices for these variables, long-term expected performance is calculated. The theoretical development is implemented in FORTRAN IV on a Control Data 6400 Computer System. Computational experience gained, using STOLAR 3.1 (STOchastic soLAR energy systems model), indicates the stochastic approach requires significantly less time than is necessary for standard dynamic deterministic simulation approaches with comparable performance results. In fact, production simulation runs to model the performance of a solar energy heating system for a half year can be done with STOLAR 3.1 in about 10 CPU seconds.
Reliability of a chemical process system: A simulation approach
Authors: J. C. Thomas, S. H. Zanakis
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

This paper presents a general approach to estimation of the reliability of a chemical production system using discrete system simulation. Three factors which are considered to be of major importance in the reliability of a chemical system are design (e.g. serial or parallel units), the failure patterns of the individual units, and the maintenance policies and staffing. A GPSS simulation model which takes into account all three factors has been developed and is illustrated by use of an example.
The Felix File Server
Authors: M. Fridrich, W. Older
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

This paper describes Felix - a File Server for an experimental distributed multicomputer system. Felix is designed to support a variety of file systems, virtual memory, and database applications with access being provided by a local area network. Its interface combines block oriented data access with a high degree of crash resistance and a comprehensive set of primitives for controlling data sharing and consistency. An extended set of access modes allows increased concurrency over conventional systems.
Designing gate arrays using a silicon compiler
Authors: John P. Gray, Irene Buchanan, Peter S. Robertson
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes a programming environment in which gate array designs can be developed. It allows the engineer to design for performance, wirability and testability by manipulating a textual description of a design. The principle features of this are a high-level language for design description, completely automatic layout, and an integrated simulator. The total package can be referred to as a silicon compiler in the gate array design style.
Computer architecture (Panel Discussion): trends and alternatives
Authors: Don Senzig, Gideon Frieder, Wayne T. Wilner, Stanley Habib
Venue: Proceedings of the 1976 annual conference (1976)

The evolution of the 30 years young computer technology can be characterized as a fiercely competitive race for producing faster processors, larger memories and software for managing system resources and solving user problems. The common architectural label predominantly was &ldquo;general purpose&rdquo; implying &ldquo;everything for everybody&rdquo;, i.e., a capability for efficiently solving all the problems of all users - a mere intent, rather than a reality. The &ldquo;general purpose&rdquo; architecture was the &ldquo;rational&rdquo; answer of the economically minded manufacturers to the diversified and rapidly growing user needs. Spectacular breakthroughs in hardware technology, the emerging novel software engineering techniques and increased user sophistication present new sets of equations to the computer architects and manufacturers. Users can no longer be impressed simply by sub-nanosecond gates, execution of millions of instructions per second, trillion bit memories and other ambiguous parameters. Instead, user oriented characteristics, such as data security, system availability, simplicity of use, configurability and throughput efficiency must be the decisive criteria. With dramatic changes in the economies of scale in computer hardware, software and applications, will the conventional &ldquo;general purpose&rdquo; architecture survive in the years ahead? What are the alternatives? The panel will discuss these topics and present various views on the architecture of future computer systems.
METAPI - a language for extensions
Authors: Gerald D. Chandler
Venue: Proceedings of the international symposium on Extensible languages (1971)

The METAPI system [1,2] can be considered to be a combination of a translator writing system and an extensible language system. The history and usage of the system should make clear how it functions in both roles. METAPI grew from the need for a language in which a version of Fortran especially suited for interactive use could be implemented. Originally METAPI consisted of a translator writing system based on the Schorre [3] META II system. It was enhanced during implementation of PIFOR*, our Fortran language. It turned out that METAPI could be incorporated on an equal footing with PIFOR in the interactive system. Thus METAPI became a language for extensions since it was dynamically available. A user of the PI system, which incorporates METAPI and PIFOR can extend his language by writing statements in METAPI and can create any new statement type he wants. It is arbitrary whether these new statement types are considered to be a Fortran type or a METAPI type since in the PI system both languages are so closely intertwined. The PI implementations are examples of the usual applications of a translator writing system. A simple example of an extension would be a shift operator which can be added to PIFOR with a single short line of METAPI code.
Cognitive correlates of programming tasks in novice programmers
Authors: Dennis M. Irons
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The study presented here had two primary goals. First, to identify a set of subtasks which constitute a typology of the task of computer programming&mdash;specifically, the task structure of FORTRAN programming as perceived by novice programmers; second, to assess the relationship between individual differences in cognitive functioning (human information-processing characteristics) and performance on the perceived programming subtasks. The criterion instrument was a 77-item test of programming skill and knowledge, arranged by sections of homogeneous items. Each section included items representing one of three major subtask categories (composition, comprehension and debugging). Skill and knowledge acquisition was not studied as this would have required a longitudinal study. Likewise, program modification was omitted as Schneiderman and Mayer have defined it as an amalgam of the three primary tasks. Cognitive ability dimensions have been empirically defined in a large number of studies. Ekstrom, French and Harman [3] have reviewed the status of 24 factors which have been replicated in several studies, and are well established. Of interest are those dimensions which appear to have explanatory power for programming tasks. A listing of these factors follows.
Word processing in an M.I.S environment
Authors: Jean Green Dorsey
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

A funny thing happened on the way to the &ldquo;Office of the Future&rdquo; - WP type products (the step-children of the technology) have taken the lead in &ldquo;Extending the Human Resource&rdquo; by the use of computing machinery for the support of office processes. One might mistake the previous statement for an extravagant claim. However, a quick review of some recent history will sustain my case: One of the most awesome M.I.S. environments in existence is IBM. For a long time their office products operation was treated with disdain. The group made money - but, the place to be was DP! Every cliche applicable to the aloftness and mystery of DP processes was fostered by this group. Users, in terms of an organization's DP people, ate it up and enjoyed cloaking themselves in the mystique of DP. Then came word processing. And quiet as it was kept - word processing machines were and are computing machines. The software developed for a word processor was and is simply another program - generally better written than most - designed to permit a user to manipulate text. At first, the WP product was very rigid and limited with the idea being &ldquo;those WP folks can't handle anything else&rdquo;. The side effect in this KISS approach was the production of user - friendly software before it became fashionable.
The semantics of graphical input
Authors: Ed Anson
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

Any graphical input device may be represented by a data structure, modified from time to time by actions in response to certain events, and the ability to cause certain events as part of its repertoire of actions. Portions of a device's state may be made visible to other devices in a controlled way, and the remainder hidden. Conversely, a device may make use of the visible portions of another device's state. Typically, the pattern of device interaction forms a hierarchy, but no device is part of any other. This provides for the interchangeability of a single device with a group of devices, and allows a single device to support the function of several others. Device independence is thus enhanced without the usual sacrifice of human factors considerations. A group of devices defined in this manner can simulate any group of devices defined in the usual manner. Conversely, useful groups of devices may be defined, which cannot conveniently be simulated by the usual input semantics. The proposed semantic is thus more complete, and provides the additional benefit of a uniform language for describing both physical and virtual devices.