ppxscal/embedding_network huggingface dataset:
Montreal MAPP training simulation model
Authors: Muhammed Naqi
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Simulation is being used in the Montreal Metropolitain Area Postal Plant (MAPP) to train operating and supervisory staff to process the mail. A simulation model developed will initially be used to train the staff for the Letter Processing Plant (LPP) at St. Laurent. With some modifications the same model would be adapted to train staff for other LPP of Canada Post Office (CPO). Subsequently, a version to train the staff for Bulk Mail Facility (BMF) would be developed. It is estimated that a total of over 500 personnel would receive training with the help of this simulation model.
LISP - notes on its past and future
Authors: John McCarthy
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

LISP has survived for 21 years because it is an approximate local optimum in the space of programming languages. However, it has accumulated some barnacles that should be scraped off, and some long-standing opportunities for improvement have been neglected. It would benefit from some co-operative maintenance especially in creating and maintaining program libraries. Computer checked proofs of program correctness are now possible for pure LISP and some extensions, but more theory and some smoothing of the language itself are required before we can take full advantage of LISP's mathematical basis.
Some applications of the Stanford University Drawing System for LSI microprocessor - &ldquo;a picture is worth a thousand bytes.&rdquo;
Authors: Will Sherwood
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

With the complexity and density of LSI microprocessor designs increasing, Computer Aided Design tools are becoming a necessity rather than a luxury. A significant CAD tool for documentation and bookkeeping is the Stanford University Drawing System (SUDS). It is schematics drawing package which not only offers hardcopy capabilities, but also is the nucleus of a data base which provides wirelist, layout, and cell device size information. Techniques will be shown for entering logic schematics and obtaining not only wirelists for simulation and layout verification, but also &ldquo;free&rdquo; circuit schematics for use by layout designers.
Prevention of task overruns in real-time non-preemptive multiprogramming systems
Authors: K. H. Kim, Mahmoud Naghibzadeh
Venue: ACM SIGMETRICS Performance Evaluation Review (1980)

Real-time multiprogramming systems, in which a hardware processor is dynamically assigned to run multiple software processes each designed to control an important device (user), are considered. Each software process executes a task in response to a service request repeatedly coming from the corresponding user. Each service task is associated with a strict deadline, and thus the design problem that we are concerned with is to ensure that the service tasks requested can always be executed within the associated deadlines, i.e., no task overrun occurs. This problem was studied by several investigators for the cases where preemptive scheduling strategies are used. In contrast, very few studies have been conducted for cases of non-preemptive scheduling. In this paper we show that a non-preemptive strategy, called relative urgency non-preemptive (RUNP) strategy, is optimal in the sense that if a system runs without a task overrun under any non-preemptive strategy, it will also run without a task overrun under the RUNP strategy. Then an efficient procedure used at the design time for detecting the possibility of a task overrun in a system using the RUNP strategy is presented. The procedure is useful in designing overrun-free real-time multiprogramming systems that yield high processor utilizations. Some special types of systems using the RUNP strategy for which even simpler detection procedures are available are also discussed.
Proposal For A Shared Resource Computing Utility
Authors: Kevin W. Bowyer, Peter N. Marinos
Venue: Proceedings of the 1978 annual conference (1978)

This paper presents the current results of an investigation into the design of shared resource computing systems. A general and highly flexible system organization is described which incorporates great potential for fault tolerance. Some of the operating system functions required by such a system are sketched and the question of efficiently exploiting concurrency within a single job is addressed. A user environment is described in which the type of system outlined provides an economically attractive alternative to present approaches. A major goal of the current investigation is to better define shared resource organizations and the environments in which their use can be justified on grounds of efficiency and reliability.
Computer budgeting of mineral holdings for a small scale mining operation
Authors: Daniel L. McCulley
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

This paper describes how a computer program handles the problems encountered in developing a mining budget from a large number of individual and widely scattered ore deposits. Among the difficulties overcome by the use of the program are constantly changing production forecasts requiring reworking of the budget, scheduling of the capacities of the offsite loading facilities, production rates requiring the mining of several properties concurrently while still maintaining quality control, and pressing time limits on several leases.
Analysis of storage structure performance for multiple data processing activities
Authors: Toby J. Teorey, John W. DeHeus
Venue: Proceedings of the 1976 annual conference (1976)

