ppxscal/embedding_network huggingface dataset:
AFWL hydrocode development parallel techniques fluid dynamics
Authors: Charles E. Needham, Richard E. Durrett, Daniel A. Matuska
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

The methods employed in solving the fluid dynamic equations are especially amenable to parallel techniques. In fact, one of the major forces behind the development of ILLIAC IV was the solution of hydrodynamic problems. During the early phases of ILLIAC IV development, (mid 1970 to 1971), the Air Force Weapons Lab expended several manyears of effort in converting its hydrocodes to the ILLIAC IV architecture. This has been reported in AFWLTR 72-33 &ldquo;Shell for the ILLIAC IV&rdquo; The experience has carried over into the codes presently used at AFWL which have many characteristics necessary for parallel processing. Applications of the parallel philosophy to serial machines has decreased running times by a factor of 2 or more. Our original single material hydrocode ran at the rate of approximately 1.5ms/zone/cycle on the CDC6600. The present version runs at about 0.5ms/zone/cycle.
On the specification and quantification of software performance objectives
Authors: Daniel Schutzer
Venue: Proceedings of the 1977 annual conference (1977)

Much has been written with respect to the guidelines, structure, and properties of a well-designed software product. Most of the literature, however, has dealt with qualitative statements rather than quantitative measures of desirable software attributes. Recently more attention has been directed at developing such quantitative measures. In this paper three such potential measures are proposed and their respective advantages and disadvantages are briefly discussed. An approach, for more precisely specifying and evaluating a software product, is presented. Its potential utility to the software, design and maintenance processes is discussed.
Invited papers: Table look-up procedures in data processing
Authors: G. W. King
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

TABLE LOOK-UP is a method of processing data which is quite old, but not necessarily dead. Cawdrey made the first systematic dictionary for the processing of the English language in 1604. Napier, in 1614, made the first logarithm tables for computation. The earliest computing done on machines used table look-up exclusively, with the aid of the IBM Collator and Duplicating Punch. The elementary form of a table is a list of values x, and a transformation f(x). For example, x could be a positive integer multiplied by a power of ten, and f(x) the function sin x given to a restricted number of decimal places. Another example would be for x to be a Russian word and f(x) to be a description of its grammatical properties.
Some experimental results on placement techniques
Authors: Maurice Hanan, Peter K. Wolff,  Sr., Barbara J. Agule
Venue: Proceedings of the 13th Design Automation Conference (1976)

Seven placement algorithms - one constructive-initial placement algorithm and six iterative-improvement algorithms - were programmed and run on six problems ranging in size from 60 to 1300 modules. These problems included placing IC packs on a card, cards on a board and circuits on an LSI chip. It was found that the new force-directed pairwise relaxation algorithm was the best algorithm for the larger problems and was competitive with the other algorithms for the smaller problems. Other questions relating to placement strategies (such as, what are the advantages of constructive - initial start vs. random start and what is the best transformation of the placement problem to an associated quadratic assignment problem) are also answered.
Datapac X.25 service characteristics
Authors: A. M. Rybczynski, D. F. Weir
Venue: Proceedings of the fifth symposium on Data communications (1977)

Datapac is a nation-wide public packet switching data communications network operated by the Trans-Canada Telephone System. Datapac, as other networks being developed around the world, allows terminals to access its services by using a standard interface: CCITT Recommendation X.25. Recommendation X.25 defines a set of conventions governing the manner in which packet terminals format control information and data into packets, establish, maintain and clear calls, and manage the transmission and flow of data to and from a packet network. Recommendation X.25 defines a user/network interface; it does not define the end-to-end service provided by the network though clearly there is a close functional correspondence between signalling provided across the interface and across the network. Recommendation X.25 adequately describes the characteristics of the network service allowing manufacturers to provide a single implementation of X.25 which can work on any of the networks supporting X.25. This adequate definition of the end-to-end service allows users to achieve first order benefits of packet networks. For an optimized implementation in a user's equipment, it is necessary to define the service characteristics of national and international services. This paper defines the functional, economic and performance-related characteristics of virtual circuits, specifically those on Datapac.
Employing A Deaf Programmer
Authors: Steven L. Jamison
Venue: Proceedings of the 1978 annual conference (1978)

