Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartB
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 8B, Issue 5 - Oct 2001
Volume 8B, Issue 4 - Aug 2001
Volume 8B, Issue 3 - Jun 2001
Volume 8B, Issue 2 - Apr 2001
Volume 8B, Issue 1 - Feb 2001
Volume 8B, Issue 6 - Jan 2001
Selecting the target year
The Automatic Coordination Model for Multi-Agent System Using Learning Method
Lee, Mal-Rye ; Kim, Sang-Geun ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 587~594
Multi-agent system fits to the distributed and open internet environments. In a multi-agent system, agents must cooperate with each other through a coordination procedure, when the conflicts between agents arise. Where those are caused by the point that each action acts for a purpose separately without coordination. But previous researches for coordination methods in multi-agent system have a deficiency that they cannot solve correctly the cooperation problem between agents, which have different goals in dynamic environment. In this paper, we suggest the automatic coordination model for multi-agent system using neural network and reinforcement learning in dynamic environment. We have competitive experiment between multi-agents that have complexity environment and diverse activity. And we analysis and evaluate effect of activity of multi-agents. The results show that the proposed method is proper.
A Design and Implementation of Course Relearning System using Multi-agent
Lee, Jong-Hui ; Lee, Geun-Wang ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 595~600
Recently, WBI model which is based on web has been proposed in the part of the new activity model of teaching-learning. The demand for the customized coursewares which is required from the learners is increased, the needs of the efficient and automated education agents in the web-based instruction are recognized. But many education systems that had been studied recently did not service fluently the courses which learners had been wanting and could not provide the way for the learners to study the learning weakness which is observed in the continuous feedback of the course. In this paper we propose design of multi-agent system for course scheduling of learner-oriented using weakness analysis algorithm. First, proposed system monitors learner's behaviors constantly, evaluates them, and calculates his accomplishment. From this accomplishment, the multi-agent schedules the suitable course for the learner. The learner achieves an active and complete learning from the repeated and suitable course.
Task Reallocation in Multi-agent Systems Based on Vickrey Auctioning
Kim, In-Cheol ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 601~608
The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.
Personalized Wire and Wireless News Retrieval System Using Intelligent Agent
Han, Seon-Mi ; Woo, Jin-Woon ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 609~616
Today, as the Internet is popularized, information and news retrieval are generalized. However due to the tremendous amount and variety of information, many users appeal the difficulties of information retrieval. Thus in this paper, we propose a news retrieval system, which filters news articles using an intelligent agent with the learning ability of BPN (back propagation neural network). This system also uses a profile to accomodate the personalized news retrieval. This system consists of two major agents, collection agent and learning agent. The collection agent gathers the articles from several news sites, analyzes them, and stores into a database. The learning agent builds the BPN based on the personalized data. In addition, considering the popularity of the wireless internet due to the rapid development of communication technologies, we made this system provide the service through the wireless internet.
Construction of Multi-Agent System Workflow to Recommend Product Information in E-Commerce
Kim, Jong-Wan ; Kim, Yeong-Sun ; Lee, Seung-A ; Jin, Seung-Hoon ; Kwon, Young-Jik ; Kim, Sun-Cheol ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 617~624
With the proliferation of E-Commerce, product informations and services are provided to customers diversely. Thus customers want a software agent that can retrieve and recommend goods satisfying various purchase conditions as well as price. In this paper, we present a MAS (multi-agent system) for book information retrieval and recommendation in E-Commerce. User's preference is reflected in the MAS using the profile which is taken by user. The proposed MAS is composed of individual agents that support information retrieval, information recommendation, user interface, and web robots and a coordination agent which performs information sharing and job management between individual agents. Our goal is to design and implement this multi-agent system on a Windows NT server. Owing to the workflow management of the coordination agent, we can remove redundant information retrievals of web robots. From the results, we could provide customers various purchase conditions for several online bookstores in real-time.
A Recommendation System of Exponentially Weighted Collaborative Filtering for Products in Electronic Commerce
Lee, Gyeong-Hui ; Han, Jeong-Hye ; Im, Chun-Seong ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 625~632
The electronic stores have realized that they need to understand their customers and to quickly response their wants and needs. To be successful in increasingly competitive Internet marketplace, recommender systems are adapting data mining techniques. One of most successful recommender technologies is collaborative filtering (CF) algorithm which recommends products to a target customer based on the information of other customers and employ statistical techniques to find a set of customers known as neighbors. However, the application of the systems, however, is not very suitable for seasonal products which are sensitive to time or season such as refrigerator or seasonal clothes. In this paper, we propose a new adjusted item-based recommendation generation algorithms called the exponentially weighted collaborative filtering recommendation (EWCFR) one that computes item-item similarities regarding seasonal products. Finally, we suggest the recommendation system with relatively high quality computing time on main memory database (MMDB) in XML since the collaborative filtering systems are needed that can quickly produce high quality recommendations with very large-scale problems.
Design and Implementation of Electronic Commerce Prototype System based on Mobile Agent
Kim, Phyoung-Jung ; Yun, Seok-Hwan ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 633~640
Mobile agent is a software program that provides autonomy and mobility for the users in the networked computers by deciding its own movement place. Since mobile agent does not keep up the network connection and migrate its executable code under its own control, it can be often used in the unstable network conditions such as the wireless network and the heavy traffic network. In this paper, we show that the electronic commerce system can be developed efficiently to retrieve and trade the goods in the mobile computing environment by using the mobile agent paradigm. Multiple mobile agents migrate into the market directly, then negotiate and trade autonomously relevant goods and services. The execution result and executable code of the mobile agent are returned to the home place and reported to the users. We show that the mobile agent paradigm is suitable to build the mobile electronic commerce system by designing and prototyping the mobile market system.
JMoblet : A Jini-based Mobile Agent System
Kim, Jin-Hong ; Koo, Hyeong-Seo ; Yun, Hyeong-Seok ; An, Geon-Tae ; Yu, Yang-U ; Lee, Myeong-Jun ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 641~650
Jini architecture's Network Plug and Work provides simple and flexible network environment for distributed applications. Through the Jini technology, facilities for dynamically registering and locating mobile agent services can be easily supported, as well as the services useful for activities of mobile agents can be dynamically supported. In this paper, we describe a Jini-based mobile agent system named JMoblet, which provides the basic functions of a mobile agent system such as creation, control, transfer, location and communication among agents. To increase the reliability of the system, it also provides exception handling and persistence of the mobile agent systems for reliability.
Fast Thinning Algorithm based on Improved SOG(
Lee, Chan-Hui ; Jeong, Sun-Ho ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 651~656
In this paper, we propose Improved Self-Organized Graph(Improved SOG：
)thinning method, which maintains the excellent thinning results of Self-organized graph(SOG) built from Self-Organizing features map and improves the performance of modified SOG using a new incremental learning method of Kohonen features map. In the experiments, this method shows the thinning results equal to those of SOG and the time complexity O((logM)3) superior to it. Therefore, the proposed method is useful for the feature extraction from digits and characters in the preprocessing step.
Dynamic recomposition of document category using user intention tree
Kim, Hyo-Lae ; Jang, Young-Cheol ; Lee, Chang-Hoon ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 657~668
It is difficult that web documents are classified with exact user intention because existing document classification systems are based on word frequency number using single keyword. To improve this defect, first, we use keyword, a query, domain knowledge. Like explanation based learning, first, query is analyzed with knowledge based information and then structured user intention information is extracted. We use this intention tree in the course of existing word frequency number based document classification as user information and constraints. Thus, we can classify web documents with more exact user intention. In classifying document, structured user intention information is helpful to keep more documents and information which can be lost in the system using single keyword information. Our hybrid approach integrating user intention information with existing statistics and probability method is more efficient to decide direction and range of document category than existing word frequency approach.
Improved Method for "Aggregation Based on Situation Assessment"
Choe, Dae-Yeong ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 669~674
In order to reflect the aggregation situation in the aggregation process, aggregation based on situation assessment (ASA) method was proposed in . It consists of the situation assessment model (SAM) and the ASA algorithm. In the SAM, the value of parameter, p, is transformed into the nearest integer value . The integer-typed output of SAM is used as input for an aggregation. The integer-typed output of SAM indicates the current degree of aggregation situation. The ASA algorithm produces at most finite several aggregation results between min and max. In the sequel, the ASA method can not properly handle the applications with the more sophisticated aggregation results between min and max. In order to solve this problem, we propose two improved ASA (I-ASA) methods. In these I-ASA methods, we allow the value of parameter of SAM to be a real number, and suggest two improved ASA algorithms to make continuous aggregation results between min and max. These I-ASA methods can handle both a precise aggregation and an approximate aggregation. Therefore, when compared to the ASA method , the proposed I-ASA methods have advantages in that they can handle the applications with the more sophisticated aggregation results and can be used in the more general applications for aggregations.
A Korean Language Stemmer based on Unsupervised Learning
Jo, Se-Hyeong ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 675~684
This paper describes a method for stemming of Korean language by using unsupervised learning from raw corpus. This technique does not require a lexicon or any language-specific knowledge. Since we use unsupervised learning, the time and effort required for learning is negligible. Unlike heuristic approaches that are theoretically ungrounded, this method is based on widely accepted statistical methods, and therefore can be easily extended. The method is currently applied only to Korean language, but it can easily be adapted to other agglutinative languages, since it is not language-dependent.
A Processing of Progressive Aspect "te-iru" in Japanese-Korean Machine Translation
Kim, Jeong-In ; Mun, Gyeong-Hui ; Lee, Jong-Hyeok ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 685~692
This paper describes how to disambiguate the aspectual meaning of Japanese expression "-te iru" in Japanese-Korean machine translation Due to grammatical similarities of both languages, almost all Japanese- Korean MT systems have been developed under the direct MT strategy, in which the lexical disambiguation is essential to high-quality translation. Japanese has a progressive aspectual marker “-te iru" which is difficult to translate into Korean equivalents because in Korean there are two different progressive aspectual markers: "-ko issta" for "action progressive" and "-e issta" for "state progressive". Moreover, the aspectual system of both languages does not quite coincide with each other, so the Korean progressive aspect could not be determined by Japanese meaning of " te iru" alone. The progressive aspectural meaning may be parially determined by the meaning of predicates and also the semantic meaning of predicates may be partially reshicted by adverbials, so all Japanese predicates are classified into five classes : the 1nd verb is used only for "action progrssive",2nd verb generally for "action progressive" but occasionally for "state progressive", the 3rd verb only for "state progressive", the 4th verb generally for "state progressive", but occasIonally for "action progressive", and the 5th verb for the others. Some heuristic rules are defined for disambiguation of the 2nd and 4th verbs on the basis of adverbs and abverbial phrases. In an experimental evaluation using more than 15,000 sentances from "Asahi newspapers", the proposed method improved the translation quality by about 5%, which proves that it is effective in disambiguating "-te iru" for Japanese-Korean machine translation.translation quality by about 5%, which proves that it is effective in disambiguating "-te iru" for Japanese-Korean machine translation.anslation.
Choice of Wavelet-Thresholds for Denoising image
Cho, Hyun-Sug ; Lee, Hyoung ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 693~698
Noisy data are often fitted using a smoothing parameter, controlling the importance of two objectives that are opposite to a certain extent. One of these two is smoothness and the other is closeness to the input data. The optimal value of this parameter minimizes the error of the result. This optimum cannot be found exactly, simply because the exact data are unknown. This paper propose the threshold value for noise reduction based on wavelet-thresholding. In the proposed method PSNR results show that the threshold value performs excellently in comparison with conventional methods without knowing the noise variance and volume of signal.
A study on the new hybrid recurrent TDNN-HMM architecture for speech recognition
Jang, Chun-Seo ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 699~704
ABSTRACT In this paper, a new hybrid modular recurrent TDNN (time-delay neural network)-HMM (hidden Markov model) architecture for speech recognition has been studied. In TDNN, the recognition rate could be increased if the signal window is extended. To obtain this effect in the neural network, a high-level memory generated through a feedback within the first hidden layer of the neural network unit has been used. To increase the ability to deal with the temporal structure of phonemic features, the input layer of the network has been divided into multiple states in time sequence and has feature detector for each states. To expand the network from small recognition task to the full speech recognition system, modular construction method has been also used. Furthermore, the neural network and HMM are integrated by feeding output vectors from the neural network to HMM, and a new parameter smoothing method which can be applied to this hybrid system has been suggested.
Efficient Lane Detection for Preceding Vehicle Extraction by Limiting Search Area of Sequential Images
Han, Sang-Hoon ; Cho, Hyung-Je ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 705~717
In this paper, we propose a rapid lane detection method to extract a preceding vehicle from sequential images captured by a single monocular CCD camera. We detect positions of lanes for an individual image within the limited area that would not be hidden and thereby compute the slopes of the detected lanes. Then we find a search area where vehicles would exist and extract the position of the preceding vehicle within the area with edge component by applying a structured method. To verify the effects of the proposed method, we capture the road images with a notebook PC and a CCD camera for PC and present the results such as processing time for lane detection, accuracy and vehicles detection against the images.
Extending XHTML for Synchronized Multimedia Presentation
Lee, Su-Cheol ; Hwang, In-Jun ;
The KIPS Transactions:PartB, volume 8B, issue 6, 2001, Pages 717~724
Multimedia presentations are a class of documents that are used for lectures, tour guides, business presentations, and in many other applications. These presentations comprise multimedia objects with a temporal structure that specifies when objects are to be delivered, for what duration, and what the temporal relationships among objects are. In this paper, we propose temporal extensions to XHTML that allow seamless integration of synchronized multimedia into web documents. The extensions are based on three concepts：(i) XHTML＋TIME (in short, Xtime) links for temporal composition, (ii) common time bases for close synchronization between media objects, and (iii) dynamic layout for specifying regions of a screen for presentation. Also, we will show a flexible execution architecture to support these concepts in a multimedia presentation.