• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.27-36
• /
• 2010

In Web registration pages and online polling applications, CAPTCHA(Completely Automated Public Turing Test To Tell Computers and Human Apart) is used for distinguishing human users from automated programs. Text-based CAPTCHAs have been widely used in many popular Web sites in which distorted text is used. However, because the advanced optical character recognition techniques can recognize the distorted texts, the reliability becomes low. Image-based CAPTCHAs have been proposed to improve the reliability of the text-based CAPTCHAs. However, these systems also are known as having some drawbacks. First, some image-based CAPTCHA systems with small number of image files in their image dictionary is not so reliable since attacker can recognize images by repeated executions of machine learning programs. Second, users may feel uncomfortable since they have to try CAPTCHA tests repeatedly when they fail to input a correct keyword. Third, some image-base CAPTCHAs require high communication cost since they should send several image files for one CAPTCHA. To solve these problems of image-based CAPTCHA, this paper proposes a new CAPTCHA based on both image and text. In this system, an image and keywords are integrated into one CAPTCHA image to give user a hint for the answer keyword. The proposed CAPTCHA can help users to input easily the answer keyword with the hint in the fused image. Also, the proposed system can reduce the communication costs since it uses only a fused image file for one CAPTCHA. To improve the reliability of the image-text fusion CAPTCHA, we also propose a dynamic building method of large image dictionary from gathering huge amount of images from theinternet with filtering phase for preserving the correctness of CAPTCHA images. In this paper, we proved that the proposed image-text fusion CAPTCHA provides users more convenience and high reliability than the image-based CAPTCHA through experiments.

• Journal of KIISE:Software and Applications
• /
• v.29 no.4
• /
• pp.270-277
• /
• 2002

Text filtering is a task of deciding whether a document has relevance to a specified topic. As Internet and Web becomes wide-spread and the number of documents delivered by e-mail explosively grows the importance of text filtering increases as well. The aim of this paper is to improve the accuracy of text filtering systems by using machine learning techniques. We apply AdaBoost algorithms to the filtering task. An AdaBoost algorithm generates and combines a series of simple hypotheses. Each of the hypotheses decides the relevance of a document to a topic on the basis of whether or not the document includes a certain word. We begin with an existing AdaBoost algorithm which uses weak hypotheses with their output of 1 or -1. Then we extend the algorithm to use weak hypotheses with real-valued outputs which was proposed recently to improve error reduction rates and final filtering performance. Next, we attempt to achieve further improvement in the AdaBoost's performance by first setting weights randomly according to the continuous Poisson distribution, executing AdaBoost, repeating these steps several times, and then combining all the hypotheses learned. This has the effect of mitigating the ovefitting problem which may occur when learning from a small number of data. Experiments have been performed on the real document collections used in TREC-8, a well-established text retrieval contest. This dataset includes Financial Times articles from 1992 to 1994. The experimental results show that AdaBoost with real-valued hypotheses outperforms AdaBoost with binary-valued hypotheses, and that AdaBoost iterated with random weights further improves filtering accuracy. Comparison results of all the participants of the TREC-8 filtering task are also provided.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.615-622
• /
• 2006

Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.365-380
• /
• 2002

Temporal data mining, the incorporation of temporal semantics to existing data mining techniques, refers to a set of techniques for discovering implicit and useful temporal knowledge from large quantities of temporal data. Temporal knowledge, expressible in the form of rules, is knowledge with temporal semantics and relationships, such as cyclic pattern, calendric pattern, trends, etc. There are many examples of temporal data, including patient histories, purchaser histories, and web log that it can discover useful temporal knowledge from. Many studies on data mining have been pursued and some of them have involved issues of temporal data mining for discovering temporal knowledge from temporal data, such as sequential pattern, similar time sequence, cyclic and temporal association rules, etc. However, all of the works treated data in database at best as data series in chronological order and did not consider temporal semantics and temporal relationships containing data. In order to solve this problem, we propose a theoretical framework for temporal data mining. This paper surveys the work to date and explores the issues involved in temporal data mining. We then define a model for temporal data mining and suggest SQL-like mining language with ability to express the task of temporal mining and show architecture of temporal mining system.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.138-149
• /
• 2006

As the environment with sensor network and ubiquitous computing is emerged, there are many demands of handling continuous, fast data such as streaming data. As work about streaming data has begun, work about management of streaming data in Publish-Subscribe system is started. The recent emergence of XML as a standard for information exchange on Internet has led to more interest in Publish - Subscribe system. A filtering technique of streaming XML data in the existing Publish- Subscribe system is using some schemes based on automata and YFilter, which is one of filtering techniques, is very popular. YFilter exploits commonality among path queries by sharing the common prefixes of the paths so that they are processed at most one and that is using the top-down approach. However, because partial matching path queries interrupt the common prefix sharing and don't calculate from root, throughput of YFilter decreases. So we use sharing of commonality among path queries with the common postfixes of the paths and use the bottom-up approach instead of the top-down approach. This filtering technique is called as PoSFilter. And we verify this technique through comparing with YFilter about throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.665-667
• /
• 2014

