• Title/Summary/Keyword: Sorting algorithm

Search Result 280, Processing Time 0.029 seconds

Probabilistic analysis of efficiencies for sorting algorithms with a finite number of records based on an asymptotic algorithm analysis (점근적 분석 모형에 기초한 유한개 레코드 정렬 알고리즘 효율성의 확률적 분석)

  • 김숙영
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.2
    • /
    • pp.325-330
    • /
    • 2004
  • The Big O notation of a sorting algorithm analysis is an asymptotic algorithm analysis which gives information of a rough mathematical function with an infinite increase of a sample size, without any specification of a probabilistic model. Hence. in an application with a limited finite number of data, it is necessary to test efficiencies of sorting algorithms. I estimated probabilistic models which analyze the number of exchanges varying input sizes to sort. The estimated models to explain the relationship of sorting efficiency on the sample size (N of the sample size and S of the number of exchange of elements) are S=0.9305 $N^{1.339}$ for Quick sort algorithm with O(nlogn) time complexity, and S=0.2232 $N^{2.0130}$ for Insertion sort algorithm with O( $n^2$) time complexity. Furthermore, there are strongly supports that more than 99% of the above relationship could be explained by the estimated models (p<0.001). These findings suggest it is necessary to analyze sorting algorithm efficiency in applications with a finite number of data or a newly developed sorting algorithm.

  • PDF

Development of a Korean Red-Ginseng’s Shape Sorting System Using Image Processing (영상처리를 이용한 홍삼의 외형선별 시스템 개발)

  • 장요한;장동일;방승훈
    • Journal of Biosystems Engineering
    • /
    • v.26 no.3
    • /
    • pp.279-286
    • /
    • 2001
  • The purpose of this study were to organize a sorting system, to develop an algorithm of image processing for the shape sorting, and to finally develop a scientific and objective shape sorting system of Korean Red-Ginseng for mechanization of the shape sorting. The results of this study are followed. 1. The shape sorting system of Korean Red-Ginseng consists of a control computer, a color CCD camera(WV-CP4110) for image processing, an image processing board(DT3153), and an image acquisition unit. 2. Many image processing skill, such as sliding, stretching, threshold, binary and D$\sub$t/ were used to analyze the shape sorting factors of Korean Red-ginseng. 3. The sorting accuracy of the shape sorting system for the Korean Red-Ginseng was 74.7%. It is 21.1% lower than that of human inspector. Although the system has low accuracy, using more cameras may improve its sorting accuracy.

  • PDF

Development of Sorting Algorithm Contents for Improving the Problem-solving Ability in Elementary Student (초등학생용 문제해결력 증진을 위한 정렬 알고리즘 교육자료 개발)

  • Jang, Junghoon;Kim, Chongwoo
    • Journal of The Korean Association of Information Education
    • /
    • v.20 no.2
    • /
    • pp.151-160
    • /
    • 2016
  • Algorithm education is emphasized as an instrument for teaching the basic principles of Computer Science. But these materials is very short-fall. We'll present the CS Unplugged-based algorithm contents, which is easy to learn for elementary student. These contents for self-directed learning consisted of the activity-based learning. For problem-solving algorithm learning in everyday life we were developed the hashing techniques on the basis of the basic searching and sorting algorithms. For checking the adequacy of these materials were tested by surveys of teacher professional groups, and we obtain the appropriate conclusions for sorting algorithm contents for improving the problem-solving ability for in elementary student.

Improved Algorithm for Fully-automated Neural Spike Sorting based on Projection Pursuit and Gaussian Mixture Model

  • Kim, Kyung-Hwan
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.6
    • /
    • pp.705-713
    • /
    • 2006
  • For the analysis of multiunit extracellular neural signals as multiple spike trains, neural spike sorting is essential. Existing algorithms for the spike sorting have been unsatisfactory when the signal-to-noise ratio(SNR) is low, especially for implementation of fully-automated systems. We present a novel method that shows satisfactory performance even under low SNR, and compare its performance with a recent method based on principal component analysis(PCA) and fuzzy c-means(FCM) clustering algorithm. Our system consists of a spike detector that shows high performance under low SNR, a feature extractor that utilizes projection pursuit based on negentropy maximization, and an unsupervised classifier based on Gaussian mixture model. It is shown that the proposed feature extractor gives better performance compared to the PCA, and the proposed combination of spike detector, feature extraction, and unsupervised classification yields much better performance than the PCA-FCM, in that the realization of fully-automated unsupervised spike sorting becomes more feasible.

Development of Visualization Tool for Sorting Programming Instruction (정렬 프로그래밍 교육을 위한 시각화 도구의 개발)

  • Jeong, InKee
    • The Journal of Korean Association of Computer Education
    • /
    • v.7 no.6
    • /
    • pp.27-35
    • /
    • 2004
  • Data structure and algorithm are primary courses for computer programming instruction. However, now those are not interesting courses for students because the programming instruction methodologies that used these courses are not the proper methodologies for the visual and windows programming. The Sorting programming is the same as other data structures. Therefore, we developed the VTSPI (Visualization Tool for Sorting Programming Instruction) which is a software component to instruct sorting program effectively for solving these problems. As a result, students can code, understand and debug their programs because VTPSI is software components based on visual programming.

  • PDF

