ppxscal/embedding_network huggingface dataset:
A mathematical formulation for a class of discrete event systems
Authors: R. L. Aveyard
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

In this paper a discrete event system is a dynamical system in which the term event is used to describe the occurrence of a discontinuous change in the elements of the system at a point in time. Events occur at discrete intervals of time, which are not necessarily uniformly separated, and logical relationships govern the discontinuous changes when events occur. The state space is restricted to being discrete and finite.
Processor queueing disciplines in distributed systems
Authors: Elizabeth Williams
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

A distributed program consists of processes, many of which can execute concurrently on different processors in a distributed system of processors. When several processes from the same or different distributed programs have been assigned to a processor in a distributed system, the processor must select the next process to run. The following two questions are investigated: What is an appropriate method for selecting the next process to run? Under what conditions are substantial gains in performance achieved by an appropriate method of selection? Standard processor queueing disciplines, such as first-come-first-serve and round-robin-fixed-quantum, are studied. The results for four classes of queueing disciplines tested on three problems are presented. These problems were run on a testbed, consisting of a compiler and simulator used to run distributed programs on user-specified architectures.
TEDDY2, a program package for 2D parabolic composite region problems.
Authors: S. J. Polak, N. V. Philips
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

Applied physicists usually do not want to solve their problem with a computer, they want to have it solved by a computer. This is an essential difference. In our environment it often prevents physicists from using a computer at all. Therefore we attempt to define classes of problems and classes of algorithms which match in some sense. A problem oriented language is the key which enables those having the problems to use these algorithms. This paper describes the package TEDDY2 which has been constructed to help physicists with the approximate solution of 2 dimensional parabolic composite region problems.
Analysis of channel access schemes for high-speed LANs
Authors: Niels Nørup Pedersen, Robin Sharp
Venue: ACM SIGCOMM Computer Communication Review (1984)

A series of simulation studies into channel access protocols suitable for use in local area networks operating in baseband mode at bit rates of 100 Mbit/s or more is presented, and the usefulness of these protocols for supporting data transmission with mixed traffic is discussed.
The role of integral displays in decision making
Authors: Timothy E. Goldsmith, Roger W. Schvaneveldt
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

A common approach to designing human-computer decision systems is to divide decision tasks between the person and the computer. The success of this approach depends on knowledge of the specific task components and their interactions, information important for allocating tasks to man and machine. Such knowledge is often unavailable for complex, realistic decision situations. Also, people are reluctant to relinquish part of their decision-making responsibilities. One way to circumvent these problems is to provide general assistance to the decision maker that is independent of any particular decision situation. We propose to use the computer to reduce the decision maker's cognitive load rather than his task load. Specifically, we hope to show that human decision processes can be aided by displaying decision-relevant information in ways that capitalize on certain characteristics of the human perceputal system.
Numerical methods for nonlinear stress wave propagation
Authors: Larry D. Bertholf
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

The partial differential equations characterizing stress wave propagation problems include conservation of volume, mass, momentum, and energy plus the constitutive relations for the materials involved. Generally these constitutive relations are nonlinear and numerical methods are required for solutions in various coordinate systems and spatial dimensions. The philosophy of stress wave propagation code development and application at Sandia Laboratories is given in this paper. The way different methods are developed, utilized, and tested is illustrated by many examples in which code solutions are compared to analytic solutions, experiments, and solutions from other codes.
The effects of positional constancy on searching menus for information
Authors: Richard C. Teitelbaum, Richard E. Granda
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

