ppxscal/embedding_network huggingface dataset:
Dual Eulerian Properties of Plane Multigraphs
Authors: Bradley S. Carlson, C. Y. Roger Chen, Dikran S. Meliksetian
Venue: SIAM Journal on Discrete Mathematics (1995)

A plane multigraph is said to be dual Eulerian if both itself and its dual contain an Euler path or circuit and the Euler paths have corresponding edge sequences. In this paper several properties of plane multigraphs are derived, and a necessary and sufficient condition for a plane multigraph to be dual Eulerian is given. Although the necessary and sufficient condition for a multigraph to be Eulerian is somewhat trivial, the necessary and sufficient condition for a plane multigraph to be dual Eulerian is not. Nevertheless, the question of whether or not a plane multigraph is dual Eulerian can be answered in time proportional to a linear function of the number of edges of the graph, and an algorithm that answers this question is presented in this paper. This theory can be applied to the layout synthesis of functional cells for Complementary Metal-Oxide Semiconductor Very Large-Scale Integrated circuits.
Reducing the MISR Size
Authors: Jacob Savir
Venue: IEEE Transactions on Computers (1996)

Multiple-input signature registers (MISRs) are commonly used in built-in self-test (BIST) applications. The size of the MISR is dictated by the number of signals it has to compress. Normally a MISR includes a stage for every signal that it is sampling. In some applications this leads to very wide MISRs that may include several hundred stages.Large size MISRs pose problems in terms of hardware and wiring overhead. Shorter compressors are, therefore, needed.This paper investigates the problem of reducing the MISR so that it samples multiple signals at every stage. Issues like detection probability loss, test length penalty, fault coverage degradation, are some of the disadvantages that may arise from the MISR shrinkage. This paper analyzes all these issues; shows ways to reduce their negative effect, and compares the results to previously published proposals.
On the average communication complexity of asynchronous distributed algorithms
Authors: John N. Tsitsiklis, George D. Stamoulis
Venue: Journal of the ACM (JACM) (1995)

We study the communication complexity of asynchronous distributed algorithms. Such algorithms can generate excessively many messages in the worst case. Nevertheless, we show that, under certain probabilistic assumptions, the expected number of messages generated per time unit is bounded by a polynomial function of the number of processors under a very general model of distributed computation. Furthermore, for constant-degree processor graphs, the expected number of generated messages is only O(nT), where n is the number of processors and T is the running time. We conclude that (under our model) any asynchronous algorithm with good time complexity will also have good communication complexity, on the average.
A parallel distributed simulation of a large-scale PCS network: keeping secrets
Authors: Brian A. Malloy, Albert T. Montroy
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Recently, research and development of complex PCS (personal communication service) networks has increased, due to the rise in demand for mobile cellular communications. The efficiency of a PCS network is crucial in minimizing cost while maintaining quality service to mobile subscribers. Simulation is used extensively to facilitate the development of an efficient network. We present a conservative distributed simulation of a large scale PCS network. The conservative approach that we propose permits large simulations using the PVM software to configure the network into a parallel machine. Using a unique approach to exploit lookahead, we are able to induce speedups comparable to those produced by C.D. Carothers et al. (1994).
Deploying complex decision technologies with APL to solve the daily output planning problem: a tale from two of the last of the Jedi Knights
Authors: Kenneth Fordyce, Gerald Gary Sullivan
Venue: Proceedings of the international conference on Applied programming languages (1995)

A key decision faced each day, shift, or time period at a semiconductor manufacturing facility is how many wafers or lots it should commit to produce at each operation over a specified period of time to meet immediate demand and position the line to meet tomorrow's demand. This paper will describe an approach which integrates various decision technologies using APL to generate a &ldquo;daily output plan&rdquo; for low part number high volume wafer fabrication lines. A related approach for high part number logic lines using due dates is not described in this paper. The ability of the &ldquo;APL Problem Solving environment&rdquo; to easily handle very different decision technologies was critical to the development of this approach.
Architectural issues for distributed virtual reality
Authors: Rick Kazman
Venue: ACM SIGOIS Bulletin (1995)

Of necessity, virtual environments are becoming multi-user, spanning heterogeneous platforms, potentially physically separated. When designing such systems, numerous questions arise of how to organize the functionality in the system to meet software engineering considerations such as modularity, modifiability, reusability, and scalability. This position paper discusses how the design of the WAVES architecture supports these software engineering criteria.
Plactification
Authors: Victor Reiner, Mark Shimozono
Venue: Journal of Algebraic Combinatorics: An International Journal (1995)

