ppxscal/embedding_network huggingface dataset:
Data base languages, in particular DDL, development at CODASYL
Authors: J. R. Lucking
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

Since the publication, in April, 1971, of the Data Base Task Group(DBTG) report(ref.1) to the CODASYL Programming Language (&equil;COBOL) Committee(PLC) several committees and task groups of the CODASYL organization have enhanced and improved the languages and specifications proposed by DBTG. Two recent publications by CODASYL, the CODASYL Data Description Language Journal of Development (DDL-JOD - see ref.2) and the CODASYL Data Base Languages Proposal (DBLTG-73001 - see ref.3), which together constitute a complete revision of the DBTG report reflect this further development. This paper briefly summarises the DBTG, report and then describes the more significant (in the author's opinion) changes made to the Schema DDL documented in the DDL-JOD. The changes to the Subschema DDL and the DML, suggested in DBLTG-73001 are more briefly summarized mainly because the PLC Has recently approved many further changes to this proposal. Certain changes to the Schema DDL approved since the decision to publish the DDL-JOD was taken in April, 1973, are also indicated.
An automated simultaneous probing system for testing complex logic assemblies 'the bed of nails system'
Authors: R. H. Somaia
Venue: Proceedings of the 14th Design Automation Conference (1977)

Described is an implemented system working from Design Automation logic files for testing very dense printed circuit boards with multi-pin TTL integrated circuit packages. Essential objectives sought were economy in test generation, ease and economy in diagnostics and a high degree of confidence in the tested boards. The objectives have been achieved by testing the assembled boards in small functional blocks using 1000 simultaneous probe contacts with the signal nets.
Handling difficult faults in operating systems
Authors: R. M. Needham
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

It is commonplace to build facilities into operating systems to handle faults which occur in user-level programs. These facilities are often inadequate for their task; some faults or incidents are regarded as so bad that the user cannot be allowed to act on them and this makes it difficult or impossible to write subsystems which give proper diagnostics in all cases, or which are adequately secure, or which are adequately robust. This paper looks into why there is a need for very complete facilities and why there is a problem about providing them, and proposes an outline structure which could be used.
The application of integer programming in design automation
Authors: Melvin A Breuer
Venue: Proceedings of the SHARE design automation project (1966)

Most of the problems encountered in the area of the design automation of computers are combinatorial. One procedure which is sometimes very effective for solving combinatorial problems is to formulate them as discrete linear programming problems. The integer programming formulation of the following problems can be found in the literature.
Advances in information retrieval(ACM 82 Panel Session)
Authors: Donald H. Kraft
Venue: Proceedings of the ACM '82 conference (1982)

In conventional information retrieval Boolean combinations of index terms are used to formulate the users' information request. Boolean queries are difficult to generate and the retrieved items are not presented to the user in any useful order. A new flexible retrieval system is described which makes it possible to relax the strict conditions of Boolean query logic thereby retrieving useful items that are rejected in a conventional retrieval situation. The query structure inherent in the Boolean system is preserved, while at the same time weighted terms may be incorporated into both queries and stored documents; the retrieved output can also be ranked in strict similarity order with the user queries. A conventional retrieval system can be modified to make use of the flexible metric system. Laboratory tests indicate that the extended system produces better retrieval output than conventional Boolean or vector processing systems.
Three-dimensional representations for computer graphics and computer vision
Authors: Norman Badler, Ruzena Bajcsy
Venue: ACM SIGGRAPH Computer Graphics (1978)

Representing complex three-dimensional objects in a computer involves more than just evaluating its display capabilities. Other factors are the uses and costs of the representation, what operations can be performed on it and, ultimately, how useful it is for computer recognition or description or three-dimensional objects. Many of the questions which are posed arise from the joint consideration of computer graphics and computer vision, and a specific representation hierarchy is proposed for complex objects which makes them amenable to display, manipulation, measurement, and analysis.
Preliminary design for POPSY - a POlyProcessor SYstem
Authors: Malcolm C. Harrison
Venue: Proceedings of the ACM annual conference (1973)

This paper outlines the objectives and preliminary design for an experimental POlyProcessor SYstem (POPSY) which we hope to build at the Courant Institute. The motivation for this work is our belief that the dramatic reduction in hardware costs which we expect to result from large-scale integration (LSI) will affect the architecture of computer systems in a significant way. In particular, we expect there to be the following main results - the reduction in importance of program efficiency - the use of software to replace hardware The SETL work1 is concerned with one approach to the first. Here we are concerned with the second.
Gaming and man-machine simulation
Authors: Geoffrey Churchill, Edwin Heard, Theodore J. Mock, Miklos A. Vasarhelyi, Gay Serway, Allen Kennedy, Gustave Rath, G. C. d'Ans, Richard G. Staelin, E. G. Rodgers
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This session features three papers in the field of computer based simulation in which humans make decisions in a simulated environment. All are concerned with the use of such models for teaching purposes; however, they provide an interesting spread in types of learning which is expected to develop.
Examples of event handling in APL2
Authors: Alan Graham
Venue: ACM SIGAPL APL Quote Quad (1983)

Event handling is a feature that has recently been added to many APL systems. IBM's VSAPL release 4.0 and APL2 include a dyadic system function @@@@EA (Execute Alternate) which provides a simple event handling facility. This dyadic function can easily be simulated using the event handling facilities offered by other vendors. Event handling provides a significant new direction in capability to APL. Some applications that are inconvenient or impractical are easily accomplished using event handling. The examples given show some novel uses that may not be obvious on first introduction to @@@@EA. Although the examples given here are specific to APL2 the ideas behind them may be used on any APL system with sufficiently powerful event handling.
Linear circuit analysis by symbolic algebra
Authors: L. Russell
Venue: Proceedings of the 1969 24th national conference (1969)

Using the ALPAK system for symbolic algebra, a package of three subroutines, SYMCIR, was developed as a research tool in linear circuit analysis. Though restricted in scope to computing basic circuit functions, the programs were designed to be used on an operational, not experimental basis. As a result, problem areas were discovered which have no analogue in numerical computation. These were encountered because of the mathematical structure of the problem, and are software-independent. The techniques used to overcome these difficulties are hence of interest to all programmers using symbolic languages for mathematical computations. Some difficulties in analyzing the final results of the computation were encountered because of their complexity. Some methods of alleviating this difficulty are discussed.
Software engineering tools: Past, present and future
Authors: Charles R. Vick
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The structure and capability of Computing Systems and resources are constantly changing. Often overlooked is the importance of this input in the derivation of requirements for directions in Software Engineering. Many of our initial Software tools were developed with a single sequential machine in mind. The concepts of parallelism and concurrency have also had a great deal of influence in directing research in Software Engineering. We are now well into the age of micro-processors and Distributed Systems. This talk explores the question, &ldquo;Are we addressing Software Engineering for such systems with the fervor we expended on the super-systems?&rdquo; &ldquo;Are tools and techniques adaptable to the system of the 80's, and if so, to what degree?&rdquo; Finally, &ldquo;What are the requirements that will be imposed on Software Engineering research for computing structures of the 80's?&rdquo;
Usable natural language interfaces through menu-based natural language understanding
Authors: Harry R. Tennant, Kenneth M. Ross, Craig W. Thompson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Conventional natural language interfaces suffer from several ease-of-use problems. They require a user to type and to formulate questions in a way that the system can understand. They have high failure rates which often frustrate users, and users often do not use features of the systems because they are unaware of them or don't trust them. In addition, conventional natural language systems are expensive to build and require large amounts of storage to use. This paper describes a new approach to natural language interfaces called menu-based natural language understanding. This new approach solves the problems listed above. The paper compares the menu-based natural language approach to conventional natural language interfaces and to other forms of interface and discusses the advantages and limitations of this new approach.
Natural and efficient viewing parameters
Authors: James C. Michener, Ingrid B. Carlbom
Venue: ACM SIGGRAPH Computer Graphics (1980)

The viewing scheme in the Core Graphics System is based on a unified approach to the specification of the viewing parameters for all types of planar geometric projections. As a result, the specification of some of the viewing parameters is inconsistent with traditional ways of specification and will often be found unnatural for use in certain application areas. Additionally, this choice of viewing parameters leads to inefficient implementations of viewing parameter modification, particularly in a high-performance graphics system which supports transformations in hardware or firmware. The natural ways to specify the different viewing parameters are discussed and efficiency considerations for viewing implementations are described. The Core System viewing scheme is evaluated in terms of its naturalness and efficiency of implementation. An alternate viewing scheme is proposed that provides viewing parameters that are more natural for many applications and that can he modified more efficiently.
A simulation of the Atmospheric Cloud Physics Laboratory to aid in its design and the design of the experiments within the laboratory
Authors: Leonard W. Winchester,  Jr.
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

Using the finite difference method with overrelaxation, numerical solutions of the steady-state vorticity transport equation were obtained for a continuous flow diffusion chamber of the Hudson-Squires type. The calculation neglected the effects due to temperature, gravity, and saturation. The size and shape of the manifold used to inject the aerosol laden flow was varied to obtain a design which would improve the performance of the chamber from strictly low Reynolds number (<20) fluid dynamical considerations.
An algorithm for selection of migration candidates
Authors: B. Holtkamp, P. Wagner
Venue: Proceedings of the 17th annual workshop on Microprogramming (1984)

The NP-Completeness of the selection problem of vertical migration candidates is shown by reducing it to the NP-complete knapsack problem. Based on approximation algorithms for the latter problem a new algorithm is presented, which takes into account the call relations between functions in a complex system. Then the developed algorithm is applied to the UNIX operating system as a representative for complex systems.
Using graphics to build simulation models
Authors: Merriel C. Dewsnup
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Computer graphics has become a very important part of the model development process at Eaton-Kenway. Data entry is aided greatly by user friendly software that takes almost all of the work out of building a data base. Model validity is determined in less time and customer validation has become much easier. This has resulted in more customers wanting to have models built and increased material handling and factory automation sales. Efforts are underway to incorporate CAD hardware being used by engineering into the modeling process.
Complex floor revisited
Authors: Doug Forkes
Venue: Proceedings of the international conference on APL (1981)

Three functions are evaluated for their suitability as the floor function in the complex domain. The functions are evaluated against abstract criteria such as symmetry and convexity, and also for suitability in practical applications. The family of functions derived from floor is developed and examined in each case.
Estimating software development schedules and costs
Authors: R. E. Merwin
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Estimates of large scale software development schedules and associated costs have had a history of being wrong more than right. The landscape is littered with examples of such projects, including some design automation systems, which were over a year late in becoming operational and costing millions of dollars more than estimated. There are a number of reasons for this situation including poorly stated system requirements, shortage of personnel capable of managing large scale software developments, and a tendency to try and solve system problems late in the development cycle by taking advantage of the inherent flexibility of the general purpose computer. To provide a background for a discussion of estimating techniques for software development schedules and costs, a brief description will be given of the development process. Next, some empirical &ldquo;rules of thumb&rdquo; for estimating development times, computer support and costs will be presented. Finally some interesting schedule, cost, and computer time estimating equations will be described. These are based upon a regression analysis of a large number of software development projects in terms of observed parameters.
Distributed data base management: Some thoughts and analyses
Authors: C. Mohan
Venue: Proceedings of the ACM 1980 annual conference (1980)

The new decade will witness the widespread usage of distributed processing systems. Distributed data base management will turn out to be one of the important applications of this relatively new technology. This paper initially presents a brief outline of the nature of research that has been performed so far in this area. Next, it discusses some of the important issues (like integrity and security constraints, deadlocks, concurrency control, etc.) and analyses some proposed mechanisms. Performance and correctness issues are also addressed. Then, a brief sketch of an adaptive architecture for distributed data base management systems is presented. The last section lists some future directions for research in this area.
EDUSAC - an educational list processing system
Authors: William E. Kennedy, James R. Pinkert
Venue: ACM SIGCSE Bulletin (1976)

This paper describes an educational version of the SAC-1 list processing system. Educational systems such as WATFIV, WATB&Oslash;L, and PL/C are available for teaching programming languages. However, the authors could find no comparable systems for list processing. Since such facilities would be useful in many courses (e.g., data structures, operating systems, symbol manipulation), EDUSAC was developed.
Toolpack - an experimental software development environment research project
Authors: Leon J. Osterweil
Venue: Proceedings of the 6th international conference on Software engineering (1982)

This paper describes a research project aimed at building and studying prototype environments for Mathematical Software. The project is aimed at gaining actual measurements and experiences that should help solidify knowledge about how to build effective environments. Towards this end some speculative ideas about environment file systems and command languages are presented, along with research plans for effectively evaluating these and other design notions.
A survey of space allocation algorithms in use in architectural design in the past twenty years
Authors: Robert Simpson Frew,  Ph.D.
Venue: Proceedings of the 17th Design Automation Conference (1980)

The paper presents methods of space allocation applicable to architectural design. These techniques have been developed in the past twenty years and are presented in this paper in such a way that they mav also be applied to other disciplines. Four categories are presented that identify the variations in the dimensioning of the elements, either unit dimension or variable dimension, and the variation in the shape of the boundary, either a simple rectangle or a multi-faceted boundary.
Government agencies' activities in education
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The panelists describe the organization and current activities of the agencies with which they are associated. Brief descriptions of some past and currently funded activities in computer science and computers-and-education are presented. The areas in which funding is currently available are highlighted.
APL function editing in APL
Authors: Arto Juvonen
Venue: Proceedings of the eighth international conference on APL (1976)

Most of the present APL systems available provide only the del form definition for function entry and revision. However, I have often found this conventional editing facility awkward and slow to use. For more convenient revision I prepared a number of functions that form the workspace FNEDIT. Editing is based on the use of @@@@CR and @@@@FX functions. The canonical representation of a function can be revised using a few simple commands that can find, delete, replace, or add characters and character strings in the function, list the revised function or portions of it and finally fix the revised function provided it is formally acceptable for fixing. Following is a complete description of the FNEDIT workspace, of the commands and of their use.
A documentation and publishing tool
Authors: Debra Reinhart
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

The steps involved in publishing a document can be divided into two broad areas: the actual details of production, such as determining format, maintaining consistency, printing the document; and the editorial function of writing, editing, and proofing. This paper discusses Computing Services approach to that problem. We developed a tool called layouts, which has eliminated the bulk of our production-oriented problems. As a result, we are now able to concentrate on further ways to use our text formatter to the advantage of authors and editors.
SIGSIM (Panel Session)
Authors: Paul Roth, Richard Nance, Larry McNamee
Venue: Proceedings of the 1976 annual conference (1976)

Simulation is booming, but this area of endeavor is hampered by duplicated efforts, difficulties in communication, and large expensive packages that work only on system x, compiler y, and problem-z. The panel will examine the problem of how this situation could be improved by the development of standards for simulation terminology, documentation and languages.
Robot aerobics: four easy steps to a more flexible calibration
Authors: D. E. Stevenson, M. M. Fleck
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Presents a method for calibrating intrinsic and extrinsic camera parameters. This algorithm can easily be modified by other users to suit their particular calibration needs, without requiring a high-precision calibration target or complicated linear algebra. The algorithm uses controlled motions and a single light source to simulate calibration targets in convenient 3D locations. These convenient calibration targets enable us to simplify the calibration algorithm and gather dense data for lens distortion. Dense data makes the distortion correction more accurate than traditional low-order polynomial fits, and allows us to calibrate wide-angle lenses (
A multiple stream microprocessor prototype system: AMP-1
Authors: Edward S. Davidson
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

A general-purpose multiple-stream processor with shared memory and a single time-multiplexed synchronous bus has been implemented. The AMP-1 system uses eight standard microprocessors and 64K bytes of memory. The design is highly efficient in the use of processor, bus, and memory resources. Preliminary performance measurements agree closely with an analytic memory access conflict model and show extremely low conflict-based performance degradation. Heavy interleaving of the memory and effective multitasking of a job can yield significant performance speedups. Considerations for future implementations are presented.
Computer video classes a view from both sides of the camera
Authors: David Sieg, Bishop Hall, Whit Crowley, Carrier Hall
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

With the increase in computer use by non-technical students and faculty, comes the ever increasing responsibility of user services to provide the best possible service in the form of orientation classes and tutorials pertaining to computer facilities and equipment to this group. These services should receive high priority; however, they must not drain resources and deteriorate existing user services. This medium frees user services from repeated drain of resources and manpower as each new semester begins and also during the semester. The topics presented are from the User Services viewpoint and from the media production viewpoint.
Hardware architecture for recursive Virtual Machines
Authors: Gerald Belpaire, Nai-Ting Hsu
Venue: Proceedings of the 1975 annual conference (1975)

In order to support Virtual Machine (VM) Systems on most current computer systems, the Virtual Machine Monitor (VMM) is the only process allowed to reference directly a set of registers, called resource management registers (RMR). Any access operations to those registers executed by any other processes must be detected and executed interpretively by the VMM. This way of implementing VMs is imposed by inadequate hardware mechanism for protection. In this paper, this problem is studied and a hardware architecture is proposed to solve this problem in an efficient and elegant way. The hardware architecture proposed is a stack of RMR, one for each level of VM. The processes running on a VM can only access the RMRs of their level. The hardware (Control Unit) will use the information stored in the RMR of the current level and in the RMRs of lower levels for resource mapping. &ldquo;A good wife can never cook without food&rdquo;. A chinese proverb.