ppxscal/embedding_network huggingface dataset:
When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems
Authors: R. Ravi, Philip Klein
Venue:  (1992)

We present a general approximation technique for a class of network design problems where we seek a network of minimum cost that satisfies certain communication requirements and is resilient to worst-case single-link failures. Our algorithm runs in $O(n^2 \log n)$ time on a graph ith $n$ nodes and outputs a solution of cost at most thrice the optimum. We extend our technique to obtain approximation algorithms for augmenting a given network so as to satisfy certain communication requirements and achieve resilience to single-link failures. Our technique allows one to find nearly minimum-cost two-connected networks for a variety of connectivity requirements. For example, our result generalizes earlier results on finding a minimum-cost two-connected subgraph of a given edge-weighted graph and an earlier result on finding a minimum-cost subgraph two-connecting a specified subset of the nodes. Using our technique, we can also approximately solve for the first time a two-connected version of the generalized Steiner network problem and a two-connected version of the non-fixed point-to-point connection problem.
A Non-Homogeneous Markov Software Reliability Model with Imperfect Repair
Authors: Swapna S. Gokhale, Teebu Philip, Peter N. Marinos
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

This paper reviews existing Non-Homogeneous Poisson Process (NHPP) software reliability models and their limitations, and proposes a more powerful non-homogeneous Markov model for the fault detection/removal problem. In addition, this non-homogeneous Markov model allows for the possibility of a finite time to repair a fault and for imperfections in the repair process. The proposed scheme provides the basis for decision making both during the testing and the operational phase of the software product. Software behavior in the operational phase and the development test phase are related and the release time formulae are derived. Illustrations of the proposed model are provided.
On the orbit-stabilizer problem for integral matrix actions of polycyclic groups
Authors: Bettina Eick, Gretchen Ostheimer
Venue: Mathematics of Computation (2003)

We present an algorithm to solve the orbit-stabilizer problem for a polycyclic group G acting as a subgroup of GL(d, Z) on the elements of Qd. We report on an implementation of our method and use this to observe that the algorithm is practical.
REPOS: An operating system for the PDP-11
Authors: Henrik Maegaard, Aksel Andreasen
Venue: ACM SIGOPS Operating Systems Review (1979)

This paper describes an operating system intended for the low range of the PDP-11 family. The operating system is designed for PDP-1 1's equipped with hardware that facilitate loading of program modules (core-blocks) from a host computer. The operating system is a real time system that supports interrupt handlers and low priority activities. Core-blocks are dynamic in the sense that a core-block can be loaded/removed or relocated while the system is running. Programs may either be written in assembly language or in PASCAL. A PASCAL interface to a PASCAL compiler implemented on the UNIVAC 1100 series is presented.
Reliable Communication in the Presence of Failures
Authors: Kenneth P. Birman, Thomas A. Joseph
Venue:  (1985)

We report on the design and correctness of a communication facility for a distributed computer system. The facility provides support for fault tolerant process groups in the form of a family of reliable multicast protocols that can be used both in local and wide-area networks. These protocols attain high levels of concurrency while respecting application-specific delivery ordering constraints, and have varying cost and performance that depends on the degree of ordering desired. In particular, a protocol that enforces causal delivery orderings is introduced, and shown to be a valuable alternative to conventional asynchronous communication protocols. The facility also ensures that the processes belonging to a fault tolerant process group will observe consistent orderings of events affecting the group as a whole, including process failures, recoveries, migration, and dynamic changes to group properties like member rankings. A review of several uses for the protocols in the ISIS system, which supports fault-tolerant resilient objects and bulletin boards, illustrates the significant simplification of higher-level algorithms; made possible by our approach.
From Intuitionistic Logic to Gödel-Dummett Logic via Parallel Dialogue Games
Authors: Christian G. Fermüller, Agata Ciabattoni
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Building on a version of Lorenzen's dialogue foundationfor intuitionistic logic, we show that Gödel-Dummettlogic G can be characterized by a suitable game of communicatingparallel dialogues. This provides a computationalinterpretation of Avron's hypersequent calculus for G.
Winner-Take-All Networks of O(N) Complexity
Authors: J. Lazzaro, S. Ryckebusch, M. A. Mahowald, C. A. Mead
Venue:  (1988)

No abstract available.
How to improve fuzzy-neural system modeling by means of qualitative simulation
Authors: Riccardo Bellazzi, Raffaella Guglielmann, Liliana Ironi
Venue:  (1999)

