ppxscal/embedding_network huggingface dataset:
Virtual machines and data security
Authors: C. R. Attanasio
Venue: Proceedings of the workshop on virtual computer systems (1973)

Our concern is the ability of the computing system to ensure that data under its control is accessed only in accordance with the explicit intention of the owner of the data, as expressed in the directory or access control table of the system. We intend to use VM/370 as the base system for a study of how the security of data may be compromised. Our goal for this study is to be better able to evaluate different types of hardware and software system architectures with regard to their ability to provide security.
Microcomputers for professional accountants
Authors: Clinton E. White,  Jr.
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

Introducing the microcomputer as an audit tool has profound implications for accounting educators, as well as, accounting professionals. Graduates from accounting programs must have basic microcomputing skills and a working knowledge of how to apply their accounting skills in microcomputer environments. Practicing accountants need to be educated in the use of the microcomputer as an audit tool in order to maintain their professional effectiveness. First, this paper is designed to present the results of an investigation into the current uses of the microcomputer as an audit tool; second, the author will discuss its future in the audit process; third, the author will outline the educational requirements for professional accountants; and finally, the author will discuss the implications for computing professionals involved with professional accountants.
On time hierarchies
Authors: W. J. Paul
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

For fixed k &ge; 2 we tighten the time hierarchy for k-tape Turing machines. Also for fixed k &ge; 2 we exhibit infinite hierarchies of languages recognizable by k-tape machines with increasing amount of time on the same amount of space.
On the recognition of information with a digital computer
Authors: Herbert T. Glantz
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

There exists a vast discrepancy in the power of discrimination exercised by a digital computer and in that of a human being. The recognition of information or data patterns is a simple task for the least experienced human clerk. Most people possess sufficiently sophisticated recognition capabilities so that a variation in the pattern of the data under scrutiny will not cause undue difficulty in the discrimination process. The recognition powers of a digital computer, however, are best demonstrated in an elementary table lookup operation, wherein the subject information is required to match exactly with a portion of the master list in order to be &ldquo;recognized&rdquo;. Machine recognition of data which is allowed to vary from the predetermined digital pattern is a vastly more complex problem. Since digital computers are inherently devices which are capable of only YES or NO answers, all MAYBE or PERHAPS responses are obtained only through painstaking effort. If the variations in the subject data are allowed a reasonable range in both position and type, there is no complete solution of the recognition problem available with present techniques and equipments. This paper will outline the general recognition problem in terms of a set of definitions and a mathematical model. I believe that a useful formulation of the problem, and a comprehension of the difficulties involved in discrimination, are prerequisites to any effort at obtaining a complete solution to the problem of data recognition.
Every poset has a good comparison
Authors: Jeff Kahn, Michael Saks
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We show that any finite partially ordered set P contains a pair of elements x and y such that the proportion of linear extensions of P in which x lies below y is between 3/11 and 8/11. A consequence is that the information-theoretic lower bound for sorting under partial information is tight up to a multiplicative constant. Precisely: if X is a totally ordered set about which we are given some partial information, and if e(X) is the number of total orderings of X compatible with this partial information, then it is possible to sort X using no more than c log2e(X) comparisons (c@@@@2.17).
SIAL/74 - an APLSV analog-logical block-diagram simulator
Authors: M. Alfonseca
Venue: Proceedings of seventh international conference on APL (1975)

SIAL/74 is an APL-based, block-oriented, analog-logical continuous simulation language, allowing block diagram simulations. 56 different blocks are recognized by the compiler, although new block types may be included at will. The SIAL/74 compiler is written in APLSV. The language is an extension of former versions,(SIAL/70, SIAL/71, SIAL/72), described elsewhere (refs. 1-4). The result of compilation is a pair of APL functions: the object program, and an initiator needed to assign initial values to several global variables.
Stopping rules for queueing simulations: Non independent tours
Authors: Irwin W. Kabak
Venue: Proceedings of the second conference on Applications of simulations (1968)

