ppxscal/embedding_network huggingface dataset:
Characterizing non-ideal shapes in terms of dimensions and tolerances
Authors: R. C. Hillyard, I. C. Braid
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

A geometric model of a shape is extended so as to represent not only its nominal dimensions but also tolerance information and surface specifications. The data structure defining an object is visualised as a pin-jointed, infinitely elastic wire frame covered by elastic membranes. Constraints corresponding to the dimensions of technical drawings are applied to the structure, either by the designer or by an automatic dimensioning algorithm. The validity of the resultant scheme can be checked and then drawn using drawing office conventions. The data structure can handle dimensions fixing various types of curved surface; other types can easily be added by following the same rules. A method of changing the nominal shape of an object is demonstrated. These results provide a systematic account of the ill-defined art of dimensioning and tolerancing, and should make the draughting process more amenable to computation.
Variable-length capabilities as a solution to the small-object problem
Authors: Edward F. Gehringer
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

A capability system which supports very small objects can achieve flexible and efficient protection. This paper presents a scheme for representing both large and small entitles In a computation, down to integers and character strings, as objects. This is achieved by a generalization of tagged memory to encompass extended data types; and by the use of variable-length capabilities, which can be very short if they are close to the object they reference. As developed here, the design assumes a single, systemwide virtual-address space, and a stack architecture; but it could probably be modified for use In other environments.
Efficient implementation of APL in a multilanguage environment
Authors: B. Hakami
Venue: Proceedings of seventh international conference on APL (1975)

The availability of micromachines with large, fast and writable microstores has brought about a greater flexibility which the language interpreters can exploit in order to achieve higher performance and security. Section 1 reviews the problem of designing multilanguage computer systems. In Section 2 a system is described which can support a multilanguage environment. Section 3 describes the hardware on which the system is implemented. The APL interpreter and its run-time environment are described in Sections 4 and 5. An important aspect of any system is the way in which the store is protected from unauthorised access. Address evaluation and security are described in Section 6. Section 7 makes observations on the implemented system and conclusions are drawn in Section 8.
A system for evaluating programmer performance
Authors: Antonio Salvadori, J. D. Gordon, C. K. Capstick
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

As hardware costs fall and personnel costs rise, computer managers are becoming more and more concerned about how efficiently their programmers work. In addition to this factor, there is a need for a measurement tool with which to evaluate new programming techniques, such as top-down programming (against some other technique) at the programmer level. To this end a COBOL program monitor has been written (Salvadori, Gordon, Capstick) at the University of Guelph which can automatically provide managers with such a measuring tool. The monitor system should also help individual programmers to improve their efficiency by strengthening their knowledge of the language in which they program. In this paper, and in the COBOL automatic monitoring system at Guelph, the only language treated is COBOL, but the present work may be easily generalized to other languages in a manual or automatic way (see for example Lyon, Uzgalis).
Large-scale numerical problems in biomedical studies
Authors: H. Greenfield
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

A review of on-going projects employing an interdisciplinary approach is presented. This approach is the applicability of computer graphics, fluid dynamics and numerical analysis techniques to hemodynamic problems in medicine. It has been shown to be feasible. The hemodynamic studies are the analysis of blood movement in prosthetic heart valves and the attempt to understand initiation and formation of atherosclerotic lesions. It is demonstrated that the Navier-Stokes equations of flow are amenable to descriptive solution by computer graphics and resulting examples of particular surface and perspective displays are presented. Comparison of computer graphics experiments with clinical findings are discussed.
A hybrid oriented interactive language
Authors: Martin L. Cramer, Jon C. Strauss
Venue: Proceedings of the 1966 21st national conference (1966)

This paper presents an on-line, inter-active language system created specifically for scientists and engineers engaged in preparation, setup, control, and monitoring of hybrid computations. Through a special console or a generalized input/output device, the user is afforded immediate access to both a computational process (software), and computation equipment (hardware). The language combines a complete algebraic interpreter with an expandable command and control repertoire. Through the latter, the language system may be made to perform a variety of special tasks, peculiar to the user, the equipment, or the installation. The language is designed specifically to facilitate implementation of an interpretive processor on a small digital computer in a hybrid configuration. This does not mean to imply, however, that the design is in any way limited to small computers. Rather, the intrinsic expandability of the language makes it possible to have a single communication medium that is upwards compatible across the whole spectrum of computer capability. The use of this programming system provides the hybrid computer analyst with great on-line flexibility coupled with a substantial reduction in the bothersome detail normally associated with digital computer programming.
Interactive graphics in water quality investigations
Authors: R. L. Phillips, D. E. Geister
Venue: Proceedings of the ACM annual conference (1973)

