ppxscal/embedding_network huggingface dataset:
Database management in the undergraduate curriculum
Authors: Nell Dale
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

The development of generalized database management capabilities has been one of the most dynamic areas of computer technology in recent years. It not only presents the computer specialists with a range of technical and theoretical problems of substantial interest, but has direct and visible impact upon the operations of organizations and upon the environment of the individual in an increasingly information oriented society. Accordingly, an introduction to the technology of database management is not only relevant for the computer scientist but to managers, administrators and everyone concerned with the problems of information processing. As a result, a very real question is where in the undergraduate curriculum is this introduction taking place. Are Computer Sciences Departments offering such courses? Business Schools? Both? A second question is what do the education groups of the two professional computer societies&mdash;ACM and IEEE&mdash;have to say about database management education. A third question then becomes, how closely do the courses being taught in this area today parallel what the education committees suggest.
Elements of a software quality control program
Authors: Patricia R. Cox
Venue: Proceedings of the ACM '82 conference (1982)

Software quality has received a significant amount of attention recently because of the increased emphasis by American industry on quality and because of the attempt to control increasing maintenance costs. Until recently quality was the responsibility of the programmer or software engineer; however, the increased emphasis on quality has prompted an increase in the number of separate quality organizations. The success of an independent quality organization is dependent on several factors: the current state of software quality technology, high-level management commitment, and adequate technical resources.
Optimization of multivalued decision algorithms
Authors: A. Thayse, M. Davio, J. -P. Deschamps
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

One studies the possibility of evaluating the local values of a multivalued function by means of a specific type of algorithm called multivalued decision algorithm. The reason for this choice is its wide range of applications that encompasses both hardware and software problems. Possible applications of the multivalued decision algorithm are: combinatorial synthesis of discrete functions by means of multiplexers, sequential synthesis of discrete functions using multivalued ROM's and multiplexers, transformation and optimization of microprograms.
Structured microprogramming
Authors: Clay McFarland
Venue: Supplement to the conference record of the 7th annual workshop on Microprogramming (1974)

Current practices in micro- programming and structured programming are examined. It is noted that micro- programming as defined by Rosin and structured programming as defined by Dijkstra are similar in that they are both methods for hiding the structure of unreasonable machines from users. Some of the problems involved in achieving correctness proofs for programs that must run on current systems are discussed, and reliable total systems are proposed as an alternative immediate goal. Structured programming is defined in a broader sense, and used as the basis for a design methodology for&ldquo;structured systems&rdquo;. Some suggestions for methods of achieving structured systems are proposed.
AUTASIM: A system for computerred Assembly of Simulation Models
Authors: Robert T. Burger
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

The AUTASIM System (Automated Assembly of Simulation Models) is described. The system is designed to rapidly assemble discrete event, stochastic simulation models of node network systems. Systems of this type are distribution systems, plant operations, systems for the provision of services, transportation systems, and combinations of these. Models can be used for comparative analysis of new concepts and proposed systems with other systems. The main AUTASIM components are a Module Library of computer programs, a program called the Model Assembler and a Model Description Language. The Library contains functional and simulation service modules which are the &ldquo;building blocks&rdquo; for the simulation models created. The Model Assembler program reads a coded model description, selects the required modules from the Library, and creates the necessary linkage routines for a complete model program. The Model Description Language, AUTASCRIPT, is defined. The operation of the FORTRAN coded Model Assembler and linkage control programs is described, as is the GASP based model simulation control.
Star graphics: An object-oriented implementation
Authors: Daniel E. Lipkie, Steven R. Evans, John K. Newlin, Robert L. Weissman
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

The XEROX Star 8010 Information System features an integrated text and graphics editor. The Star hardware consists of a processor, a large bit-mapped display, a keyboard and a pointing device. Star's basic graphic elements are points, lines, rectangles, triangles, graphics frames, text frames and bar charts. The internal representation is in terms of idealized objects that are displayed or printed at resolutions determined by the output device. This paper describes the design and implementation of a graphics editor using an object-oriented technique based on a Star-wide subclassing method called the Trait Mechanism.
Compile time type determination in SETL
Authors: Aaron M. Tenenbaum
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

