bluuebunny/crossref_metadata_2025 huggingface dataset:
Educational presentation systems: a workflow‐oriented survey and technical discussion
Authors: Turban Georg
Published: June 2010

Purpose

Within the last few years, a couple of presentation systems have been developed for assisting higher education. This article aims to provides an overview of available systems and highlight differences regarding their individual intention and technical approaches.

Design/methodology/approach

The article consists of a comprehensive system and literature review and provides a taxonomy. Famous systems are categorized and discussed including their individual approaches.

Findings

The advantages and disadvantages of different approaches are presented. The discussion provides readers also with information relevant for rating systems according their personal needs.

Research limitations/implications

The categorization for presentation systems can be extended and applied for the categorization of audience response systems.

Practical implications

A source of information that assists users while they choose an appropriate existing presentation system and developers while they design new ones.

Originality/value

This article presents a workflow‐oriented taxonomy for educational presentation systems which is used to analyze several systems. In addition, the different underlying conceptual and technical approaches of different systems are discussed in this work. The provided information is useful for users and developers of such systems.
Pervasive location‐based systems: The fundamental challenges between vision and reality
Authors: Pinto Helder , José Rui
Published: June 2010

Ideally, a pervasive location‐based system should allow mobile users to go anywhere and benefit from personalized and pro‐active services tailored for their current activity. However, existing location‐based systems are still far from this vision, as they are either aimed at very specific activities or too generic to provide real value to specific user activities. The objective of this work is to identify and characterize the most fundamental challenges involved in the design of pervasive location‐based systems. The approach is based on the idea that such challenges will correspond to the key design tradeoffs for location‐based systems. Building on what is believed to be the high‐level requirements for a truly pervasive locationbased system, this paper proposes a design space with four design dimensions: functional scope, added‐value, pro‐activity, and adaptability. After analyzing a representative set of location‐based systems under that design space, the combinations between functional scope and any of the other dimensions are identified as the main contradictions in the design of such systems. The paper finally discusses the research challenges associated to the identified tradeoffs.
Designing a configurable services platform for mobile context‐aware applications
Authors: Dockhorn Costa Patrícia , Ferreira Pires Luís , van Sinderen Marten J.
Published: June 2010

Context‐aware services platforms aim at supporting the handling of contextual information in order to provide better user‐tailored services. This paper proposes a novel services platform architecture to support mobile context‐aware applications, giving emphasis to the configurability of the platforms generic functionality. The paper introduces concepts and a language to cope with configurability aspects. The paper also reports on the implementation of a prototype, which implements a Web services‐based context‐aware services platform that runs on top of 3G networks.
Hierarchical mobile network routing: Route optimization and micro‐mobility support for NEMO
Authors: Jeong Moon‐Sang , Park Jong‐Tae
Published: June 2010

A lot of recent research has been focused on developing network mobility management to support the movement of a mobile network consisting of several mobile nodes. The IETF NEMO working group proposed the NEMO basic support protocol that defines a methodology for supporting such network mobility using bi‐directional tunneling between the home agent and the mobile router. However, this protocol has been found to suffer from the so‐called ‘dog‐leg problem’, and despite alternative research efforts to solve this problem, there are still limitations in the efficiency of real time data transmission and intra‐domain communication. Accordingly, the current paper proposes a new route optimization methodology that uses unidirectional tunneling and a tree‐based intra‐domain routing mechanism. As such, the proposed scheme can provide faster signaling and data transmission and be easily extended to support micro‐mobility without any additional extensions. The performance of the proposed scheme is also evaluated to demonstrate its efficiency.
Impact of topology on Bluetooth Scatternet
Authors: Huang Leping , Chen Hongyuan , Sivakumar T.V.L.N. , Kashima Tsuyoshi , Sezaki Kaoru
Published: June 2010

To utilize Bluetooth as a layer 2 multi‐hop subnet for global IP network, there are two missing protocols in current Bluetooth stack: network formation and routing. In this paper, we propose our network formation and routing protocols optimized for such Bluetooth subnset usage scenarios to fill this gap. In this paper, we first present some observations on performance degradations of Bluetooth PAN due to network topologies and topology change when radio independant protocols are implemented. And then we analyze the reason of performance degradation. Based on our analysis, we first propose a flexible scatternet formation algorithm under conference scenario for multi‐hop communication. By using proposed method, scatternet can be formed flexibly with star, mesh, or linked line based on several parameters like number of maximum piconets that a gateway Bluetooth device can participate, and whether loops are needed in the resulting scatternet to achieve better network performance. To utilize topology information in multi‐hop communication, we propose a Cross‐layer Optimized Routing for Bluetooth (CORB) CORB is a QoS‐extended AODV routing protocol with mainly two optimizations between networking layer and underlying Bluetooth MAC layer. The first optimization is to use a new load metric. (LM) in QoS routing protocol instead of number of hops in conventional best effort routing. LM is derived from estimation of nodes’ link bandwidth, which reflects the different roles of nodes in Bluetooth scatternet. This proposal helps routing protocol to bypass heavily loaded nodes, and find route with larger bandwidth. The second optimization is to adjust LM and some MAC layer parameters in response to the unstable network topology caused by movement and change of indoor radio condition. Finally, We present some simulation and experiment results based on implementation, which prove the effectiveness of our protocols.
A unified management framework for linux and Java applications on mobile phones
Authors: Asakura Yoshiharu , Okuyama Gen , Nakayama Yoshitaka , Usui Kazutoshi , Nakamoto Yukikazu
Published: June 2010

