ppxscal/embedding_network huggingface dataset:
Adding a modern control structure to APL without changing the syntax
Authors: W. K. Giloi, R. Hoffmann
Venue: Proceedings of the eighth international conference on APL (1976)

In the paper it is demonstrated how through the use of appropriately named defined functions and labels practically all modern control construct types can be introduced into APL, thus greatly enhancing the possibilities of writing understandable and well-structured APL programs. A technique is developed which allows the nesting of these control constructs to any arbitrary depth. A solution is presented which even allows to write coroutines in APL, hence providing a whole new scope of APL programming.
Some properties of precedence languages
Authors: Michael J. Fischer
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

The classes of languages definable by operator precedence grammars1 and by Wirth-Weber precedence grammars2 are studied. A grammar is backwards-deterministic3 if no two productions have the same right part. Operator precedence grammars have no more generative power than backwards deterministic operator precedence grammars, but Wirth-Weber precedence grammars (i.e., grammars having unique Wirth-Weber precedence relations) are more powerful than backwards-deterministic Wirth-Weber precedence grammars; indeed they can generate any context-free language. An algorithm is developed for finding a Wirth-Weber precedence grammar equivalent to a given operator precedence grammar, a result of possible practical significance. The operator precedence languages are shown to be a proper subclass of the backwards-deterministic Wirth-Weber precedence languages which in turn are a proper subclass of the deterministic context-free languages.
From mainframes to micros: Effects on workshop delivery
Authors: Susan J. Bahr
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

Helping users become self-sufficient is a chief function of User Services. To help the user obtain self-sufficiency, documentation and newsletters are written and promulgated, one-on-one consulting is provided, literacy courses are offered, and workshops are taught. From my experience, I have learned that users want to know about computers but they don't want to invest any time in learning. They won't open a manual even if it's written for novices. They refuse to do anything except scan through newsletters in an attempt to minimize the time invested. They consider literacy courses a major commitment of time. Consulting seldom works unless it is done as a response to a question. However, because workshops only require the user to show up at a designated time, they seem to be the best means for imparting computer information to the lazy user. And let's face it, the consumer of User Services is lazy. These broad generalities are especially true at Cuyahoga Community College (CCC). We distribute hundreds of novice-level manuals to faculty/staff/administrators each term, but even the most literate users won't open them. The manuals mostly serve as decoration for their bookshelves. I even get calls from sophisticated users who marvel at how much I know about our text editor, and are amazed that I learned it all by simply reading the manual. We publish a newsletter six times a year. Most of the articles are written for people who know very little about computing at CCC. Unfortunately, only a select few of the CCC staff have come to realize that it is an invaluable information source. We have had a very successful computer literacy course in place for two years, but it is a rare participant who shows up for all of the ten or more classes. Furthermore, the participants rarely spend much time outside of the class trying to learn the material. We provide a good deal of consulting support, but those people who do come to see us usually have ill-defined ideas of what they want and high hopes of spoon-feeding. Because of the CCC staff's love of spoon-fed computer knowledge, workshops seem to be the most successful of all our User Services. Over the past year, the number of people registering for workshops has doubled and now exceeds the number of people the staff can support. This paper examines the reasons for the successes and failures of this method of user education, especially those reasons which are pertinent to my workshop delivery techniques. These techniques have changed over time in order to accomodate the change in the users' attitudes towards workshops.
Performance simulation as a tool in central processing unit design
Authors: Cheryl A. Wiecek, Simon C. Steely,  Jr.
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

Performance analysis has always been considered important in computer design work. The area of central processing unit (CPU) design is no exception, where the successful development of performance evaluation tools provides valuable information in the analysis of design tradeoffs. Increasing integration of hardware is producing more complicated processor modules which add to the number of alternatives and decisions to be made in the design process. It is important that these modules work together as a balanced unit with no hidden bottlenecks. This paper describes a project to develop performance simulation as an analysis tool in CPU design. The methodology is first detailed as a three part process in which a performance simulation program is realized that executes an instruction trace using command file directions. Discussion follows on the software implemented, applications of this tool in CPU design, and future goals.
SIGGRAPH (Papers and Panel Session)
Authors: Robert K. Clark, Charles E. Quenneville, Harvey Z. Kriloff, Joel Sturman, Larry Cornish
Venue: Proceedings of the 1976 annual conference (1976)

