ppxscal/embedding_network huggingface dataset:
&ldquo;Training the computer operator&rdquo;
Authors: Eugene F. Klausman
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The remarks which I shall make concerning operator training are primarily based upon computers typified by the Univac's I, II, and III and the Univac Solid State Computer. Also, I am considering these training requirements for data processing applications although they apply in many cases equally to engineering and scientific computation. I define a &ldquo;computer operator&rdquo; as a job responsibility of a person who is in charge of the computing equipment while it is in normal operating condition. The equipment includes the processor, its console or supervisory control panel, and the peripheral equipments on-line or off-line. The operator may have assistants to change tapes, paper forms or the like. Normal operating condition is that in which the system is able to operate in continuous or automatic mode without intervention for relatively long periods of time. These periods may be interrupted by occasional transient errors which do not cause maintenance service.
Interactive Approach to the Extraction of Logical Structures from Unformatted Document Images Using a Sub-Structure Model
Authors: Masaki Yamaoka, Osamu Iwaki, Noboru Babaguchi, Tadahiro Kitahashi
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper describes a new document analysis method for unformatted documents such as advertisements or catalogs. Conventional model based approaches to the extraction of logical structures are hard to apply to advertisements or catalogs, because a model of a page can't be defined. However, these kinds of documents have similar configuration about regions that represent each product, where a local model of a local layout and logical structures can be defined. This model, we called sub-structure model, can be used as a template to extract the logical structures from other regions that represent the same kind of products. In proposed system, a sub-structure model is captured through an interactive process with a user. The system was tested on advertisements in Japanese computer magazines and the experiments had shown promising results.
The &ldquo;PI&rdquo; (placement and interconnect) system
Authors: Ronald L. Rivest
Venue: Proceedings of the 19th Design Automation Conference (1982)

&ldquo;PI&rdquo; is an advanced LISP-based placement and interconnect system for custom NMOS or CMOS (single-layer metal) designs. When fully implemented, PI will handle placement of arbitrarily-sized rectangular modules, routing of power and ground, signal routing, and compaction. In this paper we briefly review the structure of PI, and present details on the signal-routing heuristics, focusing on the definition of &ldquo;channels&rdquo;, the global router, the &ldquo;crossing placer&rdquo;, and the channel routers. The signal router is fully operational; the rest of PI is currently being coded and will be more fully described in later papers and theses.
Is there a &ldquo;Best&rdquo; Programming Language For Design Automation?
Venue: Proceedings of the 4th Design Automation Conference (1967)

When I saw the title of this panel discussion, &ldquo;Is There a Best Programming Language for Design Automation?&rdquo;, I thought that this would be the shortest remark I ever had to make - one word, AED, and then I got to thinking about it and noticed that wasn't really keeping to the subject of the panel, so I had to double the length of the paper and say, &ldquo;Yes, AED.&rdquo; I really don't feel terribly controversial yet this afternoon, so I would like to be very brief and merely try to put a slight twist, or maybe an elaboration on the title of the panel, because I think it is ambiguous as it's stated and we should spend some time trying to remove this ambiguity.
Microprocessor control of customer premises telecommunications equipment
Authors: Ray Jakubek, Steve Silverstein
Venue: Proceedings of the 1976 annual conference (1976)

A microprocessor implementation of the control of customer premises telecommunication equipment is presented. The system architecture is described and the processes run under real time control of the microprocessor are outlined. The principles used in the software engineering of the microprocessor code are highlighted and the software and hardware utilities employed in the system design and debugging are explained. The use of a top down approach to this coding application reaped great rewards in terms of an efficient design effort. Maintenance considerations, a key concept in real time telecommunications applications are summarized.
Wolfe programming aptitude test (school edition)
Authors: Jack M. Wolfe
Venue: Proceedings of the ninth annual SIGCPR conference (1971)

