ppxscal/embedding_network huggingface dataset:
A minimum area VLSI network for O(logn) time sorting
Authors: G. Bilardi, F. P. Preparata
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

A generalization of a known class of parallel sorting algorithms is presented, together with a new interconnection to execute them. A VLSI implementation is also proposed, and its area-time performance is discussed. It is shown that an algorithm in the class is executable in O(logn) time by a chip occupying O(n2) area. The design is a typical instance of a &ldquo;hybrid architecture&rdquo;, resulting from the combination of well-known VLSI networks as the orthogonal trees and the cube-connected-cycles; it also provably meets the AT2&equil;omegan2log2n) lower bound for sorters of n words of length (1+\epsilon)logn(\epsilon > O).
A simulation model for scheduling mechanized postal plants
Authors: Karl Buckthought, Muhammad Naqi, Vincent M. T. Wong
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

This is a computer model to produce manpower schedules for a mechanized letter processing plant. The simulation takes into account entering mail volumes of various classes of mail, despatch deadlines, and machine availabilities, over a 24 hour period. It produces a schedule showing machine and manpower requirements for each half hour. Complexity of the system necessitated a novel approach to simulation which may have applications to other complex systems.
Simulation in GPSS/360 of a highway paving operation using a mobile central-mix plant with different haul truck speeds and fleet size combinations
Authors: Edwin L. Bidwell
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The simulation program was written to describe a concrete highway paving operation using mobile central-mix plant and slip form paver, in combination with different truck haul fleet sizes and truck speeds. The trucks queue at the plant, load, travel to the slip form paver, queue, unload, and then complete the cycle by returning to the plant. Because the distance, plant to paver, first decreases and then increases as the paving strip moves toward the plant, passes in front, then moves away in the other direction, the trucks' mean arrival rate is not constant. The program is completely probabilistic and provides for truck fleet size, truck haul speed and rate of paving progress to be treated as variables.
Input-directed program design
Authors: Luigi Logrippo
Venue: Proceedings of the ACM '81 conference (1981)

In spite of their importance in the world of computing, business data processing programming techniques have scarcely been studied in the recent literature on program verification and program synthesis (see among others (D, Jo)). Some authors seem to tacitly assume that business data processing programs are straightforward and can be constructed according to the same principles that apply to well-studied programs such as factorial, greatest common divisor, or sorting. Within a completely different research framework, Warnier (W) and Jackson (J) have shown that these programs indeed are structurally interesting and have their own rules of construction (see (CY) for a tutorial on these ideas). This paper attempts to bridge the gap existing between these two schools of thought.
Matrix bandwidth minimization
Authors: Richard Rosen
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

In the analysis of a structural problem by the finite element method, a large order stiffness matrix is created which describes mathematically the inter-connectivity of the system. The structure is defined in three dimensional space by discrete points called nodes. Each node is represented by its coordinates in the space. The nodes are then connected by the various finite elements that the particular computer program may utilize. (i.e., bar members, rectangular or triangular panels, three dimensional tetrahedrons, etc.)
Automation of re-entry vehicles' preliminary design
Authors: John M. Jeglic, Roy F. Sewall, C. David Magrath
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

The science of computer graphics is gaining undisputed momentum in the rapidly growing computer field. While it is true that automated drafting has had a measurable effect on design technology, particularly in the reduction of costs, one cannot classify it as automated design. Automated drafting simply permits the designer to automate the final phase of his work and to either increase the quantity, and possibly the quality, of the final output of drawings, or to give him more time for creative thinking. The automated design, however, involves not only the preparation of drawings, but actually organizes the designer's thoughts, the design constraints, the manufacturability, and the cost of implementing the design; it may consider other possible problems, such as stress, vibration, weight, temperature, material selection, etc. Shortly after the first successful flight of General Electric's Mark 2 re-entry vehicle, thoughts were given to at least partially automate the preliminary calculations of the basic design problems of determining the centers of gravity and pressure of the proposed re-entry vehicle shapes. The resulting computer program was, of course, rather rudimentary, but its usefulness prompted a continuing effort of development and improvment. Today, after several iterations, a sophisticated computer program exists which not only performs the preliminary re-entry vehicle design and its evaluation, but actually prepares the graphic layouts necessary to delineate the selected computer-produced vehicle design configurations.
MILD - A cell-based layout system for MOS-LSI
Authors: Koji Sato, Takao Nagai, Mikio Tachibana, Hiroyoshi Shimoyama, Masaru Ozaki, Toshihiko Yahara
Venue: Proceedings of the 18th Design Automation Conference (1981)

