• Title/Summary/Keyword: Semantic class

Search Result 153, Processing Time 0.029 seconds

An SML Compiler Generator Using Attribute Grammar and XMLSchema (속성 문법과 XMLSchema를 이용한 XML 컴파일러 생성기)

  • Choi Jong-Myung;Park Ho-Byung
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.9
    • /
    • pp.810-821
    • /
    • 2006
  • As XML is widely used across the computer related fields, and it costs expensive for its compiler, the study on the automatic generation of the compiler is becoming important. In addition, though the XMLSchema became a standard, there have been few works on the automatic compiler generation for XML applications based on the XMLSchema. In this paper, we introduce a method that we can automatically generate a compiler for an XML application based on the XMLSchema. Our XML compiler generator uses data type information in XMLSchema document and semantic information in another file and produces semantic classes and a compiler for the XML application. The compiler parses an XML document, builds a tree in which each node is an instance of semantic class, and processes the document through the traversal of the tree.

Survey on Deep Learning-based Panoptic Segmentation Methods (딥 러닝 기반의 팬옵틱 분할 기법 분석)

  • Kwon, Jung Eun;Cho, Sung In
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.16 no.5
    • /
    • pp.209-214
    • /
    • 2021
  • Panoptic segmentation, which is now widely used in computer vision such as medical image analysis, and autonomous driving, helps understanding an image with holistic view. It identifies each pixel by assigning a unique class ID, and an instance ID. Specifically, it can classify 'thing' from 'stuff', and provide pixel-wise results of semantic prediction and object detection. As a result, it can solve both semantic segmentation and instance segmentation tasks through a unified single model, producing two different contexts for two segmentation tasks. Semantic segmentation task focuses on how to obtain multi-scale features from large receptive field, without losing low-level features. On the other hand, instance segmentation task focuses on how to separate 'thing' from 'stuff' and how to produce the representation of detected objects. With the advances of both segmentation techniques, several panoptic segmentation models have been proposed. Many researchers try to solve discrepancy problems between results of two segmentation branches that can be caused on the boundary of the object. In this survey paper, we will introduce the concept of panoptic segmentation, categorize the existing method into two representative methods and explain how it is operated on two methods: top-down method and bottom-up method. Then, we will analyze the performance of various methods with experimental results.

Food Ontology Model for a Healthcare Service (헬스케어 서비스를 위한 푸드 온톨로지 모델)

  • Lee, Byung Mun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.6
    • /
    • pp.31-40
    • /
    • 2012
  • Ubiquitous technology influences on various firms of contents needed for self-healthcare, as it fuses into medical services. Particularly, rapid changes in the web and mobile environment, requiring various sorts of healthcare and its related contents, make efficiency of search more important. Personalized contents needs to be more refined as well as the existing simple keyword-centered searching method needs to be more effective in order to meet both requirements and characteristics of each patient or each user. A precise semantic searching method is required for a system to understand promptly the meaning of a contents. In this respect, to build a healthcare ontology has its own significance. This study builds up a system model that can be utilized practically in existing systems by setting up the Food Class and its sub-class among the healthcare contents with Protege tool and then materializing constraints and its relationships between each class. The healthcare contents ontology provides patients or users with a platform which can search the needed information promptly and precisely.

The Effect of Word Frequency on Noun Definitions (단어빈도가 명사정의하기에 미치는 효과)

  • Lee, Chan-Jong
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.6
    • /
    • pp.303-308
    • /
    • 2008
  • The purpose of the present study is to investigate that word frequency has significant influence on noun definitions in Korean. The experimental group was 80 students from Elementary school, Middle school, High school and University. They rated familiarity and wrote definitions for nouns. Noun definitions were analyzed with semantic categories such as "use/purpose," "description," "association/relation," "partial explanation," "explanation," "error," "partial explanation-attribute," "partial explanation-specific class," "partial explanation-nonspecific class," "explanation-specific class," "explanation-nonspecific class." As a result, they showed familiarity for high-frequency nouns. "EXPL" categories that use class terms or critical attributes were used more frequently in definitions of high-frequency nouns compared with low-frequency nouns. They increased with age and errors decreased with age. Word frequency had a significant influence on noun definitions.

