ppxscal/embedding_network huggingface dataset:
The future of natural language processing (Panel Discussion)
Authors: Bertram Bruce
Venue: Proceedings of the 1979 annual conference (1979)

Supporters of the computer as a true natural language understander can point out numerous examples where incorporation of domain and task specific knowledge into a program has enabled the simulation of language understanding. Critics, on the other hand, have dismissed these examples as not being representative of the task performed by humans when they understand language. The argument revolves around questions of the need for analogic, inductive, creative, or flexible processes in doing general language understanding. It is argued here that two very different processes are employed by humans in the course of intelligent behavior, and specifically, in their use of language. The first of these, which relies on pre-stored contextual knowledge about the task demands, is demonstrably do-able using current computer technology. Furthermore, it is difficult to specify the ultimate limit for programs based on the first process. The second, in which contextual knowledge is induced from knowledge of a multitude of human interactions, has been barely approached by current artificial intelligence systems. The extent to which a system could embody such a process and the requisite body of knowledge is an open question. What we can say is that some of the simplest language understanding (even a child can do it) is difficult to imagine using only the first process. Examples are presented to illustrate the capabilities of Process 1 and the need for Process 2.
The use of Monte Carlo simulation to reflect the impact human factors can have on systems performance
Authors: Gerald P. Chubb
Venue: Proceedings of the 5th conference on Winter simulation (1971)

Man-machine simulation is one approach to determining system effectiveness as a function of subsystem performance, but often man has not been treated as a viable element in system effectiveness studies. The model discussed here is an example of how human factors can be explicitly dealt with in mission simulation. The application discussed also demonstrates the feasibility of a new, systematic method for integrating multidisciplinary biological research data into a composite description of performance degradation in a nuclear attack environment. The approach, however, appears to be generalizable to other threat environments and mission conditions. Besides being a potentially useful design evaluation method, the model has served to focus attention on critical problem areas for future laboratory investigations.
The Gamma network: A multiprocessor interconnection network with redundant paths
Authors: D. S. Parker, C. S. Raghavendra
Venue: ACM SIGARCH Computer Architecture News (1982)

The Gamma network is an interconnection network connecting N&equil;2" inputs to N outputs. It consists of log2N stages with N switches per stage, each of which is a 3 input, 3 output crossbar. The stages are linked via &ldquo;power of two&rdquo; and identity connections in such a way that redundant paths exist between the input and output terminals. In this network, a path from a source to a destination may be represented using one of the redundant forms of the difference between the source and destination numbers. The redundancy in paths may thus be studied using the theory of redundant number systems. Results are obtained on the distribution of paths connecting inputs to outputs, and the permuting capabilities of the Gamma network. Switch settings for certain frequently used permutations and control mechanisms are also considered in this paper. This network has an interesting application in solving tridiagonal systems using the odd-even elimination algorithm.
Some restrictions on W-grammars
Authors: Sheila A. Greibach
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

The effect of some restrictions on W-grammars (the formalization of the syntax of ALGOL 68) are explored. Two incomparable families examined at length are WRB (languages generated by normal regular-based W-grammars) and WS (languages generated by simple W-grammars). Both properly contain the context-free languages and are properly contained in the family of quasirealtime languages. In addition, WRB is closed under nested iterated substitution (but is not an AFL) and is properly contained in the family of indexed languages.
TSAR: A large-scale simulation for assessing force generation and logistics support in a combat environment
Authors: Donald E. Emerson
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The objectives of this paper are to provide an overview of the TSAR/TSARINA simulation models, and to illustrate their use with a simple application. The TSAR/TSARINA simulation models have been developed to provide a method of evaluating how a wide range of airbase improvement options could increase the combat capability of airbases during wartime. Following a description of model highlights, the application of these models is illustrated with some results from a recent analysis.
Corporate planning modeling languages
Authors: Thomas H. Naylor
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

This session deals with the software to develop corporate planning models. Basically, two alternatives are available. Corporate planning models can either be programmed in a general purpose scientific language like FORTRAN, PL/1, or APL or they can be coded in a planning and modeling language like the one used throughout this text - SIMPLAN. There are at least two major benefits associated with the use of one of the scientific programming languages. First, they are extremely flexible. That is, most of the important elements of a planning and modeling system can be coded in FORTRAN, PL/1, or APL. Indeed, a recent survey showed that 50% of the corporate models had been written in FORTRAN. Second, these languages are quite well-known, particularly FORTRAN.
An analysis of the effect of production quantity and inventory selection policy on the probability of meeting a specified launch schedule
Authors: Victor A. Zaloom
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