The main problem in efficiently building robust fuzzy-neural models of nonlinear systems lies in the difficulty to define a ``meaningful'''' fuzzy rule-base. Our approach to the solution of such a problem is based on a hybrid method which integrates fuzzy systems with qualitative models. We introduce qualitative models to exploit all the available a priori physical knowledge on the system with the goal to infer, through qualitative simulation, all of its possible behaviors. We show here that a rule-base, which captures all of the distinctions in the system states, is automatically generated by encoding the knowledge of the system dynamics described by the outcomes of its qualitative simulation. Such a rule-base properly initializes a fuzzy identifier, which is then tuned to a set of experimental data. Our method has shown good performance when applied both as a predictor and as a simulator. KEYWORDS:: Qualitative simulation, neuro-fuzzy systems, system identification EMAIL:: ironi@dragon.ian.pv.cnr.it
Analyzing Learning Dynamics: How to Average?
Authors: Christian Goerick
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Pattern-based learning processes are usually analyzed by means of probability density functions of the weights or moments thereof. During the derivation of these equations, some averaging has to be performed. In this paper, we will show that the manner of averaging is crucial for the results of the analysis. We will do this by comparing two types of analysis (Langevin type and discrete-time moments) for one learning system.
A Deterministic Notation for Cooperating Processes
Authors: K. M Chandy, Ian Foster
Venue:  (1993)

This paper proposes extensions of sequential programming languages for parallel programming that have the following features: 1. Dynamic Structures The process structure is dynamic: Processes and variables can be created and deleted. 2.Paradigm Integration The programming notation allows shared memory and message passing. 3.Determinism Demonstrating that a program is deterministic -- all executions with the same input produce the same output -- is straightforward. A program can be written so that the compiler can verify that the program is deterministic. Nondeterministic constructs can be introduced in a sequence of refinement steps to obtain greater efficiency if required. The ideas have been incorporated in an extension of Fortran, but the underlying sequential imperative language is not central to the ideas described here.
Complexity of gradient projection method for optimal routing in data networks
Authors: W. K. Tsai, J. K. Antonio, G. M. Huang
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Derives a time complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorithm of the Goldstein-Levitin-Poljak type formulated by Bertsekas (1982) converges to within /spl epsiv/ in relative accuracy in O(/spl epsiv//sup 2/h/sub min/N/sub max//sup L/) iterations, where N/sub max//sup L/ is the number of paths sharing the maximally shared link, and h/sub min/ is the diameter of the network. Based on this complexity result, the authors also show that the one-source-at-a-time update policy has a complexity bound which is O(n) times smaller than that of the all-at-a-time update policy [Bertsekas, 1982], where n is the number of nodes in the network. The result of the paper argues for constructing networks with low diameter for the purpose of reducing the complexity of the network control algorithms. The result also implies that parallelizing the optimal rotating algorithm over the network nodes is beneficial.
An Integrated CSP-Based Tool for the Visualisation, Animation and Performance Evaluation of Message Passing Algorithms
Authors: Ali E. Abdallah, Mark Green
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

This paper presents ongoing research and development on an integrated tool for the visualisation and animation of message-passing communicating systems described in Hoare's CSP (Communicating Sequential Processes). It introduces major new developments to the original VisualNets implemented in C++ and reported in [4]. The new tool is implemented partly in Java and partly in the functional programming language Haskell. Not only does the new tool enjoy greater expressive power and a better user interface, it has new capabilities for aiding the user in animating, analysing, and reasoning about CSP specifications. These includes provisions for nested parallelism within a single node, improved profiling and animation, and the possibility of applying generic timing cost models for performance evaluation. The paper briefly describes the new features, explains the methods by which they have been implemented and illustrates their use with examples.
Specification and Implementation of a Distributed Planning and Information System for Courses Based on Story Driven Modeling
Authors: J. H. Jahnke, A. Zuendorf
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

Current object-oriented modelling methods focus on the specification of the static structure of software objects and their interaction at runtime. A major deficiency of these methods is that they do not provide means to specify the dynamic evolution of object structures. In this paper we propose a novel method called Story Driven Modelling (SDM) as a complementation to existing OO approaches. SDM employs so called story boards to analyse the dynamics of object structures as sequences of graphical snap shots for sample scenarios. A major benefit of this approach is that story boards are well understood even by laities, while they have well-defined syntax and semantics that gives way to semi-automatic derivation of subsequent specifications, like e.g. the static class hierarchy and dynamic operations on object structures. For the latter, SDM employs a high-level, graphical formalism called story flow diagram, which is based on the theory of programmed graph rewriting systems. In this paper we illustrate SDM with a sample case study which is the development of a course program planning system for the computer science department at Paderborn University. We choose this particular example from a number of SDM applications since its domain theory is very similar to the reference example for IWSSD-9 (The Meeting Scheduler System).
Using asymmetric distributions to improve text classifier probability estimates
Authors: Paul N. Bennett
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Text classifiers that give probability estimates are more readily applicable in a variety of scenarios. For example, rather than choosing one set decision threshold, they can be used in a Bayesian risk model to issue a run-time decision which minimizes a user-specified cost function dynamically chosen at prediction time. However, the quality of the probability estimates is crucial. We review a variety of standard approaches to converting scores (and poor probability estimates) from text classifiers to high quality estimates and introduce new models motivated by the intuition that the empirical score distribution for the "extremely irrelevant", "hard to discriminate", and "obviously relevant" items are often significantly different. Finally, we analyze the experimental performance of these models over the outputs of two text classifiers. The analysis demonstrates that one of these models is theoretically attractive (introducing few new parameters while increasing flexibility), computationally efficient, and empirically preferable.
Explaining World Wide Web Traffic Self-Similarity
Authors: Mark Crovella, Azer Bestavros
Venue:  (1995)

Abstract Recently the notion of self-similarity has been shown to apply to wide-area and local-area network traffic. In this paper we examine the mechanisms that give rise to self-similar network traffic. We present an explanation for traffic self-similarity by using a particular subset of wide area traffic: traffic due to the World Wide Web (WWW). Using an extensive set of traces of actual user executions of NCSA Mosaic, reflecting over half a million requests for WWW documents, we show evidence that WWW traffic is self-similar. Then we show that the self-similarity in such traffic can be explained based on the underlying distributions of WWW document sizes, the effects of caching and user preference in file transfer, the effect of user ``think time'''', and the superimposition of many such transfers in a local area network. To do this we rely on empirically measured distributions both from our traces and from data independently collected at over thirty WWW sites.
Active Messages on the Dawning-1000
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper presents the implementation and evaluation of an Active Messages model on the Dawning-1000 supercomputer system. Preliminary experiments show that Active Messages are quite efficient in reducing software overhead associated with sending and receiving messages.
Formal Justification of Underspecification for S5
Authors: Eric Aaron, David Gries
Venue:  (1997)

