ppxscal/embedding_network huggingface dataset:
The organization of the SHARE Algol 60 Translator
Authors: R. G. Franciotti, Marjorie P. Lietzke
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The SHARE Algol 60 Translator is the result of a cooperative effort by the members of the SHARE ALGOL Project. The translator, which operates under the FORTRAN Monitor System, consists of a SUPERVISOR and six phases, each one of which performs a specific function in the translation process. The output of the translator is symbolic assembly language which may be assembled by any of the existing assembly programs for the SHARE machines. The functions of each phase, the general organization of the object code, and the storage allocation scheme used for handling the ALGOL block structure and dynamic array storage are described in this paper.
Interactive task behavior in a time-sharing environment
Authors: Murty Parupudi, Joseph Winograd
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

COntinuous Software MOnitoring System {COSMOS} is a measurement tool developed for observing and analyzing user behavior and operating system performance under the UNIVAC&reg; Series 70 Virtual Memory Operating System {VMOS}, an interrupt-driven, time-shared, demand paging operating system. This paper reports empirical data obtained by using COSMOS to observe a large number of interactions in which a wide class of programs were being executed interactively. Distributions of think time, compute time, page fault behavior, and I/O frequency are presented.
A queueing network approach to the module allocation problem in distributed systems
Authors: R. M. Bryant, J. R. Agre
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

Given a collection of distributed programs and the modules they use, the module allocation problem is to determine an assignment of modules to processors that minimizes the total execution cost of the programs. Standard approaches to this problem are based on solving either a network flow problem or a constrained 0-1 integer programming problem. In this paper we discuss an alternative approach to the module allocation problem where a closed, multiclass queueing network is solved to determine the cost of a particular module allocation. The advantage of this approach is that the execution cost can be expressed in terms of performance measures of the system such as response time. An interchange heuristic is proposed as a method of searching for a good module allocation using this model and empirical evidence for the success of the heuristic is given. The heuristic normally finds module allocations with costs within 10 percent of the optimal module allocation. Fast, approximate queueing network solution techniques based on mean-value-analysis allow each heuristic search to be completed in a few seconds of CPU time. The computational complexity of each search is O (M K (K + N) C) where M is the number of modules, K is the number of sites in the network, N is the number of communications processors, and C is the number of distributed program types. It appears that substantial problems of this type could be solved using the methods we describe.
On the distribution of independent formulae of number theory
Authors: David A. Plaisted
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

It follows by G&ouml;del's incompleteness Theorem [6] that any effective sound system of logic for elementary arithmetic must be incomplete. We show that in any effective sound system of logic for elementary arithmetic, there exist valid unprovable formulae that are quite small relative to the complexity of the logical system. Also, such formulae are quite dense. In fact, the situation is about as bad as it could possibly be. That is , no infinite axiom system for elementary arithmetic can be much more compact than a listing of all the valid formulae. The unprovable formulae we construct express predicates in the classes &Sgr2 and &pgr; 2 of the Kleene arithmetic hierarchy [12]. The construction yields a set of short formulae, at least one of which must be valid and unprovable, but the construction does not tell us which one is valid and unprovable. We also construct small valid unprovable formulae expressing a relation in the class &pgr; 1 of the Kleene arithmetic hierarchy. These latter formulae are not as small. We do not know how small the independent formulae corresponding to the class &pgr; 1 are. The constructions are based on the concept of a restricted oracle, first introduced in [10] and further developed in [11]. The proofs make use of the recent result of Matijasevic [9] concerning the relationship between recursively enumerable sets and Diophantine equations.
An analysis of link level protocols for error prone links
Authors: Leslie Jill Miller
Venue: Proceedings of the seventh symposium on Data communications (1981)

This paper analyzes the maximum throughput across a full duplex link, under three link level protocols. The three protocols all assume cumulative acknowledgements, but the sender's retransmission policy and the destination's policy on retaining correctly received packets which arrive before an expected retransmission do differ. The results quantify the throughput advantages in retaining all correctly received packets, for the two different retransmission policies. A retention policy on the part of the destination is most advantageous when the link is quite error-prone.
An implementation of IPL-V on a small computer
Authors: Ned Chapin
Venue: Proceedings of the 1964 19th ACM national conference (1964)

