• Title/Summary/Keyword: 데이터 구조 유사도

Search Result 548, Processing Time 0.024 seconds

An Efficient Split Algorithm to Minimize the Overlap between Node Index Spaces in a Multi-dimensional Indexing Scheme M-tree (다차원 색인구조 M-트리에서 노드 색인 공간의 중첩을 최소화하기 위한 효율적인 분할 알고리즘)

  • Im Sang-hyuk;Ku Kyong-I;Kim Ki-chang;Kim Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.12D no.2 s.98
    • /
    • pp.233-246
    • /
    • 2005
  • To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

Study on MPI-based parallel sequence similarity search in the LINUX cluster (클러스터 환경에서의 MPI 기반 병렬 서열 유사성 검색에 관한 연구)

  • Hong, Chang-Bum;Cha, Jeoung-Ho;Lee, Sung-Hoon;Shin, Seung-Woo;Park, Keun-Joon;Park, Keun-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.6 s.44
    • /
    • pp.69-78
    • /
    • 2006
  • In the field of the bioinformatics, it plays an important role in predicting functional information or structure information to search similar sequence in biological DB. Biolrgical sequences have been increased dramatically since Human Genome Project. At this point, because the searching speed for the similar sequence is highly regarded as the important factor for predicting function or structure, the SMP(Sysmmetric Multi-Processors) computer or cluster is being used in order to improve the performance of searching time. As the method to improve the searching time of BLAST(Basic Local Alighment Search Tool) being used for the similarity sequence search, We suggest the nBLAST algorithm performing on the cluster environment in this paper. As the nBLAST uses the MPI(Message Passing Interface), the parallel library without modifying the existing BLAST source code, to distribute the query to each node and make it performed in parallel, it is possible to easily make BLAST parallel without complicated procedures such as the configuration. In addition, with the experiment performing the nBLAST in the 28 nodes of LINUX cluster, the enhanced performance according to the increase in the number of the nodes has been confirmed.

  • PDF

Implementation of Policy based In-depth Searching for Identical Entities and Cleansing System in LOD Cloud (LOD 클라우드에서의 연결정책 기반 동일개체 심층검색 및 정제 시스템 구현)

  • Kim, Kwangmin;Sohn, Yonglak
    • Journal of Internet Computing and Services
    • /
    • v.19 no.3
    • /
    • pp.67-77
    • /
    • 2018
  • This paper suggests that LOD establishes its own link policy and publishes it to LOD cloud to provide identity among entities in different LODs. For specifying the link policy, we proposed vocabulary set founded on RDF model as well. We implemented Policy based In-depth Searching and Cleansing(PISC for short) system that proceeds in-depth searching across LODs by referencing the link policies. PISC has been published on Github. LODs have participated voluntarily to LOD cloud so that degree of the entity identity needs to be evaluated. PISC, therefore, evaluates the identities and cleanses the searched entities to confine them to that exceed user's criterion of entity identity level. As for searching results, PISC provides entity's detailed contents which have been collected from diverse LODs and ontology customized to the content. Simulation of PISC has been performed on DBpedia's 5 LODs. We found that similarity of 0.9 of source and target RDF triples' objects provided appropriate expansion ratio and inclusion ratio of searching result. For sufficient identity of searched entities, 3 or more target LODs are required to be specified in link policy.

Building change detection in high spatial resolution images using deep learning and graph model (딥러닝과 그래프 모델을 활용한 고해상도 영상의 건물 변화탐지)

  • Park, Seula;Song, Ahram
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.40 no.3
    • /
    • pp.227-237
    • /
    • 2022
  • The most critical factors for detecting changes in very high-resolution satellite images are building positional inconsistencies and relief displacements caused by satellite side-view. To resolve the above problems, additional processing using a digital elevation model and deep learning approach have been proposed. Unfortunately, these approaches are not sufficiently effective in solving these problems. This study proposed a change detection method that considers both positional and topology information of buildings. Mask R-CNN (Region-based Convolutional Neural Network) was trained on a SpaceNet building detection v2 dataset, and the central points of each building were extracted as building nodes. Then, triangulated irregular network graphs were created on building nodes from temporal images. To extract the area, where there is a structural difference between two graphs, a change index reflecting the similarity of the graphs and differences in the location of building nodes was proposed. Finally, newly changed or deleted buildings were detected by comparing the two graphs. Three pairs of test sites were selected to evaluate the proposed method's effectiveness, and the results showed that changed buildings were detected in the case of side-view satellite images with building positional inconsistencies.

