Evolutionary circuit design, is a time-intensive process, especially for large scale circuits. In this paper, we design a distributed computation framework for evolutionary circuit design via parallel genetic algorith...
详细信息
ISBN:
(纸本)9781538676356
Evolutionary circuit design, is a time-intensive process, especially for large scale circuits. In this paper, we design a distributed computation framework for evolutionary circuit design via parallel genetic algorithm, which actualizes the tasks-distributing and tasks-collecting with the employment of communication network structure using client-sever mode. A series of experiments are conducted and the results show that the framework presented performs better on seeking for the circuits that satisfy designer specified performance goals with high efficie-ncy, great flexibility, strong fault tolerance.
Many data mining methods have been proposed to obtain useful word associations in text documents. However, it is of great challenge to efficiently discover "pure'' high-order (n > 3) word association p...
详细信息
ISBN:
(纸本)9783642549243;9783642549236
Many data mining methods have been proposed to obtain useful word associations in text documents. However, it is of great challenge to efficiently discover "pure'' high-order (n > 3) word association patterns, especially in the rapidly expanding data collection. Here, by "pure,'' we mean that those words form an inseparable semantic entity, i.e., the high-order dependence that cannot be reduced to the random coincidence of low-order dependence. Our aim is to find pure high-order word associations in large data sets. This paper proposes a distributed pure dependence mining (DPDM) algorithm based on information geometry, which can efficiently mine the pure dependence between words. We also construct a distributed pure dependence mining framework (DPDMF) to mine pure high-order word associations from data sets. Extensive experiments show that DPDM algorithm can significantly improve the efficiency when mining the pure high-order patterns from large data sets. Finally, we apply the extracted high-order word association patterns in the text classification tasks, which will also achieve significant improvement.
The stability and performance of visual servo control systems strongly depend on the delays caused by image processing. In order to accelerate the visual feedback, the distributed computational power across networks a...
详细信息
ISBN:
(纸本)9781424466757
The stability and performance of visual servo control systems strongly depend on the delays caused by image processing. In order to accelerate the visual feedback, the distributed computational power across networks and appropriate data mechanism are of particular interest. In this paper, a novel distributed computation with data scheduling is proposed for networked visual servo control systems (NVSCSs) aiming at improving the control performance. A realtime transport protocol is developed for image data transmission. For a NVSCS which is modeled as a continuous-time system with computation, transmission and holding delays, a switching control law is applied. A probabilistic sampling scheduler is derived such that the control performance and the network load caused by image data transmission are balanced. Experiments on two 1-DoF linear modules equipped with a camera are conducted to validate the proposed approach. A visual servo system without data scheduling is implemented for comparison. The experimental results demonstrate a comparable control performance of the proposed approach with an advantage of reduced network load.
In this paper, we propose CodedSketch, as a distributed straggler-resistant scheme to compute an approximation of the multiplication of two massive matrices. The objective is to reduce the recovery threshold, defined ...
详细信息
In this paper, we propose CodedSketch, as a distributed straggler-resistant scheme to compute an approximation of the multiplication of two massive matrices. The objective is to reduce the recovery threshold, defined as the total number of worker nodes that the master node needs to wait for to be able to recover the final result. To exploit the fact that only an approximated result is required, in reducing the recovery threshold, some sorts of pre-compression are required. However, compression inherently involves some randomness that would lose the structure of the matrices. On the other hand, considering the structure of the matrices is crucial to reduce the recovery threshold. In CodedSketch, we use count-sketch, as a hash-based compression scheme, on the rows of the first and columns of the second matrix, and a structured polynomial code on the columns of the first and rows of the second matrix. This arrangement allows us to exploit the gain of both in reducing the recovery threshold. To increase the accuracy of computation, multiple independent count-sketches are needed. This independency allows us to theoretically characterize the accuracy of the result and establish the recovery threshold achieved by the proposed scheme. To guarantee the independency of resulting count-sketches in the output, while keeping its cost on the recovery threshold minimum, we use another layer of structured codes. The proposed scheme provides an upper-bound on the recovery threshold as a function of the required accuracy of computation and the probability that the required accuracy can be violated. In addition, it provides an upper-bound on the recovery threshold for the case that the result of the multiplication is sparse, and the exact result is required.
We consider a status update system in which the update packets need to be processed to extract the embedded useful information. The source node sends the acquired information to a computation unit (CU) which consists ...
详细信息
We consider a status update system in which the update packets need to be processed to extract the embedded useful information. The source node sends the acquired information to a computation unit (CU) which consists of a master node and $n$ worker nodes. The master node distributes the received computation task to the worker nodes. Upon computation, the master node aggregates the results and sends them back to the source node to keep it updated. We investigate the age performance of uncoded and coded (repetition coded, MDS coded, and multi-message MDS (MM-MDS) coded) schemes in the presence of stragglers under i.i.d. exponential transmission delays and i.i.d shifted exponential computation times. We show that asymptotically MM-MDS coded scheme outperforms the other schemes. Furthermore, we characterize the optimal codes such that the average age is minimized.
Decision-making on discrete event systems with alternative structural configurations is a field with application to the efficient design and operation of many systems, ranging from manufacturing facilities to communic...
详细信息
Decision-making on discrete event systems with alternative structural configurations is a field with application to the efficient design and operation of many systems, ranging from manufacturing facilities to communication networks. The solution of this problem may be afforded by its transformation into an optimization problem. A variety of statements for this optimization problem can be presented by using different formalisms able to describe the model of the system. These different statements allow developing diverse optimization algorithms for solving the problem, which may be very demanding for a computer. In this paper, several approaches are presented in order to reduce the computing requirements needed by the mentioned algorithms, some of them are implemented in one processor and others are based on distributed computing. In particular, this paper presents a new distributed methodology, which associates sets of alternative structural configurations of the system to different alternative aggregation Petri net (AAPNs), regarding the number of available processors. Under certain conditions, this methodology alleviates the computational requirements for every processor and speeds up the optimization process. A case-study is presented and different techniques are applied to solve it, for illustrating diverse distributed and non-distributed methodologies, regarding the available processors, as well as for comparing their relative performance.
A simple model of distributed computation that requires information exchange over a noisy channel is considered. A communication protocol is utilized that requires alternate bit exchanges between two processors. Inter...
详细信息
A simple model of distributed computation that requires information exchange over a noisy channel is considered. A communication protocol is utilized that requires alternate bit exchanges between two processors. Interest in determining the communication complexity of this exchange is also shown. First, the case of a single public channel is considered and the number of bits that need to be exchanged between the processors to permit delta-accuracy in their goal is computed. For this computation, an error-detection-and-retransmission mechanism of error control, as well as an error-correction-and-retransmission mixture that are consistent with the logical protocol that governs this exchange are considered. Second, the case of the availability of an additional secret channel is considered and interest in determining the minimum number of bits that need to be exchanged over a secret channel in order to maintain epsilon-uncertainty about the computation for an eavesdropper on the public channel is shown. Various subcases under this case are considered and an upper bound on the number of secret bits when no error-control scheme is used is obtained.
An attempt has been made to develop a distributed software infrastructure model for onboard data fusion system simulation, which is also applied to netted radar systems, onboard distributed detection systems and advan...
详细信息
An attempt has been made to develop a distributed software infrastructure model for onboard data fusion system simulation, which is also applied to netted radar systems, onboard distributed detection systems and advanced C3I systems. Two architectures are provided and verified: one is based on pure TCP/IP protocol and C/S model, and implemented with Winsock, the other is based on CORBA (common object request broker architecture). The performance of data fusion simulation system, i.e. reliability, flexibility and scalability, is improved and enhanced by two models. The study of them makes valuable explore on incorporating the distributed computation concepts into radar system simulation techniques.
Fundamental differences are shown to exist in graph traversal techniques between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. Two ...
详细信息
Fundamental differences are shown to exist in graph traversal techniques between serial and distributed computations in their behaviors, computational complexities, and effects on the design of graph algorithms. Two distributed algorithms are presented together with their computational complexity for graph traversal based on the depth-first search and breadth-first search techniques. Several distributed versions are given of the Ford and Fulkerson algorithm for the depth-first, largest augmentation, and breadth-first search methods. A worst case upper bound on the number of messages transmitted also is acquired for each of these versions. As in the case of serial computation, these complexity results do not clearly indicate that one of these methods is superior to the others. However, combining these bounds with empirical results indicates that, in distributed computation, largest augmentation appears to be a better method than the other 2.
We consider the task of evaluating the spread of influence in large networks in the well-studied independent cascade model. We describe a novel sampling approach that can be used to design scalable algorithms with pro...
详细信息
ISBN:
(纸本)9781450336642
We consider the task of evaluating the spread of influence in large networks in the well-studied independent cascade model. We describe a novel sampling approach that can be used to design scalable algorithms with provable performance guarantees. These algorithms can be implemented in distributed computation frameworks such as MapReduce. We complement these results with a lower bound on the query complexity of influence estimation in this model. We validate the performance of these algorithms through experiments that demonstrate the efficacy of our methods and related heuristics.
暂无评论