• Tunnel and Underground Space
• /
• v.18 no.1
• /
• pp.58-68
• /
• 2008

The construction of an emergency spillway of Imha Dam is being in progress on the granite region including fault fractured zone. Considering that this tunnel is being excavated in three paralled rows, the pillar width between each tunnel and the face distance between each tunnel face were evaluated. The Influence of the fault fractured zone for the tunnel stability was investigated by numerical modelling in 3D. Various geophysical investigations and rock engineering field tests were carried out for these purposes. It was suitable that the second tunnel would be excavated in advance, maintaining the face distance between each tunnel face of minimum 25 m. The results of numerical modelling showed that the roof displacement and the convergence of the second tunnel were insignificant, and the maximum bending compressive stress, the maximum shear stress of shotcrete and the maximum axial force of rockbolt were also insignificant. Therefore, it was estimated that the stability of the spillway tunnel was ensured.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.80-87
• /
• 2013

This paper proposes a CW (Contention window) allocation scheme for real-time data transmission of emergency data on VANET (Vehicle to vehicle Ad hoc Network, V2V) protocol. The proposed scheme reduces the probability of packet collisions on V2V protocol and provides bandwidth efficiency with short delay of emergency sporadic data. In the case of high density traffic, the proposed scheme provides a decrease of recollision probability using dynamic CW adjustments. For the performance analysis, a throughput, end-to-end delays, and network loads were investigated on highway traffic. Simulation results show the performance enhancements in terms of the throughput, end-to-end delays, and network loads.

• Journal of Korea Game Society
• /
• v.16 no.3
• /
• pp.97-108
• /
• 2016

Multi-client online games usually employ multi-serve architectures. For group play, if the user response time deviation between the clients in a group is large, the fairness and attractions of the game will be degraded. In this paper, given new clients, we propose a method for assigning the clients to servers to minimize the deviation of client-server distance which plays a major role in the user response time. This method also supports client matching for group play and server load balancing. We formulate the client-server assignment problem as an IP one, and present a GA(Genetic Algorithm)-based algorithm to solve it. We experimented our method under various settings and analyzed its features. To our survey, little research has been previously performed on client-server assignment under consideration of client matching, distance deviation minimization and server load balancing.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.39 no.2
• /
• pp.273-279
• /
• 2019

Development of mountain area is increasing due to the demand for improvement of traffic convenience and development of underdeveloped area. Therefore, there frequently are sections where tunnels and interchanges are located close to each other. These sections do not only affect tunnel planning, types and length of interchanges, but also affect more on route selection. In Korea, several design criteria present each reference value but these values are very similar. In the situation, the minimum value among them is usually applied when planning roads and it could cause traffic safety problems in different site conditions. In this study, the problems of design speed, illuminance adaptation distance, and lane change intervals are analyzed by simulating the cases that the problem could occur when calculating the separation distance between tunnel and interchange. The results obtained from this study can be summarized as following: the driving speed should be applied in case that the site has a big gap between design speed and driving speed because the uniform application of the design speed is not safe; the illuminance adaptation distance should include the influence distance in the section affected by the direct light; in addition, the lane change distance should include the time to perceive the situation of the next lane after the lane change in the section required for successive lane change.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.943-957
• /
• 2014

Removing noise, called denoising, is an essential factor for the more intuitive and more accurate results in boundary image matching. This paper deals with a partial denoising problem that tries to allow a limited amount of partial noise embedded in boundary images. To solve this problem, we first define partial denoising time-series which can be generated from an original image time-series by removing a variety of partial noises and propose an efficient mechanism that quickly obtains those partial denoising time-series in the time-series domain rather than the image domain. We next present the partial denoising distance, which is the minimum distance from a query time-series to all possible partial denoising time-series generated from a data time-series, and we use this partial denoising distance as a similarity measure in boundary image matching. Using the partial denoising distance, however, incurs a severe computational overhead since there are a large number of partial denoising time-series to be considered. To solve this problem, we derive a tight lower bound for the partial denoising distance and formally prove its correctness. We also propose range and k-NN search algorithms exploiting the partial denoising distance in boundary image matching. Through extensive experiments, we finally show that our lower bound-based approach improves search performance by up to an order of magnitude in partial denoising-based boundary image matching.

