ppxscal/embedding_network huggingface dataset:
The role and responsibility of the consultant
Authors: Eileen Driscoll
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

This paper examines the interaction that occurs between the computer consultant and his or her client, factors that affect that interaction, the role of the consultant in the research university, the consultant's personal responsibility in the interaction and ways to create change. The paper utilizes the method of institutional ethnography suggested by Dorothy Smith: place the consultant-client interaction within the organization of the research university. The paper describes how the consulting process works beginning from personal experiences of consultant and client and then places the interaction in the larger context of the university, academic training and research practices. The routinization of research separates it into many functions performed by people who may not understand the intended use of the research. The consultant performs two pieces of the research function &mdash; training clients to use the computer and helping them deal with any problems. In the course of our work, we as consultants encounter contradictions in the university system that create our individual feelings of inadequacy and burnout. We also may find it difficult to accept our personal responsibility for the uses made of the research in which we participate. Understanding our work and its place in the university is the first step toward creating change. This understanding can be increased by breaking our isolation and talking to each other about problems we encounter as consultants, by examining the ideology we participate in creating and by integrating our professional expertise with our desire to assist our clients. We need not blame ourselves for the shortcomings of the system. Changing the way we think about our world and our work is a way of changing our world and our work.
Simplification of real elementary functions
Authors: M. Bronstein
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

We describe an algorithm, based on Risch's real structure theorem, that determines explicitly all the algebraic relations among a given set of real elementary functions. We also provide examples from its implementation that illustrate the advantages over the use of complex logarithms and exponentials.
A module mechanism for constraints in Smalltalk
Authors: B. N. Freeman-Benson
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1989)

ThingLab II, a rewrite of ThingLab, provides two representations of objects: fully-exposed and interpreted Things, or hidden and compiled Modules. Both representations provide the full power of the ThingLab II constraint hierarchy (an ordering of constraint preferences), and both can be manipulated by the graphical user-interface. This paper briefly describes Modules and their environmental support in ThingLab II. It also describes the process by which the ModuleCompiler translates a collection of objects (a ThingLab II Thing) into a single object with compiled and optimized Smalltalk-80 methods (a Module).
Disk array performance in a random IO environment
Authors: T. M. Oslon
Venue: ACM SIGARCH Computer Architecture News (1989)

Large arrays of disks have been proposed as a way to meet the need for increasing IO bandwidth. This paper examines disk array performance in a random IO environment. It also presents the results of performance testing using the Prime IOBENCH trade; benchmark on a combination of disk striping, RAID 1, and RAID 5 disk arrays. It concludes, that for a given number of disk drives, that both RAID 1 and RAID 5 have acceptable performance in a read environment, while RAID 5 degrades significantly in an update intensive environment.
Optimization of horizontal microcode generation for loop structures
Authors: C. Eisenbeis
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

MIMOSA is an experimental software for the automatic generation and optimization of microcode for horizontal microprogrammed computers. Achieving peak performance on this class of machines depends heavily upon efficient use of low-level parallelism. MIMOSA takes advantage from high level dependence analysis done by a front-end vectorizer. It translates a FORTRAN loop into horizontal microcode, combining several techniques of optimization such as vectorization, pipeline scheduling, microcode compaction. This paper explains how these different tools are coupled together when applied to simple regular loops.
Performance-driven placement of cell based IC's
Authors: M. A. B. Jackson, E. S. Kuh
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The increasingly important role of the interconnect in the timing performance of present and future integrated circuit technologies underscores the need to reconsider conventional physical design CAD tools, and devise new ways to influence performance during layout. Interconnects are not perfect conductors, they introduce parasitic elements that load the logic gates and distort the temporal properties of the design as viewed by the logic designer. Cell placement that minimizes wirelength as the sole objective does not solve the problem, leaving a margin for performance improvement that has not been fully exploited. This paper presents a novel approach to performance-driven placement, combining timing analysis and physical design to dynamically optimize the performance of the chip during placement. The ideas are embodied in a program named Allegro, and preliminary results tested on Sea-of-Gate designs are encouraging.
Implementing large production systems in a DBMS environment: concepts and algorithms
Authors: T. Sellis, C. C. Lin, L. Raschid
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