Maybe you think computer graphics has little application in your operation. This session may change your mind. It will show how computer graphics is being used to grind out graphs, charts, pie graphs and maps - at the rate of thousands per day. The papers will demonstrate how graphics is being used in real world installations on a variety of devices simutaneously, both passively and interactively. It will show how graphics is being used intensively not only by engineers and scientists, but by bankers, statisticians and (would you believe) congressmen and senators. This session will not only show examples of the amazing use of simple and multicolor graphics in day to day applications but also how easy it is to go graphics.
The use of APL in a concurrent data flow environment
Authors: Michael N. Wakshull
Venue: Proceedings of the international conference on APL (1982)

The concept of data flow analysis allows us to think of programs as an entity which consists of many modules which are working together. The need for viewing a problem as a series of sequential steps becomes invalid and we may observe the problem which is to be solved as a series of data transformations. Order of execution is no longer of primary concern. APL lends itself to highly modularized coding techniques. I will demonstrate that APL is the perfect language for use as a data flow model.
Design verification based on functional abstraction
Authors: S. Leinwand, T. Lamdan
Venue: Proceedings of the 16th Design Automation Conference (1979)

The aim of this report is to show the feasibility of automatic hardware verification based on functional abstraction. This is defined as the process of extracting the behavior of a product from its static structural description. A general discussion of possible approaches to design verification points out that functional abstraction is a very important part of any system for automatic hardware verification. Some of the tools developed for proofs of program correctness can be used when dealing with digital designs. In the present paper, the problems specific to hardware verification are singled out and investigated. Several tools specific to design verification, that were developed during the reported research, are briefly reviewed. The appendix begins with results of automatic analysis of basic modules (actual TTL components: flip-flops and an adder). These modules are then used in the realisation of more complex circuits. As an instructive example, three different designs implementing the same specifications are analyzed, and it is shown that the reported system is able to extract their common behavior.
The PDP-11 virtual machine architecture: A case study
Authors: Gerald J. Popek, Charles S. Kline
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

At UCLA, a virtual machine system prototype has been constructed for the Digital Equipment Corporation PDP-11/45. In order to successfully implement that system, a number of hardware changes have been necessary. Some overcome basic inadequacies in the original hardware for this purpose, and others enhance the performance of the virtual machine software. Steps in the development of the modified hardware architecture, as well as relevant aspects of the software structure, are discussed. In addition, a case study of interactions between hardware and software developments is presented, together with conclusions motivated by that experience.
A scan line algorithm for computer display of curved surfaces
Authors: Turner Whitted
Venue: ACM SIGGRAPH Computer Graphics (1978)

The conventional procedure for generating shaded images of curved surfaces is to approximate each surface element by a mosaic of polygons and to then apply one of several established polygon display algorithms. The method described here extends these polygon based techniques to produce an excellent approximation of bi-cubic parametric surfaces in scan line order. Each surface patch is described in terms of cubic edge curves, including parametric curves on the interior of the patch as well as the patch boundaries. Specifying interior edges has the effect of subdividing the patch and generally results in a more accurate image. The silhouette, approximated by a piecewise cubic interpolant, further divides the patch into front facing and rear facing portions. The edge curves are intersected by successive scanning planes to form the endpoints of scan line segments. Depth and surface normal are linearly interpolated between the endpoint values. Visibility is calculated for each segment by a hybrid priority/z-buffer scheme. Shading is computed using Phong's illumination model with the interpolated surface normal. The algorithm is currently used for display of B-spline surfaces as part of an experimental display processor.
Testing functional faults in VLSI
Authors: Yinghua Min, Stephen Y.H. Su
Venue: Proceedings of the 19th Design Automation Conference (1982)

