• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.43-50
• /
• 2013

This paper aims to determine the optimal location of expressway patrol vehicle stations that minimizes additional troubles caused by the delay of crash treatments. To do this, we formulate a maximum covering problem and a p-center problem weighted by crash frequency, using the shortest distance as the criteria for allocating service district, and we employ the Lagrangian relaxation algorithm to solve the former and Daskin's heuristic algorithm to solve the latter, respectively. Based on crash data of Korean expressways, the results from the proposed models are compared with the current location of patrol vehicle stations by using several indices as the level of service for crash treatment, such as maximum crash-weighted distance, average crash-weighted distance, and average access distance. The results show that the proposed models improve average access distance and time by about 10km and 10min, respectively. When allocation for service district is changed only with the fixed current location, the level of service can be also improved. The models and results proposed in this paper can contribute to improving the level of service for crash treatment on expressways. They can also provide the theoretical basis on the location decision for other various emergency facilities, and the allocation decision for floating service districts according to time-period crash data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8A
• /
• pp.691-701
• /
• 2011

In rotatable directional sensor networks, maximizing network lifetime while covering all the targets and forwarding the sensed data to the sink is a challenge problem. In this paper, we address the Maximum Directional Cover Tree (MDCT) problem of organizing the directional sensors into a group of non-disjoint subsets to extend the network lifetime. Each subset in which the directional sensors cover all the targets and forward the sensed data to the sink is activated at one time. For the MDCT problem, we first present an energy consumption model which mainly takes into account the energy consumption for rotation work. We also develop the Directional Coverage and Connectivity (DCC)-greedy algorithm to solve the MDCT problem. To evaluate the algorithm, we conduct simulations and show that it can extend the network lifetime.

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

• 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 Korean Institute of Industrial Engineers
• /
• v.41 no.3
• /
• pp.296-304
• /
• 2015

Vessel Traffic Service (VTS) is the service that provides ships navigating on a sea transportation route with guidance and advice about geographical environment and other attentive information for their safety. In this study we point out that currently, constructing additional VTSs is required to prevent ships from unexpected accident on their navigation. We first select several candidate locations for constructing VTSs, based on the amount of marine transportation and its potential development possibility. Then, we present an optimization model in which the maximum area coverage is achieved by determining new locations of VTS subject to budget limitation. The problem can be modeled as a binary integer program and it provides an optimal solution for new VTS locations to be constructed under the consideration of the currently located VTSs in Korea.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.2
• /
• pp.192-201
• /
• 2018

This study intends to find efficient support methods for small and medium-sized businesses (SMBs) especially in the increasingly important mobile sector. We investigated regarding perceptions of mobile sector-specific support programs and their current state of usage, and perceptions of the new mobile market and the present conditions of each stage of production based on analysis of a survey that included 204 respondents in each SMB to achieve this goal. Concretely, detections through this research were the reasons for non-selection of support businesses, the future prospective mobile business area, the company's own first-preference item and the reason for the preference, plus new mobile areas of willingness to apply the company's own product and its own first-preference item, and the reason for the preference. In addition, we found out covering costs and revenue size of the maximum-revenue product for each stage (from the first to the fourth stage), the kind of a product's execution method connected to the product (e.g. self-production, outsourcing to another company to produce a product), and the execution method for pre-products. We can suggest a policy regarding efficient support alternatives for SMBs related to the mobile sector thanks to these findings.

• Journal of Legislation Research
• /
• no.44
• /
• pp.33-62
• /
• 2013

In this paper, the consolidation of ICT basic legislation and ICT special legislation concerning "Ministry of Science, ICT and Future Planning" and "Korea Communications Commission" which came on the back of governmental reorganization in recent years is discussed in the theoretical and practical aspect. Development of "data communication technology" innovatively changed the method of livelihood of mankind, the emergence of network under global dimension provided financial social benefit and posed a challenge and a threat at the same time. Form digital revolution human kind can expect to receive many important blessings. Nevertheless, there are many advantages of development of technology by digital revolution, cyberspace like online media, internet etc. has realistically many problems that must be solved. To maximum positive aspects like the expansion of freedom of expression and creating plan of economy by the advance of transmission technology is needed. And to minimize side effects of informatization is required more. The First, Special Act on ICT has an adaptation in normative standardization to be fit in media convergence beyond convergence of broadcasting and telecommunications. Henceforth, there must be established a legal basis for the achievement of protection of economic evolution and freedom of speech in digital media, information, communication technology and content development. The second, the government action is to accomplish economic development and freedom of information in structural aspect of norm. Therefore minimizing normative problem by reorganization of organization remains clearly unresolved in politics. The third, Special Act on ICT must be basic law covering info-communications field, pay telecommunication and media contents field. The forth, from a technical point of view, net neutrality, conflict of interest for digital content and so on can be fixed easily. Special Act on ICT must not only pursuit of development of industry. Special Act on ICT and pursuit of enhancing quality of life of people and preparing program to promote democratization. From now on, we need to make powerful nation of information& communications technology and in information human rights protection field got to be one step ahead of others with reference to appear all the various aspects must be brought together in the discussion of legislation process of Special Act on ICT.

• Journal of Bio-Environment Control
• /
• v.24 no.2
• /
• pp.100-105
• /
• 2015

The calculation method of infiltration loss in greenhouse has different ideas in each design standard, so there is a big difference in each method according to the size of greenhouses, it is necessary to establish a more accurate method that can be applied to the domestic. In order to provide basic data for the formulation of the calculation method of greenhouse heating load, we measured the infiltration rates using the tracer gas method in plastic greenhouses equipped with various thermal curtains. And then the calculation methods of infiltration loss in greenhouses were reviewed. Infiltration rates of the multi-span and single-span greenhouses were measured in the range of $0.042{\sim}0.245h^{-1}$ and $0.056{\sim}0.336h^{-1}$ respectively, single-span greenhouses appeared to be slightly larger. Infiltration rate of the greenhouse has been shown to significantly decrease depending on the number of thermal curtain layers without separation of single-span and multi-span. As the temperature differences between indoor and outdoor increase, the infiltration rates tended to increase. In the range of low wind speed during the experiments, changes of infiltration rate according to the outdoor wind speed could not find a consistent trend. Infiltration rates for the greenhouse heating design need to present the values at the appropriate temperature difference between indoor and outdoor. The change in the infiltration rate according to the wind speed does not need to be considered because the maximum heating load is calculated at a low wind speed range. However the correction factors to increase slightly the maximum heating load including the overall heat transfer coefficient should be applied at the strong wind regions. After reviewing the calculation method of infiltration loss, a method of using the infiltration heat transfer coefficient and the greenhouse covering area was found to have a problem, a method of using the infiltration rate and the greenhouse volume was determined to be reasonable.