The File Design Analyzer, an analytical model for evaluating storage structures, has been applied to the problem of comparative performance with respect to individual data processing activities ranging from random retrievals to batch update and complex query specification. Performance is defined in terms of I/O processing time so that meaningful quantitative tradeoffs for multiple data processing applications can be determined. The model has been extended to further evaluate storage structures in terms of three levels of secondary storage contention and interference. Considerable insight into database design has been obtained from performance statistics provided by the analytical model. Relative storage structure performance is shown to be highly dependent upon the types of data processing activities required. Less significantly, it is also dependent on how the database is allowed to grow over time and on the level of secondary storage contention.
Data collection, analysis and validation
Authors: Edward Arthurs, Warren J. Erikson
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

The simulation of a computer system is not an end in itself. It is done to obtain knowledge about the behavior of a computer system at lower cost than would be incurred by the use of other techniques. There is no other reason to run a simulation. This is our position, but we welcome contrary viewpoints at the workshop. We must have measures of the variability of the real system before we can assess the validity of a simulation. Too often we see studies of computer systems where the performance measures are treated as if they had zero variance. Any validation effort must include some assessment of this system variability. In the workshop, we intend to address these joint issues of validation and variability as well as other questions typified by those on the following list. The list is by no means exhaustive but is intended to indicate the variety of issues that we intend to cover.
Program restructuring for block structured languages
Authors: Gopa Kumar, C. Thomas Nute
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

Prior studies of program restructuring to increase the degree of locality of a program in a paged virtual memory system were restricted to statically allocated codes only. This work develops a restructuring methodology for block structured languages like Algol, with dynamic memory allocation. We subsequently restructure and analyze different classes of programs using this methodology and study the performance gains realized with different restructuring heuristics.
Information resources management (IRM): Where did it come from and where is it going
Authors: Forest Woody Horton,  Jr.
Venue: Proceedings of the ACM '81 conference (1981)

Most people would agree that the term refers to all of the specialists, facilities, supplies, hardware, and software which an organization employs to collect, handle, store, disseminate, and use its data and information. Information flows into and out of organizations in enormous quantities. Some information stays around for very long periods of time&mdash;in filing cabinets, microforms, magnetic tape capsules, and other media. Thus its uses can be broadly divided into two major categories: transaction support and decision support. Transaction suport information means data that is used to sustain an organization's routinized operations. As an example, companies which manufacture a product has to pay employees, keep track of inventories, account for funds in payables and receivables, and so on. These are transaction support operations, and usually involve some kind of informal or formal information system. In larger companies, often a computer supports the information system&mdash;hence the term &ldquo;computerized&rdquo; or &ldquo;automated&rdquo; information system. With this support, of tentimes an information flow is not computerized.
CDC 6600/7600 optimization
Authors: Richard G. Zwakenberg
Venue: Proceedings of a symposium on Compiler optimization (1970)

Efficient use of the CDC 6600/7600 computers requires maximum utilization of the parallelism (6600/7600) and pipeline (7600) features of the functional units and the ability to perform iterative execution within a minimal number of machine words (6600/7600). Factors which must be taken into consideration when producing efficient object codes are: (1) The need for compression of code generated for loop structures, and (2) The criteria concerning instruction issue and execution times. The addition of an optimization pass to the LRLTRAN compiler has allowed the LRLTRAN language programmer to attain the maximum potential speeds of the 6600/7600 computers.
An extrapolation step-size monitor for solving ordinary differential equations
Authors: N. L. Schryer
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

A step-size monitor is presented for use in numerically solving ordinary differential equations by extrapolation methods. The monitor uses the information present in the extrapolation lozenge to determine the &ldquo;optimal&rdquo; step-size and order. This allows the monitor to adjust both the order and step-size to the local behavior of the solution in a reasonably &ldquo;optimal&rdquo; fashion. The monitor is particularly useful when obtaining low-precision solutions which require radical step-size changes. The results of this monitor are compared quite favorably with previous proposals.
Segmentation of Bangla Handwritten Text into Characters by Recursive Contour Following
Authors: A. Bishnu, B. B. Chaudhuri
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