• Journal of Radiation Protection and Research
• /
• v.30 no.1
• /
• pp.17-25
• /
• 2005

Since the safety of nuclear power plant has been becoming a big social issue the exposure dose of radiation for workers has been one of the important factors concerning the safety problem. The existing calculation methods of radiation dose used in the planning of radiation work assume that dose rate does not depend on the location within a work space thus the variation of exposure dose by different work path is not considered. In this study, a modified numerical method was presented to estimate the exposure dose during radiation work in radwaste storage considering the effects of the distance between a worker and sources. And a new numerical algorithm was suggested to search the optimal work path minimizing the exposure dose in pre-defined work space with given radiation sources. Finally, a virtual work simulation program was developed to visualize the exposure dose of radiation doting radiation works in radwaste storage and provide the capability of simulation for work planning. As a numerical example, a test radiation work was simulated under given space and two radiation sources, and the suggested optimal work path was compared with three predefined work paths. The optimal work path obtained in the study could reduce the exposure dose for the given test work. Based on the results, tile developed numerical method and simulation program could be useful tools in the planning of radiation work.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.33 no.4
• /
• pp.148-159
• /
• 2021

This study estimates the region of freshwater influence (ROFI) by Han River discharge in the Yeomha channel, Gyeonggi Bay. A 3-D numerical model, which is validated for reproducibility of variation in current velocity and salinity, is applied in Gyeonggi Bay. Distance of freshwater influence (DOFI) is defined as the distance from the entrance of Yeomha channel to the point where surface salinity is 28 psu. Model scenarios were constructed by dividing the Han River discharge into 10 categories (200~10,000 m³/s). The relation equation between freshwater discharge and DOFI was calculated based on performing a non-linear regression analysis. ROFI in Yeomha channel expands from the southern sea area of Ganghwa-do to the northern sea area of Yeongheung-do as the intensity of Han River discharge increases. The discharge and DOFI are a proportional relationship, and the increase rate of DOFI gradually decreases as discharge increases. Based on the relation equation calculated in this study, DOFI in the Yeomha channel can be estimated through the monthly mean Han River discharge. Accordingly, it will be possible to respond and predict problems related to damage to water quality and ecology due to rapid freshwater runoff.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.483-492
• /
• 1993

