ppxscal/embedding_network huggingface dataset:
PIC&mdash;a language for typesetting graphics
Authors: Brian W. Kernighan
Venue: Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation (1981)

PIC is a language for specifying pictures so that they can be typeset as an integral part of a document preparation system. The basic objects in PIC are boxes, lines, arrows, circles, ellipses, arcs and splines, which may be placed anywhere and labeled with arbitrary text. Most of the effort in designing PIC has gone into making it possible to specify the sizes and positions of objects with minimal use of absolute coordinates. This paper describes PIC, with primary emphasis on those aspects of the language that make it easy to use.
Visual aid for FORTRAN program debugging
Authors: K. Takahashi, T. Aso, M. Kobayashi
Venue: Proceedings of the 6th international conference on Software engineering (1982)

This paper presents a new type of debugging tool for FORTRAN programs. We call this the &ldquo;DOCK&rdquo; system, referring to the dock where ships stay during repairs. DOCK provides new debugging functions such as slow display of program execution. Major functions and a brief indication of the methods of implementation are given in this paper. Four &ldquo;execution modes&rdquo; control execution speed. Execution is displayed on the screen in full screen mode. The source program listing is displayed with the executing statement shown in a different color or brightness. At certain places, the program stops temporarily in a status called &ldquo;Stationary mode&rdquo;. In the stationary mode, several debugging functions are available.
A case study of office workstation use
Authors: Christine V. Bullen, John L. Bennett, Eric D. Carlson
Venue: Proceedings of the SIGOA conference on Office information systems (1982)

This paper describes the use of the Office Analysis Methodology to study a specific office environment in order to determine requirements for an advanced office workstation. The research site environment was unique in providing an opportunity to observe a natural growth pattern in the use of advanced technology. Specific workstation requirements were identified and are being implemented. Interesting observations are reported in the following areas: categories of secretarial work, use of existing workstations, influence of a community of users, access to shared services, and impacts on productivity and organizational behavior.
Design rule checking and analysis of IC mask designs
Authors: B. W. Lindsay, B. T. Preas
Venue: Proceedings of the 13th Design Automation Conference (1976)

An efficient method of producing logical combinations of integrated circuit (IC) masks in numerical form leads to a generalized design rule checking program. The union (OR), intersection (AND) and the complements, as well as topological classification and simple geometric operations, are provided through a set of LOGical MASk Checking (LOGMASC) commands, allowing the designer to construct, for the given IC technology, a tailored set of design rule checks. These range from simple tolerance checks to complex analysis of mask geometries based on pattern recognition.
An algorithm for drum storage management in time-sharing systems
Authors: Mark L. Greenberg
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

An algorithm for efficiently managing the transfer of pages of information between main and secondary memory is developed and analyzed. The algorithm applies to time-shared computer systems that use rotating magnetic drums as secondary storage devices. The algorithm is designed to provide efficient system performance when referenced pages are predominantly pre-loaded. However, the algorithm also provides optimum results for systems where all pages are loaded on demand. The nature of the improved performance which can be derived from page pre-loading strategy is discussed. Simulation results are presented which plot system performance as a function of main memory size.
A Loop-Free Asynchronous Data Sharing Mechanism in Multiprocessor Real-Time Systems Based on Timing Properties
Authors: Jing Chen
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

This paper presents an asynchronous data sharing mechanism for real-time applications with multiple writers. The mechanism is constructed from a fully asynchronous single writer data sharing mechanism implemented through a timing-based approach, which, being lock-free and loopfree, addresses the problems of priority inversion and unbounded blocking among real-time tasks running under priority-based scheduling. By replicating the single writer data sharing mechanism and modifying its data buffer access control function, the multi-writer data sharing mechanism is constructed such that the desired safety property and feasibility conditions on data buffer allocation are maintained by those single writer data sharing mechanisms. To address the issue on data coherence, all the writer tasks follow a data coherence protocol which is designed with the concept of timestamp ordering. The feasibility condition of this protocol is constructed through analyzing the timing properties of writer tasks. This multi-writer data sharing mechanism stands for another demonstration of the timingbasedapproach which is an effective alternative to the traditional algorithm-based approaches.
Segmented shape descriptions from 3-view stereo
Authors: P. Havaldar, G. Medioni
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We address the recovery of segmented, 3-D descriptions of an object from intensity images. We use three views of an object from slightly different viewpoints as our input. For each image we extract a hierarchy of groups based on proximity, parallelism and symmetry in a robust manner. The groups in the three images are matched by computing the epipolar geometry. For each set of matched groups from the three images, we then label the contours of the groups as "true" or "limb" edges. Using the information about groups, the label associated with their contours and projective properties of subclasses of Generalized Cylinders, we infer the 3-D structure of these groups. The proposed method not only allows robust shape recovery but also produces segmented parts. Our approach can also deal with groups generated as a result of texture or shadows on the object. We present results on real images of moderately complex objects.
Computer system simulation of an on-line interactive command and control system
Authors: Herman Fischer
Venue: Proceedings of the 5th conference on Winter simulation (1971)

