ppxscal/embedding_network huggingface dataset:
An architecture for extended abstract data flow
Authors: Vason P. Srini
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

A distributed computer system environment for executing extended abstract data flow graphs (EDFGs) is presented. Sequencing functions in EDFGs depends on the availability of data. Since the functions are free of side effects, unrelated functions can be executed in parallel if the required data is available. The environment comprises an organization of conventional or data flow processors and the kernel functions of a distributed operating system. The processors are organized in groups, or levels. Each level is for executing the unrelated functions, or nodes, of EDFGs that are at a certain path length. Each node of an EDFG executes on a processor except when the node is to be replaced by a graph. The processors need not be identical in terms of physical characteristics. For each level of processors there is a memory unit, called level-i memory, with which the processors communicate. There is also a system memory with which all the levels can communicate. The system memory is a tagged memory containing data that can be useful to several levels. The communication between processors and other components is asynchronous, using an abstract data flow protocol. This asynchronous communication is supported by a message switcher. Each level has interconnection networks for connecting processors at that level, for processors and the level-i memory unit, and for processors and the system memory unit. The processors at each level are partitioned into two domains so that operating system programs and application programs can be simultaneously executed. The processors in the problem domain are called application processors (APs); those in the supervisor domain are called supervisor processors (SPs). Two classes of interconnection networks for connecting processors in level i are discussed. The first class of interconnection networks is intended for situations where any healthy processor can be designated as AP or SP. The second class of interconnection networks is intended for situations where only a subset of the processors can be used as APs. The rest of the processors are intended for SPs. The execution of EDFGs on the above organization of processors requires an operating system to map nodes in EDFGs to processors, to assure smooth flow of data into and out of processors, to measure performance, and to diagnose faults. The kernel functions of a distributed operating system are presented. The kernel functions are replicated for each level of processors to facilitate the autonomous functioning of processors in each level and cooperation with other levels using the abstract data flow protocol. The communication between the kernel functions is also asynchronous, using the abstract data flow protocol.
An NP-complete number-theoretic problem
Authors: Eitan M. Gurari, Oscar H. Ibarra
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

Systems of nonlinear equations of the form D: A&ymarc; &equil; &sgr;marc;.(x), where A is an m&times;n matrix of rational constants and &ymarc; &equil; (Y1,...,yn), &sgr;(x) &equil; (&sgr;1(x),..., &sgr;m (x)) are column vectors are considered. Each &sgr;i(x) is of the form ri(x) or @@@@ri(x)@@@@, where ri(x) is a rational function of x with rational coefficients. It is shown that the problem of determining for a given system D whether there exists a nonnegative integral solution (y1,...,yn,X) satisfying D is decidable. In fact, the problem is NP-complete when restricted to systems D in which the maximum degree of the polynomials defining the &sgr;i(x)'s is bounded by some fixed polynomial in the length of the representation of D. Some recent results connecting Diophantine equations and counter machines are briefly mentioned.
Data type specification: Parameterization and the power of specification techniques
Authors: James W. Thatcher, Eric G. Wagner, Jesse B. Wright
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

This paper extends our earlier work on abstract data types by providing an algebraic treatment of parametrized data types (e.g., sets-of-(), stacks-of-(), etc.), as well as answering a number of questions on the power and limitations of algebraic specification techniques. In brief: we investigate the &ldquo;hidden function&rdquo; problem (the need to include operations in specifications which we want to be hidden from the user); we prove that conditional specifications are inherently more powerful than equational specifications; we show that parameterized specifications must contain &ldquo;side conditions&rdquo; (e.g., that finite-sets-of-d requires an equality predicate on d), and we compare the power of the algebraic approach taken here with the more categorical approach of Lehman and Smyth.
Systems analyst's educational needs
Authors: John T. Gorgone
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

