Elysium Web Services 2010

Elysium Technologies Private Limited
ISO 9001:2008 A leading Research and Development Division

Madurai | Chennai | Kollam | Ramnad | Tuticorin | Singapore
Abstract Web Services 2010 - 2011
01 A Promotion Mechanism for Scalable Stealth DHT
Most Distributed Hash Tables (DHTs) inherently assume interconnecting nodes with homogeneous capabilities. Realistically however,
capabilities of nodes on a network widely vary, leading traditional DHTs to inevitably exhibit poor performance in real-world
environments. Stealth DHT was previously proposed to address node heterogeneity by enabling a DHT to separate highly capable
(super-peers or service) nodes from less capable (stealth) nodes. Stealth DHTs are considered robust and flexible due to the way they
organize nodes on the network. However, it is difficult to overprovision the number of service nodes to support unexpected increase
in user requests in the networks. Unlike traditional DHTs therefore, Stealth DHTs cannot guarantee network scalability. In this paper,
we address this problem by proposing a simple promotion mechanism to extend Stealth DHT to use stealth nodes as back-up
resources that it can use when the network is overloaded. We define promotion of stealth nodes as the act of enabling stealth nodes
execute some or all of the operations of service nodes. Experiments results show that the proposed promotion mechanism can
offload significant proportion of network load.
02 A Model-driven Approach to SKOS Implementation
Simple Knowledge Organization System (SKOS) has been recently adopted by the W3C as a standard to support the representation,
use and interoperability of different types of structured controlled vocabularies, such as thesauri, taxonomies or classification
schemes. In this paper, we propose a model driven approach for the design and implementation of software tools allowing the
creation, management and sharing of knowledge organization systems described using SKOS. This approach is based on the
definition of meta models for SKOS and for traditional controlled vocabularies, as well as on transformations between different meta
models. We present the SKOS engine we have prototyped as well as its use for developing thesauri and glossaries
03 A Map-Reduce System with an Alternate API for Multi-Core Environments
Map-reduce framework has received a significant attention and is being used for programming both large-scale clusters and multi-
core systems. While the high productivity aspect of map-reduce has been well accepted, it is not clear if the API results in efficient
implementations for different subclasses of data-intensive applications. In this paper, we present a system MATE (Map-reduce with an
AlternaTE API), that provides a high-level, but distinct API. Particularly, our API includes a programmer-managed reduction object,
which results in lower memory requirements at runtime for many data intensive applications. MATE implements this API on top of the
Phoenix system, a multi-core map-reduce implementation from Stanford. We evaluate our system using three data mining
applications and compare its performance to that of both Phoenix and Hadoop. Our results show that for all the three applications,
MATE outperforms Phoenix and Hadoop. Despite achieving good scalability, MATE also maintains the easy-to-use API of map reduce.
Overall, we argue that, our approach, which is based on the generalized reduction structure, provides an alternate high level API,
leading to more efficient and scalable implementations.
#230, Church Road, Anna Nagar, Madurai 625 020, Tamil Nadu, India
(: +91 452-4390702, 4392702, 4390651
Website: www.elysiumtechnologies.com,www.elysiumtechnologies.info
Email: info@elysiumtechnologies.com
04 A Highly Decoupled Front-end Framework for High Trafficked Web Applications
Web applications are becoming more feature rich and ever more ubiquitous, while trying to address the needs of millions of users.
Server-side scalability and performance are a serious matter as farms are unceasingly expanding for high growth sites. User Interface
designers are looking for novel approaches to stimulate user engagement which results in more advanced and feature-rich clients.
Remaining competitive requires companies to constantly push and release new features along with overall UI redesigns. The
evolution of the web paradigm requires architectural changes that use models that will increase the flexibility and address the scaling
problems in terms of performance, development process and demanding product requirements. This paper presents a web
architectural design that decouples several layers of a web application, while delegating all presentation related routines to the client.
To address organizational concerns in the design, client-side layers have been highly decoupled resulting with a well defined, natural
responsibility for each of them: structure - HTML, layout - CSS, behavior - JavaScript. The server exclusively produces data that is
sent to the client and then mapped to the HTML templates taking advantage of interpreting data structure (presence of items,
detecting sets of data, manual operations) for constructing result view to the user. The data produced by the server is client-
independent enabling reuse of the server API by several clients. Overall, the strong responsibilities of identified layers allow
parallelizing the development process and reduce operational friction between teams. The server-side part of the frontend framework
is designed with the novel Printer-Controller-Abstraction (PCA) that was constructed as a variation of the Presentation-Abstraction-
Controller (PAC) architectural pattern. The design keeps the high flexibility of the graph of controllers and introduces additional
concepts like response caching and reuse and allows easy changes of the input and output formats
05 A Global knowledge for Information Retrieval in P2P Networks
In traditional P2P networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them
through the network. However, it is a costly operation since it consumes node and link resources excessively, which are often
unnecessarily. There is no reason, for example, for a peer to receive a query message if the peer has no matching resource or is not
on the path to a peer holding a matching resource. However, how to quickly discover the right resource in a large-scale P2P network
without generating too much network traffic and with minimum possible time remain highly challenging. In this paper, we propose a
new peer-to-peer (P2P) search method aiming at exploiting data mining concepts (Decision Tree) to improve search performance for
information retrieval in P2P network. We use a PDMS system, which aims to combine a Super-Peer (SP) based network with the
capability of managing a data model attached to the peers in the form of relational, xml, or object schemes. Each SP is connected to a
Global-Knowledge-Super-Peer (GKSP) that operates with an index (decision tree), to predict the relevant domains (super peers), to
answer a given query. Compared with a super peer based approach, our proposal architectures show the effect of the data mining
with better performance with respect to response time, number of messages, precision and recall.
06 A Collaborative Decision Support Platform for Product Release Definition
In this paper, we propose a collaborative decision support platform that supports the product manager in defining the contents of a product
release. The platform allows interactive and collaborative decision making by facilitating the exchange of information about product features
among individual autonomous stakeholders, providing reputation-enhanced collaboration, ensuring a positive collaboration atmosphere by
avoiding public stakeholder ratings and reconciling individual goals with group decisions
(: +91 452-4390702, 4392702, 4390651
07 A Bi-Criteria Algorithm for Scheduling Parallel Task Graphs on Clusters
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these
applications on parallel platforms has been a long-standing challenge. In the case of a single homogeneous cluster, most of the
existing algorithms focus on the reduction of the application completion time (makespan). But in presence of resource managers
such as batch schedulers and due to accentuated pressure on energy concerns, the produced schedules also have to be efficient in
terms of resource usage. In this paper we propose a novel bi-criteria algorithm, called biCPA, able to optimize these two performance
metrics either simultaneously or separately. Using simulation over a wide range of experimental scenarios, we find that biCPA leads
to better results than previously published algorithms.
08 Adaptive Scheduling for Staged Applications:The Case of Multiple Processing Units
Staged design has been introduced as a programming paradigm to implement high performance Internet services that avoids the
pitfalls related to conventional concurrency models. However, this design presents challenges concerning resource allocation to the
individual stages, which have different demands that change during execution. On the other hand, processing resources have been
shown to form the bottleneck in a variety of Internet-based applications. For this reason, parallel processing hardware techniques
have been employed in order to cope with the massive concurrency and the increasing demands for performance aspects in these
applications. Recently, the rise of multi-core technology introduces a hierarchic parallelism in modern server machines that has to be
considered when allocating processing units in order to improve the utilization of these resources. This paper, introduces an adaptive
policy to allocate processing units in Internet services that are based on the staged architecture. The proposed approach takes the
hierarchic parallelism in account and adapts the resources assigned to the individual stages dynamically based on the observed
demand of each stage using a feedback loop. Simulation results demonstrate that our approach achieves a competitive system
throughput, avoids overhead that is associated with parallel processing, and successfully adapts resource allocation to dynamic
changes in workload characteristics.
09 A Web Service Architecture for VoIP Services
Integrating voice / video communication into business processes can accelerate resolution time, reduce mistakes, and establish a full
audit-trail of the interactions. Some VoIP service providers offer website based or plugin based solutions, which are, however,
difficult to integrate with other applications. A promising approach to overcome these disadvantages is the development of
appropriate Web Services to allow applications interacting with a VoIP system. We propose a generic framework for VoIP applications
consisting of an XML-based service specification language and a set of reusable Web Service components. Service providers using
the proposed service-oriented architecture can offer to their customers a protocol-neutral Web Service interface, thus enabling the
deployment of a general and integrated VoIP solution.
(: +91 452-4390702, 4392702, 4390651
10 A Thin-Server Runtime Platform for CompositeWeb Applications
Mashups propose a lightweight integration of applications by combining distributed web resources. Their development is aided by a
number of visual tools and platforms. However, they all imply a server-side mashup execution. Since data, application logic, and UI
can all be provided as a service, we argue that the client can be the ideal integration platform for such applications. In this paper we
highlight challenges and requirements of such a thin-server composition and execution system and propose a corresponding
architectural concept to integrate back-end as well as front-end services of a composite application within the browser. We further
present an implementation of our concept and validate its practicability by means of a sample application.
11 A S ystem for Evaluation of Arabic Root Extractor Methods
In this article, we present a new application that evaluated the performance of a number of the Arabic root extraction methods. The
implemented methods in this system are selected according to a previous classification, where these methods are classified into five
categories. We have selected a method for each category. These methods are: Light Stemmer, Arabic Stemming without a root
dictionary, MT-based Arabic Stemmer, N-gram based on similarity coefficient and N-gram based on dissimilarity coefficient. This
evaluation was conducted on the same terms in a corpus of two thousand words and their roots. These words are taken from Arabic
dictionary "Lesan Al-Arab". This application has allowed us to have a first original comparison between the evaluated methods. This
system works in two ways: normal and automatic
12 A Solution Model and Tool for Supporting the Negotiation of Security Decisions in E-Business Collaborations
Sharing, comparing and negotiating security related actions and requirements across businesses has always been a complicated
matter. Issues arise due to semantic gaps, disparity in security documentation and formats, and incomplete security-related
information during negotiations, to say the least. As collaborations amongst e-businesses in particular increase, there is a growing,
implicit need to address these issues and ease companies’ deliberations on security. Our research has investigated this topic in
substantial detail, and in this paper we present a novel solution model and tool for supporting businesses through these tasks. Initial
evaluation results and feedback from interviewed security professionals affirm the use and suitability of our proposals in supporting
the security actions negotiation process
13 A Secure and Legal Network-aware P2P VoD System
File sharing applications using Peer-to-Peer (P2P) networks such as Bittorrent or eDonkey rapidly attracted a lot of people and proved
the efficiency and interest of this P2P technology. Distribution of video and of live contents also experienced the P2P mechanisms
with success. PPLive, UUSee and others have many of customers, hundreds of channels and thousands of concurrent users.
However, major content providers are reluctant to use this technology because no solution to ensure the distribution of only legal
contents is provided. In the same way, network operators do not really push towards P2P content distribution because bad
organization of the overlay can lead to overload the network and consume a lot of networks resources. In this paper, a secure and
legal network-aware P2P video system is introduced, which aims at overcoming those two drawbacks. The design of the system and
the evaluation of a prototype showed good results and let us be optimistic about a possible deployment of P2P systems for video
delivery, having the support of content providers as well as network operators.
(: +91 452-4390702, 4392702, 4390651
14 A Representation of B2B Interacting Actions
In the era of Internet-based services, companies increasingly use Web technologies to interact. To automate electronic exchanges
between businesses, the classical approach it to define beforehand a common interacting protocol that must be strictly followed at
runtime. This imposes a costly design time and a constrained runtime. Our goal is to propose an intermediary multi-agent platform
that allows partners directly engaging in business-to-business (B2B) exchanges without needing to ensure their respective
information systems (IS) interoperability. To reach this goal, autonomous agents must be able to understand the meaning of all
exchanged business messages as well as to interpret on-thefly their potential impact on the overall business transaction. Thus in this
paper we propose a commitment-based representation which defines the sending of business messages by actions with
preconditions and effects according to the enterprises' IS. This representation allows monitoring B2B interactions in term of both
choreographies requirements and business commitments
15 Application Layer Traffic Optimization in the eMule System
Application Layer Traffic Optimization (ALTO) tends to reduce cross-network traffic that P2P software generates via guiding peers to
connect to near sources and download from them when there are many sources available in network. The previous researches about
ALTO were mostly carried on BitTorrent. The famous and popular P2P software, eMule, was neglected in ALTO studies. EMule is quite
different from BitTorrent in various aspects. In this paper, we study how to integrate ALTO mechanism into the eMule system. Three
methods are proposed, and one of them is studied in detail with simulation experiments. Experiment results show that the ALTO
mechanism can decrease average download time and cross-network traffic at the same time. The drawback of the mechanism is also
discovered, i.e., it introduces unfairness in download time for peers far away from the seed.
16 Analysis and Evaluation of Two Security Services in SOA
Secure access to information for any business is a fundamental need. In the service-oriented environment due to loose coupling of
services and applications, and their functions across enterprise boundaries, provisioning security becomes more critical. Therefore
required authorization by an authenticated identity and applying confidentiality techniques which ordinarily are gained via encryption,
are essential for structured implementations according to service oriented architecture principles. This paper tends to analyse and
evaluate two security services, authorization and confidentiality for service-oriented architecture. Based on the scenarios it
introduces service-oriented architecture Security Reference Model and analyses how to apply the authorization and confidentiality
services. The paper describes use of a set of reusable business assets in form of three service-oriented architecture foundation
scenarios
17 An Ontology for Musical Performances Analysis
Performance analysis is a common issue in the musical field, especially for instrument teachers and musicologists. That is why we
present in this paper an ontology (technical aspect) and a descriptive model (pragmatic aspect) to allow music teachers and students
to create semantic annotation on musical performances. As such, we start by studying recorded piano lessons and analyze the
required concepts and roles. We then propose a general performance description model based on these lessons and detail how
musicology rules can be used to automatically infer new information on a given piece. Lastly, we discuss the integration of our work
to an e-learning web-based collaborative platform for musical education
(: +91 452-4390702, 4392702, 4390651
18 An MPI-Stream Hybrid Programming Model for Computational Clusters
The MPI programming model hides network type and topology from developers, but also allows them to seamlessly distribute a
computational job across multiple cores in both an intra and inter node fashion. This provides for high locality performance when the
cores are either on the same node or on nodes closely connected by the same network type. The streaming model splits a
computational job into a linear chain of decoupled units. This decoupling allows the placement of job units on optimal nodes
according to network topology. Furthermore, the links between these units can be of varying protocols when the application is
distributed across a heterogeneous network. In this paper we study how to integrate the MPI and Stream programming models in
order to exploit network locality and topology. We present a hybrid MPI-Stream framework that aims to take advantage of each
model’s strengths. We test our framework with a financial application. This application simulates an electronic market for a single
financial instrument. A stream of buy and sell orders is fed into a price matching engine. The matching engine creates a stream of
order confirmations, trade confirmations, and quotes based on its attempts to match buyers with sellers. Our results show that the
hybrid MPI-Stream fram work can deliver a 32% performance improvement at certain order transmission rates.
19 An Iterative Approach for the Reverse Engineering of Rich Internet Application User Interfaces
Comprehending and modeling the behavior of user interfaces exposed by Rich Internet Applications (RIAs) are important activities in
software maintenance, testing, and evolution. This paper presents an ‘agile’ process for the reverse engineering of Rich Internet
Application User Interfaces: the process is based on dynamic analysis of the application, is iterative and exploits heuristic clustering
criteria for reducing the data gathered by dynamic analysis. Moreover, it is based on the continuous validation feedback of the
process executor, and allows the incremental reconstruction of a Finite State Machine for modeling the behavior of RIA GUIs. This
approach is supported by CReRIA, an integrated reverse engineering environment that provides automatic facilities for executing the
process and incrementally recovering the FSM model. A preliminary experiment involving the analysis of three real Web applications
showed the feasibility of the approach, and highlighted interesting advantages of using the agility in reverse engineering processes.
An Investigation of the use of Overlay Networks in Developing Scalable and Reliable Information Sharing
20 Web/Services
Previous work on addressing the problems of scalability and limited autonomy of data sources arising from the semantic
heterogeneity of peer schema has proposed a layered model/approach of ontology integration consisting of peer and coalition
ontology and the mapping between them. In particular, the integration model for achieving semantic interoperability in Data and
Knowledge Systems (DAKS) is accompanied by an agent-based operational model devised to support reliable and scalable
operations for information sharing in the highly distributed and decentralised environment of P2P networks. Our current work
augments the multi-agent system (MAS) design with Web Services technology and a service-oriented architecture (SOA) that
provides loosely coupled and reusable components to encapsulate the semantically discrete functionality of the multilayer ontology
integration model. A simple exemplar permitting P2P validation checks to be performed on JPEG- 2000 image metadata is described.
21 An Improved Structured and Progressive Electronic Dictionary for the Arabic Language: iSPEDAL
In this article, we propose an improved structured and progressive electronic dictionary for the Arabic language (iSPEDAL) which can
be presented in the form of a relational database or in the form of an XML document which can be easily exploitable using suitable
query languages. Indeed, many Arabic dictionaries are found but are not structured and not directly exploitable since they are in flat
textual files form. iSPEDAL doesn’t contain any duplicated data (roots, prefixes, suffixes, the infixes, the patterns and the derived
words). Moreover, for a given word, it provides links to its root, to their associated affixes, and to its patterns. iSPEDAL is supplied
automatically from one or several traditional textual dictionaries and is enriched permanently with any Arabic textual corpus using
(: +91 452-4390702, 4392702, 4390651
system that we built. This system is composed of a Parser, a Selector, a Classifier, an Extractor, a Comparator, an Analyzer, and a
Validator. The Parser allows the transformation of a textual source (dictionary or textual corpus) into a set of words. The Selector
determines if a word is new or already exists in iSPEDAL. The Classifier allows to classify a given word and to add it to iSPEDAL as a
root or as a derived word. The Extractor uses the Arabic extraction method to deduce the root of all words arriving to this component
without their root or any indication about their root. The Comparator permits to avoid duplication of roots, affixes or patterns in
iSPEDAL. The Analyzer allows the extraction of the affixes and the pattern from a derived word and of its root. The Validator can
validate the information (word, root, patterns, and affixes) before adding to iSPEDAL database. This dictionary can be used to
evaluate the information extraction methods from an Arabic document, given that; the vocabulary of the Arabic language is
essentially built from the roots.
22 An evaluation of the benefits of fine-grained value-based scheduling on general purpose clusters
General purpose compute clusters fulfill a prominent role in a wide range of organizations to deliver the necessary computational
power for their processes. In order to manage the shared use of such clusters, scheduling policies are installed to determine if and
when the jobs submitted to the cluster are executed. Value-based scheduling policies differ from other policies in that they allow
users to communicate the value of their computation to the scheduling mechanism. The design of market mechanisms whereby users
are able to bid for resources in a fine-grained manner has proven to be an attractive means to implement such policies. In the clearing
phase of the mechanism, supply and demand for resources are matched in pursuit of a value-maximizing job schedule and resource
prices are dynamically adjusted to the level of excess demand in the system. Despite their success in simulations and research
literature, such fine-grained value-based scheduling policies have been rarely used in practice as they are often considered too
fragile, too onerous for end-users to work with, and difficult to implement. A coarse-grained form of value-based scheduling that
mitigates aforementioned disadvantages involves the installation of a priority queuing system with fixed costs per queue. At present,
it is however unclear to which extent a fine-grained form of value-based scheduling through auctions can outperform such a priority
queueing system. Using workload traces of a general purpose cluster, we indicate under which conditions this is the case and
quantify the resulting efficiency gains.
23 An Effective Architecture for Automated Appliance Management System Appl ying Ontology-Based Cloud Discovery
Cloud computing is a computing paradigm which allows access of computing elements and storages on-demand over the Internet.
Virtual Appliances, pre-configured, ready to- run applications are emerging as a breakthrough technology to solve the complexities of
service deployment on Cloud infrastructure. However, an automated approach to deploy required appliances on the most suitable
Cloud infrastructure is neglected by previous works which is the focus of this work. In this paper, we propose an effective
architecture using ontology-based discovery to provide QoS aware deployment of appliances on Cloud service providers. In addition,
we test our approach on a case study and the result shows the efficiency and effectiveness of the proposed work.
24 An Effective and High-quality Quer y RelaxationSolution on the Deep Web
because the amount of information contained on the Deep Web is much larger than the surface web, how to use it well has become a
popular problem to research. When a query is sent to a deep web resource and the data sources return few results or even no result,
a proper query relaxation solution should be adopted to get more satisfactory results to users. In this paper, such a query relaxation
solution is presented. First, it solves the problem of relaxing attributes which contain multiple key words by value. That is, such
attributes are not simply removed in the relaxation, but the query values of the attributes are modified. Second, when a data source
returns many result pages, instead of getting all the pages, it evaluates the quality of the results in the current page to decide whether
to send another query to fetch the next page. Thus, the number of query times is reduced. Finally, the experimental results
demonstrate that both the result quality and the query efficiency are improved
(: +91 452-4390702, 4392702, 4390651
25 An Anal ysis of Traces from a Production Map Reduce Cluster
Map Reduce is a programming paradigm for parallel processing that is increasingly being used for data-intensive applications in
cloud computing environments. An understanding of the characteristics of workloads running in Map Reduce environments benefits
both the service providers in the cloud and users: the service provider can use this knowledge to make better scheduling decisions,
while the user can learn what aspects of their jobs impact performance. This paper analyzes 10-months of Map Reduce logs from the
M45 supercomputing cluster which Yahoo! made freely available to select universities for academic research. We characterize
resource utilization patterns, job patterns, and sources of failures. We use an instance-based learning technique that exploits
temporal locality to predict job completion times from historical data and identify potential performance problems in our dataset
26 An Adaptive Data Prefetcher for High-Performance Processors
While computing speed continues increasing rapidly, data-access technology is lagging behind. Data-access delay, not the processor
speed, becomes the leading performance bottleneck of high-end/high-performance computing. Prefetching is an effective solution to
masking the gap between computing speed and data-access speed. Existing works of prefetching, however, are very conservative in
general, due to the computing power consumption concern of the past. They suffer in effectiveness especially when applications'
access pattern changes. In this study, we propose an Algorithm-level Feedback-controlled Adaptive (AFA) data prefetcher to address
these issues. The AFA prefetcher is based on the Data-Access History Cache, a hardware structure that is specifically designed for
data prefetching. It provides an algorithm-level adaptation and is capable of dynamically adapting to appropriate prefetching
algorithms at runtime. We have conducted extensive simulation testing with SimpleScalar simulator to validate the design and to
illustrate the performance gain. The simulation results show that AFA prefetcher is effective and achieves considerable IPC
(Instructions Per Cycle) improvement in average
27 AIMO Translator: Bridging the Gap Between Semantic Web Service Discovery and Composition
Semantic Web Service discovery and Semantic Web Service composition can be considered as complementary techniques.
Overcoming both those obstacles is the key to automatic generation of executable Semantic Web Services process. In this paper, we
propose a translator to realize the AIMO framework which is based on an AI-planning based approach called HTN-DL and Web Service
Modeling Ontology (WSMO) that provides Semantic Web Service discovery and composition. The AIMO Translator is proposed to
translate each WSMO elements into corresponding elements of HTNDL. Moreover, the proposed translator has been implemented and
tested and the result shows that the AIMO Translator is performing well and usable
(: +91 452-4390702, 4392702, 4390651
28 AGORA Framework for Service Discovery and Resource Allocation
Integration of Web Services and agent technology is still a problem which needs to be solved. Several different approaches have
been proposed and demonstrated, however the proposed solutions mainly targeted to translation of different standards. We believe
that the main problem is not translation of standards, but usage of different standards together. In this paper we explore an approach
to achieve interoperation of agents and Web services. Instead of performing translation we propose a framework which focuses on
using different kind services (including Web Services) and agents together. Our proposed framework supports well known standards
and is able to support future changes. By virtue of this work we try to solve three different problems, firstly we provide a solution
which unifies different standards, secondly we propose an agent framework which is capable to adopt to changes and evolve in open
environment and lastly we adopt a peer-to-peer service discovery and invocation in our framework. Our agent framework is general
enough to adopt to different problems and the existing implementation of our framework can be extended/overridden without need to
change the core concepts. As a proof of concept we carry out a case study in the area of mobilr collaborative learning.
Distributed Aspect-Oriented Service Composition for Business Compliance Governance with Public Service
29 Processes
Service-Oriented Architecture offers a technical foundation for Enterprise Application Integration and business collaboration through
service-based business components. With increasing process outsourcing and cloud computing, enterprises need process-level
integration and collaboration (process-oriented) to quickly launch new business processes for new customers and products.
However, business processes that cross organisations’ compliance regulation boundaries are still unaddressed. We introduce a
distributed aspect-oriented service composition approach, which enables multiple process clients hot plugging their business
compliance models (business rules, fault handling policy, and execution monitor) to BPEL business processes.
30 Detecting Unauthorized Modification of HTTP Communication with Steganography
HTTP does not secure its requests and responses. Using Man-in-the-Middle attack, it is possible to alter the HTTP communication,
while it still would look authentic. This can be a problem, if you download data such as PGP key, TOR client, access banking services
on-line, or when there is an interest to filter what you can read on the Internet. It should be noted that under particular circumstances,
it is possible to attack HTTPS secured communication successfully. This paper proposes a steganography scheme that can be used
to detect unauthorized modifications of HTTP communication.
31 Designing Accelerator-Based Distributed Systems for High Performance
Multi-core processors with accelerators are becoming commodity components for high-performance computing at scale. While
accelerator-based processors have been studied in some detail, the design and management of clusters based on these processors
have not received the same focus. In this paper, we present an exploration of four design and resource management alternatives,
which can be used on large scale asymmetric clusters with accelerators. Moreover, we adapt the popular MapReduce programming
model to our proposed configurations. We enhance MapReduce with new dynamic data streaming and workload scheduling
capabilities, which enable application writers to use asymmetric acceleratorbased clusters without being concerned with the
capabilities of individual components. We present an evaluation of the presented designs in a physical setting and show that our
designs can provide significant performance advantages. Compared to a standard static MapReduce design, we achieve 62.5%,
73.1%, and 82.2% performance improvement using accelerators with limited general-purpose resources, well-provisioned shared
general-purpose resources, and well-provisioned dedicated general-purpose resources, respectively
(: +91 452-4390702, 4392702, 4390651
32 Design of a Framework for Automated Service Mashup Creation and Execution Based on Semantic Reasoning
Instead of building self-contained silos, applications are being broken down in independent structures able to offer a scoped service
using open communication standards and encoding. Nowadays there is no automatic environment for the construction of new
mashups from these reusable services. At the same time the designer of the mashup needs to establish the actual locations for
deployment of the different components. This paper introduces the development of a framework focusing on the dynamic creation
and execution of service mashups. By enriching the available building blocks with semantic descriptions, new service mashups are
automatically composed through the use of planning algorithms. The composed mashups are automatically deployed on the available
resources making optimal use of bandwidth, storage and computing power of the network and server elements. The system is
extended with dynamic recovery from resource and network failures. This enrichment of business components and services with
semantics, reasoning, and distributed deployment is demonstrated by means of an e-shop use case.
33 Context-Aw are Service Discovery and Adaptation Based on Semantic Matchmaking
Service discovery and adaptation are two relevant paradigms in systems developed by assembling reusable software services
accessed through their public interfaces. On one hand, the discovery process aims at discovering the most suitable services for a
request. On the other hand, the adaptation process solves, as automatically as possible, mismatch cases which may be given at the
different interoperability levels among interfaces by generating a mediating adaptor based on an adaptation contract. In this paper,
we present an approach which takes advantage of context-awareness features and semantic-based mechanisms to discover services
and adapt themselves to their environments.
34 Context-Aw are Interaction Models in Cross-Organizational Processes
Rigidly pre-planned business processes are applied in the field of production planning and product development to coordinate the
collaboration of single enterprises. Each step in these workflows is precisely scheduled, accounting for external constraints such as
availability of material, delivery dates, and efficiency of humans and machines. However, finally all these steps are performed, or at
least controlled, by humans and it is likely that in human-operated environments failures happen, and misunderstandings require
adaptations and adhoc interference to avoid delays in workflow executions. In this paper, we discuss the role of human interaction
support in traditional process-oriented environments, and present new approaches to dynamic involvement and interactions with
collaboration partners. We highlight a typical use case where human experts are flexibly involved in certain steps of workflows that
assist single tasks owners to solve emerging problems. In our approach, experts are discovered based on dynamically changing
contextual constraints, such as problem areas and required expertise, and we enable their fast involvement by using Web 2.0
communication facilities
(: +91 452-4390702, 4392702, 4390651
35 Context-aware Campaigns in Social Networks
Services have become increasingly important in today’s Web-based applications. Users can access services in an anytime, anywhere
manner using a wide variety of mobile devices. Mobile services are a key driver in today’s telecommunication market, even though
the potential of mobile services has not been fully exploited in existing telecommunication systems. A main driver in these markets
are contextaware services to build intuitive services for mobile handsets. One success factor is to support a broad range of handsets
available on the market and making the services contextaware by obtaining contextual information. Context may be derived from
information obtained from the handset – most prominently location information. In this work, we present a mobile marketing platform
enabling the advertisement of services in mobile markets. Advertisements and offerings need to be customized based on user
preferences. We propose a recommendation approach of services based on social-network properties and human provided services.
Our contributions are the Woodapples platform offering a set of APIs for creating mobile campaigns and an approach for managing
social and service network structures in a unified manner
ConnectX-2 InfiniBand Management Queues: First Investigation of the New Support for Network Offloaded
36 Collective Operations
This paper introduces the newly developed Infini-Band (IB) Management Queue capability, used by the Host Channel Adapter (HCA)
to manage network task data flow dependancies, and progress the communications associated with such flows. These tasks include
sends, receives, and the newly supported wait task, and are scheduled by the HCA based on a data dependency description provided
by the user. This functionality is supported by the ConnectX-2 HCA, and provides the means for delegating collective communication
management and progress to the HCA, also known as collective communication offload. This provides a means for overlapping
collective communications managed by the HCA and computation on the Central Processing Unit (CPU), thus making it possible to
reduce the impact of system noise on parallel applications using collective operations. This paper further describes how this new
capability can be used to implement scalable Message Passing Interface (MPI) collective operations, describing the high level details
of how this new capability is used to implement the MPI Barrier collective operation, focusing on the latency sensitive performance
aspects of this new capability. This paper concludes with small scale benchmark experiments comparing implementations of the
barrier collective operation, using the new network offload capabilities, with established point-to-point based implementations of
these same algorithms, which manage the data flow using the central processing unit. These early results demonstrate the promise
this new capability provides to improve the scalability of high performance applications using collective communications. The latency
of the HCA based implementation of the barrier is similar to that of the best performing point-to-point based implementation managed
by the central processing unit, starting to outperform these as the number of processes involved in the collective operation
increases.
37 Casual Multi-user Web Collaboration by Low ering Communication Barriers
Our goal is to support casual communication between users on the Web by lowering the various barriers --- community,
psychological, and awareness --- that impede smooth communication on the Web. Our prototype system enables communication
over the entire Web space (beyond Web community services), real-time semi-active communication, and mutual visualization of
users. In an informal evaluation, the seven participants reacted mostly positively to the concept and expressed interest in using such
a system.
(: +91 452-4390702, 4392702, 4390651
38 Cache Mechanism in P2P Streaming Media System
Providing streaming media service over the Internet is challenging. Since this requires high communication bandwidth for delivery.
How to avoid the bottleneck of the streaming media service with the use of P2P system has become a hotspot. In this paper, we
review the existing caching management and propose a novel cache allocation fit for P2P streaming media system. Our approach
allows the system to retain many copies of popular videos to avoid creating hot spots and at the same time, prevent unpopular videos
from being quickly evicted from the system.
39 BPEL2DENEB: Translation of BPEL Processes to Executable High-level Petri Nets
The use of the Service-Oriented Architecture paradigm (SOA) as an architectural model together with the use of Web services
technologies have spread out widely in the world of business processes. The Business Execution Language, BPEL, represents one of
the most common orchestration languages used to build SOA compositions. Using BPEL, a business process can be constructed
integrating different Web services in the same process flow. However, BPEL is rather static and several approaches have been
proposed in order to allow translating it to a set of different formalisms, being Petri nets one of the most extended. The main lack of
these translations is that the result is also static and normally it is used merely to analyze, verify and study some behavioral and
structural properties of the corresponding processes. In this work, we present the translation of BPEL processes to executable High-
level Petri nets. The resulting nets are much more expressive and keep the original semantics and behavior than the original BPEL
process. Moreover, these nets can not only be analyzed, but also executed directly by using the result as input in the DENEB platform
for the development and execution of dynamic Web processes
40 BlueLearn: Low-Cost Interactive Learning System
In this paper, we describe BlueLearn, an interactive, location-aware learning environment, which can be utilized with minimum
hardware investment from the learner’s side. The system is an extension and an application of the BlueInfo “automatic helpdesk”
system we have demonstrated earlier. We outline a system that extends the basic idea of the BlueInfo to cover spatially and
temporally wider applications, suitable for implementing interactive games and educational systems with reasonable cost
(: +91 452-4390702, 4392702, 4390651
41 BlogMiner: Web Blog Mining Application for Classification of Movie Reviews
With the increasing use of Web 2.0 platforms such as Web Blogs, discussion forums, Wikis, and various other types of social media,
people began to share their experiences and opinions about products or services on the World Wide Web. Web Blogs have thus
become an important source of information. In turn, great interest in blog mining has arisen, specifically due to its potential
applications, such as in opinion or review search engine applications the ability to collect and analyze data. In this study, we
introduce an architecture, implementation, and evaluation of a Web blog mining application, called the BlogMiner, which extracts and
classifies people’s opinions and emotions (or sentiment) from the contents of weblogs about movie reviews.
42 Bandwidth Allocation for Iterative Data-dependent e-Science Applications
We develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a
Synchronous Dataflow (SDF) model, our framework incorporates the communication times inherent in large scale distributed
applications, and can be used to formulate the bandwidth allocation problem with throughput constraints as a multi-commodity linear
programming problem. Our algorithms determine how much bandwidth is allocated to each edge while satisfying temporal
constraints on collaborative tasks. Simulation results show that the bandwidth allocation by the formulated linear programming
outperforms the bandwidth allocation by simple heuristics
43 Highway Passenger Traffic Volume Research Based on Gray - Markov Prediction Model
In this paper, we propose the application of gray Markov model for forecasting methods, and amend with the smooth ratio the
historical data, establish the GM (1,1) model . By determining the coefficients to obtain the development series of the future road
passenger traffic amount, and by combining the Markov chain process, to classify the random sequence status into three categories,
by determining the status transfer matrix, we predict the road passenger traffic amount in 5 years. The theoretical analysis and
practical application show that the prediction is more reliable using this method. We can manage the development of passenger
traffic, which helps the administration to make decisions.
44 High Performance Dimension Reduction and Visualization for Large High-dimensional Data Analysis
Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for
understanding the results of data mining approaches or just for browsing them in a way that distance between points in visualization
(2D or 3D) space tracks that in original high dimensional space. Dimension reduction is a well understood approach but can be very
time and memory intensive for large problems. Here we report on parallel algorithms for Scaling by MAjorizing a COmplicated
Function (SMACOF) to solve Multidimensional Scaling problem and Generative Topographic Mapping (GTM). The former is
particularly time consuming with complexity that grows as square of data set size but has advantage that it does not require explicit
vectors for dataset points but just measurement of inter-point dissimilarities. We compare SMACOF and GTM on a subset of the NIH
PubChem database which has binary vectors of length 166 bits. We find good parallel performance for both GTM and SMACOF and
strong correlation between the dimension-reduced PubChem data from these two methods
(: +91 452-4390702, 4392702, 4390651
45 Granularity-Aw areWork-Stealing for Computationally-Uniform Grids
Good scheduling is important for ensuring effective use of Grid resources, while maximising parallel performance. In this paper, we
show how a basic “Random-Stealing” load balancing algorithm for computational Grids can be improved by using information about
the task granularity of parallel programs. We propose several strategies (SSL,SLL and LLL) for using granularity information to
improve load balancing, presenting results both from simulations and from a real implementation (the Grid-GUM Runtime System for
Parallel Haskell). We assume a common model of task creation which subsumes both master/worker and data-parallel programming
paradigms under a task-stealing work distribution strategy. Overall, we achieve improvement in runtime of up to 19.4% for irregular
problems in the real implementation, and up to 40% for the simulations (typical improvements of more that 15% for irregular
programs, and from 5-10% for regular ones). Our results show that, for computationally-uniform Grids, advanced load balancing
methods that exploit granularity information generally have the greatest impact on reducing the runtimes of irregular parallel
programs. Moreover, the more irregular the program is, the better the improvements that can be achieved.
46 Global SOA: RSS-based Web Services Repository and Ranking
For Global Service-Oriented Architecture (GSOA), we need to make sure that the Web Services provided by the service providers are
visible to all potential consumers across the globe. In this paper, we discuss about Universal Description Discovery and Integration
(UDDI) and its limitations as public repository. For this, we propose using Really Simple Syndication (RSS) as a repository. RSS is
indeed based on the Extensible Markup Language (XML) and hence it enables easy data transformation. It is also platform
independent, lightweight and is widely used as open source technology. Due to the auto push nature of RSS, the global RSS
repository will only send the recently added Uniform Resource Identifier (URI) links to the subscribed consumers. The client can
maintain its local cache for supporting faster execution of most frequently used Web Services. The new URI links provided by the
server will get appended to the client’s local cached repository thereby reducing data traffic over the Internet. In GSOA, we discuss
logic that will assign the ranks to the Web Services and will help compare Web Services providing similar functionalities; thereby it
helps the Web Service consumer to dynamically select the best available Web Service depending on the user criteria. The local RSS-
based repository implements the local ranking, wherein the user’s relative preferences are stored. The most important thing is that
the local RSS takes priority over the global RSS ranks
47 FIRE: A File Reunion Based Data Replication Strategy for Data Grids
Data grids provide large-scale geographically distributed data resources for data intensive applications such as high energy physics
and bioinformatics. Optimizing the use of data resources to maximize the performance is critical for data grids. In this paper, we
propose a novel dynamic data replication strategy called FIRE (file reunion), which is motivated by the observations that a group of
jobs in a site tend to demand a common set of files distributed in a data grid. The basic idea of FIRE is to reunite the file set through
data replication so that it resides with the job group on the same site. Extensive experiments using a well-known data grid simulator
OptorSim and synthetic benchmarks demonstrate that compared with two existing schemes, LRU (Least Recently Used) and LFU
(Least Frequently Used), FIRE performs obviously better in most scenarios.
(: +91 452-4390702, 4392702, 4390651
Exploring the Potential of Using Multiple e-Science Infrastructures with Emerging Open Standards-based e-Health
48 Research Tools
E-health makes use of information and communication methods and the latest e-research tools to support the understanding of body
functions. E-scientists in this field take already advantage of one single infrastructure to perform computationally-intensive
investigations of the human body that tend to consider each of the constituent parts separately without taking into account the
multiple important interactions between them. But these important interactions imply an increasing complexity of applications that
embrace multiple physical models (i.e. multi-physics) and consider a larger range of scales (i.e. multi-scale) thus creating a steadily
growing demand for interoperable infrastructures that allow for new innovative application types of jointly using different
infrastructures for one application. But interoperable infrastructures are still not seamlessly provided and we argue that this is due to
the absence of a realistically implementable infrastructure interoperability reference model that is based on lessons learned from e-
science usage. Therefore, the goal of this paper is to explore the potential of using multiple infrastructures for one scientific goal with
a particular focus on e-health. Since e-scientists gain more interest in using multiple infrastructures there is a clear demand for
interoperability between them to enable a use with one eresearch tool. The paper highlights work in the context of an e- Health blood
flow application while the reference model is applicable to other e-science applications as well.
49 Experiments with Memory-to-Memory Coupling for End-to-End Fusion Simulation Workflows
Scientific applications are striving to accurately simulate multiple interacting physical processes that comprise complex phenomena
being modeled. Efficient and scalable parallel implementations of these coupled simulations present challenging interaction and
coordination requirements, especially when the coupled physical processes are computationally heterogeneous and progress at
different speeds. In this paper, we present the design, implementation and evaluation of a memory-to-memory coupling framework for
coupled scientific simulations on high-performance parallel computing platforms. The framework is driven by the coupling
requirements of the Center for Plasma Edge Simulation, and it provides simple coupling abstractions as well as efficient
asynchronous (RDMA-based) memory-to-memory data transport mechanisms that complement existing parallel programming
systems and data sharing frameworks. The framework enables flexible coupling behaviors that are asynchronous in time and space,
and it supports dynamic coupling between heterogeneous simulation processes without enforcing any synchronization constraints.
We evaluate the performance and scalability of the coupling framework using a specific coupling scenario, on the Jaguar Cray XT5
system at Oak Ridge National Laboratory.
50 Evenly Distributing Combinatorial Tasks in a Peer-to-Peer System
This paper presents an algorithm to evenly distribute a combinatorial task to participating nodes in a peer-to-peer system. Subtasks
divided by our algorithm can be independently computed and the size of each subtask is almost identical so that we can achieve
optimal resource utilization, maximize throughput, minimize response time, and avoid unfair overload to some nodes. An algorithm to
find similarity among user-generated contents is used as an example of combinatorial tasks. Using a real world data obtained from
YouTube contents, we measured the reduction in processing time achievable by cooperation with other peers in a peer-to-peer
environment. The result shows that the processing time for combination tasks can be significantly reduced as the number of peers to
accomplish the tasks is increased.
(: +91 452-4390702, 4392702, 4390651
51 ERGOT: A Semantic-based System for Service Discovery in Distributed Infrastructures
The increasing number of available online services demands distributed architectures to promote scalability as well as semantics to
enable their precise and efficient retrieval. Two common approaches toward this goal are Semantic Overlay Networks (SONs) and
Distributed Hash Tables (DHTs) with semantic extensions. This paper presents ERGOT, a system that combines DHTs and SONs to
enable semantic-based service discovery in distributed infrastructures such as Grids and Clouds. ERGOT takes advantage of
semantic annotations that enrich service specifications in two ways: (i) services are advertised in the DHT on the basis of their
annotations, thus allowing to establish a SON among service providers; (ii) annotations enable semantic-based service matchmaking,
using a novel similarity measure between service requests and descriptions. Experimental evaluations confirmed the efficiency of
ERGOT in terms of accuracy of search and network traffic.
52 Enhancing IEC 62351 to Improve Security for Energy Automation in Smart Grid Environments
Information security has gained tremendous importance for energy distribution and energy automation systems over the last years.
Standards like IEC61850 offer standardized communication services and standardized data models for communication in energy
automation. IEC 61850 is flanked by the standard IEC 62351 that especially addresses security and specifies technical requirements
which have to be met by vendors. Especially, vendors that cover the entire energy automation chain with their product portfolio face
new demanding challenges imposed by new use cases that come with the rise of the Smart Grid. This paper describes the current
state of the standardization of IEC 62351, gives an overview of current and new use cases, and discusses potential enhancements of
the standard to address new use cases. The enhancements allow multiple parallel distinguishable sessions based on MMS and
proper authentication as well as authorization.
53 Enhancing Availability with Self-Organization Extensions in a SOA Platform
The availability and reliability of Service-oriented architectures (SOA) depends on two factors: On the one hand, the availability and
reliability of the services that provide a certain business functionality and on the other hand the services that make up the underlying
SOA platform. For platforms that are supposed to form the core of mission-critical service-oriented applications, this implicates the
need for mechanisms that can regulate the reliability- and availability levels of the core services in changing conditions. In this paper,
we discuss open questions about what kind of monitoring functionalities and service replication mechanisms should be integrated in
SOA infrastructures. Therefore, the integration of concepts from peer-to-peer (P2P) computing is proposed: We present a self-
organization extension that can improve the availability of the core services of SOA infrastructures, and we provide an experiment-
based evaluation, showing some of the benefits that this extension can have in a critical scenario. The concepts are prototypically
implemented as extensions of Apache Tuscany, which is a realization of the Service Component Architecture (SCA) standard
54 eLearning 2.0 and Social, Practice-oriented Communities to Improve Knowledge in Companies
One efficient way to improve the situation of organisations and competencies of their staff is to implement efficient training based
also on new ICT learning methods like eLearning and to develop knowledge-based approaches. In this paper we discuss firstly an
approach for organizing eLearning 2.0 based training to support development/improvement of knowledge in companies, particularly
in small and medium sized (SME) ones, which need help. We start in this approach with an assessment of companies’ readiness for
eLearning supporting also knowledge development. This approach is the basis for building training strategies and will be tested and
further developed within the ongoing European project ReadiSME. Secondly, we give an example of social, practice-oriented co-
operations, like Communities of Practice (CoPs), as an approach to support learning, sharing, transfer and development of knowledge
suitable for SMEs. We present some conclusions
(: +91 452-4390702, 4392702, 4390651
55 Elastic Site: Using Clouds to Elastically Extend Site Resources
Infrastructure-as-a-Service (IaaS) cloud computing offers new possibilities to scientific communities. One of the most significant is
the ability to elastically provision and relinquish new resources in response to changes in demand. In our work, we develop a model
of an “elastic site” that efficiently adapts services provided within a site, such as batch schedulers, storage archives, or Web services
to take advantage of elastically provisioned resources. We describe the system architecture along with the issues involved with
elastic provisioning, such as security, privacy, and various logistical considerations. To avoid over- or under-provisioning the
resources we propose three different policies to efficiently schedule resource deployment based on demand. We have implemented a
resource manager, built on the Nimbus toolkit to dynamically and securely extend existing physical clusters into the cloud. Our
elastic site manager interfaces directly with local resource managers, such as Torque. We have developed and evaluated policies for
resource provisioning on a Nimbus-based cloud at the University of Chicago, another at Indiana University, and Amazon EC2. We
demonstrate a dynamic and responsive elastic cluster, capable of responding effectively to a variety of job submission patterns. We
also demonstrate that we can process 10 times faster by expanding our cluster up to 150 EC2 nodes.
56 EGSI: TGKA based Security Architecture for Group Communication in Grid
Security is one of the most important issues in the grid. Several processes generated by a user need to communicate securely. The
existing architectures do not provide support for secure group communication in grid. Grid applications differ in various parameters
such as life time, arrival rate, departure rate, staying period, and tolerance times for join and leave. These parameters are critical for
optimizing performance and meeting the security requirements of the application. Existing grid security architectures do not harness
knowledge of these parameters. In this paper, we propose an extended grid security infrastructure (EGSI) to support secure group
communication in grid. We also present an authentication and access control scheme at virtual organization level.
57 Effort-Oriented Classification Matrix of Web Service Composition
Within the service-oriented computing domain, Web service composition is an effective realization to satisfy the rapidly changing
requirements of business. Therefore, the research into Web service composition has unfolded broadly. Since examining all of the
related work in this area becomes a mission next to impossible, the classification of composition approaches can be used to facilitate
multiple research tasks. However, the current attempts to classify Web service composition do not have clear objectives.
Furthermore, the contexts and technologies of composition approaches are confused in the existing classifications. This paper
proposes an effort-oriented classification matrix for Web service composition, which distinguishes between the context and
technology dimension. The context dimension is aimed at analyzing the environment influence on the effort of Web service
composition, while the technology dimension focuses on the technique influence on the effort. Consequently, besides the traditional
classification benefits, this matrix can be used to build the basis of cost estimation for Web service composition in future research.
(: +91 452-4390702, 4392702, 4390651
Efficient Runtime Environment for Coupled Multi-Physics Simulations: Dynamic Resource Allocation and Load-
58 Balancing
Coupled Multi-Physics simulations, such as hybrid CFD-MD simulations, represent an increasingly important class of scientific
applications. Often the physical problems of interest demand the use of high-end computers, such as TeraGrid resources, which are
often accessible only via batch-queues. Batch-queue systems are not developed to natively support the coordinated scheduling of
jobs – which in turn is required to support the concurrent execution required by coupled multi-physics simulations. In this paper we
develop and demonstrate a novel approach to overcome the lack of native support for coordinated job submission requirement
associated with coupled runs. We establish the performance advantages arising from our solution, which is a generalization of the
Pilot-Job concept – which in of itself is not new, but is being applied to coupled simulations for the first time. Our solution not only
overcomes the initial co-scheduling problem, but also provides a dynamic resource allocation mechanism. Support for such dynamic
resources is critical for a load balancing mechanism, which we develop and demonstrate to be effective at reducing the total time-to-
solution of the problem. We establish that the performance advantage of using Big Jobs is invariant with the size of the machine as
well as the size of the physical model under investigation. The Pilot-Job abstraction is developed using SAGA, which provides an
infrastructure agnostic implementation, and which can seamlessly execute and utilize distributed resources
59 eDemocs: Electronic Distributed Election Monitoring over Cellular Systems
Formal election observation involves appointed observers recording and reporting remote observations over the duration of an
election and analysts promptly issuing conclusions based on studying these observations. This paper discusses the design and
performance of eDemocs (Electronic Distributed Election Monitoring over Cellular Systems), created to aid the election monitoring
process by enabling rapid and trustworthy flow of observations from the reporting sites along with immediate access to the
observations by the analysts. We discuss the architecture for our system and evaluate a prototype implementation and trial
deployment in a US election. Our architecture is shown to be feasible and to demonstrate several desirable qualities, including
integrity guarantees and full deployability in developing countries through reliance on SMS messaging without requiring Internet
connectivity.
60 E-business online payment and credit card industry development in China
The research pointed out the trend that e-business online payment is growing with the prospering development of credit card
industry in China. The reasons why Chinese consumers prefer online payment and why the credit card industry development is
important to online payment were analyzed. The pros and cons of credit card online payment was also discussed with some followed
suggestions.
(: +91 452-4390702, 4392702, 4390651
61 D ynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud’s storage facility to all compute nodes as
fast as possible. Many multicast algorithms have been proposed for clusters and grid environments. The most common approach is
to construct one or more spanning trees based on the network topology and network monitoring data in order to maximize available
bandwidth and avoid bottleneck links. However, delivering optimal performance becomes difficult once the available bandwidth
changes dynamically. In this paper, we focus on Amazon EC2/S3 (the most commonly used cloud platform today) and propose two
high performance multicast algorithms. These algorithms make it possible to efficiently transfer large amounts of data stored in
Amazon S3 to multiple Amazon EC2 nodes. The three salient features of our algorithms are (1) to construct an overlay network on
clouds without network topology information, (2) to optimize the total throughput dynamically, and (3) to increase the download
throughput by letting nodes cooperate with each other. The two algorithms differ in the way nodes cooperate: the first ‘non-steal’
algorithm lets each node download an equal share of all data, while the second ‘steal’ algorithm uses work stealing to counter the
effect of heterogeneous download bandwidth. As a result, all nodes can download files from S3 quickly, even when the network
performance changes while the algorithm is running. We evaluate our algorithms on EC2/S3, and show that they are scalable and
consistently achieve high throughput. Both algorithms perform much better than having each node downloading all data directly from
S3
62 Distributed Diskless Checkpoint for Large Scale Systems
In high performance computing (HPC), the applications are periodically checkpointed to stable storage to increase the success rate of
long executions. Nowadays, the overhead imposed by disk-based checkpoint is about 20% of execution time and in the next years it
will be more than 50% if the checkpoint frequency increases as the fault frequency increases. Diskless checkpoint has been
introduced as a solution to avoid the IO bottleneck of disk-based checkpoint. However, the encoding time, the dedicated resources
(the spares) and the memory overhead imposed by diskless checkpoint are significant obstacles against its adoption. In this work, we
address these three limitations: 1) we propose a fault tolerant model able to tolerate up to 50% of process failures with a low check
pointing overhead 2) our fault tolerance model works without spare node, while still guarantying high reliability, 3) we use solid state
drives to significantly increase the checkpoint performance and avoid the memory overhead of classic diskless checkpoint.
63 On-demand Overlay Networks for Large Scientific Data Transfers
Large scale scientific data transfers are central to scientific processes. Data from large experimental facilities have to be moved to
local institutions for analysis or often data needs to be moved between local clusters and large supercomputing centers. In this
paper, we propose and evaluate a network overlay architecture to enable high throughput, on-demand, coordinated data transfers
over wide-area networks. Our work leverages Phoebus and On-demand Secure Circuits and Advance Reservation System (OSCARS)
to provide high performance wide-area network connections. OSCARS enables dynamic provisioning of network paths with
guaranteed bandwidth and Phoebus enables the coordination and effective utilization of the OSCARS network paths. Our evaluation
shows that this approach leads to improved end-to-end data transfer throughput with minimal overheads. The achieved throughput
using our overlay was limited only by the ability of the end hosts to sink the data.
(: +91 452-4390702, 4392702, 4390651
64 On-demand Dynamic Location-based Services Using Web Services
Migration policy making and monitoring constitute critical issues for European countries, given the impact of modern phenomena
such as illegal employment on economic growth and future prosperity. The dynamic and complex nature of migration problems
demands common approaches and collaborative actions among all stakeholders both at National and European level. Policy and
decision makers need to systematically collaborate towards sophisticated approaches that facilitate legal immigrants to be effectively
integrated in labor markets and public administration processes. Existing research initiatives and migration-oriented automated tools
and services fail to provide a complete, robust and widely available framework for the collaborative development of common pan-
European migration policies and the harmonization of processes and documents formats. Identifying these weaknesses as well as
the need for enabling and supporting legal immigrants to be informed and provide their valuable feedback, this paper focuses on the
description of a web-based communication framework for open collaboration on migration issues. The proposed system, ODYSSEUS,
aims at enhancing existing Migration Information Systems by providing an advanced, collaborative and trusted framework for the
provision of migration services.
65 Nontraditional Approach to XML Web Services Interactions
In this paper, are presented some possibilities for application of an algebraic method which handles XML hierarchical data structures
and makes faster the XML search mechanism. The article briefly presents the concepts of Web Services, Service-Oriented
Architecture and other modern software paradigms for organization of the processes over internet. The accelerating techniques for
XML navigation through linear algebra tools are also discussed. Web Services use the internet as the communication medium and
focus on the internet-based standards, which include the Simple Object Access Protocol for transmitting data, Web Services
Description Language for defining services, and other message interactions. The presented paper offers one different point of view
concerning the building of an algebraic formalism for navigation over XML hierarchy. This nontraditional approach, based on the
linear algebra theory, leads to easier interface for XML search techniques that could eliminate some existing language constructions.
66 Multi-Tier-based Global Aw areness: A Model for collaboration in distributed organizations and disaster scenarios
Collaboration in temporal and spatially distributed environments has consistently had to deal with the challenge of intense
awareness, extensively more than locally concentrated team play. Awareness means being informed, in conjunction with an
understanding of activities, states and relationships of each individual within a given group as a whole. In multifarious offices, where
social interaction is necessary in order to share and locate essential information, awareness becomes a concurrent process that
amplifies the exigency of easy routes for personnel to be able to access this information, deferred or decentralized, in a formalized
and context-sensitive way. In special cases that become increasingly contemporary, ambulance personnel and rescue forces need to
get a vast overview of the current situation, resources available at present and courses of action. Although the subject of awareness
has immensely grown in importance, there is extensive disagreement about how this transparency can be conceptually and
technically implemented. This paper introduces a model in order to visualize and navigate such information in multi-tiers using
semantic networks, GIS (Geographic Information Systems) and Web3D. Moreover the model is used for creating scenarios; for an
evaluation from a business organization's perspective, as well as from a scientific perspective on disaster recovery
(: +91 452-4390702, 4392702, 4390651
67 Multimodal Interaction in Distributed and Ubiquitous Computing
This paper presents a multimodal, service-oriented architecture based on a distributed implementation of W3C’s Multimodal
Architecture and Interfaces applied to ubiquitous computing. The specific goal is to create a platform able to provide multimodal
interactions between people with functional diversity and several semantic services developed by third-party companies and
consumed through a display, in order to make content more accessible and interactive. The general purpose of this research is the
development and deployment of urban, ubiquitous services for people living in or visiting a city. And the motivating scenario behind
the design and development of the multimodal platform and semantic services is one in which people use media poles and
confidently interoperate with the surrounding environment in a multimodal way.
68 Multi-Modal CBIR Algorithm based on Latent Semantic Indexing
The paper presents a new multiple feature fusion (MFF) based on latent semantic indexing (LSI) method to achieve an improved
image retrieval performance. The proposed method extracts different physical features, which come from not the whole image but its
main objects, and constructs a multi-modal semantic space, each dimension of which represents a different feature component of the
image. Furthermore, semantic relevance feedback information from the users is also integrated to improve the feedback performance
of the system. The experimental results demonstrate the good robustness of LSI-MFF and have shown that this method is especially
suitable for mass image database such as web environment
69 Modeling conference contribution management using Web Services
As the consensus of using web services as an alternative to traditional deployment models has been growing during the last years,
also new techniques to face the new arisen problems have been developed. In this work, we present the design of a conference
management system by using a composition of web services as deployment model. We bring our attention about the management of
contributions observing several time restrictions, which are checked via formal methods. This formal verification allows us to
conclude when the design is “correct”, that is, when the requirements gathered in the analysis are fulfilled by the design./td>
70 Methodology for Efficient Execution of SPMD Applications on Multicore Environments
The need to efficiently execute applications in heterogeneous environments is a current challenge for parallel computing
programmers. The communication heterogeneities found in multicore clusters need to be addressed to improve efficiency and
speedup. This work presents a methodology developed for SPMD applications, which is centered on managing communication
heterogeneities and improving system efficiency on multicore clusters. The methodology is composed of three phases:
characterization, mapping strategy, and scheduling policy. We focus on SPMD applications which are designed through a message-
passing library for communication, and selected according to their synchronicity and communications volume. The novel
contribution of this methodology is it determines the approximate number of cores necessary to achieve a suitable solution with a
good execution time, while the efficiency level is maintained over a threshold defined by users. Applying this methodology gave
results showing a maximum improvement in efficiency of around 43% in the SPMD applications tested
(: +91 452-4390702, 4392702, 4390651
71 Low-Cost Tuning of Two-Step Algorithms for Scheduling Mixed-Parallel Applications onto Homogeneous Clusters
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge
for many researchers. Parallel applications are often expressed using a task-parallel model (task graphs), in which tasks can be
executed concurrently unless they share a dependency. If these tasks can also be executed in a data parallel fashion, e.g., by using
MPI or Open MP, then we call it a mixed-parallel programming model. Mixed-parallel applications are often modeled as directed
acyclic graphs (DAGs), where nodes represent the tasks and edges represent data dependencies. To execute a mixed-parallel
application efficiently, a good scheduling strategy is required to map the tasks to the available processors. Several algorithms for the
scheduling of mixed-parallel applications onto a homogeneous cluster have been proposed. MCPA (Modified CPA) has been shown
to lead to efficient schedules. In the allocation phase, MCPA considers the total number of processors allocated to all potentially
concurrently running tasks as well as the number of processors in the cluster. In this article, it is shown how MCPA can be extended
to obtain a more balanced workload in situations where concurrently running tasks differ significantly in the number of operations.
We also show how the allocation procedure can be tuned in order to deal not only with regular DAGs (FFT), but also with irregular
ones. We also investigate the question whether additional optimizations of the mapping procedure, such as packing of allocations or
backfilling, can reduce the make span of the schedules
72 LearningPeerSelection: A Quer y Routing Approach for Information Retrieval in P2P Systems
The Peer-to-Peer systems (P2P) are the major technology of access upon various resources on Internet. A fundamental problem in
Peer-to-Peer networks is how to locate appropriate peers efficiently to answer a specific query (Query routing). This paper proposes a
semantic model in , which a query can be routed for appropriate peers instead of broadcasting or using random selection. This
semantic is generally built from the contents of the peers, but can also bring in the implicit behavior of the users. The main objective
of this model is to achieve better results in non-supervised tasks through the incorporation of usage data obtained from past search
queries. This type of model allows us to discover the motivations of users when visiting a certain documents and peers. The terms
used in past queries can provide a better choice of features queries. Hence, for each peer, our model learns from past queries to
represent correlation between queries terms, documents and peers. We implemented the proposed strategy, and compared its
routing effectiveness in terms of both recall and messages traffic with a broadcasting scheme (without learning). To test the
proposed algorithm, we defined a layer of routing on the PeerSim simulator. Experimental results show the model is efficient and
performs better than other non-semantic query routing models with respect to accuracy. In addition, our approach improves the recall
rate nearly 90% while reducing message traffic dramatically compared with Gnutella protocol.
73 Investigation of GPS-based Embedded Guiding System for Scenic Spots
In the case of self-help tourism, the tourist may get lost or miss some scenic spots. To solve these problems, this paper
systematically studies the design of a self-guided tour of scenic spots system based on FS241O, describes the principles and
functional modules of the system, and studies in depth how to display GPS positioning dynamically by using QtlEmbedded. The
system implements map showing, GPS tracking, and video of attractions automatically playing, scenic spots enquiries and so on.
Finally, Drum Mountain Scenic Area in Fuzhou is taken for example to testify the feasibility of the embedded guiding system. The
example shows that the system has friendly interface, simplified operation and rich information, which will bring great convenience
for self-helped tourists.
(: +91 452-4390702, 4392702, 4390651
74 Interoperability Testing Software for Sharing Medical Documents and Images
The Electronic Health Record enables access to prior diagnostic information in order to assist in health decisions. It is a virtual
system that results from the cooperation of several heterogeneous distributed systems. Interoperability between peers is therefore
essential. Achieving interoperability requires various types of testing. Implementations gain a baseline level of testing using software
that simulates communication partners, in addition to providing test data and test plans. In this paper, we describe the architecture
that is presently being deployed in several countries to share medical documents and images. We also introduce the communication
infrastructure and web technologies underlying this architecture. Then, we propose a web infrastructure for interoperability testing,
describe its architecture, expose the challenges encountered and discuss the elected solutions
75 Improving Performance of Declarative Query Execution in DHT-based Systems
Peer-to-peer systems based on Distributed Hash Tables face tradeoffs between the performance (latency or availability) and their
desired functionality. In fact, lookup latency is affected by the mismatch problem between the overlay hop and the underlying
topology. So, applications built on top of such systems can be impacted. A core problem in peer-to-peer systems is the distribution of
items to be stored or computations to be carried out by peers in the system. Many works have been done concerning storage and key
distribution but little work has been done regarding the distribution of operations carried out by peers in the system. This paper
presents a query execution load balancing strategy that allows improving performance of declarative query execution in P2P DHT-
based systems. A performance evaluation, using Grid5000 platform, is provided to verify the improvement achieved by the strategies
presented.
76 Identification and Analysis of Skype Peer-to-Peer Traffic
More and more applications are adopting peer-to peer (P2P) technology. Skype is a P2P based, popular VoIP software. The software
works almost seamlessly across Network Address Translations (NATs) and firewalls and has better voice quality than most IM
applications. The communication protocol and source code of Skype are undisclosed. It uses high strength encryption and random
port number selection, which render the traditional flow identification solutions invalid. In this paper, we first obtain the Skype clients
and super nodes by analyzing the process of login and calling in different network environments. Then we propose a method to
identify Skype traffic based on Skype nodes and flow features. Our proposed method makes the previously hard-to-detect Skype
traffic, especially voice service traffic, much easier to identify. We design an identification system utilizing the proposed method and
implement the system in a LAN network. We also successfully identified Skype traffic in one of the largest Internet Providers over a
period of 93 hours, during which over 30TB data were transmitted. Through experiments, we show that our proposed approach and
implementations can indeed identify Skype traffic with higher accuracy and effectiveness.
77 SAMI: The SLA Management Instance
The vision for economies of reusable services that can be composed into business processes is still hindered by the lack of
dependability as regards their execution. Service Level Agreements (SLAs) are an instrument to express and codify requirements for
services, so that an acceptable level of determinism can be provided, and customers can rely on them as such. In this work we
present the SLA Management Instance (SAMI) architecture for a reusable autonomic entity that can support negotiation and runtime
management of SLAs, without disruptive effects on the existing corresponding services. This architecture takes extra steps towards
supporting hierarchies of cross-domain SLAs, reflecting similar hierarchies of cross-domain service compositions.
(: +91 452-4390702, 4392702, 4390651
New ) SAGA BigJob: An Extensible and Interoperable Pilot-Job Abstraction for Distributed Applications and
78 Systems
The uptake of distributed infrastructures by scientific applications has been limited by the availability of extensible, pervasive and
simple-to-use abstractions which are required at multiple levels – development, deployment and execution stages of scientific
applications. The Pilot-Job abstraction has been shown to be an effective abstraction to address many requirements of scientific
applications. Specifically, Pilot-Jobs support the decoupling of workload submission from resource assignment; this results in a
flexible execution model, which in turn enables the distributed scale-out of applications on multiple and possibly heterogeneous
resources. Most Pilot-Job implementations however, are tied to a specific infrastructure. In this paper, we describe the design and
implementation of a SAGA-based Pilot-Job, which supports a wide range of application types, and is usable over a broad range of
infrastructures, i.e., it is general-purpose and extensible, and as we will argue is also interoperable with Clouds. We discuss how the
SAGA-based Pilot-Job is used for different application types and supports the concurrent usage across multiple heterogeneous
distributed infrastructure, including concurrent usage across Clouds and traditional Grids/Clusters. Further, we show how Pilot-Jobs
can help to support dynamic execution models and thus, introduce new opportunities for distributed applications. We also
demonstrate for the first time that we are aware of, the use of multiple Pilot-Job implementations to solve the same problem;
specifically, we use the SAGA-based Pilot-Job on high-end resources such as the TeraGrid and the native Condor Pilot-Job (Glide-in)
on Condor resources. Importantly both are invoked via the same interface without changes at the development or deployment level,
but only an execution (run-time) decision.
79 Reusability in e-assessment: Towards a multifaceted approach for managing metadata of e-assessment resources
Reusability of resources is a challenge for the development of e-assessment. We have analyzed the existing frameworks reported in
surveys and literature in e-assessment and complementary domains. It turns out that they insufficiently address issues such as
security, accessibility, quality, and context. We suggest overcoming these barriers by integrating metadata into a multidimensional
framework, which might considerably optimize the reusability of (e)- assessment resources. As part of the framework, we propose a
comprehensive description of assessment data with a multifaceted approach that allows any actor in the e-assessment lifecycle to
consider the missing aspects of e-assessment materials. This framework will encourage the management, sharing, storage, and
reuse of e-testing resources regardless of the form and context of assessment.
80 Retrieving Cultural Heritage Information with Google Earth
In recent years, a great number of digital archives have been built in the field of cultural heritage preservation. Besides providing a
systematic way to store and handle digitized versions of valuable artefacts and archival items these archives allow scientists,
preservation officers and other professionals to access documents and information that may otherwise be unavailable. Opening the
cultural archives for interoperation as well as public access is often a desirable objective. For this purpose, a user interface
everybody knows and understands would be a good choice. In this paper, we propose to use Google Earth as a search and retrieval
client for public access to digital archives. A mapping from a metadata model comprising geospatial, temporal, and thematical tags
onto the Google KML is presented. This way Google Earth can easily be extended with cultural heritage information as stored in one
or more digital archives. Any user all around the world can use Google Earth to locate, display and access the desired information by
simply downloading and installing the appropriate KML file
(: +91 452-4390702, 4392702, 4390651
81 Representing eager evaluation in a demand driven model of streams on cloud infrastructure
Previously, we developed our Stream Components framework which uses distributed components and web services to facilitate
control, reconfiguration and deployment of streams on both local clusters, and remote cloud infrastructure. Our stream evaluation
semantics are fundamentally demand driven, a conservative view that ensures no unnecessary computation, supports flexible
structures such as cyclic networks and infinite streams, and facilitates resource management. In this paper, we focus on the
evaluation semantics of our stream model, and explore circumstances under which more eager evaluation is desirable, whilst
retaining the fundamental semantics. We introduce the Indirected Asynchronous Method pattern (IAM), which makes novel use of
futures and autocontinuations, to facilitate fully asynchronous demand propagation leading to more eager evaluation of the streams.
We present an evaluation of the model on both cluster and cloud infrastructure showing that very useful amounts of pipelining
parallelism can be achieved.
82 Remote Process Execution and Remote File I/O for Heterogeneous Processors in Cluster Systems
: Dedicated processors that are specialized for numerical computations, such as the Cell/B.E. and vector processors, tend to have
low performance in the integer computations required by operating systems. To solve this problem, we propose a remote process
and remote file I/O management architecture that enables processes on compute nodes that have dedicated processors to be
executed from a management node that has general-purpose processors. The architecture allows the processes and files to be
managed as a single system. The management node provides general OS functions such as process management and file I/O, while
the compute nodes are dedicated to executing numerical application programs. It makes it possible to take advantage of the
characteristics of each processor and achieves efficient execution of both OS functions and applications. In this architecture, our
heterogeneity-aware binary loader allows programs to be executed on the compute nodes of different types of processors, while our
remote file I/O function transparently executes file I/O issued by programs running on the compute nodes at the management node.
The proposed architecture has been integrated into the Linux kernel. The system was evaluated using the cluster of an x86_64 node
and 16 Cell/B.E. nodes. The results showed that compared to when only compute nodes are used, process invocation is 41 times as
faster than rsh, and 1.6 times faster for the start-up time of an MPI program as well. Also for remote file I/O, performance twice as fast
as NFS is achieved, and a 30% reduction in execution time was confirmed for the NAS Parallel Benchmark BTIO.
83 Region-Based Prefetch Techniques for Software Distributed Shared Memory S ystems
Although shared memory programming models show good programmability compared to message passing programming models,
their implementation by page-based software distributed shared memory systems usually suffers from high memory consistency
costs. The major part of these costs is internode data transfer for keeping virtual shared memory consistent. A good prefetch strategy
can reduce this cost. We develop two prefetch techniques, TReP and HReP, which are based on the execution history of each parallel
region. These techniques are evaluated using offline simulations with the NAS Parallel Benchmarks and the LINPACK benchmark. On
average, TReP achieves an efficiency (ratio of pages prefetched that were subsequently accessed) of 96% and a coverage (ratio of
access faults avoided by prefetches) of 65%. HReP achieves an efficiency of 91% but has a coverage of 79%. Treating the cost of an
incorrectly prefetched page to be equivalent to that of a miss, these techniques have an effective page miss rate of 63% and 71%
respectively. Additionally, these two techniques are compared with two well-known software distributed shared memory (sDSM)
prefetch techniques, Adaptive++ and TODFCM. TReP effectively reduces page miss rate by 53% and 34% more, and HReP effectively
reduces page miss rate by 62% and 43% more, compared to Adaptive++ and TODFCM respectively. As for Adaptive++, these
techniques also permit bulk prefetching for pages predicted using temporal locality, amortizing network communication costs and
permitting bandwidth improvement from multi-rail network interfaces.
(: +91 452-4390702, 4392702, 4390651
84 Recommender Systems for Human Resources Task Assignment
In Portugal, the organisations responsible for the internal control of the State’s financial administration need to progressively
optimise their human resources in order to maximize their effectiveness. Part of this important responsibility relates to competence
management and the assignment of their most suitable human resources to the tasks that insure their mission accomplishment. Such
endeavour can benefit from a central concept of the Computer Supported Collaborative Work (CSCW) field: the application of
computer technology to support group work. This paper outlines a recommender system, the 2HRT that aims to facilitate a more
proficient human resources’ task assignment, helping the human resources department to respond more efficiently to the demands
for personnel of other departments. This research uses a Delphi study, with semistructured interviews to collect the views of
inspection agents in Portugal. The proposed recommender system incorporates the collaborative filtering and content-based
recommendation techniques and the case-based reasoning approach.
85 QoS-Aware Service Composition for Complex Workflows
In Service-oriented Architectures, business processes are realized by composing loosely coupled services. With the ongoing success
of Web services technologies, the invocation of Web services goes beyond enterprises’ borders. So, besides implementing required
services within one enterprise, services can be purchased from external service providers. With a growing number and variety of
services, enterprises can choose between functionally equivalent services at different cost and quality levels. The paper at hand
addresses this service selection problem considering complex workflow patterns. Aggregation functions for different quality of
service parameters are proposed and a linear optimization problem is formulated, which can be solved using integer linear
programming techniques or by applying heuristic solutions.
86 Providing SOAP Web Services and RESTful Web Services from Mobile Hosts
providing non interrupted Web Services from resource limited mobile devices in a light weight processing manner is a significant
need. This paper takes a step towards achieving this goal. An implementation of two frameworks for providing Web Services from
resource constraints devices is presented. The first framework is implemented to provide SOAP Web Services and the second one is
implemented to provide RESTful Web Services. Each of those two frameworks has its own features and shortcomings. This paper
provides a comparison between SOAP-based frameworks and REST fulbased frameworks. This comparison is carried out to allow us
to decide on the framework that best suits mobile environment capabilities and fulfils our requirement of providing mobile Web
Services continuously with a light weight processing requirement. This comparison is undertaken and analyzed using three different
test scenarios. Our preliminary work shows that a RESTful-based MWSF is more suitable for mobile environments.
(: +91 452-4390702, 4392702, 4390651
87 Profit-driven Service Request Scheduling in Clouds
A primary driving force of the recent cloud computing paradigm is its inherent cost effectiveness. As in many basic utilities, such as
electricity and water, consumers/clients in cloud computing environments are charged based on their service usage; hence the term
‘pay-peruse’. While this pricing model is very appealing for both service providers and consumers, fluctuating service request volume
and conflicting objectives (e.g., profit vs. response time) between providers and consumers hinder its effective application to cloud
computing environments. In this paper, we address the problem of service request scheduling in cloud computing systems. We
consider a three-tier cloud structure, which consists of infrastructure vendors, service providers and consumers, the latter two
parties are particular interest to us. Clearly, scheduling strategies in this scenario should satisfy the objectives of both parties. Our
contributions include the development of a pricing model—using processor-sharing—for clouds, the application of this pricing model
to composite services with dependency consideration (to the best of our knowledge, the work in this study is the first attempt), and
the development of two sets of profit-driven scheduling algorithms.
88 Platform-as-a-Service Architecture for Real-time Quality of Service Management in Clouds
Cloud computing offers the potential to dramatically reduce the cost of software services through the commoditization of information
technology assets and ondemand usage patterns. However, the complexity of determining resource provision policies for
applications in such complex environments introduces significant inefficiencies and has driven the emergence of a new class of
infrastructure called Platform-as-a-Service (PaaS). In this paper, we present a novel PaaS architecture being developed in the EU IST
IRMOS project targeting real-time Quality of Service (QoS) guarantees for online interactive multimedia applications. The architecture
considers the full service lifecycle including service engineering, service level agreement design, provisioning and monitoring. QoS
parameters at both application and infrastructure levels are given specific attention as the basis for provisioning policies in the
context of temporal constraints. The generic applicability of the architecture is being verified and validated through implemented
scenarios from three important application sectors (film post-production, virtual augmented reality for engineering design,
collaborative e-Learning in virtual worlds).
89 Personalized Recommendation System for the Social Network Services based on Psychographics
Although various Social Network Services available on the Web, there are additional requirements for sharing systematic knowledge
and experiences that are formed in u-Computing environment in relation to the physical location information to support problem
solutions more effectively. As the numbers of information available increases, there are more inadequate and junk information which
consume efforts and time for information search and sharing. In order to support personalized social network services, there are
technical and service oriented requirements for managing and providing accumulative experiences of social users according to their
own knowledge and life-style. Such social network services generally implements a recommendation system that provides services
based on user history and profiles including statistics information for service customization. Therefore there is probability of
producing irrelevant information results because of the fact that the conventional recommendation system does not consider to
support a dynamic generation of the context information of users. In order to overcome accuracy problems for the conventional
recommendations, the paper proposes a personalized recommendation system using psychographics information, which explains
user's lifestyle.
(: +91 452-4390702, 4392702, 4390651
90 Ontology Concepts for Requirements Engineering Process in E-Government Applications
The main challenge for governments worldwide is to transform their systems to deliver efficient and cost effective services through
information and communication technologies. Requirements engineering is a crucial activity in system development process,
especially in the development of large scale systems such as E-gov applications. Inconsistencies and terminology conflicts are
hindering many E-gov applications. This paper develops ontology (mainly concepts) in the domain of requirements engineering
process for E-gov applications. This contributes in enabling software engineers to find out shared-understandable and common
concepts to describe requirements for different domain models used in developing E-gov applications. Several documents related to
E-gov requirement are collected; the main concepts and relationships are extracted and refined. The main theme of this paper is to
provide common concepts and understanding of the requirements for many E-gov applications.
90 XML-based Language for Specific Scientific Data Description
The scientific computing manages massive amounts of very large data sets. The development of description of the format, structure
and semantic content of data is essential for the automatic manipulation of data. The aim of this paper is to define an XML-based
language for describing the structure, semantic and annotation of scientific data. The XML Schema and the Document Type
Definitions (DTDs) that implement the abstract format are provided. The proposed language describes the structure, semantic and
annotation of the scientific data from experiments and simulations.
92 WSOTF: An Automatic Testing Tool for Web Services Composition
This paper presents an automatic conformance testing tool with timing constraints from a formal specification (TEFSM: Timed
Extended Finite State Machine) of web services composition (WSOTF: Web Service composition, Online Testing Framework), that is
implemented by an online testing algorithm. This algorithm combines simultaneously idea of test execution and debug to generate
and simultaneously execute the test cases. In this tool, the complete test scenario (timed test case suite and data) is built during test
execution. This tool focus on unit testing, it means that only the service composition under test is tested and all its partners will be
simulated by the WSOTF. This tool also considers the timing constraints and synchronous time delay. We can also use this tool for
debug that is not easy while we develop a composite of Web service.
93 WORKEM: Representing and Emulating Distributed Scientific Workflow Execution State
Scientific workflows have become an integral part of cyber infrastructure as their computational complexity and data sizes have
grown. However, the complexity of the distributed infrastructure makes design of new workflows, determining the right management
policies, debugging, testing or reproduction of errors challenging. Today, workflow engines manage the dependencies between tasks
of workflows and there are tools available to wrap scientific codes. There is a need for a customizable, isolated and manageable
testing container for design, evaluation and deployment of distributed workflows. To build such an environment, we need to be able
to model and represent, capture and possibly reuse the execution flows within each task of a workflow that accurately captures the
execution behavior. In this paper, we present the design and implementation of WORKEM, an extensible framework that can be used
to represent and emulate workflow execute on state. We also detail the use of the framework in two specific case studies (a) design
and testing of an orchestration system (b) generation of a provenance database. Our evaluation shows that the framework has
minimal overheads and can be scaled to run hundreds of workflows in short durations of time and with a high amount of parallelism.
(: +91 452-4390702, 4392702, 4390651
94 Web Service Adaptation: A unified approach versus multiple methodologies for different scenarios
Web services provide a successful way to communicate distributed applications, in a platform independent and loosely coupled
manner. Even though there are examples of good practice for the design, development and management of Web services, there are
scopes in which Web service adaptation is required, such as context, device and customer adaptation. Current proposals usually
focus on client-side adaptation; however, we consider service-side adaptation more appropriate so that we can avoid larger process
and memory loads for the client implementation. In this paper we propose such adaptation on the service-side, always maintaining a
loosely coupled service implementation as well as keeping its main functionality structure through an aspect-oriented
implementation; besides, we facilitate the work of the developer through a model-driven procedure. Therefore, a loosely coupled
automatically generated code is provided to facilitate service adaptation.
95 Using Federated Identities to access IP-protected Web Resources in Multi-Customer Environments
Several publishers, being used by researchers, have changed their access control from IP-based to federated authentication and
authorization mechanisms typically based on the Security Assertion Markup Language (SAML). While offering unified authentication
and authorization (Single Sign-On) across Web sites, SAML does not offer specific features to enable the accounting of multiple
customers that joined a federation. Thus the majority of publishers offering Web resources, like journals or papers, still use less
complex IP-based or proprietary access control mechanisms. To integrate publishers offering IP-protected resources in federations
several proxy solutions have been developed, but they do not allow differentiating multiple customers in a federation. This paper
introduces a solution to integrate publishers providing IP-protected resources in federations without losing the ability to establish a
customer-based accounting. It presents a migration path for libraries and companies that have already joined or are beginning to
setup a federation and explains accounting enhancements for federated authentication and authorization mechanisms.
96 Using Concept Lattices to Support Web Service Compositions with Backup Services
In SOA, composite applications can be developed on the basis of collections of interacting web services. A service’s functionality is
exposed to the external world by an abstract interface, described by the standard WSDL language, which must be published by
service providers to public registries where service consumers can find them. Nowadays, web service discovery has become a real
problem, because of the lack of public registries to publish and organize the fairly huge number of existing services. In this paper, we
propose an approach based on formal concept analysis (FCA) for classifying and browsing web services. Using this approach, the
web services are organized into a lattice structure, to facilitate their browse and selection. A service lattice reveals the invisible
relations between the services, enabling the discovery of a needed service as well as the identification of its possible alternatives.
Thus, service discovery may be achieved more easily using the service lattice. This facilitates the construction of service
compositions and supports them with backup services to ensure a continuous functionality.
(: +91 452-4390702, 4392702, 4390651
97 UbiRoad: Semantic Middleware for Context-Aw are Smart Road Environments
A smart road environment is such traffic environment that is equipped with all necessary facilities to enable seamless mobile service
provisioning to the users. However, advanced sensors and network architectures deployed within the traffic environment are
insufficient to make mobile service provisioning autonomous and proactive, thus minimizing drivers’ distraction during their
presence in the environment. For that, an Intelligent Transportation System, which is operating on top of numerous sensor and
access networks and governing the process of mobile services provisioning to the users in self-managed and proactive way, must be
deployed. Specifically, such system should provide solutions to the following two interoperability problems: interoperability between
the in-car and roadside devices produced and programmed by different vendors and/or providers, and the need for seamless and
flexible collaboration (including discovery, coordination, conflict resolution and possibly even negotiation) amongst the smart road
devices and services. To tackle these problems, in this paper we propose UbiRoad middleware intending utilization of semantic
languages and semantic technologies for declarative specification of devices’ and services’ behavior, application of software agents
as engines executing those specifications, and establishment of common ontologies to facilitate and govern seamless interoperation
of devices, services and humans. The main contribution of the paper includes the requirements and the architecture of complex
traffic management systems and shows how such systems may benefit from utilization of semantic and agent technologies.
98 UBI-hotspot 1.0: Large-scale Long-term Deployment of Interactive Public Displays in a City Center
We present the design, implementation, deployment and evaluation of a novel urban computing infrastructure called UBI-hotspot. It is
effectively a large interactive public display embedded with other computing resources. We have deployed a network of UBI-hotspots
around downtown Oulu, Finland, to establish a public laboratory for conducting experimental ubiquitous computing research in
authentic urban setting with diverse real users and with sufficient scale and time span. We focus on the first version of the UBI-
hotspot which offers a wide range of services via different interaction modalities. We analyze the usage and user acceptance of the
UBI-hotspots from qualitative and quantitative data collected over a period of eight months. Our first observations show that this type
of infrastructure may be a useful addition to the urban space
99 TRIC: An Infrastructure for Trust and Reputation Across Virtual Communities
Virtual communities are gradually becoming an inherent part of modern life. Trust and reputation systems, which are considered key
enablers of virtual communities, These systems support the accumulation of member reputation information and leverage this
information to increase the likelihood of successful member interactions and to better protect the community from fraudulent
members. Reputation information is an important part of a user’s identity, which makes this data both sensitive and desired for
communities to share. Reputation sharing is also motivated by the individual user that can leverage her state in new communities
using the reputation she gained in others. In previous work we have presented the Cross-Community Reputation (CCR) model for
sharing reputation knowledge among communities. The CCR model identifies the fundamental terms required for a meaningful
sharing of reputation information among communities and proposes means to make the information sharing feasible. This paper
presents the TRIC infrastructure for enabling CCR systems. The major concerns of TRIC are to protect the user’s rights for privacy
and control over her data and to draw some architecture guidelines that can be implemented in more than one way. We explain the
major components required for this type of infrastructure and discuss known design alternatives and their tradeoffs in the case of
TRIC.
(: +91 452-4390702, 4392702, 4390651
100 Towards Autonomic Service Provisioning Systems
This paper discusses our experience in building SPIRE, an autonomic system for service provision. The architecture consists of a set
of hosted Web Services subject to QoS constraints, and a certain number of servers used to run session based traffic. Customers pay
for having their jobs run, but require in turn certain quality guarantees: there are different SLAs specifying charges for running jobs
and penalties for failing to meet promised performance metrics. The system is driven by an utility function, aiming at optimizing the
average earned revenue per unit time. Demand and performance statistics are collected, while traffic parameters are estimated in
order to make dynamic decisions concerning server allocation and admission control. Different utility functions are introduced and a
number of experiments aiming at testing their performance are discussed. Results show that revenues can be dramatically improved
by imposing suitable conditions for accepting incoming traffic; the proposed system performs well under different traffic settings,
and it successfully adapts to changes in the operating environment.
101 Towards an XML Adaptation/Alteration Control Framework
Controlling XML data flow has become imperative due to its widespread regarding information exchange between different systems.
Controlling XML data falls into two main categories: Securing/Protecting the data and Altering/Adapting the data. While the first one
aims at protecting XML data and securing it against theft, the second aims at modifying and adapting the data to satisfy
user/application criteria (e.g., XML filtering and adaptation). Our paper falls into the second category and presents our XML
Alteration/Adaptation control framework allowing both novice and expert programmers to describe basic (e.g., syntax operations) and
complex (e.g., semantic operations) controllers in an easy to use manner based on Petri-Nets. In essence, existing techniques have 2
main drawbacks related to addressing different control scopes and generally requiring a high level of expertise in their respective
areas. The framework proposed here provides means for users to create Alteration/Adaptation aggregation functions based on
composition of existing system functions (e.g., defined in the system libraries), user defined functions built from scratch, or by
combining existent aggregation functions along with user defined functions while maintaining simplicity in their description.
102 Towards an Algebraic Modeling of Emotional States
In this study, we present a new vision of modeling emotional states. Indeed, the proposed model is different from traditional
approaches like ontological representation. It is based on an algebraic representation of emotions. We represent every emotion as a
vector in a space of 8 dimensions where every axis represents a basic emotion. This multidimensional model provides to represent
infinity of emotion and provides powerful mathematical tools for the analysis and the processing of these emotions. Therefore, our
model permits to model not only the basic emotions (e.g., anger, sadness, fear) but also different types of complex emotions like
simulated and masked emotions. Moreover, it permits the exchange of emotional states between heterogeneous applications
regardless to the modalities and sensors used in the detection step
103 Towards a Services-based Approach for Supporting Idea Development Process
FThis paper describes our approach for supporting the idea development process by integrating the ontological vision and services-
oriented approaches. We start by analyzing the existing models for the creative process and by identifying new challenges of the
creative society, while focusing on different kinds of knowledge charactering the creativity process. Second, we argue the importance
of the value creation and semantic consistency of the idea development process, and underline the interdependence of the ontology-
enabled and services-oriented approaches for supporting it. Third, we study the static and dynamic aspects of the development
process and propose the methodology allowing us to identify and model these aspects. We also argue the role of the experience in
creation and discuss how it can be transformed into actionable knowledge for modeling. Fourth, we describe the scope of the
ongoing work aimed to illustrate the feasibility of our model: the intelligent negotiation table bringing together the professionals of
(: +91 452-4390702, 4392702, 4390651
different domains for solving an applied task. Finally, we discuss the perspectives of this research and the priorities of our future
work
104 Towards a Generic Context-Aware Framework for Self-Adaptation of Service-Oriented Architectures
Many software applications are now built from services which run on heterogeneous platforms and are accessed by several users.
These environments are in constant evolution. So applications and services have to dynamically adapt in order to satisfy the quality
of service required by the users. Programming adaptation facilities taking into account the different situations that could happen is a
difficult task. Our objective is to provide mechanisms for self-adaptation of services. We propose a generic framework that allows to
specify different kinds of adaptation, in various environments. This paper presents the overall framework and details some of its
functionalities: the monitoring, the decision to adapt and the planning of adaptation actions. The current state of our implementation
for an OSGi platform is described.
105 Top-Down Approach for Web Services Development
This paper focuses on Web Services development presenting an approach that investigates the model-based software development
towards Service-Oriented Architecture. This work explores software development based on Domain-Specific Modeling for building
WSDL 2.0 meta-model. The Multiple Views CASE tool supports the development process of Web Services according to top-down
approach through the creation of models at a high level of abstraction and the partial code generation. A case study in the Electronic
Health domain illustrates the proposed in this work. The main contribution of the work is leverage agility and ease Web Services
development process through highlevel specification based on the meta-model
106 The Significance of Instant Messaging at Work
Instant messaging has become increasingly prevalent in social life. However, whether to use IM at work remains controversial, due to
its unquantified benefits for organizations. In this study we employ the suggestive metaphor of social network theory to examine IM’s
impact on organizational performance. Specifically, we propose that IM has the potential to enhance organizational agility by enabling
quality communication, building interlocutors’ mutual trust and establishing relationship networks in the workplace. The conceptual
model is validated by 253 survey responses collected from employees of Chinese organizations. The data indicates that IM supports
social networks, which contribute substantially to organizational agility. The theoretical and practical implications of the findings are
discussed.
107 The SHIP Validator: An Annotation-based Content-Validation Framework for Java Applications
In this paper, we investigate the use of Java annotations for software security purposes. In particular, we implement a framework for
content validation where the validation tests are specified by annotations. This approach allows to tag what properties to validate
directly in the application code and eliminates the need for external XML configuration files. Furthermore, the testing code is still kept
separate from the application code, hence facilitating the creation and reuse of custom tests. The main novelty of this framework
consists in the possibility of defining tests for the validation of multiple and interdependent properties. The flexibility and reusability
of tests are also improved by allowing composition and boolean expressions. The main result of the paper is a flexible framework for
content-validation based on Java annotations.
(: +91 452-4390702, 4392702, 4390651
108 The Effects of Untruthful Bids on User Utilities and Stability in Computing Markets
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing
resources in exchange for payment. In this paper we study a real system that is capable of preemptive process migration (i.e. moving
jobs across nodes) and that uses a market-based resource allocation mechanism for job allocation. Specifically, we formalize our
system into a market model and employ simulation-based analysis (performed on real data) to study the effects of users’ behavior on
performance and utility. Typically online settings are characterized by a large amount of uncertainty; therefore it is reasonable to
assume that users will consider simple strategies to game the system. We thus suggest a novel approach to modeling users’
behavior called the Small Risk-aggressive Group model. We show that under this model untruthful users experience degraded
performance. The main result and the contribution of this paper is that using the k-th price payment scheme, which is a natural
adaptation of the classical second-price scheme, discourages these users from attempting to game the market. The preemptive
capability makes it possible not only to use the k-th price scheme, but also makes our scheduling algorithm superior to other non-
preemptive algorithms. Finally, we design a simple one-shot game to model the interaction between the provider and the consumers.
We then show (using the same simulation-based analysis) that market stability in the form of (symmetric) Nash-equilibrium is likely to
be achieved in several cases.
109 The Design of E-learning Services on the Blackboard
This paper discusses the design of e-learning services on the Blackboard (Bb) based on Website Design Methodology (WSDM) and
Australian Flexible Learning Framework (AFLF). It presents the five design phases of WSDM to demonstrate the consistency of these
steps with the design of the Bb system at Nizwa College of Applied Sciences (NCAS). This analysis will lead to better understand of
the features of the Bb as a web based e-learning management system. Also, it emphasizes the need to apply the six steps of the AFLF
while designing and implementing the contents of elearning. This study gives clear answers to the following questions: How can
NCAS designs e-web services handled by the Bb by using the guidelines of AFLF? How can NCAS use WSDM to assess its
performance when it uses the Bb? Do the five design phases of WSDM really exist in NCAS Bb system? Can NCAS combine the AFLF
and WSDM in one complete model of design? These are the important questions will be the main titles for this research. The study
finished with the following fact: NCAS can realistically use the Bb system, because it applied all the five phases of WSDM. Also, by
using the six steps of AFLF in designing and implementing eservices, NCAS will defiantly have a clear road map for design and
implementing e-services for both students and teachers.
110 Stream flow -Programming Model for Data Streaming in Scientific Workflows
Geo-sciences involve large-scale parallel models, high resolution real time data from highly asynchronous and heterogeneous sensor
networks and instruments, and complex analysis and visualization tools. Scientific workflows are an accepted approach to executing
sequences of tasks on scientists’ behalf during scientific investigation. Many geo-science workflows have the need to interact with
sensors that produce large continuous streams of data, but programming models provided by scientific workflows are not equipped
to handle continuous data streams. This paper proposes a framework that utilizes scientific workflow infrastructure and the benefits
of complex event processing to compensate for the impedance mismatch between scientific workflows and continuous data streams.
Further we propose and formalize new workflow semantics that would allow the users to not only incorporate stream in scientific
workflow, but also make use of the functionalities provided by the complex event processing systems effective within the scientific
workflows
(: +91 452-4390702, 4392702, 4390651
111 Stateful Web Service Robustness
Web Services fall under the so-called emerging technologies category and are getting more and more used for Internet applications
or business transactions. Since Web Services are often the foundation of large applications, they need to be reliable and robust. So,
we propose in this paper, a robustness testing method of stateful Web Services, modeled with Symbolic Transition Systems [1]. We
analyze the Web Service observability and the hazard effectiveness in a SOAP environment [2]. Then, we propose a test case
generation method based on the two hazards ”Using unusual values” and ”Replacing /Adding operation names”, which are the only
ones that can be applied. The Amazon E-commerce Web Service is taken as example
112 Simple ID-Based Key Distribution Scheme
A key distribution scheme is used to distribute a session key for broadcasting systems(multicast communications). None of the
existing key distribution schemes with the exception of the Jeong-Kwon-Lee key distribution scheme provide both security against
session state reveal attacks and security against long-term key reveal attacks. Unfortunately, the Jeong-Kwon-Lee key distribution
scheme suffers from three disadvantages in terms of efficiency unlike the existing schemes: (1) Unscalability for the dynamic user
group, (2) Abuse of cryptographic algorithms, and (3) Inefficiency. In this paper, we propose an ID-based key distribution scheme
which is secure against session state reveal attacks and long-term key reveal attacks. Also, our scheme offers the scalability, non-
usage of additional cryptographic algorithms, and efficiency similar to those of the existing schemes
113 Service Collaboration Network: A Novel Mechanism for Web Service Management
This paper proposes a novel approach to service management and monitoring on the basis of service collaboration relations that can
be extracted from service composition history. An undirected and weighted service collaboration network is constructed therefore.
On the network, two abstractions are defined: service centrality, which measures a service’s collaboration capability comparing to
other services for a long period, and service activeness, which measures the frequency of a service’s collaboration with others for a
short period. The capability of service management among Open APIs is investigated and demonstrated. Experimental data are
collected from Programmable Web with the period from 2005-9-14 to 2009-9- 21. Experiments show that the defined metrics can
properly reflect the service properties
114 Semantic Web Services Composition Optimized by Multi-Objective Evolutionary Algorithms
In the web services domain, answering users' needs sometimes requires the construction of new services based on existing ones.
This problem is known as services composition. It consists in combining existing basic services into more sophisticated ones, which
are able to meet users' needs. The composition may be driven by various motivations. In the present paper we focus our attention on
the problem of services composition driven by a set of independent objectives. In this context, we present a new evolutionary multi-
objective optimization algorithm
(: +91 452-4390702, 4392702, 4390651
115 Secure Ubiquitous House and Facility Control Solution
This paper presents an ubiquitous solution for providing a secure access for monitoring and controlling of a smart home by using a
mobile device. It describes an end-to end solution for an user friendly house and facility monitoring and control system. The solution
enables the ubiquitous control of various house and facility automation devices by using a mobile smart phone and mobile internet
access. The paper describes the overall system design, the used components, the implementation, the security featires, as well as the
testing and evaluation of the corresponding service access times.
116 Scalable Mobile Web Services Mediation Framework
: Web services are going mobile. A Mobile Enterprise can be established in a cellular network by participating Mobile Hosts, which act
as web service providers, and their clients. Mobile Hosts enable seamless integration of user specific services to the enterprise, by
following web service standards, also on the radio link and via resource constrained smart phones. However, establishing such a
Mobile Enterprise poses several technical challenges, like the quality of service (QoS) and discovery aspects, for the network and as
well as for mobile phone users. The paper summarizes the challenges and research in this domain, along with our developed mobile
web service mediation framework (MWSMF). We used a cloud computing infrastructure to setup one possible load balancing solution
and also conducted number of tests to show that MWSMF is horizontally scalable. We also showed that elasticity of cloud platform
provides a quick and easy manner to meet the load requirements of Mobile Enterprise.
(: +91 452-4390702, 4392702, 4390651

Elysium Web Services 2010

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Elysium Web Services 2010

Загружено:

Авторское право:

Доступные форматы

Elysium Technologies Private Limited

ISO 9001:2008 A leading Research and Development Division

Abstract Web Services 2010 - 2011

01 A Promotion Mechanism for Scalable Stealth DHT

02 A Model-driven Approach to SKOS Implementation

03 A Map-Reduce System with an Alternate API for Multi-Core Environments

04 A Highly Decoupled Front-end Framework for High Trafficked Web Applications

05 A Global knowledge for Information Retrieval in P2P Networks

06 A Collaborative Decision Support Platform for Product Release Definition

07 A Bi-Criteria Algorithm for Scheduling Parallel Task Graphs on Clusters

08 Adaptive Scheduling for Staged Applications:The Case of Multiple Processing Units

09 A Web Service Architecture for VoIP Services

10 A Thin-Server Runtime Platform for CompositeWeb Applications

11 A S ystem for Evaluation of Arabic Root Extractor Methods

13 A Secure and Legal Network-aware P2P VoD System

14 A Representation of B2B Interacting Actions

15 Application Layer Traffic Optimization in the eMule System

16 Analysis and Evaluation of Two Security Services in SOA

17 An Ontology for Musical Performances Analysis

18 An MPI-Stream Hybrid Programming Model for Computational Clusters

22 An evaluation of the benefits of fine-grained value-based scheduling on general purpose clusters

24 An Effective and High-quality Quer y RelaxationSolution on the Deep Web

25 An Anal ysis of Traces from a Production Map Reduce Cluster

26 An Adaptive Data Prefetcher for High-Performance Processors

28 AGORA Framework for Service Discovery and Resource Allocation

30 Detecting Unauthorized Modification of HTTP Communication with Steganography

31 Designing Accelerator-Based Distributed Systems for High Performance

33 Context-Aw are Service Discovery and Adaptation Based on Semantic Matchmaking

34 Context-Aw are Interaction Models in Cross-Organizational Processes

35 Context-aware Campaigns in Social Networks

37 Casual Multi-user Web Collaboration by Low ering Communication Barriers

38 Cache Mechanism in P2P Streaming Media System

39 BPEL2DENEB: Translation of BPEL Processes to Executable High-level Petri Nets

40 BlueLearn: Low-Cost Interactive Learning System

41 BlogMiner: Web Blog Mining Application for Classification of Movie Reviews

42 Bandwidth Allocation for Iterative Data-dependent e-Science Applications

45 Granularity-Aw areWork-Stealing for Computationally-Uniform Grids

46 Global SOA: RSS-based Web Services Repository and Ranking

49 Experiments with Memory-to-Memory Coupling for End-to-End Fusion Simulation Workflows

50 Evenly Distributing Combinatorial Tasks in a Peer-to-Peer System

51 ERGOT: A Semantic-based System for Service Discovery in Distributed Infrastructures

53 Enhancing Availability with Self-Organization Extensions in a SOA Platform

54 eLearning 2.0 and Social, Practice-oriented Communities to Improve Knowledge in Companies

55 Elastic Site: Using Clouds to Elastically Extend Site Resources

56 EGSI: TGKA based Security Architecture for Group Communication in Grid

57 Effort-Oriented Classification Matrix of Web Service Composition

59 eDemocs: Electronic Distributed Election Monitoring over Cellular Systems

60 E-business online payment and credit card industry development in China

61 D ynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds

62 Distributed Diskless Checkpoint for Large Scale Systems

63 On-demand Overlay Networks for Large Scientific Data Transfers

64 On-demand Dynamic Location-based Services Using Web Services

65 Nontraditional Approach to XML Web Services Interactions

67 Multimodal Interaction in Distributed and Ubiquitous Computing

68 Multi-Modal CBIR Algorithm based on Latent Semantic Indexing

69 Modeling conference contribution management using Web Services

70 Methodology for Efficient Execution of SPMD Applications on Multicore Environments

72 LearningPeerSelection: A Quer y Routing Approach for Information Retrieval in P2P Systems

73 Investigation of GPS-based Embedded Guiding System for Scenic Spots

74 Interoperability Testing Software for Sharing Medical Documents and Images

75 Improving Performance of Declarative Query Execution in DHT-based Systems

76 Identification and Analysis of Skype Peer-to-Peer Traffic

77 SAMI: The SLA Management Instance

80 Retrieving Cultural Heritage Information with Google Earth