ppxscal/embedding_network huggingface dataset:
Design of transaction-oriented systems employing a transaction monitor
Authors: R. A. Davenport
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

An increasing number of computer users are implementing an on-line facility with the aid of a transaction monitor program. This transaction monitor may be supplied either by the computer hardware manufacturer or by a software supplier. It is felt that the literature is inadequate in aiding such a user to implement his system. Consequently this paper sets out to achieve such an aim by presenting a methodology for the design of a transaction-oriented system employing a transaction monitor. The decisions to be made are outlined together with the choices available for each decision. The methodology is iterative in that a decision at any stage can have a significant impact on the final design and is also affected by previously taken decisions.
Necessary and sufficient conditions for convergence of the QR algorithm on Hessenberg matrix
Authors: Beresford Parlett
Venue: Proceedings of the 1966 21st national conference (1966)

The QR Algorithm was developed1 to find the eigen - values of real or complex matrices. We shall consider it here in the context of exact arithmetic. Sufficient conditions for convergence, listed in order of increasing strength, have been given.1,2,3,7 It seems that necessary and sufficient conditions would be very complicated for a general matrix.
An analysis of the resources used in the SAFEGUARD system software development
Authors: W. E. Stephenson
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The SAFEGUARD System represents the development of one of the largest, most complex software systems ever undertaken. Various types of software were developed, including real time applications, support, and hardware installation and maintenance. Two million instructions were developed at a cost of approximately five thousand staff years of effort. The objective of this paper is to document the staff resources utilized in this development. The actual development rates for the different types of software and the various factors affecting those rates are analyzed. Software productivity is shown to be a function of the type of software - logical, algorithmic, man machine, etc. Emphasis is placed upon total project productivity. The allocation of staff resources for the systems engineering, design, code and unit test, and integration activities, which had an approximate percentage distribution of 20, 20, 17, 43, is analyzed and characterized.
Comparative survey of database management systems on microcomputers
Authors: Gordon C. Everest, Christopher T. Lawrence
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

This paper presents the results of a survey of Database Management Systems (DBMS) available on microcomputer systems where the total cost of hardware plus software is less than &dollar;25,000. Most of the information was obtained from published materials and user manuals for the systems. The survey focuses on functional characteristics and physical requirements and limitations. None of the information is based on actual usage.
Performance of globally distributed networks
Authors: Stuart Wecker, Robert Gordon, James Gray, James Herman, Raj Kanodia, Dan Seligman
Venue: Proceedings of the Computer Network Performance Symposium (1982)

In the design and implementation of computer networks one must be concerned with their overall performance and the efficiency of the communication mechanisms chosen. Performance is a major issue in the architecture, implementation, and installation of a computer communication network. The architectural design always involves many cost/performance tradeoffs. Once implemented, one must verify the performance of the network and locate bottlenecks in the structure. Configuration and installation of a network involves the selection of a topology and communication components, channels and nodes of appropriate capacity, satisfying performance requirements. This panel will focus on performance issues involved in the efficient design, implementation, and installation of globally distributed computer communication networks. Discussions will include cost/performance tradeoffs of alternative network architecture structures, methods used to measure and isolate implementation performance problems, and configuration tools to select network components of proper capacity. The panel members have all been involved in one or more performance issues related to the architecture, implementation, and/or configuration of the major networks they represent. They will describe their experiences relating to performance issues in these areas. Methodologies and examples will be chosen from these networks in current use. There will be time at the end of the session for questions to the panel.
A concept paper on &ldquo;Host&rdquo; vs. &ldquo;Own&rdquo; data manipulation languages in military information systems
Authors: E. Raichelson
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

Although machine/program independent data description languages are difficult to achieve, there is no argument relative to the goals. This agreement as to goals is generally non-existent among those who seek to implement data manipulation languages (DML). The major issues in DML development manifest themselves in the entire spectrum of environment from usage to input/output processing. The SIGFIDET workshop is designed to address problems related to design and implementation of tools to allow logical definition of data, the mapping of this data to physical storage and the processing of data which has both properties, i.e., logical definition and physical residence. The papers presented in this session all address specialized aspects of the data manipulation problem.
Extending the relational database data model for design applications
Authors: Martin Hardwick
Venue: Proceedings of the 21st Design Automation Conference (1984)

