• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3025-3035
• /
• 1998

In this paper, we describe the design and implementationof COIRS COncept,based Image Retricval System). It differs from extant content-based image retrieval systems in that it enables users to query based on concepts- it allows users to get images concepmally relevant. A concept is basically an aggregation of promitive objects in an image. For such a cencept based image retrieval functionality. COIRS aglopts an image descriptor called triple and includes a triple thesaurus used for capturing concepts. There are four facilities in COIRS: a visual image indeses a triple thesaurus, an inverted fiel, and a user query interface. The visnal image indeser facilitates object laeling and the percification of positionof objects. It is an assistant tool designed to minimize manual work when indexing images. The thesarrus captires the concepts by analyzing triples, thereby extracting image semantics. The triples are then for formalating queries as well as indexing images. The user query interiare enables users to formulate...

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.2
• /
• pp.125-133
• /
• 2009

RDF is widely used as the ontology language for representing metadata on the semantic web. Since ontology models the real-world, ontology changes overtime. Thus, it is very important to detect and analyze changes in knowledge base system. Earlier studies on detecting changes between RDF models focused on the structural differences. Some techniques which reduce the size of the delta by considering the RDFS entailment rules have been introduced. However, inferencing with RDF models increases data size and upload time. In this paper, we propose a new change detection using RDF reasoning that only computes a small part of the implied triples using backward chaining strategy. We show that our approach efficiently detects changes through experiments with real-life RDF datasets.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.74-78
• /
• 2009

Efficient reasoning has become important for improving the performance of ontology systems as the size of ontology grows. In this paper, we introduce a method that efficiently performs reasoning of RDFS entailment rules (i.e., rdfs7 and rdfs9 rules) and OWL inverse rule using views in the DBMS-based triple sotre. Reasoning is performed by replacing reasoning rules with the corresponding view definition and storing RDF triples into the structured triple tables. When processing queries, the views is referred instead of original tables. In this way, we can reduce the time needed for reasoning and also obtain the space-efficiency of the triple store.

• Nuclear Engineering and Technology
• /
• v.52 no.6
• /
• pp.1252-1258
• /
• 2020

This study explores the ability of non-destructive assay techniques to detect a partial material defect in which 100 g of plutonium are diverted from the center of a 1000 g can of PuO₂ powder. Four safeguards measurements techniques: neutron multiplicity counting, calorimetry, gravimetry, and gamma ray spectroscopy are used in an attempt to detect the defect. Several materials are added to the partial defect PuO₂ can to replicate signatures of the diverted material. ²⁵²Cf is used to compensate for the doubles neutron counts, ²⁴¹Am is used to compensate for the decay heat, and aluminum is used to compensate for the weight. Although, the doubles and triples difference before and after diversion are statistically indistinguishable with the AWCC in fast and thermal mode, the difference in the singles counts are statistically detectable in both modes. The relatively short half-life of ²⁵²Cf leads to a decrease (three sigma uncertainty) in the doubles neutron counts after 161 days. Combining this with the precise quantity of ²⁴¹Am needed (10.7 g) to mimic the heat signature and the extreme precision in ²⁵²Cf mass needed to defeat neutron multiplicity measurements gives reassurance in the International Atomic Energy Agency's ability to detect partial material defects.

• International Journal of Human Ecology
• /
• v.8 no.2
• /
• pp.85-97
• /
• 2007

The two main purposes of this study were to develop the 'Three Generation Family-Madang Program' and to examine its effects on enhancing family functioning and strengthening family relationships. The 'Three Generation Family-Madang Program' consisted of six sessions, each of which included various types of activities and educational materials to evoke interests of the three-generation family members. Subjects of this study were 21 triples, consisting of mothers and their family members, each for the experimental group and the control group, respectively. Mean, Standard Deviation, MANCOVA, and Discriminant Analysis were carried out for the data analyses. Our results showed that the 'Three Generation Family-Madang Program' was effective in enhancing family adaptability and family relationships. Our program focused on the parent generation to have a better understanding and a more positive perspective toward other family members, which would enhance family functioning and family relationships. Our program also received positive feedback from the grandparent and grandchildren generation participants.

• Proceedings of the Korea Contents Association Conference
• /
• 2012.05a
• /
• pp.281-282
• /
• 2012

문서에 존재하는 중요한 개체를 인식하고 그것들 간의 관계를 식별하는 시맨틱 트리플 추출은 문헌 분석의 기반이 되는 중요한 작업이다. 본 논문에서는 특허 문헌에서 이러한 시맨틱 트리플을 추출하는 방법에 대해서 설명한다. 특허 문헌의 효과적인 자동 분석을 위하여 문장 내의 다양한 구문적 변형을 인식하여 하나의 정규화된 의미 형태로 표현해주는 술어-논항 구조 기반의 패턴을 사용하였고, 패턴의 자동화된 확장을 위하여 부트스트랩핑 방법을 적용하였다. 이러한 방법은 소규모의 시드 데이터를 활용하여 특정의미 관계를 갖는 패턴을 자동으로 확장하고 최종적으로는 유의미한 트리플을 추출하는 방법으로 다량의 이진 관계 집합을 처리해야 할 때 아주 유용한 방법이다. 시스템 적용을 통하여 특허 문헌에 적합한 38개의 연관관계 집합을 생성하였고, 32,608개의 유의미한 트리플을 추출하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.10
• /
• pp.45-55
• /
• 2018

R2RML is a W3C standard language that defines how to expose the relational data as RDF triples. The output from an R2RML mapping is only an RDF dataset. By definition, the dataset has no schema. The lack of schema makes the dataset in linked data portal impractical for integrating and analyzing data. To address this issue, we propose an approach for generating automatically schemas for RDF graphs populated by R2RML mappings. More precisely, we represent the schema using ShEx, which is a language for validating and describing RDF. Our approach allows to generate ShEx schemas as well as RDF datasets from R2RML mappings. Our ShEx schema can provide benefits for both data providers and ordinary users. Data providers can verify and guarantee the structural integrity of the dataset against the schema. Users can write SPARQL queries efficiently by referring to the schema. In this paper, we describe data structures and algorithms of the system to derive ShEx documents from R2RML documents and presents a brief demonstration regarding its proper use.

• Journal of Information Technology Services
• /
• v.9 no.4
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.1
• /
• pp.109-116
• /
• 2021

Since RDF (Resource Description Framework) triples are modeled as graph, we cannot directly adopt existing solutions in relational databases and XML technology. In order to store, index, and query Linked Data more efficiently, we propose a convergence indexing method combined R*-tree and K-dimensional trees. This method uses a hybrid storage system based on HDD (Hard Disk Drive) and SSD (Solid State Drive) devices, and a separated filter and refinement index structure to filter unnecessary data and further refine the immediate result. We perform performance comparisons based on three standard join retrieval algorithms. The experimental results demonstrate that our method has achieved remarkable performance compared to other existing methods such as Quad and Darq.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.11a
• /
• pp.90-94
• /
• 2006

The research about social network for analyzing human relationship has been steadily worked due to the importance in the social science field. It is also important that analyzing the relationship between researchers in the academic and research fields. Especially, the network by joint research or citation between researchers is useful to evaluating projects or making policy on academic and research fields. This paper describes a method that generates two kinds of researcher networks showing co-authorship and citation relationship between researchers based on national R&D reference information ontology. We infer pair of researchers in co-authorship or citation relationship by SPARQL query from the ontology which is composed of research outcomes and their participating researchers in RDF triples. By postprocessing, we construct researcher network which links researchers in co-authorship and citation relationship.