• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.59-66
• /
• 2004

We define a SG(String Graph) and an ASG(Alive String Graph) to the purpose to do static analysis. For a life and death judgment, we apply the rule to the situation which the stone is included and not included. We define the rules that are SR(String Reduction), ER(Empty Reduction), ET(Edge Transform), and CG(Circular Graph), when the stone is not included. We define the rules that are DESR(Dead Enemy Strings Reduction) and SCSR(Same Color String Reduction), when the stone is included. We evaluate a SG that it is an ASG or not by using rules. And we use APC(Articulation Point Check) nile according to number of articulation points lot a life and death judgment. The performance of our method has been tested on the problem set IGS_31_counted form the Computer Go Test Collection. The test set contains 11,191 Points and 1,123 Strings. We obtain 92.5% accuracy of Points and 95.7% accuracy of Strings.

• Journal of the Korean Mathematical Society
• /
• v.39 no.4
• /
• pp.579-591
• /
• 2002

New fixed Point results for the (equation omitted) selfmaps ale given. The analysis relies on a factorization idea. The notion of an essential map is also introduced for a wide class of maps. Finally, from a new fixed point theorem of ours, we deduce some equilibrium theorems.

• Korean Journal of Mathematics
• /
• v.24 no.3
• /
• pp.495-524
• /
• 2016

In this paper, we propose an iterative algorithm for finding a common solution of a system of generalized equilibrium problems, a split equilibrium problem and a hierarchical fixed point problem over the common fixed points set of a finite family of nonexpansive mappings in Hilbert spaces. Furthermore, we prove that the proposed iterative method has strong convergence under some mild conditions imposed on algorithm parameters. The results presented in this paper improve and extend the corresponding results reported by some authors recently.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.11-20
• /
• 2008

We survey recent results and some conjectures in analytical fixed point theory. We list the known fixed point theorems for Kakutani maps, Fan-Browder maps, locally selectionable maps, approximable maps, admissible maps, and the better admissible class $\cal{B}$ of maps. We also give 16 conjectures related to that theory.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.3
• /
• pp.171-177
• /
• 2013

This paper presents a fuzzy set method to enforce complementarity constraints (CCs) in a nonlinear interior point method (NIPM)-based optimization. NIPM is a Newton-type approach to nonlinear programming problems, but it adopts log-barrier functions to deal with the obstacle of managing inequality constraints. The fuzzy-enforcement method has been implemented for CCs, which can be incorporated in optimization problems for real-world applications. In this paper, numerical simulations that apply this method to power system optimal power flow problems are included.

• Communications for Statistical Applications and Methods
• /
• v.7 no.3
• /
• pp.655-665
• /
• 2000

Several information criterions, Schwarz information criterion (SIC), Akaike information criterion (AIC), and the modified Akaike information criterion ($AIC_c$), are proposed to locate a change point in the multiple linear regression model. These methods are applied to a stock Exchange data set and compared to the results.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.392-398
• /
• 2017

The point-cloud representation of an object is performed by scanning a space through a laser scanner that is extracting a set of points, and the points are then integrated into the same coordinate system through a registration. The set of the completed registration-integrated point clouds is classified into meaningful regions, shapes, and noises through a mathematical analysis. In this paper, the aim is the matching of a curved area like a cylinder shape in 3D point-cloud data. The matching procedure is the attainment of the center and radius data through the extraction of the cylinder-shape candidates from the sphere that is fitted through the RANdom Sample Consensus (RANSAC) in the point cloud, and completion requires the matching of the curved region with the Catmull-Rom spline from the extracted center-point data using the Principal Component Analysis (PCA). Not only is the proposed method expected to derive a fast estimation result via linear and curved cylinder estimations after a center-axis estimation without constraint and segmentation, but it should also increase the work efficiency of reverse engineering.

• Journal of the Korean Society for information Management
• /
• v.11 no.1
• /
• pp.81-102
• /
• 1994

Accordmg to the development of various information retneval system suitable for Korean database, many researchers have realized the need of R Test ColleAon which can be r d y used for evaluatmg a retneval system. Therefore, This study developed the TEST SET whch helps ob&vely evaluatmg the retrieval performance of an Hangul Automatic Indexer or Korean Information Retrieval System. The developed Test Set has four files such as: 1) Korean Document Set( * . all): 2) Natural Language Query Set(KTsetnq1): 3) Boolean Query Set(Ktset.bq1): 4) Query-Relevance Judgment Set ( KTsetrel) .

• Journal of the Korean Dietetic Association
• /
• v.13 no.1
• /
• pp.1-14
• /
• 2007

The purpose of this study was to assess students’ preference on set menus served in school foodservice. Questionnaires were distributed to 4,050 students enrolled in 34 middle and high schools located in Seoul, Gyeonggi, and Gyeongnam provinces. The students were asked to assess their preferences on 78 set menus using a 5-point Likert-type scale(1 : very dislike - 5 : very like). Excluding responses with significant missing data, usable responses were 3,433. Data were analyzed with descriptive analysis, t-test, and one-way analysis of variance. There was no difference between middle and high school students in terms of set menu preferences. On the other hand, there was significant difference between boys' and girls' set menu preferences. Among the seven given set menu groups(rice and soup with side dishes, tangs, rice with toppings, fried rice, western foods, noodles.ddeokguk.dumpling soups, and bibimbaps), boys had higher preference scores for the rice and soup with side dishes, tangs, rice with toppings, and fried rice than that of girls. Fried rice set menus were chosen to be boys’ favorite menus while western food set menus were most preferred by the girls. Rice and soup with side dishes set menus were least preferred by both boys and girls.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.53-56
• /
• 2000

The problem ( Ρ ) of optimizing a linear function d$\^$T/x over the set of efficient set for a multiple objective linear program ( Μ ) is difficult because the efficient set is nonconvex. There some interesting properties between the objective linear vector ｄ and the matrix of multiple objectives C and those properties lead us to establish criteria to solve ( Ρ ) with a linear program. In this paper we investigate a system of the linear equations C$\^$T/${\alpha}$=d and construct two linearly independent positive vectors ${\mu}$, ν such that ${\alpha}$=${\mu}$-ν. From those vectors ${\mu}$, ν, solving an weighted sum linear program for finding an efficient extreme point for the ( Μ ) is a way to get an optimal solution ( Ρ ). Therefore our theory gives an easy way of solving nonconvex program ( Ρ ) with a weighted sum linear program.