A group of Saul'yev asymmetric difference schemes based on follow-flow scheme to approach KdV equation is given here. Using these new asymmetric difference schemes, we construct the parallel alternating group sche...
详细信息
ISBN:
(纸本)9781424472352
A group of Saul'yev asymmetric difference schemes based on follow-flow scheme to approach KdV equation is given here. Using these new asymmetric difference schemes, we construct the parallel alternating group schemes based on follow-flow scheme, which are absolutely stable by analysis of linearization procedure. Numerical experiments for the cases of single soliton solution and double soliton solution are performed, which show that the accuracy and stability of the schemes are better than parallel algorithms existed.
Texture mapping is an important part of the realistic graphics rendering process. In this paper we parallelize the algorithm for traditional texture mapping to improve the running speed of the program. The experimenta...
详细信息
Texture mapping is an important part of the realistic graphics rendering process. In this paper we parallelize the algorithm for traditional texture mapping to improve the running speed of the program. The experimental results show that, the speed-up of the program can reach to 1.92 in average.
We study the class of masking based domain extenders for UOWHFs. Our first contribution is to show that any correct masking based domain extender for UOWHF which invokes the compression UOWHF s times must use at least...
详细信息
ISBN:
(纸本)3540239758
We study the class of masking based domain extenders for UOWHFs. Our first contribution is to show that any correct masking based domain extender for UOWHF which invokes the compression UOWHF s times must use at least [log(2) s] masks. As a consequence, we obtain the key expansion optimality of several known algorithms among the class of all masking based domain extending algorithms. Our second contribution is to present a new parallel domain extender for UOWHF. The new algorithm achieves asymptotically optimal speed-up over the sequential algorithm and the key expansion is almost everywhere optimal, i.e., it is optimal for almost all possible number of invocations of the compression UOWHF. Our algorithm compares favourably with all previously known masking based domain extending algorithms.
The paper introduced recursive algorithm of fractal graphics,put forward fractal graphics parallel algorithm. Analyzing recursive algorithmic time complexity and speedup rate of the parallel *** experimental results o...
详细信息
The paper introduced recursive algorithm of fractal graphics,put forward fractal graphics parallel algorithm. Analyzing recursive algorithmic time complexity and speedup rate of the parallel *** experimental results of PC cluster show that the theoretical analysis and the experimental results of fractal graphics parallel algorithm are consistency with a marked speedup rate.
The scale of data in the Internet environment is becoming increasingly large and complex. Its heterogeneous, dynamic and distributed information characteristics have caused the existing business scanning and monitorin...
详细信息
In the last couple of decades there has been an increasing interest in the application of source separation technologies to musical signal processing. Given a signal that consists of a mixture of musical sources, sour...
详细信息
In the last couple of decades there has been an increasing interest in the application of source separation technologies to musical signal processing. Given a signal that consists of a mixture of musical sources, source separation aims at extracting and/or isolating the signals that correspond to the original sources. A system capable of high quality source separation could be an invaluable tool for the sound engineer as well as the end user. Applications of source separation include, but are not limited to, remixing, up-mixing, spatial re-configuration, individual source modification such as filtering, pitch detection/correction and time stretching, music transcription, voice recognition and source-specific audio coding to name a *** particular interest is the problem of separating sources from a mixture comprising two channels (2.0 format) since this is still the most commonly used format in the music industry and most domestic listening environments. When the number of sources is greater than the number of mixtures (which is usually the case with stereophonic recordings) then the problem of source separation becomes under-determined and traditional source separation techniques, such as “Independent Component Analysis” (ICA) cannot be successfully applied. In such cases a family of techniques known as “Sparse Component Analysis” (SCA) are better suited. In short a mixture signal is decomposed into a new domain were the individual sources are sparsely represented which implies that their corresponding coefficients will have disjoint (or almost) disjoint supports. Taking advantage of this property along with the spatial information within the mixture and other prior information that could be available, it is possible to identify the sources in the new domain and separate them by going back to the time domain. It is a fact that sparse representations lead to higher quality separation. Regardless, the most commonly used front-end for a SCA system is the ubiquitous
In this paper,a dynamic delivery and pick-up vehicle routing problem(DVRP) with ready-time and deadline of customer goods is *** using the rolling horizon approach,the DVRP is modeled and *** each decision epoch, the ...
详细信息
ISBN:
(纸本)9781479900305
In this paper,a dynamic delivery and pick-up vehicle routing problem(DVRP) with ready-time and deadline of customer goods is *** using the rolling horizon approach,the DVRP is modeled and *** each decision epoch, the open vehicle routing problem with multiple depots is *** on the adaptive memory programming,a master-slave parallel tabu search algorithm is developed,and an insertion procedure is also suggested for the real-time urgent orders. Computational experiment reveals that the parallel tabu search algorithm is of high practical value for solving the dynamic vehicle routing problem.
This paper presents a parallel zigzag (raster) tool-path generation method for Additive Manufacturing (AM). Based on the analysis of some ordinary serial algorithms, it was observed that some compute-intensive operati...
详细信息
This paper presents a parallel zigzag (raster) tool-path generation method for Additive Manufacturing (AM). Based on the analysis of some ordinary serial algorithms, it was observed that some compute-intensive operations could be parallelized by using a Graphics Processing Unit (GPU) architecture. However, to achieve this, many challenges were faced and solved by designing a method to work concurrently with individual contour segments on multiple layers while keeping the data organized. The method's ability to solve the zigzag generation problem was verified, and its performance was measured by running an exhaustive search for optimal raster angles to reduce manufacturing time. The results showed that the method was effective and generated relevant computational gain, being up to 9 times faster than its serial counterpart. In the tool-path optimization, the simulations found configurations yielding an average length of raster lines up to 38% longer, which, in turn, can reduce manufacturing time.
暂无评论