A computer simulation model was used as an analysis &ldquo;tool&rdquo; for computer system design trade-offs for an on-line interactive command and control system preliminary design study project. Three basic hardware configurations were modelled at the hardware interrupt/byte flow level: a. A Centralized Dual Multiprocessor b. Dual Computers c. A Distributed System of Central and Remote Computers The software of the system was modelled in several modules: a. The Operating System Routines b. The Data Base Management Routines c. Interactive File Maintenance and Query Routines d. Object-Coded Functional Applications Programs e. Support and Control Software Each module consists of parametric descriptions for each corresponding loadable software module (e.g., load module size, re-enterability) and procedural descriptions (e.g., read/write statements, processing statements, calls to system macros and other subroutines). The simulation is conducted in two modes: A fast-forward mode to load-up the system, and an observation mode to collect detailed data. A history tape of the environmental stimuli (interactive operator loads) on the system, produced by a separate &ldquo;loading model&rdquo;, enters tasks into the system. The system model is implemented on the IBM 360, Model 65 Computer using a high level computer systems simulation language. The technique developed was so successful that it is now being actively used as a design tool and system performance evaluator, providing a means to minimize the technical risk in the development of all of Litton DSD's major software projects.
An interactive tool for program manipulation
Authors: Anne Adam, Paul Gloess, Jean-Pierre Laurent
Venue: Proceedings of the 5th international conference on Software engineering (1981)

An interactive system for understanding programs has been designed. This system provides informations about control structure and data flow. It also performs powerful semantic transformations that are checked for validity. The system relies on previously implemented algorithms that apply to a graph representation of programs.
SWAP&mdash;a programming system for automatic simulation, wiring and placement of logical equations
Authors: D. L. Richards
Venue: Proceedings of the 4th Design Automation Conference (1967)

The SWAP system consists of an interconnected set of computer programs whose general purpose is to aid in the design and fabrication of electronic equipment. The principal input to the system at this stage is a list of Boolean logical equations, which describe the design of a piece of digital equipment; for example, an airborne computer. Other possible inputs describe the logical, electronic and geometric properties of the circuit modules which are used to build the equipment, the geometric properties of the boards upon which these circuits are to be laid out, the symbols which correspond to the circuit elements, the time intervals over which simulation is observed, the placement of specific modules on the boards, and various options which are available to the program user. The final output of the SWAP system is a complete diagrammed layout of the equipment in the form in which it will be fabricated; the fabrication process is actually controlled indirectly by the computer output. A record of the logical behavior of the equipment during simulation can also be provided as well as a diagram of the final module layout and various listings which can be used to check the input.
Liberal arts education in computers
Authors: Joseph A. Komar
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

Why do we name a way of thinking about computer education 'Quantitative Methods'? As will be explained below Quantitative Methods (QM) has a unique view of computer processing. The outlook is not 'Computer Science' or 'Data Processing' or 'Information Systems' or 'Management Information Systems' or any other such title. If you get right to the heart of a digtal computer what do you find? Binary digits or quantities! The Q.M. philosophy advocates that given a set of binary digits - what methods do we apply to these to obain the results desired. Thus, the name Quantitative Methods. Admittedly, the name is unique (see i, p. 153) but the philosophy is also unique.
On updating buffer allocation
Authors: Ashok K. Thareja, Satish K. Tripathi, Richard A. Upton
Venue: Proceedings of the Computer Network Performance Symposium (1982)

Most of the analysis of buffer sharing schemes has been aimed at obtaining the optimal operational parameters under stationary load situations. It is well known that in most operating environments the traffic load changes. In this paper, we address the problem of updating buffer allocation as the traffic load at a network node changes. We investigate the behavior of a complete partitioning buffer sharing scheme to gain insight into the dependency of the throughput upon system parameters. The summary of the analysis is presented in the form of a heuristic. The heuristic is shown to perform reasonably well under two different types of stress tests.
A Hierarchical Modeling System for computer networks
Authors: Donald F. DuBois
Venue: Proceedings of the Computer Network Performance Symposium (1982)