There are many personal characteristics and environmental factors that contribute generally to the effectiveness of programmers or system analysts that are relevant whether they have physical disabilities or not. This paper, however, focuses on some of the special considerations that may apply to deaf individuals in the computing field and to those who seek such employment. Although deafness is less of a handicap in computing than in most other professional fields, there are still relatively few deaf people in computing disciplines. In the past, deaf students have had limited opportunities to prepare themselves for these careers. This is rapidly changing and the ball is now in the employer's court. A little understanding of deafness and some of its ramifications is about all that is needed to successfully employ a qualified deaf person. This paper provides that understanding with particular orientation to the computing profession.
Unsupervised Extraction of Salient Region-Descriptors for Content Based Image Retrieval
Authors: Alexander Dimai
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Several content based image retrieval systems use region-based descriptors of salient regions to represent the image content. In this application domain, no perfect pixel wise segmentation is required, but instead, a stable and unsupervised extraction of salient region-descriptors is needed which might be generally applicable. Accordingly, in this paper an algorithms proposed which combines local and area-based information of multidimensional features, such as luminance, color and texture to extract robustly region-descriptors of salient regions. Furthermore, the selection of the corresponding regions is parameter-free thus ensuring its general applicability. The algorithm is easy to extend to other feature types and has been used to extract salient regions from images of a large database consisting of outdoor scenes.
Use of a computerized clinical decision system in a diabetic clinic
Authors: Robert E. Bolinger, Sandra Price, Joseph L. Kyner
Venue: Proceedings of the ACM annual conference (1973)

The application of the computer to the process of medical decision making has been slow in contrast to the relative successes pertaining to medical records, pharmacy, epidemiology, and various aspects of a hospital information system (1). The process of medical decision broadly encompasses first the collection of data, secondly, the processing of the data to arrive at a diagnosis and finally, the prescription of a plan of action designed to correct the problem. In practice these steps are often telescoped and tend more to approximate a guidance system in which data collection serves as a continuous feedback for modification of diagnosis and an evolving plan of action based on the outcome of previous actions. This process is best termed medical management, the central theme of which is the patient problem as emphasized by Weed (2,3).
APL in Computer-Assisted Instruction: Simulation of Stochastic Processes in science teaching
Authors: S. W. Wittig, R. Eggensperger
Venue: Proceedings of the eighth international conference on APL (1976)

The significance of APL for the application in CAI is discussed. In the frame of a basic course 'Mathematics for Physicists' a series of programs were written in APL to simulate stochastic processes: Galton board, diffusion, transport of charged particles, diffraction of light, zero-point fluctuations of a moving-coil galvanometer. These programs are described, together with the outlines of the simulation methods used.
A Hierarchical and Recursive Model of Mathematical Expressions for Automatic Reading of Mathematical Documents
Authors: J.-Y. Toumit, S. Garcia-Salicetti, H. Emptoz
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

We propose an original model for automatic reading of mathematical texts, founded on a recursive approach and a hierarchical view of the latter. This hierarchy in the text has been introduced by means of the notion of mathematical object, that we characterize by a set of definitions. A prior segmentation phase of mathematical objects in text is performed, using character matching techniques and propagating the labeling process of mathematical objects around "special characters" initially recognized. Complex and dynamical tree representations are proposed for mathematical expressions detected in the text, and a dynamical set of priority rules has been defined that guides this automatic process. Finally, the recognition of the elementary objects obtained permits to achieve the encoding of a mathematical expression.
Real time information processing II: What is &ldquo;real&rdquo; time?
Authors: G. F. Weinwurm
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE PASSING OF TIME, which is a familiar experience to all of us as individuals, also represents an important frame of reference for the scholastic endeavors. Speculations concerning the nature of time have an ancient and honorable history in many areas of understanding, particularly in philosophy, physics, and the more mathematically oriented sciences. Time has been introduced as a fundamental descriptor of events, and has been considered in such forms as absolute and relative time, subjective and objective time, and intuitive time, to name only a few points of view. Until recent years, however, no serious concern seems to have been given to the possibility of a real and non-real conception of time. The purpose of this discussion will be to consider some of the more common views of real time, to indicate some of the difficulties involved in their application, and finally to suggest an approach to the problem of definition.
Software physics and computer performance measurements
Authors: Kenneth W. Kolence
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The concept that a software physics corresponding to the natural physics at the basic conceptual level exists is explored and a basic constitutive definition for the nature of software offered. Using this definition, a criterion for finding certain types of conservation laws in software physics is proposed. Applying these ideas to the problems of computer performance measurements, proposed definitions for software energy, work, force and power are offered. The results of a single experiment are provided to support the hypotheses, and further experimental verification called for.
A software tool for teaching Data Structures
Authors: John Beidler, John Meinke
Venue: ACM SIGCSE Bulletin (1978)

