ppxscal/embedding_network huggingface dataset:
Domolki's algorithm applied to generalized overlap resolvable grammars
Authors: David S. Wise
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

Recently Hext and Roberts have attempted to refine Domolki's parsing algorithm to include limited context checking. This paper links their effort to Lynch's overlap resolvable grammars, which are here extended to include &egr;-rules. Both Lynch's and Hext and Roberts' versions of the algorithm are modified, the former with a considerable time improvement and the latter using the full power of overlap resolvability. Results are also proposed on removing 1-productions from overlap resolvable grammars for such parsers, answering a question of Lynch. Both new formulations of the algorithm can be efficiently implemented: the former being particularly suited for fixed word length machines, and the latter for newer array processing systems. An extension of these algorithms to parse DeRemer's SLR(1) class of grammars is demonstrated.
A &ldquo;grid-free&rdquo; channel router
Authors: Koji Sato, Hiroyoshi Shimoyama, Takao Nagai, Masaru Ozaki, Toshihiko Yahara
Venue: Proceedings of the 17th Design Automation Conference (1980)

A &ldquo;grid-free&rdquo; channel router (termed GFR) is reported. GFR does not employ grid lines and can obtain better results than the fixed-grid method. Additionally, GFR has several optional functions, such as &ldquo;constraint loop breaking&rdquo;, &ldquo;total branch length minimization&rdquo;, &ldquo;constraint chain cutting&rdquo; and &ldquo;layer changing&rdquo;. The algorithms of these functions are outlined and results obtained by using them are presented.
&ldquo;Software Piracy and protection&rdquo;
Authors: Peter S. Vogel
Venue: Proceedings of the ACM '82 conference (1982)

Protection of the intellect was difficult before the advent of computer technology, and controlling and protecting software is even more complicated. This panel is made up of attorneys whose practices are concentrated in computers and related technologies, and will discuss the relation of the legal system to software protection from misappropriation - &ldquo;PIRACY&rdquo;.
The agency personal information system
Authors: Steve Kaisler
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

The Agency has developed a personal information system which offers simple data management, computational and document preparation services. These services are integrated into a framework patterned after the APL workspace concept. Key features of this system are direct access to the data base from either the user language or the document processor.
Whither goeth fortran?
Authors: Lloyd W. Campbell
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

When the X3J3 committee published a draft proposed FORTRAN Language Standard for public comment and review in March of 1976, the Department of Defense (DOD) requested comments from its agencies. Many comments submitted requested that additional features and capabilities be added to the language. Even though X3J3 added a few of the requested items, Some DOD officials decided that the language still did not meet the needs of DOD. Therefore, a committee was formed to review the DOD comments and to prepare a DOD supplement to the FORTRAN 77 Language Standard. After a number of meetings between December 1977 and April 1978, a proposed DOD supplement was prepared. The proposed DOD Supplement adds the following features: (1) ENDDO statement (2) DO WHILE statement (3) INCLUDE statement (4) IMPLICIT NONE statement (5) Ability to read past some tape file marks (6) Word-oriented bit manipulations The feature needed the most by DOD is some form of bit manipulation. Although a bit data type is the elegant solution to the problem, the word-oriented system is the practical solution. The major part of the DOD bit proposal is identical with the bit manipulation portion of the existing American National Standard ANS/ISA S61.I-1976. The other features enhance the language and improve the capability for writing structured programs. All of the proposed features should be relatively easy to implement and will save more than their cost by reducing programming time and errors. Many other requested features were not included because of questionable value and potential high implementation cost.
Emulating an MIMD architecture
Authors: Su Bogong, Ralph Grishman
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

As part of a research effort in parallel processor architecture and programming, the Ultracomputer group at New York University has done extensive simulation of parallel programs. To speed up these simulations, we have developed a parallel processor emulator, using the microprogrammable PUMA Computer System previously designed and built at NYU.
How to design a system in which modules can be changed on the fly
Authors: R. S. Fabry
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

