ppxscal/embedding_network huggingface dataset:
A resilient application-level failure detection system for distributed computing environments
Authors: B. Welch, A. Helal, R. Elmasri
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

A methodology for detecting failures that occur in distributed computer systems connected by a communications network is described. The methodology utilizes active polling of monitored systems. The entities polled must be service entities that function at the application layers of service providing machines. A prototype system has been implemented to test this methodology.
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Authors: Yoram Hirshfeld, Mark Jerrum, Faron Moller
Venue:  (1994)

The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes, due to Huynh and Tian, is that the problem lies in the second level of the polynomial hierarchy: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by presenting a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple context-free grammars.
Towards a General Theory for Qualitative Space
Authors: Baher A. El-Geresy, Alia I. Abdelmoty
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

Finding ways for defining the complete and sound (physically plausible) set of relationships between spatial objects is a pre-requisite for the development and realization of qualitative representation and reasoning formalisms. Establishing the set of sound relationships is a complicated task especially when complex objects are considered. Hence, current approaches to qualitative representation and reasoning are limited to handling simple spatial objects. In this paper, we extend a constraint-based approach to qualitative representation of topological relationships by introducing general soundness rules. The rules reduce thecombinatorial set of relations produced by the method to the complete and physically possible ones. The rules are general and apply to objects of random complexity and together with the representation and reasoning formalism form a theory for qualitative space.
Adding the Everywhere Operator to Propositional Logic
Authors: David Gries, Fred B. Schneider
Venue:  (1996)

Sound and complete modal propositional logic C is presented, in which "P" has the interpretation "P is true in all states". The interpretation is already known as the Carnapian extension of S5. A new axiomatization for C provides two insights. First, introducing an inference rule "textual substitution" allows seamless integration of the propositional and modal parts of the logic, giving a more practical system for writing formal proofs. Second, the two following approaches to axiomatizing a logic are shown to be not equivalent: (i) give axiom schemes that denote an infinite number of axioms and (ii) write a finite number of axioms in terms of propositional variables and introduce a substitution inference rule.
Constrained Interval Arithmetic
Authors: W. A. Lodwick
Venue:  (1999)

This paper presents an approach to solving the long-standing dependency problem in internal arithmetic. An extension to internal arithmetic, called here constrained internal arithmetic, is developed. Unlike interval arithmetic, constrained internal arithmetic has an additive inverse, a multiplicative inverse and satisfies the distributive law. This means that the algebraic structure of constrained interval arithmetic is different than that of interval arithmetic. The applicability of constrained interval arithmetic is explored.
Circular Bernstein--Bézier spline approximation with knot removal
Authors: Catherine Cusimano, Sonya Stanley
Venue: Journal of Computational and Applied Mathematics (2003)

we present a local C1 spline interpolation scheme based on circular Bernstein-Bézier polynomials. The complexity of the spline can be significantly reduced by removing knots from the spline without perturbing the spline more than a given tolerance. We give the details of our approach and include some numerical examples.
Dynamic File-Access Characteristics of a Production Parallel Scientific Workload
Authors: David Kotz, Nils Nieuwejaar
Venue:  (1994)

Multiprocessors have permitted astounding increases in computational performance, but many cannot meet the intense I/O requirements of some scientific applications. An important component of any solution to this I/O bottleneck is a parallel file system that can provide high-bandwidth access to tremendous amounts of data in parallel to hundreds or thousands of processors. Most successful systems are based on a solid understanding of the characteristics of the expected workload, but until now there have been no comprehensive workload characterizations of multiprocessor file systems. We began the CHARISMA project in an attempt to fill that gap. We instrumented the common node library on the iPSC/860 at NASA Ames to record all file-related activity over a two-week period. Our instrumentation is different from previous efforts in that it collects information about every read and write request and about the mix of jobs running in the machine (rather than from selected applications). The trace analysis in this paper leads to many recommendations for designers of multiprocessor file systems. First, the file system should support simultaneous access to many different files by many jobs. Second, it should expect to see many small requests, predominantly sequential and regular access patterns (although of a different form than in uniprocessors), little or no concurrent file-sharing between jobs, significant byte- and block-sharing between processes within jobs, and strong interprocess locality. Third, our trace-driven simulations showed that these characteristics led to great success in caching, both at the compute nodes and at the I/O nodes. Finally, we recommend supporting strided I/O requests in the file-system interface, to reduce overhead and allow more performance optimization by the file system.
On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems
Authors: Vanderbei Robert, Benson Hande Yurttan
Venue:  (2000)

