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

15th IEEE Global Engineering Education Conference (IEEE EDUCON)

作者： Silapachote, Piyanuch Srisuphab, Ananta Hoonlor, Apirak Sunetnanta, Thanwadee Mahidol Univ Fac Informat & Commun Technol Nakhon Pathom Thailand

ISBN: (纸本)9798350394023;9798350394030

sorting is an algorithmic concept that is covered in every fundamental computer science and engineering course and included in most if not all programming competitions. It is an everyday task, self-taught and done naturally even by a small child. In spite of its ingenuousness, mastering sorting algorithms turns out to be not so simple for many first-time programmers. This happens because how humans perform sorting is far from being straightforwardly aligned with machine instructions. We have developed an unplugged game-based learning activity that aims not only to tackle this difficult dilemma but also to promote computational thinking practice. Our game robustly challenges audiences to complete a fun sorting task algorithmically and the building blocks of the exercise are methodologically grounded in the four cornerstones of computational thinking. Participants are gently guided through solving a problem by decomposing it, recognizing patterns, applying abstraction, writing step-by-step instructions, and finally arriving at a programmable solution. Our design is largely flexible. The game can be played in small groups or larger ones. It uses only common, readily accessible materials, and is easily adaptable to different levels of audiences, from the interested general public to secondary school students and teachers, to non-computer science undergraduates and those majoring in engineering or information technology related subjects. We have implemented this activity in our classrooms and conducted several workshops. Responses were markedly positive. Engaged from the beginning to the end, participants enjoyed the activity, having fun sorting. Appreciated the ideas, audiences were captivated by many surprising challenges. Most notably, they were able to comprehend the concepts of sorting algorithms and the computational steps behind them, and gain a better understanding of computational thinking.

关键词： sorting algorithm computational thinking game-based learning activities unplugged computing

来源：评论

学校读者我要写书评

暂无评论

Analysis of Comparison-Based sorting algorithms 4

Analysis of Comparison-Based Sorting Algorithms

引用

4th International Conference on Innovative Computing (ICIC)

作者： Inayat, Zainab Sajjad, Rabia Anam, Marrium Younas, Alisha Hussain, Muzammil Univ Management & Technol Sch Syst & Technol Dept Comp Sci Lahore Pakistan Govt Coll Univ Dept Comp Sci Faisalabad Pakistan

ISBN: (纸本)9781665400916

With the expansion of computing, random and unorder data on the internet is also increasing. The searching of useful information from this scattered data has become a critical problem. To solve this problem, researchers has devoted a lot of efforts by developing new approaches and algorithms. They are still working on it to improve the results to be more efficient, fast, and reliable. sorting is an approach used to organize unordered data. There are many sorting algorithms that helps to extract meaningful information and use it for problem solving. In this paper, the functioning of six sorting algorithms is explained with the help of various factors: algorithm, stability, adaptability, time complexity, and their pros and cons.

关键词： sorting algorithm Time complexity Adaptivity Internal sorting Stability

来源：评论

学校读者我要写书评

暂无评论

Interactive Visual Application Development for the Purpose of Complexity Analysis and Stability of sorting algorithms

Interactive Visual Application Development for the Purpose o...

引用

2015 International Conference on Software, Multimedia and Communication Engineering(SMCE 2015)

作者： Jana JURINOVA Department of Applied Informatics and Mathematics Faculty of Natural Sciences University of SS

ISBN: (纸本)9781605952840

In this paper, we describe practical application of trends in visualization of algorithms. Ourpositive results of the utilized and processed methodology of software development, confirmed byseveral research and surveys, we apply for our own software development. The software is primarilyintended to investigate the properties of Quick Sort- one of the most frequently used sorting algorithmin practice. It is also supplemented by visualization of the sorting process itself for the purpose ofinteractive, visual and motivating form of familiarization with the given algorithm.

关键词： sorting algorithm Quick Sort algorithm visualization Complexity

来源：评论

学校读者我要写书评

暂无评论

A Wireless Mesh Multipath Routing Protocol Based on sorting Ant Colony algorithm

引用

Procedia Computer Science 2020年 166卷 570-575页

作者： Qi Qian Li Yi Peng School of Information Engineering and Automation Kunming University of Science and Technology Kunming 650500 China

