ppxscal/embedding_network huggingface dataset:
Forms based documentation to support structured develomemt and C.A.S.E. implementation
Authors: D. Bellin
Venue: Proceedings of the 7th annual international conference on Systems documentation (1989)

One of the most important aspects of structured development is the creation and enforcement of standards. Standards define how a given methodology is to be used within your organization. Examples of standards might include Which forms and other documents must be bundled together Steps in the approval process When and by whom certain project steps must be done Maximum size of a module of code It is by now common to have some minimal standards for actual program code and program documentation. However, too often only lip service is given to enforcement of organizational standards for system analysis and system design. In my view, documentation and standardization of these development stages is crucial. Despite the current vogue, such documentation standards will not be achieved simply by purchasing and adopting a CASE tool. As a supplement to such a tool, especially at the beginning, a manual forms based method is necessary. Through the use of forms, analysts are provided with an initial set of standards which may be used in your projects. There is a learning curve the development team must go through in order to gain experience using standards. After one or more projects, a decision is often made to modify the initial minimum set of standards to fit the needs of a particular company. This process is similar to that which you must carry out in tailoring the software life cycle model to your own framework. In practice, a manual system reduces the time it takes to learn a new set of tools.
Implementation of a hypersonic rarefied flow particle simulation on the connection machine
Authors: L. Dagum
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

A very efficient direct particle simulation algorithm for hypersonic rarefied flows is presented and its implementation on a Connection Machine is described. The implementation is capable of simulating up to 4 x 106 hard sphere diatomic molecules using 64k processors with a performance better than that of a similar, fully vectorized implementation using a single processor of the Cray 2. Results from flow calculations are presented to demonstrate both the validity of the implementation and the range afforded by the method in solving hypersonic rarefied flow problems. Finally, a breakdown of the calculation time is given to identify a bottleneck which must be resolved for further improvement in performance.
A retrieval model based on an extended modal logic and its application to the RIME experimental approach
Authors: Y. Chiaramella, J. Nie
Venue: Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval (1989)

This paper focuses on the query processing module of RIME, an experimental prototype of an intelligent information retrieval system designed to manage high-precision queries on a corpus of medical reports. Though highly specific this particular corpus is representative of an important class of applications: information retrieval among full-text specialized documents which constitute critical sources of information in several organizations (medicine, law, space industry&hellip;). This experience allowed us to design and implement an elaborate model for the semantic content of the documents which is an extension of the Conceptual Dependency approach. The underlying retrieval model is inspired from the Logic model proposed by C.J. Van Rijsbergen, which has been considerably refined using an Extended Modal Logic. After presenting the context of the RIME project, we briefly describe the models designed for the internal representation of medical reports and queries. The main part of the paper is then devoted to the retrieval model and its application to the query processing module of RIME which has a natural language interface. Processing a query involves two main phases: the interpretation which transforms the natural language query into a search expression, and the evaluation phases which retrieves the corresponding medical reports. We focus here on the evaluation phases and show its relationship with the underlying retrieval model. Evaluations from practical experiments are also given, along with indications about current developments of the project.
The design and development of a dynamic program behavior measurement tool for the Intel 8086/88
Authors: R. J. Schwartz
Venue: ACM SIGARCH Computer Architecture News (1989)

When modeling a computer system, it is necessary to study the system's dynamic behavior. Examples of this behavior are branching frequency and operating system usage patterns. The dynamic properties of the system characterize its performance. Models make assumptions about such behavior, but require genuine data to validate the assumptions. In this article, we present a measurement tool that will collect and analyze dynamic program information for the Intel 8086/88. The design and development of the collection tool and its post-processors is described. Details of the interface and collection methods are also given. Finally, a Pascal compilation and a benchmark execution are used to provide examples of data gathered with the tools.
AI factory scheduling: multiple problem formulations
Authors: R. J. Stokey
Venue: Issue 110 (October 1989) (1989)

Included in this book is a review of research and applications as well as a presentation of new results. There is a mix of papers from industry, research laboratories and academia which gives a realistic perspective on the prospoects for AI technology in PMS applications. The majority of papers are concerned with the use of knowledge-based techniques to solve various scheduling problems. The introductory section includes two overview papers, each presenting the views and expectations of researchers in major industrial companies who have some experience of using AI technology to solve production management problems. There follows a series of technical papers which have been grouped into five categories: model based and simulation approaches; AI and scheduling; AI and production planning; the GRAI method; AI applications and FMS.
A block QR factorization algorithm using restricted pivoting
Authors: J. R. Bischof
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