In this paper, some features of the SETL language are presented. Also discussed are two methods for determining the data types of runtime objects in higher level languages from the static program text. The first method determines the type of a variable from the way in which it is defined, while the second method determines its type from the way it is subsequently used. This technique is shown to be of value in producing optimized object code. An implementation of the technique is also discussed and an example of the results produced under the implementation for a specific SETL program is presented.
The computer profession in the 1980's: An Orwellian interlude? (Panel Discussion)
Authors: Matt Prastein, Robert P. Campbell, G. Gary Casper, Ollie Smoot, John Swearingen
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Every day various news media report the increasing encroachment of data processing on the average person's life. People are beginning to fear that the computer will bring the horrors envisioned in George Orwell's prophetic novel, 1984. This fear is being fueled by the daily contact people have with poorly designed systems, the increasing frequency of spectacular computer related crimes, and the ever growing presence of computer assisted &ldquo;snooping&rdquo; by both the government and private industry. With such a public image, it is not surprising that there have been several efforts both on the national and state levels to license or regulate the data processing industry. Each of these attempts has been unsuccessful, but as time goes on the pressure will inevitably increase for the institution of some kind of formal control on the computer professional.
Lease/buy decisions under conditions of for computer acquisition uncertain technological change
Authors: Clifford W. Lazar
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

There is a need to make rational lease/buy decisions under conditions of uncertain technological change. This paper demonstrates how to convert management estimates of technological change in computer equipment into meaningful factors which can be used in decision models.
Simple G&ouml;del numberings, translations, and the p-hierarchy (Preliminary Report)
Authors: Michael Machtey, Paul Young
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We study restricted classes of programming systems (G&ouml;del numberings), where a programming system is in a given class if every programming system can be translated into it by functions in a given restricted class. For pairs of systems in various &ldquo;natural&rdquo; classes we give results on the existence of isomorphisms (one-to-one and onto translations) between them from the appropriate class of functions. Our results with the most computational significance concern polynomial time programming systems. We show that if P&equil;NP then every two polynomial time programming systems are isomorphic via a polynomial time computable function. IfP@@@@NP this result points the way to the possible existence of &ldquo;natural&rdquo; but intractable computational problems concerning programming systems classified in terms of the polynomial time hierarchy. We also give results concerning the relationship between the complexity of certain important and commonly used properties of programming systems (such as effective composition of programs) and the complexity of translations into the systems.
System techniques for time-sharing
Authors: J. H. Morrissey
Venue: Proceedings of the SHARE design automation project (1965)

The first generation of experimental time-sharing systems are currently in operation. They leave much to be desired in terms of generality, efficiency, and availability. They are not perfect, but they do work. They have had a beneficial influence on the design of both totally new products and of optional features appearing in modern equipment. Several new programming techniques have also proven their value. The people using time-sharing have contributed much: the users with their enthusiastic acceptance of this mode of operation, and the programmers who are eager to write new systems that can efficiently utilize generalized time-sharing techniques. This paper has surveyed only a few of the techniques being incorporated into the next generation of time-sharing systems. It has described some techniques, indicated some probable trends, and identified some unsolved problems. It has tried to emphasize that time-sharing involves much more than conventional products, programs, and people; its ultimate success and acceptance depends on the creation of many new system techniques. Some have been described; many more are sure to evolve.
&ldquo;ACCEL&rdquo; automated circuit card etching layout
Authors: C. J. Fisk, D. D. Isett
Venue: Proceedings of the SHARE design automation project (1965)

Printed circuit board design time can be greatly reduced by the use of a computer program called ACCEL developed jointly by Sandia Corporation and the Thomas Bede Foundation under contract to Sandia. ACCEL is a program which designs printed circuit boards and produces the drawings for their construction. The input is encoded from an engineer's schematic diagram by a clerk with no knowledge of electronics. The outputs of the program are a schematic, parts list, printed circuit negative, assembly drawing, and a hole drilling list. ACCEL is written in Fortran II for the IBM 7090 computer and the drawings are produced on the Stromberg Carlson 4020 cathode ray tube plotter.
After the histogram what? a description of new computer methods for estimating the population density
Authors: Michael E. Tarter, Raymond L. Holcomb, Richard A. Kronman
Venue: Proceedings of the 1967 22nd national conference (1967)

