• Title/Summary/Keyword: 개별갱신

Search Result 51, Processing Time 0.029 seconds

Design and Implementation of an Instance Access Handling System for Supporting Schema Evolution (스키마 진화를 지원하는 인스턴스 접근처리시스템의 설계 및 구현)

  • Jin, Min;Kim, Bong-Jin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3753-3761
    • /
    • 2000
  • There exist several versions of schema and instances created under different versions of the schema concurrently in the database in schema evolution environments. This paper proposes a mechanism for accessing instances regardless of versions in schema evolution environments in object relational databases. Access handling routines are used in accessing to the instances through the undefined attributes in the versions in which they were created. The change of semantic information of attributes is supported. Access handling routines are defined for each pair of semantics rather than defining backdate/update functions for each pair of versions of a class. A query language that accommodates version and semantic information is defined through the extension of the primitive SQL format.

  • PDF

An Adaptive Connection Admission Control Method Based on the Measurement in ATM Networks (ATM망에서 측정 기반 적응적 연결 수락 제어)

  • 윤지영;김순자
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.8
    • /
    • pp.1907-1914
    • /
    • 1998
  • This paper proposes the adaptive connection admission cotrol using the variale MRR(measurement reflection ratio) and the distribution of the number of cells arriving during the fixed interval. This distribution is estimated from the measured number of cells arriving at the output buffer during the fixed interval and traffic parameters specified by user. MRR is varied by the difference of estimated distribution and measurement distribution. As MRR is adaptively varied by estimated distribution error of accepted connections, it quickly reduces estimation error. Also, the scheduling scheme is proposed for multiplexed traffic with various traffic characteristics. For each traffic class, this scheme estimates adaptively equivalent bandwidth and schedules according to equivalent bandwidth ratio of each traffic class, so it improves cell loss rate and link utilization.

  • PDF

Self Updatable Pseudonym System for VANET (VANET를 위한 차량자체 갱신가능 익명ID 시스템)

  • Kim, Sang-Jin;Lee, Byeong-Woo;Oh, Hee-Kuck
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.5
    • /
    • pp.93-103
    • /
    • 2009
  • Since message forgery or alteration in VANET may cause severe consequences, authentication of critical messages must be provided. However, using normal digital signature may infringe privacy of drivers. Therefore, VANET requires authentication systems that provide conditional anonymity. In this paper, we propose a new authentication system for VANET. In our proposed system, each vehicle can update its pseudonym using re-encryption technique and digitally sign messages using representation problem on the pseudonym. By limiting the usage period, revocation of individual pseudonym is not required. Moreover, we also provide a way to revoke the vehicle itself. Secureness of our system partially rely on the usage of tamper-resistance hardware.

Autonomous Self-Estimation of Vehicle Travel Times in VANET Environment (VANET 환경에서 자율적 자가추정(Self-Estimation) 통행시간정보 산출기법 개발)

  • Im, Hui-Seop;O, Cheol;Gang, Gyeong-Pyo
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.4
    • /
    • pp.107-118
    • /
    • 2010
  • Wireless communication technologies including vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) enable the development of more sophisticated and effective traffic information systems. This study presents a method to estimate vehicular travel times in a vehicular ad hoc network (VANET) environment. A novel feature of the proposed method is estimating individual vehicle travel times through advanced on-board units in each vehicle, referred to as self-estimated travel time in this study. The method uses travel information including vehicle position and speed at each given time step transmitted through the V2V and V2I communications. Vehicle trajectory data obtained from the VISSIM simulator is used for evaluating the accuracy of estimated travel times. Relevant technical issues for successful field implementation are also discussed.

Implementation of Prototype for a Protein Motif Prediction and Update (단백질 모티프 예측 및 갱신 프로토 타입 구현)

  • Noh, Gi-Young;Kim, Wuon-Shik;Lee, Bum-Ju;Lee, Sang-Tae;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.845-854
    • /
    • 2004
  • Motif databases are used in the function and structure prediction of proteins. The frequency of use about these databases increases continuously because of protein sequence data growth. Recently, many researches about motif resource integration are proceeding. However, existing motif databases were developed independently, thus these databases have a heterogeneous search result problem. Database intnegration for this problem resolution has a periodic update problem, a complex query process problem, a duplicate database entry handling problem and BML support problem. Therefore, in this paper, we suppose a database resource integration method for these problem resolution, describe periodically integrated database update method and XML transformation. finally, we estimate the implementation of our prototype and a case database.