A unique feature of this test is that it consists of only three problems. The second problem, moreover, depends on the first and the third problem depends on the two earlier ones. Each of the problems is more intricate than the preceding one. Although one hour of working time has proved adequate for about half the number of students who have taken the test, a minimum scheduling of one and a half hours is recommended. This is suitable for about 95% of the persons likely to be tested. A two-hour limit is preferable because it will permit the slow, careful worker who likes to check his work as he goes along to proceed at his own normal pace. Even additional time may be allowed if it is feasible to do so in one sitting. An important feature of the grading is that when the student made an error in his work, the rest of his work was followed through in detail pursuant to his earlier error. Thus a student may possibly lose credit due to one careless error and still obtain a high score for that problem even if his answers to all parts of the problem are wrong.
Riemann's Hypothesis and tests for primality
Authors: Gary L. Miller
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The purpose of this paper is to present new upper bounds on the complexity of algorithms for testing the primality of a number. The first upper bound is 0(n&frac17;); it improves the previously best known bound of 0(n&frac14;) due to Pollard [11]. The second upper bound is dependent on the Extended Riemann Hypothesis (ERH): assuming ERH, we produce an algorithm which tests primality and runs in time 0((log n)4) steps. Thus we show that primality is testable in time a polynomial in the length of the binary representation of a number. Finally, we give a partial solution to the relationship between the complexity of computing the prime factorization of a number, computing the Euler phi function, and computing other related functions.
Summed-area tables for texture mapping
Authors: Franklin C. Crow
Venue: Proceedings of the 11th annual conference on Computer graphics and interactive techniques (1984)

Texture-map computations can be made tractable through use of precalculated tables which allow computational costs independent of the texture density. The first example of this technique, the &ldquo;mip&rdquo; map, uses a set of tables containing successively lower-resolution representations filtered down from the discrete texture function. An alternative method using a single table of values representing the integral over the texture function rather than the function itself may yield superior results at similar cost. The necessary algorithms to support the new technique are explained. Finally, the cost and performance of the new technique is compared to previous techniques.
Page size in demand-paging systems
Authors: E. Gelenbe, P. Tiberio, J.C. A. Boekhorst
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

The problem of determining page size in a page on demand system is discussed in detail in this paper. After having introduced the problem, the effect page size may have on various system performance measures is reviewed based on measurements of program behaviour and on simple models of system behaviour. This discussion is followed by a detailled study of the effect of the choice of page size on the efficient utilization of primary memory space. The wasted space-time integral (WSTI) of primary memory space is selected as a measure of this utilisation and a new model of program and system behaviour is used to compute the WSTI for different secondary memory devices (drum, ECS and LCS) and different system behaviour parameters such as the time spent in supervisor mode by the operating system to initiate a page transfer, the time spent in the CPU queue by a program which has recovered from a page fault before it receives the attention of the CPU, the global page fault rate (or arrival rate at the secondary storage devices used for paging) and other factors. The influence of each of these factors is discussed and analyzed, and the conditions under which one or another of these dominates the problem is identified.
Modeling and performance evaluation of physical data base structures
Authors: S. B. Yao
Venue: Proceedings of the 1976 annual conference (1976)

A generalized file organization model and performance evaluation system is developed for estimating the performance of physical data base structures. Performance evaluation results based on the cost functions of the model and system are presented. These performance measures are compared with the results of previous simulation models for indexed sequential, multi-list, and inverted file structures. The analytic approach makes the costs of evaluation very low. Consequently, many evaluations may be performed interactively with the file designer when searching for the most suitable structure for a given application.
Reading encrypted postal indicia
Authors: M. Cullen, L. Pintsov, B. Romansky
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

The next generation of postal processing equipment will incorporate some method of verifying the postal revenue block (postal indicia) as a means of reducing postal fraud. The introduction of new digital printing technologies necessitates the encryption of revenue block information. This paper presents an approach for the verification process which includes algorithms for reading an encrypted postal indicia. In particular, postal indicia reading is tested for robustness against a variety of printing and media characteristics, and potential defects.
Topologically reliable display of algebraic curves
Authors: Dennis S. Arnon
Venue: ACM SIGGRAPH Computer Graphics (1983)

An algebraic curve is a set of points in the plane satisfying an equation F(x,y) &equil; 0, where F(x,y) is a polynomial in x and y with rational number coefficients. The topological structure of an algebraic curve can be complicated. It may, for example, have multiple components, isolated points, or intricate self-crossings. In the field of Computer Algebra (Symbolic Mathematical Computation), algorithms for exact computations on polynomials with rational number coefficients have been developed. In particular, the cylindrical algebraic decomposition (cad) algorithm of Computer Algebra determines the topological structure of an algebraic curve, given F(x,y) as input. We describe methods for algebraic curve display which, by making use of the cad algorithm, correctly portray the topological structure of the curve. The running times of our algorithms consist almost entirely of the time required for the cad algorithm, which varies from seconds to hours depending on the particular F(x,y).
A software engineering approach to first year computer science courses
Authors: Gary Ford
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

