ppxscal/embedding_network huggingface dataset:
Qualitative analysis of mathematical expressions using computer symbolic mathematics
Authors: David R. Stoutemyer
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

Increasingly powerful computers and simplification algorithms permit us to obtain answers for increasingly complex computer-algebra problems. Consequently, we will continue to get results which often are incomprehensibly lengthy and complicated. However, a user of computer-algebra systems need not abandon hope when faced with such results. Often the user is interested in qualitative properties of a result rather than details of an analytical representation of the result. For example, is the result real? bounded? even? continuous? positive? monotonic? differentiable? or convex? Where, if any, are the singularities, zeros, and extrema? What are their orders? What is the local behavior in the neighborhood of these notable features, as exhibited perhaps by series expansions? Are there simple asymptotic representations as certain variables approach infinity? This paper describes a program which automatically analyzes expressions for some of these properties. The user may enquire about a specific property, such as monotonicity, or he may simply invoke a single function which attempts to determine all of the properties addressed by the collection of more specific functions. The specific functions are appropriate when a user knows which properties are important for his application, but frequently he is ignorant of the most decisive questions or ignorant of specific available functions which automatically investigate the desired properties. The collective qualitative analysis function is intended as a sort of panic button, which hopefully will provide some pleasantly surprising results that serve as a point of departure for further analysis. This function is a tool for deciphering unwieldy expressions that otherwise defy understanding. Many of the above qualitative properties have numerous testable characterizations, and only a few have been explored here. However, the results of this initial effort indicate that qualitative analysis programs are a promising means of extending the utility of computer algebra.
A modular approach to teaching management science and statistics using APL
Authors: Dale H. Bent, Girard C. Pessis
Venue: Proceedings of the eighth international conference on APL (1976)

Course material in Management Science and Statistics can be classified by topics. Each topic can be subclassified into specific areas involving distinct algorithmic treatment. The paper describes three workspaces which may be used for the teaching of probability functions, simple linear regression, and linear programming. Emphasis is placed on a modular approach to teaching and programming.
Variance reduction techniques
Authors: Stephen S. Lavenberg, Peter D. Welch
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

This talk is concerned with statistical techniques, known as variance reduction techniques, for increasing simulation efficiency. The emphasis will be on critically assessing the practical applicability of variance reduction techniques in discrete event simulations of complex stochastic models of systems. Examples of the successful application of such techniques will be presented.
Execute and its use
Authors: Will J. Roden,  Jr., Garth H. Foster
Venue: ACM SIGAPL APL Quote Quad (1981)

This paper examines the use of Execute in a large collection of functions found in 468 workspaces in 80 libraries of a large APL system complex. The relationship of Execute to coding style and execution efficiency such as in compiling is overviewed. A summary of previous results in static and dynamic frequency counts of the Execute token is given and the methodology and results of the study are discussed.
Developing a health services simulator
Authors: Charles G. Richie, Henry G. Dove, William S. Moore, Sam A. Edwards
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The development of a health services simulation model is described below. The main subroutines comprising the model are designed to (1) predict system entry, (2) simulate care delivery, (3) determine costs and (4) portray status of health information. The status of model development and results of initial tests are discussed.
An interactive Automated Test Data Generator
Authors: Robert H. Hoffman
Venue: Proceedings of the 1976 annual conference (1976)

The Automated Test Data Generator (ATDG), a tool which supports the generation of test inputs for UNIVAC 1100 Series FORTRAN software, is described. The detection of structural and data flow errors, a second function of the tool, is also described. Although the mathematical techniques represented in ATDG are included through appropriate references, the main theme of the paper is the presentation of the capabilities and operational characteristics of the system. Some of the significant advantages of interactive programs are identified and the operational simplicity of ATDG is demonstrated. Two practical applications of the tool are presented to illustrate its usefulness in unit testing and program testing. The objectives and future plans of the TRW project currently developing ATDG for the NASA/Johnson Space Center are briefly defined.
Graphic input interaction techniques(Panel Session)
Authors: James J. Thomas
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

In the last decade most research and development in computer graphics has been in the output side. Input devices and techniques for communicating with graphic systems are now also becoming active research topics. To communicate the state-of-the-art and to identify the key research issues, SIGGRAPH sponsored a workshop on graphics interaction input techniques in June, 1982. The topics to be discussed include tools for building user interfaces, recent successes using those tools, human factors, generic interaction types, interaction techniques for raster systems and style-independent interaction techniques. The workshop will be summarized with an address on the current state-of-the-art and identification of the major research issues. In addition, selected participants will be asked to address the primary research issues.
Simulation of large and complex systems: Some general trends and an example
Authors: Berth Eklundh
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