An ever present question in all simulations is &ldquo;Have enough trials been processed by the simulator?&rdquo; A usual stopping rule is: stop the simulation when the (theoretical) variance of the statistic that estimates the quantity of interest is within limits. However, there is an operational difficulty in the administration of this measure, i.e., because of the correlation of successive trials one cannot easily calculate the required variance. This is discussed in some detail by Hauser, et.al. [1]. In a previously published paper [2] a stopping rule for queueing simulations was presented. Therein, expressions for the calculation of the mean and variance of the estimate of interest were given. The expressions were based upon independent estimates of the quantities of interest. In this paper similar expressions are furnished for the case of non-independent estimates of the quantities of interest.
Computerized manufacturing systems: A need for integration
Authors: Richard J. Mayer, J. J. Talavage
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Computerized Manufacturing Systems have been developed in order to deal with the growing specialization of modern products. These systems provide a capability to economically produce small to medium quantities of a wide variety of parts which demand exacting tolerances. Through the minimization of human interactions, these systems have provided engineers with a much stronger influence on productivity, quality control, and reliability. The need to combine the flexibility and ease of set up of numerical controlled machining centers with the advantages of an automated transfer mechanism has given rise to one form of computerized manufacturing systems. One of these systems is of interest because of its ability to handle very large workpieces which must be machined to extremely close tolerances. This system was built by Sundstrand for operation at the Caterpillar Company in Peoria, Illinois.
An experimental MOS fault simulation program CSASIM
Authors: Masato Kawai John P. Hayes
Venue: Proceedings of the 21st Design Automation Conference (1984)

A prototype version of a new switch-level fault simulator for digital MOS IC's is described. The simulation program, which is called CSASIM, analyzes CSA (connector-switch-attenuator) circuit models using multiple logic values. A novel method of signal evaluation is employed, based on the super-position of bidirectional static and dynamic signals. CSASIM also allows efficient simulation of many different fault types, including stuck-at-constant, open-circuit, short-circuit, and delay faults. The internal structure and fault-simulation mechanisms of the simulator are discussed in this paper.
Hardware measurement device for IBM system/360 time sharing evaluation
Authors: Franklin D. Schulman
Venue: Proceedings of the 1967 22nd national conference (1967)

