ppxscal/embedding_network huggingface dataset:
Analogy considered harmful
Authors: Frank Halasz, Thomas P. Moran
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The computer is like a typewriter. The computer is like a filing cabinet. The computer is a personal servant ready to obey your every command. It is often claimed (e.g., Carroll and Thomas [3], Rumelhart and Norman [7]) that the best way to introduce a new user to a computer system is to draw an analogy between the computer and some situation familiar to the user. Given the analogy, the new user can draw upon his knowledge about the familiar situation in order to reason about the workings of the mysterious new computer system. For example, if the new user wants to understand about how the computer file system works, he need only think about how an office filing cabinet works and then carry over this same way of thinking to the computer file system.
A branch and bound algorithm for optimal pla folding
Authors: J. L. Lewandowski, C. L. Liu
Venue: Proceedings of the 21st Design Automation Conference (1984)

In this paper we present a branch and bound algorithm which exhaustively searches for an optimal column and/or row folding of PLAs. For PLAs with up to 50-60 input/output lines we can obtain an optimal solution in no more than a few minutes.
Training and continuing education plans for computer programmers
Authors: Paul D. Oyer
Venue: Proceedings of the twelfth annual SIGCPR conference (1974)

A plan to enhance the training and education for programmers, programming managers and other EDP-related personnel in the next fiscal year is explained herein. The program will be conducted by the training branch of the Bureau of the Census New features of the program include specialized training for recruits (Sec. IA), a new continuing education program (Sec. IB), and workshops for programming managers(II).
Circular histogram thresholding for color image segmentation
Authors: Din-Chang Tseng, Yao-Fu Li, Cheng-Tan Tung
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A circular histogram thresholding for color image segmentation is proposed. A circular hue histogram is first constructed based on a UCS (I,H,S) color space. The histogram is automatically smoothed by a scale-space filter, then transformed into traditional histogram form, and finally recursively thresholded based on the maximum principle of variance. Three comparisons of performance are reported: (i) the proposed thresholding on the circular histogram with that on a traditional histogram; (ii) the proposed thresholding with clustering; and (iii) thresholding based on a UCS hue attribute with that based on a non-UCS hue attribute. Benefits of the proposed approach are confirmed in experiments.
The MITRE corporation
Authors: Nicolas Johnson
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

One method of solving for the zeroes of a function f(x) &equil; O is obtained by rewriting the equation in the form x &equil; g(x) from which the iteration xi+l &equil; g(xi) can be performed. In this form the process will yield a sequence of iterates xo x1, x2,..., which may or may not converge to the true root &xmarc; depending on the initial approximation xo and on the form of g(x).
RELACS a Relational Associative Computer System
Authors: Ellen J. Oliver, P. Bruce Berra
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

Recent advances in LSI, VLSI and memory technology have led to a reduction in hardware cost and an increase in mass storage capacity such that an associative array memory can be produced and supported. Toward this end, in this paper such an associative array computer called RELational Associative Computer System (RELACS) is proposed.
Toward a robust parametric identification of motion on regions of arbitrary shape by nonlinear optimization
Authors: H. Sanson
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper highlights some problems related to the identification of parametric motion models in image sequences by the so-called differential methods. This often entails the bad behavior of the algorithms used, leading to poor results. Appropriate solutions are proposed. The differential algorithms are particularly effective for complex motion estimation, even of large magnitude.
DIAMOND a digital analyzer and monitoring device
Authors: James H. Hughes
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

This paper describes the design and application of a special purpose computer system. It was developed as an internal tool by a computer manufacturer, and has been used in solving a variety of measurement problems encountered in computer performance evaluation.
Test generation for scan design circuits with tri-state modules and bidirectional terminals
Authors: Takuji Ogihara, Shinichi Murai, Yuzo Takamatsu, Kozo Kinoshita, Hideo Fujiwara
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes a program which generates test patterns for scan design circuits with tri-state modules and bidirectional terminals. The test generation procedure uses a path sensitization technique with 14 signal values. The principal features of this program are test generation with automatic decision of I/O mode of bidirectional terminals, generation of test sets for high impedance state, and generation of test sets for system clock control circuits of shift register latches(SRLs) by using shift-in function of SRLs.
Management graphics: An analysis of individual preference
Authors: Darryl L. Craig
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