In recent years many researchers have tried to apply the traditional database systems to design applications. To date, most of these experiments have been largely unsuccessful. Insufficient computing power may be one reason for this failure. However, the problem may be more fundamental. We believe the data models of the traditional database systems are intrinsically unsuited for design applications. In this paper we give reasons for this opinion and describe an enhanced relational model which removes some of the weaknesses we have identified.
A project-unified software engineering course sequence
Authors: James S. Collofello, Scott N. Woodfield
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

In this paper a sequence of software engineering courses based upon the software life cycle and integrated by a single, medium-size project will be described in detail. The courses will be presented from an educational point of view, emphasizing the topics covered as well as the logistics of teaching the courses. A comparison of these courses to other software engineering courses existing in university curricula will also be presented. The potential advantages for faculty, students, and the research community of this type of course sequence will also be enumerated.
Data abstraction: A static implementation strategy
Authors: James B. Morris
Venue: Proceedings of the 1979 SIGPLAN symposium on Compiler construction (1979)

A description of the implementation of the data abstraction mechanism for the Model programming language is discussed. The Model programming language utilizes a &ldquo;static&rdquo; approach to data abstraction in that abstract concepts are expanded by early phases of the compiler in a controlled fashion into base language concepts. Thus, the final phase of the compiler sees only base language constructions. Exemplified are generic procedures accepting parameters of several different data types. A discussion is given of the problem of &ldquo;parameter explosion&rdquo;, a problem traditionally inherent in languages implementing open (inline) procedures.
Tutorials for Ada
Authors: Richard T. Close
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

Ada is a modern high order programming language that has been developed by the U.S. Department of Defense for use in embedded computer applications. Such applications are typically large, volatile and long-lived. Facilities for such features as real-time and parallel processing, fail-soft execution, exception handling and the control of a wide variety of peripheral devices have been included in the language design. These features broaden the possible applications of Ada to such areas as process control, systems programming, scientific calculation, and commercial data processing. It is anticipated that Ada will be quickly adopted by DoD contractors and that it may also become the most popular computer language in general use because of its unique features and capabilities.
The Biomedical Computing Technology Information Center (BCTIC) sharing programs, data, and interface designs
Authors: Betty F. Maskewitz, R. L. Henne, W. J. McClain
Venue: Proceedings of the 1976 annual conference (1976)

In response to a recognized need to facilitate computing technology transfer in biomedicine, the Biomedical Computing Technology Information Center (BCTIC) was established by the Division of Biomedical and Environmental Research (DBER) of the Energy Research and Development Administration (ERDA) at the Oak Ridge National Laboratory in July of 1975. BCTIC forged ahead into the tasks of designing guidelines and procedures, acquisition and packaging of computer codes, data, and interface designs; building a bibliographic data base; and maintaining a directory of the user community. This paper presents the problems BCTIC has set out to solve, describes its functions, and categorically relates its functions to the stated problems. It also gives a progress report on BCTIC's developmental phase, and takes a look to the future of BCTIC as a national technology resource in biomedical computing.
NGPSS/6000: A new implementation of GPSS
Authors: Karen Ast, Jerry Katzke, Jim Nickerson, Julian Reitman Norden, Lee Rogin
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A version of the GPSS simulation language, compatible with GPSS V, has been implemented for the CDC 6000 series and is operational at the Naval Air Development Center. In addition, the design goals of NGPSS/6000 were thorough assembly debugging, reduced core requirements, decreased running time, unrestricted use of matrices, and language flexibility to allow flexibility for future enhancements. This implementation seeks to aid both the user unfamiliar with the language with more complete diagnostics; while enabling the experienced user to build very large-scale models and associated data banks. Provisions have been made for future language extensions toward real-time operation, on-line debugging, and a faster execution module for debugged models.
SIGMINI (Paper Session)
Authors: Malcolm G. Lane, Henry K. Hess, Carol A. Roberts, Ray Jakubek, Steve Silverstein
Venue: Proceedings of the 1976 annual conference (1976)

An intelligent key to disc data entry system, aircraft digital flight recorders and a peripheral processor controlling telecommunications equipment provide specific examples of bringing computer power to non-programmers, of defining potential mini/micro computer applications and of engineering mini/micro computer software.
Space-time tradeoff for answering range queries (Extended Abstract)
Authors: Andrew C. Yao
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