The first year computer science sequence at Arizona State University is described. These courses have a software engineering emphasis, with students introduced to the tools and techniques of high quality software development. Students are given the opportunity to apply these techniques to all phases of the software life cycle.
The application of symbolic mathematics to a singular perturbation problem
Authors: Ellis Horowitz
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A basic technique for the numerical solution of ordinary differential equations is to express them as a singular perturbation problem. However, computational studies indicate that the resultant matrix equations which must be solved are often highly ill-conditioned. In this paper a particular singular perturbation problem which was shown to be ill-conditioned using 8 numerical methods is solved by symbolic techniques. These techniques lead both to an analytic proof of the solution plus to the precise knowledge of the asymptotic behavior of the solution vector as it converges. The difficulties encountered in solving the problem symbolically are discussed. Then several conclusions are drawn about the merits of a symbolic versus a numeric approach when applied to the solution of linear systems. Finally some advice and warnings to both the user and the designer of symbol manipulation systems are given concerning their goals and expectations when large matrix equations are to be solved.
Research directions in abstract data structures
Authors: Mary Shaw
Venue: ACM SIGMOD Record (1976)

A number of interesting research problems arise from current attempts to incorporate abstraction mechanisms in programming languages. Some of them are central issues in current research projects and others are direct extensions of current work. Several problems in each of these areas are outlined below. A third section presents a series of speculations about how this work might evolve in the future. Since this is supposed to be a session to spark research ideas, I have written brief descriptions of a number of topics and not delved very deeply into any one. Most of these problems can probably be solved in more than one way. Hence the fact that a problem is being worked on should not deter anyone from looking at it from another viewpoint.
The legacy of MATHLAB 68
Authors: Carl Engelman
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

MATHLAB 68 is an on-line system providing machine aid for the mechanical symbolic processes encountered in analysis. It is capable of performing, automatically and symbolically, such common procedures as differentiation, polynomial factorization, indefinite integration, direct and inverse Laplace transforms, and the solution of linear differential equations with constant (symbolic) coefficients. We discuss its interactive nature and its range of services which extends from ignorant bookkeeper to, on occasion, expert problem solver. We also describe the internal data representations and algorithms of the system. The paper regards the system as a fixed object and explores its accomplishments, its contributions to future systems, the motivation and consequences of the major decisions made during its development and, perhaps most important of all, its weaknesses.
Increasing computer literacy employability of the blind: A talking microcomputer
Authors: William Teoh, Harry W. Gates
Venue: ACM SIGCSE Bulletin (1982)

A talking microcomputer recently developed at Indiana University-Purdue University at Fort Wayne enables blind and visually impaired students to complete the 2- or 4-year degree program in computer technology without need for sighted readers. The talking microcomputer, and the talking typewriter which was developed as a prelude to it, are discussed not only in the educational context, but also in terms of present and future working environments. Coupling unmodified, commercially available hardware with customized software, the talking microcomputer should be well within the reach of individuals and employers. Future plans include interfacing it with a mainframe, and thus expanding language capabilities.
The simulation of passenger movements through a transit station
Authors: Peter A. Fausch, David Dillard, John F. Hoffmeister
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The simulation model being developed is a discrete-system, event-oriented representation of the movement of individual passengers through a transit station. The model is stochastic in nature with the entities of the system being the individual passengers whose movement through various activities in the station give rise to the events which drive the simulation. Station activity subsystems, such as the ticketing areas, passenger movement areas and platform, are represented by links, nodes, and areas. The outputs from the model are Time Impedance Measures (e.g., Walking Times, Time spent in queue, and Total In-Station Time) and Occupancy or Density Levels (sq. ft. per person) in the movement and queueing areas of the station. The model being developed is part of the New Systems Requirements Analysis Program of the Urban Mass Transportation Administration.
Fourier transform communication system
Authors: J. Salz, S. B. Weinstein
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