The systems analyst, a job identification that emerged with the advent of computers, has experienced a widening job market, with 100,000 analysts employed in 1970 (BLS, 1974). Total employment in this occupation is expected to number over 160,000 by 1980 (BLS, 1974). By 1985, 185,000 systems analysts will be needed (Martin, 1976). Since the advent of the accountability movement in education, non-professionals have wanted a voice in educational programs (Morris, 1971). Directors of computer installations indicated in 1972 that educational institutions were not adequately training students to meet the needs of industry (Hurst, 1972). Consequently, upon hiring data processing graduates, some industries retrain students to become effective and functional contributors to the electronic data processing organization. In 1973 Pollack ascertained that the computer companies' current prime source of trained personnel was their own training programs. Computer industries need personnel possessing considerable training in systems analyzing skills.
3D Reconstruction of Third Proximal Femur (31-) with Active Contours
Authors: Lluís Vicent Safont, Elisa Martínez Marroquín
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We present a method to segment femur bones in CAT images which allows a 3D reconstruction including the most difficult region, namely the proximal femur, in which the femur is in contact with the pelvis. Classical segmentation techniques fail in this region because there is no contrast between the different bones. The proposed method is based on a deformable model that allows to determine the shape of the femur even in those regions in which the contrast is low. The result of the segmentation at each slice provides a contour with ordered points which can be matched with the contour of adjacent slices to compute the 3D reconstruction.
Input/output generators in mathematical programming
Authors: J. A. Buckland
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The solution of a Mathematical Programming problem may be considered in three parts. These are the data processing problem of maintaining a technical file and of transforming and assembling information from it into the matrix format of the code, the technical computing problem of the mathematical programming code itself, and the final data processing problem of transforming the numerical output into an understandable form. Many mathematical codes do some data checking and modification. Also, a translation matrix of information from the input to the output data processing may effectively tie the two together. The three parts are obviously one problem, but may be considered separately. The most efficient way to run a mathematical programming code, of course, is to neglect generalization and to write a special program to suit the problem. This would also be the quickest to write for a single use. One cannot always afford the luxury of running with a hand-tailored program, however. There may be a variety of problem formulations, with some customers developing new approaches, while others have markedly varied models. It becomes worthwhile to generalize, and to develop general-purpose input/output generators.
A view of program verification
Authors: Ralph L. London
Venue: Proceedings of the international conference on Reliable software (1975)

One person's perspectives of program verification and its relation to some aspects of reliable software are presented. The main verification method of inductive assertions is illustrated with several variations of one detailed example; a second example shows a surprisingly simple inductive assertion proof of an iterative tree traversal example. Briefly discussed also are the implicit assumptions of most verifications, proving termination, the creating of assertions, and languages in which to write assertions. An abstract overview is given of existing program verification systems together with a sample list of verified programs. A short bibliography is included.
Language directed computer performance evaluation
Authors: David B. Wortman
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

This paper describes a new approach to the measurement and evaluation of computer performance. An extension of the classical benchmark technique, it offers substantially reduced costs in performing benchmark evaluations and also provides a means for aggregating data from several benchmarks to produce one evaluation. The technique is described and then a small example of the evaluation of two sorting routines is given.
Servomultiplier error study1
Authors: Robert A. Bruns
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The servomultiplier (Ref. 1) continues to be the most precise four-quadrant multiplier for an electronic analog computer. Several electronic types which have been developed in the past five years are much faster but are lacking in repeatability and ease of setup and adjustment. In addition, when a number of product pairs having a common multiplier factor must be produced simultaneously, the servomultiplier is by far the most economical on the basis of both cost and size. However, certain inaccuracies are present in commercially available servomultipliers. (Ref. 2) First, there is difficulty due to noise generated in the feedback potentiometer. Second, there are mechanical troubles such as backlash and static friction. Finally, there are inherent errors in the servoamplifier itself. These effects can combine to make repeatability of problem solution difficult under critical conditions.
Artificial intelligence and information retrieval
Authors: Roger C. Schank
Venue: Proceedings of the ACM 1980 annual conference (1980)

Among the necessary capabilities of an intelligent information retrieval system are Natural Language understanding and automatic memory updating and reorganization. A system should be able to analyze and understand the natural language of both new text inputs and queries to the data base. After text is analyzed and understood, its content must be stored in the computer memory so that it can later be retrieved on request. In order for that to happen, memory must be constructed around the design principles of human memory. These principles allow for reminding, selective forgetting, new insights and generalizations. The key to this is an indexing scheme based on the assessment of the high level knowledge used to process the inputs in the first place. Examples of working programs will be shown that illustrate the memory organization used.
Computer whatcha-maycallit: Insights into universal computer education
Authors: J. M. Moshell, C. E. Hughes, C. R. Gregory, R. M. Aiken
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