An implementation of IPL-V has been made that can be run on the computer most widely used by schools and colleges. This can facilitate the teaching of heuristic as well as the already available algorithmic oriented programing languages. For this implementation, the seven objectives selected lead to making the eight major choices that shaped this one-pass implementation. These choices mostly reflect decisions common to the implementation of any programing language. But in contrast to common practice, list processes were used in the implementation itself. Comparisons have been made of this implementation and other IPL-V implementations.
Recovery of Drawing Order from Scanned Images of Multi-Stroke Handwriting
Authors: Yoshiharu Kato, Makoto Yasuhara
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper describes a method to recover the drawing order of a multi-stroke handwritten script from a binary 2D image. First, we construct a graph from the scanned image by applying the thinning process and extracting the skeletal pixels. Next, we identify the start or end vertices in the graph, and then globally analyze the graph to label the graph by determining the types of each vertex and each edge. Finally, we trace all the strokes using the labeling information and recover the drawing order.The method does not enumerate the possible drawing orders and does not cause a combinatorial explosion even if the script is very complex. By recovering the drawing order of a handwritten script, the temporal information can be recovered from a scanned image. Hence, this method will be used as a bridge from the off-line handwriting character recognition problem to the on-line one.
A community/junior college view of curriculum '68
Authors: Frank W. Connolly
Venue: ACM SIGCSE Bulletin (1973)

Q: What is a junior or community college? A: A college that offers two years of a four year undergraduate degree. Based on such an answer it would be assumed that the difference between a four-year and a two-year college is just that&mdash;one offers four years of education and the other only two. The assumption, however, fails to recognize two less obvious but major differences between the two types of institutions: educational objectives, and student population. Differences in these factors affect all areas of a college including curricula offerings and faculty selection. For purposes of this discussion we will examine these two factors (educational objectives and student population) only in terms of computer related curricula.
Segmentation of interference marks using morphological approach
Authors: S. Liang, M. Ahmadi, M. Shridhar
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper deals with the extraction of words from printed documents that have interference and other strokes (enclosing curves, underlines etc.). A new algorithm which combines the two processes of thinning and detection of directional strokes to effectively segment not only straight lines but also smooth arbitrarily oriented curves. The algorithms preserve both connectivity and directional characteristics. The morphological operations based on multiple direction projection planes and skeleton images are adopted here to successfully prevent the "flooding water" effect of conventional morphological operations. The effectiveness of the proposed algorithms is demonstrated on several experimental images.
A short-run forecasting model
Authors: Miklós G. Zilahi-Szabó
Venue: ACM SIGAPL APL Quote Quad (1982)

The paper is divided into four sections. The first section describes and introduces the dynamic problems that are involved in the interaction of short-run investment, financing and operating decision with forecasting and managing cash flows. The architecture of the system is described in the second and third sections. The system adopts a forecasting model and a relational database and support the language APL. The model integrates different statements to simulate &ldquo;what if&rdquo; and provides a tool for analysing the components of cash inflows and cash outflows over twelf time periods. The database model uses the language APL for defining, storing, accessing and modifying of data of the enterprises. The first experiences are given in the fourth section with an example of application.
Data structures for on-line updating of minimum spanning trees
Authors: Greg N. Frederickson
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Data structures are presented for the problem of maintaining a minimum spanning tree on-line under the operation of updating the cost of some edge in the graph. For the case of a general graph, maintaining the data structure and updating the tree are shown to take O((@@@@)m) time, where m is the number of edges in the graph. For the case of a planar graph, a data structure is presented which supports an update time of O ((log m)2).
Software development with executable functional specifications
Authors: Joseph E. Urban
Venue: Proceedings of the 6th international conference on Software engineering (1982)

The Descartes specification language and support software provides a tool for developing and executing functional specifications. A variety of specifications have been developed to support the language design and evaluation. In addition, the language has been applied to the development of a large specification. Current research efforts include: specification development, support software enhancements, and software life cycle impact. An overview of the specification language is included in this paper. The language processor for Descartes is described in relation to providing the capability for executing specifications. Program development and testing with respect to utilizing Descartes is outlined.
Spatial management of information
Authors: William C. Donelson
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

Methods of spatially managing data are currently under study at the Architecture Machine Group. Management concepts are drawn from everyday examples of paper and document handling. However, the work elaborates data types to include: animation, movies, and sound-sync computer graphics. Beyond the application of management information systems, the paper portrays a sophisticated surround of keyboardless, interactive, and large scale graphics. Computer graphics, image processing, and broadcast are viewed as one. The system includes three frame buffers, four minicomputers, two touch sensitive displays, an octophonic sound system, and an MCA Optical Videodisc.
The effect of the PDP-11 architecture on code generation for chill
Authors: C. A. Middelburg
Venue: ACM SIGPLAN Notices (1982)