This paper has been written with two purposes in mind: First, to give a user-oriented analysis of the problem of graphical data description for univariate data and second, to describe the use of a computer program which has been designed to supplement the traditional methods. The histogram, frequency polygon and other closely related methods are computationally simple techniques, often used for estimating the underlying density of which the data are a sample. Therefore it is not at all surprising that before the advent of high speed calculation these methods were used almost exclusively. However, at the present time the criterion of simplicity is sharing the attention of statisticians and computer scientists with the criterion of efficiency in terms of effective use of data for this purpose.
Learning and using ANS MUMPS a programmer's perspective
Authors: Robert E. Lushene
Venue: Proceedings of the ACM 1980 annual conference (1980)

This paper details the experiences of a programmer in first learning about and coding in the ANS MUMPS language. While first reactions ranged from neutral to mildly negative, within a month these attitudes had substantially changed. The language was found to be easy to learn, exceptionally powerful, and executed as fast as compiled languages in an interactive environment. Coding was found to be three to ten times faster than with other languages; furthermore, there was no need to learn separate linking, loading, database, file-manager or other job control systems as these elements are imbedded in the language structure and/or operating system and are largely transparent to the programmer. The language was found to have great appeal since it appeared oriented towards programmers rather than machines.
The impact of APL2 on teaching APL
Authors: Raymond P. Polivka
Venue: Proceedings of the international conference on APL (1984)

With the advent of significant new features in APL, for example APL2, attention to and an understanding of the fundamental principles and concepts of APL is especially important. This expository paper is aimed primarily at the APL educator, present or future, and the person seriously pursuing a more in-depth mastery of the language. The paper states some of the underlying concepts and principles of the language and why they are important. Within the presentation several techniques which the author has found successful in conveying these concepts are stated. Finally, the fact that APL2 permits another new and different approach to problem solving is discussed and illustrated.
Underwater Buried Object Recognition Using Wavelet Packets and Fourier Descriptors
Authors: David Boulinguez, André Quinquis
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Underwater object identification has been of great interest for a few years to acousticians (detection of boulders), marines (detection of buried mines), or archaeologists (detection of wreckage). Image and Signal processing succeed in identifying objects lying on the sea bottom, however identification of an object buried in sediment remains complex.The purpose of this work is to develop a complete identification of objects embedded in the sediment using an adapted technology. We use a parametric source, which properties are based on the nonlinear propagation characteristics of the water; it has many advantages as an acoustic source (high relative bandwidth, narrow beam) which are useful for object detection and classification.This paper presents two algorithms: the first one improves the object detection and the second procedure computes discriminant parameters from images to classify these objects.
Continuing education services of the IEEE computer society
Authors: Willis K. King
Venue: Proceedings of the ACM '81 conference (1981)

Recognizing the need of its members to keep themselves up-to-date in the rapidly advancing field of computer science and engineering, the Computer Society has for years devoted substantial effort in providing continuing education service. One can identify four major components in this service. They are: 1. The chapter tutorial program, 2. The professional development seminars, 3. The Distinguish Visitor's program and 4. The Tutorial publications. Each program provides a distinct type of service; together they meet the demand of the membership in large measure.
A human engineered PCB design system
Authors: Andrew J. Matthews
Venue: Proceedings of the 14th Design Automation Conference (1977)

A discussion of the design decisions made in the development of a new computer-aided Printer Circuit Board design and documentation system, and a description of completing a PCB on the resulting system. The system is a maximum capability tool, uses high performance refresh graphics, works with schematic diagrams as input, and provides auto-interactive placement and routing, and powerful editing capabilities.
Modular description/simulation/synthesis using DDL
Authors: S. G. Shiva, J. A. Covington
Venue: Proceedings of the 19th Design Automation Conference (1982)

With the increased complexity of integrated circuits, a true top-down methodology is mandatory in their design. A construct that enables a modular description of a system design is added to DDL. The Translator, Simulator and Synthesis Software has been modified to retain this modularity throughout the design cycle. These enhancements allow a multi-level simulation and multi-technology synthesis of an integrated circuit.
Report on discussions held by the IFIP Working Group 2.5 on Numerical Software
Authors: Charles L. Lawson
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

