• Journal of Navigation and Port Research
• /
• v.36 no.10
• /
• pp.825-832
• /
• 2012

GPS signal delay that caused by dry gases and water vapor in troposphere is a main error source of GPS point positioning and it must be eliminated for precise point positioning. In this paper, we implemented to generate tropospheric delay grid map over the Korean Peninsula based on post-processing method by using the GPS permanent station network in order to determine the availability of tropospheric delay generation algorithm. GIPSY 5.0 was used for GPS data process and nationwide AWS observation network was used to calculate the amount of dry delay and wet delay separately. As the result of grid map's accuracy analysis, the RMSE between grid map data and GPS site data was 0.7mm in ZHD, 7.6mm in ZWD and 8.5mm in ZTD. After grid map accuracy analysis, we applied the calculated tropospheric delay grid map to single frequency relative positioning algorithm and analyzed the positioning accuracy enhancement. As the result, positioning accuracy was improved up to 36% in case of relative positioning of Suwon(SUWN) and Mokpo(MKPO), that the baseline distance is about 297km.

• Korean Journal of Construction Engineering and Management
• /
• v.18 no.6
• /
• pp.26-37
• /
• 2017

Preliminary scheduling at the initial stage of planning phase is usually performed with limited information and details. Therefore, the reliability and accuracy of preliminary scheduling is affected by personal experiences and skills of the schedule planners, and it requires enormous managerial effort (or workload). Reusing of historical data of the similar projects is important for efficient preliminary scheduling. However, understanding the structure of historical data and applying them to a new project requires a great deal of experience and knowledge. In this context, this paper propose a framework and methodology for automated preliminary schedule generation based on historical database. The proposed methodology and framework enables to automatically generate CPM schedules for airport projects in the early planning stage in order to enhance the reliability and to reduce the workload by using structured knowledge and experience.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.661-668
• /
• 2009

The Extended real-time Polling Service (ErtPS) is proposed tosupport QoS of VoIP service with silence suppression which generates variable size data packets in IEEE 802.16e systems. If the silence is suppressed, VoIP should support Comfort Noise Generation (CNG) which generates comfort noise for receiver's auditory sense to notify the status of connection to the user. CNG mode in silent-period generates a data with lower bit rate at long packet transmission intervals in comparison with talk-spurt. Therefore, if the ErtPS, which is designed to support service flows that generate data packets on a periodic basis, is applied to silent-period, resources of the uplink are used inefficiently. In this paper, we proposed the Improved ErtPS algorithm for efficient resource utilization of the silent-period in VoIP traffic supporting CNG. In the proposed algorithm, the base station allocates bandwidth depending on the status of voice at the appropriate interval by havingthe user inform the changes of voice status. The Improved ErtPS utilizes the Cannel Quality Information Channel (CQICH) which is an uplink subchannel for delivering quality information of channel to the base station on a periodic basis in 802.16e systems. We evaluated the performance of proposed algorithm using OPNET simulator. We validated that proposed algorithm improves the bandwidth utilization of the uplink and packet transmission latency

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.7
• /
• pp.111-123
• /
• 2013

To verify software vulnerability, the method of conjecturing software structure and then testing the software based on the conjectured structure has been highlighted. To utilize the method, an efficient way to conjecture software structure is required. The popular graph and tree methods such as DFG(Data Flow Graph), CFG(Control Flow Graph) and CFA(Control Flow Automata) have a serious drawback. That is, they cannot express software in a hierarchical fashion. In this paper, we propose a method to overcome the drawback. The proposed method applies various input data to a binary code, generate CFG's based on the code output and construct a HCFG (Hierarchical Control Flow Graph) to express the generated CFG's in a hierarchical structure. The components required for HCFG and progressive algorithm to construct HCFG are also proposed. The proposed method is verified through constructing the software architecture of an open SMTP(Simple Mail Transfer Protocol) server program. The structure generated by the proposed method and the real program structure are compared and analyzed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.82-94
• /
• 2015

In this paper, we propose hardware prefetch mechanism with an efficient cache replacement policy by giving priority to the trigger block in which a spatial region and producing a spatial region by using the displacement field. It could be taken into account the sequence of the program since a history is based on the trigger block of history record, and it could be quickly prefetching the instructions or data address by adding a stored value to the trigger address and displacement field since a history is stored as a displacement value. Also, we proposed a method of replacing at random by the cache replacement policy from the low priority block when the cache area is full after giving priority to the trigger block. We analyzed using the memory simulator program gem5 and PARSEC benchmark to assess the performance of the hardware prefetcher. As a result, compared to the existing hardware prefecture to generate the spatial region using a bit vector, L1 data cache miss rate was reduced about 44.5% on average and an average of 26.1% of L1 instruction misses occur. In addition, IPC (Instruction Per Cycle) showed an improvement of about 23.7% on average.

• Journal of Korea Water Resources Association
• /
• v.44 no.12
• /
• pp.929-940
• /
• 2011