This paper describes the work, presently in process, for using a monitoring machine to evaluate the Model 67 Time Sharing System.
Software verification and validation in practice and theory (Position Statement)
Authors: Sabina H. Saib
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The techniques and tools that are available to the developer of practical software systems today are oriented towards the detection of errors in a test environment. That is, the software has been designed, coded, walked through, and tested by the designers, and is now to be subjected to outside verification and validation. Among the test tools that can be used to aid in the testing process are JAVS1, FAVS2, RXVP3, PACE4, and PET5.
Designing for usability&mdash;key principles and what designers think
Authors: John D. Gould, Clayton Lewis
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Any system designed for people to use should be (a) easy to learn; (b) useful, i.e., contain functions people really need in their work; (c) easy to use; and (d) pleasant to use. In this note we present theoretical considerations and empirical data relevant to attaining these goals. First, we mention four principles for system design which we believe are necessary to attain these goals; Then we present survey results that demonstrate that our principles are not really all that obvious, but just seem obvious once presented. The responses of designers suggest they may sometimes think they are doing what we recommend when in fact they are not. This is consistent with the experience that systems designers do not often recommend or use them themselves. We contrast some of these responses with what we have in mind in order to provide a more useful description of our principles. Lastly, we consider why this might be so. These sections are summaries of those in a longer paper to appear elsewhere (Gould Lewis, 1983). In that paper we elaborate on our four principles, showing how they form the basis for a general methodology of design, and we describe a successful example of using them in actual system design (IBM's Audio Distribution System).
A sensor-based programmed monitor system
Authors: G. J. Silverman, R. N. Sauer
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

The objective of this brief paper is to point out an often overlooked central issue facing the computer manager today and to suggest a comprehensive technique to improve management and utilization of large-scale computer systems. In the early days of computing the resources of a system could be measured in terms of a few hardware parameters such as memory size, speed of arithmetic and logical operations, and speed and complexity of I/O devices. Management was a matter of scheduling time for each user, often on a first come first served basis. This type of regime is still prevalent at smaller computer installations today. Larger installations, typically 360/65 and above running under OS/360, now use some form of multiprogramming to take advantage of hardware economies of scale with overlapped memory fetch, compute, and I/O operations. In the past, most of the cost of a computer installation was the CPU and core memory, while today it is the almost bewildering array of I/O devices.
An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits.
Authors: Krzysztof Kozminski, Edwin Kinnen
Venue: Proceedings of the 21st Design Automation Conference (1984)

An O(n2) algorithm for finding a rectangular dual of a planar triangulated graph is presented. In practice, almost linear running times have been observed. The algorithm is useful for solving area planning problems in VLSI IC design.
Architecture of a hardware data interpreter
Authors: Yaohan Chu
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

DATA INTERPRETATION REFERS TO THE EXECUTION OF THE DATA DECLARATIONS OF A HIGH-LEVEL PROGRAMMING LANGUAGE PROGRAM, WHICH DECLARE THE DATA TYPES AND THE DATA STRUCTURES IN THE PROGRAM. THIS PAPER PRESENTS A DATA INTERPRETER WITH A HIGH-LEVEL MEMORY STRUCTURE WHERE THE DATA IS STORED IN A RANDOM-ACCESS MEMORY, WHILE THE TYPE, STRUCTURAL, AND REFERENCING INFORMATION ABOUT THE DATA IS STORED IN AN ASSOCIATIVE MEMORY, WHEN THE HARDWARE DATA INTERPRETER SCANS THE DATA DECLARATION, IT MAKES ENTRIES INTO THE ASSOCIATIVE MEMORY. IT THEN INTERPRETS THE DATA WHEN THE DATA NAME IS REFERENCED. THE STORAGE STRUCTURES, CONTROL STRUCTURES, PROCESSORS AND DATA OPERATIONS OF THE HARDWARE DATA INTERPRETER ARE DESCRIBED. AN EXAMPLE OF INTERPRETING A STRUCTURE DATA DECLARATION IS USED TO ILLUSTRATE THE DATA INTERPRETER.
Computer-aided architectural design
Authors: Eric Teicholz
Venue: Proceedings of the 14th Design Automation Conference (1977)

There are two Computer courses currently given at the Graduate School of Design. One is a theory course and the second is a workshop. The workshop is primarily a &ldquo;hands-on&rdquo; graphic programming course using Harvard's PDP-10 computer and a variety of Tektronix CRT's and two 4051 micro-processors. The course teaches the fundamentals of computer, graphic programming (BASIC and FORTRAN), as well as computer graphic technology and how this technology is applied to architectural design. There is one two-hour lecture per week in which application areas are dealt with by explaining graphic data structures and the mathematics and algorithms that are used to support the particular application. There are also weekly meetings with tutors to work on individual problems. The other course is an introduction to systems and design methods using the computer to illustrate various algorithmic aspects of the design process. The course looks at design from a systems point of view and includes a basic introduction to systems, models, simulation and quantitative analysis applied to physical design. Comprehensive approaches to design and planning are described and illustrated using existing computer aided design models. There is a great deal of utilization of existing interactive graphic design programs to illustrate aspects of construction management, planning, architectural programming, space allocation, two and three dimensional graphics with hidden line solution and shading of surfaces.
Computer aided centrifugal pump design
Authors: Mordechai Meles
Venue: Proceedings of the 7th Design Automation Workshop (1970)

Present commercial turbomachinery design is based on past experience and trial and error methods and is a relatively slow process. Mathematically complete three dimensional solutions are not available yet. Approximate two dimensional solutions are limited to laboratory model study and are impractical for commercial application. To improve the present commercial design method and to increase the designer's independence, a computer program was developed. The program input can be varied from minimum customer specification (Head, capacity and RPM) to a large number of defined parameters. While present hand design time is measured in weeks, this program will accomplish the same task with a few three minute runs.
Integrated design
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

Matters of design, analysis and documentation of a Programming System are frequently ordered sequentially in time and distributed over independent groups of people. It is argued that, instead, these three aspects should be integrated into one production effort in which documentation is the primary issue. The language that is used for implementation must not dominate the description of the system because a system should not be defined and understood in terms of its implementation. Using such a language throughout documentation and design is on the one hand too restrictive because the language is bound to lack expressive power, but on the other hand it is too demanding because it forces to go into details that may be irrelevant for a description at hand.
An algorithmic approach to controlling search in three-dimensional image data
Authors: Mìchael L. Rhodes
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

In many three-dimensional imaging applications random shaped objects, reconstructed from serial sections, are isolated to display their overall structure in a single view. This paper presents an algorithm to control an ordered search strategy for locating all contours of random shaped objects intersected by a series of cross-section image planes. Classic search techniques in AI problem solving and software for image processing and computer graphics are combined here to aid program initialization and automate the search process thereafter. Using three-dimensional region growing, this method isolates all spatially connected pixels forming a structure's volume and enters image planes the least number of times to do so. An algorithmic description is given to generalize the process for controlling search in 3-D image data where little core memory is available. Phantom and medical computer tomographic data are used to illustrate the algorithm's performance.
A typesetting system for university computers
Authors: Stephen J. Rogowski
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

At SUNY Albany the computing center has developed a typesetting system whose major user is the university publications office. These people who have to turn out fancy brochures, catalogs, course lists and alumni directories need high quality printed material. Only recently have computer systems gained any respect for their ability to produce a quality printed product. The widespread use by publications people at our institution is a testament to the typographic quality of the system.
Computers in the study of learning: namer&mdash;A pattern-recognition system for generating sentences about relations between line drawings
Authors: D. L. Londe, R. F. Simmons
Venue: Proceedings of the 1965 20th national conference (1965)

THIS PAPER reports on a series of experimental programs which are used to recognize line drawings and the spatial relationships between them. At the pattern-recognition level the programs learn to associate a name with a generalized bit pattern representing a line drawing. At the relation-learning level, the programs abstract characteristics which relate to such spatial concepts as &ldquo;above,&rdquo; &ldquo;left,&rdquo; &ldquo;thicker than,&rdquo; etc. The names that have been learned in association with a drawing, and relation names which the program selects as true for the spatial relations between two drawings, are substituted into a simple generation grammar; variations of sentences that are true for the picture are then generated.
Validation of a queueing model with classes of customers
Authors: C. A. Rose
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

There have been many queueing models of computer systems published in the literature, but relatively few studies have appeared in which the models have been validated on actual systems. A procedure is described which permits an analyst to obtain values for the parameters of queueing models using measured statistics of operational computer systems. The particular model which was validated is the first queueing network model which will permit more than one class of customer. Partitioning a computer system environment into classes of timesharing and batch jobs appears to be useful, and the model was validated with these classes on an IBM 370/155-2 and an IBM 370/168.
MUSIM: Simulation of music composition using GASP
Authors: Alan C. Aho, Donald C. Lavoie, James N. Paprocki
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Most of the efforts at computer composition of music which we read about were either semi-random generation limited by parameters obtained through statistical analysis of previous works or based on the relatively straightforward (mathematically) twelve-tone system. It was our intent to create a fusion of these two methods. MUSIM combines semi-random generation with the harmonic rules of 19th century classical music in the hope of obtaining pleasing sounding music with enough surprises to keep it from becoming boring. Of course, this is also partially a function of the complexity of the rules you impose on the system. Our program is such that it could easily be adapted to twelve-tone composition rules.
Universal classes of hash functions (Extended Abstract)
Authors: J. Lawrence Carter, Mark N. Wegman
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

This paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of the sequence. The number of references to the data base required by the algorithm for any input is extremely close to the theoretical minimum for any possible hash function with randomly distributed inputs. We present three suitable classes of hash functions which also may be evaluated rapidly. The ability to analyze the cost of storage and retrieval without worrying about the distribution of the input allows as corollaries improvements on the bounds of several algorithms.
Changing role of the systems analyst
Authors: Hasan H. Sayani
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

The role of the systems analyst in the development of information systems has been changing. The reasons for this are numerous, and this paper attempts to identify these, and to project the future role of the analyst. The past, current, and future roles will be presented from the aspects of: scope of the systems analyst in the life cycle; the users; technology for constructing and analyzing requirements of information systems; and qualifications and roles of the systems analyst.
In-service education for teachers of computer science
Authors: Alyce Jackson
Venue: ACM SIGCUE Outlook (1976)

The kind of training needed for teachers of computer science in secondary education must reflect the trends in technological changes and curriculum innovations. Presented in this paper is a discussion of in-service education for teachers of computer,s cience based on the concept of computer literacy as a measurable criterion for accessing computer science objectives.