ppxscal/embedding_network huggingface dataset:
Design and implementation of a flexible and interactive microprogram simulator
Authors: M. Mezzalama, P. Prinetto
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

In the present paper a microprogrammable architecture oriented simulator is described. This simulator structure may be logically subdivided in four independent blocks: Supervisor, Interface Module, Simulation Monitor, Simulation Routines. A high degree of flexibility is obtained by means of a highly hierarchical structure of software and an easy-to-modify table-driven system description. Moreover particular care has been devoted to user-simulator communication via an easy-to-use command language. The use of the simulator in the development of a microprogrammable machine (based on Am2900 bit-slice microprocessors) is described.
Comparative schematology and pebbling with auxiliary pushdowns (Preliminary Version)
Authors: Nicholas Pippenger
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

This paper has three claims to interest. First, it combines comparative schematology with complexity theory. This combination is capable of distinguishing among Strong's &ldquo;languages of maximal power,&rdquo; a distinction not possible when comparative schematology is based on computability considerations alone, and it is capable of establishing exponential disparities in running times, a capability not currently possessed by complexity theory alone. Secondly, this paper inaugurates the study of pebbling with auxiliary pushdowns, which bears to plain pebbling the same relationship as Cook's study of space-bounded machines with auxiliary pushdowns bears to plain space-bounded machines. This extension of pebbling serves as the key to the problems of comparative schematology mentioned above. Finally, this paper advantageously displays the virtues of recent work by Gabber and Galil giving explicit constructions for certain graphs, for the availability of such explicit constructions is essential to the results of this paper.
Quality Circles in three data processing organizations
Authors: Elizabeth Godair, Louis Sportelli, Mahlon McCracken,  Jr., Doris Eschbach
Venue: Proceedings of the ACM '82 conference (1982)

The Japanese participative management philosophy of Quality Circles (QCs) recognizes that the people doing the work know more about how to improve the way work is done. Quality Circles provides a structure in which workers, after being trained, identify, analyze and solve work related problems, implementing solutions where possible. United States manufacturing companies caught on to QCs in the 1970s. By the early 1980s Quality Circles were being implemented in school systems, governments, hospitals, banks and in other white collar or service areas. One of the later areas to use Quality Circles was data processing. This paper first presents an overview of the philosophy and structure of Quality Circles; it then features three viewpoints from individual organizations who pioneered Quality Circles in the data processing field in the United States. These organizations are the US Army DARCOM Automated Logistics Management Systems Activity, the Federal Systems Division of IBM and McDonnell Douglas Automation. Each organization gives a synopsis of its experience with implementing QCs, its degree of achievement with the process, and recommendations on pitfalls to avoid when establishing Quality Circles. When starting Quality Circles in their organizations, there were no known role models in a data processing environment to learn from. This paper attempts to provide specific data processing application examples so that companies contemplating Quality Circles will have appropriate information to assist them in making implementation decisions.
SIGPLAN(Paper Session)
Authors: Marvin V. Zilkowitz, Paul R. McMullin, Keith R. Merkel, Howard J. Larsen, Fredrick C. Druseikis, G. David Ripley, David R. Hanson
Venue: Proceedings of the 1976 annual conference (1976)

Papers in this session address three problems of interest to those who design programming languages. The first deals with the detection of errors when pointer variables are used. The second paper describes a procedure for augmenting a Simple LR(k) parser in such a way that the parser can continue parsing the input after an error has been detected. The last paper describes a procedure mechanism that uses coroutines for the description and realization of nondeterministic algorithms.
Texture segmentation and shape in the same image
Authors: J. Krumm, S. A. Shafer
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Uniformly textured surfaces in 3D scenes provide important cues for image understanding. Texture can be used for both segmentation and for 3D shape inference. Unfortunately, virtually all current algorithms are based on assumptions that make it impossible to do texture segmentation and shape-from-texture in the same image. Texture segmentation algorithms rely on an absence of 3D effects that tend to distort the texture. Shape-from-texture algorithms depend on these effects, relying instead on the texture being already segmented. To really understand texture in images, texture segmentation and shape-from-texture must be viewed as a combined problem to be solved simultaneously. We present a solution to this problem with a region-growing algorithm that explicitly accounts for perspective distortions of otherwise uniform texture. We use the image spectrogram to compute local surface normals, which are in turn used to "frontalize" the texture. These frontalized texture patches are then subjected to a region-growing algorithm based on similarity in the local frequency domain and a minimum description length criteria. We show results of our algorithm on real texture images taken in the lab and outdoors.
Literacy and computer illiteracy
Authors: Alan Hagen-Wittbecker
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