It has been widely recognized that many future database applications, including engineering processes, manufacturing and communications, will require some kind of rule based reasoning. In this paper we study methods for storing and manipulating large rule bases using relational database management systems. First, we provide a matching algorithm which can be used to efficiently identify applicable rules. The second contribution of this paper, is our proposal for concurrent execution strategies which surpass, in terms of performance, the sequential OPS5 execution algorithm. The proposed method is fully parallelizable, which makes its use even more attractive, as it can be used in parallel computing environments.
A processor architecture for horizon
Authors: M. R. Thistle, B. J. Smith
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

Horizon is a scalable shared-memory Multiple Instruction stream - Multiple Data stream (MIMD) computer architecture independently under study at the Supercomputing Research Center (SRC) and Tera Computer Company. It is composed of a few hundred identical scalar processors and a comparable number of memories, sparsely embedded in a three-dimensional nearest-neighbor network. Each processor has a horizontal instruction set that can issue up to three floating point operations per cycle without resorting to vector operations. Processors will each be capable of performing several hundred Million Floating Point Operations Per Second (FLOPS) in order to achieve an overall system performance target of 100 Billion (1011) FLOPS. This paper describes the architecture of the processor in the Horizon system. In the fashion of the Denelcor HEP, the processor maintains a variable number of Single Instruction stream - Single Data stream (SISD) processes, which are called instruction streams. Memory latency introduced by the large shared memory is hidden by switching context (instruction stream) each machine cycle. The processor functional units are pipelined to achieve high computational throughput rates; however, pipeline dependencies are hidden from user code. Hardware mechanisms manage the resources to guarantee anonymity and independence of instruction streams.
Cecil: A Sequencing Constraint Language for Automatic Static Analysis Generation
Authors: Kurt M. Olender, Leon J. Osterweil
Venue: IEEE Transactions on Software Engineering (1990)

A flexible and general mechanism for specifying problems relating to the sequencing of events and mechanically translating them into dataflow analysis algorithms capable of solving those problems is presented. Dataflow analysis has been used for quite some time in compiler code optimization. Most static analyzers have been custom-built to search for fixed and often quite limited classes of dataflow conditions. It is shown that the range of sequences for which it is interesting and worthwhile to search in actually quite broad and diverse. A formalism for specifying this diversity of conditions is created. It is shown that these conditions can be modeled essentially as dataflow analysis problems for which effective solutions are known. It is also shown how these solutions can be exploited to serve as the basis for mechanical creation of analyzers for these conditions.
A graph partitioning algorithm by node separators
Authors: Joseph W. H. Liu
Venue: ACM Transactions on Mathematical Software (TOMS) (1989)

A heuristic graph partitioning scheme is presented to determine effective node separators for undirected graphs. An initial separator is first obtained from the minimum degree ordering, an algorithm designed originally to produce fill-reducing orderings for sparse matrices. The separator is then improved by an iterative strategy based on some known results from bipartite graph matching. This gives an overall practical scheme in partitioning graphs. Experimental results are provided to demonstrate the effectiveness of this heuristic algorithm on graphs arising from sparse matrix applications.
Actuarial and financial calculations with base value (⊥)
Authors: D. Michelson
Venue: ACM SIGAPL APL Quote Quad (1989)

This paper presents the use of base value (&perp;) for financial and actuarial calculations involving present (discounted) value and future (accumulated) value, annuities certain (both immediate and due), life annuities, and amortization. Base value can perform these calculations at either constant or varying interest. Simultaneous evaluation of various possible streams of payments under each of several scenarios of varying interest rates can be performed by a single bottom; with matrix (or higher rank) arrays for both left and right arguments.
Minimizing function-free recursive inference rules
Authors: Jeffrey F. Naughton
Venue: Journal of the ACM (JACM) (1989)

Recursive inference rules arise in recursive definitions in logic programming systems and in database systems with recursive query languages. Let D be a recursive definition of a relation t. D is considered minimal if for any predicate p in a recursive rule in D, p must appear in a recursive rule in any definition of t. It is shown that testing for minimality is, in general, undecidable. However, an efficient algorithm for a useful class of recursive rules is presented, and it is used to transform a recursive definition to a minimal recursive definition. Evaluating the minimized definition avoids redundant computation without the overhead of caching intermediate results and run-time checking for duplicate goals.
Vectorization on Monte Carlo particle transport: an architectural study using the LANL benchmark &ldquo;GAMTEB&rdquo;
Authors: P. J. Burns, M. Christon, R. Schweitzer, O. M. Lubeck, H. J. Wasserman
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

