• Title/Summary/Keyword: Path error

Search Result 904, Processing Time 0.032 seconds

Groundwater Flow Analysis Using Finite Difference Method in Volcanic Island (화산도서에서 유한차분법을 이용한 지하수 유동해석)

  • Choe, Yun-Yeong;Lee, Sun-Tak
    • Journal of Korea Water Resources Association
    • /
    • v.33 no.5
    • /
    • pp.611-622
    • /
    • 2000
  • In this study, MODFLOW model is used to analyze the groundwater flow system of Seoguipo area in Cheju island, The final parameters of permeability coefficient and storage coefficient of target area can be obtained by trial and error method using the measured data of pumping rate as initial values. And it is found that the applicability for groundwater flow system is reflected well from the simulation result of the model. Seoguipo area spring water is thought to appear by relatively stable groundwater recharge below EL. 400m according to head distribution through the analysis of observed data considering topographic and geological characteristics, Lee's study(996), and the simulation result. Also it is known that point II, III, and VI show relatively large velocity vectors, and groundwater flows through the movement path which is distributed in various directions of I, II, III, IV, V, VI, and VIl form the result of velocity vector analysis using head distribution result values to analyze the groundwater flow path under unsteady flow condition.dition.

  • PDF

Resilient Routing Protocol Scheme for 6LoWPAN (6LoWPAN에서 회복력 있는 라우팅 프로토콜 기법)

  • Woo, Yeon Kyung;Park, Jong Tae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.141-149
    • /
    • 2013
  • IETF 6LoWPAN standard technique has been studied in IoT environment to support the IPv6 packet communication. 6LoWPAN protocol for transmission of packets mainly in the AODV routing protocol and a variety of extended techniques have been investigated. In particular, consisting of nodes with limited resources in a network error occurs when the 6LoWPAN reliable data transfer and fast routing method is needed. To this end, in this paper, we propose resilient routing protocol and extension of IETF LOAD algorithm, for optimal recovery path, More specifically, the optimal recovery path setup algorithm, signal flow, and detailed protocols for the verification of the reliability of packet transmission mathematical model is presented. The proposed protocol techniques to analyze the performance of the NS-3 performance through the simulation results that is end-to-end delay, throughput, packet delivery fraction and control packet overhead demonstrated excellence in comparison with existing LOAD.

Localized Path Selection Algorithm for Energy Efficiency and Prolonging Lifetime in Ad-Hoc Networks (에드 혹 네트워크에서 에너지 효율성과 네트워크 수명 연장을 위한 지역적 경로 선택 알고리즘)

  • Lee, Ju-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.6
    • /
    • pp.65-72
    • /
    • 2010
  • In ad-hoc network, the technique to efficiently consume the limited amounts of energy is an important issue since the wireless terminal node is operated on batteries as their energy resource. In order to extend the system lifetime, through a balanced energy consumption, we must delay the situation in which a particular terminal node's energy is depleted and results in system disconnection. Also, the link, which has low reliability due to the mobility of the node, should be avoided considering the key element when setting up the route. The proposed CMLR method in this paper enables to increase the efficiency of energy consumption with a new cost function considering the residue energy of node, error rate of link, and transmission energy consumption. This method is extending the network lifetime and increasing the energy efficiency by compromising the value between the minimization of the transmission energy consumption and maximization of the node's lifetime. Through the simulations the proposed CMLR algorithm was verified by showing better performance over the conventional methods in terms of network lifetime and path efficiency.

