• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.3
• /
• pp.1-8
• /
• 1998

This paper proposes a reinforcement genetic programming based on the reinforcement learning method for the performance improvement of genetic programming. Genetic programming which has tree structure program has much flexibility of problem expression because it has no limitation in the size of chromosome compared to the other evolutionary algorithms. But worse results on the point of convergence associated with mutation and crossover operations are often due to this characteristic. Therefore the sizes of population and maximum generation are typically larger than those of the other evolutionary algorithms. This paper proposes a new method that executes crossover and mutation operations based on reinforcement and inhibition mechanism of reinforcement learning. The validity of the proposed method is evaluated by appling it to the artificial ant problem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.475-481
• /
• 2009

The frequency and probability of deadlock are influential factors in the design of algorithms for deadlock. However, little work has been done in this area because it's not easy to analyze how factors such as the characteristics of process or resource, resource request and release patterns, or the number of process affect the occurrence of deadlock. This study was designed to reduce remarkably the number of state by adapting the model 'state (a,b)t' to represent the resource allocation state, as well as to include the effect of resource error rate and recovery rate in the system analysis. Various formulas about deadlock occurrence were resulted in this study such as the average time interval of deadlock, the probability that a process requesting a resource waits or deadlocks, and the probability that a request deadlocks in a cycle of length 2.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.98-113
• /
• 2002

In this paper, we present advanced algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced multi-level successive elimination algorithms(AMSEA) are based on the Multi-level successive elimination algorithm(MSEA)[1]. The first algorithm is that when we calculate the sum of absolute difference (SAD) between the sum norms of sub-blocks in MSEA, we use the partial distortion elimination technique. By using the first algorithm, we can reduce the computations of MSEA further. In the second algorithm, we calculate SAD adaptively from large value to small value according to the absolute difference values between pixels of blocks. By using the second algorithm, the partial distortion elimination in SAD calculation can occur early. So, the computations of MSEA can be reduced. In the third algorithm, we can estimate the elimination level of MSEA. Accordingly, the computations of the MSEA related to the level lower than the estimated level can be reduced. The fourth algorithm is a very fast block matching algorithm with nearly 100% motion estimation accuracy. Experimental results show that AMSEA are very efficient algorithms for the estimation of motion vectors.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.05a
• /
• pp.365-369
• /
• 2006

Interval-valued fuzzy sets were suggested for the first time by Gorzalczang(1983) and Turken(1986). Based on this, Wang and Li extended their operations on interval-valued fuzzy numbers. Recently, Hong(2002) generalized results of Wang and Li and extended to interval-valued fuzzy sets with Riemann integral. Using interval-valued Choquet integrals with respect to a fuzzy measure instead of Riemann integrals with respect to a classical measure, we studied some characterizations of interval-valued Choquet distance(2005). In this paper, we define Choquet distance measure for fuzzy number-valued fuzzy numbers and investigate some algebraic properties of them.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.789-793
• /
• 2005

Interval-valued fuzzy sets were suggested for the first time by Gorzalczang(1983) and Turken(19a6). Based on this, Wang and Li offended their operations on interval-valued fuzzy numbers. Recently, Hong(2002) generalized results of Wang and Li and extended to interval-valued fuzzy sets with Riemann integral. In this paper, using Choquet integrals with respect to a fuzzy measure instead of Riemann integrals with respect to a classical measure, we define a Choquet distance measure for interval-valued fuzzy numbers and investigate its properties.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.4
• /
• pp.65-73
• /
• 1997

This paper proposes a new method of the structure pruning of dynamic recurrent neural networks (DRNN) using evolutionary computations. In general, evolutionary computations are population-based search methods, therefore it is very useful when several different properties of neural networks need to be optimized. In order to prune the structure of the DRNN in this paper, we used the evolutionary programming that searches the structure and weight of the DRNN and evolution strategies which train the weight of neuron and pruned the net structure. An addition or elimination of the hidden-layer's node of the DRNN is decided by mutation probability. Its strategy is as follows, the node which has mhnimum sum of input weights is eliminated and a node is added by predesignated probability function. In this case, the weight is connected to the other nodes according to the probability in all cases which can in- 11:ract to the other nodes. The proposed pruning scheme is exemplified on the stabilization and position control of the inverted-pendulum system and visual servoing of a robot manipulator and the effc: ctiveness of the proposed method is demonstrated by numerical simulations.

