ppxscal/embedding_network huggingface dataset:
Applications programming in a Health Sciences Computing center
Authors: Service recharge A Boraas
Venue: Proceedings of the 1971 26th annual conference (1971)

Establishing an applications programming staff, as an integral part of a division of Health Computer Sciences within a health sciences community, requires a balance of technical personnel, computer system configurations, and specialized professional health science expertise. The reasons for establishing and maintaining such a staff are as varied as the demands of the health sciences community. The fluctuations of grant awards and contracts, health care delivery analyses, goals, and research personnel continually test the stability of a functional computer science-health sciences applications programming staff. The methods and procedures by which the Division of Health Computer Sciences at the University of Minnesota has, and is, asymptotically approaching a robust balance as a functioning applications programming staff are briefly presented in this paper.
A domain structure for distributed computer systems
Authors: L. Casey, N. Shelness
Venue: ACM SIGOPS Operating Systems Review (1977)

The successful implementation of generalized multiple computer systems will require attention both to the form of physical architecture and to the choice and implementation of a suitable systems environment in which to construct and run applications. This paper argues for the use of a multi-computer physical architecture in preference to a multi-processor architecture, and for dynamic distribution of functions and control as opposed to static allocation of functions and hierarchical control. A systems environment which is based on a domain structure is then described. The domain structure restricts sharing of items. This alleviates the main problem in implementing a capability mechanism to support domains in a system without shared memory, which is that a central table of capabilities is required. It also makes the management of the non shared items easier since they can be required only at one computer at a time. Essential sharing is also handled without central control but at the cost of some complexity. Considerable attention is paid to the handling of interdomain jumps as they provide the opportunity for the dynamic allocation of functions. It is conjectured that the resulting system would be capable of smooth expansion in size from one to twenty five computers. In operation it would exhibit dynamic load balancing as well as having the protection advantages of domain structure.
A high performance factoring machine
Authors: W G Rudd, Duncan A Buell, Donald M Chiarulli
Venue: Proceedings of the 11th annual international symposium on Computer architecture (1984)

Factoring, primality testing, and other problems of current interest [1, 2, 3, 4, 5, for example] in experimental number theory require machines with different architectures from those for any other application. Algorithms for such problems are small, but their execution requires high-speed arithmetic on very long integers interspersed with shorter precision computing that can conveniently be done by several processors acting in parallel. In this paper, we describe the preliminary design of a processor specifically for computational number theoretic problems. The primary component is a 256-bit ALU which is dynamically reconfigurable to provide for parallel independent operations on groups of 32-bit subwords within the 256-bit word.
The use of engineering documentation in support of a high density logic test system
Authors: Manuel Correia, Richard L. Daubenmire
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

Introduction of System 360 placed unprecedented technical demands on all IBM facilities. This paper describes the application of Engineering Design Automation Information in support of the development and implementation of a manufacturing test data system.
Facilities and programs in support of education in computer science at minority institutions (Panel Discussion)
Venue: ACM SIGCSE Bulletin (1976)

The panel will address the area of education in computer science from the standpoint of minority institutions. Panelists will present views from the standpoint of individuals who have developed programs at the two and four year levels, individuals who have utilized portions of such programs as service offerings, and from the standpoint of funding agencies. Also considered by the panel will be questions of problems unique to the minority institutions, and projected future developments in computer science education at the institutions. Finally, the area of appropriate resources in support of computer science education will be considered.
UNIXTM as an environment for producing numerical software
Authors: N. L. Schryer
Venue: ACM SIGNUM Newsletter (1979)

The UNIX operating system [1] supports a number of software tools which, when viewed as a whole, are an unusually powerful aid to programming. The design, implementation, documentation and maintenance of a portable FORTRAN test of the floating-point arithmetic unit of a computer is used to illustrate these tools at work. The result of this effort was a program created automatically from the paper describing the test. Thus, only the documentation had to be written; the program was automatically produced from it. Also, changes in the document (debugging) were automatically reflected in the program. The second section briefly describes the UNIX tools to be used. The third section outlines the basic problem and the fourth section shows how the tools can help solve the problem.
Towards a formulation and definition of data reorganization
Authors: James P. Fry, David W. Jeris
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