A year's work on the NSF/University of Tennessee High School Computer Science Project (HSCS) has indicated that it may indeed be possible to dissociate computer skills from the scary, elitist traditions of science and math curricula in high schools. Teachers and students remote from the traditional science/math constituency are learning to play/work with the computer. The development of HSCS is chronicled and some likely scenarios for its arrival on the high school scene are presented. The essential context is that of a race between declining computer hardware costs and declining support for public education. HSCS is succeeding because it exploits computing's unique ability to bridge between the worlds of play, study and employment.
Reliable computation with cellular automata
Authors: Péter Gács
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We construct a one-dimensional array of cellular automata on which arbitrarily large computations can be implemented reliably, even though each automaton at each step makes an error with some constant probability. To compute reliably with unreliable components, von Neumann proposed Boolean circuits whose intricate interconnection pattern (arising from the error-correcting organization) he had to assume to be immune to errors. In a uniform cellular medium, the error-correcting organization exists only in &ldquo;software&rdquo;, therefore errors threaten to disable it. The real technical novelty of the paper is therefore the construction of a self-repairing organization.
Data processing curricula at the secondary level (Keynote Address)
Venue: Proceedings of the eighth annual SIGCPR conference (1970)

The extensive introduction of electronic computers for data processing and other applications in business by 1966 had created a critical need for greater numbers of more highly skilled personnel. The help wanted sections of metropolitan newspapers provided ample evidence of this need. Attractive inducements were offered for electronic data processing managers, programmers, computer console operators, supervisors, punched-card machine operators, and many others. To meet these personnel requirements, more people needed to be trained, and many of the existing management and operative personnel needed to be retrained. Implicit in these quantitative aspects of training for data processing employees are the qualitative facets, bringing up such questions as: What kind and how extensive should the training be for these various people? Who should provide this training and how and when should it be done? While considerable effort has been expended on training programs by several agencies, little objective research has been done to determine these needs.
Simulation of mission timelines for the Spacelab program
Authors: J. Steven Roberts, Michael A. Fague, Claude D. Pegden
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper traces the development of the Special Purpose Simulation Language (SPSL) for timeline analysis. The SPSL language includes several important features which substantially reduce the modeling effort for timeline analysis compared to general purpose languages such as GPSS.
A unified approach to geometric modelling
Authors: A. R. Forrest
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

Whereas, historically, much of the effort on computer-aided geometric design has concentrated on the problems of representing so-called sculptured surfaces, there has recently been much interest in systems which can handle typical mechanical components by a volume modelling approach. The paper is concerned with the possibility of combining the two approaches and discusses the issues raised. A solution in terms of applying smoothing operators to a geometric coarse structure is proposed, with the added benefits of detecting and successfully handling anomalous regions in surfaces and leading to potential benefits in the analysis of geometric properties.
The emerging technology of CAD/CAM
Authors: Larry Lichten
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Computer-Aided Design and Manufacture (CAD/CAM) represents a merging of technological advances in computer hardware and software with pressing needs in manufacturing industries. Integrated manufacturing systems--from computer graphics-aided design through engineering analysis and automated fabrication--are only now beginning to fulfill nearly twenty-five-year old promises of increased production efficiency. This paper summarizes CAD/CAM's evolution and its current state and then describes some areas that will experience significant change in the next decade.
Real time animation playback on a frame store display system
Authors: Bryan Ackland, Neil Weste
Venue: ACM SIGGRAPH Computer Graphics (1980)

A frame store display station capable of generating real time animation effects using filled polygonal shapes is described. The system consists of a host microcomputer, a high performance frame store display controller and a microprogrammed graphic command interpreter. Real time performance is attained using a combination of software, hardware and a systems approach. The display station can be used to interactively test and view simple animation sequences. Some proposals for further increasing performance are discussed.
The transient behavior of certain multiserver queues, with simulation applications
Authors: W. David Kelton, Averill M. Law
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Although the transient behavior of a queueing system is often of interest, available analytical results are often quite restricted or are very complicated. We consider a queueing model with Poisson arrivals, FIFO queueing discipline, s(s &ge; i) parallel servers with independent and identically distributed exponential service times, and an arbitrary number of customers present at time zero. Probabilities in a relatively simple closed form are obtained which allow the exact evaluation of several measures of system performance, among them the expected delay in queue of each arriving customer. A numerical examination is carried out to see how the choice of initial condition affects the nature of convergence of the expected delays to their steady-state values. These results have implications for the initialization of steady-state simulations. Extensions to other queueing models (single server, Poisson input, Erlang service, arbitrary initialization) are also discussed.
An expandable multiprocessor architecture for video graphics (Preliminary Report)
Authors: Henry Fuchs, Brian W. Johnson
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