Computers are marvelous devices that have simplified data processing and stimulated new applications in many fields. As tools, the machines have become so useful and attractive that authorities are calling for computer literacy and ordering large numbers of microcomputers and full-screen terminals. The computer is becoming a dominant, all-purpose tool. But, like any tool, it is not a panacea for the difficulties of modern civilization. It may not even be a critical part of literacy. In fact, the computer may have distinct educational and biological disadvantages for the human species. This article places computers in a broad educational perspective.
Some examples of the use of function-producing functions
Authors: W. H. Burge
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

Examples of the technique of defining and using function-producing functions are given in order to demonstrate certain simple but powerful programming methods.
The synthesis of structure-changing programs
Authors: Zohar Manna, Richard Waldinger
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Deductive techniques are presented for deriving programs systematically from given specifications. The specifications express the purpose of the desired program without giving any hint of the algorithm to be employed. The desired program is intended to achieve this purpose by means of such low-level primitives as assignment statements, the conditional statements, and recursion. The basic approach is to transform the specifications repeatedly according to certain rules, until a satisfactory program is produced. The rules are guided by a number of strategic controls. Many of the transformation rules represent knowledge about the program's subject domain (e.g., numbers, lists, sets); some represent the meaning of the constructs of the specification language and the target programming language; and a few rules represent basic programming principles. The weakest-precondition operator and the concept of protection are employed to construct programs that must achieve more than one condition simultaneously. Our previous work has centered on the synthesis of structure-maintaining programs, which produce an output without altering the value of any variable or changing the configuration of any data structure. Here, we extend our previous techniques to permit the construction of structure-changing programs, which can reset the values of variables, change the contents of an array, and alter the structure of a list or other data object.
Programmed restarts
Authors: Henry Pikner
Venue: Proceedings of the 1971 26th annual conference (1971)

It can happen to the computer programs that require long execution times that their runs are interrupted due to various reasons lying outside the programs. Part 1 of this paper estimates how much time we shall probably need to run a job, provided that we know the frequency of system halts and how long it takes to run the job smoothly. Mean time for programs that have to start from the very beginning after each halt, is compared with the mean time of the same jobs whose additional (restarting) code allows previous results to be saved and used at a restart. Part 2 states some features the restarting code should have, and finds places in the simplified program structure most suitable for locating parts of the restarting code.
Simulation tools (Paper Session)
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The emphasis in this session is on the tools which are available for use in simulation.
Managing simulation projects
Authors: Paul Gray
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

This tutorial presents a framework for decision making about simulations before committing resources. The viewpoint is that of a manager who must decide whether to solve a problem by simulation or by some other means. A decision-analysis type model is introduced to allow the manager to determine the minimum cost method of simulation within the operating and policy constraints of his organization. Two case examples using the methodology are presented.
Concepts of a Data Independent Accessing Model
Authors: M. M. Astrahan, E. B. Altman, P. L. Fehder, M. E. Senko
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

The Data Independent Accessing Model (DIAM) represents a constructive combination of the formal mathematical and the evolutionary pragmatic approaches to a Generalized Data Base Management System. It aims at a complete separation between the user's (application programmer's) model of real-world objects, events, and the relationships among them, and the internal representation of those objects, events, and relationships. At the same time, it aims at complete flexibility of internal representation in terms of simple specifications, the effects of which are easy to understand. The DIAM encompasses four levels of descriptive models (Figure 1), each providing for flexible augmentation of the descriptions of the preceding level. Specifications at each level are retained in a catalog.
Simulation: A case approach
Authors: Barry Shore, Dean Plager
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Certain real-world situations can prove to be effective learning experiences. Indeed it is possible for more learning to take place as a consequence of this pedagogical style than from any other style. In the last several years management science has moved toward an emphasis on application: How can this problem be modeled? How can this model be used in the decision process? What implementation problems might be encountered?
Community recreation planning by computer simulation: Golf in GPSS
Authors: William L. Tullar, Wayne F. Cascio
Venue: Proceedings of the 1971 26th annual conference (1971)

