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 4, Issue 6 - Dec 2003
Volume 4, Issue 5 - Oct 2003
Volume 4, Issue 4 - Aug 2003
Volume 4, Issue 3 - Jun 2003
Volume 4, Issue 2 - Apr 2003
Volume 4, Issue 1 - Feb 2003
Selecting the target year
Design Driven Testing on Adaptive Use Case Approach for Real Time System
Kim Young-Chul ; Joo Bok-Gyu ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 1~11
This paper is introduced about Design driven testing, for real time system, based on use case approaches, We focuses on a part of an extended use case approach for real time software development, which partitions design schema into layered design component architecture of functional components called "design component", We developed a use case action matrix to contain a collection of related scenarios each describing a specific variant of an executable sequence of use case action units, which reflected the behavioral properties of the real time system design, in this paper, we attempt to apply real time system with design driven testing with test plan metrics which is introduced which produces an ordering of this scenario set to enhance productivity and both promote and capitalize on test case reusability of existing scenarios.scenarios.
An Optimal and Dynamic Monitoring Interval for Grid Resource Information Services
Kim Hye-Ju ; Huh Eui-Nam ; Lee Woong-Jae ; Park Hyoung-Woo ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 13~24
Grid technology requires use of geographically distributed resources from multiple domains. Resource monitoring services or tools consisting sensors or agents will run on many systems to find static resource information (such as architecture vendor, OS name and version, MIPS rate, memory size, CPU capacity, disk size, and NIC information) and dynamic resource information (CPU usage, network usage(bandwidth, latency), memory usage, etc.). Thus monitoring itself may cause system overhead. This paper proposes the optimal monitoring interval to reduce the cost of monitoring services and the dynamic monitoring interval to measure monitoring events accurately. By employing two features, we find out unnecessary system overhead is significantly reduced and accuracy of events is still acquired.
Enhanced Cube Network for the High Reliability
Mun Youngsong ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 25~31
Multistage Interconnection networks (MIN) for the high performance computing and communications must be efficient and reliable. While a number of fault tolerance schemes have been developed, some of them are not efficient enough with respect to all evaluation measures or overheads of others are too significant. In this paper we develop a new efficient fault tolerant MIN which displays high reliability and fault tolerance capability using a simple structure. Structure and reliabilities of Enhanced Cube Network are evaluated and compared with previous designs to show the effectiveness of new design.
A XML Instance Repository Model based on the Edge-Labeled Graph
Kim Jeong-Hee ; Kwak Ho-Young ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 33~42
A XML Instance repository model based on the Edge-Labeled Graph is suggested for storing the XML instance in Relational Databases, This repository model represents the XML instance as a data graph based on the Edge-Labeled Graph, extracts the defined value based on the structure of data path, element, attribute, and table index table presented as database schema, and stores these values using the Mapper module, In order to support querry, XML repository model offers the module translating XQL which is a query language under XPATH to SQL, and has DBtoXML generator module restoring the stored XML instance. As a result, it is possible to represent the storage relationship between the XML instances and the proposed repository model in terms of Graph-based Path, and it shows the possibility of easy search of specific element and attribute information.
A Workcase Mining Mechanism using Activity Dependency
Kim Sang-Bae ; Kim Hak-Seong ; Paik Su-Ki ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 43~55
Workflow mining is a newly emerging research issue for rediscovering and reengineering workflow models from workflow logs containing information about workflows being executed on the workflow engine. In this paper, we proposed workcase mining which was used dependency among activities. Main purpose of this paper is to minimize discrepancies between the modeled workflow process and the enacted workflow process as it is actually being executed. That is, we can get a complete set of activity firing sequences on buildtime. Besides, we can discover from workflow logs that which path out of all reachable paths a workcase has actually followed through on runtime. For this purpose we proposed two algorithm, the one is 'Activily-Dependent Net Algorithm' and the other is 'E-Walk Series Analysis Algorithm'.
Detection of Facial Direction using Facial Features
Park Ji-Sook ; Dong Ji-Youn ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 57~67
The recent rapid development of multimedia and optical technologies brings great attention to application systems to process facial Image features. The previous research efforts in facial image processing have been mainly focused on the recognition of human face and facial expression analysis, using front face images. Not much research has been carried out Into image-based detection of face direction. Moreover, the existing approaches to detect face direction, which normally use the sequential Images captured by a single camera, have limitations that the frontal image must be given first before any other images. In this paper, we propose a method to detect face direction by using facial features such as facial trapezoid which is defined by two eyes and the lower lip. Specifically, the proposed method forms a facial direction formula, which is defined with statistical data about the ratio of the right and left area in the facial trapezoid, to identify whether the face is directed toward the right or the left. The proposed method can be effectively used for automatic photo arrangement systems that will often need to set the different left or right margin of a photo according to the face direction of a person in the photo.
Performance Evaluation of a Switching System for Metropolitan Area Networks
Mun Youngsong ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 69~73
ATM and Ethernet are desirable transport mechanisms for the realization MAN(Metropolitan Area Networks). A relatively small sized switching system for MAN based on ATM is proposed and its performance is evaluated in this paper. For the performance evaluation, traffics should be firstly modeled because they are highly bursty. By varing the ratio of VBR traffics, detrimental effect of VBR traffics may be observed. Traffic load at each input port is also varied, From the results of simulation, operation conditions of the system to meet required QoS are obtained.
IpCSB+ - tree : An Enhanced Main Memory Index Structure Employing the Level Prefetching Technique
Hong Hyun-Taek ; Kang Tae-Ho ; Yoo Jae-Soo ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 75~86
In main-memory resident index structures, secondary cache misses considerably have an effect on the performance of index structures. Recently, several main-memory resident index structures that consider cache have been proposed to reduce the impact of secondary cache misses. However they still suffer from full secondary cache misses whenever visiting each level of a index tree, In this paper, we propose a new index structure that eliminates cache misses even when visiting each level of index tree. The proposed index structure prefetches the grandchildren of a current node. The basic structure of the proposed index structure is from CSB+-tree that uses the concepts of the node group to increase fan-out. However the insert algorithm of the proposed index structure reduces the cost of a split significantly, Also, we show the superiority of our algorithm through various performance evaluation.
A Design of Update Propagation Algorithm for Replica Consistency of Transaction
Lee Byung-Wook ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 87~93
Data Replication makes distributed system and database system improved in availability and performance. But it is difficult to keep strict consistency in data update. Existing algorithms keep strict consistency, but have problems of cost a great deal and delay time. It is to introduce hybrid update propagation algorithm which permits eager update for original copy and propagates lazy update for other copies. Hybrid update propagation algorithm also permits group update in ownership. This algorithm menages replica version in order to control group update consistency. Consistency and performance is improved by combining eager update and lazy update with group ownership. Simulation shows improvement of transaction throughput and response time depending on application and execution environment.
An Enhancement of Simple Authenticated Key Agreement Protocol
Kim Young-Sin ; Kim Yoon-Jeong ; Hwang Jun ;
Journal of Internet Computing and Services, volume 4, issue 6, 2003, Pages 95~102
The Diffle-Hellman Key Exchange scheme can produce a common session key between the two communicators, but its problem is that it makes a man-in-the middle attack possible. To solve problems like these, several protocols have been put forward, and the Simple Authenticated Key Agreement (SAKA) Protocol is among them. This protocol has been suggested by Seo-Sweeney, Tseng, and Ku-Wang, respectively, In this paper, we will put forward a new protocol that has been improved from all the original protocols mentioned above, but is still safe and quick to use, While the existing protocol divides the common session key production stage and the verification stage, the protocol suggested in this paper takes care of both of those stages simultaneously, therefore improving the processing performance.