ppxscal/embedding_network huggingface dataset:
A comparison of channel-management algorithms for reversible data channels
Authors: T. F. Fitzsimons
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

This paper has presented a comparison of several channel-management algorithms for a variety of medium-speed data systems. It has pointed out (1) the various ways that the physical and electrical connections may be established, (2) the different channel turn-around algorithms being used, and (3) the ways the physical and electrical connection may be released. Finally, a set of algorithms for channel management has been recommended for use in generalized systems.
Numerical applications: Cycle algorithms for undirected linear graphs and some immediate applications
Authors: J. T. Welch,  Jr.
Venue: Proceedings of the 1965 20th national conference (1965)

THE ANALYSIS OF GRAPHICALLY presented data, such as the structural diagram of a chemical compound, or a model of information flow in a system design, is becoming increasingly important as technology advances. In the interests of accuracy and lower costs, it is often desirable to mechanize the analysis completely. Here we shall present a mechanical procedure which finds all cycles (i.e., simple elementary cycles1) of a finite undirected linear graph, given an array called the incidence matrix of the graph. The procedure consists of three algorithms: algorithm 1, which determines a basic set of cycles from which all others can be generated; algorithm 2, which assigns an ordering to the basic cycles; and algorithm 3, which generates all remaining cycles. An immediate application of algorithm 1 will be illustrated, and the same will be done for algorithm 3. The examples used must necessarily be simplified. This should not obscure the objective, which is to suggest algorithms of sufficient generality for computer, or at least mechanical, application. A more complete treatment of the algorithms themselves, with necessary proofs, will follow in a later paper5.
From mainframe to micro: Moving a freshman computer course
Authors: G. E. Galloway
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

In 1980, the US Military Academy decided to move its 1300 freshmen computer course from a mainframe to micro computers. This paper describes the transfer exercise and the lessons learned in the process of making such a transfer.
A comparison of methods for simulating computer bus architectures
Authors: Larry Wear
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper describes three methods that were used to investigate multiprocessor bus architectures. The models described were implemented in FORTRAN, GPSS, and SIMULA. Characteristics of the three implementations, such as program length, program memory requirements, execution time and ease of use are compared. Results of the simulation of a single bus system are presented to show how the various parameters affect system performance.
Isomorphism for graphs embeddable on the projective plane
Authors: David Lichtenstein
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

There are no known polynomial time algorithms for graph isomorphism. For certain classes of graphs, however, efficient algorithms have been found. In particular, there is a polynomial time algorithm for isomorphism of planar graphs [4,5]. This paper presents a generalization of the third theorem to the projective plane, allowing a straightforward adaptation of the planar algorithm to the projective plane. Gary Miller has subsequently generalized my result to surfaces of arbitrary genus, so that there is now a graph isomorphism algorithm which is polynomial for any fixed genus.
A checking method of wiring
Authors: Yoshiaki Koga
Venue: Proceedings of the 7th Design Automation Workshop (1970)

This paper presents a failure mode analysis, including multiple failures, for transmission line wiring on back planes or multilayer printed circuit boards. A checking method sufficient to locate these failures by means of automatic test equipment is discussed.
The programming curriculum of the ADP management training center
Authors: Frederick G. Harold
Venue: Proceedings of the twelfth annual SIGCPR conference (1974)

I'd like to discuss with you a programmer training curriculum in a larger computer-based training effort with two primary objectives: 1) to provide a broad range of training in vendor-independent ADP topics for interagency government audiences; 2) to minimize the problems inherent in a situation permitting little control over students (in terms of selection, evaluation, and follow-up).
Use of simulation in support of development and testing of submarine subsystems
Authors: James O. Goodburn, Robert A. Massarotti
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

The purpose of this paper is to describe an existing real-time digital simulation which is utilized in the testing and integration of submarine subsystems. The testing and integration effort involves both the hardware and software verification. Advanced fire control systems are not only composed of new hardware but also larger and more sophisticated software systems. The only way to test and check-out these systems in a laboratory environment is with simulation. The simulation provides dynamic stimulation of the submarine's Central Computer Complex (CCC) within which the fire control software resides, and provides all of the necessary quantities needed to drive the Central Computer Complex in a controlled simulated environment.
A rectangle-probe router for multilayer P.C. boards*
Authors: W. G. Cage, R. J. Smith,  II
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper describes an effective implementation of a rectangle probe interconnection routing algorithm. The router successfully handles multilayer boards with foil conducting paths of various widths. Connections defined by the router may utilize one or more conducting layers. Objectives to be achieved by the router are discussed, and implementation features related to these requirements are presented; data and control structures are briefly described. Routing performance and experiments indicating sensitivity to variations in algorithm or problem definition are presented. The subject router is in production use as part of the DASLL [1] design automation system at Lawrence Livermore Laboratory.
Simulation modeling workshop
Authors: William E. Biles
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