Our Data Structures Course, first taught in 1973, was originally conceived as the keystone course of our computer science curriculum. Our curriculum's original design was influenced by Curriculum '68 and the undergraduate computer science program at Penn State University. However, we had to adapt our program to our small college environment and include a curriculum track with a business emphasis. We felt that regardless of which track in our program a student might follow, theory/systems or business/DP, there must be a strong nucleus common to both tracks. For this reason we concentrated on developing four strong courses that would be given as the freshman and sophomore year component of our curriculum. As part of this, we also saw the need for software tools to support these courses. From this, a structured programming preprocessor evolved. However, as part of this preprocessor we included timing and dynamic storage allocation features. Through a strong emphasis on structured programming that begins with our first computer science course, our second course introduces many discrete structure concepts-queues, stacks, trees, graphs, etc... Our third course is a course in assembler level programming and computer organization. These courses provide a strong foundation for our Data Structures course.
On the synthesis and analysis of protection systems
Authors: Lawrence Snyder
Venue: Proceedings of the sixth ACM symposium on Operating systems principles (1977)

The design of a protection system for an operating system is seen to involve satisfying the competing properties of richness and integrity. Achieving both requires the interplay of analysis and synthesis. Using a formal model from the literature, three designs are developed whose integrity (with the help of the model) can be shown.
The application of programming language techniques to the design and development of microprogramming languages
Authors: Ashok K. Agrawala, Tomlinson G. Rauscher
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

Conceptually microprogramming is similar to traditional programming, but the development of microprogramming languages has lagged far behind the development of programming languages. This paper identifies the problems characterizing the present state of microprogramming languages and shows how some programming language techniques may be used to solve them.
A central Ohio consortium for retraining in computer science
Authors: Zaven Karian, Stuart H. Zweben
Venue: ACM SIGCSE Bulletin (1984)

A Consortium of eight Central Ohio colleges and universities is described. The purpose of the Consortium is to provide opportunities for faculty at the participating institutions to be retrained in the field of computer science. These faculty will then be able to return to their home institutions to develop and teach computer science curricula. The program provides flexibility of scheduling the retraining, in terms of the time of year and nature of the retraining undertaken by the individual participants.
Specification techniques
Authors: Lawrence Robinson
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper describes specification techniques related to a hierarchical methodology developed principally by the author for design, implementation, and proof of large software systems. Two kinds of specification techniques are described: those for decomposing the system into a hierarchy of abstract machines, and those for writing formal specifications for each machine. Several examples of the use of the methodology are presented. The basic concepts of the methodology are extended to include an interpretive computational model that is particularly relevant to hardware design. The usefulness of specifications in the software design process is also discussed.
Simulation case studies
Authors: Norman L. Enger
Venue: Proceedings of the 1st symposium on Simulation of computer systems (1973)

Applied Management Systems, Inc., conducted major studies for the States of Ohio and Virginia utilizing simulation techniques and hardware analyzers to determine utilization of computer equipment and the potential for data processing facility consolidations. As simulation models of equipment, software, and workloads were constructed, the results from simulator runs were checked against hardware analyzer output to verify the accuracy of the simulation models. This cross-verification was extremely valuable to validate and tailor simulation models of present and planned data processing workloads. Both studies led to Master Plans recommending that the States proceed to consolidate specific data processing facilities and establish State Data Centers or computer utilities offering computational and support services to State Agencies. User Agencies would access these State Data Centers through terminals or satellite computer systems. Simulations techniques can be extremely effective in determining the extent to which data processing facility consolidations are technically feasible and economically justifiable. There remains a need for additional research on the evaluation criteria utilized to measure computer efficiency indifferent processing environments - e.g., a higher education versus a general business environment. Simulators and analyzers should be employed only after the total environment of the system being analyzed is understood. Computer efficiency must relate to the total installation environment. Much work remains to be dons in developing efficiency yardsticks for different processing environments.
The future is nigh upon us...
Authors: Rita Seplowitz Saltz, Paul M. Whalen
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

