• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2003년도 춘계학술발표회 논문집
• /
• pp.443-450
• /
• 2003

Our country is constructed the digital map in the first NGIS plan. Through digital map construction, it was had the potentiality that can more easily activate GIS. But these data included numerous problems from user's view. In the second NGIS plan, our government try to construct the framework data for the maximization of GIS utilization. This paper is showed a step of update that considered relationship between the national framework data themes, suggested the structure of maintenance activity for national framework data.

• 대한임베디드공학회논문지
• /
• 제2권3호
• /
• pp.145-154
• /
• 2007

Dynamic update of kernel can change kernel functionality and fix bugs in runtime. Dynamic update is important because it leverages availability, reliability and flexibility of kernel. An instruction-granularity update technique has been used for dynamic update. However, it is difficult to apply update technique for a commodity operating system kernel because development and maintenance of update code must be performed with assembly language. To overcome this difficulty, we design the function-granularity dynamic update system which uses high-level language such as C language. The proposed update system makes the development and execution of update convenient by providing the development environment for update code which is same for kernel development. We implement this system for Linux and demonstrate an example of update for do_coredump() function which is reported it has a vulnerable point for security. The update was successfully executed.

• 한국멀티미디어학회논문지
• /
• 제17권11호
• /
• pp.1307-1312
• /
• 2014

Online games are virtual space where it connects individual users through network connection to offer enjoyment of play games and game developer who service online games have to develop new contents and provide them to users to extend life of their service. Typically, in order to update new contents, all service companies have maintenance schedule to stop the game service for a while to update both server and client applications. Usually this process takes quite amount of time and users do not have any other choice but disconnected from server and wait until it is over. The purpose of this thesis is to describe the advantages of new design system which will allows users to continue to play the game even during the update. The main focus of this design is to make users feel more convenience in online gaming experience by move client from previous server to new server while users are still playing. If they can to connect current client with new server without any certificate validation process while users information from the client can automatically pass through to the new server, users may not need to experience maintenance for new contents update.

• Asia pacific journal of information systems
• /
• 제13권4호
• /
• pp.191-206
• /
• 2003

More views in data warehouse, can respond to the users more rapidly because the user's requests might be processed by accessing only the materialized views with higher probabilities rather than accessing base relations. But, the update duration for maintaining materialized views limits the number of materialized views in data warehouse. In this paper, we propose the algorithm for reducing update duration of materialized views, of which aggregation functions are maintained by self-maintenance. We also implement the proposed algorithm and evaluate the performance of the algorithm.

• 항공우주시스템공학회지
• /
• 제10권1호
• /
• pp.15-20
• /
• 2016

The optimal estimation of a general continuous-discrete system can be achieved through the solution of the Fokker-Planck equation and the Bayesian update. Due the high nonlinearity of the equation of motion of the system and the measurement model, it is necessary to linearize the both equation. To avoid linearization, the filter based on Fokker-Planck equation is designed. with the unscented transformation update mechanism, in which the associated Fokker-Planck equation was solved efficiently and accurately via discrete quadrature and the measurement update was done through the unscented transformation update mechanism. This filter based on the Direct Quadrature Moment of Method(DQMOM) and the unscented transformation update is applied to the bearing only target tracking problem. The proposed filter can still provide more accurate estimation of the state than those of the extended Kalman filter especially when measurements are sparse. Simulation results indicate that the advantages of the proposed filter based on the DQMOM and the unscented transformation update make it a promising alternative to the extended Kalman filter.

• 한국정보과학회논문지:시스템및이론
• /
• 제35권5호
• /
• pp.223-230
• /
• 2008

동적인 커널의 업데이트는 복잡한 운영체제 커널의 빈번한 기능 개선 및 버그 수정을 동작 중인 커널의 중단없이 수행하는 것이다. 동적인 업데이트를 위해서는 주로 명령어 단위의 업데이트 기법이 사용되지만 어셈블리 언어 수준에서 개발 및 유지, 보수가 이루어지기 때문에 실제 커널에 적용하기 어렵다. 이런 문제점을 극복하기 위해 우리는 C 언어 수준에서 함수 단위로 동적인 커널 업데이트를 수행하는 시스템을 설계하고 리눅스에 구현하였다. 이 시스템은 업데이트 개발 환경을 커널의 개발 환경과 일치시킴으로써 업데이트의 개발과 수행을 편리하게 하여 실제 커널에의 활용 가능성을 증대시킨다. 우리는 이렇게 증대된 활용 가능성을 실제로 알아보기 위해 이 업데이트 시스템을 이용하여 EXT3 파일 시스템을 간단하게 업데이트하는 사례를 보였다.