The crucial phase in simulating a real-world system is the formulation and development of a credible model of that system. This workshop examines selected phases of model development, including (1) development of flow charts describing the mathematical-logical operation of the system, (2) the translation of this mathematical-logical model into a computer program, and (3) the verification and validation of the computer model. These concepts are illustrated through an example involving sampling inspection of roller bearing assemblies. Practical exercises will be conducted. This workshop is tutorial in nature and emphasizes the fundamentals of simulation modeling.
A simulation analysis of a hospital emergency department
Authors: Edward L. Hannan, Richard J. Giglio, Randall S. Sadowski
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

This paper describes the application of a FORTRAN simulation model in evaluating the potential influence of new patient demand patterns and different administrational decision policies upon the effectiveness of a hospital emergency department. In particular, the study investigated the consequences of increased demand, a higher percentage of true emergency patients, installing laboratory and x-ray facilities in the emergency department, triaging patients and scheduling non-urgency patients to smooth the demand. Total patient time in the system, times until first seen by a nurse and physician, and staff utilization percentages were used as measures of effectiveness.
Real world scene analysis in perspective
Authors: Bruce L. Bullock
Venue: Proceedings of the 1975 annual conference (1975)

This paper examines the applicability of current scene analysis techniques to real world problems. The majority of the current techniques have been developed for simple scenes with straight lines, simple shapes, good contrast, and little texture. This paper shows several examples illustrating that many of these techniques are directly applicable to real world problems, particularly the schemes for finding primitive scene information. It is also shown, however, that the achievement of significant real world analysis requires further development of the representations of complex shapes and texture, decision processes specific to spatial problems and realistic control techniques that utilize every piece of available information. Finally, the concept of a full system is advocated as a paradigm that has more promise than the past piecemeal approach.
Computer graphics: An aid to management in the Federal Government
Authors: Gerald Moon, Larry Cornish, Richard Schulman, John Staudhammer
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The panelists in this session will explore the use of computer graphics in the Federal Government for decision making and facilities' management. Commander Richard Schulman, Department of the Navy, will speak on computer-aided design as used by the Navy, and the Navy's leadership, under his command, in the standardization of graphics applications. Dr. John Staudhammer, a consultant to the Army and a representative of the Integrated Software Research and Development Council, will discuss graphics applications in Army management. Government health services will be represented by Gerald Moon, Deputy Division Manager of the Office of Material Management, Social Security Administration, who will discuss computer graphics and facilities' management. Finally, Larry Cornish, Director of Graphics at the Bureau of the Census, will discuss graphics as an aid to the Executive Office of the President and within the Census Bureau itself.
&ldquo;Free&rdquo; computer too expensive
Authors: Ronald S. Lemos
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

(This paper has been accepted for publication in the Proceedings, but the photo-ready form was not delivered in time. Copies of the paper should be available upon request at the presentation.)
A generalized interpretive simulator for a class of spaceborne computers
Authors: Richard T. Curran, William A. Hornfeck, Bobby C. Hodges
Venue: Proceedings of the 1st symposium on Simulation of computer systems (1973)

This paper describes the design of an instruction level simulator for a class of Space Ultrareliable Modular Computers (SUMC), which addresses several interesting problem areas. For example, host computer independence, parameterization of target computer architectural features, and utilization of a FORTRAN subset as the source language are critical problems encountered during the design. The simulator implementation progresses in two stages: construction of a stand-alone interpretive simulator and integration of the stand-alone version into a &ldquo;host independent&rdquo; supervisory system. The development host computer, based on availability, was the IBM 7094. Concurrent development of the SUMC supervisory software and the stand-alone simulator permitted evolutionary feedback on host independence problems and allowed validation of the simulator modules prior to the availability of the supervisor. The paper discusses (1) the functional requirements for the SUMC interpretive simulator program; (2) the host computer independence criteria to be met; and (3) the basic design strategy used in implementing the simulation program. In addition, a list of readings which provided background material for the development of the simulator is presented.
A computer science curriculum for a two year upper division university
Authors: Toby S. Berk, Malcolm H. Gotterer
Venue: ACM SIGCSE Bulletin (1976)

