• Korean Journal of Remote Sensing
• /
• 제36권2_1호
• /
• pp.217-229
• /
• 2020

Recently, weather changes in Korea have intensified due to global warming, and the five major natural disasters that occur mostly include heavy rains, typhoons, storms, heavy snow, and earthquakes. Busan is vulnerable to snow disaster, given that the amount of natural disaster damage in Busan accounts for more than 50% of the total amount in the entire metropolitan cities in Korea, and that the Busan area includes many hilly mountains. In this study, we attempted to identify vulnerable areas for snowfall disasters in Busan areas using the geographic information system (GIS) with the data for both geographical and anthropogenic characteristics. We produced the maps of vulnerable areas for evaluating factors that include altitude, slope, land cover, road networks, and demographics, and overlapped those maps to rank the vulnerability to snowfall disasters as the 5th levels finally. To weight each evaluating factor, we used an entropy method. The riskiest areas are characterized by being located in mountainous areas with roads, including Sansung-ro in Geumjeong-gu, Mandeok tunnel in Buk-gu, Hwangnyeongsan-ro in Suyeong-gu, and others, where road restrictions were actually enforced due to snowfall events in the past. This method is simple and easy to be updated, and thus we think this methodology can be adapted to identify vulnerable areas for other environmental disasters.

• Journal of Korean Society of Transportation
• /
• 제19권5호
• /
• pp.49-59
• /
• 2001

In the transportation planning process, origin and destination(O-D) trip matrix is one of the most important elements. There have been developments and applications of the methodology to adjust old matrices using link traffic counts. Commonly, the accuracy of an adjusted O-D matrix depends very much on the reliability of the input data such as the numbers and locations of traffic counting points in the road network. In the real application of the methodology, decisions on the numbers and locations of traffic counting points are one of the difficult problems, because usually as networks become bigger, the numbers of traffic counting points are required more. Therefore, this paper investigates these issues as an experiment using a nationwide network in Korea. We have compared and contrasted the set of link flows assigned by the old and the adjusted O-D matrices with the set of observed link flows. It has been analyzed by increasing the number of the traffic counting points on the experimental road network. As a result of these analyses, we can see an optimal set of the number of counting links through statistical analysis, which are approximately ten percentages of the total link numbers. In addition, the results show that the discrepancies between the old and the adjusted matrices in terms of the trip length frequency distributions and the assigned and the counted link flows are minimized using the optimal set of the counted links.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• 제33권3호
• /
• pp.1115-1122
• /
• 2013

Recently the demands for traffic information tend to increase, and travel time might one of the most important traffic information. To effectively estimate exact travel time, highly reliable traffic data collection is required. BIS(Bus Information System) data would be useful for the estimation of the route travel time because BIS is collecting data for the bus travel time on the main road of the city on real-time basis. Traditionally use of BIS data has been limited to the realm of bus operating but it has not been used for a variety of traffic categories. Therefore, this study estimates a route travel time on road networks in urban areas on the basis of real-time data of BIS and then eventually constructs regression models. These models use an explanatory variable that corresponds to bus travel time excluding service time at the bus stop. The results show that the coefficient of determination for the constructed regression model is more than 0.950. As a result of T-test performance with assistance from collected data and estimated model values, it is likely that the model is statistically significant with a confidence level of 95%. It is generally found that the estimation for the exact travel time on real-time basis is plausible if the BIS data is used.

• Journal of Korean Society of Transportation
• /
• 제26권6호
• /
• pp.103-112
• /
• 2008

Implementing hub networks in logistics is generally attractive and effective because of cost savings derived from economies of scale on network transportation, and objective of the hub network design problem is to decide optimal hub locations, and the transportation route of each origin-destination pair. This problem is generally a NP-complete problem not to solve easily, and it is almost impossible to find optimal solutions considering the big-sized network within a reasonable time. This research tried to find optimal logistics strategy in the given big-sized real network and the freight origin-destination data. The objective function, which was proposed by Honor and O'kelly (2001), that rewards economies of scale on network links with increase of transportation volumes, is applied. This thesis proposed the optimal hub network of korea within a reasonable time based on engineering approaches. And it is expected that this thesis can contribute to plan freight policies which can improve to have competitive power in the level of a company or nation by reducing logistic costs.