A standard-cell-based layout system for MOS-LSI termed MILD is reported. MILD has several features which seem to be profitable from the practical viewpoint of LSI developers; one of them is that macro blocks such as memory cells can be contained in the chip laid out.
A method for teaching programming
Authors: Jeffrey W. Smith
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

A classroom method for programming instruction which emphasizes the evolution of correct algorithms by try, test, repeat is presented. The method is simple, reasonably obvious, and serves to illustrate many of the concepts of introductory programming. No special equipment or background is needed. The objective of the introductory programming course is the introduction of the concepts and techniques of programming to the uninitiated. As the presentation will attempt to make clear, this method relies on demonstration, teaching-by-example, intuition, and reasonableness. The goal is the presentation of algorithms and the associated techniques and concepts as they influence and abet the design processes so vital to programming.
Applications of symbolic programs to complex analysis
Authors: J. A. Campbell
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The chief characteristics of a LISP program made up of functions for various basic operations in complex analysis are discussed. The completed parts dealing with complex integration by Cauchy's Theorem are given the most emphasis, but other sections still under development are discussed briefly.
Replicated procedure call
Authors: Eric C. Cooper
Venue: Proceedings of the third annual ACM symposium on Principles of distributed computing (1984)

A new mechanism for constructing highly available distributed programs is described. It combines remote procedure call with replication of program modules for fault tolerance. The set of replicas of a module is called a troupe. In a program constructed from troupes, what appears to the programmer as a single inter-module procedure call results in a replicated procedure call. A distributed program constructed in this way will continue to function as long as at least one member of each troupe survives. The semantics of replicated procedure calls and troupes are defined and algorithms are presented that support these semantics.
Cares the current awareness reference service at Iowa state university
Authors: Nancee Nilsen
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Over the last decade, the use of the computerized literature searches has become an accepted research tool by enthusiastic research workers. In the applications for some grants, it has been a recommended, if not required, process for the proposal. At Iowa State University the Computerized Awareness Reference Service (CARES) is utilized by an annual average of two hundred individuals, departments and other organizations. The Computation Center and University Library Reference Department in a cooperative effort, prepare personalized profiles, match these with the latest machine readable information as purchased from data source vendors, and distribute the resulting output on a weekly basis. In addition, a cross-indexed bibliography of relevant articles is produced for each profile on a quarterly schedule. Data processed through the CARES system is accumulated by year and serves as the source of a retrospective service also available through the Computation Center.
Impact analysis
Authors: James S. Ketchel, John Dolan
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Impact analysis is the assessment in terms of monetary loss of any potential threat to the organization. Impact analysis combines the Bayesian decisionprocess withthe Delphi method, as modified herein. A computer can be used to produce a statistical summary useful in fore-casting. This paper will describe impact analysis.First, brief summaries of the Bayesian decision process and the Delphi technique are offered.Then, the method for impact analysis is outlined, followed by a description of a recent application.The application was developed at the Weyer- haeuser Company, Tacoma, ashington. Weyer- haeuser is one of the largest forest products companies in the world. The paper concludes with suggestions for other applications.
Training and development plans and results at Mobil Data services ltd.
Authors: P. M. A. Booth
Venue: Proceedings of the ninth annual SIGCPR conference (1971)

The growth of the EDP function in Industrial Organisations during the past ten years has presented managements with a number of unique problems. In this paper I will try to state the problems, some of them particular to the company, some generally present in the industry, as they appeared to Mobil Data's management, and follow this with a narration of the steps which have so far been taken to overcome them. In summary, I shall deal with:- &bull; The necessary first steps to enable management to see the problems more clearly and accurately (e.g. Job Evaluation, Organisational Development). &bull; The creation of a Training Committee to define Education and Training needs and lay the framework for a training plan. &bull; The development of a Programmer Training Scheme as a first step. &bull; The parallel development of other activities which have contributed to a more integrated approach to EDP Education and Training.
A VLSI tree machine for relational data bases
Authors: M. A. Bonuccelli, E. Lodi, F. Luccio, P. Maestrini, L. Pagli
Venue: ACM SIGARCH Computer Architecture News (1983)

