• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.25 no.5
• /
• pp.329-336
• /
• 2015

This paper presents a sorting method of mode vectors and natural frequencies about a rotor-journal bearing system. The rotor is solved by the finite element method, the bearing stiffness and damping coefficient are solved by the finite difference method. At any rotation speed section through the eigenvalue analysis of the system, mode vectors and natural frequencies not sorted are confirmed via the Campbell diagram and the MAC(modal assurance criterion). To sort mode vectors and natural frequencies of the section, a mode sorting method is presented through a method of rearranging the MAC of the mode vectors. Finally, the mode vectors and the natural frequencies are sorted by using the presented method, these are verified through the MAC.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2690-2700
• /
• 1997

This paper presents parallel sorting algorithm, SHARED-MEMORY-BS and REDUCED-BS, which are implemented on shared-memory parallel computers. These algorithm sort N keys in $O(log^2N)$ time. REDUCED-BS users a parity strategy which gives an idea for the efficient usage of the local memory associated with each processor. By taking advantage of the local memory associated with each processor, the communication of REDUCED-BS is decreased by approximately half that of SHARED-MEMORY-BS. On the basis of alleviating the communication, the algorithm REDUCED-BS results in a significant improvement of performance.

• 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 IKEEE
• /
• v.17 no.1
• /
• pp.29-35
• /
• 2013

In this paper, we suggest an improved Convex Hull algorithm considering sort in plane point set. This algorithm has low computational complexity since processing data are reduced by characteristic of extreme points. Also it obtains a complete convex set with just one processing using an convex vertex discrimination criterion. Initially it requires sorting of point set. However we can't quickly sort because of its heavy operations. This problem was solved by replacing value and index. We measure the execution time of algorithms by generating a random set of points. The results of the experiment show that it is about 2 times faster than the existing algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.733-735
• /
• 2002

DNA fragment assembly 프로그램인 Phrap에서는 exact match를 찾기 위해 정렬된 k-글자 테이블 자료구조를 사용한다. 이것은 접미사 배열의 간단한 형태로서, DNA fragment assembly와 같은 응용에서는 접미사 배열보다 더 유용한 자료구조이다. 본 논문에서는 k-글자 테이블을 정렬하는 Manber-Myers, Quicksort, Radix sort 알고리즘을 살펴보고, 실험을 통해 그 중에서 가장 뛰어난 성능을 가지는 것이 Quicksort 알고리즘임을 보였다 또한 k-글자 테이블의 정렬 문제에 있어서는, 캐쉬-메모리 아키텍쳐에 최적화되어 계산복잡도 속에 숨어있는 상수를 최소화하는 것이 중요한 문제임을 밝힌다.

• Journal of The Korean Association of Information Education
• /
• v.23 no.2
• /
• pp.107-116
• /
• 2019

The purpose of this study is to develop a Python sorting algorithm training program based on execution time as an educational method for enhancing the logical thinking power of elementary students and then to verify the effect. The education program was developed based on the results of the pre-demand analysis conducted on 100 elementary school teachers. In order to verify the effectiveness of the developed educational program, I teached 25 students of the volunteer sample of the elementary school education donation program conducted at ${\bigcirc}{\bigcirc}$ University conducted 42 hours, 7 days. The results of the pre-test and post-test were analyzed using the 'Group Assessment of Logical Thinking(GALT)' developed by the Korea Educational Development Institute. The results showed that the Python sorting algorithm training centered on execution time was effective in improving the logical thinking ability of elementary school students.

• Resources Recycling
• /
• v.17 no.6
• /
• pp.43-49
• /
• 2008

