ppxscal/embedding_network huggingface dataset:
A database model for effective configuration management in the programming environment
Authors: Karen E. Huff
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The effective management of configurations by programmers requires automatic techniques which are operative in the program development environment. In this paper, an abstract model is developed to cover the significant aspects of a typical programming environment pertinent to configuration management, using a database to capture configuration knowledge. The two aspects of the model deal with configuration identification and configuration control. In considering configuration identification, it is shown that the tools in the programming environment determine which configuration items need to be identified and also determine what the interesting and useful relations are among those items. In considering configuration control, the notion of a workspace, consisting of certain modification rights and certain visibility into the database, is developed to prevent conflict and to promote cooperation among programmers. The entire model can be used to evaluate the effectiveness of configuration management within a particular programming environment or as the basis of a programming environment design.
The VLSI Design Automation Assistant: Prototype system
Authors: T. J. Kowalski, D. E. Thomas
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes an approach to VLSI design synthesis that uses knowledge-based expert systems to proceed from an algorithmic description of a VLSI system to a list of technology-independent registers, operators, data paths, and control signals. This paper describes how the prototype Design Automation Assistant uses large amounts of expert knowledge to design an architecture with little searching. It also presents the current design of a small microprocessor along with a discussion of improvements currently being added.
A simulation study of operational procedures for increasing the efficiency of inland waterways transportation
Authors: Kiran J. Desai, Jerry Prock
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

Inland waterway transportation is an important part of American commerce. Any improvement in the operation of this waterway system could have far reaching effects. This paper describes a simulation study designed to identify methods of reducing delays at the locks. Factors used in the simulation were: lock utilization, tow mix, distance between locks, and sequencing rules. Cost estimates are used in conjunction with lock utilization and tow mix to find the total investment and cost of delays under these decision rules. A significant finding was that total costs were lowest for situations in which lock utilization increased as tow mix size increased. Thus, rules for having the lowest delays and rules for having the lowest costs are sometimes contradictory.
An automatic abstracting program employing stylo-statistical techniques and hierarchical data indexing
Authors: D. S. Himmelman, J. T. Chu
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

This paper reports the progress being made at RCA in the field of Automatic Abstracting. It includes(i) A general formulation of the problem, (ii) The use of stylo-statistics and hierarchical indexing to extract words associated in concept, (iii) Minimum procedures to reduce redundancy within sentences and (iv) A description of the computer program characteristics.
A microprocessor based tea dryer controller
Authors: S. S.S.P. Rao, V. K. Agarwal
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

This paper reports in detail the design of a microprocessor based system for providing efficient and sophisticated control in tea processing operations. At first it discusses in brief the control strategies being followed by the Indian tea industry. All the monitoring and control activities of the tea processing are at present being done manually yielding typical throughputs of 80 kg/hr to 250 kg/hr. A proposal to optimise the process through automation by a microprocessor based system is presented and the control functions of the microprocessor system are discussed. The expected savings in the operating expenditure and increase in throughputs are also projected.
Can we expect to improve text editing performance?
Authors: David W. Embley, George Nagy
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

For some time now we have also been interested in studying human factors aspects of computer text editors. We have surveyed the literature [9], and we have conducted several investigations of our own [10] ranging from an application of file-comparison algorithms in editor research [1], through prediction of editing performance [7], to the design and implementation of SIMPLE, our own editing system for beginners [8, 11]. Currently we are concentrating our efforts on gathering data to determine how much time users spend performing various editing activities. We intend to extend the work begun in previous studies, to investigate suboptimal editor performance including errors and nonoptimal means of achieving goals, and to study the broder aspects of editing such as file manipulation and job control that have largely been ignored.
Prolog
Authors: Kenneth A. Bowen
Venue: Proceedings of the 1979 annual conference (1979)

Exactly 100 years ago, the first-order predicate calculus was created and defined by Gottlob Frege. In the ensuing century his system was studied and refined by such logicians as Bertrand Russell, David Hilbert, Kurt Godel, Jacques Herbrand, Alonzo Church, and Alan Turing. In the 1950's and 60's attempts were made to use the results of these studies (especially those of Herbrand) in order to program computers to prove theorems automatically. These attempts introduced a new demon to the study of logic: ferocious computational complexity. The investigations of methods to avoid this demon led to the development of new systems of logic which are equivalent to the traditional systems, but are more suited to the efficient mechanical construction of proofs. The most notable among these is the resolution system of J. Alan Robinson [1965],[1979]. Cordell Green [1969] proposed the use of resolution systems in the construction of deductive question-answering systems, and this proposal eventually led Robert Kowalski [1974] to propose the so-called procedural interpretation of logic which forms the basis for the use of logic as a programming language.
BIGMAC II: A FORTRAN language augmentation tool
Authors: Eugene W. Myers,  Jr., Leon J. Osterweil
Venue: Proceedings of the 5th international conference on Software engineering (1981)

