• Tunnel and Underground Space
• /
• v.9 no.4
• /
• pp.306-314
• /
• 1999

In underground spaces including nuclear waste repository, prediction of air quantity, temperature/humidity and pollutant concentration is utmost important for space construction and management during the normal state as well as for determining the measures in emergency cases such as underground fires. This study aims at developing a model for underground space environment which has capabilities to take into account the effects of autocompression for the natural ventilation head calculation, to find the optimal location and size of fans and regulators, to predict the temperature and humidity by calculating the convective heat transfer coefficient and the sensible and latent heat transfer rates, and to estimate the pollutant levels throughout the network. The temperature/humidity prediction model was applied to a military storage underground space and the relative differences of dry and wet temperatures were 1.5 ~ 2.9% and 0.6 ~ 6.1%, respectively. The convection-based pollutant transport model was applied to two different vehicle tunnels. Coefficients of turbulent diffusion due to the atmospheric turbulence were found to be 9.78 and 17.35$m^2$/s, but measurements of smoke and CO concentrations in a tunnel with high traffic density and under operation of ventilation equipment showed relative differences of 5.88 and 6.62% compared with estimates from the convection-based model. These findings indicate convection is the governing mechanism for pollutant diffusion in most of the tunnel-type spaces.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.145-154
• /
• 2004

The growing demand for customer-responsive, made-to-order manufacturing is stimulating the need for improved dynamic decision-making processes in commercial fleet operations. Moreover, the rapid growth of electronic commerce through the internet is also requiring advanced and precise real-time operation of vehicle fleets. Accompanying these demand side developments/pressures, the growing availability of technologies such as AVL(Automatic Vehicle Location) systems and continuous two-way communication devices is driving developments on the supply side. These technologies enable the dispatcher to identify the current location of trucks and to communicate with drivers in real time affording the carrier fleet dispatcher the opportunity to dynamically respond to changes in demand, driver and vehicle availability, as well as traffic network conditions. This research investigates key aspects of real time dynamic routing and scheduling problems in fleet operation particularly in a truckload pickup-and-delivery problem under various settings, in which information of stochastic demands is revealed on a continuous basis, i.e., as the scheduled routes are executed. The most promising solution strategies for dealing with this real-time problem are analyzed and integrated. Furthermore, this research develops. analyzes, and implements hybrid algorithms for solving them, which combine fast local heuristic approach with an optimization-based approach. In addition, various partitioning algorithms being able to deal with large fleet of vehicles are developed based on 'divided & conquer' technique. Simulation experiments are developed and conducted to evaluate the performance of these algorithms.

• The Journal of the Korea Contents Association
• /
• v.13 no.12
• /
• pp.575-584
• /
• 2013

Data types used for big-data analysis are very widely, such as news, blog, SNS, papers, patents, sensed data, and etc. Particularly, the utilization of web documents offering reliable data in real time is increasing gradually. And web crawlers that collect web documents automatically have grown in importance because big-data is being used in many different fields and web data are growing exponentially every year. However, existing web crawlers can't collect whole web documents in a web site because existing web crawlers collect web documents with only URLs included in web documents collected in some web sites. Also, existing web crawlers can collect web documents collected by other web crawlers already because information about web documents collected in each web crawler isn't efficiently managed between web crawlers. Therefore, this paper proposed a distributed web crawler. To resolve the problems of existing web crawler, the proposed web crawler collects web documents by RSS of each web site and Google search API. And the web crawler provides fast crawling performance by a client-server model based on RMI and NIO that minimize network traffic. Furthermore, the web crawler extracts core content from a web document by a keyword similarity comparison on tags included in a web documents. Finally, to verify the superiority of our web crawler, we compare our web crawler with existing web crawlers in various experiments.

• Archives of design research
• /
• v.20 no.1 s.69
• /
• pp.45-54
• /
• 2007

Recent research regarding local traditions, cultural heritage, and sightseeing resources that represent local characteristics for the purpose of local promotion has been actively advanced. Yangyeongsi in Daegu, South Korea is Doing developed as a core location in order to revitalize regional culture. The unique tradition and functions of this city area have been preserved. Previous research "The Fundamental Research of Revitalization for Yangyeongsi in Daegu for the Local Promotion" undertaken by the author revealed a lack of fundamental research available to establish an understanding of how to revitalize Yangyeongsi. The research methodology designed this by, (1)a site investigation and verification of previous research (2)a deep analysis of Yangyeongsi to uncover potential improvement opportunities (3) assessment of essential elements and appropriate directions for revitalization of the traditional market (4) application of the environment design improvement process to the local design center. The design proposal is that, firstly, space assessment will De improved by the maintenance and expansion of fundamental facilities. Secondly, space application can be maximized by servicing the complex road network through a traffic flow plan. In addition, consideration for the local characteristics will promote unity and identification with the region. Lastly, revitalization and industrialization development of sightseeing resources and secure streets and event spaces will promote enjoyable experiences for visitors. Research results were submitted to the local authority and applied to the future policy plan. Continuous research on revitalization and analysis of the local characteristics are recommended in order to benefit local promotion.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.272-283
• /
• 2010

