ppxscal/embedding_network huggingface dataset:
Inside the C++ object model
Authors: Stanley B. Lippman
Venue:  (1996)

Inside the C++ Object Model focuses on the underlying mechanisms that support object-oriented programming within C++: constructor semantics, temporary generation, support for encapsulation, inheritance, and "the virtuals"-virtual functions and virtual inheritance. This book shows how your understanding the underlying implementation models can help you code more efficiently and with greater confidence. Lippman dispells the misinformation and myths about the overhead and complexity associated with C++, while pointing out areas in which costs and trade offs, sometimes hidden, do exist. He then explains how the various implementation models arose, points out areas in which they are likely to evolve, and why they are what they are. He covers the semantic implications of the C++ object model and how that model affects your programs.Highlights Explores the program behavior implicit in the C++ Object Model's support of object-oriented programming. Explains the basic implementation of the object-oriented features and the trade offs implicit in those features. Examines the impact on performance in terms of program transformation. Provides abundant program examples, diagrams, and performance measurements to relate object-oriented concepts to the underlying object model.If you are a C++ programmer who desires a fuller understanding of what is going on "under the hood," then Inside the C++ Object Model is for you!
AutoView
Authors: Richard Stafford
Venue: Proceedings of the 27th conference on Winter simulation (1995)

This presentation is a tutorial on AutoView, an AutoMod extension package that recreates model animation according to a user-defined script. AutoView allows users to restart animation and move back and forth in time and 3-D space. Animation is created using text files generated from an AutoMod simulation model. By creating a user-defined camera description file, animation can take place that allows for panning from one view to another, as well as for attaching the camera to a simulated load or vehicle and traveling with that entity during portions of the animation. The animation is provided at an enhanced response time because it does not have the logical and statistical processes of AutoMod (which can slow animation). This tutorial demonstrates several animation scripts previously constructed with AutoView, discusses the creation of AutoView files from AutoMod, and describes the development of a camera description file.
Development of the Domain Name System
Authors: Paul V. Mockapetris, Kevin J. Dunlap
Venue: ACM SIGCOMM Computer Communication Review (1995)

The Domain Name System (DNS) provides name service for the DARPA Internet. It is one of the largest name services in operation today, serves a highly diverse community of hosts, users, and networks, and uses a unique combination of hierarchies, caching, and datagram access.This paper examines the ideas behind the initial design of the DNS in 1983, discusses the evolution of these ideas into the current implementations and usages, notes conspicuous surprises, successes and shortcomings, and attempts to predict its future evolution.
On the Minimal Number of Even Submatrices of 0-1 Matrices
Authors: Iosif Pinelis
Venue: Designs, Codes and Cryptography (1996)

An asymptotic formula for the minimum possible number of evenp\times q submatrices of an m\times n 0-1 matrixA is obtained. It is shown that if A is considered random and pq is even, then the distribution of the number of the even p\times q submatrices of A is highly skewed to the right, the left endpoint of the distribution being very close to its mean, while its right endpoint is twice the mean. A relation to Tur&aacute;n numbers is indicated.
A parallel incompressible flow solver package with a parallel multigrid elliptic kernel
Authors: John Z. Lou, Robert D. Ferraro
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

A parallel time-dependent incompressible flow solver and a parallel multigrid elliptic kernel are described. The flow solver is based on a second-order projection method applied to a staggered finite-difference grid. The multigrid algorithms implemented in the elliptic kernel, which is needed by the flow solver, are V-cycle and full V-cycle schemes. A grid-partition strategy is used in the parallel implementations of both the flow solver and the multigrid elliptic kernel on all fine and coarse grids. Numerical experiments and parallel performance tests show the parallel solver package is numerically stable, physically robust and computationally efficient. Both the multigrid elliptic kernel and the flow solver scale very well to a large number of processors on the Intel Paragon and the Cray T3D for computations with moderate granularity. The solver package has been carefully designed and coded so that it can be easily adapted to solving a variety of interesting two and three-dimensional flow problems. The solver package is portable to parallel systems that support MPI, PVM and Intel NX for interprocessor communications.
Perturbation Bounds for the Generalized Schur Decomposition
Authors: Ji-Guang Sun
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

