• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.2
• /
• pp.116-124
• /
• 2008

Current paper investigates the dynamic behavior and stability of an infrared search and track subjected to external disturbance having gimbal structure with three rotating axes keeping constant angular velocity in the azimuth direction. Euler-Lagrange equation is applied to derive the coupled nonlinear dynamic equation of motion of infrared search and track and the characteristics of dynamic coupling are investigated. Two equilibrium points with small variations from the nonlinear coupling system are derived and the specific condition from which a coupled equation can be three independent equations is derived. Finally, to examine the stability of system, Lyapunov direct method was used and system stability and stability boundaries are investigated.

• Journal of Power Electronics
• /
• v.19 no.6
• /
• pp.1566-1574
• /
• 2019

Maximum power point tracking (MPPT) under the partial shading condition is a challenging research topic for photovoltaic systems. Shaded photo-voltaic module result in complex peak patterns on the power versus voltage curve which can misguide classical MPPT algorithms. Thus, various kinds of global MPPT algorithms have been studied. These have typically consisted of partial shading detection, global peak search and MPPT. The conventional partial shading detection algorithm aims to detect all of the occurrences of partial shading. This results in excessive execution of global peak searches and discontinuous operation of the MPPT. This in turn, reduces the achievable power for the PV module. Based on a theoretical investigation of power verse voltage curve patterns under various partial shading conditions, it is realized that not all the occurrences of partial shadings require a global peak search. Thus, an intelligent partial shading detection algorithm that provides exact identification of global peak search necessity is essential for the efficient utilization of solar energy resources. This paper presents a new partial shading determinant algorithm utilizing adaptive threshold levels. Conventional methods tend to be too sensitive to sharp shading patterns but insensitive to smooth patterns. However, the proposed algorithm always shows superb performance, regardless of the partial shading patterns.

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.51-61
• /
• 1983

Lagrangian relaxation is used to the problem of scheduling jobs on unrelated parallel processors with the objective of minimizing makespan. The implicit condition for optimality is drawn out explicitly in order to apply the subgradient algorithm. To obtain the optimal solution, branch-and-bound-search method is devised. In the search, the special structure of the problem is exploited effectively, Some computational experiences with the algorithm are presented, and comparisons are made with the Land and Doig method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.8
• /
• pp.839-844
• /
• 2009

In this paper, a real-time eye tracking method using fast face detection is proposed. Most of the current eye tracking systems have operational limitations due to sensors, complicated backgrounds, and uneven lighting condition. It also suffers from slow response time which is not proper for a real-time application. The tracking performance is low under complicated background and uneven lighting condition. The proposed algorithm detects face region from acquired image using elliptic Hough transform followed by eye detection within the detected face region using Haar-like features. In order to reduce the computation time in tracking eyes, the algorithm predicts next frame search region from the information obtained in the current frame. Experiments through simulation show good performance of the proposed method under various environments.

• Smart Structures and Systems
• /
• v.23 no.1
• /
• pp.45-60
• /
• 2019

This paper is devoted to proposing a new approach for damage detection of structures. In this technique, the biconjugate gradient method (BCG) is employed. To remedy the noise effects, a new preconditioning algorithm is applied. The proposed preconditioner matrix significantly reduces the condition number of the system. Moreover, based on the characteristics of the damage vector, a new direct search algorithm is employed to increase the efficiency of the suggested damage detection scheme by reducing the number of unknowns. To corroborate the high efficiency and capability of the presented strategy, it is applied for estimating the severity and location of damage in the well-known 31-member and 52-member trusses. For damage detection of these trusses, the time history responses are measured by a limited number of sensors. The results of numerical examples reveal high accuracy and robustness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.12
• /
• pp.756-763
• /
• 2014

In this paper, we introduce a new sparse signal recovery algorithm referred to as the matching pursuit with greedy tree search (GTMP). The tree search in our proposed method is implemented to minimize the cost function to improve the recovery performance of sparse signals. In addition, a pruning strategy is employed to each node of the tree for efficient implementation. In our performance guarantee analysis, we provide the condition that ensures the exact identification of the nonzero locations. Through empirical simulations, we show that GTMP is effective for sparse signal reconstruction and outperforms conventional sparse recovery algorithms.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.1
• /
• pp.21-34
• /
• 2008

An improved optimum design method for reinforced concrete frames using integrated genetic algorithm(GA) with direct search method is presented. First, various sets of initially assumed sections are generated using GA, and then, for each resultant design member force condition optimum solutions are selected by regression analysis and direct search within pre-determined design section database. In advance, global optimum solutions are selected from accumulated results through several generations. Proposed algorithm makes up for the weak point in standard genetic algorithm(GA), that is, low efficiency in convergence causing the deterioration of quality of final solutions and shows fast convergence together with improved results. Moreover, for the purpose of elevating economic efficiency, optimum design based on the nonlinear structural analysis is performed and therefore makes all members resist against given loading condition with the nearest resisting capacity. The investigation for the effectiveness of the introduced design procedure is conducted through correlation study for example structures.

• Journal of Satellite, Information and Communications
• /
• v.7 no.2
• /
• pp.97-103
• /
• 2012

A very low complexity QRD-M algorithm based on limited search area is proposed for MIMO systems. The conventional QRD-M algorithm calculates Euclidean distance between all constellation symbols and the temporary detection symbol at each layer. We found that performance will not be degraded even if we adaptively restrict the search area of the candidate symbols only to the neighboring points of temporary detection symbol according to the channel condition at each layer. As a channel condition indicator, we employ the channel gain ratio among the layers without necessity of SNR estimation. The simulation results show that the proposed scheme effectively achieves near optimal performance while maintaining the overall average computation complexity much smaller than the conventional QRD-M algorithm.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.1-5
• /
• 2006

Finding a valid timing constraint is one of the most important issues in the real-time monitoring area. To get the valid timing constraint, a developer executes a real-time process and changes the constraint on a regular basis. This is an exhaustive and time-consuming process. To improve this approach, we propose a timing constraint search technique. This technique uses two load models and one condition proposed in this paper to support the developer in determining the valid timing constraint range in an easy and systematic manner.

• IE interfaces
• /
• v.24 no.4
• /
• pp.274-280
• /
• 2011

Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.