Wireless Mesh Networks (WMNs) have gained a lot of attention recently. Based on the characteristic of WMNs as a highly connected wireless infrastructure, many efforts from research organizations are made in order to improve the performance of the flow throughput in WMNs. Therefore, it is very critical issue to establish efficient routing paths for multiple concurrent ongoing flows. In this paper, we propose a general modeling methodology to analyze the end-to-end throughput of multiple concurrent flows by analytical calculation taking into account the carrier sensing behaviors, interference and the IEEE 802.11 Distributed Coordination Function mechanism. After the comparison of the average service time for each successful transmission at each node, we analyze the bottlenecks of flows, and hence obtain the maximum end-to-end throughput of them. By using our proposed model, it is possible to predicate the throughput of several candidate routing paths for multiple concurrent ongoing data flows, so we can select the most efficient route that can achieve the highest throughput. We carry out simulations with various traffic patterns of multiple flows in WMNs to validate our modeling and our efficient route selection mechanism.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.12
• /
• pp.7292-7301
• /
• 2014

With the development of IT Info-Communications technology, the vehicle with a combination of wireless-communication technology has resulted in significant research into the convergence of the component of existing traffic with information, electronics and communication technology. Intelligent Vehicle Communication is a Machine-to-Machine (M2M) concept of the Vehicle-to-Vehicle. The Vehicle-to-Infrastructure communication consists of safety and the ease of transportation. Security technologies must precede the effective Intelligent Vehicle Communication Structure, unlike the existing internet environment, where high-speed vehicle communication is with the security threats of a wireless communication environment and can receive unusual vehicle messages. In this paper, the Vehicle Identification number between the V2I and the secure message communication protocol was proposed using hash functions and a time stamp, and the validity of the vehicle was assessed. The proposed system was the performance evaluation section compared to the conventional technique at a rate VPKI aspect showed an approximate 44% reduction. The safety, including authentication, confidentiality, and privacy threats, were analyzed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.613-627
• /
• 2004

In this paper, we propose an Aggregate Fairness Maker (ARM) required for an Edge router to improve fairness of throughput among the flows of Assured Service in DiffServ with different round trip time (RTT) and we propose a user flow Three Color Marker (uf-TCM) as a flow marker that marks packets from the flow as green, yellow, or red. A yellow packet is the packet that consumes loss token in uf-TCM as well as that is demoted green packet in AM due to disobey the aggregate traffic profile. The proposed AFH promotes yellow packet to green packet or demotes green packet to yellow packet through the fair method without per-flow management, and it improves the feirness of throughput among the flows as well as link utilization. A yellow packet and a red packet have the same drop precedence at Core Router in our scheme. So we can use the RIO buffer management scheme. We evaluated the performance of our proposed AFM and the REDP Marker that was proposed to improve fairness without per-flow management. Simulation results show that, compared with the REDP marker, proposed AFM can improve performance of throughput fairness among the flows with different RTT and link utilization under the over-provisioning, exact-provisioning, and under-provisioning network environments at Multiple DiffServ domains as well as at Single DiffServ domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.679-689
• /
• 2006

Delivering multicast stream is one of the cost-saving approach in the large scale VOD environment. Because implementing VCR-like interactions for user's convenience in the multicast streaming system involves complex problems, we need the proper solutions for them. In this paper, we propose a hybrid scheme which uses the general P2P and the patching scheme with the Collaborative Interaction Streaming Scheme(CISS). CISS provides jumping functionability to the appropriate multicast session after VCR-like interaction in the environment in which multiple peers transmit VCR-like interaction streams to the VCR-like functionability request node to reduce the loads generated by frequent join or departure of peers at the multicast tree during providing VCR-like functionability. Therefore, with the proposed scheme we can distribute network traffic and reduce control overhead and latency. And to evaluate the performance of proposed scheme we compare it in the aspect of the performance of streaming delivery topology, control overhead and streaming quality with P2Cast[10] and DSL[11]. The simulation result shows that proposed P2Patching reduces about 30% of process overhead and enhances about $25{\sim}30%$ of streaming quality compared with DSL.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.3
• /
• pp.1-11
• /
• 2007

Seoul's transportation system was changed drastically starting the first of June in two thousand. This policy includes integrated distance-based fare system and public transportation card system called smart card. Especially, as public transportation card data contains individual travel, transfer and using modes information it is possible to catch the characteristics of path-based individuals and mass transit. Thus, public transportation card data can contribute to evaluate the mass transit service in integrated public transportation networks. In addition, public transportation card data are able to help to convert previous researches and analyses with link-based trip assignment models to path-based mass transit service analysis. In this study, an algorithm being suitable for path-based trip assignment models is suggested and proposed algorithm can also contribute to make full use of public transportation card data. For this, column generation algorithm hewn to draw the stable solution is adopted. This paper uses the methodology that is to take local approximate equilibrium from partial network and expand local approximate equilibrium to global equilibrium.