ppxscal/embedding_network huggingface dataset:
The impact of mesa on system design
Authors: Hugh C. Lauer, Edwin H. Satterthwaite
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The Mesa programming language supports program modularity in ways that permit subsystems to be developed separately but to be bound together with complete type safety. Separate and explicit interface definitions provide an effective means of communication, both between programs and between programmers. A configuration language describes the organization of a system and controls the scopes of interfaces. These facilities have had a profound impact on the way we design systems and organize development projects. This paper reports our recent experience with Mesa, particularly its use in the development of an operating system. It illustrates techniques for designing interfaces, for using the interface language as a specification language, and for organizing a system to achieve the practical benefits of program modularity without sacrificing strict type-checking.
Complex preprocessing for pattern recognition
Authors: Albert L. Zobrist
Venue: Proceedings of the 1971 26th annual conference (1971)

The construction of pattern recognition machines may eventually depend upon the development of highly complex preprocessors. This claim is supported by a discussion of the importance of perceptual grouping. Since complex preprocessing will assess more of the basic structure of a visual scene, internal representations will have to be more descriptive in nature. Two approches to descriptive internal representation are mentioned. Two of the author's programs are reviewed. One plays the Oriental game of GO at a human level and the other can recognize digitized hand printed characters. Both programs use a geometry preserving representation of features, so that calculations involving the features can assess the original geometry of the input. In addition, the GO program calculates groups of stones and performs other types of &ldquo;complex&rdquo;processing. Practical and philosophical arguments are given for the use of internal representation by pattern recognition programs.
&ldquo;Principles and techniques for training programmers&rdquo;
Authors: Leonard C. Silvern
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Computing machine technology is a product of business and industrial need. The satisfaction of this need, which was identified a decade ago, was contingent primarily upon the state and progress of the electronics art. It is well known that a time lag usually exists between the identification of a need and its actual implementation. It will be seen that even in the unusually dynamic and forward-looking field of programmer training, this is true. Since its origin in the early 1900's, all business and industrial training growth has been described by 1) satisfaction of a real rather than fictitious management requirement, and 2) a time lag between the conception of the problem and its organized solution through training. There is a high correlation between the evolution of programmer training and the evolution of other kinds of technical training in this country. However, due to the rapidity with which inventions are being introduced and the shortened time between discovery and application, training is becoming more quickly identified as a problem and a solution. But this may be credited really to the general acceleration of technology rather than to management astuteness.
Automatic programming and compilers I: Control techniques in the CL&mdash;II Programming System
Authors: G. F. Leonard
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE CL-II PROGRAMMING SYSTEM has been designed to provide a multi-program control system within the framework of a set of primitive control routines and an extensible Master File containing programs, data, program descriptions, and data descriptions. An initial version of the system has been realized on an IBM-7090 computer having two channels with five tapes per channel, a card reader and printer, and a one-sixtieth of a second interval clock timer. In the Master File of the initial system are the programs required to add new programs to the system. These programs include: A compiler for the algebraic languages JOVIAL and L&ordm; (of the CL-I Programming System); sophisticated data description, data input, and output programs; a collection of servicing subroutines for table of content searching, file maintenance, tape assigning and releasing, operator communication, string handling, etc., and, a rather minimal monitor for job sequencing.
On the application of user chains in GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The GPSS Processor uses a Current Events Chain, Future Events Chain, Interrupt Chains, and Matching Chains to support the logic of a GPSS simulation. These chains, which are an implicit part of the language, are automatically maintained and manipulated by the Processor as a simulation proceeds. At the analyst's option, one or more additional chains of a type known as User Chains can be explicitly incorporated into a GPSS model. These user-defined chains can be introduced for either one of two quite distinct reasons: (1) to decrease the execution time requirements of a given model, and (2) to implement queue disciplines other than first-come, first-served, within Priority Class. Despite their application scope, however, there are several subtleties associated with User Chain use. These subtleties arise principally because the GPSS Processor is inherently sequential in nature. This paper, presented in the spirit of a tutorial, explores User Chain applications and identifies some of the subtleties associated with their use.
A Computer Oriented Mechanical Design System
Authors: L. F. Knappe
Venue: Proceedings of the SHARE design automation project (1965)

