ppxscal/embedding_network huggingface dataset:
A Closed-Form Evaluation for Datalog Queries with Integer-Order Constraints
Authors: Peter Z. Revesz
Venue:  (1991)

We provide a generalization of Datalog based on generalizing databases with the addition of integer-order constraints to relational tuples. For Datalog queries with integer-order constraints we show that there is a closed-form evaluation. We also show that the tuple recognition problem can be done in PTIME in the size of the (generalized) database, assuming that the size of the constants in the query is logarithmic in the size of the database. Note that the absence of negation is critical. Datalog queries with integer-order constraints can express any Turing-computable function.
Wavelets for the numerical solution of the Stokes problem
Authors: Silvia Bertoluzza
Venue:  (1997)

We introduce an equivalent coercive formulation of the Stokes problem by taking advantage of the properties displayed by wavelets, relative to Sobolev space characterization, that allow to write down equivalent $H^{-1}(\Omega)$ scalar products with the aid of such functions. The new stabilized formulation of the Stokes problem can be discretized by the Galerkin method using any approximation space (not necessarily of wavelet type). If a wavelet space is chosen, an optimal diagonal preconditioner exists. EMAIL:: ian@microian.ian.pv.cnr.it
A Universal Smart Transducer Interface: TTP/A
Authors: H. Kopetz, M. Holzmann, W. Elmenreich
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

The primary goal of a universal smart transducer interface is the provision of a framework that helps to reduce the complexity of large distributed real-time systems by introducing precisely specified (in the value domain and in the temporal domain) and small interfaces between smart transducers and their users.This paper presents a universal smart transducer interface that can be implemented on top of different real-time communication systems. It integrates a time-triggered communication protocol with an interface file system that provides the sources and sinks for the exchanged information. The final section discusses an implementation of this interface on a low cost (less than 1 $) commercial off the shelf microcontroller.
Recovery Proxy for Wireless Applications
Authors: Bin Yao, W. Kent Fuchs
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

A recovery proxy that implements proxy-based recovery is described in this paper.Proxy-based recovery provides failure recovery for applications on connected hand-held devices.This approach enables proxys to monitor clients' interaction with back end servers and locally maintain a client's state based on observed messages.The proxy described in this paper provides a general message logging mechanisms as well as an interface for applications to implement their own checkpointing and message analysis mechanisms.When a client moves from one proxy to another, a migration protocol described in this paper canbe used to efficiently transfer the client's state and network connections to the new proxy.Experimental results on the proxy's latency, throughput and client migration overheadare provided.
A Dynamic Query Scheduling Framework for Distributed and Evolving Information Systems
Authors: Ling Liu, Calton Pu
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

The rapid growth of the wide-area network technology has led to an increasing number of information sources available on-line. To ensure the query services scale up with such dynamic open environments, an advanced distributed information system must provide adequate support for dynamic interconnection between information consumers and information producers, instead of just functioning as a static data delivery system. We develop a distributed query scheduling framework to demonstrate the feasibility and the benefit for supporting interoperability and dynamic information gathering across heterogeneous information sources, without relying on an integrated view pre-defined over the participating information sources. We outline the mechanisms developed for the main components of our distributed query scheduling framework, such as query routing and query execution planning services. We also provide a concrete example to illustrate the issues on how the information consumers' query requests are dynamically processed and linked to the heterogeneous information sources and how the query scheduling framework scales up as the number of information sources increases.
Efficient Transparent Optimistic Rollback Recovery for Distributed Application Programs
Authors: David B. Johnson
Venue:  (1993)

Existing rollback-recovery methods using consistent checkpointing may cause high overhead for applications that frequently send output to the "outside world", since a new consistent checkpoint must be written before the output can be committed, whereas existing methods using optimistic message logging may cause large delays in committing output, since processes may buffer received messages arbitrarily long before logging and may also delay propagating knowledge of their logging or checkpointing progress to other processes. This paper describes a new transparent rollback-recovery method that adds very little overhead to distributed application programs and efficiently supports the quick commit of all output to the outside world. Each process can independently choose at any time either to use checkpointing alone (as in consistent checkpointing) or to use optimistic message logging. The system is based on a new commit algorithm that requires communication with and information about the minimum number of other processes in the system, and supports the recovery of both deterministic and nondeterministic processes. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Loop Scheduling and Partitions for Hiding Memory Latencies
Authors: Fei Chen, Edwin Hsing-Mean Sha
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Partition Scheduling with Prefetching (PSP) is a memory latency hiding technique which combines the loop pipelining technique with data prefetching. In PSP, the iteration space is first divided into regular partitions. Then two parts of the schedule, the ALU part and the memory part, are produced and balanced to produce an overall schedule with high throughput. These two parts are executed simultaneously, and hence the remote memory latency are overlapped. We study the optimal partition shape and size so that a well balanced overall schedule can be obtained. Experiments on DSP benchmarks show that the proposed methodology consistently produces optimal or near optimal solutions.
An overview of coaching with limitations
Authors: Patrick Riley, Manuela Veloso
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

