ppxscal/embedding_network huggingface dataset:
A model of performance for virtual memory systems
Authors: A. Brandwain, J. Buzen, E. Gelenbe, D. Potier
Venue: ACM SIGMETRICS Performance Evaluation Review (1974)

Queueing network models are well suited for analyzing certain resource allocation problems associated with operating system design. An example of such a problem is the selection of the level of multiprogramming in virtual memory systems. If the number of programs actively competing for main memory is allowed to reach too high a value, trashing will occur and performance will be seriously degraded. On the other hand, performance may also suffer if the level of multiprogramming drops too low since system resources can become seriously under utilized in this case. Thus it is important for virtual memory systems to maintain optimal or near optimal levels of multiprogramming at all times. This paper presents an analytic model of computer system behavior which can be used to study multiprogramming optimization in virtual memory systems. The model, which explicitly represents the numerous interactions which occur as the level of multiprogramming varies, is used to numerically generate performance curves for representative sets of parameters. A simplified model consisting of a CPU and a single backing store device is then used to derive an approximate expression for the optimal level of multiprogramming. The simplified model is also used to examine the transient behavior of such systems. The mathematical model we present is based on some simplifying assumptions; in particular all programs executing in the system are supposed to be statistically identical. In this respect the model we present must be considered to be a theoretical explanation of a phenomenon (thrashing) observed in certain operating systems rather than an exact representation of reality. Certain assumptions of the mathematical model are relaxed in a simulation model where distribution functions of service times at the secondary memory and input-output devices are arbitrary; by comparison with the theoretical results we see that CPU utilization and throughput are not very sensitive to the specific forms of these distributions and that the usual exponential assumptions yield quite satisfactory results. The simulation model is also programmed to contain overhead. Again we observe that the mathematical model's predictions are in fair agreement with the useful CPU utilization predicted by the simulation experiments.
The evolution of a language standard: MUMPS in the 1980s
Authors: David D. Sherertz
Venue: Proceedings of the ACM 1980 annual conference (1980)

In 1977 the MUMPS Language Standard was approved as an American National Standard (X11.1-1977) by ANSI. The specification of the MUMPS Standard was carried out by the MUMPS Development Committee, which continues to direct the evolution of the language. This paper traces the standardization process from its inception in 1973 to the present, stressing the enhancements made to MUMPS since 1977. Features which will be included in the proposed 1982 MUMPS Standard are discussed, as well as other extensions currently being considered. A number of areas in which future changes may be made are also mentioned. These include not only simple additional functional capabilities, but also possible fundamental revisions needed to keep MUMPS in step with the technology of the 1980s. Finally, some of the lessons learned about the process of language standardization are described.
Sums of divisors, perfect numbers, and factoring
Authors: Eric Bach, Gary Miller, Jeffrey Shallit
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Let N be a positive integer, and let &sgr;(N) denote the sum of the positive integral divisors of N. We show computing &sgr;(N) is equivalent to factoring N in the following sense: there is a random polynomial time algorithm that, given &sgr;(N), produces the prime factorization of N, and &sgr;(N) can be easily computed given the factorization of N. We show that the same sort of result holds for &sgr;k(N), the sum of the k-th powers of divisors of N. We give three new examples of problems that are in Gill's complexity class BPP: {perfect numbers}, {multiply perfect numbers}, and {amicable pairs}. These are the first &ldquo;natural&rdquo; candidates for BPP - RP.
ACM SIGPLAN history of programming languages conference BASIC language summary
Authors: Ted G. Lewis
Venue: ACM SIGPLAN Notices (1978)

Beginner's All-purpose Symbolic Instruction Code or BASIC was originally developed by T. E. Kurtz and J. G. Kemeny at Dartmouth College in 1963-1964. The original version consisted of 14 statement constructs. BASIC was one of several languages operating in a general purpose time-sharing system also developed at Dartmouth. The simple user commands, numbering about 8 or 10, have since become associated with the BASIC language. A BASIC program is created via the NEW command, listed by the LIST command, edited by a DELETE command, executed by the RUN command, and saved by the SAVE command. Previously saved programs are retrieved from their file by entering OLD and the desired program name.
&ldquo;Building polyonimoes; an approach to the space layout problem&rdquo;
Authors: R. S. Frew, P. H. Roe
Venue: Proceedings of the 9th Design Automation Workshop (1972)