A unified application management framework for Linux and Java applications on mobile phones is presented. Although Java‐based applications for mobile phones are in strong demand, the complexity of interaction between these platform independent programs and the core functionality of mobile phones has made software development difficult. The unified framework presented here provides uniform application state management and inter‐application communication between Java based and operating‐system specific applications, allowing native Linux applications to be directly replaced with the equivalent Java application. The framework is described in detail and a trial implementation of the system is evaluated.
A scalable mobile phone‐based system for multiple vital signs monitoring and healthcare
Authors: Chen Wenxi , Wei Daming , Ding Shuxue , Cohen Michael , Wang Hui , Tokinoya Shigeru , Takeda Naotoshi
Published: June 2010

To meet the increasing needs for ubiquitous healthcare, a mobile phone‐based system for monitoring multiple vital signs is under development. In this paper, design and implementation of the system architecture are described. The hierarchy of this system comprises three layers, which respectively handle multiple vital signs sensing, data/command communication via either wireless or wired means, and healthcare management. The fundamental basis of the sensing layer is a wearable cordless sensor device for monitoring vital signs without discomfort to the user during daily activities. The data communication layer performs bi‐directional information exchange between the sensing layer and the management layer. The uppermost management layer conducts data mining and analysis for risk factors assessment and healthcare. Overall considerations of implementation method and prototype fabrication are outlined. Finally, applicability to a variety of real‐world situations, and provision of customizable solutions not only for home healthcare but also for other vital signs‐related domains (such as emergency rescue and safety guarantee) are discussed. Three of the most promising applications based upon this system are described.
Data caching and query processing in MANETs
Authors: Li Jinbao , Li Yingshu , Thai My T. , Li Jianzhong
Published: June 2010

This paper investigates query processing in MANETs. Cache techniques and multi‐join database operations are studied. For data caching, a group‐caching strategy is proposed. Using the cache and the index of the cached data, queries can be processed at a single node or within the group containing this single node. For multi‐join, a cost evaluation model and a query plan generation algorithm are presented. Query cost is evaluated based on the parameters including the size of the transmitted data, the transmission distance and the query cost at each single node. According to the evaluations, the nodes on which the query should be executed and the join order are determined. Theoretical analysis and experiment results show that the proposed group‐caching based query processing and the cost based join strategy are efficient in MANETs. It is suitable for the mobility, the disconnection and the multi‐hop features of MANETs. The communication cost between nodes is reduced and the efficiency of the query is improved greatly.
Approach of context‐aware computing with uncertainty for ubiquitous active service
Authors: Zhang Degan , Zeng Guanping , Chen Enyi , Zhang Baopeng
Published: June 2010

Active service is one of key problems of ubiquitous computing paradigm. Context‐aware computing is helpful to carry out this service. Because the context is changing with the movement or shift of the user, its uncertainty often exists. Context‐aware computing with uncertainty includes obtaining
context information, forming model, fusing of aware context and managing context information. In this paper, we focus on modeling and computing of aware context information with uncertainty for making dynamic decision during seamless mobility. Our insight is to combine dynamic context‐aware computing with improved Random Set Theory (RST) and extended D‐S Evidence Theory (EDS). We re‐examine formalism of random set, argue
the limitations of the direct numerical approaches, give new modeling mode based on RST for aware context and propose our computing approach of modeled aware context.In addition, we extend classic D‐S Evidence Theory after considering context’s reliability, time‐efficiency and relativity, compare relative computing methods. After enumerating experimental examples of our active space, we provide the evaluation. By comparisons, the validity of new context‐aware computing approach based on RST or EDS for ubiquitous active service with uncertainty information has been successfully tested.
Content‐based routing in highly dynamic mobile ad hoc networks
Authors: Baldoni Roberto , Beraldi Roberto , Querzoni Leonardo , Cugola Gianpaolo , Migliavacca Matteo
Published: June 2010

