• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.269-275
• /
• 2013

Recently, importance of pedestrian road network is getting emphasized as it is possible to provide mobile device users with both route guidance services and surrounding spatial information. However, it costs a tremendous amount of budget for generating and renovating pedestrian road network nationally, which hinder further advances of these services. Hence, algorithms extracting pedestrian road network automatically based on raster data are needed. On the other hand, road dataset generated from raster data usually has unnecessary vertices which lead to maintenance disutility such as excessive turns and increase in data memory. Therefore, this study proposed a method of selecting a proper threshold automatically for separate road entity using not only Douglas-Peucker algorithm but also road attribute data of digital map in order to remove redundant vertices, which maximizes line simplification efficiency and minimizes distortion of shape of roads simultaneously. As a result of the test, proposed method was suitable for automatic line simplification in terms of reduction ratio of vertices and accuracy of position.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.267-275
• /
• 2003

In UMTS terminal modem uses 3 step search procedure for initial cell search, which comprises 1) slot synchronization, 2) code group identification and frame synchronization, and 3) scrambling-code identification. The performance of initial cell search procedure depends on search parameters like observation time and threshold. The purpose of this paper is to get the optimal observation time and threshold of each step for minimum mean acquisition time. In this paper we induce mean detection time of each step and mean acquisition timefrom the model of 3 step search procedure using state diagram. Also we propose initial cell search algorithm which utilize window search method against initial oscillator error, and select an appropriate observation time and threshold of each step by the analysis of simulation and induced result. It is shown that the mean acquisition time in multipath fading channel can be shorter than 500ms by using the determined observation time and threshold of each step.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1087-1094
• /
• 2008

In this paper, we propose the acquisition method of the Cyclic-Prefix CDMA using Good-Autocorrelation-Sequence (GAS-CP-CDMA) system. The sequences for GAS-CP-CDMA are m-sequence and constant amplitude zero autocorrelation code (CAZAC) with good autocorrelation property. The GAS-CP-CDMA system is proposed for interference cancellation in multi-user and -path environment in co-cell. However, the reliable initial acquisition in multi-path fading channel and multi-user system environment is crucial. In this paper, non-coherent power detector and threshold value are used for discriminating signal acquisition. The sequence used for computer simulation is CAZAC. The simulation results show proper threshold value depends on the number of users. Through the computer simulation, we draw setting up method of the optimum threshold value for the GAS-CP-CDMA system.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.19-27
• /
• 1999

This paper propose a contention resolution policy featuring dynamic change of the threshold for the occupancy of the input buffer for an input buffering ATM switching architecture and its hardware implementation strategy. The strategy is provided with the aim of the simple structure that achieves the reduction of the signal path and the power consumption. The threshold is changed dynamically every time slot based both the arrived of cells and the cell service resulting from the contention resolution. The performance on the cell loss of the proposed policy is performed and compared with the conventional policy under the diverse traffic conditions through both the analysis based ont the Markov chain and the simulation.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.395-401
• /
• 2008

In order to determine path(s) satisfied with bandwidth-guaranteed in the Internet, routers should have information on network topology and link state. The information is stored in Link State Database (LSDB) located in each router and managed. If link states information is changed, routers inform their neighbor of link state information changed by sending Link State Update (LSU) messages. However, there is trade-off between reflection of actual link state information on LSDB and cost of sending LSU messages. To find a bandwidth-guaranteed path effectively, it is important to decide whether LSU messages are sent or not for the change of link sate. In this paper, we propose a threshold-based LSU algorithm using statistic to effectively decide for sending LSU messages and evaluates its performance by intensive simulations. Simulation results show that the performance of proposed scheme is superior to the existing LSU schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.24-29
• /
• 2010

Selection-type relaying protocol, which is one of cooperative relaying protocols, provides low decoding complexity and improved system performance due to selection diversity. In this paper, we deal with linear precoding technique that minimize the error probability of cooperative MIMO system. Under the assumption that full channel state information is available at whole nodes, linear source and relay precoders, which minimize mean squared error of the estimated symbol vector, are proposed. Moreover, unlikely to the conventional selection-type relaying protocol using a fixed threshold signal-to-noise-ratio, new transmission link selection algorithm selects direct link or relay link as a transmission link, is introduced. Simulation results show that the proposed linear precoder with the transmission link selection algorithm outperforms the conventional precoders for two-hop relaying protocols or selection-type relaying protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.157-162
• /
• 2011

In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.231-236
• /
• 2011

In recent years, LBS(Location Based Service) is applied in many different fields. Therefore, various location-aware schemes have been studied. In the location awareness system using time dependent algorithm, TOA(Time of Arrival) or TDOA(Time Difference of Arrival) algorithm, distortion of a signal by AWGN(Additive White Gaussian Noise) and multi-path effects cause the degradation of location awareness performance. In this paper, the unexpected noise is eliminated by averaging multiple pulses in order to overcome the degradation of performance. Also, we research the technique for improving the performance of the location awareness by detecting direct-path signal with adjusting threshold.

• Journal of the Society of Naval Architects of Korea
• /
• v.28 no.1
• /
• pp.182-188
• /
• 1991

The modified arc-length algorithms for the automatic incremental solution of nonlinear finite element equations proposed by Riks are presented, which comprise the cylindrical arc-length method and the normal arc-length method. These methods are developed to trace the nonlinear path of large displacement problems such as a pre and post bucking/collapse response of general structures. These methods are applied to analyse the nonlinear behavior of arch and shell problems in parallel with the standard and modified Newton-Raphson method.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.411-411
• /
• 2023

미래 대기 이산화탄소 농도가 증가함에 따라 강수 등 기후의 변화하고, 이는 유출량을 포함한 수문 순환 뿐 아니라 지면 식생 생장에 영향을 줄 것으로 예상된다. 이에 본 연구에서는 미래 CO2 증가에 따른 식생의 변화와 이로 인한 지표 유출량의 변화에 대해 이해하고자 한다. Intergovernmental Panel on Climate Change (IPCC) 6차 평가보고서에서 제시한 표준 온실가스 경로 중 탄소 모듈이 포함된 Coupled Model Intercomparison Project phase 6 biogeochemistry (CMIP6-BGC) 모델과 탄소 모듈이 포함안된 CMIP6 모델 결과를 활용하였다. 공통 사회경제경로 시나리오(Shared Socio-economic Pathway; SSP) 중 고탄소 시나리오인 SSP585에 따른 모델 결과물을 활용하였다. 표면 유출량 자료에 과거 기간 임계수준 방법을 (Threshold Level Method) 적용하여 동아시아 지역 극한 건조 및 습윤 상태의 빈도와 강도를 CMIP6-BGC와 CMIP6에 대해 평가하였다. CMIP6-BGC 경우, 건조 및 습윤 상태의 빈도는 각각 6.17%, 5.03% , CMIP6 경우 각각 9.29%, 6.70% 으로 예측되어, CMIP6-BGC가 CMIP6 보다 극한 상태를 과소평가하는 경향을 보였다. 또한, 잎 면적 지수(Leaf Area Index; LAI), 증산량 등의 변수를 분석하여, 기 도출된 CMIP6-BGC와 CMIP6 간의 극한 건조 및 습윤 상태 예측의 차이가 발생한 메카니즘을 이해하고자 하였다.