Wellness is IT fused with the user manage and maintain the health of a service can help you. If you are using an existing Fitness Center to yourself by choosing appliances that fit with the risk of injury in order to learn how the efficient movement had existed for a long time was needed. To resolve, use the personal training but more expensive cost of people's problems, and shown again in the habit of exercising alone will have difficulty. This paper provides a variety of smart phones based on a hybrid app with compatibility with the platform and personalized training market system. Users of the Fitness Center is built into smart phones in the history of their movement sensors or transmits to the Web by typing directly. This is based on exercise programs tailored to users via the training market. Personal training marketplace has a variety of users, check the history of this movement he can recommend an exercise program for themselves can be applied by selecting the. This provides users with the right exercise program can do long-term exercise habits can be proactive and goal setting.

• The Korean Journal of Archival Studies
• /
• no.43
• /
• pp.5-42
• /
• 2015

Korean wave 3.0 is focused on 'K-Culture' which includes traditional culture, cultural art as well as existing culture contents as a keyword. It considers everything about Korean culture as materials of Korean wave culture contents. Since Korean wave culture contents reflect contemporary social aspect, it needs to preserve those contents as archives and records which have the important value of evidence. With this social environment, this study aims to implement RMS based on AtoM that manages various kinds of Korean wave culture contents through analysis of management situation of those materials. Recently, it is in progress individually to manage them through organizations dealing with korean cultures such as K-Pop, K-Food, K-Movie. However, it has problems in accumulating information and reproducing high quality contents because of lack of coordination among organizations. To solve the problems, this study proposed RMS based on open source software Access to Memory(AtoM) for managing and recording Korean wave culture contents. AtoM provides various functions for managing records and archives such as accumulation, classification, description and browsing. Furthermore AtoM is for free as open source software and easy to implement and use. Thus, this study implemented RMS based on AtoM to methodically manage korean wave culture contents by functional requirements of RMS. Also, this study considered contents relating K-Food as an object to collect, classify, and describe. To describe it, this study selected ISAD(G) standard.

• Journal of the Korean Society for information Management
• /
• v.24 no.2
• /
• pp.5-27
• /
• 2007

While $LibQUAL+^{TM}$ is in the headlines of many articles focusing on library service evaluations, little research has been conducted to study the relationship between the $LibQUAL+^{TM}$ factors and the adoption of library services. It remains unclear whether the factors of $LibQUAL+^{TM}$ have any effect on its adoption. A framework was adapted from Icek Ajzen's theory of planned behavior and proposed to extract factors affecting the adoption of library services. The factors were examined via data collection from a Web-based questionnaire survey with college students in the United States. Factor analyses and multiple regression analysis were conducted. Findings show that the intention to use library services is explained by attitude toward library service quality. The attitudinal factors that are significant are (1) perceived personal control, (2) perceived affect of service, and (3) perceived comprehensiveness of information. The relative importance among the factors is also represented by the numbered sequence. However, perceived timeliness of information access and the perception of library as place do not have a significant effect on the intention. This study extends the research on library service evaluation, and provides a new evaluation framework by applying adoption behaviors.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.159-168
• /
• 2012

Relation in the new IT environment, such as the SNS, Cloud, Web3.0, has become an important factor. And these relations generate a transaction. However, existing relational database and graph database does not processe graph structure representing the relationships and transactions. This paper, we propose the technique that can be processed concurrently graph structures and transactions in a scalable complex network system. The proposed technique simultaneously save and navigate graph structures and transactions using the Topic Maps data model. Topic Maps is one of ontology language to implement the semantic web(Web 3.0). It has been used as the navigator of the information through the association of the information resources. In this paper, the architecture of the proposed technique was implemented and design using Cassandra - one of column type NoSQL. It is to ensure that can handle up to Big Data-level data using distributed processing. Finally, the experiments showed about the process of storage and query about typical RDBMS Oracle and the proposed technique to the same data source and the same questions. It can show that is expressed by the relationship without the 'join' enough alternative to the role of the RDBMS.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.258-266
• /
• 2011

AR(Augmented Reality) technology is now easily shown around us with respect to its applicable areas' being spreaded into various shapes since the usage is simply generalized and many-sided. Currently existing camera vision based AR used marker based methods rather than using real world's informations. For the marker based AR technology, there are limitations on applicable areas and its environmental properties that a user could immerse into the usage of application program. In this paper, we proposed a novel AR method which users could recognize objects from the real world's data and the related 3-dimensional contents are also displayed. Those are done using image processing skills and a smart mobile embedded camera for terminal based AR implementations without any markers. Object recognition is done from the comparison of pre-registered and referenced images. In this process, we tried to minimize the amount of computations of similarity measurements for improving working speed by considering features of smart mobile devices. Additionally, the proposed method is designed to perform reciprocal interactions through touch events using smart mobile devices after the 3-dimensional contents are displayed on the screen. Since then, a user is able to acquire object related informations through a web browser with respect to the user's choice. With the system described in this paper, we analyzed and compared a degree of object recognition, working speed, recognition error for functional differences to the existing AR technologies. The experimental results are presented and verified in smart mobile environments to be considered as an alternate and appropriate AR technology.