ppxscal/embedding_network huggingface dataset:
Experimental polyprocessor system (EPOS)&mdash;operating system
Authors: Mamoru Maekawa, Isamu Yamazaki, Akio Tanaka, Akira Nakamura, Katsuyo Ishida
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

EPOS's operating system structure, firmware structure, functional distribution, and restructuring are described. EPOS processors are functionally specialized to user functions as well as operating system functions. The performance improvement by functional specialization is generally expected to be two-to-ten times. The objective of job scheduling is to maximize the total system performance by assigning each job to the best suited processor. For this purpose and for easy maintenance, jobs can be reassigned dynamically. Graceful degradation is also mentioned.
LSI layout checking using bipolar device recognition technique
Authors: C. S. Chang
Venue: Proceedings of the 16th Design Automation Conference (1979)

Layout errors often result in nonfunctioning devices that still adhere to all layout tolerance rules. Reported here is a method for locating such errors in addition to the tolerance rule checking.
Being creative in a user services environment or you have to be pretty crazy to work here - a workshop on synectics
Authors: Phillip Contic, Kathy Smith Pettit
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

In this workshop, participants will look at a particular situation, define the problem, study alternatives, consider metaphorical definitions and arrive at solutions. By familiarizing themselves with the concepts of synectics, participants will be able to take internal private connections and define them in a metaphorical sense, thus creating new ways of looking at the world.
Some practical methods for rapid combinator reduction
Authors: W. R. Stoye, T. J. W. Clarke, A. C. Norman
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

The SKIM II processor is a microcoded hardware machine for the rapid evaluation of functional languages. This paper gives details of some of the more novel methods employed by SKIM II, and resulting performance measurements. The authors conclude that combinator reduction can still form the basis for the efficient implementation of a functional language.
Fault-test analysis techniques based on logic simulation
Authors: E. G. Ulrich, T. Baker, L. R. Williams
Venue: Proceedings of the 9th Design Automation Workshop (1972)

In Part I of this paper we describe FANSSIM, a logic simulator whose primary use is fault analysis, i.e., fault test verification. The main feature of FANSSIM, aside from precise timing simulation, is high-speed/low-cost performance. The performance achieved ranges from 10,000 to 80,000 signals per dollar for typical simulations. Techniques contributing to this performance are: exclusive simulation of activity; a table-driven method for individual element simulation; an event-scheduling mechanism which remains economical for large, active networks; a three-state simulation method operating at high speed for 0-1 and 1-0 signals; and implementation of the central simulator subroutine in 360-Assembly Language. Additional FANSSIM capabilities not generally available in other simulators are the capability to define and use a large variety of nonprimitive logic elements without sacrificing speed or space, an oscillation-safe technique for network initialization, dynamic and accumulated activity reporting in terms of element transitions, and the transmission of nonbinary messages through a logic network. In Part II of this paper we describe three techniques for fault-test analysis. The first is a simple, economical &ldquo;sensitive-state-detection&rdquo; technique which determines for every element whether faults are transferred from inputs to output. This technique quickly predicts whether a given fault-test pattern is potentially successful and should be analyzed in more detail. The second fault-test analysis technique, which is used only if sensitive-state-detection promises success is an optimized single-fault-injection-and-simulation technique similar to generally known methods. This technique, although basically slow, is economically acceptable if it is used in conjunction with sensitive-state-detection and a fast simulator such as FANSSIM. The third technique is a highly economical fault propagation method based on the simultaneous simulation of the unfaulted and many single-fault machines. Economy is achieved by splitting off faulty machine simulations only if faulty machine activity diverges from good machine activity, and by recombining simulations when activity converges. For small networks this technique achieves its full potential and completes all faulty-machine simulations during a single pass.
&ldquo;Programming effort&rdquo; analysis of the ELLPACK language
Authors: John R. Rice
Venue: ACM SIGNUM Newsletter (1979)

ELLPACK is a problem statement language and system for elliptic partial differential equations (PDEs) which is implemented by a Fortran preprocessor. ELLPACK's principal purpose is as a tool for the performance evaluation of software. However, we use it here as an example with which to study the &ldquo;programming effort&rdquo; required for problem solving. It is obvious that problem statement languages can reduce programming effort tremendously; our goal is to quantify this somewhat. We do this by analyzing the lengths and effort (as measured by Halstead's &ldquo;software science&rdquo; technique) of various approaches to solving these problems. A simple ELLPACK program is shown below to illustrate the nature of the ELLPACK language. Space does not allow a description of the language but it is somewhat self explanatory. See [2] and [3] for further details.
A software structure for testing a complex product with a minicomputer
Authors: David J. Garney
Venue: Proceedings of the 1971 26th annual conference (1971)