This paper presents a new algorithm for computing the QR factorization of a rank-deficient matrix on high-performance machines. The algorithm is based on the Householder QR factorization algorithm with column pivoting. The traditional pivoting strategy is not well suited for machines with a memory hierarchy since it precludes the use of matrix-matrix operations. However, matrix-matrix operations perform better on those machines than matrix-vector or vector-vector operations since they involve significantly less data movement per floating point operation. We suggest a restricted pivoting strategy which allows us to formulate a block QR factorization algorithm where the bulk of the work is in matrix-matrix operations. Incremental condition estimation is used to ensure the reliability of the restricted pivoting scheme. Implementation results on the Cray 2, Cray X-MP and Cray Y-MP show that the new algorithm performs significantly better than the traditional scheme and can more than halve the cost of computing the QR factorization.
Controlling end-user computing: an analytical framework
Authors: O. Sato
Venue: ACM SIGSAC Review (1989)

The emergence of Microcomputer, off the shelf software such as spreadsheet, telecommunication, and improvement of user-interface of them make End-User Computing (EUC) as a important application of computer technology in business. EUC growth rate is sky-rocketing now (Sprague R. H. Jr., and B. C. McNurlin (1986)). Every office use many microcomputers. Everyone uses it personally for his/her business. Moreover, many critical decision are made through microcomputers or by using information from microcomputers. DDS (Decision Support Systems) and ESS (Executive Support System) are examples (Rockart, J. F. and D. W. DeLong (1988)). But the more the number of user of microcomputers, the control of EUC becomes more important.
Automatic parameterization of rational curves and surfaces IV: algebraic space curves
Authors: S. S. Abhyankar, C. J. Bajaj
Venue: ACM Transactions on Graphics (TOG) (1989)

For an irreducible algebraic space curve C that is implicitly defined as the intersection of two algebraic surfaces, f (x, y, z) = 0 and g (x, y, z) = 0, there always exists a birational correspondence between the points of C and the points of an irreducible plane curve P, whose genus is the same as that of C. Thus C is rational if the genus of P is zero. Given an irreducible space curve C = (f &cap; g), with f and g not tangent along C, we present a method of obtaining a projected irreducible plane curve P together with birational maps between the points of P and C. Together with [4], this method yields an algorithm to compute the genus of C, and if the genus is zero, the rational parametric equations for C. As a biproduct, this method also yields the implicit and parametric equations of a rational surface S containing the space curve C. The birational mappings of implicitly defined space curves find numerous applications in geometric modeling and computer graphics since they provide an efficient way of manipulating curves in space by processing curves in the plane. Additionally, having rational surfaces containing C yields a simple way of generating related families of rational space curves.
A programmer's view of the Intel 432 system
Authors: Elliot I. Organick
Venue:  (1983)

The architecture study &hellip;begins in Chapter 4 where a number of topics related to object structures and object addressing are treated. Chapter 5 introduces the hardware and system software support for interprocess communication. Here the i432 Port Objects and port operations (SEND, RECEIVE, etc.) are introduced and illustrated. Chapter 6 revisits the architectural and Ada-language support for object structure, emphasizing type management and access control. Many features of the supporting operating system, known as iMAX, especially several of its important &ldquo;user-interfaces,&rdquo; are introduced beginning with Chapter 5. The importance of input/output peripheral subsystems and their relationship with the central object-based architecture of the i432 system is recognized by treating this topic separately in Chapter 7. This chapter introduces the reader to the architecture of the i432 Interface Processor and its use as a key component in the Peripheral Subsystem Interface for the Intel 432 System. A message-based model for input/output using this interface is also introduced, along with a discussion of abstractions for I/O device interfaces, both asynchronous and synchronous. The topics of process management, memory management, and object filing, which ma y be of primary interest to system developers and architects, are treated in Chapters 8, 9, and 10. Each chapter describes the iMAX implementations of these services and the user interfaces to these facilities. In the case of process management an iMAX provided &ldquo;template&rdquo; is described whose use enab les system programmers to implement their own process managers as needed. Chapter 9 describes the extensive memory management facilities of iMAX and the supporting hardware. These include facilities to support the stack and heap memory resources required, for example, by executing Ada programs. In addition, memory management supports an on-the-fly garbage collector, dynamic memory compaction, and, where configured, a virtual memory management subystem. Chapter 10, as already noted, provides a complete introduction to object filing as it is currently planned. &mdash;From the Author's Summary
Verifying temporal properties without temporal logic
Authors: Bowen Alpern, Fred B. Schneider
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1989)

