• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.4
• /
• pp.637-644
• /
• 2019

This paper describes an implementation of a graph-based simultaneous localization and mapping(SLAM) method called the General Graph Optimization. The General Graph Optimization formulates the SLAM problem using nodes and edges. The nodes represent the location and attitude of a robot in time sequence, and the edge between the nodes depict the constraint between the nodes. The constraints are imposed by sensor measurements. The General Graph Optimization solves the problem by optimizing the performance index determined by the constraints. The implementation is verified using the measurement data sets which are open for test of various SLAM methods.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.569-572
• /
• 2003

MANET 환경에서 Security Property를 만족하는 라우팅 프로토콜을 Localized Certificated 방식의 매카니즘에 각 노드의 Power 정보를 추가하여 인증 그래프를 형성한다. 요구 기반 라우팅 프로토콜을 인증 그래프를 기반하여 라우팅 패스를 지원하여 임의의 노드를 변조를 막으며 또한 특정 노드에 집중되는 현상을 지양하는 로드 밸런싱의 매카니즘을 제안한다.

• The Journal of the Korea Contents Association
• /
• v.20 no.8
• /
• pp.42-53
• /
• 2020

With the development of social network services, graph structures have been utilized to represent relationships among objects in various applications. Recently, a demand of subgraph matching in real-time graph streams has been increased. Therefore, an efficient approximate Top-k subgraph matching scheme for low latency in real-time graph streams is required. In this paper, we propose an approximate Top-k subgraph matching scheme considering data reuse in graph stream environments. The proposed scheme utilizes the distributed stream processing platform, called Storm to handle a large amount of stream data. We also utilize an existing data reuse scheme to decrease stream processing costs. We propose a distance based summary indexing technique to generate Top-k subgraph matching results. The proposed summary indexing technique costs very low since it only stores distances among vertices that are selected in advance. Finally, we provide k subgraph matching results to users by performing an approximate Top-k matching on the summary indexing. In order to show the superiority of the proposed scheme, we conduct various performance evaluations in diverse real world datasets.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.351-362
• /
• 2002

Along with an asynchronous finite state machine, in short AFSM, a signal transition graph, in short STG, is one of the most widely used behavioral description languages for asynchronous controllers. Unfortunately, STGs are not user-friendly, and thus it is very unwieldy and time consuming for system designers to conceive and describe manually the behaviors of a number of asynchronous controllers which constitute an asynchronous control unit for a target system in the form of STGs. In this paper, we suggest an automatic STG derivation method through a process-oriented method. Since the suggested method considers special properties of STG-based asynchronous logic synthesis very carefully, asynchronous controllers which are synthesized from STGs derived through the suggested method are superior in aspects of area, synthesis time, performance and implementability compared to those obtained through previous methods.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.1
• /
• pp.153-160
• /
• 2022

A greedy algorithm is proposed to select a subset of nodes of a graph for bandlimited graph signals in which each signal value is generated with its weight. Since graph signals are weighted, we seek to minimize the weighted reconstruction error which is formulated by using the QR factorization and derive an analytic result to find iteratively the node minimizing the weighted reconstruction error, leading to a simplified iterative selection process. Experiments show that the proposed method achieves a significant performance gain for graph signals with weights on various graphs as compared with the previous novel selection techniques.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.19-27
• /
• 1991

A new bandwidth reduction algorithm is developed by combining the two-step approach and the frontal ordering scheme. In the two-step approach, finite elements are numbered first, followed by nodal numbering based on the graph theory. The concept of wave front is incorporated into it to control the cardinality of the set of adjacent nodes and the bandwidth to be achieved. They are controlled systematically by rational selection of next candidates with the purpose of getting the smaller bandwidth efficiently. Eighteen meshes are renumbered and the results are compared with those of well-known algorithms. The results demonstrate the efficiency and the reliability of the proposed algorithm.

• Journal of the Korean Society for Railway
• /
• v.12 no.5
• /
• pp.732-737
• /
• 2009

