• Journal of the Korean Wood Science and Technology
• /
• v.8 no.1
• /
• pp.22-27
• /
• 1980

Quantitative assessment of edge blunting of saw-teeth was carried out by TALYSURF. 1. Using the following equation, the real shape of a saw-tooth can be traced on the graph of TALYSURF. ${\frac{{\Delta}h}{h}}={\frac{V{\Delta}_x}{V_x}}$ {${\Delta}h$: vertical distance of stylus h: vertical distance in chart $V{\Delta}_x$: Velocity of stylus $V_x$: velocity of chart} 2. As shown on Fig 2, the error from stylus itself can be calculated by following equation. i) 13.8${\mu}{\leqq}$x<20.4${\mu}$ y=-0.2246x+4.59${\mu}$ ii) 0${\leqq}$x<13.8${\mu}$ y=${\sqrt{(-18{\mu})^2-x^2}}-1.42x+32.7{\mu}}$ 3. The relationship between profile of saw-tooth and error from stylus itself can be calculated by following equation. $E(%)=\frac{f(r){\times}{\frac{4}{18{\mu}}}}{f(R){\times}{\frac{R}{18.5{\mu}}}-f(r){\times}{\frac{r}{18{\mu}}}}{\times}100$ {E(%)${\frac{error\;of\;stylus}{dullness\;of\;saw\;tooth}}{\times}100$ r: radius of stylus tip R: radius of tip which is drawn in graph of talysurf f(r) : error of stylus f(R) : dullness of tip which is drawn in graph of talysurf} 4. The graph of maximum error and profile of saw-tooth was parabola.

• Journal of Internet Computing and Services
• /
• v.22 no.1
• /
• pp.51-63
• /
• 2021

Identifying characters who appear in a story and analyzing their relationships is essential to understanding the story. This paper aims to identify the two actants (or character roles) as Helper and Opponent in Greimas's Actantial model by identifying Subject (i.e., protagonist) and analyzing the emotional interactions between the Subject and the two actants (Helper/Opponent). Our proposed method consists of three steps. First, we identify objects (i.e., characters) appearing in the text story. Next, we extract relational information through the interaction of the characters, and then classify emotions in the text expressed as relational information. Finally, we represent the flow of emotional relations among characters as a directed graph. The node with the highest degree is considered as the Subject because it includes the most relational information. The node that sends the most positive/negative emotions to the Subject is considered as the Helper/Oppenent, respectively. Our research contributes to the computer-based narrative understanding by providing a computational method that automatically extracts the three key character roles (Subject, Helper, and Opponent) from the text story.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.263-269
• /
• 2014

In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.68-85
• /
• 1998

Solid modeling refers to techniques for unambiguous representations of three-dimensional objects. Feature recognition is a sub-discipline focusing on the design and implementation of algorithms for detecting manufacturing information such as holes, slots, etc. in a solid model. Automated feature recognition has been an active research area in stolid modeling for many years, and is considered to be a critical component for CAD/CAM integration. This paper gives a technical overview of the state of the art in feature recognition research. Rather than giving an exhaustive survey, I focus on the three currently dominant feature recognition technologies: graph-based algorithms, volumetric decomposition techniques, and hint-based geometric reasoning. For each approach, I present a detailed description of the algorithms being employed along with some assessments of the technology. I conclude by outlining important open research and development issues.

• Journal of the Korean Society of Costume
• /
• v.15
• /
• pp.21-45
• /
• 1990

The purpose of this thesis is to study the method of the reasonable pattern design. The studying method is based on the original principle of the trousers' cutting and I have a hypothesis about the trousers pattern which should be proved. When I selected the practical method, I made use of the international measuring rule, graph paper and tracing paper, in order to prove the new pattern design. The reasonable pattern design should be the one of the suitable original principles to be suited in the design through any measurement. Therefore, I have discussed the above mentioned design. I find out the conclusion to prove the hypothesis of pattern design with the experimental measure after showing the above mentiond design. The characteristics is as follows. First : To be convinient when walking, because of little degree as folding of the front part of trousers with the under-angle. Second : To be suitable in proportion to the length of trousers and the under-angle. Third ; When folding the center line of the Sapok (a name of one of the trousers parts), the length of the Sapoks is same and harmonized with the Sapoks because of the same angle of both Sapoks in any case of the measurement. Fourth : No correction of the lines when dressing, for the same points of the large Sapok and the small one. Fifth : To be easiness of the pattern design through the concrete measurement. I could find out a little extent errors of pattern showings, an easiness of dressing, scientification of formation in Korean trousers and standard of the practical measurement in the program to be presented as the result of studying.

• Journal of Intelligence and Information Systems
• /
• v.28 no.1
• /
• pp.197-216
• /
• 2022

With the development of Internet and mobile technology and the spread of social media, a large amount of information is being generated and distributed online. Some of them are useful information for the public, but others are misleading information. The misleading information, so-called 'fake news', has been causing great harm to our society in recent years. Since the global spread of COVID-19 in 2020, much of fake news has been distributed online. Unlike other fake news, fake news related to COVID-19 can threaten people's health and even their lives. Therefore, intelligent technology that automatically detects and prevents fake news related to COVID-19 is a meaningful research topic to improve social health. Fake news related to COVID-19 has spread rapidly through social media, however, there have been few studies in Korea that proposed intelligent fake news detection using the information about how the fake news spreads through social media. Under this background, we propose a novel model that uses Graph2vec, one of the graph embedding methods, to effectively detect fake news related to COVID-19. The mainstream approaches of fake news detection have focused on news content, i.e., characteristics of the text, but the proposed model in this study can exploit information transmission relationships in social engagement networks when detecting fake news related to COVID-19. Experiments using a real-world data set have shown that our proposed model outperforms traditional models from the perspectives of prediction accuracy.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1749-1754
• /
• 2018

If a graph G is both claw-free and gap-free, then E. Nevo showed that the Castelnuovo-Mumford regularity of the associated edge ideal I(G) is at most three. Later Dao, Huneke and Schwieg gave a simpler proof of this result. In this paper we introduce a class of edge ideals with Castelnuovo-Munmford regularity at most four.

• Communications of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.213-218
• /
• 2014

J. Malkevitch defined the coded path in r-valent polytopal graphs of uniform face structure and showed many interesting properties of the coded paths. In this paper, we study the simplicity of coded paths in an m-valent planar multigraph which is not a polytopal graph.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.3
• /
• pp.363-379
• /
• 2014

In this paper, introducing various separation axioms on a bi-GTS, it has been observed that such separation axioms actually unify the well-known separation axioms on topological spaces. Several characterizations of such separation properties of a bi-GTS are established in terms of ${\gamma}_{{\mu}_i,{\mu}_j}$-closure operator, generalized cluster sets of functions and graph of functions.

• Journal of Korean Institute of Industrial Engineers
• /
• v.1 no.2
• /
• pp.51-56
• /
• 1975

A computer program for computing complex system reliability is described. The program is composed of three phases : Phase I program reduces all series, parallel and series-parallel components and subsequently obtains an irreducible non-series-parallel system. Phase II program enumerates all the possible paths from the source to the sink of the graph. Phase III program then computes system reliability based on the information obtained by the Phase II program. The program is based on a modified version of the algorithm published in [6]. An example of the use of the computer program is given.