ppxscal/embedding_network huggingface dataset:
A communications interface for computer networks
Authors: Donald Karp, Salomon Seroussi
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

The scope of this presentation is to describe the architecture of a communications line protocol for computer networks. Development and implementation details will be introduced where necessary to clarify the presentation. The need for an architecture to facilitate inter-processor communications has been a requirement to the computing industry for several years. The described line protocol was derived through an experiment with a computer network designed for heterogeneous machines, and which utilized existing software. Due to the inflexibility encountered by this approach, the architecture is being re-implemented using our own software. The line interface was defined with flexibility as the foremost requirement. The protocol developed utilizes a minimum set of line control characters. Information is passed in the header portion of the transmitted block providing the capability of identifying a wider range of line control and user related functions. Error recovery has been implemented based on the same type of messages and by transferring line timing responsibilities from the hardware to the software.
The great debate over telematics and employment
Authors: Eduardo Rivera, Lilia Briceño
Venue: Proceedings of the seventh symposium on Data communications (1981)

This paper presents a comprehensive survey of different positions around the problematique of how the Telematics will influence the employment. It is concluded with some comments that open new questions specifically for Mexico.
Parallel scheduling of programs in a restricted model of computation
Authors: K. Vairavan, R. A. DeMillo
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

The purpose of this paper is to present the basis of an automata-theoretic model which treats the concept of &ldquo;schedule&rdquo; for programs which admit a (predefined) degree of parallelism. After a brief review of notational conventions (Section 2), the class of representing automata will be introduced as a device for treating a program's control structure. In Section 4, since the definition of schedules is non-constructive in the sense that no procedure is given for passing from a representing automaton to a schedule, a particular kind of schedule with such an effective presentation is given and shown to be optimal in the natural sense of optimality defined in Section 6. Section 5 presents one of the many possible interpretation schemes for our model; this scheme is used to justify some of the claims we have made in this section. Finally, we examine some elementary conditions, on a program's control structure which affect the existence of optimal schedules which have finite, explicit presentation.
Convolutional bound hierarchies
Authors: Lindsey E. Stephens, Lawrence W. Dowdy
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

The time required to find the exact solution of a product-form queueing network model of a computer system can be high. Faster and cheaper methods of solution, such as approximations, are natural alternatives. However, the errors incurred when using an approximation technique should be bounded. Several recent techniques have been developed which provide solution bounds. These bounding techniques have the added benefit that the bounds can be made tighter if extra computational effort is expended. Thus, a smooth tradeoff of cost and accuracy is available. These techniques are based upon mean value analysis. In this paper a new bounding technique based upon the convolution algorithm is presented. It provides a continuous range of cost versus accuracy tradeoffs for both upper and lower bounds. The bounds produced by the technique converge to the exact solution as the computational effort approaches that of convolution. Also, the technique may be used to improve any existing set of bounds.
SIGTPC (Panel Session)
Venue: Proceedings of the 1976 annual conference (1976)

Authors of the programs competing in the Seventh Annual United States Computer Chess Championship will discuss the state of computer chess programming. Topics to be considered include chess oriented tree searching heuristics, tree searching heuristics that can also be used for more general problems, the pros and cons of exhaustive and selective searches, the present level of play and prospects for future improvement. An attempt will be made to summarize progress to date covering the time since the ACM tournament began in 1970.
An instructional aid for student programs
Authors: Sally S. Robinson, M. L. Soffa
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

Analyzing and grading programs in an introductory computer science course can require a great deal of time and effort from the course instructor. This paper investigates the development of a system called Instructional Tool for Program ADvising (ITPAD) that assumes some of the instructor's duties by keeping student profiles and assignment profiles, by detecting possible plagiarism, and by providing suggestions directly to the students for improving their programs. The design of the ITPAD system is based mainly on the direct application of code optimization techniques to FORTRAN source programs. Several software science measures also provide some of the profile characteristics. The results of test runs show that this system helps the instructor monitor the progress of the students through the term and also helps the instructor determine the individual algorithmic approaches for a particular programming assignment. The system can further benefit the students directly by providing suggestions that emphasize the use of good programming style.
Trends in non-software support for input-output functions
Authors: Ken J. McDonell
Venue: ACM SIGARCH Computer Architecture News (1977)

