ppxscal/embedding_network huggingface dataset:
Presenting information in sound
Authors: Sara Bly
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

In the past few years, the increase in interactive use of computers has led to an emphasis on human factors and the ways in which digital information can best be presented to users. Computer graphics has been at the forefront of this growth involving vision as an active aid in interpreting data. Bar charts, psuedo-color image processing, and 3-dimensional figures are but a few means of providing the viewer with data information. As the use of computers increases, the need for a variety of alternatives of interacting with computers also increases. Computer-generated sound is one capability not being fully utilized in the computer/human interface. Just as an x-y plot reveals relationships in data, sounds might also reveal relationships in data. This report focuses on the potential for using computer generated sounds to present data information. The first section addresses multivariate data problems which might be aided by sound output. The second describes experiments performed to determine whether listeners can discriminate among data sets based on sound. The final section discusses ongoing work and future directions.
Shade trees
Authors: Robert L. Cook
Venue: ACM SIGGRAPH Computer Graphics (1984)

Shading is an important part of computer imagery, but shaders have been based on fixed models to which all surfaces must conform. As computer imagery becomes more sophisticated, surfaces have more complex shading characteristics and thus require a less rigid shading model. This paper presents a flexible tree-structured shading model that can represent a wide range of shading characteristics. The model provides an easy means for specifying complex shading characteristics. It is also efficient because it can tailor the shading calculations to each type of surface.
The generation of Technical Data Drawing Packages by the integration of Design Automation Graphics
Authors: Harvey N. Lerman
Venue: Proceedings of the 18th Design Automation Conference (1981)

Martin Marietta Data Systems is designing and implementing for Martin Marietta Orlando Aerospace, a major defense contractor, a system to computerize and integrate all unclassified CAD/CAM graphic outputs related to a large defense project. The system provides for the computerized generation of a Technical Data Package (TDP) containing all of the drawings, standards, and specifications generated during the research and development phase of product design. The heart of the system is a &ldquo;vault&rdquo; of computer-contained text and drawing data bases which replace present hardcopy vaults. The system also replaces the present manual search and reproduction of drawings with computer inquiry and on-line graphics viewing capabilities. It is expected that the time required to produce the TDP will be cut from several months to a few weeks.
A network performance analyst's workbench
Authors: Richard Brice, William Alexander
Venue: Proceedings of the Computer Network Performance Symposium (1982)

Performance measurement and analysis of the behavior of a computer network usually requires the application of multiple software and hardware tools. The location, functionality, data requirements, and other properties of the tools often reflect the distribution of equipment in the network. We describe how we have attempted to organize a collection of tools into a single system that spans a broad subset of the measurement and analysis activities that occur in a complex network of heterogenous computers. The tools are implemented on a pair of dedicated midicomputers. A database management system is used to couple the data collection and analysis tools into a system highly insulated from evolutionary changes in the composition and topology of the network.
Computer/interactive cleanup of non-gridded PWB's after automatic routing
Authors: Donald P. Peterson
Venue: Proceedings of the 14th Design Automation Conference (1977)