This paper describes the Hierarchical Modeling System (HMS). HMS is a tool - a unified and expandable system - which supports the development of analytic and simulator models of computer networks. The same system and workload descriptions can be interpreted as analytic queueing models with optimization techniques or as discrete event simulation models. The rationale behind the development of HMS is that high level analyses incorporating analytic techniques may be used in the early design phase for networks when many options are considered while detailed simulation studies of fewer design alternatives are appropriate during the later stages.
Invited papers&mdash;1: classification in information storage and retrieval
Authors: O. E. Taulbee
Venue: Proceedings of the 1965 20th national conference (1965)

WHEN I WAS ASKED to give a tutorial paper on information storage and retrieval, my first thought was to give a state-of-the-art survey of the field. But then it was evident that much of the paper would be a &ldquo;state-of-the 'state-of-the-art'&rdquo; survey since there have been several recent review papers1, 2, 3. Classification is a much used, and sometimes abused, concept not only in information storage and retrieval but in many other endeavors. Since this is the case, it seems appropriate to attempt a definitive review paper covering the concept which pervades almost all aspects of the field of information storage and retrieval.
An introduction to modeling with INS
Authors: Stephen D. Roberts, James Schier, Thom Sulanke
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

INS (the Integrated Network Simulation language) facilitates modeling by freeing the modeler from the mechanics of programming a simulation model. Instead, the modeler characterizes the system as a network containing easily defined nodes and branches. The network is easily translated to INS statements from which INS constructs and executes the simulation model. Output is automatically provided to reflect various perspectives of system behavior. Features of INS allow easy enhancement of statistics and embellishment of the model. INS is easy to learn and potentially applicable to a variety of environments.
A maximal resolution guided-probe testing algorithm
Authors: Miron Abramovici
Venue: Proceedings of the 18th Design Automation Conference (1981)

The existing guided-probe testing procedures employ a simple strategy of following error path(s). This strategy may fail to locate faults (or may produce a wrong diagnostic) in the following situations: 1. Faults affecting lines connected to buses or wired-or junctions. 2. Faults whose error paths form closed asynchronous loops. 3. Faults which generate pseudo-intermittent symptoms. 4. Faults which do not propagate errors to the probed points. In this paper we introduce a new guided-probe algorithm which overcomes these difficulties. Our algorithm always achieves the maximal diagnostic resolution obtainable under the applied test.
The politics of Software Engineering
Authors: James A. Buss
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

&ldquo;Software Engineering&rdquo; has evolved from two disparate sources: business and aerospace. It has been used to advantage in these fields, and its poor reputation in academic circles derives mainly from unfamiliarity with what it is and where it is most useful. A major goal of this effort is to force definition and agreement onto processes which are not fully understood by everyone involved&mdash;as it turns out, most processes fit this mold. Reliability is another very important business software requirement. Aerospace and industry in general have emphasized the software design and implementation processes. Finally, a series of entrepreneurs and other thinkers have chosen portions of the software development process to expound upon, adding a few rudimentary psychological insights to the engineering approach and defining several methodologies for control of software implementation (Edward Yourdon and Michael Jackson are notable). A primary goal of these efforts has been control, often bureaucratic over software development. The germinal contributions of computer scientists (such as Edsger Dijkstra) cannot be ignored. These efforts have lately been aimed toward the development of software tools and improved programmer productivity.
I/O complexity: The red-blue pebble game
Authors: Hong Jia-Wei, H. T. Kung
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In this paper, the red-blue pebble game is proposed to model the input-output complexity of algorithms. Using the pebble game formulation, a number of lower bound results for the I/O requirement are proven. For example, it is shown that to perform the n-point FFT or the ordinary n&times;n matrix multiplication algorithm with O(S) memory, at least &Ohgr;(n log n/log S) or &Ohgr;(n3/@@@@S), respectively, time is needed for the I/O. Similar results are obtained for algorithms for several other problems. All of the lower bounds presented are the best possible in the sense that they are achievable by certain decomposition schemes. Results of this paper may provide insight into the difficult task of balancing I/O and computation in special-purpose system designs. For example, for the n-point FFT, the lower bound on I/O time implies that an S-point device achieving a speed-up ratio of order log S over the conventional O(n log n) time implementation is all one can hope for.
Integrated Algorithms for Newspaper Page Decomposition and Article Tracking
Authors: B. Gatos, S. L. Mantzaris, K. V. Chandrinos, A. Tsigris, S. J. Perantonis
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

