ppxscal/embedding_network huggingface dataset:
Mechanical construction of type-checking predicates for extensible data types
Authors: Clifford R. Hollander
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The intent of this paper is to propose a simple mechanical procedure by which type checking predicates can be constructed for extensible sets of data types. Type checking under these circumstances is nontrivial because the potentially infinite (or at least very large) number of types makes it impossible (or at least very expensive) to encode type information into a fixed length tag that could be associated with each data item. To give substance to the discussion, the proposal is developed in terms of several basic data types and constructors for recursively defining aggregate data types of arbitrary structural complexity. A predicate for an aggregate type is defined in terms of the predicates for its various constituent types. It is hoped that the procedure discussed here could be exploited in a type-checking mechanism for any environment in which new data types can be synthesized out of existing ones.
The reallocation of sequential regions of non-uniform size
Authors: Carter Bays
Venue: Proceedings of the ACM annual conference (1973)

A monte-carlo simulation was utilized to determine the best values for the reallocation coefficients that are associated with the modified real-location algorithms1 whose original versions are given by Garwick and Knuth.2 Various distributions of region sizes were dynamically created during the insertion-deletion process, and the optimum real-location coefficients were found. Then the distributions were changed in the midst of the insertion-deletion process, and a different set of optimum coefficients were discovered. Global overflow was assumed to occur at 3 to 5 percent memory remaining, which is optimum.1 To smooth out the simulation, 30 runs were made at each global overflow point, with overflow points occurring at .5 percent intervals. Ten regions were used, and l000 total words of storage were allocated to all of the regions. The simulation was run on the 360/65 at the University of South Carolina, and required 15 hours of CPU time.
Data base processor mage
Authors: G. Berger Sabbatel
Venue: ACM SIGIR Forum (1980)

In this paper, we present the design of data base processor MAGE. This DBP is based on a hierarchical DB access method. It is composed of two microprocessors, a disk processor and a moving head disk. The processor requirements, design decisions, and architecture are discussed. We start with an overview of DBP framework. The MAGE DB access method is then summarized. Finally, we present the design and implementation of the DBP, with a particular emphasis on the disk processor.
A language implementation design for a multiprocessor computer system
Authors: P. Hibbard, A. Hisgen, T. Rodeheffer
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Theoretical and experimental results have indicated that automatic decompositions can discover modest amounts of parallelism. These investigations have tended to ignore the practical problems of language run-time organization, such as synchronization, communication, memory organization, resource management, and input/output. This paper describes a language implementation effort which combines the investigation of implicit and explicit parallel decomposition facilities with the practical considerations of system organization on a multiprocessor computer, Cm*.
Two misconceptions about structured programming
Authors: Peter J. Denning
Venue: Proceedings of the 1975 annual conference (1975)

For some time I and others have been exhorting promoters of 'structured programming' to define what they mean by it. To my delight this has been happening more and more frequently. Yet, as they pen their definitions, many writers are revealing their ignorance of the basic issues to which Dahl, Dijkstra, Hoare, Knuth, Wirth and others have attempted to draw our attention when discussing 'structured programming' [11, 14, 22, 23, 30, 31]. Two misconceptions in particular have been turning up with alarming frequency.
A powerful microprogram control unit - the 6700
Authors: Clive Ghest
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

The Monolithic Memories 6700 (MCU) is a powerful Microprogram Control Unit or Sequencer which can be used either as the control element in a system incorporating the MMI 6701 Microcontroller, or as a stand alone sequence controller in non-arithmetic applications. The MCU is used with standard Random Access Memory RAM, ROM, or P.ROM, with a portion of the memory output providing information required by the MCU and the remainder used to provide the signals necessary for the 6701 and peripheral logic circuits.
Workplace impacts&mdash;ai and automation: Privacy and accountability of large-scale high-capacity personal data systems
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This session will focus on the problems for information policy in a democracy raised by new fifth generation computer technology. Panelists will discuss the theoretical role of information technology in a democracy and the special problems of accountability and privacy. The possibility of new regulation and legislation will be discussed, as well as the development of new techniques by the executive branch such as matching and data bases.
Solid modeling (Panel Session): A user perspective
Authors: Carl Machover, Carl Vogel, Donald R. Witte
Venue: ACM SIGGRAPH Computer Graphics (1983)

