• The KIPS Transactions:PartD
• /
• v.18D no.5
• /
• pp.323-328
• /
• 2011

For content-based image retrieval, the earth mover's distance and the optimal color composition distance are proposed to measure the dissimilarity. Although providing good retrieval results, both methods are too time-consuming to be used in a large image database. To solve the problem, we propose a new distance function that calculates an approximate earth mover's distance in linear time. To calculate the dissimilarity in linear time, the proposed approach employs the space-filling curve. We have performed extensive experiments to show the effectiveness and efficiency of the proposed approach. The results reveal that our approach achieves almost the same results with the EMD in linear time.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.10a
• /
• pp.141-148
• /
• 2000

In system design, it is not always possible that all decision makers can cooperate fully and thus avoid conflict. They each control a specified subset of design variables and seek to minimize their own cost functions subject to their individual constraints. However, a system management team makes every effort to coordinate multiple disciplines and overcome such noncooperative environment. Although full cooperation is difficult to achieve, noncooperation also should be avoided as possible. Our approach is to predict the results of their cooperation and generate approximate Pareto set for their multiple objectives. The Pareto set can be obtained according to the degree of one's conceding coupling variables in the other's favor. We employ approximation concept for modelling this coordination and the mutiobjective genetic algorithm for exploring the coupling variable space for obtaining an approximate Pareto set. The approximation management concept is also used for improving the accuracy of the Pareto set. The exploration for the coupling variable space is more efficient because of its smaller dimension than the design variable space. Also, our approach doesn't force the disciplines to change their own way of running analysis and synthesis tools. Since the decision making process is not sequential, the required time can be reduced comparing to the existing multidisciplinary optimization techniques. This approach is applied to some mathematical examples and structural optimization problems.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3689-3696
• /
• 2011

In decision support system, knowledge workers require aggregation operations of the large data and are more interested in the trend analysis rather than in the punctual analysis. Therefore, it is necessary to provide fast approximate answers rather than exact answers, and to research approximate query answering techniques. In this paper, we propose a new approximation query answering method which is based on Fuzzy C-means clustering (FCM) method and Adaptive Neuro-Fuzzy Inference System (ANFIS). The proposed method using FCM-ANFIS can compute aggregate queries without accessing massive multidimensional data cube by producing the KR model of multidimensional data cube. In our experiments, we show that our method using the KR model outperforms the NMF method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4B
• /
• pp.338-344
• /
• 2002

This paper proposes a transient (predictive) connection admission control (CAC) scheme using the transient quality of service (QoS) measure for CDMA cellular systems with bursts On-Off sources. We need an approximate and bounded approach for real-time CAC applications. We derive the transient outage probability as the QoS measure using the Chernoff bound and the refuted large deviation approximation. Numerical results show that the predictive CAC is a promising approach for the multicell CDMA systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.154.2-154
• /
• 2001

This paper presented a adaptation approach based on maximum model distance (MMD) method. This method shares the same framework as they are used for training speech recognizers with abundant training data. The MMD method could adapt to all the models with or without adaptation data. If large amount of adaptation data is available, these methods could gradually approximate the speaker-dependent ones. The approach is evaluated through the phoneme recognition task on the TIMIT corpus. On the speaker adaptation experiments, up to 65.55% phoneme error reduction is achieved. The MMD could reduce phoneme error by 16.91% even when ...

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.99.1-99
• /
• 2001

This paper presented an adaptation approach based on maximum model distance (MMD) method. This method shares the same framework as they are used for training speech recognizers with abundant training data. The MMD method could adapt to all the models with or without adaptation data. If large amount of adaptation data is available, these methods could gradually approximate the speaker-dependent ones. The approach is evaluated through the phoneme recognition task on the TIMIT corpus. On the speaker adaptation experiments, up to 65.55% phoneme error reduction is achieved. The MMD could reduce phoneme error by 16.91% even when only one adaptation utterance is used.

• Proceedings of the Korea Institute of Fire Science and Engineering Conference
• /
• 1997.11a
• /
• pp.369-375
• /
• 1997

At the present time in Russia proper programs of increasing museums fire safety are taking into account their specific character and means are not developed. But the problem of control for fire safety of museums should be solved. In connection with it approximate models for estimation el Level ol Fire Safety are developed on the basis of expert's assessment. Proposed approach permits to choose rational variants of fire safety system for specific museum.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.1
• /
• pp.43-54
• /
• 2014

This paper is concerned with nonlinear evolution differential equations with infinite delay in Banach spaces. Using Kato's approximating approach, existence and uniqueness of strong solutions are obtained.

• The Pure and Applied Mathematics
• /
• v.14 no.4
• /
• pp.283-287
• /
• 2007

An extension of the contraction mapping theorem is provided in a Banach space setting to approximate fixed points of operator equations. Our approach is justified by numerical examples where our results apply whereas the classical contraction mapping principle cannot.