Input-output subsystem architectures have evolved over the past 20-odd years to the point where two divergent approaches have found acceptance in current computer systems; the 'IBM channel' is the archetype of the lower level alternative, while the functionally more complex techniques involve a wide spectrum of distributed processor architectures supporting database and/or storage management functions independently with respect to the central processor. The paper traces the historical development of support (outside central processor based software) for input-output functions and concludes with a preliminary comparison of the relative merits of the software interfaces provided by the alternative input-output subsystem architectures.
A high-level functional query language for a small relational system
Authors: Hoyt D. Warner, David Odle
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

In this paper we describe the design and implementation of a high-level query language FQUERY which applies the concepts of the functional data model to the retrieval of information from relational databases created on a small PDP-11 system by the RISS relational system described in [Me]. We describe the query language and the functional data model and discuss the benefits they provide for the casual user in expressing queries in a conceptually natural manner.
Invited papers: A Monte-Carlo approach to the approximate solution to sequencing problems
Authors: J. Heller
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

SEQUENCING PROBLEMS are one class of finite problems, i.e., the problem of finding a minimum on a finite set, for which Monte-Carlo methods are satisfactory. In this talk numerical findings obtained for various sequencing problems will be presented.
Accuracy of a Supervised Classification of the Artificial Objects in Thermal Hyperspectral Images
Authors: Slavica Cosovic Bajic
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Thermal hyperspectral imagery introduces new possibilities of the remote sensing /1/, /2/, see e.g. /3 /, /4/. This paper deals with testing the accuracy of the supervised classification of the artificial objects in the thermal hyperspectral imagery, on a part of 79 channels from /5/, in three raster sets: a) five thermal images (8.747, 9.648, 10.482, 11.266, 11.997 mm), b) five thermal images and one infra red reflective (0.807 mm), c) four thermal images (9.648, 10.482, 11.266, 11.997 mm), one infra red reflective and two visible images (0.501, 0.587 mm). The visible channels were used as a substitute for the real ground truth source and one infra red reflective channel was used for the enhanced discrimination of the vegetation. Global characteristics and principal components of thermal rasters were considered; unsupervised and supervised classifications have been done too. The new facts are: difficulty to determine the training fields which are the best or, at least, good enough for desired accuracy of supervised classification. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Multinational information systems (Panel Discussion)
Authors: Richard Nolan, E. Gerald Hurst,  Jr.
Venue: Proceedings of the 1976 annual conference (1976)

Many organizations today face a unique set of problems and opportunities because they operate across international boundaries. To some extent, the growth of the multinational organization has been made possible by electronic communications. Now, more and more of these organizations are using computers to tie together their far-flung operations. The planning, organizing, and supporting of information systems for the multinational will be the focus of this session.
An over-the-cell router
Authors: David N. Deutsch, Paul Glick
Venue: Proceedings of the 17th Design Automation Conference (1980)

A program that produces single-layer planar routing over the cells for I2L and LST2L logic arrays is described. This router has been integrated into a layout system which was previously restricted to the layout of standard cell LSI chips. When used in conjunction with a channel router, the complete routing is produced automatically. This paper defines the over-the-cell routing problem, describes the algorithms for its solution, and presents typical routing results.
The automatic recognition of silicon gate transistor geometries: An LSI design aid program
Authors: Ivan Dobes, Ron Byrd
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper describes a computer program (SIGAP) that analyzes digitized LSI mask data for valid and invalid Silicon Gate transistor geometries. The program's function, as well as the topological mapping technique used, are described. The SIGAP techniques can be adopted to a variety of artwork data preparation tasks, such as elimination of redundancy, overlap creation, area shrink/expand, the decomposition of polygons to equivalent rectangles or vice versa and performing Boolean operations between regions on different masks. The program was implemented in assembly language on a mini-computer using structured programming methods. It efficiently handles data files which are much larger than available core memory.
Improving documentation
Authors: Scott L. McGregor
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

The following report focuses on some of the documentation problems faced by many data centers as well as some proposed solutions. Many of the difficulties experienced at today's data centers stem from the need to better motivate programmers to generate accurate and useful documentation, and to simplify and standardize documentation tasks. This report presents four recommendations to solve these problems. The recommendations are: 1) the creation of a computerized documentation system, 2) the use of matching labels in source code and documentation, 3) the use of tiered documentation formats, 4) the creation of the post of documentation administrator.
On using selection procedures with binomial models
Authors: Shanti S. Gupta, Gary C. McDonald
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