In this study, the future expected discharges are analyzed for Daecheong and Yongdam Dam Watershed in Geum River watershed using A1B scenario based RCM with 27 km spatial resolutions from Korea Meteorological Agency and SWAT model. The direct use of GCM and RCM data for water resources impact assessment is practically hard because the spatial and temporal scales are different. In this study, the problems of spatial and temporal scales were settled by the spatial and temporal downscaling from watershed scale to weather station scale and from monthly to daily of RCM grid data. To generate the detailed hydrologic scenarios of the watershed scale, the multi-site non-stationary downscaling method was used to examine the fluctuations of rainfall events according to the future climate change with considerations of non-stationary. The similarity between simulation and observation results of inflows and discharges at the Yongdam Dam and Daecheong Dam was respectively 90.1% and 84.3% which shows a good agreement with observed data using SWAT model from 2001 to 2006. The analysis period of climate change was selected for 80 years from 2011 to 2090 and the discharges are increased 6% in periods of 2011~2030. The seasonal patterns of discharges will be different from the present precipitation patterns because the simulated discharge of summer was decreased and the discharge of fall was increased.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.547-557
• /
• 2005

The purpose of selectivity estimation is to maintain the summary data in a very small memory space and to minimize the error of estimated value and query result. In case of estimating selectivity for large spatial data, the existing works need summary information which reflect spatial data distribution well to get the exact result for query. In order to get such summary information, they require a much memory space. Therefore In this paper, we propose a new technique cumulative density wavelet Histogram, called CDW Histogram, which gets a high accurate selectivity in small memory space. The proposed method is to utilize the sub-histograms created by CD histogram. The each sub-histograms are used to generate the wavelet summary information by applying the wavelet transform. This fact gives us good selectivity even if the memory sire is very small. The experimental results show that the proposed method simultaneously takes full advantage of their strong points - gets a good selectivity using the previous histogram in ($25\%\~50\%$) memory space and is superior to the existing selectivity estimation techniques. The proposed technique can be used to accurately quantify the selectivity of the spatial range query in databases which have very restrictive memory.

• Journal of Korean Society of Transportation
• /
• v.27 no.4
• /
• pp.115-126
• /
• 2009

The lane-change behavior usually consists of discretionary lane-change and mandatory lane-change types. For the first type, drivers change lanes selectively to maintain their own driving condition and the second type is the case that the drivers must change the current lane, which can occur in recurrent congestion sections like merging and weaving sections. The mandatory lane-change behavior have a great effect on the operation condition of freeway. In this paper, we first generate data such as traffic volumes, speeds, densities, and the number of lane-change within the merging and weaving sections using the data of individual vehicle collected from time-lapse aerial photography. And then, the data is divided into the stable and congested flow by analyzing the speed variation pattern of individual vehicles. In addition, the number of lane-changing from ramp to mainline within every 30-meter interval is investigated before and after traffic congestion at study sites and the distribution of lane-changing at each 30-meter point is analyzed to identify the variation of lane-changing ratio depending on the stable and congested flows. To recognize the effect of mainline flow influenced by ramp flow, this study also analyzes the characteristics of the lane-changing distributions within the lanes of mainline. The purpose of this paper is to present the basic theory to be used in developing a lane-changing model at the merging and weaving sections on freeways.

• Korean Journal of Remote Sensing
• /
• v.35 no.6_1
• /
• pp.999-1009
• /
• 2019

The importance of high-resolution sea ice maps of the Arctic Ocean is increasing due to the possibility of pioneering North Pole Routes and the necessity of precise climate prediction models. In this study,sea ice classification algorithms for two deep learning models were examined using Sentinel-1 A/B SAR data to generate high-resolution sea ice classification maps. Based on current ice charts, three classes (Open Water, First Year Ice, Multi Year Ice) of training data sets were generated by Arctic sea ice and remote sensing experts. Ten sea ice classification algorithms were generated by combing two deep learning models (i.e. Simple CNN and Resnet50) and five cases of input bands including incident angles and thermal noise corrected HV bands. For the ten algorithms, analyses were performed by comparing classification results with ground truth points. A confusion matrix and Cohen's kappa coefficient were produced for the case that showed best result. Furthermore, the classification result with the Maximum Likelihood Classifier that has been traditionally employed to classify sea ice. In conclusion, the Convolutional Neural Network case, which has two convolution layers and two max pooling layers, with HV and incident angle input bands shows classification accuracy of 96.66%, and Cohen's kappa coefficient of 0.9499. All deep learning cases shows better classification accuracy than the classification result of the Maximum Likelihood Classifier.

• Korean Journal of Remote Sensing
• /
• v.34 no.2_2
• /
• pp.407-418
• /
• 2018

The frequency and risk of disasters are increasing due to environmental and social factors. In order to respond effectively to disasters that occur unexpectedly, it is very important to quickly obtain up-to-date information about target area. It is possible to intuitively judge the situation about the area through the image-map generated at high speed, so that it can cope with disaster quickly and effectively. In this study, we propose an image-map generation and visualization system from UAV images for real-time disaster monitoring. The proposed system consists of aerial segment and ground segment. In the aerial segment, the UAV system acquires the sensory data from digital camera and GPS/IMU sensor. Communication module transmits it to the ground server in real time. In the ground segment, the transmitted sensor data are processed to generate image-maps and the image-maps are visualized on the geo-portal. We conducted experiment to check the accuracy of the image-map using the system. Check points were obtained through ground survey in the data acquisition area. When calculating the difference between adjacent image maps, the relative accuracy was 1.58 m. We confirmed the absolute accuracy of the image map for the position measured from the individual image map. It is confirmed that the map is matched to the existing map with an absolute accuracy of 0.75 m. We confirmed the processing time of each step until the visualization of the image-map. When the image-map was generated with GSD 10 cm, it took 1.67 seconds to visualize. It is expected that the proposed system can be applied to real - time monitoring for disaster response.