The COMMEND (Computer-Aided Mechanical Engineering Design) System is being developed in the Advanced Technology Department at the IBM Development Laboratory in Rochester, Minnesota. This design system is intended for internal use and is not available to other persons or companies at this time. The COMMEND System is a problem-oriened system as opposed to systems for &ldquo;customized&rdquo; design or product-oriented design. It works equally well whether one is designing a card punch, a printer, a document transport, or any such machine. The primary objective of COMMEND is to enable our mechanical design engineers to augment their capabilities with high speed computation and the large memory capacities of the present day digital computers. This union of engineers and computer into an effective design team is not a natural one. Both the engineer and the conventional mode of computer operation has to change. The engineer must take a more analytical design approach instead of the graphical and experimental approaches he presently uses on some design problems. The mode of computer operation must be such that the engineer can have rapid access to the computer when the need arises. Long &ldquo;turn around&rdquo; time from the submission of a design problem to the receipt of results nullifies the advantage of high speed computation and may extend design time rather than shorten it.
Automatic formation of a &ldquo;machine theory&rdquo; representing a mapping
Authors: Saul Amarel
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

This paper presents certain aspects of our current investigation on the realization of &ldquo;concept formation&rdquo; in an information processing machine M. We assume that a &ldquo;concept&rdquo; is explicitly defined by a class Di whose membership consists of pairs of expressions in the form (I:O) that are instances of a mapping Si; we have Si (I) &equil; O for all (I:O) in Di. We further assume that a limited sample from Di is admitted in M and provides the basis for the construction of a machine I representation of the &ldquo;concept&rdquo; we consider such machine representation as embodying the machine meaning of the &ldquo;concept&rdquo;, or alternatively as a machine theory of the mapping Si. Our objective is to study systems for the automatic formation in M of a machine theory of Si that has the form of a &ldquo;simple&rdquo; procedure hDi, such that hdi (I) &equil; O for all the members I:O of Di. A procedure hDi can be realized in M either in the form of a computer program or as a switching network; in each case it expresses the mapping Si in terms of a language available to M at the time of theory formation.
Perceptual color spaces for computer graphics
Authors: Gary W. Meyer, Donald P. Greenberg
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

Perceptually uniform color spaces can be a useful tool for solving computer graphics color selection problems. However, before they can be used effectively some basic principles of tristimulus colorimetry must be understood and the color reproduction device on which they are to be used must be properly adjusted. The Munsell Book of Color and the Optical Society of America (OSA) Uniform Color Scale are two uniform color spaces which provide a useful way of organizing the colors of a digitally controlled color television monitor. The perceptual uniformity of these color spaces can be used to select color scales to encode the variations of parameters such as temperature or stress.
A simulation of a constrained securities market
Authors: Paul J. Swanson,  Jr., Robert J. Graham
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

This paper presents a simulated environment of (1) a pure securities market and (2) a market containing a specialist constrained by selected trading rules of the New York Stock Exchange. The purpose of this paper is to consider the price stability attributes of order service, price variance and market efficiency (as defined) in these two short-run (stable) stochastic environments. After defining the simulation models, the paper examines the influence of the specialist in reducing order service time and the effect of these activities on the specialist's profit and liquidity positions. Market efficiency and price variance are examined by comparing the basic statistical characteristics of the resulting &ldquo;time&rdquo; series of prices produced by the two models in both the time and frequency domain. It is concluded that the specialist dramatically reduces order service time and price variance but that these are achieved only with some loss in market efficiency. It is also suggested that market efficiency is preserved by the existence of both the specialist andinstitutional constraints on his activities.
Development of an APL standard
Authors: A. D. Falkoff, D. L. Orth
Venue: Proceedings of the international conference on APL: part 1 (1979)