Improvement of Paillier Probabilistic Plumbic Key Cryptosystem for Efficiency (Paillier의 확률 공개키 암호 방식의 효율적인 개선)

  • 최덕환;조석향;최승복;원동호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8C
    • /
    • pp.756-764
    • /
    • 2003
  • We investigate a probabilistic public key cryptosystem proposed by Paillier. It is based on the discrete logarithmic function and the messages are calculated from the modular product of two those functions, one of which has a fixed value depending on a given public key. The improvement is achieved by a good choice for the public key so that it is possible to get efficient schemes without losing the onewayness and semantic security. Also we suggest the method to get the public key for our schemes.

Development of Ontology for Thai Country Songs

  • Thunyaluk, Jaitiang;Malee, Kabmala;Wirapong, Chansanam
    • Journal of Information Science Theory and Practice
    • /
    • v.11 no.1
    • /
    • pp.79-88
    • /
    • 2023
  • This study aimed to develop an ontology for Thai country songs by using the seven steps of an ontology development process. Hozo-Ontology Editor software and Ontology Application Management Framework were tools used in this study. Nine classes of ontology were identified: song, singer, emotion, author, language used, language type, song style, original, and content, and it was found that the song class had a relationship with all of the other classes. The developed ontology was evaluated by seeking opinions from experts in the field of Thai country songs, who agreed that the ontology was highly effective. Additionally, the evaluation employed the knowledge retrieval concept, and the precision, recall, and overall effectiveness were measured, with a precision of 92.59%, a recall of 86.21%, and an overall effectiveness (F-measure) of 89.28%. These results indicate that the developed ontology is highly effective in describing the scope of knowledge of Thai country songs.

Dynamic Virtual Ontology using Tags with Semantic Relationship on Social-web to Support Effective Search (효율적 자원 탐색을 위한 소셜 웹 태그들을 이용한 동적 가상 온톨로지 생성 연구)

  • Lee, Hyun Jung;Sohn, Mye
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.19-33
    • /
    • 2013
  • In this research, a proposed Dynamic Virtual Ontology using Tags (DyVOT) supports dynamic search of resources depending on user's requirements using tags from social web driven resources. It is general that the tags are defined by annotations of a series of described words by social users who usually tags social information resources such as web-page, images, u-tube, videos, etc. Therefore, tags are characterized and mirrored by information resources. Therefore, it is possible for tags as meta-data to match into some resources. Consequently, we can extract semantic relationships between tags owing to the dependency of relationships between tags as representatives of resources. However, to do this, there is limitation because there are allophonic synonym and homonym among tags that are usually marked by a series of words. Thus, research related to folksonomies using tags have been applied to classification of words by semantic-based allophonic synonym. In addition, some research are focusing on clustering and/or classification of resources by semantic-based relationships among tags. In spite of, there also is limitation of these research because these are focusing on semantic-based hyper/hypo relationships or clustering among tags without consideration of conceptual associative relationships between classified or clustered groups. It makes difficulty to effective searching resources depending on user requirements. In this research, the proposed DyVOT uses tags and constructs ontologyfor effective search. We assumed that tags are extracted from user requirements, which are used to construct multi sub-ontology as combinations of tags that are composed of a part of the tags or all. In addition, the proposed DyVOT constructs ontology which is based on hierarchical and associative relationships among tags for effective search of a solution. The ontology is composed of static- and dynamic-ontology. The static-ontology defines semantic-based hierarchical hyper/hypo relationships among tags as in (http://semanticcloud.sandra-siegel.de/) with a tree structure. From the static-ontology, the DyVOT extracts multi sub-ontology using multi sub-tag which are constructed by parts of tags. Finally, sub-ontology are constructed by hierarchy paths which contain the sub-tag. To create dynamic-ontology by the proposed DyVOT, it is necessary to define associative relationships among multi sub-ontology that are extracted from hierarchical relationships of static-ontology. The associative relationship is defined by shared resources between tags which are linked by multi sub-ontology. The association is measured by the degree of shared resources that are allocated into the tags of sub-ontology. If the value of association is larger than threshold value, then associative relationship among tags is newly created. The associative relationships are used to merge and construct new hierarchy the multi sub-ontology. To construct dynamic-ontology, it is essential to defined new class which is linked by two more sub-ontology, which is generated by merged tags which are highly associative by proving using shared resources. Thereby, the class is applied to generate new hierarchy with extracted multi sub-ontology to create a dynamic-ontology. The new class is settle down on the ontology. So, the newly created class needs to be belong to the dynamic-ontology. So, the class used to new hyper/hypo hierarchy relationship between the class and tags which are linked to multi sub-ontology. At last, DyVOT is developed by newly defined associative relationships which are extracted from hierarchical relationships among tags. Resources are matched into the DyVOT which narrows down search boundary and shrinks the search paths. Finally, we can create the DyVOT using the newly defined associative relationships. While static data catalog (Dean and Ghemawat, 2004; 2008) statically searches resources depending on user requirements, the proposed DyVOT dynamically searches resources using multi sub-ontology by parallel processing. In this light, the DyVOT supports improvement of correctness and agility of search and decreasing of search effort by reduction of search path.