The paper describes the design of a software structure which handles a large variable data base on a minicomputer. The design centers around a minicomputer with a 4K word memory, a low cost magnetic tape unit and a paper tape reader. The product under test is a 400 line telephone system. The TE 400A telephone system is tailored to each customer, and over 4000 test points are required to test the larger systems.
Learning a non-violent approach to technical assistance
Authors: Kay K. Beach, David Celio, E. Michael Hamilton
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

At GWU, we have rejected the notion that Systems Programmers can not deal with people, and we have kept the consulting function as part of systems' responsibility. In addition, we have maintained a consultant policy that we do not 'do' for users; we attempt to educate, to guide, and to teach, so that our users can eventually 'do' for themselves. To aid our staff in meeting these objectives, we developed, in conjunction with the University Counseling Center, a structured workshop to teach programmers human-relation skills. This program has been successful over the past three years, because we have found that intelligent, technically oriented people respond well, when presented with consulting methods in a technical fashion.
Running a micro lab: Beyond the technical
Authors: Carole (Kelly) Havens
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

There are a number of questions that need to be considered by the university computing facility contemplating a micro area. Our experience suggests that there are considerable advantages to answering these questions prior to making any purchases. (Note: Our own solutions will be mentioned in the presentation of this paper but will not be included in the text.)
T01A-programming languages: T01A4-A computer language for monte carlo evaluations of certain small sample properties of a set of statistical tests
Authors: James E. Miller
Venue: Proceedings of the 2nd annual computer science conference on Program information abstracts (1974)

The language, implemented in FORTRAN i~V and Consistinc of sixteen basic instructions, allows a user with little or no computer experience to design and perform Monte Carlo evaluations of some fifteen &ldquo;standard&rdquo; statistical tests. In addition to the commands used for data generation, test selection, and execution of a Monte Carlo run, commands are supported for documentation, back up and restart, data handling, and for the analysis of results. Additional tests may be easily added to the language. While the primary use of the language has been to look at effects of varying underlying distributions on the power of various tests, it has also been effectively used as an interactive teaching tool.
Use of symbolic and numeric methods in an algorithm for the approximation of multivariate functions
Authors: David K. Kahaner, Mark B. Wells
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In this paper, we discuss aspects of a particular algorithm, namely that of finding an approximation to a real function of n variables, that uses both symbolic and numeric manipulations. Development of this algorithm was motivated in part by an actual application; it is being used in a study of the optimal design of a geothermal energy extraction plant [4]. Our experience here with the extensible language Madcap [6], in which the approximation algorithm was developed, certainly corroborates the importance of very high level, general-purpose languages for the design of involved algorithms.
The SDC Time-Sharing System revisited
Authors: Jules I. Schwartz, Clark Weissman
Venue: Proceedings of the 1967 22nd national conference (1967)

In the light of accelerating interest, it seems worthwhile to review both the current status of TSS and some of the predictions made three years ago. Our review will include a brief overview of system changes, a discussion in some depth of resource allocation (which now appears to be the critical factor in general-purpose time-sharing systems), and some conclusions regarding how well our statements have withstood the test of time.
A closer look at iteration: The self stabilizing capability of loops
Authors: Ali Mili
Venue: Proceedings of the 6th international conference on Software engineering (1982)

Let P be an iterative program on domain D, with state S. A close look at the structure of the loop invariant of P reveals that P has a desirable self stabilizing property: If during the computation, an error causes the state to take a contaminated value S', then, under some conditions, it is possible to recover from this contamination without knowing any previous correct state. This feature contrasts with the classical error recovery mechanisms which equate error recovery with the retrieval of a previously saved correct state, and the backtracking of the computation.
A compatible multiplexing technique for anisochronous and isochronous digital data traffic
Authors: Nobuhiko Shimasaki, Tohru Kohashi, Kohei Habara, Yasunobu Suzuki
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

This paper reports the result of a study on a multiplexing scheme for digital data transmission and switching which can handle both anisochronous and isochronous data traffic of various mix, mainly in one 1,544 kb/s digital channel. The study aims t o determine a unified scheme which is economical and flexible for inter-city heavy traffic data links in the Japanese domestic digital data network, to accommodate a wide range of data speeds. The paper describes various multiplexing schemes and analyzes their features in terms of frame structure, synchronization time, error correction capability, compatibility with signaling, hardware complexity etc. A bit-interleaved multiplexing scheme is chosen as suitable and will be applied in a laboratory model of digital data switching system which is under construction.
The control of congestion in packet switching networks
Authors: D. W. Davies
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

