ppxscal/embedding_network huggingface dataset:
Using Ada for industrial embedded microprocessor applications
Authors: A. G. Duncan, J. S. Hutchison
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

This paper investigates the use of Ada as a high level implementation language for use on microprocessors embedded in industrial applications. Many of these applications use microprocessors with minimal hardware, that is, no hardware support for a stack and possibly not even a hardware clock. The use of minimal hardware is dictated by manufacturing economics. If one can save $.25 per unit over a run of 100,000 units, the total savings will be $25,000. An Ada implementation for such hardware will differ greatly from an implementation for a large mainframe. For instance, the storage allocator cannot blithely allocate space for variables in activation records. While these programs do not use many of Ada's powerful language features, the compiler must be able to generate highly optimized code for those parts of the language that are used. Our discussion of Ada centers around a typical application, a program to control an automatic oven. While this example is not one of our intended applications, it embodies most of the problems that we expect to find in practice. The example was inspired by McCracken's furnace control case study [1], written in PL/M, and provides a good opportunity for comparing Ada with PL/M. Applications like the oven control program require a number of sophisticated compiler optimizations. In addition to performing the usual common subexpression analysis, removal of redundant and unreachable code, and sophisticated peephole optimizations, the compiler must be capable of complete static allocation of all data and must be able to perform significant amounts of verification to simplify generated code, especially with respect to error checks and exception handling. Finally, we discuss some language problems and some pragmas that we feel are necessary for use of Ada in real-time and time-dependent situations.
Documentation production from a formal database
Authors: Christopher Hartsough, Yuzo Yamamoto, E. David Callender
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

This paper reports on an existing, operational prototype system, TG/TF2, for the generation of typeset quality documentation from a formal database. TG/TF2 directly supports the conceptual separation of system design, document content design, and document format design. Specifically, support for system design is supplied by Problem Statement Language/Problem Statement Analyzer (PSL/PSA), a development of the ISDOS Project at the University of Michigan. Document content design support is provided by the Text Generator (TG) language system. Text Formatter, Version 2 (TF2) supports document format design. TG is a programming language system specifically tailored for accessing a PSL/PSA database. TG supports document content design through an outline facility that allows the specification of both the order and conceptual content of each section of the document. TF2 provides typeset quality output from the text generated by TG. Though similar in flavor to most &ldquo;pretty printer&rdquo;/RUNOFF programs, TF2 has been tailored to the requirements of automatic document production without human intervention. The paper describes the improvements needed in both concept and implementation before the prototype system can be made into an operational tool. The motivation, genesis, and conceptual basis of TG/TF2 are treated, not the details of the software.
Two-stage recognition of freight train ID number under outdoor environment
Authors: Jeong-Hun Jang, Jeong-Hoe Ku, Ki-Sang Hong, Jae-Ho Kim
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

In this paper we present a two-stage classifier for the recognition of freight train ID numbers under outdoor environment. This kind of recognition is different from ordinary OCR in that images of numerals are usually corrupted by "noises" caused by dirty materials, varying outdoor illumination, and so on. We focused our attention on developing a robust classifier against such noises. The two-stage classifier is constructed by cascade connection of a main classifier and an auxiliary classifier. Since ID numbers are printed with relatively small size and shape variations, we adopted a template-matching technique in the main classifier. Three top-scored candidates from the main classifier are given to the auxiliary classifier which consists of 10 expert neural networks. These neural nets exploit local characteristics of each numeral. We collected several hundreds of sample images to test our algorithm, and some promising results were obtained.
The design of a multi-microprocessor based simulation computer - I
Authors: John Craig Comfort
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

A discrete event simulation computer based on a network of microprocessors is being developed at Florida International University. This paper contains a description of the simulation models used thus far in the development process and results obtained from them. A system using a PDP-11 as the principal processor and a Motorola M68000 as an event set processor has been implemented. Results from the performance of this system are presented, and plans for further development are discussed.
Quantifying the test effectiveness of Algol 68 programs
Authors: M. A. Hennell, D. Hedley, M. R. Woodward
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