The decoupling and asynchrony properties of the content‐based publish‐subscribe paradigm makes it very appealing for dynamic wireless networks, like those that often occur in pervasive computing scenarios. Unfortunately, most of the currently available content‐based publish‐subscribe middleware do not fit the requirements of such extreme scenarios, in which the network is subject to very frequent topological reconfigurations due to mobility of nodes. In this paper we propose a protocol for content‐based message dissemination tailored to Mobile Ad
Hoc Networks (MANETs) showing frequent topological changes. Message routing occurs without the support of any network‐wide dispatching infrastructure thus eliminating the need of maintaining such infrastructure on top of a physical network continuously changing its topology. The paper reports an extensive simulation study that confirms the suitability of the proposed approach along with a stochastic analysis of the central mechanism adopted by the protocol.
(Dis)trust certification model for large access in a pervasive environment
Authors: Saadi Rachid , Pierson Jean‐Marc , Brunie Lionel
Published: June 2010

The challenge of pervasive computing consists in offering access to computing services anywhere and anytime with any devices. However, before it becomes a reality, the problems of access control and authentication have to be solved, among others. Existing solutions are inadequate without adaptation to
this specific environment. Among the promising approaches, the trust paradigm seems to be more flexible than others. We base this proposal on this paradigm to implement a distrust model, so‐called APC (Access Pass Certificate). The main objective of this model is to enable authorized user to roam and to access trusted sites though they are not known locally. A user can claim two kinds of APCs provided by two kinds of sites: the home site
(where the user has an account) and the trusted site (that trusts the user). Using these certificates, the user can progressively
extend her access scope. This model implements a decentralized mapping policy, where the correspondence between the user’s home profile and her rights in the trusted sites is determined by the trusted site. This distrust model and its implementation are presented in this article where we exhibit its importance for large but controlled access in pervasive environments.
Multi‐criteria routing in wireless sensor‐based pervasive environments
Authors: Li Qinglan , Beaver Jonathan , Amer Ahmed , Chrysanthis Panos K. , Labrinidis Alexandros , Santhanakrishnan Ganesh
Published: June 2010

Wireless sensor networks are expected to be an integral part of any pervasive computing environment. This implies an ever‐increasing need for efficient energy and resource management of both the sensor nodes, as well as the overall sensor network, in order to meet the expected quality of data
and service requirements. There have been numerous studies that have looked at the routing of data in sensor networks with the sole intention of reducing communication power consumption. However, there has been comparatively little prior art in the area of multi‐criteria based routing that exploit both the semantics of queries and the state of sensor nodes to improve network service longevity. In this paper, we look at routing in sensor networks
from this perspective and propose an adaptive multi‐criteria routing protocol. Our algorithm offers automated reconfiguration of the routing tree as demanded by variations in the network state to meet application service requirements. Our experimental results show that our approach consistently outperforms, in terms of Network Lifetime and Coverage, the leading semantic‐based routing algorithm which reconfigures the routing tree at fixed
periods.
Resolving knowledge discrepancies in situation‐aware systems
Authors: Meissen Ulrich , Pfennigschmidt Stefan , Voisard Agnés , Wahnfried Tjark
Published: June 2010

Demand‐orientation is of crucial importance in mobile and pervasive information services in order to ensure the delivery of the right information at the right time and at the right place. In the past years, increasing attention has been devoted to the notion of personalized services that take the situation of the user into account. The trade‐off is to ensure appropriate information supply while preventing information overload. Comparing situations predicted by the system with the expectations of a user yields information about “so‐farunexpected” changes the user should be informed about. This paper describes an approach to identify and to resolve these knowledge discrepancies by informing the user about them in order to support his or her situation‐awareness. Our approach is illustrated in two applications.
Content quality assessment and acceptance testing in location‐based services
Authors: Katasonov Artem , Veijalainen Jari , Sakkinen Markku
Published: June 2010

In this paper, we develop and evaluate an approach to assessing the content quality in a location‐based service (LBS). The proposed approach, instead of assessing the quality in absolute terms such as completeness or accuracy, measures the effect that the imperfection of the content is having on the reliability of that specific LBS. We apply the basic ideas from Software Reliability Engineering (SRE), but develop a
modification of SRE, 2‐Branch, in order to separate content quality from other factors, such as positioning imprecision, and to reduce the measurement error. In our experimental study, we first compare 2‐Branch to the standard SRE, after which we experimentally analyze some properties of SRE methodology as such in the context of an LBS. The experiments indicate that 2‐Branch has in most cases a lower measurement error than the standard SRE. A corollary to that is that 2‐Branch can achieve, therefore, as low an error level as the standard SRE, using a worse and thus cheaper oracle. Getting a good oracle is probably the main cost factor in evaluating the quality of an information service, thus being able to use a cheaper one may
result in significant savings.
Clustering concept and QoS constraints in dense mobile ad hoc networks
Authors: Nimbona Fabien , Pierre Samuel , Quintero Alejandro
Published: June 2010