An analysis of the effect of two alternative inventory selection rules is performed to determine their effect on both cost per flight and schedule reliability for the planned Space Shuttle Program. The major objective of the Space Shuttle Program is to achieve a low cost per flight while providing a capability to support a variety of scientific, defense, commercial and international space applications. Cost per flight is the average recurring cost for operating the shuttle. One aspect of cost per flight is related to the number of new motors required to complete the mission flight schedule. The Logistics Simulation Model (LSM) of Schlagbeck and Giglieri (1) was employed to simulate the mission flight schedule. The two inventory selection policies considered were: (1) When a motor is needed to make a flight select the available motor with the least number of previous flights (new logic). (2) When a motor is needed to make a flight select the available motor with the most previous flights (old logic). The study was performed using baseline parameters as supplied by the NASA program office. The number of new motors to be produced and the production schedule was varied over the range (80-90). The study shows that the probability of meeting a specified launch schedule is greater and the refurbishment costs lower using the new logic over the entire feasible range of production quantities.
Fortran for the Texas Instruments ASC system
Authors: Dorothy Wedel
Venue: Proceedings of the conference on Programming languages and compilers for parallel and vector machines (1975)

The ASC Fortran compiler and the methods of optimizing the execution times of compiled programs are described. Language extensions and compiler organization are briefly outlined. Traditional scalar optimization techniques and techniques to detect and generate vector operations from ANS standard Fortran source code are discussed. Emphasis is placed on optimal generation of vector operations and parallel processing. The vector and parallel processing techniques described here are applicable to a wide variety of vector or parallel processing machines. Numerous examples are discussed to demonstrate many of the capabilities and features of the compiler.
A scan-line hidden surface removal procedure for constructive solid geometry
Authors: Peter R Atherton
Venue: ACM SIGGRAPH Computer Graphics (1983)

This paper presents a new methodology for resolving visible surface images of solid models derived from Boolean combinations of volumetric building blocks. The algorithm introduced here is an extension of well-established scan-line hidden surface removal procedures, and it integrates knowledge of a Boolean construction tree in the surface resolution process. Several hidden surface coherence properties are discussed in terms of their possible exploitation in the intricate solid model visualization process. While many of the earlier coherence techniques depend on a polygon environment in which surfaces and volumes do not intersect, the Boolean process can not afford that luxury because it is inherently required to handle intersecting volumes and surfaces. Initial tests indicate that substantial performance improvements over previous methods can be achieved with the algorithm described in this paper, and that these improvements increase as model complexity increases. An underlying philosophy of a dual solid modeling system is proposed in this paper. It suggests that two solid modelers are necessary to successfully satisfy both analytical precision requirements and user interface visualization requirements. The visual solid modeling task addressed in this paper provides greatly improved response capabilities, as compared to other systems, by striving to optimize the constructive solid model (CSG) solid model computations specifically for display purposes.
Design automation status in Japan
Authors: Akihiko Yamada
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper surveys the Japanese design automation (DA) status and activities. First, the DA statistics for major Japanese organizations are presented. These statistics show the status of logic, physical and test DA for digital systems and LSIs. Second, notable DA activities of Japanese manufacturers, laboratories and universities are introduced.
Computer Science And Recursion Theory
Authors: Marian Boykan Pour-El
Venue: Proceedings of the 1978 annual conference (1978)