• Journal of Broadcast Engineering
• /
• 제22권3호
• /
• pp.282-294
• /
• 2017

In this paper, we propose a novel intelligent headlight control (IHC) system which is durable to various road lights and camera movement caused by vehicle driving. For detecting candidate light blobs, the region of interest (ROI) is decided as front ROI (FROI) and back ROI (BROI) by considering the camera geometry based on perspective range estimation model. Then, light blobs such as headlights, taillights of vehicles, reflection light as well as the surrounding road lighting are segmented using two different adaptive thresholding. From the number of segmented blobs, taillights are first detected using the redness checking and random forest classifier based on Haar-like feature. For the headlight and taillight classification, we use the random forest instead of popular support vector machine or convolutional neural networks for supporting fast learning and testing in real-life applications. Pairing is performed by using the predefined geometric rules, such as vertical coordinate similarity and association check between blobs. The proposed algorithm was successfully applied to various driving sequences in night-time, and the results show that the performance of the proposed algorithms is better than that of recent related works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제40권1호
• /
• pp.96-107
• /
• 2015

VANET technologies provide real-time traffic information for mitigating traffic jam and preventing traffic accidents, as well as in-vehicle infotainment service through Telematics/Intelligent Transportation System (ITS). Due to the rapid increasement of various requirements, the vehicle communication with a limited resource and the fixed frame architecture of the conventional techniques is limited to provide an efficient communication service. Therefore, a new flexible operation depending on the surrounding situation information is required that needs an adaptive design of the network architecture and protocol for efficiently predicting, distributing and sharing the context-aware information. In this paper, Vehicle-to-Infrastructure (V2I) based on communication between vehicle and a Road Side Units (RSU) and Vehicle-to-Vehicle (V2V) based on communication between vehicles are effectively combined in a new MAC architecture and V2I and V2V vehicles collaborate in management. As a result, many vehicles and RSU can use more efficiently the resource and send data rapidly. The simulation results show that the proposed method can achieve high resource utilization in accordance. Also we can find out the optimal transmission relay time and 2nd relay vehicle selection probability value to spread out V2V/V2I collaborative schedule message rapidly.

• Journal of KIISE:Information Networking
• /
• 제37권6호
• /
• pp.420-430
• /
• 2010

Due to increasing demand for improving road safety and optimizing road traffic, Vehicular Ad-Hoc Networks (VANET) have been subject to extensive attentions from all aspects of commercial industry and academic community. Security and user privacy are fundamental issues for all possible promising applications in VANET. Most of the existing security proposals for secure VANET concentrate authentication with privacy preservation in vehicle-to-vehicle (V2V) and vehicle-to-roadside infrastructure (V2I) communications and require huge storage and network capacity for management of revocation list. Motivated by the fact, we propose a new scheme with security and privacy preservation which combines V2V and V2I communication. With our proposed scheme, the communication and computational delay for authentication and overhead for management of revocation list can be significantly reduced due to mutual authentication between a vehicle and a Roadside Unit (RSU) requires only two messages, and the RSU issues the anonymous certificate for the vehicle on behalf of the Trust Authority (TA). We demonstrate that the proposed protocol cannot only guarantee the requirements of security and privacy but can also provide efficiency of authentication and management of revocation list.

• Korean Journal of Heritage: History & Science
• /
• 제48권3호
• /
• pp.154-165
• /
• 2015

