• Title/Summary/Keyword: 중복 허용

Search Result 100, Processing Time 0.026 seconds

Change Reconciliation on XML Repetitive Data (XML 반복부 데이터의 변경 협상 방법)

  • Lee Eunjung
    • The KIPS Transactions:PartA
    • /
    • v.11A no.6
    • /
    • pp.459-468
    • /
    • 2004
  • Sharing XML trees on mobile devices has become more and more popular. Optimistic replication of XML trees for mobile devices raises the need for reconciliation of concurrently modified data. Especially for reconciling the modified tree structures, we have to compare trees by node mapping which takes O($n^2$) time. Also, using semantic based conflict resolving policy is often discussed in the literature. In this research, we focused on an efficient reconciliation method for mobile environments, using edit scripts of XML data sent from each device. To get a simple model for mobile devices, we use the XML list data sharing model, which allows inserting/deleting subtrees only for the repetitive parts of the tree, based on the document type. Also, we use keys for repetitive part subtrees, keys are unique between nodes with a same parent. This model not only guarantees that the edit action always results a valid tree but also allows a linear time reconciliation algorithm due to key based list reconciliation. The algorithm proposed in this paper takes linear time to the length of edit scripts, if we can assume that there is no insertion key conflict. Since the previous methods take a linear time to the size of the tree, the proposed method is expected to provide a more efficient reconciliation model in the mobile environment.

Orthophoto and DEM Generation Using Low Specification UAV Images from Different Altitudes (고도가 다른 저사양 UAV 영상을 이용한 정사영상 및 DEM 제작)

  • Lee, Ki Rim;Lee, Won Hee
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.5
    • /
    • pp.535-544
    • /
    • 2016
  • Even though existing methods for orthophoto production using expensive aircraft are effective in large areas, they are drawbacks when dealing with renew quickly according to geographic features. But, as UAV(Unmanned Aerial Vehicle) technology has advanced rapidly, and also by loading sensors such as GPS and IMU, they are evaluates that these UAV and sensor technology can substitute expensive traditional aerial photogrammetry. Orthophoto production by using UAV has advantages that spatial information of small area can be updated quickly. But in the case of existing researches, images of same altitude are used in orthophoto generation, they are drawbacks about repetition of data and renewal of data. In this study, we targeted about small slope area, and by using low-end UAV, generated orthophoto and DEM(Digital Elevation Model) through different altitudinal images. The RMSE of the check points is σh = 0.023m on a horizontal plane and σv = 0.049m on a vertical plane. This maximum value and mean RMSE are in accordance with the working rule agreement for the aerial photogrammetry of the National Geographic Information Institute(NGII) on a 1/500 scale digital map. This paper suggests that generate orthophoto of high accuracy using a different altitude images. Reducing the repetition of data through images of different altitude and provide the informations about the spatial information quickly.

n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure (n-gram/2L: 공간 및 시간 효율적인 2단계 n-gram 역색인 구조)

  • Kim Min-Soo;Whang Kyu-Young;Lee Jae-Gil;Lee Min-Jae
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.12-31
    • /
    • 2006
  • The n-gram inverted index has two major advantages: language-neutral and error-tolerant. Due to these advantages, it has been widely used in information retrieval or in similar sequence matching for DNA and Protein databases. Nevertheless, the n-gram inverted index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance while preserving the advantages of the n-gram inverted index. The proposed index eliminates the redundancy of the position information that exists in the n-gram inverted index. The proposed index is constructed in two steps: 1) extracting subsequences of length m from documents and 2) extracting n-grams from those subsequences. We formally prove that this two-step construction is identical to the relational normalization process that removes the redundancy caused by a non-trivial multivalued dependency. The n-gram/2L index has excellent properties: 1) it significantly reduces the size and improves the Performance compared with the n-gram inverted index with these improvements becoming more marked as the database size gets larger; 2) the query processing time increases only very slightly as the query length gets longer. Experimental results using databases of 1 GBytes show that the size of the n-gram/2L index is reduced by up to 1.9${\~}$2.7 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram inverted index.

User Pairing and Resource Allocation for DFTS-OFDMA Uplink Systems Using Virtual MIMO (가상 여러입력 여러출력을 적용한 DFTS-OFDMA 상향 링크 시스템에서의 사용자 쌍 선택 및 자원 할당)

  • Shin, Dong Ryul;Wang, Jinsoo;Kim, Yun Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.5
    • /
    • pp.443-450
    • /
    • 2013
  • We consider user pairing and resource allocation for the uplink of cellular systems employing virtual multiple input multiple output (MIMO). As a multiple access scheme, discrete Fourier transform spread orthogonal frequency division multiple access (DFTS-OFDMA) is adopted for more flexible resource allocation than single carrier (SC)-OFDMA adopted in the Long Term Evolution (LTE) system. We formulate the optimization problems of user pairing and resource allocation to maximize the throughput of the DFTS-OFDMA system under different constraints. The DFTS-OFDMA allowing non-contiguous subcarrier allocation and redundant user assignment provides a better throughput than the SC-FDMA at lower complexity in finding the optimal solution but at the cost of the increased control information indicating the allocated resources.

