• Annual Conference of KIPS
• /
• 2008.05a
• /
• pp.777-780
• /
• 2008

최근 IP 네트워크를 통한 유무선 통신 기술, 멀티미디어, 그리고 영상 처리 기술의 발전은 IPTV, VoIP와 같은 여러 형태의 서비스를 가능하게 하였다. 이러한 서비스들의 대부분은 실시간 동영상 및 음성 서비스를 바탕으로 하고 있으며 대용량의 대역폭뿐만 아니라 높은 수준의 서비스 품질을 요구한다. 이에 대한 대안으로 QoS 보장 기술에 대한 연구가 활발히 이루어지는 가운데 아직까지 QoS 보장에 따른 실시간 영상 서비스 품질 변화에 대한 테스트 결과가 미흡하다. 본 논문에서는 QoS 보장에 따른 실시간 영상 서비스의 품질을 사용자 입장에서 객관적 화질 측정방법인 PSNR을 이용하여 측정하고 평가한다. 또한, 현재의 기반망인 IPv4망과 차세대 인터넷 프로토콜인 IPv6망을 고려하여 현실적으로 가장 높은 품질의 서비스를 제공할 수 있는 IP망의 QoS 보장을 제안하고자 한다.

• Annual Conference of KIPS
• /
• 2007.05a
• /
• pp.6-9
• /
• 2007

최근 e-비즈니스나 인터넷 쇼핑몰 사이트에서는 많은 양의 상품 이미지 정보와 컨텐츠를 취급하고 있으며, 이로 인하여 효과적인 실시간 의미정보 검색의 필요성이 대두되고 있다. 본 논문에서는 XML 기술과 퍼지기술을 이용하여 웹상의 상품 정보를 의미적으로 검색할 수 있는 시스템에 대해 기술한다. 본 논문에서 제시한 시스템은 상품 이미지 XML 문서를 이용하여 메타데이타를 추출하고, 추출된 메타데이타를 의미정보로 자동 변환하여 실시간 서비스할 수 있는 방법을 제안한다. 따라서, 인터넷 비즈니스를 좀 더 지능화 할 수 있는 시맨틱 웹 환경이나 Web2.0 을 구현하는데 기여할 수 있을 것이라 기대한다. 또한 사용자의 입장에서는 실시간 의미정보를 서비스 받을 수 있는 장점을 가지게 될 것이다.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.129-143
• /
• 2012

Recently, the rapid progress of a number of standardized web technologies and the proliferation of web users in the world bring an explosive increase of producing and consuming information documents on the web. In addition, most companies have produced, shared, and managed a huge number of information documents that are needed to perform their businesses. They also have discretionally raked, stored and managed a number of web documents published on the web for their business. Along with this increase of information documents that should be managed in the companies, the need of a solution to locate information documents more accurately among a huge number of information sources have increased. In order to satisfy the need of accurate search, the market size of search engine solution market is becoming increasingly expended. The most important functionality among much functionality provided by search engine is to locate accurate information documents from a huge information sources. The major metric to evaluate the accuracy of search engine is relevance that consists of two measures, precision and recall. Precision is thought of as a measure of exactness, that is, what percentage of information considered as true answer are actually such, whereas recall is a measure of completeness, that is, what percentage of true answer are retrieved as such. These two measures can be used differently according to the applied domain. If we need to exhaustively search information such as patent documents and research papers, it is better to increase the recall. On the other hand, when the amount of information is small scale, it is better to increase precision. Most of existing web search engines typically uses a keyword search method that returns web documents including keywords which correspond to search words entered by a user. This method has a virtue of locating all web documents quickly, even though many search words are inputted. However, this method has a fundamental imitation of not considering search intention of a user, thereby retrieving irrelevant results as well as relevant ones. Thus, it takes additional time and effort to set relevant ones out from all results returned by a search engine. That is, keyword search method can increase recall, while it is difficult to locate web documents which a user actually want to find because it does not provide a means of understanding the intention of a user and reflecting it to a progress of searching information. Thus, this research suggests a new method of combining ontology-based search solution with core search functionalities provided by existing search engine solutions. The method enables a search engine to provide optimal search results by inferenceing the search intention of a user. To that end, we build an ontology which contains concepts and relationships among them in a specific domain. The ontology is used to inference synonyms of a set of search keywords inputted by a user, thereby making the search intention of the user reflected into the progress of searching information more actively compared to existing search engines. Based on the proposed method we implement a prototype search system and test the system in the patent domain where we experiment on searching relevant documents associated with a patent. The experiment shows that our system increases the both recall and precision in accuracy and augments the search productivity by using improved user interface that enables a user to interact with our search system effectively. In the future research, we will study a means of validating the better performance of our prototype system by comparing other search engine solution and will extend the applied domain into other domains for searching information such as portal.