We study a map called plactification from reduced words to words. This map takes Coxeter-Knuth equivalence to Knuth equivalence, and has applications to the enumeration of reduced words, Schubert polynomials and certain Specht modules.
Embedded video in hypermedia documents: supporting integration and adaptive control
Authors: Dick C. A. Bulterman
Venue: ACM Transactions on Information Systems (TOIS) (1995)

As the availability of digital video becomes commonplace, a shift in application focus will occur from merely accessing video as an independent data stream to embedding video with other multimedia data types into coordinated hypermedia presentations. The migration to embedded video will present new demands on application and support environments: processing of any one piece of video data will depend on how that data relates to other data streams active within the same presentation. This article describes presentation, synchronization, and interaction control issues for manipulating embedded video. First we describe the requirements for embedded video, contrasted against other forms of video use. Next we consider mechanisms for describing and implementing the behavior of embedded-video segments relative to other data items in a document; these relationships form the basis of implementing cooperative control among the events in a presentation. Finally we consider extending the possibilities for tailoring embedded video to the characteristics of the local runtime environment; this forms the basis for adaptive, application-level quality-of-service control of a presentation. In all cases, we describe a mechanism to externalize the behavior of hypermedia presentations containing resource-intensive data requirements so that effective control can be implemented by low-level system facilities based on application-specific requirements. We present our results in terms of the CMIFed authoring/presentation system.
Holland classifier systems
Authors: Andreas Geyer-Schulz
Venue: ACM SIGAPL APL Quote Quad (1995)

A Holland classifier system is an adaptive, general purpose machine learning system which is designed to operate in noisy environments with infrequent and often incomplete feedback. Examples of such environments are financial markets, stock management systems, or chemical processes. In financial markets, a Holland classifier system would develop trading strategies, in a stock management system order heuristics, and in a chemical plant it would perform process control. In this paper we describe a Holland classifier system and present the implementation of its components, namely the production system, the bucket brigade algorithm, the genetic algorithm, and the cover detector, cover effector and triggered chaining operator. Finally, we illustrate the working of a Holland classifier system by learning to find a path with a high payoff in a simple finite state world.
&mgr;-EP-1: a simple 32-bit architecture
Authors: B. Ulmann
Venue: ACM SIGARCH Computer Architecture News (1995)

This article describes a very simple but quite powerful 32-bit architecture ideally suited for experimental and educational purposes in computer architecture design. It employs a very orthogonal instruction set in conjunction with 16 general purpose registers and a simple interrupt capability. It was developed at the University of Mainz, Germany and a prototype using standard TTL-circuits is being developed --- large parts of the microcode are written and simple assembler and an emulator written in FORTRAN already exists.
Implementing crash recovery in QuickStore: a performance study
Authors: Seth J. White, David J. DeWitt
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

Implementing crash recovery in an Object-Oriented Database System (OODBMS) raises several challenging issues for performance that are not present in traditional DBMSs. These performance concerns result both from significant architectural differences between OODBMSs and traditional database systems and differences in OODBMS's target applications. This paper compares the performance of several alternative approaches to implementing crash recovery in an OODBMS based on a client-server architecture. The four basic recovery techniques examined in the paper are termed page differencing, sub-page differencing, whole-page logging, and redo-at-server. All of the recovery techniques were implemented in the context of QuickStore, a memory-mapped store built using the EXODUS Storage Manager, and their performance is compared using the OO7 database benchmark. The results of the performance study show that the techniques based on differencing generally provide superior performance to whole-page logging.
Relaxing Synchronization in Distributed Simulated Annealing
Authors: Chul-Eui Hong, Bruce M. McMillin
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

This paper presents a cost error measurement scheme and relaxed synchronization method, for simulated annealing on a distributed memory multicomputer, which predicts the amount of cost error that an algorithm will tolerate. An adaptive error control method is developed and implemented on an Intel iPSC/2.Index Terms¿Optimization, partial synchrony, state maintenance, cost error, parallelism, algorithms.
Evaluating queries with generalized path expressions
Authors: Vassilis Christophides, Sophie Cluet, Guido Moerkotte
Venue: Proceedings of the 1996 ACM SIGMOD international conference on Management of data (1996)

In the past few years, query languages featuring generalized path expressions have been proposed. These languages allow the interrogation of both data and structure. They are powerful and essential for a number of applications. However, until now, their evaluation has relied on a rather naive and inefficient algorithm.In this paper, we extend an object algebra with two new operators and present some interesting rewriting techniques for queries featuring generalized path expressions. We also show how a query optimizer can integrate the new techniques.
Towards adaptive scheduling of tasks in transactional workflows
Authors: Manolis Marazakis, Christos Nikolaou
Venue: Proceedings of the 27th conference on Winter simulation (1995)

