ppxscal/embedding_network huggingface dataset:
A spectral based technique for generating confidence intervals from simulation outputs
Authors: T. L. Moeller, P. D. Welch
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

A technique for generating confidence intervals on the common expectation of a sequence of correlated random variables is developed. The sequence is modelled as a covariance stationary process. In this situation the variance of the sample mean is proportional to the variance spectrum at zero frequency. This value of the spectrum is estimated by fitting a low order polynomial to the sample spectrum (periodogram) in the lower frequency region. The technique is applicable to both individual observations and batched data. Experimental results comparing it with the method of batch means are given for the steady state waiting time of the M/M/1 queue. The proposed technique gives valid confidence intervals of approximately the same average width as the method of batch means when the batch size is large enough for that method to be valid. It continues to give valid confidence intervals when the batch sizes are such that the method of batch means breaks down.
Speakeasy linkules - plug compatible software
Authors: Stan Cohen
Venue: Proceedings of the 1977 annual conference (1977)

A universal computer language must be able to evolve to satisfy the needs of its current and future users. This paper describes such a language, called Speakeasy. The paper emphasizes those features of Speakeasy that relate to its naturalness and to its extensibility. Extensibility in the Speakeasy sense means the ability to bring diverse sets of routines under the umbrella of the system and thus make them available to users. Interfacing a routine through the construction of a linkable module, called a linkule, extends the capabilities of Speakeasy in a general and unrestricted way. The concept of the linkule is explained and illustrated by examples. In order to provide some background a few illustrative examples of the Speakeasy language are given.
Simulation of a probabilistic scene editing strategy for the Landsat system
Authors: Larry Alexander
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

A probabilistic scene editing strategy for the Landsat D* system is designed and its performance simulated. Results indicate a large reduction in data processed is possible while still allowing for acquisition of the most valuable scenes and satisfaction of the assumed set of operational acquisition goals. * Since the submission of this paper, it has been decided by NASA that Landsat D would not be an operational system. Therefore, where the text indicates &ldquo;Landsat D&rdquo;, please assume &ldquo;Operational Landsat system.&rdquo;
Learning-based hand sign recognition using SHOSLIF-M
Authors: Yuntao Cui, D. L. Swets, J. J. Weng
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We present a self-organizing framework called the SHOSLIF-M for learning and recognizing spatiotemporal events (or patterns) from intensity image sequences. The proposed framework consists of a multiclass, multivariate discriminant analysis to automatically select the most discriminating features (MDF), a space partition tree to achieve a logarithmic retrieval time complexity for a database of n items, and a general interpolation scheme to do view inference and generalization in the MDF space based on a small number of training samples. The system is tested to recognize 28 different hand signs. The experimental results show that the learned system can achieve a 96% recognition rate for test sequences that have not been used in the training phase.
Associative mass storage for database
Authors: G. Wolf
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

Two types of associative mass storage for use in database systems, have been introduced in this paper, they are I Hybrid associative storage For use as an associative primary storage, it comprise a storing &ldquo;basement&rdquo; and an associative surface matrix. The suggested configuration has a capacity of up to 64 megabytes and a search rate of the order of 2 to 8 gigabytes per second. As well as associative operation, it is also suitable for extremely fast sorting. II Hardware hash coding system A hardware structure provides associative access to conventional, numerically addressed storage media. The prefered application is for quasi-associative access to data in secondary storages. Associative mass storages systems differ in their characteristics and complement each other. Together they form the hardware building blocks of a database system.
Several approaches for improving user cordiality in the design of on-line systems for novice uses
Authors: Sandy E. Selander
Venue: Proceedings of the eighteenth annual computer personnel research conference (1981)

This paper presents several factors to be considered when designing a notice user-machine interface for an on-line system. These include user objectives, current procedures for processing the data, tutorial aids, data base organization and human factors issues related to ease of terminal use. Various examples from recent experience are given to illustrate some of these points.
Decisive venn diagrams
Authors: George Epstein
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The use of Venn diagrams as a pictorial aid in representing Boolean functions is well known. For n variables, 2n regions are pictured, each of which can assume one of two possible values. Such representations aid in the simplification or identification of Boolean functions, as do Karnaugh maps and other kinds of pictorial aids which are in current use. Attempts to modify these 2-valued Venn diagrams are generally based upon approaches which either (1) change the number of values which can be assumed in each region, or (2) change the number of regions themselves. Decisive Venn diagrams fall into this latter class, where the number of regions can be changed but only 2 values can be assumed in each region. These diagrams are referred to as decisive, after a similar usage by N. Rescher for truth tables [p. 61, 14].
MANIAC
Authors: Howard B. Demuth, John B. Jackson, Edmund Klein, N. Metropolis, Walter Orvedahl, James H. Richardson
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

