ppxscal/embedding_network huggingface dataset:
On Loss-Aware Packet Scheduling for Video Transport over a Multi-Hop IP Network
Authors: Y. Bai, M. R. Ito
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Video streaming over IP networks requires end-to-end loss guarantees. In order to achieve the required end-to-end loss performance, new algorithms for the distribution of end-to-end loss requirements into local loss constraints, as wells as provision of local loss assurance, areproposed. Much of recent research pays little attention to the problem of distributing end-to-end loss requirements to local routing nodes. This paper proposes five schemes for the allocation of nodal loss across a multi-hop IP network. In addition, it uses loss-aware packet scheduling to provide nodal loss assurance, rather than using buffer management as in present node-based loss guarantee techniques. Simulation experiment results demonstratethat integrating the proposed loss allocation methods with the loss-aware packet scheduling scheme not only provides end-to-end loss guarantee for each video, but also provide different classes of videos with different levels of loss guarantees while greatly improves fairness in quality of service amongst videos.
Pilot: A software engineering case study
Authors: Thomas R. Horsley, William C. Lynch
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Pilot is an operating system implemented in the strongly typed language Mesa and produced in an environment containing a number of sophisticated software engineering and development tools. We report here on the strengths and deficiencies of these tools and techniques as observed in the Pilot project. We report on the ways that these tools have allowed a division of labor among several programming teams, and we examine the problems introduced within each different kind of development programming activity (ie. source editing, compiling, binding, integration, and testing).
Definitional interpreters for higher-order programming languages
Authors: John C. Reynolds
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters which are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include McCarthy's definition of LISP, Landin's SECD machine, the Vienna definition of PL/I, Reynolds' definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be classified according to whether the interpreter contains higher-order functions, and whether the order of application (i.e., call-by-value versus call-by-name) in the defined language depends upon the order of application in the defining language. As an example, we consider the definition of a simple applicative programming language by means of an interpreter written in a similar language. Definitions in each of the above classifications are derived from one another by informal but constructive methods. The treatment of imperative features such as jumps and assignment is also discussed.
Introducing practical experience into curriculum 68 through integration of courses
Authors: Larry D. Menninga
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

A course which will give students some practical experience with large programming problems is described, The course combines the material from five separate courses from Curriculum 68. The material is presented in conjunction with a major programming project which is the unifying ingredient of the course. The project provides the student with immediate and realistic applications of the ideas and topics presented in the course.
On the self contained modelling of DB/DC systems
Authors: Peter D. Welch
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

This paper discusses the modelling of DB/DC systems operating in a demand paging environment. As an extension of an earlier definition of Denning a class of systems is defined, those operating with &ldquo;working set integrity&rdquo;, for which one can obtain system response parameters solely from the resource requirements of the input processes when running in isolation. No external information such as a miss ratio curve from another systems environment is required. The interdependence between the resource requirements of processes when running in a systems environment and the system performance parameters is faced directly and expressed as a set of simultaneous equations. The emphasis is on the effect of the sharing of a common set of pages among the active set of processes. Both unrestricted shared usage and usage with locking are treated.
Toward the engineering of software (Panel Discussion): Problems of the 1980's
Authors: Laszlo A. Belady, Philip Enslow,  Jr., C. A. R. Hoare, William A. Wulf
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

This session is a projection of likely developments in software engineering in the 1980's, dealing with both technical and sociopolitical topics. It is based upon a report prepared for the Oregon Report on Computing, held in March, 1978. The future of software engineering will involve providing answers to a large number of questions presently under investigation. Because the field is so immature, the questions cover virtually every area of software development, including each stage of the software life cycle. Of equal importance is the impact that these technical developments will have upon organizations and individuals. Thus, along with these technical issues, a number of sociopolitical questions are raised. Then these technical and non-technical questions are discussed in a unified setting. It is the intent of the session to identify the frontiers of research in software engineering, the impact of this research on actual software development practices, and the questions that should be addressed in gaining further understanding of our discipline.
On tape versus core an application of space efficient perfect hash functions to the invariance of space
Authors: C. Slot, P. van Emde Boas
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

