• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.855-864
• /
• 2001

With the increasing importance and complexity of EC (Electronic Commerce) across the Internet, the need and expectation for intelligent software agents to support both consumers and suppliers through the whole process of EC are growing rapidly. To realize the intelligent EC. a multiagent based EC system. which includes foundational technologies such as the establishment of standard product ontology the definition of message and negotiation protocol and brockering, is required. In this paper we propose an intelligent EC System named ICOMA(Intelligent electronic CO mmerce system based on Multi-Agent) as an open infrastructure of multiagent-based EC. Concretely we have proposed. designed and implemented an architecture of multiagent-based EC system including 6-types of agents message protocol for inter-agent negotiation, personalized produst retrieval and filtering., We have confirmed the effectiveness of the system through experiments.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1832-1840
• /
• 1999

Since the existed Korean Web IR systems generally use boolean system, it is difficult to retrieve the information to be wanted at one time. Also, because of the feature that web documents have the frequent abbreviation and many links, the keyword extraction using the inverted document frequency extracts the improper keywords for adding ambiguous meaning problem. Therefore, users must repeat the modification of the queries until they get the proper information. In this paper, we design and implement the relevance feedback agent system for resolving the above problems. The relevance feedback agent system extracts the proper information in response to user's preferred keywords and stores these keywords in preference DB table. When users retrieve this information later, the relevance feedback agent system will search it adding relevant keywords to user's queries. As a result of this method, the system can reduce the number of modification of user's queries and improve the efficiency of the IR system.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.3
• /
• pp.143-156
• /
• 1998

This paper reports the GEM (Gateway to Educational Materials) project whose goal is to develop an operational framework to provide the K-12 teachers in the world with 'one-stop/any-stop' access to thousands of lesson plans, curriculum units and other Internet-based educational resources. To the IS-element Dublin Core base package, the GEM project added an 8-element, domain-specific GEM package. The GEM project employed the conceptual data modeling approach to designing the GEM database, used the Sybase relational database management system (RDBMS) to construct the backend database for storing the metadata of educational resources, and also employed the active server page (ASP) technology to provide Web interfaces to that database. The consortium members catalog lesson plans and other Internet-based educational resources using a cataloging module program that produces HTML meta tags. A harvest program collects these meta tags across the Internet and outputs an ASCII file that conforms to the standard agreed by the consortium members. A parser program processes this file to enter meta tags automatically into appropriate relational tables in the Sybase database. The conceptual/logical schemas of Dublin Core and GEM profile are presented. The advantages of conceptual modeling approach to manage metadata are discussed. A prototype system that provides access to the GEM metadata is available at http://lis.skku.ac.kr/gem/.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.199-206
• /
• 2011

Removable Storage provides the excellent portability with light weight and small size which fits in one's hand, many users have recently turned attention to the high-capacity products. However, due to the easy of portability for Removable Storage, Removable Storage are frequently lost and stolen and then many problems have been occurred such as the leaking of private information to the public. The advent of remote storage services where data is stored throughout the network, has allowed an increasing number of users to access data. The main data of many users is stored together on remote storage, but this has the problem of disclosure by an unethical administrator or attacker. To solve this problem, the encryption of data stored on the server has become necessary, and a searchable encryption system is needed for efficient retrieval of encrypted data. However, the existing searchable encryption system has the problem of low efficiency of document insert/delete operations and multi-keyword search. In this paper, an efficient searchable encryption system is proposed.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.171-178
• /
• 2008

Since the XML standard was introduced by the W3C in 1998, documents that have been written in XML have been gradually increasing. Accordingly, several systems have been developed in order to efficiently manage and retrieve massive XML documents. BitCube-a bitmap indexing system-is a representative system for this field of research. Based on the bitmap indexing technique, the path bitmap indexing system(LH06), which performs the clustering of similar paths, improved the problem that the existing BitCube system could not solve, namely, determining similar paths. The path bitmap indexing system has the advantage of a higher retrieval speed in not only exactly matched path searching but also similar path searching. However, the similarity calculation algorithm of this system has a few particular problems. Consequently, it sometimes cannot calculate the similarity even though some of two paths have extremely similar relationships; further, it results in an increment in the number of meaningless clusters. In this paper, we have proposed a novel method that clustering, the similarity between the paths in order to solve these problems. The proposed system yields a stable result for clustering, and it obtains a high score in clustering precision during a performance evaluation against LH06.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.10
• /
• pp.351-356
• /
• 2014

