ppxscal/embedding_network huggingface dataset:
Advanced structured COBOL programming
Authors: Asad Khailany
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

There is a large market demand for COBOL programmers. Can a single introductory course in COBOL programming provide the students with sufficient professional expertise to qualify them for these job openings? If not, is it feasible to offer a second course in COBOL programming? In this paper the technical capabilities of those who have completed an introductory COBOL programming course and the skills and technical qualifications which are desired by employers of entry level COBOL programmers are analyzed. It is concluded that a single introductory COBOL programming course is not sufficient to produce COBOL programmes with the qualifications and skills expected by employers. Therefore, an advanced structured COBOL programming course is proposed. The goals and the course outline including texts and references of such an advanced course are presented. Several samples of integrated information systems which have been completed by student teams in Advanced Structured COBOL programming will be available for the audience.
Software Engineering tutorial
Authors: Murray R. Berkowitz, Gordon Davis, Kenneth T. Orr, James A. Senn, Darrell Ward
Venue: Proceedings of the ACM '81 conference (1981)

The field of Software Engineering has undergone some of the most profound changes in the last decade. In recent years, the National ACM Conferences have been giving increasing attention to Software Engineering&mdash;&ldquo;Structured Program Planning and Design: Standardization Needs&rdquo; (ACM '79 - Detroit) and &ldquo; More on Structured Design&rdquo; (ACM '80 - Nashville). This session contains treatment of software engineering with emphasis on real applications. Presented are state-of-the-art software techniques including the latest refinements in structured analysis and design and programming methodologies. Several issues related to the portrayal of software design include architectural, structural, behavioral, and informational considerations. Stressed are techniques for implementing reliable, maintainable software. Also offered are software management approaches.
Software engineering and simulation
Authors: Kevin T. Ryan
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

A tutorial survey is made of some techniques in Software Engineering and their relevance to simulation modelling. Various topics are discussed with examples. In the area of Systems Design the topics are concurrency, deadlock and input verification; in the area of Program Design they are modular programming, stepwise refinement and the Jackson method; in the area of Program Verification, structured coding and program tracing and in the area of System Optimization, determining storage needs and monitoring CPU usage.
Interpretive analysis of computer system performance
Authors: Springer W. Cox
Venue: ACM SIGMETRICS Performance Evaluation Review (1974)

A typical performance evaluation consists of the identification of resources, the definition of system boundaries, the measurement of external and internal performance variables, and finally the interpretation of data and projection of system performance to hypothetical environments. These projections may be used to estimate the cost savings to be expected when changes are made to the system. The fundamental external performance measures such as response time and thruput are intimately related, but may be defined differently depending on how the system is defined. They can be analyzed with respect to the internal performance measures (such as activities, queue lengths and busy times) by applying one or more interpretations such as: absolute utilizations, normalized busy times, system profiles, analysis of response, workload relaxation, and resource consumption hyperplanes. These models, which are generally free of assumptions regarding interarrival and service time distributions, can be adjusted to represent potential changes to the system. Then the interpretations may be used to evaluate the predicted external performance measures.
A simulation model of New York City police department's response system
Authors: Julius Surkis, Gilbert R. Gordon
Venue: Proceedings of the second conference on Applications of simulations (1968)

The urgency of studying police response systems was clearly demonstrated through the recent work done by the members of the Science and Technology Taskforce of the President's Commission on Law Enforcement and the Administration of Justice1. A study was conducted in Los Angeles observing the occurrence of incidents in two districts. The results showed that a decrease in police response time was correlated with increased probability of criminal apprehension. The objective of the effort described here is to analyze the response system of an actual police department in a large urban area. New York City was chosen for this purpose. In the context of this study, the system is defined as that phase of police operations and resources concerning the response to requests for police assistance.
Routing method for VLSI design using irregular cells
Authors: H. J. Rothermel, D. A. Mlynski
Venue: Proceedings of the 20th Design Automation Conference (1983)

In this paper a new routing method for cells of complex geometries (building blocks, macrocells) in hierarchical VLSI design is presented. It is based on an appropriate channel model and a channel routing algorithm for embedding net segments of variable wire width. An H-V-routing scheme is used for two layer routing. A new database system for handling n- corner rectangles of individual size and shape has been developed.
System performance measurements and evaluation (Panel Session)
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