In Complexity Theory the use of informal estimates can be justified by appealing to the Invariance thesis which states that all standard models of computing devices are sufficiently equivalent. This thesis would require, among others, that a RAM can be simulated by a Turingmachine with constant factor overhead in space. Such a simulation is hard to obtain if the traditional spacemeasure for RAM-space is used. The simulation uses a new method for condensing space, based on perfect hashing.
Graphics growth at Clemson University
Authors: Gabriel Acebo,  II
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Interest in computer graphics has been steadily growing at Clemson University and has led to a very rapid expansion of graphics hardware and software. This paper is divided into four parts: &bull; The history of our graphics hardware acquisitions with comments about the advantages and disadvantages of particular devices. &bull; A discussion of software that runs on our system from the perspective of how it shaped our growth. &bull; A discussion of the amount of resources dedicated by Academic Computing Support (ACS, our user support group) to graphics. &bull; A discussion of future growth.
Multibeam antennas for data communications satellites
Authors: E. W. Matthews, W. G. Scott, C. C. Han
Venue: Proceedings of the fifth symposium on Data communications (1977)

This paper presents a survey of the state-of-the-art in multibeam antennas, as particularly applicable to data communications satellites, and analyzes a new configuration to meet such specific needs over the U.S. during the 1980's. Three basic forms of multibeam antennas are described&mdash;those providing space diversity, polarization diversity and variable-shaped beams. The use of lenses, reflectors and phased arrays in various multiheam configurations is described. Hardware developments in the field which are surveyed include both waveguide and TEM lenses, and an off- set fed reflector for INTELSAT V.
An 1130-based logic, layout and evaluation system
Authors: William H. Sass, Stephen P. Krosner
Venue: Proceedings of the 7th Design Automation Workshop (1970)

A relatively small computing system can assist the engineer in performing logic design, simulation, component placement and interconnection Graphic computer-aided design methods improve the man-machine relationship. The combination of a small computer, disk storage units, high performance display, low -cost on-line plotter and unit record I/O devices offers significant benefits to the user. Even the small-sized system is enhanced by a multitasking operating system. The major benefit realized is accessibility for the user. Any nonbusy facility can be immediately accessed by the designer; he doesn't need to wait for the current computer job to complete. The multitasking program attempts to keep all devices operating full- time, thereby offering better system utilization. Remote Job Entry (RJE) to a larger computer system via the telephone network allows the small system to handle extremely large computations for the user. The graphic system operates as a satellite to the larger system, providing the user with a powerful input/output facility, as well as performing local computation.
A generalized manufacturing line simulator system for production, equipment and manpower planning
Authors: G. V. Raju, A. Bendazzi
Venue: Proceedings of the third conference on Applications of simulation (1969)

The simulation model written in GPSS/360 is designed to provide a general frame work to simulate the flow of jobs through a manufacturing line using the specified resources of machines and manpower for a specified number of periods. The model does not have to be altered to simulate each individual production facility. The data, which in effect creates the model of a production facility, comes from a data bank and can be changed from period to period. The model uses GPSS Help Blocks to abstract data from the data bank, store results of simulation performance into the bank and maintain logical consistency of simulation from one period to the next. The model has a production scheduling algorithm with two optionally monitors the line periodically and releases jobs into the line, or it will implement an externally imposed job release policy. The model permits study and measurement of the performance of the production line under a given set of operating rules and their stochastic interaction. By extending the length of simulation to several periods integrated production, equipment and manpower plans can easily be obtained.
The case for an advanced Graduate Record Examination in computer science
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

The Graduate Record Examinations (GRE), first administered in 1937, were initiated as a joint venture of the Carnegie Foundation for the Advancement of Teaching and the graduate school deans of four eastern United States universities. When Educational Testing Service (ETS) began operations in January 1, 1948, it assumed responsibility for the examinations and the program in which they were used. Until 1966, ETS constructed the tests and operated the testing program with the advice of a committee appointed by the Association of Graduate Schools (AGS) within the Association of American Universities. After several graduate schools suggested that it would be both desirable and appropriate to have a broader representation of the graduate education community participate in the program's policy decisions, the Graduate Record Examinations Board was established in 1966.
Optimization techniques for two-dimensional placement
Authors: Lev A. Markov, Jeffrey R. Fox
Venue: Proceedings of the 21st Design Automation Conference (1984)

