检索结果-内蒙古大学图书馆

3rd International Conference on Green Power, Materials and Manufacturing Technology and Applications

作者： Yang, JiYing Zhang, Bei Mao, Yu Yunnan RTV Univ Kunming 650223 Yunnan Peoples R China Yunnan Univ Kunming 650223 Yunnan Peoples R China YunnanNormal Univ Kunming 650223 Yunnan Peoples R China

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.

关键词： Information Retrieval sorting algorithm Intelligent

来源：评论

学校读者我要写书评

暂无评论

The sorting algorithm of analytic hierarchy process based on grey incidence

The sorting algorithm of analytic hierarchy process based on...

引用

6th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)

作者： Zhan Tangsen Wu Qian Fang Xiaohong Jingdezhen Ceram Inst Sch Informat Engn Jingdezhen 333403 Jiangxi Peoples R China

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.

关键词： grey incidence analytic hierarchy process sorting algorithm mean weight

来源：评论

学校读者我要写书评

暂无评论

The Case for a Learned sorting algorithm 20

The Case for a Learned Sorting Algorithm

引用

ACM SIGMOD International Conference on Management of Data (SIGMOD)

作者： Kristo, Ani Vaidya, Kapil Cetintemel, Ugur Misra, Sanchit Kraska, Tim Brown Univ Providence RI 02912 USA MIT Cambridge MA 02139 USA Intel Labs Hillsboro OR USA

ISBN: (纸本)9781450367356

sorting is one of the most fundamental algorithms in Computer Science and a common operation in databases not just for sorting query results but also as part of joins (i.e., sort-merge-join) or indexing. In this work, we introduce a new type of distribution sort that leverages a learned model of the empirical CDF of the data. Our algorithm uses a model to efficiently get an approximation of the scaled empirical CDF for each record key and map it to the corresponding position in the output array. We then apply a deterministic sorting algorithm that works well on nearly-sorted arrays (e.g., Insertion Sort) to establish a totally sorted order. We compared this algorithm against common sorting approaches and measured its performance for up to 1 billion normally-distributed double-precision keys. The results show that our approach yields an average 3.38x performance improvement over C++ STL sort, which is an optimized Quicksort hybrid, 1.49x improvement over sequential Radix Sort, and 5.54x improvement over a C++ implementation of Timsort, which is the default sorting function for Java and Python.

关键词： linear interpolation ML for systems sorting sorting algorithm CDF learned algorithm linear models RMI

来源：评论

学校读者我要写书评

暂无评论

The Research and Application of sorting algorithm in Aircraft Scheduling Problem

The Research and Application of Sorting Algorithm in Aircraf...

引用

2nd International Conference on Materials and Products Manufacturing Technology (ICMPMT 2012)

作者： Xu, Hai Rong Yang, Lu Hui Huang, Qiang Wang, Jian Shanghai Univ Engn Sci Coll Aeronaut Transportat Shanghai 201620 Peoples R China

ISBN: (纸本)9783037855447

The Aircraft scheduling problem is researched in this paper, the equilibrium model of aircraft scheduling problem is proposed and a sorting algorithm is constructed. By introducing the concept of flight connections, aircraft scheduling problem is transformed into the distribution of flight connections, the mathematical model of the problem is established, to solve the model, a sorting algorithm is constructed. We use the airline's flight data to test the algorithm. The simulation results show that the model and the algorithm are feasible.

关键词： aircraft scheduling problem sorting algorithm flight loop

来源：评论

学校读者我要写书评

暂无评论

The Impact of Execution Frequency in sorting algorithm on Nearest Level Modulated Modular Multilevel Converter 10

The Impact of Execution Frequency in Sorting Algorithm on Ne...

引用

IEEE 10th International Symposium on Power Electronics for Distributed Generation Systems (PEDG)

作者： Niu, Jiahao Wang, Fred Univ Tennessee Min H Kao Dept Elect Engn & Comp Sci Knoxville TN 37996 USA Oak Ridge Natl Lab Knoxville TN USA

ISBN: (纸本)9781728124551

sorting algorithm is required for operating modular multilevel converter (MMC) with nearest level modulation, to keep the unbalanced submodule capacitor voltage within an acceptable range. Several sorting algorithms have been proposed in previous literatures. However, very few papers discussed about how to select the execution frequency of a sorting algorithm. This paper aims to investigate on the impact of the execution frequency in sorting algorithm on the output voltage harmonics, average switching frequency, submodule capacitor voltage fluctuation of an MMC using nearest level modulation. Multiple MMC models with different number of submodules are built in MATLAB/Simulink. Three different types of sorting algorithms are implemented, and evaluated at various execution frequencies as well as different operating points. Conclusions drawn from the extensive simulations show that to select a sorting algorithm and its execution frequency, all three performance criterions should be considered simultaneous and a minimum execution frequency is always required.

关键词： Modular Multilevel Converter sorting algorithm Execution Frequency

来源：评论

学校读者我要写书评

暂无评论

A new sorting algorithm breaking through the lower bound - O(nlogn)

A new sorting algorithm breaking through the lower bound - O...

引用

6th International Conference for Young Computer Scientists

作者： Song, JP Wang, YC Ling, XL Shanghai Jiao Tong Univ Sch Elect & Informat Technol Shanghai 200030 Peoples R China

ISBN: (纸本)7506251817

