ppxscal/embedding_network huggingface dataset:
Saving legacy with objects
Authors: W. C. Dietrich,  Jr., L. R. Nackman, F. Gracer
Venue: ACM SIGPLAN Notices (1989)

Developers of application software must often work with &ldquo;legacy systems.&rdquo; These are systems that have evolved over many years and are considered irreplaceable, either because it is thought that duplicating their function would be too expensive, or because they are trusted by users. Because of their age, such systems are likely to have been implemented in a conventional language with limited use of data abstraction or encapsulation. The lack of abstraction complicates adding new applications to such systems and the lack of encapsulation impedes modifying the system because applications depend on system internals. We describe our experience providing and using an object-oriented interface to a legacy system.
What's ahead for 2000 A.D.?
Authors: Howard J. Smith,  Jr.
Venue: ACM SIGAPL APL Quote Quad (1990)

On January 1, 2000 many applications will stop working properly. Most utilities and applications express the year as the two low order digits of the full representation of the year so that dates in the new century will appear to occur before dates in the old. When this phenomenon occurred in the past humans adapted quickly, and no great dislocation occurred. Unfortunately, the computer is not as adaptable or reasonable as the human. This paper presents one possible solution to the problem, at least in the APL environment. This solution involves replacing date fields in files and records with a pseudo-Julian day number (PJD). This number permits the analyst to use date information arithmetically to determine the day of the week, the period between dates, create lists of dates, etc. The PJD is easily converted to or from human-usable canonical date forms. Finally, the technique defers difficulties due to changes of year, century, millennium, etc. indefinitely. In the later sections of the paper some thoughts on possible extensions to the leap-year algorithm are discussed. The new terms would improve precision without affecting the past or present. Finally, sample functions which support and utilize this &ldquo;perpetual&rdquo; calendar are given. It must be emphasized that this paper represents a solution only within the APL environment. The concept is applicable in any environment, language or system but only if it or a similar solution is adopted before December 31, 1999. If we users of APL recognize and fix the problem in our environment while the rest of the computing world ignores it, the problem will still affect everyone, including us.
Skewed projections with an application to line stabbing in R3
Authors: J. W. Jaromczyk, M. Kowaluk
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

A new geometrical transform, skewed-projection, is introduced. This transform is applied to design a new algorithm for a common transversal problem for families of polyhedra in R3. The time and space analysis, using Davenport-Schinzel sequences, is given.
Dynamical simulations of granular materials using the Caltech hypercube
Authors: B. T. Werner, P. K. Haff
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

A technique for simulating the motion of granular materials using the Caltech Hypercube is described. We demonstrate that grain dynamics simulations run efficiently on the Hypercube and therefore that they offer an opportunity for greatly expanding the use of parallel simulations in studying granular materials. Several examples, which illustrate how the simulations can be used to extract information concerning the behavior of granular materials, are discussed.
Design of a loading plan format for an expert cargo loading system
Authors: Ron LeMaster, Ulla Merz
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

Many computer systems assist users in the performance of tasks by providing metaphors for the tasks themselves. The success of such systems hinge on how accurately and effectively the user interface represents those tasks. In this paper we describe such a representation for the task of loading boxed appliances into truck trailers. This representation was used to provide the format for the loading plans generated by an expert system constructed to plan the loading of such products. These plans tell the warehouse personnel that actually load the trucks just where each product is to be placed in the truck, how it is to be oriented, as well as where extra padding and filler material should be placed.
A note on the preconditioning for factorization of homogeneous polynomials
Authors: S. Moritsugu, E. Goto
Venue: ACM SIGSAM Bulletin (1989)

This paper proposes a method for the improvement of factorization of homogeneous polynomials by some preconditioning. The result of experimental implementation is given, which shows the effectiveness of our method.
Editing and debugging with Windows and a mouse
Authors: Garth H. Foster, Abdelatif Elgouri, Franklin Liu
Venue: ACM SIGAPL APL Quote Quad (1990)

This paper describes how full screen editing and debugging using a mouse and windows can be added to the APL2/PC programming environment. The use of AP124 and a special purpose auxiliary processor to support windowing are described.
Evaluating office systems: some comments and general guidelines
Authors: David W. Conrath, Ravi S. Sharma
Venue: ACM SIGOIS Bulletin (1989)

In the present work, we critically examine the literature on performance evaluation and attempt to synthesize it into a coherent contingency theory for office support systems. More specifically, we review the various approaches suggested by others in order to provide an understanding of the technical, economic and psycho-social factors that must form the basis of any evaluation strategy useful to the practitioner.
Extending a relational database with deferred referential integrity checking and intelligent joins
Authors: Stephanie Cammarata, Prasadram Ramachandra, Darrell Shane
Venue: ACM SIGMOD Record (1989)

