• 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(kn²).

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.6_2
• /
• pp.521-527
• /
• 2013

Rule set is an important step which impacts significantly on accuracy of object-oriented classification result. Therefore, this paper proposes a rule set to extract land cover from Landsat Thematic Mapper (TM) imagery acquired in Donganh, Hanoi, Vietnam. The rules were generated to distinguish five classes, namely river, pond, residential areas, vegetation and paddy. These classes were classified not only based on spectral characteristics of features, but also indices of water, soil, vegetation, and urban. The study selected five indices, including largest difference index max.diff; length/width; hue, saturation and intensity (HSI); normalized difference vegetation index (NDVI) and ratio vegetation index (RVI) based on membership functions of objects. Overall accuracy of classification result is 0.84% as the rule set is used in classification process.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.42 no.3
• /
• pp.1-12
• /
• 2017

In this paper, we generalize lifted inequalities to a 0-1 mixed-integer bilinear covering set with linear terms. This work is motivated by the observation that Generalized Bilinear Inequality (GBI) occurs in the Branch and Bound process. We find some conditions and prove the subadditivity of lifting functions for lifting to be sequence-independent. Using the theoretical results, we develop facet-defining inequalities for a GBI-defined set through three steps of lifting.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.2
• /
• pp.97-104
• /
• 1990

The problem is a variation of the weighted set-covering problem (SCP) which requires the minimum-cost cover to be self-covering. It is shown that direct extension of the well-known greedy heuristic for SCP can have an arbitrarily large error in the worst case. It remains an open question whther these exists a greedy heuristic with a finite error bound.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5643-5656
• /
• 2016

The detection accuracy of steganalysis depends on many factors, including the embedding algorithm, the payload size, the steganalysis feature space and the properties of the cover source. In practice, the cover source mismatch (CSM) problem has been recognized as the single most important factor negatively affecting the performance. To address this problem, we propose a new framework for blind, universal steganalysis which uses traditional steganalyst features. Firstly, cover images with the same statistical properties are searched from a reference image database as aided samples. The test image and its aided samples form a whole test set. Then, by assuming that most of the aided samples are innocent, we conduct outlier detection on the test set to judge the test image as cover or stego. In this way, the framework has removed the need for training. Hence, it does not suffer from cover source mismatch. Because it performs anomaly detection rather than classification, this method is totally unsupervised. The results in our study show that this framework works superior than one-class support vector machine and the outlier detector without considering the image retrieval process.

• International Journal of Reliability and Applications
• /
• v.5 no.4
• /
• pp.147-154
• /
• 2004

This work developed and algorithm for a set covering model when the reliability of covers is a concern. This model extended the usage of the set covering model.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.1-11
• /
• 2010

The conditional covering problem is an important variation of well studied set covering problem. In the set covering problem, the problem is to find a minimum cardinality vertex set which will cover all the given demand points. The conditional covering problem asks to find a minimum cardinality vertex set that will cover not only the given demand points but also one another. This problem is NP-complete for general graphs. In this paper, we present an efficient algorithm to solve the conditional covering problem on interval graphs with n vertices which runs in O(n)time.

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

The aim of this work is to introduce for the first time the concept of D-set. This is done by defining a special type of cover called a D-cover. we present some results to study the properties of D-compact spaces and their relations with other topological spaces. Several examples are discussed to illustrate and support our main results. Our results extend and generalized many will known results in the literature.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.17 no.5
• /
• pp.84-90
• /
• 2018

When producing a plastic horn cover for an automobile, since the interval between the ribs on the inner surface is narrow, conventional cooling channels cannot be applied and cooling of the mold is difficult. For this reason, the molding operation cannot be completed within a set cycle time. In this study, a conformal cooling channel was applied on the mold to solve the cooling problem. Injection molding simulation was carried out to confirm the effectiveness of the conformal cooling channel. In the analysis results, the mold temperature at the rib section decreased by 33%, and the mold temperature also decreased by 31%. This reduction in temperature allowed for molding within a set cycle time and demonstrated the effectiveness of the conformal cooling channel.

• Journal of Industrial Technology
• /
• v.4
• /
• pp.25-27
• /
• 1984

위상 공간 X의 모든 Semi-open cover에 대하여 그들의 closure의 합이 X를 cover한 유한 부분 속이 존재할 때 위상 공간X를 S-closed라고 한다. 이 논문에서는 S-closed와 semi-closed set 사이의 관계를 조사하였고 Haussdorff 공간과 S-closed 공간에서 extremally disconnected와 semi-continuous의 성질을 조사하였다.