In this study, a scrap sorting system using a color recognition method has been developed to automatically sort out specified materials from a mixture, and its application as been examined in the separation of Cu and other non-ferrous metal parts from a mixture of iron scraps. The system is composed of three parts; measuring, conveying and ejecting parts. The color of scrap surface is recognized by the measuring part consisting of a line-scan camera, light sources and a frame grabber. The recognition is program-controlled by a image processing algorithms, and thus only the scrap part of designated color is separated by the use of air nozzles. In addition, the light system is designed to meet a high speed of sorting process with a frequency-variable inverter and the air nozzled ejectors are to be operated by an I/O interface communication with a hardware controller. In the functional tests of the system, its efficiency in the recognition of Cu scraps from its mixture with Fe ones reaches to more than 90%, and that in the separation more than 80% at a conveying speed of 25 m/min. Therefore, it is expected that the system can be commercialized in the industry of shredder makers if a high efficiency ejecting system is realized.

• Journal of the Korean Wood Science and Technology
• /
• v.39 no.2
• /
• pp.163-171
• /
• 2011

Because Japanese cedar shows lower mechanical performance, glued-laminated timber (glulam) can be a better way to utilize Japanese cedar for structural purpose. However, low yield of higher grade lamination from log makes it difficult to design structural glulam. This study was aimed to increase the yield of higher grade lamination and provide higher efficiency of manufacturing structural lamination by ultrasonic log sorting technology. Logs were sorted by an existing log grading rule regulated by Korea Forest Research Institute (KFRI). It was found that the KFRI log grading rule contributed to finding better logs in viewpoint of the volumetric yield and it can reduce the number of rejected lumber by visual grading. However, it could not identify better logs to produce higher-grade products. To find an appropriate log-sorting-method for structural products, log diameter and ultrasonic time of flight (TOF) for the log were considered as factors to affect mechanical performance of resulting products. However, it was found that influence of log diameter on mechanical performance of resulting products was very small. The TOF showed a possibility to sort logs by mechanical performance of resulting products even though a coefficient of correlation was not strong (R = 0.6). In a case study, the log selection based on the ultrasonic TOF of the log increased the yield of the outermost tension lamination (E8 or better grade, KS F 3021) from 2.6% to 12.5% and reduced LTE5 (lower than E5 grade) lamination from 43.6% to 10.3%, compared with the existing KFRI log grading rule.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.739-745
• /
• 2017

This paper presents and discusses an implementation of the GPU shifted sorting method to find approximate k nearest neighbors which executes within "warp", the minimum execution unit in GPU parallel architecture. Also, this paper presents the comparison results with other two common nearest neighbor searching methods, GPU-based kd-tree and ANN (Approximate Nearest Neighbor) library. The proposed implementation focuses on the cases when k is small, i.e. 2, 4, 8, and 16, which are handled efficiently within warp to consider it is very common for applications to handle small k's. Also, this paper discusses optimization ways to implementation by improving memory management in a loop for the CUB open library and adopting CUDA commands which are supported by GPU hardware. The proposed implementation shows more than 16-fold speed-up against GPU-based other methods in the tests, implying that the improvement would become higher for more larger input data.

• Journal of Biosystems Engineering
• /
• v.40 no.4
• /
• pp.327-334
• /
• 2015

Purpose: A falling-type weight sorter equipped with a load cell was developed to sort lightweight dried persimmons. The performance of the sorter was also evaluated. Methods: The electronic weight sorter for dried persimmon comprises a feeder part, a weight-measurement part, an indicator part, a carrier cup, a discharging part, and a driving part. The weight setting and zero-point adjustment are performed digitally for the convenience of users. For the experimental trials, 228 rubber-clay specimens (representative of dried persimmons) in the weight range of 24.73~99.56 g were manufactured for use in experiments to evaluate the performance of the sorter. Results: The average error of the weight measurements from three experimental trials was 1.655%, with a bias of -0.492 g, a root-mean-square error (RMSE) of ${\pm}0.808g$, and a coefficient of determination ($R^2$ ) of 0.997. Conclusions: The load-cell-based electronic dried-persimmon weight sorter developed in this study facilitates effective, precise, and convenient sorting of dried persimmons.