Any communication network has a limit to the traffic it can carry. If there is more than a certain traffic demand, some of the traffic must be rejected. Both the nature of the limitation and the reaction of the network to excess demand depend on the design of the network. The network in a condition where it must reject traffic is called 'congested'.
Analysis of actual fault mechanisms in CMOS logic gates
Authors: Glenn R. Case
Venue: Proceedings of the 13th Design Automation Conference (1976)

An analysis of failure modes in CMOS logic gates is presented. An example 3-input NAND gate is analyzed in detail and the ramifications of its failure modes are discussed.
Data-Centric to the Max " The SPLICE Architecture Experience
Authors: J. H. van 't Hag
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Over the past 10 years, Thales Naval Nederland (TNN) has successfully applied a pure data-centric architecture called SPLICE in its naval Combat Management Systems. This fielded architecture provides the essential non-functional properties as demanded in these mission-critical environments such as (real-time) performance, scalability, fault-tolerance and evolveability. Thales recently contributed this knowledge and experience in a joint submission regarding the OMG's Data Distribution Service (DDS) for Real-time systems. The SPLICE architecture is characterized by autonomous applications with minimal dependencies where function and interaction are clearly separated and SPLICE-agents act as real-time information brokers. SPLICE thus offers a normalized environment that is designed once for all applications and which delivers 'the right information at the right place at the right time'.
Multivariate output analysis in simulation: The state of the art
Authors: Andrew F. Seila
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Most of the research in the analysis of output data from discrete event simulations has been concerned with statistical inference for a single parameter using data from one or more simulation runs. In practice, however, the information one seeks from highly complex and expensive simulation runs usually cannot be summarized in a single system parameter. Therefore, multivariate inferential procedures must be applied to compute simultaneous confidence intervals or joint confidence regions for multiple parameters, or to test hypotheses concerning the values of multiple parameters.
The modular logic machine design system for loosely coupled systems
Authors: K. J. Burkhardt, J. J. DeSanto
Venue: Proceedings of the 1977 annual conference (1977)

The recent introduction of complex integrated circuits in the form of microcomputers, microprocessors and single-chip arithmetic processors has put a new tool in the hands of the digital system designer. One area where these complex integrated circuits have not been fully utilized is in the design of high-performance computer systems. This lack of use can probably be attributed to the fact that the majority of existing high-performance systems have relied on rigid control mechanisms to obtain high performance. Most high-performance systems are not oriented towards the type of distributed intelligence implied by the use of microprocessors or intelligent single-chip arithmetic units. The purpose of this paper is to describe the modular logic machine (MLM) system which is a design methodology that has been developed specifically for the design and construction of loosely coupled systems. The primary characteristics of systems constructed using the MLM technique are distributed intelligence and hardware/firmware extensibility.
SIGCUE (Paper Session)
Authors: Karl L. Zinn, Robert Parnes, Helen Hench, Thomas A. Dwyer, Harold Abelson
Venue: Proceedings of the 1976 annual conference (1976)

A provocative session on computer-based learning and communication environments will be sponsored by SIGCUE. Presentations on innovative uses of computers in education will include: computer-based conferencing as a resource and medium (Karl Zinn, et al); a model for advanced applications of computing technology and an accompanying film (Thomas Dwyer); and a description of the use of graphics in elementary mathematics instruction (Harold Abelson).
A New Deformable Contour Method
Authors: Xun Wang, William G. Wee
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper, a new deformable contour method is presented and tested. The method incorporates several advantages and avoids the disadvantages of both the level set and the non-deterministic deformable contour methods. It takes the level set approach as a core procedure with an enhanced velocity control using a region growing like function, and the introduction of the non-deterministic approach to generate a set of candidate contours for evaluation by an energy function.The resulting procedure can handle blurred and/or opened contours, and noisy contours in images with a complex structure. The procedure is automatic and rather insensitive to the initial location, and has only one parameter ó to adjust. Local energy minima contours can easily be tuned to attend. Experimental results on human abdominal CT image, brain MRI image, and ultrasound pig heart images are favorably reported.
Skeleton planning spaces for non-numeric heuristic optimization*
Authors: L. Siklossy, M. A. Haecker
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The AFTERMATH system implements a heuristic technique for improving long solutions (up to about 250 steps) for robot planning problems. AFTERMATH transforms the given solution into a skeleton solution that focuses attention on repetitious and opposite moves. AFTERMATH attempts to obtain an alternate, improved skeleton. From the alternate skeleton, an alternate solution is built (if possible) to the original problem. If the alternate solution is an improvement, AFTERMATH accepts it as input, and cycles. Although not guaranteeing optimality, AFTERMATH improves many solutions, sometimes gradually in several cycles. Examples can be built for which AFTERMATH obtains an arbitrarily large improvement in one cycle.
Jericho: A professional's personal computer system
Authors: Norton R. Greenfeld
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Jericho is a reactive computing engine capable of supporting advanced high user-intensity applications systems. It has four primary architectural characteristics: 1. A user-dedicated computing environment 2. Direct execution of high-level programming languages 3. High bandwidth communication between user and system 4. High bandwidth communication between user-support machines and the other machines the task environment. Each of these architectural components will be described further, followed by a discussion of the Jericho hardware.
A network graphical conferencing system
Authors: Michael T. O'Brien
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