In this paper, the traditional ant colony algorithm has a slow convergence rate for routing optimization of Mesh networks. A multi-path routing protocol based on improved ant colony algorithm, Fortified Ant protocol, is proposed. The protocol first adds a sorting algorithm based on the ant colony algorithm, and introduces the concept of elite ants to improve the speed of routing optimization. Secondly, this paper also studies the multipath transmission of self-organizing networks. The simulation results show that compared with ADOV, DSR and AOC routing algorithms, the algorithm can quickly find multiple paths with better quality, with fast convergence and overhead. Less advantage.

关键词： Wireless Mesh network Ant colony algorithm sorting algorithm Multipath routing Fortified Ant

来源：评论

学校读者我要写书评

暂无评论

VECTORIZATION OF sorting algorithmS

引用

International Journal of High Speed Computing 1992年第3期4卷 213-232页

作者： CHUNG-PING CHUNG WEN-YANG LIN Institute of Computer Science and Information Engineering College of Engineering National Chiao Tung University Hsinchu Taiwan 30050 R.O.C.

The ability of the existence of vectorizing compilers to extract vector instructions from blocks of sequential code does not remove the need for proper choice of software algorithms. In this paper, we study the vectorization of the insertion sorting, shellsort, and radix sortings. To measure their suitability for vectorization, we have implemented them on a Convex C-l, and computed the scalar/vector speedup for each method. We observed that for sorting methods based on compare/exchange, contingent methods often thought unsuitable for vectorization, the insertion sort is well performed, especially when using an M-section approach. And for radix sortings, the LSD methods are more suited to vectorization compared to the MSD methods. Finally, based on our study and experiments, we suggest that the straight radix sorting is a good choice for use on vector supercomputers.

关键词： Vectorization sorting algorithm insertion sort M-section radix sort

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of self-electro-optic-effect-device-based (SEED-based) smart-pixel arrays used in data sorting

引用

APPLIED OPTICS 1996年第32期35卷 6397-6416页

作者： Desmulliez, MPY Wherrett, BS Waddie, AJ Snowdon, JF Dines, JAB HERIOT WATT UNIV DEPT PHYSEDINBURGH EH14 4ASMIDLOTHIANSCOTLAND

The performance factors associated with self-electro-optic-effect-device- (SEED-) based smart-pixel arrays are analyzed in terms of semiconductor technology and pixel complexity. The sorting task is chosen as a practical example. Complementary metal-oxide semiconductor (CMOS)-SEED 2 x 2 self-routing nodes operated with quasi-cw-mode lasers are shown to provide the maximum processing power and on- or off-chip communication rate. The need for new front-end amplifiers for the smart-pixel technology is emphasized. (C) 1996 Optical Society of America

关键词： optical computing optical information processing smart pixel arrays sorting algorithm perfect shuffle self-electro-optic-effect device

来源：评论

学校读者我要写书评

暂无评论

B*-Sort: Enabling Write-Once sorting for Nonvolatile Memory

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2020年第12期39卷 4549-4562页

作者： Liang, Yu-Pei Chen, Tseng-Yi Chang, Yuan-Hao Chen, Shuo-Han Wei, Hsin-Wen Shih, Wei-Kuan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 300 Taiwan Acad Sinica Inst Informat Sci Taipei 115 Taiwan Natl Cent Univ Taoyuan 320 Taiwan Natl Cent Univ Dept Comp Sci & Informat Engn Taoyuan 32001 Taiwan Tamkang Univ Dept Elect Engn New Taipei 251 Taiwan

Nonvolatile random access memory (NVRAM) has been regarding a promising technology to replace DRAM as the main memory in embedded systems owing to its nonvolatility and low idle power consumption. However, due to the asymmetric read/write costs and limited lifetime of NVRAM, most of the existing fundamental algorithms are not NVRAM-friendly with their write pattern and write intensiveness. Thus, existing fundamental algorithms for NVRAM embedded devices has been revealed. For instance, as the sorting algorithm is one of the most fundamental algorithms, most of the existing sorting algorithms are not NVRAM-friendly because they impose heavy write traffic [i.e., O(n lg n)] on main memory, where n is the number of unsorted elements. To resolve this issue, this article proposes a write-once sorting algorithm, namely B*-sort, to reduce the amount of write traffic on NVRAM-based main memory. B*sort adopts a brand-new concept, i.e., tree-based sort, inspired by the binary-search-tree structure to achieve the write-once property which can guarantee the optimal endurance during the sorting process. According to the experimental results, B*-sort can achieve significant performance improvement for sorting on NVRAM-based systems.