This paper uses a technique described by M. M. Konstantinov, P. Hr. Petkov, and N. D. Christov [SIAM J. Matrix Anal. Appl., 15 (1994), pp. 383--392] to derive perturbation bounds for the generalized Schur decomposition of a regular matrix pair with distinct eigenvalues.
The Cafe ConstructionKit: a toolkit for sociality
Authors: Mark S. Ackerman
Venue: ACM SIGOIS Bulletin (1995)

Many user communities have a problem of delivering help and general assistance. Unfortunately, the user is often left to sift through reams of documentation, find his way through mail archives, or pursue answers through trial and error. Normally, one attempts to examine the documentation or other help sources, and then wanders out into a hallway in search of friendly colleagues.The problem becomes acute, however, in distributed communities. I take for my example the astrophysics community, although this problem exists in most scientific communities. In the astrophysics community, the users may be spread across the world, they may work in isolation, and they may have need of relatively specialized help. What I would like is to build is a surrogate for this hallway talk. Such a solution must avoid the broadcast problem of flooding everyone's electronic mail basket with thousands of questions. Instead, this research proposes building a system to narrow-cast a question to the appropriate others, whether those others are experts or colleagues.My thesis work consisted of building a Computer-Supported Cooperative Work system called Answer Garden [1] [4]. Answer Garden allows organizations to develop databases of commonly asked questions that grow "organically" as new questions arise and are answered. Answer Garden 2, the current project, attempts to solve the problems encountered in field studies of the original system [2]. A new architecture provides a customizable and adaptable set of software components that allow a variety of organizational and informational configurations.In order to construct Answer Garden 2, however, it has been necessary to develop an underlying communications infrastructure called the Cafe ConstructionKit. Cafe has turned out to be a generalized and quite useful system in its own right.
A brief overview of ATM: protocol layers, LAN emulation, and traffic management
Authors: Kai-Yeung Siu, Raj Jain
Venue: ACM SIGCOMM Computer Communication Review (1995)

Asnychronous Transfer Mode (ATM) has emerged as the most promising technology in supporting future broadband multimedia communication services. To accelerate the deployment of ATM technology, the ATM Forum, which is a consortium of service providers and equipment vendors in the communication industries, has been created to develop implementation and specification agreements. In this article, we present a brief overview on ATM protocol layers and current progress on LAN Emulation and Traffic Management in the ATM Forum.
Lattice QCD on the IBM scalable POWERParallel Systems SP2
Authors: C. Bernard, C. DeTar, S. Gottlieb, U. M. Heller, J. Hetrick, N. Ishizuka, L. Karkkainen, S. R. Lantz, K. Rummukainen, R. Sugar, D. Toussaint, M. Wingate
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

A 512 node IBM Scalable POWERParallel Systems SP2 was installed at the Cornell Theory Center in October 1994. During the past couple of months we have been porting and optimizing code for carrying out lattice QCD calculations. Present performance is far from ideal, however, and optimization efforts are still under way. The rate limiting step in our code involves a rather generic inversion of a large, sparse system, based on a partial differential equation in a multidimensional space. The insights we have gained so far may be useful in diagnosing performance in a wide class of applications.
Radiosity and hybrid methods
Authors: László Neumann, Attila Neumann
Venue: ACM Transactions on Graphics (TOG) (1995)

We examine various solutions to the global illumination problem, based on an exact mathematical analysis of the rendering equation. In addition to introducing efficient radiosity algorithms, we present a uniform approach to reformulate all of the basic radiosity equations used so far. Using hybrid methods we are able to analyze possible combinations of the view-dependent ray-tracing method and of the low-resolution radiosity-based method, and to offer new algorithms.
Germany: computer graphics in computer science and art education
Authors: Werner Hansmann
Venue: ACM SIGGRAPH Computer Graphics (1996)