In this paper, we raise and investigate the question of (storage) space- (retrieval) time tradeoff for a static database, in the general framework of Fredman's. As will be seen, such tradeoff results also lead to lower bounds on the complexity of processing a sequence of m INSERT and QUERY instructions. The latter results are incomparable to Fredman's, since the presence of DELETE instructions was crucial for his proof technique. We will present our results in detail in the next few sections. Here we will only mention three main conclusions. Firstly, circular query is shown to be intrinsically hard in the sense that, for some static database with n records, there is a space-time tradeoff TS -&-gt; n1 + -&-egr; where -&-egr;-&-gt;0; in contrast, orthogonal query can always be implemented with space S-&-equil;0(n(log n)k) and time T-&-equil;0((log n)k) for fixed k. Furthermore, any algorithm for processing 0(n) INSERT and QUERY instructions must use time -&-Ohgr;(n1+-&-egr;) in the worst case. Secondly, for the -&-ldquo;interval-&-rdquo; query, we have determined the space-time tradeoff quite precisely to be T @@@@ -&-agr;(S,n), where -&-agr; is the inverse to an Ackermann's function first defined by Tarjan [9]. This is a rare case where the function -&-agr; arises outside the context of path compression, and is obtained through a totally independent derivation. Thirdly, we prove that, for the interval query, any algorithm to process a sequence of 0(n) INSERT and QUERY must take time -&-Ohgr;((n log n)/(log log n)) in the worst case. This means that one cannot hope to maintain the most efficient static data structure (with retrieval time -&-agr;(S,n)) in the dynamic case.
Towards a canonical form for computer programs
Authors: Robert E. Noonan
Venue: Proceedings of the 1975 annual conference (1975)

An approach to the mechanization of the certification of programs is the development of a canonical form for computer programs. Two programs would be declared equivalent, that is, for all inputs they produce identical outputs, if and only if they have the same canonical form. The nature of such a canonical form for computer programs is discussed. For a certain non-trivial class of programs, a methodology for producing the canonical form from the original program is developed, and the present limitations of this approach are explored. Finally, the methodology is applied to two different sort algorithms, demonstrating that these algorithms are equivalent since they possess the same canonical form.
Preattentive Reading and Selective Attention for Document Image Analysis
Authors: Claudie Faure
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

PixED (from Pixel to Electronic Document) is aimed at converting document images into structured electronic documents which can be read by a machine for information retrieval. The approach is based on the combination of perception and symbol reading which are the two processes involved when humans detect the organization of a document. "Pre-attentive reading" denotes the physical segmentation related to perceptual organization. "Selective attention" means that symbol reading is limited to specific sequences of symbols or to pre-attentively selected locations. An OCR provides the primary structured description of the document. PixED improves the quality of this description, completes the physical segmentation and adds a logical description. A distributed software architecture and an incremental strategy are defined to enable the integration of perception and symbol reading. The approach is tested on a set of documents composed of several pages which are gathered from proceedings of scientific conferences.
Turing award
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

ACM's most prestigious award, the A.M. Turing award, is given annually to the person deemed most deserving of recognition for his contributions to the field of computer science and engineering. The recipient is selected by a committee named by past presidents of the ACM and includes an honorarium of &doller;1,000. The 1972 presentation goes to Edsger W. Dijkstra, Department of Mathematics, Technological University, Eindhozen, Netherlands. Edsger Dijkstra was a principal contributor in the late 1950's to the development of ALGOL, a high level programming language which has become a model of clarity and mathematical rigor. He is one of the principal exponents of the science and art of programming languages in general, and has greatly contributed to our understanding of their structure, representation, and implementation. His fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations in the field of programming languages.
Modeling and Analysis using SAINT: A combined discrete/continuous network simulation language
Authors: David B. Wortman, Steven D. Duket, Deborah J. Seifert
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

SAINT, Systems Analysis of Integrated Networks of Tasks, is a network modeling and simulation technique developed to assist in the design and analysis of complex man-machine systems.* SAINT provides the concepts necessary to model systems that consist of tasks (discrete elements), state variables (continuous elements), and interactions between them. It facilitates the assessment of the contribution that system components make to overall system performance.
International passenger and baggage processing at Kennedy Airport
Authors: Rogers Lui, Ravinder Nanda, James J. Browne
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