This paper describes the motivation, design, implementation, and some preliminary performance characteristics of BIGMAC II, a macro definition capability for creating language enhancers and translators. BIGMAC II enables the user to specify transformations through STREX, a FORTRAN-like language, which enables the specification of macros which are then used to interpretively alter incoming programs. BIGMAC II is specially adapted to the processing of FORTRAN programs. This paper shows how it can be used as a deprocedurizer (or flattener), a dialect-to-dialect translator, a portability and version control aid, and a device for creating language enhancements as sophisticated as new control structures and abstract data types.
A classification method for adaptive transform image coding
Authors: Jianping Pan
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper introduces a new classification method, termed vector-scaler classification, where each DCT (ac) vector is indexed using vector quantization (VQ) on the energy vector of the corresponding DCT subvectors, and the subvectors each are then classified according to the class assignment for the VQ. Vector-scalar classification achieves an average classification gain about 6.5 dB higher than block classification proposed by Chen and Smith (1977), since VQ has high clustering performance and classification of subvectors can exploit compactness of DCT coefficients more efficiently. The complexity of this method is relatively low. For coding small images, a fixed-rate DCT coding system developed using vector-scaler classification is competitive with some best variable-rate coding systems reported in the literature, and the classification can capture most of the performance gain obtained by entropy coding.
Microcomputer graphics (Panel)
Venue: ACM SIGGRAPH Computer Graphics (1984)

Ranging from home computers for entertainment and education to personal work-stations for design and presentation, microprocessor hardware spans the entire spectrum of graphic applications. Through live demonstrations of the latest and most popular hardware and software offerings, we hope to give you a feeling for the rapidly growing field of personal, &ldquo;human scale&rdquo; computing. The session will include a visual tour of the MacPaint package and the Quickdraw firmware on Apple's Macintosh personal computer, as well as brief demos of software for educational videogrames, low resolution typography and interactive, real-time animation. Depending on audience questions, we might also take a look at issues and trends involved in mass marketing of software, personalization of technology and ownership of knowledge...and what the ramifications might be for the future of computer graphics and the human (-) computer dialogue.
Manipulating simulated objects with real-world gestures using a force and position sensitive screen
Authors: Margaret R. Minsky
Venue: ACM SIGGRAPH Computer Graphics (1984)

A flexible interface to computing environments can be provided by gestural input. We describe a prototype system that recognizes some types of single-finger gestures and uses these gestures to manipulate displayed objects. An experimental gesture input device yields information about single finger gestures in terms of position, pressure, and shear forces on a screen. The gestures are classified by a &ldquo;gesture parser&rdquo; and used to control actions in a fingerpainting program, an interactive computing system designed for young children, and an interactive digital logic simulation.
An adaptive query system
Authors: E. Kellerman
Venue: Proceedings of the fourth international conference on APL (1972)

This paper will describe an adaptive query program coded in APL. The purpose of the program is to allow users to ask questions in everyday English and to receive answers with minimal delay.
ACM SIGPLAN history of programming languages conference PL/I language summary
Authors: Robert F. Rosin
Venue: ACM SIGPLAN Notices (1978)