As agent relationships become more complex, one challenging relationship that merits study is that of coach or adviser to another agent. Our research on coaching refers to one autonomous agent providing advice to another autonomous agent about how to act. Here we describe the current state of the coach agent framework we are developing. One of our goals is to design a coach agent that can provide advice to many differently built and structured advice taking agents. A coach must then adapt its advice to the capabilities and limitations of the agents it is coaching. This paper explores the effect of advice giving in the presence of limitations.
Scientific Computing on Itanium-Based Systems
Authors: Marius Cornea, John Harrison, Ping Tak Peter Tang
Venue:  (2002)

:Written for professionals who need to write, port, or maintain reliable, accurate, and efficient numerical software for the Itanium architecture, Scientific Computing on Itanium-based Systems shows you how to construct several key numerical infrastructure and application programs. This book describes the crucial techniques required for stability and reliability in developing numerical kernels and applications. Through numerous tested examples, the authors explain how you can get the most from the 64-bit architecture. This combination of explanation with example helps you to make difficult computations more easily and to increase the performance of your numerical software. This book provides examples to solve problems encountered in scientific and engineering computations, such as: Polynomial evaluation Complex arithmetic Quad-precision arithmetic Software pipelining, to include register rotation and modulo-scheduled loop support SIMD instructions Interval arithmetic Fast-Fourier Transformation (FFT) algorithms Numerical linear algebra and basic linear algebra subprograms(BLAS) Vector Math Library (VML) Cryptography
System and Framework for QA of Process Design Kits
Authors: M. C. Scott, M. O. Peralta, J. D. Carothers
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

In this paper, we evaluate the dependencies betweentools, data and environment in process design kits, andpresent a framework for systematically analyzing thequality of the design tools and libraries through thedesign flow. The framework consists of a regressionengine which executes sets of tests in a distributedcomputing environment. These tests vary fromsimulations to validate models and simulators, to tests onlayout versus schematics, parasitics extraction accuracy,and ultimately, tests to validate the extracted circuitintegrity against the ideal. In particular, it is shown thattest-chaining is required to obtain confidence in thesimulation-to-silicon equivalence. A secondary objectiveis to identify and quantify the peak-error injection points.Finally, future work is outlined to extend the frameworkto automate entire design flows and provide capability forinter-tool constraint satisfaction and design optimization.
A study on call modelling for AIN/B-ISDN integration
Authors: Hee Jin Lim, Min Su Cho, Go Bong Choi
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

ITU-T has considered the Intelligent Network(IN) Capability Set 2(CS 2) phase, which includes the FPLMTS capabilities for providing mobile services in Advanced IN(AIN) based network. Simultaneously, AIN and B-ISDN integrated architecture would be recommended upto IN CS-3 phase. This paper describes the call model of new Service Switching Point(SSP) based on the integration technology of AIN and B-ISDN. It may be the switching functions which will be much affected by AIN/B-ISDN integration. We modify functional elements for integrated network focusing on Broadband SSP(B-SSP) as well as a call model supporting the separation of call control and connection control. We propose a three layered call model, which consists of session control state model, resource control model, and bearer control model, that supports various types of call (multi connection, multi party, etc.). Centralized originating and terminating parties. AIN/B-ISDN integrated call modeling should fully include B-ISDN signaling capabilities and AIN benefits. In this paper, the proposed call model is evaluated for specific multimedia service, Video On Demand(VOD) service.
Rabin Measures
Authors: Nils Klarlund, Dexter Kozen
Venue:  (1995)

Rabin conditions are a general class of properties of infinite sequences that encompass most known automata-theoretic acceptance conditions and notions of fairness. In this paper, we introduce a concept, called a Rabin measure, which in a precise sense expresses progress for each transition toward satisfaction of the Rabin condition. We show that these measures of progress are linked to the Kleene-Brouwer ordering of recursion theory. This property is used in [Kla94a(JPL)] to establish an exponential upper bound for the complementation of automata on infinite trees. When applied to termination problems under fairness constraints, Rabin measures eliminate the need for syntax-dependent, recursive applications of proof rules.
Havoc V.85 Software
Authors: David Cohn, Stephen Madancy
Venue:  (1986)