A Code Clustering Technique for Unifying Method Full Path of Reusable Cloned Code Sets of a Product Family (제품군의 재사용 가능한 클론 코드의 메소드 경로 통일을 위한 코드 클러스터링 방법)

  • Kim, Taeyoung;Lee, Jihyun;Kim, Eunmi
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.12 no.1
    • /
    • pp.1-18
    • /
    • 2023
  • Similar software is often developed with the Clone-And-Own (CAO) approach that copies and modifies existing artifacts. The CAO approach is considered as a bad practice because it makes maintenance difficult as the number of cloned products increases. Software product line engineering is a methodology that can solve the issue of the CAO approach by developing a product family through systematic reuse. Migrating product families that have been developed with the CAO approach to the product line engineering begins with finding, integrating, and building them as reusable assets. However, cloning occurs at various levels from directories to code lines, and their structures can be changed. This makes it difficult to build product line code base simply by finding clones. Successful migration thus requires unifying the source code's file path, class name, and method signature. This paper proposes a clustering method that identifies a set of similar codes scattered across product variants and some of their method full paths are different, so path unification is necessary. In order to show the effectiveness of the proposed method, we conducted an experiment using the Apo Games product line, which has evolved with the CAO approach. As a result, the average precision of clustering performed without preprocessing was 0.91 and the number of identified common clusters was 0, whereas our method showed 0.98 and 15 respectively.

Comparison on Patterns of Conflicts in the South China Sea and the East China Sea through Analysis on Mechanism of Chinese Gray Zone Strategy (중국의 회색지대전략 메커니즘 분석을 통한 남중국해 및 동중국해 분쟁 양상 비교: 시계열 데이터에 근거한 경험적 연구를 중심으로)

  • Cho, Yongsu
    • Maritime Security
    • /
    • v.1 no.1
    • /
    • pp.273-310
    • /
    • 2020
  • This study aims at empirically analyzing the overall mechanism of the "Gray Zone Strategy", which has begun to be used as one of Chinese major maritime security strategies in maritime conflicts surrounding the South China Sea and East China Sea since early 2010, and comparing the resulting conflict patterns in those reg ions. To this end, I made the following two hypotheses about Chinese gray zone strategy. The hypotheses that I have argued in this study are the first, "The marine gray zone strategy used by China shows different structures of implementation in the South China Sea and the East China Sea, which are major conflict areas.", the second, "Therefore, the patterns of disputes in the South China Sea and the East China Sea also show a difference." In order to examine this, I will classify Chinese gray zone strategy mechanisms multi-dimensionally in large order, 1) conflict trends and frequency of strategy execution, 2) types and strengths of strategy, 3) actors of strategy execution, and 4) response methods of counterparts. So, I tried to collect data related to this based on quantitative modeling to test these. After that, about 10 years of data pertaining to this topic were processed, and a research model was designed with a new categorization and operational definition of gray zone strategies. Based on this, I was able to successfully test all the hypotheses by successfully comparing the comprehensive mechanisms of the gray zone strategy used by China and the conflict patterns between the South China Sea and the East China Sea. In the conclusion, the verified results were rementioned with emphasizing the need to overcome the security vulnerabilities in East Asia that could be caused by China's marine gray zone strategy. This study, which has never been attempted so far, is of great significance in that it clarified the intrinsic structure in which China's gray zone strategy was implemented using empirical case studies, and the correlation between this and maritime conflict patterns was investigated.

  • PDF

Story-based Information Retrieval (스토리 기반의 정보 검색 연구)

  • You, Eun-Soon;Park, Seung-Bo
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.4
    • /
    • pp.81-96
    • /
    • 2013
  • Video information retrieval has become a very important issue because of the explosive increase in video data from Web content development. Meanwhile, content-based video analysis using visual features has been the main source for video information retrieval and browsing. Content in video can be represented with content-based analysis techniques, which can extract various features from audio-visual data such as frames, shots, colors, texture, or shape. Moreover, similarity between videos can be measured through content-based analysis. However, a movie that is one of typical types of video data is organized by story as well as audio-visual data. This causes a semantic gap between significant information recognized by people and information resulting from content-based analysis, when content-based video analysis using only audio-visual data of low level is applied to information retrieval of movie. The reason for this semantic gap is that the story line for a movie is high level information, with relationships in the content that changes as the movie progresses. Information retrieval related to the story line of a movie cannot be executed by only content-based analysis techniques. A formal model is needed, which can determine relationships among movie contents, or track meaning changes, in order to accurately retrieve the story information. Recently, story-based video analysis techniques have emerged using a social network concept for story information retrieval. These approaches represent a story by using the relationships between characters in a movie, but these approaches have problems. First, they do not express dynamic changes in relationships between characters according to story development. Second, they miss profound information, such as emotions indicating the identities and psychological states of the characters. Emotion is essential to understanding a character's motivation, conflict, and resolution. Third, they do not take account of events and background that contribute to the story. As a result, this paper reviews the importance and weaknesses of previous video analysis methods ranging from content-based approaches to story analysis based on social network. Also, we suggest necessary elements, such as character, background, and events, based on narrative structures introduced in the literature. We extract characters' emotional words from the script of the movie Pretty Woman by using the hierarchical attribute of WordNet, which is an extensive English thesaurus. WordNet offers relationships between words (e.g., synonyms, hypernyms, hyponyms, antonyms). We present a method to visualize the emotional pattern of a character over time. Second, a character's inner nature must be predetermined in order to model a character arc that can depict the character's growth and development. To this end, we analyze the amount of the character's dialogue in the script and track the character's inner nature using social network concepts, such as in-degree (incoming links) and out-degree (outgoing links). Additionally, we propose a method that can track a character's inner nature by tracing indices such as degree, in-degree, and out-degree of the character network in a movie through its progression. Finally, the spatial background where characters meet and where events take place is an important element in the story. We take advantage of the movie script to extracting significant spatial background and suggest a scene map describing spatial arrangements and distances in the movie. Important places where main characters first meet or where they stay during long periods of time can be extracted through this scene map. In view of the aforementioned three elements (character, event, background), we extract a variety of information related to the story and evaluate the performance of the proposed method. We can track story information extracted over time and detect a change in the character's emotion or inner nature, spatial movement, and conflicts and resolutions in the story.

