ppxscal/embedding_network huggingface dataset:
Theory Net: An electronic mail system
Authors: Larry Landweber
Venue: Proceedings of the 1979 annual conference (1979)

Telemail, an electronic mail system for the Univac 1110, was designed and implemented by the Academic Computer Center at the University of Wisconsin with support from Edunet. At present, there are approximately two hundred users including several organized groups: Educom staff and university liasons; Theory-Net researchers in theoretical computer science; a USDA sponsored research project; and a group of experts on mental retardation services/materials/literature. Most participants in the above groups access Telemail via Telenet, a commercial packet switching network. In addition, the system is used by computer center staff and researchers at the university. The Theory-Net project, sponsored by NSF, involves the use of Telemail by a group of about thirty researchers in theoretical computer science at fifteen universities. The goal is to assess the value of an electronic mail system in facilitating interaction (and thereby research productivity) in a small research community. To date a number of Joint research projects have made use of the system. In addition, the 1978 Sigact Symposium Program Committee communicated via Telemail, The next phase of the project involves a substantial increase in the number of participants. Individuals from small schools having only one or two researchers in theoretical computer science will be given high priority.
APL programming: A psychological model
Authors: Raymond C. Hooker
Venue: ACM SIGAPL APL Quote Quad (1984)

This paper seeks to provide insights into the psychological dynamics of programming in APL. These insights should allow the practitioner to better approach the APL programming environment and may stimulate more in-depth, empirical research into these psychological dynamics. The paper approaches APL both as a language and as a system which maps problems into solutions. The paper is analytical versus empirical in nature. The author draws on the plethora of work related to the topic of the paper in the development of a model of programming in APL.
PAMSIM: A project management simulator
Authors: Carl B. Estes, Bruce E. Herring
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The purpose of the Project Activity Management Simulator (PAMSIM) is to provide a new means of teaching project analysis and management. An important ingredient of project management is the design and use of project control systems. Traditionally, project management has been taught in one of two ways. One way is the ordinary textbook-lecture-homework approach, in which project management control and analysis functions are treated individually. Another way is the case-study approach in which a real or imagined project is analyzed.
Graphs that are almost binary trees (Preliminary Version)
Authors: Hong Jia-Wei, Arnold L. Rosenberg
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

This paper studies embeddings of graphs in binary trees. The cost of such an embedding is the maximum distance in the binary tree between images of adjacent graph vertices. Several techniques for bounding the costs of such embeddings from above are derived; notable among these is an algorithm for embedding any outerplanar graph in a binary tree with a cost that is within a factor of 3 of optimal. A number of techniques for bounding the costs of such embeddings from below are developed; notable here are two techniques for inferring the presence of large separators in graphs. Finally, a number of characterizations are established of those families of graphs that are almost binary trees, in the sense that every graph in the family is embeddable in a binary tree within bounded cost.
Evaluation and performance of computers: application benchmarks: the key to meaningful computer evaluations
Authors: E. O. Joslin
Venue: Proceedings of the 1965 20th national conference (1965)

THE MOST IMPORTANT QUESTION in any evaluation of a computer should be, &ldquo;How long will it take this system to process my workload?&rdquo; If the system cannot do the workload, there is no point in asking how much it costs or any other facts about the system. With this thought in mind, it then becomes apparent why the technique used to determine the answer to this &ldquo;how long&rdquo; question becomes the most important item in any computer evaluation. Time does not permit a detailed discussion of both: why application benchmarks are the best of the timing techniques available, and of the method for setting up application benchmarks which will be truly representative of the applications to be run. Therefore, the second topic (Setting Up Application Benchmarks) has been chosen, because I believe most who have tried other timing techniques know there must be something better. I also feel that those who have used application benchmarks have limited their thinking to sequential processing systems and should now consider the preparation of application benchmarks for systems capable of multi-processing and/or multi-programming.
Ternary logic in a positional control system
Authors: H. T. Mouftah, K. C. Smith, Z. G. Vranesic
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The application of COS/MOS integrated circuits in the construction of a three-valued positional control system is presented. A unit-distance ternary code and the design of a ternary encoder are given. A ternary code converter able to translate this unit-distance code to the signed ternary code is described. A ternary threshold level detector is required to convert a noisy, slowly-changing, analog voltage into an abrupt digital logic change at required threshold levels. A three-valued comparator is constructed to compare the reference signal with the one fed back, and to supply an error signal. The logic design of the ternary control circuit is also presented.
An implementation system for designing computer-based experiments
Authors: Robert J Meeker, Gerald H Shure, Alvin S Cooperband
Venue: Proceedings of the 1971 26th annual conference (1971)