미래의 차의 선택사항이 될 여행정보시스템을 설치하여 그 성능의 인간공학적 조사를 수행하였다. 이 시스템을 실제로 GM자동차 Oldsmobile Toronado형 100대에 설치하여 사용자가 얼마나 쉽게, 빨리 그리고 안락하게 갈 수 있고, 어떻게 하면 좀 더 이것을 인간공학적으로 향상시킬수 있는 가를 연구하였다. 100대중 23대는 대학교에서 연구를 하고 나머지는 AAA회사의 회원권을 가진 지역사용자들에게 AAA회사와 AVIS회사를 통하여 대여를 하여 컴퓨터차(TravTek시스템)의 성능과 효율성을 시험하였다. 그 내용을 살펴보면, 차에 부착된 컴퓨터의 컬러화면으로 사용자에게 도로를 보여주고, 컴퓨터가 최단거리를 제시하여 운전자에게 컴퓨터음성과 화면으로 길을 안내한다. 그 파급효과로 도로 체증현상을 막고, 기름의 낭비도 절약하고, 밤에도 안전하게 운행할 수 있게 할 뿐만아니라 처음보는 거리라고 하더라도 컴퓨터가 안내하면서 목적지까지 무사히 도착할 수 있게 하여 준다. 이러한 시스템을 설치한 차를 타고 여행할 때, 여행자가 과연 얼마나 안락하게 여행할 수 있으며, 도로의 체증현상을 줄이고, 사고를 예방하며, 차의 설계와 목적이 인간공학적으로 합당한 가를 알아보고자 하는 연구이다. 인간공학적 평가 인자들은 (1) 운전자의 수행도, (2) 사용자 선호도, (3) 사용자 인식, (4) 운행정보등이다. 그리고 컴퓨터음성을 사용하였을 때와 사용하지 않았을 때의 두가지 경우와 (1) 움직이는 컴퓨터지도를 사용하였을 때 (2) 단순화한 도로안내를 사용하였을 때, (3) 컴퓨터 지도를 사용하지 않았을 경우(종이지도사용)에 관해 위의 4가지 인간공학적 인자들을 평가하고자 한다. 이 연구는 아직도 진행중이라 발표하고자 하는 논문역시 현재까지의 연구결과를 토대로 발표하는 것이므로 완전한 결론을 내릴 수는 없고, 진행과 정의내용과 토의사항과 잠정적인 결론을 제시하고자 한다. 의거한 작업순서 결정을 위해 우선 BB의 상한을 구하는 연구를 행했다. 이를 위해 우선 단일작업장에서 야기될 수 있는 모든 상황을 고려한 최적 작업순서 결정규칙을 연구했으며, 이의 증명을 위해 이 규칙에 의거했을 때의 보완작업량이 최소가 된다는 것을 밝혔다. 보완작업 계산의 효율성을 제고하기 위해 과부하(violation)개념을 도입하였으며, 작업유형이 증가된 상황에서도 과부하 개념이 보완작업량을 충분히 반영할 수 있음을 밝혔다. 본 연구에서 제시한 최적 작업순서 규칙에 의거했을 때 야기될 수 있는 여러가지 경우의 과부하를 모두 계산했다. 앞에서 개발된 단일작업량의 최적 작업순서 결정규칙을 이용하여 다작업장의 문제를 실험했다. 이 문제는 규모가 매우 크므로 Branch & Bound를 이용하였으며, 각 가지에서 과부하량이 최적인 경우만을 고려하는 휴리스틱을 택하여 실험자료를 이용하여 여러 회 반복실험을 행했다. 그리고 본 연구의 성과를 측정하기 위해 휴리스틱 기법시 소요되는 평균 CPU time 범위에서, 랜덤 작업순서에 따른 작업할당을 반복실험하여 이중 가장 좋은 해와 비교했다. 그러나 앞으로 다작업장 문제를 다룰 때, 각 작업장 작업순서들의 상관관계를 고려하여 보다 개선된 해를 구하기 위한 연구가 요구된다. 또한, 준비작업비용을 발생시키는 작업장의 작업순서결정에 대해서도 연구를 행하여, 보완작업비용과 준비비용을 고려한 GMMAL 작업순서문제를 해결하기 위한 연구가 수행되어야 할 것이다.로 이루어 져야 할 것이다.태를 보다 효율적으로 증진시킬 수 있는 대안이 마련되어져야 한다고 사료된다.$\ulcorner$순응$\lrcorner$의 범위를 벗어나지 않는다. 그렇기 때문에도 $\ulcorner$순응$\lrcorner$과 $\ulcorner$표현$\lrcorner$

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.6
• /
• pp.488-496
• /
• 2015

This paper proposes a framework to determine the routes of multiple unmanned aerial vehicles (UAVs) to conduct multiple tasks in different locations considering the survivability of the vehicles. The routing problem can be formulated as the vehicle routing problem (VRP) with different cost matrices representing the trade-off between the safety of the UAVs and the mission completion time. The threat level for a UAV at a certain location was modeled considering the detection probability and the shoot-down probability. The minimal-cost path connecting two locations considering the threat level and the flight distance was obtained using the Dijkstra algorithm in hexagonal cells. A case study for determining the optimal routes for a persistent multi-UAVs surveillance and reconnaissance missions given multiple enemy bases was conducted and its results were discussed.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.3
• /
• pp.83-90
• /
• 2020

Prototype selection offers the advantage of ensuring low learning time and storage space by selecting the minimum data representative of in-class partitions from the training data. This paper designs a new training data generation method using hyper-rectangles that can be applied to general classification algorithms. Hyper-rectangular regions do not contain different class data and divide the same class space. The median value of the data within a hyper-rectangle is selected as a prototype to form new training data, and the size of the hyper-rectangle is adjusted to reflect the data distribution in the class area. A set cover optimization algorithm is proposed to select the minimum prototype set that represents the whole training data. The proposed method reduces the time complexity that requires the polynomial time of the set cover optimization algorithm by using the greedy algorithm and the distance equation without multiplication. In experimented comparison with hyper-sphere prototype selections, the proposed method is superior in terms of prototype rate and generalization performance.