• Proceedings of the Korean Society of Computer Information Conference
• /
• 2022.01a
• /
• pp.357-360
• /
• 2022

본 논문에서는 대용량 데이터에서 빠르게 주변 데이터를 접근하기 위한 자료구조인 최근접 이웃 탐색(Nearest neighbor search, NNS) 문제를 빠르게 풀 수 있는 바이토닉 정렬(Bitonic sort) 기반 해시 테이블을 GPU기반에서 설계하는 방법과 이를 통해 입자 기반 물리 시뮬레이션을 고속화할 수 있는 방법에 대해 살펴본다. 본 논문에서는 CUDA 아키텍처를 이용하여 해시 테이블을 설계하였으며, 계산양이 가장 큰 데이터 정렬부분을 최적화함으로써 NVIDIA에서 제공하는 CUDA 해시 테이블보다 빠른 결과를 얻을 수 있으며, 이 자료구조를 입자 기반 시뮬레이션에 통합함으로써 고성능 시뮬레이션을 쉽게 제작할 수 있다.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.161-167
• /
• 2024

This research develops a smart livestock monitoring system leveraging artificial intelligence with YOLOv8 and OC-SORT technologies to precisely monitor and analyze cow behavior, enhancing detection and tracking capabilities in complex environments. It delves into cows' movement speed and acceleration to uncover behavior patterns and health status, focusing on estrus-related behaviors for optimal breeding strategies. The study identifies changes in activity, social interactions, and mating behaviors as crucial estrus indicators, contributing significantly to livestock management innovations. By offering methods for visual behavior analysis representation, it simplifies the interpretation of findings, advancing livestock monitoring technology. This work not only contributes to smarter livestock management by providing an AI-driven cow behavior tracking model but also opens new avenues for research and efficiency improvements in the field.

• Journal of Internet Computing and Services
• /
• v.21 no.1
• /
• pp.57-70
• /
• 2020

This study examines the subjective perception of software developers on happiness at work through the Q-sort methodology. Analysis of 63 respondents revealed four types happiness at work with highly differentiated characteristics: 'stability of work oriented', 'defiant self-driven, technology-oriented', 'realistic professionalism oriented', and 'genuinely technology and task-immersion oriented'. The 'defiant self-driven, technology-oriented' and 'genuinely technology and task-immersion oriented' types are interested in latest ICT and consider recognition of one's professionalism as well as self-realization result in happiness at work. On the other hand, the 'stability of work oriented' and 'realistic professionalism oriented' types did not pay much attention to one's growth of technical career but emphasized salary, welfare benefits and job promotion as the most important factors in happiness at work. Today, extraordinary SW developers are a key factor to acquire industrial competitiveness. Nations and corporations should prepare realistic ways to promote overall happiness at work by accurately understanding the varying characteristics and predisposition of domestic ICT personnel. In Korea, it is found that there is a shortage of 'genuinely technology and task-immersion oriented' SW developers. In order to secure national and industrial competitiveness in the era of the Fourth Industrial Revolution, creation of work ecosystem to promote high levels of happiness at work is required to secure quality software production and pride as an ICT professional.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.305-308
• /
• 2007

In this paper we suggest an efficient evolutionary approach based on topological sort techniques for precedence constrained TSPs. The determination of optimal sequence has much to offer to downstream project management and opens up new opportunities for supply chains and logistics. Experimental results show that the suggested approach is a good alternative to locate optimal solution for complicated precedence constrained sequencing as in optimization method for instance.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.94.1-94
• /
• 2002

This paper is concerned with parallel FFT and Quick-Merge Sort. They are implemented on computers interconnected by VMIC 5579 reflective memory and a cluster of workstations (PCs) interconnected via Fast Ethernet. Message passing interface (MPI) parallel library is used for communication in a cluster of workstations. An improved parallel FFT is also presented to decrease an execution time in the case of a small number of hosts. Distributed shared memory (DSM), VMIC 5579 reflective memory (RM), a cluster of workstations (COW) and message passing interface (MPI) parallel library are described.

• 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 Power Electronics
• /
• v.17 no.2
• /
• pp.346-357
• /
• 2017

The Modular Multilevel Converter (MMC) is particularly attractive for medium and high power applications such as High-Voltage Direct Current (HVDC) systems. In order to reach a high voltage, the number of cascaded submodules (SMs) is generally very large. Thus, in the applications with hundreds or even thousands of SMs such as MMC-HVDCs, the sorting algorithm of the conventional voltage balancing strategy is extremely slow. This complicates the controller design and increases the hardware cost tremendously. This paper presents a Two-Way Merge Sort (TWMS) strategy based on the prediction of the capacitor voltages under ideal conditions. It also proposes an innovative Insertion Sort Correction for the TWMS (ISC-TWMS) to solve issues in practical engineering under non-ideal conditions. The proposed sorting methods are combined with the features of the MMC-HVDC control strategy, which significantly accelerates the sorting process and reduces the implementation efforts. In comparison with the commonly used quicksort algorithm, it saves at least two-thirds of the sorting execution time in one arm with 100 SMs, and saves more with a higher number of SMs. A 501-level MMC-HVDC simulation model in PSCAD/EMTDC has been built to verify the validity of the proposed strategies. The fast speed and high efficiency of the algorithms are demonstrated by experiments with a DSP controller (TMS320F28335).

• Convergence Security Journal
• /
• v.5 no.2
• /
• pp.51-56
• /
• 2005

Service operating management to keep stable and effective environment according as user increase and network environment of the Internet become complex gradually and requirements of offered service and user become various is felt constraint gradually. To solve this problem, invasion confrontation system through proposed this log analysis can be consisted as search of log file that is XML's advantage storing log file by XML form is easy and fast, and can have advantage log files of system analyze unification and manages according to structure anger of data. Also, created log file by Internet Protocol Address sort by do log and by Port number sort do log, invasion type sort log file and comparative analysis created in other invasion feeler system because change sort to various form such as do log by do logarithm, feeler time possible.

• 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 The Korean Association of Information Education
• /
• v.10 no.3
• /
• pp.289-298
• /
• 2006

Computer education is important to learn functions of computers, and it is necessary to enhance the ability such as high-power intelligence ability, originality, and positive thoughts on the future. In other words, not only is it important to learn functions to calculate using computers but also it is important to understand the principle of the way computers calculate and enlarge other abilities to solve other problems through understanding of the principle. Accordingly, this study aims to teach search and sort of data structure to a primary-school children. In addition its purpose is to design teaching and learning methods and teach according to the methods and find out whether primary-school children can understand the contents. Intelligent field was assessed through equivalent test before and after the test and emotional field through students' impressions after a lesson. The test showed that search and sort algorithm of data structure could be taught to children. That is, it presented the learnability of search and sort of data structure as a learning element of elementary school computer education.