• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.456-458
• /
• 1986

A method for on-line tuning of the PID-controller parameters for a discrete-time multivariable process system is presented. And it is based on a step change in the controller set point. The system is presumed to be a linear, open loop stable and known one. The controller parameters are determined by the performance criterion and Fletcher-Powell methods.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.205-210
• /
• 2001

We give a characterization of regular operators that allows us to prove that a bounded operator acting between Banach spaces is almost regular if and only if it is regular, solving an open problem in [5]. As an application, we show that some operators in the closure of the set of all regular operators are regular.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.2
• /
• pp.161-165
• /
• 2001

We introduce the concept of mated fuzzy topological spaces and then investigate some of their properties.

• Communications of the Korean Mathematical Society
• /
• v.13 no.1
• /
• pp.73-76
• /
• 1998

It is proved that the partial differential operator $D_x + ix^q D^2_y$ is not locally solvable in any open set which intersects the line x = 0, when $q = - \frac{2l-1}{2k-1}$ is not an integer.

• 한국태양에너지학회:학술대회논문집
• /
• 2011.04a
• /
• pp.293-298
• /
• 2011

The most widely used method to form an electrode in industrial solar cells are screen printing. Screen printing is characterized by a relatively simple and well-known production sequence with high throughput rates. However the method is difficult to implement a fine line width of high-efficiency solar cells can not be made. The open circuit voltage(Voc) and the short circuit current density(Jsc) and fill factor(FF) need to be further improved to increase the efficiency of silicon solar cells. In this study, gravure offset printing method using the multicrystalline-silicon solar cells were fabricated. Gravure off-set printing method which can print the fine line width of finger electrode can have the ability reduce the shaded area and increase the Jsc. Moreover it can make a high aspect ratio thereby series resistance is reduced and FF is increased. Approximately $50{\mu}m$ line width with $35{\mu}m$ height was achieved. The efficiency of gravure off set was 0.7% higher compare to that of scree printing method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.171-177
• /
• 2018

Recently there are many image datasets which has variety of data class and point to extract general features. But in order to this variety data class and point, deep learning model trained this dataset has not good performance in heterogeneous data feature local area. In this paper, we propose the structure which use sub-category and openset object detection methods to train more robust model, named multi-branch tree using ASSL. By using this structure, we can have more robust object detection deep learning model in heterogeneous data feature environment.

• Kyungpook Mathematical Journal
• /
• v.27 no.1
• /
• pp.27-33
• /
• 1987

Minimal s-Urysohn and minimal s-regular spaces are studied. An s-Urysohn (respectively, s-regular) space (X, $\mathfrak{T}$) is said to be minimal s-Urysohn (respectively, minimal s-regular) if for no topology $\mathfrak{T}^{\prime}$ on X which is strictly weaker than $\mathfrak{T}$, (X, $\mathfrak{T}^{\prime}$) is s-Urysohn (respectively s-regular). Several characterizations and other related properties of these classes of spaces have been obtained. The present paper is a study of minimal P-spaces where P refers to the property of being an s-Urysohn space or an s-regular space. A P-space (X, $\mathfrak{T}$) is said to be minimal P if for no topology $\mathfrak{T}^{\prime}$ on X such that $\mathfrak{T}^{\prime}$ is strictly weaker than $\mathfrak{T}$, (X, $\mathfrak{T}^{\prime}$) has the property P. A space X is said to be s-Urysohn [2] if for any two distinct points x and y of X there exist semi-open set U and V containing x and y respectively such that $clU{\bigcap}clV={\phi}$, where clU denotes the closure of U. A space X is said to be s-regular [6] if for any point x and a closed set F not containing x there exist disjoint semi-open sets U and V such that $x{\in}U$ and $F{\subseteq}V$. Throughout the paper the spaces are assumed to be Hausdorff.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.155-164
• /
• 2007

It is the objective of this paper to study further the notion of ${\Lambda}_s$-semi-${\theta}$-closed sets which is defined as the intersection of a ${\theta}$-${\Lambda}_s$-set and a semi-${\theta}$-closed set. Moreover, introduce some low separation axioms using the above notions. Also we present and study the notions of ${\Lambda}_s$-continuous functions, ${\Lambda}_s$-compact spaces and ${\Lambda}_s$-connected spaces.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.12
• /
• pp.1903-1910
• /
• 2012

This paper presents a data based low-order controller design algorithm for a linear time-invariant process with a time delay. The algorithm is composed by combining an identification step based on open loop pulse test with a low-order controller design step to obtain the entire set of controllers achieving multiple performance specifications. The initial information necessary for this algorithm are merely the width and amplitude of a rectangular pulse, a controller of four types (PI, PD, PID, first-order), and design objectives. Various parametric approaches that have been developed are merged in the controller design algorithm. The resulting controller set satisfying the design objectives are displayed on the 2D and 3D graphics and thus it is very easy for us to pick a controller inside the admissible set because we can check the corresponding closed-loop performances visually.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.447-458
• /
• 2003

The basic assumption of conventional data mining methodology is that the data set of a knowledge discovery process should be fixed and available before the process can proceed. Consequently, this assumption is valid only when the static knowledge embedded in a specific data set is the target of data mining. In addition, a conventional data mining method requires considerable computing time to produce the result of mining from a large data set. Due to these reasons, it is almost impossible to apply the mining method to a realtime analysis task in a data stream where a new transaction is continuously generated and the up-to-dated result of data mining including the newly generated transaction is needed as quickly as possible. In this paper, a new mining concept, open data mining in a data stream, is proposed for this purpose. In open data mining, whenever each transaction is newly generated, the updated mining result of whole transactions including the newly generated transactions is obtained instantly. In order to implement this mechanism efficiently, it is necessary to incorporate the delayed-insertion of newly identified information in recent transactions as well as the pruning of insignificant information in the mining result of past transactions. The proposed algorithm is analyzed through a series of experiments in order to identify the various characteristics of the proposed algorithm.