This paper is one of three to be presented at a joint meeting of SIGNUM and the ANSI X3J3 Fortran Committee October 18, 1978, for the purpose of communicating suggestions arising in the mathematical software community to the X3J3 Committee. A summary is given of language problem areas and possible solutions that have been discussed by the IFIP Working Group 2.5 on Numerical Software. Also included are some thoughts on control structures due to the author.
A theory of specular surface geometry
Authors: M. Oren, S. K. Nayar
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

A theoretical framework is introduced for the perception of specular surface geometry. When an observer moves in three-dimensional space, real scene features, such as surface markings, remain stationary with respect to the surfaces they belong to. In contrast, a virtual feature, which is the specular reflection of a real feature, travels on the surface. Based on the notion of caustics, a novel feature classification algorithm is developed that distinguishes real and virtual features from their image trajectories that result from observer motion. Next, using support functions of curves, a closed-form relation is derived between the image trajectory of a virtual feature and the geometry of the specular surface it travels on. It is shown that in the 2D case where camera motion and the surface profile are coplanar, the profile is uniquely recovered by tracking just two unknown virtual features. Finally, these results are generalized to the case of arbitrary 3D surface profiles that are travelled by virtual features when camera motion is not confined to a plane. An algorithm is developed that uniquely recovers 3D surface profiles using a single virtual feature tracked from the occluding boundary of the object. All theoretical derivations and proposed algorithms are substantiated by experiments.
Automated logic implementation
Authors: E. G. Balducci, W. E. Davis,  Jr., C. G. Persele
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The tedious burden upon engineering personnel (logicians) who are involved in digital design has grown to enormous proportions. One of the more significant factors that contributes to this burden has been the introduction of the integrated circuit which has greatly increased the amount of logic that may be packaged in a given volume. In addition, another constraint is the requirement for standardization of logic boards which are fundamentally nonfunctional. The result is a family of logic boards that are merely convenient methods of mounting integrated-circuit elements and the element connections of which are brought out to the board connector by printed circuit runs. This type of standardization, while it reduces the logistics problem, introduces a great many problems such as pin number assignments, logic board selection, and interconnection constraints.
Teaching data abstraction to the practicing programmer: A case study
Authors: Michael B. Feldman
Venue: ACM SIGCSE Bulletin (1980)

We have been experimenting at The George Washington University with our undergraduate and graduate courses in Data Structures. In particular, we are using a very modern text [HORO78] and a strong emphasis in lectures and projects on the practical application of data abstraction, and its relationship to both structured programming and machine efficiency. Student projects are subroutine packages written, in &ldquo;real-world&rdquo; programming languages, as faithful and modular implementations of the abstractions studied. Throughout the courses, attention is paid to the relationship between structured programming and data structures, and between these two and time/space efficiency considerations. After a preliminary discussion of data abstraction concepts, we present a case study, namely a sparse-matrix system, and some observations.
The simulation of computer systems in a university environment
Authors: Gary J. Nutt
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

The spectrum of current work concerning the simulation of computer systems in a university environment ranges from simple interpreter-oriented simulation models for educational use through research into areas concerned with the development and refinement of techniques generalizing or simplifying the simulation process [37, 38]. When we speak of work related to the simulation of computer systems, we include the development and use of any software or technique which aids in the imitation of the stimulus-response relationship of any portion of a computer system. Thus, this survey paper discusses work concerned with the &ldquo;emulation&rdquo; of one machine (called a virtual machine) on another machine (called the real machine) as well as more conventional forms of simulation. These studies are prevalent in academia and are used for two distinct purposes: education and research. A topic of interest that frequently occurs in a research environment is the use of simulation models to create an environment in which some small portion of a total computer system can be tested. Popular examples of this area are job mix generators to test scheduling algorithm alternatives or reference stream generators to investigate paging algorithms. Included also in the area of environment creation are the software engineering systems, used to aid in the consistent design of computers, as may be best exemplified by Project LOGOS, [3, 28, 29]. These studies are of interest to our survey in that they liberally employ automated simulation during the design period. An area that has classically been popular in academic simulation studies is the creation and use of high level models for configuration studies, operating system tuning etc. This area represents the largest intersection of interest with investigators in government and industry. A final area of study included in this survey is the investigation to improve techniques for approaching the simulation problem, or the generalization of known techniques to develop some kind of theory or set of concepts for computer system simulation.