The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Latency problems are characterized by their focus on minimizing total waiting time for all clients. We consider periodic latency problems: an extension of standard latency problems. In a periodic latency problem each client has to be visited regularly. More precisely, given is a server traveling at unit speed, and a set of clients with their positions. To each client a periodicity is associated that...
The metacube (MC) was introduced as a topology for interconnection networks of large parallel computers, and it has a merit that with a diameter similar to that of the hypercube, its degree is much lower: the 2m2k + k nodes of a metacube MC(k, m) have a degree of to + k. We introduce in this paper an efficient routing algorithm for finding in a metacube MC(k, m) disjoint paths between one source node...
A new physical layer network discovery approach is proposed based on tree-model which manages to solve the multi-subnet problem. According to the theory of maximum set and a set of formula, the method transforms the multi-subnet problem to single-subnet and simplifies the difficulty of the problem. The paper also figures out the critical value of the lost ratio which presents the completeness of the...
It is well known that reasoning with AI temporal projection problems is difficult. Determining the Possible Truth problem, a basic temporal projection decision problem, in the so-called Simple Event System remains NP-complete. In this paper, two types of constraints, on the graph-theoretic representation of the cause-and-effect relationships between events and on the partial orders of events, are...
This paper presents a novel two-dimensional DGW structure (2D_PPCT). Then a new encoding scheme is proposed, which combines permutation encoding and 2D_PPCT. Experiment shows that the new scheme not only makes full use of the structural advantages of PPCT but has high coding efficiency of permutation encoding.
In this paper, the dynamical behaviors of elementary cellular automata (ECA) rule 35 are studied from the viewpoint of symbolic dynamics. It is proved that rule 35, a member of Wolfram's class II, possesses rich and complicated dynamical behaviors in its two subsystems; that is, rule 35 is topologically mixing and possesses the positive topological entropy on each subsystem. Meanwhile, the phenomena...
We present a theoretically global equivalence classification of cellular automata (CA) on infinite lattices based on the point of view of topological conjugacy. In particular, based on this platform, we further demonstrate that among approximately 1.34 ?? 10154 CA rules with nine variables there exists a dual rule of the famous game of life, which has been shown to be capable of universal computation,...
Graph matching plays a key role in structural pattern recognition. However, for concrete application, an appropriate feature graph topology must be chosen. In this paper, this issue is investigated by comparing the performance of four different graph topologies with respect to four types of feature graphs and two algebraically graph matching methods: least squares method (LSM) and eigenspectral methods...
Stochastic fairness queuing scheduling scheme resolved the connection level fairness problem and are widely used in traditional network, however, with rapid development of P2P services in Internet, this classical algorithms failed in maintaining fairness among hosts. In this paper we proposed an improved SFQ algorithm: Dual Class SFQ to ensure the fairness among hosts using different type of services...
This paper presents a novel method of streamline placement for 2D vector field. In this method, the topological skeleton of underlying field is firstly extracted and used as initial streamlines. Initial streamlines segment the field into topological areas. Additional streamlines are then seeded at the center of topological areas in a recursive way, until there is no any valid empty area. To implement...
An important traffic engineering problem for OSPF networks is the determination of optimal link weights. In this paper, we assume that the traffic matrix, which specifies traffic load between every source-destination pair in the network, is unknown and varies with time, but that always lies inside an explicitly defined region. Our goal is to compute an optimal link weights that minimizes maximum link...
Resource discovery is a key component of P2P network. The resource discovery algorithm complexities of classic models, such as Chord and Pastry, are always equal or even bigger than O(logN), which means while the network scale increasing, the time delay will also increase rapidly without a ceiling. In this paper, we present a new P2P network model for resource discovery. Firstly, we take location-aware...
Based on the generic addresses forwarding table (AFT), a physical topology discovery algorithm, which is adaptable to multi-subnet network with shared segment and dump switch, is defined and the correctness is proved. The algorithm solves the problem that a complete AFT uniquely determines the physical topology for multi-subnet network, can discover the physical connections between switch and switch...
This paper presents an algorithm to find a simple path in the given network with multiple must-include nodes in the path. The problem of finding a path with must-include node(s) can be easily found in some special cases. However, in general, including multiple nodes in the simple path has been shown to be NP-Complete. This problem may arise in network areas such as forcing the route to go through...
The networks of interdependencies in large-scale software systems are complex, understand and measurement become a key problem for developer. we propose that OO design structure can be quantitative analyzed and better understood via core-shell decomposition based on complex networks. The k-core analysis allows to characterize networks beyond the degree distribution and uncover structural hierarchies...
This paper presents a fast incremental insertion algorithm for constructing constrained Delaunay triangulation. Constraints are considered any kind of polygonal lines. The bottleneck of incremental Delaunay triangulation algorithm is the search for a triangle containing current integrating point. The advantage of our algorithm over the others is that we used an efficient Skvortsov's algorithm, dynamic...
In this article we present a new approach for the classification of structured data using graphs. We suggest to solve the problem of complexity in measuring the distance between graphs by using a new graph signature. We present an extension of the vector representation based on pattern frequency, which integrates labeling information. In this paper, we compare the results achieved on public graph...
This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed...
In this paper, our focus is to lower the communication complexity of self-stabilizing protocols below the need of checking every neighbor forever. Our contribution is threefold: (i) We provide new complexity measures for communication efficiency of self-stabilizing protocols, especially in the stabilized phase or when there are no faults, (ii) On the negative side, we show that for non-trivial problems...
In this paper we consider several problems regarding the optimal placement of storage servers in content delivery networks with tree-like topologies (paths, trees and cacti). We present several novel algorithmic solutions for locating (k+p)-centers and connected k-centers (and k-medians) in these networks, both in the continuous and the discrete cases. We comment both on the theoretical and the practical...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.