The vitality of computer graphics education in Germany persists. The last general inquiry on computer graphics education was made in 1993 by the Special Interest Group on Computer Graphics within the German Society of Computer Science (Gesellschaft f uuml;r Informatik (GI)) [2, 3, 4]. Since then, the number of institutions at German universities that offer an education in computer graphics (generally professors appointed for teaching and research in the field) has risen considerably. While the 1993 survey came up with 29 individuals at 26 universities, the current situation shows 40 at 33 universities.In general, the fundamental education in computer graphics at an academic level (i.e. discursive dealing with methods of both computer graphics and various related fields) is carried out at universities, usually as part of the curricula in Computer Science Departments. Education in computer graphics, which is primarily application oriented, can be obtained in Engineering and Art Departments of universities, at technical schools (Fachhochschulen) and art schools (Hochschulen f uuml;r Kunst). The previously mentioned investigation of 1993 focused on computer graphics education at universities and technical schools. The recent surveys were conducted to determine the current situation of computer graphics as a subject of academic education per se, as well as a means and tool for art education.
Splitting the Square of a Schur Function into its Symmetric and Antisymmetric Parts
Authors: Christophe Carré, Bernard Leclerc
Venue: Journal of Algebraic Combinatorics: An International Journal (1995)

We propose a new combinatorial description of the product of two Schur functions. In the particular case of the square of a Schur function SI, it allows to discriminate in a very natural way between the symmetric and antisymmetric parts of the square. In other words, it describes at the same time the expansion on the basis of Schur functions of the plethysms S2(SI) and &Lambda;2(SI). More generally our combinatorial interpretation of the multiplicities c_{IJ}^K \ = \ (S_IS_J, S_K) leads to interesting q-analogues c_{IJ}^K (q) of these multiplicities. The combinatorial objects that we use are domino tableaux, namely tableaux made up of 1 &times; 2 rectangular boxes filled with integers weakly increasing along the rows and strictly increasing along the columns. Standard domino tableaux have already been considered by many authors &lsqb;33&rsqb;, &lsqb;6&rsqb;, &lsqb;34&rsqb;, &lsqb;8&rsqb;, &lsqb;1&rsqb;, but, to the best of our knowledge, the expression of the Littlewood-Richardson coefficients in terms of Yamanouchi domino tableaux is new, as well as the bijection described in Section 7, and the notion of the diagonal class of a domino tableau, defined in Section 8. This construction leads to the definition of a new family of symmetric functions (H-functions), whose relevant properties are summarized in Section 9.
Doing the Twist: Diagonal Meshes Are Isomorphic to Twisted Toroidal Meshes
Authors: Barak A. Pearlmutter
Venue: IEEE Transactions on Computers (1996)

We show that a k×n diagonal mesh is isomorphic to a ${\textstyle{{n+k} \over 2}}\times {\textstyle{{n+k} \over 2}}-{\textstyle{{n-k} \over 2}}\times {\textstyle{{n-k} \over 2}}$ twisted toroidal mesh, i.e., a network similar to a standard ${\textstyle{{n+k} \over 2}}\times {\textstyle{{n+k} \over 2}}$ toroidal mesh, but with opposite handed twists of ${\textstyle{{n-k} \over 2}}$ in the two directions, which results in a loss of $\left( {{\textstyle{{n-k} \over 2}}} \right)^2$ nodes.
Corrigendum: Lagrange Multipliers in Stochastic Programming
Authors: Sjur Didrik Flam
Venue: SIAM Journal on Control and Optimization (1995)

This note deals with an error in S. D. Flam, SIAM J. Control Optim., 30 (1992), pp. 1-10. Using approximate subdifferentials the author corrects that error by deriving a Fritz John optimality condition for abstract programs constrained by cones which may have empty interior.
On the modeling and performance characteristics of a serpentine tape drive
Authors: Bruce K. Hillyer, Avi Silberschatz
Venue: ACM SIGMETRICS Performance Evaluation Review (1996)