A SPEC-T Viterbi decoder implementation with reduced-comparison operation (비교 연산을 개선한 SPEC-T 비터비 복호기의 구현)

  • Bang, Seung-Hwa;Rim, Chong-Suck
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.7 s.361
    • /
    • pp.81-89
    • /
    • 2007
  • The Viterbi decoder, which employs the maximum likelihood decoding method, is a critical component in forward error correction for digital communication system. However, lowering power consumption on the Viterbi decoder is a difficult task since the number of paths calculated equals the number of distinctive states of the decoder and the Viterbi decoder utilizes trace-back method. In this paper, we propose a method which minimizes the number of operations performed on the comparator, deployed in the SPEC-T Viterbi decoder implementation. The proposed comparator was applied to the ACSU(Add-Compare-Select Unit) and MPMSU(Minimum Path Metric Search Unit) modules on the decoder. The proposed ACS scheme and MPMS scheme shows reduced power consumption by 10.7% and 11.5% each, compared to the conventional schemes. When compared to the SPEC-T schemes, the proposed ACS and MPMS schemes show 6% and 1.5% less power consumption. In both of the above experiments, the threshold value of 26 was applied.

A Stereo Matching Method Based on the Dynamic Programming to Reduce the Streaking Phenomena (스트리킹 현상을 감소시키기 위한 다이내믹 프로그래밍 기반의 스테레오 정합 방법)

  • Park, Jang-Ho;Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1217-1230
    • /
    • 2010
  • The dynamic programming based methods, a kind of globally optimizing stereo matching methods, has the inherent advantage that the occlusion regions can be found during the process. But it also has a serious drawback of streaking phenomena. This paper focuses on reducing the streaking phenomena by adjusting the penalties in calculating the cost matrix and re-establishing the optimal path in the back-tracing process using the boundary information of the image. Especially we use a pixel expansion method in re-establishing the path, which is the results from expanding the pixel information of the ones just left the boundaries. Experiments with the four image pairs provided by the Middlebury site showed the results that the proposed method has the disparity error ratio of 6.33% and the rank is 29, which is competitive to the best method among the previously published dynamic programming based methods.

Robust Trajectory Tracking Control of a Mobile Robot Based on Weighted Integral PDC and T-S Fuzzy Disturbance Observer (하중 적분 PDC와 T-S 퍼지 외란 관측기를 이용한 이동 로봇의 강인 궤도 추적 제어)

  • Baek, Du-san;Yoon, Tae-sung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.2
    • /
    • pp.265-276
    • /
    • 2017
  • In this paper, a robust and more accurate trajectory tracking control method for a mobile robot is proposed using WIPDC(Weighted Integral Parallel Distributed Compensation) and T-S Fuzzy disturbance observer. WIPDC reduces the steady state error by adding weighted integral term to PDC. And, T-S Fuzzy disturbance observer makes it possible to estimate and cancel disturbances for a T-S fuzzy model system. As a result, the trajectory tracking controller based on T-S Fuzzy disturbance observer shows robust tracking performance. When the initial postures of a mobile robot and the reference trajectory are different, the initial control inputs to the mobile robot become too large to apply them practically. In this study, also, the problem is solved by designing an initial approach path using a path planning method which employs $B\acute{e}zier$ curve with acceleration limits. Performances of the proposed method are proved from the simulation results.

Numerical Investigation of the Effect of flow Passage Variation on the Projection Distance of the Foam Monitor (유로형상변경에 따른 폼 모니터 분사거리 변화의 수치적 해석)

  • Lee, Young-Hoon;RYU, Young-Chun;Seong, Jeong-Hyun;Park, Young-Chul
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.1
    • /
    • pp.244-251
    • /
    • 2016
  • In this study, the relationship between flow characteristics and projection distance, depending on the shape was examined. A numerical investigation technique for fluid analysis of a foam monitor was developed for the prediction, comparison and validation of the actual injection performance. The foam monitor changes the flow pattern of fluid flow according to the shape, The fluid losses were calculated from the numerical investigation affecting the projection distance. The basic form of foam monitor was used as a designed shape in N. The modified model used the length increase model of the flow path, and straight line of the model. The inlet pressure was 6.5bar. The results showed that the length increase model of the flow path and straight line of the model in the nozzle projection distance had improved. The results comparing the error rates projection performance were well matched to the 7.43% obtained from the validity test of the analysis method.

