• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.4
• /
• pp.329-339
• /
• 2003

A neural network based adaptive controller design method is proposed for reconfigurable flight control systems in the presence of variations in aerodynamic coefficients or control effectiveness decrease caused by control surface damage. The neural network based adaptive nonlinear controller is developed by making use of the backstepping technique for command following of the angle of attack, sideslip angle, and bank angle. On-line teaming neural networks are implemented to guarantee reconfigurability and robustness to the uncertainties caused by aerodynamic coefficients variations. The main feature of the proposed controller is that the adaptive controller is designed with assumption that not any of the nonlinear functions of the system is known accurately, whereas most of the previous works assume that only some of the nonlinear functions are unknown. Neural networks loam through the weight update rules that are derived from the Lyapunov control theory. The closed-loop stability of the error states is also investigated according to the Lyapunov theory. A nonlinear dynamic model of an F-16 aircraft is used to demonstrate the effectiveness of the proposed control law.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.878-894
• /
• 2013

Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.181-185
• /
• 2014

The lifetime of a solid-state drive (SSD) is limited because of the number of program and erase cycles allowed on its NAND flash blocks. Data cannot be overwritten in an SSD, leading to an out-of-place update every time the data are modified. This result in two copies of the data: the original copy and a modified copy. This phenomenon is known as write amplification and adversely affects the endurance of the memory. In this study, we address the issue of reducing wear leveling through efficient handling of write requests. This results in even wearing of all the blocks, thereby increasing the endurance period. The focus of our work is to logically divert the write requests, which are concentrated to limited blocks, to the less-worn blocks and then measure the maximum number of write requests that the memory can handle. A memory without the proposed algorithm wears out prematurely as compared to that with the algorithm. The main feature of the proposed algorithm is to delay out-of-place updates till the threshold is reached, which results in a low overhead. Further, the algorithm increases endurance by a factor of the threshold level multiplied by the number of blocks in the memory.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.1
• /
• pp.69-78
• /
• 1999

Recently, with a rapid industry development, the recognition of environmental pollution is being increased. And the technique of pollution-prevention is also being studied. In the past, management direction for environmental pollution was limited only to concentration reduction and technique for treatment. But ,in these day, its direction is moved to a high level study such as a management and estimation of pollution material. In this study we establish a conception about EIS(Environmental Information System) building and present its building method. And we present a method for a database building, searching, analysis and printing. Also we produced the landuse map processing LANDSAT TM image. Using DDE(Dynamic Data Exchange) between Excel and ArcView on PC platform, we are enable to write and/or update a Report - waste discharge facility approval management leader - and to recover weakness about the report management of exsiting GSIS program.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.69-77
• /
• 2004

As the internet is widely distributed. the intelligent search agent is commonly used to meet the needs of user. But these Intelligent multi-agents are so independent each other that they can not give reliability of information and also have difficulty in coping with the dynamic distributed environments due to the short of cooperation abilities among multiagent. To resolve these problems. this paper proposes the mechanism for efficient cooperation and information processing by creating agency within broker agent and clustering multi agent's agency using neural network. For reliability of information. we also propose the multiagent management mechanism that can improve the information update problems which are in existing search systems and evaluate the performance of this research through simulation.

• Structural Engineering and Mechanics
• /
• v.56 no.4
• /
• pp.625-648
• /
• 2015

Modern super-tall buildings are more sensitive to strong winds. The evaluation of wind loads for the design of these buildings is of primary importance. A direct monitoring of wind forces acting on super-tall structures is quite difficult to be realized. Indirect measurements interpreted by inverse techniques are therefore favourable since dynamic response measurements are easier to be carried out. To this end, a Kalman filtering based inverse approach is developed in this study so as to estimate the wind loads on super-tall buildings based on limited structural responses. The optimum solution of Kalman filter gain by solving the Riccati equation is used to update the identification accuracy of external loads. The feasibility of the developed estimation method is investigated through the wind tunnel test of a typical super-tall building by using a Synchronous Multi-Pressure Scanning System. The effects of crucial factors such as the type of wind-induced response, the covariance matrix of noise, errors of structural modal parameters and levels of noise involved in the measurements on the wind load estimations are examined through detailed parametric study. The effects of the number of vibration modes on the identification quality are studied and discussed in detail. The made observations indicate that the proposed inverse approach is an effective tool for predicting the wind loads on super-tall buildings.

• International Journal of Aeronautical and Space Sciences
• /
• v.18 no.4
• /
• pp.709-718
• /
• 2017

This paper proposes the guidance laws for an agile turn of air-to-air missiles during the initial boost phase. Optimal solution for the agile turn is obtained based on the optimal control theory with a simplified missile dynamic model. Angle-of-attack command generating methods for completion of agile turn are then proposed from the optimal solution. Collision triangle condition for non-maneuvering target is reviewed and implemented for update of terminal condition for the agile turn. The performance of the proposed method is compared with an existing homing guidance law and the minimum-time optimal solution through simulations under various initial engagement scenarios. Simulation results verify that transition to homing phase after boost phase with the proposed method is more effective than direct usage of the homing guidance law.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.846-848
• /
• 2007

Recently, the most of website is supporting RSS with increasing the interest regarding web 2.0. RSS-reader is collecting the contents of RSS formats which are provided from the various web site and it is software application that assist users easily to getting the last update of area of interest without visiting a corresponding web site. In this paper, we developed RSS reader through Ajax which is an asynchronous method, JSP/Servlet which is a dynamic scripting language. We made them support both RSS format 1.0 and 2.0. Additionally developed fluid Ajax based menus, categories and functions of user-friendliness.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.87-100
• /
• 2004

XML has recently considered as a new standard for data presentation and exchange on the web, many researches are on going to develop applications and index mechanism to store and retrieve XML documents efficiently. In this paper, design a Main-Memory based XML storage system for efficient management of XML document. And propose structured retrieval of XML document tree which reduce the traverse of XML document tree using element type information included user queries. Proposed indexing mechanism has flexibilities for dynamic data update. Finally, for query processing of XML document include Link information, design a index structure of table type link information on observing XLink standards.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1561-1568
• /
• 2005

In client-solver environments, clients can execute applications without contact a server by storing data in its cache. To guarantee correction of applications, we need a cache consistency algorithm. Many cache consistency algorithms have been proposed, these were categorized by detection-based and avoidance-based algorithms. In this paper, we propose a new detection-based cache consistency algorithm that can reduce a burden of a client that has poor resource compare with a server Our method controls concurrency of transactions using timestamp ordering and updates a cache dynamically. In addition to we show that our method maintains a one-copy serializability.