• Journal of applied mathematics & informatics
• /
• 제34권1_2호
• /
• pp.49-60
• /
• 2016

In this paper, two different approaches to chromatic number of a bipolar fuzzy graph are introduced. The first approach is based on the α-cuts of a bipolar fuzzy graph and the second approach is based on the definition of Eslahchi and Onagh for chromatic number of a fuzzy graph. Finally, the bipolar fuzzy vertex chromatic number and the edge chromatic number of a complete bipolar fuzzy graph, characterized.

• 한국CDE학회논문집
• /
• 제3권4호
• /
• pp.211-222
• /
• 1998

Parametric design is an important modeling paradigm in CAD/CAM applications, enabling efficient design modifications and variations. One of the major issues in parametric design is to develop a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this appear, we propose a new approach to geometric constraint solving that employs a graph-based method to solve the ruler-and-compass constructible configurations and a numerical method to solve the ruler-and-compass non-constructible configurations, in a way that combines the advantages of both methods. The geometric constraint solving process consists of two phases: 1) planning phase and 2) execution phase. In the planning phase, a sequence of construction steps is generated by clustering the constrained geometric entities and reducing the constraint graph in sequence. in the execution phase, each construction step is evaluated to determine the geometric entities, using both approaches. By combining the advantages of the graph-based constructive approach with the universality of the numerical approach, the proposed approach can maximize the efficiency, robustness, and extensibility of geometric constraint solver.

• 한국차세대컴퓨팅학회논문지
• /
• 제13권2호
• /
• pp.102-110
• /
• 2017

최근 자연어 처리 분야에서 단어의 모호성을 해소하기 위해서 다양한 기계 학습 방법이 적용되고 있다. 지도 학습에 사용되는 데이터는 정답을 부착하기 위해 많은 비용과 시간이 필요하므로 최근 연구들은 비지도 학습의 성능을 높이기 위한 노력을 지속적으로 시도하고 있다. 단어 모호성 해소(word sense disambiguation)를 위한 비지도 학습연구는 지식 기반(knowledge base)를 이용한 방법들이 주목받고 있다. 이 방법은 학습 데이터 없이 지식 기반의 정보을 이용하여 문장 내에서 모호성을 가지는 단어의 의미를 결정한다. 지식 기반을 이용한 방법에는 그래프 기반방식과 유사도 기반 방법이 대표적이다. 그래프 기반 방법은 모호성을 가지는 단어와 그 단어가 가지는 다양한 의미들의 집합 간의 모든 경로에 대한 의미 그래프를 구축한다는 장점이 있지만 불필요한 의미 경로가 추가되어 오류를 증가시킨다는 단점이 있다. 이러한 문제를 해결하기 위해 본 논문에서는 그래프 구축을 위해 불필요한 간선들을 배제하면서 반복적으로 그래프를 재구축하는 모델을 제안한다. 또한, 구축된 의미 그래프에서 더욱 정확한 의미를 예측하기 위해 하이브리드 유사도 예측 모델을 적용한다. 또한 제안된 모델은 다국어 어휘 의미망 사전인 BabelNet을 사용하기 때문에 특정 언어뿐만 아니라 다양한 언어에도 적용 가능하다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 1999년도 추계학술대회-지능형 정보기술과 미래조직 Information Technology and Future Organization
• /
• pp.281-289
• /
• 1999

The objective of this paper is to propose a brand new interface mechanism to provide more intelligent decision making support for EC problems. Its main virtue is based on a numerical process mechanism by using an Extended AND-OR Graph (EAOG)-based logic algebra. Using this mechanism, decision makers engaged in electronic commerce (EC) can effectively deal with complicated decision making problems. In the field of traditional expert systems research, AND-OR Graph approach has been suggested as a useful tool for representing the logic flowchart of the forward and/or backward chaining inference methods. However, the AND-OR Graph approach cannot be effectively used in the EC problems in which real-time problem-solving property should be highly required. In this sense, we propose the EAOG inference mechanism for EC problem-solving in which heurisric knowledge necessary for intelligent EC problem-solving can be represented in a form of matrix. Finally, we have proved the validity of our approach with several propositions and an illustrative EC example

• International Journal of Computer Science & Network Security
• /
• 제24권5호
• /
• pp.33-39
• /
• 2024

In a previous study we proceeded to the remodularization architecture based on classes and packages using the Formal Concept Analysis (FCA)[13] [14] [30]. we then got two possible remodularized architectures and we explored the issue of redistributing classes of a package to other packages, we used an approach based on Oriented Graph to determine the packages that receive the redistributed classes and we evaluated the quality of a remodularized software architecture by metrics [31] [28] [29]. In this paper, we will address the issue of the efficiency of the Oriented Graph in the remodularization of software architectures compared to the Formal Concept Analysis FCA method. The formal method of FCA concept is not popularized among scientists as opposed to the use of the labeled directed graph. It is for this reason that our directed graph approach is more effective in its simplicity and popularity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권3호
• /
• pp.633-652
• /
• 2024