One of the basic concerns of classical mathematical logic has been a rigorous definition of &ldquo;mathematical proof". A proof may be discovered by luck, genius or accident. But once discovered it is mechanically checkable. Thus the most general type of mechanically checkable procedure provides a definition of the most general kind of proof. An investigation of &ldquo;mechanical checkability" leads naturally to the notion of &ldquo;computable process". Recursion theory is that branch of mathematical logic which studies computability theory. From its very inception recursion theory has been so closely associated with theoretical computer science that it is sometimes difficult to tell where one begins and the other ends. Both appear to have a common origin in the 1930's and 1940's - when the fundamental results of Turing, Post, Herbrand-G&ouml;del, Kleene and Church on computability were obtained [52,53,35,36,19,25,26,11,12,13]. Although the work of each of these authors is based on a different intuition as to the nature of computability, they all share a common feature. In each, the approach is discrete and atomic. No attempt was made to use machines with continuously varying parameters - e.g. analog computers - as a basis for understanding computability. The author finds this regrettable and is trying to remedy the situation [39]. At all events, all of these discrete, atomic definitions have been proved to be equivalent. It is now widely accepted that the concept &ldquo;computable function of natural numbers" is correctly identified with &ldquo;partial recursive function". Lack of space forces us to be selective rather than exhaustive. We discuss briefly five areas of interest to the computer scientist. The purpose of this paper is to explore the interaction of recursion theory with computer science in these areas. We consider, not only similarities between the two fields, but also points of difference. We discuss how recursion theory supplied computer science with specific mathematical definitions and techniques. We also consider how the computer scientist shaped (and is still shaping) this recursion-theoretic material to his own needs. The five areas are not mutually exclusive: there are numerous connections between them. In the interest of clarity and brevity, reference is made only to those works which are easily understandable to the beginner. No attempt is made to make the bibliography complete or up-to-date.
An internetwork memo distribution capability&mdash;MMDF
Authors: David H. Crocker, Edward S. Szurkowski, David J. Farber
Venue: Proceedings of the sixth symposium on Data communications (1979)

The advent of packet-switched networks has led to increased use of computers for sending text messages (memos) between people. However, attachment to common carrier or equivalent packet networks is expensive and/or restricted by organizational policies. In addition, use of several networks creates the need for relaying memos between them. The work described here is designed to free users from dependence upon any particular communication environment and to provide a memo distribution facility which can employ whatever communication channels are available. It will support variable-network structures, emulation of network attachment, and inter-network memo forwarding.
Programming with(out) the GOTO
Authors: B. M. Leavenworth
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A brief history of the goto controversy (retention or deletion of the goto statement) is presented. After considering some of the theoretical and practical aspects of the problem, a summary of arguments both for and against the goto is given.
A course in personalized applications libraries
Authors: Ronald King, John Walstrom
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

With the advent of micro/mini computers and timesharing facilities, personalized information systems are a reality. Computing courses are needed that can successfully raise the competency level of the general college student to the point where the computer can be used as a powerful tool. At present, curriculum development abounds, and is being extended, for courses that pertain to future applications and system programmers. However, curriculum development related to meeting degree tool requirements is centered only around the first course in computing, typically either an elementary programming course, or one which provides an introduction to computers and society. This paper describes a course in personalized applications libraries to be used as a follow-up to the typical first computing course, with the objective of enabling students to be more successful in realistically meeting tool requirements. The paper includes a course overview, catalog description, course outline, and a bibliography of related reference material.
A modeling approach and design tool for pipelined central processors
Authors: D. E. Lang, T. K. Agerwala, K. M. Chandy
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

As CPUs have become larger and more complex, it has become increasingly more difficult during hardware design and implementation to predict how well a CPU will perform. Furthermore, buyers of such machines have a similar problem in evaluating CPU performance among a diverse selection of computers, since MIP rates quoted by manufacturers may be misleading. This paper describes a methodology based on simulation models for predicting the performance of central processors with instruction execution that occurs in distinct and separable phases. The basic components of the model have been designed to allow a functional representation of the instruction execution path. This provides a natural mapping of the instruction set onto the architecture in a manner familiar to the designer. The model has been verified for existing computers using actual trace data from these machines. Novel aspects of the model and its use in CPU design are discussed.
Our machine, a microcoded LSI processor
Authors: Dave Johannsen
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

Current LSI technology allows the systems designer to construct complex data processing structures containing tens of thousands of transistors on single silicon chips. Constraints imposed by the technology influence design tradeoffs and result in computer architectures dramatically different from the more classical computer designs. At CalTech we are exploring the possibilities offered by nMOS technology, with the &ldquo;Our Machine&rdquo; (OM) project being one of the current research projects. The OM project is investigating the structured design of a multi-chip microcoded processor system. Due to constraints imposed by limited man- and computer-power, we are gaining insights into future constraints that will be placed on all large chip designs as the technology improves to allow chips with hundreds of times the complexity of today's designs.
Teaching subsets of Pascal
Authors: J. W. Atwood, E. Regener
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