LIS (Laboratory Implementation System) is a system for implementing experimental research designs in a computer-based behavioral science laboratory. The system is designed to support investigators in all phases of experiment development, from the initial conception, through prototype development, to data-gathering experimentation; the system design emphasis is on providing a rapid transition from initial specification to a prototype version that can be operationally reviewed and easily modified. LIS, as it currently operates, is a man-machine system which utilizes an &ldquo;interaction machine,&rdquo; an incremental assembler, and a pseudo-compiler. Interaction programs, compiled from an investigator's natural language description of his experiment, are in the form of transition matricies, which, when interpreted, produce an operational version of the experiment. The components of the system are described. Applications to design implementation, in areas other than behavioral science experimentation, are suggested.
Introduction to the WELLMADE design methodology
Authors: Donald L. Boyd, Antonio Pizzarello
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

An overview of a design methodology called WELLMADE is presented. WELLMADE is a synthesis of results obtained from recent research on software engineering and the experience gained at HIS/Phoenix. The principles, procedures, and notation of WELLMADE are briefly outlined and an example is presented, illustrating the approach for deriving correct programs and the notation for its design specification.
An algorithm for searching shortest path by propagating wave fronts in four quadrants
Authors: Xiong Ji-Guang, Tokinori Kozawa
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper discusses a new algorithm for searching the shortest path in VLSIs by propagating wave fronts in four quadrants. The algorithm has been experimentally programmed in FORTRAN IV on a Hitac M-200H computer. The main advantages of this algorithm are: 1. When there is a shortest path between two points, it can always be found by this algorithm; 2. In this algorithm, searching waves are divided into four quadrants. In each quadrant, waves advance or trace-back independently, according to their own rules. Therefore, in the algorithm only the current waves and the next set of waves need to be remembered, irrespective of their history. Thus much less memory(about 1/10~1/100) is required than for Lee's algorithm1); 3. During searching for a shortest path in this algorithm, only segments currently defined need to be investigated. This greatly cuts down operation time, when compared to for Lee's algorithm; 4. This algorithm may be more advisable than Lee's algorithm for application to multi-layer wiring.
Illumination Invariant Background Extraction
Authors: Emrullah Durucan, Joel Snoeckx, Yves Weilenmann
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper proposes a new method for the extraction of background objects, especially the extraction of randomly moving objects such as curtains and plants. For this purpose we use an Optical Flow method combined with Split and Merge algorithm to avoid the mentioned background effects. The Split and Merge algorithm is based on the variance of regions and the Optical Flow method is implemented conform to the proposition of Horn and Schunck [1]. To further increase the robustness and utility in surveillance circumstances, illumination invariance has to be provided by the algorithm. Hence we combined the mentioned methods with an illumination invariant change detector.Tests have been performed on indoor and outdoor surveillance sequences. Especially in indoor sequences the proposed method provided a very robust tool against illumination changes, reflections, shadows and randomly moving objects like curtains and plants. Nevertheless in all circumstances it detected the moving 'semantic' objects such as persons.
Job enrichment: A case history
Authors: Rex Norman Cobb
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

Until eighteen months ago the Missouri Pacific Railroad had special groups to perform each major function of the system development effort for online, realtime systems. Under this organization there were 140 professional data processors (managers, analysts, and programmers) assigned among four groups consisting of Functional Design, Program Design, Applications Programming and Applications Testing. A project would be initiated in Functional Design where user requirements were identified and the general processing strategy was defined and documented in functional specifications. These specifications were then used by Program Design to develop and document detailed processing strategy through program flowcharts. As a project would progressively move through the groups toward completion, only a few people were involved in the project from its beginning to its completion. The most conspicuous continuity for any project was a &ldquo;coordinator&rdquo; assigned from an administrative Planning and Control group from outside the systems development area. In addition to the project coordinator, an administrative planner from the Project Planning and Control group would develop PERT charts and conduct schedule reviews for the project. The first true project that actually began under the new project concept was the Crew Management System. This project is virtually independent of all other development efforts and provided a basis for experimentation with project management concepts at the Railroad.
Animation of output applied to manufacturing capacity analysis
Authors: D. J. Medeiros, John T. Larkin
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

