ppxscal/embedding_network huggingface dataset:
Automating envisionment of virtual meeting room histories
Authors: Allen Ginsberg, Sid Ahuja
Venue: Proceedings of the third ACM international conference on Multimedia (1995)

This paper addresses the problem of how to automatically generate visual representations of recorded histories of distributed multimedia collaborations. The work reported here focuses mainly on what we consider to be an innovative approach to this problem, viz., the use of a temporal representation format that displays the generic meta-information associated with multimedia content in a way that lets users focus on and access the associated content of interest. As a concrete example of the use of meta-information, consider a user who would like to access any historical segments containing video of a particular collaborator. A meta-information-based approach can assist in this search by finding all the times at which the known video channel used by that person was in fact operative.In this paper we focus on elements involved in creating visual histories for meetings held in virtual meeting rooms. Besides showing how these elements can be used in laying out visual layouts for online meetings that may span days, or indeed, months in real-time. Meetings are just one aspect of collaborative work. Our ultimate goal is to expand the approach to deal with all the real and non-real time elements needed to provide users of remote collaboration environments with a sense of shared historical perspective.
Evaluation of AGV routing strategies using hierarchical simulation
Authors: Ralf W. Seifert, Michael G. Kay, James R. Wilson
Venue: Proceedings of the 27th conference on Winter simulation (1995)

To analyze the operation of an arbitrary AGV system under selected vehicle routing strategies, we present a simulation model that can handle multiple system layouts, a varying number of AGVs, and a varying number of pedestrians moving around the system. We introduce a dynamic vehicle routing strategy based on hierarchical simulation that operates as follows: at the time of each routing decision for an AGV in the main simulation, subsimulations are spawned for each of a varying number of alternative routes; and the performance observed in these subsimulations is then used to make the routing decision in the main simulation. A case study illustrates the advantages of this strategy.
Algorithm 760: Rectangular-grid-data surface fitting that has the accuracy of a bicubic polynomial
Authors: Hiroshi Akima
Venue: ACM Transactions on Mathematical Software (TOMS) (1996)

A local algorithm for smooth surface fitting for rectangular-grid data has been presented. It has the accuracy of a bicubic polynomial.
Tutorial on storage technology: RAID and beyond
Authors: Garth A. Gibson
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

In stark contrast to the 25% per year increase in areal density delivered by the magnetic disk industry during the 1970s and 1980s, yearly increases today are 60%, on par with DRAM density increases. Moreover, the storage industry is also delivering substantially higher data rates, smart disk-embedded readahead and writebehind, and a new generation of high-speed serial interconnects. This industry has also embraced Redundant Arrays of Inexpensive (or Independent) Disks (RAID) technology - 1997's RAID market is expected to be 13 billion dollars. With this rapidly evolving market and technology base, parallel storage systems must evolve beyond RAID levels 1 through 5. This talk is intended for researchers and practitioners interested in current trends in storage systems. It will highlight storage technology trends, RAID technology trends, and trends toward RAID-style support for network-based parallel storage systems.
Semaphores revisited with MMS
Authors: Pierre Castori
Venue: ACM SIGOPS Operating Systems Review (1995)

The objective of this article is to realize an in-depth study of MMS semaphores. This article is not a tutorial on MMS semaphores although it does explain to some extent how MMS semaphores behave and can be utilized. What we are trying to achieve is a definitive clarification of the MMS semaphore concept in order to make its use easier to MMS programmers and to encourage its adoption in the industrial applications and products. We compare MMS semaphores to Dijkstra's classical semaphores and show that real differences exist. Other mechanisms are also discussed (monitors, CSP). Examples are provided to illustrate our analysis and references to the semaphore mechanism of some operating systems are given to ease the comparison. We come to the conclusion that MMS semaphores are flexible but cannot be utilized to solve all kinds of problems classical semaphores usually cope with. We also explain why the two kinds of semaphores provided by MMS are redundant.
Some comments on &ldquo;A solution to a problem with Morel and Renvoise's 'Global optimization by suppression of partial redundancies'&rdquo;
Authors: Arthur Sorkin
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1989)

Abstract: Drechsler and Stadel presented a solution to a problem with Morel and Renvoise's &ldquo;Global Optimization by Suppression of Partial Redundancies.&rdquo; We cite some earlier generalizations of Morel and Renvoise's algorithm that solve the same problem, and we comment on their applicability.
Clustered time warp and logic simulation
Authors: Hervé Avril, Carl Tropper
Venue: ACM SIGSIM Simulation Digest (1995)

