Search

This study concerns the constructing of domain ontology from web tables in a specific domain. Ontology defines the common terms and their meaning (concepts) within a context. Thus only meaningful tables are our concern. The meaningful table is composed of a head and a body, which are formatted in rows and columns. The head abstracts the meaning expressed in the body. Thus, in order to obtain a table-information-extraction framework, this study extracts, as prerequisite work, the structural semantic, that is, the domain ontology that frames web-table information, from the head. We suggest a method for automatically extracting domain ontology using the structural and semantic characteristics of the web-table head. The construction of domain ontology proceeds through two steps: (a) extracting table schema as pseudo-ontology from each table from the same domain and (b) constructing domain ontology combining those extracted table schemata. The combination of schemata proceeds through splitting and clustering using (a) statistical information and (b) heuristics based on the structural and semantic characteristics of the web-table head. [ABSTRACT FROM AUTHOR]

With the development in IT technology and with the growing demands of users, a ubiquitous environment is being made. Ubiquitous stands for a convenient environment in which users can get information and services through networks with devices that can communicate. This ubiquitous environment requires device technology, and Radio Frequency IDentification(RFID) is a good example. RFID, a technology that identifies radio frequency, was developed to substitute bar-codes and has various strengths, such as high recognition rates, quick recognition speed, and large storage. Because of these strengths, it is being used in various fields such as the public, distribution, and financial sectors; but it has a weakness in privacy, as readers operating within the same frequency bandwidth can be easily tagged. By acquiring information from the tag, unauthorized people can assess into the personal information of users. The current study, therefore, provides a secure and effective protection method, which can guarantee anonymity towards users with tags. [ABSTRACT FROM AUTHOR]

The RFID system is a core technology used in building a ubiquitous environment, and is considered an alternative to bar-code identification. The RFID system has become very popular, with various strengths such as fast recognition speed and non-touch detection. However, there are some problems remaining, as the low-cost tag can operate through queries, leading to information exposure and privacy encroachment. Various approaches have been used to increase the security of the system, but the low-cost tag, which has about 5K~10K gates, can only allocate 250~3K gates to security. Therefore, the current study provides a reciprocal authentication solution that can be used with low-cost RFID systems, by splitting 64 bit keys and minimizing calculations. Existing systems divided a 96 bit key into 4 parts. However, the proposed system reduces the key to 32 bits, and reduces communications from 7 down to 5. To increase security, one additional random number is added to the two existing numbers. The previous system only provided XOR calculations, however in the proposed system an additional hash function was added. The added procedure does not increase effectiveness in terms of the XOR calculation, but provides more security to the RFID system, for better use over remote distances. [ABSTRACT FROM AUTHOR]

This paper proposes an Automatic Korean Phoneme Generator (AKPG) that can be adapted to various natural language processing systems that handle raw input-text from users such as the Korean pronunciation education system. Resolving noise and ambiguity is a precondition for correct natural language processing. In order to satisfy this condition, the AKPG, as a module of an NLP system, combines linguistic and IR methods. Preprocessing modules are incorporated into the AKPG to handle spelling-errors that render correct phoneme generation impossible. In addition, the preprocessing modules convert alphanumeric symbols into Korean characters. Finally, in order to remove part-of-speech (POS) ambiguities and those of homographs with the same POS, homograph collocations are collected from a large corpus using the IR method. In addition, those homographs are integrated into dependency rules for partial parsing. [ABSTRACT FROM AUTHOR]

Today, travelers are provided large amount information which includes Web sites and tourist magazines about introduction of tourist spot. However, it is not easy for users to process the information in a short time. Therefore travelers prefer to receive pertinent information easier and have that information presented in a clear and concise manner. This paper proposes a personalization method for tourist Point of Interest (POI) Recommendation. [ABSTRACT FROM AUTHOR]

The main aim of this work is to implement stochastic Korean Word-Spacing System which is equally robust for both inner-data and external-data. Word-spacing in Korean is influential in deciding semantic and syntactic scope. In order to cope with various problem yielded by word-spacing errors while processing Korean text, this study (a) presents a simple stochastic word-spacing system with only two parameters using relative word-unigram frequencies and odds favoring the inner-spacing probability of disyllables located at the boundary of stochastic-based words; (b) endeavors to diminish training-data-dependency by dynamically creating candidate words list with the longest-radix-selecting algorithm and (c) removes noise from the training-data by refining training procedure. The system thus becomes robust against unseen words and offers similar performance for both inner-data and external-data: it obtained 98.35% and 97.47% precision in word-unit correction from the inner test-data and the external test-data, respectively. [ABSTRACT FROM AUTHOR]

Although a number of methods have been proposed to process exact match or range queries in P2P network, very few attention has been paid on spatial query process. In this paper, we propose a triangular topology of P2P network and spatial query processing methods on this topology. Each node maintains a set of pointers to neighbor nodes determined by delaunay triangulation. This triangular network topology provides us with an efficient way to find a path from any source node to the destination node or area, and to process spatial queries. We compare two spatial query processing methods based on the triangular network by experiments. [ABSTRACT FROM AUTHOR]

In order to analyze the behavior of moving objects, a measure for determining the similarity of trajectories needs to be defined. Although research has been conducted that retrieved similar trajectories of moving objects in Euclidean space, very little research has been conducted on moving objects in the space defined by road networks. In terms of real applications, most moving objects are located in road network space rather than in Euclidean space. In this paper, we investigate the properties of similar trajectories in road network space. And we propose a method to retrieve similar trajectories based on this observation and similarity measure between trajectories on road network space. Experimental results show that this method provides not only a practical method for searching for similar trajectories but also a clustering method for trajectories. Keywords: Trajectories, Road Network Space, Similarity between Trajectories. [ABSTRACT FROM AUTHOR]