In teaching Pascal in our basic programming course since 1975, we have developed a teaching order using a sequence of language subsets, similar in concept to the SP/k, SF/k, and PS/k systems of Holt and Hume. Our scheme introduces each programming idea in as general a context as possible, and presents the elements of the Pascal-S subset (Wirth) before the rest of the language. It is designed for a concentrated presentation together with elements of discrete mathematics, combinatorics, and concepts of program design, for students with a basic course in Fortran as background.
Computer simulation of mine rail haulage system
Authors: F. Hayashi, D. Robinson
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The operation of an underground coal mine haulage system has been simulated using SIMSCRIPT II.5 on the CDC Cybernet System. The software was developed using structured programming techniques and is composed of 19 interacting events and routines. The simulation program and some of the results to test various train configurations and dispatching strategies are described. Simultaneous movement of several trains, the operations of multiple load stations and the dump station, and their interactions are managed by this closed-system, event-oriented simulator. Dispatch decisions, such as timing and selection of train and destination are made on the basis of a user-selected strategy to optimize coal production.
Mini-computers in a social science instructional context
Authors: Ronald E. Anderson, Jonathan Gross
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Technological change is rapidly moving us into the age of the pocket computer, but in the early 70s we can be content to work with computers no smaller than typewriters. Little computers have long been popular in behavioral laboratories; only recently have they been seriously considered for broader purposes such as instruction or modeling. In this paper we will examine the factors behind the mini-computer phenomenon, explore the broad possibilities for sociological research/instruction, and describe a mini-computer social statistics package under development.
Manufacturing engineering and information
Authors: C. C. Zell
Venue: Proceedings of the 4th Design Automation Conference (1967)

This paper describes an operating computer-aided system (COMET), which processes Automated Wire List data into many forms required in manufacturing, assembly, installation and automated check out of electrical and electronic systems. The presentation presumes an operating Automated Wire List system and specifies some of the value benefits achieved at North American Aviation, Inc. The COMET description is presented from the viewpoint of Manufacturing Engineering as an interface communication link between Engineering Design, at the point of information generation, and those Production functions which must build and check out complex wiring systems using this same information. Description of the computer programming involved is not included.
A grey scale morphological approach for displaced frame difference coding
Authors: F. J. Hampson, J.-C. Pesquet
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

In image sequence compression schemes based on motion compensation, some new information contained in the displaced frame difference image must be coded. As this is expensive to transmit, it is important, particularly at low bit rates, to code only the most important information. We propose a segmentation algorithm based on morphological operations to extract the visually important regions of the displaced frame difference image. This segmentation is combined with a coding scheme which is automatically optimized for a given bit rate constraint. As demonstrated by examples, this method is well adapted to low resolution (QCIF format) sequences.
Two models of Innovation Diffusion
Authors: Tom W. Carroll, Gerhard J. Hanneman
Venue: Proceedings of the second conference on Applications of simulations (1968)

This paper describes two communication models which Simulate INnovation DIffusion (SINDI).* SINDI 1, a stochastic model, simulates diffusion of information to cliques in a small Latin American community. SINDI 2, an expected-value model, simulates the diffusion of the adoption of an innovation among members of a community. Both models are programmed in USASI FORTRAN because the language is widely understood and FORTRAN compilers are available on most computers.
Sorting on a multiple magnetic tape unit
Authors: Wallace Klammer
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

Various techniques have been devised for sorting on general purpose computers. Most of these utilize magnetic tape units since they are necessary for storing the large quantities of data handled. The obvious disadvantage of a magnetic tape reel system is the serial nature of the stored information. Once a number of records have been written, considerable time is required to locate the same records again. For this reason, the usual method of sorting via magnetic tape is a process of shuttling the information back and forth from tape to tape, obtaining larger and larger blocks of sorted information until the entire file has been sorted. The disadvantages here are apparent. The excessive handling of data is not only time-consuming but also prone to error. Another technique frequently used is a block sort on the highest-order digit of the sort key. The information is distributed to a number of tape units and later each tape is sorted down to the last digit. For efficient operation ten tape units are required, which adds considerable cost to the system.