An approach to proving temporal properties of concurrent programs that does not use temporal logic as an inference system is presented. The approach is based on using Buchi automata to specify properties. To show that a program satisfies a given property, proof obligations are derived from the Buchi automata specifying that property. These obligations are discharged by devising suitable invariant assertions and variant functions for the program. The approach is shown to be sound and relatively complete. A mutual exclusion protocol illustrates its application.
Sharing scientific data
Authors: Theodor D. Sterling, James J. Weinkam
Venue: Communications of the ACM (1990)

The willingness of one scientist to share data with another scientist continues to be influenced by a number of enconomic, social, psychological and political factors.
Code Optimization Across Procedures
Authors: Stephen Richardson, Mahadevan Ganapathi
Venue: Computer (1989)

Procedure calls can be a major obstacle to the analysis of computer programs, preventing significant improvements in program speed. A broad range of techniques, each of which is in some sense interprocedural by nature, is considered to overcome this obstacle. Some techniques rely on interprocedural dataflow in their analysis. Others require interprocedural information in the form of detailed profile data or information concerning the scope of a given procedure in relation to other procedures. These include procedure integration, interprocedural register allocation, pointer and alias tracking, and dependency analysis.
Comments Analysis and Programming Errors
Authors: William E. Howden
Venue: IEEE Transactions on Software Engineering (1990)

Software validation is treated as the problem of detecting errors that programmers make during the software development process. This includes fault detection, in which the focus is on techniques for detecting the occurrence of local errors that result in well-defined classes of program statement faults. It also includes detecting other kinds of errors, such as decomposition errors. The main focus of the work is on a decomposition-error analysis technique called comments analysis. In this technique, errors are detected by analyzing special classes of program comments. Comments analysis has been applied to a variety of systems, including a data-processing program and an avionics real-time program. The use of comments analysis for sequential and concurrent systems is discussed, and the basic features of comments analysis tools are summarized. The relationship of comments analysis to other techniques, such as event sequence analysis, is discussed, and the differences between it and earlier work are explained.
Partitioned signature files: design issues and performance evaluation
Authors: Dik Lun Lee, Chun-Wu Leng
Venue: ACM Transactions on Information Systems (TOIS) (1989)

A signature file acts as a filtering mechanism to reduce the amount of text that needs to be searched for a query. Unfortunately, the signature file itself must be exhaustively searched, resulting in degraded performance for a large file size. We propose to use a deterministic algorithm to divide a signature file into partitions, each of which contains signatures with the same &ldquo;key.&rdquo; The signature keys in a partition can be extracted and represented as the partition's key. The search can then be confined to the subset of partitions whose keys match the query key. Our main concern here is to study methods for obtaining the keys and their performance in terms of their ability to reduce the search space. Owing to the reduction of search space, partitioning a signature file has a direct benefit in a sequential search (single-processor) environment. In a parallel environment, search can be conducted in parallel effectively by allocating one or more partitions to a processor. Partitioning the signature tile with a deterministic method (as opposed to a random partitioning scheme) provides intraquery parallelism as well as interquery parallelism. In this paper, we outline the criteria for evaluating partitioning schemes. Three algorithms are described and studied. An analytical study of the performance of the algorithms is provided and the results are verified with simulation.
A fast and portable uniform quasi-random generator of very large period based ona generalized multi-moduli congruential method
Authors: Daniel Guinier
Venue: ACM SIGSIM Simulation Digest (1988)

The present method generates machine-Independent uniform random sequences of real numbers in the interval (0.,1.) excluding 1. It uses a generalization of mulltiplicative linear gongruential generators working with prime numbers as moduli whose values have been fixed according to the positive integer arithmetic storage available from the system, and one or their corresponding primitive elements as multipliers to complete independently each full cycle.The periodicity can be considered as infinite: O (1092) for a 16-bit machine and O (10174) for a 32-bit machine and their respective integer arithmetic; the periodicity can be adjusted if it is required by the user in the normal version or statistically reaching the maximum in the enhanced 'stagger' version.An implementation of the method is available in the form of structured Fortran 77 functions and gives bettr results in term of velocity and periodicity than the other transportable functions compared with good quality of randomness.
Critical success factors in information center strategy
Authors: C. Royksund, M. Montri, J. F. Nunamaker,  Jr.
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