Interactive use of relational database management systems (DBMS) requires a user to be knowledgeable about the semantics of the application represented in the database. In many cases, however, users are not trained in the application field and are not DBMS experts. Two categories of functionality are problematic for such users: (1) updating a database without violating integrity constraints imposed by the domain and (2) using join operations to retrieve data from more than one relation. We have been conducting research to help an uninformed or casual user interact with a relational DBMS. This paper describes two capabilities to aid an interactive database user who is neither an application specialist nor a DBMS expert. We have developed deferred Referential Integrity Checking (RIC) and Intelligent Join (IJ) which extend the operations of a relational DBMS. These facilities are made possible by explicit representation of database semantics combined with a relational schema. Deferred RIC is a static validation procedure that checks uniqueness of tuples, non-null keys, uniqueness of keys, and inclusion dependencies. IJ allows a user to identify only the &ldquo;target&rdquo; data which is to be retrieved without the need to additionally specify &ldquo;join clauses&rdquo;. In this paper we present the motivation for these facilities, describe the features of each, and present examples of their use.
Update in hierarchical data bases
Authors: M. E. Iofinova, E. A. Komissartschik
Venue: Lecture notes in computer science on ICDT '88 (1988)

Usually information comes into a data base input of documents with fixed structure. In this paper, the process of input in hierarchical data base is formally described. A data base is considered as a result of input of documents and its update is considered as an update of some of the documents with corresponding update of the state of the data base. An algorithm of decomposition of the data base to the source documents is given. The algorithm works in a time that is linear in a volume of input information. Basing upon this algorithm, an algorithm of update with the same time of complexity is obtained.
Bounding Availability of Repairable Systems
Authors: R. R. Muntz, E. de Souza e Silva, A. Goyal
Venue: IEEE Transactions on Computers (1989)

Markov models are widely used for the analysis of availability of computer/communication systems. Realistic models often involve state-space cardinalities that are so large that it is impractical to generate the transition-rate matrix let alone solve for availability measures. An approximation technique is presented for determining steady-state availability. Of particular interest is that the method also provides bounds on the error. Examples are given to illustrate the method.
Min-cost partitioning on a tree structure and applications
Authors: G. Vijayan
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

We introduce a generalization of the min-cut partitioning problem, called Min-Cost Tree Partitioning, in which the nodes of an hypergraph G are to be mapped on to the vertices of a tree structure T, and the cost function to be minimized is the cost of routing the hyperedges (i.e., the nets) of G on the edges of T. We discuss several interesting VLSI design applications for this problem. We describe an iterative improvement heuristic for solving this problem.
A modular approach to the computation of the number of real roots
Authors: J. Llovet, J. R. Sendra
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