Following an extended period of development, with more than half a dozen iterations, a standard for APL was not long ago adopted for use within IBM. In this paper we offer some highlights of our experience in this development process, as well as an appendix containing the technical matter in the standard itself. If a standards effort should get under way in the wider APL community, this experience and its work product may perhaps be found useful, and it is offered here in recognition of this possibility, without any commitment on the part of the IBM Company to support or not support such an effort. It should also be understood that this material is not offered as a specification of the function or performance of any particular IBM product. Standards in a field as rapidly changing as computers are not static. This is particularly true with respect to a language like APL, which is still actively evolving. Hence, the document in the Appendix can only be regarded as a snapshot of where we are now. It does not by itself convey any idea of the development process that produced it, just as it does not necessarily represent in any specific detail what it might be in the future. In this paper, then, we will try to show something of the dynamics of the process we participated in by discussing the evolution of several significant aspects of the standard, and sketching the outlines of some of the broader issues that affected the result. The paper has three sections. The first deals broadly with the question of what the standard should include; the second is concerned with the structure and tools of description; and the third traces the development of three technical issues.
User need satisfaction as a basis for evaluating cargo aircraft scheduling
Authors: James R. Coakley, Gerald R. Armstrong, Joseph C. Bryant, Stephen R. Gordon
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The primary emphasis of this study was to develop a measure of effectiveness for cargo airlift scheduling, based on satisfying the needs of the end user of the supplies. A detailed cargo airlift resupply network using Simulation Language for Alternative Modeling is developed and used to analyze the effects of applying different scheduling heuristics and alternative importance multiplier policies during the scheduling process. A modified worth assessment technique was used to estimate the relative worth of each supply category to the end user. These values are incorporated with the supply category levels attained to prioritize the user requirements. Airlift missions are scheduled to satisfy the highest priority requirements first. An airlift score is developed to reflect the effectiveness of the supply effort.
A NELIAC generated 7090-1401 compiler
Authors: J. B. Watt, W. H. Wattenburg
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

NELIAC systems for several different machines have been generated using the original NELIAC system developed at the Naval Electronics Laboratory, San Diego, in 1958. A basic &ldquo;bootstrap&rdquo; process was used to generate all but the first, i.e., the systems were described in the NELIAC language and generated by an existing NELIAC compiler. This experience proved there was no inherent difficulty in &ldquo;building compilers with compilers;&rdquo; indeed, it pointed out many advantages in using a POL for constructing programming systems. This report presents the results of a project completed in April, 1961, in which the NELIAC system was used to generate a compiler for the IBM 1401. The 1401 compiler, which runs on the 7090 and produces 1401 programs, was described in the NELIAC language and generated with the 7090 NELIAC system. The reduction in programming time and the improvement in documentation of the system were very significant.
An APL simulation of feedback systems
Authors: Wilbur R. LePage, Richard McFee
Venue: ACM SIGAPL APL Quote Quad (1982)

Practical feedback systems involve interacting linear and nonlinear components. Modern techniques of design are based on representing a feedback system by a set of first order nonlinear differential equations and using a digital computer to obtain experimental solutions. In this paper, APL notation is used in a concise development of the mathematical basis of a computing algorithm, and in the realization of an actual system which is effective from the standpoints of ease of use, complexity of feedback systems that can be modeled, and computing efficiency. Ease of use is important because a feedback systems engineer is not necessarily skilled in computing and, when using a computer simulation, should be permitted to think in terms of the customary concepts of feedback systems.
Invariants for specifications
Authors: J. Kramer, R. J. Cunningham
Venue: Proceedings of the 4th international conference on Software engineering (1979)

An approach to the specification of abstract data structures (or modules) is presented. Specifications are given in a state machine form. This approach emphasizes the usefulness of invariants which restrict the operations which act on the structures. Invariants are useful both for informally capturing the required behaviour of the structure, and in the development of formal specifications, Examples are used to illustrate how the invariants help in the refinement process to provide the abstract functions which describe the abstract states of the structures, Also, a nontrivial example illustrates the use of invariants to describe the consequential effects of more complex operations.
Software management through improved programming technology
Authors: F. T. Baker
Venue: Proceedings of the 1975 annual conference (1975)

Coming as I do from a large organization which competes for programming contracts and then performs them on a for-profit basis, the need to improve our management skills is especially apparent. In general, as we in the programming business discover how to manage contracts of a given size and complexity, the state of the art allows us to tackle even bigger and more difficult ones. And while some of our problems are those common to any sort of large project management, at least three key ones are peculiar to the programming project because of the way programming has been allowed (and even encouraged) to be done. First, we permit programs to be treated as private property by programmers. While the concept of independent development and ownership of a program by a programmer may have been valid twenty years ago, it has little value in multiple-program system with large numbers of interfaces. A program or program system is a group product and should be produced in a way which allows and encourages maximum knowledge of it by each person involved. Furthermore, the management responsible for its development should be able to determine its status directly and not depend on the programmer's description of his progress on an &ldquo;invisible product&rdquo;.
Recognition of two-dimensional patterns
Authors: Patrick Shen-Pei Wang
Venue: Proceedings of the 1977 annual conference (1977)

