ppxscal/embedding_network huggingface dataset:
The application of a symbolic mathematical system to program verification
Authors: Ralph L. London, David R. Musser
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Program verification is a relatively new application area for symbolic mathematical systems. We report on an interactive program verification system, based on the inductive assertion method, which system is implemented using an existing symbolic mathematical language and supporting system, Reduce. Reduce has been augmented with a number of capabilities which are important to program verification, particularly transformations on relational and Boolean expressions. We believe these capabilities would be valuable in other contexts and should be incorporated more widely into symbolic mathematical systems for general use. The program verification application can serve as a guide to an appropriate definition of such capabilities, particularly with regard to the need to distinguish between undefined program variables and polynomial indeterminates. Additional capabilities which would benefit the program verification application include representation of user-defined functions by internal forms which directly incorporate properties such as commutativity and associativity (as is commonly done with plus and times), and a comprehensive facility for defining conditionally applicable transformations
Instruction reference patterns in data flow programs
Authors: S. A. Thoreson, A. E. Oldehoeft
Venue: Proceedings of the ACM 1980 annual conference (1980)

Instruction reference patterns in data flow environments differ from those in conventional systems. Because execution is data driven in data flow environments, patterns of instruction references depend on data references. Also, instruction reference patterns are two-dimensional because execution is parallel. In this paper, models of instruction reference patterns are presented to illustrate program behavior and to provide insight into the potential usefulness of an instruction cache or virtual memory in data flow environments. The results establish that locality exists and is exploitable in some data flow environments.
Well&mdash;formed models for discrete simulation
Authors: Douglas Seeley
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper describes a procedure and system for ensuring the logical consistency of a discrete simulation model. The initial system, WORMS I, is intended primarily for models that will be implemented in an event-oriented language such as SIMSCRIPT.
A project for a course in operating systems
Authors: Charles M. Shub
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

A simulated machine approach to an operating systems course project is described. The motivations for including the project in the course are delineated. The reasons for selecting the particular type of project are given. The fictitious hardware and the requirements for its simulation are presented. The conceptual issues are amplified. The methodology for a high level process oriented design for a multiprogrammed batch environment is delineated. The primitives to be used in the design are described and motivated. The issues to be addressed in the actual implementation of the paper design are explored. Possible extensions to the project are suggested. Student feedback is presented. Conclusions are drawn.
User services and statistical users: Our changing relationship
Authors: Kathleen Cook, David Weible
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Universities, over the past decade, have seen a shift to empirical research in the social sciences, and to some extent, in the humanities. The origins of this trend are irrelevant here, but the refinement of statistical analysis packages in response to the new market has had a powerful impact on university computing centers. Computing has become a tool for a new kind of user and, as a consequence, User Services faces some difficult philosophical questions and a host of lesser problems. Statistical package use at our Computing Center has risen steadily. Ours is a medium-sized university with a graduate school and a medical school. Research is conducted in the social sciences as well as in the hard sciences; students are expected to use the computer. Statistical packages are popular tools because they simplify the computing process.
A micro-macro simulation model for a signalized network
Authors: Arie Kaufman
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

A micro-macro discrete simulation model sketches traffic behavior within a network of signalized intersections. This model utilizes a continuous simulation sub-model which describes the behavior of a single platoon of vehicles, and permits the formulation of a simple exponential expression approximating the platoon motion. Most components of the discrete model are treated microscopically, but in order to maneuver the platoons the simple exponential is applied macroscopically. This is done to avoid the time-consuming numerical solutions of the non-linear car-following differential equation, which is the basis for the sub-model. The prime objective in constructing the model is to assist in finding an optimal synchronization of all the signals for the minimum delay for traffic flowing through the network.
Towards the design of a super-language of ALGOL 68 for the Standard Prelude (Excerpt)
Authors: Dick Grune
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

The problems concerning SIZETY definitions in an Unabridged Machine-Independent Standard Prelude for ALGOL 68 are examined and tentative solutions are given.
An automatic programming system to support an experimental science
Authors: D. Barstow, R. Duffey, S. Smoliar, S. Vestal
Venue: Proceedings of the 6th international conference on Software engineering (1982)

