ppxscal/embedding_network huggingface dataset:
Panel session: Improving the teaching of simulation
Authors: Lewis Corner, A Alan B Pritsker, Thomas Schriber
Venue: Proceedings of the 12th conference on Winter simulation (1980)

The diversity of application areas represented at a typical simulation conference attests to the increased usage of computer simulation, however, increased usage may lead to a decrease in the overall &ldquo;quality&rdquo; of simulations. In an effort to improve simulation quality, research continues in methodology areas such as documentation, validity, and statistical techniques. Another constant concern is the manner in which computer simulation is being taught by educational institutions and private companies. The development of sophisticated simulation languages has made simulation a practical decision making tool, but often the apparent simplicity of a language leads to deficiencies in the teaching of basic methodology. All practitioners of simulation should feel a responsibility to work toward improving the quality of teaching in the field.
A regular expression pattern matching processor for APL
Authors: Mark R. Dempsey, Leslie H. Goldsmith
Venue: Proceedings of the international conference on APL (1981)

Regular expressions are a powerful notation for expressing text patterns. This paper discusses classical regular expressions and their extension into the domain of APL. These extensions are manifest in terms of locator templates, which describe patterns to be searched for, and action templates, which specify an action to be performed when a match is encountered. An algorithm for implementing these concepts is briefly discussed. The algorithm compiles a template into code which is then interpreted in the context of a specific text vector to be searched. Numerous examples are espoused to demonstrate the utility of pattern matching over a wide range of problems.
ACM conference paper the MUSP statistical system
Authors: R. A. Hoodes, P. Wegner, W. Wiitanen
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

This paper describes the Littauer Multivariate Statistical Package (MUSP). MUSP consists of a package of statistical subroutines for performing correlation, regression, discriminant analysis and factor analysis. Non-symmetric eigenvalue analysis, tetrachoric correlation, partial correlation, canonical correlation, and missing observation analysis may also be performed. The major statistical subroutines are listed below for purposes of reference and indeed form the principle substantive contribution of this paper. However, there are also a number of novel features in the MUSP control language. This paper will attempt to show how the MUSP subroutines are embedded in the control system.
Printed circuit artwork checker
Authors: J. D. Baum
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

Today, on the threshold of an era of automatic placement and routing, a good many printed circuit boards are still manually designed. For these boards the process of checking the connectivity of the printed circuit artwork and the component layout against the engineering schematic is a time consuming and arduous task. In addition, the tedious repetition of this checking job makes it highly error prone. Thus, this task would seem to be an ideal prospect for automation. At Hughes Aircraft Company a computer program has been implemented to aid in checking printed circuit artwork. The first task encountered was to devise a method of reducing the artwork and the schematic to coded numerical data specifying their respective connective properties. Next it was necessary to implement an algorithm for comparing the two sets of data. It was also thought important to give consideration to user features and the nature of the man-machine interface.
Heuristic switching expression simplification
Authors: Melvin A. Breuer
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

One very profitable application of computer aided design is in the design and construction of digitial computers. 1 A classical problem in computer design is that associated with the simplification of Boolean switching expressions. Numerous algorithms exist for solving this problem, such as the Karnaugh or Veitch graph method, the Quine&mdash;McCluskey technique, the cubical complex approach of Roth,2 or the recently published procedure of Svoboda.3 In general, the classical minimization procedure consists first of generating all the canonical terms of a function, secondly of generating all of the prime implicants, and finally of selecting a minimal cover which consists of some subset of the set of prime implicants. For some techniques, these first two steps can be partially eliminated as illustrated by repeatedly applying the #-algorithm of Roth. The resulting solution usually represents a minimal diode or minimal gate two-level AND-OR or NAND representation of the given function. Many switching expressions encountered in the design of digital systems contain 20 or more variables. Usually they are obtained in one of two ways, i.e., either automatically by a logic generating system such as described by Gorman and Anderson, 4 or manually by a logic designer. In either case the equations are very seldom expressed in canonical form, but rather are usually in some near minimal normal form. Hence, it has generally been found to be impractical to spend hours of computation time to reduce a near minimal expression in order to save a few diodes or gates.
An analysis of a mesa instruction set using dynamic instruction frequencies
Authors: Gene McDaniel
Venue: ACM SIGARCH Computer Architecture News (1982)

