• Title/Summary/Keyword: Set Covering Problem

Search Result 60, Processing Time 0.033 seconds

Prototype-Based Classification Using Class Hyperspheres (클래스 초월구를 이용한 프로토타입 기반 분류)

  • Lee, Hyun-Jong;Hwang, Doosung
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.10
    • /
    • pp.483-488
    • /
    • 2016
  • In this paper, we propose a prototype-based classification learning by using the nearest-neighbor rule. The nearest-neighbor is applied to segment the class area of all the training data with hyperspheres, and a hypersphere must cover the data from the same class. The radius of a hypersphere is computed by the mid point of the two distances to the farthest same class point and the nearest other class point. And we transform the prototype selection problem into a set covering problem in order to determine the smallest set of prototypes that cover all the training data. The proposed prototype selection method is designed by a greedy algorithm and applicable to process a large-scale training set in parallel. The prediction rule is the nearest-neighbor rule and the new training data is the set of prototypes. In experiments, the generalization performance of the proposed method is superior to existing methods.

An Efficient Intrusion Detection System (IDS) Node Selection for Congested Systems in Wireless Mesh Networks

  • Choe, Jae-Un;Kim, Gi-Seong;Kim, Se-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2008.10a
    • /
    • 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.

  • PDF

On overlapping territories satisfying cardinality constraints

  • Takashi Moriizumi;Shuji Tsukiyama;Shoji Shi Noda;Masakazu Sengoku;Isao Shirakawa
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10a
    • /
    • 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.

  • PDF

A Study on a Real Time Freight Delivery Planning for Supply Center based on GIS (GIS기반의 실시간 통합화물운송시스템 계획에 관한 연구)

  • 황흥석;김호균;조규성
    • Korean Management Science Review
    • /
    • v.19 no.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.

DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR

  • Sohn, Moo-Young;Xudong, Yuan
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.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)|.

The Optimal Allocation Model for SAM Using Multi-Heuristic Algorithm : Focused on Theater Ballistic Missile Defense (복합-휴리스틱 알고리즘을 이용한 지대공 유도무기(SAM) 최적배치 방안 : 탄도미사일 방어를 중심으로)

  • Lee, Jae-Yeong;Kwak, Ki-Hoon
    • IE interfaces
    • /
    • v.21 no.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.

A research on Mathematical Invention via Real Analysis Course in University (대학교의 해석학 강좌에서 학생들의 수학적 발명에 관한 연구)

  • Lee, Byung-Soo
    • Communications of Mathematical Education
    • /
    • v.22 no.4
    • /
    • pp.471-487
    • /
    • 2008
  • Inventive mathematical thinking, original mathematical problem solving ability, mathematical invention and so on are core concepts, which must be emphasized in all branches of mathematical education. In particular, Polya(1981) insisted that inventive thinking must be emphasized in a suitable level of university mathematical courses. In this paper, the author considered two cases of inventive problem solving ability shown by his many students via real analysis courses. The first case is about the proof of the problem "what is the derived set of the integers Z?" Nearly all books on mathematical analysis sent the question without the proof but some books said that the answer is "empty". Only one book written by Noh, Y. S.(2006) showed the proof by using the definition of accumulation points. But the proof process has some mistakes. But our student Kang, D. S. showed the perfect proof by using The Completeness Axiom, which is very useful in mathematical analysis. The second case is to show the infinite countability of NxN, which is shown by informal proof in many mathematical analysis books with formal proofs. Some students who argued the informal proof as an unreasonable proof were asked to join with us in finding the one-to-one correspondences between NxN and N. Many students worked hard and find two singled-valued mappings and one set-valued mapping covering eight diagrams in the paper. The problems are not easy and the proofs are a little complicated. All the proofs shown in this paper are original and right, so the proofs are deserving of inventive mathematical thoughts, original mathematical problem solving abilities and mathematical inventions. From the inventive proofs of his students, the author confirmed that any students can develope their mathematical abilities by their professors' encouragements.

  • PDF

Competitive Algorithm of Set Cover Problem Using Inclusion-Exclusion Principle (포함-배제 원리를 적용한 집합피복 문제의 경쟁 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.4
    • /
    • pp.165-170
    • /
    • 2023
  • This paper proposes an algorithm that can obtain a solution with linear time for a set cover problem(SCP) in which there is no polynomial time algorithm as an NP-complete problem so far. Until now, only heuristic greed algorithms are known to select sets that can be covered to the maximum. On the other hand, the proposed algorithm is a competitive algorithm that applies an inclusion-exclusion principle rule to N nodes up to 2nd or 3rd in the maximum number of elements to obtain a set covering all k nodes, and selects the minimum cover set among them. The proposed algorithm compensated for the disadvantage that the greedy algorithm does not obtain the optimal solution. As a result of applying the proposed algorithm to various application cases, an optimal solution was obtained with a polynomial time of O(kn2).

A Study of Ambulance Location Problem Applying the Iterative Procedure of Simulation and Optimization (시뮬레이션과 최적화 모형을 혼합 적용한 구급차 위치선정 모형의 해법연구)

  • Lim, Young Sun;Kim, Sun Hoon;Lee, Young Hoon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.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.

Optimal Allocation Model for Ballistic Missile Defense System by Simulated Annealing Algorithm (탄도미사일 방어무기체계 배치모형 연구)

  • Lee, Sang-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • 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.

  • PDF