• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.1
• /
• pp.37-47
• /
• 2006

In this paper we characterize the graphs whose inserted graphs are Hamiltonian, and we study the relationship between Hamiltonian graphs and inserted graphs. Also we prove that if a connected graph G contains at least 3 vertices then inserted graph of the square of G is Hamiltonian and if G contains at least 3 edges then the square of inserted graph of G is Hamiltonian.

• Journal of the Chungcheong Mathematical Society
• /
• v.18 no.1
• /
• pp.73-80
• /
• 2005

The aim of the paper is to study the connectivity and the edge-connectivity of inserted graph I(G) of a graph G with the help of connectivity and the edge-connectivity of that graph G.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.302-305
• /
• 2000

This paper proposed an optimal register resource allocation algorithm using graph coloring for minimal register at high level synthesis. The proposed algorithm constructed interference graph consist of the intermediated representation CFG to description VHDL. and at interference graph fur the minimal select color selected a position node at stack, the next inserted spill code and the graph coloring process executes for optimal register allocation. The proposed algorithm proves to effect that result compare another allocation techniques through experiments of bench mark.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.415-420
• /
• 2016

A graph G=(V,E) is called an interval graph with a set V of vertices representing intervals on a line such that there is an edge $(i,j){\in}E$ if and only if intervals i and j intersect. In this paper, we are concerned in the vertex connectivity, one of various characteristics of the graph. Specifically, the vertex connectivity of an interval graph is represented by the overlapping of intervals. Also we propose an efficient algorithm to compute the vertex connectivity on the fully dynamic environment in which the vertices or the edges are inserted or deleted. Using a special kind of interval tree, we show how to compute the vertex connectivity and to maintain the tree in O(logn) time when a new interval is added or an existing interval is deleted.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2000.11a
• /
• pp.267-270
• /
• 2000

This paper describes measurement of relative permittivity of illite found in young-dong area. A measurement of relative permittivity of illite used to cylindrical cavity resonators with moveable cap. A concentric dielectric-rod inserted cylindrical cavity resonator and an exact field representation of travelling wave mode are introduced for measurement of relative permittivity. The exact electromagnetic fields in cylindrical cavity with concentric dielectric rod is analysed. A relative permittivity of dielectric in cavity is calculated by analyzing the characteristic equation. The characteristic equation is solved by using the ContourPlot graph of Mathematica. We know that the field representation of travelling mode is exact. As a result, relative permittivity of dielectric materials were 7.820 at sample-1 and 7.894 at sample-2.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.493-501
• /
• 2020

For the obfuscation of Flow Analysis on the Android operating system, the size of the Flow Graph can be large enough to make analysis difficult. To this end, a library in the form of aar was implemented so that it could be inserted into the application in the form of an external library. The library is designed to have up to five child nodes from the entry point in the dummy code, and for each depth has 2n+1 numbers of methods from 100 to 900 for each node, so it consists of a total of 2,500 entry points. In addition, entry points consist of a total of 150 views in XML, each of which is connected via asynchronous interface. Thus, the process of creating a Inter-procedural Control Flow Graph has a maximum of 14,175E+11 additional cases. As a result of applying this to application, the Inter Procedure Control Flow Analysis too generates an average of 10,931 edges and 3,015 nodes with an average graph size increase of 36.64%. In addition, in the APK analyzing process showed that up to average 76.33MB of overhead, but only 0.88MB of execution overhead in the user's ART environment.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1009-1012
• /
• 1998

An efficient algorithm for clock skew optimization is proposed in this paper. It construct a new clock routing topology which is the generalized graph model while previous methods uses tree-structured routing topology. Edge-insertion technique is used in order to reduce the clock skew. A link-edge is inserted repeatedly between two sinks whose delay difference is large and the distance is small. As a result, the delay of a sink which has the longer delay is decreased and the clock skew is reduced. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the total wire length minimization under the given skew bound.

• The Journal of the Korean dental association
• /
• v.12 no.9
• /
• pp.691-694
• /
• 1974

The trends of restoration on abrased teethis mostly based on gnathology or on practical experience. This study was performed on plaster models from 60 young men whose teeth and occlusion are clinically normal. A pair, upper and lower models, were mounted on HANAU articulator. Iron ball bearing 0.2mm 0.5mm 0.7mm and 1.0mm in diameter was attached on mesiobuccal cusp of upper first molar. [table I] Long ribbon shape of cold cure resin was inserted and jaw was closed gently so as not to move disturb original position of iron ball. The resin bite registration was measured minimun thickness from each lingual cusps of upper jaw and buccal cusps of lower jaw by means of Bowley gauge. The results were as follows (graph). 1) The distance from upper lingual cusps and lower buccal cusps: backward cusps showed smaller than standard cusp (upper mesio-buccal cusp) and forward cusps showed longer than standard. 2) The measurements from upper lingual cusps are not coincide with lower buccal cusps.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.692-702
• /
• 2008

Path planning is gaining more weight in computer games and virtual reality as the number of self-moving characters increases. In the roadmap approach, the map of possible paths is built in advance to plan paths for a character, whose advantage is to provide high-quality paths. On the other hand, a disadvantage is that the road map doesn't reflect properties of characters such as their sizes because they move on the same map once the road map is constructed. In this paper we propose an efficient method to build a different road map for each character so that it can use its own map for path-planning. This method is efficient because the whole map is built once by applying the Visibility Graph regardless of the number of characters and walkable paths are incrementally inserted according to the sizes of characters. The effects of using separate roadmaps are demonstrated through simulations and the trade-offs accompanied with these effects are analyzed.

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