In mobile ad hoc networks, many routing protocols use broadcast mechanism to find route whereas one of the wireless network challenges is the bandwidth optimisation. This mechanism increases the control overhead and consumes bandwidth and energy. The overhead penalty increases with the density and the network size. Thus is important to reduce the number of participants in that mechanism. One of the used solutions consists of determining clusterheads nodes. In this paper, we propose an algorithm for choosing clusterheads (SRCAC). Each node in the network broadcasts its ID, status and election index. The election index is a combination of potentiality index and stability index. The potentiality index is a linear combination of the mobile resources like processor speed, RAM and ROM memories. The stability index shows the cluster life time. Then, we use SRCAC to build clusters. We suggest a backup clusterhead which could become the principal clusterhead when the first breaks down. To improve the reliability of interclusters communications, we build a mesh between gateway and distributed gateway. Moreover, we introduce Quality of Service (QoS) constraints in the ODMRP (On Demand Multicast Routing Protocol) mobility prediction version.We compare our algorithm with the WCA (Weighted Clustering Algorithm for Mobile Ad hoc Networks) algorithm in terms of clusterheads. The results show that our algorithm performs better than the WCA and, finally, the deterioration of the performances imposed by the constraints on this ODMRP version is unimportant.
Energy‐efficient capacity‐constrained routing in wireless sensor networks
Authors: Patel Maulin , Venkateson S. , Chandrasekaran R.
Published: June 2010

A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many routing schemes proposed in the literature try to minimize the energy consumed in routing or maximize the lifetime of the sensor network without taking into consideration limited capacities of nodes and wireless links. This can lead to congestion, increased delay, packet losses and ultimately to retransmission of packets, which will waste considerable amount of energy. This paper presents a Minimum‐cost Capacity‐constrained Routing (MCCR) protocol which minimize the total energy consumed in routing while guaranteeing that the total load on each sensor node and on each wireless link does not exceed its capacity. The protocol is derived from polynomial‐time minimum‐cost flow algorithms. Therefore protocol is simple and scalable. The paper improves the routing protocol in (1) to incorporate integrality, node capacity and link capacity constraints. This improved protocol is called Maximum Lifetime Capacity‐constrained Routing (MLCR). The objective of MLCR protocol is to maximize the time until the first battery drains its energy subject to the node capacity and link capacity constraints. A strongly polynomial time algorithm is proposed for a special case of MLCR problem when the energy consumed in transmission by a sensor node is constant. Simulations are performed to analyzed the performance of the proposed protocols.
Combining next fit of bin packing with deficit round robin for efficient slot scheduling in Bluetooth
Authors: Hwan Ahn Hye , Yang Youn Hee , Je Lee Eung , Won Park Chang
Published: June 2010

Bluetooth wireless technology is a low power, low cost and short‐range RF technology that permits communication between bluetooth enabled devices, and focuses on replacement of cables between electronic devices. Communication between Bluetooth devices follows a strict master‐slave scheme. Each master device can have up to 7 active slaves and forms a so called piconet. In Bluetooth employing conventional scheduling policies such as Round Robin (RR), POLL or NULL packet is sent when the Master or Slave node does not have any data to send which causes a significant waste of resources. The DRR (Deficit Round Robin) scheduling algorithm can avoid the waste of time and slot of the RR scheduling at the sacrifice of fairness. In this paper we propose an improved DRR (IDRR) scheduling algorithm which effectively combines the DRR and bin packing algorithm. Computer simulation reveals that slot utilization is increased up to about 60% while the total number of used slots is decreased up to about 100%. The proposed IDRR scheduling is thus effective for not only basic data transmission but also real‐time multimedia data transmission.
Pervasive Management
Authors: Pfeifer Tom , Wade Vincent , Agoulmine Nazim
Published: June 2010

The explosive growth of the Internet, the proliferation of mobile networks and the increasing difficulty in managing multi‐vendor environments and the services that they provide have altered forever the dynamics of the information and communications technology industry, the expectations of its customers and the business models under which it operates.
A biologically‐inspired multi‐agent framework for autonomic service management
Authors: Chiang Frank , Braun Robin , Hughes John
Published: June 2010

