• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제5권10호
• /
• pp.483-488
• /
• 2016

본 논문은 최근접 이웃 규칙을 이용한 프로토타입을 이용하는 분류 학습을 제안한다. 훈련 데이터가 대표하는 클래스 영역을 초월구로 분할하는데 최근접 이웃규칙을 적용시키며, 초월구는 동일 클래스 데이터들만 포함시킨다. 초월구의 반지름은 가장 인접한 다른 클래스 데이터와 가장 먼 동일 클래스 데이터의 중간 거리 값으로 결정한다. 그리고 전체 훈련 데이터를 대표하는 최소의 프로토타입 집합을 선택하기 위해 집합 덮개 최적화를 이용한다. 제안하는 선택 방법은 클래스 별 프로토타입을 선택하는 그리디 알고리즘으로 설계되며, 대규모 훈련 데이터에 대한 병렬처리가 가능하다. 분류 예측은 최근접 이웃 규칙을 이용하며, 새로운 훈련 데이터는 프로토타입 집합이다. 실험에서 제안하는 방법은 기 연구된 학습 방법에 비해 일반화 성능이 우수하다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.525-528
• /
• 2008

We propose a IDS node selection scheme for intrusion detection in wireless mesh networks. The proposed scheme considers network survivability and energy consumption. To utilize wireless resources efficiently, we apply a set covering problem (SCP) to IDS nodes selection problem. Our proposed scheme also considers congested networks.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.857-862
• /
• 1987

Given a network with k specified vertices bi called centers, a cardinality constrained cover is a family {Bi} of k subsets covering the vertex set of a network, such that each subset Bi corresponds to and contains center bi, and satisfies a given cardinality constraint. A set of cardinality constrained overlapping territories is a cardinality constrained cover such that the total sum of T(B$_{i}$) for all subsets is minimum among all cardinality constrained covers, where T(B$_{i}$) is the summation of the shortest path lengths from center bi to every vertex in B$_{I}$. This paper considers a problem of finding a set of cardinality constrained overlapping territories. and proposes an algorithm for the Problem which has the time and space complexities are O(k$^{3}$$\mid$V$\mid$$^{2}$) and O(k$\mid$V$\mid$+$\mid$E$\mid$), respectively, where V and E are the sets of vertices and edges of a given network, respectively. The concept of overlapping territories has a possibility to be applied to a job assignment problem.oblem.

• 경영과학
• /
• 제19권2호
• /
• pp.75-89
• /
• 2002

According to the fast-paced environment of information technology and improving customer services, the design activities of logistics systems improve customer centric services and delivery performance implementing e-logistics system. The fundamental design issues that arise in the delivery system planning are optimizing the system with minimum cost and maximum throughput and service level. This study is concerned with the integrated model development of delivery system with customer responsive service level for DCM, Demand Chain Management. We used a two-step approach for this study. First, we formulated the supply. center facility planning using stochastic set-covering problem and assigned the customers to the supply center using clustering algorithm. Second, we developed vehicle delivery planning for a supply center based on GIS, GIS-VRP. Also we developed a GUI-type computer program for proposed method for supply center problem using GIS and Geo-DataBase of Busan area. The computational results showed that the proposed method was very effective on a set of test problems.

• 대한수학회지
• /
• 제46권4호
• /
• pp.759-773
• /
• 2009

A dominating set for a graph G is a set D of vertices of G such that every vertex of G not in D is adjacent to a vertex of D. Reed [11] considered the domination problem for graphs with minimum degree at least three. He showed that any graph G of minimum degree at least three contains a dominating set D of size at most $\frac{3}{8}$ |V (G)| by introducing a covering by vertex disjoint paths. In this paper, by using this technique, we show that every graph on n vertices of minimum degree at least four contains a dominating set D of size at most $\frac{4}{11}$ |V (G)|.

• 산업공학
• /
• 제21권3호
• /
• pp.262-273
• /
• 2008

In Korean peninsular, Air Defense with SAM(Surface-to-Air Missile) is very important, because of threatening by North Korea's theater ballistic missiles installed with nuclear or biochemistry. Effective and successful defense operation largely depends on two factors, SAM's location and the number of SAM for each target based on missile's availability in each SAM's location. However, most previous papers have handled only the former. In this paper, we developed Multi-heuristic algorithm which can handle both factors simultaneously for solving allocation problem of the batteries and missile assignment problem in each battery. To solve allocation problem, genetic algorithm is used to decide location of the batteries. To solve missile assignment problem, a heuristic algorithm is applied to determine the number of SAM for each target. If the proposed model is applied to allocation of SAM, it will improve the effectiveness of missile defense operations.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제22권4호
• /
• pp.471-487
• /
• 2008

본 연구에서는 해석학 강좌를 운영하는 과정에서 얻어진 학생들의 수학적 발명의 사례를 제시하고 분석하여, 수학적 발명과 관련된 구체적인 교수-학습 과정, 얻어진 수학적 산출물들, 이들의 수학적 의의를 기술하였다.

• 한국인터넷방송통신학회논문지
• /
• 제23권4호
• /
• pp.165-170
• /
• 2023

본 논문은 지금까지 NP-완전 문제로 다항시간 알고리즘이 존재하지 않는 집합피복 문제에 대해 선형시간으로 해를 구할 수 있는 알고리즘을 제안하였다. 지금까지는 최대로 피복할 수 있는 집합을 선택하는 휴이스틱 탐욕 알고리즘만이 알려져 있다. 반면에 제안된 알고리즘은 최대 원소 수 2순위 또는 3순위까지의 노드들 k개를 대상으로 포함-배제 원리 규칙을 적용하여 N개의 노드 모두를 피복하는 피복집합을 구하고, 이들 중 최소 피복집합을 선택하는 경쟁 알고리즘이다. 제안된 알고리즘은 욕심쟁이 알고리즘이 최적 해를 얻지 못하는 단점을 보완하였다. 제안된 알고리즘을 다양한 응용 사례들에 적용한 결과 O(kn²)의 다항시간으로 최적 해를 얻었다.

• 한국경영과학회지
• /
• 제37권4호
• /
• pp.197-209
• /
• 2012

This paper studies an emergency service vehicle location problem, where minimum reliability level pre-specified at each demand point is assured. Several models are suggested depending on the busy fraction, which is the time proportion of unavailability for the ambulances. In this paper a new model on computing the busy fraction is suggested, where it varies depending on the distance between the demand point and ambulances, hence it may respond the more realistic situation. The busy fraction for the ambulance location determined by the optimization model is computed by the simulation, and updated through the iterative procedure. It has been shown that the performances of the solutions obtained by the algorithm suggested for the instances appeared in the literature.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.1020-1025
• /
• 2005

The set covering(SC) problem has many practical application of modeling not only real world problems in civilian but also in military. In this paper we study optimal allocation model for maximizing utility of consolidating old fashioned and new air defense weapon system like Patriot missile and develop the new computational algorithm for the SC problem by using simulated annealing(SA) algorithm. This study examines three different methods: 1) simulated annealing(SA); 2) accelerated simulated annealing(ASA); and 3) selection by effectiveness degree(SED) with SA. The SED is adopted as an enhanced SA algorithm that the neighboring solutions could be generated only in possible optimal feasible region at the PERTURB function. Furthermore, we perform various experiments for both a reduced and an extended scale sized situations depending on the number of customers(protective objective), service(air defense), facilities(air defense artillery), threat, candidate locations, and azimuth angles of Patriot missile. Our experiment shows that the SED obtains the best results than others.