ppxscal/embedding_network huggingface dataset:
A flow oriented computer system simulation language
Authors: William R. Franta
Venue: Proceedings of the 1971 26th annual conference (1971)

This paper describes a language expressly designed for the simulation of operating system software. A carefully selected portion of the modeling machinery has been incorporated into the language so that the user need only be concerned with the operating system logic in constructing the modeling program. The modeling statements, as input to the assembly portion of the package result in the generation of a series of tables and pseudo code segments which are acted upon interpretatively during the simulation phase. A general description of system features together with a sample model program are presented in the body of the paper. The system described is written mainly in Fortran in a highly modular fashion so that certain extensions and/or changes to the language are easily implemented. The foundation for the effort is simply that simulation of proposed equipment configurations and/or operating system logic can and should be done prior to the installation and/or coding of the actual hardware software complex. Existing simulation languages are not always convenient to the task. Special languages which are natural and convenient to use in describing operating systems can make the prospect of simulation more attractive and useful.
Evaluation of a software requirements document by analysis of change data
Authors: Victor R. Basili, David M. Weiss
Venue: Proceedings of the 5th international conference on Software engineering (1981)

We describe in this paper an effective data collection method for evaluating software development methodologies, from definition of the objectives of the data collection to analysis of the results. We show how the data analysis can answer questions with respect to how successfully the goals of the development methodology are met. The A-7 requirements document is used as an example. We provide the results of data analyses conducted partway through the A-7 flight software development cycle, and discuss the utility of information obtained by such partial analyses. Results from the study show that data collection is feasible and useful when performed as part of configuration control, that data distributions based on partial data provide useful feedback to the developers, and that the A-7 Requirements Document is easily maintained and changed.
Creating volume models from edge-vertex graphs
Authors: Patrick M. Hanrahan
Venue: ACM SIGGRAPH Computer Graphics (1982)

The design of complex geometric models has been and will continue to be one of the limiting factors in computer graphics. A careful enumeration of the properties of topologically correct models, so that they may be automatically enforced, can greatly speed this process. An example of the problems inherent in these methods is the &ldquo;wire frame&rdquo; problem, the automatic generation of a volume model from an edge-vertex graph. The solution to this problem has many useful applications in geometric modelling and scene recognition. This paper shows that the &ldquo;wire frame&rdquo; problem is equivalent to finding the embedding of a graph on a closed orientable surface. Such an embedding satisfies all the topological properties of physical volumes. Unfortunately graphical embeddings are not necessarily unique. But when we restrict the embedding surface so that it is equivalent to a sphere, and require that the input graph be three-connected, the resulting object is unique. Given these restrictions there exists a linear time algorithm to automatically convert the &ldquo;wire frame&rdquo; to the winged edge representation, a very powerful data structure. Applications of this algorithm are discussed and several examples shown.
Office automation and the management of change
Authors: Ann W. Luke
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

A period of change in an organization puts our management talents and skills to a true test. When the change is the introduction of new technology or equipment into an existing operation, we need to pay special attention to the way in which we manage the introduction, implementation, training, and feedback of the new system, to ensure that the staff is motivated and informed, positive and cooperative. This paper describes the introduction of information processing systems into the operation of an organization and the special management skills that were brought to bear in introducing and implementing the new technology successfully. Of all the things we at Xerox Computer Services learned during the implementation of information processing systems throughout the company, three words stand out: effective management, and communications. These are the critical elements in the introduction of new systems and procedures, and, if used properly, they can lead to a slow, smooth, well-thought-out, and exciting new operation in technology.
A meta-model for software development resource expenditures
Authors: John W. Bailey, Victor R. Basili
Venue: Proceedings of the 5th international conference on Software engineering (1981)

One of the basic goals of software engineering is the establishment of useful models and equations to predict the cost of any given programming project. Many models have been proposed over the last several years, but, because of differences in the data collected, types of projects and environmental factors among software development sites, these models are not transportable and are only valid within the organization where they were developed. This result seems reasonable when one considers that a model developed at a certain environment will only be able to capture the impact of the factors which have a variable effect within that environment. Those factors which are constant at that environment, and therefore do not cause variations in the productivity among projects produced there, may have different or variable effects at another environment. This paper presents a model-generation process which permits the development of a resource estimation model for any particular organization. The model is based on data collected by that organization which captures its particular environmental factors and the differences among its particular projects. The process provides the capability of producing a model tailored to the organization which can be expected to be more effective than any model originally developed for another environment. It is demonstrated here using data collected from the Software Engineering Laboratory at the NASA/Goddard Space Flight Center.
On refuting the creation theory of computer architecture
Authors: Kenneth E. Mackenzie
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

