ppxscal/embedding_network huggingface dataset:
On the complexity of the theories of weak direct products (Preliminary Report)
Authors: Charles Rackoff
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

Let N be the set of nonnegative integers and let <N*,+> be the weak direct product of <N,+> with itself. Mostowski[9] shows that the theory of <N*,+> is decidable, but his decision procedure isn't elementary recursive. We present here a more efficient procedure which operates within space [equation] As corollaries we obtain the same upper bound for the theory of finite abelian groups, the theory of finitely generated abelian groups, and the theory of the structure <N+,&bull;> of positive integers under multiplication. Fischer and Rabin have shown that the theory of <N*,+> requires time @@@@ on nondeterministic Turing machines [5]. We also obtain some very general results about the nature of the theory of the weak direct product of a structure with itself.
A simulation study of a multi-channel queueing system in the hospital environment
Authors: Robert H. Holland
Venue: Proceedings of the third conference on Applications of simulation (1969)

This paper deals with the problem of analyzing the medical examinations of employees in a company managed hospital facility consisting of the following work stations, (1) receptionist, (2) rest rooms, (3) personal history, (4) sight screener, (5) x-ray, (6) laboratory, (7) electrocardiogram, (8) doctors, and (9) immunizations. The medical examination system is analyzed through the use of a GPSS simulation model for which the queue information is developed in three phases&mdash;(1) data collection, (2) estimation of probability distribution forms, and (3) model format development. Each of the above work stations requires one operator with the exception of the doctor's facility for which there are four full time doctors. Considering the personnel and function requirements of each work station, recommendations are made, as a result of the simulation study, for a more efficient utilization of these facilities.
A survey of software engineering courses
Authors: A. A.J. Hoffman
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

Together with the recent, rapid growth in numbers of technical papers, survey articles, symposia, conferences, and books, there is also a corresponding increase in software engineering education activities. In order to obtain some insight into the number and nature of course offerings, Peter Freeman of the University of California, Irvine, published a survey form in early 1977 in both the ACM Software Engineering Notes and the IEEE TC/SE News-letter. Figure 1 replicates this survey form. Most responses were received by April, 1977. Recently, Peter Freeman forwarded these responses to A.A.J. Hoffman of Texas Christian University for analysis and reporting. There were a total of 28 responses from 26 traditional educational institutions, offering regular and special courses, industrial organizations, and professional development companies. Table 1 is a list of the organizations represented by survey respondents. While most responses came from the United States, others originated in France, Canada, and the United Kingdom.
Compiling routines
Authors: Richard K. Ridgway
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

Since the advent of automatic computation, programmers have devoted much of their time and energy to looking up, adjusting, and transcribing material previously programmed. This has proved a most inefficient method of program preparation. Within the experience of the programming staff of Eckert-Mauchly, such manipulation and transcription has been a major source of programming errors. In an attempt to lighten the load on the programmer, and to eliminate such errors, members of the Computational Analysis Laboratory have devised programs called &ldquo;compilers&rdquo;. A compiler looks up subroutines, adjusts them, and assembles them, as a complete program. The fruitfulness of the compiler method of program preparation is now clearly evident. One immediate result is a considerable saving in time in the preparation of programs for the solution of mathematical problems. At present, compilers are capable of handling scientific problems, and in the near future, they will be available to treat commercial problems.
Multiple-output multi-valued prime implicants
Authors: William R. Smith,  III, Haresh Shah
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

A Generalization of multiple-output techniques to multi-valued functions is introduced for which the prime implicants cover any and all values of the function (value consistent), rather than a single value only (k-cover). The entire set of prime implicants is generated by evaluating a single Petrick-like expansion derived from the truth tables. The work is an extension of a single-output technique developed earlier.
Routing table update epoch in packet-switching networks
Authors: K. A. Dassel, W. Chou, A. A. Nilsson
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

A computer communication network must be capable of managing its resources efficiently using a routing procedure, flow control, and buffer management techniques. A general network simulator has been developed as a tool in evaluating the many possible combinations of such techniques. It can also be used in evaluating existing strategies in operating networks and investigating new techniques. In this paper the simulator has been used to investigate several strategies of determining an optimum routing table epoch.
Control structures in programming languages - Part II (Panel Session): &ldquo;The GOTO controversy&rdquo;
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

