• Journal of Digital Contents Society
• /
• v.17 no.1
• /
• pp.11-21
• /
• 2016

To provide more efficient and exact search result, internet systems will rely more and more on semantic web. Ontology is one of the important methods for implementation of semantic web. Ontology is used to implement an explicit formal vocabularies to share. However, important problems rise when dealing with ontology. Ontologies are typically subject to change because they are living. In order to handle ontology data change situation, a version handling system is needed to keep track of changes. For example, the queries subject to the previous ontology may become inconsistent and must be updated according to the newest version of ontology. Although many research was done in this area, there are still many problems to overcome. In this paper, we propose class and property transition graph for query transformation. The graph is created when ontology data is changed and applied to query transformation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.41-50
• /
• 2004

Since the MPEG-4 visual standard enables content-based functionalities, it is necessary to extract video objects from video sequences. Segmentation algorithms can largely be classified into two different categories: automatic segmentation and user-assisted segmentation. In this paper, we propose a new user-assisted image segmentation method based on the active contour. If we define a shape space as a set of all possible variations from the initial curve and we assume that the shape space is linear, it can be decomposed into the column space and the left null space of the shape matrix. In the proposed method, the shape space vector in the column space describes changes from the initial curve to the imaginary feature curve, and a dynamic graph search algorithm describes the detailed shape of the object in the left null space. Since we employ the shape matrix and the SUSAN operator to outline object boundaries, the proposed algorithm can ignore unwanted feature points generated by low-level image processing operations and is, therefore, applicable to images of complex background. We can also compensate for limitations of the shape matrix with a dynamic graph search algorithm.

• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.85-102
• /
• 2010

In this paper, we propose a novel method of analyzing video and representing the relationship among characters based on their contexts in the video sequences, namely Character-Net. As a huge amount of video contents is generated even in a single day, the searching and summarizing technologies of the contents have also been issued. Thereby, a number of researches have been proposed related to extracting semantic information of video or scenes. Generally stories of video, such as TV serial or commercial movies, are made progress with characters. Accordingly, the relationship between the characters and their contexts should be identified to summarize video. To deal with these issues, we propose Character-Net supporting the extraction of major characters in video. We first identify characters appeared in a group of video shots and subsequently extract the speaker and listeners in the shots. Finally, the characters are represented by a form of a network with graphs presenting the relationship among them. We present empirical experiments to demonstrate Character-Net and evaluate performance of extracting major characters.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.31-41
• /
• 2009

In the Semantic Web, it is possible to provide intelligent information retrieval and automated web services by defining a concept of information resource and representing a semantic relation between resources with meta data and ontology. It is very important to manage semantic data such as ontology and meta data efficiently for implementing essential functions of the Semantic Web. Thus we propose an index structure to support more accurate search results and efficient query processing by considering semantic and structural features of the semantic data. Especially we use a graph data model to express semantic and structural features of the semantic data and process various type of queries by using graph model based path expressions. In this paper the proposed index aims to distinguish our approach from earlier studies and involve the concept of the Semantic Web in its entirety by querying on primarily extracted structural path information and secondary extracted one through semantic inferences with ontology. In the experiments, we show that our approach is more accurate and efficient than the previous approaches and can be applicable to various applications in the Semantic Web.

• Journal of the Korean Society for information Management
• /
• v.21 no.3
• /
• pp.1-14
• /
• 2004

Visualization of documents will help users when they do search similar documents. and all research in information retrieval addresses itself to the problem of a user with an information need facing a data source containing an acceptable solution to that need. In various contexts. adequate solutions to this problem have included alphabetized cubbyholes housing papyrus rolls. microfilm registers. card catalogs and inverted files coded onto discs. Many information retrieval systems rely on the use of a document surrogate. Though they might be surprise to discover it. nearly every information seeker uses an array of document surrogates. Summaries. tables of contents. abstracts. reviews, and MARC recordsthese are all document surrogates. That is, they stand infor a document allowing a user to make some decision regarding it. whether to retrieve a book from the stacks, whether to read an entire article, etc. In this paper another type of document surrogate is investigated using a grouping method of term list. lising Multidimensional Scaling Method (MDS) those surrogates are visualized on two-dimensional graph. The distances between dots on the two-dimensional graph can be represented as the similarity of the documents. More close the distance. more similar the documents.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.40 no.5
• /
• pp.429-437
• /
• 2022