There is an enormous body of software implemented on the common CPU architectures of today, such as Intel 8080, DEC PDP-11, and IBM System/370. For computer vendors in a profit-seeking environment, future products must not only support this existing software, but also exploit hardware and software technologies that are being, and will be, developed. The computer architect must balance the changes made to support new software with the requirement for cost-effective execution of old software. This problem is independent of the execution speed of the processor and the size of the system of which it is a part. The process of striking a balance between advancement and compatibility will be presented. Strengths and weaknesses of various types of solutions will be described using examples from commercial vendors. Reasons why certain well-known concepts in computer architecture have not been included in the products of commercial vendors will be discussed. The impact of management-level personnel on changes in computer architecture will also be explored. Future computer architectures must be engineered to meet the needs and concepts of those who use and control computers. Therefore, the process of its development within the industry must necessarily occur in orderly and constrained steps, rather than random leaps.
Invariant Scene Description Based on Salient Regions for Preattentive Similarity Assessment
Authors: Alexander Dimai
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The majority of content based image retrieval systems use low-level features for similarity assessment of image content. However, low-level descriptors are often not sufficient for encoding stably more complex image information.This paper proposes an intermediate level descriptor which captures the organization of the image scene based on salient regions of the image. The descriptors are invariant to specified image transformations. A non-linear combination scheme is exploit to combine the different descriptor models for pre-attentive similarity assessment where neither learning nor user-feedback is required. Results on a database containing more then 6,000 images are presented.
The subgraph homeomorphism problem
Authors: Andrea S. LaPaugh, Ronald L. Rivest
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

We investigate the problem of finding a homeomorphic image of a &ldquo;pattern&rdquo; graph H in a larger input graph G. We view this problem as finding specified sets of edge disjoint or node disjoint paths in G. Our main result is a linear time algorithm to determine if there exists a simple cycle containing three given nodes in G; here H is a triangle. No polynomial time algorithm for this problem was previously known. We also discuss a variety of reductions between related versions of this problem and a number of open problems.
Undergraduate research in computer sciences: Computer analysis of musical style
Authors: A. J. Gabura
Venue: Proceedings of the 1965 20th national conference (1965)

GENERALLY, style is a unique method of organization of artistic material. This paper is the result of some attempts to find, using the computer, an objective measure of style in music which would be generally acceptable, and which would not conflict with previous, subjective measures*. A large number of piano scores have been analyzed by computer for parameters such as melodic autocorrelation, chord structure, chord duration, chord type, key and modulation, with a view to obtaining an insight into the stylistic differences between the works of Haydn, Mozart and Beethoven. It is not assumed that measurements related to these and other parameters are necessarily indicative of style. The purpose of making them is to determine whether and to what extent they correlate with more subjective notions of musical style.
Digital simulation for energy conservation in a large wind tunnel plant system
Authors: Frederick L. Shope
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

This paper documents a feasibility study of mathematically modeling the wind tunnel complex and associated plant in the von K&aacute;rm&aacute;n Gas Dynamics Facility at the Air Force's Arnold Engineering Development Center in Tennessee. The ultimate goal of the modeling effort is to effect energy conservation measures by modifying operational procedures and plant hardware. A general theory is proposed to model the aerodynamics and losses of each plant or tunnel component in terms of a set of 33 equations based on one-dimensional, unsteady, nonisentropic flow and admitting arbitrary interconnections between components. A computer program is currently under development to apply the theoretical model using the IBM Continuous System Modeling Program III. In conjunction with the modeling effort, an assessment was made of the existing experimental data base which could be used to drive the mathematical model. Requirements for experimental data are discussed in general terms.
Flow graph reducibility
Authors: Matthew S. Hecht, Jeffrey D. Ullman
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