A method of space layout is described which uses a pattern of square cells built from a given set of preferences of pairwise distances between all cells.
Process migration in DEMOS/MP
Authors: Michael L. Powell, Barton P. Miller
Venue: ACM SIGOPS Operating Systems Review (1983)

Process migration has been added to the DEMOS/MP operating system. A process can be moved during its execution, and continue on another processor, with continuous access to all its resources. Messages are correctly delivered to the process's new location, and message paths are quickly updated to take advantage of the process's new location. No centralized algorithms are necessary to move a process. A number of characteristics of DEMOS/MP allowed process migration to be implemented efficiently and with no changes to system services. Among these characteristics are the uniform and location independent communication interface, and the fact that the kernel can participate in message send and receive operations in the same manner as a normal process.
Use of simulation to test the validity and sensitivity of an analytical model
Authors: Prosper M. Bernard
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The purpose of the research reported here was to test formally the validity of some assumptions made in solving models by analytical techniques and to test the sensitivity of the system to the arrival distribution. The presentation refers to a simplified real-time model. The analytical solution in the literature is to derive shown results for each stage of the system and add them up to obtain the behavior of the system. Assumptions must then be made at each stage. Simulation has been used to solve the same system in terms of the same measure of efficiency, i. e. the response time. However, the system is solved as a whole, the output from one stage becoming the input to the second stage. Confidence limits have been obtained for the response time in order to test the results obtained from analytical techniques. Simulation has also been used to test the sensitivity of the system to a change in the arrival distribution. Using analysis of variance, the effect of the arrival pattern and of the interaction is determined.
Process design system an integrated set of software development tools
Authors: R. G. Koppang
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The Process Design Engineering Program, under the direction of the Ballistic Missile Defense Advanced Technology Center, has as its objective the development of a unified software engineering discipline addressing all software development problems from receipt of software requirements to delivery of the operational software system. During the first two years of this program, initial process design engineering and management procedures were developed which led to the systematic top-down development of real-time software processes. A prototype set of software tools to support these procedures was designed and implemented as Process Design System 1 (PDS 1 ), and an experimental BMD baseline software process was then designed and implemented using these techniques and tools. The baseline experiment demonstrated that although the basic concepts employed were effective for the tactical software (1), there were several deficiencies in the process design tools. The most important deficiency stemmed from the fact that the system was designed to support the development of only the tactical software. This resulted in the operating system software (the most difficult component) being implemented without the aid of PDS and in assembly language at cost of thirty percent of the budget for nine percent of the code. Additional problem areas were the lack of positive control over data accessing, inadequate data structuring capability, and the interruption and synchronization of operations.
A conceptual design for simulation in a real time control tool
Authors: Carolyn D. Tobin, Neal N. NcCollom
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper discusses the use of simulation as an evaluation technique within an automated or semiautomated real time control system. Within this control system, simulation will be used to play out possible scenarios emphasizing various objectives of system control. The simulater will be, as much as possible, a deterministic model utilizing factory data bases to more accurately forecast results. The structure of the simulation model, including typical inputs from appropriate data bases, will be detailed. As a result of including a simulation model in the control system, an evaluator would examine the simulation outputs. This evaluator can be automated, human or a combination of the two. Through the control system, this evaluation would then be employed to direct the physical system. An ideal application of this approach is in the manufacturing environment. The advent of automated and computerized equipment makes the implementation of an automated control and evaluation system a feasible and practical enhancement to a manufacturing system. This paper will discuss the authors' thoughts on how such a control system could be implemented and what form it would take. Special emphasis will be given to the structure of the control system. The structure of the system will include description of the actions and interactions of appropriate factory data bases, the simulation model, evaluation criteria and the physical scheduling or control of the system. The overall control structure will be detailed as an integrated system. Different roles or utilizations of human interfaces will also be investigated. The final discussion will include an analysis of an implementation environment and a suggested implementation strategy.
A framework for data base semantic integrity
Authors: Michael Hammer, Dennis McLeod
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