This disk contains alpha release 85 of the HAVOC system, with examples. It is written in C and 68000 assembler.
FRMA: a new high-speed metropolitan and local area network protocol
Authors: M. Hamdi, Lixin Wang
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

Multimedia services, teleconferencing, high performance visualization, and distributed supercomputing are expected to accelerate the demand for high-speed local and metropolitan area networks (LAN/MANs). In this paper, we propose a new MAC protocol, called fast reservation multiple access (FRMA), which is suitable for a folded bus high-speed MANs and LANs. Its main feature is a sample and fast reservation technique that allow stations to reserve transmission slots. The goal of the reservation is to maximize the throughput of the system and to ensure fairness among the attached stations. A complete description of the FRMA protocol and the associated nodes are given. Then, we show the performance of FRMA as a function of its throughput, mean delays, and fairness using simulation results. Our protocol is shown to achieve high throughput and small transmission delays while preserving the fairness of the whole network. Thus, the FRMA protocol seem to be an appropriate choice for future generation high-speed MANs and LANs.
All-Electron Study of Gradient Corrections to the Local Density Functional in Metallic Systems
Authors: Alexander Khein, D. J. Singh, C. J. Umrigar
Venue:  (1994)

Using the all-electron Linearized Augmented Plane Wave (LAPW) method, we calculate the effect of including gradient corrections to the exchange correlation functional on the structural properties of the simple metal Al, transition metals Ta, W, Pt, and noble metals Cu, Ag, Au. For all the systems studied, the local density approximation (LDA) yields bond-lengths that are too short and bulk moduli that are too large. The generalized gradient functional introduced by Perdew and Wang (PW91) yields corrections that are in the right direction (larger bond-lengths and smaller bulk moduli), but it frequently overcompensates, particularly for the heavier elements. The PW 91 functional predicts the lattice constant and bulk modulus of Al and Cu more accurately than the LDA but yields values that are less accurate than the LDA for W, Pt, Au.
Construction of wavelets and prewavelets over triangulations
Authors: Doug Hardin, Don Hong
Venue: Journal of Computational and Applied Mathematics (2003)

Constructions of wavelets and prewavelets over triangulations with an emphasis of the continuous piecewise polynomial setting are discussed. Some recent results on piecewise linear prewavelets and orthogonal wavelets are presented.
Understanding Protocols for Byzantine Clock Synchronization
Authors: Fred B. Schneider
Venue:  (1987)