In this paper we describe how a software testbed is used to determine the quality of testing of Algol 68 programs. The system monitors the execution of an Algol 68 program and obtains a run-time execution history. This history is then compared with the results of a static analysis and three levels of testing are calculated. The third level is an extension to Algol 68 of a method originally devised for analysing Fortran IV programs. The system has been used extensively in the coordination stage of the NAG Algol 68 numerical algorithms library and we quote some results obtained from an analysis of stringent tests on these library routines.
The initial transient in steady state simulation (Panel Discussion)
Authors: George S. Fishman, Lee W. Schruben, W. David Kelton, Peter D. Welch
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper presents a perspective on the initial transient problem in steady-state simulation. In particular, it enumerates five generally accepted facts: 1) Conditions prevailing at the beginning of a simulation influence sample paths. 2) The extent of influence is a function of the strength of autocorrelation. 3) Some initial conditions are less detrimental than others are. 4) Truncation reduces bias but usually increases variance. 5) So far no complete solution exists. The remainder of the paper describes a proposal for solving the problem. It relies on the relatively weak assumption that the conditional means in a stochastic process of interest are related linearly. An estimator of the steady-state mean is described which has considerably less bias than one can achieve via conventional trunction. An interval estimator is also described which follows from standard regression theory. A test for residual bias is presented which enables a user to judge whether or not sample data meet the minimal requirements for the proposed technique to apply. A second test allows a user to judge whether or not a more efficient estimation technique can be used.
Automated testing of protocol specifications and their implementations
Authors: H. Ural, R. L. Probert
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

A highly automated approach is proposed for validating the consistency of distinct representations of an identical software functionality. This approach is based on checking whether the observable behaviors presented by software functionality representations given in different levels of abstraction are consistent with one another. These representations are encoded in a relatively mechanical way as procedures in sequential PROLOG, a very high level language. The approach is extremely flexible, straight-forward to use, and particularly appropriate to layered protocol architectures. As well, the approach leads to more reliable and less tedious, less error-prone test harness construction and maintenance. A number of variations and extensions of the approach are given. The use of this approach is illustrated in the context of communication protocols design and evaluation.
Graphics for effective management decision making
Authors: Michael W. Taylor
Venue: Proceedings of the ACM 1980 annual conference (1980)

This presentation will address two major areas of interest. First , the question &ldquo;why graphics?&rdquo; will be addressed. Information will be presented on how graphics can assist in the decision-making process; which areas of analysis can most benefit from the use of graphics; types of graphs; and uses of color. User examples will be given. Secondly, an overview of the components of a computer graphics system will be given.
A color graphics system for I.C. mask design and analysis
Authors: N. Weste
Venue: Proceedings of the 15th Design Automation Conference (1978)

In view of the continuing requirement for good interactive tools in the area of computer aided design, an advanced high-resolution monochrome and color, mini-computer controlled, graphics display has been designed and built. Considering the particular area of integrated circuit mask design, the ability to produce filled, color coordinated shapes extends the designer's interpretation of displayed layouts to a level not previously available with conventional graphics displays. Apart from this welcome improvement in interpretation, the hardware structure of the display provides the system designer with a tool which is potentially far more powerful than existing displays. This factor has been used to implement a comprehensive system to design MOS IC layouts in a detailed manner at the device level. A resulting program is described which is capable of deriving the node table, transistor parameters and parasitic effects for a MOS circuit displayed on the graphics monitor. The output format of this program is in a form suitable for direct input to a general circuit analysis program. The algorithms which use a topological mapping approach are shown to have possible execution time benefits over previous methods while maintaining the overwhelming advantage of user interaction. The relationship of this approach to more automated systems is also treated.
Communication protocols in a network context
Authors: André A.S. Danthine, Joseph Bremer
Venue: ACM SIGOPS Operating Systems Review (1975)

In a distributed computers network based on a packet-swltched communication subnet, it is possible to describe the system as a hierarchical structure. We will consider here only three levels: -level 0: communication between nodes of the subnets. -level 1: communication between hosts connected to the net. -level 2: communication between users processes (subscribers) in different hosts. At each level, the communication is based on a protocol and the data structures to be exchanged are different. For instance the data structure exchanged at level 2 may be a sequential file. As there is no direct support of communication at this level, it is through the mechanisms of level 1 and 0 that the transfer will take place with data structure at each level not directly related to the upper level one. The complete definition of the system will therefore required not only the level 0, 1 and 2 protocols, but also inter-level protocols. In the following, we will concentrate on the level 1 protocol. It is the basic communication protocol of a network since it will be used by user processes in different hosts and it will use the subnet as a communication support. This level 1 entity is called a &ldquo;TS&rdquo; (transport station) in CYCLADES [13] and a &ldquo;TCP&rdquo; (transmission control program] in [2].
Computer chess panel - 1983
Authors: Benjamin Mittman
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