This paper describes the design of a scalable bio‐mimetic framework that addresses several key issues of autonomous agents in the functional management domain of complex Ubiquitous Service‐Oriented Networks.We propose an autonomous network service management platform ‐ SwarmingNet, which is motivated by observations of the swarm intelligence in biological systems (e.g., Termite, Ant/Bees colonies, or Locusts ).
In this SwarmingNet architecture, the required network service processes are implemented by a group of highly diverse and autonomic objects. These objects are called TeleService Solons (TSSs) as elements of TeleService Holons (TSHs), analoguous to individual insects as members of the whole colony. A single TSS is only able to pursue simple behaviors and interactions with local neighbors, on the contrary, a group of TSSs have the capabilities
of fulfilling the complex tasks relating to service discovery and service activation.We simulate a service configuration process for a Multimedia Messaging Service, and a performance comparison between the bio‐agents and normal agents is analyzed. Finally, we conclude that through bio‐swarming intelligence behaviors, this infrastructure develops the enhanced self‐X capabilities which give IP networks advantages of instinctive compatibility, efficiency and scalability.
Enabling autonomous management of distributed pervasive environments
Authors: Ganna Mohammed , Horlait Eric
Published: June 2010

Current networks are providing plenty of services that users can access and use. These services are more and more pervasive and deployed in different networks distributed across an environment. This raises the problem of managing such environments in order to grant access to services from anywhere and to adapt the environment’s networks to dynamic changes. Also, there is a need of an autonomous behavior to reduce human intervention and assure environment’s consistency. This autonomous and distributed behavior leads to the definition and integration of existing and new technologies to enable autonomous distributed management. This is fulfilled by providing paradigms that bring awareness about the surroundings and enabled tools to manage and adapt the environment’s resources. The main problem is to dynamically provide auto‐configuration of networks to deal with the frequent changes which results from users’ roaming, changing services constraints, and changing services themselves, and adding, upgrading or removing policies. The outcome of these issues is a dynamic system with complex management. Hence, this paper proposes the integration of different techniques to provide an autonomous, distributed, and secure management including auto‐configuration, adaptation, and auto‐protection of pervasive environments. Then, policies control the behavior of the environment, devices configuration and the enforcement of security mechanisms to protect sensitive data. Also, mobile agents are employed to distribute management tasks across the distributed environment. In order to provide auto‐protection capabilities, the autonomous behavior of the environment have to be secured. Actually, this security issue is addressed by defining an agent‐based Public Key Infrastructure (PKI) with X.509 certificates. The agent ensures then that the security functions are applied across all the distributed networks, where specific agents are responsible for conveying necessary information and certificates to local environments. Finally, the paper proposes a semantic‐based privacy management approach using ontologies to decide how privacy information is handled in the environment.
DRKH: A Power Efficient Encryption Protocol for Wireless Devices
Authors: Kholaif Ahmad M. , Fayek Magda B. , Eissa Hussein S. , Baraka Hoda A.
Published: June 2010

In this paper, we present Dynamic Re‐keying with Key Hopping (DRKH) encryption protocol that uses RC4 encryption technique to ensure a strong security level with the advantage of low execution cost compared to other IEEE 802.11 security schemes. Low computational complexity makes DRKH suitable for solar‐ and battery‐powered handheld devices such as nodes in Solar ESS (Extended Service Set) and wireless sensor networks. Our design goal is to eventually integrate DRKH with different emerging wireless technologies. However, in this paper, we will focus on the integration of DRKH with 802.11 standard since it is the most widely deployed wireless technology. The results and analysis show that DRKH overcomes all the security threats with Wired Equivalent Privacy (WEP) protocol while consuming a much lower power than WEP, Wi‐Fi Protected Access (WPA) 1.0 and WPA 2.0.
Multi‐Hop Cellular IP: A New Approach to Heterogeneous Wireless Networks
Authors: Xie Bin , Kumar Anup , Cavalcanti Dave , Agrawal Dharma P.
Published: June 2010

This paper proposes a new Heterogeneous Multi‐hop Cellular IP (MCIP) network that integrates multi‐hop communication with Cellular IP. MCIP increases the coverage of the wireless network and improves the network robustness against adverse propagation phenomena by supporting communication in dead zones and areas with poor radio coverage. MCIP includes three components: location management, connection management and route reconfiguration. Location management is responsible for maintaining the location information for Mobile Stations (MSs) in a local domain. Connection management establishes an initial path for data transmission and a route reconfiguration mechanism is proposed to take advantage of various multi‐hop connection alternatives available based on terminal interfaces, network accessibility and topology. Our simulation results show that MCIP performs well in networks of various sizes including scalability, throughput, and packet delay.
Business collaboration models
and their Business Context‐dependent Web Choreography in BPSS
Authors: Hofreiter Birgit , Huemer Christian , Winiwarter Werner
Published: June 2010

