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 12A, Issue 7 - Dec 2005
Volume 12A, Issue 6 - Dec 2005
Volume 12A, Issue 5 - Oct 2005
Volume 12A, Issue 4 - Aug 2005
Volume 12A, Issue 3 - Jun 2005
Volume 12A, Issue 2 - Apr 2005
Volume 12A, Issue 1 - Feb 2005
Selecting the target year
An Exception Monitoring System for Developing Reliable Java Programs
Oh Heejung ; Chang Byeong-Mo ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 471~476
DOI : 10.3745/KIPSTA.2005.12A.6.471
Exception mechanism in Java allows programmers to define, throw and catch exceptional conditions. It is important for the development of reliable programs to make sure that exceptions are handled appropriately at run-time. In this paper, we develop an exception monitoring system, which can help programmers trace and handle exceptions effectively. Using this system, programmers can examine exception handling process in detail by tracing only interesting exceptions, and can handle exceptions more effectively. To reduce performance overhead, we design the system based on code instrumentation. Moreover, we show the effectiveness of the system by experiments on benchmark programs.
Two-Level Context Adaptation Method for Context-Aware Applications
Chim Soo-Jong ; Yoon Yong Ik ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 477~484
DOI : 10.3745/KIPSTA.2005.12A.6.477
Applications in ubiquitous environments should provide the best services to users by considering the changes of users requirements and service environments, and should adapt service behaviors to the underlying platform`s behaviors according to contextual changes. To reflect users requirements actively and provide more flexible services, we propose 2-level context adaptation method for supporting dynamic application adaptability in contextual changes. We offend the range of contexts to users requirements for supporting context adaptation. It can reflect users preferences in offering application services. For application adaptability, we use adaptation policies to allow applications require how they adapt to specific contexts, and to make them react actively on such situations.
A Ubiquitous Workflow Language based on Web Services
Han, Joo-Hyun ; Cho, Yong-Yoon ; Choi, Jae-Young ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 485~492
DOI : 10.3745/KIPSTA.2005.12A.6.485
Currently workflows in business processes and distributed computing environments have provided service automation by connecting many tasks with rules and/or orderings. The services in ubiquitous computing environments have to automatically provide users with adaptive services according to dynamically changing contort information, which is obtained from both the users and their environment. To adapt these workflows to ubiquitous computing, we must specify the situation information on the transition conditions. In this paper, we propose uWDL, Ubiquitous Workflow Description Language, based on Web Services to use the situation information on the transition constraints of workflow`s services. uWDL can select adaptive services according to contexts, profiles, and events information, which are situation information. Furthermore, we verified the execution of a scenario document described with uWDL using the parser and the context handler for uWDL. The scenario developers can use the uWDL scenario editor for a design of scenarios, and they can easily specify the transition condition of the services according the situation information of ubiquitous environments using the uWDL.
An Access Control using Reputation Information in P2P File Sharing System
Shin Jung-Hwa ; Shin Weon ; Rhee Kyung-Hyune ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 493~498
DOI : 10.3745/KIPSTA.2005.12A.6.493
P2P service is a method that can share various information through direct connection between computer of a person who have information and a Person who have information without server in the Internet and it is getting a lot of popularity by method for free ex change of file. P2P file sharing systems have become popular as a new paradigm for information exchange. Because all users who use service in P2P file sharing system can use shared files of several users freely by equal access privilege, it is happening the `free rider` that only download shared file of other users without share own files. Although a user share a malicious file including virus, worm or file that have title differing with actuality contents, can use file sharing service without limitation. In this paper, we propose a method that restrict access of `free rider` that only download using reputation information that indicate reliability of user. Also, we restrict usage ons hared file of other users about users who share harmful file.
Analysis of Bisection width and Fault Diameter for Hyper-Star Network HS(2n, n)
Kim, Jong-Seok ; Lee, Hyeong-Ok ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 499~506
DOI : 10.3745/KIPSTA.2005.12A.6.499
Recently, Hyper-Star network HS(m,k) which improves the network cost of hypercube has been proposed. In this paper, we show that the bisection width of regular Hyper-Star network HS(2n,n) is maximum (2n-2,n-1). Using the concept of container, we also show that k-wide diameter of HS(2n,n) is less than dist(u,v)+4, and the fault diameter is less than D(HS(2n,n))+2, where dist(u,v) is the shortest path length between any two nodes u and v in HS(2n,n), and D(HS(2n,n)) is its diameter.
Partially Decentralized Passive Replication Algorithm
Ahn, Jin-Ho ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 507~514
DOI : 10.3745/KIPSTA.2005.12A.6.507
This paper presents a partially decentralized passive replication algorithm for deterministic servers in message-passing distributed systems. The algorithm allows any backup server, not necessarily the primary server, to take responsibility for processing its received client request and coordinating with the other replica servers after obtaining the delivery sequence number of the request from the primary. Thanks to thus desirable feature, the algorithm with conventional load balancing techniques can efficiently avoid extreme load conditions on the primary. Therefore, it can provide better scalability of deterministic and replicated sewer systems than traditional passive replication algorithms. Simulation results indicate that the proposed algorithm can reduce
of the average response time of a client request compared with the traditional ones.
An External Surfaces Modeling of Inlay/onlay Using Geometric Techniques
Yoo kwal-Hee ; Ha Jong-Sung ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 515~522
DOI : 10.3745/KIPSTA.2005.12A.6.515
This paper presents a method for effectively modeling inlay/onlay prostheses restoring a tooth that are partially destroyed. An inlay/onlay is composed of internal surface adhering to an abutment, and external surface revealed to the outside sight. Internal surfaces are modeled using Minkowski sum expanding the grinded surface parts of abutments so that the internal surfaces can adhere to the abutments with closer contact. In modeling external surfaces, we exploit 3D mesh deformation techniques: DMFFD(direct manipulation free-form deformation) and MWD(multiple wires deformation) with three kinds of informations: standard teeth models, mesh data obtained by scanning a plaster cast of a patient`s tooth, FGP(functionally guided plane) measuring the occlusion of the patients`s teeth. The standard teeth models are used for building up the basic shapes of external surfaces, while the plaster fast and FGP data are used for reflecting the unique properties of adjacent md occlusal surfaces of the patients`s teeth, which are slightly different to each other but very important for correct functioning. With these informations as input data, the adjacent and occlusal surfaces are automatically generated as mesh data using the techniques of DMFFD and m, respectively. Our method was implemented so that inlay/onlay prostheses fan be designed more accurately by visualizing the generated mesh models with requirements by dentists.
Design and Verification of PCI 2.2 Target Controller to support Prefetch Request
Hyun Eugin ; Seong Kwang-Su ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 523~530
DOI : 10.3745/KIPSTA.2005.12A.6.523
When a PCI 2.2 bus master requests data using Memory Read command, a target device may hold PCI bus without data to be transferred for long time because a target device needs time to prepare data infernally. Because the usage efficiency of the PCI bus and the data transfer efficiency are decreased due to this situation, the PCI specification recommends to use the Delayed Transaction mechanism to improve the system performance. But the mechanism cann`t fully improve performance because a target device doesn`t know the exact size of prefetched data. In the previous work, we propose a new method called Prefetch Request when a bus master intends to read data from the target device. In this paper, we design PCI 2.2 controller and local device that support the proposed method. The designed PCI 2.2 controller has simple local interface and it is used to convert the PCI protocol into the local protocol. So the typical users, who don`t know the PCI protocol, can easily design the PCI target device using the proposed PCI controller. We propose the basic behavioral verification, hardware design verification, and random test verification to verify the designed hardware. We also build the test bench and define assembler instructions. And we propose random testing environment, which consist of reference model, random generator ,and compare engine, to efficiently verify corner case. This verification environment is excellent to find error which is not detected by general test vector. Also, the simulation under the proposed test environment shows that the proposed method has the higher data transfer efficiency than the Delayed Transaction about
A Gain Enhancing Scheme for Op-Amp in High Performance AIPS Using Negative Resistance Element
Chung Kang-Min ; Kim Sung-Mook ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 531~538
DOI : 10.3745/KIPSTA.2005.12A.6.531
In the high performance Analog Information Processing Systems(AIPS), gain boosting or additional gain stage is required when the gain is not sufficient with one stage amplification. This work shows that high gain is neatly obtained by enhancing the gain using the negative resistance element. Compared to the conventional techniques, the proposed scheme enjoys full output swing, small circuit area and power consumption, and the applications to various configurations of amplifiers. The negative resistance element is placed between the differential output nodes when used in the Op-Amp. The HSPICE simulation indicates that enhancement of more than 40 dB is readily obtained in this simple configuration when the negative resistance element is implemented in the form of cross-coupled CMOS inverters.
An Intelligent Marking System based on Semantic Kernel and Korean WordNet
Cho Woojin ; Oh Jungseok ; Lee Jaeyoung ; Kim Yu-Seop ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 539~546
DOI : 10.3745/KIPSTA.2005.12A.6.539
Recently, as the number of Internet users are growing explosively, e-learning has been applied spread, as well as remote evaluation of intellectual capacity However, only the multiple choice and/or the objective tests have been applied to the e-learning, because of difficulty of natural language processing. For the intelligent marking of short-essay typed answer papers with rapidness and fairness, this work utilize heterogenous linguistic knowledges. Firstly, we construct the semantic kernel from un tagged corpus. Then the answer papers of students and instructors are transformed into the vector form. Finally, we evaluate the similarity between the papers by using the semantic kernel and decide whether the answer paper is correct or not, based on the similarity values. For the construction of the semantic kernel, we used latent semantic analysis based on the vector space model. Further we try to reduce the problem of information shortage, by integrating Korean Word Net. For the construction of the semantic kernel we collected 38,727 newspaper articles and extracted 75,175 indexed terms. In the experiment, about 0.894 correlation coefficient value, between the marking results from this system and the human instructors, was acquired.
Collaborative Learning Supporting Agent for Facilitating Peer Interaction
Suh Hee-Jeon ; Moon Kyung-Ae ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 547~556
DOI : 10.3745/KIPSTA.2005.12A.6.547
Online collaborative teaming, which has emerged as a new type of education in knowledge-based society, is being discussed actively in the areas of action learning at companies and project-based learning and inquiry-based learning at schools. It regards as an effective method for improving learners practical and highly advanced problem solving abilities, and for stimulating their absorption into learning through pursuing common goals of learning together. Different from individual learning, however, collaborative learning involves complicated processes such as organizing teams, setting common goals, performing tasks and evaluating the outcome of team activities .Thus, it is difficult for a teacher to promote and evaluate the whole process of collaborative learning, and it is necessary to develop systems to support collaborative learning. Therefore, in order to monitor and promote interaction among learners in the process of collaborative learning, the present study developed an extensible collaborative teaming supporting agent (ECOLA) in online learning environments.
Load Balancing of Unidirectional Dual-link CC-NUMA System Using Dynamic Routing Method
Suh Hyo-Joon ;
The KIPS Transactions:PartA, volume 12A, issue 6, 2005, Pages 557~562
DOI : 10.3745/KIPSTA.2005.12A.6.557
Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show
improved fluctuation of link utilization,
enhanced acquirement of link, and
improved system performance.