New applications require online access to many terabytes of data, but a magnetic disk storage system this large requires thousands of drives. Magnetic tape is be a good alternative, except that the application demand for transparent data retrieval is not met by current tape systems because of their high access latency. This latency can be significantly improved by good retrieval scheduling. A fundamental prerequisite to efficient scheduling is the ability to estimate the amount of time required for tape positioning operations (the locate time). For serpentine tape, which is the most common mass storage tape technology, this estimation is subtle and complex. The main contribution of this paper is a locate-time model for a DLT4000 tape drive. The accuracy of the model is evaluated by measurements, and the utility of the model is demonstrated through a model-driven simulation of retrieval scheduling, validated by measurements and sensitivity testing. In brief, the locate-time model is accurate to within a few percent, which enables the production of efficient schedules.
Determining job completion time distributions in stochastic production environments
Authors: C. Nirmal Hasan, Mark L. Spearman
Venue: Proceedings of the 27th conference on Winter simulation (1995)

As responsiveness becomes more of a competitive issue, knowledge of completion times of jobs and orders on the shop floor is key to the success and even survival of many manufacturing firms. We present two approaches-a fast sample path generation technique and a numerical technique-to determine the distribution of completion times of jobs in stochastic production environments. We compare our results with those obtained from conventional discrete event simulation and also compare speed of execution. We also show that the distribution obtained from the numerical integration technique provides a lower bound to the actual distribution of the completion times.
InfoHarness: a system for search and retrieval of heterogeneous information
Authors: Leon Shklar, Amit Sheth, Vipul Kashyap, Satish Thatte
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

Enormous amounts of heterogeneous information have been accumulated within corporations, government organizations and universities. It is becoming increasingly easier to create new information, but the knowledge about the existence, location, and means of retrieval of information, have become so confusing as to give rise to the phenomenon of write-only databases.
Recent advances in simulation for security pricing
Authors: Phelim Boyle, Mark Broadie, Paul Glasserman
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Computational methods play an important role in modern finance. Through the theory of arbitrage-free pricing, the price of a derivative security can be expressed as the expected value of its payouts under a particular probability measure. The resulting integral becomes quite complicated if there are several state variables or if payouts are path-dependent. Simulation has proved to be a valuable tool for these calculations. This paper summarizes some of the recent applications and developments of the Monte Carlo method to security pricing problems.
Guidelines for presentation and comparison of indexing techniques
Authors: Justin Zobel, Alistair Moffat, Kotagiri Ramamohanarao
Venue: ACM SIGMOD Record (1996)

Descriptions of new indexing techniques are a common outcome of database research, but these descriptions are sometimes marred by poor methodology and a lack of comparison to other schemes. In this paper we describe a framework for presentation and comparison of indexing schemes that we believe sets a minimum standard for development and dissemination of research results in this area.
On a Sturm Sequence of Polynomials for Unitary Hessenberg Matrices
Authors: Angelika Bunse-Gerstner, Chunyang He
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

Unitary matrices have a rich mathematical structure that is closely analogous to real symmetric matrices. For real symmetric matrices this structure can be exploited to develop very efficient numerical algorithms and for some of these algorithms unitary analogues are known. Here we present a unitary analogue of the bisection method for symmetric tridiagonal matrices. Recently Delsarte and Genin introduced a sequence of so-called $\gamma_n$-symmetric polynomials that can be used to replace the classical Szego polynomials in several signal processing problems. These polynomials satisfy a three-term recurrence relation and their roots interlace on the unit circle. Here we explain this sequence of polynomials in matrix terms. For an $n\times n$ unitary Hessenberg matrix, we introduce, motivated by the Cayley transformation, a sequence of modified unitary submatrices. The characteristic polynomials of the modified unitary submatrices $p_k(z), k=1,2,\ldots,n$ are exactly the $\gamma_n$-symmetric polynomials up to a constant. These polynomials can be considered as a sort of Sturm sequence and can serve as a basis for a bisection method for computing the eigenvalues of the unitary Hessenberg matrix. The Sturm sequence properties allow identification of the number of roots of $p_n(z)$, the characteristic polynomial of the unitary Hessenberg matrix itself, on any arc of the unit circle by computing the sign agreements of certain related real polynomials at a given point.
Better static memory management: improving region-based analysis of higher-order languages
Authors: Alexander Aiken, Manuel Fähndrich, Raph Levien
Venue: ACM SIGPLAN Notices (1995)