A VLSI chip for performing relational data base operations is proposed. The chip is a tree of processors (TOP), where each chip has elementary storage and processing capabilities. A relation will be stored in the lowest levels of a TOP. More precisely, every m-tuple will occupy a subtree whose root is s&equil; [log2(m+1)] &minus;1 levels above the leaves. Denoting by h the height of the tree, the upper h-s levels will be used for routing and bookkeeping purposes. A number of basic operations such as allocate and deallocate subtrees, insert and compare m-tuples etc., are defined for the TOP's. Relational operations are effectively performed as simple combinations of basic operations. The architecture of a data base machine based on TOP's is also sketched. Such a machine is feasible with the current VLSI technology and could become attractive in few years if density and performance of VLSI keep improving at the current rate.
Color quantization by RWM-cut
Authors: Ching-Yung Yang, Ja-Chen Lin
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A new color quantization method that uses the radius weighted mean cut (RWM-cut) is proposed. The method is hierarchically divisive, and each two-class partition only uses the centroid and the RWM. The processing speed is fast and the MSE quantization error is competitive. The algorithm can either be used alone or be used to create a good initial palette for the LBG algorithm.
Programmer paranoia revisited
Authors: Pat Barnes
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

Since man has been curious and concerned about anything probably he has been curious and concerned about man. It seems logical that man's ability to speculate, question and reason would be turned toward the understanding of himself and others. It further seems logical that since modern man is a creature of work, man has sought to understand the aspect of his being which is associated with work. Current literature reflects the opinion that an individual's personality is a key consideration in his job success. The conclusions of recent studies have been that a theory of occupational choice must account for an individual's &ldquo;style of life&rdquo; (Armatas and Collister, 1962, Adams, 1969, and Sherman, 1972). The results of these studies indicated that there is a subtle relationship between emotional adjustment and vocational behavior and the individual's resultant relative feeling of well-being.
A computer graphics approach for understanding of prosthetic heart valve characteristics
Authors: Anthony D. Au, Harvey S. Greenfield
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

The present investigation applies fluid dynamics principles and numerical analysis techniques in an attempt to study stress distributions in blood caused by the motion of the occluder in a prosthetic heart valve. An interactive computer graphics program is developed for control of the computer simulation of the flow process and the pictoral presentation of the solution for analysis. A simplified model of a disc-type heart valve is used in the analysis to demonstrate the capability of the interactive graphics program. Resulting displays show the stress distribution and other useful information describing the movement of a disc occluder from almost full-closed position to almost full-open position. The possible contribution of this study to the understanding of hemolysis and thrombosis is discussed.
A scale-recursive, statistically-based method for anomaly characterization in images based upon observations of scattered radiation
Authors: E. L. Miller
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

A scale-recursive algorithm is presented for the detection and characterization of anomalous structures in a medium based upon observations of scattered radiation obtained along the boundary of the region. A nonlinear scattering model based upon Maxwell's equation is used to relate the anomalous structures to the measured fields. Decision- and estimation-theoretic techniques are employed to (a) identify large-scale areas in which such anomalies are present and (b) spatially refine these estimated regions to better localize the true anomalous structures. Examples are presented from a low-frequency inverse conductivity problem drawn from the field of geophysical signal processing.
SIRE
Authors: Terry Noreault, Michael Mcgill
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

SIRE (Syracuse Information Retrieval Experiment) is an interactive bibliographic retrieval system. It was developed at the School of Information Studies at Syracuse University. It is implemented in SAIL (Stanford Artificial Intelligence Language), an ALGOL like language, on a DEC KL-10. SIRE presently has two data bases; 1) one issue of Physics Abstracts with 7146 documents; and 2) a sign language linguistics data base from Gallaudet College with 490 documents.
The Interplay Between Mathematics And Computer Science
Authors: J. T. Schwartz
Venue: Proceedings of the 1978 annual conference (1978)

