• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.2015-2018
• /
• 2005

In this paper, we are willing to prepare the reasonable optimization, Combinatorial Optimization and Genetic Algorithm. Thus we define position status of end-effect (or terminative link module) using promised form, (G, M(G), A(G), and so on.). For this preparing step, the reorganizing procedure of Link and Joint Module is necessary, like as enumerating the kinematically identical assembly group of several links and joints. Thus, we draw a G, directed graph in a first step. Because, directed graph contains the path information between adjacent Link Module and Joint Module. From the directed graph,G, we can incite the Incidence Matrix, M(G). The incidence matrix, M(G), contains the contact information of the Link (Joint) Module and the type of Link (Joint). At the end of this paper, we generalize the modular information as a matrix form, A(G). From this matrix, we can make a population of assembly status. That is the finial output of this paper.

• Journal of the Korean housing association
• /
• v.19 no.2
• /
• pp.43-54
• /
• 2008

The aim of the research is to find out the direction of unit-plans in multi-dwellings for the future society. Shinonome Canal Court where residents actually live now are the objects in this study, and the residential floor plan of unit-plans were analyzed to find out the typical types. The analysis was focused on the unit-plans of 5 blocks of Shinonome Canal Court. Space Syntax Theory was used as the analysis method. As the first stage of the analysis, justified graphs were made to find out the characters of unit-plans through the classification of the graphs. Contents of the analysis are as follows: Relationship between classified justified graphs and dimension according to node number. Relationship between classified justified graph patterns and unit-plans. Characters of unit-plans in each blocks. Shinonome Canal Court consists of mainly small scale unit-plans and 30unit-plans are classified. 1LDK, 2LDK, 1LDK+S, 1LDK+f are typical unit-plans which are mainly supplied in the complex. It is noted that the results of the analysis by node, justified graph pattern and dimension are the same. It also presents diverse unit-plans which shows a change in nLDK pattern or add f (foyer), AN (annex), S (service room), Fs (free space) to basic nLDK type. In summary, it demonstrates the possibility of creating new residental floor plans in multi-dwellings.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.7
• /
• pp.103-110
• /
• 2008

This paper presents a new approach of recognizing a 3D object using a single camera, based on the extended convex hull of its silhouette. It aims at minimizing the DB size and simplifying the processes for matching and feature extraction. For this purpose, two concepts are introduced: extended convex hull and measurable region. Extended convex hull consists of convex curved edges as well as convex polygons. Measurable region is the cluster of the viewing vectors of a camera represented as the points on the orientation sphere from which a specific set of surfaces can be measured. A measurable region is represented by the extended convex hull of the silhouette which can be obtained by viewing the object from the center of the measurable region. Each silhouette is represented by a relation graph where a node describes an edge using its type, length, reality, and components. Experimental results are included to show that the proposed algorithm works efficiently even when the objects are overlapped and partially occluded. The time complexity for searching the object model in the database is O(N) where N is the number of silhouette models.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.31-44
• /
• 2019

A graph theoretical model called Roman domination in graphs originates from the historical background that any undefended place (with no legions) of the Roman Empire must be protected by a stronger neighbor place (having two legions). It is applicable to military and commercial decision-making problems. A Roman dominating function for a graph G = (V, E) is a function $f:V{\rightarrow}\{0,1,2\}$ such that every vertex v with f(v)=0 has at least a neighbor w in G for which f(w)=2. The Roman domination number of a graph is the minimum weight ${\sum}_{v{\in}V}\;f(v)$ of a Roman dominating function. In order to deal a problem of a Roman domination-type defensive strategy under multiple simultaneous attacks, ${\acute{A}}lvarez$-Ruiz et al. [1] initiated the study of a new parameter related to Roman dominating function, which is called strong Roman domination. ${\acute{A}}lvarez$-Ruiz et al. posed the following problem: Characterize the graphs G with equal strong Roman domination number and Roman domination number. In this paper, we construct a family of trees. We prove that for a tree, its strong Roman dominance number and Roman dominance number are equal if and only if the tree belongs to this family of trees.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.1123-1135
• /
• 1996

