• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.59-66
• /
• 2004

We define a SG(String Graph) and an ASG(Alive String Graph) to the purpose to do static analysis. For a life and death judgment, we apply the rule to the situation which the stone is included and not included. We define the rules that are SR(String Reduction), ER(Empty Reduction), ET(Edge Transform), and CG(Circular Graph), when the stone is not included. We define the rules that are DESR(Dead Enemy Strings Reduction) and SCSR(Same Color String Reduction), when the stone is included. We evaluate a SG that it is an ASG or not by using rules. And we use APC(Articulation Point Check) nile according to number of articulation points lot a life and death judgment. The performance of our method has been tested on the problem set IGS_31_counted form the Computer Go Test Collection. The test set contains 11,191 Points and 1,123 Strings. We obtain 92.5% accuracy of Points and 95.7% accuracy of Strings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.1020-1029
• /
• 2008

This paper proposes an high speed pattern matching algorithm and its implementation. The pattern matcher is used to check patterns from realtime input packet. The proposed algorithm can find exact string, range of string values, and combination of string values from input packet at high speed. Given string and rule set are modelled as a state transition graph which can find overlapped strings simultaneously, and the state transition graph is partitioned according to input implicants to reduce implementation complexity. The pattern matcher scheme uses the transformed state transition graph and input packet as an input. The pattern matcher was modelled and implemented in VHDL language. Experimental results show the proprieties of the proposed approach.

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.215-220
• /
• 2009

In this paper, we investigate the generating strings and the number of 2-(edge)connected bipartite Steinhaus graphs.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.331-335
• /
• 2008

In this paper, we investigate the number of ones in rows of Pascal's Rectangle. Using these results, we determine the existence of regular bipartite Steinhaus graphs. Also, we give an upper bound for the minimum degree of bipartite Steinhaus graphs.

• East Asian mathematical journal
• /
• v.26 no.3
• /
• pp.423-427
• /
• 2010

In this paper, we give an upper bound for dominations of Steinhaus graphs, and the domination numbers of the bipartite Steinhaus graphs. Also, we give an upper bound for Nordhaus-Gaddum type result for the bipartite Steinhaus graphs.

• 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.

• Kyungpook Mathematical Journal
• /
• v.43 no.4
• /
• pp.567-577
• /
• 2003

In this paper, we classify the Steinhaus graphs with minimum degree two.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.780-793
• /
• 2022

Large-scale ontology management is one of the main issues when using ontology data practically. Although many approaches have been proposed in relational database management systems (RDBMSs) or object-oriented DBMSs (OODBMSs) to develop large-scale ontology management systems, they have several limitations because ontology data structures are intrinsically different from traditional data structures in RDBMSs or OODBMSs. In addition, users have difficulty using ontology data because many terminologies (ontology nodes) in large-scale ontology data match with a given string keyword. Therefore, in this study, we propose a (graph database-based ontology management system (GOMS) to efficiently manage large-scale ontology data. GOMS uses a graph DBMS and provides new query templates to help users find key concepts or instances. Furthermore, to run queries with multiple joins and path conditions efficiently, we propose GOMS encoding as a filtering tool and develop hash-based join processing algorithms in the graph DBMS. Finally, we experimentally show that GOMS can process various types of queries efficiently.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.1
• /
• pp.67-71
• /
• 2009

Recently, the string non-inclusion related problems have been studied vigorously. Given a set of strings F over a constant size alphabet, consider a string x such that x does not include any string in F as a substring. We call x a Common Non-SuperString(CNSS for short) of F. Among the CNSS's of F, the longest one with finite length is called the Longest Common Non-SuperString(LCNSS for short) of F. In this paper, we first propose a new graph model using prefixes of F. Next, we suggest an O(N)-time algorithm for finding the LCNSS of F, where N is the sum of the lengths of all the strings in F.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.7
• /
• pp.328-333
• /
• 2007

In this paper, we describe characteristics of a movable bridge called the Anjok and propose an improved string model which has delay line controller in physical modeling of the Gayageum. Movable bridge, the Anjok determines the length of vibrating string and transmits the vibration of each string to the body of the Gayageum. We analyze the variations in frequency domain and implement the Anjok model as parametric form using the first-order polynomial fitting in logarithmic scale graph, because the length of string changes fundamental frequency. In order to implement the Anjok model, frequency fitting, tension fitting and frequency fitting using leaky integrator are used. The frequency fitting using leaky integrator has the best results among those. Proposed string model with the Anjok model can represent real tuning system of the real Gayageum and the proposed model could synthesize sounds which is similar to original sounds.