Common issues in research and policy on cultural heritage can be extracted among Eurasian countries although countries in the region show different colors of policies and studies. Among them one thing peculiar to Central Asian countries is that in general they do not have well delineated laws and regulations on the protection of cultural heritage. It may be because they had no enough time and experience to legislate and implement relevant laws and regulations ever since they got independence. Research on cultural heritage in Central Asian countries is often made in cooperation with foreign institutions. As shown in archaeological excavation projects in Central Asian countries, cooperative projects exceed noncooperative ones in terms of size and longevity. UNESCO, through its projects on the Serial and Transboundary World Heritage Nomination of the Silk Roads in Central Asia, also supports countries in Central Asia and others along the Silk Road in order to facilitate inclusion of their cultural heritages in the Tentative List of the World Heritage. With regard to activities on the protection of cultural heritage, while respective countries in Central Asia have made good efforts, they could not produce effective outcomes due to short of budget and specialized manpower. They have rich resources of cultural and documentary heritage but their registered heritages on the UNESCO's World Heritage List and Memory of the World are under-represented because of short of technology and experience among other things. A new trend in cultural heritage studies that combined cultural heritage with tourism has merged in recent years. While some critics have raised some negative questions, this new fashion became popular and will continue with the support of governments of Silk Road countries. In conclusion, Korean institutions are further encouraged to organize cooperative networks for research and policy with respective Eurasian countries.

• Journal of the Korean Association of Geographic Information Studies
• /
• 제22권3호
• /
• pp.51-64
• /
• 2019

Mt. Geumgang has been a scenic spot representing the Korean peninsula since the Joseon Dynasty, and became a symbol of inter-Korean exchanges with the Gaesong Industrial Complex after the division of the South and North. Mt. Geumgang Tour Course is divided into the Inner-Geumgang (Naegeumgang) and the Outer-Geumgang (Oegeumgang). It was common for the Mt. Geumgang tour route during the Joseon Dynasty and the Japanese Imperialization period to enter the Inner-Geumgang, near Seoul, and come to the East Sea through the Outer-Geumgang. However, the tour route starting from Goseong was utilized for the Mt. Geumgang tour course operated by Hyundai. Because North Korea opened only the Outer-Geumgang area. North Korea has only opened some of its tour courses to Hyundai, but if Geumgang tourism is resumed in the future, there is a high possibility that it will be opened further, such as opening some sections of the Inner-Geumgang in 2007. In this case, it is necessary to connect additional transportation networks to access Inner-Geumgang from South Korea. The best alternative was the restoration of the Mt. Geumgang Railway. However, considering the fact that the reconstruction of the Mt. Geumgang Railway can not be completed due to the construction of the Imnam Dam, it is the most realistic alternative to restore Route 31 connecting Yanggu and Geumgang-eup. As a result of the analysis of road connecting Inner-Geumgang, three routes were confirmed. All of which were adjacent to the existing National Route 31. These routes passing through Dutayeon and Mundeung-ri and joining the Route 31 from Inje. Considering road length, topography characteristics, and military facility layout, it seems that the connection of 'Dutaeyun - Mundeung - Geumgang' is a realistic alternative connecting from South Korea to Inner-Geumgang.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제20권4호
• /
• pp.41-52
• /
• 2010

Message authentication is an essential security element in vehicular ad-hoc network(VANET). For a secure message authentication, integrity, availability, privacy preserving skill, and also efficiency in various environment should be provided. RAISE scheme has been proposed to provide efficient message authentication in the environment crowded with lots of vehicles and generally considered to be hard to provide efficiency. However, as the number of vehicles communicating in the area increases, the overhead is also incurred in proportion to the number of vehicles so that it still needs to be reduced, and the scheme is vulnerable to some attacks. In this paper, to make up for the vulnerabilities in dense vehicular communication network, we propose a more secure and efficient scheme using a process that RSU(Road Side Unit) transmits the messages of neighbor vehicles at once with Bloom Filter, and timestamp to protect against replay attack. Moreover, by adding a handover function to the scheme, we simplify the authentication process as omitting the unnecessary key-exchange process when a vehicle moves to other area. And we confirm the safety and efficiency of the scheme by simulating the false positive probability and calculating the traffic.