• Annual Conference of KIPS
• /
• 2001.04b
• /
• pp.941-944
• /
• 2001

최근 하드웨어와 압축기술의 발달 및 보편화로 인해 사용자들의 비디오 데이터에 대한 요구가 증가하였다. 비디오 데이터는 비정형, 대용량의 특징을 가지고 있으므로 사용자의 다양한 요구를 만족시키기 위해서는 단순한 텍스트 형식의 데이터가 아닌 비디오 데이터에 대한 다양한 검색기법이 요구된다. 효율적인 비디오의 검색을 위해서는 사용자의 불완전한 질의에도 근사한 질의결과의 제시가 필요하다. 본 논문에서는 비디오데이터에 대한 효율적인 의미검색을 위해 주석기반과 특징기반을 혼합한 내용기반 검색을 지원하며 특히 사용자의 불완전한 질의에도 근접한 질의결과를 제시할 수 있는 지능적인 비디오 검색 시스템을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1680-1691
• /
• 1994

We propose an extended hypertext data model based on object oriented paradigm that can easily the real world and semantics. We use the BNF notation to formalize the model. In our model, We introduce conceptional navigation by associating semantics on links and drive intelligent navigation using weights on links to alleviate user disorientation problem which is currently somewhat vague. We functionally classify the hypertext node into three types:Indexing node, Content node, Extract node and likewise classify the link into Alink type, Rlink type, Slink type. We believe that the typed node and typed link approach accommodate efficient query/search in hypertext.

• Annual Conference of KIPS
• /
• 2003.05a
• /
• pp.505-508
• /
• 2003

웹 문서의 홍수 속에서 사용자의 요구에 맞는 문서만을 검색해 주는 정보 검색 시스템이 요구되고 있다. 자연어 질의를 이용한 정보검색 방법은 초보자도 사용이 쉽고 사용자의 의도를 파악하기가 쉬어 지능형 정보검색에 적합하다. 따라서 현재는 자연어 질의로부터 사용자의 의도를 파악하기 위한 다양한 연구가 진행되고 있다. 본 논문에서는 구조화된 자연어 질의에서 한국어의 문맥 구조를 기반으로 하여 사용자의 의도를 파악하고 이를 이용하여 정보검색 질의를 생성하는 방법을 제안한다. 이렇게 생성된 질의어를 이용해서 메타정보검색을 하면 보다 정확하고 사용자의 의도에 맞는 문서만이 검색되었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.640-642
• /
• 2005

본 논문에서는 온톨로지 기반의 질의-응답을 위한 지능형 웹서비스에 관해 기술하고자 한다. 이 웹서비스는 질의 에이전트와 응답 에이전트 간의 OWL-QL 메시지 교환에 의해서 이루어진다. OWL-QL은 OWL 언어로 표현된 지식베이스를 이용하는 시맨틱 웹 에이전트들 간의 질의-응답 처리를 위한 정형화된 언어이며, 프로토콜이다. OWL-QL에서 응답 에이전트는 질의 에이전트로부터 주어진 질의에 대한 응답처리를 위해 자동화된 추론을 전개한다. 본 논문에서는 시스템을 구성하는 각 에이전트들의 기능과 구조에 관해 설명하고, 질의 에이전트 내에 포함된 그래픽 기반의 OWL-QL 질의 작성기의 유용성에 관해 설명한다.

• Journal of the Korean Society for information Management
• /
• v.29 no.4
• /
• pp.123-142
• /
• 2012

To develop an intelligent search engine to help users retrieve information effectively, various methods, such as Semantic Web, have been used, An effective retrieval method of such methods uses ontology technology. In this paper, we built National R&D ontology after analyzing National R&D Information in NTIS and then implemented National R&D Knowledge Map to represent and retrieve information of the relationship between object and subject (project, human information, organization, research result) in R&D Ontology. In the National R&D Knowledge Map, center-node is the object selected by users, node is subject, subject's sub-node is user's favorite query in National R&D ontology after analyzing the relationship between object and subject. When a user selects sub-node, the system displays the results from inference engine after making query by SPARQL in National R&D ontology.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.272-277
• /
• 2001

