• The Journal of the Korea Contents Association
• /
• v.18 no.1
• /
• pp.465-475
• /
• 2018

Recently, as the use of social media and IoT has increased, large graph streams has been generating and studies on real-time processing for them have been actively carrying out. In this paper we propose a incremental graph stream processing scheme that reuses previous result data when the graph changes continuously. We also propose a cost model to selectively perform incremental processing and static processing. The proposed cost model computes the predicted value of the detection cost and the processing cost of the recalculation area based on the actually processed history and performs the incremental processing when the incremental processing is more profit than the static processing. The proposed incremental processing increases the efficiency by processing only the part that changes when the graph update occurs. Also, by collecting only the previous result data of the changed part and performing the incremental processing, the disk I/O costs are reduced. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.617-621
• /
• 2012

This paper studies asymptotic consensus problem for linear multi-agent systems. We propose a distributed state feedback control algorithm for solving the problem under fixed and undirected network communication. In contrast with the conventional algorithms that use global information (e.g., graph connectivity), the proposed algorithm only uses local information from neighbors. The principle for achieving asymptotic consensus is that, for each agent, a distributed update law gradually increases the coupling gain of LQR-type feedback and thus, the overall stability of the multi-agent system is recovered by the gain margin of LQR.

• The Journal of Korea Robotics Society
• /
• v.8 no.4
• /
• pp.256-265
• /
• 2013

A local map-based exploration algorithm for mobile robots is presented. Segmented frontiers and their relative transformations constitute a tree structure. By the proposed efficient frontier segmentation and a local map management method, a robot can reduce the unknown area and update the local grid map which is assigned to each frontier node. Although this local map-based exploration method uses only local maps and their adjacent node information, mapping completion and efficiency can be greatly improved by merging and updating the frontier nodes. Also, we suggest appropriate graph search exploration methods for corridor and hall environments. The simulation demonstrates that the entire environment can be represented by well-distributed frontier nodes.

• Korean Journal of Oriental Medicine
• /
• v.16 no.2
• /
• pp.91-99
• /
• 2010

In this paper, we designed and implemented a semantic social network system in Korea Institute of Oriental Medicine (abbreviated as KIOM). Our social network system provides the capabilities such as tracking search, ontology reasoning, ontology graph view, and personal information input, update and management. Tracking search provides the search results by the research information of relevant researchers using ontology, in addition to those by keywords. Ontology reasoning provides the reasoning for experts, mentors, and personal contacts. Users can easily browse the personal connections among researchers by traversing the ontology by graph viewer. These allows KIOM researchers to search other researchers who could aid the researches and to easily share their research information.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.10
• /
• pp.33-43
• /
• 2018

In this paper, we propose a method to automatically generate the description of an RDF graph structure. The description is expressed in Shape Expression Language (ShEx), which is developed by W3C and provides the syntax for describing the structure of RDF data. The RDF graphs to which this method can be applied are limited to those generated by the direct mapping, which is an algorithm for transforming relational data into RDF by W3C. A relational database consists of its schema including integrity constraints and its instance data. While the instance data can have been published in RDF by some standard methods such as the direct mapping, the translation of the schema has been missing so far. Unlike the users on relational databases, the ones on RDF datasets were forced to write repeated vague SPARQL queries over the datasets to acquire the exact results. This is because the schema for RDF data has not been provided to the users. The ShEx documents generated by our method can be referred as the schema on writing SPARQL queries. They also can validate data on RDF graph update operations with ShEx validators. In other words, they can work as the integrity constraints in relational databases.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.123-130
• /
• 2004

Routing and wavelength assignment(RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing(WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the Proposed algorithm uses similar or fewer wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP which is currently known to be effective in practice.

• The Journal of Engineering Research
• /
• v.2 no.1
• /
• pp.23-30
• /
• 1997

For a effective management and easy tool integration of CAD database, Hierarchy interface System(HIS) was designed and GROCO(Graph Representation fOr Complex Objects) Model was presented in another my paper[10]. Hierarchy Interface System which is composed of two subsystems of a configurator and a converter is designed for the interface between a conventional database management system and CAD tools. In this paper, Version Management System is presented for supporting effective operations of HIS using GROCO model. Version Management System supports efficiently CAD database charaters having a hierarchical structure of composite objects. In Version Management System, A design evolves in discrete states through mutation and derivation for going phases of design giving rise to multiple versions. Operations and rules are provided transition between their different states. and for controlling update propagation and preventing version proliferation. Version Modeling Graph is proposed for dealing with versioning at the instance and type levels.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.575-579
• /
• 1990

This paper describes an algorithm that can efficiently analyze the multichannel ECG signal using the frame. The input is a set of significant features (points) which have been extracted from an original sampled signal by using the split-and-merge algorithm. A signal from each channel can be hierarchical ADN/OR graph on the basis of the priori knowledge for ECG signal. The search mechanisms with some heuristics and the mixed paradigms of data-driven hypothesis formation are used as the major control mechanisms. The mutual relations among features are also considered by evaluating a score based on the relational spectrum. For recognition of morphologies corresponding to OR nodes, an hypothesis modification strategy is used. Other techniques such as instance, priority update of prototypes, and template matching facility are also used. This algorithm exactly recognized the primary points and supporting points from the multichannel ECG signals.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.721-726
• /
• 2012

In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1126-1135
• /
• 2014

In recent years, RDF partitioning schemes have been studied for the effective distributed storage and management of large-scale RDF data. In this paper, we propose an RDF dynamic partitioning scheme to support load balancing in dynamic environments where the RDF data is continuously inserted and updated. The proposed scheme creates clusters and sub-clusters according to the frequency of the RDF data used by queries to set graph partitioning criteria. We partition the created clusters and sub-clusters by considering the workloads and data sizes for the servers. Therefore, we resolve the data concentration of a specific server, resulting from the continuous insertion and update of the RDF data, in such a way that the load is distributed among servers in dynamic environments. It is shown through performance evaluation that the proposed scheme significantly improves the query processing time over the existing scheme.