• Journal of the Society of Naval Architects of Korea
• /
• v.30 no.2
• /
• pp.30-36
• /
• 1993

An expert system to help a novice engineer in designing midship section is developed. The system is developed based on a general-purpose expert system shell, NEXPERT. Firstly, the design knowledge is extracted from an existing rule scantling program. The knowledge has been grouped and structured into a hierarchy by applying object-oriented concepts. Secondly, the knowledge base is integrated with a database of existing ships and engineering analysis modules through the Application Programming Interface(API)technique. Graphical User Interface which is developed using Motif wiget set is adopted. These altogether enable construction of an user friendly expert system.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.25 no.5
• /
• pp.765-772
• /
• 2011

Knowledge which is represented by formal logic are widely used in many domains such like artificial intelligence, information retrieval, e-commerce and so on. And for medical field, medical documentary records retrieval, information systems in hospitals, medical data sharing, remote treatment and expert systems need knowledge representation technology. To retrieve information intellectually and provide advanced information services, systematically controlled mechanism is needed to represent and share knowledge. Importantly, medical expert's knowledge should be represented in a form that is understandable to computers and also to humans to be applied to the medical information system supporting decision making. And it should have a suitable and efficient structure for its own purposes including reasoning, extendability of knowledge, management of data, accuracy of expressions, diversity, and so on. we call it ontology which can be processed with machines. We can use the ontology to represent traditional medicine knowledge in structured and systematic way with visualization, then also it can also be used education materials. Hence, the authors developed an Shanghanlun ontology by way of showing an example, so that we suggested a methodology for ontology development and also a model to structure the traditional medical knowledge. And this result can be used for student to learn Shanghanlun by graphical representation of it's knowledge. We analyzed the text of Shanghanlun to construct relational database including it's original text, symptoms and herb formulars. And then we classified the terms following some criterion, confirmed the structure of the ontology to describe semantic relations between the terms, especially we developed the ontology considering visual representation. The ontology developed in this study provides database showing fomulas, herbs, symptoms, the name of diseases and the text written in Shanghanlun. It's easy to retrieve contents by their semantic relations so that it is convenient to search knowledge of Shanghanlun and to learn it. It can display the related concepts by searching terms and provides expanded information with a simple click. It has some limitations such as standardization problems, short coverage of pattern(證), and error in chinese characters input. But we believe this research can be used for basic foundation to make traditional medicine more structural and systematic, to develop application softwares, and also to applied it in Shanghanlun educations.

• 한국디지털정책학회:학술대회논문집
• /
• 2004.11a
• /
• pp.111-127
• /
• 2004

In this paper we describe an application of the lexical resource JurWordNet and of the Core Legal Ontology as a descriptive vocabulary for modeling legal domains. It can be viewed as the semantic component of a global standardisation framework for digital governments. A content description model provides a repository of structured knowledge aimed at supporting the semantic interoperability between sectors of Public Administration and the communication processes towards citizen. Specific conceptual models built from this base will act as a cognitive interface able to cope with specific digital government issues and to improve the interaction between citizen and Public Bodies. As a Case study, the representation of the click-on licences for re-using Public Sector Information is presented.

• Asian review of World Histories
• /
• v.4 no.1
• /
• pp.35-81
• /
• 2016

The objective of this essay is to propose a cultural history of cosmography and cartography from the thirteenth to the sixteenth centuries. It focuses on some of the processes that characterized these fields of knowledge, using mainly western European sources. First, it elucidates the meaning that the term cosmography held during the period under consideration, and the scientific status that this composite field of knowledge enjoyed, pointing to the main processes that structured cosmography between the thirteenth century and the sixteenth century. I then move on to expound the circulation of cosmographic knowledge among Portugal, Venice and Lisbon in the fourteenth and fifteenth centuries. This analysis will show how cartography and cosmography were produced at the interface of articulated commercial, diplomatic and scholarly networks; finally, the last part of the essay focuses on the specific and quite distinctive use of cosmography in fifteenth-century European culture: the representation of "geo-political" projects on the world through the reformulation of the very concepts of sea and maritime networks. This last topic will be developed through the study of Fra Mauro's mid-fifteenth-century visionary project about changing the world connectivity through the linking of several maritime and fluvial networks in the Indian Ocean, Central Asia, and the Mediterranean Sea basin, involving the circumnavigation of Africa. This unprecedented project was based on a variety of sources accumulated in the Mediterranean Sea basin as well as in Asia and in the Indian Ocean over the course of several centuries.

