sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sor...
详细信息
ISBN:
(纸本)9781538642733
sorting algorithms are a major area of research in computer science and engineering where the simple task of sorting the numbers leads to complex algorithms. In recent years, many researchers have proposed several sorting techniques to enhance time and space complexities of the algorithms. The sorting technique presented in this paper makes use of the natural sequence of sorted elements in an array of random numbers so as to reduce the number of steps needed to sort. The complexity of the proposed algorithm is O(nlogn) where n represents the number of elements in the input array.
The panoramic image mosaic technology means images with partial overlapping area are composited to a 360-degree circular image which describes the information of a certain scene. A hotspot of this technology is how to...
详细信息
ISBN:
(纸本)9781479918195
The panoramic image mosaic technology means images with partial overlapping area are composited to a 360-degree circular image which describes the information of a certain scene. A hotspot of this technology is how to determine the image order accurately and fast when the number of images is large. In this paper, we present a novel image sorting algorithm based on SIFT(Scale-Invariant Features Transform). In the proposed method, matching feature is firstly characterized by calculating the number of matching points between images to find the nearest image of a certain one. After calculating the matching points one by one, an accurate picture order could be finally obtained. The results show the effectiveness of the proposed algorithm.
Capacitor voltage balancing strategy for Suhmodules (SMs) is one of the key technologies for modular multi-level converters(MMC). The conventional strategy has the problems of large computation and high switching freq...
详细信息
ISBN:
(纸本)9781728120621
Capacitor voltage balancing strategy for Suhmodules (SMs) is one of the key technologies for modular multi-level converters(MMC). The conventional strategy has the problems of large computation and high switching frequency of devices. In order to solve these problems, a mark and operation voltage balancing strategy (MOVBS) is proposed. This strategy marks SMs with two different labels according to the amplitude of capacitor voltage of SMs and current direction of arms, then do sorting and selecting operations to SMs based on the marking results. It reduces sorting times, switching frequency and power loss of devices. For capacitor voltage sorting process, a binary radix sorting algorithm(BRSA) is proposed to improve sorting speed and efficiency of MOVBS. Finally, the feasibility and effectiveness of the MOVBS is verified with a 11-level MMC-HVDC simulation model created in Matlab/Simulink.
DRAM technology is approaching its scaling limit and the use of emerging NVM is seen as one possible solution to such an issue. As NVM technologies are not mature enough and does not outperform DRAMs, several studies ...
详细信息
ISBN:
(纸本)9781538674031
DRAM technology is approaching its scaling limit and the use of emerging NVM is seen as one possible solution to such an issue. As NVM technologies are not mature enough and does not outperform DRAMs, several studies expect the use of hybrid main memories containing both DRAM and PCM NVM. Redesigning applications for such systems is mandatory as PCM does not have the same performance model as DRAM. In this context, we designed a hybrid memory-aware sorting algorithm called MONTRES-NVM. Since an NVM-based hybrid memory presents a performance gap between DRAM and PCM, we believe that the sorting algorithm falls in the external sorting category. As a matter of fact, we extended our previously designed flash-based external sorting algorithm MONTRES for a hybrid memory by taking profit of byte addressability, and performance asymmetry between reads and writes. MONTRES-NVM enhances the performance of the merge sort algorithm on PCM by more than 60%, the merge sort on DRAM by 3-40% and MONTRES (on a hybrid memory) by 3-33% according to the proportion of already sorted data in the dataset.
According to the demand of large data sorting algorithm,a new efficient algorithm for large data sorting is *** algorithm by constructing the equivalent sort keys,optimized quicksort algorithm;through the technology o...
详细信息
ISBN:
(纸本)9781509036202
According to the demand of large data sorting algorithm,a new efficient algorithm for large data sorting is *** algorithm by constructing the equivalent sort keys,optimized quicksort algorithm;through the technology of task driven,AIO and double buffer mechanism to make full use of system resources;in algorithm implementation,using multi thread processing tasks,by controlling the number of threads of control *** utilization of these technologies,the algorithm will achieve the separation of database connections and threads,and improve the concurrency of database support,so that the ranking of big data performance close to the theoretical limit value.
It is difficult to obtain fairly satisfactory result for national costume images retrieval in real application using existing search engine due to the complexity of visual features and semantic information implied in ...
详细信息
ISBN:
(纸本)9781538609699
It is difficult to obtain fairly satisfactory result for national costume images retrieval in real application using existing search engine due to the complexity of visual features and semantic information implied in national costume. Given the fact, a novel sorting algorithm ImageRank is proposed for image retrieval with relevance feedback in this paper, inspired by the PageRank algorithm used by Google Search to rank websites or webpages in their search engine results. ImageRank is realized based on Lucene Image Retrieval (LIRE) toolkit, which is a Java library that provides a simple way to retrieve images and photos based on color and texture characteristics. And it assimilates a good deal of PageRank to accomplish efficient image retrieval by ensuring accurate level of images correlation in resource repository through update the indexical (points-to) relationship timely according to user's behavior dynamically. Experimental results investigate that the performance of ImageRank is better than LIRE. In addition, the conservativeness and convergence of IR value in ImageRank are also verified.
This paper describes a fast integer sorting algorithm, herein referred to as Bit-index sort, which does not use comparisons and is intended to sort partial permutations. Experimental results exhibit linear complexity ...
详细信息
ISBN:
(纸本)9781467356138;9781467356121
This paper describes a fast integer sorting algorithm, herein referred to as Bit-index sort, which does not use comparisons and is intended to sort partial permutations. Experimental results exhibit linear complexity order in execution time. Bit-index sort uses a bit-array to classify input sequences of distinct integers, and exploits built-in bit functions in C compilers, supported by machine hardware, to retrieve the ordered output sequence. Results show that Bit-index sort outperforms quicksort and counting sort algorithms when compared in their execution time. A parallel approach for Bit-index sort using two simultaneous threads is also included, which obtains further speedups of up to 1.6 compared to its sequential case.
computing algorithms are a basic research area in computer science. In last years, many researchers proposed several sorting techniques to enhance time complexity and space complexity [8]. In this paper we present a s...
详细信息
ISBN:
(纸本)9781467384605
computing algorithms are a basic research area in computer science. In last years, many researchers proposed several sorting techniques to enhance time complexity and space complexity [8]. In this paper we present a sorting algorithm for any datatype, which uses mapping methodology. The mapping will be between elements of array and indexes without using any comparisons and swapping. The paper analyzes time complexity of proposed algorithm mathematically and empirically. The complexity of proposed algorithm is O(xlogm)+O(n) where n represents number of sorted elements and m, x<sorting algorithm is better than or almost equal to quick sorting.
The core problem of information retrieval is concentrated in the document for the user to retrieve the most relevant sub-set of documents, relying on sorting algorithms on the search results according to relevance sor...
详细信息
ISBN:
(纸本)9783037859865
The core problem of information retrieval is concentrated in the document for the user to retrieve the most relevant sub-set of documents, relying on sorting algorithms on the search results according to relevance sort, sorted the results as the user asked the query response information retrieval performance is determined by many factors, such as to query expressions quality index stemmer nonsense word disabled, query expansion technology, but fundamentally it is determined by the sort function sort function in some Standards document query indicates the degree of matching with the user, and accordingly to make a document with respect to the user's judgment, then the document in accordance with the degree of correlation with respect to the user in descending order, and returns the ordered list of documents as a result of the retrieval the pros and cons of the sorting algorithm directly affect the efficiency of the retrieval.
Aimed at uniformity of sorting about analytic hierarchy process(AHP),analytic hierarchy process based on grey incidence is brought *** sorting results are got through ways of different weights and several ***,overcomi...
详细信息
ISBN:
(纸本)9781479934348
Aimed at uniformity of sorting about analytic hierarchy process(AHP),analytic hierarchy process based on grey incidence is brought *** sorting results are got through ways of different weights and several ***,overcoming uniformity of sorting,complex process of rectifying judgment Matrix and consistence verification,that favor to analysis difference of algorithm and correctness of sorting results, more science and equitable sorting result is gained,it favor extension and application of AHP.
暂无评论