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

16th International Conference on Artificial Intelligence and Soft Computing (ICAISC)

作者： Horzyk, Adrian AGH Univ Sci & Technol Dept Automat & Biomed Engn Mickiewicza Ave 30 PL-30059 Krakow Poland

ISBN: (纸本)9783319590639;9783319590622

This paper introduces an efficient sorting algorithm that uses new models of receptors and neurons which apply the time-conditional approach characteristic for nervous systems. These models have been successfully applied to automatically construct neural graphs that consolidate representation of all sorted objects and relations between them. The introduced parallely working algorithm sorts objects simultaneously for all attributes constructing an active associative neural graph representing all sorted objects in linear time. The sequential version works in linear or sub-linearithmic time. The paper argues that neurons can be used for efficient sorting of objects and the constructed network can be further used to explore relationships between these objects.

关键词： Brain-inspired computations Neuron models sorting algorithms ASSORT Associative representation Computational complexity

来源：评论

学校读者我要写书评

暂无评论

On the Power Characteristics of Mergesort: An Empirical Study

On the Power Characteristics of Mergesort: An Empirical Stud...

引用

International Conference on Advanced Control Circuits Systems (ACCS) Systems / International Conference on New Paradigms in Electronics and Information Technology (PEIT)

作者： Al-Hashimi, Muhammad Saleh, Mostafa Abulnaja, Osama Aljabri, Naif King Abdulaziz Univ Jeddah Saudi Arabia

ISBN: (纸本)9781538664070

Power consumption is one of the most important challenges facing the exascale computing community. Current technology trends will not provide a reasonable power budget for the next generation of exascale supercomputers in near future. Finding new ways to improve power efficiency will become a major challenge to exascale computing researchers. This study was motivated by the idea that some algorithms may have power advantages that need to be identified for exascale systems. In this work, we compared the power efficiency of a basic mergesort to the classically optimized 3-way partitioning quicksort. We measured the variations of average power between the two sorts that result from running different types of workloads for each algorithm. The study showed that empirical evidence suggests a generic mergesort has some power efficiency advantage over the 3-way partitioning quicksort.

关键词： High Performance Computing Exascale Computing Power-Efficiency sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Contextual Spaces Re-Ranking: accelerating the Re-sort Ranked Lists step on heterogeneous systems

Contextual Spaces Re-Ranking: accelerating the Re-sort Ranke...

引用

12th International Workshop on Java Technologies for Real-Time and Embedded Systems (JTRES)

作者： Pisani, Flavia Pedronette, Daniel C. G. Torres, Ricardo da S. Borin, Edson Univ Campinas UNICAMP IC Campinas SP Brazil Sao Paulo State Univ UNESP Inst Geosci & Exact Sci IGCE Rio Claro SP Brazil

Re-ranking algorithms have been proposed to improve the effectiveness of content-based image retrieval systems by exploiting contextual information encoded in distance measures and ranked lists. In this paper, we show how we improved the efficiency of one of these algorithms, called Contextual Spaces Re-Ranking (CSRR). One of our approaches consists in parallelizing the algorithm with OpenCL to use the central and graphics processing units of an accelerated processing unit. The other is to modify the algorithm to a version that, when compared with the original CSRR, not only reduces the total running time of our implementations by a median of 1.6x but also increases the accuracy score in most of our test cases. Combining both parallelization and algorithm modification results in a median speedup of 5.4x from the original serial CSRR to the parallelized modified version. Different implementations for CSRR's Re-sort Ranked Lists step were explored as well, providing insights into graphics processing unit sorting, the performance impact of image descriptors, and the trade-offs between effectiveness and efficiency. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： parallelization OpenCL heterogeneous CBIR re-ranking sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Vertically-parallel method and VLSI-structure for sorting of one-dimensional arrays

Vertically-parallel method and VLSI-structure for sorting of...

引用

International Scientific and Technical Conference on Computer Science and Information Technologies

作者： Ivan Tsmots Oleksa Skorokhoda Volodymyr Antoniv Vasyl Rabyk Department of Automated Control Systems Lviv Polytechnic National University Lviv Ukraine Department of Radio Physics and Computer Technologies Ivan Franko National University of Lviv Lviv Ukraine