The MANIAC is a general purpose, electronic, digital computer which has been designed and constructed at the Los Alamos Scientific Laboratory. The construction period dates from June of 1949 to March of 1952, when the first major problem was run. Originally, the intention was to reproduce the computer which was then under development at the Institute for Advanced Study in Princeton, New Jersey.1 However, it soon became clear that the central problem in computer research &mdash; a suitable storage system &mdash; was a major one, and it seemed advisable to try a separate approach to that solution. Eventually this supplementary development was extended to the other components. Before proceeding with this report, we would like to express our gratitude to Professor John von Neumann and his colleagues at the computer project at the Institute for Advanced Study for the many fruitful and stimulating discussions dating from 1944.
Command use and interface design
Authors: Robert E. Kraut, Stephen J. Hanson, James M. Farber
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Designing a human interface to a computer system is more art than science. Systematic research on the human interface to computer systems, when it is performed, is generally an after-the-fact evaluation of an almost finished product. This sort of evaluation is often too specific to a particular product to provide general prescriptions for future interface design and often occurs too late to have a substantial impact on product development. Rarely do research and evaluation provide guidance throughout the development cycle. We propose that an examination of people's natural use of already existing computer systems, using research methods adopted from studies of social behavior (e.g., Kraut Johnston, 1982; Hooff, 1982) will provide a richer source of information for guiding development. A multivariate examination of naturally occurring human-computer interaction may provide insights into its complex structure in ways that are denied to more experimentally oriented, human-factors research.
Micro-computer oriented algorithms for delay evaluation of MOS gates
Authors: D. Etiemble, V. Adeline, Nguyen H. Duyet, J. C. Ballegeer
Venue: Proceedings of the 21st Design Automation Conference (1984)

We present microcomputer-oriented algorithms to calculate very quickly the switching times and propagation delays of basic CMOS and NMOS gates. The results show less than 10% difference with model 1 SPICE 2-G results.
A vertically organized computer-aided design data base
Authors: Kenneth A. Roberts, Thomas E. Baker, David H. Jerome
Venue: Proceedings of the 18th Design Automation Conference (1981)

GTE Laboratories is developing a new CAD data base to support the design of integrated circuits and printed circuit boards. In designing the data base around a commercial DBMS with the intention of taking advantage of the useful features in such systems, several major problems have been encountered. The authors discuss those features of the new data base, including a novel data organization, which address these problems while satisfying the objective of providing full data management support for CAD.
Special purpose automatic programming for hidden surface elimination
Authors: Chris Goad
Venue: ACM SIGGRAPH Computer Graphics (1982)

In many applications of three dimensional computer graphics, the appearance of the same scene must be computed repeatedly for many different positions of the viewer. This paper concerns a scheme for exploiting this property of an application for the purpose of improving the efficiency of the hidden surface computation. The scheme involves a kind of automatic programming: for each scene to be considered, a different special purpose program is automatically constructed. The special purpose program then takes the position of the viewer as input, and generates a suitable description of the scene with hidden surfaces removed as output. Since the special purpose program has a very limited task to perform - it is adapted to handling just one scene - it can be much faster than any general purpose algorithm would be for the same scene. The paper describes a method by which special purpose programs for hidden surface elimination can be constructed in a fully automatic manner. The method has been implemented, and results of experiments are given.
The schuss filter: A processor for non-numerical data processing.
Authors: R. Gonzalez-Rubio, J. Rohmer, D. Terral
Venue: ACM SIGARCH Computer Architecture News (1984)

This paper describes the basic principles, the architecture and the applications of a processor called the SCHUSS filter*. The SCHUSS filter can be seen as a device with two inputs and one output; the first input is the filtering criterion (a program); the second input is the data to be filtered (in a sequential way). The output is the data which fulfills the filter criterion. Under the architectural point of view the SCHUSS filter can be seen as a specialized processor (in filtering) but also as a general purpose processor. Working as a specialized processor, it can process &ldquo;on the fly&rdquo; data coming from a disk where &ldquo;on the fly&rdquo; means at the normal disk transfer rate. Even if now disk transfers rates are up to 3 Mbyte/sec SCHUSS can execute searches of reasonable complexity in one pass. The idea is to off-load the host processor of search tasks and other kinds of processing.
Intercalation theorems for tree transducer languages
Authors: C. Raymond Perrault
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