Programs are often used in experimental sciences to test new models and theories against real-world data. One of the major bottlenecks in that process is the need to write the program which implements the new model. &oslash;0 is an automatic programming system which supports petroleum scientists in testing quantitative log interpretation models against log data from oil wells. The user (a petroleum scientist) describes a model by interacting with &oslash;0 in the natural terms of the domain. &oslash;0 then automatically writes a program which implements the model. The entire process takes from ten to twenty minutes and achieves results which previously required two to three weeks of effort.
The impact of microprocessors on continuous simulation
Authors: Everett L. Johnson
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

With the advent of low cost microcomputer hardware the possibility now exists for the development of systems of parallel microprocessors. For simulation purposes the system of processors may take a form similar to that of an analog or hybrid computer with one processor performing an integration, another a multiple variable summation, etc. This paper presents a possible configuration for such a system and discusses briefly some problems to be resolved as well as some suggestions for multiprocessor integrations.
Area-time efficient addition in charge based technology
Authors: Robert K. Montoye
Venue: Proceedings of the 18th Design Automation Conference (1981)

Using the model developed by Mead and Conway for charge based technology, a methodology for the production of area-time efficient adders which imbeds the buffering required to drive large loads caused by the carry-lookahead tree has been developed. This methodology can be used to produce an O(logN) time and O(NlogN) area layout. Additionally, an algorithm was written to produce minimal silicon area layouts for a given time bound. This algorithm involves optimization at both the cellular level and the layout level in an iterative fashion to allow the relevant technological parameters to play a role in the cellular design phase. Results of the algorithm including examples and an area-time curve for a 48 bit adder using typical 5 micron NMOS [MeCo80] are displayed.
Automatic update of replicated topology data bases
Authors: Jeffrey M. Jaffe, Adrian Segall
Venue: ACM SIGCOMM Computer Communication Review (1984)

In computer communication networks, routing is often accomplished by maintaining copies of the network topology and dynamic performance characteristics in various network nodes. The present paper describes an algorithm that allows complete flexibility in the placement of the topology information. In particular, we assume that an arbitrary subset of network nodes are capable of maintaining the topology. In this environment, protocols are defined to allow automatic updates to flow between these more capable nodes. In addition, protocols are defined to allow less capable nodes to report their topology data to the major nodes, and acquire route information from them.
A fault tolerant multiprocessor architecture for real-time control applications
Authors: M. A. Fischler, O. Firschein
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

This paper presents a fault tolerant multiprocessor architecture suitable for real time control applications requiring an extremely high degree of reliability. The architecture satisfies the following requirements: l) Ability to deal with software as well as hardware faults: The proposed architecture is based on the assignment of distinct but redundant software modules to each task. 2) Efficient use of resources: The proposed architecture is a multiprocessor using time redundancy for fault correction. Thus, redundancy (beyond that needed for fault detection) is invoked only when a fault is detected. In normal operation, this extra capacity is available as an additional computing resource. 3) No hard core: In addition to the usual replication of system components, a partitioned system executive and a unique communication facility is defined which insures that the available redundancy will not be lost through a &ldquo;domino&rdquo; effect. 4) Interaction of computing units with sensors and effectors: The manner in which system architecture must be responsive to the amount and type of redundancy provided by the sensors and effectors is shown. 5) Use of current technology: The proposed architecture is based on the use of currently available hardware for the major system components. After a detailed description of the architecture and the method of system operation, the system is related to existing fault tolerant systems, and unique characteristics of the present design are indicated.
Some considerations for a high performance message-based interprocess communication system
Authors: John M. McQuillan, David C. Walden
Venue: ACM SIGOPS Operating Systems Review (1975)

We continue to be concerned with interprocess communications systems (such as those described in references 1, 2, and 3 and called &ldquo;thin-wire&rdquo; communications systems in reference 4) which are suitable for communication between processes that are not co-located in the same operating system but rather reside in different operating systems on different computers connected by a computer communications network. Further, the systems with which we are concerned are assumed to communicate using addressed messages (e.g., reference 5) which are multiplexed onto the logical communications channel between the source process and the destination process, rather than using such traditional methods as shared memory (an impossibility for distributed communicating processes) or dedicated physical communications channels between pairs of processes desiring to communicate (which is considered to be prohibitively expensive).
A hybrid filter for image enhancement
Authors: S. Peng, L. Lucke
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

