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

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

来源：评论

学校读者我要写书评

暂无评论

BLOCK sorting OF A LARGE FILE IN EXTERNAL STORAGE BY A 2-COMPONENT KEY

引用

COMPUTER JOURNAL 1982年第3期25卷 327-330页

作者： TAN, KP HSU, LS Department of Computer Science National University of Singapore Kent Ridge Singapore 0511

This paper introduces a sorting method (a block sort embedded with another sorting algorithm) to sort a large volume of records in external storage by means of a 2-component numeric key consisting of key 1 and key 2. Based on the value of key 1, the data file is split into many subfiles. Each subfile contains records of common key 1, but with different key 2s. After sorting, all records are linked together by pointers to form a sort file. An index array keeps the list heads to these separate subfiles. The list structure in the file organization facilities updating of the file. This sorting method can be applied to a key of any number of digits. A subroutine of the methodology is illustrated in the Appendix.

关键词： Data Files sorting algorithm grade Appendix Records as Topic AUXILIARY STORAGE large volume list structure file organisation sorting programs

来源：评论

学校读者我要写书评

暂无评论

sorting strings and constructing digital search trees in parallel

引用

THEORETICAL COMPUTER SCIENCE 1996年第2期154卷 225-245页

作者： Jaja, JF Ryu, KW Vishkin, U UNIV MARYLAND DEPT ELECT ENGN COLLEGE PK MD 20742 USA KYUNGPOOK NATL UNIV DEPT COMP ENGN TAEGU SOUTH KOREA TEL AVIV UNIV DEPT COMP SCI RAMAT AVIV ISRAEL

We describe two simple optimal-work parallel algorithms for sorting a list L = (X(1),X(2),...,X(m)) of m strings over an arbitrary alphabet Sigma, where Sigma(i=1)(m) \X(i)\ = n and two elements of Sigma can be compared in unit time using a single processor. The first algorithm is a deterministic algorithm that runs in O(log(2) m/log log m) time and the second is a randomized algorithm that runs in O(log m) time. Both algorithms use O(mlog m + n) operations. Compared to the best-known parallel algorithms for sorting strings, our algorithms offer the following improvements. 1. The total number of operations used by our algorithms is optimal while all previous parallel algorithms use a nonoptimal number of operations. 2. We make no assumption about the alphabet while the previous algorithms assume that the alphabet is restricted to {1,2,...,n(0)(1)}. 3. The computation model assumed by our algorithms is the Common CRCW PRAM unlike the known algorithms that assume the Arbitrary CRCW PRAM. 4. Our algorithms use O(mlogm + n) space, while the previous parallel algorithms use O(n(1+epsilon)) space, where epsilon is a positive constant. We also present optimal-work parallel algorithms to construct a digital search tree for a given set of strings and to search for a string in a sorted list of strings. We use our parallel sorting algorithms to solve the problem of determining a minimal starting point of a circular string with respect to lexicographic ordering, Our solution improves upon the previous best-known result to solve this problem.

关键词： List ranking Computation Computational modeling Tree searching parallel random access machine model Parallel algorithms sorting algorithm deterministic algorithms concurrency theory randomized algorithms algorithms Alphabets Cosmic strings

来源：评论

学校读者我要写书评

暂无评论

A lossless image compression for medical images based on hierarchical sorting technique

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2002年第1期E85D卷 108-114页

作者： Myojoyama, A Yamamoto, T Hokkaido Univ Grad Sch Engn Sapporo Hokkaido 0608628 Japan

We propose new lossless medical image compression method based on hierarchical sorting technique. Hierarchical sorting is a technique to achieve high compression ratio by detecting the regions where image pattern varies abruptly and sorting pixel order by its value to increase predictability. In this method, we can control sorting accuracy along with size and complexity. As the result, we can reduce the sizes of the permutation-tables and rouse the tables to other image regions. Comparison using experimental implementation of this method shows better performance for medical image set measured by X-ray CT and MRI instruments where similar sub-block patterns appear frequently. This technique applies quad-tree division method to divide an image to blocks in order to support progressive decoding and fast preview of large images.

关键词： lossless compression medical images sorting algorithm hierarchical coding

来源：评论

学校读者我要写书评

暂无评论

What is a sorting function?

引用

JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING 2009年第7期78卷 552-572页

作者： Henglein, Fritz Univ Copenhagen DIKU Dept Comp Sci DK-2100 Copenhagen Denmark

What is a sorting function-not a sorting function for a given ordering relation, but a sorting function with nothing given? Formulating four basic properties of sorting algorithms as defining requirements, we arrive at intrinsic notions of sorting and stable sorting: a function is a sorting function if and only it is an intrinsically parametric permutation function. It is a stable sorting function if and only if it is an intrinsically stable permutation function. We show that ordering relations can be represented isomorphically as inequality tests, comparators and stable sorting functions, each with their own intrinsic characterizations, which in turn provide a basis for run-time monitoring of their expected I/O behaviors. The isomorphisms are parametrically polymorphically definable, which shows that it is sufficient to provide any one of the representations since the others are derivable without compromising data abstraction. Finally we point out that stable sorting functions as default representations of ordering relations have the advantage of permitting linear-time sorting algorithms;inequality tests forfeit this possibility. (C) 2008 Elsevier Inc. All rights reserved.

关键词： sorting Sort function sorting function sorting algorithm Stable Permutation Comparator Inequality test Isomorphism Parametric Parametricity

来源：评论

学校读者我要写书评

暂无评论

The sorting order on a Coxeter group

引用

JOURNAL OF COMBINATORIAL THEORY SERIES A 2009年第8期116卷 1285-1305页

作者： Armstrong, Drew Univ Minnesota Sch Math Minneapolis MN 55455 USA

Let (W, S) be an arbitrary Coxeter system. For each word omega in the generators we define a partial order-called the omega-sorting order-on the set of group elements W-omega subset of W that occur as subwords of omega. We show that the omega-sorting order is a supersolvable join-distributive lattice and that it is strictly between the weak and Bruhat orders on the group. Moreover, the omega-sorting order is a "maximal lattice" in the sense that the addition of any collection of Bruhat covers results in a nonlattice. Along the way we define a class of structures called supersolvable antimatroids and we show that these are equivalent to the class of supersolvable join-distributive lattices. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Coxeter group Partial order Lattice Antimatroid Abstract convex geometry Supersolvable lattice Join-distributive lattice Catalan number sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Benefits of Physical Interaction with Array Elements and Code Consolidation on Student Comprehension of sorting algorithms 19

Benefits of Physical Interaction with Array Elements and Cod...

引用

Proceedings of the 50th ACM Technical Symposium on Computer Science Education

作者： Anisha Kaul Julia Ann Pinedo Anya Wallace Scripps College Claremont CA USA Harvey Mudd College Claremont CA USA

ISBN: (纸本)9781450358903

This study was a qualitative analysis of introductory-level computer science students' comprehension of sorting algorithms. We asked six students to read and summarize the code of a sorting algorithm. Next, we asked them to trace through the code, first using a provided array with pencil and paper, then again using sticky-notes to represent the array. Focused analysis of one interview found that a student who struggled to comprehend the algorithm during the pencil-and-paper trace quickly gained understanding when physically tracing the sticky-note array. We hypothesize that physical interaction with a sticky-note representation of an array facilitated student comprehension of sorting algorithms by consolidating multiple lines of code (LOC) into a single repeatable action. This research is relevant to computer science educators who may teach sorting algorithms to introductory-level students.

关键词： insertion sort introductory sorting algorithm undergraduate instruction bubble sort consolidation graphics/visualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：