This paper deals with the computer simulation of a golf course. Using GPSS, the model was constructed to find &ldquo;ideal&rdquo; spacing for the tee-off times and minimal waiting time at each hole as a function of number of players on the course. The long range implications of computer simulations of recreational facilities are discussed.
Probabilistic simulations (Preliminary Version)
Authors: Nicholas Pippenger
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

The results of this paper concern the question of how fast machines with one type of storage media can simulate machines with a different type of storage media. Most work on this question has focused on the question of how fast one deterministic machine can simulate another. In this paper we shall look at the question of how fast a probabilistic machine can simulate another. This approach should be of interest in its own right, in view of the great attention that probabilistic algorithms have recently attracted.
Three levels of the wiring interconnection problem
Authors: D. K. Frayne
Venue: Proceedings of the SHARE design automation project (1965)

This paper describes a set of computer programs written to aid in the design, documentation, manufacture, and test of electronic hardware. The programs discussed are limited to the areas involved with the problem of wiring interconnection. While it can be said that there are over 10 different levels or types of wiring interconnection, these programs primarily concern the most common three: 1. Interconnection of circuit cards or other modules on a chassis 2. Interconnection of chassis within an electronic unit 3. Interconnection of units within a complex.
An extension of Liouville's theorem on integration in finite terms
Authors: M. F. Singer, B. D. Saunders, B. F. Caviness
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

In this paper we give an extension of the Liouville theorem [RISC69, p. 169] and give a number of examples which show that integration with special functions involves some phenomena that do not occur in integration with the elementary functions alone. Our main result generalizes Liouville's theorem by allowing, in addition to the elementary functions, special functions such as the error function, Fresnel integrals and the logarithmic integral to appear in the integral of an elementary function. The basic conclusion is that these functions, if they appear, appear linearly.
Three cell structures for ternary cellular arrays
Authors: J. A. Bate, J. C. Muzio
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Three cell structures are given for use in ternary cellular arrays. Universal arrays for both general functions of n variables and symmetric functions are considered, and the optimum size is found. Arrays are presented for these cases, as well as for sum and carry functions.
A course on software engineering techniques
Authors: D. L. Parnas
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

This is a report on a course entitled, &ldquo;Software Engineering Methods&rdquo;, which I have taught to undergraduate students at the Carnegie-Mellon University twice during the 1970-71 academic year. The course is &ldquo;project oriented&rdquo; and aims to educate by providing experience in the use of the techniques taught.
Architecture and protocols of STELLA: A European experiment on satellite interconnection of local area networks
Authors: N. Celandroni, E. Ferro, L. Lenzini, B. M. Segal, K. S. Olofsson
Venue: Proceedings of the eighth symposium on Data communications (1983)

STELLA (Satellite Transmission Experiment Linking Laboratories) is a European wide-band data transmission experiment. STELLA makes use of the European Orbital Test Satellite (OTS) which provides a 2 Mb/s broadcast data transmission channel. The first phase of the STELLA project (STELLA/I) is summarized. The more important design characteristics of an improved version (STELLA/II) of STELLA/I are emphasized. Collaboration between STELLA/II and UNIVERSE projects in the framework of COST-11Bis is then outlined.
Calculators and the elementary school: an idea and some implications
Authors: David Moursund
Venue: Proceedings of the 1976 annual conference (1976)

Calculators are now cheap enough to provide ready access to all elementary school students. I propose that this be done. This paper examines some of the potential impacts upon the elementary school mathematics curriculum. It suggests a need for a decrease in emphasis upon pencil-and-paper aided computation and an increase in both mental computation and the overall emphasis upon problem solving. It also lists some of the reasons why rapid introduction of calculators into the curriculum is apt not to occur.
Burn out in user services
Authors: John E. Bucher
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

The term &ldquo;burn out&rdquo; is frequently used to describe a person's fatigue or tire of a particular job or task. More often than not, it is associated with the helping professions and other jobs where people help other people. It is common to hear someone say that they are &ldquo;burned out on the job,&rdquo; or &ldquo;burned out on people,&rdquo; or just plain &ldquo;burned out.&rdquo; One of the themes of the 8th User Services Conference held in 1980 in Morgantown, West Virginia, was the topic of the effects and treatment of burn out in user services personnel. Papers presented by Dr. James F. Carruth of West Virginia University and Janice A. Bartleson of Southern Illinois University were helpful in defining and coping with the problems of job fatigue in user services. In 1984, we have organized this panel discussion to reinspect the topic, especially with regard to the numerous changes that have taken place in our computing environments and the ways in which we help our users. To anyone working in user services, it should be obvious that the spreading out of computing services, in both quality and quantity, will continue to have dramatic impacts on the people who are designated to &ldquo;help the users help themselves.&rdquo;
Multiply indexed data management
Authors: Thomas Beretvas
Venue: Proceedings of the 8th Design Automation Workshop (1971)

