• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2005.11a
• /
• pp.255-258
• /
• 2005

In this paper, we verify that the bandwidth of the optimized disk-loaded monopole antenna with electromagnetically coupled feed obtained using a genetic algorithm is broader than the theoretical bandwidth limit of 2/Q by simulation as well as by measurement. The measured bandwidth of the optimized antenna (kr : 0.599) is about 42% from 380 MHz to 580 MHz (VSWR<5.8). The efficiency measurement of the antenna is over 90% for the frequency band of operation.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.3
• /
• pp.182-186
• /
• 2004

In this paper, the cost for capacitive reactive flower is evaluated considering the deregulation environment. For the cost assessment of reactive power, the duration curve of reactive power demand is introduced and investigated. Also, a guideline is suggested to estimate the Q-cost by using the inverse of the Q-demand duration curve. In order to obtain optimal real reactive power allocation, a new algorithm is proposed by using the piecewise linearization of the inverse of the Q-demand duration curve and the Linear Programming technique. The proposed method is tested with sample systems using MATLAB. The test results show that the algorithm yields reasonable reactive power allocation and Provides fair cost evaluation for reactive power.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.44 no.3
• /
• pp.270-273
• /
• 1995

This paper proposes an optimal load shedding algorithm by which the system loss can be minimized when the load shedding is unavoidable in case of severe contingency such as the outage of key generators or lines. Shedding load .DELTA.S = .DELTA.P + J.DELTA.Q(MVA) is performed on the weakest bus (on the view of voltage stability), step by step, by the priority of the I.DELTA. = SQRT(.lambda.$\_$P/$\^$2/ + .lambda.$\_$Q/$\^$2/) index given for each load bus, where .lambda.$\_$P/ and .lambda.$\_$Q/ are the sensitivity indices representing the system loss variation versus active and reactive power change of the bus load bus. All loads are assumed to be constant power loads for convenience. A 5 bus sample system proves the effectiveness of the algorithm proposed.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.282-287
• /
• 2008

In distributed mobile robot systems, autonomous robots accomplish complicated tasks through intelligent cooperation with each other. This paper presents behavior learning and online distributed evolution for cooperative behavior of a group of autonomous robots. Learning and evolution capabilities are essential for a group of autonomous robots to adapt to unstructured environments. Behavior learning finds an optimal state-action mapping of a robot for a given operating condition. In behavior learning, a Q-learning algorithm is modified to handle delayed rewards in the distributed robot systems. A group of robots implements cooperative behaviors through communication with other robots. Individual robots improve the state-action mapping through online evolution with the crossover operator based on the Q-values and their update frequencies. A cooperative material search problem demonstrated the effectiveness of the proposed behavior learning and online distributed evolution method for implementing cooperative behavior of a group of autonomous mobile robots.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.44 no.1
• /
• pp.21-24
• /
• 1995

The larger and the more complicated the system size and configuration grow, the more serious the system loss problem becomes. Exessive system loss causes severs system voltage depression, which even may result in system voltage collapse. This paper proposes an effective tool for minimizing the system power loss by optimal re-location of the static condenser based on the system loss sensitivity index .lambda.$_{Q}$. It is possible to determine the optimal location and amount of VAR investment for minimizing the system loss by priority of .lambda.$_{Q}$ index given for each bus. Several computational techniques for avoiding divergency of the load flow solution are proposed. The loss sensitivity index .lambda.$_{Q}$ uses information of normal power flow equations and their Jacobians. Two case studies proved the effectiveness of the algorithm proposed.posed.

• Korean Journal of Mathematics
• /
• v.30 no.3
• /
• pp.533-538
• /
• 2022

Cryptography is one of the most essential developing areas, which deals with the secure transfer of messages. In recent days, there are more number of algorithms have been evolved to provide better security. This work is also such an attempt. In this paper, an algorithm is presented for encryption and decryption which employs the matrix Q^p* and the well- known equation x² - py² = 1 where p is a prime.

• Journal of the Korean Statistical Society
• /
• v.16 no.1
• /
• pp.1-9
• /
• 1987

Recently a new form of the extended Yule-Walker equations for a mixed autoregressive moving-average process of orders p and q has been proposed. It can be used to obtain p+q+1 parameter values from the first p+q+1 autocovariance terms. The autoregressive part of the equations is linear and can be easily solved. In contrast the moving-average part is composed of nonlinear simultaneous equations. Thus some iterative algorithms are necessary to solve them. The iterative algorithm presented by Choi(1986) is very simple but its convergence has not been proved yet. In this paper a Newton-Raphson solution for the moving-average parameters is presented and its convergence is shown. Also numerical example illustrate the performance of the algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1370-1376
• /
• 2000

Consider the problem to updata breadth-First Spanning Tree in response to topology change of the network. The paper proposes an efficient distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(p√q+q+a+n') respectively, where n' is the number fo processors in the network after the topology change, a is the number of added links, p is the total number of links in the biconnected component (of the network before the topology change) including the detected links or added links, and q is the total number of processors in the biconnected component (of the network before the topology change) including the deleted links or added links, and q is the total number of processors in the biconnected component including the deleted links or added links.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.65-70
• /
• 2001

We consider a hyper-redundant system that consists of many uniform units. The hyper-redundant system has many degrees of freedom and it can accomplish various tasks. Applysing the reinforcement learning to the hyper-redundant system is very attractive because it is possible to acquire various behaviors for various tasks automatically. In this paper we present a new reinforcement learning algorithm "Q-learning with propagation of motion". The algorithm is designed for the multi-agent systems that have strong connections. The proposed algorithm needs only one small Q-table even for a large scale system. So using the proposed algorithm, it is possible for the hyper-redundant system to learn the effective behavior. In this algorithm, only one leader agent learns the own behavior using its local information and the motion of the leader is propagated to another agents with time delay. The reward of the leader agent is given by using the whole system information. And the effective behavior of the leader is learned and the effective behavior of the system is acquired. We apply the proposed algorithm to a snake-like hyper-redundant robot. The necessary condition of the system to be Markov decision process is discussed. And the computer simulation of learning the locomotion is demonstrated. From the simulation results we find that the task of the locomotion of the robot to the desired point is learned and the winding motion is acquired. We can conclude that our proposed system and our analysis of the condition, that the system is Markov decision process, is valid.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.232-232
• /
• 2006