• Journal of the Korea Society for Simulation
• /
• v.9 no.4
• /
• pp.41-50
• /
• 2000

We have many simulation constraints to meet as a modeled system becomes large and complex. Real-time simulations are the examples in that they are constrained by certain non-function constraints (e.g., timing constraints). In this paper, an enhanced hierarchical modeling methodology is proposed to efficiently deal with constraint-simulations. The proposed modeling method enhances hierarchical modeling methods to provide multi-resolution model. A simulation model is composed by determining the optimal level of abstraction that is guaranteed to meet the given simulation constraints. Four modeling activities are defined in the proposed method: 1) Perform the logical architectural design activity to produce a multi-resolution model, 2) Organize abstraction information of the multi-resolution model with AT (Abstraction Tree) structure, 3) Formulate the given constraints based on U (Integer Programming) approach and embrace the constraints to AT, and 4) Compose a model based on the determined level of abstraction with which the multi-resolution model can satisfy all given simulation constraints. By systematically handling simulation constraints while minimizing the modeler's interventions, we provide an efficient modeling environment for constraint-simulations.

• Journal of Korean Society of Rural Planning
• /
• v.11 no.1 s.26
• /
• pp.9-15
• /
• 2005

Preservation of geometrical context of terrains in a digitized format is useful in handling and making modification to the data. Digitization of three-dimensional terrain still proves a great challenge due to heavy load of context required to retain details of topological and geometrical information. Methods of simplification, restoration and multi-level terrain generation are often employed to transform the original data into a compressed digital format. However, reduction of the stored data size comes at an expense of loss of details in the original data set. This article reports on an alternative scheme for simplification and restoration of terrain data. The algorithm utilizes the fact that the terrain formation and patterns can be predicted and modeled through the fractal algorithm. This method was used to generate multi-level terrain model based on NGIS digital maps with preserving geometrical context of terrains.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.103-129
• /
• 1998

Corporate level decision making with multiple decision makers in a consistent way is essential in Decision Support System. However, since the decision makers have different interests and knowledge, the models used by them are also different in their level of abstraction. This makes decision makers waste a lot of efforts for an integrated decision making. The purpose of this paper is to propose an integration mechanism so that collaborative decision making models may be used synthetically in multi-abstraction level. Models are classified as multimedia model, mathematical model, qualitative model, causal ＆ directional model, causal model, directional model and relationship model according to the level of abstraction. The proposed integration mechanism consists of model interpretation phase. model transformation phase, and model integration phase. Specifically, the model transformation Phase is divided into (1) model tightening mode which gather information to make a model transformed into upper level model, and (2) model relaxing mode which makes lower level model. In the model integration phase, models of same level are to be integrated schematically. An illustrative M＆A-decision example is given to show the possibility of the methodology.

• Spatial Information Research
• /
• v.10 no.3
• /
• pp.421-438
• /
• 2002

Abstraction of geographic data within a spatial database context must deal with geometrical simplification, modification or maintenance of the integrity of features, spatial and aspatial data, topology within class, and relationships between classes. This research is to propose a method to abstract a spatial database into a high level database. This study refines operators to carry out the modifications required by the abstraction process in the spatial database. Then, a set of operator sequences (workflows) is suggested to specify operators required to abstract a given feature class and to arrange them in order. Finally, a prototype system is developed, based on rule management with a graphic user interface. When the abstraction process is implemented sequentially we demonstrate that a preferential ordering of operations improves efficiency and reduces loss and distortion in the information.

• Journal of Intelligence and Information Systems
• /
• v.10 no.3
• /
• pp.91-103
• /
• 2004

Multi-agent systems for semantic web applications require efficient implementation of agent architectures without sacrificing the flexibility and the level of abstraction that agent architectures provide. In this paper, we present an agent system, called VivAce, which is implemented in Java to achieve both high efficiency and the level of abstraction provided by the BDI agent architecture. VivAce (Vivid Agent Computing Environment) has the characteristics of a vivid agent through the BDI agent model. A vivid agent is a software-controlled system whose state comprises the mental components of knowledge, perceptions, tasks, and intentions, and whose behavior is represented by means of action and reaction rules. We first identify the requirements for multi-agent systems and then present the relevant features of VivAce and experimental results.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.354-360
• /
• 2006

The purpose of this paper is to propose a securely personalized context-aware cooperative query that supports a multi-level data abstraction hierarchy and conceptual distance metric among data values, while considering privacy concerns around user context awareness. The conceptual distance expresses a semantic similarity among data values with a quantitative measure, and thus the conceptual distance enables query results to be ranked. To show the feasibility of the methodology proposed in this paper we have implemented a prototype system in the area of site search in a large-scale shopping mall.

• Asia pacific journal of information systems
• /
• v.8 no.1
• /
• pp.43-64
• /
• 1998

Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention to the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy(KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance, On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, four types of vague queries are discussed, including approximate selection, approximate join, conceptual selection, and conceptual join. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database application systems.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.04b
• /
• pp.262-266
• /
• 1993

The development of COPS(Computer aided Operation Planning System) needs data mapping paradigm which provides intelligent determonation of cutting conditions from the requirements of process planning side. We proposed the idea of multi-level mapping by the combination of heuristics of domain experts and mathematical abstraction of cutting condition and requirements. Mathematical mathods for the generalization of heuristics were constructed by multi-layer perceptron. DBMS for determination of cutting conditions was constructed by classification and combination of best fitted models. Triangular fuzzy number was used to process the uncertainties in heuristics of experts.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.131-156
• /
• 1998

Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering Process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention on the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy (KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance. The KAH consists of two types of knowledge abstraction hierarchies. The value abstraction hierarchy is constructed by abstract values that are hierarchically derived from specific data values in the underlying database on the basis of generalization and specialization relationships. The domain abstraction hierarchy is built on the various domains of the data values and incorporates the classification relationship between super-domains and sub-domains. On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, database operations are discussed for both the generalization and specialization Processes, and the conceptual query handling. A prototype system has been implemented at KAIST that demonstrates the usefulness of KAH in ordinary database application systems.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.87-96
• /
• 2006

Most conventional database systems support specific queries that are concerned only with data that match a query qualification precisely. A cooperative query answering supports query analysis, query relaxation and provides approximate answers as well as exact answers. The key problem in the cooperative answering is how to provide an approximate functionality for alphanumeric as well as categorical queries. In this paper, we propose a metricized knowledge abstraction hierarchy that supports multi-level data abstraction hierarchy and distance metric among data values. In order to facilitate the query relaxation, a knowledge representation framework has been adopted, which accommodates semantic relationships or distance metrics to represent similarities among data values. The numeric domains also compatibly incorporated in the knowledge abstraction hierarchy by calculating the distance between target record and neighbor records.