Wind tunnel testing on the real-scale pantograph for high-speed train has been conducted to investigate the aerodynamic characteristic of the pantograph at high-speed. The mid-scale subsonic wind tunnel of Korea Airforce Acamedy with 3.5m width, 2.45m height, and 8.8m length test section has been employed. The test model has been supported above 50cm height from the bottom of test section using vertical strut to eliminate the boundary layer generated from the bottom of the test section. The height of the pantograph has been varied in three cases, in both of the normal running and reverse running modes. The resultant lift forces of the pantograph to catenary system in all the cases have been measured and the relation between the test conditions and the lift forces have been extensively analyzed.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.5
• /
• pp.177-188
• /
• 2018

The scale of graph data has been increased rapidly because of the growth of mobile Internet applications and the proliferation of social network services. This brings upon the imminent necessity of efficient distributed and parallel graph processing approach since the size of these large-scale graphs are easily over a capacity of a single machine. Currently, there are two popular parallel graph processing approaches, vertex-centric graph processing and block centric processing. While a vertex-centric graph processing approach can easily be applied to the parallel processing system, a block-centric graph processing approach is proposed to compensate the drawbacks of the vertex-centric approach. In these systems, the initial quality of graph partition affects to the overall performance significantly. However, it is a very difficult problem to divide the graph into optimal states at the initial phase. Thus, several dynamic load balancing techniques have been studied that suggest the progressive partitioning during the graph processing time. In this paper, we present a load balancing algorithms for the block-centric graph processing approach where most of dynamic load balancing techniques are focused on vertex-centric systems. Our proposed algorithm focus on an improvement of the graph partition quality by dynamically reassigning blocks in runtime, and suggests block split strategy for escaping local optimum solution.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.58-58
• /
• 2023

전 세계 홍수 피해에 노출된 인구가 20년 만에 약 25% 증가한 것으로 나타났는데, 수재해 복구에 드는 비용이 수재해 예방을 위한 비용에 6배에 달했다. 수재해는 비용적인 손실과 아울러 인명피해가 크기 때문에 이를 예방하기 위한 대책 마련이 시급하다. 특히 국내에서 근래 10년간 전체 수재해 중 약 40%가 소하천에서 발생했는데, 이를 해결하는 방안으로 행정안전부와 국립재난안전연구원은 CCTV 기반 자동유량계측기술을 제시했다. 소하천은 홍수도달시간이 매우 짧고 하상이 불규칙하며 표고차가 커 일반적인 수리모형을 이용해 실시간 홍수 예·경보를 위한 홍수량 예측이 어렵다. 또한 대부분의 소하천은 수문 계측이 이뤄지지 않고 있어 하상 특성을 충분히 반영해 홍수량을 산정하기 어려운 문제가 있다. 이에 본 연구에서는 CCTV 기반 자동유량계측기술로부터 수집된 자료들을 이용해 노모그래프를 작성하고 예측강우량만으로 홍수량을 추정해 실시간 홍수 예·경보에 적용할 수 있는 방법을 개발했다. 이때 실시간으로 계측 유량 자료를 반영해 노모그래프를 자동으로 갱신해 예측정확도를 개선할 수 있다. CCTV 기반 자동유량계측기술 검증을 위한 시범 소하천 4개소에 적용한 결과 실시간 자동보정 노모그래프를 이용하면 정확도 향상에 도움을 주는 것으로 나타나 향후 홍수 예·경보를 위한 홍수량 산정에 도움을 줘 수재해를 경감 할 수 있을 것으로 기대된다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.2
• /
• pp.367-374
• /
• 2022

A sampling set selection algorithm is proposed to reconstruct original graph signals from the sampled signals generated on the nodes in the sampling set. Instead of directly minimizing the reconstruction error, we focus on minimizing the upper bound on the reconstruction error to reduce the algorithm complexity. The metric is manipulated by using QR factorization to produce the upper triangular matrix and the analytic result is presented to enable a greedy selection of the next nodes at iterations by using the diagonal entries of the upper triangular matrix, leading to an efficient sampling process with reduced complexity. We run experiments for various graphs to demonstrate a competitive reconstruction performance of the proposed algorithm while offering the execution time about 3.5 times faster than one of the previous selection methods.