It has been suggested by Dijkstra and others that elimination of the GOTO statement would have a beneficial effect on the writing, reading and debugging of programs. This session examines both the theoretical and practical aspects of the GOTO controversy, and presents the arguments both for and against the GOTO in the form of a debate.
User services - whom do you work for?
Authors: C. J. Duckenfield
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

Every university computer center has to spend money on machine resources, and every university computer center has to spend money on administrative programmers and machine operators. But to what extent does a university feel that it should spend its resources in support of User Services?
Comparison of UNIX network systems
Authors: A. Wupit
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

Several attempts have been made recently, within university departments and companies, to associate UNIX systems with networks. This paper classifies the most important of these &ldquo;UNIX network systems&rdquo; according to selected criteria such as file system view, transparency, file locality, protection, reliability and implementation level. We first present the criteria, we show their importance and we analyse the aspects of network systems which the criteria influence. We then apply these criteria to all systems for which sufficient information was available, and we classify these systems accordingly. We finally analyse the relationships that exist between the categories of UNIX network systems.
Closed-Form Statistical Estimates Of Optimal Solution Values To Combinatorial Problems
Authors: Bruce L. Golden
Venue: Proceedings of the 1978 annual conference (1978)

In this paper, we pursue the problem of estimating the optimal solution value to an NP-complete combinatorial optimization problem using statistical inference theory. We propose and compare several methods for deriving accurate estimates via closed-form expressions. The computational results obtained are remarkably positive.
Experimental evaluation of on-chip microprocessor cache memories
Authors: Mark D. Hill, Alan Jay Smith
Venue: ACM SIGARCH Computer Architecture News (1984)

Advances in integrated circuit density are permitting the implementation on a single chip of functions and performance enhancements beyond those of a basic processors. One performance enhancement of proven value is a cache memory; placing a cache on the processor chip can reduce both mean memory access time and bus traffic. In this paper we use trace driven simulation to study design tradeoffs for small (on-chip) caches. Miss ratio and traffic ratio (bus traffic) are the metrics for cache performance. Particular attention is paid to sub-block caches (also known as sector caches), in which address tags are associated with blocks, each of which contains multiple sub-blocks; sub-blocks are the transfer unit. Using traces from two 16-bit architectures (Z8000, PDP-11) and two 32-bit architectures (VAX-11, System/370), we find that general purpose caches of 64 bytes (net size) are marginally useful in some cases, while 1024-byte caches perform fairly well; typical miss and traffic ratios for a 1024 byte (net size) cache, 4-way set associative with 8 byte blocks are: PDP-11: .039, .156, Z8000: .015, .060, VAX 11: .080, .160, Sys/370: .244, .489. (These figures are based on traces of user programs and the performance obtained in practice is likely to be less good.) The use of sub-blocks allows tradeoffs between miss ratio and traffic ratio for a given cache size. Load forward is quite useful. Extensive simulation results are presented.
UNIVAC 1108 Hardware Instrumentation System
Authors: D. T. Bordsen
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

The UNIVAC 1108 Hardware Instrumentation System evolved out of the necessity to obtain information on the operations taking place within the 1108 multi-processor system. The instrumentation system supplies three different types of information; a trace of the software executed, a trace of the instructions executed, and a trace of the memory addresses referenced to obtain instructions and operands. This information is used to improve the performance of the UNIVAC 1108 software and to aid in the design of new processor and memory hierarchy designs.
The PHLOX project: Three data bases management systems for micro-computers
Authors: Béatrice Del Vecchio, Philippe Penny
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

The PHLOX project leads to three Data Base Management System (DBMS) packages for micro-computers: PHLOX1 for individual machines, PHLOX2 for servers managing data bases shared between several users in a local network, and PHLOX3, a Distributed DBMS for interconnected work stations. These packages have the essential possibilities of DBMSs that existed only (and not always) on bigger machines previously. The description of a data base can be given, checked and modified at three levels (relational, network and physical). The data manipulation language allows any operation using the relational or the network model, by direct interpretation or from host precompiled application programs. The system automatically and transparently insures the data base's consistency, in any situation (user's error, conflict of access or hardware incident). Thanks to their low cost, their reliability and their ease of operation, such systems can be used for integrated office automation, business management in small companies or documentation centers, as well as in computer aided design installations or medical centers.
On the use of pointers and the teaching of disciplined programming
Authors: Sergio E. R. Carvalho, Miguel Angelo A. Nóvoa
Venue: ACM SIGCSE Bulletin (1976)