Static memory management replaces runtime garbage collection with compile-time annotations that make all memory allocation and deallocation explicit in a program. We improve upon the Tofte/Talpin region-based scheme for compile-time memory management[TT94]. In the Tofte/Talpin approach, all values, including closures, are stored in regions. Region lifetimes coincide with lexical scope, thus forming a runtime stack of regions and eliminating the need for garbage collection. We relax the requirement that region lifetimes be lexical. Rather, regions are allocated late and deallocated as early as possible by explicit memory operations. The placement of allocation and deallocation annotations is determined by solving a system of constraints that expresses all possible annotations. Experiments show that our approach reduces memory requirements significantly, in some cases asymptotically.
Projection Method II: Godunov--Ryabenki Analysis
Authors: Weinan E, Jian-Guo Liu
Venue: SIAM Journal on Numerical Analysis (1996)

This is the second of a series of papers on the subject of projection methods for viscous incompressible flow calculations. The purpose of the present paper is to explain why the accuracy of the velocity approximation is not affected by (1) the numerical boundary layers in the approximation of pressure and the intermediate velocity field and (2) the noncommutativity of the projection operator and the laplacian. This is done by using a Godunov--Ryabenki type of analysis in a rigorous fashion. By doing so, we hope to be able to convey the message that normal mode analysis is basically sufficient for understanding the stability and accuracy of a finite-difference method for the Navier--Stokes equation even in the presence of boundaries. As an example, we analyze the second-order projection method based on pressure increment formulations used by van Kan and Bell, Colella, and Glaz. The leading order error term in this case is of $O(\dt)$ and behaves as high frequency oscillations over the whole domain, compared with the $O(\dt^{1/2})$ numerical boundary layers found in the second-order Kim--Moin method.
Parallel performance of a combustion chemistry simulation
Authors: Gregg Skinner, Rudolf Eigenmann
Venue: Scientific Programming (1995)

We used a description of a combustion simulation's mathematical and computational methods to develop a version for parallel execution. The result was a reasonable performance improvement on small numbers of processors. We applied several important programming techniques, which we describe, in optimizing the application. This work has implications for programming languages, compiler design, and software engineering.
Software architectures for cooperative systems
Authors: Tom Gross
Venue: ACM SIGOIS Bulletin (1995)

This position paper describes my interest in this workshop as well as some topics which I think should be dealt with. Most topics are outlined through questions or problems which as I think offer no or no sufficient solutions.
Bootstrap methods in computer simulation experiments
Authors: Russell C. H. Cheng
Venue: Proceedings of the 27th conference on Winter simulation (1995)

We critically review the work that has been done in applying basic, smoothed and parametric bootstrap methods to simulation experiments. We develop a framework to classify bootstrap methods in this context and use it to compare various bootstrap schemes. Most bootstrap methods are hard to analyse theoretically. An exception is the parametric case for which a detailed analysis can be carried out. An interesting result in this case is that, whereas in standard statistical experiments bootstrap samples give only information about the variance of a statistic and not its mean, this turns out not to be so in simulation experiments. Thus parametric bootstrap samples can be advantageously included in estimates of the responses of interest.
University of Michigan Digital Library Project
Authors: Laurie Crum
Venue: Communications of the ACM (1995)

The University of Michigan Digital Library Project (NSF-UMDL) is a multidisciplinary collaboration among faculty and staff throughout the University of Michigan. Initial use and evaluation of the NSF-UMDL will take place in science classes in Ann Arbor, Mich. high schools and the Stuyvesant High School in New York City, as well as instruction and research at the university. Access will also be available through Ann Arbor and New York City public libraries. External partners to the project include: IBM, Elsevier Science, Apple Computer, Bellcore, UMI International, McGraw-Hall, Encyclopaedia Britannica Educational Corporation, and Kodak.