The sheer bulk of STORET (currently about 700 x 106 bytes) coupled with a relatively inefficient mode of retrieval very nearly prohibits an interested agency from making timely and meaningful use of the available data. Moreover, even given the availability of a fast, efficient retrieval program, a printed output is certainly not the best way to present the information. Strong and significant geographical relationships exist among the data which cannot easily be detected from a tabular output. This suggests the applicability of graphically aided retrieval and display techniques. Such an approach is the subject of this paper. A system called INSIGHT INteractive System for Investigation by Graphics of Hydrological Trends) has been developed that makes it possible for a user to display on a cartographic background the locations of selected water quality monitoring stations. The stations are shown not only in relation to each other but also in relation to the surrounding hydrological features, state/county boundaries, and municipal outlines. Parameter data which have been acquired at the stations shown can be displayed graphically or in tabular form. A time history of measurements for a particular parameter can be graphed or a perspective display of a selected reach of a river can be requested, with parameter values super-imposed as a bar graph at station locations. Being interactive (in the best sense of the word), the system allows a user to investigate hundreds of water quality situations in the space of an hour or two. Then, guided by what he sees, he can pursue interesting patterns of water quality degradation, rejecting all those cases which seem to be of little value. The user thus quickly gains an insight which might otherwise be masked by the volume of the data and the labor involved in interrogation by non-graphic means.
Management information/decision systems using APL
Authors: John G. H. Carlson, Richard Gilman
Venue: Proceedings of the sixth international conference on APL (1974)

Until recently, most Management Information Systems were out-growths of previously designed data storage and retrieval systems. As these systems were expanded, first into data banks, and then into information systems, the same programming language was frequently retained as was found in the original data processing system, usually COBOL. The advent of on-line inquiry, was slow to take hold because of the expense of coding and running the programs, although some satisfactory systems were developed using PL/1. This paper discusses the use of APL as an information/decision system language, in the light of a computerized corporate simulation model used as a research tool by the authors. Conclusions specific to the research are examined as well as the suitability of APL as applied to these types of systems in general.
Strategies for data abstraction in LISP
Authors: Barbara K. Steele
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

The benefits of abstract data types are many and are generally agreed upon [Liskov and Zilles 1974, Linden 1976]. New languages are being constructed which provide for and enforce the use of data abstractions [Liskov et al 1977, Wulf et al 1976]. However, many of us are not in a position to use these new languages, but must stick to our installation's compiler. How then can we obtain the benefits of data abstraction? We discuss the implementation of data abstraction in a LISP program and the subtleties involved in doing so: specifically, how it is possible to enforce proper data abstraction in a language which does not provide for abstract data types.
DIALISP - a LISP machine
Authors: G. Stefan, A. Paun, V. Bistriceanu, A. Birnbaum
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

High performance facilities to interpret LISP represent an ever increasing request even for minis. This paper presents a LISP hardware structure conceived to be implemented in a general purpose mini system called DIAGRAM. The LISP structure had to be adapted to the system technological requirements and size. The data structure and the instruction set concerning the basic machine are also presented.
Some considerations in database application programming
Authors: Isao Miyamoto
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper describes the experimental approach to achieve the higher productivity, reliability, maintainability and the performance in the database application programming or of the programs. We have practiced the structured programming on the database processings in order to write the reliable database application programs. Then we introduce the simulated forms of the basic control structures in COBOL which is the host language, the structured representations of the DML (Data Manipulation Language) statements to be precompiled to the COBOL statements, and the programming standards firstly, and the program structuring guidelines to the highly efficient database processings nextly, based on the fact that the database processing performance is affected by the data reference behavior which is called as a data locality of the database application program. The way to structure the database application program which has a good data locality and the tool which is useful to examine the program structure are described. Finally, we describe the results got through the experiments.
Canonical labeling of graphs
Authors: László Babai, Eugene M. Luks
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We announce an algebraic approach to the problem of assigning canonical forms to graphs. We compute canonical forms and the associated canonical labelings (or renumberings) in polynomial time for graphs of bounded valence, in moderately exponential, exp(n&frac12; + &ogr;(1)),time for general graphs, in subexponential, nlog n, time for tournaments and for 2-(&ngr;,&kgr;,&lgr;) block designs with &kgr;,&lgr; bounded and nlog log n time for &lgr;-planes (symmetric designs) with &lgr; bounded. We prove some related problems NP-hard and indicate some open problems.
The semantics of a mathematically oriented computer language
Authors: Gerhard Kratky, Hermann Kopetz
Venue: Proceedings of the 1969 24th national conference (1969)

