• 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.

• 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 ²²Na 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.

• 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.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1996.06c
• /
• pp.607-614
• /
• 1996

A computer vision based automatic intelligent sorting system for dried oak mushrooms has been developed. The developed system was composed of automatic devices for mushroom feeding and handling, two sets of computer vision system for grading , and computer with digital I/O board for PLC interface, and pneumatic actuators for the system control. Considering the efficiency of grading process and the real time on-line system implementation, grading was done sequentially at two consecutive independent stages using the captured image of either side. At the first stage, four grades of high quality categories were determined from the cap surface images and at the second stage 8 grades of medium and low quality categories were determined from the gill side images. The previously developed neuro-net based mushroom grading algorithm which allowed real time on-line processing was implemented and tested. Developed system revealed successful performance of sorting capability of approximate y 5, 000 mushrooms/hr per each line i.e. average 0.75 sec/mushroom with the grading accuracy of more than 88%.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.1
• /
• pp.70-78
• /
• 2010

Elitist nondominated sorting genetic algorithm (NSGA-II) is adopted and improved for multiobjective optimal reactive power flow (ORPF) problem. Multiobjective ORPF, formulated as a multiobjective mixed integer nonlinear optimization problem, minimizes real power loss and improves voltage profile of power grid by determining reactive power control variables. NSGA-II-based ORPF is tested on standard IEEE 30-bus test system and compared with four other state-of-the-art multiobjective evolutionary algorithms (MOEAs). Pareto front and outer solutions achieved by the five MOEAs are analyzed and compared. NSGA-II obtains the best control strategy for ORPF, but it suffers from the lower convergence speed at the early stage of the optimization. Several problem-specific local search strategies (LSSs) are incorporated into NSGA-II to promote algorithm's exploiting capability and then to speed up its convergence. This enhanced version of NSGA-II (ENSGA) is examined on IEEE 30 system. Experimental results show that the use of LSSs clearly improved the performance of NSGA-II. ENSGA shows the best search efficiency and is proved to be one of the efficient potential candidates in solving reactive power optimization in the real-time operation systems.

• 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.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1998.06b
• /
• pp.282-290
• /
• 1998

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.197-204
• /
• 2022

Sorting is an important data structure in many applications in the real world. Several sorting algorithms are currently in use for searching and other operations. Sorting algorithms rearrange the elements of an array or list based on the elements' comparison operators. The comparison operator is used in the accurate data structure to establish the new order of elements. This report analyzes and compares the time complexity and running time theoretically and experimentally of insertion, merge, and heap sort algorithms. Java language is used by the NetBeans tool to implement the code of the algorithms. The results show that when dealing with sorted elements, insertion sort has a faster running time than merge and heap algorithms. When it comes to dealing with a large number of elements, it is better to use the merge sort. For the number of comparisons for each algorithm, the insertion sort has the highest number of comparisons.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.68-72
• /
• 2009

The suffix array is a data structure storing all suffixes of a string in lexicographical order. It is widely used in string problems instead of the suffix tree, which uses a large amount of memory space. Many researches have shown that not only the suffix array can be built in O(n), but also it can be constructed with a small time and space usage for real-world inputs. In this paper, we analyze a practical suffix sorting algorithm due to Maniscalco and Puglisi [1], and we propose an efficient algorithm which improves Maniscalco-Puglisi's running time.

• Journal of Biosystems Engineering
• /
• v.26 no.2
• /
• pp.147-154
• /
• 2001

In Korea and Japan, dried oak mushrooms are classified into 12 to 16 different categories based on its external visual quality. And grading used to be done manually by the human expert and is limited to the randomly sampled oak mushrooms. Visual features of dried oak mushrooms dominate its quality and are distributed over both sides of the gill and the cap. The 2nd prototype computer vision based automatic grading and sorting system for dried oak mushrooms was developed based on the 1st prototype. Sorting function was improved and overall system for grading was simplified to one stage grading instead of two stage grading by inspecting both front and back sides of mushrooms. Neuro-net based side(gill or cap) recognition algorithm of the fed mushroom was adopted. Grading was performed with both images of gill and cap using neural network. A real time simultaneous discharge algorithm, which is good for objects randomly fed individually and for multi-objects located along a series of discharge buckets, was developed and implemented to the controller and the performance was verified. Two hundreds samples chosen from 10 samples per 20 grade categories were used to verify the performance of each unit such as feeding, reversing, grading, and discharging unites. Test results showed that success rates of one-line feeding, reversing, grading, and discharging functions were 93%, 95%, 94%, and 99% respectively. The developed prototype revealed successful performance such as the approximate sorting capability of 3,600 mushrooms/hr per each line i.e. average 1sec/mushroom. Considering processing time of approximate 0.2 sec for grading, it was desired to reduce time to reverse a mushroom to acquire the reversed surface image.