ppxscal/embedding_network huggingface dataset:
A comment on the confinement problem
Authors: Steven B. Lipner
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

The confinement problem, as identified by Lampson, is the problem of assuring that a borrowed program does not steal for its author information that it processes for a borrower. An approach to proving that an operating system enforces confinement, by preventing borrowed programs from writing information in storage in violation of a formally stated security policy, is presented. The confinement problem presented by the possibility that a borrowed program will modulate its resource usage to transmit information to its author is also considered. This problem is manifest by covert channels associated with the perception of time by the program and its author; a scheme for closing such channels is suggested. The practical implications of the scheme are discussed.
A neurologic diagnostic model of the human brain
Authors: Grace M. Hucko, W. D. Hagamen
Venue: Proceedings of the international conference on APL: part 1 (1979)

This paper describes an interactive system written in APL designed to diagnose focal lesions of the brain. It uses essentially the same method we teach to medical students. First a patient's signs and symptoms are mapped onto a visual, three-dimensional representation of the brain. Then the selection of the correct diagnosis from the resulting large number of possible sites is obtained by choosing the intersection of the various pathways. The input to the model is a list of signs and symptoms. The output is a drawing of the brain with the resultant lesion indicated by cross-hatching.
Integrated automation program (I.A.P.) for an electronic switching system
Authors: F. Albertini, A. Ascagni, P. Jabes, A. Stefanini
Venue: Proceedings of the 12th Design Automation Conference (1975)

Now-a-days any large electronic system design invariably involves the support of automated facilities. The R and D laboratories of Societ&agrave; Italiana Telecomunicazioni Siemens spa are currently developing such an automated facility oriented for manufacturing a telecommunication switching system called PROTEO, which is also being designed and developed here. Particular design aids for printed circuits; automated wiring, testing, production and diagnosis of printed circuit boards, testing and diagnosis of subsystems and generation of relevant documentation, have been implemented already. The next objective is to develop an integrated automation program (I.A.P.) with the help of a DATA-BASE and to review it for future procedural techniques.
Static-hazard-free T-gate for ternary memory element and its application to ternary counters
Authors: Tatsuo Higuchi, Michitaka Kameyama
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The ternary T-gate can be used as a basic building block to construct both combinational and sequential circuits. For constructing ternary memory elements, however, the T-gate is required to be static hazard-free. A theoretical study is done on the necessary conditions for practical realization of the static-hazard-free T-gate. On the basis of the result obtained, the T-gate for memory elements can be realized. The T-gate is experimentally verified to be static hazard-free. The static-hazard-free T-gate obtained here can be used as building blocks to construct memory elements. We can easily construct various memory elements such as D flip-flap-flop (FFF), D master slave FFF, B master slave FFF, and counting FFF. They are operated satisfactorily. Using these memory elements, three different ternary counters are designed and realized. These ternary counters are superior to the binary ones in that the up-down counting can easily be carried out by one input signal.
A comprehensive approach to a connectivity audit, or a fruitful comparison of apples and oranges
Authors: R. M. Allgair, D. S. Evans
Venue: Proceedings of the 14th Design Automation Conference (1977)

A connectivity comparison program that has proven effective in a production environment is described. The pattern recognition framework utilized automatically recognizes component renaming and pin swapping, and performs robustly in the face of connectivity errors.
A virtual-variable name-specification operator for high level languages
Authors: A. J. Surkan
Venue: Proceedings of the sixth international conference on APL (1974)

In the absence of an execute or unquote feature, a computer language may be enhanced by inventing a specify function extension which during execution, assigns program-generated virtual-variable names with the storing of arrays. In this note, an APL prototype of such an extension of the specify operator is described and demonstrated. The legal domain of virtual-variable names include all values within the normal domain of the language environment and all literal strings of alphabetic and/or numeric characters with a maximum length set by the size of a double word. The extended specify operation is useful in programs for symbolic manipulation and in sparce matrix problems for elements with varying and unpredictable storage requirements.
DIAM II: The binary infological level and its database language - FORAL
Authors: Michael E. Senko
Venue: ACM SIGPLAN Notices (1976)