In the past few years there has been considerable debate over the question of pointers in programming languages. Some maintain that pointers should not be allowed, while others try to restrict their use in a number of ways. In this paper we try to justify our view that pointers are a natural and useful way to teach beginners in Computer Science to manipulate list structures, provided a group of strong limitations is placed upon them. We define pointers in SPL, a language to teach beginners disciplined programming.
Use of SNOBOL4. as an interactive language for artificial intelligence research
Authors: Dewayne Hendricks
Venue: Proceedings of the ACM annual conference (1973)

SNOBOL4, a very good general purpose string manipulation language, has been made little use of in the past by researchers in the area artificial intelligence. Some of the possible reasons for this could be due to the akward syntax of the language (from the point-of-view of a procedure-orinted programmer) and the large memory requirements of the language in most of its implementations. Modifications have been made to SNOBOL4 as implemented in a virtual memory environment on a 360/67 under MTS, to tailor the language to an interactive environment. Also, a supervisor program has been implemented which asts as an interface between SNOBOL4 and the user and provides him with many of the features which are available in PLANNER and CONNIVER. These modifications have resulted in a language which is quite useful for AI research under MTS.
Light-years from Lena: video and image libraries of the future
Authors: R. W. Picard
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

The average consumer with a personal computer will soon have access to the world's collections of digital video and images. However, the theory and tools that facilitate browsing, querying, retrieval, and manipulation of imagery are still in their infancy. For example, people would like to access content in movies, e.g. "fast forward to where they bicycle through the sky". This new application area reveals an abundance of unsolved scientific problems for image processing. An overview is provided of the key technical challenges that the image processing community should embrace. The scope of the paper is restricted to image processing, with particular focus on the problems of representation and analysis of image content, and frame-to-frame motion.
Combinatorial optimization with rational objective functions
Authors: Nimrod Megiddo
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

Let A be the problem of minimizing c1x1+...+cnxn subject to certain constraints on x&equil;(x1,...,xn), and let B be the problem of minimizing (a0+a1x1+...+anxn)/(b0+b1x1+...+bnxn) subject to the same constraints, assuming the denominator is always positive. It is shown that if A is solvable within O[p(n)] comparisons and O[q(n)] additions, then B is solvable in time O[p(n)(q(n)+p(n))]. This applies to most of the &ldquo;network&rdquo; algorithms. Consequently, minimum ratio cycles, minimum ratio spanning trees, minimum ratio (simple) paths, maximum ratio weighted matchings, etc., can be computed within polynomial-time in the number of variables. This improves a result of E. L. Lawler, namely, that a minimum ratio cycle can be computed within a time bound which is polynomial in the number of bits required to specify an instance of the problem. A recent result on minimum ratio spanning trees by R. Chandrasekaran is also improved by the general arguments presented in this paper. Algorithms of time-complexity O(&brvbar;E&brvbar; &bull; &brvbar;V&brvbar;2&bull;log&brvbar;V&brvbar;) for a minimum ratio cycle and O(&brvbar;E&brvbar; &bull; log2&brvbar;V&brvbar; &bull; log log &brvbar;V&brvbar;) for a minimum ratio spanning tree are developed.
Computer simulation of marine search and rescue operations using newly developed radar beacons
Authors: Kiyoshi Sueuchi, Keigo Kotoh, Takeshi Yajima
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

This paper reports a computer simulation of the operation of a new marine search and rescue system using swept-frequency radar beacons operating under any weather condition. The purpose of this simulation is to study the relationship between the search distance and consistency of recognition of the new system under various circumstances. A comparison of the performance results from actual sea trials with the simulation results under the same sea conditions is given.
On line context free language recognition in less than cubic time(Extended Abstract)
Authors: Susan L. Graham, Michael A. Harrison, Walter L. Ruzzo
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

A new on-line context free language recognition algorithm is presented which is derived from Earley's algorithm and has several advantages over the original. First, the new algorithm not only is conceptually simpler than Earley's, but also allows significant speed improvements. Second, our algorithm serves to explain the connections between Earley's algorithm and the Cocke-Kasami-Younger algorithm. Third, our algorithm allows an implementation which uses only 0(n2/log n) operations on bit vectors of length n, or 0(n3/log n) operations on a RAM. This makes it the fastest known on-line context free language recognition algorithm.
Evolution of the design of a high volume automatic car merge
Authors: K. Chung, J. E. Evans, D. R. Hobaugh
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