This paper discusses the process of attaching a meaning to an initially strictly formal syntactic structure. Six levels of semantics are defined, each deeper level providing an enrichment of meaning. A formalism is developed which allows the exact description of the semantics of mathematical operators, expressions and statements, including array arithmetic. The purpose of declarations in a programming language is discussed, the notion of 'the correctness of a program' is analyzed, and conclusions are drawn for the construction of an interactive system.
Machine independent simulation modeling
Authors: George E. Juras, Frederick K. Goodman
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Computer simulation and modeling is a form of scientific experimentation. As such, simulation experiments must satisfy the reproducibility criterion imposed by the scientific method, i.e., they must be machine independent. A model is machine independent if it runs on all machines of comparable scale and produces results that are equivalent. To achieve machine independence, models are implemented in the user language of a host system, which in turn is written in portable FORTRAN. If the host system is made machine independent, then the models hosted by it are necessarily machine independent. The host system approach is discussed in the context of NUCLEUS, a programming methodology under development at Battelle's Columbus Laboratories for the past ten years. The validation of the approach is discussed in the context of the FORSYS model, a multinational, macroeconomic forecasting model currently under development by the four Battelle research centers&mdash;Battelle-Geneva, Battelle-Frankfurt, Battelle-Northwest, and Battelle-Columbus.
A microcomputer APL*PLUS system implementation
Authors: Phelps Gates
Venue: ACM SIGAPL APL Quote Quad (1983)

The APL*PLUS/80 System, completed in early 1982, is the most complete microcomputer implementation of APL to date. It includes all of the traditional APL language primitives and most of the STSC APL*PLUS system enhancements. This paper considers some of the problems we encountered in squeezing an APL system of this size into a small computer and the stratagems used to overcome the problems. We then discuss some of the ways in which a microcomputer implementation gives opportunities to increase the usefulness and user-friendliness of APL in ways that are not possible or appropriate in a mainframe implementation. We chose to make some aspects of the implementation as easy as possible by designing the system for a single target machine, the Radio Shack (TM) TRS-80 (TM) Model III. This computer was chosen for its speed, features, and low cost. The summer 1982 list price for a typical configuration of hardware and software is &doller;2590 (without printer).
Pin assignment of circuit cards and the routability of multilayer printed wiring backplanes
Authors: Hing C. So
Venue: Proceedings of the 10th Design Automation Workshop (1973)

This paper examines the relationship between the pin assignment for circuit cards and the routability of the multilayer printed wiring backplane on which the cards are mounted. It is shown that the pin assignment should meet three objectives in order to facilitate backplane routing. Heuristic strategies for determining a pin assignment to attain these objectives are given. These strategies have been implemented in a program which was used in two separate experiments involving two different backplane configurations. In both cases, the use of the pin assignments obtained with the program led to major improvements in backplane routability. In one of the experiments, as a worst-case study, the most difficult circuit card was selected for a new card layout. The new layout was obtained without much difficulty; thus the pin assignment given the selected card by the program was realized. This result demonstrates that it is not as formidable a task as is sometimes believed to implement a pin assignment for circuit cards obtained by backplane considerations.
The design of an integrated, interactive and incremental programming environment
Authors: Harald Wertz
Venue: Proceedings of the 6th international conference on Software engineering (1982)

We are currently implementing a system to help experienced programmers during the development, implementation and debugging of their programs. This system, built on top of a screen oriented structural editor, offers possibilities of attaching descriptors to every portion of the program and to maintain - simultaneously - different versions of the program being written, including tentative hypothetical versions. It comprises a mecanism to maintain minimal consistency between modified parts of code, the non-modified parts of code and the attached descriptors, as well as an evaluation module functioning in different modes : normal evaluation, symbolic evaluation and checking evaluation. The standard programming aids, such as indexors, pretty printers, trace packages, undo- and history-facilities are generalized to handle the descriptors and unfinished programs as well.
The access control mechanism of a database computer (DBC)
Authors: M. Jaishankar Menon, David K. Hsiao
Venue: ACM SIGIR Forum (1980)