The notion of dividing complex problems into hierarchic levels of abstraction has a long history. Recently this approach under the name, structured programming, has been used in a pragmatic way to simplify the structure of procedural programs. The notion has also been used in the data base area - notable early papers include those of Madnick (1) and Meltzer (2). In these early papers, level structures (for example, involving logical and physical levels) were also relatively pragmatic creations. One new aspect of the DIAM I architecture (3) was that it defined a detailed, relatively formal basis for four levels of abstraction and the mappings between these levels. Each level had a small set of primitive generalized building blocks, each with its own small permanent set of parameters. By specifying values for these parameters, the user could define essentially any reasonable data structure and file organization he wished for his stored information.
&ldquo;Functional distribution of the workload of a linded computer system and its simulation&rdquo;
Authors: Constantine Lazos
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Consideration is given to a possible functional distribution of the workload over two linked computers with separate channel access to a large disc store, into the resource utilisation of the linked system achieved by simulation using a modified and re-entrant single processor simulator. Results suggest that the proposed distribution realises a high utilisation.
Nondeterministic call by need is neither lazy nor by name
Authors: William Clinger
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

This paper offers a definition of nondeterministic call by need and gives two alternative call by need power domain semantics for a language with McCarthy's ambiguous operator amb. amb is one of the earliest and most interesting nondeterministic programming language constructs [9]. The value of (amb E1 E2) is ambiguously the value of E1 or the value of E2, with one important qualification: if the value of E1 is undefined then the value of (amb E1 E2) is the value of E2, and vice versa. For example the parallel or of E1 and E2 can be written as (amb (if E1 true E2) (if E2 true E1)), showing the usefulness of amb even for writing deterministic expressions.
GPSS/H 1979-a status report
Authors: James O. Henriksen
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

A number of earlier papers (1,2,3) have described the design, features, and algorithms of GPSS/H, a new implementation of GPSS which runs on IBM 370 and 370-compatible hardware. Since publication of these papers, GPSS/H has been put into use at a number of commercial sites and colleges, as well as on the National CSS timesharing network. This paper describes the current status of GPSS/H and presents insights gained from application of GPSS/H to &ldquo;real world&rdquo; problems. Finally, ongoing developments in GPSS/H are described, and long range plans are outlined.
Approximate analytic models of arbiters
Authors: Patricia Jacobson
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

Results at very light and very heavy loads are easy to obtain, but at intermediate loads performance modelling is necessary. Because of the considerable cost of simulation, we develope queueing network models which can be solved quickly by approximate analytic techniques. These models are validated by comparing with simulations at certain points, and then used to get a wide range of results quickly.
Interactive multilevel definition of APL functions
Authors: Moshe Sniedovich
Venue: ACM SIGAPL APL Quote Quad (1982)

An attempt is made to establish a convention that will make possible an interactive multilevel definition of APL functions. In accordance with this convention, functions can be defined at two levels: First an outline (flow-chart) is specified, this being followed by a detailed specification of the outline, prompted by the APL system. The convention is based on Iverson's direct definition form and enables the user to define long functions in an interactive manner. Preliminary experience with this convention indicates that it can improve the readability of APL functions
The design of data type specifications
Authors: John V. Guttag, Ellis Horowitz, David R. Musser
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper is about the design of data types in creating a software system. The major point is to explore a means for specifying a data type which is independent of its eventual implementation. The particular style of specification, called algebraic axioms, is exhibited by axiomatizing many commonly used data types. As such, these examples reveal a great deal about the intricacies of data type specification via algebraic axioms, and, in addition, provide a standard to which alternative forms may be compared. Further uses of this specification technique are in proving the correctness of implementations and in interpretively executing a large system design before actual implementation commences.
A &ldquo;hands-on&rdquo; approach to computer literacy
Authors: Barbara G. Ryder
Venue: ACM SIGCSE Bulletin (1984)

Computer science departments face an overwhelming demand from the university community for computer literacy courses. In 1982 at Rutgers University we began to offer a &ldquo;hands-on&rdquo; literacy course for non-computer science majors. The students learn the rudiments of BASIC, study &ldquo;how the computer works&rdquo; by learning a small pseudo-assembly language and experiment with a variety of applications software packages. Applications include text processing, modelling, game playing, CAI and spreadsheets. Our experiences with this course have been positive, although the logistics of handling 960 students per semester are formidable.
Professional development seminars: Business graphics
Authors: Jim Rhyne
Venue: Proceedings of the ACM '82 conference (1982)

The display of business information in graphical form is a rapidly evolving segment of today's computer industry. However, the graphics software routines available to many programmers remain at an almost primitive level. This seminar surveys the development of graphics packages for use in business, examines several major charting packages currently available, and discusses current research in business graphics. The afternoon session features the use of graphics in system design, focusing on how to develop an interactive graphics program with little or no programming. The seminar is designed for persons with little graphics programming background.
An introductory computer science course for non-majors
Authors: Roger L. Wainwright
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