This year's ACM Annual Conference will host a unique event in the United States, the Fourth World Computer Chess Championship. ACM began sponsoring computer chess tournaments in 1970. The first world championship was held in Stockholm in 1974. Subsequent world championships were held in Toronto in 1977 and in Linz, Austria in 1980. One popular activity at ACM tournaments has been a panel discussion among the computer chess authors. This year, since the ACM is hosting the World Championship, the panel will include participants from the U.S. and Europe. We hope to hear from the authors of the three former World championship chess programs, KAISSA from the Institute for Systems Science in Moscow (1974), CHESS 4.6 from Northwestern University (1977), and BELLE from Bell Labs (1980). In addition, this year's tournament and panel will feature authors of microcomputer chess programs as well. Some of the questions to be discussed will be: Has the chess playing strength of the programs reached a plateau? Will research into &ldquo;expert systems&rdquo; migrate into the development of better chess programs? What is being done to use the 32-bit micros in chess programming? What about the &ldquo;super&rdquo; computers? We urge the audience to come prepared with questions, since these panels have elicited lively discussions in the past. This year should be no exception.
Concurrent error detection in VLSI interconnection networks
Authors: W. Kent Fuchs, Jacob A. Abraham, Kuang-Hua Huang
Venue: ACM SIGARCH Computer Architecture News (1983)

Comprehensive VLSI fault models are proposed for three broad classes of interconnection networks between multiple processors and multiple memory modules. System-level algorithms are given for concurrent detection of errors produced by these faults during the normal use of the networks. The proposed algorithms are shown to be applicable to the three classes of interconnection networks with minimal changes in their classical design. The algorithms are appropriate for the broad classes of permanent and transient faults predominant in dense VLSI and wafer-scale integration with a minimal amount of network redundancy required for implementation.
The effects of limited grammar on interactive natural language
Authors: James A. Hendler Paul Roller Michaelis
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

What is the best way for novice users to interact with computers? Three alternatives that are generally offered are: menu selection, query languages, and natural language. In menu selection, the user chooses from a set of preprogrammed options by entering an associated key. This technique has the advantage of placing a minimal parsing burden on the computer. However, for certain applications, such as conversational interaction, menu systems are inadequate because they severely limit the strategies available to the user. Query languages are special sets of designed specifically for interaction with the computer. They place a greater parsing burden on the computer, and are somewhat less limiting to the user. However, they suffer from human factors problems in that they are often very difficult for the user to learn (Reisner, 1981).
Transient diffusion approximation for some queuening systems.
Authors: Andrzej Duda
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

There are many situations where information about the transient behaviour of computer systems is wanted. In this paper a diffusion approximation to the transient behaviour of some queueing systems is proposed. The solution of the forward diffusion equation on the real positive line with the elementary return barrier having almost general holding time distribution provides the approximation for the GI/G/1 queue. The solution of the diffusion equation in a finite region approximates the transient behaviour for the two-server cyclic system and gives approximations for the first overflow time in the GI/G/1/N system and for the maximum number of customers in the GI/G/1 system. Also the approximation for the busy period of the GI/G/1 system and of the two-server cyclic system are presented.
A new aggregation approximation procedure for solving closed queueing networks with simultaneous resource possession
Authors: Darral J. Freund, James N. Bexfield
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

A new aggregation approximation procedure is presented for analyzing single class closed queueing networks with simultaneous resource possession. It is applicable to multiple entry systems such as I/O models and relies on a new multi-entrance queue to aggregate the subnetwork with simultaneous resource possession into a variable rate queue. The resulting network is solved using conventional product form techniques. The multi-entrance queue has a service rate function that depends on the utilization of the primary resources of the subnetwork which enables calculation of the delay due to queueing for a specific resource, even when others are available. It has a product form solution, different from the solution currently known. A major advantage of the procedure is that the aggregation can be reversed to obtain estimates of low level performance parameters once the solution is obtained. A solution algorithm is presented along with two examples. Results are compared with simulation models.
Kraft storage and access for list implementations(Extended Abstract)
Authors: Donna J. Brown
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