We develop intercalation lemmas for the computations of the top-down tree transducers defined by Rounds [15] and Thatcher [17]. These lemmas are used to prove necessary conditions for languages all of whose strings are of exponential length to be tree transducer languages. The language {ww:w&egr;{a,b}*, &brvbar;w&brvbar;&equil;2n,n&ge;0}, which is generable by the composition of two transducers, is shown not to be generable by one. The proof technique applies to bottom-up transducers as well. The results are related to some subclasses of Woods' Augmented Transition Networks [18] characterized elsewhere in terms of tree transducer languages [14].
The design of a mass memory for a database computer
Authors: Krishnamurthi Kannan
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

The design of a mass memory for a database computer (DBC) is described. The DBC, a specialized back-end computer, is capable of managing 10**9 to 10**10 bytes of data and can support multiple data models with minimal software in the front-end computer. The design is based on moving-head disk technology which is perceived to be the most cost-effective technology for supporting such large volumes of on-line data. The design calls for certain key modifications in existing modes of disk component usage in an effort to incorporate a high degree of intelligence in the device and to enhance its throughput. These modifications pertain to activating concurrently all of the read/write heads available on an access mechanism and to the processing of data on-the-fly by associating a processing element with each read/write head.
Third time charm: Stronger prediction of programmer performance by software complexity metrics
Authors: Bill Curtis, Sylvia B. Sheppard, Phil Milliman
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This experiment is the third in a series investigating characteristics of software which are related to its psychological complexity. A major focus of this research has been to validate the use of software complexity metrics for predicting programmer performance. In this experiment we improved experimental procedures which produced only modest results in the previous two studies. The experimental task required 54 experienced Fortran programmers to locate a single bug in each of three programs. Performance was measured by the time to locate and successfully correct the bug. Much stronger results were obtained than in earlier studies. Halstead's E proved to be the best predictor of performance, followed by McCabe's v (G) and the number of lines of code.
An empirically based-investigation of job-shop sequencing
Authors: James C. Hershauer
Venue: Proceedings of the 5th conference on Winter simulation (1971)

An empirically-derived job-shop simulation model is the heart of the study. This provides the opportunity to explore some techniques not normally applicable in hypothetical job-shop simulation models. First, the model is designed to include the essential characteristics of an actual sequencing environment. Second, internal consistency and representativeness are checked by comparing simulated with actual performance. Third, a &ldquo;protocol&rdquo; of a manager's decision process is used in the development of a general priority function in contrast to &ldquo;piece-meal&rdquo; rules. Fourth, sequencing rules are screened initially for practicability as defined by a shop manager. Fifth, a total relevant cost function is developed based upon actual shop costs. Finally, computer simulation results are reported concerning the nature of practicable rules and &ldquo;best&rdquo; rules.
Interactive instruction simulation on and of the Datapoint 2200 computer
Authors: Paul F. Huebner, Daniel T. Skelton, Earl J. Schweppe
Venue: Proceedings of the ACM annual conference (1973)

An interactive simulation of the execution of mnemonically entered instructions for the Datapoint 2200 Computer has been developed which runs on this same machine. A representation of the registers, flip-flops, program counter, subroutine stack, and referenced memory cell is show on the display of the machine. Individual mnemonic instructions may be entered from the keyboard and are shown on the display in standard assembly source language except that instructions may not be labelled. Both the instructions and their operands are syntactically checked character-by-character as they are entered and all illegal entries are refused. The simulator displays the corresponding octal form of these instructions and modifies the representation of the state of the machine accordingly. Short programs of such instructions may be entered and normal sequential execution simulated, Experience indicates that such simulators can provide an easy means of learning the computer organization, mnemonic instructions, and program execution of a computer. They can be especially helpful in demonstrating the dynamics of recursive subroutine calls and push-down stacks.
SMS 101 - A structuredmultimicroprocessor system with deadlock-free operation scheme
Authors: Ch. Kuznia, R. Kober, H. Kopp
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

The presented multimicroprocessor system has been designed to treat certain problem classes such as large systems of differential equations or online process control. It consists of a main processor and an arbitrary number of modules, each with a microprocessor, a private memory and a communication memory. The most characteristic features of the SMS 101 organization are: - a phase structured interaction scheme (PSI-Scheme) which simplifies organizational problems - a data communication concept, that replaces common memory by simultaneously storing data in distributed memories. A first realization of the system comprises eight modules, but the organization allows an extension up to several hundreds of modules. Thus with present day technology a computing capacity can be achieved which is 2 or 3 magnitudes higher than that of conventional computers.
Computer-aided logic design on the TX-2 computer
Authors: G. D. Hornbuckle, E. L. Thomas, R. N. Spann, R. J. Diephuis
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