One of the more popular methods today for instructing software designers on how to structure man-display interfaces is with guidelines. Numerous design guidelines have been promulgated in the last several years (Engel and Granda, 1975; Ramsey and Atwood, 1980; Smith, 1980; Kennedy, 1974; Pew and Rollins, 1975) and there is still much current activity in collecting and expanding screen guidelines (Smith, 1981; Smith Aucella, 1982) In the past few years an increased number of empirical investigations quantifying directly the behavioral impacts of individual design guidelines have appeared in the literature. Issues such as the depth of menu hierarchies (Miller, 1981), eye movements during menu viewing (Card, 1982; Kolers, Duchnicky, and Ferguson, 1981), or location of screen entry areas (Granda, Teitelbaum, and Dunlap, 1982) have been experimentally studied.
An area-maximum edge length tradeoff for VLSI layout
Authors: Norbert Blum
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We construct an N-node graph G which has (i) a layout with area O(N) and maximum edge length O(N1/2), (ii) a layout with area O(N5/4) and maximum edge length O(N1/4). We prove for 1 &le; f(N) &le; O(N1/8) that any layout for G with area Nf(N) has an edge of length &Ohgr;(N1/2/f (N) &bull;log N). Hence G has no layout which is optimal with respect to both measures.
N-sorted logic for automatic theorem-proving in higher-order logic
Authors: Lawrence J. Henschen
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This work demonstrates how a first-order logical system with more than one type of individual variable can be used to prove theorems in higher-order logic. Certain of the types are considered to be individuals while other types are treated as predicates and functions. For each pair of types i,j where type i objects are to be predicates over type j objects, a special 2-place predicate symbol P is included which acts as a graph, i.e. P(a,b) iff a(b). The lambda operator could be implemented as a set of comprehension axioms. However, since the axioms needed for a particular theorem are not generally known ahead of time and the inclusion of axioms in a theorem-proving program usually decreases efficiency, a new rule of inference, called naming, is proposed instead. Completeness of the resulting procedure is shown for a small class of higher-order problems. Some suggestions for computer implementation are given.
Whither flowcharting?
Authors: Frederick A. Hosch
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

During the past few years, a growing number of authors have begun to take exception to the previously unquestioned use of flowcharts as a program development tool. These criticisms of the traditional flowcharting methodology center around the claim that flowcharts, like goto's, belong to the class of objects that are detrimental to good programming. Suggested alternatives range from developing programs entirely in well-structured high level languages to replacing conventional flowcharts by some form of &ldquo;structured&rdquo; flowcharts. We are particularly concerned with questions that have been raised regarding the value of flowcharting in introductory programming classes. The teaching of flowcharting as a developmental tool is extremely widespread indeed. While the various methods of indicating data flow, document flow, etc., are certainly an important part of program development and documentation, we consider here only conventional &ldquo;flow of control&rdquo; flowcharts.
Optimal routing in networks with flow-controlled virtual channels
Authors: Simon S. Lam, Y. Luke Lien
Venue: Proceedings of the Computer Network Performance Symposium (1982)

Packet switching networks with flow-controlled virtual channels are naturally modeled as queueing networks with closed chains. Available network design and analysis techniques, however, are mostly based upon an open-chain queueing network model. In this paper, we first examine the traffic conditions under which an open-chain model accurately predicts the mean end-to-end delays of a closed-chain model having the same chain throughputs. We next consider the problem of optimally routing a small amount of incremental traffic corresponding to the addition of a new virtual channel (with a window size of one) to a network. We model the new virtual channel as a closed chain. Existing flows in the network are modeled as open chains. An optimal routing algorithm is then presented. The algorithm solves a constrained optimization problem that is a compromise between problems of unconstrained individual-optimization and unconstrained network-optimization.
Knowledgeable and friendly end users
Authors: Jacek Kryt
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

End user (EU) can be defined as &ldquo;any individual who functions outside of the electronic data processing (EDP) area and is affected by a data processing (DP) system&rdquo; (17, p. 10). Even computer operators and programmers, when they function outside of their professional activities, are EUs of DP systems. The needs of EUs are the ultimate reason for whatever we do with computers. EUs fall into three distinct subgroups. The second subgroup of EU, particularly relevant to our discussions, consists of intermediate end users. They specify the problems the data processing systems are to solve. They are often experts in their own field. Unfortunately they do not often know much about the techniques of data processing and systems.
AIDE - a tool for computer architecture design
Authors: D. J. Ellenberger, Y. W. Ng
Venue: Proceedings of the 18th Design Automation Conference (1981)

AIDE (Architecture Design Environment) is a modeling and simulation system designed to support the development of computer architectures. By providing a modular, hierarchical modeling environment plus interactive simulation and performance evaluation capabilities, AIDE facilitates the critical analysis necessary in top-down architecture designs. The system currently runs under the UNIX* operating system on a VAX** 11/780. This paper presents the organization of AIDE and discusses its application to computer architecture design.
Binocular estimation of motion and structure from long sequences using optical flow without correspondence
Authors: J. L. Barron, R. Eagleson
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