Present VLSI synthesis programs typically characterized as silicon compilers employ a predefined floorplan and fixed placement of functional elements. Significant broadening of the areas of application and more effective utilization of silicon space can be obtained by using a general placement of functionally clustered elements rather than a fixed floorplan. In this paper we present a new mathematical optimization technique to achieve a two-dimensional placement. The two-dimensional placement problem is the most important part of the hierarchical placement approach being considered by GTE Laboratories for its SilC Silicon Compiler. This paper describes a method of solving the placement problem in a mathematical form and an algorithm for optimization. The construction of a mathematical model and the use of optimization techniques represent the main distinction from heuristic placement procedures. The optimization technique guarantees a feasible placement at each iteration. It is also possible to determine at each stage how close the solution is to the optimum, and therefore the process may be stopped when the result is sufficiently close to optimum. A small, illustrative example of a two-dimensional placement problem was considered.
A simulation model of Univac's DMS-1100&mdash;more than just a performance evaluation tool
Authors: W. G. Griffith, D. Ingerman, C. E. Price
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

This paper describes a fully completed and tested model of the Univac 1100 series data-management system (DMS-1100) operating under EXEC VIII. The model was developed to evaluate the capability, i.e., response time, of DMS-1100 to handle a particular application&mdash;a large, real-time facility assignment and inventory system. The model consists of three interactive modules that represent the application program, the operating system, and the data management system; the data base associated with the application is an input. The model actually represents the activities that take place when transactions are entered into the system. These activities include: &bull; Buffer management &bull; Physical accessing of data-base pages and tables &bull; Record lockout &bull; Deadlock determination &bull; Rollback and recovery &bull; Activity scheduling &bull; Core allocation &bull; I/O operations This model was developed from the functional specifications of DMS-1100 while code was still being written for the system's implementation. It is written in GPSS/360 but utilizes list-processing and set-manipulation techniques that vastly improve run-time efficiency. These techniques made possible the discrete simulation of a complex integrated hardware-software environment on a computer that was also being used to develop the application.
Computer aided design of software systems
Authors: R. R. Willis, E. P. Jensen
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper presents results of studies conducted at Hughes Aircraft Company into automated aids for designing large software systems. In particular, we describe two automated tools that have been developed to establish the feasibility of aiding the construction, modification, and goodness testing of large structure charts of software modules. Further, we present conclusions of studies which establish software system design engineering principles that are necessary for disciplined software development. We conclude by proposing a system which incorporates these engineering principles and the experience gained from using current automated tools into a forward thinking computer aided software design system.
The teaching of documentation and good programming style in a liberal arts computer science program
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

It is apparent that good programming style and documentation standards are an integral part of the requirements of this discipline. Attempts which have been useful by the author to not only teach, but require, the use of these techniques are described in terms of both successes and failures. Samples are presented from the introductory computer science course and the senior level modeling and simulation class. These materials include skeletal programs and pseudocode which are used for illustration, student use, and evaluation. A technique used to simplify the evaluation of student programs is also presented.
ISDE: An Interactive Software Development Environment
Authors: M. Chesi, E. Dameri, M. P. Franceschi, M. G. Gatti, C. Simonelli
Venue: ACM SIGPLAN Notices (1984)

In this paper we present ISDE, an experimental Interactive Software Development Environment. Briefly described is the design methodology for the derivation of an interactive software development environment from a set of general meta-tools and (syntactic and semantic) language definition. The internal program representation common to every environment tool is presented, along with the main features of each implemented or under development tool, emphasizing tools integration and composition capabilities.
Managing systems more effectively through Life Cycle Management
Authors: Joseph Pokorney, Paul Oyer, Joseph Mazzetti, L. Lee Wouters
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The panel will discuss Life Cycle Management (LCM) as an approach to providing more effective management of Federal data processing systems acquisition. Specifically, the panelists will discuss: 1)LCM as it pertains to planning for systems acquisition; 2)the estimation of life cycle costs; and, 3)the application of LCM policies and procedures within an
A single-relation module for a data base machine
Authors: Bruce W. Arden, Ran Ginosar
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

