• The KIPS Transactions:PartA
• /
• v.18A no.2
• /
• pp.69-74
• /
• 2011

The minimum dominating set problem of a graph G is to find a smallest possible dominating set. The minimum dominating set problem is a well-known NP-complete problem such that it cannot be solved in polynomial time. Heuristic or approximation algorithm, however, will perform well in certain area of application. In this paper, we suggest three different simulated annealing algorithms and experimentally show better efficiency improvement by applying these algorithms to the graph instances developed by DIMACS.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.151-152
• /
• 2019

In this paper, we propose an improved learning method based on a small data set for animal image classification. First, CNN creates a training model for a small data set and uses the data set to expand the data set of the training set Second, a bottleneck of a small data set is extracted using a pre-trained network for a large data set such as VGG16 and stored in two NumPy files as a new training data set and a test data set, finally, learn the fully connected network as a new data set.

• Transactions of Materials Processing
• /
• v.5 no.3
• /
• pp.232-238
• /
• 1996

A dynamic mill set-up technique was developed to achieva a more precise roll gap set-up of the finishing mill stands for steel strip rolling. In the conventional mill set-up model the set-up values such as roll gap and roll speed are determined before the sheet bar reached the entry side of the finishing mill train and maintained constant until the strip top end passes through the last stand. In the way however a dynamic set-up logic that gives a way to adjust the roll gap value of the final mill stand for the strip ingoing from the ahead of the front stand was developed and attached to the existing set-up model. The roll gap modification is based on the analysis of the observation in the third stand of the finishing mill train. The dynamic set-up model was proved very effective for the more precise mill set-up and for operational stability in the hot strip finishing mill train.

• The Journal of Korean Physical Therapy
• /
• v.31 no.2
• /
• pp.103-110
• /
• 2019

Purpose: This study evaluated the usefulness of International Classification of Functioning, disability and health core set for children and youths with cerebral palsy (ICF-core set for CP) by comparing the Gross Motor Function Measure-88 (GMFM-88), which is the most widely used outcome measure in children with cerebral palsy (ICF-core set for CP). Method: One subject (Female, 14) was evaluated by GMFM-88 and ICF-core set for CP. In addition, the concept of GMFM-88 was compared with the concept of the ICF-core set for CP in compliance with ICF linking rules. The numerical values both of the GMFM-88 categories and the ICF-core set for CP's items were compared. Results: The ICF b760 was linked to the GMFM-88 59~61. d415 was linked to 57~58 of GMFM-88. d450 was linked to GMFM-88's 65~72. d455 was linked to GMFM-88 at 77and 80~83. Conclusion: The association of the ICF-core set for CP and GMFM-88 was confirmed. In addition, the number of categories of ICF-core set for CP was smaller than the number of items of GMFM-88. In conclusion, the ICF-core set for CP is an evaluation tool that can identify the various features of children. In addition, GMFM-88 was linked to the ICF core set for CP according to the ICF linking rules.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.269-274
• /
• 2004

We investigate a deranged Cantor set (a generalized Cantor set) using the similar method to find the dimensions of cookie-cutter repeller. That is, we will use a Gibbs measure which is a weak limit of a subsequence of discrete Borel measures to find the dimensions. The deranged Cantor set that will be considered is a generalized form of a perturbed Cantor set (a variation of the symmetric Cantor set) and a cookie-cutter repeller.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.743-749
• /
• 2021

The purpose of this article is to study few properties of fuzzy mean open and fuzzy mean closed sets in fuzzy topological spaces. Further, the idea of fuzzy mean clopen set is introduced. It is observed that a fuzzy mean clopen set is both fuzzy mean open and fuzzy mean closed but the converse is not true.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.319-323
• /
• 2001

First, we study some properties of F-continuities. Second, we introduce the concept of fuzzy set-valued mappings and study some properties of fuzzy set-valued mappings and fuzzy set-valued continuous mappings. Finally, we Introduce the concept of fuzzy semi-continuous of fuzzy set-valued mappings and investigate their some properties.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.4
• /
• pp.65-72
• /
• 1994

An independent set of nodes is a set of nodes no two of which are joined by an edge. An independent set is called maximal if no more nodes can be added to the set without destroying its independence. The greatest number of maximal independent set is the maximum possible number of maximal independent set of a graph. We consider the greatest number of maximal independent set in connected graphs with fixed numbers of edges and nodes. For arbitrary number of nodes with a certain class of number of edges, we present the connected graphs with the greatest number of maximal independent set. For a given class of number of edges, the structure of graphs with the greatest number of maximal independent set is that the two components are completely joined; one consists of disjoint triangles as many as possible and the other is the complete graph with remaining nodes.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.331-337
• /
• 1997

In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general descriptions of concepts from specific instances of these concepts. In many real life situations however new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overall set of instances. The method of learning presented here is based on a rough set concept proposed by Pawlak[2]. It is shown an algorithm to fund minimal set of rules using reduct change theorems giving criteria for minimum recalculation and an illustrative example.

• Journal of Educational Research in Mathematics
• /
• v.12 no.1
• /
• pp.125-143
• /
• 2002

The concept of "set" in school mathematics has undergone many changes according to the revision of curriculum and the transition of the paradigm in mathematics education. In the discipline-centered curriculum, a set was a representative concept which reflected the spirit of New Math. After the Back to Basics period, the significance of a set concept in school mathematics has been diminished. First, this paper elaborated several controversial aspects of the terms related to set, such as a collection and a set, a subset, and an empty set. In addition, the changes of the significance imposed to a set concept in school mathematics were investigated. Finally, this paper provided two alternative approaches to introduce and explain a set concept which emphasized both mathematical rigor and learner's psychology.