In a system made up of many modules, each managing its own peculiar types of data structures, it is often necessary to update one of the modules so as to provide new features or an improvement in the internal organization. If the interface to the module is unchanged or merely augmented the programs which interact with the module need not be changed. If the system can be brought to an orderly halt and if the module does not manage permanent data structures, it will merely be necessary to recompile the modified module, relink the system, stop the old system, and install the new one. If the module does manage permanent data structures which must be modified and the system is one which is expected to continue operation throughout the change, the problem is more difficult, but it can be solved. This paper discusses a solution.
Interpretation of conceptual diagrams from line segments and strings
Authors: K. Kise, N. Yoneda, S. Takamatsu, K. Fukunaga
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A conceptual diagram is a kind of diagram which represents a logical structure among concepts using simple physical objects (loops, lines and character strings). This paper presents a method of interpretation of conceptual diagrams. In conceptual diagrams, a single physical object plays various logical roles depending on surrounding physical objects, because there are no specific ruled of writing conceptual diagrams. To cope with this problem, we introduce the strategy of hypothesis generation and verification; hypothesized interpretations are verified by relaxation which takes account of logical relations to other physical objects. From the experimental results using 50 conceptual diagrams, we discuss the effectiveness of our method.
Simulating the univac 1100/82 using univac 1100/22 characteristics
Authors: Melissa J. Walls
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The work described in this paper was performed by The MITRE Corporation for the System Engineering Branch of the Network Control Center Division of NASA's Goddard Space Flight Center. The objective of the work was to evaluate the adequacy of a U1100/82 based computer system to support future workloads and software capabilities. Since no data on the U1100/82 system existed at the beginning of the task, a model of the U1100/82 system was extrapolated from a model of an existing U1100/22 based system with similar software. The extrapolated model was then used to perform the evaluation. This paper discusses the assumptions and techniques used to develop the extrapolated model, the model calibration and the success of the modeling approach.
Simulation's role in project development (Panel 1)
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This panel will discuss some of the factors which bear on the problem of placing simulation in its proper perspective in a total project development effort. The process of how management evaluates whether or not simulation is a viable management aid to the decision-maker involved in some specific project development programs will be addressed. Several examples will be given and more than one simulation approach will be covered. Examples will be taken from both the public and private sectors.
Computer support for teaching large-enrollment courses
Authors: William H. Dodrill
Venue: ACM SIGCSE Bulletin (1982)

Computing systems are particularly useful for teaching support of large-enrollment courses where essentially the same material is covered during successive course offerings. Described herein are the computer capabilities developed and used for teaching introductory computer science courses at West Virginia University. Capabilities include examination question data base creation and maintenance, automated examination preparation and grading, and student records handling.
Some efficient random number generators for micro-computers
Authors: Arne Thesen, Zhanshan Sun, Tzyh-Jong Wang
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The relatively slow speed and small word size of the current crop of micro-computers cause the efficient production of pseudo-random numbers on these machines to be considerably more difficult than on larger computers. As a consequence, some micro-computer-based algorithms are excessively time comsuming, while other algorithms trade off speed against &ldquo;randomness&rdquo;. To alleviate this problem, we present in this paper several families of pseudo random number generators explicitly designed for use on micro-computers. Some of these are adaptations of well known generators to the micro-computer environment, others are new or lesser known algorithms designed to overcome some of the restrictions intrinsic to the micro-computer's 8 and 16 bits environments. For each generator the basic algorithm is discussed and FORTRAN and/or Pascal implementations for IBM-PC's with and without the 8087 co-processor are presented. Values of coefficients leading to pseudo random number streams with good statistical properties are recommended and an empirical evaluation of computational efficiency is offered.
Soothsayers of the electronic age
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Within our lifetimes, we have seen three generations of computers flourish and fade into the archives of technology. Today we are experiencing the fruits of the Fourth Generation. Our expectations of the Fifth Generation are the focus of this conference and, indeed, of the plans for our immediate future. From these expectations, we can extrapolate to the Sixth Generation. But what lies beyond? Three noted thinkers in the computer industry comprise this panel of soothsayers, examining the omens and auguries of this electronic age. Dr. Carl Hammer investigates the scenario beyond the data processing horizon. He explores processing by systems which are intelligent, expert, and capable of making complex decisions, human decisions. Dr. Kerry Joels predicts the Seventh Generation system, giving specifications, capabilities, and costs of a likely model. He maps the route for reaching the Seventh Generation and points out the landmarks on a journey we have already begun. Dr. Alan Kay foretells the future of small computers in an age of democratization of access and universal computer literacy. Each speaker will address the interaction between the demands of technology on society and the demands society will make of its technology. And each will forecast a future which could be possible, should we wish it to be.
Development of computer components and systems
Authors: W. S. Elliott
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