We formalize the notion of underspecification as a means of avoiding problems with partial functions in modal logic S5 and some semantically related logics. For these logics, underspecification respects validity, so incorporating it into their semantics leaves their classes of valid formulae unchanged.
Composing Distributed Objects in CORBA
Authors: Jeff Magee, Andrew Tseng, Jeff Kramer
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

The paper addresses the problem of structuring and managing large distributed systems constructed from many distributed objects. Specifically, the paper proposes a component model which can be used to compose objects into manageable entities. Components are specified using Darwin, an architecture description language developed by the authors. A mapping of distributed objects into Darwin components is described together with an outline of how Darwin and its associated tools are implemented in a CORBA compliant environment.
Maximal average loss rates for a single GPS server system with finite buffers
Authors: J. R. Yee, N. T. Gaarder
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Considers a single server system with finite buffers that services.
A loop-free path-finding algorithm: specification, verification and complexity
Authors: J. J. Garcia-Luna-Aceves, S. Murthy
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The loop-free path-finding algorithm (LPA) is presented. LPA specifies the second-to-last hop and distance to each destination to ensure termination; in addition, it uses an inter-neighbor synchronization mechanism to eliminate temporary loops. A detailed proof of LPA's correctness is presented and its complexity is evaluated. LPA's average performance is compared by simulation with the performance of algorithms representative of the state of the art in distributed routing, namely an ideal link-state (ILS) algorithm and a loop free algorithm that is based on internodal coordination spanning multiple hops (DUAL). The simulation results show that LPA is a more scalable alternative than DUAL and ILS in terms of the average number of steps, messages, and operations needed for each algorithm to converge after a topology change. LPA is shown to achieve loop freedom at every instant without much additional overhead over that incurred by prior algorithms based on second-to-last hop and distance information.
Soar-mode v5.0 User''s Manual for Soar release 5.2 and 6.0
Authors: Frank E. Ritter, Michael Hucka, Thomas F. McGinnis
Venue:  (1992)

Soar-mode is a major mode within the GNU-Emacs editor. It provides an integrated, structured editor for editing, running, and debugging Soar models on the production level. Productions are treated as first class objects. With keystroke (or menu) commands, productions can be directly loaded, examined, and queried about their current match status. Listings of the productions that have fired or are about to fire can be automatically displayed. Soad-mode includes snd organizes, for the first time, complete on-line documentation on Soar and a simple browser to examine this information.
The Null Space Problem II: Algorithms
Authors: Thomas F. Coleman, Alex Pothen
Venue:  (1986)

