• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.25 no.6
• /
• pp.486-491
• /
• 2016

Disturbance/vibration reduction is critical in many applications using machine vision. The off-focusing or blurring error caused by vibration degrades the machine performance. In line with this, real-time disturbance estimation and avoidance are proposed in this study instead of going with a more familiar approach, such as the vibration absorber. The instantaneous motion caused by the disturbance is sensed by an attitude heading reference system module. A periodic vibration modeling is conducted to provide a better performance. The algorithm for vibration avoidance is described according to the vibration modeling. The vibration occurrence function is also proposed, and its parameters are determined using the genetic algorithm. The proposed algorithm is experimentally tested for its effectiveness in the vision inspection system.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.195-198
• /
• 2012

An efficient sliding window algorithm employing an adaptive-length guard window for turbo decoders is proposed. The proposed algorithm results in significant complexity reductions, especially for small sliding window lengths where the additional computational complexity required for the guard window is critical.

• Journal of information and communication convergence engineering
• /
• v.3 no.3
• /
• pp.119-121
• /
• 2005

This paper aims to estimate the delay time of multiple signals in a multi-path environment. It also seeks to carry out a comparative analysis with the existing delay time under the proposed algorithm to develop a new algorithm that applies the space average method in a MUSIC algorithm. Unlike the existing delay time estimation algorithm, the developed algorithm was able to estimate the delay time in 5ns low. Therefore, the algorithm proposed in this paper improved the existing delay time estimated algorithm.

• Education of Primary School Mathematics
• /
• v.22 no.2
• /
• pp.113-127
• /
• 2019

The purpose of this study is to justify the fraction division algorithm in elementary mathematics by applying the definition of natural number division to fraction division. First, we studied the contents which need to be taken into consideration in teaching fraction division in elementary mathematics and suggested the criteria. Based on this research, we examined whether the previous methods which are used to derive the standard algorithm are appropriate for the course of introducing the fraction division. Next, we defined division in fraction and suggested the unit-circle partition model and the square partition model which can visualize the definition. Finally, we confirmed that the standard algorithm of fraction division in both partition and measurement is naturally derived through these models.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.23 no.3
• /
• pp.279-283
• /
• 2014

Recently, a topology algorithm based on the artificial bee colony algorithm (ABCA) has been proposed for static and dynamic topology optimization. From the results, the convergence rate of the algorithm was determined to be slightly slow. Therefore, we propose a new search method to improve the convergence rate of the algorithm using a chaotic map. We investigate the effect of the chaotic map on the convergence rate of the algorithm in static and dynamic topology optimization. The chaotic map has been applied to three cases, namely, employ bee search, onlooker bee search, and both employ bee as well as onlooker bee search steps. It is verified that the case in which the logistic function of the chaotic map is applied to both employ bee as well as onlooker bee search steps shows the best dynamic topology optimization, improved by 5.89% compared to ABCA. Therefore, it is expected that the proposed algorithm can effectively be applied to dynamic topology optimization to improve the convergence rate.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.777-787
• /
• 2005

In this paper, we propose an urgency- and efficiency-based wireless packet scheduling (UEPS) algorithm that is able to schedule real-time (RT) and non-real-time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality-of-service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.

• Journal of the Korea Society for Simulation
• /
• v.12 no.2
• /
• pp.13-24
• /
• 2003

In this study, we propose a scheduling analysis method of the Flexible management system using the transitive matrix. The Scheduling problem is a combination-optimization problem basically, and a complexity is increased exponentially for a size of the problem. To reduce an increase of a complexity, we define that the basic unit of concurrency (short BUC) is a set of control flows based on behavioral properties in the net. And we propose an algorithm to divide original system into some BUC. To sum up, we divide a petri net model of the Flexible management system Into the basic unit of concurrency through the division algorithm using the transitive matrix. Then we apply it to the division-scheduling algorithm to find an efficient scheduling. Finally, we verify its efficiency with an example.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2908-2910
• /
• 1999

In this paper, a fuzzy model is identified and optimized using the hybrid algorithm and HCM clustering method. Here, the hybrid algorithm is carried out as the structure combined with both a genetic algorithm and the improved complex method. The one is utilized for determining the initial parameters of membership function, the other for obtaining the fine parameters of membership function. HCM clustering algorithm is used to determine the confined region of initial parameters and also to avoid overflow phenomenon during auto-tuning of hybrid algorithm. And the standard least square method is used for the identification of optimum consequence parameters of fuzzy model. Two numerical examples are shown to evaluate the performance of the proposed model.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.1-12
• /
• 2008

In this paper, we propose an efficient single-resource task scheduling algorithm for the Communication, Ocean, and Meteorological Satellite. Among general satellite planning functions such as constraint check, priority check, and task scheduling, this paper focuses on the task scheduling algorithm, which resolves conflict among tasks which have an exclusion relation and the same priority. The goal of the proposed task scheduling algorithm is to maximize the number of tasks that can be scheduled. The rationale of the algorithm is that a discarded task can be scheduled instead of a previously selected one depending on the expected benefit acquired by doing so. The evaluation results show that the proposed algorithm enhances the number of tasks that can be scheduled considerably.

• East Asian mathematical journal
• /
• v.32 no.4
• /
• pp.565-587
• /
• 2016

The purpose of this study was to analyze the understanding of the meaning of fraction division and fraction division algorithm of elementary mathematical gifted students through the process of problem posing and solving activities. For this goal, students were asked to pose more than two real-world problems with respect to the fraction division of ${\frac{3}{4}}{\div}{\frac{2}{3}}$, and to explain the validity of the operation ${\frac{3}{4}}{\div}{\frac{2}{3}}={\frac{3}{4}}{\times}{\frac{3}{2}}$ in the process of solving the posed problems. As the results, although the gifted students posed more word problems in the 'inverse of multiplication' and 'inverse of a cartesian product' situations compared to the general students and pre-service elementary teachers in the previous researches, most of them also preferred to understanding the meaning of fractional division in the 'measurement division' situation. Handling the fractional division by converting it into the division of natural numbers through reduction to a common denominator in the 'measurement division', they showed the poor understanding of the meaning of multiplication by the reciprocal of divisor in the fraction division algorithm. So we suggest following: First, instruction on fraction division based on various problem situations is necessary. Second, eliciting fractional division algorithm in partitive division situation is strongly recommended for helping students understand the meaning of the reciprocal of divisor. Third, it is necessary to incorporate real-world problem posing tasks into elementary mathematics classroom for fostering mathematical creativity as well as problem solving ability.