• Title/Summary/Keyword: sorting

Search Result 1,239, Processing Time 0.029 seconds

Designing Hybrid Sorting Algorithm for PC with GPU (GPU가 장착된 PC를 위한 혼합 정렬 알고리즘 설계)

  • Kwon, Oh-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.2
    • /
    • pp.281-286
    • /
    • 2011
  • Data sorting is one of important pre-process to utilize huge data in modern society, but sorting spends a lot of time by sorting itself. In this paper, we presented hybrid sorting algorithm that splits array to sort concurrently in CPU and GPU. To do this, we decided most effective range of array based on hardware performance, then accomplished reducing whole sorting time by concurrent sorting on CPU and GPU. As shown in results of experiment, hybrid sorting improved about eight percent of sorting time in comparison with the sorting time using only GPU.

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

Advanced Sorting Conditions Modeling of Frictional Force

  • Cho, Yong-Hee;Lee, Jeong-Wook;Chang, Yong-Hoon;Kim, Jung-Ha
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.439-443
    • /
    • 2004
  • In this research, we describe the sorting conditions modeling by friction force. As in any mechanism which is required to provide good dynamic performance and high accuracy, performance evaluation of optimal control. To understand friction it is necessary to investigate the topography of the sliding surfaces in contact. Any surfaces, even apparently smooth surfaces, are microscopically rough. When two surfaces come into contact, the true contact takes place only at point where asperities come together. The sorting conditions of sorting mechanism with friction force is sorting force must be equal with force can sorting one highest veneer among loaded veneer. This is just a thing being sorted veneer have friction with under veneer and this friction disturb sorting at the same time. Hence, the sorting conditions evaluation is important to sorting one veneer must get under control friction with veneer.

  • PDF

Development of Sorting Machine for Photo Diode and Improvement of Sorting Precision by using Machine Vision (광 다이오드 분류장치 및 비젼을 이용한 정밀도 향상)

  • Ryuh B.S.;Park S.M.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.153-154
    • /
    • 2006
  • Development of sorting machine for photo diode and its control system is addressed. The sorting machine for optical communication device requires high positional precision because the alignment is one of the most important point in the sorting process. This sorting method describes how to detect the target chip's angle and position from the wafer. The machine vision system is used for the feedback control. This sorting machine is implemented by motion controller, machine vision and various solenoid valve and is interfaced with RS-232c, GPIB and PCI communication. This system gets the position accuracy within $1{\mu}m$ with our experiments.

  • PDF

Development of The Yarn Sorting Equipment (khonhook) by Slide Way

  • Nithikarnjanatharn, Jittiwat;Rithinyo, Manote
    • International journal of advanced smart convergence
    • /
    • v.4 no.1
    • /
    • pp.137-144
    • /
    • 2015
  • Development of the yarn sorting equipment (khonhook) by slide way due to the principle of engineering that cause of workers on the long of motion time. The data was collected from the weaving group Ban Nongkok village, Nakornratchasima Province, THAILAND. According to the study, the step of yarn sorting (konhook) was one of the steps that affect long of motion time. The problem was the inadequate capacity equipment. The objective of research was to study and develop the yarn sorting equipment (konhook). The fabric used in the study was 64 meters in length and 1 meter in width. Researchers studied the processes the yarn sorting (konhook) which it consists of seven sub steps, 1) the thread tube setting, 2) yarn bunching, 3) tying a knot at the end of yarn, 4) looping the yarn into a pillar, 5) sorting the yarn (konhook), 6) crossing pillars and 7) taking out the yarn. Researchers focused on studying yarn sorting process (konhook) by designing and creating a device for yarn sorting (konhook) for reducing yarn sorting (konhook) time by the original method performance indicators. The results found that the developed yarn sorting equipment (konhook) ) by slide way could reduce working time from 7.24 minutes to 6.08 minutes of the original equipment yarn sorting (konhook). This means it could make the process 16.02 % faster. This also helps reducing the distance of workers' movement from 2,234 meters to 8 meters. This is 99.64 % shorter.

Two New Types of Candidate Symbol Sorting Schemes for Complexity Reduction of a Sphere Decoder

  • Jeon, Eun-Sung;Kim, Yo-Han;Kim, Dong-Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.888-894
    • /
    • 2007
  • The computational complexity of a sphere decoder (SD) is conventionally reduced by decoding order scheme which sorts candidate symbols in the ascending order of the Euclidean distance from the output of a zero-forcing (ZF) receiver. However, since the ZF output may not be a reliable sorting reference, we propose two types of sorting schemes to allow faster decoding. The first is to use the newly found lattice points in the previous search round instead of the ZF output (Type I). Since these lattice points are closer to the received signal than the ZF output, they can serve as a more reliable sorting reference for finding the maximum likelihood (ML) solution. The second sorting scheme is to sort candidate symbols in descending order according to the number of candidate symbols in the following layer, which are called child symbols (Type II). These two proposed sorting schemes can be combined with layer sorting for more complexity reduction. Through simulation, the Type I and Type II sorting schemes were found to provide 12% and 20% complexity reduction respectively over conventional sorting schemes. When they are combined with layer sorting, Type I and Type II provide an additional 10-15% complexity reduction while maintaining detection performance.

Simulator for restrict adjustment of mail sorting centers: A case study (우편집중국 관할권역 조정 시뮬레이터 개발사례)

  • Cha, Byung-Chul;Kim, Wan-Seok
    • IE interfaces
    • /
    • v.20 no.4
    • /
    • pp.515-524
    • /
    • 2007
  • This paper introduces the methodology for restrict adjustment of 25 mail sorting centers including 3 new mail sorting centers to balance their work loads and minimize their operating costs. We calculated the capacity of mail sorting centers considering mail types and analyzed the collection/delivery mail volume of 214 post offices to measure the work loads of mail sorting centers. We also developed the mathematical model and genetic algorithm to find the optimal solution for this problem.

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

Structural Modification for the Performance Improvement of a Grain Sorting Machine (곡물선별기의 성능 향상을 위한 구조변경)

  • Kim, Sung-Hyun;Lee, Kyu-Ho;Im, Hyung-Bin;Chung, Jin-Tai
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.18 no.2
    • /
    • pp.208-214
    • /
    • 2008
  • This paper presents a structural modification for the performance improvement of a grain sorting machine. The grain sorting machine is used to sort abnormal grains from normal grains such as rice or wheat. Vibration is one of main causes to deteriorate the sorting performance of the machine. Based on the finite element analysis and the experimental modal testing, the vibration characteristics were investigated for the sorting machine. Furthermore, in order to improve the sorting performance of the machine, the frame, chute and base plate of the sorting machine were modified by using the results of the vibration analysis.

Improving Computational Thinking Comprehension through Visualized Sorting App Development

  • Kim, Jongwan;Kim, Taeseong
    • Journal of Multimedia Information System
    • /
    • v.8 no.3
    • /
    • pp.191-196
    • /
    • 2021
  • Computational thinking refers to the process and method of solving everyday problems using computers. When teaching a computational thinking class for computer majors and non-majors at university, the easiest example to deliver the concept of computational thinking is sorting. Sorting is the concept of arranging given data in order. In this work, we have implemented four visualized sorting algorithms that anyone can easily use. In particular, it helps to understand the difference between the algorithms by showing the number of comparisons and exchanges between elements, which are the criteria for evaluating the performance of the sorting algorithm in real time. It was confirmed that the practice of using the sorting visualization app developed in this research contributed to the improvement of students' understanding of computational thinking.