The problem of computing the number of distinct real roots of a real polynomial can be solved analyzing the sign variations of the sequence of principal minors of the Hankel matrix associated with the given polynomial. In this paper, we present a modular algorithm to achieve this goal. In this approach, the principal minors sequence of the associated Hankel matrix is computed using modular methods. The computing time analysis shows that the maximum computing time function of the modular algorithm is &Ogr;(n5 l2), where n is the degree of the polynomial and l its length. Let K[x] be a polynomial ring over the unique factorization domain K, and &fnof;(x), g(x) &egr; K[x (deg(&fnof;) = n, deg(g) = m, m &le; n). Then, we mean by the K-Hankel matrix Hn (f, g) associated with {f, g}, the matrix (hi,j)1&le;i,j&le;n, where hi,j = di+j-1 and q(x) = dn-mxn+m-1 + &hellip; + d2n-1 is the pseudoquotient of x2n-1 g(x) and &fnof;(x) (di = 0 if 1 &le; i < n - m). We also mean by the Q (K)-Hankel matrix Hn (f, g) associated with {f, g}, the matrix (hi,j) 1&le;i,j&le;n, where hi,j = di+j-1 and q(x) = dn-mxn+m-1 + &hellip; + d2n-1 is the quotient of x2n-1g(x) and &fnof;(x) in the quotient field Q (K) of K (di = 0 if 1 &le; i < n - m). If K is the real field and g(x) is the derivative of &fnof;(x) (n = deg(&fnof;)), then we associate with the real polynomial &fnof; the matrix Hn(f, f&prime;). We also denote the i x i principal submatrix of Hn by Hi. We write &Dgr;i = sgn(Di), Di = det(Hi) &ne; 0, and otherwise &Dgr;i = (-1)i(i-1)/2 &Dgr;k, provided that Dk &ne; 0, Dj = 0 for k < j &le; i. A classical result due to Frobenious states that the number of distinct real roots of the polynomial &fnof;(x) is &ngr; = r - 2V, where V is the number of sign variations of the sequence S = (1, &Dgr;1, &hellip;, &Dgr;r), and r = rank(Hn). Therefore, an effective method can be achieved computing the sequence of principal minors. This can be done algorithmically in &Ogr;(n2) operations using the fundamental vector sequence.
Impact of a restricted natural language interface on ease of learning and productivity
Authors: H. Albert Napier, Richard R. Batsell, Norman S. Guadango, David M. Lane
Venue: Communications of the ACM (1989)

People process natural language in real time and with very limited short-term memories. This article describes a computational architecture for syntactic performance that also requires fixed finite resources.
Digital E-beam testing
Authors: R. E. Horstman, F. J. A. Lier
Venue: Microelectronic Engineering (1988)

A digital measurement of the secondary electron current in E-beam testers is performed by counting the separate electrons that hit the detector. This has advantages for waveform measuements with short beam pulses or low currents. For long pulses and large currents a digital-feedback loop is designed, which in an iterative way adjusts the voltage on the retarding grid of a spectrometer. Both techniques offer a multi-sampling capability, which gives a proportional increase of the measurement speed.
An Algorithm for Finding a Common Structure Shared by a Family of Strings
Authors: A. M. Landraud, J. F. Avril, P. Chretienne
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

An algorithm is presented for extracting and localizing a common structure in a family of strings with time complexity O(N/sup 2/L/sup 2/ log/sub 2/ L) where N is the number of strings and L their maximum length. The method could be extended to two-dimensional image analysis. This structure appears as alignments of words which are similar but not necessarily identical and which occur approximately at the same location in all the strings. The method works in two successive stages. First, a fast algorithm is used for drawing up a directory of exactly repeated patterns appearing in a given majority of strings. Second, the algorithm constructs recursively anchoring patterns by a divide-and-conquer strategy and converges on a maximum number of alignments. This algorithm has been applied to find common a priori unknown features in families of biological macromolecules, with quite good results. One of these families included 23 strings of about 100 characters each. Each characteristic structure has been achieved within less than one minute on a MULTIX-DPS8 system.
MMAIM: a software development method for Ada, part II&mdash;Example
Authors: J. Carter
Venue: ACM SIGAda Ada Letters (1988)

Part I of this paper described the notation and method for the Martin Marietta Ada Implementation Method (MMAIM). Part II demonstrates the use of MMAIM with an example. This allows the quality of the solution produced by MMAIM to be evaluated.
Electron beam irradiation effects on MOS-transistors and its significance to E-beam testing
Authors: D. W. Ranasinghe, D. J. Machin, G. Proctor
Venue: Microelectronic Engineering (1988)

The aim of this paper is to show the effects of e-beam irradiation on both passivated and un-passivated MOS transistors down to 1um geometries. In particular, the shift in threshold and leakage current under different exposure conditions have been investigated and a mechanism for the observed changes explored. Finally, some guide lines within which e-beam testing could be done with minimum change in the performance of the device are given.
Gröbner bases and Hilbert schemes. I
Authors: Giuseppa Carrà Ferro
Venue: Journal of Symbolic Computation (1988)

Let
Specification and verification of network managers for large internets
Authors: D. L. Cohrs, B. P. Miller
Venue: Symposium proceedings on Communications architectures protocols (1989)

Large internet environments are increasing the difficulty of network management. Integrating increasing numbers of autonomous subnetworks (each with an increasing number of hosts) makes it more difficult to determine if the network managers of the subnetworks will interoperate correctly. We propose a high level, formal specification language, NMSL, as an aid in solving this problem. NMSL has two aspects of operation, a descriptive aspect and a prescriptive aspect. In its descriptive aspect, NMSL specifies abstractions of the network components and their instantiations, and verifies the consistency of such a specification. The abstractions include the data objects and processes in a network management system. These abstractions are instantiated on network elements. Network elements are grouped together in the specification of domains of administration. An extension mechanism is provided to allow for the specification of new management characteristics that the basic language cannot express. In its prescriptive aspect, NMSL generates configuration information directly from a consistent specification. This information is used to configure network management processes to make their operation consistent with their specifications. Standard management protocols (such as the emerging ISO or IETF standards) can be used to incorporate the configuration information into running management processes.
Computing resources in small colleges
Authors: James R. Sidbury, Nancy Baxter, Richard F. Dempsey, Ralph Morelli, Robert Prince
Venue: ACM SIGCSE Bulletin (1988)

The participants will describe experiences at their institutions with different computing environments: Mini-computer, IBM PC Lab, Macintosh Lab, Sun Workstation Lab. Each panelist will address similar issues as they relate to these environments in small colleges: Funding Candid evaluation of Hardware and Software including networking Course usage in computer science Usage by other disciplines Management of the facility Time is planned for an open discussion among participants and audience on questions of mutual interest.
Queries and views in an object-oriented data model
Authors: Umeshwar Dayal
Venue: Proceedings of the second international workshop on Database programming languages (1989)

This paper shows how a semantic data model can be extended to become an object-oriented data model. The model is based on abstract entities, functions, types, and inheritance. The paper discusses issues that were considered in designing two query languages for this object-oriented model. Early languages for object-oriented data models were navigational and iterative, and did not support associative or set-oriented queries. Relational query languages, on the other hand, are purely associative and set-oriented. The languages we define here uniformly support the formulation of associative and navigational queries over objects, and also of queries that return individual objects as well as those that return aggregates (collections) of objects. One query language is an extension of DAPLEX; the other is algebraic. The algebra serves both to define the semantics of the higher level language, and also as the basis for query optimization. We illustrate how to map queries from the higher level language to the algebra. Finally, we discuss the special problems of defining views in object-oriented data models.
Parallelizing a database programming language
Authors: B. E. Hart, S. Danforth, P. Valduriez
Venue: Proceedings of the first international symposium on Databases in parallel and distributed systems (2000)

We extend distributed database query optimization techniques to support a database programming language, a language much richer than relational query languages. With the richness comes difficulties, e.g., how to recognize joins and how to handle aliases. In this paper we describe our techniques: dataflow analysis, abstract evaluation, partial evaluation, and rewriting. Also, we overview the algorithm that uses these techniques.
Performance optimized floor planning by graph planarization
Authors: B. Lokanathan, E. Kinnen
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A new procedure for VLSI floor planning that minimizes routing parasitics is presented. The procedure, based on rectangular dualization, maximizes adjacency of modules that are heavily connected or connected by critical nets. Wiring macros are introduced to provide routing area for those modules that cannot be located adjacent to one another; these macros are located by planarizing the system interconnectivity graph using an edge crossing strategy that minimizes the cost of intersection. The rectangular dual is compacted using heuristics to approximate a quadratic area constraint by one or more linear constraints, thereby reducing the complexity of compaction from that of quadratic programming to linear programming.
Regeneration of Replicated Objects: A Technique and its Eden Implementation
Authors: Calton Pu, Jerre D. Noe, Andrew Proudfoot
Venue: IEEE Transactions on Software Engineering (1988)

A replicated directory system based on a method called regeneration is designed and implemented. The directory system allows selection of arbitrary object to be replicated, choice of the number of replicas for each object, and placement of the copies on machines with independent failure modes. Copies can become inaccessible due to node crashes, but as long as a single copy survives, the replication level is restored by automatically replacing lost copies on other active machines. The focus is on a regeneration algorithm for replica replacement and its application to a replicated directory structure in the Eden local area network. A simple probabilistic approach is used to compare the availability provided by the algorithm to three other replication techniques.
Knot insertion for Beta-spline curves and surfaces
Authors: Barry Joe
Venue: ACM Transactions on Graphics (TOG) (1990)

Discrete Beta-splines arise when a Beta-spline curve is subdivided; that is, extra knots are inserted so that the curve is expressed in terms of a larger number of control vertices and Beta-splines. Their properties and an algorithm for their computation are given in &ldquo;Discrete Beta-Splines&rdquo; by Joe (Computer Graphics, vol. 21, pp. 137-144). We prove a stronger version of one of these properties, from which a new algorithm for computing discrete Beta-splines is obtained. This algorithm can also be used to compute discrete B-splines. We give a comparison of operation counts for this algorithm versus other algorithms, and for two methods to compute the new control vertices of Beta-spline and B-spline curves and surfaces.
Pixel-planes 5: a heterogeneous multiprocessor graphics system using processor-enhanced memories
Authors: Henry Fuchs, John Poulton, John Eyles, Trey Greer, Jack Goldfeather, David Ellsworth, Steve Molnar, Greg Turk, Brice Tebbs, Laura Israel
Venue: ACM SIGGRAPH Computer Graphics (1989)

This paper introduces the architecture and initial algorithms for Pixel-Planes 5, a heterogeneous multi-computer designed both for high-speed polygon and sphere rendering (1M Phong-shaded triangles/second) and for supporting algorithm and application research in interactive 3D graphics. Techniques are described for volume rendering at multiple frames per second, font generation directly from conic spline descriptions, and rapid calculation of radiosity form-factors. The hardware consists of up to 32 math-oriented processors, up to 16 rendering units, and a conventional 1280 times; 1024-pixel frame buffer, interconnected by a 5 gigabit ring network. Each rendering unit consists of a 128 times; 128-pixel array of processors-with-memory with parallel quadratic expression evaluation for every pixel. Implemented on 1.6 micron CMOS chips designed to run at 40MHz, this array has 208 bits/pixel on-chip and is connected to a video RAM memory system that provides 4,096 bits of off-chip memory. Rendering units can be independently reasigned to any part of the screen or to non-screen-oriented computation. As of April 1989, both hardware and software are still under construction, with initial system operation scheduled for fall 1989.