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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

325 篇 会议
163 篇 期刊文献
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

425 篇 工学
- 201 篇 计算机科学与技术...
- 121 篇 电气工程
- 69 篇 控制科学与工程
- 57 篇 软件工程
- 47 篇 信息与通信工程
- 36 篇 仪器科学与技术
- 30 篇 机械工程
- 25 篇 生物医学工程（可授...
- 24 篇 测绘科学与技术
- 18 篇 电子科学与技术（可...
- 16 篇 环境科学与工程（可...
- 13 篇 石油与天然气工程
- 10 篇 生物工程
- 6 篇 材料科学与工程（可...
- 6 篇 动力工程及工程热...
- 6 篇 化学工程与技术
- 6 篇 航空宇航科学与技...
- 5 篇 光学工程
105 篇 理学
- 32 篇 数学
- 19 篇 系统科学
- 18 篇 物理学
- 16 篇 生物学
- 10 篇 地球物理学
- 9 篇 化学
- 7 篇 统计学（可授理学、...
55 篇 医学
- 37 篇 临床医学
- 10 篇 基础医学(可授医学...
44 篇 管理学
- 38 篇 管理科学与工程(可...
26 篇 农学
- 15 篇 农业资源与环境
- 9 篇 作物学
6 篇 教育学
3 篇 法学
3 篇 文学
1 篇 哲学
1 篇 经济学
1 篇 军事学

主题

490 篇 sorting algorith...
88 篇 classification a...
50 篇 feature extracti...
40 篇 support vector n...
38 篇 classifiers
31 篇 algorithms
30 篇 taxonomy
25 篇 dataset
25 篇 training
23 篇 support vector m...
22 篇 functional train...
20 篇 image classifica...
19 篇 pattern recognit...
17 篇 sorting programs
15 篇 sorting
15 篇 algorithm design...
15 篇 classification
15 篇 accuracy
14 篇 pattern classifi...
13 篇 learning (artifi...

机构

3 篇 cairo univ fac c...
3 篇 sun yat sen univ...
2 篇 univ firenze dip...
2 篇 princeton univ p...
2 篇 univ fed rio gra...
2 篇 univ calif davis...
2 篇 natl tsing hua u...
2 篇 univ cent florid...
2 篇 mit cambridge ma...
2 篇 univ uppsala dep...
2 篇 shanghai jiao to...
2 篇 socomec vicenza
2 篇 université de bo...
2 篇 hong kong inst e...
2 篇 johns hopkins un...
1 篇 nanjing univ pos...
1 篇 int inst geoinfo...
1 篇 beihang univ fer...
1 篇 univ reading sch...
1 篇 univ hosp leuven...

作者

5 篇 nong ge
4 篇 yannick berthoum...
4 篇 lionel bombrun
3 篇 chan wai hong
3 篇 wu yi
3 篇 aurelien schutz
2 篇 babaeizadeh saee...
2 篇 janson s
2 篇 tresca giulia
2 篇 wang ping
2 篇 de paris jean-mi...
2 篇 chaudhury santan...
2 篇 hassanien aboul ...
2 篇 fill ja
2 篇 hua yifan
2 篇 liu jun
2 篇 ferrari luca
2 篇 desouza guilherm...
2 篇 zheng shengan
2 篇 wang zhe

语言

451 篇 英文
26 篇 其他
11 篇 中文
2 篇 土耳其文

检索条件"主题词=sorting algorithm"

共 490 条记录，以下是321-330 订阅

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

详细简洁

排序：

An Efficient Natural Merge Sort Incorporating Array Decomposition 26

An Efficient Natural Merge Sort Incorporating Array Decompos...

引用

26th International Conference on Computer and Information Technology, ICCIT 2023

作者： Gharami, Kanchon Rashid, Kazi Mehrab Rabbi, Golam Amin, Farhana Shatabda, Swakkhar Shovan, S.M. Mehedi Hasan, Md. Al Rajshahi University of Engineering & Technology Dept. of Computer Science & Engineering Rajshahi Bangladesh United International University Dept. of Computer Science & Engineering Dhaka Bangladesh Missouri University of Science & Technology Dept. of Computer Science & Engineering Missouri United States

ISBN: (纸本)9798350359015

Modifying an algorithm that has been established over many years and making it even faster has always been a fascinating and challenging area in the field of algorithms, which motivated us to take the challenge of improving the performance of Knuth's NaturalMergeSort by reducing the runtime with considering both ascending and descending runs. The way we optimize it is by taking advantage of both ascending and descending runs, i.e., increasing the potential of the decomposition method compared to the existing algorithm. The proposed algorithm was implemented in C++, and the experiment was conducted with some random and manually prepared datasets that resulted in improving the worst case of NaturalMergeSort by an exceedingly large margin of 97.5%, demonstrating the efficiency and flexibility of our algorithm. Even for the average case, our proposed algorithm beats Knuth's NaturalMergeSort by a slight margin, and it also outperforms traditional merge sort with 17.5% improvements. The performance and efficiency of our algorithm have been recorded and presented in graphical form by comparing time and space complexity with other competitor sorting algorithms. © 2023 IEEE.

关键词： MergeSort NaturalMergeSort sorting sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Kalman filter estimation method for battery cell parameters in Reconfigurable Cascaded Multilevel Converter

Kalman filter estimation method for battery cell parameters ...

引用

2023 IEEE Energy Conversion Congress and Exposition, ECCE 2023

作者： Tresca, Giulia Formentini, Andrea Granata, Samuele Magrini, Carlo Zanchetta, Pericle University of Genoa El. Elec. and Telec. Engineering and Naval Architecture Dept. Genova Italy University of Pavia Electrical Computer and Biomedical Engineering Dept. Pavia Italy University of Nottingham Electrical and Electronics Engineering Dept. Nottingham United Kingdom

ISBN: (纸本)9798350316445

This paper presents an online estimation technique Kalman filter-based able to evaluate both the open circuit voltage and the internal resistance of the battery cells installed within the Reconfigurable Cascaded Multilevel Converter. This technique fills the gap for the complex reconfigurable structures, allowing the estimation of the parameters with only the knowledge of the output current and voltage and instantaneous active battery cells. The estimation technique is combined with a sorting algorithm to address the specific topic of multilevel converter controlled with digital modulation. Specifically, the estimation algorithm here presented ensures a reduced convergence time, demonstrated by the low mean error computed. Moreover, the estimation technique is simulated during both discharging and charging processes, showing how different initial conditions may affect the convergence time depending on the power flow. © 2023 IEEE.

关键词： Battery cells Estimation Technique Internal resistance Kalman Filter Multilevel Converter Online Estimation Open circuit voltage Reconfigurable Cascaded Multilevel Converter sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

The optimize tactic and the simulation of the Fast sorting system

The optimize tactic and the simulation of the Fast sorting s...

引用

2007 IEEE International Conference on Automation and Lofistics

作者： Minde shen Bingqing He Yingying Wu Mechanical Engineering College Shan dong Institute of Light Industry Jinan Shandong ProvinceChina The Logistics Institute of Shan Dong University Shandong University Jinan Shandong ProvinceChina

ISBN: (纸本)9781424415304;1424415306

As the rapid development of logistic technology in our country, the sorting efficiency of the distribution center becomes the bottle-neck in the whole process. At present, various sorting device emerge as the times require and the improvement of the sorting efficiency becomes the difficult problem of the sorting devices. This article begins from the optimize tactic of the sorting system, builds optimizing modal of the rapid sorting system, the result of simulation analyze and the practical run shows that this modal can improve the efficiency of the sorting system greatly. This modal based on the sorting device of the tobacco industry and can be applied to other industries.

关键词： efficiency sorting device sorting algorithm optimize

来源：评论

学校读者我要写书评

暂无评论

Accelerate Implementation of Timsort algorithm Using CUDA 26

Accelerate Implementation of Timsort Algorithm Using CUDA

引用

26th International Conference on Computer and Information Technology, ICCIT 2023

作者： Disha, Dilara Yasmin Mondal, Md. Nazrul Islam Rajshahi University of Engineering & Technology Departmentof Computer Science and Engineering Rajshahi6240 Bangladesh

ISBN: (纸本)9798350359015

sorting algorithms are fundamental in various computing *** this paper, we introduce a CUDA-based acceleration of the Timsort algorithm, leveraging the parallel processing of GPUs. Our implementation strategically decomposes the sorting process into parallel tasks, effectively surmounting inherent challenges related to synchronization and load balancing. Our experimental findings reveal a substantial speedup compared to CPU-based Timsort implementations. This acceleration renders our approach highly promising for real-world applications. Notably, our results demonstrate that the Timsort algorithm achieves a remarkable speed enhancement ranging from 22x to 48x when employing CUDA, relative to CPU-based executions, across diverse dataset sizes. These findings underscore the efficacy and applicability of our CUDA-accelerated Timsort in addressing the growing demand for faster sorting algorithms in contemporary computing scenarios. © 2023 IEEE.

关键词： CUDA GPU Parallel Processing sorting algorithm Timsort

来源：评论

学校读者我要写书评

暂无评论

sorting and Selection in Posets 09

Sorting and Selection in Posets

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Constantinos Daskalakis Richard M. Karpy Elchanan Mosselz Samantha Riesenfeldx Elad Verbin Microsoft Research Computer Science UC Berkeley Statistics and Computer Science UC Berkeley Institute for Theoretical Computer Science Tsinghua University

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study these problems in the context of partially ordered sets, in which some pairs of objects are incomparable. This generalization is interesting from a combinatorial perspective, and it has immediate applications in ranking scenarios where there is no underlying linear ordering, e.g., conference submissions. It also has applications in reconstructing certain types of networks, including biological networks. Our results represent significant progress over previous results from two decades ago by Faigle and Turan. In particular, we present the first algorithm that sorts a width-w poset of size n with optimal query complexity O(n(w + logn)). We also describe a variant of Merge-sort with query complexity O(wn log (n/w)) and total complexity O(w~2n log (n/w)); an algorithm with the same query complexity was given by Faigle and Turan, but no efficient implementation of that algorithm is known. Both our sorting algorithms can be applied with negligible overhead to the more general problem of reconstructing transitive relations. We also consider two related problems: finding the minimal elements, and its generalization to finding the bottom k "levels", called the k-selection problem. We give efficient deterministic and randomized algorithms for finding the minimal elements with O(wn) query and total complexity. We provide matching lower bounds for the query complexity up to a factor of 2 and generalize the results to the k-selection problem. Finally, we present efficient algorithms for computing a linear extension of a poset and computing the heights of all elements.

关键词： Poset Turan sorting programs algorithms sorting algorithm grade Order of objects randomized algorithms efficient algorithm Elements Complexity

来源：评论

学校读者我要写书评

暂无评论

Clockless continuous-time neural spike sorting: Method, implementation and evaluation

Clockless continuous-time neural spike sorting: Method, impl...

引用

International Symposium on Circuits and Systems

作者： Yan Liu Joao L. Pereira Timothy G. Constandinou Department of Electrical and Electronic Engineering Imperial College London SW7 2BT UK Centre for Bio-Inspired Technology Institute of Biomedical Engineering Imperial College London SW7 2AZ UK

ISBN: (纸本)9781479953424

In this paper, we present a new method for neural spike sorting based on Continuous Time (CT) signal processing. A set of CT based features are proposed and extracted from CT sampled pulses, and a complete event-driven spike sorting algorithm that performs classification based on these features is developed. Compared to conventional methods for spike sorting, the hardware implementation of the proposed method does not require any synchronisation clock for logic circuits, and thus its power consumption depend solely on the spike activity. This has been implemented using a variable quantisation step CT analogue to digital converter (ADC) with custom digital logic that is driven by level crossing events. Simulation results using synthetic neural data shows a comparable accuracy compared to template matching (TM) and Principle Components Analysis (PCA) based discrete sampled classification.

关键词： spike spikes sorting algorithm analog digital converter Logic circuits Spike grade Power consumption sorting programs X-Ray Computed Tomography

来源：评论

学校读者我要写书评

暂无评论

Research on the tailoring automatic sub-bed system using algorithm

Research on the tailoring automatic sub-bed system using alg...

引用

International Conference on Natural Computation

作者： Wang, Xiaoyun Huang, Zhenzhen Zhang, Hongzhi Qiu, Manliang Zhang, Fenglin School of Art and Clothing Tianjin Polytechnic University Tianjin 300160 China Inter-China 3502 Business Wear Co. Ltd Shijiazhuang China

ISBN: (纸本)9781424459612

Based on the existed sub-bed methods and cutting programs in the clothing industry, a software system was developed expecting to generate the cutting program automatically. Greedy algorithm was adopted in the calculation. Maximum spreading layer and layout number were selected as the basic consideration, the system can meet the requirement of the maximum layout number and spreading layer using limited bed. Optimum selection may be reached when using the established system. © 2010 IEEE.

关键词： automatic sub-bed automatic sub-bed system tailoring clothing industry clothing industry clothing tailoring cutting cutting programs greedy algorithm greedy algorithm greedy algorithms interactive sub-bed production engineering computing software system sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

SVM is not always confident: Telling whether the output from multiclass SVM is true or false by analysing its confidence values 16

SVM is not always confident: Telling whether the output from...

引用

2014 16th IEEE International Workshop on Multimedia Signal Processing, MMSP 2014

作者： Yamasaki, Toshihiko Maeda, Takaki Aizawa, Kiyoharu Department of Information and Communication Engineering University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo Japan

ISBN: (纸本)9781479958962

This paper presents an algorithm to distinguish whether the output label that is yielded from multiclass support vector machine (SVM) is true or false without knowing the answer. Such judgment is done only by the confidence analysis based on the pre-training/testing using the training data. Such true/false judgment is useful for refining the output labels. We experimentally demonstrate that the decision value difference between the top candidate and the second candidate is a good measure. In addition, a proper threshold can be determined by the pre-training/testing using only the training data. Experimental results using three standard image datasets demonstrate that our proposed algorithm can improve Matthews correlation coefficient (MCC) much better than simply thresholding the decision value for the top candidate.

关键词： data analysis support vector machines MCC Matthews correlation coefficient confidence analysis confidence values decision value difference decision value thresholding false judgment image datasets multiclass SVM multiclass support vector machine output label true judgment Accuracy Classification algorithms Machine learning algorithms Support vector machines Testing Training Training data Support Vector Network Training data Machine learning algorithms sorting algorithm MCC Genes False multi-class Functional training

来源：评论

学校读者我要写书评

暂无评论

A Novel pattern recognition model for real-time voice data input 5

A Novel pattern recognition model for real-time voice data i...

引用

5th International Conference on Confluence 2014 - The Next Generation Information Technology Summit

作者： Sen, Yogesh Kumar Chaurasiya, R.K. Verma, Shrish Dept. of Electronics and Telecommunication National Institute of Technology Raipur India

ISBN: (纸本)9781479942367

The classical front end analysis in speech recognition is a spectral analysis which parameterizes the speech signal into feature vectors. This paper proposes a voice recognition model that is able to automatically classify and recognize a voice signal with background noise. The model uses the concept of spectrogram, pitch period, short time energy, zero crossing rate, mel frequency scale and cepestral coefficient in order to calculate feature vectors. The k-Nearest Neighbor (k-NN) classification is used for classification and recognition of real-time input signal. Analytical hierarchical process is used for deciding the weightage of different features.

关键词： Accuracy Classification algorithms Real-time systems Speech Speech recognition Training AHP k-nearest neighbor pattern classification pitch-period Speech recognition Pattern recognition Voice Signal sorting algorithm real-time systems Analytic hierarchy process Speech Functional training k nearest neighbor audio data Training

来源：评论

学校读者我要写书评

暂无评论

Advanced Pseudo-inverse Linear Discriminants for the Improvement of Classification Accuracies

Advanced Pseudo-inverse Linear Discriminants for the Improve...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Jin Zhichao Guo Lili Gao Daqi East China Univ Sci & Technol Dept Comp Sci & Engn Shanghai 200237 Peoples R China

ISBN: (纸本)9781509061822

There is very little practicable significance to prove the equivalency between a pseudo-inverse linear discriminant (PILD) with the desired outputs in reverse proportion to the number of within-class samples and a Fisher linear discriminant (FLD) with the totally projected mean thresholds which are disadvantageous to improve the overall classification accuracy. Even if so, several examples have borne out that a PILD is not wholly equivalent to an FLD. Consequently, the most often used total-projected-mean thresholds usually behave poor. Starting from the customarily desired targets {1, -1}, a simple practicable threshold is gotten, which is only related to sample sizes. By substituting the desired targets with the actually algebraic distances of all training samples, a new threshold is obtained. When the desired targets are different from each other, the weight vector and the threshold given by a PILD are not equal to the ones given by an FLD anymore. At the moment, a PILD is wholly different from an FLD.

关键词： Training Classification algorithms Mathematical model Computer science Electronic mail Linear discriminant analysis algorithm design and analysis algorithm design and analysis electronic mail sorting algorithm computer science Linear discriminant analysis Mathematical Model Functional training Gemfibrozil gotten weight vectors Training

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：