All published fault-tolerant clock synchronization protocols are shown to result from refining a single paradigm. This allows the different clock synchronization protocols to be compared and permits presentation of a single correctness analysis that holds for all. The paradigm is based on a reliable time source that periodically causes events; detection of such an event causes a processor to reset its clock. In a distributed system, the reliable time source can be approximated by combining the values of processor clocks using a generalization of a ``fault-tolerant average'''', called a convergence function. The performance of a clock synchronization protocol based on our paradigm can be quantified in terms of the two parameters that characterize the behavior of the convergence function used: accuracy and precision.
A Primal-Dual Approximation Algorithm for the Steiner Forest
Authors: R. Ravi
Venue:  (1993)

Given an undirected graph with nonnegative edge-costs, a subset of nodes of size $k$ called the terminals, and an integer $q$ between 1 and $k$, the minimum $q$-Steiner forest problem is to find a forest of minimum cost with at most $q$ trees that spans all the terminals. When $q = 1$, we have the classical minimum-cost Steiner tree problem on networks. In this note, we adapt a primal-dual approximation algorithm for the latter problem due to Agrawal, Klein and Ravi to provide one for the former. The algorithm runs in time $O( n \log n + m)$ and outputs a solution of cost at most $2(1 - \frac{1}{k-q+1})$ times the minimum. Here $n$ and $m$ denote respectively the number of nodes and edges in the input graph. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Synchronous versus asynchronous collaboration in situated multi-agent systems
Authors: Danny Weyns, Tom Holvoet
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

According to the taxonomy for agent activity, proposed by V. Parunak, a collaboration is an interaction between agents of a multi-agent system (MAS) whereby the agents explicitly coordinate their actions before they cooperate. We discuss two sub-types of collaboration in the context of situated MASs, namely asynchronous and synchronous collaboration. After setting up collaboration, the interaction between the agents in an asynchronous collaboration happens indirectly through the environment. Agents direct their actions via the perceived state change of their environment. On the other hand, during a synchronous collaboration agents have to act simultaneously and this requires an additional agreement about which actions should be executed. Although they both fit the characteristics of collaboration, the requirements for their implementation is quite different. Whereas agents in an asynchronous collaboration can be implemented as separate processes that act directly into the environment, the implementation of synchronous collaboration is more complex since it requires support for simultaneous actions. In the paper we give examples of both kinds of collaborations and outline the necessary support for their implementation.
Improving Performance of Load-Store Sequences for Transaction Processing Workloads on Multiprocessors
Authors: Jim Nilsson, Fredrik Dahlgren
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

On-line transaction processing exhibits poor memory behavior in high-end multiprocessor servers because of complex sharing patterns and substantial interaction between the database server and the operating system. One contributing source is a large amount of load-store sequences in the program, resulting in many read misses as well as much global invalidation traffic.In this paper, we characterize the nature of these load-store sequences, and analyze contributing code- and data structures in the database handler, operating system, and system libraries. We explore two conceptually different approaches for detecting load-store sequences; data-centric and instruction-centric, and the goal is to load the cache block exclusively already at the load instruction so that the store instruction can perform locally. Our results were obtained using program-driven simulation of a TPC-B based workload on a four-node multiprocessor.The results show that there is a substantial amount of load-store sequences in the database handler, the operating system, and in system libraries, and about 40% of all global writes belong to such sequences. Even though the techniques were able to reduce the execution time for the application by up to 10%, the complex behavior of the database workload reduced the effectiveness of traditional optimization techniques for migratory sharing.
Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems
Authors: Kenneth P. Birman, Thomas A. Joseph
Venue:  (1984)

Many distributed systems replicate data for fault tolerance or availability. In such systems, a logical update on a data item results in a physical update on a number of copies. The synchronization and communication required to ensure that the copies of replicated data are kept consistent introduces a delay when operations are performed. In this paper, we describe a technique that relaxes the usual degree of synchronization, permitting copies of replicated data to be updated concurrently with other operations, while at the same time ensuring that correctness is not violated. The additional concurrency thus obtained results in better response time when performing operations on replicated data. We also discuss how this technique performs in conjunction with roll-back and roll-forward failure recovery mechanisms.
Modeling dialup internet access: an examination of user-to-modem ratios, blocking probability, and capacity planning in a modem pool
Authors: David C. Novak, Daniel Rowland, Luiz DaSilva
Venue: Computers and Operations Research (2003)

In the near future, dialup connections will remain as one of the most popular methods of remote access to the Internet as well as to enterprise networks. The dimensioning of modem pools to support this type of access is of particular importance to commercial Internet service providers as well as to universities that maintain their own modem pools to support access by faculty, staff, and students. The primary contribution of this paper is to analyze how network administrators may decrease the probability of blocking for access to the pool by imposing session limits restricting the maximum duration of the online session. Session limits may provide a viable alternative to improving network performance without necessarily adding capacity to the pool. Blocking probability is examined under a number of different scenarios to assess potential improvements in the quality of service by imposing session limitations during peak-period operations.
SPN2MGM: Tool Support for Matrix-Geometric Stochastic Petri Nets
Authors: Boudewijn R. Haverkort
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

In this paper we present the tool SPN2MGM that can be used to construct and solve stochastic Petri nets using matrix-geometric techniques. The tool automatically recognizes the ``matrix-geometric structure'' of the Markov chain underlying the stochastic Petri net, and solves the Markov chain with these well-known and efficient techniques. We informally characterize the class of stochastic Petri nets of interest (a formal definition has been given in an earlier paper) after which we briefly touch upon the matrix-geometric solution approach. We then present an overview of SPN2MGM by discussing the model class supported and the internal methods used. We finish the paper with a case study in the area of queues with breakdowns. In particular, we present a model of a queueing system in which check- pointing can be used to shorten the recovery process after server- breakdowns have occurred.
The Computational Structure and Characterization of Nonlinear Discrete Chebyshev Problems
Authors: Andrew R. Conn, Yuying Li
Venue:  (1988)

We present the generalisation of some concepts in linear Chebyshev theory to the nonlinear case. We feel these generalisations capture the inherent structure and characteristics of the best Chebyshev approximation and that they can be usefully exploited in the computation of a solution to the discrete Chebyshev problem.