Fully vectorized versions of the Los Alamos National Laboratory benchmark code Gamteb, a Monte Carlo photon transport algorithm, were developed for the Cyber 205/ETA-10 and Cray X-MP/Y-MP architectures. Single-processor performance measurements of the vector and scalar implementations were modeled in a modified Amdahl's Law that accounts for additional data motion in the vector code. The performance and implementation strategy of the vector codes are related to architectural features of each machine. Speedups between fifteen and eighteen for Cyber 205/ETA-10 architectures, and about nine for CRAY X-MP/Y-MP architectures are observed. The best single processor execution time for the problem was 0.33 seconds on the ETA-10G, and 0.42 seconds on the CRAY Y-MP.
Resource management scheme in distributed environments
Authors: O. Nakamura, N. Saito
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

The user interface for distributed computing environment needs several kinds of transparency for resources which are distributed on many sites connected to the network. Access transparency and location transparency are general concept for distributed resources. In distributed environment, there are many resources of the same functions in various sites. For example, cashed resources which are complete duplicated resources exist on many sites in order to realize high performance. In this paper, the resource management scheme in the distributed environment is described. The sophisticated semantics transparency which is a general scheme for manipulating duplicated resources in distributed environment is provided. The specification language for the environment which provides semantics transparency is also discussed.
Arrangements of lines in 3-space: a data structure with applications
Authors: M. McKenna, J. O'Rourke
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

Let an arrangement of blue lines in 3-space be fixed, and imagine a movable red line entangled in the arrangement. We show an &Ogr;(n4&agr;(n)) algorithm for building a data structure that permits enumeration of mutually inaccessible classes of such red lines, where &agr;(n) is the inverse Ackermann function. The core of the algorithm is a construction of &Ogr;(n2) 2-D arrangement of hyperbolas, each in &Ogr;(n2&agr;(n)) time.The algorithm is applied to stabbing 3-polytopes, enumerating pairwise-visible face pairs, enumerating 2-D projections of convex 4-polytopes, and other problems, resulting in &Ogr;(n4&agr;(n)) algorithms in each case.
Foundations for the Arcadia environment architecture
Authors: Richard N. Taylor, Frank C. Belz, Lori A. Clarke, Leon Osterweil, Richard W. Selby, Jack C. Wileden, Alexander L. Wolf, Michael Young
Venue: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1989)

Early software environments have supported a narrow range of activities (programming environments) or else been restricted to a single &ldquo;hard-wired&rdquo; software development process. The Arcadia research project is investigating the construction of software environments that are tightly integrated, yet flexible and extensible enough to support experimentation with alternative software processes and tools. This has led us to view an environment as being composed of two distinct, cooperating parts. One is the variant part, consisting of process programs and the tools and objects used and defined by those programs. The other is the fixed part, or infrastructure, supporting creation, execution, and change to the constituents of the variant part. The major components of the infrastructure are a process programming language and interpreter, object management system, and user interface management system. Process programming facilitates precise definition and automated support of software development and maintenance activities. The object management system provides typing, relationships, persistence, distribution and concurrency control capabilities. The user interface management system mediates communication between human users and executing processes, providing pleasant and uniform access to all facilities of the environment. Research in each of these areas and the interaction among them is described.
Search direction by goal failure in goal-oriented programming
Authors: Jared L. Darlington
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1990)

A new approach to goal-oriented programming is described, whereby the search for values of variables to satisfy a goal is invariably directed by that goal or by information provided by its failure. This goal-directed approach is in contrast to that employed by logic programming systems, which attempt to satisfy a goal that has failed by resatisfying an already tested goal, and which furthermore do this in a way determined solely by the order of facts and rules in the database and without reference to the goal that has failed. Proposed changes in the control structure of logic programs designed to improve their execution serve more to reduce the search space than to add goal direction. A goal-directed language that embodies the new approach is presented. It is at the same time a functional programming language and a specification interpreter for the direct execution and testing of functional specifications, and permits the user to write executable program descriptions in which some of the constituent functions are fully defined while others are &ldquo;merely&rdquo; specified. The language has been successfully tested on examples drawn from such fields as deductive question answering and problem solving, where it compares favorably with the logic programming languages.
The Epsilon dataflow processor
Authors: V. G. Grafe, G. S. Davidson, J. E. Hoch, V. P. Holmes
Venue: ACM SIGARCH Computer Architecture News (1989)