The Null Space Problem is that of finding a sparsest basis for the null space (null basis) of a $t \times n$ matrix of rank $t$. This problem was shown to be NP-hard in Coleman and Pothen (1985). In this paper we develop heuristic algorithms to find sparse null bases. These algorithms have two phases: In the first combinatorial phase, a minimal dependent set of columns is identified by finding a matching in the bipartite graph of the matrix. In the second numerical phase, a null vector is computed from this dependent set. We describe an implementation of our algorithms and provide computational results on several large sparse constraint matrices from linear programs. One of our algorithms compares favorably with previously reported algorithms in sparsity of computed null bases and in running times. Unlike the latter, our algorithm does not require any intermediate dense matrix storage. This advantage should make our algorithm an attractive candidate for large sparse null basis computations. A matching based algorithm is designed to find orthogonal null bases, but we present some theoretical evidence that such bases are unlikely to be sparse. Finally, we show how sparsest orthogonal null bases may be found for an $n$-vector and a $t \times n$ dense matric by a divide and conquer strategy. The algorithm for a dense matrix is suited for implementation on a parallel machine architecture.
Numerical analysis on binomial tree methods for a jump-diffusion model
Authors: Cheng-long Xu, Xiao-song Qian, Li-shang Jiang
Venue: Journal of Computational and Applied Mathematics (2003)

This paper studies the numerical approximation for an European option pricing model with jump-diffusion. Equivalence of the Binomial tree method and an explicit difference scheme is discussed. The optimal error estimation of the Binomial tree approximation is also given. Another explicit difference scheme is constructed, which has higher accuracy than the Binomial tree method. Numerical results coincide with the theoretical results.
Verifiable Semantics for Agent Communication Languages
Authors: Michael Wooldridge
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

This paper examines the issue of developing semantics for agent communication languages. In particular, it considers the problem of giving a verifiable semantics for such languages --- a semantics where conformance (or otherwise) to the semantics could be determined by an independent observer. These problems are precisely defined in an abstract formal framework. Using this framework, a number of example agent communication frameworks are examined with respect to the problem of verifying conformance. A discussion is then presented, of the various options open to designers of agent communication languages, with respect the problem of verifying conformance.
Application of the Ray-Representation and a Massively Parallel Special Purpose Computer to Problems of Protein Structure and Function: I. Methodology for Calculation of Molecular Contact Surface, Volume, and Internal Free Space
Authors: S M Head, Gershon Kedem, G M Prisant
Venue:  (1994)

Methodology is developed to apply ray-representations to geometric analysis of space-filling models of protein structure. The following specific problems are treated. First, we define the ray-representation for fused-sphere models of proteins. Second, using the ray-representation, we treat computation of molecular contact surfaces in solution via Minkowski dilation and erosion. Third, we describe how all points of the molecular contact surface can be tagged according to their chemical properties. Fourth, we show how equivalence set methods can be applied to ray representations of proteins in order to identify internal empty spaces and classify their connectedness to the outside. Fifth, we develop filters to analyze the morphology of interstitial spaces in proteins which connect to the outside. Sixth, we discuss how Boolean algorithms can be used to determine whether water molecules identified in X-ray crystallography are inside, outside, or intersecting the boundary defined by the solvent accessible surface. Finally we discuss the computation of volume properties from ray-representations. A special purpose massively parallel computer is used to compute the ray-representation.
A Handwritten Character Recognition Method Based on Unconstrained Elastic Matching and Eigen-Deformations
Authors: Seiichi Uchida, Hiroaki Sakoe
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

A fast elastic matching based handwritten character recognition method is investigated. In the present method, an unconstrained elastic matching technique, where the matching is optimized locally and individually on each pixel, is utilized together with its a posteriori evaluation based on the eigen-deformations of handwritten characters. Our experimental results show that high recognition rates can be attained by the present method with feasible compu-tations.
Cisco Switching Black Book
Authors: Sean Odom, Hanson Nottingham
Venue:  (2002)

:Written as a comprehensive guide for intermediate and advanced network professionals, who want to install or maintain a Cisco switching environment or learn about Cisco switching technologies. No other book thoroughly covers the advanced topics required to achieve this level of comprehensive Cisco knowledge or certification in the new CCNP curriculum. Includes valuable information for those studying for the CCNP certification including tips and hints, sample review questions and lab exercises. Explores complex topics in-depth, in the popular Black Book format, using a complete systematic approach to Cisco switching along with comprehensive examples and diagrams.