We present a new hybrid filter design methodology. Our hybrid filter consists of a nonlinear impulsive noise filter and a fuzzy weighted linear filter. This hybrid filter can efficiently remove large amounts of mixed Gaussian and impulsive noise while preserving the image details. The performance and robust stability of the proposed filter are compared to linear filters and nonlinear filters theoretically and experimentally.
A computer aided interconnection system
Authors: Richard W. Wilson
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

When electronic equipment is designed there are two ways of defining the equipment: 1) by parts content and 2) by electrical interconnections. The concern here is with electrical interconnections; how they are defined; how they flow through the phases of design; and how a computer-aided system has helped to create an efficient design tool out of a cumbersome manual data flow. By comparing the manual system (Fig 1) with the computer-aided system (Fig 2) some basic problems and their solutions will be discussed, and the important features of the computer-aided system will be outlined. The main area of interest in both Figures is that which is enclosed in boxes.
Digital logic modeling system based on MODLAN
Authors: Adam Pawlak
Venue: Proceedings of the 19th Design Automation Conference (1982)

Digital logic modeling system based on MODLAN - the language for multilevel description and simulation has been presented in this paper. The basic language notions and concepts of structural, functional and behavioral descriptions are recapitulated. MODLAN short presentation has been illustrated with examples of digital elements description Two problems of the system implementation have been dealt with; one is that of data base organization, and the other concerns a simulation algorithm with special emphasis being put on a scheduling procedure on a event list.
Verifying deep logic hierarchies with ALEX
Authors: George M. Koppelman, Klim Maling
Venue: Proceedings of the 17th Design Automation Conference (1980)

A logic design whose structure has the form of a hierarchy is easily verified in a conversational environment. The verification process is based on an explicit methodology, supported by appropriate utilities. The paper describes the verification of the experimental Josephson signal processor control logic by means of the ALEX logic design system.
Automatic Prototype Stroke Generation Based on Stroke Clustering for On-Line Handwritten Japanese Character Recognition
Authors: Kazutaka Yamasaki
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

An automatic method for generating prototype strokes is proposed for on-line handwritten character recognition. The method consists of two steps: an intra-category step and an all-category step. In the first step, which has been already proposed by the author, handwritten stroke examples are clustered to obtain prototype strokes for each category.In the second step, these prototypes are merged to obtain common prototype strokes for all categories. This two step approach alleviates the difficulty in determining initial clusters for a large number of examples. To assess the quality of them, recognition experiments are conducted to see the relationship between the number of prototypes and the accuracy.It is found that the two relationships in kanji categories and in non-kanji ones differ to each other. This observation indicates that a set of prototype strokes for Japanese characters can be made of common prototypes for all kanji categories and prototypes for each non-kanji categories.
Parallel processing and data driven implementation of a relational data base system
Authors: Philip Y. Chang
Venue: Proceedings of the 1976 annual conference (1976)

A simple query to a large data base may take a prohibitively long time to process. To decrease this time in applications requiring fast response, parallel processing is necessary. Within the scope of a Relational Algebra query system, the potential parallelism in query execution is investigated. Three levels of parallelism are identified: independent parallelism, pipelining and node splitting. It is shown that, under certain conditions, the exploitation of these levels makes highly parallel processing and short response time possible. A data driven computation scheme which can implement the three levels of parallelism in a unified way is described.
Implication algorithms for MOS switch level functional macromodeling implication and testing
Authors: M. R. Lightner, G. D. Hachtel
Venue: Proceedings of the 19th Design Automation Conference (1982)

In this paper we introduce the concept of implication for MOS switch level circuits. The implication performed on these circuits is an extension of the classical implication now applied to Boolean logic networks. Given the ability to perform implication on MOS circuits we can then; generate functional macromodels of MOS circuits, use these macromodels to verify the Boolean function realized by the MOS circuit extracted from the mask set, generate, directly from the MOS circuit sets of tests for nodes stuck-at-1 and stuck-at-0 as well as transistors stuck open and stuck short. We present the conceptual frame work and algorithms for performing implication on MOS networks. We present examples of MOS implication and discuss extensions of the algorithm to test generation, and to a first order instead of zero order MOS network.
Bayesian models of design based on intuition
Authors: K. M. Chandy
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Most computer system designers use a great deal of intuition in the design process. Intuition is often used to handle uncertainty in design parameters. Since uncertainty seems to be intrinsic to most design problems it follows that designers will continue to rely on intuition or &ldquo;sound engineering judgement&rdquo;. This paper attempts to use Bayesian Decision Theory to explore the possibility of setting up a structure and theory for making design decisions in the computer system design environment while explicitly taking the intuitive nature of many design decisions into account. We shall focus attention on a particular problem in distributed data base design in which the designer must use his intuition to estimate the load on the system which he is designing. Similar Bayesian approaches could be used in other design problems.
Efficient octree conversion by connectivity labeling
Authors: Markku Tamminen, Hanan Samet
Venue: ACM SIGGRAPH Computer Graphics (1984)