The structure of programs can often be described by a technique called &ldquo;interval analysis&rdquo; on their flow graphs. Here, we characterize the set of flow graphs that can be analyzed in this way in terms of two very simple transformation on graphs. We then give a necessary and sufficient condition for analyzability and apply it to &ldquo;goto-less programs,&rdquo; showing that they all meet the criterion.
Experience designing the waterloo port user interface
Authors: Michael Malcolm, Doug Dyment
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The Waterloo Port operating system was produced by the Software Portability Group at the University of Waterloo as part of an ongoing research project. Port runs on a variety of personal workstations, and is used by researchers and by 120 students annually in fourth-year and graduate real-time programming courses. Many of the concepts in Port evolved from our earlier system, Thoth [1,2]. The emphasis on message-passing semantics and an anthropomorphic view of multi-process structuring [3,4] remains a focus of this evolution; integration of the implementation language with the user interface and file system is more evident in Port [5].
On compiling embedded languages in LISP
Authors: Pär Emanuelson, Anders Haraldsson
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

In INTERLISP we find a number of embedded languages such as the iterative statement and the pattern match facility in the CLISP package, the editor and makefile languages and so forth. We will in this paper concentrate on the problem of extending the LISP language and discuss a method to compile such extensions. We propose the language to be implemented through an interpreter (written in LISP) and that compilation of statements in such an embedded language is done through partial evaluation. The interpreter is partially evaluated with respect to the actual statements, and an object program in LISP is obtained. This LISP code can further be compiled to machine code by the standard LISP compiler. We have implemented the iterative statement and a CLISP-like pattern matcher and used a program manipulation system to generate object programs in LISP. Comparisons will be made with the corresponding INTERLISP implementations, which use special purpose compilers in order to generate the LISP code.
SCAT: A heuristic algorithm for queueing network models of computing systems
Authors: D. Neuse, K. Chandy
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

This paper presents a new algorithm for the approximate analysis of closed product-form queueing networks with fixed-rate, delay (infinite-server), and load-dependent queues. This algorithm has the accuracy, speed, small memory requirements, and simplicity necessary for inclusion in a general network analysis package. The algorithm allows networks with large numbers of queues, job classes, and populations to be analyzed interactively even on microcomputers with very limited memory.
IBM 3081 system overview and technology
Authors: Clive A. Collins
Venue: Proceedings of the 19th Design Automation Conference (1982)

The development of the IBM 3081 established the methodology for designing and manufacturing a high-performance computer from an LSI chip technology. The high density packaging of the LSI chip is used to minimize interconnections and to support a fast machine cycle time. This paper will describe the methods used and will highlight some of the design problems that were solved, to offer an understanding of the challenges that LSI brings to the design cycle.
The CRYSNET terminal organization
Authors: Herbert J. Bernstein
Venue: Proceedings of the 1975 annual conference (1975)

The CRYSNET terminals are intelligent remote graphics terminals forming a network for crystallographic computing. These terminals are assembled from commercially available hardware and use software written largely in FORTRAN. They provide high performance graphics, local computation, remote batch job submission, and remote interactive use of a variety of central sites. Each terminal consists of a DEC PDP 11/40, 28k of 16 bit memory, Vector General 3-D display, single platter removable disc drive, card reader, printer/plotter, magnetic tape drive, 2000 baud synchronous interface to the phone lines. The current price for such a system is now about &dollar;100k. The current software supports display of molecular models in several forms, plotting, and crystallographic computations sufficient to have a noticeable impact on the time needed for structure solution and analysis. The terminal provides a collection of useful tools to which its users constantly add new code. The user does not have all the power he would get from a system interfaced to a very large computer, directly, or via high band width lines. The user also does not have the special features to be gained from hardware specifically engineered for the task. For example, black boxes to computer inter-molecular contacts will probably be the best way to do such a job for some time. However, it appears that the user has enough power and features for the current application. The equipment is in a reasonable price range and, being off the shelf, is available to a moderately large community with maintenance a controllable if not fully solved, problem. Since the terminal is based on a general purpose mini-computer, the user also has a great deal of flexibility in his use of the terminal. The computer supports a disc operating system with FORTRAN compiler. Thus, many users can write new code for their own applications. This has allowed a great deal of software to be developed at very low visible cost.
Computer applications for prospective public school administrators
Authors: Alton R. Goddard
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