Florida International University is a two year upper division University in the State University System of Florida. The Mathematical Sciences Department is located within the College of Arts and Sciences, and offers three undergraduate major programs: mathematics, computer science, and statistics. The computing facilities available are quite good. The computer center operates a UNIVAC 1106 with an adequate array of peripherals, terminals, and memory. In addition, the department owns a NOVA 2/10 mini-computer and an IMLAC PDS-4 intelligent graphics system.
Modeling the office structure: A first step towards the Office Expert System
Authors: Luigia Aiello, Daniele Nardi, Maurizio Panti
Venue: ACM SIGOA Newsletter (1984)

A structural description formalism for the construction of office models is proposed. In this formalism an office is represented in terms of interacting agents. Each agent is characterized by a structural component and a specification of the office functions he is enabled to perform. The advantages of our approach to office modeling are generality and flexibility. In fact, the formalism allows to model various kinds of office organizations and to reflect changes and updates in the office structure. The model is intended to be the basis for the construction of an integrated Office Information System and of an Office Expert System which is a tool for decision making in the domain of office organization.
Self-Training Statistic Snake for Image Segmentation and Tracking
Authors: X. M. Pardo, P. Radeva, J. J. Villanueva
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this work we propose a new supervised deformable model that generalizes the classical contour-based snake. This model is defined to deform in a feature space generated by a set of Gaussian derivative filter responses. The snake selects and classifies image features by a parametric vector that gives the direction in the feature space minimizing the dissimilarity between the learned and found image features and maximizing the distance between different contour configurations. Each snake curve patch is devoted to search for a special contour configuration. The classes corresponding to different contour configurations are obtained by means of a statistic supervised learning technique using samples of different contour and no contour points. The snake starts with a large set of Gaussian filters that is reduced by means of principal component analysis in a supervised way to optimize it in the feature search.
Electronic circuit analysis with on-line graphs via a time-sharing terminal
Authors: Sergio Bernstein
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

A description is given of a circuit analysis program which was modified specifically for operation in a conversational time-sharing environment. Program features which facilitate communication and interaction between the engineer and the computer include: 1) Input from a remote terminal with complete language checking routines which allow input errors to be detected and corrected immediately, without aborting the run. 2) Automatic tab to column 7 by means of an asterisk (*). 3) File management capability within the program, permitting automatic storage of correct input cards for future runs. Input from a previously written and stored file is also possible. 4) Editing capability: the data in a file may be listed, changed, or deleted line by line. 5) Selective output capability, permitting selection of up to 12 random branch or node output variables. Furthermore, graphical output is available both &ldquo;on-ilne&rdquo;, or on the line printer for &ldquo;batch&rdquo; jobs. The program will handle circuits up to 40 nodes and 120 branches; it requires 22,000 24-bit words of memory (66K Bytes) when segmented into five links. An on-line demonstration will be presented at the conference site using a &ldquo;2741&rdquo; terminal, with Data-Phone connected to the Perkin-Elmer Time-Sharing Computer in Norwalk, Connecticut.
Teaching new technologies (Panel Discussion)
Authors: Ronald Frank, Allan Waren
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

One of the more difficult tasks in this era of adopting curriculums, is to keep a program current with technology. There is a growing number of new hardware, software, and concepts that emerge each year. The speakers will share their experiences in bringing to the classroom the new technology that the students will face or should be facing as professionals in the marketplace. The discussions will focus on implementation of courses in Computer Graphics, Decision Support Systems, and Artificial Intelligence. These courses have been taught at all levels (undergraduate, graduate, Executive MBA) in Computer Science and Business environments. The speakers will also hold a discussion on questions from the audience.
The consequences of one's first programming language
Authors: Richard L. Wexelblat
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

Who has not seen programs written in one programming language that have the style of another language? Having experienced &ldquo;Fortran with semicolons&rdquo; and &ldquo;C with a BASIC flavor&rdquo; over the years, it occurred to me to wonder whether the programmer's first programming language had an effect on programming ability as profound as the effect of one's native language on one's thought patterns. Over many years of programming, teaching programming, and debugging other people's programs, it seemed to me that something akin to the Sapir-Whorf Hypothesis applied to programmers&mdash;especially those who have never been taught to abstract the development of algorithms from the development of programs. Indeed, I began to worry about the consequences of loosing on the computer centers (and computer science departments) of a horde of programmers whose total background is a rudimentary BASIC learned in elementary or high school from a teacher who has virtually no actual programming experience.
The Mathematical Programming Language (MPL)
Authors: George B. Dantzig, Stanley C. Eisenstat, Thomas L. Magnanti, Steven F. Maier, Michael B. McGrath
Venue: Proceedings of the 1971 26th annual conference (1971)

