• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.27 no.5
• /
• pp.33-38
• /
• 2013

This paper presents a simpler calculation of the generator load sharing according to the change of system frequency and the droop setting of turbine-generator governor. The author firstly draws a graph based on the generator operation at rated MW output and normal frequency, and secondly, builds a proportional expression using the graph in order to obtain the solution in a simpler way rather than using conventional mathematical calculation, to provide the readers with an easier understanding of the droop setting of turbine-generator governor.

• Kyungpook Mathematical Journal
• /
• v.52 no.1
• /
• pp.13-20
• /
• 2012

In a previous paper, the author proved that all odd cycles, except five cycles, are highly Ramsey-infinite. In this paper, we fill in the missing case, and show that five cycles are highly Ramsey-infinite.

• 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 Security & Cryptology
• /
• v.30 no.6
• /
• pp.1013-1021
• /
• 2020

Malware Authorship Attribution is a research field for identifying malware by comparing the author characteristics of unknown malware with the characteristics of known malware authors. The authorship attribution method using binaries has the advantage that it is easy to collect and analyze targeted malicious codes, but the scope of using features is limited compared to the method using source code. This limitation has the disadvantage that accuracy decreases for a large number of authors. This study proposes a method of 'Defining semantic features from binaries' and 'Defining allowable ranges for redundant features using the concept of survival network' to complement the limitations in the identification of binary authors. The proposed method defines Opcode-based graph features from binary information, and defines the allowable range for selecting unique features for each author using the concept of a survival network. Through this, it was possible to define the feature definition and feature selection method for each author as a single technology, and through the experiment, it was confirmed that it was possible to derive the same level of accuracy as the source code-based analysis with an improvement of 5.0% accuracy compared to the previous study.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3427-3437
• /
• 2000

In this paper,we propose an method of core sciences extractionusing word cooccrrence graph in order to summarize a document. For automatic extraction of core sentenees, we construct a mean cluster from word cooccurrence graph, and find insistence which corresponds a porposed of author. And then we extract keywords by using relationship between mean cluster and isistence. Finally, core senrences are sclected based on keywords and insitances. The esults are evaluated by comparing with manual extraction, and show that the extraction performance is improved about 10%.

• Journal of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1121-1148
• /
• 2017

Go is an ancient game of great complexity and has a huge following in East Asia. It is also very rich mathematically, and can be played on any graph, although it is usually played on a square lattice. As with any game, one of the most fundamental problems is to determine the number of legal positions, or the probability that a random position is legal. A random Go position is generated using a model previously studied by the author, with each vertex being independently Black, White or Uncoloured with probabilities q, q, 1 - 2q respectively. In this paper we consider the probability of legality for two scenarios. Firstly, for an $N{\times}N$ square lattice graph, we show that, with $q=cN^{-{\alpha}}$ and c and ${\alpha}$ constant, as $N{\rightarrow}{\infty}$ the limiting probability of legality is 0, exp($-2c^5$), and 1 according as ${\alpha}$ < 2/5, ${\alpha}=2/5$ and ${\alpha}$ > 2/5 respectively. On the way, we investigate the behaviour of the number of captured chains (or chromons). Secondly, for a random graph on n vertices with edge probability p generated according to the classical $Gilbert-Erd{\ddot{o}}s-R{\acute{e}}nyi$ model ${\mathcal{G}}$(n; p), we classify the main situations according to their asymptotic almost sure legality or illegality. Our results draw on a variety of probabilistic and enumerative methods including linearity of expectation, second moment method, factorial moments, polyomino enumeration, giant components in random graphs, and typicality of random structures. We conclude with suggestions for further work.

• Journal of IKEEE
• /
• v.23 no.3
• /
• pp.941-946
• /
• 2019

In this paper, the author analyzed the PCI (Physical Cell Identification) allocation methods in the LTE (Long Term Evolution) SON (Self Organization Network) environment. A variety of techniques have been proposed for how to allocate PCI, and the LTE standard fundamentally explained that collision between a cell and neighbor cells arise while a cell assign the PCI. Therefore, in this paper, the author examined the scenarios of PCI collision, weak collision, and confusion proposed by LTE specification. In addition, the cell central approach and the distributed approach were discussed as solutions for each scenario. In this paper, the author reviewed the approach of graphic coloring technique which was studied recently and explained the strategy of central approach.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.512-515
• /
• 2009

In this paper, we propose layout based multimodal contents authoring tool for Digilog Book. In authoring step, users create a virtual area using mouse or pen-type device and select property of the area repetitively. After finishing authoring step, system recognizes printed page number and generate page layout including areas and property information. Page layout is represented as a scene graph and stored as XML format. Digilog Book viewer loads stored page layout and analyze properties then augment virtual contents or execute functions based on area. Users can author visual and auditory contents easily by using hybrid interface. In AR environment, system provides area templates in order to help creating area. In addition, proposed authoring tool separates page recognition module from page tracking module. So, it is possible to author many pages using only single marker. As a result of experiment, we showed proposed authoring tool has reasonable performance time in AR environment. We expect that proposed authoring tool would be applicable to many fields such as education and publication.

• The Mathematical Education
• /
• v.57 no.4
• /
• pp.433-452
• /
• 2018

The purpose of this study is to provide implications for improvement of mathematics textbook based on discursive approach to textbook analysis that complementarily combines a communicational approach to cognition and social semiotics. For this purpose, we reconstructed an analytic framework for discursive approach to written discourses of Korean textbook and CMP, and applied it to our analysis. Results show that several characteristics in meanings were developed by the use of words and visual mediators. First, in the case of ideational meaning, there were qualitative and quantitative differences between vocabularies used and between information addressed by visual mediators. Second, in the case of structural meaning, an offer and application of procedure was emphasized in a Korean textbook, whereas expectation and selection experiences of diverse possibilities for problem solving was underlined in CMP. In the case interpersonal meaning of student-author, imperative instructions were paid attentions in a Korean textbook. In contrast, students' interdependence and active participation were stressed in CMP. Therefore, this study addressed ideas about how to analyze mathematics textbooks based on integrated meanings developed by the use of words and visual mediators. In addition, it distributes implications for improvements of Korean mathematics textbooks through the analytic framework of both mathematical meanings and interpersonal meanings of student-author.

• Journal of Oral Medicine and Pain
• /
• v.10 no.1
• /
• pp.63-71
• /
• 1985

A kinematical study of bite force during voluntary isometric contraction was investigated in 20 Korean men with TMJ dysfunction and 30 Korean men as normal subject, ranging from 20 to 27 years old. The author observed maximum bite force, slope of bite force graph, curve index and duration of maximum bite force with the use of the foil strain gauge (MPM-3000) and RS Dymograph (Beckman). The obtained results were as follows : 1. Maximum bite forces were 29kg and 29kg for left and right side of normal subject (p>0.05) and 19kg and 29kg for affected and non-affected side of TMJ dysfunction patient. 2. The slopes of bite force graph were $68^{\circ}$ and $68^{\circ}$ for left and right side of normal subject (p>0.05) and $59^{\circ}$ and $71^{\circ}$ for affected and non-affected side of TMJ dysfunction patient. (p<0.01) 3. The curve indices were 0.93 and 0.90 for left and right side of normal subject and 1.10 and 0.90 for affected and non-affected side of TMJ dysfunction patient. (p>0.05) 4. The durations of maximum bite force were 424 msec and 413 msec for left and right side of normal subject and 337 msec and 334 msec for affected and non-affected side of TMJ dysfunction patient. (p>0.05)