A general purpose technique for animating simulation output is described. The technique can be implemented using inexpensive hardware and is applicable to many types of simulation models. An example which uses the procedure for capacity analysis in a job shop is presented.
A very easy hierarchical DBMS implementation
Authors: Tamira Bonar, James Driscoll
Venue: Proceedings of the 1979 annual conference (1979)

The implementation of a DBMS offering a hierarchical view is described. The implementation follows a unique architecture designed to simplify DBMS implementation. The architecture incorporates basic physical storage constructs for specifying actual data storage structure, and primitive physical navigation operations for the purpose of implementing data manipulation commands. A brief discussion of the overall architecture, the physical storage language, and the physical navigation language are included here. However, the purpose of this paper is to present the physical storage scheme used within our DBMS and to explain the manner in which our hierarchical data manipulation commands are implemented. Our goal is to make apparent the ease with which our DBMS was implemented.
Experiences with a continuing education seminar: &ldquo;Computers for small business&rdquo;
Authors: William E. Leigh,  Jr.
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

An ongoing, evening seminar concerning the selection and use of computers in small business is described. The factors affecting the attendee response to each of the four offerings and the course format as currently evolved are discussed.
Edisim and Edicap: Graphical simulator interfaces
Authors: Dwight D. Hill
Venue: Proceedings of the 20th Design Automation Conference (1983)

Edisim and Edicap are new CAD tools that greatly simplify the use of simulation in LSI design. Unlike previous simulator systems which require the user to type in commands textually, the edisim/edicap user works directly from the chip layout displayed on a color monitor. Input nodes are identified merely by pointing to them. This eliminates the problem of referring to internal nodes by names which are often artificial and arbitrary (e.g. &ldquo;c10.mp2&rdquo;). Likewise, simulation results are also displayed on the color screen. Edisim works at the logic level, and makes use of the switch-level simulator &ldquo;isim&rdquo; [Szym 81]. Edicap works at the analogue voltage level, and is based on the timing simulator &ldquo;emu&rdquo; [Ackl 81]. In edisim results are displayed by modulating the layout according to logic state: logic one is displayed in bright colors, logic zero as dark rectangles, and the X state as a rectangle with an &ldquo;x&rdquo; through it. Edicap can display results in a similar way, except that the X state corresponds to a voltage somewhere between the logic 0 and logic one threshold, rather than an unknown quantity. Edicap can also produce waveform plots of selected nodes merely by pointing to them on the color screen. Compared with the textual interface provided by most simulators, the graphic interface of edisim and edicap is simpler to learn and faster to use for both the novice and the experienced designer.
A vehicle for developing standards for simulation programming
Authors: Henry Kleine
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

The objective of SDDL is to provide an effective communications medium to support the design and documentation of complex software applications. This objective is met by providing (1) a process or which can express design specifications in an intelligible, informative, machine-reproducible document, (2) a design and documentation language with forms and syntax that are simple, unrestrictive, and communicative, and (3) methodology for effective use of the language and processor. The application of SDDL to the specific problems of simulation models is discussed, with emphasis on the potential of SDDL for developing and specifying design and documentation standards for simulation and modeling.
Providing reliable networks with unreliable components
Authors: Howard Frank
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

Most terminals utilize transmission lines only a small fraction of the time. They send and receive messages intermittently, and the message transmission time usually lasts no more than a few seconds. A common method to efficiently utilize transmission line capacity is to connect several terminals onto one line so that the line can be shared. Lines so structured are called multidrop or multipoint lines. A typical teleprocessing network configuration is shown. With rare exceptions, the multidrop lines are in tree-like structures [1], [2].
Technical market analysis using a computer
Authors: John Hansen
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The subject of this paper is the use of an electronic computer for the technical analysis of stock charts. No new methods for prediction of stock fluctuations will be presented; but merely procedures currently being developed for speeding up the use of some well-known methods. These procedures are being developed under contract with one of the large New York brokerage houses as an initial step in the use of electronic computation for accomplishing day-to-day market analysis.
Toward better information and analysis support services for the congress
Authors: Kenneth W. Hunter
Venue: Proceedings of the 1971 26th annual conference (1971)