• The Journal of the Acoustical Society of Korea
• /
• v.34 no.2
• /
• pp.130-137
• /
• 2015

In this paper, we propose a new Modified Filtered-x Affine Projection Sign Algorithm(MFxAPSA) to improve the convergence speed of the conventional MFxAPSA which has been proposed for active control of impulsive noise. Under the impulsive noise environment, the adaptive algorithms based on the second order moment such as the Filtered-x Least Mean Square(FxLMS) show slow convergence speed or diverge because the noise source tends to have infinite variance. The MFxAPSA is the algorithm derived by applying the Affine Projection Sign Algorithm(APSA) to active noise control. The APSA has an advantage that it does not need the calculation for the inverse matrix, so it may be suitable for the active noise control that requires low computational burden. The proposed MFxAPSA also has APSA's advantage and furthermore, better performance than the conventional MFxAPSA. We carried out a performance comparison of the proposed MFxAPSA with the conventional MFxAPSA. It is shown that the proposed MFxAPSA has the faster convergence speed than the conventional MFxAPSA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.25-33
• /
• 2015

As a reversible Jacket is having the compatibility of two sided wearing, the matrix that both the inside and the outside are compatible is called Jacket matrix, and the matrix is having both inside and outside by the processes of element-wise inverse and block-wise inverse. This concept had been completed by one of the authors Moon Ho Lee in 1989, and finally that resultant matrix has been christened as Jacket matrix, in 2000. This is the most generalized extension of the well known Hadamard matrices, which includes both orthogonal and non-orthogonal matrices. This matrix addresses many problems in information and communication theories. we investigate the properties of the Jacket matrix, i.e. determinants, eigenvalues, and kronecker product. These computations are very useful for signal processing and orthogonal codes design. In our proposal, we provide some results to calculate these values by using a very simple mathematical model with less complexity.

• School Mathematics
• /
• v.16 no.2
• /
• pp.237-257
• /
• 2014

The purpose of this study is to investigate the academic achievement characteristics in terms of proficiency levels through the in-depth analysis of mathematics test items and achievement standards of the National Assessment of Educational Achievement(NAEA) from 2010 to 2012, and to provide suggestions for teaching and assessing mathematics in middle schools. The results showed that 'Advanced level' students could fully understand the concept of mathematical terms and symbols as well as various mathematical properties presented in the national curriculum. However, 'Proficient level' students tended to feel difficult to apply linear function, properties of a plane figure, and a solid figure, while 'Basic level' students seemed to have trouble solving mathematical problems in almost all areas. Thus, it is necessary to identify the mathematical misconceptions that students have and to strengthen teaching, particularly, the areas of number and operation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2007.02a
• /
• pp.105-107
• /
• 2007

최근에 제안되고 있는 원격 서버에 로그인하기 위한 방법은E와 패스워드뿐만 아니라 스마트카드를 함께 사용한다. 기존의 ID 와 패스워드를 사용한 인증은 공격자에 의해 추측이 가능하므로 사용자 가장 공격이 가능하다는 약점을 가지고 있다. 하지만 스마트카드와 ID, 패스워드를 사용하면 ID와 패스워드가 추측가능할지라도 스마트카드를 소지하고 있지 않다면 사용자 가장 공격 (impersonate attack)을 할 수 없다. 이 논문에서는 스마트카드와 ID, 패스워드를 함께 사용하여 원격 서버에 인증과 더불어 안전한 키 교환을 하며, 기존에 다른 논문들에서 언급한 조건들을 모두 만족하면서 안전한 키 교환까지 제안하였다. 기존의 스킴은 해쉬 기반으로 제안 되었으나 이 논문에서 제안한 스킴은 페어링 (pairing) 연산을 기반으로 제안 되었다. 또한, Computational Diffie-Hellman문제를 기반으로 스킴을 제안하여 안전성에 대한 증명이 가능하다 최근에 스마트카드를 사용한 인증에서 요구 되는 성질의 모든 조건을 만족한다는 장점을 가지고 있다.