• 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 Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2243-2251
• /
• 2016

In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.54-66
• /
• 2008

A spatio-temporal join is an expensive operation that is commonly used in spatio-temporal database systems. In order to generate an efficient query plan for the queries involving spatio-temporal join operations, it is crucial to estimate accurate selectivity for the join operations. Given two dataset $S_1,\;S_2$ of discrete data and a timestamp $t_q$, a spatio-temporal join retrieves all pairs of objects that are intersected each other at $t_q$. The selectivity of the join operation equals the number of retrieved pairs divided by the cardinality of the Cartesian product $S_1{\times}S_2$. In this paper, we propose aspatio-temporal histogram to estimate selectivity of spatio-temporal join by extending existing geometric histogram. By using a wide spectrum of both uniform dataset and skewed dataset, it is shown that our proposed method, called Spatio-Temporal Histogram, can accurately estimate the selectivity of spatio-temporal join. Our contributions can be summarized as follows: First, the selectivity estimation of spatio-temporal join for discrete data has been first attempted. Second, we propose an efficient maintenance method that reconstructs histograms using compression of spatial statistical information during the lifespan of discrete data.

• Korean Journal of Comparative Education
• /
• v.28 no.3
• /
• pp.333-354
• /
• 2018

The study aimed to compare and analyze Nuri curriculum and contents for mathematics in Korea and the Common Core State Standards(CCSS) and New Jersey Preschool Standards for mathematics in the United States. With the results as basis, this study intended to provide suggestions and directions for improving Nuri curriculum of mathematics for young children. For the goal of this study, educational goals, categories of contents, and specific contents were reviewed. First, results of this study indicated that Nuri curriculum for mathematics provides comprehensive educational goals that promote problem-solving ability in everyday contexts with composing mathematical knowledge. On the contrary, CCSS and Preschool Standards provide specific educational goals that focus on children's mathematical skills and concepts. Second, the contents of both countries' curriculum concentrate on 'counting and cardinality', 'measurement', and 'spatial and geometric sense.' There are 5 categories of CCSS, 4 categories of Preschool Standards based on CCSS and one category of Nuri curriculum for mathematics. Third, there are the differences between the two countries' curriculum in continuity from kindergarten to first grade and description method for curriculum.

• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.99-111
• /
• 2003

By virtue of diverse advantages derived from digital media, eBook is getting started to use. And many market research agencies have predicted that its market will be greatly expanded soon. But against those expectations, copyright-related problems and the difficulties of its accessing inherited from various eBook content formats become an obstacle to its diffusion. The first problems can be solved by DRM technology. And to solve the second problems, each nation has published its own content standard format. But the domestic standards are useful only the domestic level, they still leave the problems in the national level. The variety of content formats has created a demand for mechanisms that allow the exchange of eBook contents. Therefore we study the mapping relations between eBook contents for conversion. To define the mapping relations, first we extract the mapping both between eBook contents and between normal XML documents. From those mappings, we define seven mapping relations and classify them by cardinality. And we analyze the classified relations, which can be generated by automatic, or not. Using these results, we also classify the eBook content conversion as automatic, semi-automatic, and manual. Besides, we provide the conversion templates for mapping relations for automatic generation of conversion scripts. To show the feasibility of conversion templates, we apply them to the eBook content conversion. Experiment shows that our conversion templates generate the conversion scripts properly. We expected that defined mapping relations and conversion templates can be used not only in eBook content conversion , but also in normal XML document conversion.