An Approach of Scalable SHIF Ontology Reasoning using Spark Framework (Spark 프레임워크를 적용한 대용량 SHIF 온톨로지 추론 기법)

  • Kim, Je-Min;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.42 no.10
    • /
    • pp.1195-1206
    • /
    • 2015
  • For the management of a knowledge system, systems that automatically infer and manage scalable knowledge are required. Most of these systems use ontologies in order to exchange knowledge between machines and infer new knowledge. Therefore, approaches are needed that infer new knowledge for scalable ontology. In this paper, we propose an approach to perform rule based reasoning for scalable SHIF ontologies in a spark framework which works similarly to MapReduce in distributed memories on a cluster. For performing efficient reasoning in distributed memories, we focus on three areas. First, we define a data structure for splitting scalable ontology triples into small sets according to each reasoning rule and loading these triple sets in distributed memories. Second, a rule execution order and iteration conditions based on dependencies and correlations among the SHIF rules are defined. Finally, we explain the operations that are adapted to execute the rules, and these operations are based on reasoning algorithms. In order to evaluate the suggested methods in this paper, we perform an experiment with WebPie, which is a representative ontology reasoner based on a cluster using the LUBM set, which is formal data used to evaluate ontology inference and search speed. Consequently, the proposed approach shows that the throughput is improved by 28,400% (157k/sec) from WebPie(553/sec) with LUBM.

A Study on the Convective Characteristics of The Gilt-bronze Incense Burner of Baekje through the Incense-Burning Experiment (분향실험을 통한 백제금동대향로 내부 대류특성 연구)

  • Kim, Seon Yeong;Hwang, Hyun Sung
    • Journal of Conservation Science
    • /
    • v.35 no.5
    • /
    • pp.470-479
    • /
    • 2019
  • The objective of this study is to identify the reason behind the expansion of exhaust holes and inhalational holes through high-definition filming and measurement of The Gilt-bronze Incense Burner of Baekje. In the proposed experiment, based on the original data obtained after a precise three-dimensional (3D) scan of the said incense burner, the precision replica and the commercial replica of the incense burner were subjected to a 3D scan. The overall shape and detailed patterns were subsequently compared with the original data. Furthermore, the incense-burning experiment was conducted according to the sizes and opened or unopened states of the exhaust and inhalational holes by employing the precision replica of the actual real relic for examining the internal structure of the lid and for studying the sizes and locations of the smoke holes. The results indicate that depending on the sizes of the exhaust and inhalational holes, the lower-line air intake holes can cause incomplete combustion in the incense burner. Depending on the opened or unopened states of the exhaust and inhalational holes, the phoenix air exhaust holes and upper-line air exhaust holes play a primary role in releasing the smoke, whereas the lower-line air intake holes play a primary role in smoke inhalation.

The Effect of Compressed Video Traffic over ABR on Satellite ATM Networks (위성 ATM 망에서 압축된 비디오 트래픽의 ABR 서비스에 미치는 영향)

  • 김성철;이상은
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9A
    • /
    • pp.1285-1294
    • /
    • 1999
  • In this paper we consider the performance of TCP video traffic over ABR with Long-Range Dependent VBR traffic. As compressed coded video traffics are increasing rapidly over Internet, lots of studies are being done for transmitting those traffics efficiently using limited network resources. We consider here the transmitting video service over ABR service in ATM networks, especially satellite networks. CBR or VBR services are suggested in transmitting the video traffic in ATM Forum TM 4.0. But ABR service connection, which is considered as appropriate service for data traffic, can be established with a small amount of bandwidth, MCR (Minimum cell rate). Furthermore ABR service can control the source's transmitting rate using feedback mechanism. Using this feature ABR service can be used in some applications which can control their quality of services corresponding to network loads. Compressed video sources with MPEG-2 are used for Long-Range Dependent VBR traffic here. We model the compressed video source to resemble the MPEG-2 transport streams. These compressed video traffic streams are consisted of three different frames, I-frame, P-frame, and B-frame. So when a network are overloaded, we can control the quality of service using this traffic features. TCP Traffics over ABR need large buffers in ATM switch to satisfy their QoS with background VBR traffics, which have high deviations in bandwidth. Furthermore satellite ATM networks with large feedback delay need large buffers corresponding RTT delay. The performance comparisons among EFCI and ER switch (ERICA+) switches in the network circumstances described above were shown in this paper. We also considered the case with ON-OFF VBR traffics.

  • PDF