In addition to providing user facilities, operating systems enable increased system utilization through multiprogramming of independent jobs and through centralized control of input/output and storage devices. In order to evaluate various scheduling or device management algorithms, a facility must be available to measure the operating characteristics of the computer system. The contributors to this session will discuss algorithms for obtaining improved performance as well as ways of evaluating new techniques with respect to their effect on system performance.
Module design verification system
Authors: Lloyd Wilkins
Venue: Proceedings of the 21st Design Automation Conference (1984)

Module Design Verification System (MDVS) was developed to handle the extremely large volume and complexity of multilayered ceramic substrate designs, which makes them highly prone to design errors and data management problems. MDVS consists of a substrate design database with its own part number catalog and the ability to absorb Engineering Design System (EDS) wiring to become a full module database. Under MDVS runs a complement of electrical and physical applications being controlled by the substrate designer through graphics menus. This system has proven to be a very valuable design verification, design debug and data management tool. It results in considerable savings in design cycle time and manpower.
Proposal for a complex APL
Authors: Paul Penfield,  Jr.
Venue: Proceedings of the international conference on APL: part 1 (1979)

Many people have suggested that APL be extended to complex numbers. Since complex numbers have great importance in mathematics, APL as a mathematical notation is deficient without them. Furthermore, an implemented extension to the complex domain would be of value to scientists, engineers, and educators, who use complex numbers in their work. A proposal for such an extension is presented.
Evaluating job shop simulation results
Authors: Carter L. Franklin,  II
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The problem of predicting the effectiveness of simulation results as applied to job shop production is discussed. A measure of effectiveness is developed which allows both absolute and relative evaluation of different scheduling techniques and the conditions for profit maximization under a customer service constraint are presented. The development is based upon a model of the shop process which assumes random scheduling behavior and which serves as the reference point for evaluating schedules.
Extraction of Traffic Information from Images at DEIS
Authors: Enrico Viarani
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper reports about the research work currently going on at DEIS, University of Bologna, on the use of Computer Vision for extraction of information from urban traffic images. Two algorithms are described: The first, named "Virtual Inductive Loop" (VIL), computes image differences on small windows of the traffic scene between to an updated background and the actual window and is specific for vehicle counting and detection. The second algorithm, based on Block Matching Algorithm (BMA), is particularly suitable for vehicle motion detection and tracking. It consists of a BMA implementation (improved with respect to the standard version) followed by a regularization step based on a custom median filter, of a labeling algorithm and of a tracking step. Finally, we present our future plan for the research developments concerning these topics. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Development of a systems analysis and design course
Authors: Donald G. Golden
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Cleveland State University is an urban university, with the Department of Computer and Information Science residing in the College of Business Administration. The major objective of the department's curriculum is to educate students for productive roles in industry, primarily in the development and implementation of business information systems. Several years ago, critical comments from both the business community and the students themselves gave strong indication that the courses in systems analysis and design were not fulfilling this objective. Not only were the courses not teaching state of the art techniques, they tended to vary in content considerably from quarter to quarter, depending on the instructor. The subject &ldquo;systems analysis and design&rdquo; covers a wide variety of material, far too much to be dealt with comprehensively in any reasonable time span. It was felt that the objectives for the courses could best be met by concentrating on structured analysis and design methodologies (particularly as they applied to the development of business information systems for computers), and by establishing well-defined syllabi for the courses. The material was divided into two courses, the first covering analysis and the second covering design.
The computation of finite functions
Authors: D. M. Symes
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

This paper discusses the computation of finite functions with the aim of investigating ways of judging the relative worth of the different methods for computing a given finite function. Any finite function may, of course, be computed in a number of ways, including a &ldquo;brute-force&rdquo; method of table look-up and methods which exploit some pattern which may exist in the function. How &ldquo;good&rdquo; we judge each of the several methods to be will depend on which criteria we wish to apply, and here we will be considering two: size of program and cost of computation, first of all separately, and then together. The latter case gives rise to the notion of a &ldquo;reasonable&rdquo; way of computing a finite function, and certain considerations with respect to this notion suggest a modified notion of &ldquo;relatively reasonable&rdquo;. Some properties of these concepts, in particular some of the differences between them, are developed. The spirit of the paper is machine-independent except for the last paragraph which suggests a need for some idea of &ldquo;program structure&rdquo; to be introduced into the formulation.
A filing system with variable size attributes for the GASP simulation languages
Authors: Robert E. Young, Terrence E. Wilson
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