End user computing, whether on terminals or microcomputers, has created a need for training in the use of information technology, for controlling access to corporate data, for the preservation of corporate information integrity and compatibility, and for mediation between MIS/DP and other departments. Information centers, the formal corporate response to those needs, continue to grow in number and cost. An initial cost about $75,000 and support a staff of about 7 people is common. The cost, in both dollars and personnel, is a continuing concern to management. End user computing will probably soon consume the majority of corporate information budgets; perhaps as much as 70% by 1990. The question is whether ICs can avoid becoming obstacles to the tasks for which they were created. If information centers themselves become too costly and clumsy, they will become more of a burden than an advantage to their organizations. The solution is to distribute expertise about information systems throughout the organization. This report suggests that the way to do that is by distributing the &ldquo;process&rdquo; of distribution, partly by the use of key end users, and partially by leveraging expertise about the technology by use of the technology itself. Experts cannot be copied, but expertise can. The leveraging of human expertise is just now beginning to be realized. As ICs evolve from simple advice and training centers, or repositories of information, to centers for information about information, the key will be in the distribution of the distribution process itself.
Extended free-form deformation: a sculpturing tool for 3D geometric modeling
Authors: Sabine Coquillart
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

Current research efforts focus on providing more efficient and effective design methods for 3D modeling systems. In this paper a new deformation technique is presented. Among other things, arbitrarily shaped bumps can be designed and surfaces can be bent along arbitrarily shaped curves.The purpose of this research is to define a highly interactive and intuitive modeling technique for designers and stylists. A natural way of thinking is to mimic traditional trades, such as sculpturing and moulding.Furthermore, with this deformation technique, the modeling tool paradigm is introduced. The object is deformed with a user-defined deformation tool.This method is an extension of the Free-Form Deformation (FFD) technique proposed by Sederberg and Parry [17].
A generalized Ball curve and its recursive algorithm
Authors: H. B. Said
Venue: ACM Transactions on Graphics (TOG) (1989)

The use of Bernstein polynomials as the basis functions in B&eacute;zier's UNISURF is well known. These basis functions possess the shape-preserving properties that are required in designing free form curves and surfaces. These curves and surfaces are computed efficiently using the de Casteljau Algorithm. Ball uses a similar approach in defining cubic curves and bicubic surfaces in his CONSURF program. The basis functions employed are slightly different from the Bernstein polynomials. However, they also possess the same shape-preserving properties. A generalization of these cubic basis functions of Ball, such that higher order curves and surfaces can be defined and a recursive algorithm for generating the generalized curve are presented. The algorithm could be extended to generate a generalized surface in much the same way that the de Casteljau Algorithm could be used to generate a B&eacute;zier surface.
A network's work is never done
Authors: Richard Mace
Venue: ACM SIGUCCS Newsletter (1988)

Over the course of the last five or six years I've spent a good deal of my time working with institutions of higher education in the Bell-Atlantic Regional territory. I believe that the information-system model of higher education has done more to shape the direction of this industry, more to shape the direction that the major vendors are taking, than any other industry segment. That's why I spend a good deal of my time focusing on the activities that take place in higher education.
Intersecting subgroups of finite soluble groups
Authors: S. P. Glasby
Venue: Journal of Symbolic Computation (1988)

This paper describes an algorithm for constructing certain important subgroup intersections H @? K, of a finite soluble group G. The algorithm is applicable if the index of H in G is coprime to the index of K in G, or more generally, if each hypereccentric factor of G is covered by H or K. If G has composition length n, then the intersection algorithm computes H @? K using O(n^3 log|G|) group multiplications. This intersection algorithm can be applied to compute Sylow bases, system normalisers and complements to abelian terms of the lower nilpotent series. These structures are particularly useful for constructing the automorphism group of G. Intersecting arbitrary subgroups of a finite soluble group is, in general, a difficult problem. This is shown by an example where the subgroups H and K of G both avoid an eccentric factor of G, and computing H @? K is equivalent to constructing a discrete logarithm in a finite field. However, there are no known polynomial algorithms for constructing discrete logarithms.