An important aspect of quality assurance receiving increased attention recently is that of vendor (supplier) selection. Such selection involves consideration of quality, price, delivery terms, and other critical aspects. In this article, we formulate and address a selection procedure based on the quality assessment of a sample of n items from each vendor. It is assumed that an appropriate test for quality is available and so the relevant test statistic for the ith vendor is Xi, the number of conforming items from the sample of an items. If pi denotes the probability that an item supplied by the ith vendor is a conforming item, then Xi has the binomial distribution with parameters pi and n. In selecting a preferred subset of k vendors, we consider a decision rule of the form: Select the ith vendor if and only if Xi &ge; max Xj&minus;d, where d is a nonnegative integer lample;jample;k chosen to insure that the probability of a correct selection is at the least a user given (usually large) value. In this context, a correct selection means the inclusion of the vendor characterized by the largest (population) proportion of conforming items. The number of vendors selected with this decision rule is an integer-valued random variable. The operating characteristics (i.e. selection probabilities and expected size of the selected subset) of this selection procedure are related to the underlying pi 's, the common sample size n, and d. We present formulae, tables, and figures relating these quantities as a guide to sample size requirements. Both exact and asymptotic formulae are given to facilitate calculations applicable to general parametric configurations.
Ada and multi-microprocessor real-time simulation
Authors: Stefan Feyock, W. Robert Collins
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

The selection of a high-order programming language for a real-time distributed network simulation is described. The additional problem of implementing a language on a possibly changing network is addressed. The recently designed language Ada (trademarked by DoD) was chosen since it provides the best model of the underlying application to be simulated.
The Database System Simulator (DBSS): Data description and data access capabilities
Authors: Joseph D. Brownsmith
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

This paper presents a simulation sublanguage specifically attuned to the needs of database designers and analysts. This language consists of: (a) facilities for representing logical data structures and for mapping these onto an address space, and (b) data access commands which use these data structure facilities to simulate database traversal. Both the data structure facilities and the data access commands are patterned after the CODASYL data model, a widely known model for which many implementations exist. This paper illustrates the use of the DBSS commands with examples and explains their effect on the internal structure of the supporting facilities.
CADMON: Improving the CAD system human interface
Authors: H. Eisenberg
Venue: Proceedings of the 15th Design Automation Conference (1978)

In determining the goals and priorities of its' second generation CAD System, Hughes Aircraft concentrated heavily on improving the Man-Machine interface. CADMON, a consistent, user-oriented front-end to all CAD applications was the result of this analysis.
PAL&mdash;a language designed for teaching programming linguistics
Authors: Arthur Evans,  Jr.
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

This paper describes PAL&mdash;a new computer language. Given the fact that new languages seem to appear in computer literature at the rate of several per month, it seems incumbent on one who creates a new language to justify having done so. In the present case, there are two important considerations: control and specification. Let us consider each of these in turn. By virtue of our having designed PAL, it is ours. There is no PAL Users Group or Committee of Vested Interests concerned with retaining upward compatibility with what was done last year (or last month). This doesn't mean we change the specifications of the language every few weeks (our students are, in a real sense, our Committee of Vested Interests), but it does mean we can make decisions on changes solely on technical grounds. More important, though, we can design the language to meet the criteria we think important. For example, the language almost demands interpretive execution. Since no one writes production programs in PAL we are able to put up with inefficiencies in the implementation that would otherwise be intolerable. Thus we have designed our own language so that we will have control over it.
Graph isomorphism, general remarks
Authors: Gary L. Miller
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

An open question is the computational complexity of recognizing when two graphs are isomorphic. In an attempt to answer this question we shall analyze the relative computational complexity of generalizations and restrictions of the graph isomorphism problem. In the first Section we show graph isomorphism of regular undirected graphs is complete over isomorphism of explicitly given structures (say Tarski models from logic). Then we show that valence seems to be important. Finally we analyze symmetric cubic graphs.
The progression of realism in computer generated images
Authors: Martin E. Newell, James F. Blinn
Venue: Proceedings of the 1977 annual conference (1977)

