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:PartA
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 13A, Issue 7 - Dec 2006
Volume 13A, Issue 6 - Dec 2006
Volume 13A, Issue 5 - Oct 2006
Volume 13A, Issue 4 - Aug 2006
Volume 13A, Issue 3 - Jun 2006
Volume 13A, Issue 2 - Apr 2006
Volume 13A, Issue 1 - Feb 2006
Selecting the target year
An Efficient Replication Scheme in Unstructured Peer-to-Peer Networks
Choi Wu-Rak ; Han Sae-Young ; Park Sung-Yong ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 1~10
DOI : 10.3745/KIPSTA.2006.13A.1.001
For efficient searching in unstructured peer-to-peer systems, random walk was proposed and several replication methods have been studied to compensate for the random walk's low query success rate. This paper proposes an efficient replication scheme that improves the accuracy and speed of queries and reduces the cost by minimizing the number of replicas and by utilizing caches. In this scheme, hub nodes store only content's caches, and one of their neighbors stores the replica. By determining hubs with only limited and local information, we can adaptively generate caches and replicas in dynamic peer-to-peer networks.
An Adaptive Proximity Route Selection Method in DHT-Based Peer-to-Peer Systems
Song Ji-Young ; Han Sae-Young ; Park Sung-Yong ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 11~18
DOI : 10.3745/KIPSTA.2006.13A.1.011
In the Internet of various networks, it is difficult to reduce real routing time by just minimizing their hop count. We propose an adaptive proximity route selection method in DHT-based peer-to-peer systems, in which nodes select the nぉe with smallest lookup latency among their routing table entries as a next routing node. Using Q-Routing algorithm and exponential recency-weighted average, each node estimates the total latency and establishes a lookup table. Moreover, without additional overhead, nodes exchange their lookup tables to update their routing tables. Several simulations measuring the lookup latencies and hop-to-hop latency show that our method outperforms the original Chord method as well as CFS' server selection method.
Analysis of Diagnosability for Hyper-Star Network Under the PMC and the Comparison Diagnosis Model
Kim Jong-Seok ; Lee Hyeong-Ok ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 19~26
DOI : 10.3745/KIPSTA.2006.13A.1.019
Diagnosability is an important factor in measuring the reliability of an interconnection network. Typical models of fault diagnosis are the PMC and the comparison diagnosis model. In this paper, we prove that the regular network Hyper-Star HS(2n,n) under two models is n-diagnosable.
An Automated Sharing Scheme of CAD Tools and License Resources Based on Directory Service
Jung Sung-Heon ; Yim In-Sung ; Jhang Kyoung-Son ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 27~34
DOI : 10.3745/KIPSTA.2006.13A.1.027
Designers should know CAD tool/license information such as available number of licenses or tools, types, and configuration methods to use CAD tools properly in their group. Usually, this information is provided by managers who administrate CAD tool and license servers in the specific design group. In the previous CAD tool/licenses sharing methods, designers have to get CAD tool/license information manually and setup the environments with their own hands. n a new designer comes into the design working group, the designer wastes unnecessary design time, because of these processes. As a result, designer's poductivity and utilization of CAD tools will decrease Besides, managers also waste their time and effort, since they should provide CAD tool/license information manually to each designer. In this paper, we present an automated scheme to share CAD tool/license information based on directory service. The proposed methods automate the communication processes between managers and designers that minimze unnecessary time to share CAD information. In addition, as this system maintains the consistency of CAD information automatically that remove the repeated work of managers and designers, it improves the enciency of sharing. Besides, it automates the license configuration steps using prof(y Last, we offer Executable Proxy which is proper for thin CAD application. We believe this scheme will reduce designers and managers' time and effort as well as maximize the utilization of CAD tools.
Design of Grid Accounting Model Based on Site Price Policy
Hwang Ho-Joen ; An Dong-Un ; Chung Seung-Jong ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 35~44
DOI : 10.3745/KIPSTA.2006.13A.1.035
Grid accounting model is necessary to support the demand and supply of id resource. Most grid accounting systems currently in use intrude upon site autonomy by modifying local accounting systems or calculate the cost of grid service without regard to site price policy. In this paper we propose and design Grid accounting model based on site price policy. This model assures autonomy of sites participating in gird computing and be able to actively cope with diverse billing services. Also this proposed model enables to provide RUS to Grid entities by transforming basic accounting information into GGF-UR format and allows this entities to exchange resource usage information. In this paper, proposed Grid accounting model enables sites to have autonomy of them and is evaluated for business model to enforce elaborate charging policy, compared with other systems.
Load balancing of a deployment server using P2P
Son Sei-Il ; Lee Suk-Kyoon ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 45~52
DOI : 10.3745/KIPSTA.2006.13A.1.045
To perform on-line maintenance for Distributed Information System, it is indispensable to disseminate files to participant nodes in the network. When users' requests for file deployment occur simultaneously in a short period a deployment server falls into overload phase, which is often called Flash Crowds. h common solution to avoid Flash Crowds is to increase hardware capacity. In this paper, we propose a software solution based on P2P, which does not cost any additional expense. In the proposed solution, nodes in the network are grouped into subnetworks one of which is composed of only neighboring nodes. In each subnetwork, copies of deployment files can be transferred to each other. Consequently, it brings about the effect of load balancing in deployment server. To raise the effectiveness, target files for deployment are packed into one package. Before being transferred, each package is divided into multiple equal-sized segments. A deployment server in a normal phase transmits a package requested from nodes in segment units. However a deployment server is overloaded, if segments already exist in the subnetwork participant nodes in the subnetwork receive necessary segments from neighboring nodes. In this paper, we propose data structures and algorithm for this approach and show performance improvement through simulation.
Parallel Genetic Algorithm using Fuzzy Logic
An Young-Hwa ; Kwon Key-Ho ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 53~56
DOI : 10.3745/KIPSTA.2006.13A.1.053
Genetic algorithms(GA), which are based on the idea of natural selection and natural genetics, have proven successful in solving difficult problems that are not easily solved through conventional methods. The classical GA has the problem to spend much time when population is large. Parallel genetic algorithm(PGA) is an extension of the classical GA. The important aspect in PGA is migration and GA operation. This paper presents PGAs that use fuzzy logic. Experimental results show that the proposed methods exhibit good performance compared to the classical method.
Routing Congestion Driven Placement
Oh Eun-Kyung ; Hur Sung-Woo ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 57~70
DOI : 10.3745/KIPSTA.2006.13A.1.057
This paper describes a new effective algorithm to estimate routing congestion and to resolve highly congested regions for a given detailed placement. The major features of the proposed technique can be summarized as follows. Firstly, if there are congested regions due to some nets which pass through the regions it can determine which cells affect those congested spots seriously and moves some of them to resolve congestion effectively. Secondly, since the proposed technique uses the ripple movement technique to move cells it resolves congestion without sacrificing wire length. Thirdly, we use an efficient incremental data structure to trace the changes in congestion and wire length as cells move. Hence, selection of cells to move could be very accurate and fast in the course of iteration. Finally, although an MST net model is used to resolve congestion in this paper, proposed technique can be work with any net model. Particularly, if proposed technique can obtain routing information from a real router, congestion can be resolved more effectively. Experimental results show that the proposed technique can resolve congestion effectively and efficiently without sacrificing wire length.
Inline Binding For XNL DataInline Binding For XML Data
Lee Eun-Jung ; Yoo Ga-Yeon ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 71~78
DOI : 10.3745/KIPSTA.2006.13A.1.071
For using XML data in programming languages, there is a data binding method, which generates classes from XML type definitions. However, since existing binding frameworks for this method generate all classes for element definitions, the number of generated classes becomes large and the complexity of the overall application system gets high. In this research, we propose an inline binding method for selecting necessary classes from element definitions. In the proposed method, classes are created only for elements with repetitions and recursions, and they include fields for values of terminal elements. We introduce a generation algorithm for binding classes and the marshaling methods for recovering the omitted paths. We develop IBinder system to validate the proposed method and compare the generated codes with the ones of existing systems. As a result, we carl show that the number of generated classes decrease substantially compared to other systems.
MarSel : LD based tagSNP Selection System for Large-scale SNP Haplotype Dataset
Kim Sang-Jun ; Yeo Sang-Soo ; Kim Sung-Kwon ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 79~86
DOI : 10.3745/KIPSTA.2006.13A.1.079
Recently the tagSNP selection problem has been researched for reducing the cost of association studies between human's diversities and SNPs. General approach for this problem is that all of SNPs are separated into appropriate blocks and then tagSNPs are chosen in each block. Marsel in this paper is the system that involved the concept of linkage disequilibrium for overcoming the problem that the existing block partitioning approaches have short of biological meanings. In most approaches, the contiguous regions, which recombinations have LD coefficient |D'| and then tagSNP selection step is performed. and MarSel guarantees the minimum tagSNP selection using entropy-based optimal selection algorithm when tagSNPs are chosen in each block, and enables chromosome-level association studies using efficient memory management technique when input is very large-scale dataset that is impossible to be processed in the existing systems. Key Words: SNP,dynamic Programming,Haplotype,tagSNP Selection,Linkage Disequilibrium
Management of Learning Metadata based on RDF
Lee Young-Seok ; Seo Young-Bae ; Park Jung-Hwan ; Kim Su-Min ; Choi Byung-Uk ; Cho Jung-Won ;
The KIPS Transactions:PartA, volume 13A, issue 1, 2006, Pages 87~94
DOI : 10.3745/KIPSTA.2006.13A.1.087
Internet makes it possible to access anytime, anywhere learning and so many LMS(Learning Management Systems) serve web based learning. But LMS has not flexible and qualified metadata to offer customired teaming. So we need extensible and flexible techniques which make if possible to define and share advanced teaming metadata. This paper presents an approach for implementing advanced learning metadata in LMS using RDF and the Semantic Web language. So we will first sketch the learning scenario in Semantic Web environment and structure of metadata management. Next we suggest two types of RDF authoring tool and search RDF documents. Advanced metadata management techniques enables the organization of learning materials around small pieces of semantically annotated learning objects. With these metadata learner can customize learning courses, improve retrieval performances.