• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1659-1668
• /
• 1996

Graph grammars generate graph languages while string grammars generate string languages which are the subset of graph languages. One of the most successful graph grammars models is the NLC grammars, which gen-erate graphs by replacing a node by a node by a graph through node labels. For grammars generating hypergraphs which are the superset of graphs, there are CFHG grammars, which replace a hyperedge by a hypergraph through their preidentified gluing points, an extension of CFHG grammars called HH grammars, which replace a handle by a hypergraph through the rewriting mechanism that can also duplicate or delete the hyperedges surrounding the replaced handle, and finally HRNCE grammars, which replace a handle by a hypergraph through an eNCE way of rewriting, In this paper, we compare the language-generating power of HRNCE grammars with that a graph grammars mentioned above by comparing graph langrages generated by them, respecti vely.

• Journal of Advanced Navigation Technology
• /
• v.14 no.6
• /
• pp.975-983
• /
• 2010

In this paper, we introduce extended problems of Tower of Hanoi (ToH) and propose a novel visualization method to express a state space of ToH. As for the extended problems, we introduce multi-peg ToH, multi-stack ToH, and regular state ToH. The novel visualization method in this paper is a natural extension of Hanoi graph visualization. In the proposed method, we assign one Cartesian coordinate point per each disk to provide an unified visualization that the marks on a link and the changes of a state should correspond with a peg position of a disk. Compared with Hanoi graph, the generated graph by the proposed method is isomorphic if we remove links of forbidden move, which indicates that our method is a generalization of Hanoi graph and thus is more expressive. To help the understanding of the readers, we show the generated graphs by our method when the number of disks is 2 and 3.

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.1-21
• /
• 1996

In this paper the existence of spanning 3-trees in every 3-connected locally finite vertex-accumulation-point-free planer graph is verified, which is an extension of D. Barnette to infinite graphs and which improves the result of the author.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.157-162
• /
• 2011

In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.

• Korean Journal of Construction Engineering and Management
• /
• v.16 no.5
• /
• pp.3-11
• /
• 2015

This paper aims to review and discuss a graph-based approach for the representation and analysis of building circulation using BIM models. To propose this approach, the authors survey diverse researches and developments which are related to building circulation issues such as circulation requirements in Korea Building Act, spatial network analysis, as well as BIM applications. As the basis of this paper, UCN (Universal Circulation Network) is the main reference of the research, and the major goal of this paper is to extend the coverage of UCN with additional features we examined in the survey. In this paper we restructured two major perspectives on top of UCN: 1) finding major factors of graph-based circulation analysis based on UCN and 2) restructuring the UCN approach and others for adjusting to Korean Building Act. As a result of the further studies in this paper, two major additions have demonstrated in the article: 1) the most remote point-based circulation representation, and 2) virtual space-based circulation analysis.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.93-100
• /
• 2021

The Ethereum shard system for solving the scalability problem of the blockchain has a load balancing issue, which is modeled as a graph partitioning problem. In this paper, we propose an adaptive online weighted graph partitioning algorithm that can negotiate between two utility of the shard system using the game theory's bargaining solution. The bargaining solution is an axiomatic solution that can fairly determine the points of conflict of utility. The proposed algorithm was improved to apply the existing online graph partitioning algorithm to the weighted graph, and load balancing was performed efficiently through the design considering the situation of the sharding system using the extension of Nash bargaining solution, which is extended to apply solution to non-convex feasible set of bargaining problem. As a result of the experiment, it showed up to 37% better performance than typical load balancing algorithm of shard system.

• Physical Therapy Rehabilitation Science
• /
• v.9 no.4
• /
• pp.287-294
• /
• 2020

Objective: This study aimed to investigate the effects of an ultrasound-based bar graph proportional to the quadriceps muscle thickness as a real-time visual feedback training tool in the elderly. Design: Cross-sectional study. Methods: Twenty-four elderly persons participated in this study and were randomly divided into three groups: oral training group (n=8, group 1), ultrasound imaging group (n=8, group 2), and graph group (n=8, group 3). In the pre condition, all participants performed maximal voluntary isometric contraction (MVIC) of the quadriceps with knee extension three times with oral training. In the post condition, group 1 performed MVIC of the quadriceps with oral training, group 2 performed MVIC of the quadriceps with real-time visual feedback using ultrasound imaging, and group 3 performed MVIC of the quadriceps with real-time visual feedback using a bar graph proportional to the quadriceps muscle thickness, three times for all groups. Muscle thickness, activity (mean, peak), tone, stiffness, logarithmic decrement, relaxation, and creep were measured in both conditions in all participants. Results: Visual feedback with a bar graph showed significant effects on muscle thickness, mean muscle activity, and peak muscle activity compared with oral training and visual feedback with ultrasound imaging (p<0.05). Conclusions: Isometric training of the quadriceps with real-time visual feedback using a bar graph proportional to the quadriceps muscle thickness may be more effective than other methods in improving muscle thickness and muscle activity. This study presented a tool that can help increase muscle thickness in the elderly.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.275-278
• /
• 2008

Recently, there are many research of datamining. On the transaction dataset, association rules is made by finding of interesting patterns. A part of mining, sub-structure mining is increased in interest of and applied to many high technology. But graph mining has more computing time then itemset mining. Therefore, that need efficient way for avoid duplication. GASTON is best algorithm of duplication free. This paper analyze GASTON and expect the future work.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.6 no.3
• /
• pp.34-44
• /
• 1998

It is clear that when an automobile negotiates a curve the lateral acceleration causes an increase in tire normal load for the wheels on the outside of the curve and a decrease in load for the inside wheels. However, just how the details of the suspension linkages and the parameters of the springs and shock absorbers affect the dynamics of the load transfer os not easily understood. One even encounters the false idea that since it is the compression and extension of the main suspension springs spring body role which largely determines the changes in normal load, of roll could be reduced, the load transfer would also be reduced. Using free body diagrams, one can explain quite clearly how the load is transferred for steady state cornering, and, using complex multibody models of particular vehicles one can simulate in good fidelity how load transfer occurs dynamically. Here we adopt a middle ground by using the concept of roll center and using a series of half-car bond graph models to point out main effects. Since bond graph junction structures automatically and consistently constrain geometric and force variables simultaneously, they can be used to point out hidden assumptions of other simplified vehicle models.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.19-24
• /
• 2010

Task scheduling is an integrated component of computing with the emergence of grid computing. In this paper, we address two different task scheduling models, which are static Round-Robin (RR) and dynamic Fastest Site First (FSF) task scheduling method, using extended timed marked graphs, which is a special case of Stochastic Petri Nets (SPN). Stochastic reward nets (SRN) is an extension of SPN and provides compact modeling facilities for system analysis. We build hierarchical SRN models to compare two task scheduling methods. The upper level model simulates task scheduling and the lower level model implements task serving process for different sites with multiple servers. We compare these two models and analyze their performances by giving reward measures in SRN.