By Topic

Intensive Applications and Services, 2009. INTENSIVE '09. First International Conference on

Date 20-25 April 2009

Filter Results

Displaying Results 1 - 22 of 22
  • [Front cover]

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

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

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

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

    Page(s): v - vi
    Save to Project icon | Request Permissions | PDF file iconPDF (163 KB)  
    Freely Available from IEEE
  • Preface

    Page(s): vii - viii
    Save to Project icon | Request Permissions | PDF file iconPDF (69 KB)  
    Freely Available from IEEE
  • Committees

    Page(s): ix - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (80 KB)  
    Freely Available from IEEE
  • list-reviewer

    Page(s): xiii - xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (79 KB)  
    Freely Available from IEEE
  • Dynamic Policy Conflict Analysis in Operational Intensive Trust Services for Cross-Domain Federations

    Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (267 KB) |  | HTML iconHTML  

    Management of trust for federation activities requires intensive monitoring and reconfiguration services to accommodate dynamic trust behaviors across trust domains. To detect and control potential conflicts between these behaviors, trust services in federation systems need to be able to perform dynamic conflict analysis. Policy analysis provides a way to detect potential conflicts in system behaviors. We introduce event calculus (EC) into policy analysis to provide dynamic policy conflict analysis for detection and control of dynamic conflicts in trust services for federations. An application of this dynamic analysis to a Web-service-based healthcare system is also described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accelerating K-Means on the Graphics Processor via CUDA

    Page(s): 7 - 15
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (290 KB) |  | HTML iconHTML  

    In this paper an optimized k-means implementation on the graphics processing unit (GPU) is presented. NVIDIApsilas compute unified device architecture (CUDA), available from the G80 GPU family onwards, is used as the programming environment. Emphasis is placed on optimizations directly targeted at this architecture to best exploit the computational capabilities available. Additionally drawbacks and limitations of previous related work, e.g. maximum instance, dimension and centroid count are addressed. The algorithm is realized in a hybrid manner, parallelizing distance calculations on the GPU while sequentially updating cluster centroids on the CPU based on the results from the GPU calculations. An empirical performance study on synthetic data is given, demonstrating a maximum 14times speed increase to a fully SIMD optimized CPU implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Allocation of Heterogeneous Banks' Automated Teller Machines

    Page(s): 16 - 21
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (377 KB) |  | HTML iconHTML  

    The business of setting up automated teller machines (ATMs) for banks depends on many factors such as the price of buying or leasing an ATM, cost of deployment, cost of operation, and ATM characteristics to be deployed. ATM deployment is an intensive computational problem since it is analogous to file server placement, which is known to be as NP-complete problem. Also, ATM maintenance is an intensive service for the bank to sustain its competitive advantage and customer's satisfaction. We have formulated the ATM allocation problem as an optimization problem, where the objective function is to minimize deployment and operational costs subject to the customers' satisfaction and bank's requirements. Therefore, we have proposed a custom-made genetic algorithm to search for the best possible placement of ATMs with the lease cost. Our proposed method finds solutions under 15 minutes on a desktop computer. View full abstract»

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

    Page(s): 22 - 27
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (766 KB) |  | HTML iconHTML  

    In content based image retrieval (CBIR), images are segmented to synthesize image information. Among several characteristics like color or edges, texture is useful for segmenting. This paper proposes an intensive multiresolution approach to texture segmentation based on a wavelet transform. The technique delivers schematic descriptions of images. That is to say, it provides the main regions of interest (ROIs) according to image information. Firstly, the process divides images into 2 times 2 blocks. Then, it tracks texture through the multiresolution offered by the wavelet transform to form featuring vectors. Next, a K-means algorithm partitions the texture vector space into clusters. Finally, a connected component extraction delivers the image schema. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Service for Data-Intensive Computations on Virtual Clusters

    Page(s): 28 - 33
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (295 KB) |  | HTML iconHTML  

    Digital preservation deals with the long-term storage, access, and maintenance of digital data objects. In order to prevent a loss of information, digital libraries and archives are increasingly faced with the need to electronically preserve vast amounts of data while having limited computational resources in-house. However, due to the potentially immense data sets and computationally intensive tasks involved, preservation systems have become a recognized challenge for e-science. We argue that grid and cloud technology can provide the crucial technology for building scalable preservation systems. In this paper, we present recent developments on a job submission service that is based on standard grid mechanisms and capable of providing a large cluster of virtual machines. The service allows clients to specify and execute preservation tools on large data sets based on dynamically generated job descriptors. This approach allows us to utilize a cloud infrastructure that is based on platform virtualization as a scaling environment for the execution of preservation workflows. Finally, we present experimental results that have been conducted on the Amazon EC2 and S3 utility cloud infrastructure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Data Processing Based on EDMA to Save the Processing Power of a T-DMB Software Baseband Receiver Running on a Digital Signal Processor

    Page(s): 34 - 38
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (243 KB) |  | HTML iconHTML  

    Unlike symbol decoding and channel decoding, which perform a variety of computationally simple or complex algorithms in the T-DMB baseband receiver, time de-interleaving simply moves data between two buffers according to a specified rule. Nonetheless, such simple data movement consumes considerable processing power if the T-DMB baseband receiver is implemented in software running on a digital signal processor (DSP). In this work, we present a parallel data processing approach based on the enhanced direct memory access (EDMA) to perform time deinterleaving in a T-DMB software baseband receiver with the view of saving the DSP processing power. Results demonstrating the validity of the presented parallel data processing are presented in terms of the execution cycle count and bit error rate of an implemented T-DMB software baseband receiver. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Re-evaluating Multicast Streaming Using Large-Scale Network Simulation

    Page(s): 39 - 46
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3387 KB) |  | HTML iconHTML  

    Internet-based media streaming services are replacing more traditional broadcast services, resulting in increased demand for network resources. Multicast techniques may be used to improve bandwidth utilisation by servicing one or more clients with each network stream. In this paper, we re-evaluate the performance of the existing multicast patching technique. In particular, we build on the original server-centric performance evaluation to examine the effect of patching on an entire network. We also propose a novel approach to the implementation of patching using standardised transport control (RTSP) and multicast control (MLD) protocols. Our results highlight how network distance from the origin server effects the improvements gained by using patching. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SemMed: Applying Semantic Web to Medical Recommendation Systems

    Page(s): 47 - 52
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (261 KB) |  | HTML iconHTML  

    The systematic method used to identify diseases is a called differential diagnosis (DDx). It is mostly used by healthcare professionals to diagnose a specific disease in a patient. If the disease is diagnosed, the method could be used to recommend the medications in order to receive treatment. The goal of the current paper is to design a system based on semantic Web technologies to a system with the capability to assist healthcare professionals regarding the possible medication or drug to prescribe, according to following fundamental selection criteria. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subjective Evaluation of Video on Demand Systems Using Different Network Connections

    Page(s): 53 - 58
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (288 KB) |  | HTML iconHTML  

    Nowadays, society makes use of new technologies as they appear. Due to this boom, the use of resources via Web is increasing notably. In of training and education cases, companies such as universities are offering tele-learning platforms to complement and facilitate the learning process. Some of these called e-learning platforms can have explanatory videos as a resource for training. For the codification of these videos, we have to use parameters which provide a trade-off between the video sizes to be transmitted that optimize bandwidth and video and audio quality. This paper presents a subjective study of the video quality on transmission depending on the types of users' network access to the video contents and with different ways of viewing the explaining videos, with several different resolutions and for different devices. Finally, we test the explaining videos used in our University for several connections and current devices. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable Services Orchestration with Continuation-Passing Messaging

    Page(s): 59 - 64
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (383 KB) |  | HTML iconHTML  

    Services orchestration is typically supported with the traditional centralized workflow technology. The central engine becomes an intensive resource when the number of services to be orchestrated becomes large. Existing decentralized approaches, being primarily based on static process partitioning, exhibit some other shortcomings such as in resource utilization and fault handling. We present an approach to decentralized services orchestration that does not have these shortcomings and scales well for a large number of services. The approach is based on a new messaging scheme, continuation-passing messaging, where continuations, or the reminder of executions, are passed along with messages for services orchestration. The approach also supports services recovery, by automatically generating recovery plans into a second continuation called failure continuation. Our experimental results show that the new approach provides much better scalability than traditional centralized ones. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Modeling for Evaluation and Planning of Electronic Funds Transfer Systems with Bursty Arrival Traffic

    Page(s): 65 - 70
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (221 KB) |  | HTML iconHTML  

    As business enterprisers are increasingly becoming dependent on using online transactions, the demand for high-end and efficient transaction monitor systems becomes a serious issue. Hence, the performance evaluation of electronic funds transfer (EFT) systems has an enormous importance for companies that implement this service, since the computing resources must be used efficiently in order to ensure high availability, reliability, scalability and security. This paper presents a stochastic model for performance evaluation and planning EFT systems computational resources in the course of demonstrating that the effect of the traffic variations mechanism in computational resources is magnified when the inter arrivals are highly bursty and correlated. At the end, a real case study is presented in order to describe the adequacy of presented approach and results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Connection Pooling Persistence Systems

    Page(s): 71 - 77
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (285 KB) |  | HTML iconHTML  

    Server-sided applications often use a persistence system for storing and managing their data in a database. Such a system has become complex and includes but is not limited to a database system, drivers, connection pools, query languages, the mapping between application logic and a database data model and it involves the optimization of resources. One important resource is the connection from applications to the database system since acquiring a connection is a very expensive operation. This paper introduces monitoring facilities for the use or misuse of connections in a persistence system. In particular, it explains how the monitoring can take place in order to configure connection pooling for optimal performance. The implemented solution uses conventional programming methods as well as an aspect-oriented approach. The described facilities are integrated into the development of an enterprise-scale system implementing a communications middleware. View full abstract»

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

    Page(s): 79
    Save to Project icon | Request Permissions | PDF file iconPDF (78 KB)  
    Freely Available from IEEE
  • [Publisher's information]

    Page(s): 80
    Save to Project icon | Request Permissions | PDF file iconPDF (69 KB)  
    Freely Available from IEEE