Data reorganization can be informally defined as the process of changing the logical and/or physical organization of data so that it can be processed more effectively in a new hardware/software environment. Motivation for data reorganization is presented and examples given. The major issues that were taken into consideration in the formulation of a definition of data reorganization are discussed. These include the scope of the definition and issues of loss of information and data independence. A formal definition of data reorganization is presented and discussed through the use of a four level model of data. The spectrum of reorganization, from logical to physical, is discussed, and examples presented. Finally, the complexity of data reorganization operations is discussed.
A Little Implementation Language
Authors: P. J. Plauger
Venue: ACM SIGPLAN Notices (1976)

A language is described that was implemented on a PDP-11 computer for writing system-level code for the PDP-11 family of minicomputers. The Little Implementation Language LIL offers a number of features that facilitate writing structured, high-level code with no sacrifice in efficiency over assembly language. The discussion ends with a harsh evaluation of its future usefulness.
Design principles of the PORT library
Authors: Phyllis Fox
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

The Bell Laboratories Mathematical Subroutine Library, PORT, has been under development at Bell Laboratories for the past few years. The design of PORT stemmed from the basic principles of portability and ease of use. The attributes and mechanisms used in the library to support this philosophy include the use of a portable subset of Fortran, and the use of (machine-dependent) functions to supply the necessary environment parameters. Abbreviated calling sequences are made possible by a simplified error-handling technique, and by the use of a portable stack allocator for temporary workspace. Our experience to date with these approaches, and our plans for the future are reviewed here.
PROCSY: The Purdue Remote On-line Console System
Authors: Saul Rosen, John M. Steele, R. E. Wagner
Venue: Proceedings of the 1971 26th annual conference (1971)

The PROCSY system uses an IBM 7094 as a front-end computer to provide remote job entry and interactive capabilities for a multiprocessor multiprogramming operating system running on a CDC 6500. It uses a powerful macro-command system on the 7094 to create and edit files which are transmitted to the 6500 for processing. PROCSY now processes more than 4000 jobs per day ranging from short utility jobs to major production jobs. Evaluation and analysis programs on the 7094 and on the 6500 provide performance statistics that help to understand, to debug, and to improve the system.
TIGS: An overview of the terminal independent graphics system
Authors: Robert L. Heilman, Jean M. Marchant
Venue: ACM SIGGRAPH Computer Graphics (1978)

TIGS is a general purpose subroutine package providing display generation and interaction capability for a general class of graphics terminals. The package is computer, operating system, and display device independent. Primary design objectives were transportability, maintainability, and ease of use. Features supported by TIGS include line, arc, multi-line plot, test and dot primitives with resettable attributes such as line style, character size, intensity, font, color, transformation matrix, etc. The package uses virtual devices such as locators, keyboards, picking devices and function keys which can represent a wide range of physical devices. TIGS supports modelling transformations, 2D and 3D viewing transformations for clipping and window to viewport mapping. Unlike the GSPC Core System, TIGS uses the interpretive approach which uses a device independent neutral display file. This neutral display file contains information describing all segments, pictures, windows, and viewports in a device independent manner. The file may be saved and used in a later job with a different display device. Additionally, all attributes such as line style, font, character size, etc., can be re-specified without re-defining the contents of a segment. In planning for expansion for distributed graphics applications, multiple independent user coordinate spaces are used. Each coordinate space is called a picture. This allows for re-specification of a window without re-defining the contents of it. A picture and all the segments contained therein can be manipulated as a group. Device independence was implemented by dividing TIGS into a device-independent pre-processor invoked by the applications programmer, and internal device drivers, one per display device. Part of the device driver may reside on a separate processor.
A data processing curriculum development methodology
Authors: Michael M. Gorman, John F. Rogers, Edward A. Embick
Venue: Proceedings of the eighth annual SIGCPR conference (1970)

This paper presents a methodology that can be implemented in a corporate or academic setting to develop a data processing curriculum. Even though this methodology does not present new concepts, it does gather together several useful, tried and proven techniques, namely, Work Study, Job Analysis, and Vocational Course Construction, which, when combined and utilized in your data processing environment, generates training programs that will produce graduates trained especially to meet your corporate requirements. This methodology, based on a &ldquo;wholistic&rdquo; approach to the creation of a functionally useful &ldquo;D. P. body&rdquo;, analyzes an operational job, and creates a training program for it in a reasonably short time period.
On protection in operating systems
Authors: Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

A model of protection mechanisms in computing systems is presented and its appropriateness is demonstrated. The &ldquo;safety&rdquo; problem for protection systems under our model is to determine in a given situation whether a subject can acquire a particular right to an object. In restricted cases, one can show that this problem is decidable, i.e., there is an algorithm to determine whether a system in a particular configuration is safe. In general, and under surprisingly weak assumptions, one cannot decide if a situation is safe. Various implications of this fact are discussed.
Procedure models for generating three-dimensional terrain
Authors: Robert Marshall, Rodger Wilson, Wayne Carlson
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

