ppxscal/embedding_network huggingface dataset:
Interactive color map displays of domestic information
Authors: J. Dalton, J. Billingsley, J. Quann, P. Bracken
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

Governmental decision makers require an increasing variety and volume of information in order to formulate effective policies, plans, and legislation. Moreover, rapid access to this broad body of information is critical to timely and effective governmental action. This paper describes a recent joint project undertaken by the NASA/Goddard Space Flight Center and the Bureau of the Census at the request of the Executive of the President to demonstrate the potential of graphic information display technology for the rapid delivery and effective display of Federal statistics. This project resulted in the development of a prototype Domestic Information Display System which was demonstrated to President Carter, members of Congress, and their respective staffs in June 1978. The Domestic Information Display System is an interactive, menu-driven software system which produces single and bivariate choropleth maps of socio-economic data by county at the national and state level, and by census tract for Standard Metropolitan Statistical Areas (SMSA's). Selected subareas of national and SMSA maps may be dynamically enlarged to show greater detail. Histogram displays may be selected to show statistical as well as geographic structure. The system is minicomputer-based and utilizes the image manipulation capabilities of a raster-scan color graphics terminal designed at NASA/Goddard as part of the Atmospheric and Oceanographic Information Processing System (AOIPS) which was adapted to demonstrate the potential of a Domestic Information Display System. The system is highly interactive and can produce a color map display within seconds of the selection of a data item from a menu. This paper discusses the operation of the Domestic Information Display System, presents sample output products, and describes in detail the software and hardware organization through which the system flexibility and rapid response were achieved.
A useful device for showing the solvability of some decision problems
Authors: Oscar H. Ibarra, Chul E. Kim
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We look at a restricted model of a multihead pushdown automaton and use some of its properties to show the existence of algorithms for some decision problems concerning code sets and vector addition systems.
Packet Error and Frame Rate Controls for Real Time Video Stream over Wireless LANs
Authors: Kazuo Takahata, Norihiko Uchida, Yoshitaka Shibata
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In this paper, QOS Control of realtime multimedia communication system under heterogeneous environment by the wired and the wireless networks is proposed. In our suggested system, as channel coding, FEC (Forward Error Correction) method with Reed-Solomon coding is introduced to reduce the packet error rate on the wireless network. On the other hand, as source coding, transcoding methods including transformation of various video codings such as M-JPEG, MPEG and Quicktime, controls of Q-factor within a frame, frame rate and color depth is introduced to maintain the required QOS, particularly the end-to-end throughput. The increases of the required bandwidth by redudndant packet addition with FEC can be suppressed by the transcoding functions while the packet error rate is reduced to the accepted value. In order to verify the functionality and efficiency in our suggested system, numerical simulation was carried out. As the result, our suggested system by combination of transcoding and FEC could correct the packet error rate with accepted order while maintaining the frame rate and the amount of data transform at a constant.
Relational data-base management and APL
Authors: E. F. Codd
Venue: ACM SIGAPL APL Quote Quad (1979)

Historically, the development of programming languages was driven by a desire to remove needless machine-oriented representation clutter from the programmer's purview. When compared with other implemented programming languages, APL goes quite far in this direction. However, like its competitors, APL provides almost no support for programs that have to access and possibly update data from shared data bases. Such data is usually subject to syntactic and semantic constraints that are declared on a community basis. Moreover, both the data and the constraints are subject to dynamic sharing with other independently-developed programs. We outline the principles underlying the relational model for formatted data bases, including the structures, algebraic operators, normalization, and formal data sublanguages. We conclude with a discussion of the need for a knowledge base (1) to act as a defining base for a proposed data base; (2) to mediate queries and transactions; and (3) to aid in query formulation in formal or natural language. A short list of references is given for those wishing more introductory information about relational database management.
On a general property of memory mapping tables
Authors: Karl Reed
Venue: Proceedings of the first international symposium on Architectural support for programming languages and operating systems (1982)

The paper shows that memory mapping tables can be used to implement the display registers used in providing architectural support for block-structured languages such as Algol 60. This allows full lexical level addressing to be implemented on so-called von-Neuman machines. The problems of fragmentation of the paged address space are explored, and machines with memory mapping schemes capable of supporting the proposals identified. Attention is drawn to the similarity between segmented and paged schemes, and it is suggested that the latter may be used to support the former.
Principles of computer system organization
Authors: Peter J. Denning
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

This paper describes the content of a one-term advanced undergraduate course being developed in the Department of Electrical Engineering at Princeton University. As the title suggests, the course is approached through theory and models, not through case studies. My experience is not only that students find the more traditional case-study approach intellectually unsatisfying and often confused or confusing, but they find that a little formalism helps them to see precisely what is the intellectual content of a discussion. My goal is not to teach them systems programming; it is instead to help them develop mathematical modeling techniques which prove useful in understanding and evaluating systems and their problems. Using this approach, I have successfully taught to juniors material. I have often seen reserved for graduate students.
Normal forms for trivalent graphs and graphs of bounded valence
Authors: Martin Fürer, Walter Schnyder, Ernst Specker
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

A function f is defined, mapping graphs with n vertices onto graphs with vertex set {1,...,n} . f(X) is isomorphic to X and X is isomorphic to Y iff f(X) &equil; f(Y). For each d, the restriction of f to graphs of valence d is computable in time O(n&tgr;(d)) for a suitable integer &tgr;(d). For d > 3, the proof uses a recent result of L. Babai, P.J. Cameron and P.P. P&aacute;lfy on the order of primitive groups with bounded composition factors; for the trivalent case a more elementary proof is presented.
Numerical precision and data structures
Authors: Werner Schenk
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

Group T9 of the ANSI Fortran Committee X3J3 has been assigned to study the areas of numerical precision, storage and data structures, with a goal of developing technical proposals and recommendations for future revisions of the Fortran standard. Developers and users of numerical software have proposed the addition of various functions to return the base of a computer system's number representation. Also desirable are features to enhance Fortran portability, such as single and double precision word lengths, and exponent ranges. Structured types proposed include arrays, records, sets and files.
The design of a language for the development of group theoretic programs
Authors: John Cannon, Lucien A. Dimino
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

In programming a software package for group theoretic calculations one is faced with a number of problems including: 1 the size of the package, 2 the size of the problems to be run in terms of execution time and storage requirements, 3 the need for large dynamic data structures, 4 the desire to produce a portable package. Although the use of one of the existing languages may be a barely acceptable approach to one or two of these problems, none has been found to be a satisfactory approach to all four problems. Consequently only one serious attempt has been made to write such a package in a language other than the machine's native tongue. However, one can meet the minimal acceptable requirements for the language in which such a package can be written. In particular, the discussion will focus on the following features of the language and their implementation: 1. portability, 2. &ldquo;debugability&rdquo; of the source code, 3. linked and/or packed dynamic structures which may extend onto secondary storage, 4. garbage collection, 5. host system independent program overlay structure.
On the working set concept for data-flow machines
Authors: Mario Tokoro, J. R. Jagannathan, Hideki Sunahara
Venue: ACM SIGARCH Computer Architecture News (1983)

This paper discusses the concept of the working set for data-flow machines in order to establish one of the criteria for the realization of cost effective data-flow machines. The characteristics of program execution in conventional machines and data-flow machines are compared. Then, a definition of the working set for data-flow machines is proposed, based on the simultaneity of execution and the principle of locality. Several segmentation, fetch, and removal policies are described. Evaluation is made in terms of feasibility, efficiency, and performance, through computer simulations.
A high level simulation model of a networked computer system
Authors: William H. Hochstettler, Lawrence L. Rose
Venue: Proceedings of the 12th conference on Winter simulation (1980)

The objective of this research was to design and develop a baseline planning tool for the OCLC networked computer system. This planning tool was necessitated by the dynamic, fast-growing on-line bibliographic needs of OCLC's remote library users. In this paper we show simulation to be the best research approach and justify the IPSS language as appropriate to this application. The resultant model of OCLC's networked computer system is highlighted. This tool was developed in a timely manner to meet the immediate goals of OCLC planners and provides a standard baseline model for future extensions.
Second-order mathematical theory of computation
Authors: Zohar Manna
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

In this work we show that it is possible to formalize all properties regularly observed in (deterministic and non-deterministic) algorithms in second-order predicate calculus. Moreover, we show that for any given algorithm it suffices to know how to formalize its 'partial correctness' by a second-order formula in order to formalize all other properties by second-order formulas. This result is of special interest since 'partial correctness' has already been formalized in second-order predicate calculus for many classes of algorithms.
On improving operating system efficency through use of a microprogrammed, low-level environment
Authors: George W. Cox, Victor B. Schneider
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

This paper concerns the measurement of possible gains to be made in efficiency of an operating system by implementing a selected subset of its basic modules in firmware. The subject of our measurement is a skeletal minicomputer operating system designed with modularity, adaptability, and portability in mind. The base system consists of a call support processor providing dynamic binding of procedures and a set of resource management and interprocess communication primitives. One of the major objectives in the design of our base system is to develop criterin for selecting from among its primitives, currently implemented in software, those that, may be suitable for later implementation in firmware.
An integrated stereo-based approach to automatic vehicle guidance
Authors: Q.-T. Luong, J. Weber, D. Koller, J. Malik
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Proposes a new approach for vision-based longitudinal and lateral vehicle control. The novel feature of this approach is the use of binocular vision. We integrate two modules consisting of a new, domain-specific, efficient binocular stereo algorithm, and a lane marker detection algorithm, and show that the integration results in a improved performance for each of the modules. Longitudinal control is supported by detecting and measuring the distances to leading vehicles using binocular stereo. The knowledge of the camera geometry with respect to the locally planar road is used to map the images of the road plane in the two camera views into alignment. This allows us to separate image features into those lying in the road plane, e.g. lane markers, and those due to other objects which are dynamically integrated into an obstacle map. Therefore, in contrast with the previous work, we can cope with the difficulties arising from occlusion of lane markers by other vehicles. The detection and measurement of the lane markers provides us with the positional parameters and the road curvature which are needed for lateral vehicle control. Moreover, this information is also used to update the camera geometry with respect to the road, therefore allowing us to cope with the problem of vibrations and road inclination to obtain consistent results from binocular stereo.
Fault secure multiple-valued logic networks
Authors: James E. Smith, Jean Dussault
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

Fault secure multiple-valued logic networks have their outputs encoded in an error-detecting code so that assumed failures either result in no output error or in a detectable (noncode) output. In this paper we discuss a way of constructing fault secure combinational networks as well as a generalization that we define to be &ldquo;strongly fault secure.&rdquo; The only constraint on the networks themselves is that they be made of positive unate gates and use unordered output encodings.> The fault assumptions are quite general; they include stuck-at faults as well as many other failures which seem reasonable in a multiple-valued technology. Protection is provided against both permanent and intermittent faults. Various unordered codes and their properties are discussed as is the construction of check circuits that are themselves fault secure or strongly fault secure.
Formal module level specifications
Authors: B. P. Buckles
Venue: Proceedings of the 1977 annual conference (1977)

SSL (Software Specification Language) is part of the growing shift of emphasis in software engineering from the latter software development phases to the earlier ones. The purpose of the language is to aid in the process of decomposing functions into subfunctions or, equivalently, systems into subsystems and modules. A formal description of the syntax and semantics exists which has enabled the construction of an automatic translator. The translator makes a series of nontrivial consistency checks based primarily on a system flow model that is assumed to exist apart from the SSL description. The essence of the flow model is captured implicitly by several features within the language.
Fault diagnosis based on effect-cause analysis: An introduction
Authors: Miron Abramovici, Melvin A. Breuer
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper presents the basic concepts of a new fault diagnosis technique which has the following features: 1) is applicable to both single and multiple faults, 2) does not require fault enumeration, 3) can identify faults which prevent initialization, 4) can indicate the presence of nonstuck faults in the D.U.T., 5) can identify fault-free lines in the D.U.T. Our technique, referred to as effect-cause analysis, does not require a fault dictionary and it is not based on comparing the obtained response of the D.U.T. with the expected response, which is not assumed to be known. Effect-cause analysis directly processes the actual response of the D.U.T. to the applied test (the effect) to determine the possible fault situations (the causes) which can generate that response.
Using microcomputers for graphics notes
Authors: Jerry Martin
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