Segmentation of handwritten words into characters is one of the important components in handwritten text OCR. In this paper we put forward a method for the segmentation of handwritten Bangla (an Indo-Bangladeshi language) text into characters. Based on certain characteristics of Bangla writing methods, different zones across the height of the word are detected. These zones provide certain structural information about the constituent characters of the respective word. In Bangla handwritten texts often there is overlap between rectangular hulls of successive characters. As such the characters are seldom vertically separable.So, we propose a method of recursive contour following in one of the zones across the height of the word to find out the extents within which the main portion of the character lies. If the successive characters are not touching in the zone of contour following, the algorithm gives fairly good results.
How Fast Should EFT Be Moving? (Panel Discussion)
Authors: Richard Collins, Arthur Hutt, Pender McCarter, Dan McCracken, George White
Venue: Proceedings of the 1978 annual conference (1978)

What are the concern of the computer professional as Electronic Funds Transfer Systems are designed and actually implemented? What should we be saying about the technical reliability of large-scale systems? What impact will these concerns have on the forthcoming systems from the commercial institution's points of view? From the merchants'? From the consumers'? What legislation can we expect to see addressing these questions?
An empirical methodology for writing user-friendly natural language computer applications
Authors: J. F. Kelley
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

A six-step, iterative, empirical, human factors design methodology was used to develop CAL,a natural language computer application to help computer-naive business professionals manage their personal calendars. Language is processed by a simple, non-parsing algorithm having limited storage requirements and a quick response time. CAL allows unconstrained English inputs from users with no training (except for a 5 minute introduction to the keyboard and display) and no manual (except for a two-page overview of the system). In a controlled test of performance, CAL correctly responded to between 86% and 97% of the inputs it received, according to various criteria. This research demonstrates that the methodological tools of the engineering psychologist can help build user-friendly software that accommodates the unruly language of computer-naive, first-time users by eliciting the cooperation of such users as partners in an iterative, empirical development process. The principal purpose of the research reported here was to design and test a systematic, empirical methodology for developing natural language computer applications. This paper describes that methodology and its successful use in the development of a natural language computer application: CAL,Calendar Access Language. The limited context or domain in which the application operates is the management of a personal calendar, or appointment book, data base by computer-naive business professionals.
Simulation of security returns for testing portfolio selection procedures
Authors: George M. Frankfurter, Herbert E. Phillips, John P. Seagle
Venue: Proceedings of the 5th conference on Winter simulation (1971)

Portfolio selection procedures typically require estimates of the means, variances, and covariances of returns from the securities. However, sampling error in these estimates is typically ignored. A model is presented to simulate returns that have a multivariate normal distribution, using a regression structure on a set of securities and holding the parameters constant.
Development of computing at Federal City College
Authors: Jesse J. Mayes
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

After joint discussions between the House and the Senate, a bill authorizing the creation of Federal City College (and the Washington Technical Institute) was signed into law in 1966 by President Lyndon B. Johnson as Public Law 89-791. The Federal City College Computer Center is organized as a consolidated center designed to support both academic and administrative data processing requirements of the College. The Center has chosen this organizational structure because it provides the College with the best cost effective means of providing a wide range of data processing services to all areas of the College. The management of one centralized Computer Center and its supporting staff obviates the necessity for the College to staff and support an array of decentralized computing staffs and facilities in each school.
Flowware&mdash;a flow charting procedure to describe digital networks
Authors: Wayne E. Omohundro, James H. Tracey
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

FLOWWARE is an interactive, graphical language to aid in the understanding and design of digital networks. The language is based upon the concept of flow charting. The user specifies the register layout of the network and the sequential operation in the form of a flow chart on a graphics terminal. The flow chart allows a user who is unfamiliar with the network to easily understand the function and operation of the network.
Complexity measurement of Electronic Switching System (ESS) software
Authors: David R. Gross, Mary A. King, Michael R. Murr, Michael R. Eddy
Venue: ACM SIGMETRICS Performance Evaluation Review (1982)

