• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.3
• /
• pp.73-78
• /
• 2019

Due to frequent topology changes in wireless networks, inter-node link disconnection and path re-establishment occur, causing problems such as overloading control messages in the network. In this paper, to solve the problems such as link disconnection and control message overload, we perform path setup in three steps of the neighbor node discovery process, the route discovery process, and the route management process in the wireless network environment. The link stability value is calculated using the information of the routing table. Then, when the zone master monitors the calculated link value and becomes less than the threshold value, it predicts the link disconnection and performs the path reset to the corresponding transmitting and receiving node. The proposed scheme shows a performance improvement over the existing OLSR protocol in terms of data throughput, average path setup time, and data throughput depending on the speed of the mobile node as the number of mobile nodes changes.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.331-331
• /
• 2017

2011 년부터 2014 년까지 4 년간의 여름철에 한반도에 비교적 많은 강수를 남긴 23 개의 중규모 저기압-구름무리 집중호우 사례를 선정하여, 이들 사례에서의 중규모 저기압 발생과 이동 그리고 그것에 동반된 강수계에 의한 강수 발생을 수치예측하는 실험을 수행하였다. WRF 모델을 이용하여 12 km와 4 km 수평격자 크기로 수치실험을 진행하였으며, 각 사례에 대해 중규모 저기압이 발생한 시점을 초기 시각으로 하여 수치적분을 수행하였다. 수치실험 결과와 AWS 강수량 관측 자료를 $0.1^{\circ}{\times}0.1^{\circ}$ 격자에 각각 내삽한 후 비교하였다. 12 km 격자 실험에서는 25 mm/12h 문턱값에 대해 23개의 사례 중 9개 (39 %)만이 0.3이 넘는 성공임계지수(TS)를 나타냈고, 50 mm/12h 문턱값에 대해서는 17개 사례 중 7개 (41 %)의 사례에서 0.3이 넘는 TS가 나타났다. 4 km 실험에서는 25 mm/12h 문턱값에 대해 23개의 사례 중 10개 (43 %) 사례에서 0.3이 넘는 TS 값이 나타났고, 50 mm/12h 문턱값에 대해서는 17개 사례 중 7개 (41 %)로 나타나 WRF 모델의 수평격자 크기와 관계없이 비슷한 성능을 보였다. 중규모 저기압이 진행하는 경로에 따라 예측 능력에 차이가 나타났다. 23개 사례를 중규모 저기압 발생지점으로부터의 이동경로에 따라 준 직선 경로 사례 그룹, 곡선형 경로 사례 그룹, 정체사례 그룹으로 분류하여 각 그룹에 대해 예측 능력을 조사한 결과, 직전 경로 사례들에 대한 4km 격자 모델 예측은 55 %의 사례에서 0.3보다 큰 TS값을 보여, 30 %의 사례에서 0.3 이상의 TS 값을 보인 곡선형 경로 사례들에 대한 예측보다 상대적으로 높은 예측 신뢰도를 보여 주었다.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.489-496
• /
• 2002

This study proposes a new polling algorithm allowing dynamic change in polling period based on line utilization prediction. Polling is the most important function in network monitoring, but excessive polling data causes rather serious congestion conditions of network when network is In congestion. Therefore, existing multiple polling algorithms decided network congestion or load of agent with previously performed polling Round Trip Time or line utilization, chanced polling period, and controlled polling traffic. But, this algorithm is to change the polling period based on the previous polling and does not reflect network conditions in the current time to be polled. A algorithm proposed in this study is to predict whether polling traffic exceeds threshold of line utilization on polling path based on the past data and to change the polling period with the prediction. In this study, utilization of each line configuring network was predicted with AR model and violation of threshold was presented in probability. In addition, suitability was evaluated by applying the proposed dynamic polling algorithm based on line utilization prediction to the actual network, reasonable level of threshold for line utilization and the violation probability of threshold were decided by experiment. Performance of this algorithm was maximized with these processes.

• 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.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.45-52
• /
• 2002

In this contributions, we propose a new MSB(most significant bit) algorithm based on AOP(All One Polynomial) and two parallel semi-systolic architectures to computes $AB^2$over finite field $GF(2^m)$. The proposed architectures are based on standard basis and use the property of irreducible AOP(All One Polynomial) which is all coefficients of 1. The proposed parallel semi-systolic architecture(PSM) has the critical path of $D_{AND2^+}D_{XOR2}$ per cell and the latency of m+1. The modified parallel semi-systolic architecture(WPSM) has the critical path of $D_{XOR2}$ per cell and has the same latency with PSM. The proposed two architectures, PSM and MPSM, have a low latency and a small hardware complexity compared to the previous architectures. They can be used as a basic architecture for exponentiation, division, and inversion. Since the proposed architectures have regularity, modularity and concurrency, they are suitable for VLSI implementation. They can be used as a basic architecture for algorithms, such as the Diffie-Hellman key exchange scheme, the Digital Signature Algorithm(DSA), and the ElGamal encryption scheme which are needed exponentiation operation. The application of the algorithms can be used cryptosystem implementation based on elliptic curve.

• Geotechnical Engineering
• /
• v.5 no.2
• /
• pp.45-56
• /
• 1989

The influence of stress path on the deformation characteristics of clay has been studied through a series of stress-path controlled triaxial tests on artificially sedimented and normally con- solidated Kaolinite. It has been found that there exists a critical stress increment ratio, Kc, in which stress·strain characteristics possesses a linear relationships and beyond Kc, strain hardening. A modified hyperbolic constitutive model for the strain hardening behavior has been formulated based on the Drnevich's hyperbolic function. And, a method of settlement analyses has been Proposed wherein the effect of stress path during consolidation is taken into account.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.694-696
• /
• 1998

ILP마이크로세서를 위한 스테쥴링 과정에서 메모리 명령어가 프로그램의 임계 경로로에 존재할 경우에 이의 스케쥴링은 성능 향상에 중요한 문제 중에 하나이다. 메모리 명령어의 원활한 코드 이동을 위해서는 장애가 되는 명령어들의 메모리 주소간의 의존성의 분석을 필요로 한다. 본 논문에서는 컴파일 시간에 메모리 주소간의 의존성 분석을 통한 성능 향상도를 VLIW환경 하에서 비교한다. 실험결과. 컴파일 시간에 메모리 주소 모호성 제거기를 사용한 경우 16ALU프로세서에서 정수 벤치마크 프로그램에 대해서 기하 평균으로 약 3.6%의 성능 향상이 가능하다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1622-1625
• /
• 2003

RMQC, rail mounted quay crane, lifts and moves large container by means of hoist and trolley motion on the dock. Our company is trying to develop advanced RMQC applying the concepts of elevator hoist and container conveyer for the automation and high efficiency in handling the boxes. Prior to the development of new products, it is necessary to check the capacity of conventional crane for reference. The program simulates container-handling rates and gives some design factors for the conventional cranes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8C
• /
• pp.821-826
• /
• 2003

In this paper, constrained Remez exchange algorithm is proposed to reduce the critical path of an IIR filter. The proposed algorithm is based on Remez exchange algorithm and least squares method. By IIR filter design examples, it is shown that the proposed method can maximally increase speed by 20%.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1109-1113
• /
• 2004

RMQC, rail mounted quay crane, lifts and moves large container by means of hoist and trolley motion on the dock. Our company is trying to develop advanced RMQC applying the concepts of elevator hoist and container conveyer for the automation and high efficiency in handling the boxes. Prior to the development of new products, it is necessary to check the capacity of the new systems using simulation program. The program simulates container-handling rates and gives some design factors for the new-type cranes.