• 한국측량학회지
• /
• 제33권6호
• /
• pp.569-577
• /
• 2015

The navigation algorithm developed based on the extended Kalman filter (EKF) sometimes diverges when the linearity between the measurements and the states is not preserved. In this study, new update conditions together with two conditions from previous study for gravity gradient referenced navigation (GGRN) were deduced for the filter performance. Also, the effect of each update conditions was evaluated imposing the various magnitudes of the database (DB) and the sensor errors. In case the DB and the sensor errors were supposed to 0.1 Eo and 0.01 Eo, the navigation performance was improved in the eight trajectories by using part of gravity gradient components that independently estimate states located within trust boundary. When applying only the components showing larger variation, around 200% of improvement was found. Even the DB and sensor error were supposed to 3 Eo, six update conditions improved performance in at least seven trajectories. More than five trajectories generated better results with 5 Eo error of the DB and the sensor. Especially, two update conditions successfully control divergence, and bounded the navigation error to the 1/10 level. However, these update conditions could not be generalized for all trajectories so that it is recommended to apply update conditions at the stage of planning, or as an index of precision of GGRN when combine with various types of geophysical data and algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권1호
• /
• pp.171-192
• /
• 2017

The change of any element in the network is possible to cause performance degradation of the multicast network. So it is necessary to optimize the topology path through the multicast update strategy, which directly affects the performance and user experience of the overlay multicast. In view of the above, a new multicast tree update strategy based on perturbation theory Musp (Multicast Update Strategy based on Perturbation theory) is proposed, which reduces the data transmission interruption caused by the multicast tree update and improves user experiences. According to the multicast tree's elements performance and the topology structure, the Musp strategy defines the multicast metric matrix and based on the matrix perturbation theory it also defines the multicast fluctuation factor. Besides it also demonstrates the calculability of the multicast fluctuation factor presents the steps of the Musp algorithm and calculates the complexity. The experimental results show that compared with other update strategies, as for the sensitivity of the multicast fluctuation factor's energized multicast tree to the network disturbance, the maximum delay of the Musp update strategy is minimal in the case of the local degradation of network performance.

• 한국정보통신학회논문지
• /
• 제18권6호
• /
• pp.1369-1374
• /
• 2014

지능형 타깃 지속 공격에 업데이트 서버가 유포수단으로 사용되고, 업데이트 프로그램은 악성코드의 실행 또는 안티바이러스 시그니처와 같은 애플리케이션 데이터의 조작에도 취약하기 때문에 소프트웨어 업데이트 위협요소의 식별 및 방지대책이 시급하다. 본 논문에서는 국내외 SW의 업데이트 구조와 업데이트 과정의 취약성 공격 및 대응방안을 살펴보고, 국내 유명 소프트웨어의 업데이트 로그를 추출/분석하여 화이트리스트를 식별하는데 필요한 정상적인 프로그램의 업데이트 구성요소를 도출한다.

• 한국CDE학회논문집
• /
• 제11권5호
• /
• pp.335-343
• /
• 2006

Design changes for an original surface model are frequently required in a manufacturing area: for example, when the physical parts are modified or when the parts are partially manufactured from analogous shapes. In this case, an efficient 3D model updating method by locally adding scan data for the modified area is highly desirable. For this purpose, this paper presents a new procedure to update an initial model that is composed of combinatorial triangular facets based on a set of locally added point data. The initial surface model is first created from the initial point set by Tight Cocone, which is a water-tight surface reconstructor; and then the point cloud data for the updates is locally added onto the initial model maintaining the same coordinate system. In order to update the initial model, the special region on the initial surface that needs to be updated is recognized through the detection of the overlapping area between the initial model and the boundary of the newly added point cloud. After that, the initial surface model is eventually updated to the final output by replacing the recognized region with the newly added point cloud. The proposed method has been implemented and tested with several examples. This algorithm will be practically useful to modify the surface model with physical part changes and free-form surface design.

• 한국데이타베이스학회:학술대회논문집
• /
• 한국데이타베이스학회 2001년도 추계 컨퍼런스: 인터넷 비즈니스 환경에서의 디지털 컨텐츠 기술 발전 및 활용을 위한 컨퍼런스
• /
• pp.428-434
• /
• 2001

전통적인 수작업을 통한 서비스 Update 수행 개선 필요. WMT 하의 Multimedia Streaming File 보안 필요. 기본 Web Page 및 HTML 하의 Player Skin의 통합 필요. 인터넷 재방(VOD/AOD)서비스에 대한 신속한 Update 구현 (중략)

• 대한안전경영과학회지
• /
• 제9권5호
• /
• pp.97-101
• /
• 2007