Functional testing has become increasingly important due to the advent of VLSI technology. This paper presents a systematic procedure for generating tests for detecting functional faults in digital systems described by the register transfer language. Procedures for testing register decoding, instruction decoding, data transfer, data storage and data manipulation function faults in microprocessors are described step-by-step. Examples are given to illustrate the procedures.
Automatic Classification of Deformed Handwritten Numeral Characters
Authors: Luan Ling Lee, Natanael Rodrigues Gomes
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper describes a method which utilizes Hopfield neural nets to classify those handwritten numerals presenting deformations and stylistic traces. Information for the classification consists of some image topological features and the image pixel distribution. If the recognition cannot be done by these features due to noises and deformations in numeral image, the classification process is performed by 4 Hopfield neural nets. Using 4 Hopfield neural nets we are able to minimize the problem caused by correlated patterns, and also increase the neural classifiers pattern storage capacity. The proposed method was tested by 121 Brazilian bank checks achieving a performance of 92.4% correct recognition rate.
Quantifying software quality
Authors: Kenneth S. Hendis
Venue: Proceedings of the ACM '81 conference (1981)

In Software Quality Assurance the quality of the program must be defined in practical and measurable terms. This is accomplished by first standardizing the error reporting technique, identifying the types and frequency of occurrence of software errors experienced, and finally, predicting the error arrival rate of the software programs. This paper details a practical approach to quantifying software quality by investigating empirical software error data. Software failure trend analysis and residual error predictions are the by-products of this technique. Successfully applied to software engineering projects, the author reports on the findings and details an implementation plan.
Documentation of simulation models: prospects and problems
Authors: Richard E. Nance, Paul F. Roth
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

The need for standards to improve the management of computerized models used by the Federal Government is expressed in a recent report of the General Accounting Office. The National Bureau of Standards has supported work in exploring the procedures by which management standards can be developed, and has identified as a near-term feasible goal, the development of documentation standards for computer models in general and simulation models in particular. A study of the feasibility of and methodology for simulation model documentation standards concludes that: (1) Model documentation and specification should be accomplished through a top-down analysis, (2) A language for model specification and description is required, and (3) the description of model dymanics remains the major obstacle to simulation model description. The study outlined the methodology for standards development as encompassing two phases - the research phase and a standards creation phase. Critiques of the conclusions in the proposed methodology were based on a wide range of expert opinion briefs in order to obtain a balanced perspective. Responses to questions dealing with the need for standards, the arguments against standards development, and the conclusions and suggestions reached in the study reveal a surprising consensus and some important points of disagreement. This paper is being presented as an abstract so that late-developing considerations in both the Government's approach to modeling standards and research results and feedback may be presented at the Conference. It will also include a discussion of future considerations and policy issues with regard to simulation model documentation and its role within the broader issue of developing standards for the documentation of computer models.
Design through transformation
Authors: J. B. Bendas
Venue: Proceedings of the 20th Design Automation Conference (1983)

The design and verification subsystem (DAV) within IBM's engineering design system (EDS) was developed to significantly increase logic designer productivity. To obtain this gain in productivity, emphasis was placed on creating a system environment which would encourage a structured approach towards design. A key component within DAV is the logic transformation subsystem (LTS). Using LTS, the designer can automatically synthesize and map a higher-level logic description into a design implementation under cost, performance, and technology constraints. This paper describes the various uses of transformation within a structured design context and provides details on the implementation of LTS.
Enhancing computer knowledge in Less Developed Countries (Panel Discussion)
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

This panel focuses on how computer knowledge can be enhanced in Less Developed Countries (LDC). The emphasis is on how a supporting human interface should be developed. A sub-theme will be how the human development can be best coordinated with the use of national computing strategies. The panelists will base their discussion on their experiences in Africa, China, and the Middle-East.
Natural language systems: How are they meeting human needs?
Authors: Kathleen R. McKeown
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

One goal of natural language research is to make systems more accessible to their users by allowing them to interact with machines in a language as close as possible to the language people use among themselves. Developing systems that answer natural language questions is one way to allow users to interact easily with computers. In the following sections, I briefly describe ways in which researchers have been successful in this attempt, limitations inherent in existing natural language systems, and current efforts to bring systems closer to meeting the needs of their users. To illustrate these issues, I focus on natural language database systems as one example of question-answering systems.
Modeling the urban development process and the related transportation impacts
Authors: Tenny N. Lam, Richard Corsi, Katherine Wages
Venue: Proceedings of the 16th conference on Winter simulation (1984)

