• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.2
• /
• pp.15-22
• /
• 2006

This paper presents a novel signal tracking algorithm for GNSS receivers using a MLE technique. In order to perform a robust signal tracking in severe signal environments, e.g., high dynamics for navigation vehicles or weak signals for indoor positioning, the MLE based signal tracking approach is adopted in the paper. With assuming white Gaussian additive noise, the cost function of MLE is expanded to the cost function of NLSE. Efficient and practical approach for Doppler frequency tracking by the MLE is derived based on the assumption of code-free signals, i.e., the cost function of the MLE for carrier Doppler tracking is used to derive a discriminator function to create error signals from incoming and reference signals. The use of the MLE method for carrier tracking makes it possible to generalize the MLE equation for arbitrary codes and modulation schemes. This is ideally suited for various GNSS signals with same structure of tracking module. This paper proposes two different types of MLE based tracking method, i.e., an iterative batch processing method and a non-iterative feed-forward processing method. The first method is derived without any limitation on time consumption, while the second method is proposed for a time limited case by using a 1st derivative of cost function, which is proportional to error signal from discriminators of conventional tracking methods. The second method can be implemented by a block diagram approach for tracking carrier phase, Doppler frequency and code phase with assuming no correlation of signal parameters. Finally, a state space form of FLL/PLL/DLL is adopted to the designed MLE based tracking algorithm for reducing noise on the estimated signal parameters.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.1
• /
• pp.1-14
• /
• 2014

The expansion of the physical road in response to changes in social conditions and policy of the country has reached the limit. In order to alleviate congestion on the existing road to reconsider the effectiveness of this method should be asking. Currently, how to collect traffic information for management of the intersection is limited to point detection systems. Intelligent Transport Systems (ITS) was the traffic information collection system of point detection method such as through video and loop detector in the past. However, intelligent transportation systems of the next generation(C-ITS) has evolved rapidly in real time interval detection system of collecting various systems between the pedestrian, road, and car. Therefore, this study is designed to evaluate the development of an algorithm for queue length based real-time traffic signal control methodology. Four coordinates estimate on time-space diagram using the travel time each individual vehicle collected via the interval detector. Using the coordinate value estimated during the cycle for estimating the velocity of the shock wave the queue is created. Using the queue length is estimated, and determine the signal timing the total queue length is minimized at intersection. Therefore, in this study, it was confirmed that the calculation of the signal timing of the intersection queue is minimized.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.651-659
• /
• 2004

The Fast Handover protocol ［1］ provides seameless handover in wireless If networks by minimizing handover latency, which uses anticipation based on layer 2 (L2) trigger information. Therefore, it incurs higher signaling costs compared with the basic Mobile U protocol. Furthermore, since the L2 trigger is based on fluctuating wireless channel states, the handover anticipation may sometimes be incorrect. In the case of incorrect anticipation, unnecessary buffer space may be used for the purpose of providing a smooth handover. Therefore, it is essentical to analyze these overhead costs, in order to evaluate and compare the performance of Fast Handover with that of the basic Mobile U protocol. In this paper, we analyzed the overhead associated with Fast Handover including the signaling cost and the packet delivery cost. We formulated these costs based on a timing diagram and compared Fast Handover with basic Mobile Ipv6 in terms of their packet loss rates and buffer requirements. Also, we studied the impact of the L2 triggering time on the total overhead cost.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.673-673
• /
• 2015

Earthwork is an operation that provides space for structures, and it takes up a large portion of the construction costs in a construction project. In large-scale earthwork, numerous types of construction equipment are used in the operation. The types of equipment should be selected based on the field conditions and the construction methods. These construction vehicles are constantly changing positions during the earthwork operation. Therefore, the equipment operators require effective communication to ensure the efficiency of the earthwork operation. All equipment operators should exchange information with the other equipment operators. Information should be exchanged continuously to support decision making and increase productivity during the earthwork operation at the construction site. This paper investigates the attributes required for an information interface between construction vehicles during an earthwork operation. This paper 1) discusses the importance of an information interface for construction vehicles in order to increase productivity during an earthwork operation, 2) analyses the types of attributes that need to be communicated between construction vehicles, and 3) provides a database that has been built for attribute control. The database built for the information interface between construction vehicles will enhance communication between vehicle operators. Table I shows the typical attributes that should be shared between the excavator operator and the dump truck operator. This information needs to be shared among the operators, as it helps them to plan the earthwork operation in a more efficient manner. A database has been developed to store this information in an entity relation diagram. A user-interface display environment is also developed to provide this information to the operators in the construction vehicles. The proposed interface can help exchange information effectively and facilitate a common understanding during the earthwork operation. For example, the vehicle operators will be aware of the planned volume, excavated volume, transportation time, and transportation numbers. As a part of this study, mobile devices, such as mobile phones and google glasses, will be used as hands-on communication tools.

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.185-196
• /
• 2007

The aim of this research is to develop a signal control algorithm using internal metering to minimize total delay that vehicles go through, in case a network is oversaturated. To calculate total delay on the network, the authors first detect vehicles' arrivals and departures in the network through the detecting system, and chase the vehicles' flow in the links with a platoon dispersion model. Following these, the authors calculate the queue length in all the inks of the network through the chase of vehicles, deduce the stopped time delay, and finally convert the stopped time delay to the approach delay with a time-space diagram. Based on this calculated delay, an algorithm that calculates the level of the internal metering necessary to minimize the deduced approach delay is suggested. To verify effectiveness of this suggested algorithm, the authors also conduct simulation with the micro-simulator VISSIM. The result of the simulation shows that the average delay per vehicle is 82.3 sec/veh and this delay is lower than COSMOS (89.9sec/veh) and TOD (99.1sec/veh). It is concluded that this new signal control algorithm suggested in this paper is more effective in controlling an oversaturated network.