Recently, the demand for a QA (Question Answering) system for human-machine communication has increased. Among the QA systems, a closed domain QA system that can handle spatial-related questions is called GeoQA. In this study, a new type of graph database, LPG (Labeled Property Graph) was used to overcome the limitations of the RDF (Resource Description Framework) based database, which was mainly used in the GeoQA field. In addition, GraphQL (Graph Query Language), an API-type query language, is introduced to address the fact that the LPG query language is not standardized and the GeoQA system may depend on specific products. In this study, database was built so that answers could be retrieved when spatial-related questions were entered. Each data was obtained from the national spatial information portal and local data open service. The spatial relationships between each spatial objects were calculated in advance and stored in edge form. The user's questions were first converted to GraphQL through FOL (First Order Logic) format and delivered to the database through the GraphQL server. The LPG used in the experiment is Neo4j, the graph database that currently has the highest market share, and some of the built-in functions and QGIS were used for spatial calculations. As a result of building the system, it was confirmed that the user's question could be transformed, processed through the Apollo GraphQL server, and an appropriate answer could be obtained from the database.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.316-318
• /
• 2005

무선 ad-hoc 네트워크는 중앙 집중화된 관리 시스템이나 지원 서비스 없이 동적으로 임시 네트워크를 구성하는 이동 호스트(MH)들의 집합이다. 이러한 네트워크는 백본 호스트나 다른 MH로의 연결을 제공하기 위한 고정된 제어장치를 갖지 않으며, 각 MH가 라우터로 동작하며 전달받은 패킷을 다른 MH로 전달한다. 이러한 무선 ad-hoc 네트워크에서 단순히 최선의 서비스만을 제공하던 기존의 방법과 달리, 많은 사용자가 요구하는 QoS 서비스를 지원하기 위하여 기존 네트워크를 효율적으로 최대 활용하는 방안에 대한 연구가 활발히 진행되고 있다. 본 논문에서는 무선 ad-hoc 네트워크 내에서 QoS 서비스를 제공하기 위한 기법으로 각각의 이동 호스트들은 QoS DAG 그래프를 유지하며 이러한 그래프를 바탕으로 만들어진 QoS 정보 패킷을 이웃 이동 호스트들에게 지역 브로드캐스트 함으로써 전역적인 QoS 정보의 검색과 운용없이, 유용한 QoS 정보를 전역적으로 각 이동 호스트가 유지할 수 있고 이를 바탕으로 효율적인 QoS 라우팅이 수행되어지는 기법이다.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2435-2446
• /
• 1998

In this paper. We describe a dataflow model for efficient execution of a functional logic language and a method of translation a functional logic language into a dataflow graph. To explore parallelism and intelligent backtracking, we us model in which clause and function are represented as independent dataflow graph. The node denotes basic actions to be performed when the clause and function are executed. The dataflow mechanism allows an operation to be executed as soon as all its operands are available. Since the operations can never be executed earlier, a dataflow model is an excellent base for increasing execution speed. We did decrease a delay time with concurrent execution of dependency analysis and subgoal.

• Environmental and Resource Economics Review
• /
• v.15 no.5
• /
• pp.799-826
• /
• 2006

Combining recent advances in causal flows with time series analysis, relationships among eight North American natural gas spot market prices are examined. Results indicate that price discovery tends to occur in excess demand regions and move to excess supply regions. Across North America, the U.S. Midwest region represented by Chicago spot market is the most important market for price discovery. The Ellisburg-Leidy Hub in Pennsylvania is important in price discovery, especially for markets in the eastern two-thirds of the U.S. Malin Hub in Oregon is important for the western markets including the AECO Hub in Alberta, Canada.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.5
• /
• pp.649-656
• /
• 2011

This study is a numerical representative modelling analysis for applying the process that unravels networks between cells in genetics to Network of informatics. Using the probabilistic graphical model, the insight from the data describing biological networks is used for making a probabilistic function. Rather than a complex network of cells, we reconstruct a simple lower-stage model and show a genetic representation level from the genetic based network logic. We made probabilistic graphical models from genetic data and extend them to genetic representation data in the method of network modelling in informatics.