A conceptually realistic but highly idealized approach was taken to create a simulation model of the structural interactions between the many elements of urban land use and transportation decisions. The objective is to use the model to discover elements and links that are amenable to land use intensification policies. While land use decisions are based on system perspective, transportation decisions are individualized. While land use decisions are permanent, transportation decisions are susceptible to be influenced. Through planning and other governmental policies, it is hoped that &ldquo;infilling&rdquo; can be achieved and the transportation conditions ensued will be energy efficient and environmentally compatible.
Simulation of phonemic errors using artificial intelligence symbol processing techniques
Authors: James A. Reggia, Sanjeev B. Ahuja
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

Using heuristically-guided state space search, a program has been developed to simulate phonemic errors occurring in the speech of both normal individuals and neurologically-impaired patients. Simulations are based on an interchangeable rule/operator set of elementary errors which represent a theory of phonemic processing faults. This work is significant because it introduces and evaluates a novel approach to error simulation, it provides a prototype simulation tool for neurolinguistic research, and it forms the initial phase of a larger research effort involving computer modelling of neurolinguistic processes.
Automatic PLA synthesis from a DDL-P description
Authors: S. Kang, W. M. vanCleemput
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes an automatic PLA synthesis (APLAS) system which automatically generates a PLA for the control function of a design from a DDL-P description of a digital system. APLAS can also minimize and partition the PLA to meet the design constraints. This is a very convenient tool for designing finite state machines. The control circuit of any digital system for which a state diagram can be drawn can be designed easily using this system.
Numerical applications: organization of a large-scale computer program for space-age geodesy
Authors: C. Sheffield, J. P. Morris
Venue: Proceedings of the 1965 20th national conference (1965)

IT IS OFTEN USEFUL to classify particular computer programs as lying within some special category. Labelling a piece of work in advance as a scientific task, a software application, or a problem of pure data manipulation gives some idea of what to expect and is a useful guide when it comes to assigning programmers to the work. When one considers very large applications of computers, any neat pigeon-holing of the task becomes more and more difficult. Large problems of commercial data processing often call for specialized software and few large scientific programs can be written without solving problems of data organization. The program described in this paper is a case in point, where a scientific objective has called for specially designed software and special data-handling procedures. The result, GEO, is a unique synthesis of scientific calculations and program controls, with special devices to ensure efficient use of storage and a satisfactory labelling of program outputs.
Stepwise procedures using both directions
Authors: Leonard Tornheim
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Suppose S is the set of integers (1,2,...,m) and for each h there is a real-valued function fh (il,...,ih) of h arguments from S. The combinatorial problem posed is that of finding for each h that subset Sh of S with h elements which optimizes (maximizes or minimizes) fh from among all subsets of h integers of S. Example 1. Multiple regression. Let y &equil; co + clxl + ... + cmxm be the equation used in a linear regression based on p observations of the variable y on the variables xl,...,xm. Let fh (il,...,ih) &equil; fh (Sh) be the residual sum of squares of the least squares fit for which cj &equil; O if j is not in Sh. We wish to minimize fh for each h. Sometimes co is prescribed to be O. Example 2. Let Ai be m real n-dimensional vectors, i.e., Ai&equil;(ail,...,ain) (i &equil; l,...,m); and let fh (il.,,,.ih) be the volume of the h-dimensibnal parallelepiped with sides Ail .,,,.Aih. For each h we wish to maximize fh. One method of solution is exhaustive - to evaluate the fh for all subsets of S; in all there are 2m1, and for m &equil; 20 this is over a million. However, for Example 1 there is a SHARE program for m @@@@ 10. For large m, an exhaustive procedure is impractical
An application of branch and bound method to automatic printed circuit board routing
Authors: Lawrence Dysart, Mikhail Koifman
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes an approach to PCB routing which applies the Branch and Bound Method to the search for a path between two points. A special multiple pass method of pseudo-parallel routing is applied in order to insure that simple interconnections are made at the earliest stages. The algorithm has been implemented by Computervision Corporation on a 32K word, 16 bit minicomputer based system.
Parallel and serial decompositions of multi-valued sequential machines
Authors: T. C. Yang, A. S. Wojcik
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The decomposition of a multi-valued sequential machine into an interconnection of two submachines with all feedback paths internal to the submachines is discussed. Different models for the interconnection of component machines along with the necessary and sufficient conditions for both serial and parallel decompositions are defined. Unicovered state assignment is also defined. Examples are given to illustrate the decomposition procedures.