• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• 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.

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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.185-191
• /
• 2023

To the exact cover problem that remains NP-complete to which no polynomial time algorithm is made available, this paper proposes a linear time algorithm that yields an optimal solution. The proposed algorithm makes use of the set cover problem's major feature which states that "no identical element shall be included in more than one covering set". To satisfy this criterion, the proposed algorithm initially selects a subset with the minimum cardinality and deletes those that contain the cardinality identical to that of the selected subset. This process is repeatedly performed on remaining subsets until the final solution is obtained. Provided that the solution is unattainable, it selects subsets with the maximum cardinality and repeats the same process. The proposed algorithm has not only obtained the optimal solution with ease but also proved its wide applicability on N-queens problems, hence disproving the NP-completeness of the exact cover problem.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.8 no.2
• /
• pp.68-76
• /
• 2006

A thermal time-based two-step phenological model was used to project flowering dates of Japanese cherry in South Korea from 1941 to 2100. The model consists of two sequential periods: the rest period described by chilling requirement and the forcing period described by heating requirement. Daily maximum and minimum temperature are used to calculate daily chill units until a pre-determined chilling requirement for rest release is met. After the projected rest release date, daily heat units (growing degree days) are accumulated until a pre-determined heating requirement for flowering is achieved. Model calculations using daily temperature data at 18 synoptic stations during 1955-2004 were compared with the observed blooming dates and resulted in 3.9 days mean absolute error, 5.1 days root mean squared error, and a correlation coefficient of 0.86. Considering that the phonology observation has never been fully standardized in Korea, this result seems reasonable. Gridded data sets of daily maximum and minimum temperature with a 270 m grid spacing were prepared for the climatological years 1941-1970 and 1971-2000 from observations at 56 synoptic stations by using a spatial interpolation scheme for correcting urban heat island effect as well as elevation effect. A 25km-resolution temperature data set covering the Korean Peninsula, prepared by the Meteorological Research Institute of Korea Meteorological Administration under the condition of Inter-governmental Panel on Climate Change-Special Report on Emission Scenarios A2, was converted to 270 m gridded data for the climatological years 2011-2040, 2041-2070 and 2071-2100. The model was run by the gridded daily maximum and minimum temperature data sets, each representing a climatological normal year for 1941-1970, 1971-2000, 2011-2040, 2041-2070, and 2071-2100. According to the model calculation, the spatially averaged flowering date for the 1971-2000 normal is shorter than that for 1941-1970 by 5.2 days. Compared with the current normal (1971-2000), flowering of Japanese cherry is expected to be earlier by 9, 21, and 29 days in the future normal years 2011-2040, 2041-2070, and 2071-2100, respectively. Southern coastal areas might experience springs with incomplete or even no Japanese cherry flowering caused by insufficient chilling for breaking bud dormancy.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.50 no.4
• /
• pp.413-420
• /
• 2017

The increase in the number of mud shrimps Upogebia major is a concern because of their negative effects on shellfish aquaculture, including Manila clam Venerupis philippinatum along the west coast of Korea. This study developed a behavioral analysis system for aquatic animals using a set of monochromatic light-emitting diode (LED) modules covering the visible light range at similar intervals. Movements of mud shrimp were monitored using a tracking system under illumination with infra-red light and an LED of 660 nm wavelength without provoking stimulation. The minimum light intensity needed to induce a photoresponse by the mud shrimp was $10{\mu}mole/m^2/s$ under the conditions tested. Of the six kinds of LED illuminations tested, the most sensitive response was obtained with illumination with the 505 nm LED, followed in order by LEDs with peak wavelengths of $525nm{\fallingdotseq}465nm$ > $405nm{\fallingdotseq}590nm$ > 660 nm. These findings should help to identify LED sources that efficiently induce movement of the mud shrimp and also for monitoring movement without stimulating.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.37 no.5
• /
• pp.31-41
• /
• 2009

Under the Korea Building Act, anyone planning to build a building or buildings on a site over $200m^2$ must plant plants over a specific area. In large scale development this rule is adhered to well, but such is not the case in small scale development. Therefore, special attention must be given to small scale development. Thus, the purpose of this research is to analyze the current situation and practice of planting at small scale development sites in Seoul, and then suggest policies for improving them. In this study using the data covering Seongbuk-Gu and Gangnam-Gu, which was surveyed in 2002, the current situation and practice of planting at small scale development sites was analyzed. After a questionnaire survey was conducted with government officers and building owners, the same analysis was made. Then the policies for improvement were extracted. The results are as follows: 1. In superordinate planning stage, because the minimum standards are too low, those must be strengthened. Any district plan does not control planting in private building lots. This requests active application of planting in private building lots as a design control measure in district planning. 2. In the building design stage, there are no guidelines. The obligation of building set-back between adjacent buildings by the Korean Building Act produces mass shaded and inferior planting beds. The act also is blocking landscape architects' participation in small scale development. And wall installations deteriorate the streetscape and growth of plants with shading. Therefore guidelines must be made. 3. In each stage of the building permit, the permit for building completion, and maintenance the Korean Building Act is blocking landscape architects' participation in small scale development, so the planting plan is completely handled by nonprofessional persons. Therefore, the act should be amended in order to make way for landscape architects' participation in each stage of the small scale development process.