We have been developing a tool that measures the complexity of software: 1) to predict the quality of software products and 2) to allocate proportionally more testing resources to complex modules. The software being measured is real-time and controls telephone switching systems. This software system is large and its development is distributed over a period of several years, with each release providing enhancements and bug fixes. We have developed a two-stage tool consisting of a parser and an analyzer. The parser operates on the source code and produces operator, operand, and miscellaneous tables. These tables are then processed by an analyzer program that calculates the complexity measures. Changes for tuning our Halstead counting rules involve simple changes to the analyzer only. During the development there were problems and issues to be confronted dealing with static analysis and code metrics. These are also described in this paper. In several systems we found that more than 80% of software failures can be traced to only 20% of the modules in the system. The McCabe complexity and some of Halstead's metrics score higher than the count of executable statements in their correlations with field failures. It is reasonable to expect that we could devote more effort to the review and test of high-complexity modules and increase the quality of the software product that we send to the field.
Toward mechanical verification of properties of roundoff error propagation
Authors: Webb Miller
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

In this paper we will be concerned with portions of roundoff analysis which can be automated. Conditions are given under which proofs of numerical stability can be performed completely automatically and very economically (in particular, in polynomial time). We also discuss the use of &ldquo;numerical heuristics&rdquo; which apply &ldquo;hill-climbing&rdquo; methods to functionals measuring contamination from roundoff. In Section 2 we will relate this work to the extensive literature on roundoff error. Two properties of error propagation in straight-line programs are defined in Section 3, and their relationship demonstrated in Theorem 1. The properties are guaranteed to be effectively decidable since they can be formulated in the first-order theory of real-closed fields. In Section 4 we present sufficient conditions for the properties to hold; conditions which can be checked in time bounded by a polynomial in the size of the given straight-line program.
Consulting for microcomputers at the university of North Carolina at Chapel Hill
Authors: Margret Hazen
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Forty-two University of North Carolina at Chapel Hill faculty, administrators, and students who either had access to or owned microcomputers were surveyed with respect to their interests in the area of microcomputer usage. Almost all of those surveyed were Apple microcomputer users. They spanned a wide variety of departmental affiliations. Needs for additional information were categorized into four areas: 1) applications, 2) mainframe interfacing, 3) hardware, and 4) purchasing. The survey results are also discussed with respect to providing aid to these microcomputer users.
User-based integration software
Authors: John Fitch
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Algorithms are not the same as user software; which is like saying that pure mathematics is not the same as its application. In earlier algebra conferences Risch and Norman (1976) and Norman and Davenport (1979) have described a new method for symbolic indefinite integration. This paper is based on the work described there, but considers the process of turning this important area of algorithm research into a module for the REDUCE algebra system, in a form that can be used by the regular REDUCE user in the same way that he would differentiate or perform substitutions. The software package that is described is the Utah version (REDUCE INT) of the original Norman and Moore (1976)implementation. Rather than describe the method again, the paper concentrates on the software engineering and human engineering aspects of the package, and changes to the procedure that may not be mathematically justified but provide a powerful tool to the end user.
Terminal selection for an on-line hospital system
Authors: Walter L. Bennett
Venue: Proceedings of the 1969 24th national conference (1969)

A wide variety of communication terminals designed to meet the exacting requirements of a broad based information retrieval system are now on the market. Such was not the case a few short years ago. Their very number has compounded the task of selecting those best suited for use in an on-line hospital system. Unfortunately, there are no short cuts to a wise choice. A thorough systems study to gain an understanding of the hospital environment, system objectives, and communication requirements is a necessary precursor. It will be found that hospital system terminals must serve a wide range of uses, be readily available to those who need access to the system, and be accepted by users with divergent needs and capabilities. Fortified by the findings of the recommended Systems Approach, one can proceed with assurance to review specific offerings and reach a sound decision.
A first course on files
Authors: Freeman L. Moore
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

Students are exposed to various computer languages by means of introductory courses and texts. Often times, they do not have an adequate amount of time to become highly proficient in all aspects of a language. In the battle against time, often the material relating to file processing is omitted. This paper is about a course devoted entirely to file processing techniques as approached from several languages.
Logical design of a reliable transaction management in a distributed multiple processor system
Authors: Herbert Kuss
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The logical design of a reliable transaction management in a distributed multiple processor system is presented. A main characteristic of the system is that it realizes autonomous nodes. This has implications on the construction of the distributed data base management software. We discuss some construction problems and we provide the concept of guardian transaction managers for the implementation of transactions as atomic units of consistency and recovery.