• Journal of Korean Society of Transportation
• /
• v.33 no.1
• /
• pp.14-28
• /
• 2015

Numerous research has been conducted using internet search data since the mid-2000s. For example, Google Inc. developed a service predicting influenza patterns using the internet search data. The main objective of this study is to prove the hypothesis that highway traffic indices are similar to the internet search patterns. In order to achieve this objective, a model to predict the number of vehicles entering the expressway and space-mean speed was developed and the goodness-of-fit of the model was assessed. The results revealed several findings. First, it was shown that the Google search traffic was a good predictor for the TCS entering traffic volume model at sites with frequent commute trips, and it had a negative correlation with the TCS entering traffic volume. Second, the Naver search traffic was utilized for the TCS entering traffic volume model at sites with numerous recreational trips, and it was positively correlated with the TCS entering traffic volume. Third, it was uncovered that the VDS speed had a negative relationship with the search traffic on the time series diagram. Lastly, it was concluded that the transfer function noise time series model showed the better goodness-of-fit compared to the other time series model. It is expected that "Big Data" from the internet search data can be extensively applied in the transportation field if the sources of search traffic, time difference and aggregation units are explored in the follow-up studies.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.19 no.2
• /
• pp.213-229
• /
• 2017

Recently, in urban areas there is a tendency to construct more complex network-type tunnels including entrance and exit ramps. At the same time, various one-dimensional programs based on the network theory have been proposed for tunnel ventilation analysis. This paper aims at developing a program that can analyze the ventilation flow rate and pollutants concentration in complex network-type tunnels based on the none hardy-cross method. The flow analysis in the branch was carried out on the basis of the Gradient method, while for the concentration analysis a new logic has been developed to calculate the inflow and outflow concentration automatically in a complex network-type structure. Additionally, in the tunnel segments showing low flow rate, proper grid interval sizes were proposed to reduce numerical error. To verify the applicability of the program, flow rates predicted in the straight tunnels were compared with the classical velocity-diagram method by Stokic and the TVSDM program. The results showed that the errors were within 1%. In addition, the program was applied to the recent ventilation system adopted in the complex network-type urban tunnels.

• Journal of the Korean Society of Costume
• /
• v.62 no.3
• /
• pp.137-151
• /
• 2012

In 1966, $Seokgatap$ pagoda in $Bulguksa$ temple was damaged by the tomb robbers and was dismantled to fix the damage. In the process, many offerings to Buddha and containers for Sarira(the cremated remains) were found in $Sarigong$(specially designated space for the Sarira casket) inside the second floor of the pagoda. Many fabrics like $Geum$, $Neung$(twill), $Rha$(complex gauze), silk tabby and linen were also excavated. In this study, $Geum$ fabric from the $Seokgatap$ was closely examined. $Geum$ of $seokgatap$ is weft-faced compound weave according to the analysis of its weaving pattern which was wrongly presumed as warp-faced compound weave for some time. Technical analysis of $Geum$: Main: silk, Binding: silk, Proportion: 1 main warp to 1 binding warp, Count: 15 main warps and 15 binding warps per centimeter, Weft: polychrome silk without apparent twist, Colors: yellow, mustard yellow, deep blue, green and purple, Weave: weft-faced compound twill, 1/2 S. $Geum$ of $Seokgatap$ was made in the $8^{th}$ century, since it was weaved in weft-faced compound weave twill which was popular in the $8-9^{th}$ century. And also, the arrangement of the colors was done in the same way of gradation $Geum$ silk which was popular in the $7-8^{th}$ C in China and Japan. Third, we restored the pattern of $Geum$ of the Unified Shilla Dynasty for the first time. It was very difficult to figure out the shape and the size of pattern since the fabric was partially lost and ruined. We tried to draw the diagram of structure with the cross point of the warp and the weft to restore the pattern. By doing so, we could identify two kinds of small flower pattern, palmette and the pattern of repeating vines. Fourth, we could infer that the $Geum$ of $Seokgatap$ was used for $geumdae$(a pouch made of $geum$) by analyzing all the documents and the characteristics of the fabric.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.3
• /
• pp.103-113
• /
• 2013

Shock wave model describes the propagation speed of kinematic waves in traffic flow. It was first presented by Lighthill and Whitham and has been deployed to solve many traffic problems. A recent paper pointed out that there are some traffic situations in which shock waves are not observable in the field, whereas the model predicts the existence of waves. The paper attempted to identify how such a counterintuitive conclusion results from the L-W model, and resolved the problem by deriving a new asymptotical shock wave model. Although the asymptotical model successfully eliminated the paradox of the L-W model, the validation of the new model is confined within the realm of the deceleration flow situation since the model was derived under such constraint. The purpose of this paper is to derive the remaining counter asymptotical shock wave model for acceleration traffic flow. For this, the vehicle trajectories in a time-space diagram modified to accommodate the continuously increased speed at every instant in such a way that the relationship between the spacing from the preceding vehicle and the speed of the following vehicle strictly follows Greenshield's model. To verify the validity of the suggested model, it was initially implemented to a constant flow where no shock wave exists, and the results showed that there exists no imaginary shock wave in a homogeneous flow. Numerical applications of the new model showed that the shock wave speeds of the asymptotical model for the acceleration flow tend to lean far toward the forward direction consistently. This means that the asymptotical models performs in a systematically different way for acceleration and for declaration flows. Since the output difference among the models is so distinct and systematic, further study on identifying which model is more applicable to an empirical site is recommended.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.