The Mesa architecture is implemented on a variety of processors, and dynamic instruction frequency data for two programs is used to analyze the architecture in an implementation independent fashion. The Mesa compiler allocates variables in an order based upon their static frequency of use, and measurements are provided that show that these static predictions predict run time usage as well. We provide an evaluation of the advantages and costs of Mesa's compact byte encoding, its reliance upon an evaluation stack, and its use of memory. The Mesa language has evolved over time in a hardware environment oriented around 16-bit quantities with growing use of and accommodations to 32-bit quantities. The cost of emulating 32-bit data paths on a 16-bit machine is identified for a program that heavily exploits longer values. Several potential areas for improving the execution speed of a Mesa processor with special purpose hardware are identified.
Problem formulation for programmers
Authors: Edith W. Martin, Albert N. Badre
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

The various attempts to augment man's information processing capabilities with the use of machines became significantly more realistic with the advent of the modern electronic and adaptive-logic computers4. With the introduction of advanced computing capabilities, a host of new and serious challenges emerged. One of the main challenges is that of transforming an ill-stated problem to one acceptable by the computer. Once a problem is well-stated, communication becomes relatively simple3. The burden is on the programmer to be the interface between the world of ill-stated problems and the computers. The programmer has to select a methodology by which he can take an ill-stated problem and restate it in such a way that it can be developed into a set of procedures and expressed in a language that is acceptable and understood by the machine. In order to more fully utilize computers for problem solving it is necessary that we understand more completely how we formulate a problem solution. Probes into the problem formulation question have been of two types, symptomatic and methodilogical. The symptomatic approach focuses on the program structuring capabilities provided by programming languages. It is believed that programming languages having certain program structuring features permit a more comprehensible organization of the problem solution and relate positively to successful programming. The second approach, which is being proposed here, is to examine problem solving methodologies used in computer programming. Our specific objectives are (1) to examine the possibility that a recognizable set of problem solving strategies maybe observed in a programming task, (2) given such strategies, the relationship these have to success levels in programming performance. In other words, how does programming performance vary as a function of the structuring of the problem by the programmer.
Innovative techniques for college faculty using the computer in undergraduate curricula
Authors: Anne Kellerman, Geraldine Macdonald
Venue: Proceedings of the ACM annual conference (1973)

The inspiration for the development of computer applications in service to man has many origins. Computer-related curricula materials successfully integrated into a wide variety of undergraduate classroom situations provide one major vortex for this inspiration for both faculty and students. The vital initial steps are the appropriate education of the faculty by &ldquo;Computer Instructional Applications Professionals&rdquo; in preparation for their subsequent creation of computer-related materials and then assistance by these people in the actual creation of these materials. This paper describes efforts in: defining and carrying out appropriate education, computer curricula development and evaluation, project assistance, and extensive statistical evaluation of the results of all steps. Sending participants in faculty workshops away with a well-defined concrete project, well on to completion, results in success for on-going later development. Not every college professor becomes an expert programmer, but all can become expert in using the resources provided.
Changing expectations of our users
Authors: Rita Seplowitz Saltz
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

With a changing user audience, how will expectations change? &bull; Users will know what computers can do and will indeed expect service, not just &ldquo;hope&rdquo; for service. &bull; Users will expect all services 24 hours each day, seven days a week. &bull; Users will expect us to come to them, any time of day or night. &bull; Users will expect personalized, prescriptive service, tailored to their individual needs. &bull; Users will expect infinite variety. &bull; Users will expect access to services anywhere, from anywhere. &bull; Users will expect near-total transparency. &bull; Users will expect user control of all aspects of service&mdash;or, at the very least, the illusion of user control. &bull; Users will expect service to be provided in modular, interchangeable units. &bull; Users will expect reduced costs. &bull; Users will expect bigger and better from us, and smaller and better. &bull; Users will expect service that is user-friendly according to the user's personal definition. &bull; Users will expect on-line, off-line, hands-on, and human service on a demand basis, no waiting. &bull; Users will expect a &ldquo;matchmaking&rdquo; service that puts them in touch with others of similar interests. In short, users in the coming decade will continue to expect the impossible. And User Services personnel will continue to labor to give them the impossible.
The interchange algorithms for circuit placement problems
Authors: L. C. Cote, A. M. Patel
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper discusses the applications of interchange procedures to solve circuit placement problems. A theoretical analysis to guage the quality of solutions is presented. Two interchange algorithms (Algo I and Algo II) are programmed and tested for moderate size placement problems. Algo II is an improved version of Algo I. On the basis of the limited computational results. Algo II seems to provide significant improvements without increased computation cost. The interchange procedure is widely utilized to find approximate solutions for combinatorial problems such as traveling salesman, facility locations, module placements, etc. There are many variations of the interchange procedure. However, the variations are generally limited to the procedure of selecting elements for possible exchanges. The different combinations (solutions) are systematically generated by interchanging only a few elements at a time. A combination which does not improve the value of some norm is rejected. A combination which improves the value of this norm is accepted and one tries to find another combination for further improvement. This is continued until one cannot improve the value of the norm. The search is terminated in a finite number of steps. Computational considerations limit the testing to only pairwise exchanges of elements. Thus, only a small subset of all the possible combinations are generated, and this generally results in suboptimum or local solutions. Even suboptimum solutions of very large problems (more than 100 nodes) can be computationally very expensive. Interchange procedures (as shown in Section 4) compete quite well with other heuristic techniques in regard to both computational time and quality of solutions.
A basis for the design of Operating System Command and Response Languages
Authors: Hasan H. Sayani
Venue: Proceedings of the 1976 annual conference (1976)