Consider the diagonal entries d_j, j=1,2,...,n, of the matrix D in an LDL^T factorization of an n-by-n matrix X. As a function of X, each d_j is well-defined on the closed domain of positive semidefinite matrices. We show that these functions are twice continuously differentiable and concave throughout the interior of this domain. Using these facts, we show how to formulate semidefinite programming problems as standard convex optimization problems that can be solved using an interior-point method for nonlinear programming. Note: This research has been facilitated by the Special Year on Large Scale Discrete Optimization, via a graduate fellowship and the Workshop on Semidefinite Programming and Its Applications to Large Scale Optimization.
As You Like Them: Connectives in Fuzzy Logic
Authors: Claudi Alsina
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We review the question of which connectives (conjunctions, disjunctions and negations) may be of interest in Fuzzy Logic. Several alternative structures to the classical boolean algebras are presented and discussed. We show how techniques from the theory of functional equations may help to clarify the problem of choosing appropriate connectives or refusing inadequate operations.
KODAMA: As a Distributed Multi-Agent System
Authors: Guoqiang Zhong, Kenichi Takahashi, Tarek Helmy, Kouichirou Takaki, Tsunenori Mine, Shigeru Kusakabe, Makoto Amamiya
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

With the explosion of the Internet, we are evolving a worldwide network-computing environment. At this point, the surged challenge is the next evolutionary technology for the Internet-oriented applications. A KODAMA (Kyushu university Open & Distributed Autonomous Multi-Agent) system is deployed for this demand. KODAMA system can interconnect disparate and distributed agents together to solve some problem whose solution is typically beyond any singular agent's capabilities. The key aspects of KODAMA agents are their autonomy, collaboration, flexibility, as well as stability. To obtain all these features, appropriate scheme of collaboration among agents is clearly critical. Our new approach focuses on both raising the level of abstraction at which agents cooperate with each other, and hiding the implementation details of communications from agents.
A Unitary Method for the ESPRIT Direction-of-Arrival Estimation Algorithm
Authors: Charles Van Loan
Venue:  (1987)

ESPRIT is an interesting new method for solving the Direction-of-Arrival estimation problem. It involves some rather tricky matrix manipulations. We show how these calculations can be carried out using only unitary transformations of the data. No inverses or cross-products are required making the new method extremely robust.
Algorithms for On-Line Navigation
Authors: Jon M. Kleinberg
Venue:  (1992)