A method for generating arbitrary terrain models, including trees, bushes, mountains, and buildings, is described. Procedure models are used to combine fundamental data elements in the creation of unified objects comprising the terrain model. As an example, a procedure model to generate arbitrary trees of various species is implementation. These are the generation of the low level data elements, specification of input parameter requirements, and a brief explanation of the algorithmic structure. Terrain images rendered by this process are included, as are diagrams and illustrations explaining the procedure model organization. Comparisons with previous work are made.
The use of APL in the teaching of probability
Authors: K. W. Smillie
Venue: Proceedings of the sixth international conference on APL (1974)

This paper discusses the use of APL both as a mathematical notation and also as a programming language in an introductory course in probability.
Functional simulation in the lamp system
Authors: S. G. Chappell, P. R. Menon, J. F. Pellegrin, A. M. Schowe
Venue: Proceedings of the 13th Design Automation Conference (1976)

The effective use of simulation for logic verification and test evaluation frequently requires simulation capabilities at different levels of detail. This paper discusses the functional level simulation capability in the LAMP system at Bell Laboratories and its relation to gate level simulation. The Function Definition Language (FDL) used for specifying the behavior of functional blocks is discussed. Functions described in this language can be embedded in gate level circuits and simulated to determine the normal circuit behavior or faulty behavior. Classical faults external to functions and user specified internal faults in functions may be simulated. The effectiveness of functional simulation has been demonstrated in a number of applications such as memory modules in a large controller of an Electronic Switching System, the ROM in a small controller and an entire microprocessor treated as an interconnection of a few functional blocks.
Volumetric deformable models with parameter functions: A new approach to the 3D motion analysis of the LV from MRI-SPAMM
Authors: J. Park, D. Metaxas, L. Axel
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We present a new method for analyzing the 3D motion of the heart's left ventricle (LV) from tagged magnetic resonance imaging (MRI) data. Our technique is based on the development of a new class of volumetric physics-based deformable models whose parameters are functions and can capture the local shape variation of an object. These parameters require no complex post-processing in order to be used by a physician. These volumetric models allow the accurate estimation of the shape and motion of the inner and outer walls of the LV as well as within the walls. We also present a new technique for calculating forces exerted by tagged MRI data to material points of the deformable model. Furthermore, by plotting the variations over time of the extracted LV model parameters from normal heart data we are able to quantitatively analyze and compare the epicardial and endocardial motion.
Expansion of computer consulting resources in a university environment
Authors: Gary E. Masters
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

The increasing need for timely and accurate programming and consulting assistance in the university environment is at last gaining recognition in the ranks of reluctant budgeteers. This need is, however, more frequently &ldquo;felt&rdquo; in the shade of deficit than &ldquo;seen&rdquo; in the light of anticipation. Growth rates effected by such hindsight have only propagated this deficit. We develop a hierarchy of user needs, start with the most critical and stop where we run out of man-hours. I know of no more practical approach, but there is a valuable supplement to be considered. We may increase the utility derived from our existing resources. Three prime-target resources are documentation, consulting time and the users themselves. The vehicle for expanding their productivity is communication.
The Liberal Arts users: Who are they, and what do they want, anyway?
Authors: Linda S. Stegall
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

The almost overnight wave of interest and battle to overcome &ldquo;computerphobia&rdquo; by students, faculty and staff with a non-technical background is both exciting and somewhat baffling. What is it that sets apart these users from others in their departments? How did they find out that computer resources could be of benefit in their studies and work? What have been their major accomplishments and obstacles? And how can we as consultants better communicate with them, and support and assist in their efforts? This paper will explore these questions and others pertaining to our experiences in understanding and meeting the needs of our growing Liberal Arts user community.
Piecewise approximation of functions of two variables through regions with variable boundaries
Authors: Theodosios Pavlidis
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The domain of a function f(x,y) is subdivided into regions D1, D2,...DM such that on each one of them f(x,y) can be approximated by a low order polynomial within a given tolerance. It is desirable to chose the boundaries of the regions in such a way as to minimize the amount of storage required for the approximate description of f(x,y). A suboptimal solution to this problem is presented. It is based on a two step procedure. First the optimal segmentation is obtained for profiles of f(x,y) along certain lines of its domain. The regions so obtained are then grouped together to form the final subdivisions. Examples of application of the method in the compression of topographical data are presented. Compression ratios of over 20:1 are obtained for RMS error 2%.
Multi-level locking with deadlock avoidance
Authors: David B. Lomet
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The existence of multiple levels of resources in data base systems presents a problem when resources must be shared among contending users. For example, some users may be interested in an entire file while others are only interested in one or a few records of the file. Intention locks have previously been introduced to permit multiple levels of locking in conjunction with deadlock detection methods[1,2]. These intention locks can be view as housekeeping entries to record the pattern of usage of resources. When viewed in this way, no new locking modes need be exposed to a system user. Further, the basic idea behind intention locks can then be directly applied to systems which use deadlock avoidance methods[3,4].
Examining alternative End-Stage Renal Disease (ESRD) therapies through simulation
Authors: Stephen D. Roberts, Thomas L. Gross, Douglas R. Maxwell
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