关键词： Nonvolatile memory read write asymmetry sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Online sorting of drilled lotus seeds using deep learning

引用

BIOSYSTEMS ENGINEERING 2022年 221卷 118-137页

作者： Lu, Ange Guo, Ruixue Ma, Qiucheng Ma, Lingzhi Cao, Yunsheng Liu, Jun Xiangtan Univ Sch Mech Engn Xiangtan 411105 Peoples R China

For defective drilled lotus seeds, the inner bitter lotus plumule cannot be removed nor-mally, leading to difficulties in subsequent nutrient extraction and food processing. There is an obvious difference in visibility of drilled hole between normal and defective drilled lotus seeds in the top view;thus, an online sorting method for drilled lotus seeds based on drilled hole detection is proposed in this study. First, a drilled hole detection model based on You Only Look Once (YOLOv3) is developed to detect the drilled hole features on the lotus seed surface. The model was tested and compared with the Faster Region-based Convolutional Neural Network (Faster R-CNN) and Single Shot MultiBox Detector (SSD) models, and it showed a better comprehensive performance in terms of accuracy and speed. A sorting control algorithm is also proposed to perform online sorting based on real-time drilled hole detection results. In addition, an auxiliary algorithm is proposed to pre-vent the boundary misjudgement of detected hole ownership between adjacent lotus seeds during continuous sorting. An online sorting system was designed, and sorting tests were performed. A sorting accuracy of 95.8% was achieved for the mixed defective and normal drilled lotus seed samples. The proposed method is expected to not only fulfil the practical requirements for the online sorting of drilled lotus seeds but also provide references for other agricultural products that require continuous online sorting based on the detection of local features.(c) 2022 IAgrE. Published by Elsevier Ltd. All rights reserved.

关键词： sorting Lotus seeds Drilled hole detection sorting algorithm Deep learning YOLOv3 Abbreviations

来源：评论

学校读者我要写书评

暂无评论

A novel deterministic sampling scheme with applications to broadcast-efficient sorting on the reconfigurable mesh

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1996年第2期32卷 215-222页

作者： Olariu, S Schwing, JL Department of Computer Science Old Dominion University Norfolk Virginia 23529

The main contribution of this work is to present a simple deterministic sampling strategy that, when used for bucket sorting, yields buckets that are remarkably well balanced, making costly balancing unnecessary. To the best of our knowledge, this is the first instance of a deterministic sampling strategy featuring this performance. Although the strategy is perfectly general, we illustrate its power by devising a VLSI-optimal, 0(1) time sorting algorithm for the reconfigurable mesh. As a by-product of the inherent simplicity of our sampling and bucketing scheme, we show that our sorting algorithm can be implemented using only 35 broadcast operations, a substantial improvement over the previously best known algorithm that requires 59 broadcasts. (C) 1996 Academic Press, Inc.

关键词： Processor PROCESSOR sorting algorithm buckets deterministic broadcasting

来源：评论

学校读者我要写书评

暂无评论

Approaches for inequity-averse sorting

引用

COMPUTERS & OPERATIONS RESEARCH 2016年第Feb.期66卷 67-80页

作者： Karsu, Ozlem Bilkent Univ Dept Ind Engn Ankara Turkey

In this paper we consider multi-criteria sorting problems where the decision maker (DM) has equity concerns. In such problems each alternative represents an allocation of an outcome (e.g. income, service level, health outputs) over multiple indistinguishable entities. We propose three sorting algorithms that are different from the ones in the current literature in the sense that they apply to cases where the DM's preference relation satisfies anonymity and convexity properties. The first two algorithms are based on additive utility function assumption and the third one is based on the symmetric Choquet integral concept. We illustrate their use by sorting countries into groups based on their income distributions using real-life data. To the best of our knowledge our work is the first attempt to solve sorting problems in a symmetric setting. (c) 2015 Elsevier Ltd. All rights reserved.

关键词： CENTROSYMMETRIC sorting algorithm Utility functions Income Distribution Anonymity sorting programs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：