This paper outlines the implementation of the CCITT*) high level programming language CHILL on PDP-11 computers in the CHILL compiler constructed at the Dr. Neher Laboratories. The characteristics and structure of the compiler are briefly described. The relationship between the PDP-11 architecture and the implementation of CHILL is outlined in more detail.
Literature review bibliography of simulation optimitation
Authors: William Farrell
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Management Scientists and systems analysts often wish to find the values of input variables which optimize (maximize or minimize) some function of system performance. If the system can be described analytically, mathematical programming is used to find the optimum. When systems are too complicated to be described analytically, simulation is the appropriate tool for modelling systems. Therefore, methods of optimization through simulation are quite important to the management scientist. This paper consists of a discussion and a bibliography of the optimization of simulated systems.
A redisplay algorithm
Authors: James Gosling
Venue: Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation (1981)

This paper presents an algorithm for updating the image displayed on a conventional video terminal. It assumes that the terminal is capable of doing the usual insert/delete line and insert/delete character operations. It takes as input a description of the image currently on the screen and a description of the new image desired and produces a series of operations to do the desired transformation in a near-optimal manner. The algorithm is interesting because it applies results from the theoretical string-to-string correction problem (a generalization of the problem of finding a longest common subsequence), to a problem that is usually approached with crude ad-hoc techniques.
Advanced problem solving and algorithm development
Authors: Robert N. Cook
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

A course in advanced problem solving and algorithm development is described in this paper. This course differs from the approach taken in many algorithm texts in that it emphasizes the problem solving process involved in developing the algorithms rather than proofs of correctness. Algorithms are studied in the areas of number theory, array processing, sorting and searching, text processing, and data structures. The course concludes with a discussion of linear, binary, and non-linear recursive algorithms. While some of the algorithms may have been seen previously in other courses, often the problem solving process involved in developing the algorithms is not treated. Thus, the course greatly enhances the students' understanding of the art of problem solving. In addition, it exposes the students to many important algorithms which they will find useful both in later computer science courses and in their professional careers.
A VLSI design methodology based on parametric macro cells
Authors: R. A. Kriete, R. K. Nettleton
Venue: Proceedings of the 21st Design Automation Conference (1984)

A new methodology for designing VLSI circuits has been developed at Harris GSS. The methodology is based on the concept of parametric macro cells. A parametric macro cell is an MSI-level circuit which can be modified by a computer program to meet the needs of a particular design. In this paper we discuss the design methodology, chip layout, the simulation techniques and other software tools used to ensure a valid design, plus the wafer testing approach.
Textual materials for courses in computers and society (SIGCAS)
Authors: William Atchison, Gerald Engel, Stephen Guty, J. Mack Adams, Stephen Cline
Venue: Proceedings of the ACM 1980 annual conference (1980)

Courses is Computers and Society are proliferating as the computer becomes more and more a central force in our society. Such courses are given at all levels in the University. This poses problems of obtaining the proper materials for these various courses. These problems and their solutions will be discussed in this session.
Hardware description levels and test for complex circuits
Authors: C. Bellon, G. Saucier, J. M. Gobbi
Venue: Proceedings of the 18th Design Automation Conference (1981)

A complex circuit can be described at the structural level (gate or register transfer description), at the functional level (state based description) or at a higher level (algorithmic or behavioral level). Test methods have been studied at each level but present severe constraints: complexity problems for the structural level, and error hypotheses for the other levels. After a presentation of the state of the art, we show that the practical solution is a multilevel approach using the techniques of each type of these methods.
A global routing algorithm for general cells
Authors: Gary W. Clow
Venue: Proceedings of the 21st Design Automation Conference (1984)

An algorithm is presented which accomplishes the global routing for a building block or general cell routing problem. A line search technique is employed and therefore no grid is assumed either for the module placements or the pin locations. Instead of breaking the routing surface up into channels, a maze search finds acceptable global routes while avoiding the blocks. Both multi-pin terminals and multi-terminal nets are accomodated. It is shown that the Lee-Moore grid-based approach is actually a special case of the general search algorithm presented. This algorithm is borrowed from the field of artificial intelligence where it has been applied to many state-space search problems.
Existing in a network environment: Challenges and responses
Authors: Mary C. Boyd, Sara K. Graffunder, Joseph T. Jaynes
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