Some problems with design and simulation of complex systems are pointed out. The use of special languages for specification and description of systems are mentioned. The effects of a hierarchical system design approach are described and by an example the connection to system simulation is shown. The example clearifies the advantages with a system description that is based on the system being divided into modules by function. Communication between modules by means of signals are looked upon in an abstract manner and the apparition of program structure is reviewed in this case. The program structure hold some advantageous properties which are examined and put in relation to program evaluation.
T01A-programming languages: T01A1-Structured programming in unstructured language
Authors: Clinton R. Foulk
Venue: Proceedings of the 2nd annual computer science conference on Program information abstracts (1974)

A consensus appears to be developing in the programming community that every effort should be made to replace conventional programming techniques with structured programminï¾¢ in a language such as PL/I as soon as poseiole. This raises two questions: l) what can ce done by the progra~nmer who must still pro;Tram in such unstructured languages as FORTRAN and Assembler Language, and 2) more important, how can students just learning to program oest be taught to write structured programs if only unstructured languages are available to them? In this paper, it is proposed that the programmer first write a structured version of his program in an informal algorithmic language (this can and should replace the conventional flowchart), then use tme statements of the informalsolution as comments in his actual program. Examples are given showing that the more unstructured the actual programming language, the more this simple technique can help in the development of structured programs and &ldquo;structured programmers&rdquo;.
User services on a restricted/limited budget
Authors: Arthur O. Cromer
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

This article attempts to point out some of the methods used to cope with large needs and small staff, in hopes that some of the methods may be of more general usefulness.
On the (combinatorial) structure of L languages without interactions (Extended Abstract)
Authors: A. Ehrenfeucht, G. Rozenberg
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

This paper presents some such results for various families of L languages without interactions (see, e.g., [2] or [9]). We have chosen to investigate L languages (without interactions) because: (i) they are physically well motivated, see, e.g., [5], (ii) L systems may very well be algebraically the most natural way to define languages, see, e.g., [1],[7] and [10], (iii) they contribute to our understanding of the essential differences between sequential and parallel string processing (rewriting), see, e.g. [2], [4], [8] and [11]. In this paper we investigate the families of ET0L and E0L languages and their deterministic subfamilies. After each theorem we present an example of a language that can be proved, using the theorem, to be not in the given family of languages.
Efficient stable sorting with minimal extra space
Authors: Edward C. Horvath
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

In his chapter on sorting, Knuth [1]@@@@ describes the open problem of stable sorting with no more than 0(log2N) bits of extra space and less than 0(N2) computation time. In this paper we define the concept of a contiguent and show that a contiguent forming algorithm may be used as the basis for a stable sort. A class of such contiguent forming algorithm may be used as the basis for a stable sort. A class of such contiguent forming algorithms is described, the most naive of which requires 0(log N) bits of extra space and 0(N log2N) computation time. We also describe a stable merging algorithm which requires 0(N) time and 0(log N) bits of extra space, but which is not applicable to all cases. It is shown, however, that this merge may be combined with a contiguent compilation algorithm to yield a generally applicable stable sorting algorithm. One such combination provides the basis for a stable sorting algorithm which requires 0(N.logN.G(N)) time and 0(log N) bits of extra space. Another such combination provides the basis for a stable sorting algorithm which requires 0(N log N) time and 0(log2N) bits of extra space.
An experiment in software engineering: The Architecture Research Facility as a case study
Authors: Honey S. Elovitz
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Software developers often complain that researchers in the field of software engineering propose new ideas without testing these ideas in practical applications. The Architecture Research Facility (ARF) was developed utilizing several software engineering techniques in order to discover their usefulness in actual software system developments. Such techniques as the complete design and documentation of the individual components and interfaces prior to coding, design reviews, code specification in a pseudo-language, code-reading prior to testing, information-hiding modules, run-time error checking mechanisms, strong-typing and the use of support software tools are discussed. We describe the motivation for using the techniques as well as how these techniques were applied to ARF's development. Staff reactions to using these techniques were favorable although at the time some frustration at the lack of apparent coding progress was felt. Our results would prove useful to software developers planning to use new development techniques since we highlight many of these techniques' strengths and weaknesses.
Event variables - on conditions for APL
Authors: Thomas J. Harris
Venue: Proceedings of seventh international conference on APL (1975)