Recently, automobile black boxes have evolved to support functionality to transfer videos stored in them into mobile phones via wireless network, from which the videos can be utilized for various purposes. This paper presents a method for automation of traffic violation reports using the automobile black boxes. When a traffic violation is captured by a black box, the proposed method helps a user to transfer the video capturing it into a mobile phone through a simple UI operation. With the video, an HTTP request to report the violation is automatically generated from the mobile phone, and then is transferred to a cyber-report center. We present a prototype system that implements the proposed method, and discuss several issues necessary to apply the method to real-world applications.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.735-742
• /
• 2003

In the information retrieval system, document clustering technique is to provide user convenience and visual effects by rearranging documents according to the specific topics from the retrieved ones. In this paper, we clustered documents using K-Means algorithm and present the effect of index terms weighting scheme on the document clustering. To verify the experiment, we applied Latent Semantic Indexing approach to illustrate the clustering results and analyzed the clustering results in 2-dimensional space. Experimental results showed that in case of applying local weighting, global weighting and normalization factor, the density of clustering is higher than those of similar or same weighting schemes in 2-dimensional space. Especially, the logarithm of local and global weighting is noticeable.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.558-567
• /
• 2001

Recently, data mining applications require a large amount of high-dimensional data Most algorithms for data mining applications however, do not work efficiently of high-dimensional large data because of the so-called curse of dimensionality[1] and the limitation of available memory. To overcome these problems, this paper proposes a new cell-based clustering which is more efficient than the existing algorithms for high-dimensional large data, Our clustering method provides a cell construction algorithm for dealing with high-dimensional large data and a index structure based of filtering .We do performance comparison of our cell-based clustering method with the CLIQUE method in terms of clustering time, precision, and retrieval time. Finally, the results from our experiment show that our cell-based clustering method outperform the CLIQUE method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2047-2058
• /
• 2007

The business environment of enterprises could be difficult to obviate redundancy to filtrate data source occurred on data integrated to standard rules and meta-data and to produce integration of data and single viewer in geographical and spatial distributed environment. Specially, To can interchange various data from a heterogeneous system or various applications without types and forms and synchronize continually exactly integrated information#s is of paramount concern. Therefore data hub system based on SQL/XMDR message to overcome a problem of meaning interoperability occurred on exchanging or jointing between each legacy systems are proposed in this paper. This system use message mapping technique of query transform system to maintain data modified in real-time on cooperating data. It can consistently maintain data modified in realtime on exchanging or jointing data for cooperating legacy systems, it improve clarity and availability of data by providing a single interface on data retrieval.

• Korean Journal of Remote Sensing
• /
• v.13 no.2
• /
• pp.151-163
• /
• 1997

In this paper, an algorithm for retrieving soil moisture from measurement of microwave reflection at the end of a coaxial canble is presented. Because the wave reflection from the boundary between air and soil layers depends on the dielectric constant of the soil layer, the dielectric constant can be obtained from measured reflection coefficient. At first, an equivalent circuit for the coaxial probe contaced on the soil surface was chosen with two unknown circuit elements. Then, the unknown circuit elements are obtained experrmentally by measuring the reflection constants of 20 soil samples, and consequently, an empirical formula for computing the dielectric constant from the reflection coefficient is obtained. The dielectric constant is mainly influenced by the soil moisture, and the soil moisture can be computed from the dielecfic constant using an existing empirical formula. HP Network Analyzer 8510C was used to measure the magnitude and the phase of the reflection coeffcient at 4.65 GHz, and the measured data set were used to obtain an empirical formula for computing the dielectric constant. The empirical formula obtained in this study was proven by other soil samples.