The 91st Congress took several preliminary steps toward improving its information handling and analysis support capabilities. Since the Congressional enviroment is very complex and the needs are significant and varied, the support services are complex in their inter-relationships and will be difficult to coordinate. Four systems and service concepts presented for consideration are (1) a general information and analysis service support, (2) an evaluation system, (3) a legislative transaction information system, and (4) a legal information processing and retrieval system.
MIDAS an on-line real time material system
Authors: Richard S. Hall
Venue: Proceedings of the 14th Design Automation Conference (1977)

The MIDAS Program (Material Inventory Data Acquisition System) came on-line at the MMA Orlando Division in July 1976, affording the Orlando Division a real time system that effectively controls the logistics of material and attendant paper work from engineering release through to work-in-process disbursal. This basically paperless system (forms and reports reduced 95%) as developed, moves the Materiel Division operations, including status, from a batch control mode to an instantaneous real-time response and activity for all facets of the division's responsibilities that embrace the status of material.
The aircraft movement simulation model
Authors: Michel A. Thomet
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The following paragraphs describe a computer program for simulating the movements of aircraft on the apron, taxiways, and runways of an airport. The purpose of this program is to enable the airport planner to evaluate the performance of a given airport layout from an operational point of view. Likewise, he can compare alternative layouts, investigate the impact of a change in airport activity (flight schedule), or assess the impact of an unusual situation (closing of a runway). The inherent assumptions of the model are discussed, and the various output reports and graphics are illustrated and explained.
Uses of APL in a manufacturing environment
Authors: Howard W. Gutzman, Edwardo Kellerman
Venue: Proceedings of the international conference on APL (1982)

This paper describes the use of APL as a node of a high speed communications network. APL is used by the engineering community for statistical data analysis and for the creation of reports. These results are used to keep management informed of manufacturing status and to improve process control.
Transmission line models, a unified physical network approach
Authors: Sergio Bernstein
Venue: Proceedings of the 13th Design Automation Conference (1976)

Digital signals in high-speed computers and communications systems require that even short interconnections be treated as transmission lines, and existing circuit analysts programs (ECAP-II, ASTAP, SCEPTRE, I/TRAC-II) have been used effectively to model lossless and non-dispersive lines. Now, simple networks have been developed which can model accurately the effects of dispersion due to resistance and skin effect, of homogeneous, linear, transmission lines and cables. They can be used with any presently available circuit analysis program, to obtain efficient and accurate simulations. Theoretical responses of lines having large resistance and/or skin effect losses can be approximated to an accuracy of &plusmn;2% over a range of 0.1 to 500 time constants, and a single network configuration can be used to model any type of losses, simply by changing the component values.
Input data collection and analysis
Authors: W. David Kelton
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper reviews perspectives and methods for specifying distribution and process forms and parameters from which observations are drawn to drive a stochastic simulation. All phases of input data analysis are covered, including data collection, choosing a modeling distribution, estimating parameters, and goodness-of-fit testing. A discussion is also presented concerning the debate over the desirability of fitting &ldquo;standard&rdquo; distributions to data as opposed to using a direct empirical distribution. Available software packages with a simulation orientation are also described.
Office form definition and processing using a relational data model
Authors: Bogdan Czejdo, David W. Embley
Venue: Proceedings of the second ACM-SIGOA conference on Office information systems (1984)

Office forms have a particular structure and semantics that make them a suitable communication medium. The Natural Forms Query Language, NFQL, capitalizes on these features of ordinary forms to provide a communication language between human beings and the computer. Given a form, NFQL analyzes it to deduce plausible interpretations and then generates database queries and function specifications applicable to the form. This paper explains how NFQL recognizes computational relationships between arguments and results and formulates function specifications. General rules are given, in terms of a relational data model, that can resolve computational relationships for ordinary forms.
Loop tracing in PEP-PERT networks
Authors: Joel M. Prostick
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The problem of incorrect input data associated with most data processing applications is magnified in PEP-PERT systems because of the interrelation of the various events. When this incorrect input takes the form of a looping network, the result may be a halt in the computer program, often necessitating a manual search of the computer memory dump to determine the trouble. If a network has more than one loop this procedure must be repeated for each loop. This paper describes a method which has proved to be an excellent solution to this problem; it is a computer technique for editing a complete PEP-PERT network and describing any and all loops therein.