• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1095-1101
• /
• 2020

Vessels or aircraft should be loaded with containers or cargo to maintain weight balance in order to be stable when navigating the route. The container loading algorithm is known as the NP problem and several heuristic methods have been studied. Containers can be characterized by the uniform volume and weight, which makes it easier to find an optimal loading method. In this paper, we propose an algorithm for weight balance when the volume and weight of an object are uniform. It is assumed that the loading space has a special structure of m * n mesh (where m and n are both odd). In this case, we designed a greedy algorithm and proved that the algorithm is optimal in that it can always find a loading position that maintains a weight balance regardless of the number of objects. Our algorithm can be used in many engineering problems, such as loading algorithms and load balancing problems.

• Korean Journal of Construction Engineering and Management
• /
• v.24 no.2
• /
• pp.70-78
• /
• 2023

Inclinometer has several problems of 1)difficulty installing inclinometer casing, 2) measuring 2D local lateral displacement of retaining wall, 3) measurement by manpower. To solve such problems, a 2D LiDAR sensor-based retaining wall displacement measurement system was developed in previous studies. The purpose of this study is to select a displacement analysis algorithm to be applied in the retaining wall displacement measurement system. As a result of the displacement analysis algorithm selection, the M3C2 (Multiple Model to Model Cloud Comparison) algorithm with a displacement estimation error of 2mm was selected as the displacement analysis algorithm. If the M3C2 algorithm is applied in the system and the reliability of the displacement analysis result is secured through several field experiments. Convenient management of the displacement for the retaining wall is possible in comparison with the current measurement management.

• Journal of Aerospace System Engineering
• /
• v.12 no.5
• /
• pp.48-53
• /
• 2018

In this study, Real-Time Operating System(RTOS) and 3-D collision avoidance algorithm are implemented to three different Miciro Controller Unit(MCU)s and their performances compared. We selected Microchip Technology's ATmega2560, STM's ARM Cortex-M3 and ARM Cortex-M4, because they are widely used. FreeRTOS, an open-source operating system, was also used. The 3D collision avoidance algorithm consists of the vertical and the horizontal avoidance algorithm, which is implemented using C++. The performances of the MCUs were compared with respect to used memory and calculation time. As a result, Cortex-M4's calculation time was the fastest and ATmega2560 used least memory.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.89-96
• /
• 2022

This paper suggests heuristic algorithm for single-model cross-over assembly line balancing problem that is a kind of NP-hard problem. The assembly line balance problem is mainly applied with metaheuristic methods, and no algorithm has been proposed to find the exact solution of polynomial time, making it very difficult to apply in practice. The proposed bi-directional clustering algorithm computes the minimum number of worker m^* = ⌈W/c⌉ and goal cycle time c^* = ⌈W/m^*⌉ from the given total assembling time W and cycle time c. Then we assign each workstation i=1,2,…,m^* to T_i=c^* ±α≤ c using bi-directional clustering method. For 7 experimental data, this bi-directional clustering algorithm same performance as other methods.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.246-246
• /
• 2023

Multi-purpose dams are operated accounting for both physical and socioeconomic factors. This study aims to evaluate the utility of a deep learning algorithm-based model for three multi-purpose dam operation (Seomjin River dam, Juam dam, and Juam Control dam) in Seomjin River. In this study, the Gated Recurrent Unit (GRU) algorithm is applied to predict hourly water level of the dam reservoirs over 2002-2021. The hyper-parameters are optimized by the Bayesian optimization algorithm to enhance the prediction skill of the GRU model. The GRU models are set by the following cases: single dam input - single dam output (S-S), multi-dam input - single dam output (M-S), and multi-dam input - multi-dam output (M-M). Results show that the S-S cases with the local dam information have the highest accuracy above 0.8 of NSE. Results from the M-S and M-M model cases confirm that upstream dam information can bring important information for downstream dam operation prediction. The S-S models are simulated with altered outflows (-40% to +40%) to generate the simulated water level of the dam reservoir as alternative dam operational scenarios. The alternative S-S model simulations show physically inconsistent results, indicating that our deep learning algorithm-based model is not explainable for multi-purpose dam operation patterns. To better understand this limitation, we further analyze the relationship between observed water level and outflow of each dam. Results show that complexity in outflow-water level relationship causes the limited predictability of the GRU algorithm-based model. This study highlights the importance of socioeconomic factors from hidden multi-purpose dam operation processes on not only physical processes-based modeling but also aritificial intelligence modeling.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.1
• /
• pp.45-55
• /
• 2022

Currently, the Collective Control Algorithm is the most popular elevator algorithm. The Collective Control Algorithm allows the user to use the elevator when the direction of movement of the elevator and the direction of the user's destination are the same. However, the algorithm has a problem in that only one elevator responds to a user's call when the user's waiting time and using multiple elevators. To solve this problem, this paper proposes a new hybrid HRN algorithm based on the highest response ratio next (HRN) algorithm. In general, HRN Algorithm requires a user's boarding time and getting off time, but due to the nature of the elevator, it is difficult to predict the user's call in advance. Therefore, to overcome these limitations, this paper proposes Hybrid HRN Algorithm that considers the distance between the user's call location and the arrival location. This paper shows that Hybrid HRN Algorithm, proposed through experiments, has an average waiting time of 23.34 seconds, a standard deviation of 11.86, a total moving distance of 535.2m, a total operating time of 84sec, and a driving balance between the two elevators is 92m, which is superior to the previously suggested Collective Control, Zoning, and 3-Passage Algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.5
• /
• pp.339-348
• /
• 2017

Due to recent improvements in computer processing speed and image processing technology, researches are being actively carried out to combine information from a camera with existing GNSS (Global Navigation Satellite System) and dead reckoning. In this study, the mathematical model based on SPR (Single Photo Resection) is derived for image-based assistant algorithm for vehicle positioning. Simulation test is performed to analyze factors affecting SPR. In addition, GNSS/on-board vehicle sensor/image based positioning algorithm is developed by combining image-based positioning algorithm with existing positioning algorithm. The performance of the integrated algorithm is evaluated by the actual driving test and landmark's position data, which is required to perform SPR, based on simulation. The precision of the horizontal position error is 1.79m in the case of the existing positioning algorithm, and that of the integrated positioning algorithm is 0.12m at the points where SPR is performed. In future research, it is necessary to develop an optimized algorithm based on the actual landmark's position data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.759-764
• /
• 2013

We present a square root algorithm in $F_q$ which generalizes Atkin's square root algorithm [9] for finite field $F_q$ of q elements where $q{\equiv}5$ (mod 8) and Kong et al.'s algorithm [11] for the case $q{\equiv}9$ (mod 16). Our algorithm precomputes ${\xi}$ a primitive $2^s$-th root of unity where s is the largest positive integer satisfying $2^s|q-1$, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for square root computation and is favorably compared with the algorithms of Atkin, M$\ddot{u}$ller and Kong et al.

• Journal of the Chungcheong Mathematical Society
• /
• v.15 no.2
• /
• pp.85-96
• /
• 2003

An efficient algorithm for the multiplication in a binary finite filed using a normal basis representation of $F_{2^m}$ is discussed and proposed for software implementation of elliptic curve cryptography. The algorithm is developed by using the storage scheme of sparse matrices.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.13-18
• /
• 1986

This paper is concerned with flow-shop permutation scheduling problem. This paper presents an algorithm for the minimum makespan sequence. The efficiency of proposed algorithm is demonstrated by comparisons with the existing algorithms: Johnson's, branch & bound method, and heuristic algorithms. The proposed algorithm is more effective than the other algorithms. A numerical example is given to illustrate the procedure.