• 한국멀티미디어학회논문지
• /
• 제20권3호
• /
• pp.533-542
• /
• 2017

Novels include various character names, depending on the genre and the spatio-temporal background of the novels and the nationality of characters. Besides, characters and their names in a novel are created by the author's pen and imagination. As a result, any proper noun dictionary cannot include all kinds of character names. In addition, the novels translated into Korean have character names consisting of two or more nouns (such as "Harry Potter"). In this paper, we propose a method to extract noun phrases for character names and to cluster the noun phrases into coreferents for the same character name. In the extraction of noun phrases, we utilize KKMA morpheme analyzer and CPFoAN character identification tool. In clustering the noun phrases into coreferents, we construct a directed graph with the character names extracted by CPFoAN and the extracted noun phrases, and then we create name sets for characters by traversing connected subgraphs in the directed graph. With four novels translated into Korean, we conduct a survey to evaluate the proposed method. The results show that the proposed method will be useful for speaker identification as well as for constructing the social network of characters.

• 대한수학회지
• /
• 제53권4호
• /
• pp.795-834
• /
• 2016

The main purpose of this paper is to propose a scheme of a proof of the nonsimpleness of the group $Homeo^{\Omega}$ ($D^2$, ${\partial}D^2$) of area preserving homeomorphisms of the 2-disc $D^2$. We first establish the existence of Alexander isotopy in the category of Hamiltonian homeomorphisms. This reduces the question of extendability of the well-known Calabi homomorphism Cal : $Diff^{\Omega}$ ($D^1$, ${\partial}D^2$)${\rightarrow}{\mathbb{R}}$ to a homomorphism ${\bar{Cal}}$ : Hameo($D^2$, ${\partial}D^2$)${\rightarrow}{\mathbb{R}}$ to that of the vanishing of the basic phase function $f_{\underline{F}}$, a Floer theoretic graph selector constructed in [9], that is associated to the graph of the topological Hamiltonian loop and its normalized Hamiltonian ${\underline{F}}$ on $S^2$ that is obtained via the natural embedding $D^2{\hookrightarrow}S^2$. Here Hameo($D^2$, ${\partial}D^2$) is the group of Hamiltonian homeomorphisms introduced by $M{\ddot{u}}ller$ and the author [18]. We then provide an evidence of this vanishing conjecture by proving the conjecture for the special class of weakly graphical topological Hamiltonian loops on $D^2$ via a study of the associated Hamiton-Jacobi equation.

• Journal of Oral Medicine and Pain
• /
• 제9권1호
• /
• pp.139-145
• /
• 1984

A Kinematical study of bite force during voluntary isometric contraction was investigated in 20 Korean women with TMJ dysfunction and 50 Korean women a normal subject, ranging from 19 to 29 years old. The author observed maximal bite force, slope of bite force graph, curve index and duration of maximal bite force by way of the foil strain guage(MPM-3000) and Dymograph(Beckman). The obtained results were as follows : 1. Maximal bite forces were 26.48kg and 21.38kg for left and right side of normal subject and 12.85kg and 20.70kg for affected and mon-affected side of TMJ dysfunction patients. 2. The slope of bite force graph were 64.69。and 63.83。 for left and right side of normal subject and 53.14。and 69.57。for affected and non-affected side. 3. The curve indexes were 0.54 and 0.80 for left and right side of normal subject and 2.30 and 0.60 for affected and non-affected side. 4. The duration of maximal bite force were 383.12 msec and 393.60 msec for left and right side of normal subject and 345.30 msec and 312.25 msec for affected and non-affected side.

• 수산해양교육연구
• /
• 제21권4호
• /
• pp.586-591
• /
• 2009

The marine traffic accidents go on increasing owing to the increment of marine traffic capacity, and the solutions about these matters are vigorously considering by many researchers. When the watch officer navigates to the narrow channel, bend or an area obscured by an intervening obstruction and around the harbour limit he must follow the planned track. The watch officer can safely navigate along the course laid down only when he alters his course in advance before the new course distance earlier than the course alternation point. If we call this point to be changed in advance a turning bearing, the turning bearing is decided according to the direction and the range from the clearing objects. The turning bearing helps the watch officer to determine whether the ship is at wheel-over position or not. The author in this paper suggest how to make and use a curve graph which is decided according to the direction and the distance from the clearing objects. If the watch officer utilize this curve graph he can judge swiftly and precisely whether his ship is at the wheel - over position or not.

• 동력기계공학회지
• /
• 제9권4호
• /
• pp.202-208
• /
• 2005

The genetic algorithm (GA) which is one of the popular optimum algorithm has been used to solve a variety of optimum problems. Because it need not require the gradient of objective function and is easier to find global solution than gradient-based optimum algorithm using the gradient of objective function. However optimum method using the GA and the finite element method (FEM) takes many computational time to solve the optimum structural design problem which has a great number of design variables, constraints, and system with many degrees of freedom. In order to overcome the drawback of the optimum structural design using the GA and the FEM, the author developed a computer program which can optimize frame structures by using the GA and the generalized transfer stiffness coefficient method. In order to confirm the effectiveness of the developed program, it is applied to optimum design of plane frame structures. The computational results by the developed program were compared with those of iterative design.