To examine the costs and effects of alternative treatments for End-Stage Renal Disease (ESRD), we constructed a simulation model which estimates patient survival and lifetime cost for those with ESRD. The model, written in the INS simulation language, considers home and center hemodialysis as well as live related and cadaver donor transplantation. After the model was validated, the cost per life year gained for each therapy was computed. Center hemodialysis was found to have the poorest cost-effectiveness and shifts from center hemodialysis could save society up to &dollar;284 million annually. We conclude that the model may be very helpful in designing cost-effective care for End-Stage Renal Disease.
Optimal evaluation of pairs of bilinear forms
Authors: Joseph Ja' Ja'
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

A large class of multiplication problems in arithmetic complexity can be viewed as the simultaneous evaluation of a set of bilinear forms. This class includes the multiplication of matrices, polynomials, quaternions, Cayley and complex numbers. Considering bilinear algorithms, the optimal number of non-scalar multiplications can be described as the rank of a three-tensor or as the smallest number of rank one matrices necessary to include a given set of matrices in their span. In this paper, we attack a rather large subclass of three-tensors, namely that of (p, q, 2) tensors, for arbitrary p and q, and solve it completely. The complexity of a general pair of bilinear forms is determined explicitly in terms of parameters related to Kronecker's theory of pencils and to the theory of invariant polynomials. This reveals unexpected results and shows explicitly the dependence on the algebraic structure of the constants; we display, for example, a pair of n x n bilinear forms whose complexity is n + 1 over infinite fields and which, however, requires exactly n+[(n-1) &brvbar;k] multiplications over a finite field with cardinality k. Another consequence of our results is that any set of m, p x q, bilinear forms require at most m/2(min(p+q/2, q+p/2)) multiplications over any field.
On protocol multiplexing
Authors: Danny Cohen, Jonathan B. Postel
Venue: Proceedings of the sixth symposium on Data communications (1979)

The notion of protocol multiplexing usually means the ability of a protocol to accommodate several instances of higher level protocols at the same time. In this paper we propose to extend this notion to allow sharing of messages, and packets, among several simultaneous communicating processes, which will increase the communication efficiency by reducing the total number of messages transmitted through the media. This paper discusses several aspects of multiplexing and the interaction of multiplexing with other protocol issues.
Supporting organizational problem solving with a workstation
Authors: Gerald Barber
Venue: ACM SIGOA Newsletter (1982)

This paper describes an approach to supporting work in the office. Using and extending ideas from the field of Artificial Intelligence (AI) we describe office work as a problem solving activity. A knowledge embedding language called Omega is used to embed knowledge of the organization into an office worker's workstation in order to support the office worker in his or her problem solving. A particular approach to reasoning about change and contradiction is discussed. This approach uses Omega's viewpoint mechanism.
Experience gained from the American Airlines SABRE system control program
Authors: George J. Evans,  Jr.
Venue: Proceedings of the 1967 22nd national conference (1967)

Just over ten years ago, IBM and American Airlines undertook the development of a real-time airlines reservations system. At that time, there were several systems in use by the airlines to present &ldquo;yes-no&rdquo; information on seat availability and in some cases maintain seat inventory counts. None of these systems, however, performed the complete &ldquo;back-room&rdquo; job of filing records, sending communication messages, processing wait-lists, preparing boarding manifests, etc. Significant improvements in passenger service were expected if the many possible sources of error in these operations could be reduced. The effort included development of specialized pieces of equipment and of a control program to interface between the application programs and the hardware. This was at a time when operating systems were just beginning to come into use. This paper concentrates upon the control program architecture, setting forth the important lessons that were learned after the system became operational.