ppxscal/embedding_network huggingface dataset:
Directions in computer security
Authors: Anne-Marie G. Claybrook
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

One of the primary thrusts in operating system security has come from the Department of Defense (DoD), which early recognized the need for security controls in open use, multi-user, resource-shared computer systems.1 Two features in particular, mandatory access controls and security kernel technology, have been strongly promoted by the DoD. Mandatory access controls, necessary to support a security policy that cannot be circumvented by any user (in DoD's case, the national security policy regarding personnel clearances and data classifications) are being studied for their applicability to business2 and industry security problems. Security kernel technology is an implementation of the reference monitor concept, a security enforcement abstraction which views a computer system as composed of subjects (e.g., processes, users) and objects (e.g., files) and a reference monitor which checks each access by a subject to an object. In the past ten years, several attempts to build secure operating systems have utilized security kernel technology. While none of these attempts was practical from a performance point of view, the security kernel research still serves as a basis for current attempts to build secure systems. In a continuing effort to promote secure systems for DoD use, the DoD Computer Security Center was formed in 1981. One of the first tasks of the Center was to draft a &ldquo;Trusted Computer System Evaluation Criteria&rdquo; which defines various levels of protection for computer systems.3 In addition to listing feature requirements, including auditing, labelling, mandatory access controls, discretionary access controls, identification and authentication, the criteria discuss both the structure and development techniques used to produce trusted systems.
Design principles for human-computer interfaces
Authors: Donald A. Norman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

If the field of Human Factors in Computer Systems is to be a success it must develop design principles that are useful, principles that apply across a wide range of technologies. In the first part of this paper I discuss some the properties that useful principles should have. While I am at it, I warn of the dangers of the tar pits and the sirens of technology. We cannot avoid these dangers entirely, for were we to do so, we would fail to cope with the real problems and hazards of the field. The second part of the paper is intended to illustrate the first part through the example of tradeoff analysis. Any single design technique is apt to have its virtues along one dimension compensated by deficiencies along another. Tradeoff analysis provides a quantitative method of assessing tradeoff relations for two attributes xi and xj by first determining the User Satisfaction function for each, U(x), then showing how U(xi) trades off against U(xj). In general, the User Satisfaction for a system is given by the weighted sum of the User Satisfaction values for the attributes. The analysis is used to examine two different tradeoffs of information versus time and editor workspace versus menu size. Tradeoffs involving command languages versus menu-based systems, choices of names, and handheld computers versus workstations are examined briefly.
The ecology of change in a major computer conversion
Authors: C. Russell De Burlo,  Jr.
Venue: Proceedings of the third annual computer personnel research conference (1965)

One letter can transform a machine instruction, and in turn, the machine's action. Just as surely, the change of a letter, for example from a &ldquo;g&rdquo; to a &ldquo;c&rdquo; in &ldquo;change,&rdquo; would provide an entirely different meaning to the title of this paper. Such an exchange in letters would convert a deliberate action to a fortuitous action. In fact, when I received the program for our meeting and noted that I was to appear among so many highly skilled computer specialists, I was sure that chance was the appropriate noun. Surely, my presence must be a fortuitous action on someone's part, and I'm very pleased that it occurred. However, chance and luck have no place in a major conversion. Such conversion will be completed in a few months at Educational Testing Service. While many of you undoubtedly know about ETS, as we call the Educational Testing Service, I should like to present a brief overview of the organization.
CP-67 measurement and analysis overhead and throughput
Authors: Y. Bard
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

The performance of a complex time sharing system was monitored under actual operating conditions during a period in which changes in system configuration (both hardware and software) took place. Various techniques for assessing the impact of those changes on performance are discussed.
Some unexpected expected behavior results for bin packing
Authors: J. L. Bentley, D. S. Johnson, F. T. Leighton, C. C. McGeoch, L. A. McGeoch
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We study the asymptotic expected behavior of the First Fit and First Fit Decreasing bin packing algorithms applied to items chosen uniformly from the interval (0,u], u &le; 1. Our results indicate that the algorithms perform even better than previously expected.
SNATCH opens manufacturers' networks through gateways
Authors: D. Einert, G. Glas
Venue: Proceedings of the seventh symposium on Data communications (1981)

At the present manufacturers' network architectures do not provide co-operation between systems exceeding the boundaries of their own homogeneous networks, i.e. open systems as defined the ISO Reference Model of Open Systems Inter-connection do not yet exist. Project SNATCH shows to open the closed network architectures of two important computer manufacturers by means of gateway system. Mapping the manufacturers protocols onto neutral protocols and vice versa, gateway system acts as a channel between the closed manufacturers' networks. Since this solution is in principle not restricted to systems of only two manufacturers, SNATCH points out a practicable way to a generally open system.
Using a preprocessor to implement a data manipulation language for a minicomputer data base system
Authors: F. J. Polster
Venue: ACM SIGMINI Newsletter (1978)

This paper reports on the implementation of a powerful data manipulation language (DML) of a data base system for minicomputers. The technique of language preprocessing is employed: The preprocessor translates each DML-statement into an internal form; however, in addition to a mere translation of statements the preprocessor has the function of executing so called 'compile-time tasks', i.e. those subtasks of the evaluation of a DML-statement, which can be done at compile-time already. This processing takes place in the course of program compilation and thus the size of the run-time module as well as execution-times can be reduced. The data base system FADABS is used to illustrate this approach.
Computer aided input/output for use with the finite element method of structural analysis
Authors: Robert D. Rockwell, Daniel S. Pincus
Venue: Proceedings of the 7th Design Automation Workshop (1970)

The enormous computational ability of modern computers has encouraged development of the finite element method of structural analysis. However, preparing the large amount of input data and interpreting the large amount of output data generated by the analysis can be very time consuming and costly. For this reason, the computer programs IDLZ and &Oslash;SPL were developed. IDLZ divides a plane surface into triangular elements and generates required input data for the analysis program. &Oslash;SPL plots the output data in a form which can be quickly interpreted by the analyst. These two computer aids to input/output are the subject of this paper.
The architecture of the Eden system
Authors: Edward D. Lazowska, Henry M. Levy, Guy T. Almes, Michael J. Fischer, Robert J. Fowler, Stephen C. Vestal
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

The University of Washington's Eden project is a five-year research effort to design, build and use an &ldquo;integrated distributed&rdquo; computing environment. The underlying philosophy of Eden involves a fresh approach to the tension between these two adjectives. In briefest form, Eden attempts to support both good personal computing and good multi-user integration by combining a node machine / local network hardware base with a software environment that encourages a high degree of sharing and cooperation among its users. The hardware architecture of Eden involves an Ethernet local area network interconnecting a number of node machines with bit-map displays, based upon the Intel iAPX 432 processor. The software architecture is object-based, allowing each user access to the information and resources of the entire system through a simple interface. This paper states the philosophy and goals of Eden, describes the programming methodology that we have chosen to support, and discusses the hardware and kernel architecture of the system.
Computer Science And Statistics
Authors: E. L. Battiste
Venue: Proceedings of the 1978 annual conference (1978)

This paper develops a theme about a specific, small part of the interface between computer science and statistics - that of kernels of computation. Currently, because of an impending technology revolution, it is important that statisticians and numerical mathematicians take interest in this field. General discussion on the broad interface problem is reviewed in the Appendix.
A general result on infinite trees and its applications
Authors: David Harel
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

A generic translation between various kinds of recursive trees is presented. It is shown that trees of either finite or countably-infinite branching can be effectively put into one-one correspondence with infinitely-branching trees in such a way that the infinite paths of the latter correspond to the &ldquo;@@@@-abiding&rdquo; infinite paths of the former. Here @@@@ an be any member of a very wide class of properties of infinite paths. Two of the applications involve the formulation of large classes of &pgr;11 variants of classical computational problems, and the existence of a general method for proving termination of nondeterministic or concurrent programs under any reasonable notion of fairness.
Time shared computer simulation of a simplified single color lithographic press
Authors: Jerome A. Doutriaux
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

A simulation of a simplified lithographic press is presented. Developed and tested with the help of experienced Pressmen of the graphic Arts Technical Foundation, Pittsburgh, Pennsylvania, the simulated press can be used to train novice operators, as a simulator for development of better controls for the real printing press, or as a first step towards a more comprehensive model.
The message is the medium: Multiprocess structuring of an interactive paint program
Authors: Richard J. Beach, John C. Beatty, Kellogg S. Booth, Darlene A. Plebon, Eugene L. Fiume
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

An innovative design for an interactive paint program has been developed based on multiple processes and message passing. Traditional paint programs combine interrupt-driven support of a graphical input device, such as a mouse or tablet, with the coloring of pixels in a raster display. We advocate a different design methodology which is illustrated in our implementation. The multiple processes and message passing primitives provided by some real-time operating systems encourage the design of parallel-program architectures and anthropomorphic programming structures, analogous to artist procedures and the metaphors of Smalltalk. The Thoth operating system was used to experiment with such an anthropomorphic design. Thoth provides a hospitable environment in which to investigate the distribution of algorithms between software and microprogrammed hardware processes, the performance and responsiveness of a multiple-process interactive program, and experimental user interfaces using an Ikonas 3000 frame buffer. The paint program consists of processes which handle the graphics tablet, track an iconic cursor, paint a selection of brushes, fill regions of the image, draw lines, and implement the user interface. Some processes have been implemented both in software and microcode.
Dialogue management in the personal sequential inference machine (PSI)
Authors: Junichiro Tsuji, Yutaka Iima, Satoshi Tojo, Shoji Enomoto
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

PSI (Personal Sequential Inference Machine) is being developed as a research tool for the FGCS (Fifth Generation Computer Systems) project, and SIMPOS (Sequential Inference Machine's Programming and Operating System) is also under development. In this paper, we present the dialogue management component of SIMPOS. We describe and discuss the background, design, implementation, and future at our work. The window system and the Coordinator, along with the bitmapped display and mouse cursor controls, are the primary means of managing the dialogue between the user and SIMPOS. We assume the users of PSI to be computer professionals, and dialogue management is being designed accordingly. High performance, low overhead, and allowances for customization and expansion are among our design and implementation goals. The entire system is implemented in ESP (Extended Self-contained Prolog), an enhanced logic programming language incorporating an object/class methodology similar to that of Smalltalk-80.
Experiences in the development of mathematical software for small computers
Authors: J. C. Nash
Venue: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment (1976)

Personal experiences are reported of the difficulties and the successes associated with attempts to develop mathematical software for small computers. Examples are used to illustrate the process of algorithm selection and program &ldquo;squeezing.&rdquo; Some unforeseen advantages of the resulting programs are mentioned.
What Employers Look For In Hiring Computer Science Graduates (Panel Discussion)
Authors: John N. Shoosmith
Venue: Proceedings of the 1978 annual conference (1978)

The Langley Research Center is located in Hampton, Virginia. It is one of nine field centers of the National Aeronautics and Space Administration and has a charter for conducting basic and applied research in the aeronautical and space sciences. Current areas of emphasis include long haul aircraft technology; acoustics and aircraft noise reduction; aircraft avionics; general aviation technology; aerospace structures; environmental quality research and monitoring; and advanced space vehicle technology. Computers have a prominent role in the work of the center. In addition to the usual administrative computers and many special purpose computers associated with research and test facilities, Langley has a central scientific computer facility consisting of eight large scale Control Data computers including a STAR-100 (capable of operating at a peak rate of 100 million operations per second in the vector mode). This complex also includes a number of specialized subsystems and a network of terminals. It is used for analytical and design studies, real-time simulation of flight systems, the reduction of test data, and the development of flight software. In summary, we would tend to employ graduates of a &ldquo;computer engineering&rdquo; curriculum or a computer science curriculum which is administrated by an engineering school rather than a shcool of arts and sciences. We would require a knowledge of basic computer hardware, architecture, computer languages, computer operating systems, programming techniques, data management, numerical methods, and basic graphics. In addition, we would require applied mathematics through differential equations, fundamental physics and chemistry, and finally sufficient command of English composition to write a high quality technical report.
Software engineering-as it is
Authors: Barry W. Boehm
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper presents a view of software engineering as it is in 1979. It discusses current software engineering practice with respect to lessons learned in the past few years, and concludes that the lessons are currently not heeded roughly half of the time. The paper discusses some of the factors which may account for this lag, including rapid technological change, education shortfalls, technology transfer inhibitions, resistance to disciplined methods, inappropriate role models, and a restricted view of software engineering. The paper also updates a 1976 state of the art survey of software engineering technology, including such topics as requirements and specifications, design, programming, verification and validation, maintenance, software psychology, and software economics. It concludes that the field is making solid progress, but that it is growing more complex at a faster rate than we can put it in order.
Ray tracing algebraic surfaces
Authors: Pat Hanrahan
Venue: Proceedings of the 10th annual conference on Computer graphics and interactive techniques (1983)

Many interesting surfaces can be written as polynomial functions of the spatial coordinates, often of low degree. We present a method based on a ray casting algorithm, extended to work in more than three dimensions, to produce pictures of these surfaces. The method uses a symbolic algebra system to automatically derive the equation of intersection between the ray and the surface and then solves this equation using an exact polynomial root finding algorithm. Included are illustrations of the cusp catastrophe surface, and two unusually shaped quartic surfaces, Kummer's quadruple and Steiner's surface.
A low cost, transportable, data management system for LSI/VLSI design
Authors: David C. Smith, Barry S. Wagner
Venue: Proceedings of the 19th Design Automation Conference (1982)

The philosophy, structure, and design of a data-management system that is applicable to a wide range of organizational environments - from production groups to research and development groups - are introduced and discussed. The system is in operation in two locations and has been used to design numerous LSI/VLSI chips. This low cost system is transportable, extendable, and suitable for use by designers having a diversity of CAD-related skill levels. User reaction to the system and future plans are discussed.
On the effectiveness of buffered and multiple arm disks
Authors: Alan Jay Smith
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Access patterns to input/output files are usually sequential and local; a small number of files are open for each job and the file is generally read or written sequentially. This implies that if files are allocated in contiguous disk storage, the disk arms will rarely be required to move. Disk seeks can be almost entirely eliminated by using multiple arms, whereby if there are several open files on a given spindle, there will be an arm for each. Even better results can be obtained by using electronic storage such as magnetic bubbles, CCD's or electron beam memories to buffer portions of the disk. Such buffers not only eliminate seek time but reduce rotational latency to negligible amounts and decrease transfer time. We study, using trace driven simulation, the effectiveness of both buffers and multiple arms. For the data used, our experiments show that a minimum total buffer capacity of 20 tracks is required in a buffered disk. Best hit ratio results are obtained with individual buffer sizes upwards of one quarter cylinder. Three cylinder size buffers give very high hit ratios, on the order of 96%, and this appears to be a good choice for buffer size and number. LRU buffer scheduling is found to work well; comparisons with optimal, look-ahead buffer scheduling are made. Some possible models for the frequency of seeks are briefly considered.
Experimental mathematics using APL and graphics
Authors: Charles Haspel, Alphonse Vasquez
Venue: Proceedings of the international conference on APL (1982)

Mathematics is ordinarily done by examining computations to extract likely conjectures. Only later are the conjectures proved, and, in traditional practice, the computations and motivations suppressed. We describe a computational investigation of the geometry of fundamental domains and units in totally real algebraic number fields. Our approach requires the finding of convex hulls in three dimensional space and their display and manipulation. APL and graphics are used for this purpose and appear to be essential for any practical pursuit of this approach. This paper presents a definition of the problem, an example solution including drawings and portions of the APL code, and a sample of the results so far obtained. In addition, lessons learned from our own mistakes and fumblings are drawn to help and encourage other experimental mathematics explorations.
A multi-microprocessor computer system architecture
Authors: Bruce W. Arden, Alan D. Berenbaum
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

The development of microprocessors has suggested the design of distributed processing and multiprocessing computer architectures. A computer system design incorporating these ideas is proposed, along with its impact on memory management and process control aspects of the system's operating system. The key design feature is to identify system processes with microprocessors and interconnect them in a hierarchy constructed to minimize intercommunication requirements.
Modeling a new technique for accessing shared buses
Authors: P. V. Afshari, S. C. Bruell, R. Y. Kain
Venue: Proceedings of the Computer Network Performance Symposium (1982)

Consider a queueing system in which customers (or jobs) arrive to one of Q separate queues to await service from one of S identical servers (Figure 1). Once a job enters a queue it does not leave that queue until it has been selected for service. Any server can serve any job from any queue. A job selected for service cannot be preempted. In this paper we consider jobs to be in a single class; for the multiple class result see [AFSH81a]. We assume once a queue has been selected, job scheduling from that queue is fair. In particular, our results hold for first come first serve as well as random selection [SPIR79] and, for that matter, any fair nonpreemptive scheduling policy within a queue. We assume that arrivals to each queue follow a Poisson process with the mean arrival rate to queue q being &lgr;q. The S identical exponential servers are each processing work at a mean rate of &mgr;. This system is general enough to be adaptable for modeling many different applications. By choosing the policy employed for queue selection by the servers, we can model multiplexers, channels, remote job entry stations, certain types of communication processors embedded in communication networks, and sets of shared buses. In this paper we will use the latter application to discuss a realistic situation. The elements (&ldquo;jobs&rdquo;) in the queues are messages to be sent from modules connected to the shared bus of the system. The servers are the buses; their service times are equal to the message transmission times. The queues are in the interface modules connected to and sharing the buses.