A class of machines capable of recognizing 2-dimensional sequential/parallel matrix languages is introduced. It is called &ldquo;finite-turn repetitive checking automata&rdquo; (FTRCA). This checking automaton is provided with three read-write heads, one read only head and a control register in its memory to keep track of the internal transition states and the stack symbols. The value of the register ranges from 0 to a finite positive integer k and can repetitively appear as many times as necessary. A one-to-one correspondence is established between the class of FTRCA and (R:R)ML - the smallest class of the sequential/parallel matrix languages.
Warming up to computers: A study of cognitive and affective interaction over time
Authors: David M. Gilfoil
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This experiment studies how people learn to use computers. Four computer-naive persons performed six computer tasks at each of 20 task sessions over a one month period. Participants were allowed to choose a menu-driven or command-driven dialogue at any point during the study. Cognitive, affective, and performance variables were closely monitored. Results generally support the appropriateness of a menu-driven dialogue for novice users and the transition to a command-driven dialogue after approximately 16 - 20 hours of task experience. With experience, users were shown to a) choose b) perform better, and c) be more satisfied with a command driven dialogue. Results are explained within the context of a &ldquo;cognitive schema&rdquo; theory.
PLAN2D - syntactic analysis of precedence graph grammars
Authors: Reinhold Franck
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

The syntactical analysis of pictures derived by a context-free graph-grammar is a rather complicated algorithm. Analogously to the development for Chomsky-grammars ten years ago we define the precedence-graph-grammars as a subclass of the context-free graph-grammars allowing for easier parsing algorithms. By table-lookup we can decide locally if an edge or a node is part of a handle and if it isn't in which direction to proceed to reach one.
Toward user sharing of the microprogramming level under UNIX on the Perkin-Elmer 3220
Authors: J. Eric Roskos, Robert I. Winner
Venue: ACM SIGMICRO Newsletter (1981)

A master/slave model of writable control store is presented which is claimed to be a better representation of the operating system view of control store than models which more accurately portray the physical reality. Reported work includes the completed development of UNIX tools: an assembler generating relocatable, linkable microcode; a linking, relocating loader; a fast absolute loader; an interactive hard debugging aid allowing the setting of breakpoints; and alterations of the UNIX kernel allowing the driving of WCS as a &ldquo;slave processor&rdquo; consistent with the model. Code for the system driver and microcode portions of the debugger are included in the paper. The design goals of the multi-user sharing of control store, representing work now in progress, are listed. These include the use of the UNIX text segment management as the basis for association of control store routines with processes and the use of the debugging aid snapshot routines in the swapper.
Introduction to simulation
Authors: J. W. Schmidt
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper offers an introduction to the fundamental concepts of system modeling with emphasis on the application of digital simulation. The topics presented include system modeling, model classification, a discussion of mathematical and simulation models, their distinction and relative advantages, an overview of systems analysis, an example simulation model, and brief discussions of random numbers, random variable generation and simulation languages. The material presented is largely conceptual and requires no prior background in modeling.
An algebra for logic strength simulation
Authors: P. L. Flake, P. R. Moorby, G. Musgrave
Venue: Proceedings of the 20th Design Automation Conference (1983)

To simulate tri-state logic in a non-pessimistic way, a six valued algebra is shown to be necessary. This is then extended to quin-state logic (strong 0, strong 1, weak 0, weak 1, high impedance) and a fifteen valued algebra. The improved accuracy is as important for fault simulation as for design verification. The requirements for non-pessimistic test generation algebras for tri-state and quin-state logic are also discussed. Pessimism in test generation increases the search space and hence the run time.
A New Database of Confusing Characters for Testing Character Recognition Algorithms
Authors: V. Di Lecce, A. Guerriero, G. Dimauro, S. Impedovo, G. Pirlo, A. Salzo
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper a new technique and software tool for the generation of systematically organized confusing characters is presented; by means of this tool it is possible to transfer human knowledge on character recognition into an open database in a systematic way. This base is useful to test automatic character recognizers by comparing their performance to human unchallenged ability in recognizing hand-written characters.This base can be used also to accomplish experiments in the field of confusing character recognition, where the comparison with human knowledge is necessary. In fact it has been underlined the need to increase knowledge on human learning and classification mechanisms, in order to design new and more efficient classification algorithms consistent with human recognition processes, also by studying the properties of confusing characters.