• Title/Summary/Keyword: 갱신과정

Search Result 405, Processing Time 0.031 seconds

A Study on Updated Object Detection and Extraction of Underground Information (지하정보 변화객체 탐지 및 추출 연구)

  • Kim, Kwangsoo;Lee, Heyung-Sub;Kim, Juwan
    • Journal of Software Assessment and Valuation
    • /
    • v.16 no.2
    • /
    • pp.99-107
    • /
    • 2020
  • An underground integrated map is being built for underground safety management and is being updated periodically. The map update proceeds with the procedure of deleting all previously stored objects and saving newly entered objects. However, even unchanged objects are repeatedly stored, deleted, and stored. That causes the delay of the update time. In this study, in order to shorten the update time of the integrated map, an updated object and an unupdated object are separated, and only updated objects are reflected in the underground integrated map, and a system implementing this technology is described. For the updated object, an object comparison method using the center point of the object is used, and a quad tree is used to improve the search speed. The types of updated objects are classified into addition and deletion using the shape of the object, and change using its attributes. The proposed system consists of update object detection, extraction, conversion, storage, and history management modules. This system has the advantage of being able to update the integrated map about four times faster than the existing method based on the data used in the experiment, and has the advantage that it can be applied to both ground and underground facilities.

Lifetime Assignment Schemes for Dynamic Binding Update in Mobile IPv6 (Mobile IPv6 환경에서 동적 바인딩 갱신을 위한 라이프타임 할당 기법)

  • 양순옥;송의성;길준민;김성석;황종선
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.27-36
    • /
    • 2004
  • Frequent occurrence of binding update messages may incur high overhead in Mobile IP supporting users mobility. Thus, it needs to develop algorithms to deal with the situation. In this paper, we propose new lifetime assignment schemes for dynamic binding update considering the locality property related with mobile node's movement. Each mobile node maintains a profile which is based on log containing useful information about its visiting subnets. That is, it determines dynamic binding update lifetime for currently visiting subnet by computing past mean resident time recorded in the profile. In addition, we note that the resident time depends on the time when each node enters a subnet and thus, we devise another lifetime assignment algorithm. Extensive experiments are made to compare our schemes with existing Mobile IPv6 where major facts for performance comparison are both the number of binding update messages and the number of binding request messages. From the results, we come to know that our schemes obtain highly considerable performance improvements in terms of communication cost by decreasing the number of those messages.

Graph-based Wi-Fi Radio Map Construction and Update Method (그래프 기반 Wi-Fi 신호 지도 구축 및 갱신 기법)

  • Yu, Subin;Choi, Wonik
    • Journal of KIISE
    • /
    • v.44 no.6
    • /
    • pp.643-648
    • /
    • 2017
  • Among Wi-Fi based indoor positioning systems, fingerprinting localization is the most common technique with high precision. However, construction of the initial radio map and the update process require considerable labor and time effort. To address this problem, we propose an efficient method that constructs the initial radio map at each vertex based on a graph. In addition, we introduce a method to update the radio map automatically by mapping signal data acquired from users to the reference point created on each edge. Since the proposed method collects signal data manually only at the vertex of the graph to build the initial radio map and updates it automatically, our proposed method can dramatically reduce labor and time effort, which are the disadvantages of the conventional fingerprinting method. In our experimental study, we show validity of our radio map update method by comparing with the actual reference point data. We also show that our proposed method is able to construct the radio map with an accuracy of about 3.5m by automatically updating the radio map.

Object-based Stereoscopic Video Coding Using Image Segmentation and Prediction (영역분할 및 예측을 통한 객체기반 스테레오 동영상 부호화)

  • 권순규;배태면;한규필;정의윤;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12B
    • /
    • pp.2349-2358
    • /
    • 1999
  • Object-based stereoscopic video coding scheme is presented in this paper. In conventional BMA based stereoscopic video coding for low bit rate transmission, image prediction errors such as block artifacts and mosquito phenomena are occurred. In order to reduce these errors, object based coding scheme is adopted. The proposed scheme consists of preprocessing, object extraction, and object update procedures. The preprocessing procedure extracts non-object regions having low reliability for motion and disparity estimation. This procedure prohibits extracting inaccurate objects. For the better prediction of left channel image, the disparity information is added to the object extraction. And the proposed algorithm can reduce the accumulated error through the object update procedure that detects newly emerging objects, merges objects that have the same object-disparity and object motion, and splits object which has large image prediction error. The experimental results show that the proposed algorithms improve the quality of the prediction without block artifacts and mosquito phenomena.

  • PDF

