• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.439-445
• /
• 1990

All models of dynamical systems invariably have some measure of uncertainties associated with some of their dynamics. The recent approaches to establish robustness of stabilizing feedback control against the possible uncertainties have a serious limitation, that is their applicability only to the systems that satisfy the matching conditions. Such conditions are rarely met in general applications. If a particular system satisfies the matching conditions, the addition of an actuator will destroy the satisfaction of such conditions. In this paper, we develop robust control algorithm for uncertain multivariable systems in which the matching conditions are not necessarily met. We empoly Lyapunov's second method to derive robust stabilizing controllers which guarantee asymptotic stability against prescribed uncertainties. The derivation consists of transforming the original uncertain system to controllable canonical form and constructing a constant switching surface by designing the closed-loop characteristics as a function of the uncertainties. Numerical examples are discussed as illustrations.

• Information Display
• /
• v.19 no.6
• /
• pp.18-23
• /
• 2018

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.50-56
• /
• 2009

This paper proposes a new algorithm of clustering similar nodes defined as nodes having similar characteristic values in pure P2P environment. To compare similarity between nodes, we introduce a fitness function whose return value depends only on the two nodes' characteristic values. The higher the return value is, the more similar the two nodes are. We propose a GORGFM algorithm newly in conjunction with the fitness function to recommend and exchange nodes' characteristic values for an interest group formation and maintenance. With the GORGFM algorithm, the interest groups are formed dynamically based on the similarity of users, and all nodes will highly satisfy with the information recommended and received from nodes of the interest group. To evaluate of performance of the GORGFM algorithm, we simulated a matching rate by the total number of nodes of network and the number of iterations of the algorithm to find similar nodes accurately. The result shows that the matching rate is highly accurate. The GORGFM algorithm proposed in this paper is highly flexible to be applied for any searching system on the web.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.11
• /
• pp.1933-1938
• /
• 2008

There are the frequency shift keying(FSK), phase shift keying(PSK) and amplitude shift keying(ASK) in the conventional digital communications method. In this parer, We proposed the algorithm for wavelet shift keying system using a binary matching filter in the digital communication. Wavelet shift keying system are used to a scaling function(low frequency) and wavelet(high frequency) coefficients. The binary data is encoded by modulator which assigned the scaling function to 1(one), and wavelet to zero(0). Wavelet shift keying of the conventional method needs to a post-processing for the decoding. In this paper, wavelet shift keying signal is reconstructed by the decoder using a binary matching filter. So, it was able to the decoding without the post-processing. It was demonstrated by the experiment that the proposed algorithm is a validity.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.6
• /
• pp.1048-1057
• /
• 2008

This paper represents a design method for PID or low-order controllers cascaded with a linear plant in the unit feedback system where it is required to meet the given time response specifications such as overshoot and settling time. This problem is difficult to solve because the zeros of the controller appear in the numerator of the overall system and thus those zeros may make the time response design difficult. In this paper, we propose a new approach based on the partial model matching and the so called K-polynomial. The partial matching problem is formulated to an optimization problem in which a quadratic function of coefficient errors between a target model and the resulting closed loop system is minimized. For the sake of satisfying the closed loop stability, a set of quadratic constraints associated with the cost function is introduced. As a result, the controller designed meets both time response requirements and the closed loop stability, if any. It is shown through several examples that the present method can be easily applied to these problems.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.6
• /
• pp.1231-1236
• /
• 2006

The contrast control of images with narrow dynamic range is a simple method among enhancement methods for low intensity of image. Histogram equalization is the most common method for this purpose, which stretches the dynamic range of intensity Conventional methods would fail to enhance images with extremely dark and bright regions, because of not considering the shape of histogram. In this paper, we propose a novel adaptive histogram equalization based on histogram matching with multiple Gaussian transformation function. As a result, output images with a couple of peaks of histogram could be improved and the details such as edges in dark regions could be appeared better than conventional method subjectively.

• International journal of advanced smart convergence
• /
• v.11 no.3
• /
• pp.132-141
• /
• 2022

We look at the rocket life stages of NaverZ's metaverse platform scaling and investigate the ignition and scale-up stage of its metaverse platform brand, Zepeto based on the Rocket Model (RM). The results are derived as follows: Firstly, NaverZ shows the event strategy by collaborating with K-pops, the piggybacking strategy by utilizing other SNSs, and the VIP strategy by investing in game and entertainment content genres in the 'attract' function. In the second 'match' function, based on the matching rule of Zepeto, the users can generate their own characters and "World" with Zepeto Studio. However, for strengthening the matching quality, NaverZ is investing in the artificial intelligence (AI) based companies consistently. In the 'connect' function, NaverZ's maximization of the positive interaction is possible by inducing feed activities in Zepeto & other SNSs and by uploading attractive content for viral effects in the ignition. For facilitating this, NaverZ expands the scale to other continents like Southeast Asia and Middle East with the localization strategy inclusive investment. Lastly, in the 'transact' function, based on three monetization experiments like Coin & ZEM, user generated content (UGC) fee, and advertising revenue in the ignition, NaverZ starts to invest in NFT platforms and abroad blockchain companies.

• The Journal of Society for e-Business Studies
• /
• v.8 no.3
• /
• pp.117-130
• /
• 2003

It is not unusual to observe that there Is a great amount of redundant or inconsistent data even within an e-business system such as CRM(Customer Relationship Management) system. This problem becomes aggravate when we construct a system of which information are gathered from different sources. Data quality management is indeed needed to avoid any possible redundant or inconsistent data in such information system. A data quality process, in general, consists of three phases: data cleaning (scrubbing), matching, and integration phase. In this paper, we introduce and categorize data quality operators for each phase. Then, we describe our distance function used in the matching phase, and present a matching algorithm PRIMAL (a PRactical Matching Algorithm). And finally, we present a related work and future research.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2118-2126
• /
• 2017

The large-scale power system blackouts have indicated that conventional protection relays that based on local signals cannot fit for modern power grids with complicated setting or heavily loaded-flow transfer. In order to accurately detect various faulted lines and improve the fault-tolerance of wide-area protection, a novel multi-section weighed fault matching and detecting algorithm is proposed. The real protection vector (RPV) and expected section protection vectors (ESPVs) for five fault sections are constructed respectively. The function of multi-section weighed fault matching is established to calculate the section fault matching degrees between RPV and five ESPVs. Then the fault degree of protected line based on five section fault degrees can be obtained. Two fault detecting criterions are given to support the higher accuracy rate of detecting fault. With the enumerating method, the simulation tests illustrate the correctness and fault-tolerance of proposed algorithm. It can reach the target of 100% accuracy rate under 5 bits error of wide-area protections. The influence factors of fault-tolerance are analyzed, which include the choosing of wide-area protections, as well as the topological structures of power grid and fault threshold.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.167-179
• /
• 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query precessing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verily the superiority of our method, we perform extensive experiments. The results reseal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.