This paper is part of an investigation into efficient ways of implementing variable-length lists (see Brown [1]). Storage and access optimality are discussed from an information-theoretic viewpoint; in particular, we develop the notions of Kraft storage and Kraft access (see Elias [4]). Our attention here is restricted to the implementation of questions of the form: &ldquo;What is the ith element in the list?&rdquo; We derive consequences of achieving Kraft storage and/or Kraft access and then examine some common implementation schemes. In this abstract we shall give only an informal discussion of some basic concepts and results.
The management of information in political campaigns hypothetical case&mdash;SIGCAS (Session Abstract)
Authors: Walter Maner
Venue: Proceedings of the ACM 1980 annual conference (1980)

The distinguished Senator Polly Facets is an active candidate for president of the United States. As part of her advertising campaign, she hires the Washington firm of Hamilton and Staff to help her tailor her message to particular audiences. This sophisticated data processing firm, given publicly available census tract data and current city directory (&ldquo;Polk&rdquo;) data, can produce information about individuals through use of &ldquo;statistical disclosure&rdquo; algorithms. Senator Facets, for example, recently had prepared a list of the citizens of Peoria broken down by name, address, and any one of approximately forty different sociopolitical categories. Based on this list, the consultant firm of Cragan and Shields then used computer generated norms for these categories to prepare forty different form letters containing forty different political pitches. No one letter told the whole truth about Senator Facets' platform. Instead, each letter told its select audience only about those parts of her platform that it (the target audience) was known to favor. The correlations between Senator Facets' platform and the forty sociopolitical categories were supplied in a separate computer study.
The design and programming of a display interface system integrating multi-access and satellite computers
Authors: D. T. Ross, R. H. Stotz, D. E. Thornhill
Venue: Proceedings of the 4th Design Automation Conference (1967)

This paper describes a system for providing mixed graphical and verbal communications with a multi-access computer via a satellite computer with a display. We assume that such an arrangement is necessary to satisfy an on-line user's large-scale computation and storage requirements economically, and to provide graphical facilities at remote terminals. The general-purpose Display Interface System, parts of which reside in each machine, acts as an interface between the user's programs and the display terminal. It provides means for communication as well as system functions required in each machine. Since it is general purpose, and no user will require all the features it provides, the software exists in the form of system libraries from which a user may select an appropriate subset for his particular application. The user's interface with this system in each machine is intended to be hardware independent
Design of a Visual Environment for Evaluating and Customizing Medical Image Compression Techniques
Authors: A. Signoroni, A. Bianchi, P. Mussio, R. Leonardi
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper discusses the design of the Image Compression Laboratory (ICL), a visual environment supporting radiologists in interactively compressing medical images still maintaining the diagnostic information. In ICL lossy image compression techniques and interactive image interpretation approach are merged following the Cooperative Visual Environment approach. In this way the radiologists themselves can perform the compression only relying on their professional skill and knowledge.
Execution control and memory management of a Data Flow Signal Processor
Authors: Klaus Kronlöf
Venue: ACM SIGARCH Computer Architecture News (1983)

The architecture of the Data Flow Signal Processor (DFSP) is discussed with the emphasis on its control mechanism. It is argued that the data flow principle can be efficiently applied to block processing operations of nonrecursive DSP computations, when shared data structures are avoided. Simulation results involving the optimal operand size and the memory use of the control section are presented. Due to the expandability and convenient programmability of the DFSP architecture, the range of its potential applications extends beyond signal processing as demonstrated by a DFSP based database machine.
A system for algorithm animation
Authors: Marc H. Brown, Robert Sedgewick
Venue: ACM SIGGRAPH Computer Graphics (1984)

A software environment is described which provides facilities at a variety of levels for &ldquo;animating&rdquo; algorithms: exposing properties of programs by displaying multiple dynamic views of the program and associated data structures. The system is operational on a network of graphics-based, personal workstations and has been used successfully in several applications for teaching and research in computer science and mathematics. In this paper, we outline the conceptual framework that we have developed for animating algorithms, describe the system that we have implemented, and give several examples drawn from the host of algorithms that we have animated.