A set of programs has been developed to aid in the design, testing, and documenting of logic circuits. The user can input logic descriptions by freehand sketching logic diagrams, or he can enter gate connectivity descriptions via a keyboard. Both input forms are then transformed into an internal data structure which can serve as input to logic simulation and test generation programs. Good documentation is encouraged by permitting easy editing and updating of drawings with a TX-2 graphics console which consists of a conventional oscilloscope and an input tablet. A Lincolnwriter is available for typed input and output.
Evaluating introductory programming textbooks: A guide for students, instructors, authors and publishers
Authors: Ben Shneiderman
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

My father counseled me not to give advice to others. Inspite of that admonition, I have an irrepressible desire to make some highly subjective, potentially pompous remarks about introductory programming language textbooks. During the past nine years I have evaluated dozens of manuscripts for eight publishers and hundreds of books for teaching term-length introductory courses in FORTRAN, BASIC, PL/I, PASCAL, COBOL and assembly languages. I have co-authored two FORTRAN texts and developed two independent study guides to programming. Each time I see a text, I make judgments by reacting to the material, rather than by comparing the material to a pre-determined set of criteria. In order to provide a &ldquo;structured&rdquo; review process (no computer-science oriented paper is complete without a reference to &ldquo;structure&rdquo;), I offer the following criteria for evaluating texts. This list is far from complete, but it is a beginning.
Experiences with hipo and other documentation techniques(Tutorial and Panel Discussion)
Authors: Julia Van Duyn
Venue: Proceedings of the 1975 annual conference (1975)

EDP professionals are becoming increasingly concerned with documentation - both in large and small facilities - and problems which are caused by poor or zero documentation. Several techniques are currently available that effect more efficient if not easier documentation of systems, programming, operations and procedures. Within the framework of the presentation and the following panel discussion some of these techniques - HIPO, WYLBUR, and word processing - will be described, clarified, and critiqued. The following pages offer a summary of the presentation and the specific viewpoint each of the panelists will present and discuss.
Communication skills required by computer professionals
Authors: Norman Enger
Venue: Proceedings of the eighteenth annual computer personnel research conference (1981)

Computer professionals usually have technical backgrounds that concentrate on information systems and computer science courses. These courses primarily emphasize the use of various technologies to implement automated systems. This emphasis often neglects the teaching of interpersonal communication skills and understanding of human factors as they relate to the design and implementation of computer-based information systems. The computer professional usually needs these neglected communication skills to successfully implement integrated information systems.
A new aspect of Some Post algebras
Authors: Serge Perrine
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

Some Post algebras are nothing but commutative unitary algebras L over a finite field K where Fermat theorem holds in L.
An airline-industry database
Authors: N. L. Ensenat, G. S. Rosen, F. F. Speckman
Venue: ACM SIGAPL APL Quote Quad (1979)

This paper describes the successful implementation of a high-visibility APL application and demonstrates the utility of APL in conjunction with other software systems for large database applications.
Simulation of a criminal justice system model
Authors: John L. Ballard, David E. Douglas
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

This paper presents a simulation model of a criminal justice system. The model is written in GPSS and is a general model that can be adapted to a specific criminal justice system by modifying the model parameters. A flow chart of the system and a block diagram of the model are included.
A structured language for CAD of digital systems
Authors: Anshul Kumar, P. C.P. Bhatt
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

We present a language RACHNA, which in our opinion, can form the basis of a CAD system. In RACHNA various hardware features like - asynchronism, parallelism, pipelining, timing and delays etc. can be described in a procedural frame-work. A number of control constructs have been provided, which can be suitably nested. It allows a designer to include structural information also, giving him a better control over the final hardware realization. A design can be evolved in a top-down manner by defining subsystems as Processes, Modules and Functions. RACHNA is associated with an interpreted graph model, which defines its semantics and is useful for simulation and logic synthesis.
An implementation of microdiagnostics on the ECLIPSE&reg; MV/8000
Authors: Paul Reilly, Elizabeth Shanahan, Steven Staudaher
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

The effectiveness of using a microcoded Independent Diagnostic Instruction Set for the development, manufacturing and field support of the 32-bit ECLIPSE&reg; MV/8000 data processing system is demonstrated. A separate Diagnostic Processor with a simple operating system and microcode debugging facility is used to aid in this task.