questions, both initially raised by Plott, remained unanswered. What are the precise mathematical foundations for path independence? How can PI choice functions be constructed? We give complete answers to both these questions for finite domains and provide necessary conditions for infinite domains. We

Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks

Abstract We study rational modules over complete path and monomial algebras, and the problem of when rational modules over the dual C * of a coalgebra C are closed under extensions, equivalently, when is the functor Rat a torsion functor. We show that coreflexivity, closure under extensions

The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube has only about half diameter, wide diameter, and fault diameter of those of the n-dimensional hypercube. Embeddings of trees, cycles, shortest paths, and Hamiltonian paths in crossed cubes have been studied

The problem of planning a collision-free motions of a planar 3R-manipulator among point obstacles is studied using techniques from topology and homology. By completely characterizing the set of singular configurations (the points in configuration space corresponding to an intersection of the chain

In Basque, there is recurrent tendency to express both the source and goal of movement for the description of translational motion even in cases where one of these elements is pleonastic. This construction called ‘Complete Path ’ (Ibarretxe-Antuñano 2002) shows up not only in physical description

that no contemporaneous end-to-end path may ever exist. This situation limits the applicability of traditional routing approaches that tend to treat outages as failures and seek to find an existing end-to-end path. We propose a framework for evaluating routing algorithms in such environments. We then develop several

addresses. In this paper we describe a general purpose traceback mechanism based on probabilistic packet marking in the network. Our approach allows a victim to identify the network path(s) traversed by attack traffic without requiring interactive operational support from Internet Service Providers (ISPs

that performs random testing to simulate the most general environment the program can operate in; and (3) dynamic analysis of how the program behaves under random testing and automatic generation of new test inputs to direct systematically the execution along alternative program paths. Together, these three

The fifth release of the multithreaded language Cilk uses a provably good "work-stealing " scheduling algorithm similar to the rst system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided