the purpose of the paper is to present an algorithm for concurrent processing on multi-layer neural networks and its advantages in the context of development of parallel computing systems and clouds.
ISBN:
(纸本)9781467322768
the purpose of the paper is to present an algorithm for concurrent processing on multi-layer neural networks and its advantages in the context of development of parallel computing systems and clouds.
We present concurrent algorithms, based on depth-first search, for three problems relevant to model checking: given a state graph, to find its strongly connected components, which states are in loops, and which states...
详细信息
We present concurrent algorithms, based on depth-first search, for three problems relevant to model checking: given a state graph, to find its strongly connected components, which states are in loops, and which states are in "lassos". Each algorithm is a variant of Tarjan's algorithm. Our algorithms typically exhibit a three-or four-fold speed-up over the corresponding sequential algorithms on an eight-core machine.
The paper presents a concurrent algorithm for remote sensing applications that provides significant performance and image quality enhancements over conventional uniprocessor principal component transform (PCT) techniq...
详细信息
This paper preseflts a new approach of the synchronous homogeneous concurrent propagation of competitive waves for the purpose of hyper-distributed hyper-parallel heuristic problem-solving. The concurrent algorithm, m...
详细信息
This paper preseflts a new approach of the synchronous homogeneous concurrent propagation of competitive waves for the purpose of hyper-distributed hyper-parallel heuristic problem-solving. The concurrent algorithm, mechanism and their properties are given. In comparison with the traditional AI algorithms, the approach is featured by the knowledge-based problem-solving in the distributed parallel environment, the feasibility for hardware implementation and the various applications.
The concurrent manipulation of a binary search tree is considered in this paper. The systems presented can support any number of concurrent processes which perform searching, insertion, deletion, and rotation (reorgan...
详细信息
This paper proposes a semi-blind algorithm for frequency-domain (post-FFT) soft-decision concurrent equalization in OFDM systems. The objective is to improve system performance by increasing data throughput or decreas...
详细信息
ISBN:
(纸本)9780769537504
This paper proposes a semi-blind algorithm for frequency-domain (post-FFT) soft-decision concurrent equalization in OFDM systems. The objective is to improve system performance by increasing data throughput or decreasing power requirements, when compared with pilot based conventional channel estimation techniques. The Constant Modulus algorithm and the Soft Decision-Directed technique were concurrently employed to adjust the coefficients of a post-FFT equalizer bank. The algorithm works in a semi-blind mode because it uses channel information, obtained from pilot subcarriers, to initialize and to supervise the equalizer bank when pilots are present, otherwise remaining blind in the equalization process. To support such a concurrent equalization, the system should provide pilot subcarriers only in the first symbol of each OFDM super-frame, allowing algorithm initialization when the receiver is turned on. In the remaining super-frame symbols, pilot subcarriers can be suppressed to increase the overall system throughput.
This paper presents the technological relevance of a concurrent algorithm-based discrete element modelling (DEM) system, HADES. This new system is the successor of SPACE that is limited to spherical grains only. It ca...
详细信息
This paper presents the technological relevance of a concurrent algorithm-based discrete element modelling (DEM) system, HADES. This new system is the successor of SPACE that is limited to spherical grains only. It can realistically simulate the packing of arbitrary-shaped particles up to the fully compacted state. Generation of families of such particles, i.e., generally representing aggregate of fluvial origin and crushed rock, respectively, and the forming way of particulate structure are described. Similarly shaped particles are proposed for simulation of cement paste because of conformity with experimental results obtained by the X-ray tomography method. Technologically relevant territories inside and outside concrete technology are presently explored in this efficient, reliable, and economic way. Some results obtained by this DEM approach are presented.
For years, the mutual exclusion algorithm of Lycklama and Hadzilacos (1991) [21] was the optimal mutual exclusion algorithm with the first-come-first-served property, with a minimal number of (non-atomic) communicatio...
详细信息
For years, the mutual exclusion algorithm of Lycklama and Hadzilacos (1991) [21] was the optimal mutual exclusion algorithm with the first-come-first-served property, with a minimal number of (non-atomic) communication variables (5 bits per thread). Recently, Aravind published an improvement of it, which uses 4 bits per thread and has simplified waiting conditions. This algorithm is extended here with fault tolerance, and it is verified by assertional methods, using the proof assistant PVS. Progress is proved by means of UNITY logic. The paper proposes a new measure of concurrent time complexity, and proves that the concurrent complexity for throughput of the present algorithm is not more than quadratic in the number of threads. (C) 2015 Elsevier B.V. All rights reserved.
"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial answer by defining (non-deter...
详细信息
"What is an algorithm?" is a fundamental question of computer science. Gurevich's behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial answer by defining (non-deterministic) sequential algorithms axiomatically, without referring to a particular machine model or programming language, and showing that they are captured by (nondeterministic) sequential Abstract State Machines (nd-seq ASMs). However, recursive algorithms such as mergesort are not covered by this theory, as has been pointed out by Moschovakis, who had independently developed a different framework to mathematically characterize the concept of (in particular recursive) algorithm. In this article we propose an axiomatic definition of the notion of sequential recursive algorithm which extends Gurevich's axioms for sequential algorithms by a Recursion Postulate and allows us to prove that sequential recursive algorithms are captured by recursive Abstract State Machines, an extension of nd-seq ASMs by a CALL rule. Applying this recursive ASM thesis yields a characterization of sequential recursive algorithms as finitely composed concurrent algorithms all of whose concurrent runs are partial-order runs.
This paper proposes an asynchronous heterogeneous propagation approach of concurrent competitive waves for hyper-distributed hyper-parallel heuris tic problem-solving. This approach is much more powerful than the sync...
详细信息
This paper proposes an asynchronous heterogeneous propagation approach of concurrent competitive waves for hyper-distributed hyper-parallel heuris tic problem-solving. This approach is much more powerful than the synchronous homogeneous mechanisms and the asynchronous superimposition algorithms, and has universal validity and availability. The basic conception, concurrent algorithm and its properties are discussed. The theory and conclusions drawn in this paper are of essential importance for the hardware implementation of hyper-distributed hyper-parallel processing based on chaotic cellular networks.
暂无评论