The paper discusses dynamic workload management in transaction processing systems where the workload consists of multiple classes of units of work, including workflows comprised of interdependent tasks. Business requirements specify that differing levels of service must be provided to different classes of work, thus it is natural to specify performance goals per work class, that reflect the business requirements for the work class as well as the inherent resource demands of the units of work. Adaptive algorithms have been proposed for the satisfaction of performance goals of transaction classes. Scheduling the execution of complete workflows, which are multi-transaction units of work, is complicated by the need for task coordination, due to both control and data flow dependencies among tasks. Current transaction processing monitors provide infrastructure for the coordination of tasks by means of queueing facilities. We draw on previous work on goal-oriented resource management to design adaptive task scheduling algorithms. A detailed simulator of transaction processing systems with a queueing facility has been developed, with the specific aim to study the performance for workloads that include multi-transaction units of work.
Productivity trends in certain office-intensive sectors of the U.S. Federal Government
Authors: Raymond R. Panko
Venue: ACM Transactions on Information Systems (TOIS) (1985)

It is often said that office productivity is virtually stagnant, increasing only about 4 percent every 10 years. The methodology used to estimate this 4 percent figure is examined and found to be inaccurate! There is no known way to estimate overall national office productivity trends. Productivity trends in a single part of the economy, however, can be examined, namely, office-intensive sectors of the U.S. federal government. Productivity in these sectors is found to be anything but stagnant, having increased 1.7 percent annually from 1967 to 1981 and 3.0 percent annually from 1977 through 1981.
DCD&mdash;disk caching disk: a new approach for boosting I/O performance
Authors: Yiming Hu, Qing Yang
Venue: Proceedings of the 23rd annual international symposium on Computer architecture (1996)

This paper presents a novel disk storage architecture called DCD, Disk Caching Disk, for the purpose of optimizing I/O performance. The main idea of the DCD is to use a small log disk, referred to as cache-disk, as a secondary disk cache to optimize write performance. While the cache-disk and the normal data disk have the same physical properties, the access speed of the former differs dramatically from the latter because of different data units and different ways in which data are accessed. Our objective is to exploit this speed difference by using the log disk as a cache to build a reliable and smooth disk hierarchy. A small RAM buffer is used to collect small write requests to form a log which is transferred onto the cache-disk whenever the cache-disk is idle. Because of the temporal locality that exists in office/engineering work-load environments, the DCD system shows write performance close to the same size RAM (i.e. solid-state disk) for the cost of a disk. Moreover, the cache-disk can also be implemented as a logical disk in which case a small portion of the normal data disk is used as the log disk. Trace-driven simulation experiments are carried out to evaluate the performance of the proposed disk architecture. Under the office/engineering work-load environment, the DCD shows superb disk performance for writes as compared to existing disk systems. Performance improvements of up to two orders of magnitude are observed in terms of average response time for write operations. Furthermore, DCD is very reliable and works at the device or device driver level. As a result, it can be applied directly to current file systems without the need of changing the operating system.
Coupling the user interfaces of a multiuser program
Authors: Prasun Dewan, Rajiv Choudhary
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1995)

We have developed a new model for coupling the user interfaces of a multiuser program. It is based on an interaction model and a user interface framework that allow users and programmers, respectively, to view applications as editors of data. It consists of a semantics model, a specification model, and an implementation model for coupling. The semantics model determines (1) which properties of interaction entities created for a user are shared with corresponding interaction entities created for other users and (2) when changes made by a user to a property of an interaction entity are communicated to other users sharing it. It divides the properties of an interaction entity into multiple coupling sets and allows users to share different coupling sets independently. It supports several criteria for choosing when a change made by a user to a shared property is communicated to other users. These criteria include how structurally complete the change is, how correct it is, and the time at which it was made. The specification model determines how users specify the desired semantics of coupling. It associates interaction entities with inheritable coupling attributes, allows multiple users to specify values of these attributes, and does a runtime matching of the coupling attributes specified by different users to derive the coupling among their user interfaces. The implementation model determines how multiuser programs implement user-customizable coupling. It divides the task of implementing the coupling between system-provided modules and application programs. The modules support automatically a predefined semantics and specification model that can be extended by the programs. We have implemented the coupling model as part of a system called Suite. This paper describes and motivates the model using the concrete example of Suite, discusses how aspects of it can be implemented in other systems, compares it with related work, discusses its shortcomings, and suggests directions for future work.
On Generators of the Module of Logarithmic 1-Forms with Poles Along an Arrangement
Authors: Sergey Yuzvinsky
Venue: Journal of Algebraic Combinatorics: An International Journal (1995)

