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.
Motivated by applications of distributed linear estimation, distributed control, and distributed optimization, we consider the question of designing linear iterative algorithms for computing the average of numbers in a network. Specifically, our interest is in designing such an algorithm with the fastest rate of convergence given the topological constraints of the network. As the main result of this...
Fractal is the theory of studying the geometry and rules behind the nonlinear complex systems with self-similarity structure that widely exists in the nature and IFS is the key technology for constructing fractal images. This paper studies various computer construction algorithms for generating fractal images based on IFS attractor and their application range and limitation are analyzed. The deterministic...
In this paper, we propose a new network topology for P2P overlay. The proposed topology is a contracted graph of an n-star, which realizes a short diameter with a small degree compared with conventional hyper cubic networks such as Chord and skip graph.
Network coding was first introduced in information theory for increasing the multicast rate in the networks with directed links. We can model many of the content distribution networks and overlay networks with such a network. Therefore, the solutions introduced in information theory can be used in these networks. In this paper, we analyze using of network coding in uncoordinated cooperative content...
Two dimensional almost-Riemannian geometries are metric structures on surfaces defined locally by a Lie bracket generating pair of vector fields. We study the relation between the topology of an almost-Riemannian structure on a compact oriented surface and the total curvature. In particular, we analyse the case in which there exist tangency points, i.e. points where two generators of the distribution...
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...
We propose a novel view on efficient packet forwarding in wireless mesh networks based on a molecular analogy in which mesh routers are either nuclei or electrons in an atom that corresponds to a 802.11 cell. In this view, a mesh network appears as a collection of spatially distributed 802.11 cells operating on different channels. We define molecular MAC that uses dynamic channel switching at neighbor...
Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that is cumbersome and expensive to analyze. This paper presents an automatic framework to convert all process traces corresponding to the parallel execution of an SPMD MPI program into a single logical trace. First, the application...
A graph-based method is described allowing to generate models of crystal structures for a given set of parameters. It uses symmetry-labeled periodic graphs and is complete insofar as all possible topologies are enumerated. Parameters and information on symmetries are taken into account as early as possible in order to reduce the number of graphs in intermediate results significantly.
In recent years there was much attention about connected dominating set as a backbone for wireless networks. The aim is changing much nodes' state to inactive as possible and keep smallest number of nodes active and leave communication duty of inactive group to active group. In previous algorithms for attaining this goal, nodes with greater degree were kept active and trees were grown over nodes with...
Resource space model (RSM) is a normalized classification model that uses m-dimensional semantic spaces to share and manage various resources in a centralized manner. This paper explores how to use the idea of classification semantics to organize indexes of resources in a decentralized manner. We deploy RSM on a structured P2P topology HRing by two ID management methods. HRing is a ring-structured...
Research on existing vector representation method of the text data and it is advantages or disadvantages and applicability of linear and nonlinear dimensionality reduction methods, the paper analysis the feature of laws and regulations of construction data, establishes the vector space model of the text data. Based on Riemann Surface Theory and Topology Theory, adopting the globe pole mapping method...
Existing algorithms for utilizing high-capacity nodes in heterogeneous P2P systems (e.g.) often require unrealistically large node degree and high maintenance overhead in P2P networks with highly diverse node capacities and high churn. In this paper, we propose an unstructured P2P system that addresses these issues. We first prove that the overall throughput of search queries in a heterogeneous network...
The high capacity of fibers used in optical networks, can be divided into many channels, using the WDM technology. Any damage to a fiber causes all the channels routed through this link to be broken, which may result in a serious amount of data loss. As a solution to this problem, the virtual layer can be mapped onto the physical topology, such that, a failure on any physical link does not disconnect...
D-meshes belong to an extended family of regular two-dimensional meshes of an arbitrary degree d. They have shorter maximal and average node-to-node distances than most other interconnection networks. Competitive congestion-free routing algorithms for all-to-all communication can be implemented on d-meshes. Additional nodes can be added to the system with no changes on most of existing nodes and with...
The challenge ofpeer-to-peer (P2P) applications is how to efficiently broadcast in large-scale P2P networks. This paper presents the 8-point Hyper Circle protocol for efficient broadcasting and routing of messages in P2P networks. The Hyper Circle topology consists of n-dimensional 8-point circles where each point in each dimension can consist of an 8-point circle. A Hyper Circle node requires 2*k...
While performing tasks such as estimating the topology of camera network coverage or coordinate-free object tracking and navigation, knowledge of camera position and other geometric constraints about the environment are considered unnecessary. Instead, topological information captured by the construction of a simplicial representation called the CN-Complex can be utilized to perform these tasks. This...
We propose a new mechanism for generating networks with a wide variety of degree distributions. The idea is a modification of the well-studied preferential attachment scheme in which the degree of each node is used to determine its evolving connectivity. Modifications to this base protocol to include features other than connectivity have been considered in building the network. However, schemes based...
The botnet construction mechanism (BCM) is one of the key technologies of the botnets and the most important issue to both the attackers and the defenders. To the best of our knowledge, although the BCM has been mentioned in many researching papers, it has not been systemically studied. In this paper, we attempt to discuss the BCM methodically. We first give both the definition and its formalized...
Timed contact algebras constitute an approach to a temporal version of a region based theory of space. The general theory does not provide a notion of an underlying static world, i.e. it does not explicitly contain a set of non moving regions. Furthermore, the model of time does not have any structure, i.e. time is neither ordered nor required to be discrete or continuous. In this paper we want to...
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.