Sandia Laboratories is responsible for the design of a variety of printed wiring boards (PWB's) which often have severe size and shape constraints as well as extremely high reliability specifications. This sometimes necessitates meticulous component placement and interconnect positioning; consequently, many of the PWB's are not laid out on a grid. For PWB's which are used in space satellites there is another important constraint: there must not be any acute angle in the metal pattern. Indeed, only recently, and with some scepticism, have right angles in interconnects been tolerated. This angle constraint poses special problems in the cleanup of interconnects in the neighborhood of a land, as the interconnect must enter land radically Computer aids have been developed to ease the task of the designer and one large program written at Sandia, DAVINCI, utilizes interactive graphics. DAVINCI has evolved from a PWB editor to become a design tool with extensive interactive capability for handling component placement, interconnection definition and other PWB design activities. The main DAVINCI program resides on a CDC 6600 but a DEC PDP-9 serves as an interface between a Vector General CRT and the large computer. The interactive graphics activity occurs in a time share environment. And, although graphics jobs have top priority, there is a strong incentive, if not a requirement, to keep the size of the program in core at any one time to a minimum.
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
Authors: Gary L. Peterson, Michael J. Fischer
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

A solution to the critical section problem, first posed by Dijkstra [1], is a fundamental requirement for concurrent program control. The problem is to ensure that no two processes are in a specified area of their programs (the critical section) at the same time. Improvements to Dijkstra's solution were made by Knuth [2], deBruijn [3], and Eisenberg and McGuire [4]. The situation, for a distributed system was considered by Lamport [5]. Rivest and Pratt [6] presented a solution for a distributed system where processes may repeatedly fail. The algorithms to be presented will be further improvements, where the comparisons will be made according to three measures: message size&mdash;the number of values the variable for interprocess communication can take on; fairness&mdash;the sequence in which waiting processes enter their critical sections; and time&mdash;the amount of time a process spends attempting to enter its critical section.
Computing at the Information Sciences Division, Rockland State Hospital
Authors: E. Laska, G. W. Logemann
Venue: Proceedings of the 1971 26th annual conference (1971)

The activities of the Information Sciences Division include research in bio-mathematics, statistics and computer science, development of information systems, and service to the Research Center in such areas as programming, statistical analyses of data, business and administrative applications of computer technology and on-line data collection. The major project of the Information Sciences Division is the Multi-State Information System for Psychiatric Patients. This record keeping system collects information on all phases of patient experience. Data is collected at terminals located in participating facilities on optical scan forms and transmitted to the central computing facility at Rockland State Hospital. Reports reflecting the information collected are returned to the terminal. Terminals consisting of an optical mark page reader, a card reader, a line printer, and a keypunch are located in Connecticut, Maine, Massachusetts, New York, Vermont and Washington, D.C. Rhode Island also participates but mails its data to New York for processing.
Knowledge about programs: A model and case study
Authors: Susan L. Gerhart
Venue: Proceedings of the international conference on Reliable software (1975)

Dijkstra suggests in his &ldquo;Notes on Structured Programming&rdquo; that program schema and theorems about their correctness may describe the way that programmers understand programming. This paper follows up his suggestion by describing a general model for domains of programming knowledge in terms of schema, transformations, and derivation rules. The model is illustrated by the results of a case study of the knowledge about 10 programs which use arrays. The model and case study illustrate a methodology for constructing and proving correct programs based on knowledge which is independently expressed and partially proved in an abstract form and which can be applied in a stepwise way.
Polynomial reducibilities and upward diagonalizations
Authors: Istvan Simon, John Gill
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

An open question of [LLS] is whether polynomial time many-one reducibility &le;mP and polynomial time Turing reducibility &le;TP differ on NP. An affirmative answer to this question would yield P @@@@ NP as a corollary, but it is possible that P @@@@ NP even if the answer is negative. Ladner, Lynch, and Selman [LLS] conjecture that if P @@@@ NP then &le;mP and &le;TP differ on NP. One method that might prove helpful in settling this conjecture is to exhibit an efficient construction that builds from any nonpolynomial set A a set B such that A &le;TP B but A @@@@mP B. If such a construction were sufficiently efficient, then when applied to a set A in NP - P it would yield a set B in NP/
An APL approach to differential equations
Authors: Garry Helzer
Venue: ACM SIGAPL APL Quote Quad (1984)

Initial value problems are solved numerically by computing the solution of a related difference equation. In APL it may be more efficient to approximate the solution of the difference equation using Picard iteration than to compute the solution of the difference equation directly.
Minimizing system models for efficient simulation
Authors: Alfred W. Jones
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

This paper presents a stochastic systems framework for discrete event simulations. The stochastic model developed, called a simulation machine, serves as a vehicle for systematically reducing the state space and input alphabet used in the simulation. Classical reduction algorithms from automata theory apply, as well as a new theorem derived by the author and based upon group theory. Several examples are given.
Segmentation of X-Ray CT Images Using Stochastic Templates
Authors: C. Glasbey, C. Robinson, M. Young
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

X-ray computed tomography (CT), a non-invasive imaging technique, is being used increasingly in sheep breeding. Currently, considerable human intervention is needed to segment images into different tissues. This is undesirable because of its subjectivity and tediousness. We propose the use of deformable templates to automate the segmentation. A stochastic model has been constructed using a training set of 99 manually-segmented images: Fourier coefficients were used to parameterize the template boundaries, and the coefficients were reduced in dimensionality using principal components. As a matching criterion between a template and an image, a weighted sum of squares of the difference between pixel values and their expected values was identified using the training images. Finally, the Nelder-Mead algorithm was used to optimize the matching criterion in order to fit a template to a specific image. The results have been validated on an independent set of 99 images, and boundaries were positioned to an average accuracy of 2.7mm.
Behavioral and learning models
Authors: Paul F. Wyman, John W. Slocum,  Jr., Richard Reed, F. D. Tuggle, F. H. Barron, R. O. Day, W. W. Menke, Daniel N. Braunstein, John V. Dutton, Austin Hoggatt, John F. Lubin, Martin Shubik
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Currently, the most challenging aspect of simular methodology is the representation of the behavior and decision processes in animals, including man. One approach, especially suited for miming human decision-making, is the construction of gaming models, in which selected humans participate as physical entities at pertinent points in simular time. The construction of pertinent algorithms, meaningful to simulations which mime behavioral and learning processes, constitutes an important inter-disciplinary topic of the contemporary systemic sciences, and involves psychologists, neurologists, statisticians, and systemic scientists who construct credible simulation models. The Behavioral and Learning Models Session includes: two papers which stress that simulation modeling is playing in the development of our understanding of these two areas; than, a panel discussion whose members shall address the need for the application of both stringent verification tests and assiduous validation tests in order to establish credible simulation models; and, a final paper which indicates the role, which an understanding of human behavioral and learning processes must occupy, in establishing credible simulation models of environmental and societal systems.
On the time overhead of counters and traversal markers
Authors: Ira R. Forman
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The problem of minimizing the time overhead of counters and traversal markers is studied. The methodology used to study the problem is based upon Markov processes. A fundamental result is presented that characterizes those flowcharts where the problem can be solved uniquely in the case of counters. Two methods are described that avoid poor choices of counter placement by choosing counter placements from a dominating set. With respect to the problem of traversal marker placement, the basic result that traversal markers must be placed on the complement of a uni-connected sub-graph is extended to flowcharts with circuits. Finally it is shown that complements of uni-connected subgraphs that are minimal in size may not have minimal time overheads.
A design methodology based upon symbolic layout and integrated cad tools
Authors: A. M. Beyls, B. Hennion, J. Lecourvoisier, G. Mazare, A. Puissochet
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes one of the new methodologies for IC design currently being used at the CNET. The main features detailed are the symbolic layout method called MDMOS and the integrated CAD system CASSIOPEE. Its most significant advantages are design safety, elimination of costly and inefficient checks and supply of technical specifications which are always up-to-date. This methodology is described in its entirety starting from the logical description, and including all stages up to masks generation.
Pattern generation in non-standard tessellation automata
Authors: William I. Grosky, Frank Tsui
Venue: Proceedings of the ACM annual conference (1973)

This paper is concerned with two different ways of expanding the definition of a tessellation automaton, and some of the resultant properties which thereby ensue. The first allows the notion of sequential processing, while the second allows the addition of spatial non-uniformity.
Bubbles for relational database
Authors: Hsu Chang
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

The mechanical disk storage is limited by long initial delay, few inputs/outputs, and serial access, thus necessitating large complex programs in existing database systems in order to map the user's view into the physical storage and to provide different access paths in response to different queries. Bubble devices are capable of set-oriented processing and associative addressing architecture. This paper presents concepts on data structure, storage structure, and access methods for bubble implementation of relational database.
The evaluation of alternative profitability measures of leveraged leasing: A simulation approach
Authors: Robert Capettini, Howard R. Toole
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper summarizes alternative leveraged lease evaluation models and applies them, from the lessors point of view, to a number of simulated leveraged leases. The study compares the alternative evaluation models based upon whether they satisfy two characteristics: 1) the model leads to correct accept/reject capital budgeting decisions and 2) the measure is intuitively appealing. We conclude that the return on invested capital model is the superior lease evaluation technique.
Case study of the methodology of J. D. Warnier to design structured programs as systems documentation
Authors: R. Escalona
Venue: Proceedings of the 3rd annual international conference on Systems documentation (1984)