Presented is the design of a flexible expandable multi-processor system for video graphics and image processing. The design involves a central controller which broadcasts data to a variable number of independently executing processing units, each of which in turn controls a variable number of memory units among which the video (frame buffer) image is distributed. An interleaved addressing organization of the video memories guarantees both an even workload distribution as well as maintenance of image coherence for each processing element. Execution speed and image resolution can be independently altered (at any time) by varying the number of processing and memory units. Sample applications of the system&mdash;for rapid line drawing and &ldquo;electronic scene generation&rdquo; (visible surface algorithms)&mdash;are described. Variations of the design for low cost and for powerful, real-time configurations are outlined.
Node listings for reducible flow graphs
Authors: A. V. Aho, J. D. Ullman
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

In [1], Kennedy conjectures that for every n node reducible flow graph, there is a sequence of nodes (with repetitions) of length O(nlogn) such that all acyclic paths are subsequences thereof. Such a sequence would, if it could be found easily, enable one to do various kinds of global data flow analyses quickly. We show that for all reducible flow graphs such a sequence does exist, even if the number of edges is much larger than n. If the number of edges is O(n), the node listing can be found in O(nlogn) time.
DISPLAYTRAN a graphic oriented conversational system
Authors: D. Green, R. Cornish
Venue: Proceedings of the SHARE design automation project (1966)

In the first part of this presentation, I would like to spend a few minutes on background information on NWL and on the goals and history of the project of which DISPLAYTRAN is a part so as to put the work which will be described in its proper perspective. I will also describe briefly several other parts of this project which are of interest. The second part of the presentation will discuss DISPLAYTRAN at some length.
Doing too much for the user
Authors: Bob Paver
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

In attempting to keep all users happy, all of the time, user services personnel sometimes overextend and over-commit themselves, the software and the hardware. There are special circumstances that require special action, but special attention cannot be supplied on a continuing basis. Nevertheless, users frequently cannot or will not recognize the difference between normal and special services. The user develops an unrealistic expectation of what the computation center can provide. Such an expectation inevitably leads to frustration and possibly to hostility because the resources to meet that expectation are not continuously available. The causes and symptoms of these unrealistic expectatiors and means for their removal and prevention will be discussed.
A software high performance APL interpreter
Authors: Harry J. Saal, Zvi Weiss
Venue: ACM SIGAPL APL Quote Quad (1979)

The design of a high performance APL system is presented along with an evaluation of the performance improvement measured on a partial implementation. The system contains a compiler which translates APL into the instructions of a virtual APL machine. Numerous special techniques suitable for optimized interpretation of this virtual machine entirely in software on a System 370 are described. The overhead for executing APL programs has been reduced by a factor ranging between 5 and 10 when compared to conventional interpretive systems.
Modeling of distant futures
Authors: Andrew J. Lipinski
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

This paper introduces some techniques that have been found useful in studying preliminary and simple models of future developments. These techniques rely on joint model building in which many experts participate. Such joint participation has helped to eliminate most of the personal biases of a single model builder and has led to a greater degree of acceptance of the finished product. The models described here are simple. The paper concludes with a discussion of the problems encountered in making such models more sophisticated.
Recognition of objects in images of paper based line drawings
Authors: V. M. Kiyko
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper presents an algorithm for recognition of objects in skeletonized line drawings. The proposed algorithm employs the grammar to define the set of structural descriptions of objects and detects the elements of these objects during the process of their recognition under the control of the grammar. For recognition new objects grammars of these objects must be only specified without rewriting of the recognition program. Experimental results dealing with recognition of schematic diagrams, maps and numeric inscriptions confirm high processing speed, efficiency and flexibility of the algorithm.
Using Pascal for numerical analysis
Authors: Dennis Volper
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

The data structures and control structures of Pascal enhance the coding ability of the programmer. Recent proposed extensions to the language further increase its usefulness in writing numeric programs and support packages for numeric programs.