Work has been proceeding at Elliott Brothers Research Laboratories since 1948 on high-speed digital computing and data transmission techniques. The work was originally directed towards one particular special purpose high-speed computing project, although it was hoped from the beginning that techniques and designs for general purpose machines would evolve naturally from the programme. Since the inception of this work there have been changes in the policy of the original project, together with additional commitments for new digital projects. Circuit and technique developments for these projects have resulted in the evolution of a range of sub-units from which a wide variety computers may be constructed without further development. Some parts of the work have already been reported in some detail(1),(2)Mention of the work and aims was made at the Rutgers meeting in 1950(3). The present paper is a progress survey and outlines future proposals for a range of packaged sub-units.
A historical, generalistic, and complementary approach in introductory computer science education
Authors: Izumi Kimura
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

A polished version of &ldquo;Computers and Programming&rdquo; of ACM Curriculum 68 is presented. The central theme here is the design philosophy of the course. The approach is (1) historical, in that it quickly draws an idealized picture of the history of computers and programming. It is (2) generalistic, in that it teaches various sides of the subject, including advanced software engineering ideas, in parallel in a balanced manner. Finally, it is (3) complementary, in that it takes into account the fact that a conventional Fortran course, corresponding to &ldquo;Introduction to Computing&rdquo; of Curriculum 68, is being taught simultaneously by another instructor.
Batch computer scheduling: A heuristically motivated approach
Authors: Stephen R. Kimbleton
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

Efficient scheduling of jobs for computer systems is a problem of continuing concern. The applicability of scheduling methodology described in the operations research literature is severely restricted by the dimensionality of job characteristics, the number of distinct resource types comprising a computer system, the non-deterministic nature of the system due to both interprocess interaction and contention, and the existence of a multitude of constraints effecting job initiation times, job completion times, and job interactions. In view of the large number of issues which must be considered in job scheduling, a heuristic approach seems appropriate. This paper describes an initial implementation of such an approach based upon a fast, analytically driven, performance prediction tool.
Requirement specification description system in Japanese language-JISDOS-
Authors: Jun Murai, Nobuo Saito, Norihisa Doi, Masayuki Morohashi, Tetunosuke Fujisaki
Venue: Proceedings of the 6th international conference on Software engineering (1982)