In this paper, we introduce some properties of Steinhaus graphs of order n, and prove that the size of some special type of induced cycles in Steinhaus graphs of order n is bounded by $\left\lfloor \frac{n+3}{2} \right\rfloor$.

• Communications of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.113-125
• /
• 2019

In this paper, we introduce the elimination ideal $I_D(G)$ associated to a simple finite graph G. We obtain the upper bound of Castelnuovo-Mumford regularity of elimination ideal for various classes of graphs.

• School Mathematics
• /
• v.9 no.1
• /
• pp.45-64
• /
• 2007

The primary purposes of this study were to investigate how sixth graders would react to the types of tasks with regard to the comprehension of graphs and what differences might be among the kinds of graphs, and to raise issues about instructional methods of graphs. A descriptive study through pencil-and-paper tests was conducted. The tests consisted of 48 questions with 4 types of tasks (reading the data, reading between the data, reading beyond the data, and understanding the situations) and 6 kinds of graphs. The conclusions drawn from the results obtained in this study were as follows: First, it is necessary to foster the ability of interpreting the data and understanding the situation in graphs as well as that of reading the data and finding out the relationships in the data. Second, it is informative for teachers to know students' difficulties and thinking processes. Third, in order to develop understanding of graphs, it is important that students solve different types of tasks beyond simple question-answer tasks. Fourth, teachers need to pay attention to teach fundamental factors such as reading the data with regard to line graphs and stem-and-leaf plots Finally, graph type and task type interact to determine graph-comprehension performance. Therefore, both learning all kinds of graphs and being familiar with multiple types of tasks are important.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4946-4960
• /
• 2020

In a device-to-device (D2D) underlaid cellular network, there exist two types of co-channel interference. One type is inter-layer interference caused by spectrum reuse between D2D transmitters and cellular users (CUEs). Another type is intra-layer interference caused by spectrum sharing among D2D pairs. To mitigate the inter-layer interference, we first derive the interference limited area (ILA) to protect the coverage probability of cellular users by modeling D2D users' location as a Poisson point process, where a D2D transmitter is allowed to reuse the spectrum of the CUE only if the D2D transmitter is outside the ILA of the CUE. To coordinate the intra-layer interference, the spectrum sharing criterion of D2D pairs is derived based on the (signal-to-interference ratio) SIR requirement of D2D communication. Based on this criterion, D2D pairs are allowed to share the spectrum when one D2D pair is far from another sufficiently. Furthermore, to maximize the energy efficiency of the system, a resource allocation scheme is proposed according to weighted graph coloring theory and the proposed ILA restriction. Simulation results show that our proposed scheme provides significant performance gains over the conventional scheme and the random allocation scheme.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.159-168
• /
• 2012

Relation in the new IT environment, such as the SNS, Cloud, Web3.0, has become an important factor. And these relations generate a transaction. However, existing relational database and graph database does not processe graph structure representing the relationships and transactions. This paper, we propose the technique that can be processed concurrently graph structures and transactions in a scalable complex network system. The proposed technique simultaneously save and navigate graph structures and transactions using the Topic Maps data model. Topic Maps is one of ontology language to implement the semantic web(Web 3.0). It has been used as the navigator of the information through the association of the information resources. In this paper, the architecture of the proposed technique was implemented and design using Cassandra - one of column type NoSQL. It is to ensure that can handle up to Big Data-level data using distributed processing. Finally, the experiments showed about the process of storage and query about typical RDBMS Oracle and the proposed technique to the same data source and the same questions. It can show that is expressed by the relationship without the 'join' enough alternative to the role of the RDBMS.

• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.741-746
• /
• 2018

We study the Ihara zeta function of the dumbbell graph $D_{1,1,n}$ of type (1, 1, n) and $D_{1,2,n}$ of type (1, 2, n). Explicit formulas of the zeta functions of the graphs, their radius of convergence, and the connection with the number of closed cycles are given.