It appears that computer generated graphics improve the potential for quality decision making under certain conditions for particular types of individuals. Industry publications suggest that graphic applications have been successfully used in the scientific community for years, but that business users are only beginning to realize the potential of computer generated graphics. Limited information related to the effective use of management graphics in the decision making process has been made available. The purpose of this paper is to review research related to graphics for decision making including pattern recognition and learning research. In addition, research pertaining to individual differences and their relationship to the effects of graphic presentation is reveiwed. Finally the results of a study of over 200 business school students that investigated the relationship between individual differences and user preferences for forms of management graphic presentation, is described and discussed.
A qualitative reasoning approach to mathematical and heuristic knowledge integration
Authors: Stephen E. Cross
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

Human problems solvers use heuristic knowledge. Heuristics can be justified in a given problem solving context by reasoning about 'deeper' domain theories. A working computer program, an air traffic control expert system, uses a qualitative reasoning approach to justify heuristically generated plans. The justification is based on mathematical knowledge of aircraft performance which is computationally too complex for use in the normal planning process.
Concepts of computer-based modeling for consultation in optics and refraction
Authors: C. A. Kulikowski, A. Safir
Venue: Proceedings of the 1976 annual conference (1976)

In this paper we discuss general principles of computer science applied to problems of medical consultation. We describe some of the design considerations for a computer-based consultation program in optics and refraction. Since the visual system is the input pathway for most of the data entering the central nervous system, the process of refraction serves important purposes beyond the generation of a prescription for a pair of eyeglasses. Refraction, the measurement and correction of optical deviations of the eye from the desired norm, evaluates what is often the weakest link in the chain of events constituting the visual process. Our purpose is to present the diversity of clinical objectives and constraints that affect the design of such a clinical consultation system, and to describe how different types of models are needed for different aspects of the consultation.
A methodology for verifying programs
Authors: F. W von Henke, D. C. Luckham
Venue: Proceedings of the international conference on Reliable software (1975)

The paper investigates methods for applying an online interactive verification system designed to prove properties of PASCAL programs. The methodology provides techniques for developing a debugged and verified version starting from an incomplete program.
The technology of word processing
Authors: Gene T. Sherron
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The word processing industry offers over 160 model lines which are provided and marketed by 60 vendors. That gives you a lot of things to choose. To make matters even worse, one of the leaders in this industry announces a new feature, either hardware or software, every 3 days! It is a jungle out there. So, how can you keep up? The answer varies because it depends on the person and range of interests. If you are involved in this business as a full-time responsibility, then it is possible to keep up. But, it will probably take 6 to 9 months to reach the basic level of understanding. For the rest of us who can only afford a modest amount of time to learn the basics and then maybe a few hours a week to keep up, it is an impossible task and leads to much frustration. This paper is intended to reduce the frustration level a bit and put you on the trail of learning more about word processing.
ASHMEDAI and a large algebraic problem
Authors: M. J. Levine, R. Roskies
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

We give an overview of ASHMEDAI, an algebraic manipulation language developed by M. J. Levine. Many of its features are determined by the large physics problems we want to solve. These demand both rapid execution times and efficient storage management. We achieve rapid execution by not investing symbols with their full algebraic significance. For example, this eliminates the need for built-in rational function capabilities or for a very general integration routine, but does require more user intervention. We overcome the storage problem by using internal data structures and a processing scheme which allow intermediate expressions to be virtual and which allow the use of auxiliary storage devices without sacrificing execution efficiency. We point out how parallel processing might speed up execution even more and suggest other ways for improving the system. We also emphasize the importance of verification procedures, and detail some of ours.
Structural concrete and some numerical solutions
Authors: Muharrem Sargin, V. K. Handa
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Until recently, design and analysis of most concrete structures have been based on elastic or working stress theory. 1In this method, concrete and steel stresses under working load are limited to some fraction of their corresponding strengths and it is implied that the structure has the same factor of safety against failure. However, it is well known that concrete and steel are not elastic up to failure and there is no direct relationship between strength and deformation characteristics of the structure at working load and at ultimate. This has led to the development of today's ultimate strength theories where the non-linearity is acknowledged in section design,1but structural analysis still has to be carried out by elastic methods like moment distribution, slope deflection or computer systems such as &ldquo;STRESS&rdquo; or &ldquo;STRUDL&rdquo;, etc. Most recently a number of limit design or analysis methods have been proposed.2'3'4They fulfil the expectation of a continuity of thought in the concept of inelasticity from the sectional to the structural level. Yet their development is hampered by the lack of complete or realistic deformation models. Although all methods are based on the three principles of structural mechanics, i.e., equilibrium, compatibility and force-deformation relationship, their realism, complexity and calculation procedures are governed mainly by the deformation model chosen.
Simulation language features in 1976: Existing and needed
Authors: Louis W. Miller, Howard L. Morgan
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

