• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.1-18
• /
• 2008

By using previous similar case plans, the case-based planning (CBP) systems can generate efficiently plans for new problems. However, most existing CBP systems show limited functionalities for case retrieval and case generalization. Moreover, they do not allow their users to participate in the process of plan generation. To support efficient memory use and case retrieval, the proposed case-based planning system, JCBP, groups the set of cases sharing the same goal in each domain into individual case bases and maintains indexes to these individual case bases. The system applies the heuristic knowledge automatically extracted from the problem model to the case adaptation phase. It provides a sort of case generalization through goal regression. Also JCBP can operate in an interactive mode to support a mixed-initiative planning. Since it considers and utilizes user's preference and knowledge for solving the given planning problems, it can generate solution plans satisfying more user's needs and reduce the complexity of plan generation.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.2
• /
• pp.199-208
• /
• 2001

The digital map in Korea has been producted and utilized independently according to scales such as 1:1,000, 1:5,000, and 1:25,000. Therefore, whenever we need to obtain the spatial data of other scales, we have to product the digital maps over and over again which it is time-consuming and ineconomic. To solve these problems, it has been accomplished many researches on map generalization to make digital maps in small scale from the master data of large scale. This paper aims to analyze the conversion characteristics of the large scale to the small scale by simplification of map generalization. For this purpose, it is proposed the algorithm for the simplification process of digital map and it is investigated the simplification characteristic of digital map through the experiment on the conversion of 1:5,000 scale into 1:25.000 scale. The results show that Area-Preservation algorithm indicates the good agreement with the original data in terms of the area and features of building layer compared to Douglas-Peucker algorithm and Reumann-Witkam algorithm.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.24 no.4
• /
• pp.382-391
• /
• 2021

Unsupervised domain adaptation often gives impressive solutions to handle domain shift of data. Most of current approaches assume that unlabeled target data to train is abundant. This assumption is not always true in practices. To tackle this issue, we propose a general solution to solve the domain gap minimization problem without any target data. Our method consists of two regularization steps. The first step is a pixel regularization by arbitrary style transfer. Recently, some methods bring style transfer algorithms to domain adaptation and domain generalization process. They use style transfer algorithms to remove texture bias in source domain data. We also use style transfer algorithms for removing texture bias, but our method depends on neither domain adaptation nor domain generalization paradigm. The second regularization step is a feature regularization by feature alignment. Adding a feature alignment loss term to the model loss, the model learns domain invariant representation more efficiently. We evaluate our regularization methods from several experiments both on small dataset and large dataset. From the experiments, we show that our model can learn domain invariant representation as much as unsupervised domain adaptation methods.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.2
• /
• pp.215-223
• /
• 2007

We in this note introduce the concept of NCI rings which is a generalization of NI rings. We study the basic structure of NCI rings, concentrating rings of bounded index of nilpotency and von Neumann regular rings. We also construct suitable examples to the situations raised naturally in the process.

• Korean Journal of Mathematics
• /
• v.23 no.1
• /
• pp.37-46
• /
• 2015

We in this note introduce the concept of semi-IFP rings which is a generalization of IFP rings. We study the basic structure of semi-IFP rings, and construct suitable examples to the situations raised naturally in the process. We also show that the semi-IFP does not go up to polynomial rings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8B
• /
• pp.1078-1084
• /
• 2001

In this paper, fuzzy-ARTMAP neural network is applied for compensating the nonlinearity of satellite communication channel. The fuzzy-ARTMAP is made of using fuzzy logic and ART neural network. By a match tracking process with vigilance parameter, fuzzy ARTMAP neural network achieves a minimax learning rule that minimizes predictive error and maximizes generalization. Thus, the system automatically learns a minimal number of recognition categories, or hidden units, to meet accuracy criteria. Simulation studies are performed over satellite nonlinear channels. The performance of proposed fuzzy-ARTMAP equalizer is compared with MLP-basis equalizers.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.271-278
• /
• 2002

Structural optimization using improved higer-order convex approximation is proposed in this paper. The proposed method is a generalization of the convex approximation method. The order of the approximation function for each constraint is automatically adjusted in the optimization process. And also the order of each design variable is differently adjusted. This self-adjusted capability makes the approximate constraint values conservative enough to maintain the optimum design point of the approximate problem in feasible region. The efficiency of proposed algorithm, compared with conventional algorithm is successfully demonstrated in the Three-bar Truss example.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.147-151
• /
• 1999

This paper extends and enhances the existing inverse kinematics technique using the concept of motion characteristic capturing. Motion characteristic capturing is not about measuring motion by tracking body points. Instead, it starts from pre-measured motion data, extracts the motion characteristics, and applies them in animating other bodies. The resulting motion resembles the originally measured one in spite of arbitrary dimensional differences between the bodies. Motion characteristics capturing is a new principle in kinematic motion generalization to process measurements and generate realistic animation of human being or other living creatures.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.4
• /
• pp.289-294
• /
• 2018

In this work, a recently developed semi-analytic technique, so called the residual power series method, is generalized to process higher-dimensional linear and nonlinear partial differential equations. The solutions obtained takes a form of an infinite power series which can, in turn, be expressed in a closed exact form. The results reveal that the proposed generalization is very effective, convenient and simple. This is achieved by handling the (m+1)-dimensional Burgers equation.

• Journal of Biomedical Engineering Research
• /
• v.42 no.4
• /
• pp.159-166
• /
• 2021

In order to analyze cell images, accurate segmentation of each cell is indispensable. However, the reality is that accurate cell image segmentation is not easy due to various noises, dense cells, and inconsistent shape of cells. Therefore, in this paper, we propose an algorithm that combines marker-based watershed segmentation and ellipse fitting method for glioblastoma cell segmentation. In the proposed algorithm, in order to solve the over-segmentation problem of the existing watershed method, the marker-based watershed technique is primarily performed through "seeding using local minima". In addition, as a second process, the concave point search using ellipse fitting for final segmentation based on the connection line between the concave points has been performed. To evaluate the performance of the proposed algorithm, we compared three algorithms with other algorithms along with the calculation of segmentation accuracy, and we applied the algorithm to other cell image data to check the generalization and propose a solution.