WILEY Journal Home Page
Papers under review through 2008
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | The Hydra Parallel Programming System | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1205 | ||||||||
| Article ID | CPE1205 | ||||||||
| Author Name(s) | Franklin E. Powers1Gita Alaghband2 | ||||||||
| Author Email(s) | Gita.Alaghband@cudenver.edu2 | ||||||||
| Affiliation(s) | Department of Computer Science and Engineering, University of Colorado at Denver and Health&Sciences Center, Campus Box 109, P.O. Box 173364, Denver, CO 80217-3364, U.S.A. 1 2 | ||||||||
| Keyword(s) | parallel Java, parallel languages, multicore architectures, parallel processing, shared memory parallel language, | ||||||||
Abstract |
|||||||||
| The Hydra Parallel Programming System, a new parallel language extension to Java, and its supporting software are described. It is a fairly simple yet powerful language designed to address a number of areas that have not received much attention. One of these areas is the recompilation of parallel programs at runtime to allow a parallel program to adapt to the architecture it is executing on. The first version of this software system focuses on smaller Symmetric Multiprocessing and compatible architectures which are becoming more common. This particular class of machines has a great need for more options in the area of parallel programming among the vastly popular Java language programmers. Hydra programs will run as sequential Java on machines that do not have the parallel support or do not have an implemented Hydra runtime system without requirement of any modifications to the program. This paper describes the language, compares it with other languages (specifically with JOMP, an OpenMP implementation for Java), presents a brief discussion on compiling and executing Hydra programs, presents some sample benchmarks and their performance on three platforms, and concludes with a discussion of issues and future directions for Hydra. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Active target particle swarm optimization | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1207 | ||||||||
| Article ID | CPE1207 | ||||||||
| Author Name(s) | Ying-Nan Zhang1Qing-Ni Hu2Hong-Fei Teng3 | ||||||||
| Author Email(s) | tenghf@dlut.edu.cn3 | ||||||||
| Affiliation(s) | School of Electronic and Information Engineering, Dalian University of Technology, Dalian 116023, People's Republic of China 1School of Mechanical Engineering, Dalian University of Technology, Dalian 116023, People's Republic of China 2 3 | ||||||||
| Keyword(s) | particle swarm, complex method, optimization, benchmark functions, | ||||||||
Abstract |
|||||||||
| We propose an active target particle swarm optimization (APSO). APSO uses a new three-target velocity updating formula, i.e. the best previous position, the global best position and a new target position (called active target). In this study, we distinguish APSO from EPSO (extended PSO)/PSOPC (PSO with passive congregation) by the different methods of getting the active target. Note that here EPSO and PSOPC are the two existing methods for using three-target velocity updating formula, and getting the third (active) target from the obtained positions by the swarm. The proposed APSO gets the active (third) target using complex method, where the active target does not belong to the existing positions. We find that the APSO has the advantages of jumping out of the local optimum and keeping diversity; however, it also has the disadvantages of adding some extra computation expenses. The experimental results show the competitive performance of APSO when compared with PSO, EPSO, and PSOPC. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | A practical method to analyze workflow logic models | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1210 | ||||||||
| Article ID | CPE1210 | ||||||||
| Author Name(s) | Yu Huang1Hanpin Wang2Wen Zhao3Chunxiang Xu4 | ||||||||
| Author Email(s) | whpxhy@pku.edu.cn2 | ||||||||
| Affiliation(s) | Department of Computer Science, Peking University, Beijing 100871, China 1 2 National Engineering Center of Software Engineering, Peking University, Beijing 100871, China 3 4 | ||||||||
| Keyword(s) | workflow logic, workflow verification, synchronized reachability graph, reduction, | ||||||||
Abstract |
|||||||||
| The analysis of workflow is crucial to the correctness of workflow applications. This paper introduces a simple and practical method for analyzing workflow logic models. Firstly, some definitions of the models and some properties, such as throughness, no-redundant-transition and boundedness, are presented. Then, we propose an approach based on synchronized reachability graphs (SRGs) to verify these properties. The SRG uses the characteristics of synchronizers in workflow logic models and mitigates the state explosion by constructing synchronized occurrence sequences rather than interleaving occurrence sequences. This paper also proposes some refined and feasible reduction rules which can preserve vital properties of workflow logic models. Using these two techniques, the SRG-based verification method can achieve higher efficiency. Furthermore, this research also develops a verification tool based on the method, presents the analysis results of some practical cases and compares our method with others. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Tunneling enhanced by web page content block partition for focused crawling | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1211 | ||||||||
| Article ID | CPE1211 | ||||||||
| Author Name(s) | Tao Peng1Changli Zhang2Wanli Zuo3 | ||||||||
| Author Email(s) | taopengjlu@yahoo.com.cn1 | ||||||||
| Affiliation(s) | College of Computer Science and Technology, Jilin University, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Changchun 130012, China 1 2 3 | ||||||||
| Keyword(s) | focused crawling, tunneling, web page segmentation, content block, | ||||||||
Abstract |
|||||||||
| The complexity of web information environments and multiple-topic web pages are negative factors significantly affecting the performance of focused crawling. A highly relevant region in a web page may be obscured because of low overall relevance of that page. Segmenting the web pages into smaller units will significantly improve the performance. Conquering and traversing irrelevant page to reach a relevant one (tunneling) can improve the effectiveness of focused crawling by expanding its reach. This paper presents a heuristic-based method to enhance focused crawling performance. The method uses a Document Object Model (DOM)-based page partition algorithm to segment a web page into content blocks with a hierarchical structure and investigates how to take advantage of block-level evidence to enhance focused crawling by tunneling. Page segmentation can transform an uninteresting multi-topic web page into several single topic context blocks and some of which may be interesting. Accordingly, focused crawler can pursue the interesting content blocks to retrieve the relevant pages. Experimental results indicate that this approach outperforms Breadth-First, Best-First and Link-context algorithm both in harvest rate, target recall and target length. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | A comprehensive analytical model of interconnection networks in large-scale cluster systems | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1222 | ||||||||
| Article ID | CPE1222 | ||||||||
| Author Name(s) | Bahman Javadi1Jemal H. Abawajy2Mohammad K. Akbari3 | ||||||||
| Author Email(s) | jemal@deakin.edu.au2 | ||||||||
| Affiliation(s) | Computer Engineering and Information Technology Department, Amirkabir University of Technology, 424 Hafez Ave., Tehran, Iran 1School of Engineering and Information Technology, Deakin University, Geelong, Vic. 3217, Australia 2 3 | ||||||||
| Keyword(s) | analytical modeling, super-cluster, interconnection networks, flow control mechanisms, latency, throughput, | ||||||||
Abstract |
|||||||||
| The trends in parallel processing system design and deployment have been toward networked distributed systems such as cluster computing systems. Since the overall performance of such distributed systems often depends on the efficiency of their communication networks, performance analysis of the interconnection networks for such distributed systems is paramount. In this paper, we develop an analytical model, under non-uniform traffic and in the presence of communication locality, for the m-port n-tree family interconnection networks commonly employed in large-scale cluster computing systems. We use the proposed model to study two widely used interconnection networks flow control mechanism namely the wormhole and store&forward. The proposed analytical model is validated through comprehensive simulation. The results of the simulation demonstrated that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | The File Mover: high-performance data transfer for the grid | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 1 | ||||||||
| Date | 01 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1250 | ||||||||
| Article ID | CPE1250 | ||||||||
| Author Name(s) | Cosimo Anglano1Massimo Canonico2 | ||||||||
| Author Email(s) | cosimo.anglano@unipmn.it1 | ||||||||
| Affiliation(s) | Dipartimento di Informatica, Università del Piemonte Orientale, Alessandria, Italy 1 2 | ||||||||
| Keyword(s) | data grids, file transfer, overlay networks, | ||||||||
Abstract |
|||||||||
| The exploration in many scientific disciplines (e.g. High-Energy Physics, Climate Modeling, and Life Sciences) involves the production and the analysis of massive data collections, whose archival, retrieval, and analysis require the coordinated usage of high-capacity computing, network, and storage resources. To obtain satisfactory performance, these applications require the availability of a high-performance, reliable data transfer mechanisms, able to minimize the data transfer time that often dominates their execution time. In this paper we present the File Mover, an efficient data transfer system specifically tailored to the needs of data-intensive applications, that exploits the overlay networks paradigm to provide superior performance with respect to conventional file transfer systems. An extensive experimental evaluation, carried out by means of a proof-of-concept implementation of the File Mover for a variety of network scenarios, shows the ability of the File Mover to outperform alternative data transfer systems. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Exploring the feasibility of proactive reputations | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 2 | ||||||||
| Date | 02 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1186 | ||||||||
| Article ID | CPE1186 | ||||||||
| Author Name(s) | Gayatri Swamynathan1Ben Y. Zhao2Kevin C. Almeroth3 | ||||||||
| Author Email(s) | gayatri@cs.ucsb.edu1 | ||||||||
| Affiliation(s) | Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA 93106, U.S.A. 1 2 3 | ||||||||
| Keyword(s) | anonymity, entropy, peer-to-peer, reputation, trust, | ||||||||
Abstract |
|||||||||
| Reputation mechanisms help peers in a peer-to-peer system avoid unreliable or malicious peers. In application-level networks, however, short peer lifetimes mean reputations are often generated from a small number of past transactions. These reputation values are less ‘reliable’, and more vulnerable to bad-mouthing or collusion attacks. We address this issue by introducing proactive reputations, a first-hand history of transactions initiated to augment incomplete or short-term reputation values. We present several mechanisms to generate proactive reputations, along with a statistical similarity metric to measure their effectiveness. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Exploring the robustness of BitTorrent peer-to-peer content distribution systems | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 2 | ||||||||
| Date | 02 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1187 | ||||||||
| Article ID | CPE1187 | ||||||||
| Author Name(s) | Nikitas Liogkas1Robert Nelson2Eddie Kohler3Lixia Zhang4 | ||||||||
| Author Email(s) | nikitas@cs.ucla.edu1 | ||||||||
| Affiliation(s) | University of California-Los Angeles, Los Angeles, CA, U.S.A. 1 2 3 4 | ||||||||
| Keyword(s) | BitTorrent, exploits, free-riding, robustness, selfish, | ||||||||
Abstract |
|||||||||
| This paper assesses BitTorrent's robustness against selfish peers who try to download content faster than their fair share by abusing existing protocol mechanisms. We present three exploits that can deliver potential benefits to a selfish peer and evaluate their impact on both public and private download sessions. Our results show that BitTorrent is quite robust against these exploits. Although selfish peers can sometimes attain high download throughput and compliant peers' download rates suffer slightly in consequence, we observe no significant degradation of the overall system's quality of service. We identify scenarios where a selfish peer could attain significant benefits at the expense of compliant peers, and discuss the protocol characteristics that render these scenarios unlikely and hence lead to the system's robustness. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Gossip-based search selection in hybrid peer-to-peer networks | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 2 | ||||||||
| Date | 02 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1188 | ||||||||
| Article ID | CPE1188 | ||||||||
| Author Name(s) | M. Zaharia1S. Keshav2 | ||||||||
| Author Email(s) | matei@matei.ca1 | ||||||||
| Affiliation(s) | School of Computer Science, University of Waterloo, Waterloo, ON, Canada 1 2 | ||||||||
| Keyword(s) | peer-to-peer systems, search, global statistics, gossip, | ||||||||
Abstract |
|||||||||
| We present GAB, a search algorithm for hybrid peer-to-peer networks, that is, networks that search using both flooding and a distributed hash table (DHT). GAB uses a gossip-style algorithm to collect global statistics about document popularity to allow each peer to make intelligent decisions about which search style to use for a given query. Moreover, GAB automatically adapts to changes in the operating environment. Synthetic and trace-driven simulations show that compared to a simple hybrid approach that always floods first, trying a DHT if too few results are found, GAB reduces the response time by 25-50% and the average query bandwidth cost by 45%, with no loss in recall. GAB scales well, with only a 7% degradation in performance despite a tripling in system size. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | TRIBLER: a social-based peer-to-peer system | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 2 | ||||||||
| Date | 02 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1189 | ||||||||
| Article ID | CPE1189 | ||||||||
| Author Name(s) | J. A. Pouwelse1P. Garbacki2J. Wang3A. Bakker4J. Yang5A. Iosup6D. H. J. Epema7M. Reinders8M. R. van Steen9H. J. Sips10 | ||||||||
| Author Email(s) | d.h.j.epema@tudelft.nl7 | ||||||||
| Affiliation(s) | Department of Computer Science, Delft University of Technology, The Netherlands 1 2 3 Department of Computer Science, Vrije Universiteit, The Netherlands 4 5 6 7 8 9 10 | ||||||||
| Keyword(s) | peer-to-peer, social-based, taste buddies, | ||||||||
Abstract |
|||||||||
| Most current peer-to-peer (P2P) file-sharing systems treat their users as anonymous, unrelated entities, and completely disregard any social relationships between them. However, social phenomena such as friendship and the existence of communities of users with similar tastes or interests may well be exploited in such systems in order to increase their usability and performance. In this paper we present a novel social-based P2P file-sharing paradigm that exploits social phenomena by maintaining social networks and using these in content discovery, content recommendation, and downloading. Based on this paradigm's main concepts such as taste buddies and friends, we have designed and implemented the TRIBLER P2P file-sharing system as a set of extensions to BitTorrent. We present and discuss the design of TRIBLER, and we show evidence that TRIBLER enables fast content discovery and recommendation at a low additional overhead, and a significant improvement in download performance. Copyright 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Robust incentives via multi-level Tit-for-Tat | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 2 | ||||||||
| Date | 02 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1190 | ||||||||
| Article ID | CPE1190 | ||||||||
| Author Name(s) | Qiao Lian1Yu Peng2Mao Yang3Zheng Zhang4Yafei Dai5Xiaoming Li6 | ||||||||
| Author Email(s) | lianqiao@gmail.com1 | ||||||||
| Affiliation(s) | Roxbeam Media Network Corporation, Beijing, People's Republic of China 1Peking University, Beijing, People's Republic of China 2Microsoft Research Asia, Beijing, People's Republic of China 3 4 5 6 | ||||||||
| Keyword(s) | P2P, incentive, collusion, | ||||||||
Abstract |
|||||||||
| Much work has been done to address the need for incentive models in real deployed peer-to-peer networks. In this paper, we discuss problems found with the incentive model in a large, deployed peer-to-peer network, Maze. We evaluate several alternatives, and propose an incentive system that generates preferences for well-behaved nodes while correctly punishing colluders. We discuss our proposal as a hybrid between Tit-for-Tat and EigenTrust, and show its effectiveness through simulation of real traces of the Maze system. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Editorial | ||||||||
| Article Title | Special Issue: Recent Advances in Peer-to-Peer Systems and Security | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 2 | ||||||||
| Date | 02 00 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1239 | ||||||||
| Article ID | CPE1239 | ||||||||
| Author Name(s) | Ben Y. Zhao1 | ||||||||
| Author Email(s) | |||||||||
| Affiliation(s) | University of California at Santa Barbara, U.S.A. 1 | ||||||||
| Keyword(s) | ., | ||||||||
Abstract |
|||||||||
| No Abstract | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Performance prediction for a code with data-dependent runtimes | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 3 | ||||||||
| Date | 03 10 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1191 | ||||||||
| Article ID | CPE1191 | ||||||||
| Author Name(s) | S. A. Jarvis1B. P. Foley2P. J. Isitt3D. P. Spooner4D. Rueckert5G. R. Nudd6 | ||||||||
| Author Email(s) | stephen.jarvis@warwick.ac.uk1 | ||||||||
| Affiliation(s) | High Performance Systems Group, Department of Computer Science, University of Warwick, Coventry CV4 7AL, U.K. 1 2 3 4 Visual Information Processing Group, Department of Computing, Imperial College, London SW7 2BZ, U.K. 5 6 | ||||||||
| Keyword(s) | performance prediction, medical image processing, cluster computing, Grid computing, | ||||||||
Abstract |
|||||||||
| In this paper we present a predictive performance model for a key biomedical imaging application found as part of the U.K. e-Science Information eXtraction from Images (IXI) project. This code represents a significant challenge for our existing performance prediction tools as it has internal structures that exhibit highly variable runtimes depending on qualities in the input data provided. Since the runtime can vary by more than an order of magnitude, it has been difficult to apply meaningful quality of service criteria to workflows that use this code. The model developed here is used in the context of an interactive scheduling system which provides rapid feedback to the users, allowing them to tailor their workloads to available resources or to allocate extra resources to scheduled workloads. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | This paper is based on the conference paper submitted to the U.K. e-Science All Hands Meeting 2005 | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 3 | ||||||||
| Date | 03 10 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1193 | ||||||||
| Article ID | CPE1193 | ||||||||
| Author Name(s) | Robert Geldhill1Sarah Kent2Andrew Milsted3Richard Chapman4Jonathan W. Essex5Jeremy G. Frey6 | ||||||||
| Author Email(s) | j.g.frey@soton.ac.uk6 | ||||||||
| Affiliation(s) | School of Chemistry, University of Southampton, Southampton SO17 1BJ, U.K. 1 2 3 4 5 6 | ||||||||
| Keyword(s) | malaria, Grid, docking, e-learning, | ||||||||
Abstract |
|||||||||
| e-Malaria (http://emalaria.soton.ac.uk/) aims to bring together 16-18 year old school students with university researchers to explain aspects of computational drug design using the example of the hunt for a new anti-Malaria drug. Malaria kills a child every 30 seconds, and 40% of the world's population lives in countries where the disease is endemic. Resistance to existing drugs is increasing and there is a growing need for new compounds. This challenge is being offered to school students who will use a distributed drug search and selection system via a Web interface to design potential drugs. The project makes use of industrial code for the docking study (‘GOLD’) and as such presents valuable lessons in how to achieve the integration of industrial programs into a ‘free’ outreach environment. The results of the trials are displayed in an accessible manner, giving students an opportunity for discussion and debate both with peers and with university contacts. The initial project has been extended to provide a similar challenge for undergraduate chemists as part of a chemical informatics course at a level relevant to more advances chemical skills. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | AMUSE: autonomic management of ubiquitous e-Health systems | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 3 | ||||||||
| Date | 03 10 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1194 | ||||||||
| Article ID | CPE1194 | ||||||||
| Author Name(s) | E. Lupu1N. Dulay2M. Sloman3J. Sventek4S. Heeps5S. Strowes6K. Twidle7S.-L. Keoh8A. Schaeffer-Filho9 | ||||||||
| Author Email(s) | e.c.lupu@imperial.ac.uk1 | ||||||||
| Affiliation(s) | Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, U.K. 1 2 3 Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow G12 8RZ, U.K. 4 5 6 7 8 9 | ||||||||
| Keyword(s) | autonomic computing, pervasive systems, self-configuration, policy-based management, | ||||||||
Abstract |
|||||||||
| Future e-Health systems will consist of low-power on-body wireless sensors attached to mobile users that interact with an ubiquitous computing environment to monitor the health and well being of patients in hospitals or at home. Patients or health practitioners have very little technical computing expertise so these systems need to be self-configuring and self-managing with little or no user input. More importantly, they should adapt autonomously to changes resulting from user activity, device failure, and the addition or loss of services. We propose the Self-Managed Cell (SMC) as an architectural pattern for all such types of ubiquitous computing applications and use an e-Health application in which on-body sensors are used to monitor a patient living in their home as an exemplar. We describe the services comprising the SMC and discuss cross-SMC interactions as well as the composition of SMCs into larger structures. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | An ontology-based approach to handling information quality in e-Science | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 3 | ||||||||
| Date | 03 10 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1195 | ||||||||
| Article ID | CPE1195 | ||||||||
| Author Name(s) | A. Preece1P. Missier2S. Embury3B. Jin4M. Greenwood5 | ||||||||
| Author Email(s) | apreece@csd.abdn.ac.uk1 | ||||||||
| Affiliation(s) | Department of Computing Science, University of Aberdeen, Aberdeen, U.K. 1School of Computer Science, University of Manchester, Manchester, U.K. 2 3 4 5 | ||||||||
| Keyword(s) | information quality, ontology, e-Science, Semantic Grid, | ||||||||
Abstract |
|||||||||
| In this paper we outline a framework for managing information quality (IQ) in an e-Science context. In contrast to previous approaches that take a very abstract view of IQ properties, we allow scientists to define the quality characteristics that are of importance to them in their particular domain. For example, ‘accuracy’ may be defined in terms of the conformance of experimental data to a particular standard. User-scientists specify their IQ preferences against a formal ontology, so that the definitions are machine-manipulable, allowing the environment to classify and organize domain-specific quality characteristics within an overall quality management framework. As an illustration of our approach, we present an example Web service that computes IQ annotations for experiment datasets in transcriptomics. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Payment and negotiation for the next generation Grid and Web | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 3 | ||||||||
| Date | 03 10 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1196 | ||||||||
| Article ID | CPE1196 | ||||||||
| Author Name(s) | Jeremy Cohen1John Darlington2William Lee3 | ||||||||
| Author Email(s) | jeremy.cohen@imperial.ac.uk1 | ||||||||
| Affiliation(s) | London e-Science Centre, Department of Computing, Imperial College London, South Kensington Campus, London SW7 2AZ, U.K. 1 2 3 | ||||||||
| Keyword(s) | Grid markets, Grid economics, payment, Internet commerce, software services, | ||||||||
Abstract |
|||||||||
| We present a proposal for a next-generation Internet based on chargeable Web Services and Utility Computing realized by a series of open but interacting markets. We demonstrate through the U.K. e-Science project ‘A Market for Computational Services’ the development of some of the fundamental building blocks for such a Grid computational marketplace. This paper describes the motivation behind this restructuring of the Internet and Web-based activities as a series of markets and how Grid Computing technologies can contribute towards this goal. The paper details the work undertaken at the London e-Science Centre to build a framework to create and support negotiable and chargeable Web Services. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK | ||||||||
| Category | Research Article | ||||||||
| Article Title | Steering via the image in local, distributed and collaborative settings | ||||||||
| Volume ID | 20 | ||||||||
| Issue ID | 3 | ||||||||
| Date | 03 10 2008 | ||||||||
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1197 | ||||||||
| Article ID | CPE1197 | ||||||||
| Author Name(s) | J. D. Wood1H. Wright2 | ||||||||
| Author Email(s) | h.wright@hull.ac.uk2 | ||||||||
| Affiliation(s) | School of Computing, University of Leeds, Leeds LS2 9JT, U.K. 1Department of Computer Science, University of Hull, Hull HU6 7RX, U.K. 2 | ||||||||
| Keyword(s) | image-based steering, computational steering, computer-supported collaboration, Grid computing, | ||||||||
Abstract |
|||||||||
| Computational steering is a valuable mechanism for scientific investigation in which the parameters of a running program can be altered and the results visualized immediately. In a previous paper we put forward an architecture for computational steering that recognizes visualization as both the logical output and the input route. In this paper we investigate the practicalities of applying this architecture in local, distributed and collaborative steering. The work adopts a state-transition modelling approach, keeping parameters and results together in the display in order to present information consistently. The outcome is a manageably small set of states that could apply to many different simulations. We also present the results of a preliminary user study on the demonstrator we have constructed. Copyright © 2007 John Wiley & Sons, Ltd. | |||||||||
| Publisher | John Wiley & Sons, Ltd. Chichester, UK |
| Category | Research Article |
| Article Title | Performance analysis of a semantics-enabled service registry |
| Volume ID | 20 |
| Issue ID | 3 |
| Date | 03 10 2008 |
| DOI(URI) | http://dx.doi.org/10.1002/cpe.1204 |
| Article ID | CPE1204 |
| Author Name(s) | W. Fang1S. Miles2 |