People have been doing graphics since the early caveman started drawing pictures on the walls of the cave. Up until recently, if you wanted to do pictures using a computer, you needed to have a good deal of money and a high frustration threshold. That is beginning to change with the advent of inexpensive microcomputers. The word &ldquo;graphics&rdquo; may mean different things to different people. To a printer it might mean a dingbat, an artist might think of graphics as a part of a picture, or a business person could picture graphics as a pie chart. When I refer to the word &ldquo;graphics&rdquo;, I mean &ldquo;visible media with the use of a microcomputer&rdquo;. That is a rather broad definition and would include some pop artist blowtorching a micro and displaying it on a hubcap. I will use &ldquo;graphics&rdquo; in a more traditional term in that I will concentrate on the more usual functions like line, bar, and pie charts, animation, 3-dimensional graphics, and computer art. Within these major groupings are quite a number of application areas.
Remote computing in higher education: Prospects for the future (a summary of findings of the study on teleprocessing networks in higher education)
Authors: Richard V. deGrasse
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

This paper presents a summary of findings and some conclusions of a teleprocessing in higher education study conducted by the University of Vermont. The 1971 study, funded by the National Science Foundation, was to shed light on the future of computing networks in higher education. A copy of the complete report is available from Richard deGrasse, University of Vermont, Burlington, Vermont. Forecasting the future in a changing environment, like educational teleprocessing, is risky business. Unless educators want to turn over to AT T, the FCC and computer industry marketing the entire responsibility for defining future educational computing systems, we must begin to figure out where we are going and what kinds of systems we will need. This is a tall order and because of the nature of higher education, it may be unachievable. We need better, more responsive hardware and software systems; certainly a more sympathetic common carrier and FCC. It is very safe to say the computer-communications industry has a more accurate forecast of what our needs will be five years from now than we do. To prove it they are committing a lot of money based on their forecasts. Some of the projections made in the study will be debatable; that's good. Let's begin the debate&mdash;it can only help the future of computing in higher education.
A multi-pass, multi-algorithm approach to PCB routing
Authors: Robert S. Fisher
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper describes a multi-pass routing technique in which each connection is initially generated in its optimum path irrespective of all other connections. Subsequent passes are utilized to resolve Pass 1 conflicts by repositioning wires. Each pass has its own algorithm which operates on a single class of connection and resolves local groups of wires at a time with respect to each other. Wires may be moved from one area of the board to another and from one side of the board to the other.
Introduction to simulation
Authors: Thomas J. Schriber
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