We present, in this paper, a hybrid algorithm which makes use of Time Warp between clusters of LPs and a sequential algorithm within the cluster. Time Warp is, of course, traditionally implemented between individual LPs. The algorithm was implemented in a digital logic simulator, and its performance compared to that of Time Warp.Resting upon this platform we develop a family of three checkpointing algorithms, each of which occupies a different point in the spectrum of possible trade-offs between memory usage and execution time. The algorithms were implemented on several digital logic circuits and their speed, number of states saved and maximal memory consumption were compared to those of Time Warp. One of the algorithms saved between 35 and 50% of the maximal memory consumed by Time Warp (depending upon the number of processors used), while the other two decreased the maximal usage up to 30%. The latter two algorithms exhibited a speed comparable to Time Warp, while the first algorithm was 30-60% slower.These algorithms are also simpler to implement than optimal checkpointing algorithms.
Duality and Black Box Interpolation I: The One Variable Nonderogatory Case
Authors: Vaidyanath Mani, Robert E. Hartwig
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

The one variable black box interpolation problem is solved for the case of a nonderogatory linear operator on a vector space over a closed field.
Experimental results from dynamic slicing of C programs
Authors: G. A. Venkatesh
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1995)

Program slicing is a program analysis technique that has been studied in the context of several different applications in the construction, optimization, maintenance, testing, and debugging of programs. Algorithms are available for constructing slices for a particular execution of a program (dynamic slices), as well as to approximate a subset of the behavior over all possible executions of a program (static slices). However, these algorithms have been studied only in the context of small abstract languages. Program slicing is bound to remain an academic exercise unless one can not only demonstrate the feasibility of building a slicer for nontrivial programs written in a real programming language, but also verify that a type of slice is sufficiently thin, on the average, for the application for which it is chosen. In this article, we present results from using SLICE, a dynamic program slicer for C programs, designed and implemented to experiment with several different kinds of program slices and to study them both qualitatively and quantitatively. Several application programs, ranging in size (i.e., number of lines of code) over two orders of magnitude, were sliced exhaustively to obtain average worst-case metrics for the size of program slices.
Java intermediate bytecodes: ACM SIGPLAN workshop on intermediate representations (IR'95)
Authors: James Gosling
Venue: ACM SIGPLAN Notices (1995)

Java is a programming language loosely related to C++. Java originated in a project to produce a software development environment for small distributed embedded systems. Programs needed to be small, fast, &ldquo;safe&rdquo; and portable. These needs led to a design that is rather different from standard practice. In particular, the form of compiled programs is machine independent bytecodes. But we needed to manipulate programs in ways usually associated with higher level, more abstract intermediate representations. This lets us build systems that are safer, less fragile, more portable, and yet show little performance penalty while still being simple.
World-Wide Web and computer science reports
Authors: Edward A. Fox
Venue: Communications of the ACM (1995)

With the advent of the World-Wide Web, computing professionals have eagerly pursued the idea of moving from a paper-based technical report service to one that employs networked information systems. Many departments keep some version of their reports on an FTP server to help with this process. To facilitate access to CS reports a number of sites have set up lists of these archives (see sidebar).
A modern, agent-oriented approach to introductory artificial intelligence
Authors: Stuart Russell, Peter Norvig
Venue: ACM SIGART Bulletin (1995)

We describe our experiences in teaching introductory AI and in writing a textbook for the course. The book tries to make the concepts of AI more concrete via two strategies: relating them to the student's existing knowledge, and using examples based on an agent operating in an environment.
Copyright and digital libraries
Authors: Pamela Samuelson
Venue: Communications of the ACM (1995)

This issue of Communications highlights some of the many projects underway for the creation or enhancement of digital libraries. At the moment, no one seems to think there will be only one gargantuan digital library to sate the public's appetite for information. Rather, the expectation is that there will be many digital libraries, most of which will have specialized collections and will be internetworked together in a way loosely resembling today's Internet. Most digital library project planners are aware there are intellectual property issues that must be resolved in order to successfully deploy their libraries. Some proposals for digital library projects express an intent to resolve intellectual property issues as part of the overall plan for the library, albeit without much specificity about how this would be achieved in their systems [2, 4].
The conference control channel protocol (CCCP): a scalable base for building conference control applications
Authors: Mark Handley, Ian Wakeman, Jon Crowcroft
Venue: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication (1995)

This paper presents the Conference Control Channel Protocol (CCCP), a new scheme intended for controlling conferences ranging from small, tightly coupled meetings, to extremely large loosely coupled seminars. We describe the requirements of such a scheme, and present a framework for building systems that connect together new and existing applications.
Theory of Fault-Based Predicate Testing for Computer Programs
Authors: Kuo-Chung Tai
Venue: IEEE Transactions on Software Engineering (1996)

Predicates appear in both the specification and implementation of a program. One approach to software testing, referred to as predicate testing, is to require certain types of tests for a predicate. In this paper, three fault-based testing criteria are defined for compound predicates, which are predicates with one or more AND/OR operators. BOR (boolean operator) testing requires a set of tests to guarantee the detection of (single or multiple) boolean operator faults, including incorrect AND/OR operators and missing/extra NOT operators. BRO (boolean and relational operator) testing requires a set of tests to guarantee the detection of boolean operator faults and relational operator faults (i.e., incorrect relational operators). BRE (boolean and relational expression) testing requires a set of tests to guarantee the detection of boolean operator faults, relational operator faults, and a type of fault involving arithmetical expressions. It is shown that for a compound predicate with n, n > 0, AND/OR operators, at most n + 2 constraints are needed for BOR testing and at most 2 * n + 3 constraints for BRO or BRE testing, where each constraint specifies a restriction on the value of each boolean variable or relational expression in the predicate. Algorithms for generating a minimum set of constraints for BOR, BRO, and BRE testing of a compound predicate are given, and the feasibility problem for the generated constraints is discussed. For boolean expressions that contain multiple occurrences of some boolean variables, how to combine BOR testing with the meaningful impact strategy developed by Weyuker, Goradia, and Singh [21] is briefly described.
Verification, validation, and accreditation (VV A) of models and simulations through reduced order metamodels
Authors: Don Caughlin
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The paper provides a new approach to support verification, validation, and accreditation (VV&A) of models and simulations. The need for efficient and objective methods to verify, validate and accredit models and simulations is greater than ever. More and more decisions are based on computer generated data that are derived from models and simulations. The strength of these decisions is a direct function of the validity of this data. Based on the system identification of reduced order models, this new approach approximates a complex high-dimensional model or simulation by a relatively simple mathematical model valid over a specified domain and range of interest. Verification or validation is then accomplished by the straightforward comparison of the reduced order model structure and coefficients with the baseline data or system. Well-developed identification methods and a structured procedure make this process more efficient and objective than existing methods.
A simulation and analysis of bank teller manning
Authors: Donald Hammond, Sathi Mahesh
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The paper presents an application study to find cost effective bank teller management policies for providing high quality service levels at reasonable costs in a modern banking system. Two models are developed. The first is a spreadsheet model to calculate desired teller manning levels from mathematical queuing models, and the second is a simulation model for testing new management policies. Manning heuristics are tested and found to provide the desired level of services.
An information systems perspective of the SIGCHI curricula
Authors: Ted J. Strickland,  Jr.
Venue: ACM SIGCHI Bulletin (1995)

The SIGCHI curricula report published in 1992 [ACM 1992] describes four proposed courses in HCI and two model curricula for HCI. This paper critiques the curricula report's recommendations as they pertain to an undergraduate information systems course and to the structure of a recently revised curriculum in Computer Information Systems. The evaluation found that the curricula report is useful as an initial set of curriculum guidelines, but that customization of its recommendations is needed to satisfy individual program, college, and university objectives. Suggestions for improvements to the curricula report and advice to information systems curriculum developers are listed.
A Conflict Sense Routing Protocol and Its Performance for Hypercubes
Authors: Emmanouel A. Varvarigos, Dimitri P. Bertsekas
Venue: IEEE Transactions on Computers (1996)

We propose a new switching format for multiprocessor networks, which we call Conflict Sense Routing Protocol. This switching format is a hybrid of packet and circuit switching, and combines advantages of both. We initially present the protocol in a way applicable to a general topology. We then present an implementation of this protocol for a hypercube computer and a particular routing algorithm. We also analyze the steady-state throughput of the hypercube implementation for random node-to-node communications.
A research status report on adaptation for mobile data access
Authors: Brian D. Noble, M. Satyanarayanan
Venue: ACM SIGMOD Record (1995)

Mobility demands the systems be adaptive. One approach is to make adaptation transparent to applications, allowing them to remain unchanged. An alternative approach views adaptation as a collaborative partnership between applications and the system. This paper is a status report on our research on both fronts. We report on our considerable experience with application-transparent adaptation in the Coda File System. We also describe our ongoing work on application-aware adaptation in Odyssey.2e
Efficient Monte-Carlo simulation of a product-form model for a cellular system with dynamic resource sharing
Authors: Philip J. Fleming, Dennis Schaeffer, Burton Simon
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1995)