The syntax of a requirement specification description language should be similar to the language in which the users think. We have developed a system called JISDOS in which a user can describe his requirements using a formalized Japanese language. The description language, called JPSL, is basically a translation of PSL with the syntactic characteristics of the Japanese Language. Pre- and post-processors are added to PSA for transformations of JPSL descriptions into PSL and conversely to PSL reports into JPSL, so that no modification was performed on PSL/PSA. A user inputs JPSL statements either in KATAKANA (square phonetic characters) or ROMAJI (English alphabetic representation of Japanese characters), and he can receive various kinds of reports in HIRAGANA (curved phonetic characters) and KANJI (Chinese characters). It is concluded that JPSL has a high degree of readability and descriptive power in writing requirement specifications.
Human factors testing in the design of Xerox's 8010 &ldquo;Star&rdquo; office workstation
Authors: William L. Bewley, Teresa L. Roberts, David Schroit, William L. Verplank
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Integral to the design process of the Xerox 8010 &ldquo;Star&rdquo; workstation was constant concern for the user interface. The design was driven by principles of human cognition. Prototyping of ideas, paper-and-pencil analyses, and human-factors experiments with potential users all aided in making design decisions. Three of the human-factors experiments are described in this paper: A selection schemes test determined the number of buttons on the mouse pointing device and the meanings of these buttons for doing text selection. An icon test showed us the significant parameters in the shapes of objects on the display screen. A graphics test evaluated the user interface for making line drawings, and resulted in a redesign of that interface.
An IPC protocol and its hardware realization for a high-speed distributed multicomputer system
Authors: W. K. Giloi, P. Behr
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Multicomputer systems with distributed control form an architecture that simultaneously satisfies such design goals as high performance through parallel operation of VLSI processors, modular extensibility, fault tolerance, and system software simplication. The nodes of the system may be locally concentrated or spatially dispersed as a local network. Applications range from data base-oriented transactional systems to &ldquo;number crunching.&rdquo; The system is service-oriented; that is, it appears to the user as one computer on which parallel processing takes place in the form of cooperating processes. Cooperation is regulated by the unique interprocess communication (IPC) protocol presented in this paper. The high-level protocol is based on the computer/producer model and satisfies all requirements for such a distributed multicomputer system. It is demonstrated that the protocol lends itself toward a straightforward mechanization by dedicated hardware consisting of a cooperation handler, an address transformation and memory guard unit, and bus connection logic. These special hardware resources, assisted by a &ldquo;local operating system&rdquo;, form the supervisor of a node. Nodes are connected by a high-speed bus (280M bit/sec). Programming aspects as implied by the IPC protocol are also described.
Parallel algorithms for unification and other complete problems in p
Authors: Jeffrey Scott Vitter, Roger A. Simons
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Unification is a basic operation in theorem proving, in type inference algorithms, and in logic programming languages such as Prolog. Prolog will play a major role in software development for the Fifth Generation project, and thus developing fast algorithms for unification is an important goal. This paper shows that the running time for a linear unification algorithm can often be improved substantially by use of parallel processing. The same is true for algorithms for some other complete problems in P, namely, the monotone circuit value problem and the path system accessibility problem. Previous theoretical work in computational complexity has suggested that these problems are not parallelizable; in practice this is not the case. To resolve this paradox, we introduce new complexity classes PC and PC* that capture the practical notion of parallelizability we discuss in this paper. We pose several open questions concerning PC and PC*.
Integrating diverse knowledge sources in text recognition
Authors: Sargur N. Srihari, Jonathan J. Hull, Ramesh Choudhari
Venue: ACM SIGOA Newsletter (1982)

The capabilities of present commercial machines for producing correct text by recognizing words in print, handwriting and speech are very limited. For example, most optical character recognition [OCR] machines are limited to a few fonts of machine print, or text that is handprinted under certain constraints; any deviation from these constraints will produce highly garbled text. This paper describes an algorithm for text recognition/correction that effectively merges a bottom-up refinement process that is based on the utilization of transitional probabilities and letter confusion probabilities, known as the Viterbi algorithm [VA], together with a top-down process based on searching a trie structure representation of a lexicon. The algorithm is applicable to text containing an arbitrary number of character substitution errors such as that produced by OCR machines.
Simulation exercises for computer architecture education
Authors: P. J. Knoke
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

In a case studies approach to computer architecture education, there is a need for small-scale simulation exercises to illustrate significant concepts and to provide hands-on student experience with architectural tradeoffs. Two such exercises are discussed, and one is described in some detail. The exercises cover virtual memory and multiprogramming systems' architecture, and are suitable as projects students can do within a ten-week academic quarter. Some hindsight based on student reaction to these exercises is provided, together with estimated costs to the educator and students for exercise development and execution.
A fixed grid curve representation for efficient processing
Authors: Warren Burton
Venue: ACM SIGGRAPH Computer Graphics (1978)

A compact form of representation for curves and regional boundaries is described. A curve is approximated by a polygonal line where each side joins a grid point to one of its eight nearest neighbors (as is done in the commonly used chain-encoded representation). Vertex number (2k + 1)2m is defined relative to vertex number k2m+l. The resulting representation requires about 5 bits of storage per vertex, irrespective of the total length of the curve. Sections of a curve may be collectively examined. Typically, that part of the curve between vertices number k2m and (k + 1)2m, for some k and m, is considered. Given the locations of the endpoints of a section and the number of sides in the section, it is easy to compute a bounding rectangle which must completely contain the section. Often, this is all the information we need to know about a section. For example, two sections cannot intersect if their bounding rectangles do not overlap. When necessary, a section can be easily divided into two smaller sections, each of which can be examined in turn. This process may be continued down to single sided sections if necessary. Under favorable circumstances, for an n sided approximation to a closed curve, the time required to determine if a point is inside the curve is independent of n. The intersection of n sided approximations to two curves can usually be found in 0(1n n) time.