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.
The Support Vector Machines (SVM) become popular E-Business data mining tools recently, and the datasets of E-Business are usually large-scale. If Support Vector Machines are trained on large-scale datasets, the training time will be very long and the classifier's accuracy will become lower too. As training a large-scale SVM is equated to solve a large-scale quadratic programming (QP) problem, so...
Parallel architectures involves parallel communication with the aim of fast receiving of complete information with higher information rate at each nodes. To reduce the complexity of parallel communication we have considered Multi-Mesh of Trees (MMT) architecture for parallel communication and implemented Linear Network Coding (LNC) on MMT by proposing Linear-Code Multicast with Parallel Algorithms...
Algorithmic self-assembly, a generalization of crystal growth, has been proposed as a mechanism for the bottom-up fabrication of autonomous DNA computation. In theory, growth can be programmed by designing a set of molecular tiles with binding interactions that enforce assembly rules. There are many interesting applications of the reordering problem in Mathematics, as well as Computer Sciences. It...
This paper describes the application of a parallel genetic algorithm that solves the weekly timetable construction problem for elementary schools. Timetable construction is NP-complete and highly constrained problem, and therefore represents a computationally intensive task. A Parallel Genetic Algorithm (PGA) is proposed with specific methods for chromosome representation and fitness evaluation, and...
This paper presents a parallel architecture for the solution of linear equations based on the division free Gaussian elimination method is presented. This architecture can handle single and double data that follows the IEEE standard 754 for floating-point data. Also, it can be implemented in a FPGA Spartan 3 of Xilinx. The mathematical algorithm is implemented in an array of processors. The main procedure...
Sequential pattern mining is an active field in the domain of knowledge discovery and has been widely studied for over a decade by data mining researchers. More and more, with the constant progress in hardware and software technologies, real-world applications like network monitoring systems or sensor grids generate huge amount of streaming data. These works need an efficient and scalable parallel...
This research was motivated by the scheduling problem of parallel batch processing machines located in the diffusion and oxidation areas in a semiconductor wafer fabrication facility (wafer fab). The objective was to minimize the total weighted tardiness (TWT) on parallel batch processing machines which have incompatible job families, dynamic job arrivals, and constraints on the sequence-dependent...
This paper addresses a fundamental issue of Web service composition. We present a simple but powerful conceptual model that leads to a scalable approach to automatically constructing a composite Web service to meet its requirements by using as few services as possible. Our approach is based on a state space model that has a monotone property to allow efficient search along with efficient algorithms...
This paper proposes a dynamic communication-efficient pattern and introduces a new efficient data-exchange process in parallel sorting, called the DCES (Dynamic Communication-Efficient parallel Sorting) algorithm, to improve the communication time. In this approach, we present the dynamic communication pattern by using a ldquoBroadcast-Checkerrdquo table, which can reduce total iterations to one iteration...
Pairwise sequence alignment is a basic operation in bioinformatics that is performed thousands of times, in a daily basis. The exact methods proposed in the literature have quadratic time complexity. For this reason, heuristic methods such as BLAST are widely used. Nevertheless, it is known that exact methods present better sensitivity, leading to better results. To obtain exact results faster, many...
This paper investigates the conversion of residue number system (RNS) operands to decimal, which is an important issue concerning the utilization of RNS numbers in digital signal processing applications. In this line of reasoning, we introduce an RNS to mixed radix conversion (MRC) technique, which addresses the computation of mixed radix (MR) digits in such a way that enables the MRC parallelization...
Against the low index speed of serial algorithm for Web page inverted indexes construction, according to a characteristic of merge-sort algorithm meets the theory of scheduling divisible loads in parallel and distributed system, the paper proposed a new parallel algorithm basing on the triple sort-merge for Web page inverted indexes construction. The algorithm distributed parallel dealt with the two...
In this paper, we present a variational framework for joint disparity and motion estimation in a sequence of stereo images. The problem involves the estimation of four dense fields: two motion fields and two disparity fields. In order to reduce computational complexity and improve estimation accuracy, the two motion fields, for the left and right sequences, and the disparity field of the current stereo...
Knightpsilas tours are a fascinating subject. In [Discrete Appl. Math 150 (2005) 80-98], G.L.Chia and Siew-Hui Ong have presented generalized knightpsilas tours problem for the first time. In this paper, (i) we research the least chessboard (defined in Section 2) of (a,b)-knightpsilas tours (Section 3). (ii) we present an algorithm to (1,k)-knightpsilas tours which runs in O(nm) (Section 4).
Pattern matching includes verifying the existence of a pattern in a given reference set. It has exact and approximate matching types. Most important algorithms for pattern matching are Brute-Force, Morris-Pratt, Boyer-Moore, Wu-Manber, Baeza-Yates-Navarro, Myers and Dynamic Programming Algorithm. Systolic Array is a set of simple processing cells that are placed beside each other based on a regular...
Recent processors utilize a variety of parallel processing technologies to boost its performance, and thus it is required that multimedia applications can be efficiently parallelized and can be easily implemented on such a processor with parallel processing features. We implemented parallel algorithms for VQ compression on a shared-memory parallel environment and evaluated the effectivess of the parallel...
Many Web mining methods have recently been used to model user navigational behavior based on log files of the Web server. Cluster-based server architectures combine good performance and low cost, and are widely used for Web service. In this paper, we propose a parallel Web mining (PWM) algorithm for link prediction in the environment of Web cluster server consisting of several nodes that act as independent...
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.