• 한국시뮬레이션학회논문지
• /
• 제9권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.

• 농촌계획
• /
• 제11권1호
• /
• 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.

• 한국경영과학회지
• /
• 제23권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
• /
• 제10권3호
• /
• pp.421-438
• /
• 2002

GIS을 활용하는 다양한 응용분야에서 공간데이터베이스의 상세한 정도(추상화 수준)는 그 목적에 따라 달라진다. 추상화 수준이 달라지면 공간자료의 기하학적인 단순화뿐 아니라, 객체(인스턴스), 공간 및 속성 자료, 위상관계, 의미관계 등이 변화되거나 유지되어야 한다. 이와 관련하여 본 연구에서는 원시 공간데이터베이스를 추상화하여 목표데이터베이스를 생성하는 방법을 제시하였다. 공간데이터베이스를 추상화하는 연산자를 재정의하고, 어떤 객체에 어떤 연산자들을 어떤 순서로 적용하여야 하는지에 대한 기준을 제시하고, 이 기준에 따라 워크플로우를 제시하였으며, 프로토타입시스템을 개발하여 타당성을 검토했다.

• 지능정보연구
• /
• 제10권3호
• /
• pp.91-103
• /
• 2004

다중 에이전트 시스템을 바탕으로 구축되는 시맨틱 웹 응용 프로그램은 에이전트 시스템이 제공하는 적절한 수준의 추상화에서 비롯되는 융통성을 유지하면서도 개발 및 운용의 효율성이 요구된다. 본 연구에서는 에이전트 수준의 추상화를 BDI 에이전트 구조를 기반으로 제공하면서 Java 기반 시스템의 효율성을 갖춘 새로운 에이전트 응용 프레임웍인 VivAce(Vivid Agent Computing Environment)를 소개하고 그 효율성을 대규모 에이전트 기반 시뮬레이션을 통하여 보인다. Vivid 에이전트는 소프트웨어에 의해 제어되는 시스템으로서 지식(knowledge), 지각(perception), 임무(task), 의도(intention)를 중심으로 상태(state)를 표현하며 활동(action)과 반응규칙(reaction rule)으로 행위(behavior)를 나타낸다. 본 논문에서는 먼저 에이전트 응용 프레임웍에 필요한 요소를 제시하고 이에 관련된 VivAce의 기능과 특징 및 이를 이용한 실험 결과를 제시한다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2006년도 춘계학술대회
• /
• 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
• /
• 제8권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.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1993년도 춘계학술대회 논문집
• /
• 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.

• 한국경영과학회지
• /
• 제23권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.

• 한국컴퓨터정보학회논문지
• /
• 제11권3호
• /
• pp.87-96
• /
• 2006

데이터베이스 시스템에서 협력적 질의응답이란 질의 내용과 정확히 일치하는 자료뿐만 아니라 좀 더 넓은 인근 범위의 자료 또는 근사적인 자료를 검색해 주는 것을 말한다. 협력적 질의응답은 질의 분석, 질의 유연화, 유연화된 질의에 따른 근사적 자료 제공의 세 단계로 이루어져 있다. 질의 유연화를 수행하기 위해 의미적 관계를 표현하는 지식추상화 방법과 자료 사이의 정량적인 유사도를 거리로 표현하는 방법들이 지식표현 방법으로 사용된다. 본 논문에서는 보다 효과적으로 질의 유연화 단계를 지원하기 위해, 다단계 데이터 추상화 계층과 거리 척도를 지원하는 계량화된 지식추상화 계층(MKAH: Metricized Knowledge Abstraction Hierarchy)을 제안한다. MKAH는 카테고리화 될 수 있는 자료에 대해 질의 유연화를 효과적으로 지원하며 두 값 사이의 정량적인 의미상의 유사도를 제공하여, 질의 결과에 순위가 매겨질 수 있도록 한다. MKAH의 실용성과 효율성을 검증하기 위하여 경력직 검색 분야에 대한 원형 시스템을 구현해보았다. 다양한 실험을 통하여 MKAH가 풍부한 의미 표현이 가능하면서 질적으로도 높은 거리 척도를 제공해 준다는 것을 보였다. 그 결과 MKAH를 채택하는 도메인은 다른 정량적인 숫자 도메인과 호환될 수 있다는 점과, 큰 규모의 시스템을 만드는 데에도 장점이 있음을 확인하였다.