In the past few years there has been a lot of interest and excitement generated by solid modeling. Numerous papers have been presented on the value and benefits of this technology. Many talented individuals have contributed to the state of the art. Solid modeling has played a larger role at SIGGRAPH in the past three years, with tutorials, panel discussions and technical papers. All this material has been presented for the most part by academics, researchers and developers of solid modeling systems. The users of solid modeling systems have yet to be heard from. The reason is that there have been very few of them out there in the past. However, that situation is slowly changing. Now that several CAD/CAM vendors are marketing solid modeling systems, a small cadre of users does exist. This panel will be composed primarily of users of solid modeling systems. They will discuss topics of interest to potential users (and also developers) of solid modelers. Questions to be addressed include: What is the status of solid modeling systems from a user standpoint? Can the present solid modelers be used in a production environment today? Should a solid modeling system replace the present wire frame and surface systems or be integrated with them? What are the problems associated with using a solid modeling system? How good is the user interface? Does the necessary application software exist? The primary intent of this Panel discussion is to give the potential user some idea as to whether the available solid modeling systems are useful for his applications. It is beginning to look like the next generation CAD/CAM system for mechanical design will be a solid modeler. The big question is &ldquo;when will this occur?&rdquo;
The computer science M.S. graduate
Authors: Malcolm H. Gotterer, Bruce H. Barnes
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

In this paper we discuss a survey recently completed of graduates of Penn State who earned the M.S. in Computer Science degree. The purpose of this survey was to permit an evaluation of the effectiveness of the curriculum in preparing students to meet the job requirements of their employers. Of equal importance was the former student's evaluation of the program after having had a period in which to reflect. In this paper we report some of the more important findings of the survey.
A modular introductory computer science course
Authors: Herbert L. Dershem
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The structure of a modular introductory course in Computer Science is described. Two types of modules are offered, lecture and language, over three time periods. Students enrolled for the course complete three lecture and three language modules. Each student chooses modules which match his or her interests and background. In this way the course provides a useful alternative for all students on campus.
Computers and ethical judgment in organizations
Authors: Abbe Mowshowitz
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper is concerned with the effects of computer technology on the exercise of ethical judgment in organizations. It is a study in descriptive ethics that seeks to identify and analyze organizational features that enhance or inhibit the making of ethical judgments. Computers occasion changes in the structure and functions of organizations, and thus may alter the conditions under which ethical judgments are made. After a brief survey of the effects of computers on organizations, a scheme for analyzing ethical conduct is presented. The paper concludes with a detailed example of the use of the concepts introduced.
Cross-impact simulation of an emerging industry: The case of Data Processing
Authors: Paul H. Rosenthal, Paul Gray
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

Emerging 'High Technology' and 'New' industries present complex forecasting problems since their growth patterns are correlated to GNP growth, to nominal improvements in cost/performance from routine R D, and to potential innovations or policy interventions. This paper describes the application of the USC Center for Future Research INTERAX System to forecasting the size and structure of Data Processing Industries. Results indicate that some proprietary planning organizations may be factoring into their forecasts subjective probability-based estimates of the impact of technology innovations on product cost/performance and industry sales. The emerging industry simulation methodology is data-driven, thereby permitting rapid definition of industry structure and derivation of elasticity/substitutability coefficients by tuning the model to historic or short-term forecast data.
A computer aid for Schenkerian analysis
Authors: Stephen W Smoliar
Venue: Proceedings of the 1979 annual conference (1979)

This is an account of an attempt to incorporate the computer into research in music theory. The approach to music theory has been heavily influenced by the writings of Heinrich Schenker. However, Schenker's theories have not been followed strictly. Rather, they have served as a launching pad for a theoretical approach to music which is highly compatible with computer programming. This application of the computer differs considerably from past computer-oriented music-theoretic research. In particular, all computations involve symbolic list processing and are therefore quite removed from both those programs which compile reams of statistics or those which scan long strings of characters meant to encode a musical score [4].
Comparative performance of COBOL programs on mini vs. large computer systems
Authors: Paul J. Jalics
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

The comparative performance characteristics of COBOL programs in a small versus large computer systems are investigated. The vehicle consists of a set of synthetic benchmark COBOL programs, each measuring a particular aspects of COBOL programs; and in addition a large actual COBOL program. Measurement of the CPU execution time and the elapsed clock time for various COBOL computations, data manipulation, and input/output is made on both a large scale computer (IBM 370/158) and a minicomputer (Texas Instruments TI980). Results of a number of such experiments are presented and comparisons made between results gotten from the two systems.
The method of lines for the numerical solution of partial differential equations
Authors: Niel K. Madsen
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