The conversion of newspaper pages into digital resources is an important task that greatly contributes to the preservation and access to newspaper archives. In this paper, an integrated methodology is presented for segmenting newspaper page and identifying newspaper articles. In a first stage, a succession of image processing and document analysis algorithms is employed for segmenting newspaper page images into various objects (text, images and drawings, titles). A rule based approach is subsequently applied to the objects identified during the page segmentation phase for reconstructing individual articles. Experimental results, obtained from a large testbed of old newspaper issues, are presented which clearly demonstrate the applicability of our integrated approach to successful newspaper page segmentation and identification of newspaper articles.
Programmer Aptitude and Competence Test System (PACTS)
Authors: J. P. Seiner
Venue: Proceedings of the ninth annual SIGCPR conference (1971)

PACTS&mdash;Programmer Aptitude/Competence Test System&mdash;is a package consisting of procedures, software, instructions and problems designed to evaluate programmer competence and aptitude. From the preceding definitions the following four criteria have been selected as being the most important as well as&mdash;in most instances&mdash;the most easily observable and measurable: 1. Correctness. 2. Efficiency. 3. Compactness. 4. Completion Time. These four criteria are used in PACTS to evaluate programmer competence. The criterion-related validity of PACTS is, therefore, based on the definitions of a Good Programmer and a Good Program.
An overview of the design and verification subsystem of the Engineering Design System
Authors: L. N. Dunn
Venue: Proceedings of the 20th Design Automation Conference (1983)

The Engineering Design System is the base for design automation in IBM. Its newest addition is the design and verification subsystem (DAV). DAV has been designed to meet the future demands of very large scale integration (VLSI) for designer productivity and design correctness.
Planning for in-house software engineering education
Authors: Mehmet Ulema, Jack Larsen
Venue: ACM SIGCSE Bulletin (1984)

In summary, a rapidly changing technology, a tremendous growth of software based systems, a need to retrain current technical staff, the issue of programmer productivity, the lack of established educational programs in software engineering at local colleges, and the integration of theory with practical requirements are among the major factors which force us to implement an in-house educational program in software engineering. It was learned from personal interviews and several surveys that there is a general consensus among Hazeltine management that there is a need to establish a uniform approach to the software development process, and that education and training are essential parts in any effort to improve our software capabilities. This article describes a long term plan to meet the education and training needs. Analysis of the personal interviews, surveys of managers and engineers, and a literature search have made possible the identification of company needs and requirements and target populations. A three-part program is proposed, a system approach to meet the diverse needs of executives, managers, and engineers. The Executive Program, which will cover topics such as the nature of software related project management and development and its critical or &ldquo;risky&rdquo; aspects, consists of an intensive one day seminar for corporate executives annually. The Management Program, which will help managers to understand and apply procedures and techniques necessary to the cost effective development of high quality embedded software products, will consist of up to six seminar/workshops each year. The Engineering Program, which will deal mainly with teaching engineers how to make effective use of the modern tools and techniques employed in the software development process, will consist of a combination of workshops, in-house courses and recommended graduate courses at local universities, taking advantage of the existing tuition reimbursment program.
A computer simulation approach to elevator system design
Authors: Alton J. Penz
Venue: Proceedings of the 8th Design Automation Workshop (1971)

Computer simulation methods enable the architech to accurately analyze the performance of specified elevator systems, thus facilitating more careful evaluation of alternative system designs than previously achievable. Simulation improves analysis because it involves replication of real-time elevator performance and does not rely on the rules of thumb and statistical assumptions incorporated into traditional analytical methods. The development of a computer simulation program for elevators requires caution to ascertain that the assumptions incorporated into the program are satisfactory and that the resulting program performs reliably and accurately. An acceptable simulation program, such as the one presented in this paper, facilitates a variety of research efforts encompassing sky lobby and express car layout strategies, dynamic peak control procedures, and cost/benefit studies of system design goals.
Proving structured programs correct, level by level
Authors: R. Infante, U. Montanary
Venue: Proceedings of the international conference on Reliable software (1975)

Structured programs are developed and documented using levels of &ldquo;virtual machines&rdquo;. Problem-oriented data structures and primitives, at each level, are programmed in terms of those at the immediately lower level, until available programming constructs are reached. We suggest to extend this technique to assertions by expanding the involved predicates level by level. Using some &ldquo;level axioms&rdquo; We want to be able to prove any given level correct without looking at any further expansion of the primitive predicates at that level. The advantages are: i) The programmer may use problem-oriented predicates in the assertions; ii) the demand posed on the theorem prover (if any) is very limited; iii) it is possible to replace the levels not yet programmed with functionally different routines, provided the predicates are also expanded consistently.