Prior to conducting business via the Web, business partners agree on the business processes they are able to support. In ebXML, the choreography of these business processes is described as an instance of the so‐called business process specification schema (BPSS). For execution purposes the BPSS must be defined in the exact business context of the partnership. Reference models for B2B processes developed by standard
organizations usually span over multiple business contexts to avoid a multitude of similar processes. In this paper we present how business collaboration models following the UN/CEFACT Modeling Methodology (UMM) are expressed in ebXML BPSS. To allow a mapping from multi‐context business collaboration models to a context‐specific choreography in ebXML BPSS we extend UMM to capture constraints for different business contexts
Towards the identification of keywords in the web site text content: A methodological approach
Authors: Velásquez Juan D. , Ríos Sebastían A. , Bassi Alejandro , Yasuda Hiroshi , Aoki Terumasa
Published: June 2010

Since the creation of the web, the designers are looking for friendlier ways of make web page contents, which pictures, sounds, movies and free texts attract the users’ interest. Special attention receive the text content, because is the most frequently parameter used to retrieve information from the web. A simple way in order to understand the user’s text preferences, could be collect the words used in a searching. However, this information is only well‐know for the owner of the specific searching engine. In this paper we introduce a methodology in order to extract the most interest words for a user in a particular web site, based of the user browsing behavior and the web page text content. The methodology was tested using data originated in a bank web site showing the effectiveness of our approach.
Personalized websites for mobile devices using dynamic cascading style sheets
Authors: Stormer Henrik
Published: June 2010

With the rise of mobile devices like cellphones and Personal Digital Assistants (PDAs) in the last years, the demand for specialized mobile solutions grows. Newly defined protocols like WAP or i‐Mode can be used to adapt Internet appearances to mobile devices. However, it is often an elaborate work to achieve these adaptions as almost all pages have to be rewritten. This paper shows an approach of semi automatical page generation
for mobile devices. It is assumed that a general HTML page is already existing. Based on this page, an approach of generating personalized mobile device compatible pages is shown. This approach is illustrated using the software eSarine. eSarine is an e‐shop softare that can be used to set up an electronic shop.
Using advanced transaction meta‐models for creating transaction‐aware web service environments
Authors: Hrastnik Peter , Winiwarter Werner
Published: June 2010

Recently, the software industry has published several proposals for transactional processing in the Web service world. Even though most proposals support arbitrary transaction models, there exists no standardized way to describe such models. This paper describes potential impacts and use cases of utilizing advanced transaction meta‐models in the Web service world and introduces two suitable meta‐models for defining arbitrary advanced transaction models. In order to make these meta‐models more usable in Web service environments, they had to be enhanced, and XML representations of the enhanced models had to be developed.
Ontology based query expansion framework for use in medical information systems
Authors: Wollersheim D. , Rahayu J. W.
Published: June 2010

This paper presents a framework which combines data and text retrieval techniques to exercise and evaluate ontology based query expansions. We prepare by using linguistic techniques to identify query and document concepts, locating them in a ontologically defined semantic space. Expansions originate
from the identified query concepts, with success determined by matching in the relevant document set. We identify three orthogonal dimensions that can affect query expansion success; relationship source, success measure technique, and query expansion technique. Expansion technique is further divided into six
different categories: simple pruning, complex probability, voting, directional, semantic propagation, and multiple source concept. We describe each technique and show examples where they would be useful. The system architecture used facilitates plugging in of various expansion and evaluation routines, and flowing results from one method to the next. The system is useful for microanalysis of query expansion, discovering which components of ontological derived knowledge most influence query expansion success. In this work, we apply our framework to the medical domain.
A web usage lattice based mining approach for intelligent web personalization
Authors: Zhou Baoyao , Cheung Hui Siu , Fong Alvis C. M.
Published: June 2010

With the explosive growth of information available on the World Wide Web, it has become much more difficult to access relevant information from the Web. One possible approach to solve this problem is web personalization. In this paper, we propose a novel WUL (Web Usage Lattice) based mining approach for mining association access pattern rules for personalized web recommendations. The proposed approach aims to mine a reduced set of effective association pattern rules for enhancing the online performance of web recommendations. We have incorporated the proposed approach into a personalized web recommender system known as AWARS. The performance of the proposed approach is evaluated based on the efficiency and the quality. In the efficiency evaluation, we measure the number of generated rules and the runtime for online recommendations. In the quality evaluation, we measure the quality of the recommendation service based on precision, satisfactory and applicability. This paper will discuss the proposed WUL‐based mining approach, and give the performance of the proposed approach in comparison with the Apriori‐based algorithms.
Developing applications for internet telephony: A case study on the use of web services for conferencing in SIP networks
Authors: El Barachi May , Glitho Roch H. , Dssouli Rachida
Published: June 2010