We present an algorithm for converting from the boundary representation of a solid to the corresponding octree model. The algorithm utilizes an efficient new connected components labeling technique. A novelty of the method is the demonstration that all processing can be performed directly on linear quad and octree encodings. We illustrate the use of the algorithm by an application to geometric mine modeling and verify its performance by analysis and practical experiments.
An analysis of CP/NET
Authors: George H. Clapp
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

CP/NET, a software package designed to add networking capabilities to microcomputers running under the CP/M-80 operating system, is examined with respect to internal logical organization, separation of functions, and correspondence with the ISO OSI reference model.
The use of a repair center simulator
Authors: George L. Adler
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The model, written in GPS K, (General Purpose Simulator K is a discrete simulation software package offered by Honey-well Information Systems, Inc.) is in a generalized form from which any specific repair center can be simulated. A repair center is a depot from which service engineers of various skill and ability are dispatched to answer failures of computers and remote entry devices. The model is presently used to evaluate the impact of additional customers on the repair center, skill mix of service engineers, various dispatching algorithms, and reorganization feasibilities. In addition to being a working tool, a simulated typical repair center has been used as an experimental model. By varying the input to the simulated repair center (an impracticality in real life), a quantifiable relationship between workload, queue length, and utilization on both sides of the queue was developed.
Systems aids in determining Local Area Network performance characteristics
Authors: Barbara R. Sternick
Venue: Proceedings of the Computer Network Performance Symposium (1982)

At Bethesda, Maryland, the National Library of Medicine has a large array of heterogenous data processing equipment dispersed over ten floors in the Lister Hill Center and four floors in the Library Building. The National Library of Medicine decided to implement a more flexible, expansible access medium (Local Area Network (LAN) to handle the rapid growth in the number of local and remote users and the changing requirements. This is a dual coaxial cable communications system designed using cable television (CATV) technology. One cable, the outbound cable, transfers information between the headend and the user locations. The other cable, the inbound cable, transfers information from the user locations to the headend. This system will permit the distribution of visual and digital information on a single medium. On-line devices, computers, and a technical control system network control center are attached to the LAN through BUS Interface Units (BIUs). The technical control system will collect statistical and status information concerning the traffic, BIUs, and system components. The BIUs will, at fixed intervals, transmit status information to the technical control. The Network Control Centers (NCC) will provide network directory information for users of the system, descriptions of the services available, etc. A X.25 gateway BIU will interface the LAN to the public networks (Telenet and Tymnet) and to X.25 host computer systems.
Programming environments and software engineering
Authors: Anthony I Wasserman
Venue: Proceedings of the 1975 annual conference (1975)

Software engineering deals with problems of building high quality computer software, concentrating on the application of principles, skills, and art to the economical development of programs which run reliably and efficiently on real machines. Development of properly functioning software systems is an extremely complex task, requiring programming skills, interpersonal communication, effective management controls, and ample quantities of time and money. Among the objectives of the discipline of software engineering are the lowering of software development maintenance costs and the improvement of programmer productivity.
The role of emulation in performance measurement and evaluation
Authors: Liba Svobodova, Roy Mattson
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

Emulation of systems makes it possible to combine the predictive power of simulation with the advantages of measurement carried under a real system workload. An emulator is a microprogrammed implementation of the basic hardware machine. It can be easily instrumented to collect performance statistics on the instruction set processor (ISP) level and support performance measurement of different configurations and software of the emulated system. This paper describes the monitoring capabilities of the Microprogrammable Multi-Processor (MMP), a powerful emulator system that serves as an experimental tool for evaluating computer systems. The measurement capabilities of the MMP on various system levels are described, as well as existing performance monitoring tools and their applications. Preliminary results contrasting the Gibson mix and measured instruction frequencies on the AN/GYK-12 computer in a TACFIRE system are given.