• Journal of the Korean Geographical Society
• /
• v.50 no.2
• /
• pp.203-216
• /
• 2015

This paper examined the changes of urban system through the network and the flow pattern reflected in daily movement in Korea. Because daily movement reflects trip pattern, urban system formed by inter-city linkages can be recognized in terms of living sphere. While population movements between cities have the number of linkage systems of city network and the number of traffic regions composed of the origin and destination has increased respectively. Nevertheless, spatial extent of Capital region and Busan region has been expanded. In Gangwon-do in which Seoul-oriented high-speed transportation network has developed, separation of living sphere between Yeongdong area and the Soyanggang cultural region formed around Chuncheon was intensified. Living sphere that includes Daejeon and the surrounding cities has been expanded to the southern Gyeonggi-do. The existing living sphere formed in Jeollanam-do was fragmented into the east and west around Mokpo and Suncheon due to the weakened centrality of Gwangju. Living spheres formed by spatial interaction were consistent with regional administrative boundary. Considering the increased interaction between Seoul and its surrounding cities, the development of global city-region centered on Seoul is expected.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.35-42
• /
• 2009

One of the problems we face up at the time of planning or improving a transportation transfer facility is which modes and how close we have to put together. The goal here is to keep the connecting transportation mode as close as possible to the prime transit mode, so people travel a minimum transfer path, a distance from one mode to another. Too much a physical separation between modes will limit, even with an intensive improvement of the component links, the level of service of a transfer path as a whole. This study defined a transfer path as the whole stretch of the distance from an arrival point of one mode to the departure point of the connecting mode. The transfer path was divided into three typical segments as side walk, stairways, and indoor corridors. Preference surveys were made for each of these segments, resulting in relative resistance. The sum of individual segments weighted with the relative resistance will make a transfer resistance of the path, which in turn constitutes a transfer utility function together with the overall satisfaction score obtained by the interview survey. The transfer utility function has been utilized to evaluate the transfer distance between modes.

• Journal of the Korean association of regional geographers
• /
• v.20 no.2
• /
• pp.153-162
• /
• 2014

This Research is to study types and distribution for place name of migration derived from Korea Peninsula by analyzing villages name of the Yanbian Korean Autonomous Prefecture. Village names of Yanbian Korean were identified as 945 out of 2,015. Place name migrated from Korea Peninsula was turned out 51 villages. Up to the present time in the Transition of China, 34 place names were disappeared, maintained place names were 16, and rehabilitated place name after loss was 1. The place name by naming method were classified as small area directed migration, large area directed migration, and merged migration. In case of small area directed migration, origin and destination is same such as Jeongeup and Muju, Cheonbuk, large area directed migration is named case by region migrants like a Gangwonchon named by people moved from GanwonDo, and merged case combine initials with each village names in case of GilseongChon by colligated Gilju and Seokseongmyeon. The results will be expected to support research information for identity and ethnical migration process.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2019.05a
• /
• pp.38-39
• /
• 2019

Optimal route planning is the route planning to minimize voyage time or fuel consumption in a given ocean environment. Unlike the previous studies on weather routing, this study proposes an optimization method for the route planning to avoid the grounding risk in the coast. The route way-points were searched using Dijkstra algorithm, and then the optimization was performed to minimize fuel consumption by setting the optimization design parameter to the engine rpm. To set the engine rpm, a method to use the fixed rpm from the departure point to the destination point, and a method to use the rpm for each section by dividing the route were used. The ocean environmental factors considered for route planning were wind, wave, and current, and the depth information was utilized to compute grounding risk. The proposed method was applied to the ship passing between Mokpo and Jeju, and then it was confirmed that fuel consumption was reduced by comparing the optimum route and the past navigated route.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.63-74
• /
• 2021

Location-based services (LBSs) are expected to process a large number of spatial queries, such as shortest path and k-nearest neighbor queries that arrive simultaneously at peak periods. Deploying more LBS servers to process these simultaneous spatial queries is a potential solution. However, this significantly increases service operating costs. Recently, batch processing solutions have been proposed to process a set of queries using shareable computation. In this study, we investigate the problem of batch processing moving k-nearest neighbor (MkNN) queries in dynamic spatial networks, where the travel time of each road segment changes frequently based on the traffic conditions. LBS servers based on one-query-at-a-time processing often fail to process simultaneous MkNN queries because of the significant number of redundant computations. We aim to improve the efficiency algorithmically by processing MkNN queries in batches and reusing sharable computations. Extensive evaluation using real-world roadmaps shows the superiority of our solution compared with state-of-the-art methods.

• 월간산업보건
• /
• s.258
• /
• pp.45-48
• /
• 2009

