• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.7
• /
• pp.720-728
• /
• 1990

A learning control method is proposed in this paper, using a knowledge base which contains control rules, data, and patterns of the past experience of a plant. The knowledge for plant control is retrieved from measurement data during operation and continually modified after control performance evaluation. A control method is proposed using tinually modified after control performance evaluation. A control method is proposed using fuzzy model of the plant and a recursive statistic decision method of fuzzy subset for control rule generation. Also, the resulting knowledge-based control algorithm has been applied to aprocess and its performance improvement and proper generation of appropriate control rules have been verified.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.2
• /
• pp.183-191
• /
• 1991

This paper develops a pole-zero assignment self-tuning regulator utilizing the method of a neural network in the plant parameter estimation. An approach to parameter estimation of the plant with a Hopfield neural network model is proposed, and the control characteristics of the plant are evaluated by means of a simulation for a second-order linear time invariant plant. The results obtained with those of Exponentially Weighted Recursive Least Squares(EWRLS) method are also shown.

• Proceedings of the KIEE Conference
• /
• 2005.07c
• /
• pp.2348-2350
• /
• 2005

LHM (Left Handed Material)은 특정 주파수 범위에서 음의 유전율과 투자율을 가지는 물질이며 유효 유전율과 투자율은 분산 특성을 가지고 로렌츠(Lorentz) 물질과 비슷한 형태를 가진다. 본 논문에서는 FDTD (Finite Difference Time Domain) 법을 바탕으로 한 PLRC (Piecewise Linear Recursive Convolution) 법을 이용하여 LHM 내의 유효 전파특성을 모의한다. 모의실험 결과는 음의 유전율과 투자율을 가지는 주파수 범위를 보여준다.

• Bulletin of the Korean Space Science Society
• /
• 2009.04a
• /
• pp.60.2-60.2
• /
• 2009

• Proceedings of the KIPE Conference
• /
• 2014.07a
• /
• pp.542-543
• /
• 2014

In this paper, an estimation scheme based on an augmented sigma-point Kalman filter to estimate the state of charge (SOC) of the battery is presented, where the battery parameters of the series resistance ($R_o$), diffusion capacitance ($C_1$) and resistance ($R_1$) are also estimated through the recursive least squares (RLS) for better accuracy of the SOC. The effectiveness of the proposed method is verified by simulation results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.490-493
• /
• 2006

본 논문은 Linux Cluster의 MPICH에서 MPI_Allgather Algorithm의 성능을 개선하고 실험을 통해 최대 30%의 성능향상을 증명하였다. MPICH의 기존 버전이 메시지의 크기와 실행 프로세스 수에 따라 Recursive Doubling, Bruck Algorithm, Ring Algorithm을 차등 적용했던 것을, 앞의 Algorithm을 개선하여 Double Bruck Algorithm, Double Ring Algorithm을 제안, 구현하였다.

• The Pure and Applied Mathematics
• /
• v.2 no.2
• /
• pp.157-162
• /
• 1995

Let I be the interval, $S^1$ the circle and let X be a compact metric space. And let $C^{circ}(X,\;X)$ denote the set of continuous maps from X into itself. For any f$f\in\;C\circ(X,\;X),\;let\;P(f),\;R(f),\;\Gamma(f),\;\Lambda(f)\;and\;\Omega(f)$ denote the collection of the periodic points, recurrent points, ${\gamma}-limit{\;}points,{\;}{\omega}-limit$ points and nonwandering points, respectively.(omitted)

• Korean Journal of Cognitive Science
• /
• v.3 no.2
• /
• pp.225-248
• /
• 1992

In this paper, word sense disambiguation methods utilizing a knowledge base based on a semantic network are introduced. The basic idea is to keep track of a set of paths in the knowledge base which correspond to the inctemental semantic interpretation of a input sentence. These paths are called the semantic paths. when the parser reads a word, the senses of this word which are not involved in any of the semantic paths are removed. Then the removal operation is propagated through the knowledge base to invoke the removal of the senses of other words that have been read before. This removal operation is called recusively as long as senses can be removed. This is called the recursive word sense removal. Concretion of a vague word's concept is one of the important word sense disambiguation methods. We introduce a method called the path adjustment that extends the conctetion operation. How to use semantic association or syntactic processing in coorporation with the above methods is also considered.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.64-72
• /
• 2004

Multiprotocol Label Switching (MPLS) has been developed as a key technology to enhance the reliability, manageability and overall quality of service of core If networks with connection-oriented tunnel LSP and traffic engineering such as constraint-based routing, explicit routing, and restoration. In this paper, we propose a control bandwidth borrowing scheme that maximizes the utilization of tunnel LSPs or physical links by an extension to the RSVP-TE label distribution protocol. MPLS-based core switching network and VPN services rely on the establishment of connection-oriented tunneled LSPs that are configured or predefined by network management systems. The mechanism of network management system varies from (i) a relatively static LSP establishment accounting, to (ii) a dynamic QoS routing mechanisms. With the use of hierarchical LSPs, the extra bandwidth that is unused by the trunk (outer) LSPs should be fully allocated to their constituent end-to-end user traffic (inner) LSPs in order to maximize their utilization. In order to find out the unused extra bandwidth in tunnel LSP or physical link and redistribute these resources to constituent LSPs, we expend the functionality of RSVP-TE and the found unused extra bandwidth is redistributed with a weight-based recursive redistribution scheme. By the extended RSVP-TE and proposed recursive redistributed scheme, we could achieve the instantaneous maximized utilization of tunnel LSP or physical link suffering from the potential under-utilization problem and guarantee the end-to-end QoS requirements. With the proposed scheme, network manager can manage more effectively the extra available bandwidth of hierarchical LSPs and maximize the instantaneous utilization of the tunneled LSP resources.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2823-2834
• /
• 1998

This paper deals with the problem of one-to-one mapping of $2^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize to total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. We first propose a graph modification technique which transfers the mapping problem in a hypercube multicomputer into the problem of finding a set of maximum cutsets on a given task graph. Using the graph modification technique, we then propose a repeated mapping scheme which efficiently finds a one-to-one mapping of task modules to a hypercube multicomputer by repeatedly applying an existing bipartitioning algorithm on the modified graph. The repeated mapping scheme is shown to be highly effective on a number of test task graphs, it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increase. The proposed algorithm is shown to be very effective for regular graph, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mapping on almost all the regular task graphs considered.