The purpose of this paper is to discuss and analyze the instructional programs needed to prepare prospective public school administrators for today's technological decisions. Most states require public school administrators to obtain an administrator's certificate earned by the satisfactory completion of a certain collection of course work considered necessary for their professional preparation. For example, an administrator's certificate in the state of Texas requires from forty-five to sixty hours of prescribed graduate level course work. The course work at East Texas State University was modified about two years ago to include a three-semester-hour course in computer science. It was believed that all prospective administrators could benefit by at least this amount of exposure to the procedures of automatic data processing. The course was designed to accommodate graduate students in education with very little or no background in computer science. This type of student tends to be initially petrified at the thought of having to take a course in computer science. However, after some exposure to computer science terminology, they are ready to pursue the primary educational objective of the course. This objective is to prepare a prospective superintendent or principal to assume his position in a public school system with some knowledge of how to intelligently use whatever automatic data processing capability is or might possibly become available for his district's use.
The impact and issues of the fifth generation: Social and organization consequences of new generation technology
Authors: Walt Scacchi, Elihu M. Gerson, Rob Kling, Langdon Winner
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The social and organizational consequences of emerging from the use of computing technology are poorly understood. Forecasting the impacts of new computing technology is similarly not well understood. However, it is becoming increasingly clear that a growing array of computing arrangements are emerging that reinforce or stratify existing social arrangements. Whether these new arrangements are more or less socially desirable depends upon how one interprets their meaning and value. Thus, the purpose of this panel is to bring together leading scholars currently examining the broader consequences of new computing arrangements to discuss what might lie ahead. Most computing use centers around the work routines for a growing number of people. One form of consequences emerging from new modes of computing use can be seen in terms of the shift of resources (social, material, and otherwise) from one arrangement to another. When people value and seek to control local resource arrangements, these resource shifts represent social costs and benefits. Therefore, examining the consequences of different computing arrangements in a variety of work settings is a common research strategy for the participating panelists.
Representation and generation of rectangular dissections
Authors: Ulrich Flemming
Venue: Proceedings of the 15th Design Automation Conference (1978)

The stepwise development of a data structure for representing dissections of rectangles into rectangular components is outlined. The data structure is used to define a finite set of &ldquo;principal options&rdquo; for a class of space allocation problems, and a procedure is described which generates dissections representing these options.
Presentation abstract: A tutorial on local networks
Authors: David J. Kaufman
Venue: Proceedings of the ACM '81 conference (1981)

Local networks have garnered ever-increasing attention during the past several years. Local networks have been the subject of numerous conferences, of standardization activities, and of a proliferation of vendor offerings. The purpose of this tutorial is to overview the key technical issues underlying the design and application of local networks and thereby develop a framework for categorizing and, based on user requirements, evaluating local network approaches and products. Naturally, an overview of this type draws from a large number of existing and planned networks. Unfortunately, the limited time allotted to the topic does not permit a detailed review of any particular approach, but rather necessitates an attempt to extract the major concepts from each system. The phrase &ldquo;Local Network &rdquo; (or any of its variations) has become so widely used, that it has been used here without further explanation. In general, local networks have been characterized as having relatively high bandwidth, i.e., total system bandwidth in excess of 1 megabit/second, and covering a limited geographic area, i.e., at most 25 kilometers. Other characteristics which have been associated with local networks include broadcast capability and localized administrative control. This definition includes more traditional communication switching products, even though the Ethernet is frequently noted as being prototypical of local networks. While this tutorial attempts to span the entire spectrum of local network approaches, the Ethernet and other similar networks are the primary focus.
An interactive program advising system
Authors: Will Gillett
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

This paper describes components of an Interactive Program Advising System (IPAS) for beginning programming students. The system, being unaware of the algorithm being implemented by the student, is unable to direct the student toward writing a correct program. It instead comments on the programming constructs the student has used in the specific implementing language&mdash;in this case FORTRAN. Beginning programming students often write poorly structured programs (especially in a non-block-structured language like FORTRAN) with constructs which, while legal, indicate that the student doesn't really understand the operation being performed. Data is currently being collected on &ldquo;conceptual errors&rdquo; commonly made by beginning students. This paper describes some of these &ldquo;errors&rdquo; and what comments can be presented to the student to help him understand and correct his own &ldquo;errors.&rdquo; A subsequent paper will present statistics on frequency of errors and plausible student logic which would produce the errors.