In this paper, we describe a new method for selecting information sources in a distributed environment. Recently, there has been much research on distributed information retrieval, that is information retrieval (IR) based on a multi-database model in which the existence of multiple sources is modeled explicitly. In distributed IR, a method is needed that would enable selecting appropriate sources for users\` queries. Most existing methods use statistical data such as document frequency. These methods may select inappropriate ate sources if a query contains polysemous words. In this paper, we describe an information-source selection method using two types of thesaurus. One is a thesaurus automatically constructed from documents in a source. The other is a hand-crafted general-purpose thesaurus(e.g. WordNet). Terms used in documents in a source differ from one another and the meanings of a term differ depending on th situation in which the term is used. The difference is a characteristic of the source. In our method, the meanings of a term are distinguished between by the relationship between the term and other terms, and the relationship appear in the co-occurrence-based thesaurus. In this paper, we describe an algorithm for evaluating a usefulness of a source for a query based on a thesaurus. For a practical application of our method, we have developed Papits, a multi-agent-based in formation sharing system. An experiment of selection shows that our method is effective for selecting appropriate sources.

• Convergence Security Journal
• /
• v.14 no.4
• /
• pp.27-32
• /
• 2014

Utilization of web application has been widely spread and complication in recent years by the rapid development of network technologies and changes in the computing environment. The attack being target of this is increasing and the means is diverse and intelligent while these web applications are using to a lot of important services. In this paper, we proposed security model using virtualization technology to prevent attacks using vulnerabilities of web application. The request information for query in a database server also can be recognized by conveying to the virtual web server after ID is given to created session by the client request and the type of the query is analyzed in this request. VM-Master module is constructed in order to monitor traffic between the virtual web servers and prevent the waste of resources of Host OS. The performance of attack detection and resource utilization of the proposed method is experimentally confirmed.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1026-1033
• /
• 2016

Path-finding on a grid map is a problem generally addressed in the fields of robotics, intelligent agents, and computer games. As technology advances, virtual game worlds tend to be represented more accurately and more realistically, resulting in an excessive increase in the number of grid tiles and in path-search time. In this study, we propose a path-finding algorithm that allows a prompt response to real-time queries by constructing a reduced state space and by precomputing all possible paths in an offline preprocessing stage. In the preprocessing stage, we vertically decompose free space on the grid map, construct a connectivity graph where nodes are the decomposed regions, and store paths between all pairs of nodes in matrix form. In the real-time query stage, we first find the nodes containing the query points and then retrieve the corresponding stored path. The proposed method is simulated for a set of maps that has been used as a benchmark for grid-based path finding. The simulation results show that the state space and the search time decrease significantly.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.1278-1282
• /
• 2009

In apartment type of housing, if resident's vehicle is registered in central control office and RFID TAG is issued, identification can be recognized from the time of entrance into parking lot and intelligent parking guide system can be activated based on the residents' profile. Parking Guide System leads a vehicle to the available parking space which is closest to the entrance gate of the vehicle's owner. And when residents forget where they parked their cars, they can query to the Parking Guide and Management System and get responses about the location. For the correct operation of this system, it is necessary to find out where the residents' cars have parked in real time and which lot is available for parking of other cars. RFID is very fancy solution for this system. RFID reader gathers the ID information in RFID TAGs in parked cars and updates the DB up to date. But, when non-residents' cars are parked inside apartment, RFID reader cannot identify them nor know the exact empty/occupied status of parking spaces because they don't react to RFID reader's query. So for the exact detection of empty/occupied status, we suggest the combined use of ultrasonic sensors and RFID. We designed a tree topology with intermediate data aggregators. The depth of tree is normally more than 3 from root (central office) to leaves (individual parking lots). The depth of 2 in tree topology brings about the bottleneck in communication and maintenance. We also designed the information fields used in RFID networks and Sensor Networks.

• 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.