운수 회사의 사업장 소재지나 이 사건 차량의 차고지 및 원고의 주거지 관계에 비추어 원고가 이 사건 차량 이외에 청주나 송탄사료공장까지 출 퇴근하는 방법이 있었다고 보이지 않고, 그에 따라 원고의 입사 당시 사업주가 이 사건 차량을 원고의 주거지 부근에 주차한 후 이를 이용하여 청주나 송탄사료공장으로 가서 사료를 공급받아 업무를 수행하도록 용인하였던 점, 그에 따라 이 사건 차량에 대한 관리 이용권이 전적으로 원고에게 전담되어 있었고, 원고의 주된 업무가 빈 화물차량을 운전하여 사료공장으로 가서 사료를 공급받은 후 각 양계농장에 사료를 운반 배송하는 업무로 이러한 업무내용이나 근무형태 등에 비추어 원고가 화물차에 탑승하여 운전을 개시하는 때로부터는 업무수행이 시작되어 사업주의 지배 관리하에 있다고 보이는 점(원고가 자택에서 이 사건 차량에 도착할 때까지가 출근에 해당하고, 그 이후 차량에 탑승한 이후에는 바로 업무의 개시가 있었다고 할 것이다) 등에 비추어 보면, 원고가 재해 당일 새벽 청주사료공장으로 가기 위하여 이 사건 차량을 운전하다가 발생한 이 사건 재해는 업무상 재해라고 봄이 상당하다.

• The Journal of the Korea Contents Association
• /
• v.16 no.1
• /
• pp.482-492
• /
• 2016

Purpose This study is to investigate regional characteristics of 119 ambulance dispatch and the relationship between the distance and response time to the scene. Methods This study was retrospectively conducted 119 running sheets with 1,321 patients who had been transferred to the hospital by 119 ambulance during ambulance attendant training. The training was performed at two, five and three fire station in Seoul, Daejeon and Chungnam respectively, from June 24, 2013 to July 19, 2014. Results Almost the emergency medical services provided were no more than basic first aid in all regions. The patients transferred by 119 ambulance in Seoul were more than other region. The time of call to scene and scene to hospital were the slowest in Chungnam. The major reason of call 119 was due to disease in Seoul and Daejeon, however due to injury in Chungnam. Conclusion Our study suggests that learning from ambulance attendant training course could diverse from region to region. It is, therefore, needed that standardization of ambulance attendant training course, appropriate logistics and resource allocation for providing universal quality of emergency medical services.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.1
• /
• pp.45-55
• /
• 2022

Currently, the Collective Control Algorithm is the most popular elevator algorithm. The Collective Control Algorithm allows the user to use the elevator when the direction of movement of the elevator and the direction of the user's destination are the same. However, the algorithm has a problem in that only one elevator responds to a user's call when the user's waiting time and using multiple elevators. To solve this problem, this paper proposes a new hybrid HRN algorithm based on the highest response ratio next (HRN) algorithm. In general, HRN Algorithm requires a user's boarding time and getting off time, but due to the nature of the elevator, it is difficult to predict the user's call in advance. Therefore, to overcome these limitations, this paper proposes Hybrid HRN Algorithm that considers the distance between the user's call location and the arrival location. This paper shows that Hybrid HRN Algorithm, proposed through experiments, has an average waiting time of 23.34 seconds, a standard deviation of 11.86, a total moving distance of 535.2m, a total operating time of 84sec, and a driving balance between the two elevators is 92m, which is superior to the previously suggested Collective Control, Zoning, and 3-Passage Algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.19-26
• /
• 2003

Recently, the number of internet service companies is increasing and so is the number of malicious attackers. Damage such as distrust about credit and instability of the service by these attacks may influence us fatally as it makes companies image failing down. One of the frequent and fatal attacks is DoS(Denial-of-Service). Because the attacker performs IP spoofing for hiding his location in DoS attack it is hard to get an exact location of the attacker from source IP address only. and even if the system recovers from the attack successfully, if attack origin has not been identified, we have to consider the possibility that there may be another attack again in near future by the same attacker. This study suggests to find the attack origin through MAC address marking of the attack origin. It is based on an IP trace algorithm, called Marking Algorithm. It modifies the Martins Algorithm so that we can convey the MAC address of the intervening routers, and as a result it can trace the exact IP address of the original attacker. To improve the detection time, our algorithm also contains a technique to improve the packet arrival rate. By adjusting marking probability according to the distance from the packet origin we were able to decrease the number of needed packets to traceback the IP address.

• Journal of Korean Society of Transportation
• /
• v.12 no.4
• /
• pp.89-97
• /
• 1994

신호화된 교차로의 운영비율을 측정하기 위해 현재 세계적으로 광범위하게 이용되 는 척도는 교차로 통과차량의 평균지체시간이다. 그간 교차로 분석을 위해 많은 대기행렬 모형이 발표되어 왔고 또 그중 일부가 현재 사용 중에 있는데 이들은 모두 steady-state를 가정한 해법이다. 그러나 steady-state 모형은 시간에 따른 대기행렬 길이의 변화를 고려하 지 못하므로 현실적인 분석에 한계가 있는 방법론이다. 그러므로 정당한 교차로 시간산출을 위해서는 time-dependent한 분석형의 개발이 요구된다. 본 연구에서는 discrete Markov chain을 이용하여 단순히 단위시간 동안의 도착율과 출발율로써 transition probabilities를 계산하는 새로운 대기행렬 모형을 개발하였다. 개발된 불연속 대기행렬 모형을 이용하여 교 차로 분석을 할 경우 기존의 교차로 지체모형과 비교하여 기대되는 개선효과는 다음과 같 다. 변화를 고려한 dynamic한 분석으로 현실적이고 정당한 예측을 할 수 있다. 신호자동에 의한 영향을 분석할 수 있다. 그리고 독립적교차로 뿐만 아니라 간선도로, 나아가서 network 분석을 할 수 있으며, 동시에 주어지 교통여건에 대해 신호자동화를 위한 최적값을 산출해 낸다.