A network-oriented color graphical conferencing system is being built by the Information Sciences Dept. of the Rand Corporation. This system is designed to allow several people to confer simultaneously over a network. Users share a common display, which is divided into sections: an individual section (or &ldquo;window&rdquo;) for each user, and a common graphical &ldquo;blackboard&rdquo; window where the users may take turns sketching out and modifying a graphical display in full color. The display uses bit-map color raster-scan technology. Each user's private window is identified with that user's name and location. Text typed by a user appears in his window as he types it. Several users may be typing text simultaneously. A special symbol appears in the window of a user who is sketching to indicate who is drawing the picture. Several conferences may be going on at the same time; users may request a menu page showing who is participating in which conferences. Conferences may be &ldquo;locked&rdquo; to prevent others from joining. The system makes use of other Rand-developed utilities for the design and display of arbitrary characters, as well as Rand's Virtual Terminal UNIX (TM) operating system.
Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)
Authors: Ronald V. Book, Sheila A. Greibach, Ben Wegbreit
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

Complexity classes of formal languages defined by time- and tape-bounded Turing acceptors are studied with the aim of showing sufficient conditions for these classes to be AFLs and to be principal AFLs.
Teaching social studies concepts using concrete models expressed in APL
Venue: Proceedings of the international conference on APL (1983)

Concepts routinely used in middle and secondary social studies classes are often too abstract for students to comprehend. To fully understand the concept of nation, for example, students must first visualize and comprehend the notions of territory, boundaries, governments, cultures, history and shared goals and dreams for the future as well as other abstractions that may be subsumed in the word. The problem becomes more complex when the teacher works with social studies concepts that are expressed numerically. When students work with familiar numbers in the tens and hundreds, they often have difficulty conceptualizing such ideas as population density and per capita income, which are expressed in terms or a single unit. When the numbers are in the billions or trillions, they are difficult to visualize and to comprehend. When the large numbers are used in social studies concepts such as gross national product, the problem compounds. Students may also lack skill in using mathematical functions involving these large numbers. Teachers want students to understand rich and powerful ideas and they search for classroom activities to enhance student learning. Instructional techniques which provide students with concrete experiences and which allow for manipulation of the environment help students master such concepts. These strategies help students develop the ability to do abstract and formal thinking. This paper focuses on concepts in global studies and presents some techniques for teaching these abstract ideas using computer models expressed in APL. Students manipulate these models in a variety of ways in class. Students learn to do research, store information and access and use data to comprehend their world more fully.
A language for two-dimensional digital picture processing
Authors: Patrick Shen-Pei Wang, William I. Grosky
Venue: The papers of the ACM symposium on Graphic languages (1976)

A new system, that of matrix grammars, for two-dimensional pattern processing, is introduced. A hierarchy, induced on Chomsky's is found. Language operations such as union, catenation (row and column), Kleene's closure (row and column), and homomorphisms are investigated. It is found that the smallest class of these languages may serve as the class of regular arrays, which is defined as the smallest class of arrays closed under union, catenation (row and column) and Kleene's closure (row and column). Eight possible ways of defining a matrix language are discussed and it is suggested that one of them may lead to a normal form for matrix grammars. The method is advantageous over others on several points. Perhaps the most interesting of all is that it provides a compromise between sequential methods which take too much time for large arrays and parallel methods which usually take too much hardware for large arrays.