A computer simulation model (written in GPSS) was developed to analyze passenger and baggage flow through the International Arrivals Building at New York's Kennedy Airport. Capacities and staffing at various federal inspection, baggage claim, and sky cap areas can be initialized before each simulation. Given any input schedule of flights, the program utilizes stored information on processing rates and walking times to provide queue statistics, waiting times and facility utilizations throughout the Arrivals Building as well as statistics for pre-selected individual flights. Results are being used to develop and evaluate physical and operational plans, especially as affected by the introduction of the new generation of larger aircraft.
Computer-assisted chart making from the graphic designer's perspective
Authors: Aaron Marcus
Venue: ACM SIGGRAPH Computer Graphics (1980)

It is important to improve the aesthetics and effectiveness of information graphics through greater awareness of graphic design as a visual communication discipline. Chart making is one subject area in which graphic design awareness can be enhanced. Basic design principles are reviewed which are relevant to creating better charts. Examples demonstrate improvements.
Management oriented documentation of simulation
Authors: Val Silbey
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Simulation documentation for management is the written report that describes what a simulation does. It acts as a communications medium between the simulation modeller and the recipient of the report. The major problem with most management reports is the level of difficulty that reader faces. Wading through paragraph after paragraph of turgid prose makes a management report difficult to read. This problem can be overcome by careful attention to the rules of good technical writing. It is best handled by a documentation specialist rather than the simulation modeller, because the skills required for clear documentation are different from the skills required to design and program a simulation. Management oriented documentation is oriented toward the presentation of conclusions and recommendations. It will add about 10% to the cost of a simulation project. But without good documentation the project may be wasted.
The computation and application of vector congruence classes
Authors: Zavdi L. Lichtman
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In a similar fashion to the partitioning of the integers into residue classes, integer spaces (finitely generated free Z-modules) can be partitioned into complete or incomplete vector congruence classes. Complete vector congruence classes are computable by an application of the Smith normal form. The problem of computing efficiently incomplete vector congruence classes is discussed and a few methods are suggested. The application of complete and incomplete vector congruence classes is in performing set-theoretic operations on integer spaces. All set-theoretic operations can be performed on integer spaces which partition into complete vector congruence classes. Some set-theoretic operations can also be performed on integer spaces which partition into incomplete vector congruence classes, but not always in a satisfactory manner.
Extraction of slant character candidates from maps using circular templates
Authors: O. Shiku, A. Nakamura, M. Anegawa, H. Takahira, H. Kuroda
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

The paper proposes a method for extracting slant characters from complicated background figures efficiently and rapidly. In this method, slant character candidates are extracted using the black pixel density features, that is, matching rate of two different sized circular templates, which are inscribing and circumscribing a target character, with an original image. In order to estimate performance of the proposed method, the method was applied to 41 topographic map images (512/spl times/512 pixels) involving 1032 slant characters. As a result, the average number of character candidates per character was reduced to about 41 candidates, and 94.3% of 1032 slant characters were extracted correctly.
Four directional adjacency graphs (FDAG) and their application in locating fields in forms
Authors: Jianxing Yuan, Y. Y. Tang, C. Y. Suen
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

A new non-hierarchical spatial data structure named four directional adjacency graphs (FDAG) is proposed. In the FDAG vertical and horizontal neighborhood relationship between rectangles is well represented so that structural information can be easily extracted. An application for structural analysis of forms is given, where experiments are conducted with positive results.
The Microprogrammable Multi-Processor (MMP) system for simultaneous emulation of interoperating computer systems
Authors: Roy Mattson, Alan Salisbury
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

A Teleprocessing Design Center (TDC) has been established within the Communications/Automatic Laboratory of the US Army Electronics Command (ECOM) at Fort Monmouth, New Jersey, for the purpose of supporting experimentation in developing and validating Army Tactical Data Systems (ARTADS) configurations. The TDC is collocated within the Communications/Automatic Data Processing Laboratory with the Communications System Design Facility which includes circuit and message switching systems, systems and technical control facilities, and transmission media. The heart of the TDC is the MMP system which will provide the capability of simultaneously emulating up to two interoperating ARTAD systems. This paper describes that system, including the hardware and key software modules, and provides a detailed look at its use in emulating one of the ARTAD systems, namely the Tactical Fire Direction System (TACFIRE). Of particular interest is the system nature of this emulation, since not only the processor itself, but each and every one of the diverse peripheral units will be emulated.