Proportional Fair Subcarrier Allocation Scheme in the Multiuser OFDM Wireless Mobile Communication Systems (다중 사용자 OFDM 무선 이동통신 환경에서의 비례공정 부반송파 할당기법)

  • Park Hyo soon;Kim Jun soek;Lee Jai yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1291-1297
    • /
    • 2004
  • In this paper, the new scheduling algorithm that supports the maximization of system throughput and the proportional fairness among non-real time traffic users is proposed in OFDMA wireless mobile communication systems. The concept of the proposed algorithm is based on the proportional fairness algorithm, which is deployed in 3GPP2, and sorting method. The proportional fairness algorithm is adapted to allocate the number of subcarrier per user. A sorting method is contributed to the maximization of system throughput in the practical allocation of subcarrier per user. Simulation results show that new algorithm had better performance than the max rate rule in case of fairness, higher throughput than the scheduling algorithm without sorting method. Even though the system throughput of the proposed algorithm is almost same with the iteration scheme using subcarrier swapping method between users, the computational time of the former is reduced up to 3 times than the latter.

A Tabu Search Algorithm for the Postal Transportation Planning Problem (우편집중국간 우편물 운송계획 문제의 타부 탐색 알고리듬)

  • 최지영;송영효;강성열
    • Journal of Information Technology Applications and Management
    • /
    • v.9 no.4
    • /
    • pp.13-34
    • /
    • 2002
  • This paper considers a postal transportation planning problem in the transportation network of the form of hub and spoke Given mail sorting centers and an exchange center, available vehicles and amount of mails to be transported between mail sorting centers, postal transportation planning is to make a transportation plan without violating various restrictions. The objective is to minimize the total transportation cost. To solve the problem, a tabu search algorithm is proposed. The algorithm is composed of a route construction procedure and a route improvement procedure to improve a solution obtained by the route construction procedure using a tabu search. The tabu search uses the best-admissible strategy, BA, and the first-best-admissible strategy, FBA. The algorithm was tested on problems consisting of 11, 16 and 21 mail sorting centers including one exchange center. Solutions of the problems consisting of 11 mail sorting centers including one exchange center were compared with optimal solutions On average, solutions using BA strategy were within 0.287% of the optimum and solutions using FBA strategy were within 0.508% of the optimum. Computational results show that the proposed algorithm can solve practically sized problems within a reasonable time and the quality of the solution is very good.

  • PDF

A real-time sorting algorithm for in-beam PET of heavy-ion cancer therapy device

  • Ke, Lingyun;Yan, Junwei;Chen, Jinda;Wang, Changxin;Zhang, Xiuling;Du, Chengming;Hu, Minchi;Yang, Zuoqiao;Xu, Jiapeng;Qian, Yi;She, Qianshun;Yang, Haibo;Zhao, Hongyun;Pu, Tianlei;Pei, Changxu;Su, Hong;Kong, Jie
    • Nuclear Engineering and Technology
    • /
    • v.53 no.10
    • /
    • pp.3406-3412
    • /
    • 2021
  • A real-time digital time-stamp sorting algorithm used in the In-Beam positron emission tomography (In-Beam PET) is presented. The algorithm is operated in the field programmable gate array (FPGA) and a small amount of registers, MUX and memory cells are used. It is developed for sorting the data of annihilation event from front-end circuits, so as to identify the coincidence events efficiently in a large amount of data. In the In-Beam PET, each annihilation event is detected by the detector array and digitized by the analog to digital converter (ADC) in Data Acquisition Unit (DAQU), with a resolution of 14 bits and sampling rate of 50 MS/s. Test and preliminary operation have been implemented, it can perform a sorting operation under the event count rate up to 1 MHz per channel, and support four channels in total, count rate up to 4 MHz. The performance of this algorithm has been verified by pulse generator and 22Na radiation source, which can sort the events with chaotic order into chronological order completely. The application of this algorithm provides not only an efficient solution for selection of coincidence events, but also a design of electronic circuit with a small-scale structure.

Development of Algorithms for Sorting Peeled Garlic Using Machnie Vison (I) - Comparison of sorting accuracy between Bayes discriminant function and neural network - (기계시각을 이용한 박피 마늘 선별 알고리즘 개발 (I) - 베이즈 판별함수와 신경회로망에 의한 설별 정확도 비교 -)

  • 이상엽;이수희;노상하;배영환
    • Journal of Biosystems Engineering
    • /
    • v.24 no.4
    • /
    • pp.325-334
    • /
    • 1999
  • The aim of this study was to present a groundwork for development of a sorting system of peeled garlics using machine vision. Images of various garlic samples such as sound, partially defective, discolored, rotten and un-peeled were obtained with a B/W machine vision system. Sorting factors which were based on normalized histogram and statistical analysis(STEPDISC Method) had good separability for various garlic samples. Bayes discriminant function and neural network sorting algorithms were developed with the sample images and were experimented on various garlic samples. It was showed that garlic samples could be classified by sorting algorithm with average sorting accuracies of 88.4% by Bayes discriminant function and 93.2% by neural network.

  • PDF