• 제어로봇시스템학회논문지
• /
• 제15권8호
• /
• pp.867-875
• /
• 2009

A wireless sensor network inherently comprises a plurality of sensor nodes widely deployed for sensing environmental information. To add new functions or to correct some faulty functions of an existing wireless sensor network, the firmware for each sensor node needs to be updated. Firmware update would be quite troublesome if it requires the gathering, reprogramming, and redeploy of all of already deployed sensor nodes. Over-the-air programming (OTA) facilitates the firmware update process, thereby allowing convenient maintenance of an already-deployed sensor network. This paper proposes and implements a remote firmware update mechanism for a TDMA-based wireless sensor network, in which the firmware for sensor nodes constituting the TDMA-based sensor network can be easily updated and the update process can be conveniently monitored from a remote site. We verify the validity of the proposed firmware update method via experiments and introduce three wireless sensor networks installed in outdoor sites in which the proposed firmware update mechanism has been exploited.

• 정보처리학회논문지D
• /
• 제9D권4호
• /
• pp.561-570
• /
• 2002

본 논문에서는 실체화된 공간뷰의 일관성 유지를 위하여 뷰 유도관련성을 이용한 두 가지 방법인 값 복사 실체화 방법과 식별자 유지 실체화 방법에 대하여 실험 평가한다. 이 실험 결과, 뷰 유도관련성을 이용한 점진적 변경 방법을 값 복사 실체화 방법과 식별자 유지 실체화 방법과 비교할 때, 공간뷰 객체에 대한 변경 시간이 거의 차이가 나지 않는다. 그리고 공간뷰에 대한 질의 수행 실험 결과, 값 복사 실체화가 식별자 유지 실체화보다 질의 수행 시간이 훨씬 빠르다. 결론적으로 실체화와 점진적 변경에 따른 성능 평가를 고려해 볼 때, 전체적으로 식별자 유지 실체화보다 값 복사 실체화를 기반으로 뷰 유도관련성을 이용한 점진적 변경 방법이 가장 바람직하다.

• Tuberculosis and Respiratory Diseases
• /
• 제76권1호
• /
• pp.1-7
• /
• 2014

Maintenance therapy has emerged as a novel therapeutic paradigm for advanced non-small-cell lung cancer (NSCLC). Maintenance therapy that aims to sustain a clinically favorable state after first-line chemotherapy has two strategies. Switch maintenance therapy entails switching to a new and non-cross-resistant agent in an alternating or sequential manner, on completion of first-line chemotherapy. Continuous maintenance therapy keeps ongoing administration of a component of the current regimen after four to six cycles of chemotherapy, if there is a stable disease, or better response. Both maintenance therapies can be continued, until disease progression. The potential evidence regarding maintenance therapy includes providing the opportunity to receive additional treatment, through sustaining tumor shrinkage, and delayed emergence of tumor-related symptom. Thus far, debates over the parameters used to predict the effectiveness of maintenance therapy, financial burden, and uncertainty of improving the quality of life exist. Despite many debates, maintenance therapy, which is currently recommended, has been disclosed to be beneficial.

• 한국정보과학회논문지:데이타베이스
• /
• 제31권1호
• /
• pp.39-47
• /
• 2004

대부분의 시공간 데이타베이스 연구들은 색인 분야에서 진행되었다. 그러나, 색인 연구들은 시공간 색인 유지를 위해서 필요한 엄청난 오버헤드의 고려 없이, 색인 생성 후의 빠른 질의 처리에 초점이 맞추어져 있다. 이 논문에서, 우리는 이동체들의 갱신들을 시공간 색인에 반영하기 위해서 필요한 디스크 액세스 수를 줄이는 효율적인 갱신 관리 방법을 제안한다. 객체의 움직임을 잘 표현할 수 있는 현실적인 갱신 패턴을 고려하여 자주 갱신되는 소수의 객체들을 유지할 수 있는 메모리 구조를 제안한다. 실질적인 갱신 패턴을 고려한 실험 환경에서, 우리의 방법은 기존 색인들의 일반적인 갱신 방법보다 약 40%의 디스크 액세스 수를 줄인다.