It is now 1976, more than 20 years since computer simulation was first recognized as an area which had a need for special purpose computer languages and languages features. Many of the signs of maturity are present in the field: Two annual simulation conferences, courses in most major universities, and a number of standard textbooks and bibliographies[l,6,4]. In addition, there have been several surveys of simulation languages, e.g., [7] and we have no wish to repeat such a survey here. Rather, we attempt to describe a set of features that one should be able to &ldquo;expect&rdquo; any simulation language to have, and to discuss a set of features which are still needed - especially in the growing worlds of interactive computing and computer graphics and data bases.
Product assurance program analyzer (P.A.P.A.) a tool for program complexity evaluation
Authors: Karl Ernst Schnurer
Venue: ACM SIGMETRICS Performance Evaluation Review (1982)

This tool has been developed to assist in the software validation process. P.A.P.A. will measure the complexity of programs and detect several program anomalies. The resulting list of analyzed programs is sorted in order of descending complexity. Since high complexity and error-proneness are strongly related, the &ldquo;critical&rdquo; programs will be found earlier within the development cycle. P.A.P.A. provides syntax analyzers for RPG (II/III), PSEUDOCODE (design and documentation language) and PL/SIII (without macro language). It may be applied during the design-, coding- and testphase of software development (e.g. for design- and code inspections).
Computer programming and coding at the high school level
Authors: Aaron L. Buchman
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

This paper concerns a course in computer programming and coding being offered at the Hutchinson Central Technical High School, Buffalo, New York. The course, which runs one term and is open to seniors studying their fourth year of mathematics, was completed by the first group of pupils, and is now being given to the second group, most of whom intend to major in a branch of engineering at college. About two years ago, the author broached the idea that the field of machine computation contained much material that could prove a challenge to high school seniors with a good mathematical background, and that such a course could interest pupils in a field that showed much promise of absorbing a large number of competent mathematicians. In order to make such a course concrete and provide motivation, he proposed that his pupils build an automatic digital computer. To be an effective teaching device, it was desirable that such a machine contain (1) an input unit able to read from a tape, (2) a control unit which could interpret the taped orders, especially those relating to branching routines, (3) a storage unit capable of storing several numbers, and (4) an arithmetic unit which could do rapid addition, subtraction, multiplication, and perhaps division. The Buffalo Board of Education made one thousand dollars available, and under the guidance of the author and using the plans and circuits he drew up, the pupils in his advanced mathematics classes built a machine having the above specifications. The construction and wiring of the automatic computer, an electromagnetic relay machine, took about six months, and was a fine experience for the pupils involved.
Artificial intelligence in automated design
Authors: D. Jirauch
Venue: Proceedings of the SHARE design automation project (1966)

New techniques are constantly being developed in the field of Artificial Intelligence. Too often such techniques are overlooked as being &ldquo;too far out&rdquo; to be practical. Frequently they offer a solution to a problem that might be difficult to solve by more traditional methods. Some of the techniques used in the field of artificial intelligence can be successfully applied to the field of Design Automation. Those interested in developing techniques for automating design should be aware of this potential and be on the lookout for such applications.
Needs, interests, and reinforcer preferences of data processing personnel
Authors: Theodore C. Willoughby
Venue: Proceedings of the eighth annual SIGCPR conference (1970)

It is a privilege to be with this group which has done some outstanding research work. Any reader of the proceedings of this conference has seen 75 percent of the decent reported research on computer personnel. Thus I consider it an honor to be asked to describe my thesis to this gathering. A portion of the research I am about to describe was reported earlier1 and is available through the MISRC at the University of Minnesota. Therefore, I will describe today only those details of that report necessary to provide a setting for reporting further results. The Theory of Work Adjustment2 was the base upon which this research effort was designed.
Knowledge-based adaptive curriculum sequencing for CAI: Application of a network representation
Authors: Keith T. Wescourt, Marian Beard, Laura Gould
Venue: Proceedings of the 1977 annual conference (1977)