Software testing is an important phase as it ensures the software quality. The software testing process comprises of three steps: generation, execution, and evaluation of test cases. Literature claims the usage of single and multiple 'Unified Modeling Language' (UML) diagrams to generate test cases. Using multiple UML diagrams increases test case coverage. However, the existing approaches show limitations in test case generation from UML diagrams. Therefore, in this research study, we propose an approach to generate the test cases using UML State Chart Diagram (SCD), Activity Diagram (AD), and Sequence Diagram (SD). The proposed approach transforms UML diagrams into intermediate forms: SCD Graph, AD Graph, and SD Graph respectively. Furthermore, by integrating these three graphs, a System Testing Graph (STG) is formed. Finally, test cases are identified from STG by using a traversal algorithm such as Depth First Search (DFS) that is an optimization method. The results show that the proposed approach is better compared to existing approaches in terms of coverage and performance. Moreover, the generated test cases have the ability to detect faults at the unit level, integration, and system level testing.

• 제어로봇시스템학회논문지
• /
• 제22권12호
• /
• pp.1021-1026
• /
• 2016

The graph-based SLAM (Simultaneous Localization and Mapping) approach has been gaining much attention in SLAM research recently thanks to its ability to provide better maps and full trajectory estimations when compared to the filtering-based SLAM approach. Even though graph-based SLAM requires batch processing causing it to be computationally heavy, recent advancements in optimization and computing power enable it to run fast enough to be used in real-time. However, data association problems still require large amount of computation when building a pose graph. For example, to find loop closures it is necessary to consider the whole history of the robot trajectory and sensor data within the confident range. As a pose graph grows, the number of candidates to be searched also grows. It makes searching the loop closures a bottleneck when solving the SLAM problem. Our approach to alleviate this bottleneck is to sample a limited number of pose nodes in which loop closures are searched. We propose a heuristic for sampling pose nodes that are most advantageous to closing loops by providing a way of ranking pose nodes in order of usefulness for closing loops.

• 한국건설관리학회논문집
• /
• 제16권5호
• /
• pp.3-11
• /
• 2015

본 연구는 BIM을 활용한 그래프 기반의 동선 표현과 분석 접근 방법 제안을 목적으로 한다. 접근 방법의 제안을 위해 건물 동선 관련 요구사항 파악과 공간 네트워크, BIM에 관한 선행연구를 분석하였다. 또한, 본 연구는 선행연구인 UCN(Universal Circulation Network)을 기반으로 연구를 진행하였으며, 본 연구를 통해 UCN에 추가적으로 고려해야 할 사항을 파악하고 이를 확장하였다. 본 연구에서는 UCN을 기반으로 두 가지 관점에서 동선의 표현과 분석 접근 방법을 제안하고자한다: 1) UCN의 그래프 기반 동선 분석의 주요 요소를 파악한다, 2) 국내 건축법 등의 요구사항을 적용하여 UCN을 재구성한다. 결과적으로, 본 연구에서는 출구에서 가장 먼 점 (MRP) 기반의 동선 표현과 가상공간에서의 동선 분석이 추가적으로 제안되었다.

• 한국CDE학회논문집
• /
• 제6권2호
• /
• pp.78-88
• /
• 2001

In order to adopt feature-based parametric modeling, CAD/CAM applications must have a geometric constraint solver that can handle a large set of geometric configurations efficiently and robustly. In this paper, we describe a graph constructive approach to solving geometric constraint problems. Usually, a graph constructive approach is efficient, however it has its limitation in scope; it cannot handle ruler-and-compass non-constructible configurations and under-constrained problems. To overcome these limitations. we propose an algorithm that isolates ruler-and-compass non-constructible configurations from ruler-and-compass constructible configurations and applies numerical calculation methods to solve them separately. This separation can maximize the efficiency and robustness of a geometric constraint solver. Moreover, the solver can handle under-constrained problems by classifying under-constrained subgraphs to simplified cases by applying classification rules. Then, it decides the calculating sequence of geometric entities in each classified case and calculates geometric entities by adding appropriate assumptions or constraints. By extending the clustering types and defining several rules, the proposed approach can overcome limitations of previous graph constructive approaches which makes it possible to develop an efficient and robust geometric constraint solver.

• 한국컴퓨터정보학회논문지
• /
• 제14권10호
• /
• pp.251-258
• /
• 2009

그래프마이닝에서 그래프패턴의 동형판단문제는 지수함수적 계산시간을 요구하기 때문에 그래프마이닝의 전체수행시간에서 동형판단 연산이 차지하는 비율이 매우 높다. 그러므로 그래프마이닝 알고리즘은 그래프동형판단을 최대한 효율적으로 할 필요가 있다. 본 논문은 그래프마이닝에서 빠른 수행시간을 보이는 gaston 알고리즘의 동형판단효율성을 증가시켜 수행시간을 평가해 보았으며, 제시한 방법으로 인해 더욱 향상된 성능을 보인다.