Applications offered to end‐users as value‐added services play a vital role in the success of Internet telephony service providers. Today’s standard frameworks for developing them have several shortcomings that motivate the need for novel frameworks. Web services are an emerging paradigm for program‐to‐program interactions over the Internet. This paradigm is a prime candidate for application development in Internet Telephony because it may aid in addressing the drawbacks of today’s standard frameworks. This paper presents a case study that gives insights in the suitability of Web services as a standard framework for the development of conferencing applications in Internet Telephony. The case study includes the definition and the implementation of a novel Web service for conferencing, the implementation of the conference server in a SIP environment, the development of several conferencing applications (including a game), and performance evaluation. Based on this case study, we conclude that Web services are very promising for conferencing application development in Internet Telephony, especially as the performance can be significantly improved with the emerging techniques that are briefly discussed in the paper.
XML schema design approach
Authors: Hong Quang Nguyen , Rahayu Wenny
Published: June 2010

This paper presents a systematic XML Schema design approach which conceptually captures semantics of the problem domain at conceptual level and represents such semantics in XML Schema at schema level. At the conceptual level, objects, their inter‐relationships and constraints are semantically powered by object‐oriented models. At the schema level, these conceptual semantics are comprehensively represented in textbased representation of XML Schema using various schema components and design styles, each of which offers different quality characteristics. Two primary design styles in use are nesting and linking. The nesting design styles are developed based on the choice of schema components and their definition/declaration scopes (global vs. local), whereas the linking design styles use referencing facilities provided by XML Schema and other XML technologies such as XLink and XPointer. With an in‐depth analysis of outstanding problems of existing approaches, the proposed design approach is motivated to help improve the quality and robustness of the XML documents in large‐scale XML‐based applications.
Designing websites with eXtensible web (xWeb) methodology
Authors: Rajagopalapillai Rajugan , Gardner William , Chang Elizabeth , Dillon Tharam S.
Published: June 2010

Today, eXtensible Markup Language (XML) is fast emerging as the dominant standard for storing, describing, representing and interchanging data among various enterprises systems and databases in the context of complex web enterprises information systems (EIS). Conversely, for web EIS (such as ecommerce and portals) to be successful, it is important to apply a high level, model driven solutions and meta‐data vocabularies
to design and implementation techniques that are capable of handling heterogonous schemas and documents. For this, we need a methodology that provides a higher level of abstraction of the domain in question with rigorously defined standards that are to be more widely understood by all stakeholders of the system. To‐date, UML has proven itself as the language of choice for modeling EIS using OO techniques. With the introduction of XML Schema, which provides rich facilities for constraining and defining enterprise XML content, the combination of UML and XML technologies provide a good platform (and the flexibility) for modeling, designing and representing complex enterprise contents for building successful EIS. In this paper, we show how a layered view model coupled with a proven user interface analysis framework (WUiAM) is utilized in providing architectural construct and abstract website model (called eXtensible Web, xWeb), to model, design and implement simple, usercentred, collaborative websites at varying levels of abstraction.
The uniqueness xWeb is that the model data (web user interface definitions, website data descriptions and constraints) and the web content are captured and represented at the conceptual level using views (one model) and can be deployed (multiple platform specific models) using one or more implementation models.
Visualization of XML conceptual schema recovered from XML schema definition
Authors: Fong Joseph , Kuen Cheung San , Shiu Herbert , Chung Cheung Chi
Published: June 2010

XML Schema Definition (XSD) is in the logical level of XML model and is used in most web applications. At present, there is no standard format for the conceptual level of XML model. Therefore, we introduce an XML Tree Model as an XML conceptual schema for representing and confirming the data semantics according to the user requirements in a diagram. The XML Tree Model consists of nodes representing all elements within the XSD. We apply reverse engineering from an XSD to an XML Tree Model to assist end users in applying an XML database for information highway on the Internet. The data semantics recovered for visualization include root element, weak elements, participation, cardinality, aggregation, generalization, categorization, and n‐ary association, and which can be derived by analyzing the structural constraints of XSD based on its key features such as key, keyref, minOccurs, maxOccurs, Choice, Sequence and extension. We use the Eclipse user interface for generating a graphical view for XML conceptual schema.
The concept of web event and a practical model‐driven approach to web information system development
Authors: Nguyen Kinh , Dillon Tharam S. , Danielsen Erik
Published: June 2010

This article proposes the concept of web clientserver event together with its associated taxonomy which yields a formal specification for such an event. The concept, in conjunction with the concept of atomic use case (reviewed in the article), is then used as a key element for a model‐driven approach to web information system development. The outcome is a new method for web information systems development that reduces the complex web‐based hypermedia navigation behaviour to a much simpler event‐driven behaviour. On the strength of that realized simplicity, the method provides (i) a set of platform‐independent models that completely characterizes the application, and (ii) a well‐defined process to map the combined model to any chosen platform‐dependent implementation.
Protecting web applications from DDoS attacks by an active distributed defense system
Authors: Xiang Yang , Zhou Wanlei
Published: June 2010