A structured framework is provided for describing the semantic integrity requirements of a data base. The semantic integrity of a data base is said to be violated when the data base ceases to represent a legitimate configuration of the application domain it is intended to model. In the context of the relational data model, it is possible to identify multiple levels of semantic integrity information. Relation constraints comprise one such level; they express the semantic information not contained in the structure of the relations nor in the identity of their underlying domains. The three components of a relation constraint are considered: (1) the assertion (a predicate on the state of the data base or on transitions between data base states), (2) the validity requirement (the occasion(s) at which the assertion must hold), and (3) the violation-action (the action that is to occur if the assertion does not hold at a time when it should). A framework for relation constraints is presented. Details of a structured classification scheme are outlined. This scheme is intended to form a basis for a high level, well-directed, and disciplined methodology for the design of relational data bases. Emphasis is placed on the assertion component of relation constraints. Assertions are viewed as more than expressions of some relationship among different values in a data base; assertions single out the data that is constrained, and state the properties that this data must possess. A classification is provided of the various predicate types used to identify constrained data and to state the properties which they are to possess. Approaches to the relation constraint assertion specification process are discussed.
Optical mark reading - making it easy for users
Authors: Andrew M. Smith
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

One of the technologies in common use at university computer centers is optical mark reading (OMR). At Clemson University this form of input is becoming more widely used; as a result, faculty and staff who have had no previous contact with computing are beginning to depend on computer processing of their multiple-choice tests and survey forms. Student government elections have been processed using OMR input. As OMR usage has increased, the need has arisen for additional user services support in the areas of OMR documentation, education, utility programming, and office procedures. This paper will briefly trace the history of OMR usage at Clemson University. A detailed explanation will be made of how Clemson faculty and staff are able to maximize their usage of OMR with minimum knowledge of computing through the use of standardized OMR forms and test-scoring programs. Potential uses of OMR equipment in a university environment will also be discussed.
Steps to an advanced ada programming environment
Authors: Richard N. Taylor, Thomas A. Standish
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Conceptual simplicity, tight coupling of tools, and effective support of host-target software development will characterize advanced Ada programming support environments. Several important principles have been demonstrated in the Arcturus system, including template-assisted Ada editing, command completion using Ada as a command language, and combining the advantages of interpretation and compilation. Other principles, relating to analysis, testing, and debugging of concurrent Ada programs, have appeared in other contexts. This paper discusses several of these topics, considers how they can be integrated, and argues for their inclusion in an environment appropriate for software development in the late 1980's.
A simulation analysis of cash flow attenuation under alternative financial operating structures
Authors: Robert E. Markland
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper presents the results of a simulation analysis of the stochastic processes which determine cash flow attenuation under alternative financial operating structures. The environment of the study is that of a rapidly expanding retailing firm, which must consider a myriad of alternative operating structures during its embryonic development. Simulation is employed to determine risk-return profiles for the various alternatives. Efficiency frontiers are next computed for each of five measures of profitability, over a time adjusted horizon. An operating structure which produces minimal attenuation, and hence maximal profitability, is then determined by analyzing the efficiency frontiers of the various alternatives.
Computational aspects of a Dual algorithm for quadratically constrained quadratic programs
Authors: Donald W. Hearn, William D. Randolph
Venue: Proceedings of the ACM annual conference (1973)

Computational Aspects of a Dual Algorithm for Quadratically Constrained Quadratic Programs
Scalable high-definition video coding
Authors: G. Lilienfield, J. W. Woods
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

Multiresolution, or scalable, video coding has emerged to be of great interest in the compression community. It has been recognized that many applications, such as, image database browsing, desktop computing, terrestrial broadcasting, and others, can benefit from multiresolution viewing of embedded data sets. In this paper we present a new three-dimensional subband coder which provides six different spatio-temporal resolutions of a video signal. Motion-compensated temporal filtering (MCTF) is used for temporal analysis. The encoding algorithm efficiently compresses the data from the six resolutions into a single bit-stream while removing data which is redundant across different resolutions. Our algorithm successfully merges spatial and temporal scalability without imposing restrictions on which of the six video resolutions can be decoded, while allowing optimal encoding of the video at each spatial and temporal resolution.
Interactive off-line editors
Authors: Dean A. Roth
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

An editor provides the means to create and alter programs, text, and data. Full-screen editors allow easier and faster editing over line editors. Performing editing tasks on-line with a mainframe or minicomputer can incur avoidable overhead costs. One alternative to online editing is the use of microcomputers as off-line editors.
A linear time exact hidden surface algorithm
Authors: Wm Randolph Franklin
Venue: ACM SIGGRAPH Computer Graphics (1980)

