• Title/Summary/Keyword: Sibling Node

Search Result 14, Processing Time 0.026 seconds

An Efficient BitmapInvert Index based on Relative Position Coordinate for Retrieval of XML documents (효율적인 XML검색을 위한 상대 위치 좌표 기반의 BitmapInvert Index 기법)

  • Kim, Tack-Gon;Kim, Woo-Saeng
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.1 s.307
    • /
    • pp.35-44
    • /
    • 2006
  • Recently, a lot of index techniques for storing and querying XML document have been studied so far and many researches of them used coordinate-based methods. But update operation and query processing to express structural relations among elements, attributes and texts make a large burden. In this paper, we propose an efficient BitmapInvert index technique based on Relative Position Coordinate (RPC). RPC has good preformance even if there are frequent update operations because it represents relationship among parent node and left, right sibling nodes. BitmapInvert index supports tort query with bitwise operations and does not casue serious performance degradations on update operations using PostUpdate algerian. Overall, the performance could be improved by reduction of the number of times for traversing nodes.

A Byzantine Fault-tolerant Clock Synchronization Scheme in Wireless Sensor Networks (무선 센서 네트워크에서 비잔틴 오류를 허용하는 클럭 동기화 기법)

  • Lim, Hyung-Geun;Nam, Young-Jin;Baek, Jang-Woon;Ko, Seok-Young;Seo, Dae-Wha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.5
    • /
    • pp.487-491
    • /
    • 2008
  • This paper proposes the Byzantine fault tolerant clock synchronization scheme for wireless sensor networks to cope with the clock synchronization disturbance attack of malicious nodes. In the proposed scheme, a node which is requiring clock synchronization receives 3m+1 clock synchronization messages not only from its parent nodes but also from its sibling nodes in order to tolerate malicious attacks even if up to m malicious nodes exist among them. The results show that the proposed scheme is 7 times more resilient to the clock synchronization disturbance attack of malicious nodes than existing schemes in terms of synchronization accuracy.

Korean Dependency Parsing Using Stack-Pointer Networks and Subtree Information (스택-포인터 네트워크와 부분 트리 정보를 이용한 한국어 의존 구문 분석)

  • Choi, Yong-Seok;Lee, Kong Joo
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.10 no.6
    • /
    • pp.235-242
    • /
    • 2021
  • In this work, we develop a Korean dependency parser based on a stack-pointer network that consists of a pointer network and an internal stack. The parser has an encoder and decoder and builds a dependency tree for an input sentence in a depth-first manner. The encoder of the parser encodes an input sentence, and the decoder selects a child for the word at the top of the stack at each step. Since the parser has the internal stack where a search path is stored, the parser can utilize information of previously derived subtrees when selecting a child node. Previous studies used only a grandparent and the most recently visited sibling without considering a subtree structure. In this paper, we introduce graph attention networks that can represent a previously derived subtree. Then we modify our parser based on the stack-pointer network to utilize subtree information produced by the graph attention networks. After training the dependency parser using Sejong and Everyone's corpus, we evaluate the parser's performance. Experimental results show that the proposed parser achieves better performance than the previous approaches at sentence-level accuracies when adopting 2-depth graph attention networks.

Clinical and Epidemiologic Study of Kawasaki Disease in Children 8 Years of Age and Older (8세 이상 소아에서의 가와사끼병의 임상 역학적 연구)

  • Park, Yong Won;Han, Ji Whan;Park, In Sook;Kim, Chang Hwi;Cha, Sung Ho;Ma, Jae Sook;Kwon, Tae Chan;Lee, Sang Bum;Kim, Chul Ho;Lee, Heung Jae;Yun, Yong Soo
    • Clinical and Experimental Pediatrics
    • /
    • v.48 no.10
    • /
    • pp.1139-1142
    • /
    • 2005
  • Purpose : The aim of this study was to investigate the epidemiologic and clinical profiles of Kawasaki disease(KD) in children 8 years of age and older. Methods : For the epidemiologic study of KD in Korea, data of total 15,692 KD patients were collected from 1994 to 2002 on a 3 year basis, by the retrospective survey. Among them, data of 211 KD patients 8 years of age and older were analyzed and compared with those of the KD patients less than 8 years of age. Results : 211 patients 8 years of age and older(1.3% of total KD patients) with the mean age of 9.8 years, included 142 cases aged 8-10 years, 42 cases aged 10-12 years, and 27 cases aged 12 years and older. The male-to-female ratio was 1.9 : 1, the recurrence rate was 3.8%, and the prevalence of cases in sibling was zero. Coronary arterial(CA) abnormalities were detected by echocardiography in 25.4% of the cases, including 7.6% of CA aneurysm cases. There was 1 case complicated by myocardial infarction. Conclusion : Comparing with the data of the KD patients less than 8 years of age, data of 211 patients 8 years of age and older showed significantly higher incidences of CA abnormalities(25.4% : 19.8%) and CA aneurysms(7.6% : 4.0%).