In the last a few years a number of highly publicized incidents of Distributed Denial of Service (DDoS) attacks against high‐profile government and commercial websites have made people aware of the importance of providing data and services security to users. A DDoS attack is an availability attack, which is characterized by an explicit attempt from an attacker to prevent legitimate users of a service from using the desired resources. This paper introduces the vulnerability of web applications to DDoS attacks, and presents an active distributed defense system that has a deployment mixture of sub‐systems to protect web applications from DDoS attacks. According to the simulation experiments, this system is effective in that it is able to defend web applications against attacks. It can avoid overall network congestion and provide more resources to legitimate web users.
Web services on embedded devices
Authors: Schall Daniel , Aiello Marco , Dustdar Schrahram
Published: June 2010

The capabilities of embedded devices such as smartphones are steadily increasing and provide the great flexibility of data access and collaboration while being mobile. From the distributed computing point of view, fundamental issues in mobile computing include heterogeneity in terms of varying device capabilities (i.e., operating systems and various hardware platforms), performance characteristics and real‐time behavior, and the ability to discover and interact with peers seamlessly. Web services are a family of XML based protocols to achieve interoperability among loosely coupled networked applications. We propose the use of Web services on embedded devices in order to solve interoperability issues in distributed mobile systems. We discuss various toolkits available for embedded devices and investigate performance characteristics of embedded Web services on smartphones. Our goal is to guide the design of Web services based applications on mobile devices, and provide estimates of performance that can be expected.
A comparative study of web resource mining algorithms for one‐stop learning
Authors: Lim SeungJin , Ko Youngrae
Published: June 2010

Web resource mining for one‐stop learning is an effort to turn the Web into a convenient and valuable resource for education for the self‐motivated, knowledge seeking student. It is aimed at providing an efficient and effective algorithm to generate an extremely small set of self‐contained Web pages which are adequate for the student to study well about the technical subject of her choice on her own pace without requiring
clicking through numerous linked resources. In this paper, we present three different scoring measures which can be plugged into such an algorithm designed for the objective stated above. We also demonstrate the effectiveness of the algorithms proposed in this paper which are equipped with a choice of the three scoring measures by showing their promising experimental results. Our algorithms achieved up to 87% of precision in average in automatically finding relatively suitable Web resources for one‐stop learning as opposed to 9% of precision offered by general purpose search engines.
Web crawlers compared
Authors: Girardi Christian , Ricca Filippo , Tonella Paolo
Published: June 2010

Tools for the assessment of the quality and reliability of Web applications are based on the possibility of downloading the target of the analysis. This is achieved through Web crawlers, which can automatically navigate within a Web site and perform proper actions (such as download) during the visit. The most important performance indicators for a Web crawler are its completeness and robustness, measuring respectively the ability to visit the Web site entirely and without errors. The variety of implementation languages and technologies used for Web site development makes these two indicators hard to maximize. We conducted an evaluation study, in which we tested several of the available Web crawlers.
Modeling views in the layered view model for XML using UML
Authors: Rajagopalapillai Rajugan , Chang Elizabeth , Dillon Tharam S. , Feng Ling
Published: June 2010

In data engineering, view formalisms are used to provide flexibility to users and user applications by allowing them to extract and elaborate data from the stored data sources. Conversely, since the introduction of EXtensible Markup Language (XML), it is fast emerging as the dominant standard for storing, describing, and interchanging data among various web and heterogeneous data sources. In combination with XML Schema, XML provides rich facilities for defining and constraining user‐defined data semantics and properties, a feature that is unique to XML. In this context, it is interesting to investigate traditional database features, such as view models and view design techniques for XML. However, traditional view formalisms are strongly coupled to the data language and its syntax, thus it proves to be a difficult task to support views in the case of semi‐structured data models. Therefore, in this paper we propose a Layered View Model (LVM) for XML with conceptual and schemata extensions. Here our work is three‐fold; first we propose an approach to separate the implementation and conceptual aspects of the views that provides a clear separation of concerns, thus, allowing analysis and design of views to be separated from their implementation. Secondly, we define representations to express and construct these views at the conceptual level. Thirdly, we define a view transformation methodology for XML views in the LVM, which carries out automated transformation to a view schema and a view query expression in an appropriate query language. Also, to validate and apply the LVM concepts, methods and transformations developed, we propose a viewdriven application development framework with the flexibility to develop web and database applications for XML, at varying levels of abstraction.