• Journal of The Korean Association of Information Education
• /
• v.22 no.6
• /
• pp.671-679
• /
• 2018

Sorting algorithms are the basic building blocks that computer science students need to learn. In recent years, sorting algorithms also have begun to be taught in K-12 classrooms using "the educational sorting game" described in CSUnplugged. However, although the educational sorting game was developed for students aged 8 and up, it is hard for K-12 teachers to play with their students because it is difficult for teachers to understand all of the algorithms and some popular algorithms do not work well in the educational sorting game. In this paper, we discuss what teachers should know, and experimentally analyze the performance of the existing algorithms when applied to the educational sorting game.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.10
• /
• pp.2606-2615
• /
• 1994

Sorting time is one of the most important issues for auto IC test handling systems. In actual system, because of too much path, reducing the computing time for finding a sorting path is the key way to enhancing the system performance. The exhaustive path search technique can not be used for real systems. This paper proposes heuristic sorting algorithm to find the minimal sorting time. The suggested algorithm is basically based on the best-first search technique and multi-level search technique. The results are close to the optimal solutions and computing time is greately reduced also. Therefore the proposed algorthm can be effectively used for real-time sorting process in auto IC test handling systems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.115-118
• /
• 2004

Recently, mail center considers introducing the automatic mail sorting machine to improve the productivity of sorting process. This paper deals with the development of optimal process plan for the mail sorting machine. We suggest several alternatives and evaluate them throughout the process analyzing method.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.303-310
• /
• 2006

The sorting algorithms have been developed to take advantage of distributed computers. But the speedup of parallel sorting algorithms decrease rapidly with increased number of processors due to parallel processing overhead such as context switching time and inter-processor communication cost. In this paper, we propose a parallel sorting method which provides linear speedup of an optimal serial algorithm for a system with a large number of processors. This algorithm may even provide superlinear speedup for a practical system. The algorithm takes advantage of an interconnection network properties and its protocol.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1601-1607
• /
• 2010

This paper presents FMEA (Failure Mode Effect Analysis) for maintenance of mail sorting machine which is for automatic sorting of mail. We suggest the update method of regular diagnosis item and period for maintenance of mail sorting machine using the risk priority number which is calculated by severity, occurrence, and detection of failure mode of mail sorting machine, and shows FMEA adoption example of letter sorting machine. This paper also describes the current maintenance system and status of mail sorting machine in the domestic postal logistics environment, and FMEA adoption step. The proposed maintenance using FMEA will be adapted for more easy and efficiency maintenance of mail sorting machine.

• Journal of the Korean Institute of Rural Architecture
• /
• v.21 no.3
• /
• pp.17-24
• /
• 2019

This study aimed to develop a mobile separating and sorting device for discharge sites to separate and sort mixed construction waste generated in small and medium scale in small provincial cities into inorganic materials and combustible materials. The study results can be summarized as follows: 1) As a result of analyzing the existing domestic technology for the separating and sorting mixed construction waste, a device sorting the waste by fusing the vibration screen, disc screen, air blowing methods and the separating and sorting the combustible waste is applied in Korea. 2) In foreign countries, the air blowing, screen, gravity sorters are used for separating and sorting combustible waste in the same way as in Korea. Especially German T Company suggests a construction waste separating and sorting system using an optical sorter. 3) As for the test device for separating and sorting mixed construction waste to be buried in landfill, the processing capacity was set as 16 tons per day. 4) For separating and sorting inorganic materials by granularity, this study set a trommel with two types of diameter as a basic. To operate the mobile all-in-one system, the device is designed to locate a conveyor, a combustible waste conveying device, inside of the trommel. 5) The device is designed in a mobile mode under the concept of primary separating and sorting device, and it can be transported using a 2.5-ton truck minimum. The diameter and length of the trommel are designed to be within 1500mm and 3000mm, respectively. In a further study, an optimized separating and sorting technology is planned to be presented through an experimental study for processing efficiency analysis at the mixed construction waste site by manufacturing the pilot experiment facility reflecting the design elements in the result of this study.

• Korean Journal of Agricultural Science
• /
• v.50 no.3
• /
• pp.373-382
• /
• 2023

The task of sorting and excluding blemished apples and others that lack commercial appeal is currently performed manually by human eye sorting, which not only causes musculoskeletal disorders in workers but also requires a significant amount of time and labor. In this study, an automated apple-sorting machine was developed to prevent musculoskeletal disorders in apple production workers and to streamline the process of sorting blemished and non-marketable apples from the better quality fruit. The apple-sorting machine is composed of an arm-rest, a main body, and a height-adjustable part, and uses object detection through a machine learning technology called 'You Only Look Once (YOLO)' to sort the apples. The machine was initially trained using apple image data, RoboFlow, and Google Colab, and the resulting images were analyzed using Jetson Nano. An algorithm was developed to link the Jetson Nano outputs and the conveyor belt to classify the analyzed apple images. This apple-sorting machine can immediately sort and exclude apples with surface defects, thereby reducing the time needed to sort the fruit and, accordingly, achieving cuts in labor costs. Furthermore, the apple-sorting machine can produce uniform quality sorting with a high level of accuracy compared with the subjective judgment of manual sorting by eye. This is expected to improve the productivity of apple growing operations and increase profitability.

• Journal of Biosystems Engineering
• /
• v.20 no.4
• /
• pp.376-382
• /
• 1995

This study was intended to develop more reliable fruit sorting algorithm regardless of the feeding positions of fruits by using the neural network in which various information could be included as input data. Specific objectives of this study were to select proper input units in the neural network by investigating the features of input image, to analyze the sorting accuracy of the algorithm depending on the feeding positions of Fuji apple and to evaluate the performance of the algorithm for practical usage. the average value in color grading accuracy was 90%. Based on the computing time required for color grading, the maximum sorting capacity was estimated to approximately 10, 800 apples per hours. Finally, it is concluded that the neuro-net based color sorting algorithm developed in this study has feasibility for practical usage.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1073-1081
• /
• 2000

This paper proposes a new fault-tolerant technique for bitonic sorting networks which can be used for designing ATM switches based on Batcher-Banyan network. The main goal in this paper is to design a cost-effective fault-tolerant bitonic sorting network. In order to recover a fault, additional comparison elements and additional links are used. A Dynamic Redundant Bitonic Sorting (DRBS) network is based on the Dynamic Redundant network and can be constructed with several different variations. The proposed fault-tolerant sorting network offers high fault-tolerance; low time delays; maintenance of cell sequence; simple routing; and regularity and modularity.