In a high volume materials handling system, such as required for baggage handling at airports, it is necessary to minimize transit times between points in the system, i.e. a high speed mainline. It is further necessary for baggage to be entered into and retrieved from the system with the baggage containers at a virtual standstill. Thus arises the basic problem of accelerating a baggage container from standstill to mainline velocity and merging the container into mainline traffic without collision or other interruption of mainline flow. System performance depends upon high density mainline traffic combined with rapid merging of containers from spur lines. The problem can be recognized as being similar to that of entering a freeway system with an automobile, except that freeway merge equations are determined and solved (not always successfully) by the human computer and control system.
Use of an on-line, time-shared graphics system to design and document printed circuit boards
Authors: Leonard Marks
Venue: Proceedings of the 13th Design Automation Conference (1976)

A very advanced computer aided design system was recently put into operation at Martin Marietta's Orlando Division. Its purpose was to provide engineering personnel with a powerful tool for significantly lowering the cost and schedule time required to design and document complex printed circuit boards. This paper describes how the system is utilized and interfaced with related automated activities.
Simulation of a robotic assembly process with visual decision making
Authors: D. L. Kimbler
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

A combined discrete and continuous simulation model of a robotic assembly process is presented. Motion and handling sequences are simulated as discrete events, whereas vision and decision making processes are simulated as continuous processes. The SIMAN simulation language is used to model the assembly process on an IBM compatible personal computer.
Test metrics for software quality
Authors: James Ronback
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

This paper discusses Bell Northern Research's experience in utilizing an extended set of test metrics for assuring the quality of software. The theory and use of branch and path class coverage is discussed and the reaction of users in described. This paper also discusses the effect of using co-resident inspection procedures in achieving cost-effective testing for a high degree of test coverage.
System facilities for CAD databases
Authors: Charles M. Eastman
Venue: Proceedings of the 17th Design Automation Conference (1980)

In this paper, an attempt is made to lay out the special needs of design databases, as compared to the facilities provided in conventional database systems now commercially available. The paper starts from a point of commonality and focusses on the limitations and shortcomings commonly found in current database systems. It is impossible and unwise to make universal statements about DBMS capabilities. Instead, the goal is to identify those special features that, by their capability, provide distinctions beyond the general notions of speed and ratio of logical size to physical size.
Parallel complexity of the medial axis computation
Authors: A. Ferreira, S. Ubeda
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

The main result of this paper shows that the block-based digital medial axis transform can be computed in parallel by a constant number of calls to scan (parallel prefix) operations. This gives time- and/or work-optimal parallel algorithms for the distance-based and the block-based medial axis transform in a wide variety of parallel architectures. In order to design such an algorithm, we first demonstrate that computing a block-based medial axis transform of a binary image reduces to computing the distance based medial axis transform of an oversampling of the image, by proving that their labelings are equivalent.
Stored logic computing
Authors: H. M. Semarne, W. C. McGee
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Computers respond to many programming languages. Instruction formats of different computers differ from one another. The instruction list of a given computer presents a variety of instruction types and grades. Moreover, every computer can be addressed in as many languages as there are applications and levels of sophistication. For efficient computer use, the quality by which a computer language must be judged is its degree of abstraction with respect to the machine logic. Such abstraction tends ideally toward natural human language. The programming convenience due to the use of an abstraction is usually counter-balanced by a proportionate loss of operating efficiency. For the purpose of finding a common point of departure in this variety of language, and of achieving high efficiency, it is interesting to consider micro-commands, the primary building-blocks of all types of computer instruction. Micro-commands cause a machine to open gates, trigger flip-flops, and perform other useful circuit functions. They consequently can control the wired logic which mechanizes the machine-language instructions found in the instruction in the instruction list of the conventional computer.
A technique of global optimization of microprograms
Authors: Mario Tokoro, Takashi Takizuka, Eiji Tamura, Ichiro Yamaura
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

This paper describes a technique of global optimization of microprograms including loops and recursive subroutines. This technique can be applied to a wide variety of microprogrammable machines. The principle of global optimization, four basic types of global optimization, and extended types of global optimization are discussed and the optimization algorithm is shown. Its effectiveness is evaluated and confirmed by applying it to an existing microprogrammable computer composed of LSI processor modules.