PL/I was developed in two distinct stages. First the language NPL was conceived by a joint user-IBM committee. IBM alone then developed PL/I by clarifying and refining the rather incomplete specification of NPL. This overview describes the major features of PL/I, and George Radin's paper makes clear the distinctions between these two languages. The characteristics of PL/I were strongly influenced by two factors; what was known (in 1964-65) about commercial, scientific, real-time and system programming applications, and the features of FORTRAN, COBOL, and ALGOL which were useful in implementing those applications. The result is a language of great expressive power, which occasionally requires the programmer to manage great complexity.
Statistics and computer science: Problems in statistical computing of interest to computer scientists
Authors: Barbara F. Ryan, Thomas A. Ryan,  Jr.
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The impact of computer science on statistical computing, while important, has not been as great as it should. Part of this is caused by statisticians being unaware of relevant research in computer science. A related, and possibly more serious problem, is that computer scientists are not aware of some of the interesting problems in statistical computing. This paper will discuss several such problems. For example, statisticians are more concerned about &ldquo;nice&rdquo; case behavior than &ldquo;worst&rdquo; case behavior, e.g., so their primary interest is in expected running time using realistic models for typical data sets. Improvements in algorithms can often be made in &ldquo;nice&rdquo; cases with little or no sacrifice in worst case behavior, by being optimistic as well as pessimistic in the design of algorithms. Statisticians are often willing to accept approximate solutions or solutions which are asymptotically equivalent to the correct solution. A second example is the behavior of algorithms when data are stored in a virtual memory or auxillary memory. While some theoretical work has been done, only results on sorting and a few matrix operations have had an impact on statistical computing. There also seems to be a lack of models which give general predictions about the behavior of programs using virtual or auxillary memory, especially for portable programs which are not designed for specific page sizes. A third example is the problem of explaining issues of numerical accuracy to users of statitsical programs, e.g., if an ill-conditioned problem is diagnosed, it is necessary to explain to users what is wrong with their data. This might require finding a statistically meaningful index related to condition numbers. A fourth example is in language design for statistical packages. These languages do not need to deal with complex flow of control that programming languages do, On the other hand, they must be designed to be useful for the occasional and novice user. As a final example, while the developing technology of software engineering is having a significant influence on the writing of statistical software (especially statistical packages) there are many questions which remain to be answered, especially concerning portability of large applications programs.
Does the computer system make a difference in the effectiveness of the introductory service course?
Authors: Charles M. Shub
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

An experiment measuring the effect of different hardware configurations on the teaching of an introductory programming course is described. The situation before the experiment is delineated. The hardware selection is described. The experimental experience with the new hardware is described. The evaluation mechanism is defined delineating the variables to be measured and the controls. The results of the evaluation are presented. The actions based upon the results are delineated. Conclusions are drawn.
Design automation algorithms: Research and applications
Authors: Richard J. Lipton, J. D. Nash
Venue: Proceedings of the 19th Design Automation Conference (1982)

In the last few years there has been a great deal of basic research into computational complexity. This research has focused on the discovery of efficient algorithms for a wide range of problems. These problems include ones from number theory, geometry, graph theory, combinatorics, organizational research, and many other areas. Major progress has been made in both finding new fast and efficient algorithms and in showing for certain problems that no such algorithms can exist. Simultaneously, there has been a tremendous growth in VLSI technologies. Moreover, the design automation techniques needed to exploit this growth require very efficient algorithms. This is especially important as the density of chips continues to increase. For example, for each two-fold increase in chip density, a design algorithm that runs in n3 steps on a chip with n transistors requires a machine that is eight times faster - just to keep the design time constant per transistor.
The algebraic solution of large sparse systems of linear equations using REDUCE 2
Authors: Martin L. Griss
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

This paper discusses some of the problems encountered during the solution of a large system of sparse linear equations with algebraic coefficients, using REDUCE 2. Of particular importance is intermediate expression swell, which ultimately uses up all the available storage, and produces voluminous unreadable output. By optimally ordering the equations (optimal pivoting algorithms), and decomposing the intermediate expressions, so as to share common sub-expressions (&ldquo;hash coded CONS&rdquo;), a considerable saving in storage is achieved. By suitably renaming frequently used common sub-expressions, using the table built up above, and outputting these first, followed by the more complex expressions, a simplification in the output occurs. These techniques are general, and may be useful in any problem with large expressions to store and output.
Node synchronization in a distributed computer network
Authors: P. Franchi, T. Pedrotti, G. Sommi
Venue: Proceedings of seventh international conference on APL (1975)

