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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

70 篇 期刊文献
42 篇 会议
8 册 图书
3 篇 学位论文

馆藏范围

123 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

98 篇 工学
- 78 篇 计算机科学与技术...
- 25 篇 软件工程
- 20 篇 电气工程
- 9 篇 信息与通信工程
- 9 篇 控制科学与工程
- 7 篇 航空宇航科学与技...
- 5 篇 动力工程及工程热...
- 4 篇 机械工程
- 4 篇 仪器科学与技术
- 3 篇 化学工程与技术
- 3 篇 石油与天然气工程
- 3 篇 核科学与技术
- 3 篇 环境科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 网络空间安全
- 1 篇 轻工技术与工程
- 1 篇 交通运输工程
- 1 篇 食品科学与工程（可...
22 篇 理学
- 15 篇 数学
- 4 篇 物理学
- 3 篇 化学
- 2 篇 统计学（可授理学、...
13 篇 管理学
- 9 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
8 篇 教育学
- 7 篇 教育学
- 3 篇 心理学(可授教育学...
4 篇 医学
- 3 篇 临床医学
1 篇 经济学
- 1 篇 应用经济学
1 篇 文学
- 1 篇 中国语言文学
- 1 篇 外国语言文学

主题

123 篇 sorting algorith...
12 篇 quicksort
7 篇 nasa technical r...
7 篇 (ntrs)
5 篇 computational co...
5 篇 time complexity
4 篇 mergesort
4 篇 parallel program...
4 篇 merge sort
4 篇 performance anal...
4 篇 sorting networks
3 篇 parallel algorit...
3 篇 complexity analy...
3 篇 heapsort
3 篇 sorting
3 篇 algorithms
3 篇 internal sorting
3 篇 energy consumpti...
3 篇 vector computer
3 篇 quick sort

机构

2 篇 verimag cnrs gre...
2 篇 kuwait univ fac ...
2 篇 univ florida dep...
2 篇 brno university ...
2 篇 computer science...
2 篇 univ campinas un...
2 篇 sao paulo state ...
2 篇 nanyang technol ...
1 篇 school of comput...
1 篇 natl inst inform...
1 篇 kettering univ d...
1 篇 pontificia univ ...
1 篇 american interna...
1 篇 univ gustave eif...
1 篇 univ canterbury ...
1 篇 abant izzet bays...
1 篇 department of co...
1 篇 department engli...
1 篇 univ bielefeld f...
1 篇 graphic era hill...

作者

2 篇 borin edson
2 篇 jaragh mha
2 篇 peron mathias
2 篇 lange klaus-diet...
2 篇 rawtani nishant
2 篇 torres ricardo d...
2 篇 schellekens m.
2 篇 kamthania supriy...
2 篇 halbwachs nicola...
2 篇 dramnesc isabela
2 篇 jebelean tudor
2 篇 abdel-hafeez sal...
2 篇 dutta anurag
2 篇 pisani flavia
2 篇 gordon-ross ann
2 篇 sarwar sm
2 篇 pedronette danie...
2 篇 kounev samuel
1 篇 mohammad khalid ...
1 篇 moscinski j

语言

112 篇 英文
9 篇 其他
2 篇 中文

检索条件"主题词=Sorting algorithms"

共 123 条记录，以下是81-90 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Development of a more flexible low-level control for MMC applications 9

Development of a more flexible low-level control for MMC app...

引用

IEEE 9th International Power Electronics and Motion Control Conference (IPEMC-ECCE Asia)

作者： Park, In Kwon Zhang, Yi RTDS Technol Inc Winnipeg MB Canada

ISBN: (纸本)9781728153018

With the increasing amount of MMC (Modular Multilevel Converter) applications, the need for low-level control algorithms is also increasing. Most low-level algorithms still belong to the FPGA platform. Therefore, unless one is experienced in developing and implementing on a particular FPGA platform, addressing the need for a low-level control algorithm can be extremely difficult. In addition, the cost associated with the development environment and a testing FPGA hardware platform makes it even more difficult to develop such algorithm. This paper introduces a more flexible method of low-level controller development by using a real-time digital simulator (RTDS) as a platform. This allows the developed low-level control model to be interfaced with an FPGA based MMC simulation in the same real-time digital simulator. The flexibility and usefulness in the proposed method is shown in a comparison of the sorting algorithms in NLC(Nearest Level Control) type low-level MMC control.

关键词： Low-level MMC control Fiber-optic communication sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Formal Verification of a Merge Sort Algorithm in SPARK

Formal Verification of a Merge Sort Algorithm in SPARK

引用

AIAA Science and Technology Forum and Exposition (AIAA SciTech Forum)

作者： Baity, Ryan Humphrey, Laura Hopkinson, Kenneth Air Force Inst Technol Dept Elect & Comp Engn Wright Patterson AFB OH 45433 USA Air Force Inst Technol Aerosp Syst Directorate Wright Patterson AFB OH 45433 USA

ISBN: (数字)9781624106095

ISBN: (纸本)9781624106095

Sophisticated software is enabling new capabilities across a number of different domains, from driverless cars in the automotive industry, to embedded medical devices in the healthcare industry, to autonomous drones in the aerospace industry. Given the safety implications, there is a need for software in these domains to be highly reliable. However, there are concerns that verification through testing alone will be insufficient to demonstrate the required degree of software reliability, since testing will only be able to cover a small portion of all possible software behaviors. An alternative is to analyze software through formal methods, i.e. mathematically-based tools and techniques for design and verification. Formal methods can be used to check many types of properties, including functional correctness of software, i.e. that software complies with a user-generated specification describing its intended behavior. The goal of this paper is to give the reader an impression of what is involved in proving functional correctness of a software module by walking through a simple example in an appropriate tool. To that end, we go through the process of proving functional correctness of a simple well-known merge sort algorithm in SPARK, a programming language with an associated verification toolset that has been used to create highly assured software in a number of domains, including the aerospace domain.

关键词： sorting algorithms Aerospace Industry Software Reliability Worst Case Execution Time Detect and Avoid Service Oriented Architectures Unmanned Aircraft System Autonomous Systems Air Vehicle Ada (Programming Language)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs

SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs

引用

IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS)