The most insidious form of miscommunication is self-deception. Permitting one's senses and perceptions, one's cognitive and cognitative processes, to accept a &ldquo;fact&rdquo; that does not agree with objective reality is to permit oneself to become an instrument of destruction. In fact, the over-whelming role of the wizard of computing has reduced the art to a medieval low. The computer magicians, convinced that the illusions they have fostered possess quintessential reality, have confused and addled the lay public for almost two decades. The uninitiated had but two choices: Believe in and Fear the Power of the Almighty Computer&mdash;or simply Fear the Power of the Almighty Computer.
Specification and verification of the UCLA Unix security kernel (Extended Abstract)
Authors: Bruce J. Walker, Richard A. Kemmerer, Gerald J. Popek
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

Data Secure Unix, a kernel structured operating system, was constructed as part of an ongoing effort at UCLA to develop procedures by which operating systems can be produced and shown secure. Program verification methods were extensively applied as a constructive means of demonstrating security enforcement. Here we report the specification and verification experience in producing a secure operating system. The work represents, to our knowledge, the first significant attempt to verify a large-scale, production level software system including all aspects from initial specification to verification of implemented code.
Computer-aided prediction of delays in LSI logic systems
Authors: David J. Pilling, Henry B. Sun
Venue: Proceedings of the 10th Design Automation Workshop (1973)

A computer program is described which was developed for LSI (large scale integrated) systems to resolve the uncertainties in transient delays prior to building the physical logic systems. This computer program represents a departure from the conventional logic simulation programs where unit delays are assumed for individual logic elements. The program takes into account all physical circuit variables at the mask composite stage in the design cycle. Transient delays are computed and inserted into the logic simulation program.
A generic robot simulator
Authors: D. L. Kimbler
Venue: Proceedings of the 16th conference on Winter simulation (1984)

A significant problem in both educational and industrial systems is access to development systems. Universities typically have neither funds nor space for a broad variety of industrial robots. Few manufacturing concerns can afford the luxury of robots dedicated to system development and training. An alternative to industrial robots is a physical simulation system. This system should include a robot capable of a broad range of motions and a controller capable of emulating robot controllers. The key to this system is its software, which provides a structure which allows the system to be tailored to specific needs. Such a system is a large undertaking. This report describes a beginning in developing this system. While the resulting system is specific to a single robot, it is expandable and adaptable to other robot families.
Conditions On Acquisitional Models
Authors: Brian MacWhinney
Venue: Proceedings of the 1978 annual conference (1978)

Nine conditions that may be placed on acquisitional models are that they must: (1) specify their domain, (2) demonstrate applicability across language types, (3) represent only the information actually available to the child, (4) include inputs and outputs in a proportion corresponding to their observed proportions, (5) include inputs and outputs in a sequence corresponding to their observed sequence, (6) make plausible assumptions regarding psychological processes, (7) make testable assumptions regarding psychological processes, (8) give evidence for the learnability of the proposed grammar, and (9) demonstrate the ability of the system to generate the output. A model is presented that attempts to satisfy these nine conditions for one area of linguistic development&mdash;the acquisition of morphophonology. The functioning of the model is sketched in terms of a dialectic cycle for the processes of application, monitoring, and acquisition. The system of application is based on a competition between rote, analogy, and combination. The discussion notes ways in which the model addresses each of the nine conditions noted above.
A symbolic functional description language
Authors: Gotaro Odawara, Jun Sato, Masahiro Tomita
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes a new diagrammatic hardware description language SFDL (Symbolic Functional Description Language) and a hierarchical logic design supporting system LDSS (Logic Design Supporting System). SFDL has three features that help designers design logic circuits easily and speedily; easy to describe with its simple rule, comprehensible to grasp the behavior of the circuit and suitable for computer processing. Besides, the LDSS allows designers to draw diagrams without the attention to complicated drawing rule and translate the SFDL diagrams into a text-styled hardware description language. Through experiments, the effectiveness of the SFDL for hierarchical logic design has been confirmed.
Research issues of personal computing within the corporate environment
Authors: Richard D. Hackathorn
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper explores the research issues related to personal computing within the corporate environment. A definition of personal computing is first offered, followed by an examination of how it relates to other areas, such as distributed processing, database management, office automation, software engineering, and artificial intelligence. Finally, specific research issues that are fundamental to the further development of the personal computing field are presented.