The &egr;psilon dataflow architecture is designed for high speed uniprocessor execution as well as for parallel operation in a multiprocessor system. The &egr;psilon architecture directly matches ready operands, thus eliminating the need for associative matching stores. &egr;psilon also supports low cost data fan out and critical sections. A 10 MFLOPS CMOS/TTL processor prototype is running and its performance has been measured with several benchmarks. The prototype processor has demonstrated sustained performance exceeding that of comparable control flow processors running at higher clock rates (three times faster than a 20 Mhz transputer and 24 times faster than a Sun on a suite of arithmetic tests, for example).
Neural networks in APL
Authors: Manuel Alfonseca
Venue: ACM SIGAPL APL Quote Quad (1990)

Neural networks are fairly straightforward to program in a matrix oriented language such as APL. The only general improvement that would benefit them would be the implementation of sparse matrics. Small networks can be trained quite easily using the standard procedures (back propagation, etc).
Some computational aspects of circumscription
Authors: Phokion G. Kolaitis, Christos H. Papadimitriou
Venue: Journal of the ACM (JACM) (1990)

The effects of circumscribing first-order formulas are explored from a computational standpoint. First, extending work of V. Lifschitz, it is Shown that the circumscription of any existential first-order formula is equivalent to a first-order formula. After this, it is established that a set of universal Horn clauses has a first-order circumscription if and only if it is bounded (when considered as a logic program); thus it is undecidable to tell whether such formulas have first-order circumscription. Finally, it is shown that there arefirst-order formulas whode circumscription has a coNP-complete model-checking problem.
The impact of networking on university computer centers
Authors: Julie A. Bernard
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

In the past, University Computer Centers dominated campus computing activities. The computer centers grew up around batch-oriented, centrally located mainframe systems. While the general availability of terminals permitted a certain dispersal of computing activities, the bulk of computing equipment was housed inside the centers. The services provided by centers followed the same pattern, being also concentrated within the center. Changes were carefully managed, evolution carefully controlled. Consulting, training, and information services were high quality. Personal computers and networks altered the landscape of campus computing. Users no longer needed to rely on the center as a sole source of expertise, software, or even hardware. They bought their own computers, acquired their own software packages, trained themselves. The &ldquo;computer center on a desk&rdquo; was so much more convenient for them. This was fine for a while. Then people wanted to get access to the central databases, faster CPU, or other central facilities such as high-speed laser printers. They began looking to the centers for the support that they lacked. As a consequence, computer centers have been going through an identity crisis. Because of the inherently decentralized nature of the resulting topology, the centers are wrestling with a number of questions mainly involving responsibility and control of networks and network services. What role do universities expect their computer centers to take? To what degree are centers to be involved in the services available on the external networks? Are computer centers prepared (funded) to provide these services? How do centers become better informed as users of the network themselves? These questions have all boiled down to the main issue at hand. &ldquo;What has been the impact of networking on University Computer Centers and what is being done to address these changes?&rdquo; At New Mexico State University, distributed computing on campus is encouraged by the university computer center. Distributed computing is defined as a method of computing by which computing resources are physically distributed geographically and connected through networks. The computer center's policy is to provide consultation and not act as an authoritative figure. This policy will continue.
Computer generation of necessary integrability conditions for polynomial-nonlinear evolution systems
Authors: V. P. Gerdt, A. Y. Zharkov
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We use the symmetry approach to establish an efficient program in REDUCE for verifying necessary integrability conditions for polynomial-nonlinear evolution equations and systems in one-spatial and one-temporal dimensions. These conditions follow from the existence of higher infinitesimal symmetries and conservation law densities. We briefly consider the mathematical background of the symmetry approach to the problem of integrability. In the description of our algorithms and their implementation in REDUCE we present in particular the basic algorithm for reversing the operator of the total derivative with respect to the spatial variable. One of the most interesting application of the present program is the problem of classification when the complete list of integrable equations from a given multiparametric family is needed. In this case the program generates necessary integrability conditions in form of a system of nonlinear algebraic equations in the parameters present in the initial equations. In spite of their often complicated structure, there are systems for which the solution can be found in exact form by applying the technique of Groebner basis. We present three examples of evolution equations for which this system can in fact be solved.