作者： Esfahani, Mohsen Koohi Kilpatrick, Peter Vandierendonck, Hans Queens Univ Belfast Belfast North Ireland

ISBN: (纸本)9781665459549

We introduce the Structure-Aware Parallel Counting (SAPCo) Sort algorithm that optimizes performance of degree-ordering, a key operation in graph analytics. SAPCo leverages the skewed degree distribution to accelerate sorting. The evaluation for graphs of up to 3.6 billion vertices shows that SAPCo sort is, on average, 1.7-33.5 times faster than state-of-the-art sorting algorithms such as counting sort, radix sort, and sample sort.

关键词： High Performance Computing Graph algorithms Degree-Ordering sorting algorithms Real-World Graphs Structure-Aware algorithms

来源：评论

学校读者我要写书评

暂无评论

Speaker indexing for retrieval of voicemail messages

Speaker indexing for retrieval of voicemail messages

引用

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Charlet, D France Telecom R&D DIH IPS F-22307 Lannion France

ISBN: (纸本)0780374029

This paper addresses the task of voicemail messages retrieval according to a target speaker defined by a given voicemail message, The core metric used for speaker modeling is GMM-based and the paper focuses on the sorting algorithms of the voicemail messages. Various algorithms are studied and compared. An algorithm that sorts messages according to their inclusion rank into a cluster built on the reference message is proposed. Experimentally, it proves to be far better than the classical ones.

关键词： speaker recognition Gaussian distribution indexing voice mail sorting pattern clustering speaker indexing voicemail message retrieval GMM sorting algorithms inclusion rank clustering

来源：评论

学校读者我要写书评

暂无评论

Improvement of cache utilization in a parallel CFD code through mesh reordering by Hilbert curves

Improvement of cache utilization in a parallel CFD code thro...

引用

AIAA Aviation Forum

作者： de Oliveira Silva, George Patton Tomita, Jesuino Takachi Bringhenti, Cleverson Aeronaut Inst Technol Turbomachines Dept BR-12228900 Sao Jose Dos Campos SP Brazil

ISBN: (数字)9781624107047

ISBN: (纸本)9781624107047