One aspect of tutoring skill for technical subjects is individualized, adaptive sequencing of the problems given to students as learning exercises. A Curriculum Information Network (CIN) describes the relationships between the problems in a CAI curriculum and the concepts and skills that they are intended to teach. It is a basis for selecting problems for each student with respect to his evolving knowledge of those concepts and skills. This paper describes the application of a semantic network to represent the complex interrelationships among the skills in a CIN for the BASIC Instructional Program, a CAI problem-solving laboratory for introductory programming in the BASIC language. The semantic network is used in drawing complex inferences about the student's state of knowledge and the problems that are appropriate to present to him. Such inferences enable more skillful problem sequencing by the CAI system.
Local network selection criteria
Authors: Kenneth J. Thurber, Harvey A. Freeman, Noel E. Schmidt
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

With over 200 manufacturers of local networks or local network products currently identified, a potential local network purchaser certainly has a wide selection of vendors from which to choose. Various topologies, control structures, media, access control techniques, and other local network items may be appropriate for the environment in which one's local network will be installed. Many local networks allow equipment of differing design or manufacturer to communicate; support the phased introduction of other system elements; allow for ease of reconfiguration; reduce duplication of resources; provide for smoother growth; and offer a more accurate alignment of the individual elements' usage patterns. To correctly choose the local network or networks that will most completely offer these types of benefits, careful evaluation of the various offerings must be made. This article identifies the most important factors to consider when selecting a local network The selection criteria are listed in alphabetical order, because their individual ranking or importance is a function of the particular application requirements of the purchasing organization. The first steps in the selection process are to identify current and future applications that will use the network; correlate the applications, organized by rank or weighting factor, against the selection criteria; and then develop a set of appropriately weighted selection criteria to use In the evaluation of candidate local networks.
&ldquo;Simple&rdquo; approximations
Authors: Benjamin L. Schwartz
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

For the purpose of this paper, we shall define a &ldquo;simple&rdquo; approximation to the real number X, X > O, as a number of the form (1) (equation) where A, B, C, and D are positive integers less than some preassigned upper limit M, and such that (2) (equation) for some preassigned t > O. We shall generally be concerned with the set of all approximations of this form; this set we shall call the simple approximation set (SAS). We shall call M the simplicity modulus of the SAS, and t the approximation modulus. For any simplicity modulus M, there are M4 possible fractions of form (1), which must be tested against condition (2) to determine whether they are in the SAS. In practice, this number can be greatly reduced. Symmetry and nonuniqueness of factorization enable more than three-quarters of them to be discarded. A further reduction often follows from another argument: For any A, B, and D, the best estimate of C is [equation].
A topology for semicustom array-structured LSI devices, and their automatic customisation
Authors: P. Jennings
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes the design of a topology for array-structured (both Gate-Array and Polycell) semicustom LSI, in the context of a CMOS gate-array fabricated to test both the topology and the unique functional cells. Design emphasis has been placed on 100% routability, which is achieved by use of interdigitating cell terminals. Also described is the structure and operation of an automatic customisation software package which has been developed for the array, and which utilises the topological advantages to achieve track densities which are comparable with state-of-the-art algorithms. Examples are cited which show that this methodology is economical in both its speed of operation and its silicon-area utilisation.
A modest proposal for vector extensions to ALGOL
Authors: Mary E. Zosel
Venue: ACM SIGPLAN Notices (1975)

Machines that possess instructions that are actually &ldquo;higher level&rdquo; than high-level language statements require extensions to traditional programming language. This paper explores the kinds of extensions necessary for adequate access to the CDC STAR instruction set. Specific problem areas considered are: access to the vector instructions, definition of descriptors, support of the variety of hardware data-types, and facilities for memory and register management. It is fairly straightforward to define language facilities to cover most of these problems with minimum disruption of existing language features. Informal descriptions are given for syntactic and semantic extensions to ALA, an ALGOL based language. Features include declaration and usage of vector and descriptor variables, generation of vector values, subscripting slicing, and procedure linkage. The language constructs described are not limited in application to either the STAR or ALA. They should be easily adaptable to other languages and machines where vector constructs would enhance programming power.