In a distributed control network, questions such as: &ldquo;Between two messages arriving at a node, which one left its original node first?&rdquo;, or &ldquo;How much time elapsed in the trip of a message between two remote nodes?&rdquo; are relevant points for many specific problems A realistic approach to the problem of the &ldquo;Common Time&rdquo;, not requiring external time source, is based on the fact that appropriate messages carrying time information flow between adjacent nodes, with a known delay. The model discussed in this paper is based on this hypothesis.
On the complexity of bilinear forms with commutativity
Authors: Joseph Ja'Ja'
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We consider the problem of computing a set of bilinear forms in the case when the indeterminates commute. We develop lower bound techniques which seem to be more powerful than those already known in the literature for the commutative case. An unexpected result is the fact that Duality theory does not hold in the commutative case; we prove that the multiplication of 2 &times; n by n &times; 2 matrices requires at least [27n/8] multiplications while it is possible to multiply 2 &times; 2 by 2 &times; n matrices using only 3n + 2 multiplications. We also settle the question of whether commutativity can reduce the number of multiplications by 1/2 by showing that this can never happen. On the other hand, we show that, over algebraically closed fields, the complexity of computing a pair of bilinear forms is the same whether or not commutativity is allowed. We feel that, in general, commutativity will have little effect whenever the constant set is an algebraically closed field.
A file organization for cluster-based retrieval
Authors: W. Bruce Croft
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

A file organization for cluster-based retrieval is presented and tested. This file organization is based on the bottom-up search which, in contrast to the more usual top-down search, starts at the lowest level of a cluster hierarchy (the documents) and looks at progressively larger clusters. This approach enables most of the efficiency problems previously associated with clustered file organizations to be avoided. There are two parts to this file organization - a compact cluster hierarchy representation which does not store cluster representatives and a compact inverted file which is used to provide a starting point for the bottom-up search. Retrieval experiments show that the bottom-up search using this file organization can be more effective than a serial search, especially if high precision results are required.
A study of the relationship between job requirements and academic requirements in computer science
Authors: John F. Loase, Brian D. Monahan
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

In scrutinizing the 1981 Occupational Outlook Handbook, one cannot fail to recognize a strong positive connection between mathematical requirements in educational pre-requisites for occupational entry and the concomitant demand and remuneration of such employment. Very little research has been completed characterized by an intensive analysis of the mathematical competencies requisite for effective job functioning in specific occupations. Laws (1968) and Miller (1970) interviewed occupational representatives in technical areas and 44 occupational specializations in science. Both studies challenged the mathematical collegiate pre-requisites expected of the practitioner; Laws and Miller recommended a re-evaluation of pure mathematics requirements for employment. Saunders (1978) interviewed a single representative from each of 100 occupations and found that facility with whole numbers, decimals, use of calculators, and percentage as essential. Saunders' sample needs to be increased in order to obtain more reliable results.
The role and impact of a Data Base Management System in a university time-sharing computing environment
Authors: Robert Michels
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The objective of this paper is to discuss the role and impact of a Data Base Management System (DBMS) on the DECsystem-10. The selection process is reviewed and the post-selection user reaction is presented. A few thoughts are given on the merits of the language selected.
Interconnection of broadband local area networks
Authors: C. Sunshine, D. Kaufman, G. Ennis, K. Biba
Venue: Proceedings of the eighth symposium on Data communications (1983)

Interconnection of multiple broadband local area networks to form an integrated packet transport system presents several challenges. To take full advantage of broadband systems, assignment of nodes to channels must be dynamic, leading to the use of a flat address space. Combined with the desire to avoid reliance on a central server or complex routing in packet forwarders, this addressing scheme leads to adoption of a controlled flooding technique to &ldquo;discover&rdquo; the best path to a destination node. This discovery procedure sets up a path through internetwork forwarders for use by subsequent packets to the same destination. This paper describes the design and implementation of such a technique in Sytek's LocalNet(TM) systems along with several refinements which increase performance and keep the worst case load for route discovery below a few percent of network capacity.
A detailed interactive simulation system for developing command and control systems
Authors: Kevin C. Trott, Frederick K. Frantz
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

The Dynamic Ground Target Simulation (DGTS) system is a real-time interactive simulation system which produces detailed scenarios of military unit activity. DGTS is composed of three subsystems: a Model Construction Subsystem, which uses a Pascal-based discrete event simulation language, a Data Preparation Subsystem, and a Scenario Generation Subsystem, which executes a model according to a specific set of orders and allows it to be interactively manipulated. DGTS has been used to generate scenarios of varying size and scope.
Conspectus of software engineering environments
Authors: Hans-Ludwig Hausen, Monika Müllerburg
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Aspects of software engineering environments are discussed, namely motivations, life cycle models, concepts, methods, description means and tools. Some general conclusions about these aspects as well as about the area of software engineering environments are drawn. The paper is based on a study of selected software engineering environments.