There are many ways for users to share the radio spectrum allocated to a cell in a cellular phone system. We analyze a commonly proposed scheme wh ere the cell is divided into s sectors. Each sector has exclusive access to a certain number of channels. The remaining channels reside in a &ldquo;common pool&rdquo; and are shared among the sectors. The smallest unit of bandwidth that can be borrowed from the common pool is a &ldquo;carrier,&rdquo; which consists of c channels. When viewed as a multidimensional birth-death process, the steady-state distribution of the number of active channels in each sector has a &ldquo;product form,&rdquo; but because the state space is large and has a nonlinear boundary, direct calculation of quantities of interest is usually impractical. Ross and Wang have developed a Monte-Carlo technique that applies to our problem. We significantly improve the efficiency of their technique when applied to our problem by including certain (nonlinear) control variates. The kinds of control variates we use can be applied to other loss systems as well. We also explore the effect of importance sampling for our system. In many cases the variance reduction achieved from the combination of importance sampling and control variates is far greater than from either method alone. For systems with blocking probabilities in the range 0.001 to 0.1, the variance of the system-blocking probability estimator can be reduced by several orders of magnitude.
Framework for the design and analysis of large scale material handling systems
Authors: Santhanam Harit, G. Don Taylor
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Automated material handling systems have become an integral part of handling and storage applications in many manufacturing and logistics sectors. The purported benefits of cost effectiveness and efficient operation have resulted in widespread acceptance of this equipment in industry. A tremendous amount of research during the last decade has focused on studying the design and control problems associated with automated material handling systems. The research focus has been on problems of "manageable" size and complexity, while a large number of applications exist in which simulation is the only method for tackling the design and control issues. This discussion is motivated by applications which indicate the need for new methodologies for handling large scale problems. The design constraints imposed by large scale systems and possible solution approaches for choosing the type of material handling equipment are presented in this paper. Simulation is introduced as a feasible, inclusive, and cost-effective means of evaluating alternative solution approaches and equipment components.
Interval rational = algebraic
Authors: Vladik Kreinovich
Venue: ACM SIGNUM Newsletter (1995)