The database computer (DBC) is a specialized back-end computer which is capable of managing data 1010 bytes in size and supporting known data models such as relational, network, hierarchical and attribute-based models. It is also perhaps the first database machine to have a built-in security mechanism for access control. At the outset, the security mechanism was made an integral part of the DBC design. This design philosophy not only allowed us to construct a system that has no &ldquo;backdoors&rdquo;, but also ensured that all access requests are, in fact, controlled by DBC's security mechanism. The DBC security mechanism is based on the concept of security atoms, aggregates of data units being definable by the user in terms of conjunctions of query predicates. The fundamental gain in utilizing query conjunctions for the purpose of access control is that any data that is accessible or updateable is also protectable. It is believed that the DBC security mechanism is less cumbersome than the view mechanism of some database systems and more efficient than the query modification mechanism used by some other systems. This is demonstrated at three levels of access control, namely the subfile, record and field (attribute) levels.
Levels of abstraction and compilers
Authors: B. P. Buckles, G. C. Hintze
Venue: Proceedings of the 1976 annual conference (1976)

Based upon experience gained through the development of a compiler, this paper recommends the software partitioning technique known as levels of abstraction as a practical strategy for organizing medium to large-scale software systems. How to identify levels of abstraction, specific properties possessed by levels of abstraction, and how to integrate the technique into the software design phase are the principal topics. Each concept is illustrated by examples from the compiler. Some parallels are drawn between levels of abstraction and the concepts of resource management, of data abstractions, and of information hiding.
Developing and prioritizing data processing applications for municipalities
Authors: Leland Blank, Sallie Nelson
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper presents a procedure for analyzing municipal information flows in order to identify discrete databases and prioritize their applications for time-phased implementation. Techniques of user communication and questionnaire design are discussed. The priorities result from specific factors which are used to numerically rate each database application area. The factors are identified and grouped into two categories: user input and implementation oriented. The databases are combined into information classes which are designed to reduce data redundancy. The information classes are used to develop appropriate hardware configurations which can efficiently meet the current and projected needs of the municipality. Examples of these techniques are drawn from an analysis performed in a large metropolitan area.
Management of a large block-diagonal macro-economic model in APL
Authors: Eeva-Liisa Kaski
Venue: Proceedings of the international conference on APL (1982)

KESSU-model is a large medium-term input-output-based macroeconomic model. Its APL-based on-line design consists of model estimation, structural management of the model, model simulation and analysis of simulation results. The structural management is based on the concept of the list of model variables and the list of model blocks. In the compilation phase, model blocks are input as character matrices and transformed with processor functions to variable sublists and coefficient matrices, using the list of model variables as a control data. Variable sublists and reduced form coefficient matrices together with the variable list and list of model blocks are input to an iterative model solution procedure, which is performed with a FORTRAN compiled program for cost reasons. The model solution is coupled with the APL system by means of an interface designed to transfer the model structure and input data for simulation, and results back to APL workspace for further processing and reporting. There are some encouraging test results showing that a pure APL solution is competitive in cost terms, if satisfactory starting values for iteration are given.
Logical Structure Specification and data type definition
Authors: Billy G. Claybrook, James Craig Cleaveland, Donald Criscione
Venue: Proceedings of the 1979 annual conference (1979)

We describe a constructive approach to the specification of data types. The primary motivation for this approach, which is referred to as the Logical Structure - Operation Specification (LSOS), is to highlight certain aspects of a data type, and to possibly suggest one or more implementations for the data type. A key feature of the LSOS is its flexibility, which permits a wide variety of specifications for a data type. This allows the specifier of a data type to communicate to the user any view or perspective which was taken in developing the data type.
A Q-GERT model for facilities sizing for a planned product distribution network
Authors: John H. Richard
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

A newly designed chemical plant will require distribution facilities to transport the products to the consumers. A Q-GERT model of the distribution network was developed and used in determining the least-cost physical facilities required to meet the system performance objectives. The emphasis of the paper is on the development and operation of the model, and its use as a tool for determining the storage tank capacities, rail car fleet size, and loading rack capacities needed for the new plant.