• Journal of Biosystems Engineering
• /
• v.37 no.2
• /
• pp.90-99
• /
• 2012

Purpose: This study was conducted to investigate the optimal sorting factors in establishing an efficient sorting technology for brown rice. Methods: The brown rice varieties used in this study were Il Pum, Chu Cheong, Dong Jin, Un Gwang, Nam Pyeong, and Dae An. These were classified into whole grain, unriped grain, and green dead rice. The shape factors were analyzed based on length, width and thickness of the grains. Results: The results revealed that the maximum length among whole grain, unriped grain, and green dead rice was observed in Dae An variety while Chu Cheong variety showed the minimum. Further more, Il Pum brown rice showed the maximum width while Dong Jin variety showed the minimum. In the case of thickness, the maximum was observed in Un Gwang variety and that of the minimum among Nam Pyeong variety for both whole grain and unriped grain. Conclusions: The length and width can be used as determinants in sorting factors of whole grain and green dead rice, and the thickness can be considered as optimum sorting factor of whole grain and unriped grain.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.3
• /
• pp.197-205
• /
• 2004

In this paper, we studied on the hardware implementation of a 3${\times}$3 window weighted median filter using bit-level sorting algorithm. The weighted median filter is a generalization of the median filter that is able to preserve :,harp changes in signal and is very effective in removing impulse noise. It has been successfully applied in various areas such as digital signal and video/image processing. The weighted median filters are, for the most part, based on word-level sorting methods, which have more hardware and time complexity, However, the proposed bit-serial sorting algorithm uses weighted adder tree to overcome those disadvantages. It also offers a simple pipelined filter architecture that is highly regular with repeated modules and is very suitable for weighted median filtering. The algorithm was implemented by VHDL and graphical environment in MAX＋PlusII of ALTERA. The simulation results indicate that the proposed design method is more efficient than the traditional ones.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.292-298
• /
• 2022

Coding education and algorithm education are essential in the era of the fourth industrial revolution. Text-oriented algorithm textbooks are perceived as difficult by students who are new to coding and algorithms. There is a need to develop educational content so that students can easily understand the principles of complex algorithms. This paper has implemented basic sorting algorithms as augmented reality contents for students who are new to algorithm education. To make it easier to understand the concept and principles of sorting algorithms, sorting data was expressed as a 3D box and the comparison of values according to the algorithms and the movement of values were produced as augmented reality contents in the form of 3D animations. In order to help with the understanding of sorting algorithms in C language, the change of variable values and the exchange of data were shown as animations according to the execution order of the code and the flow of the loop. Students can conveniently use contents through a smart phone without special equipment by being produced in a marker-based manner. Interest and immersion, as well as understanding of classes of sorting algorithms can be increased through educational augmented reality-based educational contents.

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

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1137-1139
• /
• 1987

We discuss several issues related to the sorting algorithms on hypercube machine. The efficiencies of the algorithms are compared under the simpler assumption and the load balancing problem arising from the various algorithms and the data distribution is also discussed.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.171-174
• /
• 1997

The great development of semiconductor industry demands the high efficiency and performance of related device, but the pick and place system of semiconductor packaging device can load a few units until nowdays. Although the system can load a lot of units, it can work multiple sort operation. The defect like that causes a low efficiency. Therefore, this paper represents the development of pick and place system which can work multiple sort operation.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.7
• /
• pp.19-30
• /
• 1992

In this paper, a new large scale ATM switch architecture for Broadband ISDN is presented and its performance is analyzed mathematically. The proposed two-stage ATM switch consists of a sorting network and several unit switches. The proposed switch is self-routing and nonlocking. Its maximum through put is 100% without speed up which other output buffered switch needs. The hardware complexity mainly depends on that of a sorting network, but sorting network is easy to be implemented to VLSI because of its regularity in the structure.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.1
• /
• pp.97-102
• /
• 2011

This study was performed to design and develop an ergonomic equipment for strawberry sorting and packing in agricultural working environments. Potential risk of work related musculo-skeletal disorders associated with farm workers performing strawberry sorting and packing was analyzed through interviews, field surveys, work measurement, and working posture evaluation. For the evaluation of working posture, we used REBA, OWAS, and RULA assessment methods to identify multi-factorial risk factors. Based on the result of comprehensive assessment, a new concept of multi-level rotating table for strawberry sorting and packing was proposed to modify awkward working postures and improve the effectiveness of the farm work. Finally, the characteristics and effectiveness of new equipment was discussed in terms of improvements in productivity, safety, and subjective ratings of farm workers. The results of analysis showed that working conditions improved significantly.

• The Korean Journal of Applied Statistics
• /
• v.16 no.1
• /
• pp.129-140
• /
• 2003

This study was to develop a fruit sorting system using statistical image processing. Histogram was used to compare fruit colors to standard fruit color and edge detector using Wilcoxon test was used to calculate an accurate geometrical characteristics of fruit including perimeter, area, major axis and minor axis length and roundness. The experimental result obtained from using our system for sorting apples was presented.

• Journal of Industrial Technology
• /
• v.25 no.A
• /
• pp.95-104
• /
• 2005

In the future, the sorting machines will be taken charge of the most part of the letter sorting operations. At present, in order to deliver the sorted letters by the next day, many labors are intensively committed in the letter sorting operations. This research analyzes the problem of the facilities layout in registry department of mail center. It presents an improved design of facilities layout in comparison with several alternatives including the current layout using AutoCAD and FactoryCAD. It presents the optimized facilities layout using the algorithm which is embedded in the FactoryOPT. By the result of this research, we expect that the productivity of sorting letter will be improved and the related total labor cost will be minimized.