The recent extensive availability of ‘cloud’ computing platforms is very appealing for the formal verification community. In fact, these platforms represent a great opportunity to run massively parallel jobs and ana...
详细信息
Centrality is an important measure to identify the most important actors in a network. This paper discusses the various Centrality Measures used in Social Network Analysis. These measures are tested on complex real-wo...
详细信息
In this paper, we present two parallel algorithms to compute common fixed points of a finite family of quasi-nonexpansive mappings in real Hilbert spaces, which improve and generalize some known results in this direct...
详细信息
In this paper, we present two parallel algorithms to compute common fixed points of a finite family of quasi-nonexpansive mappings in real Hilbert spaces, which improve and generalize some known results in this direction.
The Barabasi-Albert model (BA) is designed to generate scale-free networks using the preferential attachment mechanism. In the preferential attachment (PA) model, new nodes are sequentially introduced to the network a...
详细信息
Communication and agreement are fundamental abstractions in any distributed system. (If the computing entities do not need to communicate or agree in one way or another, the system is not a distributed system!) This t...
详细信息
The paper investigates the minimum-transmission broadcast problem in duty-cycled wireless sensor networks in which each sensor node alternates between active and sleeping modes during its lifetime for energy saving. W...
详细信息
With the developing of sensors, remote-sensing platforms and other related technologies, more and more ways to obtain remote-sensing information come forth, as well as the information style. At the same time, the amou...
详细信息
With the developing of sensors, remote-sensing platforms and other related technologies, more and more ways to obtain remote-sensing information come forth, as well as the information style. At the same time, the amount of data obtained by means of remote-sensing is rapidly increasing, but many applications need more fast processing of remote-sensing image. Apparently, the traditional singleprocessor serial fusion algorithm couldn't meet the needs of such operations, and parallel is an efficient technical mean to solve this problem. Therefore, the research of parallel algorithm on remotesensing image will greatly enhance the efficiency of image fusion, and it will have broad application prospects. We analyze these requirements in this paper, aiming at the research and implementation of there kinds of parallel algorithms for remote-sensing image fusion processing.
Model checking has long been used as a means of verification of formal specifications. This is a verification technique of dynamic systems that explores all possible states of the system. It determines whether the giv...
详细信息
Model checking has long been used as a means of verification of formal specifications. This is a verification technique of dynamic systems that explores all possible states of the system. It determines whether the given system satisfies its specification. This technique suffers from the state explosion problem when traversing all possible states of systems. parallel and/or distributed approaches are used to cope with the state space explosion problem. In this article, we propose a synchronized parallel algorithm of exploration based on a fixed number of threads. We present many experiments for a comparison between our parallel approach and the algorithm proposed for a parallel exploration in SPIN. We show by an experimental study that our parallel approach gives encouraging results.
The goal of Nonnegative Matrix Factorization (NMF) is to represent a large nonnegative matrix in an approximate way as a product of two significantly smaller nonnegative matrices. This paper shows in detail how an NMF...
详细信息
The goal of Nonnegative Matrix Factorization (NMF) is to represent a large nonnegative matrix in an approximate way as a product of two significantly smaller nonnegative matrices. This paper shows in detail how an NMF algorithm based on Newton iteration can be derived using the general Karush-Kuhn-Tucker (KKT) conditions for first-order optimality. This algorithm is suited for parallel execution on systems with shared memory and also with message passing. Both versions were implemented and tested, delivering satisfactory speedup results.
We consider the problem of constructing efficient parallel algorithms for global optimization. The results are of given the qualitative analysis of the possibility of overcoming the exponential growth of global optimi...
详细信息
暂无评论