A Study on Reduced Binding Update for RR Protocol In FMIPv6 (FMIPv6 RR 프로토콜의 바인딩 절차 간소화에 관한 연구)

  • Oh, Se-Won;Jung, Min-Soo
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2009.01a
    • /
    • pp.275-278
    • /
    • 2009
  • MIPv6의 핸드오버 지연시간을 줄이는 많은 연구가 등장 하였고, 그 중 IEFT에서 표준화한 두 가지 프로토콜이 있다. 첫 번째 FMIPv6(Fast MIPv6) 프로토콜은 2계층 핸드오버 전에 3계층 핸드오버의 일부 과정은 사전에 수행함으로써 핸드오버 지연 시간을 줄이는 프로토콜이다. 두 번째 HMIPv6(Hierarchical MIPv6)는 일정한 범위를 커버할 수 있는 에이전트를 두어 이동성을 지역적으로 관리하여 핸드오버 지연시간을 줄이는 프로토콜이다. 본 논문에서는 FMIPv6에서 주로 사용하는 바인딩 갱신 프로토콜인 RR 프로토콜의 바인딩 갱신 절차를 줄임으로써 바인딩 갱신으로 생기는 시간을 단축시키는 방법을 제안한다.

  • PDF

STM-based Media Streaming for Wireless Ad Hoc Link Quality (무선 애드혹 링크 품질을 위한 STM 기반의 미디어 스트리밍)

  • Lee, Chong-Deuk
    • Journal of Advanced Navigation Technology
    • /
    • v.17 no.3
    • /
    • pp.285-291
    • /
    • 2013
  • This paper proposed a new STM-based media streaming scheme to assure the wireless ad hoc link quality. The proposed scheme can assure the link quality by the stream monitoring, assurance, and update procedure, and it can be monitored the media frame by streaming time $t_{new}$. This paper minimizes the link error rate and re-transmission rate using the media streaming update based on the frame size. The simulation results show thst the proposed scheme outperforms STCP and RMST.

Models of XML Update Processing for Refreshing XML Cache Incrementally (XML캐쉬의 점진적 갱신을 위한 XML변경 처리 모델)

  • 한승철;황대현;강현철
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.64-66
    • /
    • 2004
  • XML이 웹 상에서 데이터 교환의 표준으로 부각된 이래 XML데이터의 효율적 관리 기법에 관한 연구가 활발히 수행되고 있다. XML 질의의 표준화 작업도 활발히 이루어져 현재 XQuery가 유력한 표준으로 부각되었다. 그러나 XQuery 등이 완전한 XML 질의어가 되기 위해서는 변경 연산을 제공해야 하는데 XML변경어의 표준화 작업이나 XML 변경 처리 기법에 대한 연구는 아직 미미한 실정이다. 본 논문에서는 e-Commerce 등 XML 데이터베이스 기반 웹 응용의 효율적 지원을 위한 XML 캐쉬를 점진적으로 갱신하는 과정에서 발생하는 XML 변경 연산 처리의 세 가지 기본 모델. TD (텍스트/DOM 기반). PD(PDOM 기반), 그리고 IT (인덱스된 텍스트 기반)를 제안한다. 캐쉬된 XML 문서를 어떤 포맷으로 저장하는가는 이후 XML 변경 연산의 처리 및 요청된 XML문서 반환의 효율성에 영향을 미친다. 이들 모델들은 캐쉬된 XML 문서의 저장 포맷에 따라 구분한 것이다. 이들 모델 각각에 대하여 캐쉬된 XML문서의 갱신 및 반환 기능을 제공하는 XML캐쉬 관리 시스템을 구현하여 이들 기능의 성능 및 공간 부담을 평가한 결과를 기술한다.

  • PDF

Enhancement of FMIPv6 using Tentative and Early Binding Update to Home Agent (홈에이전트로의 빠른 바인딩 갱신 방법을 통한 FMIPv6 핸드오버 개선 방안)

  • Ryu Seong-Geun;Mun Young-Song
    • The KIPS Transactions:PartC
    • /
    • v.13C no.1 s.104
    • /
    • pp.121-128
    • /
    • 2006
  • In Mobile IPv6, a handover latency is an important issue. To reduce the handover latency, mipshop working group in IETF has studied the fast handover(FMIPv6) which creates and verifies a new care-of address(NCoA) in advance before a layer 2 handover resulting in reduced handover latency. Even in FMIPv6, the NCoA must be registered in a home agent(HA). This registration still creates a significant amount of delay. To reduce registration latency, we propose a tentative and early binding update(TEBU) scheme that the NCoA is registered in the HA in advance during the layer 2 handover based on FMIPv6. We use cost analysis for the performance evaluation. As a result, we found that the TEBU scheme guarantees lower handover latency than FMIPv6 as much as approximately 21%.

An extension of state transition graph for distributed environment (분산된 환경에서의 상태 전이 그래프의 확장)

  • Suh, Jin-Hyung;Lee, Wang-Heon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.1
    • /
    • pp.71-81
    • /
    • 2010
  • In a typical web environment, it is difficult to determine the update and re-computation status of WebView content or the transition of WebView processing included in web page. If an update to one of data is performed before a read operation to that, we could get a wrong result due to the incorrect operation and increase a complexity of the problem to process. To solve this problem, lots of researchers have studied and most of these problems at the single user environment is not problems. However, the problems at a distributed environment might be occurred. For this reason, in this paper, we proposed the extended state transition graph and algorithms for each status of WebView for explaining WebView state in the distributed environment and analyze the performance of using the materialized WebView and not. Additionally, also analyze the timing issues in network and effectiveness which follows in size of WebView contents.