• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1068-1072
• /
• 1991

This paper presents a decentralized model reference adaptive control scheme for an interconnected continuous linear system composed of a number of single-input single-output subsystems in which outgoing interactions pass through the measurement channel and are subject to bounded external disturbance. The scheme can treat the unknown strength of interactions as well as the uncertainty of subsystems.

• Proceedings of the ESK Conference
• /
• 1996.10a
• /
• pp.197-205
• /
• 1996

Unification of neural network with a hierarchical pattern recognition is presented for recognizing large set of objects. A two-step identification procedure is developed for pattern recognition: coarse and fine identification. The coarse identification is designed for finding a class of object while the fine identification procedure is to identify a specific object. During the training phase a course neural network is trained for clustering larger set of reference objects into a number of groups. For training a fine neural network, expert neural network is also trained to identify a specific object within a group. The presented idea can be interpreted as two step identification. Experimental results are given to verify the proposed methodology.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1-8
• /
• 2006

This paper considers an interesting transportation problem where trailers and tractors are involved in moving material. We identified a class of combinatorial optimization problems for minimizing the number of tractors and trailers required to accommodate the transportation needs. Then, we show that the fundamental problem is NP-hard and analyze its properties to develop efficient heuristic to handle the problem effectively.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.659-668
• /
• 1998

In this paper we introduce and study a new class of gen-eralized mildly nonlinear complementarity problems for fuzzy map-pings. We use the change of variabes technique to establish the equivalence between the generalized mildly nonlinear complementar-ity problems and the Wiener-Hopf equations. This equivalence is used to suggest and analyze a number of iterative algorithm for solv-ing the generalized mildly nonlinear complemetarity problems.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.669-690
• /
• 1998

In this paper we develop a new theory of adjoint and symmetric method in the class of general implicit one-step fixed-stepsize methods. These methods arise from simple and natral def-initions of the concepts of symmetry and adjointness that provide a fruitful basis for analysis. We prove a number of theorems for meth-ods having these properties and show in particular that only the symmetric methods possess a quadratic asymptotic expansion of the global error. In addition we give a very simple test to identify the symmetric methods in practice.

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

This paper considers the problem of stabilizing a composite system formed by interconnecting a number of single-input single-output linear continuous systems. The problem is general in the sense that in addition to the standard assumption about the uncertainty of the subsystems, the strength of interconnections is assumed unknown. A method to design a local adaptive feedback control is first presented, and then the resultant closed-loop system is assured to be globally stable. Also, a numerical example is illustrated via computer simulation.

• Journal for History of Mathematics
• /
• v.20 no.4
• /
• pp.85-92
• /
• 2007

In this paper We study Some history and development of Geometry from the early 19th century to the late 20th century.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2164-2167
• /
• 2003

In this paper we propose effective speech recognizer through recognition experiments for three feature parameters(PCA, ICA and MFCC) using SVM(Support Vector Machine) classifier In general, SVM is classification method which classify two class set by finding voluntary nonlinear boundary in vector space and possesses high classification performance under few training data number. In this paper we compare recognition result for each feature parameter and propose ICA feature as the most effective parameter

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.141-152
• /
• 1998

Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.

• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.101-113
• /
• 2000

In this paper, we introduce and study a new class of variational inclusions, called the set-valued quasi variational inclusions. The resolvent operator technique is used to establish the equivalence between the set-valued variational inclusions and the fixed point problem. This equivalence is used to study the existence of a solution and to suggest a number of iterative algorithms for solving the set-valued variational inclusions. We also study the convergence criteria of these algorithms.