The assertion that the taproots of mathematics lie in its applications is a familiar one, and for a clear statement of this thought we have only to quote von Neumann: &ldquo;The most vitally characteristic fact about mathematics is, in my opinion, its quite peculiar relationship to the natural sciences, or, more generally, to any science which interprets experience on a higher than purely descriptive level." &ldquo;Most people, mathematicians and others, will agree that mathematics is not an empirical science, or at least that it is practiced in a manner which differs in several decisive respects from the techniques of the empirical sciences. And yet its development is very closely linked with the natural sciences .... Some of the best inspirations of modern mathematics (I believe, the best ones), clearly originate in the natural sciences." Although it is not a natural science (and indeed, has been characterized as the 'science of the artificial') computer science is imbedded in an ongoing mass of computer practice which plays the role for computer science that technology and experiment play for such natural sciences as physics. And, as this talk and the other presentations at this session will illustrate, computer science and mathematics are joined by a network of fructifying mutual connections which very much exemplify von Neumann's point of view.
Advanced use of Simula
Authors: Graham Birtwistle
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper is a tutorial on program development in Simula. It assumes a reading knowledge of Simula, and sketches the design of a local area network simulator (Cambridge Ring architecture) in five logical levels: machine interface, queueing, simulation primitives, data collection primitives and finally the network components. Besides program development technique, we also emphasize the value of class body actions, inner, the virtual mechanism and data protection.
The excell method for efficient geometric access to data
Authors: Markku Tamminen, Reijo Sulonen
Venue: Proceedings of the 19th Design Automation Conference (1982)

The extendible cell (EXCELL) method provides a data structure for efficient geometric access. It stores geometric data into computer storage blocks corresponding to disjoint variable sized rectangular cells accessible by an address calculation type directory. We describe the method for point files and files of more complicated figures analyzing performance. We report algorithms for the nearest neighbour and point-in-polygon-network problems and describe applications to geographical data bases, hidden line elimination and geometric modeling.
Experiences in asynchrony
Authors: Jean Suchard
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

The design and implementation of systems including independent and specific organs, as processors, storage units and I/O devices, bring up the fundamental problem of the information exchange between asynchronous organs. Report is made of experimental work followed up from four years, on different kinds of clusters and on two asynchronous exchange mechanisms adapted to them.
An applied computer science/systems programming approach to teaching data structures
Authors: Karen Mackey, Howard Fosdick
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

This paper describes and analyzes Math 464, a course in data structures at Northern Illinois University. The course is taught in keeping with the underlying philosophy of the university's computer science curriculum: it is an applications course of pragmatic nature.
A data communications course for information systems majors
Authors: James T. Perry, Norman E. Sondak
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Information Systems is a rapidly growing, fully recognized profession which will continue to expand. Currently, the need for people with a solid foundation in information systems far exceeds the supply; this is well documented in a number of recent articles. For an information systems degree program to remain viable, however, it must be reevaluated periodically to ensure that the course offerings are both current with respect to the available technology, and of real value to the student who will be applying his acquired skills and knowledge in industry, government, or university. One topic area of information systems which has been, largely, ignored until recently is data communications. This field has been recognized as a valuable tool to our students; therefore, it has been included as one of the core requirements for our undergraduates. This course stresses the management information systems aspects of data communications. The pedagogical objectives of the course are that the student be able to analyze, design, implement, and evaluate data communications applications in a business system environment. The structure and content of such a data communications course is presented. Sufficient detail is given so that similar courses can be adapted to fit into a computer science curriculum, with slight changes in emphasis, or incorporated directly into an existing information systems program.
Tutorial on structure charts as an algorithm design tool
Authors: Johnette Hassell, Victor J. Law
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Structure charts have been presented via seminars to groups of computing professionals. Some of these software designers have adopted structure charts as their standard design tool. These practitioners are providing impressive anecdotal evidence that structure charts have significant practical value and are not merely of academic interest. The precise origin of structure charts is not accurately recorded. Their first appearance in a textbook was in Bowles(1) who cites Doran and Tate(2) as their originators. Bowles used the name structure diagram. Jensen and Tonies(3) presented some very similar design notation which they called schematic logic. They claimed that their work was a modification of some previous design methodology due to Jackson.(4) Jensen later presented a modification of schematic logic and called the new notation processing logic trees.(5) The particular geometric shapes used in the structure charts of this paper are the same as those suggested in a forthcoming textbook by one of the authors(6). This tutorial presents structure charts as a design tool which has many desirable characteristics for students of computer science as well as for practicing software designers.