Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Computational Science and Its Applications, 2009. ICCSA '09. International Conference on

Date June 29 2009-July 2 2009

Filter Results

Displaying Results 1 - 25 of 44
  • [Front cover]

    Publication Year: 2009 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (261 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (20 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (57 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (104 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009 , Page(s): v - vii
    Save to Project icon | Request Permissions | PDF file iconPDF (155 KB)  
    Freely Available from IEEE
  • Conference Information

    Publication Year: 2009 , Page(s): viii - xi
    Save to Project icon | Request Permissions | PDF file iconPDF (89 KB)  
    Freely Available from IEEE
  • Finding Frequent Structures in XML Stream Data

    Publication Year: 2009 , Page(s): 3 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (302 KB) |  | HTML iconHTML  

    The XML data of continuous stream type are popular in network application through the Internet. And also there are researches related to query processing for streaming XML data. As a basic research to efficiently query, we propose not only a labeled ordered tree model representing the XML but also a mining method to extract frequent structures from streaming XML data. That is, XML data to continuously be inputted are modeled by a stream tree which is called XFP_tree and we exactly extract the frequent structures from the XFP_tree of current window to mine recent data. The proposed method can be applied to the basis of the query processing and index method for XML stream data. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic Entropy Optimization of Social Networks Using an Evolutionary Algorithm

    Publication Year: 2009 , Page(s): 9 - 16
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (774 KB) |  | HTML iconHTML  

    We design and apply a Genetic Algorithm that maximizes the cyclic-entropy of a social network model, hence optimizing its robustness to failures. Our algorithm was applied on three types of social networks: scale-free, small-world and random networks. The three types of networks were generated using Barabasi and Albertpsilas generative model, Watts and Strogatzpsilas model and Erdos-Renyipsilas model, respectively. The maximum optimal entropy achieved among all three types was the one displayed by the small-world network, which was equal to 2.6887, corresponding to an optimal network distribution found when the initial distribution was subject to 11 random edge removals and 19 additions of random edges regardless of the initial distribution. The random-network model came next with optimal entropy equal to 2.5692, followed by the scale-free network which had optimal entropy of 2.5190. We observed by keeping track of the topology of the network and the cyclespsila length distribution within it, that all different types of networks evolve almost to the same network, possibly a random network, after being subject to the cyclic-entropy optimization algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contemporary Classification on Medical Data based on Non-Linear Feature Extraction

    Publication Year: 2009 , Page(s): 17 - 23
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (250 KB) |  | HTML iconHTML  

    High dimensional data in several applications seriously spoils classification computation of several types of learning. In order to relieve the difficulties of such a high dimension, this paper proposes the classification computation, which refers to a modified neural network: the neural network with weights optimized by particle swarm intelligence. The contemporary is placed on the combination of the non-linear feature extraction and such a classification method. 10-fold cross-validation experiments of each method are performed on five medical data sets. The results indicate not only the improvement of classification based on non-linear feature extraction, but also indicate the reduction of the number of features for classification. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proposal of Service System for Ubiquitous Learning System on Adaptive Instructional System

    Publication Year: 2009 , Page(s): 24 - 28
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (740 KB)  

    The purpose of this study addresses service model for enhancement u-learning systempsilas utilization on adaptive instruction system. Proposed service model include two systems. The one is the U-book system and the other is the preWBI system. Proposed service model should be able to retrieve information without ubiquitous computing technology and to access on line contents unless location of them. Under more individualized instruction environment, proposed service model support maximum utilization of u-learning system for adaptive instruction system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Handover for Mobile IPv6 over IEEE 802.16e Networks

    Publication Year: 2009 , Page(s): 29 - 33
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (257 KB) |  | HTML iconHTML  

    IEEE 802.16e adds mobility support to the IEEE 802.16 standard so that terminals can move while receiving services and preserve ongoing IP sessions during handover. IP layer handover for MSs is handled by MIPv6. The cross-layer scheme supports seamless handover by exploiting the link layer handover indicator and designing interleaving scheme of the 802.16e and the FMIPv6 handover procedures. We propose an optimized cross-layer scheme supporting fast handover for MIPv6 over IEEE 802.16e environment. We evaluate the performance of the original scheme and the proposed scheme in terms of the signaling cost and handover latency by using the packet-level traffic model, system mode land mobility model. From the results of the performance evaluation, we can expect that the proposed scheme supports fast handover for MIPv6 insusceptible of the new address confirmation latency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis for FMIPv6 Considering Probability of Predictive Mode Failure

    Publication Year: 2009 , Page(s): 34 - 38
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (302 KB) |  | HTML iconHTML  

    Mobile IPv6 (MIPv6) is a protocol to support mobility for IPv6. Fast Handovers for MIPv6 (FMIPv6) have been studied, since in MIPv6 handover latency is long, and all packets are lost during handover. FMIPv6 provides seamless handover by minimizing handover latency, and prevents packet loss through buffering and tunneling. FMIPv6 uses anticipation based on layer 2 trigger information, and consists of two modes such as predictive mode and reactive mode. Several works have been done to evaluate the performance of FMIPv6 in different network environments. However, the previous works did not consider probability of predictive mode failure that classifies the two modes. Also, in the most previous works the two modes of FMIPv6 are evaluated separately. In this paper, FMIPv6 combining the two modes is analyzed through probability of predictive mode failure, since FMIPv6 is just a protocol. We investigate probability of predictive mode failure to find important elements in network environment. Then, FMIPv6 is analyzed by these elements for performance evaluation with respect to various metrics like signaling cost, delivery cost, and buffering cost. Numerical results show a trade-off between performance and system parameters. Then, we shows methods to optimize FMIPv6 using probability of predictive mode failure and layer 2 trigger time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced Fast Handovers for Proxy Mobile IPv6

    Publication Year: 2009 , Page(s): 39 - 43
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (397 KB) |  | HTML iconHTML  

    The Internet Engineering Task Force (IETF) has standardized Proxy Mobile IPv6 (PMIPv6). Fast Handovers for Proxy Mobile IPv6 (PFMIPv6) was studied by mipshop working group to reduce packet loss in PMIPv6. PFMIPv6 is fast handover extension of PMIPv6. PFMIPv6 handover latency is longer than PMIPv6, although it reduces packet loss in PMIPv6. In this paper, we propose Enhanced PFMIPv6 to reduce handover latency. In the proposed scheme, the Proxy Binding Update (PBU) message is sent to Local Mobility Agent, in advance, when new mobile access gateway (NMAG) receives the Handover Initiate (HI) message. The HI message includes necessary information to build PBU. We analyze the performance of EPFMIPv6 compared with PMIPv6 and PFMIPv6 mathematically. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Cloud Market Infrastructure for Trading Service

    Publication Year: 2009 , Page(s): 44 - 50
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (424 KB) |  | HTML iconHTML  

    In this paper, we present a novel combinatorial auction (CA) based trading infrastructure to enable the supply and demand of Cloud services from different Cloud providers (CP). We propose a new auction policy that considers the relationship among CPs (mutual business relationship) in bidding mechanism. In our new auction-based market model, we allow the group of service providers to publish their bids collaboratively as a single bid to the auctioneer. It gives service providers a chance to autonomously find partners and make groups. Then they can use group strategy to increase their competitive power and compete for winning the bid (s). This will reduce conflicts, as well as collaboration cost and negotiation time, among participants as compare to existing CA-based market model. We implement our proposed market model of trading service in a simulated environment and study its economic efficiency with existing model. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Process Mining Based on Specification Slicing for Dynamic Reconfiguration

    Publication Year: 2009 , Page(s): 51 - 55
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (887 KB) |  | HTML iconHTML  

    Companies faced with rapid changes in market environment and uncertain demands of consumers are actively making investments in the information system and it is expediting the growth of the market for workflow which automates the work process. The concept of workflow mining is required for designing and supporting the business process focusing on productivity enhancement. The existing workflow mining technology was designed to extract business process redesign information from simple database fields or create a process model by collecting, identifying, and analyzing log information from the system that it could not be dynamically reconfigured by exploring the process flow suitable for new requests made on business process. This study suggests data extraction algorithm helpful to dynamic reconfiguration by analyzing semantic relationship based on specification slicing technique so that the new service requests given by the user are dynamically reflected in the initial workflow scenario without interrupting the workflow service in operations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Path Indexes to Answer Complex Queries in Ontology Repository

    Publication Year: 2009 , Page(s): 56 - 61
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (370 KB) |  | HTML iconHTML  

    The ontology repository has widely been used for storing and querying over ontology data. Recently the ontology repository gets more attentions as a component of ubiquitous systems. This paper describes use of the path index to answer complex queries in ontology repository. Studies show that two types of queries namely chain queries and star queries frequently occur in SPARQL queries. Instead of using join operations over several triple indexes, we proposed to use path indexes for such queries, which in turn improve the query performance reducing the number of multiple join operations. Our experiments show that the proposed method enhances the query performance than using only indexes based on single triple pattern. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Handover Scheme Based on Mobile Locations for IEEE 802.16e Networks

    Publication Year: 2009 , Page(s): 62 - 67
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (316 KB) |  | HTML iconHTML  

    The IEEE 802.16 is developed for fixed broadband wireless technology with wider coverage, higher data transmission speeds and excellent quality of services (QoS). IEEE 802.16e is an amendment to the IEEE 802.16 that corporates the handover process to support mobility under high speeds. The mobility user basically conducts hard handover process after the MS terminates the connection with the serving base station (BS). During handover process, mobile station (MS) releases its connections with serving BS, and sets up connections with the target BS. It can cause the serious problems that user suffer traffic interruption, packet delay and loss during handover process. To resolve this problem, we propose a scheme for reducing unnecessary association procedure by evaluating mobile locations. The proposed scheme offers application QoS requirements and can reduce the total handover latency. Simulation results show that the proposed scheme has better performance than the conventional method in terms of the packet transmission delay and scanning time; hence, they can reduce handover latency up to 60%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental and SQL-Based Data Grid Mining Algorithm for Mobility Prediction of Mobile Users

    Publication Year: 2009 , Page(s): 71 - 78
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (293 KB) |  | HTML iconHTML  

    In this paper, we propose a new SQL based incremental distributed algorithm for predicting the next location of a mobile user in a mobile Web environments. Parallel and distributed data mining algorithm is applied on moving logs stored in geographically distributed data grid to generate the mobility pattern, which provides various location based services to the mobile users. One of the existing works for deriving mobility pattern is re-executing the algorithm from scratch results in excessive computation. In our work, we have designed new incremental algorithm by maintaining infrequent mobility patterns, which avoids unnecessary scan of full database. We built data grid system on a cluster of workstation using open source Globus Toolkit (GT) and message passing interface extended with grid services (MPICH-G2). The experiments were conducted on original data sets with incremental addition of data and the computation time was recorded for each data sets. We analyzed our results with various sizes of data sets and it shows the time taken to generate mobility pattern by incremental mining algorithm is less than re-computing approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Implementation of Networking Virtualization for Cluster File Systems

    Publication Year: 2009 , Page(s): 79 - 83
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (323 KB) |  | HTML iconHTML  

    An effective network layer which reduces cluster file system complexity is definitely needed in cluster computing environments where more than thousands of nodes are connected on a variety of different networks. Therefore, widely used cluster file systems such as Lustre, PVFS2, and GlusterFS provide networking virtualization layer. Through networking virtualization layer, each node accesses other nodes using a single interface over a variety of networks. However, previous networking virtualization technologies are complicated and not portable. In this paper, we propose a simple, portable, and socket-like networking virtualization layer that operates on user-mode. We also evaluate our virtualization layer using benchmark tools. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Demand Paging Performance of Compressed Filesystem with NAND Flash Memory

    Publication Year: 2009 , Page(s): 84 - 88
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (329 KB) |  | HTML iconHTML  

    Demand paging with NAND flash memory is an attractive memory management technique for embedded system because of its cost efficiency. However, demand paging has the page fault handling latency. To overcome this drawback, most operating systems take advantage of kernel-level read-ahead. On the contrary, in the compressed filesystem, kernel-level read-ahead degrades performance of demand paging. The main reason is that compressed filesystem has too large read-ahead miss penalty due to decompression overhead. To solve this problem, this paper proposes the conservative read-ahead technique, which improves demand paging performance of compressed filesystem. Proposed technique improves read throughput of device by bulk read from device and reduces decompression overhead of compressed filesystem by selective decompression. We implement conservative read-ahead technique by modifying CramFS and evaluate our implementation in the Linux kernel 2.6.21. Performance evaluation results show that proposed technique reduces the average major page fault handling latency by 28%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selective Context Switching on Flash Memory

    Publication Year: 2009 , Page(s): 89 - 94
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (343 KB) |  | HTML iconHTML  

    Flash memory prevails as a mobile storage device because it offers a fast read access time and better shock resistance compared to a hard disk. However, generic operating systems such as Linux do not take advantages of the hardware performance of flash memory because they do not change the architectures which are optimized for hard disks. The existing operation systems switch contexts to handle requests upon every device activation. If Linux switches contexts with every request when using hard disks as storage devices,the context switching time is not burdened compared to its total I/O time. However, in the event that Linux uses flash memory as a storage device, the context switching time becomes greatly burdened due to its fast access time. This paper improves the context switching scheme by reducing the amount of unnecessary context switching. As a result,an overall performance increase of 5% is gained regardless of the workloads. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study of Super Nonlinear Motion of a Simple Pendulum and its Generalization

    Publication Year: 2009 , Page(s): 97 - 103
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (389 KB) |  | HTML iconHTML  

    Two identically charged simple pendulums are dropped symmetrically about their common pivot in a vertical plane. For a set of parameters associated with each pendulum namely {mass,charge, and length} we evaluate the critical angle at which the forces acting on each pendulum are null resulting a static equilibrium. We then consider two dynamic non-equilibrium cases. In the absence of friction we analyze the features of steady oscillations of the pendulums resulting from setting the initial swing angles larger and then smaller than the critical angle. In each case, for a set of initial angles we evaluate the optimum separation angles of the charges and their corresponding acquired traversed times. For a comprehensive visual understanding we utilize Mathematica animation and display the features of the oscillations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Degeneracy Conditions for Tri-modular Simple K3 Singularities

    Publication Year: 2009 , Page(s): 104 - 108
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (164 KB) |  | HTML iconHTML  

    Defining equations of tri-modular simple K3 singularities are 7 types. The defining equations of simple K3 singularities are polynomials with parameter coefficients. We can obtain degeneracy conditions of these singularities by using computer algebra system. The forms of Groebner bases generated by polynomials depend on the values of parameters, and those calculations are not easy. In this paper, we try to decide the degeneracy conditions of tri-modular simple K3 singularities. And we show examples of the calculations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of a Graphical User Interface for LaTeX Plotting Software KETpic

    Publication Year: 2009 , Page(s): 109 - 114
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (413 KB) |  | HTML iconHTML  

    KETpic is a macro package for computer algebra system (CAS) to convert plot data created by CAS to LaTeX picture data. We are able to draw fine pictures in LaTeX documents with aid of KETpic. At the present stage, KETpic packages for Maple, Mathematica, Scilab and Maxima are opened to the public and the number of people who gain benefits of KETpic is increasing. However the only way to produce LaTeX picture data is to enter commands on CAS. In order for as many people as possible to use KETpic more intuitively, we have started developing a graphical user interface (GUI) for KETpic. GUI is implemented by Maplets package of Maple. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of ImplicitPlot in Drawing Surfaces Embedded into LATEX Documents

    Publication Year: 2009 , Page(s): 115 - 122
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (230 KB) |  | HTML iconHTML  

    KETpic is a macro package of computer algebra systems(CAS) that allows us to insert figures easily into LATEX documents. As such, KETpic can also be used to generate surfaces. But because surfaces appear flat both on the screen and in printed form, shading is often used to emphasize their inherent three-dimensional nature. Unfortunately, this solution is no longer valid in KETpic, as it generates figures in black-and-white only. In this paper, we outline some techniques to yield line drawing pictures of surfaces by using plot data obtained from implicit functions of two variables. The paper discusses some theoretical issues regarding the use of the ImplicitPlot command for drawing surfaces and describes the implementation of our results by means of several illustrative examples. As the reader will see, we obtain very nice figures that can readily be embedded into our LATEX documents in order to yield educational materials as well as professional printouts of scientific documents. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.