The synthesis of continuous tone raster scan images has been the subject of considerable research effort over the past decade or so. Many algorithms have been developed during this period, and many significant advances have been made. However, very few images have been produced which require more than a moment's study to reveal their synthetic origins. This paper reviews the major issues of relevance to the goal of realism in synthetic images. The major achievements towards this goal are reviewed, and the main outstanding problems are identified.
Algorithms for symmetrical polynomials
Authors: Emi Lauer
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

A special representation for symmetrical polynomials is introduced. Algorithms for the ring operations and for several versions of Gauss' method to express an arbitrary symmetrical polynomial by the elementary symmetrical functions are given and analyzed. Empirical observations show that the representation which is the most economical in terms of space is not always the most economical in terms of time.
Generic functions by nonstandard name scoping in APL
Authors: James T. Kajiya
Venue: ACM SIGAPL APL Quote Quad (1981)

We show how to acheive generic functions as in abstract datatypes (such as the Simula CLASS construct or ADA Package notion) for typeless languages, specifically APL. We do this by altering the standard dynamic scoping of names in APL to a scheme we call downward scoping.
An integrated microprocessor support software system
Authors: Christine L. Braun
Venue: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment (1976)

As the commercial use of microprocessors increases, the need for various support software tools arises. These tools include assemblers to aid in the creation of programs, and digital simulators to aid in their checkout. Raytheon's Automatic Micro Processor Support (RAMPS) system is an integrated set of support software programs designed to take advantage of the microprogrammable aspect of the target processor. There are three main components of the RAMPS system - a micro-assembler, a macro-assembler, and a digital simulator. In addition there is a control system, through which the user communicates with all parts of the system. RAMPS is designed to be independent of the particular macro-instruction set determined by the micro-program, insofar as is possible. Thus, it is a versatile system which can be used with any of the various macro-instruction sets developed for the target machine. The RAMPS system is written in FORTRAN and runs on the CDC 6700 computer under the KRONOS 2. 1 Operating System. Designed to support a Raytheon-built microprocessor, its flexibility has already been demonstrated by adaptation to two new, architecturally similar, microprocessors.
Object management system concepts
Authors: Stanley B. Zdonik
Venue: Proceedings of the second ACM-SIGOA conference on Office information systems (1984)

An office database should be a &ldquo;total&rdquo; information resource in that it should be capable of storing data of many arbitrary types. Users of such a system should be able to store conveniently their documents and graphics objects in the same logical storage space as their more traditional records-oriented data. This paper presents a data model that can be used to describe more effectively the objects that occur naturally in the office environment. This model exploits some of the richer semantics of office objects such as the containment of one object within another (e.g., reports contain chapters) and the version histories of objects and their constituent parts. This model forms the basis for our experimental object management system which is used to support the creation of new office application programs.
Bernoulli methods for predicting communication processor performance
Authors: Gordon E. Anderson
Venue: Selected papers of the 1982 ACM SIGMETRICS workshop on Software metrics: part 2 (1982)

This paper presents a method for applying Bernoulli trials to predict the number of communication lines a communication processor can process without losing data due to character overrun conditions. First, a simple method for determining the number of lines which a communication processor can support without possibility of character overrun will be illustrated. Then, it will be shown that communication processors can tolerate occasional character overrun. Finally, using Bernoulli trials, the probability of character overrun and the mean time between character overrun will be calculated. These last two figures are useful to system designers in determining the number of lines which a communication processor can reasonably support.
Tramp: An interpretive associative processor with deductive capabilities
Authors: William L. Ash, Edgar H. Sibley
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

In recent years; it has become increasingly clear that there is need for a content-addressable computer memory. Larger and larger programs are being written which require a structured data base to operate with any efficiency. Many of these could well benefit by replacing tedious searches with a fast, efficient, &ldquo;content-addressable&rdquo; access of the data store. A good example is the &ldquo;key-word&rdquo; library search. If one asks for a list of the books written by J. von Neumann, we do not expect the system to look at each title in its store and save only those written by von Neumann. And, if there happens to be a catalog prepared, designed to answer this particular question, we do not want to have to do a binary search to find the correct section of the catalog&mdash;we want to retrieve the answer directly!