The present work investigates the effect of reordering the nodes and elements of a grid according to the Hilbert curves on the cache utilization in an in-house parallel CFD code. A sorting algorithm is proposed based on domain decomposition techniques and the execution times are compared to those obtained by the structured grid format.

关键词： CFD codes sorting algorithms Unstructured Grid Turbomachinery Navier Stokes Equations Finite Volume Method Integrated Circuits Transistors ANSYS Spalart Allmaras Turbulence Model

来源：评论

学校读者我要写书评

暂无评论

HANDSON-COMPUTING: Promoting Algorithmic Thinking Through Haptic Educational Robots 11th

HANDSON-COMPUTING: Promoting Algorithmic Thinking Through Ha...

引用

11th International Conference on Haptics - Science, Technology, and Applications (EuroHaptics)

作者： Otaran, Ata Tokatli, Ozan Patoglu, Volkan Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey

ISBN: (纸本)9783319933993;9783319933986

Computational thinking lies at the intellectual core of computing. Promoting computational thinking ability requires that students are provided with a clear understanding of the fundamental principles and concepts of computer science, including abstraction, logic, algorithms, and data representation. We propose to use force-feedback educational robotic devices for hands-on teaching of computational thinking. The addition of haptic feedback for teaching abstract concepts of computer science offers several advantages, as haptic feedback (i) enables an effective means of data hiding, (ii) ensures a high level of student engagement by adding another pathway for perception and enabling active physical interaction, and (iii) improves student motivation through the novelty effect. Moreover, visually impaired students may benefit from replacement of visualization with haptic feedback. We present a force-feedback application for teaching sorting algorithms and report initial student evaluations of integrating haptics to promote computational thinking.

关键词： Computational thinking sorting algorithms Series elastic actuation Educational robots Force control

来源：评论

学校读者我要写书评

暂无评论

Optimized Selection Sort Algorithm for Two Dimensional Array 12

Optimized Selection Sort Algorithm for Two Dimensional Array

引用

12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Ullah, Sultan Khan, Muhammad A. Khan, Mudasser A. Akbar, H. Hassan, Syed S. Univ Haripur Dept Informat Technol Haripur Pakistan Univ Haripur Comp & Commun Res Lab Haripur Pakistan

ISBN: (纸本)9781467376822

The main idea of Optimized Selection Sort Algorithm (OSSA) is based on the already existing selection sort algorithm, with a difference that old selection sort;sorts one element either smallest or largest in a single iteration while optimized selection sort, sorts both the elements at the same time i.e smallest and largest in a single iteration. In this study we have developed a variation of OSSA for two-dimensional array and called it Optimized Selection Sort algorithms for Two-Dimensional arrays OSSA2D. The hypothetical and experimental analysis revealed that the implementation of the proposed algorithm is easy. The comparison shows that the performance of OSSA2D is better than OSSA by four times and when compared with old Selection Sort algorithm the performance is improved by eight times (i.e if OSSA can sort an array in 100 seconds, OSSA2D can sort it in 24.55 Seconds, and similarly if Selection Sort takes 100 Seconds then OSSA2D take only 12.22 Seconds). This performance is remarkable when the array size is very large. The experiential results also demonstrate that the proposed algorithm has much lower computational complexity than the one dimensional sorting algorithm when the array size is very large.

关键词： Algorithm analysis sorting algorithms Two Dimensional Arrays Computational Complexity

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Exascale algorithms for Generalized MPI_Comm_split

Exascale Algorithms for Generalized MPI_Comm_split

引用

18th European MPI Users Group Meeting (EuroMPI 2011)

作者： Moody, Adam Ahn, Dong H. de Supinski, Bronis R. Lawrence Livermore Natl Lab Livermore CA 94551 USA

ISBN: (纸本)9783642244483

In the quest to build exascale supercomputers, designers are increasing the number of hierarchical levels that exist among system components. Software developed for these systems must account for the various hierarchies to achieve maximum efficiency. The first step in this work is to identify groups of processes that share common resources. We develop, analyze, and test several algorithms that can split millions of processes into groups based on arbitrary, user-defined data. We find that bitonic sort and our new hash-based algorithm best suit the task.

关键词： MPI MPI_Comm_split sorting algorithms Hashing algorithms Distributed group representation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共13页 << < 4 5 6 7 8 9 10 11 12 13 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：