It is well known that a programmer's main idea is to generate results, but these are often only partially done. Generally, they want to finish the program well to document it afterwards; however, they never do so. Sometimes they are assigned to a new project, and they expect to have an opportunity to document what they have written at a later date. Other times, programmers have their own ideas, like ownership or professional secrets, and so on and so forth, but the truth is, few programmers document their programs, and fewer document them well. If there is a method that allows the programmer to document before writing a program or while he is writing it, such a program will, obviously, be documented in the most proper manner. This paper will describe some experiences in using the method of J.D. Warnier to design programs, and, therefore, its graphs are used as documentation.
Models for specification and anaysis of parallel computing systems
Authors: R. M. Mattheyses, S. E. Conry
Venue: ACM SIGSIM Simulation Digest (1979)

The problem of designing a properly functioning parallel hardware or software system is considerably more difficult than that of designing a similar sequential system. In this paper we formulate criteria which a design methodology for parallel systems should satisfy and explore the use of various models as the basis for such a design tool.
Experimental optimization of statistical simulation
Authors: David L. Eldredge
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Although simulation involves solving a mathematical model through experimentation, the literature of simulation does not reflect a broad, sustained interest in the design of simulation experiments. The objective of this paper is to fulfill a part of this need by suggesting a general five-phase experimental approach for determining the optimum for a particular, but common, type of simulation problem. The majority of the suggested procedure makes use of existing design and analysis techniques. However, the problem of multimodal simulation outcomes has resulted in the development of the &ldquo;random factorial&rdquo; experimental design. This design is a combination of a complete factorial design and a random balance design. The majority of the paper is devoted to a discussion of the use of this design approach for solving the multimodal problem.
Formal properties of sequential/parallel matrix languages
Authors: Patrick Shen-Pei Wang
Venue: Proceedings of the 1976 annual conference (1976)