We use the left and right monocular motion and structure parameters of two stereo image sequences (direction of translation, relative depth, observer rotation and rotational acceleration) to compute the absolute depth, absolute translation and absolute translational acceleration for each pair of left and right images. Individual translation parameters computed at each frame are integrated over time using a Kalman filter to provide more accuracy and a "best" estimate of the absolute translation at each time.
A Daemon-based programming system for office procedures.
Authors: Giovanni Cortese, Franco Sirovich
Venue: ACM SIGOA Newsletter (1984)

The paper presents a daemon-based approach to office programming systems. Daemons are &ldquo;agents&rdquo; users create to automate their tasks. They can be seen as user assistants which are able to recognize when their activation is required. Daemons can be exemplarly defined, by supplying them with concrete examples of what they will be asked to do, and are useful to support the individual work as well as to automate in a decentralized, &ldquo;bottom-up&rdquo; fashion complex office procedures. In fact, since they are independent pieces of code, they seem well suited for programming systems which are 'incrementally' developed by different users. A facility for &ldquo;run-time&rdquo; exception handling is also discussed.
Efficient fault tolerant routings in networks
Authors: Andrei Broder, Michael Fischer, Danny Dolev, Barbara Simons
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We analyze the problem of constructing a network which will have a fixed routing and which will be highly fault tolerant. A construction is presented which forms a &ldquo;product route graph&rdquo; from two or more constituent &ldquo;route graphs.&rdquo; The analysis involves the surviving route graph, which consists of all non-faulty nodes in the network with two nodes being connected by a directed edge iff the route from the first to the second is still intact after a set of component failures. The diameter of the surviving route graph, that is, the maximum distance between any pair of nodes, is a measure of the worst-case performance degradation caused by the faults. The number of faults tolerated, the diameter, and the degree of the product graph are related in a simple way to the corresponding parameters of the constituent graphs. In addition, there is a &ldquo;padding theorem&rdquo; which allows one to add nodes to a graph and to extend a previous routing.
The evolution of specification techniques
Authors: Anthony I. Wasserman
Venue: Proceedings of the 1977 annual conference (1977)

The specifications for a software system may be thought of as a description of what a software system does, as opposed to how it does it. Specifications have typicaly been written in a natural language and provide an external, non-procedural elaboration of the capabilities of a system. A specification may contain user documentation, describing how the system is to be used by its eventual users, and may contain information on how the system is to be integrated with other systems in an execution environment. Alternatively, the specification provides a description of a system which fulfills a set of requirements. The specification of a software system may also include information on how the software system should perform, providing constraints on performance measures such as execution time or utilization of primary or secondary memory. Information concerning performance is frequently essential in determining the feasibility of building a system and in providing the implementer with some basis for making design decisions. Often, specifications concerning performance can be used to identify program modules which must be optimized or to recognize that no special efforts are required to achieve the stated performance objectives.
Data flow, abstraction levels and specifications for communications switching systems
Authors: K. S. Shankar, C. S. Chandersekaran
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The purpose of this effort was the specification and design of a family of Communications Switching Systems, such that each design and implementation of the specification leads to a family member. Each set of design and implementation decisions chosen would lead to some appropriate desired member of the family. Basically, our methodology consists of the following six steps, System Modelling, Data Flow Modelling, Features Selection, Modules Selection, Hierarchicalization, and Abstract Machines Specification.
A procedure mechanism for backtrack programming
Authors: David R. Hanson
Venue: Proceedings of the 1976 annual conference (1976)

One of the difficulties in using nondeterministic algorithms for the solution of combinatorial problems is that most programming languages do not include features capable of easily representing backtracking processes. This paper describes a procedure mechanism that uses coroutines as a means for the description and realization of nondeterministic algorithms. A solution to the eight queens problem is given to illustrate the application of the procedure mechanism to backtracking problems.
Compiler testing via symbolic interpretation
Authors: Hanan Samet
Venue: Proceedings of the 1976 annual conference (1976)

