• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1633-1636
• /
• 2004

최근 유비쿼터스 게임의 성장과 더불어 이기종의 환경에서 새로운 기법들로 보여질 수 있는 연구가 활발히 진행되고 있다. 본 논문에서는 이기종 환경에서 임의의 OpenGL 기반의 PC 게임이나 게임 뷰어가 있는데서 Java3D 형태로 재복원해서 볼 수 있는 방법과 VRML을 사용하여 캡쳐된 장면들을 네비게이션 해 봄으로써 프레임간 오브젝트들의 움직임을 비교 분석할 수 있는 방법을 제안한다. 결과적으로 구조적인 장면 그래프에서 사건을 처리하고, Parser에서 OpenGL Primitive들의 정점 정보를 해석해서 계층구조를 변화시킴으로서 보다 빠른 실시간 렌더링을 구현하고자 한다.

• Journal of the Korea Institute of Building Construction
• /
• v.21 no.6
• /
• pp.701-712
• /
• 2021

As the domestic housing supply problem has been resolved, the apartment construction market has shifted to a consumer-oriented market that wants high quality, and in particular, expectations in the area of finishing quality have increased. Looking at the status of complaints regarding apartment housing defects supplied by Korea Land and Housing Corporation, tile-related complaints are the type occurring the most frequently. While the Ministry of Land, Infrastructure and Transport(MOLIT) is making an ongoing effort to reduce complaints related to defects, through approaches such as drafting amendments to 「Investigation of defects in apartment houses, calculation of repair costs, and standards for determining defects」, the provision of preventive measures has been insufficient. In addition, by reviewing studies, there has been insufficient research to construct a classification system after deriving the characteristics of each type using the qualitative knowledge of experts, various quantitative indicators, and suggesting measures for reduction according to the causes of each type. Therefore, this study will reflect qualitative indicators to use the AHP analysis that makes it easy to identify the relationship between defects by surveying construction experts. Then, by visualizing the weight of 'Possibility of recurrence after repair,' 'Degree of difficulty in repairing defects' and 'Fault frequency' using a radial graph, we will analyze the characteristics of each type of tile construction defect and establish measures for reduction according to the cause. This will improve the quality of the living environment and contribute to the establishment of a system for smooth defect management and reduction of defects in apartment tile construction.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.221-226
• /
• 2004

Ant Colony System(ACS) Algorithm is new meta-heuristic for hard combinational optimization problem. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. Recently, various methods and solutions are proposed to solve optimal solution of graph coloring problem that assign to color for adjacency node($v_i, v_j$) that they has not same color. In this paper introducing ANTCOL Algorithm that is method to solve solution by Ant Colony System algorithm that is not method that it is known well as solution of existent graph coloring problem. After introducing ACS algorithm and Assignment Type Problem, show the wav how to apply ACS to solve ATP And compare graph coloring result and execution time when use existent generating functions(ANT_Random, ANT_LF, ANT_SL, ANT_DSATUR, ANT_RLF method) with ANT_XRLF method that use XRLF that apply Randomize to RLF to solve ANTCOL. Also compare graph coloring result and execution time when use method to add re-search to ANT_XRLF(ANT_XRLF_R) with existent generating functions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.15-40
• /
• 1994

We designed a knowledge-based decision support system for structuring semi-or unstructured problems. Problem structuring involves extraction of the relevant factors from the identified problem, and model construction that represents the relationships among those factors. In this research, we employed a directed graph called Influence Deiagram as a tool for problem structuring. In particular, our proposed system is designed as a shell. Therefore, a decision maker can change the content of the knowledge base to suit his/her own interested domain.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.587-592
• /
• 2002

본 논문에서는 De Bruijn 그래프에 기초한 다중처리기구성의 한 가지 방법을 제안하였다. 제안한 방법에서는 유한체상의 수학적 성질과 그래프의 성질을 사용하여 변환연산자를 제한하였으며, 이들 변환연산자를 이용하여 De Bruijn 그래프의 변환표를 도출하였다. 그리고, 이 변환표로부터 유한체상의 De Bruijn 그래프를 도출하였다. 제안한 다중처리기는 유한체상의 임의의 소수와 양의 정수에 대해 구성할 수 있으며 고장허용컴퓨팅시스템, 파이프라인 시스템, 병렬처리 네트워크, 스위칭 함수와 이의 회로, 차세대 디지털논리시스템 및 컴퓨터구조 중의 하나인 다치디지털논리시스템 등에 적용할 수 있으리라 전망된다.

• Journal of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.475-484
• /
• 2019

We study the set of critical exponents of discrete groups acting on regular trees. We prove that for every real number ${\delta}$ between 0 and ${\frac{1}{2}}\;{\log}\;q$, there is a discrete subgroup ${\Gamma}$ acting without inversion on a (q+1)-regular tree whose critical exponent is equal to ${\delta}$. Explicit construction of edge-indexed graphs corresponding to a quotient graph of groups are given.

• The Journal of Korea Robotics Society
• /
• v.16 no.3
• /
• pp.179-188
• /
• 2021

Construction monitoring is one of the key modules in smart construction. Unlike structured urban environment, construction site mapping is challenging due to the characteristics of an unstructured environment. For example, irregular feature points and matching prohibit creating a map for management. To tackle this issue, we propose a system for data acquisition in unstructured environment and a framework for Intensity and Ambient Enhanced Lidar Inertial Odometry via Smoothing and Mapping, IA-LIO-SAM, that achieves highly accurate robot trajectories and mapping. IA-LIO-SAM utilizes a factor graph same as Tightly-coupled Lidar Inertial Odometry via Smoothing and Mapping (LIO-SAM). Enhancing the existing LIO-SAM, IA-LIO-SAM leverages point's intensity and ambient value to remove unnecessary feature points. These additional values also perform as a new factor of the K-Nearest Neighbor algorithm (KNN), allowing accurate comparisons between stored points and scanned points. The performance was verified in three different environments and compared with LIO-SAM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.5
• /
• pp.468-574
• /
• 1991

In construction of breadth-frist tree, the communication complexity can be reduced by efficent synchronization schemes based on several threshold values, We determine several new threshold values by considering the graph density represented as lognm, where n and m are the number of nodes and links., repectively. When thesethreshold values are used in the synchroization method for constructing distrbuted bradth-first search tree, we can obtain a more efficient algorithm in sparse graphs, and also, this algorithm has vthe same performance for communication complexity in dense graphs.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.69-78
• /
• 1998

This paper presented a method of extracting algorithm for Edge Multiple-Valued Decision Diagrams(EMVDD), a new data structure, from Binary Decision Diagram(BDD) which is resently using in constructing the digital logic systems based on the graph theory. We discussed the function minimization method of the n-variables multiple-valued functions and showed that the algorithm had the regularity with module by which the same blocks were made concerning about the schematic property of the proposed algorithm. We showed the EMVDD of Full Adder by module construction and verified the proposed algorithm by examples. The proposed method has the visible, schematical and regular properties.