• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2007년도 가을 학술발표논문집 Vol.34 No.2 (D)
• /
• pp.306-311
• /
• 2007

본 논문에서는 Wireless Sensor Network상에서 전체 노드들의 lifetime을 증대시키기 위하여 "random한" 방식으로 cluster-head를 선출하는 LEACH 알고리즘이 가지고 있는 cluster-head 선출 과정에서 선출되는 수와 선출되는 노드들의 위치가 적절히 분산되지 않는 문제를 해결하기 위해 변형된 Graph Coloring 문제를 기반으로 노드의 위치 정보를 사용하지 않고 cluster-head를 적절히 분산하여 선출함으로써 효율적인 clustering을 하는 중앙처리 방식의 새로운 알고리즘 "GCCA : Graph Coloring based Clustering Algorithm for Wireless Sensor Networks" 을 제안한다. GCCA는 cluster-head가 선출되는 수를 일정하게 유지하고 선출되는 노드의 위치가 전체 network area에 적절히 분산되는 효과를 가져 옴으로 LEACH 알고리즘보다 에너지 효율이 증대됨을 실험을 통하여 보인다.

• 전자공학회논문지A
• /
• 제33A권2호
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• 전기전자학회논문지
• /
• 제3권2호
• /
• pp.295-304
• /
• 1999

본 논문에서는 유한체상에서의 다치논리시스템구성을 그래프이론에 기초를 둔 결정도에 의해 구성하는 방법을 제안하였다. 제안한 방법은 먼저 다치논리 Shannon의 확장전개를 토대로 다치논리결정도를 도출하였으며, 부그래프를 적용하여 함수분할을 수행하였다. 그리고 각종 그래프의 동형관계와 정점의 재순서화를 적용하여 결정도의 변수순서선텍알고리즘과 간략화 알고리즘을 제안하였으며 이로부터 최종 다치논리시스템을 설계하는 방법을 제안하였다.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.321-329
• /
• 2007

This paper reports on the application of network analysis approaches to investigate the characteristics of graph representations of Japanese word associations. Two semantic networks are constructed from two separate Japanese word association databases. The basic statistical features of the networks indicate that they have scale-free and small-world properties and that they exhibit hierarchical organization. A graph clustering method is also applied to the networks with the objective of generating hierarchical structures within the semantic networks. The method is shown to be an efficient tool for analyzing large-scale structures within corpora. As a utilization of the network clustering results, we briefly introduce two web-based applications: the first is a search system that highlights various possible relations between words according to association type, while the second is to present the hierarchical architecture of a semantic network. The systems realize dynamic representations of network structures based on the relationships between words and concepts.

• Industrial Engineering and Management Systems
• /
• 제10권4호
• /
• pp.238-246
• /
• 2011

Given a directed graph, we can determine how the user's preference moves from one product item to another. In this graph called "preference transition network", each node represents the product item while its edge pointing to the other nodes represents the transition of user's preference. However, with the large number of items make the network become more complex, unclear and difficult to be interpreted. In order to address this problem, this paper proposes a visualization technique in preference transition analysis based on recency and frequency. By adapting these two elements, the semantic meaning of each item and its transition can be clearly identified by its different types of node size, color and edge style. The experiment in a sales data has shown the results of the proposed approach.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2006년도 추계학술대회 학술발표 논문집 제16권 제2호
• /
• pp.314-317
• /
• 2006

This study proposes an ontology design framework to support the cooperation among devices by using PROLOG, Conceptual Graph (CG), and Resource Description Framework (RDF). Quite a large number of representation languages for representing ontology on the Web have been established over the last decade. Most of these researches are focused on design of independent resources description. In Semantic Web, however, cooperation ontology will be needed. In this study, the CG could make an entire conceptual view of knowledge and RDF can represent that knowledge. Then the PROLOG could support the natural inference based on that knowledge. Therefore, our proposed ontology will be used in the designing of Semantic Web-based cooperation systems.

• 한국멀티미디어학회논문지
• /
• 제24권10호
• /
• pp.1326-1335
• /
• 2021

As part of the cell division method, we proposed a method for segmenting images generated by topography microscopes through deep learning-based feature generation and graph segmentation. Hybrid vector shapes preserve the overall shape and boundary information of cells, so most cell shapes can be captured without any post-processing burden. NIH-3T3 and Hela-S3 cells have satisfactory results in cell description preservation. Compared to other deep learning methods, the proposed cell image segmentation method does not require postprocessing. It is also effective in preserving the overall morphology of cells and has shown better results in terms of cell boundary preservation.

• 대한임베디드공학회논문지
• /
• 제14권4호
• /
• pp.219-226
• /
• 2019

One of the most widely studied protocols for tactical ad-hoc networks is Optimized Link State Routing Protocol (OLSR). As for OLSR research, most research work focus on reducing control traffic overhead and choosing relay point. In addition, because OLSR is mostly dependent on link detection and propagation, dynamic Hello timer become research challenges. However, different timer interval causes imbalance of link validity time by affecting link lifetime. To solve this problem, we propose a weighted topology graph model for constructing a robust network topology based on the link validity time. In order to calculate the link validity time, we use control message timer, which is set for each node. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in small networks.

• 한국전자통신학회논문지
• /
• 제18권4호
• /
• pp.709-714
• /
• 2023

유연한 planning system은 로봇이 다양한 임무를 수행하기 위해서 중요한 요소이다. 본 논문에서는 변화하는 환경에 대응할 수 있는 automated planning system architecture를 소개한다. 심볼릭 기반의 task planning을 위해 PDDL을 활용하였으며 실시간 환경 정보 업데이트를 위해 그래프 데이터베이스를 이용한다. 제안한 구조는 시나리오 기반 실험을 통해 검증하였다.

• 한국컴퓨터정보학회논문지
• /
• 제14권6호
• /
• pp.91-98
• /
• 2009

본 논문에서는 정보의 중요도나 관련성의 정보에 기반한 퍼지함수를 적용하여 강제적 접근통제정책의 비밀성과 무결성을 보장하였으며, 보안등급을 이용하여 접근권한의 흐름을 통제할 수 있는 흐름정책과 역할그래프 생성 알고리즘을 제시하여 상속특성으로 인한 권한남용문제를 해결하였다. 또한, 상업적인 환경에 적용이 가능하도록 정보특성별로 역할을 그룹핑하여 역할계층을 구성함으로써 새로운 역할을 추가하는 것이 용이하여 다단계 보안시스템에서도 효과적으로 접근통제를 할 수 있을 뿐만 아니라 대규모 보안시스템으로 확장할 수 있는 장점을 갖는다.