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 5, Issue 6 - Dec 2004
Volume 5, Issue 5 - Oct 2004
Volume 5, Issue 4 - Oct 2004
Volume 5, Issue 3 - Jun 2004
Volume 5, Issue 2 - Apr 2004
Volume 5, Issue 1 - Feb 2004
Selecting the target year
GWB: An integrated software system for Managing and Analyzing Genomic Sequences
Kim In-Cheol ; Jin Hoon ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 1~15
In this paper, we explain the design and implementation of GWB(Gene WorkBench), which is a web-based, integrated system for efficiently managing and analyzing genomic sequences, Most existing software systems handling genomic sequences rarely provide both managing facilities and analyzing facilities. The analysis programs also tend to be unit programs that include just single or some part of the required functions. Moreover, these programs are widely distributed over Internet and require different execution environments. As lots of manual and conversion works are required for using these programs together, many life science researchers suffer great inconveniences. in order to overcome the problems of existing systems and provide a more convenient one for helping genomic researches in effective ways, this paper integrates both managing facilities and analyzing facilities into a single system called GWB. Most important issues regarding the design of GWB are how to integrate many different analysis programs into a single software system, and how to provide data or databases of different formats required to run these programs. In order to address these issues, GWB integrates different analysis programs byusing common input/output interfaces called wrappers, suggests a common format of genomic sequence data, organizes local databases consisting of a relational database and an indexed sequential file, and provides facilities for converting data among several well-known different formats and exporting local databases into XML files.
A Mobile Multicast Routing Mechanism based on the Comparison of Tree Reconstruction Cost and Tunneling Cost
Kim Jae-Soo ; Baek Deuk-Hwa ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 17~26
Mobile multicast schemes are classified into remote subscription and bi-directional tunneling. While the former scheme has much overhead in the maintenances of multicast tree, the latter suffers from inefficient routing. In this paper, we propose dynamic mobile multicast routing (DMMR) scheme, which is operated on the basis of cost functions related with forwarding cost and tree reconstruction cost, Basically DMMR intends to find lower cost between forwarding cost and tree reconstruction cost. Forwarding cost is the cost of tunneling multicast packets from home agent, and tree reconstruction cost is the joining cost of foreign agent to multicast group. In the case that a mobile host moves to the other area, its foreign agent calculates cost functions related with forwarding cost and tree reconstruction cost. If forwarding cost is higher than tree reconstruction cost, foreign agent joins to multicast group and reconstructs the multicast tree. Accordingly, foreign agent can dynamically adapt remote subscription or bi-directional tunneling, Our scheme provides more stable multicast service to the mobile hosts regardless of the movements of mobile host and the number of mobile group members.
A Novel K-hop Cluster-based Ad hoc Routing Scheme with Delegation Functions
Kim Tae-yeon ; Wang Ki-cheoul ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 27~37
The existing ad hoc network protocols suffer the scalability problem due to the inherent characteristics of node mobility. Cluster-based routing protocols divide the member nodes into a set of clusters and perform a hierarchical routing between these clusters. This hierarchical feature help to improve the scalability of ad hoc network routing. However, previous k-hop cluster-based routing protocols face another problems, that is, control overhead of the cluster headers. This paper proposes a novel k-hop cluster-based routing scheme with delegation functions for mobile ad hoc networks. The scheme employs is based on tree topology to manage cluster members in effectively. The cluster headers do not manage the routing table for whole members, while the header keeps the routing table for its neighbor members and the member list for one hop over nodes within k-hop cluster. Then the in-between leveled nodes manage the nested nodes which is structured in the lower level. Therefore, the proposed mechanism can reduce some control overhead of the cluster leaders.
An Efficient Online RTP Packet Classification Method for Traffic Management In the Internet
Roh Byeong-hee ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 39~48
For transporting real-time multimedia traffic, RTP is considered as one of the most promising protocols operating at application layer. In order to manage and control the real-time multimedia traffic within networks, network managers need to monitor and analyze the traffic delivering through their networks. However, conventional traffic analyzing tools can not exactly classify and analyze the real-time multimedia traffic using RTP on the basis of real-time as well as non-real-time operations. In this paper, we propose an efficient online classification method of RTP packets, which can be used on high-speed network links. The accuracy and efficiency of the proposed methodhave been tested using captured data from a KIX node with 100 Mbps links, which interconnects between domestic and overseas Internet networks and is operated by NCA.
An Attack Model Based on Software Cruise for Information Warfare
Ryu Ho-Yeon ; Nam Young-Ho ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 49~60
Information Warfare(IW), a new aspect of war, is the field centralized the concern and research in the information security and national security, Both the defense and the offensive are important in the next generation IW, and so we need to do the various research to secure the network and system for gaining the superiority of IW. This paper proposes a model for IW based on software cruise to prepare the IW that is changing the offensive aspect. Software cruise is defined as a behavior of computer programs that travel toward specific destination from a source through the network. The proposed model have the cruise property and uses the cybermap to cruise toward the destination chosen in advance. Also, while self-movement, the model can function the predefined task.
Performance Modeling of Multibuffered Multistage Interconnection Networks under Nonuniform Traffic Pattern with Small Clock Cycle Schemes
Mun Youngsong ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 61~68
In this paper, a more accurate model than any other ones so far have been proposed for the performance evaluation of muntibuffered banyan-type Multistage Interconnection Networks(MINs)'s under nonuniform traffic condition is obtained. Small clock cycle instead of big clock cycle is used to improve the performance. The accuracy of the proposed model is conformed by comparing with the results from simulation.
Reliable Information Search mechanism through the cooperation of MultiAgent in Distributed Environment
Park Min-Gi ; Kim Cui-Tae ; Lee Jae-Wan ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 69~77
As the internet is widely distributed. the intelligent search agent is commonly used to meet the needs of user. But these Intelligent multi-agents are so independent each other that they can not give reliability of information and also have difficulty in coping with the dynamic distributed environments due to the short of cooperation abilities among multiagent. To resolve these problems. this paper proposes the mechanism for efficient cooperation and information processing by creating agency within broker agent and clustering multi agent's agency using neural network. For reliability of information. we also propose the multiagent management mechanism that can improve the information update problems which are in existing search systems and evaluate the performance of this research through simulation.
Realistic Avatar Face Generation Using Shading Mechanism
Park Yeon-Chool ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 79~91
This paper proposes avatar face generation system that uses shading mechanism and facial features extraction method of facial recognition. Proposed system generates avatar face similar to human face automatically using facial features that extracted from a photo. And proposed system is an approach which compose shade and facial features. Thus, it has advantages that can make more realistic avatar face similar to human face. This paper proposes new eye localization method, facial features extraction method, classification method for minimizing retrieval time, image retrieval method by similarity measure, and realistic avatar face generation method by mapping facial features with shaded face pane.
An Analysis of Intrusion Pattern Based on Backpropagation Algorithm
Woo Chong-Woo ; Kim Sang-Young ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 93~103
The main function of the intrusion Detection System (IDS) usee to be more or less passive detection of the intrusion evidences, but recently it is developed with more diverse types and methodologies. Especially, it is required that the IDS should process large system audit data fast enough. Therefore the data mining or neural net algorithm is being focused on, since they could satisfy those situations. In this study, we first surveyed and analyzed the several recent intrusion trends and types. And then we designed and implemented an IDS using back-propagation algorithm of the neural net, which could provide more effective solution. The distinctive feature of our study could be stated as follows. First, we designed the system that allows both the Anomaly dection and the Misuse detection. Second, we carried out the intrusion analysis experiment by using the reliable KDD Cup ‘99 data, which would provide us similar results compared to the real data. Finally, we designed the system based on the object-oriented concept, which could adapt to the other algorithms easily.
Design and Implementation of Ontology Decision Support system Based on XML
Im Young-Tae ; Kim Chang-soo ; Jung Hoe-Kyung ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 105~117
As the organization has been coming to specialization and systematization, meetings have been holding for communication among members and deduction of rational outcome. Also process of meeting procedure has been developing. Those on-line meetings are getting grown because the on-line meetings with messenger and chatting are the best examples for overcoming space limitation problem. But, the on-line meetings have unavoidable weak points. The more a meeting is processed, the more point of argument is out of focus and perception of current situation is reduced. Therefore, this thesis proposes and describe that in introduction, think that pre-defined things, analysis and direction of Ontology, in body, draw up a plan how to make ontology to knowledge, and, how to get out of bounds limitation that as make ontology to knowledge. And, design and implementation actual system that organize this ontological Knowledge, and then managing and summarizing visualizing them. Also, in conclusion, after remark and consider this system in which using the ontology based on XML, and proposes conculsion and directional development point.
A Threaded Tree Construction Algorithm not Using Stack
Lee Dae-Sik ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 119~127
As, the development of language-based programming environment, a study on incremental parsing has become an essential part. The purpose of this paper is to show the more efficient incremental parsing algorithm than earlier one that demands parsing speed and memorizing space too much. This paper suggests the threaded tree construction algorithm not using stack. In addition, to remove the reparsing process, it proposes the algorithm for creation node and construction incremental threaded tree not using stack.
A Study of Multicast Tree Problem with Multiple Constraints
Lee Sung-Ceun ; Han Chi-Ceun ;
Journal of Internet Computing and Services, volume 5, issue 5, 2004, Pages 129~138
In the telecommunications network, multicasting is widely used recently. Multicast tree problem is modeled as the NP-complete Steiner problem in the networks. In this paper, we study algorithms for finding efficient multicast trees with hop and node degree constraints. Multimedia service is an application of multicasting and it is required to transfer a large volume of multimedia data with QoS(Quality of Service). Though heuristics for solving the multicast tree problems with one constraint have been studied. however, there is no optimum algorithm that finds an optimum multicast tree with hop and node degree constraints up to now. In this paper, an approach for finding an efficient multicast tree that satisfies hop and node degree constraints is presented and the experimental results explain how the hop and node degree constraints affect to the total cost of a multicast tree.