Pipelining Semantically-operated Services Using Ontology-based User Constraints (온톨로지 기반 사용자 제시 조건을 이용한 시맨틱 서비스 조합)

  • Jung, Han-Min;Lee, Mi-Kyoung;You, Beom-Jong
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.10
    • /
    • pp.32-39
    • /
    • 2009
  • Semantically-operated services, which is different from Web services or semantic Web services with semantic markup, can be defined as the services providing search function or reasoning function using ontologies. It performs a pre-defined task by exploiting URI, ontology classes, and ontology properties. This study introduces a method for pipelining semantically-operated services based on a semantic broker which refers to ontologies and service description stored in a service manager and invokes by user constraints. The constraints consist of input instances, an output class, a visualization type, service names, and properties. This method provides automatically-generated service pipelines including composit services and a simple workflow to the user. The pipelines provided by the semantic broker can be executed in a fully-automatic manner to find a set of meaningful semantic pipelines. After all, this study would epochally contribute to develop a portal service by ways of supporting human service planners who want to find specific composit services pipelined from distributed semantically-operated services.

Keyword Search and Ranking Methods on Semantic Web Documents (시맨틱 웹 문서에 대한 키워드 검색 및 랭킹 기법)

  • Kim, Youn-Hee;Oh, Sung-Kyun
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.86-93
    • /
    • 2012
  • In this paper, we propose keyword search and ranking methods for OWL documents that describe metadata and ontology on the Semantic Web. The proposed keyword search method defines a unit of keyword search result as an information resource and expands a scope of query keyword to names of class and property or literal data. And we reflected derived information by inference in the keyword search by considering the elements of OWL documents such as hierarchical relationship of classes or properties and equal relationship of classes. In addition, our method can search a large number of information resources that are relevant to query keywords because of information resources indirectly associated with query keywords through semantic relationship. Our ranking method can improve user's search satisfaction because of involving a variety of factors in the ranking by considering the characteristics of OWL. The proposed methods can be used to retrieve digital contents, such as broadcast programs.

Alleviating Semantic Term Mismatches in Korean Information Retrieval (한국어 정보 검색에서 의미적 용어 불일치 완화 방안)

  • Yun, Bo-Hyun;Park, Sung-Jin;Kang, Hyun-Kyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3874-3884
    • /
    • 2000
  • An information retrieval system has to retrieve all and only documents which are relevant to a user query, even if index terms and query terms are not matched exactly. However, term mismatches between index terms and qucry terms have been a serious obstacle to the enhancement of retrieval performance. In this paper, we discuss automatic term normalization between words in text corpora and their application to a Korean information retrieval system. We perform two types of term normalizations to alleviate semantic term mismatches: equivalence class and co-occurrence cluster. First, transliterations, spelling errors, and synonyms are normalized into equivalence classes bv using contextual similarity. Second, context-based terms are normalized by using a combination of mutual information and word context to establish word similarities. Next, unsupervised clustering is done by using K-means algorithm and co-occurrence clusters are identified. In this paper, these normalized term products are used in the query expansion to alleviate semantic tem1 mismatches. In other words, we utilize two kinds of tcrm normalizations, equivalence class and co-occurrence cluster, to expand user's queries with new tcrms, in an attempt to make user's queries more comprehensive (adding transliterations) or more specific (adding spc'Cializationsl. For query expansion, we employ two complementary methods: term suggestion and term relevance feedback. The experimental results show that our proposed system can alleviatl' semantic term mismatches and can also provide the appropriate similarity measurements. As a result, we know that our system can improve the rctrieval efficiency of the information retrieval system.

  • PDF