The purpose of this paper is twofold. First, a set of design goals for data base machines is defined, together with a partial order of importance. The main objective is chosen to be a machine capable of executing any relational operation in constant time. Second, architecture of a data base machine is described. Associative array processors are employed together with other means to achieve very high performance. The difficulties arising from the proposed design are considered, various alternatives and trade-offs are discussed, and the effects of future technology are predicted.
The use of simulation in the development and empirical validation of analytic models for emergency services
Authors: Edward J. Ignall, Peter Kolesar, Warren E. Walker
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Simulation models are generally costly tools to use in systems analysis. Whenever applicable, one prefers to use a simple analytic model. However, in many cases, the conditions assumed by solvable analytic models do not hold in the real world. But a simulation can be used to suggest an approximate model and to determine how good an approximation an analytic model is. We show how simulations of New York City's fire and police operations have been used to develop and validate simple analytic models which are now being used to determine the deployment of resources in these two services.
The economics of simulation
Authors: Paul Gray
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This paper presents a framework for decision making about simulations before committing resources. The viewpoint is that of a manager who must decide whether to solve a problem by simulation or by some other means. A decision-analysis type model is introduced to allow the manager to determine the minimum cost method of simulation within the operating and policy constraints of his organization. Two case examples using the methodology are presented.
The Least Common Bigram: A dictionary arrangement technique for computerized natural-language text searching
Authors: Elaine M. Onderisin
Venue: Proceedings of the 1971 26th annual conference (1971)

The LCB (Least Common Bigram) method is a dictionary arrangement technique for computerized natural-language searching, based upon certain statistical characteristics of a data base. Once the distribution of elements (such as bigrams) in the data base is known, the LCB method allows each dictionary entry to be sorted on the element least likely to be found in the data base. Thus the LCB method minimizes the number of dictionary entries examined during text searching. Statistical analysis of a dictionary and data base used in literature searching by IIT Research Institute's Computer Search Center shows the LCB method yields a 400% improvement over the traditional method of dictionary lookup. Applications in machine-assisted translation, indexing, linguistic analysis, and other information storage and retrieval areas are foreseen.
Limitations of Dijkstra's Semaphore Primitives and Petri nets
Authors: S. Rao Kosaraju
Venue: ACM SIGOPS Operating Systems Review (1973)

Recently various attempts have been made to study the limitations of Dijkstra's Semaphore Primitives for the synchronization problem of cooperating sequential processes [3,4,6,8]. Patil [8] proves that the semaphores with the P and V primitives are not sufficiently powerful. He suggests a generalization of the P primitive. We prove that certain synchronization problems cannot be realized with the above generalization and even with arrays of semaphores. We also show that even the general Petri nets will not be able to handle some synchronization problems, contradicting a conjecture of Patil (P.28 [7]).
Switching functions whose monotone complexity
Authors: Ingo Wegener
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

A sequence of monotone switching functions fn:{0,1}n &ran;{0,1}n is constructed, such that the monotone complexity of fn grows faster than O(n2&minus;&egr;) for any &egr;>O. Previously the best lower bounds of this nature were several O(n3/2) bounds due to Pratt, Paterson, Mehlhorn/Galil and Savage. Then we discuss the complexity gap between monotone circuits and circuits over the basis {&Lgr;,V,&minus;} computing the functions, which we have examined before. We show, that for several sequences of monotone functions this gap is at least as large as the largest previously proved gap for sequences of explicitely defined monotone functions (the gap,which was proved for the Boolean matrix product).
The ALTRAN system for rational function manipulation - a survey
Authors: Andrew D. Hall,  Jr.
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

ALTRAN is a complete system for writing programs for the formal manipulation of rational functions in several variables with integer coefficients. This paper gives a brief description of the language, run-time data structures, and implementation.
Social aspects and responsibilities(A Panel Session): The Visualizer as a means of displaying Abt's strategic model
Authors: L. L. Sutro
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

EACH OF THE FOUR preceding papers carries a vital message. If the general public is to take up and apply these messages, its attention must be attracted and held as firmly as television is able to do. A computer, a Visualizer, that would enable authors like ourselves to generate television programs, is proposed by the author.