We consider a number of problems faced by a robot trying to navigate inside a simple polygon. Such problems are ``on-line'''' in the sense that the robot does not have access to the map of the polygon; it must make decisions as it proceeds, based only on what it has seen so far. Specifically, we examine algorithms for the related problems of exploration and search. We present a 5/4-competitive randomized algorithm for exploring a rectilinear polygon; the only privious work here is the deterministic 2-competitive algorithm claimed in Deng, Kameda and Papadimitrou. For the problem of searching for a distinguished point in a polygon, we give a $\sqrt{3}$-competitive algorithm for traversing a street, which improves on a result of Klein by more than a factor of 3. Finally, the techniques we use in exploration and the construction of search patterns are combined to give an algorithm for searching an arbitrary and unknown rectilinear polygon; here, no constant competitive ratio can be achieved, but our algorithm is within a constant factor of optimal in the worst case.
Hierarchical Message Stability Tracking Protocols
Authors: Katherine Guo, Robbert van Renesse, Werner Vogels, Ken Birman
Venue:  (1997)

Protocols which track message stability are an important part of reliable multicast protocols in fault-tolerant distributed systems. To reliably deliver multicast messages in a process group, each process maintains copies of all messages it sends and receives. If a member fails to receive a message, any process which has the message in its buffer can retransmit it. In order to prevent these buffers from growing out of bound, stability tracking protocols must be used. That is, whenever a process learns that a message has been received by everyone, it declares this message {\it stable} and releases it from the buffer. We investigate several message stability tracking protocols commonly used in a number of popular reliable multicast protocols with a focus on their performance in large scale settings with thousands of participants. To improve the scalability of these protocols significantly, we derive a set of new protocols using a spanning tree structure which scale to at least tens of thousands of participants.
Performance of a Routing Switch Utilizing Transputers
Authors: Christopher Ward, Saqib A. Khan, Yuan Chow, Richard Newman-Wolfe
Venue:  (1992)

Performance results recorded from a Transputer based packet routing switch are introduced and discussed. The routing switch is used to simulate a node in a satellite network which forms part of a testbed used to study characteristics of low altitude multiple satellite (LAMS) networks. The testbed is composed of five nodes. All nodes are able to directly communicate with one another, and three of the five nodes are equipped with laser transceivers. Results discussed in this paper reflect the design and performance of the Transputer based prototype. Throughput efficiency for the routing switch under a variety of test conditions is provided. Nodes in the testbed are modeled using a Host computer connected to four RS232 serial boards and a Transputer network. Communications are full-duplex and expected to be between 1-5Mbits/sec. The code for Layers 7-4 resides in the Host while the code for layers 3-1 resides in both the Host and the Transputer network. The highly mobile nature of the nodes in a LAMS network dictates that each node in the simulation must periodically update its routing tables, reflecting the connection changes on each external link. Since the Transputer network spans layer 1-3 of the ISO model, one of its layer 3 responsibilities is to update its routing tables also. This periodic updating requires dynamic routing table loading from the Host computer (layer 4) to the Transputer network (layer 3). Library functions are provided in layer 4 processes to deal with this service, however, accomodating these updates influences the design of the underlying Transputer network. Allowances must be made not only for expedient routing of messages within the Transputer network but also for rapid and efficient routing table updates within the Transputer network.
Infinite Objects in Type Theory
Authors: N. P. Mendler, Prakash Panangaden, Robert L. Constable
Venue:  (1986)

In this paper we show how infinite objects can be defined in a constructive type theory. The type theory that we use is a variant of Martin-Lof''s Intuitionistic Type Theory. We show how one can express the intuition that infinite objects are understood through a limiting process without having to introduce partial objects in the theory. This means that we can adhere to the propositions-as-types principle. The type of infinite objects thus contains only total elements. The approximation is expressed through a sequence of types that approximate the type of infinite objects. We give two semantic accounts of types of infinite objects. The first is lattice theoretic and shows how these types can be understood as fixed points. The second is category theoretic and shows the duality between types of infinite objects and the ordinary recursive type definitions.
Evaluating different methods of estimating retrieval quality for resource selection
Authors: Henrik Nottelmann, Norbert Fuhr
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

In a federated digital library system, it is too expensive to query every accessible library. Resource selection is the task to decide to which libraries a query should be routed. Most existing resource selection algorithms compute a library ranking in a heuristic way. In contrast, the decision-theoretic framework (DTF) follows a different approach on a better theoretic foundation: It computes a selection which minimises the overall costs (e.g. retrieval quality, time, money) of the distributed retrieval. For estimating retrieval quality the recall-precision function is proposed. In this paper, we introduce two new methods: The first one computes the empirical distribution of the probabilities of relevance from a small library sample, and assumes it to be representative for the whole library. The second method assumes that the indexing weights follow a normal distribution, leading to a normal distribution for the document scores. Furthermore, we present the first evaluation of DTF by comparing this theoretical approach with the heuristical state-of-the-art system CORI; here we find that DTF outperforms CORI in most cases.
Automatic Text Analysis
Authors: Gerard Salton
Venue:  (1969)

Effective automatic methods are now available to replace conventional document indexing and classification.
Analyze-NOW-an environment for collection and analysis of failures in a network of workstations
Authors: A. Thakur, B. K. Iyer
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

This paper describes Analyze-NOW an environment for collection and analysis of failures/errors in a network of workstations. Descriptions cover the data collection methodology and the tool implemented to facilitate this process. Software tools used for analysis are described, with emphasis on the details of the implementation of the Analyzer, the primary analysis tool. Application of the tools is demonstrated by using them to collect and analyze failure data (for 32 week period) from a network of 69 SunOS-based workstations. Classification based on the source and the effect of faults is used to identify problem areas. Different types of failures encountered on the machines and the network are highlighted to develop a proper understanding of failures in a network environment. Lastly, a case is made for using the results from the analysis tool to pinpoint the problem areas in the network.
Effect of Disturbances on the Convergence of Failure Intensity
Authors: João W. Cangussu, Aditya P. Mathur, Raymond A. DeCarlo
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

We report a study to determine the impact of four types ofdisturbances on the failure intensity of a software productundergoing system test. Hardware failures, discovery ofa critical fault, attrition in the test team, are examples ofdisturbances that will likely affect the convergence of thefailure intensity to its desired value. Such disturbances aremodeled as impulse, pulse, step, and white noise. Our studyexamined, in quantitative terms, the impact of such disturbanceson the convergence behavior of the failure intensity.Results from this study reveal that the behavior of thestate model, proposed elsewhere, is consistent with whatone might predict. The model is useful in that it providesa quantitative measure of the delay one can expect when adisturbance occurs.
Special Edition Using Macromedia Dreamweaver MX
Authors: Molly E. Holzschlag, Jennifer Ackerman Kettell
Venue:  (2002)

:This book is primarily intended to assist growing professionals in gaining a fantastic working knowledge of Dreamweaver and the issues in design and markup that are affecting the changing way in which they work. This book addresses issues in Web design and development from an extremely contemporary standpoint. While the information contained within is suitable for beginners, the real emphasis is to assist the intermediate designer interested in learning how to work with Dreamweaver to achieve best practices within the design and development industry. The book provides plenty of tips and real-world advice from people working in the trenches, and lays a solid groundwork so that readers have a firm grasp of the basics before moving to more advanced functionality.
Graph Parsing Techniques for Visualizing Directed Graphs
Authors: C. L. McCreary, Fwu Shieh
Venue:  (1995)

Directed graphs, or digraphs, are an excellent means of conveying the structure and operation of many types of systems. They are capable of representing not only the overall structure of such a system, but also the smallest details in a simple and effective way. However, drawing digraphs by hand can be tedious and time consuming, especially if the number of nodes and edges is large. In addition, much time can be spent just trying to plan how the graph should be organized on the page. We are developing an automated system capable of converting a textual description of a digraph into a well organized and readable drawing of the digraph. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clans) in the graph and to produce a parse tree. The tree is given attributes that specify the node layout. CG then uses tree properties with the addition of "routing nodes" to route the edges. The objective of the system is to provide, automatically, an aesthetically pleasing visual layout for arbitrary directed graphs. The innovative strategy of clan-based graph decomposition is the first digraph drawing technique to analyze locality in the graph in two dimensions. The typical approach to drawing digraphs uses a single dimension, level, to arrange the nodes.
Supporting Broad Internet Access to TACOMA
Authors: Dag Johansen, Robbert van Renesse, Fred B. Schneider
Venue:  (1996)

Any provider of software is faced with a problem if that software must be installed on autonomous sites of a large network. This paper reports experiences in addressing this network-software installationproblem for TACOMA, an internet agent infrastructure. The paper describes a WWW-based scheme and an email-based scheme for avoiding software installation at all sites that might launch TACOMA agents.
Coalition formation through motivation and trust
Authors: Nathan Griffiths, Michael Luck
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Cooperation is the fundamental underpinning of multi-agent systems, allowing agents to interact to achieve their goals. Where agents are self-interested, or potentially unreliable, there must be appropriate mechanisms to cope with the uncertainty that arises. In particular, agents must manage the risk associated with interacting with others who have different objectives, or who may fail to fulfil their commitments. Previous work has utilised the notions of motivation and trust in engendering successful cooperation between self-interested agents. Motivations provide a means for representing and reasoning about agents' overall objectives, and trust offers a mechanism for modelling and reasoning about reliability, honesty, veracity and so forth. This paper extends that work to address some of its limitations. In particular, we introduce the concept of a clan: a group of agents who trust each other and have similar objectives. Clan members treat each other favourably when making private decisions about cooperation, in order to gain mutual benefit. We describe mechanisms for agents to form, maintain, and dissolve clans in accordance with their self-interested nature, along with giving details of how clan membership influences individual decision making. Finally, through some simulation experiments we illustrate the effectiveness of clan formation in addressing some of the inherent problems with cooperation among self-interested agents.
The Jrpm system for dynamically parallelizing Java programs
Authors: Michael K. Chen, Kunle Olukotun
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

We describe the Java runtime parallelizing machine (Jrpm), a complete system for parallelizing sequential programs automatically. Jrpm is based on a chip multiprocessor (CMP) with thread-level speculation (TLS) support. CMPs have low sharing and communication costs relative to traditional multiprocessors, and thread-level speculation (TLS) simplifies program parallelization by allowing us to parallelize optimistically without violating correct sequential program behavior. Using a Java virtual machine with dynamic compilation support coupled with a hardware profiler, speculative buffer requirements and inter-thread dependencies of prospective speculative thread loops (STLs) are analyzed in real-time to identify the best loops to parallelize. Once sufficient data has been collected to make a reasonable decision, selected loops are dynamically recompiled to run in parallel.Experimental results demonstrate that Jrpm can exploit thread-level parallelism with minimal effort from the programmer. On four processors, we achieved speedups of 3 to 4 for floating point applications, 2 to 3 on multimedia applications, and between 1.5 and 2.5 on integer applications. Performance was achieved by automatic selection of thread decompositions by the hardware profiler, intra-procedural optimizations on code compiled dynamically into speculative threads, and some minor programmer transformations for exposing parallelism that cannot be performed automatically.