• Journal of Digital Convergence
• /
• v.11 no.3
• /
• pp.285-292
• /
• 2013

The method of recent information retrieval passes into an semantic search to provide more accurate results than keyword-based search. But in common user case, they are still accustomed to using existing keyword-based search. Hence they are hard to create a typed structured query language. In this paper, we propose to ontology knowledge-base scheme for query interpretation of these user. The proposed scheme was designed based on the OWL-DL for description logic reasoning, it can provide a richer representation of the relationship between the object by using SWRL(Semantic Web Rule Language). Finally, we are describe the experimental results of the similarity measurement for verification of a user query semantic interpretation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.276-283
• /
• 2007

It has been shown that the structure identification of a neuro-fuzzy model improves their accuracy performances in a various modeling problems. In this paper, we claim that the structure identification of a neuro-fuzzy model can also reduce the degree of inconsistency of its fuzzy rulebase. Thus, the resulting neuro-fuzzy model serves as more like a structured knowledge representation scheme. For this, we briefly review a structure identification method of a neuro-fuzzy model and propose a systematic method to measure inconsistency of a fuzzy rulebase. The proposed method is applied to problems or fuzzy system reproduction and nonlinear system modeling in order to validate our claim.

• MALSORI
• /
• no.47
• /
• pp.109-120
• /
• 2003

This paper presents about the activities of speech database standardization in ETRI. Recently, with the support of government, ETRI and SiTEC have been gathering the large speech corpus for the domestic speech related companies. First, due to the lack of sharing the knowledge of speech database specification, the distributed speech database has a different format. Hence it seems to be needed to have the same format as soon as possible. ETRI and SiTEC are trying to find the better representation format of speech database. Second, we introduce a new description method of the annotation information of speech database. As one of the structured description method, XML based description will be applied to represent the metadata of the speech database. It will be continuously revised through the speech technology standard forum during this year.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.986-1016
• /
• 2019

Mobile user interface pattern (MUIP) is a kind of structured representation of interaction design knowledge. Several studies have suggested that MUIPs are a proven solution for recurring mobile interface design problems. To facilitate MUIP selection, an effective clustering method is required to discover hidden knowledge of pattern data set. In this paper, we employ the semi-supervised kernel fuzzy c-means clustering (SSKFCM) method to cluster MUIP data. In order to improve the performance of clustering, clustering parameters are optimized by utilizing the global optimization capability of particle swarm optimization (PSO) algorithm. Since the PSO algorithm is easily trapped in local optima, a novel PSO algorithm is presented in this paper. It combines an improved intuitionistic fuzzy entropy measure and a new population search strategy to enhance the population search capability and accelerate the convergence speed. Experimental results show the effectiveness and superiority of the proposed clustering method.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.8
• /
• pp.9-21
• /
• 2020

With the proliferation of RDF knowledge graphs(KGs), there arose a need of a standardized schema representation of the graph model for effective data interchangeability and interoperability. The need resulted in the development of SHACL specification to describe and validate RDF graph's structure by W3C. Relational databases(RDBs) are one of major sources for acquiring structured knowledge. The standard for automatic generation of RDF KGs from RDBs is R2RML, which is also developed by W3C. Since R2RML is designed to generate only RDF data graphs from RDBs, additional manual tasks are required to create the schemas for the graphs. In this paper we propose an approach to automatically generate SHACL schemas for RDF KGs populated by R2RML mappings. The key of our approach is that the SHACL shemas are built only from R2RML documents. We describe an implementation of our appraoch. Then, we show the validity of our approach with R2RML test cases designed by W3C.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.