The design of common Operating System Command and Response Languages (OSCL/OSRL) requires as a basis the definition of a user's view of the command system. This paper discusses this view, defines key concepts (session, session-blocks) as they relate to a user's information producing task. Desirable language features are discussed along with suggestions for methods of developing common OSCL/OSRL.
Studying the Use of Handhelds to Control Smart Appliances
Authors: Jeffrey Nichols, Brad A. Myers
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Today's complex appliances are plagued by difficult-to-use interfaces. In many cases, consumers use only a few of the many features on their appliances because the more complex features are hidden by confusing interfaces. This problem can only get worse as appliances get smarter, become more complex, and are subject to more demands by their users. This paper presents two studies that compare the accuracy and speed of real users controlling two common appliances, a stereo and a telephone/answering machine, using two different interaction techniques. Our studies found that people using an appliance interface presented on a handheld computer performed the same set of tasks in half the time while making half the errors as compared to using the appliance's built-in control panel. These studies are motivating us to build a generic remote appliance control system that we call the personal universal controller.
Fault-tolerant string processing by pattern mapping
Authors: Kuo-chung Tai
Venue: Proceedings of the 1977 annual conference (1977)

A technique called pattern mapping for correcting errors detected during processing a string of symbols is developed. A pattern describes how to map one string into another. Using a pre-constructed list of patterns, for each detected error, one finds the first pattern with successful mapping, makes a correction based on this pattern, and continues processing the following symbols. A general criterion for correcting errors is proposed and how to construct a list of patterns in order to meet this criterion using pattern mapping is presented. A fault-tolerant compilation process using pattern mapping, together with the proposed correction criterion, has been implemented with success.
Page Decomposition and Signature Finding via Shape Classification and Geometric Layout
Authors: John D. Hobby
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

Consider the problem of decomposing a page image into text ruling lines, signatures, other line art, and other material. A fast classifier based on a skeletonization of the image and various curve-fitting techniques gives an initial labeling, followed by Baird's language-free layout analysis and a post-processor that uses the geometric layout to refine the decisions about text versus non-text.
A step toward quality control in computer programming: Understanding the psychology of the management of computer programmers
Authors: R. Fred Littrell
Venue: Proceedings of the ACM annual conference (1973)

AT THE 1972 ANNUAL MEETING OF THE AMERICAN ASSOCIATION FOR THE ADVANCEMENT OF SCIENCE, SPEAKING BEFORE THE ACM-SPONSORED SESSION ON BETTER COMPUTING FOR RESEARCHERS, DR. RUTH DAVIS, DIRECTOR OF THE CENTER FOR COMPUTER SCIENCE AND TECHNOLOGY OF THE NATIONAL BUREAU OF STANDARDS, STATED THAT THERE WERE SOME 2000 TYPES' OF COMPUTER APPLICATIONS, SUCH AS PAYROLL, WRITING MUSIC, SOLVING DIFFERENTIAL EQUATIONS, ETC. OF THESE, FORTY PERCENT WERE SCIENTIFIC AND ENGINEERING APPLICATIONS (AND THIS KIND OF APPLICATION IS DECREASING RELATIVE TO THE TOTAL), BUSINESS AND MANUFACTURING ACCOUNTED FOR THIRTY PERCENT, AND HUMANITIES APPLICATIONS ALSO TOTALED THIRTY PERCENT. THE ONE COMMON THREAD IN EACH APPLICATION IS THAT MANAGERS CANNOT CONTROL THE QUALITY OF THE PROGRAMS, AND THEY CANNOT CONTROL THE KINDS OF TESTING EMPLOYED, THE PROGRAMS THAT ARE PRODUCED USUALLY HAVE NOT BEEN TESTED THROUGHOUT THE FULL RANGE OF POSSIBLE INPUTS. THE TIME HAS COME, DUE TO THE OFTEN TREMENDOUS COSTS OF SYSTEM FAILURES, TO EMPLOY QUALITY CONTROL PROCEDURES DURING PRODUCTION OF PROGRAMS, SINCE QUALITY CONTROL PROCEDURES ARE AN INTEGRAL PART OF MOST BUSINESS AND PRODUCTION ORGANIZATIONS, ONE MIGHT WONDER WHY SIMILAR PROCEDURES HAVE NOT BEEN USED IN DATA PROCESSING SO FAR.
State table analysis of programs in an algo-like language
Authors: David L. Parnas
Venue: Proceedings of the 1966 21st national conference (1966)

