• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.871-881
• /
• 2008

In this paper, we study the core stability of the dominating set game which has arisen from the cost allocation problem related to domination problem on graphs. Let G be a graph whose neighborhood matrix is balanced. Applying duality theory of linear programming and graph theory, we prove that the dominating set game corresponding to G has the stable core if and only if every vertex belongs to a maximum 2-packing in G. We also show that for dominating set games corresponding to G, the core is stable if it is large, the game is extendable, or the game is exact. In fact, the core being large, the game being extendable and the game being exact are shown to be equivalent.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.6
• /
• pp.115-123
• /
• 1989

This paper describes a new method of mask compaction to formulate a mixed integer linear programming problem from a user defined stick diagram. By solving this mixed integer program, a compacted and design rule violation free layout is obtained. Also, a new efficient algorithm is given which solves the longest problem in the constraint graph.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.11a
• /
• pp.70-73
• /
• 2017

페이스북 SNS 플랫폼에서 제공하는 데이터 수집 프로토콜을 이용해 콘텐츠들의 인기 점수와 사용자 의견들을 수집하고 수집된 정보를 가공하여 기계학습을 진행한다. 오피니언 데이터를 학습함으로 인해 인간의 관점을 모방하게 되며 결과적으로 콘텐츠의 질을 판단하는 요소로써 작용하도록 한다. 데이터의 수집은 페이스북 측에서 제공하는 Graph API 와 Python 을 이용하여 진행한다. Graph API 는 HTTP GET 방식의 프로토콜을 이용하여 요청 하고 JSON 형식으로 결과를 반환한다. 학습은 Multiple Linear Regression 과 Gradient Descent Algorithm(GDA)을 사용하여 진행한다. 이후 학습이 진행된 프로그램에 사용자 의견 데이터를 건네주면 최종인기 점수를 예측하는 시스템을 설명한다.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.5
• /
• pp.1620-1634
• /
• 1991

본 연구에서는 전기/자기 및 기계적 요소들이 복합되어 이루어진 자기부상 시 스템의 설현을 위한 기초단계로서 제어동역학(controlled dynamics) 측면에 입각한 모 델식을 본드선도 기법을 이용하여 보다 조직적으로 유도한다. 우선, 자속흐름 확장 및 자속 유출량을 고려하여 부상 시스템을 모델링하고 차량/레일 및 2차 현가(second ary suspension)장치를 포함한 자기부상 시스템을 모델링한다. 다음, 지지 및 안내 방향의 동역학을 동시에 고려한 2차원 자기부상 시스템을 본드선도의 다접점 필드(mu- ltiport field) 개념을 이용하여 모델링한다. 끝으로, 본드선도 기법으로 모델링된 2차원 자기부상 시스템의 안정도와 성능을 향상시키기 위하여 LOG/LTR(linear quadra- tic Gaussian control with loop transfer recovery) 제어시스템을 설계한다. LQG/ LTR 제어방법은 Doyle과 Stein에 의해 인성(stability-robustness) 문제와 주파수역 성능을 설계시에 직접 고려할 수 있는 강력한 선형 다변수 제어시스템 설곕방법으로 현재 널리 사용되고 있다.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.47-52
• /
• 2016

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

• Journal of the Korean Society of Safety
• /
• v.12 no.4
• /
• pp.180-190
• /
• 1997

A new method in the fault tree analysis (FTA) for the reliability calculation is suggested. Two steps are necessary in traditional method in evaluation of the occurrence probability of top event in fault tree (FT). The first step is to find the minimal outsets, and the second one is to substitute the result into the poincare equation. In order to reduce the enormous computing time of this method, lots of rapid algorithms have been developed. Almost of all achievements were, however, based on the partial structural properties of FT. In this paper, the FT is transformed to a non-linear graph G which has the same minimal outsets of original n, and then the reliability is calculated using the domination theory. In this new method, the required number of equation terms are at most $2^n$ (n is node number of graph G), while $2^m$-1 (m is the number of minimal cutsets) calculation terms are required in the poincare equation in traditional method. Since m>>n in general. our new method reduces the calculation time significantly.

• Journal of the Korean School Mathematics Society
• /
• v.2 no.1
• /
• pp.93-104
• /
• 1999

The subject of this study was the graph of relation of direct inverse proportion, linear function and quadratic function in the 1st, 2nd and 3rd grade of current middle school mathematics curriculum. GSP materials were developed to simplify the principle, trait and characteristics of graphs and make them easier to understand. The overall aim of the materials is to improve the effectiveness of teaching and learning through the utilization of enhanced students' practice. Additionally, the use of the GSP will be useful in the development of mere effective materials. The effectiveness of the GSP materials will be as followings. 1. The step by step approach of GSP materials through computer interaction will enhance students motivation and interest in mathematics. 2. By presenting the subject matter simply and in a variety of ways, difficult concepts can be understood without the use of complex mathematical calculation. 3. The GSP program is different from CAI and other software programs. It should be used only after learning how to input and output data.

• Industrial Engineering and Management Systems
• /
• v.2 no.1
• /
• pp.35-44
• /
• 2003

Recovery of end-of-life (EOL) products is an environmentally and economically sound way to achieve many of the goals of sustainable development. Many product recovery systems are dependent upon destructive disassembly such as shredding, which undesirably causes a large volume of shredder dust and makes parts reuse impossible. Although non-destructive disassembly has been considered as an alternative for solving the problems, the classification of disassembled items has not been sufficiently investigated. In this paper, we propose a model that mathematically optimizes the disassembly and classification of EOL products. Based on the AND/OR graph that illustrates all possible disassembly sequences of a given product, we identify the physical properties that are considered as constraints in the model. As a result of the solution procedure, the recovery problem can be transformed into a mixed integer linear programming (MILP) model. We show an example that illustrates the concept of our model.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.2
• /
• pp.37-40
• /
• 2015

In this paper, we present linear, varied and mixed edge labeling methods using 2-edge labeling on binomial trees. As a result of this paper, we can design the variable topologies to enable optimal broadcasting with binomial tree as spanning tree, if we use these edge labels as the jump sequence of a sort of interconnection networks, circulant graph, with maximum connectivity and high reliability.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.661-669
• /
• 2021

For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum f(V) = ∑_v∈V f(v). The minimum weight of a PRDF is called the perfect Roman domination number, denoted by γ_R^P(G). Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bipartite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.