For each element X of codimension two of the intersection lattice of a hyperplane arrangement we define a differential logarithmic 1-forms &omega;X with poles along the arrangement. Then we describe the class of arrangements for which forms &omega;X generate the whole module of the logarithmic 1-forms with poles along the arrangement. The description is done in terms of linear relations among the functionals defining the hyperplanes. We construct a minimal free resolution of the module generated by &omega;X that in particular defines the projective dimension of this module. In order to study relations among &omega;X we construct free resolutions of certain ideals of a polynomial ring generated by products of linear forms. We give examples and discuss possible generalizations of the results.
Values, personal information privacy, and regulatory approaches
Authors: Sandra J. Milberg, Sandra J. Burke, H. Jeff Smith, Ernest A. Kallman
Venue: Communications of the ACM (1995)

The relationships among nationality, cultural values, personal information privacy concerns, and information privacy regulation are examined in this article.
An introduction to Remy's fast polymorphic record projection
Authors: Limsoon Wong
Venue: ACM SIGMOD Record (1995)

Traditionally, a record projection is compiled when all fields of the record are known in advance. The need to know all fields in advance leads to very clumsy programs, especially for querying external data sources. In a paper that had not been widely circulated in the database community, Remy presented in programming language context a constant-time implementation of the record projection operation that does not have such a requirement. This paper introduces his technique and suggests an improvement to his technique in the context of database queries.
Evaluating software engineering methods and tool&mdash;part 4: the influence of human factors
Authors: Chris Sadler, Barbara Ann Kitchenham
Venue: ACM SIGSOFT Software Engineering Notes (1996)

In previous articles, we have described the range of methods available if you want to evaluate a software engineering method/tool and the criteria you need to consider to select a method appropriate to your individual circumstances. In future articles we will describe some guidelines to help you perform quantitative case studies and feature analysis. However, in this article we would like to review some of the human factors issues that can affect an evaluation exercise.
Array mapping in behavioral synthesis
Authors: Herman Schmit, Donald E. Thomas
Venue: Proceedings of the 8th international symposium on System synthesis (1995)

Abstract: This paper discusses the mapping of arrays in a behavior to memories in an implementation. We introduce a design representation based on a variety of array grouping techniques and the binding of array groups to memory components with different dimensions, access times, and number of ports. The results of design actions are computed in terms of the number of memory components and the length of schedules in the behavior. We demonstrate the ability of a synthesis tool using this representation to generate designs that span the entire range of the memory design space.
Comparing the combinational complexities of arithmetic functions
Authors: Helmut Alt
Venue: Journal of the ACM (JACM) (1988)

Methods are presented for finding reductions between the computations of certain arithmetic functions that preserve asymptotic Boolean complexities (circuit depth or size). They can be used to show, for example, that all nonlinear algebraic functions are as difficult as integer multiplication with respect to circuit size. As a consequence, any lower or upper bound (e.g., O(n log n log log n)) for one of them applies to the whole class. It is also shown that, with respect to depth and size simultaneously, multiplication is reducible to any nonlinear and division to any nonpolynomial algebraic function.
Transformation-based error-driven learning and natural language processing: a case study in part-of-speech tagging
Authors: Eric Brill
Venue: Computational Linguistics (1995)

Recently, there has been a rebirth of empiricism in the field of natural language processing. Manual encoding of linguistic information is being challenged by automated corpus-based learning as a method of providing a natural language processing system with linguistic knowledge. Although corpus-based approaches have been successful in many different areas of natural language processing, it is often the case that these methods capture the linguistic information they are modelling indirectly in large opaque tables of statistics. This can make it difficult to analyze, understand and improve the ability of these approaches to model underlying linguistic behavior. In this paper, we will describe a simple rule-based approach to automated learning of linguistic knowledge. This approach has been shown for a number of tasks to capture information in a clearer and more direct fashion without a compromise in performance. We present a detailed case study of this learning method applied to part-of-speech tagging.
Programmable applications: interpreter meets interface
Authors: Michael Eisenberg
Venue: ACM SIGCHI Bulletin (1995)

Current fashion in "user-friendly" software design tends to place an over-reliance on direct manipulation interfaces. To be truly expressive (and thus truly user-friendly), applications need both learnable interfaces and domain-enriched languages that are accessible to the user. This paper discusses some of the design issues that arise in the creation of such programmable applications. As an example, we present "SchemePaint," a graphics application that combines a MacPaint-like interface with an interpreter for (a "graphics-enriched") Scheme.