In 1960, *** devised the Quick Sort algorithm. After that many people have tried to improve the ability of this algorithm, but they all didn't find a new one. Moreover it was proved that any sorting method which uses comparisons on a array of size n must make at least O(nlogn) comparisons. In this paper, we present a new sorting algorithm named hash sort and compared it with the existing algorithms by experiments. The results clearly show that the new algorithm is more efficient than Quick Sort. Our new algorithm operates in linear time O(n).

关键词： sorting algorithm Quick Sort hash sort linear time

来源：评论

学校读者我要写书评

暂无评论

Implementation of Highly Efficient sorting algorithm for Median Filtering using FPGA Spartan 6

Implementation of Highly Efficient Sorting Algorithm for Med...

引用

IEEE International Conference on Innovative Mechanisms for Industry Applications (ICIMIA

作者： Korakoppa, Vidya P. Mohana Aradhya, H. V. Ravish RV Coll Engn Dept Telecommun Engn Bangalore Karnataka India RV Coll Engn Dept Elect & Commun Engn Bangalore Karnataka India

ISBN: (纸本)9781509059607

Reducing the noise content in an image is the important factor in image processing and its applications. Some of the noises which cause a serious degradation in the image quality are multiplicative noise, salt and pepper noise, impulse noise, gaussian noise, additive noise etc. Among these, salt and pepper noise can be eliminated using median filtering techniques. sorting techniques have been beneficial for median filtering. In this paper a highly efficient optimized sorting algorithm is implemented for median filter. Median filter is used to calculate the median of set of pixel values of a window. To compare the same column pixel values, data is acquired from FPGA parallely. The adjacent median filter results are saved temporarily using D flip-flops. This method increases the efficiency of execution by reducing the comparisons from 21 to 13 and significantly increases 40% efficiency. sorting algorithm is implemented using FPGA Spartan 6 LX45. It is cost efficient and also power efficient since it consumes half the power compared to earlier Spartan families.

关键词： image processing salt and pepper noise median filter sorting algorithm moving window

来源：评论

学校读者我要写书评

暂无评论

New relative concatenate sorting algorithm

New relative concatenate sorting algorithm

引用

2012 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2012

作者： Iqbal, Sardar Zafar Ismail, Mohamedelhassan Gull, Hina Al-Qassim Pvt. College Saudi Arabia

ISBN: (纸本)9781467300865

sorting is technique by which elements are arranged in a particular order following some characteristic or law [1]. In this paper we presented an algorithm called as Relative Concatenate Sort, which is based on the idea of Selection Sort, but it divides the list into two. After dividing the list it takes the average of both halves of the list. Comparing this average with elements it sorts both arrays and then put these arrays together to get the final sorted list. © 2012 IEEE.

关键词： sorting programs sorting algorithm arrays Family Members

来源：评论

学校读者我要写书评

暂无评论

Optimized reconstruction processing of targets hidden in turbid environment from multi-perspective images assisted with sorting algorithm-based quality metrics

引用

OPTIK 2021年 243卷 167349-167349页

作者： Tsabary, Ariela Abookasis, David Ariel Univ Dept Elect & Elect Engn IL-407000 Ariel Israel

In the work described in this paper, we experimentally demonstrate an efficient method to improve reconstruction of objects embedded in turbid media. The method combines multiple polarized speckle projections and a fully automated sorting algorithm. In the experimental setup, the medium was illuminated with a polarized laser beam and multiple polarized images of the object were obtained from different viewing perspectives using a lens array and captured by a camera. In offline image processing, each sub-image was digitally cropped, extracted from the array, and qualitatively evaluated by contrast-to-noise ratio (CNR) and entropy metrics. Subimages were sorted based on quality as determined by CNR and entropy values, with high CNR and low entropy considered as highest quality with the best resolution and contrast. The images were then shifted to a common center and then summed with other sub-images to form a single average image. Experiments to demonstrate the effectiveness of the proposed algorithm were carried out on targets with different geometrical shapes embedded within scattering media in transmission configuration. Analysis of image metrics indicated improvement in object reconstruction by using circular polarization as compared to the use of linear polarization or nonpolarization states. The overall experimental results obtained in this work illustrate effective performance of the proposed method.

关键词： Imaging through turbid media Linear and circular polarization Multiple projections Lens array sorting algorithm Image quality metrics

来源：评论

学校读者我要写书评

暂无评论

A sorting algorithm based on ordered block insertions

引用

JOURNAL OF COMPUTATIONAL SCIENCE 2022年第0期64卷

作者： Ferrada, Hector Univ Austral Chile Valdivia Chile

Among the comparison-based algorithms, INSERTIONSORT is recognized as one of the fastest methods to sort relatively small data sets, or when the elements are relatively ordered. However, due to not offering good asymptotic complexity in its runtime, it performs very poorly both in the worst case and in the average case for most large data collections. In this article we offer a new sorting algorithm based on orderer block insertions with worst case optimal time. At the cost of an additional memory space of nk words, for any constant k, our algorithm is able to easily transform it into an in-place algorithm with a time of symbolscript in the worst case. Empirically, our method outperforms symbolscript in all the different cases tested, even for small input collections. Furthermore, our experiments show that, for small or large datasets from either of the two main probability distributions-Uniform and Normal;our algorithms also outperform any traditional method like symbolscript symbolscript or symbolscript and even better than the efficient hybrid algorithm symbolscript symbolscript method provided by the GNU C++ Standard Library.

关键词： sorting algorithm Insertionsort Optimal time sorting

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：