Performance Evaluation of the M-algorithm for Decoding Convolutional Codes (M-알고리듬을 이용한 컨벌루셔널 부호의 복호 성능 평가)

  • 천진영;최규호;성원진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.188-195
    • /
    • 2002
  • The M-algorithm for decoding convolutional codes can significantly reduce the complexity of the Viterbi algorithm by tracking a fixed number of survivor paths in each level of the decoding trellis. It is an easily-implementable algorithm suited for real-time processing of high-speed data. The algorithm, however, generates a sequence of catastrophic errors when the correct path is not included in the set of survivor paths. In this paper, the performance of the M-algorithm obtained from using various decoding complexity levels, frame lengths, and code constraint lengths is presented. The performance gain is quantified when the algorithm is used in conjunction with codes of increased constraint length. In particular, it is demonstrated the gain from the increased code free distance overcompensates the loss from the correct path being excluded from the survivors, when the frame length is short to moderate. Using 64 survivor paths, the signal-to-noise ratio gain obtained by increasing the constraint length from K=7 to K=9, 11, 15 is respectively 0.6, 0.75, and 08dB, when the frame of length L=100 has the frame error rate of 0.01%.

Verification for Multithreaded Java Code using Java Memory Model (자바 메모리 모델을 이용한 멀티 스레드 자바 코드 검증)

  • Lee, Min;Kwon, Gi-Hwon
    • The KIPS Transactions:PartD
    • /
    • v.15D no.1
    • /
    • pp.99-106
    • /
    • 2008
  • Recently developed compilers perform some optimizations in order to speed up the execution time of source program. These optimizations require the reordering of the sequence of program statements. This reordering does not give any problems in a single-threaded program. However, the reordering gives some significant errors in a multi-threaded program. State-of-the-art model checkers such as JavaPathfinder do not consider the reordering resulted in the optimization step in a compiler since they just consider a single memory model. In this paper, we develop a new verification tool to verify Java source program based on Java Memory Model. And our tool is capable of handling the reordering in verifying Java programs. As a result, our tool finds an error in the test program which is not revealed with the traditional model checker JavaPathFinder.

Development of an Improved Geometric Path Tracking Algorithm with Real Time Image Processing Methods (실시간 이미지 처리 방법을 이용한 개선된 차선 인식 경로 추종 알고리즘 개발)

  • Seo, Eunbin;Lee, Seunggi;Yeo, Hoyeong;Shin, Gwanjun;Choi, Gyeungho;Lim, Yongseob
    • Journal of Auto-vehicle Safety Association
    • /
    • v.13 no.2
    • /
    • pp.35-41
    • /
    • 2021
  • In this study, improved path tracking control algorithm based on pure pursuit algorithm is newly proposed by using improved lane detection algorithm through real time post-processing with interpolation methodology. Since the original pure pursuit works well only at speeds below 20 km/h, the look-ahead distance is implemented as a sigmoid function to work well at an average speed of 45 km/h to improve tracking performance. In addition, a smoothing filter was added to reduce the steering angle vibration of the original algorithm, and the stability of the steering angle was improved. The post-processing algorithm presented has implemented more robust lane recognition system using real-time pre/post processing method with deep learning and estimated interpolation. Real time processing is more cost-effective than the method using lots of computing resources and building abundant datasets for improving the performance of deep learning networks. Therefore, this paper also presents improved lane detection performance by using the final results with naive computer vision codes and pre/post processing. Firstly, the pre-processing was newly designed for real-time processing and robust recognition performance of augmentation. Secondly, the post-processing was designed to detect lanes by receiving the segmentation results based on the estimated interpolation in consideration of the properties of the continuous lanes. Consequently, experimental results by utilizing driving guidance line information from processing parts show that the improved lane detection algorithm is effective to minimize the lateral offset error in the diverse maneuvering roads.