This paper describes the function and use of event variables for APL programs. Event variables can be used in a manner analogous to PL1 ON Conditions. Section 1 describes the background and case for event variables; section 2 presents implementation considerations; and section 3 discusses the use of events in an APL working environment.
Nonlinear optimization: Some procedures and examples
Authors: Allan W. Dickinson
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Over the past decade the use of the digital computer in the solution of scientific and engineering problems has expanded quite rapidly. The ultimate objective of many of these applications is optimization. In the chemical industry, for example, a typical problem might be to maximize the yield of a certain process be making adjustments to the temperature, pressure and other operating variables, and to simultaneously insure that the purity of the product remains high and that the manufacturing cost does not exceed a fixed price. The functions to be optimized are usually nonlinear, do not necessarily possess continuous derivatives and are often subject to constraints. This paper presents a discussion of some of the available procedures for nonlinear optimization and gives some examples of their application.
Business and management data processing II: A systems approach for the application of computerized scheduling techniques and the RCA-PERT/Cost program
Authors: M. E. Haskins,  Jr., N. E. Sondak
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

COMPUTERIZED SCHEDULING techniques such as PERT and Critical Path Scheduling have received a good deal of attention recently because of their successful application to a large number of complex projects. However, their usage could be greatly extended if the potential user could be supplied with a more formalized technique for the analysis of a project. This technique should reduce the cost of the use of computerized scheduling by reducing the time and effort required to arrive at a suitable schedule for the project. This paper will present such a technique and summarize the experiences and results obtained when this methodology was used for the analysis of a wide variety of projects. In addition, there has been growing awareness that the enhancement of the basic scheduling algorithms to include factors other than time, such as manpower and costs, in the overall schedule would be most beneficial. This paper will present a practical, working, integrated computerized scheduling system including such a cost algorithm. The discussion is based on techniques evolved in the development of our PERT/Cost program. This extension now permits the inclusion of cost constraints in the design of a schedule as well as complete financial analysis of the project as it progresses.
Integrated techniques for functional and gate-level digital logic simulation
Authors: S. A. Szygenda, A. A. Lekkos
Venue: Proceedings of the 10th Design Automation Workshop (1973)

Digital simulation is defined as the process of exercising a realistic software model of a digital system, with sets of input stimuli, to generate signal behavior versus time. Simulation processes can be categorized by their simulation atom. Gate-level simulation 1,2,3,4 is simply one in which the atoms of simulation are gates. Functional simulation 5,6,7,8 simulates larger units, such as adders, decoders, registers, etc. It appears that gate-level simulators can perform accurate simulation4, 9. However, they present some operational limitations, such as the maximum number of gates that can be simulated. Further- more, the host computer time often becomes intolerable for large nets. An additional problem is encountered when the logical net is encoded for input to the simulator. Clerical errors in encoding the net, and their detection and correction, can cause costly delays. Finally, for gate-level simulators, MSI-LSI functional modules must be expanded to a gate-level description. The logical solution to the above limitations is the use of functional simulation techniques.
MDS: An improved total system for firmware development
Authors: Kazutoshi Takahashi, Etsuo Takahashi Tatsushige Bito, Toshinori Aoyama, Akihiko Yamada
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

A general purpose, total system MDS1,2 (Microprogramming Design-support System) has been developed to hasten the introduction of various kinds of firmware over the widest possible range of computer from the largest to the smallest (microcomputer). Not only many types of assembly language but also machine dependent high-level languages can be used and physical address assignment can be performed automatically with MDS. This paper describes an overview of MDS, the design approach to the high-level languages, and three examples which have been developed.
Serialization of SVP requests-a locking proposal for APL
Authors: Michael Van Der Meulen
Venue: Proceedings of the international conference on APL (1984)

How does APL fit into the new wave of distributed systems and parallel processing? Thanks to shared variables, APL offers a simple, yet powerful, communication link between independent processors. But at the core of any reliable parallel processing application there must be a method of serialization. Although APL currently offers a very useful access control facility for shared variables, it fails to provide the basic locking mechanism required by distributed application developers to prevent simultaneous specifications. This paper proposes an APL language extension to achieve serialization with shared variables.
Online searches of social science data sets: The RIQS system and ICPSR data
Authors: Ann Janda, Kenneth Janda
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