The vertically-parallel method for sorting one-dimensional arrays of numbers has been developed. The graph of the algorithm for vertically-parallel sorting of arrays has been built. The structure of the hardware for vertically-parallel sorting of one-dimensional arrays of large numbers has been designed. Components of the device for vertically-parallel sorting of arrays of numbers using FPGA have been implemented.

关键词： sorting algorithms Vertically-parallel calculations VLSI FPGA Hardware implementation

来源：评论

学校读者我要写书评

暂无评论

sorting algorithms as Special Cases of a Priority Queue Sort 11

Sorting Algorithms as Special Cases of a Priority Queue Sort

引用

42nd ACM Technical Symposium on Computer Science Education

作者： Bell, Tim Aspvall, Bengt Univ Canterbury Christchurch 1 New Zealand

ISBN: (纸本)9781450305006

This paper offers an exercise for revisiting the main sorting algorithms after they have been taught to students. This is done in a way that emphasizes the relationships between them, and shows how considering abstraction and extreme cases can lead to the generation of new algorithms. A number of authors (including textbook authors) have noted particular relationships between algorithms, such as an uneven split in merge sort being equivalent to insertion sort. In this paper we use a flexible priority queue, the d-heap, to derive three common sorting algorithms. We combine this with using a BST as a priority queue, plus prior observations in the literature, to show strong relationships between the main sorting algorithms that appear in textbooks. In the process students are able to revisit a number of algorithms and data structures and explore elegant relationships between them. This approach can also lead to exercises and exam questions that go beyond desk-checking to evaluate students' understanding of these algorithms.

关键词： sorting algorithms priority queue d-heap

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 19920001075: on the Suitability of the Connection MacHine for Direct Particle Simulation

引用

2017年

NASA Technical Reports Server (Ntrs) 19920001075: on the Suitability of the Connection MacHine for Direct Particle Simulation by NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 19920001075: algorithms boundary conditions collisions computerized simulation connection dagum, leonard direct machine massively parallel processors nasa technical reports server (ntrs) parallel processing (computers) parallel programming relaxation method (mathematics) shock wave profiles sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 20000114845: Parallel Implementation of a High Order Implicit Collocation Method for the Heat Equation

引用

2017年

NASA Technical Reports Server (Ntrs) 20000114845: Parallel Implementation of a High Order Implicit Collocation Method for the Heat Equation by NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 20000114845: approximation collocation crank-nicholson method equation finite difference theory implementation implicit iterative solution kouatchou, jules nasa technical reports server (ntrs) numerical analysis parallel computers problem solving sorting algorithms thermodynamics two dimensional models

来源：评论

学校读者我要写书评

暂无评论

Contextual Spaces Re-Ranking: accelerating the Re-sort Ranked Lists step on heterogeneous systems

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年第22期29卷

关键词： parallelization OpenCL heterogeneous CBIR re-ranking sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 20160005867: Fixing Dataset Search

引用

2016年

NASA Technical Reports Server (Ntrs) 20160005867: Fixing Dataset Search by NASA Technical Reports Server (Ntrs); NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 20160005867: dataset fixing heuristic methods information retrieval lynnes, chris metadata nasa technical reports server (ntrs) ranking reports selection sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 20150000362: Global Assessment of Omi Aerosol Single-Scattering Albedo Using Ground-Based Aeronet and Skynet Inversions

引用

2016年

NASA Technical Reports Server (Ntrs) 20150000362: Global Assessment of Omi Aerosol Single-Scattering Albedo Using Ground-Based Aeronet and Skynet Inversions by NASA Technical Reports Server (Ntrs); NASA Technical Repo... 详细信息

关键词： (ntrs) 20150000362: aeronet aerosol aerosols ahn, changwoo albedo assessment atmospheric scattering aura spacecraft biomass burning dust electromagnetic absorption global air pollution jethva, hiren mathematical models nasa technical reports server (ntrs) near ultraviolet radiation optical radar ozone photometers radiometers remote sensing smoke sorting algorithms torres, omar

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：