This paper presents a new hidden surface algorithm. Its output is the set of the visible pieces of edges and faces, and is as accurate as the arithmetic precision of the computer. Thus calculating the hidden surfaces for a higher resolution device takes no more time. If the faces are independently and identically distributed, then the execution time is linear in the number of faces. In particular, the execution time does not increase with the depth complexity. This algorithm overlays a grid on the screen whose fineness depends on the number and size of the faces. Edges and faces are sorted into grid cells. Only objects in the same cell can intersect or hide each other. Also, if a face completely covers a cell then nothing behind it in the cell is relevant. Three programs have tested this algorithm. The first verified the variable grid concept on 50,000 intersecting edges. The second verified the linear time, fast speed, and irrelevance of depth complexity for hidden lines on 10,000 spheres. This also tested depth complexities up to 30, and showed that perspective scenes with the farther objects smaller are even faster to calculate. The third verified this for hidden surfaces on 3000 squares.
Neural-Based Solutions for the Segmentation and Recognition of Difficult Handwritten Words from a Benchmark Database
Authors: M. Blumenstein, B. Verma
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A new intelligent segmentation technique is proposed that may be used in conjunction with a neural classifier and a simple lexicon for the recognition of difficult handwritten words. A heuristic segmentation algorithm is initially used to over-segment each word. An Artificial Neural Network (ANN) trained with 32,034 segmentation points is then used to verify the validity of the segmentation points found. Following segmentation, character matrices from each word are extracted, normalized and then passed through a global feature extractor after which a second ANN trained with segmented characters is used for classification. These recognized characters are grouped into words and presented to a variable-length lexicon that utilizes a string processing algorithm to compare and retrieve words with highest confidences. This research provides promising results for segmentation, character and word recognition.
A comparative sampling of the systems for producing computer-drawn flowcharts
Authors: Marshall D. Abrams
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

In the current usage, complete flowcharts are generally drawn after an algorithm has been coded in a program part, not before. The functions of post-programming flowcharting are debugging and documentation. In both cases it is important to know the path of control through the program and the computations and other actions taken as directed by this flow of control; in short, it is important to know what the program does! Unless special controls are enforced, or unless the programmer is especially conscientious, flowcharts are not drawn when a program is complete. When a flowchart is required of such a program, especially when the creator is unavailable or forgetful, it must be drawn directly from the program itself by an objective &ldquo;other party.&rdquo; For debugging purposes the use of this &ldquo;other party&rdquo; is highly desirable so that the programmer may determine what a program part actually does do (as opposed to what it was designed to do). The proliferation of programming languages, and dialects of programming languages, have certainly made the flowchart a useful tool for the communication of algorithms between individuals. It is the author's experience that flowcharts serve well to convey algorithms written in compiler languages whose grammar and syntax may be completely unknown.
Distributed processing in manufacturing at GTE Automatic Electric
Authors: Ralph J. Moses
Venue: Proceedings of the 15th Design Automation Conference (1978)

As a manufacturer of complex electronic telephone switching systems, we at GTE Automatic Electric have faced a number of problems in manufacturing, particularly in the area of data control and data collection. As is typical of most electronic products, our products are highly complex and therefore, subject to frequent and often severe circuit changes. Although the number of unique product lines is small, each is relatively large and commonly has subassemblies which are custom engineered. The more general characteristics of our products are: 1) Integrated computer for stored program control 2) Heavy reliance on logic circuits 3) High reliability designed into the product (double, triple redundancy on circuits), 4) Analog circuitry on the front-end of the system 5) Wired backplane technology and 6) Printed Wiring Card technology We found that we could better utilize our resources if we could collect highly detailed information on each assembly as it was manufactured. This information would then give the process engineer, design engineer, and quality control engineer the tools to make better decisions concerning our resources. Therefore, the topics of this paper will focus on the technology that we are currently using, highlighting: 1) Control System Organization 2) IBM System 370 and CAM Data Base 3) Manufacturing Data Generation 4) On-line Machine Control System 5) On-line Data Distribution System 6) Interfacing to N/C Machines 7) Interfacing to Commercial CNC Systems 8) Data Preparation Using TSO