The numerical solution of time dependent nonlinear partial differential equations is a complicated and nontrivial process. Generally speaking, the solution of slightly different types of partial differential equations has required the development of separate and different computer programs. This situation for partial differential equations is in direct contrast to that for ordinary differential equations. Recently, sophisticated and reliable computer programs for the automatic solution of nonlinear systems of ordinary differential equations have become available. The use of the method of lines approach for solving partial differential equations is an attempt to take advantage of these recent significant developments for ordinary differential equations. In this presentation we will compare the advantages and disadvantages of this approach. We will describe how the method of lines approach for solving PDE's allows one to be able to develop very general purpose computer software for solving broad classes of problems. The structure and use of this software will be described. Finally, numerical results obtained with this general purpose software will be presented and discussed.
A method for table structure analysis using DP matching
Authors: Y. Hirayama
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper presents a novel method for table structure analysis. Many documents have table areas, and some have both table and figure areas. It is very important to be able to classify table and figure areas automatically. Furthermore, in tables, the column and row in which a character string is located are very important pieces of information. To detect and analyze table areas, the following method is applied: First, areas that may contain tables or figures are distinguished from text areas by the presence of horizontal and vertical lines. Next, the areas are assumed to be table areas and are analyzed as such. A judgment is made on whether each of the areas can in fact be a table area or not; in this way, the actual table areas are detected. Finally, the structures of the areas are analyzed and character strings in the areas are arranged by using the DP matching method. This method was applied to sixty-five pages of Japanese technical papers, magazines, manuals for software programs, and pages including 34 table areas, 48 line drawing areas, and 35 image areas. As a result, 96.6 percent of the areas were detected correctly and 91.7 percent of the tables were analyzed and arranged correctly.
Steps toward an APL compiler
Authors: Clark Wiedmann
Venue: Proceedings of the international conference on APL: part 1 (1979)

Compilation of APL programs could yield a dramatic improvement in performance for some kinds of programs, provided that the compiler could simplify the processing to the actual requirements of the particular algorithm. Other optimization approaches have been unable to achieve the performance improvements that seem to be possible. Compilation aided by declarations has been demonstrated, but it is undesirable to require declarations if most of the information they contain can be deduced by inspection of the program. Certain changes and restrictions to the language would make such deduction feasible by simplifying the analysis of control flow and removing apparent interfaces between programs that are not actually used as interfaces. Some of the proposed language changes are regarded as improvements because they facilitate deductions about programs by humans and therefore contribute to program readability and reliability. The other restrictions are inconvenient when debugging a program, but the impact is minimal because compilation of APL would be appropriate mainly for production programs that already have been tested.
Recovery of on-line data bases (Panel)
Venue: Proceedings of the 1971 26th annual conference (1971)

There has been much publicity lately about the difficulties associated with data processing systems.Customers complain that it is almost impossible for them to correct what they think are mistakes in bills sent to them by a data processing installation. Another aspect of data processing installations, which is just as important, is how to maintain files in an environment where errors can be generated by hardware or software failures. This brings up the subject of check point/restart or rerun point/recovery. Different people in the industry use different terms, however the meaning is: how to establish enough information at various times so that if a mistake is detected after that time, files can be reconstructed by returning to that time. Information on how to apply recovery procedures can usually be found in the manuals supplied by the manufacturers of software. However these are generally not available in technical libraries. The information available in the public literature is very sparse. Reference 1 gives some indication of how to recover when using tape files. Reference 3 gives some indication of how to recover when using direct access files. References 2 and 4, in describing their data processing systems, barely mention the fact that included in their system are recovery procedures.
An implementation of ECL data types
Authors: Benjamin M. Brosgol
Venue: ACM SIGPLAN Notices (1971)

