the extraction of association rules from large transactional databases is considered in the paper using cluster architecture parallel computing. Motivated by boththe successful sequential BSO-ARM algorithm, and the s...
详细信息
ISBN:
(纸本)9783319321493;9783319321486
the extraction of association rules from large transactional databases is considered in the paper using cluster architecture parallel computing. Motivated by boththe successful sequential BSO-ARM algorithm, and the strong matching between this algorithm and the structure of the cluster architectures, we present in this paper a new parallel ARM algorithm that we call MW-BSO-ARM for master/worker version of BSO-ARM. the goal is to deal with large databases by minimizing the communication and synchronization costs, which represent the main challenges that faces any cluster architecture. the experimental results are very promising and show clear improvement that reaches 300% for large instances. For examples, in big transactional database such as WebDocs, the proposed approach generates 10(7) satisfied rules in only 22 min, while a previous GPU-based approach cannot generate more than 10(3) satisfied rules into 10 h. the results also reveal that MW-BSO-ARM outperforms the PGARM cluster-based approach in terms of computation time.
Clean speech data is necessary for spoken language processing, however, there is no public Japanese dialect corpus collected for speech processing. parallel speech corpora of dialect are also important because real di...
详细信息
ISBN:
(纸本)9782951740891
Clean speech data is necessary for spoken language processing, however, there is no public Japanese dialect corpus collected for speech processing. parallel speech corpora of dialect are also important because real dialect affects each other, however, the existing data only includes noisy speech data of dialects and their translation in common language. In this paper, we collected parallel speech corpora of Japanese dialect, 100 read speeches utterance of 25 dialect speakers and their transcriptions of phoneme. We recorded speeches of 5 common language speakers and 20 dialect speakers from 4 areas, 5 speakers from 1 area, respectively. Each dialect speaker converted the same common language texts to their dialect and read them. Speeches are recorded with closed-talk microphone, using for spoken language processing (recognition, synthesis, pronounce estimation). In the experiments, accuracies of automatic speech recognition (ASR) and Kana Kanji conversion (KKC) system are improved by adapting the system withthe data.
the proceedings contain 57 papers. the special focus in this conference is on Artifical Intelligence, Data Mining, Knowledge Discovery, algorithms for Efficient Data processing and Data Warehousing. the topics include...
ISBN:
(纸本)9783319340982
the proceedings contain 57 papers. the special focus in this conference is on Artifical Intelligence, Data Mining, Knowledge Discovery, algorithms for Efficient Data processing and Data Warehousing. the topics include: Interactive visualization of big data;reduction of readmissions to hospitals based on actionable knowledge discovery and personalization;performing and visualizing temporal analysis of large text data issued for open sources;influence of outliers introduction on predictive models quality;methods for selecting nodes for maximal spread of influence in recommendation services;memetic neuro-fuzzy system with differential optimisation;new rough-neuro-fuzzy approach for regression task in incomplete data;improvement of precision of neuro-fuzzy system by increase of activation of rules;rough sets in multicriteria classification of national heritage monuments;inference rules for fuzzy functional dependencies in possibilistic databases;the evaluation of map-reduce join algorithms;the design of the efficient theta-join in map-reduce environment;non-recursive approach for sort-merge join operation;estimating costs of materialization methods for SQL;performance aspect of the in-memory databases accessed via JDBC;comparison of the behaviour of local databases and databases located in the cloud;scalable distributed two-layer datastore providing data anonymity;coordination of parallel tasks in access to resource groups by adaptive conflictless scheduling;conflictless task scheduling using association rules;distributed computing in monotone topological spaces;new similarity measure for spatio-temporal OLAP queries;enhancing concept extraction from polish texts with rule management and a diversified classification committee for recognition of innovative internet domains.
the paper presents parallel implementation of searching the most similar subsequence in time series for computer cluster system with nodes based on Intel MIC accelerators. the algorithm involves three levels of data p...
详细信息
the paper presents parallel implementation of searching the most similar subsequence in time series for computer cluster system with nodes based on Intel MIC accelerators. the algorithm involves three levels of data parallelism. the first level provides partitioning of time series into equal-length fragments, each of which is processed on a separate node of the computer cluster;nodes interact using MPI technology. the second level of parallelism supposes division of the fragment into equal-length segments and processing of each segment by a separate thread by means of OpenMP technology. the third level provides load balancing between CPU and accelerator. CPU performs pruning of dissimilar subsequences. Accelerator performs heavy-weighted calculations of similarity measure. the results of experiments confirm the efficiency of algorithm.
the VLSI technology that is in place today caters to almost all technology based products but as the need for speed and space increases VLSI technology might not be able to keep up withthe demand. there are a lot of ...
详细信息
ISBN:
(纸本)9789380544199
the VLSI technology that is in place today caters to almost all technology based products but as the need for speed and space increases VLSI technology might not be able to keep up withthe demand. there are a lot of alternatives that are being researched on but very few can match VLSI in terms of performance. Technologies such as nanotechnology, photonics, quantum computing look promising in that ***-dot Cellular Automata(QCA) is one such technology which possibly can replace VLSI at the same time provides higher processing speed while occupying lesser space. In this paper we propose a design for([I])Serial Input parallel Output (SIPO)and (([I])serial Input Serial Output (SISO) registers withthe help of QCA technology Keywords Shift register, Quantum dot, QCA technology
Δ-stepping is an algorithm for solving single source shortest path problem. It is very efficient on a large class of graphs, providing nearly linear time complexity in sequential implementation, and can be paralleliz...
详细信息
Genetic algorithms (GAs) are one of the evolutionary algorithms for solving continuous nonlinear large-scale optimization problems. In an optimization problem, when dimension size increases, the size of search space i...
详细信息
ISBN:
(纸本)9789811004513;9789811004506
Genetic algorithms (GAs) are one of the evolutionary algorithms for solving continuous nonlinear large-scale optimization problems. In an optimization problem, when dimension size increases, the size of search space increases exponentially. It is quite difficult to explore and exploit such huge search space. GA is highly parallelizable optimization algorithm;still there is a challenge to use all the cores of multicore (viz. Dual core, Quad core, and Octa cores) systems. the paper analyzes the parallel implementation of SGA (Simple GA) called as OpenMP GA. OpenMP (Open Multi-processing) GA attempts to explore and exploit the search space on the multiple cores' system. the performance of OpenMP GA is compared with SGA with respect to time required and cores utilized for obtaining optimal solution. the results show that the performance of the OpenMP GA is remarkably superior to that of the SGA in terms of execution time and CPU utilization. In case of OpenMP GA, CPU utilization is almost double for continuous nonlinear large-scale test problems for the given system configuration.
In this paper, we compare a wide range of accelerator architectures (GPUs from AMD and NVIDIA, the Xeon Phi, and a DSP), by means of a signal-processing pipeline that processes radio-telescope data. We discuss the map...
详细信息
ISBN:
(纸本)9781509028245
In this paper, we compare a wide range of accelerator architectures (GPUs from AMD and NVIDIA, the Xeon Phi, and a DSP), by means of a signal-processing pipeline that processes radio-telescope data. We discuss the mapping of the algorithms from this pipeline to the accelerators, and analyze performance. We also analyze energy efficiency, using custom-built, microcontroller-based power sensors that measure the instantaneous power consumption of the accelerators, at millisecond time scale. We show that the GPUs are the fastest and most energy efficient accelerators, and that the differences in performance and energy efficiency are large.
In recent years k-means++ has become a popular initialization technique for improved k-means clustering. To date, most of the work done to improve its performance has involved parallelizing algorithmsthat are only ap...
详细信息
ISBN:
(纸本)9781509028245
In recent years k-means++ has become a popular initialization technique for improved k-means clustering. To date, most of the work done to improve its performance has involved parallelizing algorithmsthat are only approximations of k-means++. In this paper we present a parallelization of the exact k-means++ algorithm, with a proof of its correctness. We develop implementations for three distinct shared-memory architectures: multicore CPU, high performance GPU, and the massively multithreaded Cray XMT platform. We demonstrate the scalability of the algorithm on each platform. In addition we present a visual approach for showing which platform performed k-means++ the fastest for varying data sizes.
GPUs are an important hardware development platform for problems where massive parallel computations are needed. Many of these problems require a higher precision than the standard double floating-point (FP) available...
详细信息
ISBN:
(纸本)9781509015047
GPUs are an important hardware development platform for problems where massive parallel computations are needed. Many of these problems require a higher precision than the standard double floating-point (FP) available. One common way of extending the precision is the multiple-component approach, in which real numbers are represented as the unevaluated sum of several standard machine precision FP numbers. this representation is called a FP expansion and it offers the simplicity of using directly available and highly optimized FP operations. In this article we present new data-parallelalgorithms for adding and multiplying FP expansions specially designed for extended precision computations on GPUs. these are generalized algorithmsthat can manipulate FP expansions of different sizes (from double-double up to a few tens of doubles) and ensure a certain worst case error bound on the results.
暂无评论