Every solution seems to generate a new problem. The problem of accurately assessing public opinion led to the invention of the sample survey. The subsequent problem of analyzing survey responses brought widespread use of machine-readable data. The problem of preserving machine-readable data for secondary analysis stimulated the creation of data depositories or "archives." Growth over time in the holdings of these social science data archives, however, has aroused needs for improved retrieval of data. This paper explains one method of dealing with such needs. It involves an interactive search of the holdings of the most diversified social science data archive, the Inter-University Consortium for Political and Social Research, using a general-purpose information retrieval system, RIQS, written for CDC computers.
QUILT (a.k.a. KWILT): A special purpose instructional language
Authors: Carl Eckberg
Venue: ACM SIGCSE Bulletin (1978)

The &ldquo;meaning&rdquo; of KWILT has been lost to etymological history. The K was in honor of D. Knuth, but this gives &ldquo;Knuth WILT&rdquo; which is a bit disconcerting. Indeed, there was a tendency to pronounce the language as &ldquo;kay-wilt&rdquo;, which offended veteran users as much as COBOL programmers would resent &ldquo;cobble&rdquo;. From: QUILT USER MANUAL and REFERENCE GUIDE
Random variate generation
Authors: Bruce Schmeiser
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The presentation begins with a discussion of basic concepts and concludes with a state of the art survey of methods for generating random variates on a digital computer. This paper updates the more than 300 references cited in last year's paper. Copies of the visual aids are given.
The &ldquo;tell-us-the-answer-you-want&rdquo; problem
Authors: David E. Barnett
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

This paper describes a simulation model of the Trans-Panama Pipeline. The pipeline is used to transport crude oil between tankers in the Pacific and Atlantic Oceans. The model represents in many senses a classical queuing system, with vessel delay times at the Pacific and Atlantic terminal facilities the critical responses of interest. The paper focuses on the modeling of vessel arrivals. Actual data on vessel arrivals show that interarrival times are exponentially distributed. However, due to human scheduling the number of arrivals within any 15-day planning period equals the expected number. Since the number of arrivals generated by the exponential distribution can deviate substantially from the expected number, an alternative modeling technique is needed. The technique used to model this pattern of arrivals is described in this paper.
Pictorial man-machine communication
Authors: W. Haas, M. Mrva, W. Tengler
Venue: Proceedings of the ACM '81 conference (1981)

The importance of computer graphics and image processing lies in the opportunities they provide for the use of pictorial information in communicating with computer systems /11/. Pictorial communication can replace the traditional alphanumeric man-machine communication because it represents a very natural way of interfacing man and machine. In this way pictorial communication promises foreseeable advances in communication technology because the volume of data that can be collected and disseminated will increase by orders of magnitude /13/. Data processing frequently is a task of processing large amounts of all kinds of data. Nothing is more natural than performing that work interactively by dealing with pictures instead of numerical series. However, not only the quantity of data that can be made visible in one picture is an important fact, but so are capabilities such as showing dynamic effects, emphasizing or highlighting certain characteristics of data, or visualizing normally invisible structures within data. There are many examples of application areas that have come to depend on interactive computer graphics and image processing to carry out tasks that would otherwise be too expensive to perform or even impossible to carry out. The main reason for the effectiveness of pictorial communication in these applications is the speed of perception with which the user can assimilate the displayed information. Moreover, the usefulness of pictorial communication lies not only in the speed of generating images but also in its flexibility, i.e. its ability to present the same data in a variety of ways /7/.
An environmental simulator for the FDNY computer aided dispatch system
Authors: John Mohan
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

FDNY's MICS computer-aided dispatch system is designed about dual PDP 11/45s and supported in fallback by dual INTEL 8080 micro-processors. The computer processes alarms, assigns available units, notifies these units by voice and hard copy terminals located in the fire stations, monitors status changes of firefighting units and incidents, and dynamically adjusts firefighting coverage for maximum effect. This paper describes the MICS environmental simulator that was used to test and validate the MICS system development effort. Some results on system performance are presented to depict how the environmental simulator was used for system acceptance testing. Finally, encouragement is given to developers of other large real-time systems to adopt a design approach which considers simulated load generation and performance monitoring to be an integral part of the overall applications and systems software.