This presentation will explore some of the fundamental characteristics of discrete-event simulation modeling, examine the utility of the simulation tool on the basis of industrial experience, discuss the strengths and weaknesses of simulation, and give some suggestive examples of simulation applications. The topic sequence follows . . .an introduction to simulation through a simple example, including possibilities for the generation of random numbers by algorithm the position of simulation in the spectrum of methods useful in systems analysis and design . . .the relative utility of discrete-event simulation as a management science tool, based on published surveys taken among management science practitioners . . .probable reasons for the high utility of the simulation tool . . .the application scope of simulation . . .a second example for simulation: optimization of the decision variable values in a production management context (GPSS-based approach) . . .characteristics of the unaugmented FORTRAN-based approach to the production management optimization problem . . .perspectives on some key simulation programming languages, including GASP, GPSS, SIMSCRIPT, and SIMULA . . .components of a balanced simulation study . . .perspectives on the economics of simulation
The value of a proper software quality assurance methodology
Authors: Michael F. Tighe
Venue: Proceedings of the software quality assurance workshop on Functional and performance issues (1978)

This paper describes the experiences of a project development team during an attempt to ensure the quality of a new software product. This product was created by a team of software engineers at Digital Equipment Corporation, a mainframe manufacturer. As a result, the definition of &ldquo;to ensure the quality of a software product&rdquo; meant minimizing the maintenance costs of the new product. Ease of maintenance and a low bug rate after release to the customer were very important goals from the beginning of the project. This paper compares the degree of application and resultant effects of several software quality assurance methodologies upon different parts of the final product. Many of the product's subsystems were created using all of the discussed methodologies rigorously. Some subsystems were created with little or no use of the methodologies. Other subsystems used a mixture. The observed quality of the various subsystems when related to the methodology used to create them provides insights into the interactions between the methodologies. These observations also supply additional experience to reinforce established beliefs concerning the value of quality assurance methodologies.
APL usage in Europe: Scope and value
Authors: Yves Le Borgne
Venue: Proceedings of the eighth international conference on APL (1976)

The first part of this paper deals with the history of APL in Europe from the early days in 1968 to 1976. The evolution of the numbers of users over the years is given as well as their characteristics. The second part gives the results of a survey which was conducted in 1975 to evaluate the scope and the value of APL usage in Europe. It describes the type of applications, the development costs, the productivity improvement of APL usage compared to more classical programming methods.