This paper presents a new filing system which dynamically allocates storage based upon the attribute requirements for each file. Thus, we can eliminate the storage overhead associated with the current method which requires using the same number of attributes for all files based upon the maximum number of attributes required for any one file. The new filing system is transparent to the user and its computational overhead is minimal.
Cost/Resource model
Authors: Betty J. Landstra
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The Cost/Resource Model is a simulation model intended for use in management decision-making. The model portrays the impact of proposed new business or changes in existing business on company resources including labor, equipment, facilities, material and money.
The interactive digitizing of polygons and the processing of polygons in a relational database
Authors: John F. McIntosh
Venue: ACM SIGGRAPH Computer Graphics (1978)

A system is described for the interactive digitizing of polygons for such two-dimensional spatial modeling applications as growth studies and thematic map production. A digitizer connected online to a mini-computer with a refresh display is used for capturing polygon data from source documents. An area boundary network is developed by digitizing nodes, pointing to node pairs, and then digitizing edges only once. A CRT display monitors, and bell-rings confirm input operations. Facilities to erase nodes or edges are available. From the nodes and edges, software produces polygons which the user may name or discard. Slivering and overlap are eliminated because contiguous polygons have identical edge descriptions. Named polygons are then transferred to a large university time-sharing computer where spatial editing operations may be carried out, such as unioning pieces of a large map. The named polygons may he given additional non-spatial attributes and entered into a relational type of data base.
An outline of a mathematical model for the definition and manipulation of data
Authors: Bengt Nordström
Venue: Proceedings of the 1976 conference on Data : Abstraction, definition and structure (1976)

This paper presents a constructive model for data which suggests some precise definitions of notions like type, name, constants, declarations etc. The model is based on an old idea of looking at data as a mapping from a set of names to a set of values. We will study two different kinds of assignments and also show how the model can be used to give some hints for new data structuring methods. In particular we have given a definition of a sequence and we have shown how this data structure can be used to give constructive definitions of structures like stacks, files and queues. We have also studied tree traversals i.e. the correspondence between various trees and sequences.
Computers and computations in algebraic number theory
Authors: Horst G. Zimmer
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

In the present survey an outline is given of certain recent as well as earlier developments in the use of electronic high-speed computers in algebraic number theory.
The Map Information Facility&mdash;a cooperative federal and private venture in geocoding
Authors: Robert T. Aangeenbrug
Venue: Proceedings of the ACM 1980 annual conference (1980)

The use of a nationwide information inquiry system based on a geographic location will be and has been heralded for some years. We take for granted that the post office, the &ldquo;phone system&rdquo;, and a number of private firms have been and will continue to provide such service. Any of us can call most airlines and get a reasonable answer on route planning for our trips with the various options explained to us by skilled operators at anytime of day from any place. Private companies evaluate the economic utility of such systems in serving their customers. Obviously, the existence of geographic-based inquiry systems is not new; their emergence to perform nationwide service to specific segments of inquirers in a federal program is rather new. I predict that this system, the Federal Insurance Administration's (FIA) Map Information Facility, excited as we are about it and pleased as we are with the current accomplishments, will be replicated and expanded very frequently by many agencies. We can consider this particular project, and no doubt others which are emerging, as an early example of geographic information systems in the federal sector.
A single user multiprocessor incorporating processor manipulation facilities
Authors: Jeffrey M. Tobias
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

A single user general purpose multiprocessor computing system developed around a high level language is described. Both the hardware configuration and its relation to the accompanying software are discussed. The multiprocessor presented is designed for the single user; commonly used techniques such as time-sharing, swapping and user protection are discarded. The system provides a mechanism in the language for the separation of process and processor, and enables a description of some characteristics of the latter. A PROCESSOR type is introduced in the language that corresponds exactly to hardware processing elements, and it is shown that by being able to manipulate items of this type, a versatile computer and research tool is developed which enables further investigation into synchronisation protocols and interconnection techniques.
A partial solution to fitting large parametric surfaces in computer-aided design systems
Authors: Larry Lichten
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes a procedure to &ldquo;smooth&rdquo; several separately-defined three-dimensional surfaces into a single, uniformly-continuous compound surface.
The one tree (breaking out of the workspace)
Authors: Stephen Taylor, Arthur Whitney
Venue: ACM SIGAPL APL Quote Quad (1984)