• Journal of Digital Contents Society
• /
• v.13 no.1
• /
• pp.43-52
• /
• 2012

For accurate search on information resources, it is needed to manage gradual changes in ontology efficiently. Recently, because ontology is often written using OWL, techniques that can manage changes in OWL documents are required. To meet these needs, in this paper, we classify changeable elements to detect changes in OWL ontology and propose a storage schema that can manage the changes according to the characteristics of each element. And we suggest the possibility of improving performance of query processing using views that provide information about classes or properties in each ontology version. The proposed storage schema stores changes in metadata associated with each ontology version. In addition, it can manage metadata that must be added or deleted through reasoning when ontology changes. So, the proposed storage schema can support queries about history of changes in ontology and provide accurate and valid metadata that is suitable for user-selected ontology version.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.12
• /
• pp.849-854
• /
• 2013

In this paper, a system technology-based algorithms and visualization is proposed to show a space data. Also the proposed system provides analysis function with combination of usual map and automatic document generation function to give a useful information for making an important decision based on spatial distributed data. In the proposed method, we employ the heat map analysis to present a suitable color distribution for 2 dimensional map data. The buffering analysis method is also used to define the spatial data access. By using the proposed system, spatial information in a variety of distribution will be easy to identify. Also, if we make a use of automatic document generation function in the proposed algorithm, a lot of time and cost savings are expected to make electronic document which representation of spatial information is required.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.1-15
• /
• 2007

Recently, semantic web technology, represented by ontology building, is being combined with web services technology, creating 'Semantic Web Services' as a new promising field in information retrieval research. Accordingly, many brokering and matchmaking agents are being developed and used in the field. However, literature review revealed that most models do not take QoS(Quality of Services) into consideration. In this study, a QoS-augmented matchmaking algorithm is developed based on service availability, response time, maximum transaction amount, reliability, accessibility and price as critical QoS items. A prototype for Intelligent Semantic Web Services System is developed using publicly available data. Performance test was conducted and reported at the end.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1697-1706
• /
• 1996

This paper presents the design and the implementation of a MissCW(Multi user Interactive System for Synchronous Collaborative Writing). The document model DMDA(Distributed Multimedia Document Architecture) of MissCW consists of the logical structure, presentation style object, and mark object. The windows. The collaborative editor of this system proposes a structure oriented editing mechanism to combine distrbuted objects into one document. The middleware SOM(Shared Object Manager) maintains shared objects consistently and helps application programs use objects efficiently. The infrastructure of this system is a hybrid structure of replicated and centralized architectures, that is to maintain shared objects consistently inside of SOM and to reduce the overhead of network traffic. The central part is a virtual node which corresponds to the Object Controller of SOMwith the SOT(Shared Objet Table).

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.66-74
• /
• 2004

To get changing data or retrieved information in a web service environment, we need the CGI method in which we designate an executable file and receive the output of the executable file as a document. But the original CGI method has some performance pitfalls caused by the native condition that a process for the requested executable file should be created every time it is requested. Several approaches that make the process as a daemon wholly or partly have been made to solve those problems and they have exclusive strength and weakness. So, many developers are confused when they have to choose which of the CGI methods. We proposed an efficient CGI gateway design called SendFD that the main part of CGI gateway was separated as a daemon and taken over the communication channel by the other small part forked whenever it was requested. Then we testified the efficiency of SendFD styled CGI gateway in real web service environment and it showed about 3% performance improvement compared to the conventional socket pipe method.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.390-398
• /
• 2015

Spatial web objects refer to web documents that contain geographic information. Recently, services that create spatial web objects have increased greatly because of the advancements in devices such as smartphones. For services such as Twitter or Facebook, simple texts posted by users is stored along with information about the post's location. To search for such spatial web objects, a method that uses spatial information and text information simultaneously is required. Conventional spatial web object search methods mostly use R-tree and inverted file methods. However, these methods have a disadvantage of requiring a large volume of space when building indices. Furthermore, such methods are efficient for searching with many keywords but are inefficient for searching with a few keywords.. In this paper, we propose a spatial web object search method that uses a quad-tree and a patricia-trie. We show that the proposed technique is more effective than existing ones in searching with a small number of keywords. Furthermore, we show through an experiment that the space required by the proposed technique is much smaller than that required by existing ones.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.100-104
• /
• 2010

In the past decade, various search engines have been developed to retrieve web pages that web surfers want to find from world wide web. In search engines, one of the most important functions is to evaluate and rank web pages for a given web surfer query. The prior algorithms using hyperlink information like PageRank incur the problem of 'topic drift'. To solve the problem, relevance propagation models have been proposed. However, these models suffer from serious performance degradation, and thus cannot be employed in real search engines. In this paper, we propose a new ranking algorithm that alleviates the topic drift problem and also provides efficient performance. Through a variety of experiments, we verify the superiority of the proposed algorithm over prior ones.