While the field of computing is certainly no stranger to change (technological innovations and user demands being what they are), it seems as though changes lately in industry have accelerated to an almost unmanageable pace. As providers of computing services to university communities, we at UCC's have been perhaps slightly insulated from the more violent eddies of change by fairly stable user bases and predictable (if not incapacitating) levels of funding. This paper seeks to address some of the more tangible issues encountered by our Center as we pass through a period of, to put it euphemistically, transition.
A method for identifying irregular antibodies in a sample of serum
Authors: Neil J. Falvey
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

A method for deterministically identifying irregular antibodies in a sample of serum has been developed. The method is based upon the application of a relatively simple logical propositions to serological test results and a panel of red cells having known antigenic properties. The proposition systematically eliminates antibody candidates from further consideration. If the process is incomplete when applied to the &ldquo;standard&rdquo; panel, the program will specify a &ldquo;special&rdquo; panel. This panel is tailored to produce deterministic results by accounting for all possible antigenic reactions among the antibody candidates not previously eliminated.
A new solution method for the determinantal equation of a matric polynomial
Authors: J. E. Stengl, C. D. Isaacs
Venue: Proceedings of the 1966 21st national conference (1966)

In our analysis of large elastic airplanes at The Boeing Company, we frequently encounter large systems of nth order differential equations. These systems are conveniently displayed in the form of &ldquo;matric polynomials&rdquo;. An investigation of the roots of the associated determinantal equation will give us information about the system such as damping, frequency of oscillations, and coupling of various components. In this paper we discuss some of the results of our investigation into methods of solving the determinantal equation. Because this is not a widely known subject, some definition of nomenclature is in order.
S3, the System and Software Simulator
Authors: Leo J. Cohen
Venue: Proceedings of the second conference on Applications of simulations (1968)

The System and Software Simulator (S3) is a computer program written entirely in Fortran IV and capable of execution on any computer having that compiler available. Thus far S3 has been applied to computer system simulation problems while executing on the Univac 1108 and the IBM system 360, models 50, 65, and 75. The purpose of S3 is threefold; in the first place it provides a convenient computer oriented language for the specification of the total hardware/software environment of a computer system. Secondly, it generates an executable digital event simulation model of the specified system, and thirdly, operates the generated model for some specified length of simulated time, producing performance statistics for all hardware and software aspects of the simulated system.
The working set model for program behavior
Authors: Peter J. Denning
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

Probably the most basic reason behind the absence of a general treatment of resource allocation in modern computer systems is an adequate model for program behavior. In this paper a new model is developed, the &ldquo;working set model&rdquo;, which enables us to decide which information is in use by a running program and which is not. Such knowledge is vital for dynamic management of paged memories. The working set of pages associated with a process, defined to be the collection of its most recently used pages, is a useful allocation concept. A proposal for an easy-to-implement allocation policy is set forth; this policy is unique, inasmuch as it blends into one decision function the heretofore independent activities of process-scheduling and memory-management.
Behavioral level transformation in the CMU-DA system
Authors: Robert A. Walker, Donald E. Thomas
Venue: Proceedings of the 20th Design Automation Conference (1983)

The Carnegie-Mellon University Design Automation system (CMU-DA) [2] consists of a set of computer programs whose goal is to produce a complete design in a user-specified device technology, given as input a behavioral description of the piece of hardware to be designed and a set of constraints. This paper describes one of the tools in the CMU-DA environment - a software package to perform optimizing transformations at the behavioral level. Motivations for these transformations are given, and an example of their use is shown.
Selection processes and their relation to automata
Authors: Pierre LeBeux
Venue: Proceedings of the ACM annual conference (1973)

Most of the uses of computers deal with computational problems and most of the programming languages allow the user to translate his requirements in to computational statements or descriptive statements (we include here the &ldquo;pure computation&rdquo; of scientific problems as well as the data management problems). We will show that a finite selection transducer can be defined to generate syntactically correct sentences when the selection process is applied to the underlying selection. We will then define the pushdown selection and the pushdown selection transducer which is a generator of correct sentences of any context-free language. Such a device could be used to build an interactive incremental editor-compiler for context free languages with the insurance that the output statements are syntactically correct and parsed. This approach is called syntax-directed programming, and seems to be promising for the design of specialized and extensible languages.