• Title/Summary/Keyword: Minimum Spanning Tree

Search Result 133, Processing Time 0.018 seconds

Efficient Construction of Emergency Network Using Delaunay Triangulation (들로네 삼각망을 활용한 효과적인 긴급 연락망 구성)

  • Kim, Chae-Kak;Kim, In-Bum;Kim, Soo-In
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.11
    • /
    • pp.81-90
    • /
    • 2014
  • For necessary information sharing or operation control via wire-wireless/mobile network connecting of devices at disaster area in greatest need of attention, an emergency network efficient construction method quickly connecting nodes within specific range using Delaunay triangulation is proposed. The emergency network constructed by proposed method shows the same aggregate network length, but does more excellent performance in term of network construction time the more long max length connectable to adjacent node as compared with the network by naive method. In experiment of 1000 input terminal nodes, 5 max length connectable to adjacent node, our proposed method enhances 89.1% in execution time without network length increase compared to naive method. So our method can go well to many useful applications as shift construction of communication network of adjacent devices, internet of things and efficient routing in the sensor network in continuous improvement of communication capability.

An Index Structure for Substructure Searching In Chemical Databases (화학 데이타베이스에서 부분구조 검색을 위한 인덱스 구조)

  • Lee Hwangu;Cha Jaehyuk
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.641-649
    • /
    • 2004
  • The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

Optimal Combination of Acupoints Based on Network Analysis for Chemotherapy-Induced Peripheral Neuropathy (네트워크 분석에 기반한 항암화학요법으로 유발된 말초신경병증의 최적 경혈 조합)

  • Kim, Min-Woo;Kim, Joong-Il;Lee, Jin-Hyun;Jo, Dong-Chan;Kang, Su-Bin;Lee, Ji-Won;Park, Tae-Yong;Ko, Youn-Seok
    • Journal of Korean Medicine Rehabilitation
    • /
    • v.32 no.1
    • /
    • pp.107-124
    • /
    • 2022
  • Objectives This study aimed to identify optimal combinations of acupoints used to treat chemotherapy-induced peripheral neuropathy (CIPN). Methods We searched four international databases (MEDLINE, EMBASE, the Allied and Complementary Medicine Databases [AMED], and China National Knowledge Infrastructure [CNKI]) and five Korean databases (DBpia, Research Information Sharing Service [RISS], Korean Studies Information Service System [KISS], Oriental Medicine Advanced Searching Integrated System [OASIS], and KoreaMed) to identify randomized controlled trials (RCTs) that used acupuncture to treat CIPN. Network analysis was performed on the acupoints used in more than three included articles. We constructed a network by calculating the Jaccard similarity coefficient between acupoints and applied minimum spanning tree. Then, modularity analysis, degree centrality (Cd), and betweenness centrality (Cb) were used to analyze properties of the acupoints. Results A total of 25 articles were included. 24 acupoints were extracted from 25 articles. The combinations of acupoints having the highest Jaccard similarity coefficient were {EX-UE9, EX-LE10} and {ST36, SP6}. In the modularity analysis, acupoints were classified to six modules. ST40, EX-UE11, and KI6 had the highest Cd value while ST40, GB34 had the highest Cb value. Conclusions This study found the systematic framework of acupoint combinations used in CIPN studies. This study is expected to provide new perspectives of CIPN treatment to therapists. A RCT is in progress of using the network of this study as a guideline. If significant results are derived from the RCT, it will be possible to lay the groundwork to consider acupuncture for CIPN treatment.