Building Change Detection Methodology in Urban Area from Single Satellite Image (단일위성영상 기반 도심지 건물변화탐지 방안)

  • Seunghee Kim;Taejung Kim
    • Korean Journal of Remote Sensing
    • /
    • v.39 no.5_4
    • /
    • pp.1097-1109
    • /
    • 2023
  • Urban is an area where small-scale changes to individual buildings occur frequently. An existing urban building database requires periodic updating to increase its usability. However, there are limitations in data collection for building changes over a wide urban. In this study, we check the possibility of detecting building changes and updating a building database by using satellite images that can capture a wide urban region by a single image. For this purpose, building areas in a satellite image are first extracted by projecting 3D coordinates of building corners available in a building database onto the image. Building areas are then divided into roof and facade areas. By comparing textures of the roof areas projected, building changes such as height change or building removal can be detected. New height values are estimated by adjusting building heights until projected roofs align to actual roofs observed in the image. If the projected image appeared in the image while no building is observed, it corresponds to a demolished building. By checking buildings in the original image whose roofs and facades areas are not projected, new buildings are identified. Based on these results, the building database is updated by the three categories of height update, building deletion, or new building creation. This method was tested with a KOMPSAT-3A image over Incheon Metropolitan City and Incheon building database available in public. Building change detection and building database update was carried out. Updated building corners were then projected to another KOMPSAT-3 image. It was confirmed that building areas projected by updated building information agreed with actual buildings in the image very well. Through this study, the possibility of semi-automatic building change detection and building database update based on single satellite image was confirmed. In the future, follow-up research is needed on technology to enhance computational automation of the proposed method.

Managing the Reverse Extrapolation Model of Radar Threats Based Upon an Incremental Machine Learning Technique (점진적 기계학습 기반의 레이더 위협체 역추정 모델 생성 및 갱신)

  • Kim, Chulpyo;Noh, Sanguk
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.4
    • /
    • pp.29-39
    • /
    • 2017
  • Various electronic warfare situations drive the need to develop an integrated electronic warfare simulator that can perform electronic warfare modeling and simulation on radar threats. In this paper, we analyze the components of a simulation system to reversely model the radar threats that emit electromagnetic signals based on the parameters of the electronic information, and propose a method to gradually maintain the reverse extrapolation model of RF threats. In the experiment, we will evaluate the effectiveness of the incremental model update and also assess the integration method of reverse extrapolation models. The individual model of RF threats are constructed by using decision tree, naive Bayesian classifier, artificial neural network, and clustering algorithms through Euclidean distance and cosine similarity measurement, respectively. Experimental results show that the accuracy of reverse extrapolation models improves, while the size of the threat sample increases. In addition, we use voting, weighted voting, and the Dempster-Shafer algorithm to integrate the results of the five different models of RF threats. As a result, the final decision of reverse extrapolation through the Dempster-Shafer algorithm shows the best performance in its accuracy.

A Link-Based Label Correcting Multi-Objective Shortest Paths Algorithm in Multi-Modal Transit Networks (복합대중교통망의 링크표지갱신 다목적 경로탐색)

  • Lee, Mee-Young;Kim, Hyung-Chul;Park, Dong-Joo;Shin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.1
    • /
    • pp.127-135
    • /
    • 2008
  • Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

직접 접촉방식 열 및 물질교환 장치의 전달현상(II)

  • 김석현
    • Journal of the KSME
    • /
    • v.25 no.5
    • /
    • pp.413-418
    • /
    • 1985
  • 직접 접촉식 교환장치(이하 직접 교환기라 함)에서 액체의 유통형태의 선택은 매우 다양하며 전달계수 역시 개별적인 상황이나 충전물의 종류에 따라서 달라지므로 일률적으로 제시되지 못 하고 있다. 많은 경우 실험을 통하여 열전달 또는 물질전달계수를 측정하게 되나 개수로, 자유 낙하액체막, 액체분류와 같이 이상화가 가능한 경우, 이러한 전달계수를 구하기 위하여 이론적 또는 반실험적인 해석을 수행하기도 한다. 수많은 관련 연구결과들은 층류유동에 관한 것과 난류유동의 경우로 구분되고(예상되듯이 대부분의 직접교환기의 유통영역은 난류쪽이다), 난류 유통의 해석은 다시 표면갱신이론(surface renewal model), 와류확산계수모델(eddy diffusivity model-macroscopic), 미분형와류모델(differential eddy diffusivity model)로 대별된다. 여기서는 수많은 교환기형태의 자료정리보다 상기와 같이 대별된 액체측 유동영역별로 전달현상해석의 방법을 간단히 정리하고자 한다.

  • PDF

The Design of Information Collection and Management System in Multiple Web Board (다중 웹 게시판에서의 정보수집 및 관리 시스템 설계 및 구현)

  • Kim Kwang-Sik;Lee Seung-Gwan;Chung Tae-Choong
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.05a
    • /
    • pp.337-340
    • /
    • 2005
  • 인터넷의 보급과 발전으로 인해 공유하고자 하는 정보를 수시로 웹 브라우저상의 간단한 조작만으로 갱신 및 공유할 수 있고, 정보를 누적 관리할 수 있는 웹 게시판(web board)은 단연 웹상의 정보공유의 중요한 매체로 자리 잡고 있다. 하지만 게시판 정보들은 사용자에게 통보 없이 수시로 변하고 있어서 사용자가 개별적으로 게시판들을 방문하여 일일이 확인하고 검색하여 필요한 정보를 얻는다는 것은 매우 어려운 일이다. 따라서 효율적이고 체계적인 게시판 정보관리와 검색을 위한 기술들이 개발되고 향상되고 있는 현실에 맞추어 본 논문에서는 기존의 다중게시판에서 정보 관리와 검색이 불편하던 점을 개선하여 원하는 정보를 빠르고 편리하게 모니터링 및 검색, 관리할 수 있는 다중게시판 사용자 인터페이스를 설계 및 구현을 한다.

  • PDF