A method for compiler testing using symbolic interpretation is presented. This method is a cross between program proving and program testing. It is useful in demonstrating that programs are correctly translated from a high level language to a low level language thereby improving the reliability of the compiler. The term symbolic interpretation is used to describe the process of obtaining an intermediate form of the low level language program that is suitable for further processing by a proof system. Symbolic interpretation is the heart of the system and enables the recording of a transcript of all computations in the program. This process interprets a set of procedures which describe the effects of machine language instructions corresponding to the target machine on a suitable computation model. The highlights and limitations of the process as well as future work are discussed in a framework of a specific LISP implementation on a PDP-10 computer.
Prediction and management of program quality
Authors: H. Remus, S. Zilles
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Techniques such as design reviews, code inspections, and system testing are commonly being used to remove defects from programs as early as possible in the development process. The objective of this paper is to demonstrate that predictors can be devised which tell us how well defects are being removed during the defect removal process. The approach is to develop a straightforward model of the defect removal process, and then use that model to develop formulas that show how measurable parameters&mdash;such as the ratio of major problems (MPs) removed by reviews and inspections to the number of problems (PTMs) removed by testing and the length (L) of an average problem fix&mdash;can be used to estimate: - Effectiveness of the overall defect removal process - Number of defects that remain at the time the product is first shipped to customers. On the bases of statistics for current products, numerical values for effectiveness measures can then be calculated.
Application of modern software techniques to modeling and simulation
Authors: Ronald M. Huhn, Edward R. Comer
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

It is commonly agreed that software developments tend to be high risk activities; simulation is recognized as being even more &ldquo;exciting&rdquo;. Great emphasis is being placed to develop methodologies which lower the risk of software development. Since a major portion of simulation activity is software oriented, it is natural to look to these modern software methodologies for solutions applicable to the modeling and simulation community. The total solution to current dilemmas is many years away. However, significant progress is being made to develop a comprehensive software development methodology that is readily extendable to simulation activities. The major additional burden of modeling and simulation is the handling of the system modeling part of the process. This paper introduces an Integrated Software Methodology (ISOMET) currently in use which has been successfully applied to simulation projects. Modifications to the methodology to accommodate specialized modeling considerations are discussed.
Markov: A general purpose simulation program
Authors: Maurice F. Aburdene, Ralph J. Kochenburger
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper describes in language free flow diagram form, a program for simulating Markov processes (MARKOV) intended for use by someone with programming experience. The program establishes the initial state of the process (if it is unknown), the present state, the previous state, and the number of transitions from each state to all states. These parameters can be used to determine various characteristics of Markov processes of interest to the systems analyst.
The department of defense contractor investment policy model
Authors: Richard William Barker, Kenneth C. Konwin
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The primary aim of this system dynamics study was to understand aerospace defense contractor investment behavior, and evaluate government policies designed to motivate investment in capital within the current fighter/attack aircraft manufacturing market structure. The approach taken analyzes investment projects and capital equipment expenditure flows that arise as a result of the overall decision framework of the firm. The continuous corporate computer simulation model addresses several of the determinants which enter into the capital investment decision. The experimental design includes analysis of various tax and profit policies. Simulation results suggest that increased capital investment is closely linked to the amount of aircraft orders. Consequently, the short-term motivator of increased capital investment is a higher market demand. Tax and profit policy changes, as those suggested by Carlucci Initiative #5, have minor and only long-term effects on the rate of capital investment.
Modeling techniques for manufacturing conveyor systems using GPSS
Authors: L. Wesley Rearick, Frank Gudan, James F. Novotnak
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Computer simulation has long been recognized as a valuable tool for designing and analyzing manufacturing systems. In particular, the transaction flow basis of the GPSS (General Purpose Simulation System) simulation language is well suited for the part flow nature of many manufacturing processes. This paper will describe the simulation of a proposed crankshaft machining line using GPSS with emphasis on coding techniques for modeling various commonly found elements of manufacturing and material handling systems.
The SCRATCHPAD system
Authors: James H. Griesmer, Richard D. Jenks
Venue: Proceedings of the 1975 annual conference (1975)

SCRATCHPAD is an experimental interactive for symbolic computation in use at the IBM Thomas son Research Center. SCRATCHPAD has facilities manipulation of multi-indexed variables and functions, and infinite sums, products, and sequences, and polynomials of arrays. Among the specific capabilities offered system are the following: Multiple-precision integer arithmetic Rational number arithmetic Polynomial and rational function manipulation Differentiation Symbolic integration Manipulation of formal power series Symbolic solution of systems of polynomial equations Two-dimensional output of mathematical expressions
A method for digitally determining amplitude and phase-response information from analog swept sine vibration data
Authors: L. W. Maschoff
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A method where only portions of analog swept sine vibration data channels need to be digitized for extracting amplitude and phase response information is suggested. The method was used on actual vibration data for initial analysis while error studies were conducted on a modeled system with known input and output functions.