Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Internet Computing and Services
Journal Basic Information
Journal DOI :
Korean Society for Internet Information
Editor in Chief :
Volume & Issues
Volume 3, Issue 6 - Dec 2002
Volume 3, Issue 5 - Oct 2002
Volume 3, Issue 4 - Aug 2002
Volume 3, Issue 3 - Jun 2002
Volume 3, Issue 2 - Apr 2002
Volume 3, Issue 1 - Feb 2002
Selecting the target year
Asynchronous Remote Procedure Call Service System using the XML Technology
Journal of Internet Computing and Services, volume 3, issue 6, 2002, Pages 1~11
The purpose of this paper is the design and implementation of asynchronous remote procedure call (RPC) resource service system using the XML technology. For this purpose, the request information of client is encoded into XML document based on XML-DOM and transferred to server, Server classifies the client requests into general application program and XML-RPC service using the object which can deal with the XML-DOM. In addition, server saves the request result of client in XML-DOM structure not transmitting it immediately in order to support asynchronous service, and makes the client request redirected to another request server in XML-DOM information. As a result, general RPC and XML-RPC services were attained and client request was redirected to servers, and the execution environment was simplified compared to common RPC.
Detection of Facial Region and features from Color Images based on Skin Color and Deformable Model
Journal of Internet Computing and Services, volume 3, issue 6, 2002, Pages 13~24
This paper presents an automatic approach to detect face and facial feature from face images based on the color information and deformable model. Skin color information has been widely used for face and facial feature diction since it is effective for object recognition and has less computational burden, In this paper, we propose how to compensates varying light condition and utilize the transformed YCbCr color model to detect candidates region of face and facial feature from color images, Moreover, the detected face facial feature areas are subsequently assigned to a initial condition of active contour model to extract optimal boundaries of face and facial feature by resolving initial boundary problem when the active contour is used, The experimental results show the efficiency of the proposed method, The face and facial feature information will be used for face recognition and facial feature descriptor.
Design of P2P Server System to execute Dynamic Distribution Policy
Journal of Internet Computing and Services, volume 3, issue 6, 2002, Pages 25~33
The efficiency of the data share service of P2P method is decided by the maintaining guard method of a sharing list, This paper suggests the data sharing system of the P2P base that it should retain a shared data list at a client, The Server at a proposed system guards inclusively client. divided into several groups and at each individual group, a client appointed the TopHost uses the method guarding a free share list of a applicating group, The TopHost designs to execute it relating with server in case of the mergence and the division of a group as well as a maintaining management of a data share list, The efficiency of the suggested system regard the maintaining guard of groups formed of a client of the appropriate level of a kernel and exams examination to measure it through a really executed data share service.
A Self-adjusting CN(Car Navigation) Algorithm on Digital Map using Traffic and Directional Information
Journal of Internet Computing and Services, volume 3, issue 6, 2002, Pages 35~41
The Car Navigation System(CNS) requires lots of memory and calculating time because it works on the large and complex digital map. And the traffic circumstances vary time by time, so the traffic informations should be processed if we want to get mere realistic result. This paper proposes an effective path searching algorithm which uses less memories and calculating time by applying directional information between the starting place and destination place and by using realtime traffic informations.
A Packet Dropping Algorithm based on Queue Management for Congestion Avoidance
Journal of Internet Computing and Services, volume 3, issue 6, 2002, Pages 43~51
In this paper, we study the new packet dropping scheme using an active queue management algorithm. Active queue management mechanisms differ from the traditional drop tail mechanism in that in a drop tail queue packets are dropped when the buffer overflows, while in active queue management mechanisms, packets may be dropped early before congestion occurs, However, it still incurs high packet loss ratio when the buffer size is not large enough, By detecting congestion and notifying only a randomly selected fraction of connection, RED causes to the global synchronization and fairness problem. And also, it is the biggest problem that the network traffic characteristics need to be known in order to find the optimum average queue length, We propose a new efficient packet dropping method based on the active queue management for congestion control. The proposed scheme uses the per-flow rate and fair share rate estimates. To this end, we present the estimation algorithm to compute the flow arrival rate and the link fair rate, We shows the proposed method improves the network performance because the traffic generated can not cause rapid fluctuations in queue lengths which result in packet loss
The Dynamic load Balancing Algorithm Method for Heterogeneous Distributed Systems
Journal of Internet Computing and Services, volume 3, issue 6, 2002, Pages 53~61
This paper propose an dynamic load balancing algorithm for heterogeneous distributed systems. The algorithm allows this tasks to be relocated. The key of the algorithm is to transfer a suitable amount of processing demand from senders to receivers. This amount is determined dynamically during sender-receiver negotiations. Factors considered when this amount is determined include processing speeds of different nodes, the current load state of both sender and receiver, and the processing demands of tasks eligible for relocation. This paper also propose a load state measurement scheme which is designed particularly for heterogeneous systems. This results of the study show that the proposed algorithm outperforms the existing algorithms and is stable over a range of system attributes.
Design and Implementation of a Web Contents Management System based on XML Components
Journal of Internet Computing and Services, volume 3, issue 6, 2002, Pages 63~77
Recently, roost of the companies have, utilized internet with the purpose of business. According to this tendency, each company is exchanging various information and offering services of e-business through Web-Site. Contents on Web-Site are getting huge and the period of contents renewal is getting short. Consequently, each company is faced with many problems for the contents management because of specialization and fractionation of contents. A contents management system that creates, maintains and manages efficiently and conveniently contents on Web-Site toward solving these problems is very required. in this paper, we design and implement such a web contents management system. It also supports dynamic web page publication based on the XML components.
A Certification Protocol based on Broadcast Invalidation Approach
Sung-Ho Cho ; Min-Goo Kang ;
Journal of Internet Computing and Services, volume 3, issue 6, 2002, Pages 79~89
The performance of OCC is very sensitive to the transaction abort rate, Even if the abort probability can be reduced by re-ordering, most of re-ordering schemes have space overhead in maintaining a graph or histories, In this paper, we proposed an efficient re-ordering scheme based on a broadcast invalidation mechanism. Our scheme, called CBI, can reduce the abort probability without space overhead in maintaining a graph or histories, By simulation studies, we showed that CBI reduced the abort rate and unnecessary operations, Additionally, we showed that CBI outperforms not only BTS but also TSH with low space overhead.