Tax Incentives for Job Creation and Employment Retention (고용창출과 고용유지를 위한 조세지원제도의 개선방안에 관한 연구)

  • Lee, Byung-San
    • Journal of Digital Convergence
    • /
    • v.13 no.11
    • /
    • pp.133-139
    • /
    • 2015
  • This study is aimed at suggesting the establishment strategy of human resource development through the tax support system under the "Tax incentive limitation law" provided for job creation and employment retention, by which the improvement measurements for utility maximization. The study results are briefly summarized as follows: At first, It's necessary to permit overlapping deduction of the tax favor for encouragement of job creation and employment retention, i.e. tax exemption and tax credit, and to exclude a company from the object for the alternative minimum tax application for maximization of the effect on employment inducement. Secondly, It's necessary to establish tax exemption and a tax credit on the surplus of the minimum wage standard. At last, It's also necessary to abolish, or expand the sunset period of tax support on a large scale to enhance the predictability of human resources management. These discussion are made through the convergence both employment policies and tax laws.

Redundancy operation method for a distributed public address system (분산형 전관방송 시스템의 이중화 운영 방법)

  • Ryu, Taeha;Kim, Seungcheon
    • Journal of the Korea Convergence Society
    • /
    • v.11 no.8
    • /
    • pp.47-53
    • /
    • 2020
  • In the case of a failure due to equipment deterioration in the public address system or a worker's mistake during construction, broadcasting becomes impossible. In this situation, we have designed a more advanced management broadcast system that can broadcast. The broadcasting service is operated using main broadcasting device, and local broadcasting device operates separately only in the local area. If the main broadcasting device becomes inoperable, the procedure for transferring the control activates the device with the local broadcasting devices based on data backed up by the main controller. This paper proposes an improved method of the conventional emergency broadcasting device duplication method. The existing method could not use the standby equipment in the normal state, but in the proposed method, the standby equipment can be used as local broadcasting equipment in usually. This method enables stable system operation while minimizing resource waste due to redundant configuration of expensive devices.

Intelligent Multi-Agent Distributed Platform based on Dynamic Object Group Management using Fk-means (Fk means를 이용한 동적객체그룹관리기반 지능형 멀티 에이전트 분산플랫폼)

  • Lee, Jae-wan;Na, Hye-Young;Mateo, Romeo Mark A.
    • Journal of Internet Computing and Services
    • /
    • v.10 no.1
    • /
    • pp.101-110
    • /
    • 2009
  • Multi-agent systems are mostly used to integrate the intelligent and distributed approaches to various systems for effective sharing of resources and dynamic system reconfigurations. Object replication is usually used to implement fault tolerance and solve the problem of unexpected failures to the system. This paper presents the intelligent multi-agent distributed platform based on the dynamic object group management and proposes an object search technique based on the proposed filtered k-means (Fk-means). We propose Fk-means for the search mechanism to find alternative objects in the event of object failures and transparently reconnect client to the object. The filtering range of Fk-means value is set only to include relevant objects within the group to perform the search method efficiently. The simulation result shows that the proposed mechanism provides fast and accurate search for the distributed object groups.

  • PDF

An Efficient Join Algorithm for Data Streams with Overlapping Window (중첩 윈도우를 가진 데이터 스트링을 위한 효율적인 조인 알고리즘)

  • Kim, Hyeon-Gyu;Kang, Woo-Lam;Kim, Myoung-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.5
    • /
    • pp.365-369
    • /
    • 2009
  • Overlapping windows are generally used for queries to process continuous data streams. Nevertheless, existing approaches discussed join algorithms only for basic types of windows such as tumbling windows and tuple-driven windows. In this paper, we propose an efficient join algorithm for overlapping windows, which are considered as a more general type of windows. The proposed algorithm is based on an incremental window join. It focuses on producing join results continuously when the memory overflow frequently occurs. It consists of (1) a method to use both of the incremental and full joins selectively, (2) a victim selection algorithm to minimize latency of join processing and (3) an idle time professing algorithm. We show through our experiments that the selective use of incremental and full joins provides better performance than using one of them only.

Automatic Generation of the Local Level Knowledge Structure of a Single Document Using Clustering Methods (클러스터링 기법을 이용한 개별문서의 지식구조 자동 생성에 관한 연구)

  • Han, Seung-Hee;Chung, Young-Mee
    • Journal of the Korean Society for information Management
    • /
    • v.21 no.3
    • /
    • pp.251-267
    • /
    • 2004
  • The purpose of this study is to generate the local level knowledge structure of a single document, similar to end-of-the-book indexes and table of contents of printed material through the use of term clustering and cluster representative term selection. Furthermore, it aims to analyze the functionalities of the knowledge structure. and to confirm the applicability of these methods in user-friend1y information services. The results of the term clustering experiment showed that the performance of the Ward's method was superior to that of the fuzzy K -means clustering method. In the cluster representative term selection experiment, using the highest passage frequency term as the representative yielded the best performance. Finally, the result of user task-based functionality tests illustrate that the automatically generated knowledge structure in this study functions similarly to the local level knowledge structure presented In printed material.

Performance Evaluation of Multi-path Source Routing Protocol according to Mobility Model (이동성 모델에 따른 다중경로 소스 라우팅 프로토콜의 성능평가)

  • Kim, Su-Sun;Kim, Moon Jeong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.8
    • /
    • pp.5559-5564
    • /
    • 2015
  • A variety of routing protocols targeted specifically at mobile ad-hoc network environments have been developed. Mobile ad-hoc network is a self-organizing temporary network, operating without the aid of any established wired infrastructure. The proposed protocol supports seamless communication services between the mobile hosts within a mobile ad-hoc network environments. In particular, our protocol makes faster route re-establishment possible by maintaining multiple paths in each mobile host, and also, the protocol provides reliable communication environments. We compare the performance of RWP model with that of LW model. This paper shows delivery ratio with single path and non-disjoint multiple path according to mobility model and node numbers.