The advent of enclosed arrays has provided an opportunity to bring into APL previously extra-lingual objects such as tokenstrings, packages and functions. By doing so a more formal and rigorous definition of APL is achieved. Within this definition many simplifications are possible, including the subsuming of workspaces, files, libraries and other 'entities' into arrays and functions. The work is being implemented on the Hewlett-Packard A900 minicomputer.
Logic design of multi-valued I2L logic circuits
Authors: E. J. McCluskey
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

An algebraic system for designing multi-valued (four-level) I2L circuits is presented here. It was necessary to develop this system because the use of existing multi-valued logic formalisms does not result in efficient I2L circuits. The close relationship between the algebra and the integrated circuits is stressed throughout the paper.
A mini-computer based library control system
Authors: William H. Josephs
Venue: ACM SIGSOFT Software Engineering Notes (1978)

One of the major problems encountered in any large scale programming project is the control of the software. Invariably, such large programs are divided into many smaller elements since these are easier to code, test and document. However, such a division adds new complexity to the task of Configuration Management since the many source modules, data base elements, JCL (Job Control Language) and DATA files must be controlled with the goal of maximizing program integrity and minimizing the chances of procedural errors. Furthermore, whenever any program is released either for field test or for final production, an entire change control procedure must be implemented in order to trace, install, debug and verify fixes or extensions to the original program. These maintenance activities can account for up to 80 percent of the entire programming cost in a large, multi-year project. The library control program (SYSM) presented here was developed to aid in these processes. It has facilities for capturing all elements of a program (commonly called baselining), editing any element or group of elements that have been baselined to build an updated version of the program, adding and/or deleting elements of a program, and listing the current contents of a given element or elements. SYSM is written mainly in FORTRAN, and runs on a Hewlett-Packard HP-21MX computer with two tape drives, the vendor supplied RTE-II or RTE-III operating system, and at least 16K of user available core. It can be used to control code targeted for either the HP21MX itself, or, using the optional HP/LSI-11 link program, code targeted for a Digital Equipment Corp. LSI-11 system.
On the fixed charge transportation problem
Authors: Kurt Spielberg
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The paper primarily investigates the application of mixed-variable techniques (due to J. F. Benders) to the Fixed Charge Transportation Problem. On account of the special structure of the problem several parts of the general algorithm can be simplified. The mathematical programming part of the general iteration becomes essentially a zero-one integer programming problem. The linear programming part reduces to a transportation problem with certain prohibited routes, which is discussed in detail. An example for the iterative procedure is given.
Color Graphics in Education, Art and Industry
Authors: E. P. Miles,  Jr.
Venue: Proceedings of the ACM '81 conference (1981)

The demonstration-lecture will cover highlights of the speaker's research and creative activities in color graphics using Intecolor 8,000 equipment. This will include presentation and discussion of the latest version of graphic display slides he uses as an ACM lecturer. Through the courtesy of the Intelligent Systems Corporation an ISC 8051 1 system will be available to demonstrate dynamic graphics applications of various types and extensions of previously developed models and methods from earlier low resolution, limited color versions. The present I series has 4,000 colors and 480 X 384 dot addressable resolution. Recent results in computer implemented mathematical color separations to prepare black and white internegatives for generation of control plates for a four color press will be discussed. These depend upon operating in the domain of certain self dual models for additive and subtractive color subspaces developed by the speaker. Included in the graphics slides shown will be ten graphs which were sold as bookcovers for 1981 copyright books and five which appeared on the covers of either the Proceedings of ACM 80 or ACM SE 80 or both. Also included will be graphs which demonstrate properties of certain functions such as, continuity, limits, singularities, symmetries, asymptotes, periodicity, boundedness, randomness, etc. Four dimensional graphs which depict complex functions w &equil; f (z ) or other vector relationships such as the magnitude and direction of a force field in the plane will also be shown. These required the design of 32 special characters which can now be added to the low? case alphabet set by special order.