A new type of grammar for generating two-dimensional patterns is introduced. The generation of a pattern occurs in two phases. First, a string grammar generates a &ldquo;row&rdquo; of syntactic variables (the sequential phase). Then a battery of instances of string grammars&mdash;one for each symbol produced in the first phase&mdash;operate in tandem to create the columns of the final pattern (the parallel phase). Several unrelated properties of the classes of patterns generated by various varieties of matrix grammars are announced.
Computer science seminars on pedagogical techniques and methods for evaluation
Authors: Dexter Fletcher
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

Interdisciplinary subject matter appropriate for computer professionals who will participate in the design of computer-based learning systems is discussed. Broad issues of computer-managed instruction are mentioned, but the potential contribution of computer techniques is assumed to be much greater in the direct use of computers in instruction and this type of use is emphasized. Primarily, computer Professionals should be prepared to suggest techniques that will permit more imaginative uses of computers than those appropriate for workbooks or memory drums. Promising pedagogical techniques derived from a variety of disciplines and used successfully in computer-based learning systems are discussed. These techniques are roughly classified as drill and practice, tutoring, and dialogue on one dimension and as simulation, gaming, optimization, and student control on another dimension. The interdependence of these pedagogical techniques with evaluations of instructional effectiveness and with computer techniques associated with timesharing, formal language processing, natural language processing, information structuring, and varieties of terminal devices is emphasized and explicated.
Structured development of menu-driven application systems
Authors: John Sigle, John E. Howland
Venue: ACM SIGAPL APL Quote Quad (1979)

Presenting the user of an application system with a menu of choices is a valuable approach to the human interface problem. In a complex system this may take the form of a tree of menus that is presented. This tree of menus can also be used as the basis for a top-down development of the application system. This paper describes a programming system which can be used to acquire the tree of menus and structure the development of a menu-driven application system in a top-down fashion. Objects called augmented menus contain not only the textual representation of the choices presented the user (in three forms), but also the action to be taken for each choice. A menu-manager program accesses the specified augmented menu, displays the choices and executes the selected action. This function eleminates much of the work of the application developer. This development system is illustrated with three applications: an information storage and retrieval system, a class-roll record-keeping system and a text-editing system.
On time-space classes and their relation to the theory of real addition
Authors: Anni R. Bruss, Albert R. Meyer
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

A new lower bound on the computational complexity of the theory of real addition and several related theories is established: any decision procedure for these theories requires either space 2&egr;n or nondeterministic time 2&egr;n2 for some constant &egr; > O and infinitely many n. The proof is based on the families of languages TISP(T(n),S(n)) which can be recognized simultaneously in time T(n) and space S(n) and the conditions under which they form a hierarchy.
Towards a western Fifth-Generation Computer System project
Authors: Maarten van Emden
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

A Fifth-Generation Computer System (FGCS), as usually understood, requires break-throughs in artificial intelligence and parallel processing. We identify &ldquo;near-term&rdquo; FGCS's relying only on existing developments in hardware, user interfaces, and software techniques integrating databases and a wide range of programming paradigms to achieve much of the social utility expected of FGCS's of the long-term variety. We identify these developments and argue that logic programming is too good to be left to the Japanese: that it is an economical basis for a Western near-term FGCS project.