Peer-to-peer systems offer an efficient means for sharing data among autonomous nodes. A central issue is locating the nodes with data matching a user query. A decentralized solution to this problem is based on using routing indexes which are data structures that describe the content of neighboring nodes. Each node uses its routing index to route a query towards those of its neighbors that prov...

The deployment of Self-Organizing Networks (SONs) raises a number of key design issues such as scalability, spontaneity, ease-of-management, adaptability, and dynamicallychanging topologies. In this context, routing is particularly challenging, and requires revisiting important components of the routing architecture/protocol suite, such as, establishing and managing an addressing scheme, provid...

The life of many people in the world is under the danger because of the accidents and unpredicted diseases, which require relief. Since, most of such cases occur in unpredictable condition, for an appropriate planning, the uncertain conditions should be investigated. Consequently, this paper investigates the integrated and multi-step process of locating, assigning and routing the air and la...

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...

Peer-to-peer computing is a term used to describe the current trend toward utilizing the full resources available within a widely distributed network of nodes with increasing computational power. These resources include the exchange of information, processing cycles, cache storage, and disk storage for files. Routing, locating and transmitting of resources, becomes an extremely important issue ...

In this paper, we describe a new technique for locating faulty Lookup Tables (LUTs) in FPGA-based reconfigurable systems. The technique is in-place (does not alter the routing structure of the LUT network) and is based on pseudo-exhaustive Built-In Self-Test where each configured LUT is tested exhaustively. Our technique involves selective reprogramming of the LUTs and takes advantage of partia...

The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...

Overlay networks are widely used for locating and disseminating information, by means of custom routing and forwarding on top of the underlying network. Distributed Hash Table (DHT) based overlays provide flexibility coupled with good scalability and load balancing properties. However, this comes at the cost of inefficient routing, caused by the lack of adaptation to the underlying network: cur...

The life of many people in the world is under the danger because of the accidents and unpredicted diseases, which require relief. Since, most of such cases occur in unpredictable condition, for an appropriate planning, the uncertain conditions should be investigated. Consequently, this paper investigates the integrated and multi-step process of locating, assigning and routing the air and la...

The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...