This paper describes an approach to an introductory computer science course designed especially for students who are not specifically required to take a computer course and thus ordinarily receive no appreciation for computers or computing. This is the third semester this course has been offered. Student enrollment has been 31, 46 and 41 respectively. We anticipate higher enrollment figures next semester as more advisors are becoming aware of the course. In a typical semester students majoring in such disciplines as English, advertising, nursing, psychology, sports administration, sociology, broadcasting and communication, music, elementary education, art and anthropology have enrolled. This course is ideal for those majoring in mathematics education as one day they may be teaching such a course to high school students. To encourage this group of students to enroll in the course, we restricted students from engineering and physical sciences and business disciplines from attending. They are required to take a different computer course. We have observed that most students not required to take a computer course desire to learn something about computers, and because of the above restriction are less hesitant to enroll.
Microdiagnostics for minicomputers
Authors: Michael Andrews
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

Recently several minicomputer manufacturers have introduced quite powerful and extremely versatile minicomputers that possess characteristics privy to medium and large scale computing systems. These characteristics include multi-addressing modes, stack operations, flexible input out put control, writable control stores and others. Emerging concurrently are the blessings of user-microprogrammable minicomputers. Quite predictably, future minicomputer systems may differ from maxi-computers solely on the basis of physical size.
Non-gridded graphic input
Authors: Roger Rutman
Venue: Proceedings of the 13th Design Automation Conference (1976)

Non-gridded input processing is a new technique for rapid entry and processing of schematic type graphic data. Traditional computer based graphic design systems have a significant problem in original graphic data entry. The engineer's rough drawing has to be laid out on a grid before it is digitized or constructed on a CRT terminal. With non-gridded input processing as implemented in Drafting System I, the layout step is completely unnecessary. The engineers extremely rough, non-gridded sketch is digitized off-line. Processing routines standardize symbol sizes and lettering, straighten lines, and move symbols and lines to produce a finished drawing. Connecting lines are stretched or shrunk as required and made either horizontal or vertical. No reference whatever is made to a grid or to absolute location. Symbol input locations indicate only their &ldquo;relative&rdquo; location to one another and do not specify their locations on the output drawing.
An efficient sparse minor expansion algorithm
Authors: Martin L. Griss
Venue: Proceedings of the 1976 annual conference (1976)

An improved algorithm for computing the minors of a (large) sparse matrix of polynomials is described, with emphasis on efficiency and optimal ordering. A possible application to polynomial resultant computation is discussed.
A simulation study of a demand-driven scheduling algorithm
Authors: R. B. Bunt, J. N. P. Hume
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

Suggested techniques for quantum adjustment in a round-robin scheduler in response to changing loads may not perform correctly in certain situations. These situations are identified and a method is proposed to handle them. The performance of the proposed algorithm is compared to known strategies through simulation.
Query processing in a distributed data base
Authors: Diane Jantz, E. A. Unger, R. McBride, Jacob Slonim
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The current research on optimizing algorithms for queries in distributed data base networks is presented. An identification of additional factors which add cost and time to processing of a query both at a node and in the transporting of data along a link in the network is given. The idea of a user topology is presented as the basis for a query optimization algorithm and the effects of a user's query constraints on the user topology are illustrated. With the influencing factors on a query request identified, a model of query processing is described.
Use of personal history, activities, ability and attitude questionnaire to predict success as a systems analyst
Authors: J. Howard Bryant, David A. Ameen
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

The study was aimed at collecting information that would provide better definition of analyst and manager position requirements and, consequently, the knowledge, skill, and other requirements necessary to enable successful performance. As one part of the study, it was planned that the relationships among a variety of education, experience, task, ability, and attitudinal variables, comparable to those that might be obtained during the hiring and promotion process, would be examined and their value determined as predictors of successful performance. The purpose of this report is to present the results of that analysis.
Computer science&mdash;too many students, too many majors (Panel Discussion)
Authors: Kenneth L. Williams, Kenneth Danhoff, Robert Korfhage, Jack Alanen
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

During the last decade enrollments in computer science courses have increased dramatically. Classes are very large and faculty members are nearly impossible to recruit. The &ldquo;seller's&rdquo; job market has contributed to both of these problems and universities must deal with the problems of too many students and too many majors. The panelists have been asked to address the following questions: 1) How large should classes be at the upper and lower levels? 2) Does everyone have a birthright to be a computer scientist? 3) Are there reasonable ways to limit enrollments? 4) Are we pleased with the quality of the average undergraduate computer science graduate? 5) Have academic standards declined because of large enrollments? Although the panelists do not have solutions to all of these problems we feel that it is important to identify them and discuss what sorts of alternatives have been tired. It is expected that about one-half of the session's time will be devoted to audience interaction.
Texture Segmentation by Frequency-Sensitive Elliptical Competitive Learning
Authors: Steve de Backer, Paul Scheunders
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper a new learning algorithm is proposed with the purpose of texture segmentation. The algorithm is a competitive clustering scheme with two specific features: elliptical clustering is accomplished by incorporating the Mahalanobis distance measure into the learning rules, and under-utilization of smaller clusters is avoided by incorporating a frequency-sensitive term. In the paper, an efficient learning rule that incorporates these features is elaborated.In the experimental section, several experiments demonstrate the usefulness of the proposed technique for the segmentation of textured images. On compositions of textured images, Gabor filters were applied to generate texture features. The segmentation performance is compared to k-means clustering with and without the use of the Mahalanobis distance and to the ordinary competitive learning scheme. It is demonstrated that the proposed algorithm outperforms the others.
Establishing functional relationships in multiple response simulation: The multivariate general linear metamodel
Authors: Linda Weiser Friedman
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The general linear metamodel has been found to be an effective tool in post-simulation analysis. This paper addresses the multiple response problem in simulation and proposes a multivariate general linear metamodel as an aid in understanding and interpreting simulation results. Such a metamodel was developed using multiple response data generated from an M/M/1 queueing system simulation. The results supported the author's contention as to the value and validity of this type of multivariate technique in simulation.
Turbine engine maintenance manpower and facility model
Authors: Gary E. Sundquist, Robert B. Whitegiver
Venue: Proceedings of the 5th conference on Winter simulation (1971)

GPSS/360 was used to model manpower allocation in the Turbine Engine Maintenance Process. The purpose was to evaluate alternate proposals for allocation of manpower. Forecasted workloads of engines were processed against these proposals. Simulation outputs included engine production times and quantities of engines produced. Also included are manpower and facility utilization outputs. Appraisal of outputs by management aided in selection of a manpower allocation plan.
Rollback propagation detection and performance evaluation of FTMR2M&mdash;a fault-tolerant multiprocessor
Authors: Yann-Hang Lee, Kang G. Shin
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

In this paper we consider the rollback propagation and the performance of a fault-tolerant multiprocessor with a rollback recovery mechanism (FTMR2M)[1], which was designed to be tolerant of hardware failure with minimum time overhead. Rollback propagation between cooperating processes is usually required to ensure correct recovery from failure. To minimize the waste of processor time and storage overhead required for handling sophisticated rollback propagations, the FTMR2M always keeps one recoverable state. Approaches for evaluating the recovery overhead and analyzing the performance of FTMR2M are presented. Two methods for detecting rollback propagations and multi-step rollbacks between cooperating processes are also proposed.
Computing in liberal arts colleges
Authors: John Beidler
Venue: ACM SIGCSE Bulletin (1984)

The panelists will describe their experiences and share their thoughts on the special problems involved in teaching computing in the environment of the liberal arts college. Time will be available for attendees to add their own comments.
Simulation of a Computer Aided Routing System (CARS)
Authors: N. H. M. Wilson, J. M. Sussman, L. A. Goodman, B. T. Hignnet
Venue: Proceedings of the third conference on Applications of simulation (1969)

CARS is s system designed to provide a taxi-like service at a mass transit-like cost. It allows potential passengers to request service from their via telephone, with calls being processed by a central computer facility. The computer periodically executes a routing algorithm which assigns vehicles to passengers and communicates this routing information to the vehicles. The system is 'real time' in that it will pick up a passenger and shortly after a request will deliver him to his destination within a guaranteed time (with a minimum number of deviations for collecting and delivering other passengers). The key to CARS is the routing algorithm. Since labor and vehicular costs are a major portion of the total system cost, an algorithm is required which can provide an effective dynamic service with a minimum number of vehicles. A variety of such algorithms have been proposed, but these algorithms can not be evaluated in an analytic fashion. Hence, a comprehensive simulation model has been developed to test and compare these routing algorithms. The model facilitates the investigation of relationships between such parameters as number of vehicles and quality of service. This paper describes the methodology of the simulation model and the economic gains (in terms of the need for fewer vehicles) realized through its use. The use of an ARDS storage tube display to produce graphical output from the model is also discussed.