A data management facility has been designed to satisfy the specific needs of design automation, but the principles underlying it appear to be applicable to a variety of other situations. The system handles large amounts of engineering data related to computer systems design. These data are stored on direct-access devices and retained throughout the life of a computer system. Records representing the same information at different times in its history can be retained, as well as information reflecting different versions of the same computing system. The facility, which we call the data management system (DMS),1 provides multiple-indexing capabilities. Additional indexes can be added that allow data existing in the system to be retrieved in accordance with a theoretically unlimited variety of logical orderings.
Dynamic instruction set evaluation
Authors: Sanford K.S. Ma, Larry L. Wear
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The problems of determining the relative frequency of execution of instructions on a computer and finding the occurrences of patterns of instructions within programs have been investigated by a number of researchers in the past. The method most often used was to examine the object code and apply a method to count each type of instruction or group that constitutes a given pattern. Except for cases where special hardware has been added to the machine to perform the searching and accounting, most results have been based on the evaluation of the object code for a program on an offline basis. In this paper, a method is presented which allows the user to gather information concerning frequency counts of instructions while the program is executing, and also allow the user to specify sequences of instructions to be examined. Besides the enhanced accuracy this method offers over static methods of counting, it is also much faster and can also be used to monitor the performance of operating system programs such as loaders, compilers and supervisor routines.
An L=S criterion for optimal multiprogramming
Authors: Peter J. Denning, Kevin C. Kahn
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

Balancing interpagefault lifetime (L) against page swap time (S) has always been a performance criterion of great intuitive appeal. This paper shows that, under normal conditions, controlling the memory policy parameter to enforce the constraint L &ge; S, and allowing the multiprogramming load to rise as high as demand warrants without violating this constraint, will produce a load slightly higher than optimum. Equivalently, using the criterion L &equil; uS for some u slightly larger than 1 will approximate an optimal load. Using simulations, this criterion is compared with two others reported in the literature, namely the &ldquo;knee criterion&rdquo; (operate with L at the knee of the lifetime curve) and the 50% criterion (operate with the paging device at 50% utilization).The knee criterion produced optimal loads more often than the L&equil;S criterion, which in turn produced optimal loads more often than the 50% criterion. Since no practical implementation of the knee criterion is known, the L&equil;S criterion is the most attractive of the three.
The portable communication protocol program COMPAS for data terminal systems
Authors: K. Miyazawa, M. Oda, S. Kato
Venue: Proceedings of the 6th international conference on Software engineering (1982)

The communication protocol program COMPAS (DCNA COMmunication processing PAckageS), which is portable to various data terminal systems, has been developed according to the data communication network architecture DCNA. The method used in COMPAS and its practicability are described in this paper.
A suggested course in introductory computer programming
Authors: Warren A. Harrison, Kenneth I. Magel
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Introductory programming courses have long been a popular topic of discussion. Often it is either the only computer course a student takes or it is the foundation upon which all further training in computer science is built. The usual goal of such a course is to introduce the student to the use of a computer to solve simple problems in his or her particular discipline. Generally the method of presenting the material may be separated into two distinct schools of thought, which we have termed the &ldquo;Black Box School of Thought&rdquo; and the &ldquo;White Box School of Thought&rdquo;. In this paper, we discuss the benefits and drawbacks associated with the two alternative approaches. Additionally, we present a suggested course outline using the &ldquo;White Box&rdquo; method.
A model of interference in a shared resource multiprocessor
Authors: John E. Jensen, Jean-Loup Baer
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

This paper presents a generalized model of tightly-coupled multiprocessor systems which is then simplified to form a stochastic model for the study of interference. Analysis is performed on the resource contention which is characteristic of such systems in order to find a measure of system performance. After reviewing the problem of memory interference, the analysis is extended to contention in other individual resources, then combined to form a model for the interacting effects of contention in systems where processors contend for several shared resources.