Rational functions can be defined as compositions of arithmetic operations (+, -,.,:). What class of functions will be get if we add to this list the "interval" operation (that transforms a function f of n variables and given intervals X1, ...., Xn into the bounds for the range f(X1, ..., Xn))? In this paper, we prove that adding this "interval" operation to rational functions leads exactly to the set of all (locally) algebraic functions.In other words, algebraic functions can be described as compositions of arithmetic operations and the "interval" operation.This result provides an additional explanation of why naive interval computations sometimes overshoot: bull; the desired dependency is (locally) a genera algebraic function; bull; naive interval methods results in a (locally) rational function; bull; not all algebraic functions are rational.
Construction and Analysis of Fourth-Order Finite Difference Schemes for the Acoustic Wave Equation in Nonhomogeneous Media
Authors: Gary Cohen, Patrick Joly
Venue: SIAM Journal on Numerical Analysis (1996)

In this article, we construct and analyse a family of finite difference schemes for the acoustic wave equation with variable coefficients. These schemes are fourth-order accurate in space and time in the case of smooth media and are designed to remain stable and "optimal" for reflection-transmission phenomena in the case of discontinuous coefficients. Together with a detailed mathematical study, various numerical results are presented.
IBM MQSeries commercial messaging
Authors: Paul Williams
Venue: ACM SIGICE Bulletin (1995)

Business organisations are re-engineering, restructuring and resizing to become more competitive, or even, to survive. Businesses are transforming themselves into flat, networked organisations and exploring new relationships with customers, suppliers and channels to deliver products and services, a concept which is described as the 'virtual company'. A contracted dynamic work force is also beginning to emerge, one that is tailored to the needs of the business.