The Mathematical Programming Language (MPL) is a high-level user-oriented programming language intended particularly for developing, testing, and communicating mathematical algorithms. Presented here is an introductory discussion of the language. The major emphasis is on the need for MPL, the resulting design philosophy, and those characteristics that make the language read like mathematics. An example has been included.
Garbage collection and task deletion in distributed applicative processing systems
Authors: Paul Hudak, Robert M. Keller
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

The problem of automatic storage reclamation for distributed implementations of applicative languages is explored. Highly parallel distributed systems have several unique characteristics that complicate the reclamation process; in this setting, the deficiencies of existing storage reclamation schemes are thus noted. A real-time, effectively distributed, garbage collector of the mark-sweep variety, called the marking-tree collector, is shown to accomplish reclamation in parallel with the main computation, with no centralized data or control other than a logical rendezvous between phases of the collector. In addition, it is capable of finding and subsequently deleting active processes which are determined to be no longer relevant to the computation.
Placement algorithms for custom VLSI
Authors: Kenneth J. Supowit, Eric A. Slutz
Venue: Proceedings of the 20th Design Automation Conference (1983)

Algorithms are presented for placement and for modifying existing placements to be used in channel routing solutions for custom VLSI layout. The placements are produced so as not to have channel routing order constraint cycles, which constitute a familiar problem for custom VLSI. The algorithms are based on mathematical results characterizing the structure of channel routing order constraints.
The &ldquo;cultures&rdquo; of microprogramming
Authors: Nick Tredennick
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

I discuss four &ldquo;cultures&rdquo; of microprogramming. I call them: the Commercial Machine Culture, the Bit-Slice Culture, the Microprogrammable Machine Culture, and the Single-Chip Culture. Commonly used microprogramming terms mean different things to people from different cultures. I define the cultures and then contrast some microprogramming folklore with realities from my culture (the Single-Chip Culture). When you read or hear statements about microprogramming, know which culture is speaking. I hope discrepancies between some folklore and reality in the single-chip case will convince you it's important.
The data access and transfer support in a local heterogeneous network (HMINET)
Authors: R. Popescu-Zeletin
Venue: Proceedings of the sixth symposium on Data communications (1979)

The following paper presents a local heterogeneous network, the HMINET. The adopted software architecture identifies a data access and transfer level. The higher level applications afford a mechanism for data access and transfer to alleviate the effects of the incompatibilities and the differences between the data management systems. The paper describes the major problems and design decisions we adopted for the Data Access and Transfer System (DATS).
A network approach to microcomputer support
Authors: L. T. Parker, Barry L. Berman
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Beginning its operation in 1967, the North Carolina Educational Computing Service (NCECS), a division of the University of North Carolina General Administration, is the central organization for a network of 57 institutions in North Carolina. NCECS was organized in connection with a centralized approach to delivering computing service. One major advantage of terminals to a central facility such as NCECS/TUCC is that users have access to a large central library of instructional software. Because there continue to be good reasons to share the costs of people and the people-related costs of software and of information dissemination, even if more and more of the computing is performed on decentralized equipment, NCECS has begun to provide microcomputer support on a statewide basis. The content of this paper describes the nature of that support.
A concept for the editing of hardware resulting in an automatic hardware-editor
Authors: Franz J. Rammig
Venue: Proceedings of the 14th Design Automation Conference (1977)

It is the aim of this paper to investigate a system, which, with no manual or mechanical interference, permits the building, changing, processing and destruction of real (not simulated !) digital hardware. It can be seen, that by the above nothing else than a hardware-editor is outlined. Therefore first a &ldquo;mini-model&rdquo; of a usual text-editor is given within this paper. Then this model is transferred to problems of the editing of hardware. The main problem in particular, i.e. the problem of keeping the timing under control, will be discussed on the basis of an exact algebraic model of the time-behaviour of digital circuits. The result of these discussions will be the concept of an automatic hardware-editor. Finally a realization of this concept built by the author within the University of Dortmund, W. Germany, will be discussed.