The development of rapid algorithms for computation of the discrete Fourier transform has encouraged the use of this transform in the design of communication systems. Here we describe and analyze a data transmission system in which the transmitted signal is the Fourier transform of the original data sequence and the demodulator is a discrete Fourier transformer. This system is a realization of the frequency division multiplexing strategy known as &ldquo;parallel data transmission&rdquo;, and it is constructed in this manner so that the data demodulator, after analog to digital conversion, may be a computer program employing one of the fast Fourier transform algorithms. The system appears attractive in that it may be entirely implemented by digital circuitry. We study the performance of this system in the presence of typical linear channel characteristics. It is shown, via computer simulation and computation of the variances of errors, how the system corrects linear channel distortion.
On relative completeness of programming logics
Authors: Michal Grabowski
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

In this paper a generalization of a certain Lipton's theorem (see Lipton [5]) is presented. Namely, we show that for a wide class of programming languages the following holds: the set of all partial correctness assertions true in an expressive interpretation I is uniformly decidable (in I) in the theory of I iff the halting problem is decidable for finite interpretations. In the effect we show that such limitations as effectiveness or Herbrand definability of interpretation (they are relevant in the previous proofs) can be removed in the case of partial correctness.
ATLAS: A geographic database system data structure and language design for geographic information
Authors: Tateyuki Tsurutani, Yutaka Kasahara, Masaru Naniwada
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

The design concepts and languages of a geographic information system ATLAS (Administration and Total Landuse Analysis Support system) are proposed. The database structure is designed based on the geographic information structure concepts which contain semantic structure, topological structure and location structure. For a flexible user interface, the system provides two languages) IGL (Interactive Geographic Language) and GDDL (Geographic Data Definition Language), whose functions are designed based on the geographic information structure concepts. IGL is an interactive end user language, which facilitates information retrieval under geographic and/or statistic conditions and thematic map production. GDDL is a language for a system manager who constructs and maintains the database.
Some simplified NP-complete problems
Authors: M. R. Garey, D. S. Johnson, L. Stockmeyer
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this paper we show that a number of NP-complete problems remain NP-complete even when their domains are substantially restricted. First we show the completeness of SIMPLE MAX CUT (MAX CUT with edge weights restricted to value 1), and, as a corollary, the completeness of the OPTIMAL LINEAR ARRANGEMENT problem. We then show that even if the domains of the NODE COVER and DIRECTED HAMILTONIAN PATH problems are restricted to planar graphs, the two problems remain NP-complete, and that these and other graph problems remain NP-complete even when their domains are restricted to graphs with low node degrees. For GRAPH 3-COLORABILITY, NODE COVER, and UNDIRECTED HAMILTONIAN CIRCUIT, we determine essentially the lowest possible upper bounds on node degree for which the problems remain NP-complete.
Interactive design of neutron beam collimators using the Monte Carlo technique in APL
Authors: C. Bastian
Venue: ACM SIGAPL APL Quote Quad (1982)

The scattering and absorption of a neutron beam in a system of collimation rings is simulated step by step under user's control. In the APL notation, the expression of a parallel Monte Carlo simulation scheme is straightforward. Coupled with a fullscreen processor, it also provides the user with many possibilities of direct intervention, as well in the process of defining the collimators as in the simulation itself.
Modeling a responsive message Exploitation System
Authors: John C. Mayson,  III, Patrick B. Sampey
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The Current Intelligence Traffic Exploitation System (CITES) model was developed at Headquarters, U.S. Strike Command using GPSS/360. The model simulates the flow of messages through a computer system requiring: message receipt; logging and statistical accounting; message header analysis and editing; automated distribution through visual display interaction; and review, storage and retrieval through remote terminals. The model is being used to validate system design and aid in modifications to the system. Console display stations can be closed for varying times to study the effects on the queues. Abnormally high message volume can be generated to evaluate the capability of the proposed equipment, personnel and system interaction to function under stress conditions.
Toward the design and development of style-independent interactive systems
Authors: Michael B. Feldman, George T. Rogers
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The research project in which we are involved seeks to improve the technical climate for experimentation with the human factors of interactive systems by developing tool Kits to aid the experimenter [3,5]. These capabilities are in two general areas: languages and metrics to support the specification of user interfaces [1] and the evaluation of them with respect to ergonomic factors; and tools to facilitate the development of user interfaces at moderate cost and with short lead time. The latter area, which we have called &ldquo;style-independent interactive systems&rdquo;, or &ldquo;abstract interaction handlers&rdquo;, is taken up in this report.