• Journal of Information Science Theory and Practice
• /
• 제5권2호
• /
• pp.33-47
• /
• 2017

The aim of the present study is to analyze the present state and evolution of scientific research with regard to the scientific production generated on Facebook. Good analysis proves challenging due to the large number of publications about the topic. That is why we concentrate on Scopus as the information service with the highest coverage on this topic. We performed a bibliometric analysis on Facebook-related research from 2005 to 2016. We identified publication output, subject areas, journals, and countries in order to assess the publication trends and research hotspots in this field. Moreover, an author network graph and a geo map were applied to visualize some research trends. These results provide a basis for better understanding of the development of global Facebook research.

• Perspectives in Nursing Science
• /
• 제16권1호
• /
• pp.12-24
• /
• 2019

Purpose: This study examined the suitability of using text network analysis (TNA) methodology for topic analysis of academic papers related to nursing. Methods: TNA background theories, software programs, and research processes have been described in this paper. Additionally, the research methodology that applied TNA to the topic analysis of the academic nursing papers was analyzed. Results: As background theories for the study, we explained information theory, word co-occurrence analysis, graph theory, network theory, and social network analysis. The TNA procedure was described as follows: 1) collection of academic articles, 2) text extraction, 3) preprocessing, 4) generation of word co-occurrence matrices, 5) social network analysis, and 6) interpretation and discussion. Conclusion: TNA using author-keywords has several advantages. It can utilize recognized terms such as MeSH headings or terms chosen by professionals, and it saves time and effort. Additionally, the study emphasizes the necessity of developing a sophisticated research design that explores nursing research trends in a multidimensional method by applying TNA methodology.

• 대한수학회지
• /
• 제56권2호
• /
• pp.485-505
• /
• 2019

In 1935, D. H. Lehmer introduced and investigated generalized Euler numbers $W_n$, defined by $${\frac{3}{e^t+e^{wt}e^{w^2t}}}={\sum\limits_{n=0}^{\infty}}W_n{\frac{t^n}{n!}}$$, where ${\omega}$ is a complex root of $x^2+x+1=0$. In 1875, Glaisher gave several interesting determinant expressions of numbers, including Bernoulli and Euler numbers. These concepts can be generalized to the hypergeometric Bernoulli and Euler numbers by several authors, including Ohno and the second author. In this paper, we study more general numbers in terms of determinants, which involve Bernoulli, Euler and Lehmer's generalized Euler numbers. The motivations and backgrounds of the definition are in an operator related to Graph theory. We also give several expressions and identities by Trudi's and inversion formulae.

• 현장농수산연구지
• /
• 제6권1호
• /
• pp.143-154
• /
• 2004

본 실험은 기존의 난방 부하 모델식을 검토하고 문제점을 수정 보완하여 국내에 적용 가능한 모델식을 선정하고 지역별 온실내 목표온도에 따른 Degree hour 값을 결정하기 위하여 수행하였다. 국내 기상환경에 적용 가능한 모델식을 선정하기 위하여 1961년부터 2000년의 기상자료를 이용하여 온실내 목표온도를 9, 13, 16, 20℃로 설정하여 현재까지 개발된 모델식과 기본식의 지역별 DH값을 산출하였다. 지역별로 산출된 기본의 DH값을 종속변수, Mihara(6식)식, Hayashi(7식)식과 각각의 수정식인 6-1식, 7-1식을 독립변수로 하여 온실내 설정온도에 따른 수정결정상관계수를 분석한 결과 수정 Mihara(6-1)식이 기본식에 가장 근접하였다. 따라서 본 실험 조건하에서 국내적용 가능한 DH모델식은 수정 Mihara식임이 판명되었다. 수정 Mihara식을 이용하여 온실내 목표온도 9, 13, 16, 20℃ 따른 DH값 등고선 그래프를 지역별로 제시하였다.

• 대한수학회지
• /
• 제38권5호
• /
• pp.1069-1105
• /
• 2001

Regular maps and hypermaps are cellular decompositions of closed surfaces exhibiting the highest possible number of symmetries. The five Platonic solids present the most familar examples of regular maps. The gret dodecahedron, a 5-valent pentagonal regular map on the surface of genus 5 discovered by Kepler, is probably the first known non-spherical regular map. Modern history of regular maps goes back at least to Klein (1878) who described in [59] a regular map of type (3, 7) on the orientable surface of genus 3. In its early times, the study of regular maps was closely connected with group theory as one can see in Burnside’s famous monograph [19], and more recently in Coxeter’s and Moser’s book [25] (Chapter 8). The present-time interest in regular maps extends to their connection to Dyck\`s triangle groups, Riemann surfaces, algebraic curves, Galois groups and other areas, Many of these links are nicely surveyed in the recent papers of Jones [55] and Jones and Singerman [54]. The presented survey paper is based on the talk given by the author at the conference “Mathematics in the New Millenium”held in Seoul, October 2000. The idea was, on one hand side, to show the relationship of (regular) maps and hypermaps to the above mentioned fields of mathematics. On the other hand, we wanted to stress some ideas and results that are important for understanding of the nature of these interesting mathematical objects.