The data-type definition scheme in ECL is designed to furnish its users with a natural notation, in which the composition and behavior of complex objects can be readily described, and which simultaneously produces efficient underlying representations. The purpose of this paper is to discuss how these objectives are met in the implementation of ECL on Harvard's PDP-10. Section II outlines the fundamentals of data definition in ECL. For a full discussion of the ECL programming system and its language component, the reader is referred to [1], [2], or [4]; an overview of the system is presented in a companion paper by Wegbreit [5]. A complete description of ECL's data extension mechanism is given in [1] and [3]. Section III presents the main features of the implementation of the ECL data definition scheme, discusses the &ldquo;mode compiler&rdquo;, analyzes the internal representation chosen for data objects, and describes the efficiencies resulting from this representation. Finally, section IV deals with some of the interfaces between the data extension mechanism and the rest of the ECL system, and section V proposes some areas where further research would be useful.
Cyclic composite multistep predictor-corrector methods
Authors: Eldon Hansen
Venue: Proceedings of the 1969 24th national conference (1969)

Multistep predictor-corrector methods are commonly used for the numerical solution of ordinary differential equations. In its simplest form a k-step method with accuracy of order exceeding k + 2 is unstable. Methods such as those of Gragg and Stetter and of Butcher obtain high accuracy while retaining stability. However, the price paid is additional evaluation(s) of the function f(x,y) occurring in the differential equation y' &equil; f(x,y). In this paper, we consider composite methods using M different correctors applied cyclically. We show that a composite method with accuracy of 2k - 1 can be stable and entails no additional computation.
Activities of the DOE Advanced Computing Committee Language Working Group
Authors: Rondall E. Jones
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

The Language Working Group is a technical arm of the DOE Advanced Computing Committee. The purpose of the Group is to work toward providing a compatible Fortran environment at the ACC sites. A brief history of the efforts of the Group is given, and the general features of the language the group will recommend are discussed. This language is a multi-level Fortran with Fortran 77 as the core.
Interactive graphics enhancements for information retrieval systems
Authors: Wayne D. Dominick, Benjamin Mittman
Venue: Proceedings of the ACM annual conference (1973)

Comprehensive graphics enhancements are proposed for information retrieval systems to facilitate interactive plot generation,1 modification, manipulation and analysis. Capabilities include dynamic axis scaling, text insertion/deletion, display of plot description, relations, selected data point values and saving/re-calling plots. Controlled by &ldquo;self-adjusting&rdquo; graphics software, the package will provide various interactive options dependent upon user-accessing device. Graphics terminal access will enable menu displays of light pen options whereas teletype or non-graphics CRT access will imply standard keyboard entry commands. This generalized approach should provide maximum utility for the user community, with the graphics package adjusting itself according to the hardware capabilities of the online terminal used for accessing the system.
Flow graph analysis using linear connected regions
Authors: William C. Nylin,  Jr.
Venue: Proceedings of the 1976 annual conference (1976)

The concept and properties of the basic code block are extended to a generalized code region whose control flow graph can be entered at only one node and exited at only one node. Algorithms are given for the determination of all such regions in a program and the associated data flow information. Also, some applications of these regions to global optimization and code motion are discussed.
The analysis of double hashing(Extended Abstract)
Authors: Leo J. Guibas, Endre Szemeredi
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

In this paper we analyze the performance of a well known algorithm known as double hashing [Knuth]. In this method we probe the hash table along arithmetic progressions, where both the initial element and the increment of the progression are chosen randomly and independently depending only on the key K of the search. We prove that double hashing is asymptotically equivalent to uniform probing, an idealized hashing technique that exhibits no clustering and is known to be optimal in a certain sense. Between steps of the extension process we can show that the effect of clustering is negligible, and that we therefore never depart too far from the truly random situation.
RELATE: Relationship layout technique
Authors: Richard N. White
Venue: Proceedings of the 8th Design Automation Workshop (1971)

This paper describes RELATE, a computer program designed to assist the facilities design process. It is used to develop three-dimensional block plan layouts (form diagrams) economically and to help solve the &ldquo;combinatorial&rdquo; aspects of plan layouts.
Whither goeth fortran?
Authors: Dean Herington
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

One of the important reasons for ANSI X3J3's decision to adopt a &ldquo;core plus modules&rdquo; framework for FORTRAN is its concern for development of collateral standards in applications areas such as data management process control, and graphics. X3J3 does not have the resources to do the technical development of standards in all of these diverse areas. Therefore, it is important that X3J3 provide a scheme whereby collateral standards can be developed by groups outside of X3J3 and serve as &ldquo;modules&rdquo; attached to the &ldquo;core&rdquo; FORTRAN language in a standard way. X3J3's role in such collateral standards would be to ensure that the modules attach properly to the rest of the FORTRAN language, and that the work of different outside groups does not conflict.