a. The source language&mdash;SFD-ALGOL SFD-ALGOL 1.2 is an ALGOL-like language intended to describe the functions of synchronous systems. The function of a system is the response of its output to any input sequence. This function can be described by an algorithm. The algorithm need not be the one actually used by the system; it need only be equivalent. ALGOL is suitable for such a purpose except that it cannot express timing, specify input restrictions, or indicate which variables are input/output variables. SFD-ALGOL is identical to ALGOL-60 except for a few added declarations and an extra type of statement grouping known as a time block. The time block consists of statements enclosed within a time begin and the corresponding end, and is interpreted to mean that all actions indicated within it occur in the span of one clock pulse. Further details of SFD-ALGOL can be found in 2, a complete specification is supplied in 1. b. The object language&mdash;state tables The problem to be discussed here can be framed as follows: Given an SFD-ALGOL description of a finite state system produce the state transition table and output table of the system described. The state transition table (tabular form of the state diagram) has a row for every internal state, a column for every input state, and the entry at every intersection gives the next internal state that will occur in the system. The output table is of the same form, but contains the state of the output lines for each combination of internal and input states. A more complete treatment of finite state machine can be found in Gill 4. Each SFD-ALGOL description of a finite state system is actually a description of an infinite class of systems with equivalent* state tables. These systems cannot be distinguished on the basis of the I/O characteristics and, since an SFD-ALGOL program only describes I/O characteristics, it describes the whole class. The program or description itself has a state table, and it is this table that the process to be described derives. There exist effective algorithms that will reduce this table to the minimal possible table 3.4.
The optimal routing of vehicles using the GASP II simulator
Authors: M. Wayne Shiveley, Edward M. Salley
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

An integrated systems approach has been used to formulate a model for the analysis of routes and the routing of vehicles. The essential data to describe the available routes are stored in the form of a network; the directional relationships and the relative location of the routes are established with the aid of a grid. The GASP II simulator has been used to develop the model. The model utilizes the network to optimally route a vehicle from a specified starting point to a given destination; it employs a variety of techniques which includes dynamic programming, branch and bound, and simulation.
The algebra of derivations and a semithue parser
Authors: David B. Benson
Venue: Proceedings of the 1969 24th national conference (1969)

While derivations are used to formally generate sentences from the productions of a grammar, the structure, or structural descriptions, which the grammar imposes on a sentence is the entity of general interest. For context free generation, a tree is an adequate representation of sentence structure. For more general classes of grammars, a tree is not adequate. With the strong form of derivation developed in Griffiths3 and Benson1 an algebra of derivations is possible. In particular there is an equivalence relation on derivations such that the equivalence classes are a representation of sentence structure for semithue languages. A slightly different equivalence relation provides sentence structure for context sensitive grammars. There is a parser for context free and semithue languages which is closely allied to the equivalence class representation of sentence structure. The parser is exemplified, described, and shown to find each structure assigned to the input sentence exactly once.
Zone classification in a document using the method of feature vector generation
Authors: R. Sivaramakrishnan, I. T. Phillips, J. Ha, S. Subramanium, R. M. Haralick
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A document can be divided into zones on the basis of its content. For example, a zone can be either text or non-text. This paper describes an algorithm to classify each given document zone into one of nine different classes. Features for each zone such as run length mean and variance, spatial mean and variance, fraction of the total number of black pixels in the zone, and the zone width ratio for each zone are extracted. Run length related features are computed along four different canonical directions. A decision tree classifier is used to assign a zone class on the basis of its feature vector. The performance on an independent test set was 97%.
Intersection-closed full AFL and the recursively enumerable languages
Authors: Seymour Ginsburg, Jonathan Goldstine
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

A study is made of conditions on a language L which ensure that the smallest intersection-closed full AFL containing L (written @@@@ @@@@(L)) does or does not contain all recursively enumerable languages. For example, it is shown that if L &euil; {ani/i @@@@ 0}and [equation]inf ni+1/ni>1, then [equation](L) contains all recursively enumerable languages. On the other hand, it is shown that if L @@@@ a* and the ratio of the number of words in L of length less than n to n goes to 1 as [equation], then [equation] does not contain all recursively enumerable languages.