As the use of vehicle route application and LBS(location based service) are fast grew, the importance of maintaining road network data is also increased. To maintain road data accuracy, we can collect road data by driving real roads with probe vehicle, or using digital image processing for the extraction of roads from aerial imagery. After compare the new road data to current database, we can update the road database, but that job is mostly time and money consuming or can be inaccurate. In this paper, an updating method of using GPS(global positioning system) enabled cell phone is proposed. By using GPS phone, we can update road database easily and sufficiently accurately.

• 한국정보시스템학회지:정보시스템연구
• /
• 제24권3호
• /
• pp.75-94
• /
• 2015

Purpose While new versions of mobile applications could offer users better computing environment, users are not always comfortable with them for various reasons. Considering making update decisions is important task for users, it is crucial for us to understand users' behavior and attitude on app updates. The purpose of this study is to explain why mobile users succumb to both reactance toward the update and satisfaction to the current version, ultimately leading them to feel the regret by employing three theoretical perspectives including regret theory, status quo bias theory and the dual model. Design/methodology/approach Survey data collected from 204 mobile users was used to test the research model using partial least squares analysis. The results have shown that both reactance toward the update and satisfaction to the current version have negative impacts on individuals' decisions to update, which leading to their regret after updating the applications Findings By integrating both status quo bias and regret theory in the model, this study tried to explain why mobile users feel regret in application update settings. More specifically, this study has proposed a novel framework that introduces an individual's update decision on mobile applications.

• 한국정보처리학회논문지
• /
• 제6권8호
• /
• pp.2245-2252
• /
• 1999

분산 공유 메모리(Distributed Shared Memory)시스템은 사용자에게 간단한 공유 메모리 개념을 제공하기 때문에 노드 사이의 데이터 이동에 관여할 필요가 없다. 각 노드는 프로세서, 메모리, 그리고 네트워크 연결장치 등으로 이루어져 있다. 메모리는 페이지 단위로 구분되며 페이지는 여러 노드에 복제본을 소유할 수 있다. 이들간 일치성을 유지하기 위하여 무효화 방식(invalidate protocol)과 갱신 방식(update protocol)이 전통적으로 많이 사용되었다. 이 두 가지 프로토콜의 성능은 시스템 변수 또는 응용 프로그램의 공유 메모리 사용 형태에 따라 좌우된다. 메모리 사용 형태에 적응하기 위하여 경쟁적 갱신(competitive update) 프로토콜은 가까운 장래에 사용되어질 복제본을 갱신시키는 반면, 다른 복제본은 무효화시킨다. 본 논문에서는 노드 사이의 통신비용이 동일하지 않은 구조를 감안한 가중치를 고려한(weighted) 경쟁적 갱신 프로토콜을 제안하였다. 시뮬레이션에 의한 성능 측정 결과 가중치를 고려한 경쟁적 갱신 프로토콜의 성능 향상을 보였다.

• 한국지능시스템학회논문지
• /
• 제20권6호
• /
• pp.761-767
• /
• 2010

낸드 플래시 메모리는 블록에 새로운 데이터를 쓰고자 할 때 삭제 연산이 선행되어야 하며 일정 횟수 이상 지움 연산이 반복된 블록은 더 이상 사용이 불가능하다. 데이터의 갱신이 빈번한 핫 데이터는 블록을 빠르게 사용 불가능한 상태에 도달하게 만들 수 있고 이로써 낸드 플래시 메모리의 용량은 시간이 지남에 따라 감소할 수 있다. 본 논문에서는 데이터의 접근 패턴을 고려해 핫 데이터와 콜드 데이터를 분류하는 알고리즘을 제시한다. 이렇게 분류된 데이터 정보를 이용해 삭제 횟수가 많은 블록에 갱신 확률이 적은 콜드 데이터를, 삭제 횟수가 상대적으로 적은 블록에 갱신 확률이 높은 핫 데이터를 맵핑한다. 입력 데이터 패턴을 이용한 핫/콜드 데이터 분류 기법이 기존의 분류 기법을 사용했을 때보다 플래시 메모리의 블록 사용이 균일한 것을 실험을 통해 확인하였다.

• 국제학술발표논문집
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• pp.1170-1178
• /
• 2022

Indoor POI data, an essential component of indoor spatial data, has attribute information of a specific place in the room and is the most critical information necessary for the user. Currently, indoor POI data is manually updated by direct investigation, which is expensive and time-consuming. Recently, research on updating POI using the attribute information of indoor photographs has been advanced to overcome these problems. However, the range of use, such as using only photographs with text information, is limited. Therefore, in this study, and to improvement this, I proposed a new method to update indoor POI data using a smartphone camera. In the proposed method, the POI name is obtained by classifying the indoor scene's photograph into artificial intelligence technology CNN and matching the location criteria to indoor spatial data through AR technology. As a result of creating and experimenting with a prototype application to evaluate the proposed method, it was possible to update POI data that reflects the real world with high accuracy. Therefore, the results of this study can be used as a complement or substitute for the existing methodologies that have been advanced mainly by direct research.