<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jordi Vilaplana</style></author><author><style face="normal" font="default" size="100%">Francesc Solsona</style></author><author><style face="normal" font="default" size="100%">Francesc Abella</style></author><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">Josep Rius Torrento</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Cloud Paradigm Applied to e-Health</style></title><secondary-title><style face="normal" font="default" size="100%">BMC Med. Inf. {&amp;} Decision Making</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">35</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Baxter, Robert M.</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The DATA Bonanza: Improving Knowledge Discovery in Science, Engineering, and Business</style></title><secondary-title><style face="normal" font="default" size="100%">Wiley Series on Parallel and Distributed Computing (Editor: Albert Y. Zomaya)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Big Data</style></keyword><keyword><style  face="normal" font="default" size="100%">Data Intensive</style></keyword><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">Data Streaming</style></keyword><keyword><style  face="normal" font="default" size="100%">Databases</style></keyword><keyword><style  face="normal" font="default" size="100%">Dispel</style></keyword><keyword><style  face="normal" font="default" size="100%">Distributed Computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge Discovery</style></keyword><keyword><style  face="normal" font="default" size="100%">Workflows</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Inc.</style></publisher><pages><style face="normal" font="default" size="100%">580</style></pages><isbn><style face="normal" font="default" size="100%">978-1-118-39864-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">With the digital revolution opening up tremendous opportunities in many fields, there is a growing need for skilled professionals who can develop data-intensive systems and extract information and knowledge from them. This book frames for the first time a new systematic approach for tackling the challenges of data-intensive computing, providing decision makers and technical experts alike with practical tools for dealing with our exploding data collections.  Emphasising data-intensive thinking and interdisciplinary collaboration,  The DATA Bonanza: Improving Knowledge Discovery in Science, Engineering, and Business examines the essential components of knowledge discovery, surveys many of the current research efforts worldwide, and points to new areas for innovation. Complete with a wealth of examples and DISPEL-based methods demonstrating how to gain more from data in real-world systems, the book:
* Outlines the concepts and rationale for implementing data-intensive computing in organisations
* Covers from the ground up problem-solving strategies for data analysis in a data-rich world
* Introduces techniques for data-intensive engineering using the Data-Intensive Systems Process Engineering Language DISPEL
* Features in-depth case studies in customer relations, environmental hazards, seismology, and more
* Showcases successful applications in areas ranging from astronomy and the humanities to transport engineering
* Includes sample program snippets throughout the text as well as additional materials on a companion website
The DATA Bonanza is a must-have guide for information strategists, data analysts, and engineers in business, research, and government, and for anyone wishing to be on the cutting edge of data mining, machine learning, databases, distributed systems, or large-scale computing.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Data-Intensive Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Analysis Experts</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge Discovery</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">5</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">127-145</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Part II: &quot;Data-intensive Knowledge Discovery&quot;, focuses on the needs of data-analysis experts. It illustrates the problem-solving strategies appropriate for a data-rich world, without delving into the details of underlying technologies. It should engage and inform data-analysis specialists, such as statisticians, data miners, image analysts, bio-informaticians or chemo-informaticians, and generate
ideas pertinent to their application areas.

Chapter 5: &quot;Data-intensive Analysis&quot;, introduces a set of common problems that data-analysis experts often encounter, by means of a set of scenarios of increasing levels of complexity. The scenarios typify knowledge discovery challenges and the presented solutions provide practical methods; a starting point for readers addressing their own data challenges.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Data-Intensive Components and Usage Patterns</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data Analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Components</style></keyword><keyword><style  face="normal" font="default" size="100%">Registry</style></keyword><keyword><style  face="normal" font="default" size="100%">Workflow Libraries</style></keyword><keyword><style  face="normal" font="default" size="100%">Workflow Sharing</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">7</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">165-179</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 7: &quot;Data-intensive components and usage patterns&quot;, provides a systematic review of the components that are commonly used in knowledge discovery tasks as well as common patterns of component composition. That is, it introduces the processing elements from which knowledge discovery solutions are built and common composition patterns for delivering trustworthy information.  It reflects on how these components and patterns are evolving in a data-intensive context.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The Data-Intensive Survival Guide</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data-Analysis Experts</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Architecture</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-intensive Computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Engineers</style></keyword><keyword><style  face="normal" font="default" size="100%">Datascopes</style></keyword><keyword><style  face="normal" font="default" size="100%">Dispel</style></keyword><keyword><style  face="normal" font="default" size="100%">Domain Experts</style></keyword><keyword><style  face="normal" font="default" size="100%">Intellectual Ramps</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge Discovery</style></keyword><keyword><style  face="normal" font="default" size="100%">Workflows</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">3</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">37-60</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 3: &quot;The data-intensive survival guide&quot;, presents an overview of all of the elements of the proposed data-intensive strategy. Sufficient detail is presented for readers to understand the principles and practice that we recommend. It should also provide a good preparation for readers who choose to sample later chapters. It introduces three professional viewpoints: domain experts, data-analysis experts, and data-intensive engineers. Success depends on a balanced approach that develops the capacity of all three groups. A data-intensive architecture provides a flexible framework for that balanced approach. This enables the three groups to build and exploit data-intensive processes that incrementally step from data to results. A language is introduced to describe these incremental data processes from all three points of view. The chapter introduces ‘datascopes’ as the productized data-handling environments and ‘intellectual ramps’ as the ‘on ramps’  for the highways from data to knowledge.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Data-Intensive Thinking with DISPEL</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data-Intensive Machines</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Thinking, Data-intensive Computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Dispel</style></keyword><keyword><style  face="normal" font="default" size="100%">Distributed Computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge Discovery</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">4</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Inc.</style></publisher><pages><style face="normal" font="default" size="100%">61-122</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 4: &quot;Data-intensive thinking with DISPEL&quot;, engages the reader with technical issues and solutions, by working through a sequence of examples, building up from a sketch of a solution to a large-scale data challenge. It uses the DISPEL language extensively, introducing its concepts and constructs. It shows how DISPEL may help designers, data-analysts, and engineers develop
solutions to the requirements emerging in any data-intensive application domain. The reader is taken through simple steps initially, this then builds to conceptually complex steps that are necessary to cope with the realities of real data providers, real data, real distributed systems, and long-running processes.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paul Martin</style></author><author><style face="normal" font="default" size="100%">Yaikhom, Gagarine</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Definition of the DISPEL Language</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">{Parallel and Distributed Computing, series editor Albert Y. Zomaya}</style></tertiary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data Streaming</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-intensive Computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Dispel</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">10</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Inc.</style></publisher><pages><style face="normal" font="default" size="100%">203-236</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 10: &quot;Definition of the DISPEL language&quot;, describes the novel aspects of the DISPEL language: its constructs, capabilities, and anticipated programming style.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The Digital-Data Challenge</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Big Data</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-intensive Computing, Knowledge Discovery</style></keyword><keyword><style  face="normal" font="default" size="100%">Digital Data</style></keyword><keyword><style  face="normal" font="default" size="100%">Digital-Data Revolution</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">1</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">5-13</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Part I: &lt;em&gt;Strategies for success in the digital-data revolution&lt;/em&gt;, provides an executive summary of the whole book to convince strategists, politicians, managers, and educators that our future data-intensive society requires new thinking, new behavior, new culture, and new distribution of investment and effort. This part will introduce the major concepts so that readers are equipped to discuss and steer their organization’s response to the opportunities and obligations brought by the growing wealth of data. It will help readers understand the changing context brought about by advances in digital devices, digital communication, and ubiquitous computing.

Chapter 1: &lt;em&gt;The digital-data challenge&lt;/em&gt;, will help readers to understand the challenges ahead in making good use of the data and introduce ideas that will lead to helpful strategies. A global digital-data revolution is catalyzing change in the ways in which we live, work, relax, govern, and organize. This is a significant change in society, as important as the invention of printing or the industrial revolution, but more challenging because it is happening globally at lnternet speed. Becoming agile in adapting to this new world is essential.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The Digital-Data Revolution</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data</style></keyword><keyword><style  face="normal" font="default" size="100%">Information</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge Discovery</style></keyword><keyword><style  face="normal" font="default" size="100%">Social Impact of Digital Data</style></keyword><keyword><style  face="normal" font="default" size="100%">Wisdom, Data-intensive Computing</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">2</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">15-36</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 2: &quot;The digital-data revolution&quot;, reviews the relationships between data, information, knowledge, and wisdom. It analyses and quantifies the changes in technology and society that are delivering the data bonanza, and then reviews the consequential changes via representative examples in biology, Earth sciences, social sciences, leisure activity, and business. It exposes quantitative details and shows the complexity and diversity of the growing wealth of data, introducing some of its potential benefits and examples of the impediments to successfully realizing those benefits.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adrian Mouat</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">DISPEL Development</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Diagnostics</style></keyword><keyword><style  face="normal" font="default" size="100%">Dispel</style></keyword><keyword><style  face="normal" font="default" size="100%">IDE</style></keyword><keyword><style  face="normal" font="default" size="100%">Libraries</style></keyword><keyword><style  face="normal" font="default" size="100%">Processing Elements</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">11</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Inc.</style></publisher><pages><style face="normal" font="default" size="100%">237-249</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 11: &quot;DISPEL development&quot;, describes the tools and libraries that a DISPEL developer might expect to use. The tools include those needed during process definition, those required to organize enactment, and diagnostic aids for developers of applications and platforms.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chee Sun Liew</style></author><author><style face="normal" font="default" size="100%">Krause, Amrey</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">DISPEL Enactment</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data Streaming</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Engineering</style></keyword><keyword><style  face="normal" font="default" size="100%">Dispel</style></keyword><keyword><style  face="normal" font="default" size="100%">Workflow Enactment</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">12</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Inc.</style></publisher><pages><style face="normal" font="default" size="100%">251-273</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 12: &quot;DISPEL enactment&quot;, describes the four stages of DISPEL enactment. It is targeted at the data-intensive engineers who implement enactment services.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ashley D. Lloyd</style></author><author><style face="normal" font="default" size="100%">Terence M. Sloan</style></author><author><style face="normal" font="default" size="100%">Antonioletti, Mario</style></author><author><style face="normal" font="default" size="100%">Gary McGilvary</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Embedded systems for global e-Social Science: Moving computation rather than data</style></title><secondary-title><style face="normal" font="default" size="100%">Future Generation Computer Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">07/2013</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0167739X12002336</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">29</style></volume><pages><style face="normal" font="default" size="100%">1120-1129</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">There is a wealth of digital data currently being gathered by commercial and private concerns that could supplement academic research. To unlock this data it is important to gain the trust of the companies that hold the data as well as showing them how they may benefit from this research. Part of this trust is gained through established reputation and the other through the technology used to safeguard the data. This paper discusses how different technology frameworks have been applied to safeguard the data and facilitate collaborative work between commercial concerns and academic institutions. The paper focuses on the distinctive requirements of e-Social Science: access to large-scale data on behaviour in society in environments that impose confidentiality constraints on access. These constraints arise from both privacy concerns and the commercial sensitivities of that data. In particular, the paper draws on the experiences of building an intercontinental Grid–INWA–from its first operation connecting Australia and Scotland to its subsequent extension to China across the Trans-Eurasia Information Network–the first large-scale research and education network for the Asia-Pacific region. This allowed commercial data to be analysed by experts that were geographically distributed across the globe. It also provided an entry point for a major Chinese commercial organization to approve use of a Grid solution in a new collaboration provided the centre of gravity of the data is retained within the jurisdiction of the data owner. We describe why, despite this approval, an embedded solution was eventually adopted. We find that ‘data sovereignty’ dominates any decision on whether and how to participate in e-Social Science collaborations and how this might impact on a Cloud based solution to this type of collaboration.</style></abstract><issue><style face="normal" font="default" size="100%">5</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotrowski, Michal</style></author><author><style face="normal" font="default" size="100%">Gary McGilvary</style></author><author><style face="normal" font="default" size="100%">Sloan, Terence</style></author><author><style face="normal" font="default" size="100%">Mewissen, Muriel</style></author><author><style face="normal" font="default" size="100%">Ashley Lloyd</style></author><author><style face="normal" font="default" size="100%">Forster, Thorsten</style></author><author><style face="normal" font="default" size="100%">Mitchell, Lawrence</style></author><author><style face="normal" font="default" size="100%">Ghazal, Peter</style></author><author><style face="normal" font="default" size="100%">Hill, Jon</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Exploiting Parallel R in the Cloud with SPRINT</style></title><secondary-title><style face="normal" font="default" size="100%">Methods of Information in Medicine</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><volume><style face="normal" font="default" size="100%">52</style></volume><pages><style face="normal" font="default" size="100%">80-90</style></pages><abstract><style face="normal" font="default" size="100%">Background: Advances in DNA Microarray devices and next-generation massively parallel DNA sequencing platforms have led to an exponential growth in data availability but the arising opportunities require adequate computing resources. High Performance Computing (HPC) in the Cloud offers an affordable way of meeting this need.

Objectives: Bioconductor, a popular tool for high-throughput genomic data analysis, is distributed as add-on modules for the R statistical programming language but R has no native capabilities for exploiting multi-processor architectures. SPRINT is an R package that enables easy access to HPC for genomics researchers. This paper investigates: setting up and running SPRINT-enabled genomic analyses on Amazon’s Elastic Compute Cloud (EC2), the advantages of submitting applications to EC2 from different parts of the world and, if resource underutilization can improve application performance.

Methods: The SPRINT parallel implementations of correlation, permutation testing, partitioning around medoids and the multi-purpose papply have been benchmarked on data sets of various size on Amazon EC2. Jobs have been submitted from both the UK and Thailand to investigate monetary differences.

Results: It is possible to obtain good, scalable performance but the level of improvement is dependent upon the nature of algorithm. Resource underutilization can further improve the time to result. End-user’s location impacts on costs due to factors such as local taxation. 

Conclusions: Although not designed to satisfy HPC requirements, Amazon EC2 and cloud computing in general provides an interesting alternative and provides new possibilities for smaller organisations with limited funds.</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tony Hey</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Foreword</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Big Data</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-intensive Computing, Knowledge Discovery</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">xvii-xviii</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fan Zhu</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Carpenter, Trevor K.</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Wardlaw, Joanna M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Lesion Area Detection Using Source Image Correlation Coefficient for CT Perfusion Imaging</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Journal of Biomedical and Health Informatics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">CT , Pattern Recognition , Perfusion Source Images , Segmentation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">03/2013</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">PP</style></volume><pages><style face="normal" font="default" size="100%">1-8</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Computer tomography (CT) perfusion imaging is widely used to calculate brain hemodynamic quantities such as Cerebral Blood Flow (CBF), Cerebral Blood Volume (CBV) and Mean Transit Time (MTT) that aid the diagnosis of acute stroke. Since perfusion source images contain more information than hemodynamic maps, good utilisation of the source images can lead to better understanding than the hemodynamic maps alone. Correlation-coefficient tests are used in our approach to measure the similarity between healthy tissue time-concentration curves and unknown curves. This information is then used to differentiate penumbra and dead tissues from healthy tissues. The goal of the segmentation is to fully utilize information in the perfusion source images. Our method directly identifies suspected abnormal areas from perfusion source images and then delivers a suggested segmentation of healthy, penumbra and dead tissue. This approach is designed to handle CT perfusion images, but it can also be used to detect lesion areas in MR perfusion images.</style></abstract><issue><style face="normal" font="default" size="100%">99</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Snelling, David</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Baxter, Robert M.</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Platforms for Data-Intensive Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data-Intensive Engineering</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Systems</style></keyword><keyword><style  face="normal" font="default" size="100%">Dispel</style></keyword><keyword><style  face="normal" font="default" size="100%">Distributed Systems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">9</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">197-201</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Part III: &quot;Data-intensive engineering&quot;, is targeted at technical experts who will develop complex applications, new components, or data-intensive platforms.  The techniques introduced may be applied very widely; for example, to any data-intensive distributed application, such as index generation, image processing, sequence comparison, text analysis, and sensor-stream monitoring. The challenges, methods, and implementation requirements are illustrated by making extensive use of DISPEL.

Chapter 9: &quot;Platforms for data-intensive analysis&quot;, gives a reprise of data-intensive architectures, examines the business case for investing in them, and introduces the stages of data-intensive workflow enactment.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Preface</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Big Data, Data-intensive Computing, Knowledge Discovery</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">xix-xxviii</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Who should read the book and why.  The structure and conventions used.  Suggested reading paths for different categories of reader.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Problem Solving in Data-Intensive Knowledge Discovery</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data-Analysis Experts</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">Design Patterns for Knowledge Discovery</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge Discovery</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">6</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">147-163</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 6: &quot;Problem solving in data-intensive knowledge discovery&quot;, on the basis of the previous scenarios, this chapter provides an overview of effective strategies in knowledge discovery, highlighting common problem-solving methods that apply in conventional contexts, and focusing on the similarities and differences of these methods.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alessandro Spinuso</style></author><author><style face="normal" font="default" size="100%">James Cheney</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Provenance for seismological processing pipelines in a distributed streaming workflow</style></title><secondary-title><style face="normal" font="default" size="100%">EDBT/ICDT Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Sharing and Reuse in Knowledge Discovery</style></title><secondary-title><style face="normal" font="default" size="100%">THE DATA BONANZA: Improving Knowledge Discovery for Science, Engineering and Business</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data-Intensive Analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge Discovery</style></keyword><keyword><style  face="normal" font="default" size="100%">Ontologies</style></keyword><keyword><style  face="normal" font="default" size="100%">Semantic Web</style></keyword><keyword><style  face="normal" font="default" size="100%">Sharing</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><section><style face="normal" font="default" size="100%">8</style></section><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd.</style></publisher><pages><style face="normal" font="default" size="100%">181-192</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Chapter 8: &quot;Sharing and re-use in knowledge discovery&quot;, introduces more advanced knowledge discovery problems, and shows how improved component and pattern descriptions facilitate re-use. This supports the assembly of libraries of high level components well-adapted to classes of knowledge discovery methods or application domains. The descriptions are made more powerful by introducing notations from the semantic Web.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Michele Carpené</style></author><author><style face="normal" font="default" size="100%">I.A. Klampanos</style></author><author><style face="normal" font="default" size="100%">Siew Hoon Leong</style></author><author><style face="normal" font="default" size="100%">Emanuele Casarotti</style></author><author><style face="normal" font="default" size="100%">Peter Danecek</style></author><author><style face="normal" font="default" size="100%">Graziella Ferini</style></author><author><style face="normal" font="default" size="100%">Andre Gemünd</style></author><author><style face="normal" font="default" size="100%">Amrey Krause</style></author><author><style face="normal" font="default" size="100%">Lion Krischer</style></author><author><style face="normal" font="default" size="100%">Federica Magnoni</style></author><author><style face="normal" font="default" size="100%">Marek Simon</style></author><author><style face="normal" font="default" size="100%">Alessandro Spinuso</style></author><author><style face="normal" font="default" size="100%">Luca Trani</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Giovanni Erbacci</style></author><author><style face="normal" font="default" size="100%">Anton Frank</style></author><author><style face="normal" font="default" size="100%">Heiner Igel</style></author><author><style face="normal" font="default" size="100%">Andreas Rietbrock</style></author><author><style face="normal" font="default" size="100%">Horst Schwichtenberg</style></author><author><style face="normal" font="default" size="100%">Jean-Pierre Vilotte</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards Addressing CPU-Intensive Seismological Applications in Europe</style></title><secondary-title><style face="normal" font="default" size="100%">International Supercomputing Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">16/06/2013</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Leipzig, Germany</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Advanced application environments for seismic analysis help geoscientists to execute complex simulations to predict the behaviour of a geophysical system and potential surface observations. At the same time data collected from seismic stations must be processed comparing recorded signals with predictions. The EU-funded project VERCE (http://verce.eu/) aims to enable specific seismological use-cases and, on the basis of requirements elicited from the seismology community, provide a service-oriented infrastructure to deal with such challenges. In this paper we present VERCE’s architecture, in particular relating to forward and inverse modelling of Earth models and how the, largely file-based, HPC model can be combined with data streaming operations to enhance the scalability of experiments.We posit that the integration of services and HPC resources in an open, collaborative environment is an essential medium for the advancement of sciences of critical importance, such as seismology.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Balaskó, Ákos</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Hoffmann, Alexander</style></author><author><style face="normal" font="default" size="100%">Kacsuk, Peter</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Packschies, Lars</style></author><author><style face="normal" font="default" size="100%">Terstyansky, Gabor</style></author><author><style face="normal" font="default" size="100%">Weingarten, Noam</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">User-friendly workflows in quantum chemistry</style></title><secondary-title><style face="normal" font="default" size="100%">IWSG 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-993/paper14.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></publisher><pub-location><style face="normal" font="default" size="100%">Zurich, Switzerland</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gary McGilvary</style></author><author><style face="normal" font="default" size="100%">Barker, Adam</style></author><author><style face="normal" font="default" size="100%">Ashley Lloyd</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">V-BOINC: The Virtualization of BOINC</style></title><secondary-title><style face="normal" font="default" size="100%">In Proceedings of the 13th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2013).</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">13/05/2013</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Delft, The Netherlands</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The Berkeley Open Infrastructure for Network Computing (BOINC) is an open source client-server middleware system created to allow projects with large computational requirements, usually set in the scientific domain, to utilize a technically unlimited number of volunteer machines distributed over large physical distances. However various problems exist deploying applications over these heterogeneous machines using BOINC: applications must be ported to each machine architecture type, the project server must be trusted to supply authentic applications,  applications that do not regularly checkpoint may lose execution progress upon volunteer machine termination and applications that have dependencies may find it difficult to run under BOINC.

To solve such problems we introduce virtual BOINC, or V-BOINC, where virtual machines are used to run computations on volunteer machines. Application developers can then compile their applications on a single architecture, checkpointing issues are solved through virtualization API's and many security concerns are addressed via the virtual machine's sandbox environment. In this paper we focus on outlining a unique approach on how virtualization can be introduced into BOINC and demonstrate that V-BOINC offers acceptable computational performance when compared to regular BOINC. Finally we show that applications with dependencies can easily run under V-BOINC in turn increasing the computational potential volunteer computing offers to the general public and project developers.

V-BOINC can be downloaded at http://garymcgilvary.co.uk/vboinc.html</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paolo Missier</style></author><author><style face="normal" font="default" size="100%">Khalid Belhajjame</style></author><author><style face="normal" font="default" size="100%">James Cheney</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The W3C PROV family of specifications for modelling provenance metadata</style></title><secondary-title><style face="normal" font="default" size="100%">EDBT</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Web-based Science Gateways for Structural Bioinformatics</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-67822</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">University of Tübingen</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">phd</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yusuke Tanimura</style></author><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">Isao Kojima</style></author><author><style face="normal" font="default" size="100%">Malcolm P. Atkinson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Abstract: Reservation-Based I/O Performance Guarantee for MPI-IO Applications Using Shared Storage Systems</style></title><secondary-title><style face="normal" font="default" size="100%">SC Companion</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">Alberto Nuñez</style></author><author><style face="normal" font="default" size="100%">Javier Fernandez</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An adaptive, scalable, and portable technique for speeding up MPI-based applications</style></title><secondary-title><style face="normal" font="default" size="100%">International European Conference on Parallel and Distributed Computing, Europar-2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fan Zhu</style></author><author><style face="normal" font="default" size="100%">Carpenter, Trevor</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Wardlaw, Joanna</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computed Tomography Perfusion Imaging Denoising Using Gaussian Process Regression</style></title><secondary-title><style face="normal" font="default" size="100%">Physics in Medicine and Biology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/CT%20Denoising%20by%20Gaussian%20Process.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">Objective: Brain perfusion weighted images acquired using dynamic contrast studies have an important clinical role in acute stroke diagnosis and treatment decisions. However, Computed Tomography (CT) images suffer from low contrast-to-noise ratios (CNR) as a consequence of the limitation of the exposure to radiation of the patient. As a consequence, the developments of methods for improving the CNR are valuable. Methods: The majority of existing approaches for denoising CT images are optimized for 3D (spatial) information, including spatial decimation (spatially weighted mean filters) and techniques based on wavelet and curvelet transforms. However, perfusion imaging data is 4D as it also contains temporal information. Our approach using Gaussian process regression (GPR), which takes advantage of the temporal information, to reduce the noise level. Results: Over the entire image, GPR gains a 99% CNR improvement over the raw images and also improves the quality of haemodynamic maps allowing a better identification of edges and detailed information. At the level of individual voxel, GPR provides a stable baseline, helps us to identify key parameters from tissue time- concentration curves and reduces the oscillations in the curve. Conclusion: GPR is superior to the comparable techniques used in this study.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Loreto Bravo</style></author><author><style face="normal" font="default" size="100%">James Cheney</style></author><author><style face="normal" font="default" size="100%">Irini Fundulaki</style></author><author><style face="normal" font="default" size="100%">Ricardo Segovia</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Consistency and repair for XML write-access control policies</style></title><secondary-title><style face="normal" font="default" size="100%">VLDB J.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">843-867</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Umut A. Acar</style></author><author><style face="normal" font="default" size="100%">Amal Ahmed</style></author><author><style face="normal" font="default" size="100%">James Cheney</style></author><author><style face="normal" font="default" size="100%">Roly Perera</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Core Calculus for Provenance</style></title><secondary-title><style face="normal" font="default" size="100%">POST</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, G.</style></author><author><style face="normal" font="default" size="100%">Blunk, D.</style></author><author><style face="normal" font="default" size="100%">Breuers, S.</style></author><author><style face="normal" font="default" size="100%">Brinkmann, A.</style></author><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, S</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, O.</style></author><author><style face="normal" font="default" size="100%">Krüger, J.</style></author><author><style face="normal" font="default" size="100%">Kruse, M.</style></author><author><style face="normal" font="default" size="100%">Müller-Pfefferkorn, R.</style></author><author><style face="normal" font="default" size="100%">Schäfer, P.</style></author><author><style face="normal" font="default" size="100%">Schuller, B.</style></author><author><style face="normal" font="default" size="100%">Steinke, T.</style></author><author><style face="normal" font="default" size="100%">Zink, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Data Driven Science Gateway for Computational Workflows</style></title><secondary-title><style face="normal" font="default" size="100%">UNICORE Summit 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dickie, David Alexander</style></author><author><style face="normal" font="default" size="100%">Dominic Job</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Shenkin, Susan</style></author><author><style face="normal" font="default" size="100%">Wardlaw, Joanna</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A databank, rather than statistical, model of normal ageing brain structure to indicate pathology</style></title><secondary-title><style face="normal" font="default" size="100%">OHBM 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/06/2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ww4.aievolution.com/hbm1201/index.cfm?do=abs.viewAbs&amp;abs=5102</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Chee Sun Liew</style></author><author><style face="normal" font="default" size="100%">Michelle Galea</style></author><author><style face="normal" font="default" size="100%">Paul Martin</style></author><author><style face="normal" font="default" size="100%">Krause, Amrey</style></author><author><style face="normal" font="default" size="100%">Adrian Mouat</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data-Intensive Architecture for Scientific Knowledge Discovery</style></title><secondary-title><style face="normal" font="default" size="100%">Distributed and Parallel Databases</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Knowledge discovery, workflow management system</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s10619-012-7105-3</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">30</style></volume><pages><style face="normal" font="default" size="100%">307-324</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper presents a data-intensive architecture that demonstrates the ability to support applications from a wide range of application domains, and support the different types of users involved in defining, designing and executing data-intensive processing tasks. The prototype architecture is introduced, and the pivotal role of DISPEL as a canonical language is explained. The architecture promotes the exploration and exploitation of distributed and heterogeneous data and spans the complete knowledge discovery process, from data preparation, to analysis, to evaluation and reiteration. The architecture evaluation included large-scale applications from astronomy, cosmology, hydrology, functional genetics, imaging processing and seismology.</style></abstract><issue><style face="normal" font="default" size="100%">5</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gabriel G. Castañè</style></author><author><style face="normal" font="default" size="100%">Alberto Nuñez</style></author><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">Jesus Carretero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dimensioning Scientific Computing Systems to Improve Performance of Map-Reduce based Applications</style></title><secondary-title><style face="normal" font="default" size="100%">Procedia Computer Science, Proceedings of the International Conference on Computational Science, ICCS 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gabriel G. Castañè</style></author><author><style face="normal" font="default" size="100%">Alberto Nuñez</style></author><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">Jesus Carretero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dimensioning Scientific Computing Systems to Improve Performance of Map-Reduce based Applications</style></title><secondary-title><style face="normal" font="default" size="100%">Procedia CS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">226-235</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paul Martin</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dispel Tutorial</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Dispel</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/tutorial.pdf</style></url></related-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Dispel is a strongly-typed imperative language for generating executable workflows for data-intensive distributed applications, particularly (but not exclusively) for use in computational sciences such as bioinformatics, astronomy and seismology — it has been designed to be a portable lingua franca by which researchers can interact with complex distributed research infrastructures without detailed knowledge of the underlying computational middleware, all in order to more easily conduct experiments in data integration, simulation and data-intensive modelling.

This document is a tutorial for Dispel.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Ferrari, Luna</style></author><author><style face="normal" font="default" size="100%">Stuart Aitken</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Goryanin, Igor</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">EnzML: multi-label prediction of enzyme classes using InterPro signatures.</style></title><secondary-title><style face="normal" font="default" size="100%">BMC Bioinformatics</style></secondary-title><alt-title><style face="normal" font="default" size="100%">BMC Bioinformatics</style></alt-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">61</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">BACKGROUND: Manual annotation of enzymatic functions cannot keep up with automatic genome sequencing. In this work we explore the capacity of InterPro sequence signatures to automatically predict enzymatic function.

RESULTS: We present EnzML, a multi-label classification method that can efficiently account also for proteins with multiple enzymatic functions: 50,000 in UniProt. EnzML was evaluated using a standard set of 300,747 proteins for which the manually curated Swiss-Prot and KEGG databases have agreeing Enzyme Commission (EC) annotations. EnzML achieved more than 98% subset accuracy (exact match of all correct Enzyme Commission classes of a protein) for the entire dataset and between 87 and 97% subset accuracy in reannotating eight entire proteomes: human, mouse, rat, mouse-ear cress, fruit fly, the S. pombe yeast, the E. coli bacterium and the M. jannaschii archaebacterium. To understand the role played by the dataset size, we compared the cross-evaluation results of smaller datasets, either constructed at random or from specific taxonomic domains such as archaea, bacteria, fungi, invertebrates, plants and vertebrates. The results were confirmed even when the redundancy in the dataset was reduced using UniRef100, UniRef90 or UniRef50 clusters.

CONCLUSIONS: InterPro signatures are a compact and powerful attribute space for the prediction of enzymatic function. This representation makes multi-label machine learning feasible in reasonable time (30 minutes to train on 300,747 instances with 10,852 attributes and 2,201 class values) using the Mulan Binary Relevance Nearest Neighbours algorithm implementation (BR-kNN).</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Schlemmer, Tobias</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Müller-Pfefferkorn, Ralph</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Generic User Management for Science Gateways via Virtual Organizations</style></title><secondary-title><style face="normal" font="default" size="100%">EGI Technical Forum 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><secondary-authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Glatard, Tristan</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Delgado Olabarriaga, Silvia</style></author><author><style face="normal" font="default" size="100%">Solomonides, Tony</style></author><author><style face="normal" font="default" size="100%">Silverstein, J.</style></author><author><style face="normal" font="default" size="100%">Montagnat, J.</style></author><author><style face="normal" font="default" size="100%">Gaignard, A.</style></author><author><style face="normal" font="default" size="100%">Krefting, Dagmar</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">HealthGrid Applications and Technologies Meet Science Gateways for Life Sciences</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">IOS Press</style></publisher><volume><style face="normal" font="default" size="100%">175</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Kacsuk, Peter</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author><author><style face="normal" font="default" size="100%">Kozlovszky, Miklos</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Müller-Pfefferkorn, Ralph</style></author><author><style face="normal" font="default" size="100%">Schäfer, Patrick</style></author><author><style face="normal" font="default" size="100%">Steinke, Thomas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The MoSGrid Community - From National to International Scale</style></title><secondary-title><style face="normal" font="default" size="100%">EGI Community Forum 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Blunk, Dirk</style></author><author><style face="normal" font="default" size="100%">Breuers, Sebastian</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Fels, Gregor</style></author><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Packschies, Lars</style></author><author><style face="normal" font="default" size="100%">Schäfer, Patrick</style></author><author><style face="normal" font="default" size="100%">Schuller, B.</style></author><author><style face="normal" font="default" size="100%">Schuster, Johannes</style></author><author><style face="normal" font="default" size="100%">Steinke, Thomas</style></author><author><style face="normal" font="default" size="100%">Szikszay Fabri, Anna</style></author><author><style face="normal" font="default" size="100%">Wewior, Martin</style></author><author><style face="normal" font="default" size="100%">Müller-Pfefferkorn, Ralph</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">MoSGrid: Progress of Workflow driven Chemical Simulations</style></title><secondary-title><style face="normal" font="default" size="100%">Grid Workflow Workshop 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anderson, Paul</style></author><author><style face="normal" font="default" size="100%">Shahriar Bijani</style></author><author><style face="normal" font="default" size="100%">Vichos, Alexandros</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Jezic, Gordan</style></author><author><style face="normal" font="default" size="100%">Kusek, Mario</style></author><author><style face="normal" font="default" size="100%">Nguyen, Ngoc-Thanh</style></author><author><style face="normal" font="default" size="100%">Howlett, Robert</style></author><author><style face="normal" font="default" size="100%">Jain, Lakhmi</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Multi-agent Negotiation of Virtual Machine Migration Using the Lightweight Coordination Calculus</style></title><secondary-title><style face="normal" font="default" size="100%">Agent and Multi-Agent Systems. Technologies and Applications</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-30947-2_16</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><volume><style face="normal" font="default" size="100%">7327</style></volume><pages><style face="normal" font="default" size="100%">124-133</style></pages><isbn><style face="normal" font="default" size="100%">978-3-642-30946-5</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chris Allan</style></author><author><style face="normal" font="default" size="100%">Jean-Marie Burel</style></author><author><style face="normal" font="default" size="100%">Josh Moore</style></author><author><style face="normal" font="default" size="100%">Colin Blackburn</style></author><author><style face="normal" font="default" size="100%">Melissa Linkert</style></author><author><style face="normal" font="default" size="100%">Scott Loynton</style></author><author><style face="normal" font="default" size="100%">Donald MacDonald</style></author><author><style face="normal" font="default" size="100%">et al.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">OMERO: flexible, model-driven data management for experimental biology</style></title><secondary-title><style face="normal" font="default" size="100%">NATURE METHODS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1038/nmeth.1896</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Nature Publishing Group, a division of Macmillan Publishers Limited. All Rights Reserved.</style></publisher><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">245-253</style></pages><isbn><style face="normal" font="default" size="100%">1548-7091</style></isbn><abstract><style face="normal" font="default" size="100%">Data-intensive research depends on tools that manage multidimensional, heterogeneous datasets. We built OME Remote Objects (OMERO), a software platform that enables access to and use of a wide range of biological data. OMERO uses a server-based middleware application to provide a unified interface for images, matrices and tables. OMERO's design and flexibility have enabled its use for light-microscopy, high-content-screening, electron-microscopy and even non-image-genotype data. OMERO is open-source software, available at http://openmicroscopy.org/.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chee Sun Liew</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Optimisation of the enactment of fine-grained distributed data-intensive workflows</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/thesis.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">The University of Edinburgh</style></publisher><pub-location><style face="normal" font="default" size="100%">Edinburgh</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The emergence of data-intensive science as the fourth science paradigm has posed a data deluge challenge for enacting scientific workflows. The scientific community is facing an imminent flood of data from the next generation of experiments and simulations, besides dealing with the heterogeneity and complexity of data, applications and execution environments. New scientific workflows involve execution on distributed and heterogeneous computing resources across organisational and geographical boundaries, processing gigabytes of live data streams and petabytes of archived and simulation data, in various formats and from multiple sources. Managing the enactment of such workflows not only requires larger storage space and faster machines, but the capability to support scalability and diversity of the users, applications, data, computing resources and the enactment technologies. 

We argue that the enactment process can be made efficient using optimisation techniques in an appropriate architecture. This architecture should support the creation of diversified applications and their enactment on diversified execution environments, with a standard interface, i.e.~a workflow language. The workflow language should be both human readable and suitable for communication between the enactment environments. The data-streaming model central to this architecture provides a scalable approach to large-scale data exploitation. Data-flow between computational elements in the scientific workflow is implemented as streams. To cope with the exploratory nature of scientific workflows, the architecture should support fast workflow prototyping, and the re-use of workflows and workflow components. Above all, the enactment process should be easily repeated and automated.

In this thesis, we present a candidate data-intensive architecture that includes an intermediate workflow language, named DISPEL. We create a new fine-grained measurement framework to capture performance-related data during enactments, and design a performance database to organise them systematically. We propose a new enactment strategy to demonstrate that optimisation of data-streaming workflows can be automated by exploiting performance data gathered during previous enactments.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fan Zhu</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Carpenter, Trevor</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Wardlaw, Joanna</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel perfusion imaging processing using GPGPU</style></title><secondary-title><style face="normal" font="default" size="100%">Computer Methods and Programs in Biomedicine</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Deconvolution</style></keyword><keyword><style  face="normal" font="default" size="100%">GPGPU</style></keyword><keyword><style  face="normal" font="default" size="100%">Local AIF</style></keyword><keyword><style  face="normal" font="default" size="100%">Parallelization</style></keyword><keyword><style  face="normal" font="default" size="100%">Perfusion Imaging</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S0169260712001587</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/CMPB-D-11-00360R1.pdf</style></url></related-urls></urls><pages><style face="normal" font="default" size="100%">-</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Background and purpose The objective of brain perfusion quantification is to generate parametric maps of relevant hemodynamic quantities such as cerebral blood flow (CBF), cerebral blood volume (CBV) and mean transit time (MTT) that can be used in diagnosis of acute stroke. These calculations involve deconvolution operations that can be very computationally expensive when using local Arterial Input Functions (AIF). As time is vitally important in the case of acute stroke, reducing the analysis time will reduce the number of brain cells damaged and increase the potential for recovery. Methods GPUs originated as graphics generation dedicated co-processors, but modern GPUs have evolved to become a more general processor capable of executing scientific computations. It provides a highly parallel computing environment due to its large number of computing cores and constitutes an affordable high performance computing method. In this paper, we will present the implementation of a deconvolution algorithm for brain perfusion quantification on GPGPU (General Purpose Graphics Processor Units) using the CUDA programming model. We present the serial and parallel implementations of such algorithms and the evaluation of the performance gains using GPUs. Results Our method has gained a 5.56 and 3.75 speedup for CT and MR images respectively. Conclusions It seems that using GPGPU is a desirable approach in perfusion imaging analysis, which does not harm the quality of cerebral hemodynamic maps but delivers results faster than the traditional computation.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fan Zhu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">(PhD Thesis) Brain Perfusion Imaging - Performance and Accuracy</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/FanZHU_Thesis_0.pdf</style></url></related-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Title:
Brain Perfusion Imaging - Performance and Accuracy

Abstract:
Brain perfusion weighted images acquired using dynamic contrast studies have an important clinical role in acute stroke diagnosis and treatment decisions.
The purpose of my PhD research is to develop novel methodologies for improving the efficiency and quality of brain perfusion-imaging analysis so that clinical decisions can be made more accurately and in shorter time.
This thesis consists of three parts:

1. My research investigates the possibilities that parallel computing brings to make perfusion-imaging analysis faster in order to deliver results that are used in stroke diagnosis earlier. Brain perfusion analysis using local Arterial Input Functions (AIF) technique takes a long time to execute due to its heavy computational load. As time is vitally important in the case of acute stroke, reducing analysis time and therefore diagnosis time can reduce the number of brain cells damaged and improve the chances for patient recovery. We present the implementation of a deconvolution algorithm for brain perfusion quantification on GPGPU (General Purpose computing on Graphics Processing Units) using the CUDA programming model. Our method aims to accelerate the process without any quality loss.

2. Specific features of perfusion source images are also used to reduce noise impact, which consequently improves the accuracy of hemodynamic maps. The majority of existing approaches for denoising CT images are optimized for 3D (spatial) information, including spatial decimation (spatially weighted mean filters) and techniques based on wavelet and curvelet transforms. However, perfusion imaging data is 4D as it also contains temporal information. Our approach using Gaussian process regression (GPR) makes use of the temporal information in the perfusion source imges to reduce the noise level. Over the entire image, our noise reduction method based on Gaussian process regression gains a 99% contrast-to-noise ratio improvement over the raw image and also improves the quality of hemodynamic maps, allowing a better identification of edges and detailed information. At the level of individual voxels, GPR provides a stable baseline, helps identify key parameters from tissue time-concentration curves and reduces the oscillations in the curves. Furthermore, the results shows that GPR is superior to the alternative techniques compared in this study.

3. My research also explores automatic segmentation of perfusion images into potentially healthy areas and lesion areas which can be used as additional information that assists in clinical diagnosis. Since perfusion source images contain more information than hemodynamic maps, good utilisation of source images leads to better understanding than the hemodynamic maps alone. Correlation coefficient tests are used to measure the similarities between the expected tissue time-concentration curves (from (reference tissue)) and the measured time-concentration curves (from target tissue). This information is then used to distinguish tissues at risk and dead tissues from healthy tissues. A correlation coefficient based signal analysis method that directly spots suspected lesion areas from perfusion source images is presented. Our method delivers a clear automatic segmentation of healthy tissue, tissue at risk and dead tissue. From our segmentation maps, it is easier to identify lesion boundaries than using traditional hemodynamic maps.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">James Cheney</style></author><author><style face="normal" font="default" size="100%">Anthony Finkelstein</style></author><author><style face="normal" font="default" size="100%">Bertram Ludäscher</style></author><author><style face="normal" font="default" size="100%">Stijn Vansummeren</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Principles of Provenance (Dagstuhl Seminar 12091)</style></title><secondary-title><style face="normal" font="default" size="100%">Dagstuhl Reports</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">84-113</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paul T. Groth</style></author><author><style face="normal" font="default" size="100%">Yolanda Gil</style></author><author><style face="normal" font="default" size="100%">James Cheney</style></author><author><style face="normal" font="default" size="100%">Simon Miles</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Requirements for Provenance on the Web</style></title><secondary-title><style face="normal" font="default" size="100%">IJDC</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">39-56</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Shahriar Bijani</style></author><author><style face="normal" font="default" size="100%">David Robertson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Review of Attacks and Security Approaches in Open Multi-agent Systems</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Open multi-agent systems (MASs) have growing popularity in the Multi-agent Systems community and are predicted to have many applications in future, as large scale distributed systems become more widespread. A major practical limitation to open MASs is security because the openness of such systems negates many traditional security solutions. In this paper we introduce and classify main attacks on open MASs. We then survey and analyse various security techniques in the literature and categorise them under prevention and detection approaches. Finally, we suggest which security technique is an appropriate countermeasure for which classes of attack.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Kacsuk, Peter</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author><author><style face="normal" font="default" size="100%">Kozlovszky, Miklos</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Müller-Pfefferkorn, Ralph</style></author><author><style face="normal" font="default" size="100%">Schäfer, Patrick</style></author><author><style face="normal" font="default" size="100%">Steinke, Thomas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Science Gateway Getting Ready for Serving the International Molecular Simulation Community</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">I.A. Klampanos</style></author><author><style face="normal" font="default" size="100%">J.M. Jose</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Searching in peer-to-peer networks </style></title><secondary-title><style face="normal" font="default" size="100%">Computer Science Review (Elsevier)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science/article/pii/S1574013712000238</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">Survey</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alberto Nuñez</style></author><author><style face="normal" font="default" size="100%">Javier Fernández</style></author><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">Félix García Carballeira</style></author><author><style face="normal" font="default" size="100%">Jesús Carretero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SIMCAN: A flexible, scalable and expandable simulation platform for modelling and simulating distributed architectures and applications</style></title><secondary-title><style face="normal" font="default" size="100%">Simulation Modelling Practice and Theory</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">12-32</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Wewior, Martin</style></author><author><style face="normal" font="default" size="100%">Schäfer, Patrick</style></author><author><style face="normal" font="default" size="100%">Schuller, Bernd</style></author><author><style face="normal" font="default" size="100%">Schuster, Johannes</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Breuers, Sebastian</style></author><author><style face="normal" font="default" size="100%">Balaskó, Ákos</style></author><author><style face="normal" font="default" size="100%">Kozlovszky, Miklos</style></author><author><style face="normal" font="default" size="100%">Fabri, AnnaSzikszay</style></author><author><style face="normal" font="default" size="100%">Packschies, Lars</style></author><author><style face="normal" font="default" size="100%">Kacsuk, Peter</style></author><author><style face="normal" font="default" size="100%">Blunk, Dirk</style></author><author><style face="normal" font="default" size="100%">Steinke, Thomas</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Fels, Gregor</style></author><author><style face="normal" font="default" size="100%">Müller-Pfefferkorn, Ralph</style></author><author><style face="normal" font="default" size="100%">Jäkel, René</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Single Sign-On Infrastructure for Science Gateways on a Use Case for Structural Bioinformatics</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Grid Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">DCIs</style></keyword><keyword><style  face="normal" font="default" size="100%">Science gateway</style></keyword><keyword><style  face="normal" font="default" size="100%">security</style></keyword><keyword><style  face="normal" font="default" size="100%">Single sign-on</style></keyword><keyword><style  face="normal" font="default" size="100%">Structural bioinformatics</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s10723-012-9247-y</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">769-790</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Nikolaos Chatzinikolaou</style></author><author><style face="normal" font="default" size="100%">Dave Robertson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Use of Reputation as Noise-resistant Selection Bias in a Co-evolutionary Multi-agent System</style></title><secondary-title><style face="normal" font="default" size="100%">Genetic and Evolutionary Computation Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><pub-location><style face="normal" font="default" size="100%">Philadelphia</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Jäkel, René</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Dos Santos Vieira, Ines</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Workflow-enhanced conformational analysis of guanidine zinc complexes via a science gateway</style></title><secondary-title><style face="normal" font="default" size="100%">HealthGrid Applications and Technologies Meet Science Gateways for Life Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">IOS Press</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ashwag Omar Maghraby</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Automatic Agent Protocol Generation from Argumentation</style></title><secondary-title><style face="normal" font="default" size="100%">13th European Agent Systems Summer Schoo</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/aamas2011_Ashwag%20Omar.pdf</style></url></related-urls></urls></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Richard Baldock</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Automatically Identifying and Annotating Mouse Embryo Gene Expression Patterns</style></title><secondary-title><style face="normal" font="default" size="100%">Bioinformatics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">classification</style></keyword><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://bioinformatics.oxfordjournals.org/content/early/2011/02/25/bioinformatics.btr105.abstract</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">8</style></number><volume><style face="normal" font="default" size="100%">27</style></volume><pages><style face="normal" font="default" size="100%">1101–1107</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Motivation: Deciphering the regulatory and developmental mechanisms for multicellular organisms requires detailed knowledge of gene interactions and gene expressions. The availability of large datasets with both spatial and ontological annotation of the spatio-temporal patterns of gene-expression in mouse embryo provides a powerful resource to discover the biological function of embryo organisation. Ontological annotation of gene expressions consists of labelling images with terms from the anatomy ontology for mouse development. If the spatial genes of an anatomical component are expressed in an image, the image is then tagged with a term of that anatomical component. The current annotation is done manually by domain experts, which is both time consuming and costly. In addition, the level of detail is variable and inevitably, errors arise from the tedious nature of the task. In this paper, we present a new method to automatically identify and annotate gene expression patterns in the mouse embryo with anatomical terms.

Results: The method takes images from in situ hybridisation studies and the ontology for the developing mouse embryo, it then combines machine learning and image processing techniques to produce classifiers that automatically identify and annotate gene expression patterns in these images.We evaluate our method on image data from the EURExpress-II study where we use it to automatically classify nine anatomical terms: humerus, handplate, fibula, tibia, femur, ribs, petrous part, scapula and head mesenchyme. The accuracy of our method lies between 70–80% with few exceptions. 

Conclusions: We show that other known methods have lower classification performance than ours. We have investigated the images misclassified by our method and found several cases where the original annotation was not correct. This shows our method is robust against this kind of noise. 

Availability: The annotation result and the experimental dataset in the paper can be freely accessed at http://www2.docm.mmu.ac.uk/STAFF/L.Han/geneannotation/

Contact: l.han@mmu.ac.uk, j.vanhemert@ed.ac.uk and Richard.Baldock@hgu.mrc.ac.uk</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">K. Smith-Miles</style></author><author><style face="normal" font="default" size="100%">{van Hemert}, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Discovering the suitability of optimisation algorithms by learning from evolved instances</style></title><secondary-title><style face="normal" font="default" size="100%">Annals of Mathematics and Artificial Intelligence</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">problem evolving</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/6x83q3201gg71554/</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">Online Fir</style></volume><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paul Martin</style></author><author><style face="normal" font="default" size="100%">Yaikhom, Gagarine</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">DISPEL Reference Manual</style></title><secondary-title><style face="normal" font="default" size="100%">Advanced Data Mining and Integration Research for Europe (ADMIRE)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">DISPEL, ADMIRE</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">www.admire-project.eu</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/manual.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">Reference manual for the Data Intensive Systems Process Engineering Language (DISPEL).</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paul Martin</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Adam Carter</style></author><author><style face="normal" font="default" size="100%">Gareth Francis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">EDIM1 Progress Report</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2011</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/report_0.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">The Edinburgh Data-Intensive Machine (EDIM1) is the product of a joint collaboration between the data-intensive group at the School of Informatics and EPCC. EDIM1 is an experimental system, offering an alternative architecture for data-intensive computation and providing a platform for evaluating tools for data-intensive research; a 120 node cluster of ‘data-bricks’ with high storage yet modest computational capacity. This document gives some background into the context in which EDIM1 was designed and constructed, as well as providing an overview of its use so far and future plans.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lorenzino Vaccari</style></author><author><style face="normal" font="default" size="100%">Pavel Shvaiko</style></author><author><style face="normal" font="default" size="100%">Juan Pane</style></author><author><style face="normal" font="default" size="100%">Paolo Besana</style></author><author><style face="normal" font="default" size="100%">Maurizio Marchese</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An evaluation of ontology matching in geo-service applications</style></title><secondary-title><style face="normal" font="default" size="100%">Geoinformatica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><pages><style face="normal" font="default" size="100%">1-36</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lorenzino Vaccari</style></author><author><style face="normal" font="default" size="100%">Pavel Shvaiko</style></author><author><style face="normal" font="default" size="100%">Juan Pane</style></author><author><style face="normal" font="default" size="100%">Paolo Besana</style></author><author><style face="normal" font="default" size="100%">Maurizio Marchese</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An evaluation of ontology matching in geo-service applications</style></title><secondary-title><style face="normal" font="default" size="100%">Geoinformatica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><pages><style face="normal" font="default" size="100%">1-36</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author><author><style face="normal" font="default" size="100%">Koetsier, J.</style></author><author><style face="normal" font="default" size="100%">Torterolo, L.</style></author><author><style face="normal" font="default" size="100%">Porro, I.</style></author><author><style face="normal" font="default" size="100%">Melato, M.</style></author><author><style face="normal" font="default" size="100%">Barbera, R.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Generating web-based user interfaces for computational science</style></title><secondary-title><style face="normal" font="default" size="100%">Concurrency and Computation: Practice and Experience</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">Wiley</style></publisher><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">256--268</style></pages><abstract><style face="normal" font="default" size="100%">Scientific gateways in the form of web portals are becoming the popular approach to share knowledge
and resources around a topic in a community of researchers. Unfortunately, the development of web
portals is expensive and requires specialists skills. Commercial and more generic web portals have a much
larger user base and can afford this kind of development. Here we present two solutions that address this
problem in the area of portals for scientific computing; both take the same approach. The whole process
of designing, delivering and maintaining a portal can be made more cost-effective by generating a portal
from a description rather than programming in the traditional sense. We show four successful use cases to
show how this process works and the results it can deliver.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Chee Sun Liew</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Generic Parallel Processing Model for Facilitating Data Mining and Integration</style></title><secondary-title><style face="normal" font="default" size="100%">Parallel Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data Mining and Data Integration (DMI)</style></keyword><keyword><style  face="normal" font="default" size="100%">Life Sciences</style></keyword><keyword><style  face="normal" font="default" size="100%">OGSA-DAI</style></keyword><keyword><style  face="normal" font="default" size="100%">Parallelism</style></keyword><keyword><style  face="normal" font="default" size="100%">Pipeline Streaming</style></keyword><keyword><style  face="normal" font="default" size="100%">workflow</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><volume><style face="normal" font="default" size="100%">37</style></volume><pages><style face="normal" font="default" size="100%">157 - 171</style></pages><abstract><style face="normal" font="default" size="100%">To facilitate Data Mining and Integration (DMI) processes in a generic way, we investigate a parallel pipeline streaming model. We model a DMI task as a streaming data-flow graph: a directed acyclic graph (DAG) of Processing Elements PEs. The composition mechanism links PEs via data streams, which may be in memory, buffered via disks or inter-computer data-flows. This makes it possible to build arbitrary DAGs with pipelining and both data and task parallelisms, which provides room for performance enhancement. We have applied this approach to a real DMI case in the Life Sciences and implemented a prototype. To demonstrate feasibility of the modelled DMI task and assess the efficiency of the prototype, we have also built a performance evaluation model. The experimental evaluation results show that a linear speedup has been achieved with the increase of the number of distributed computing nodes in this case study.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Balaskó, Ákos</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Blunk, Dirk</style></author><author><style face="normal" font="default" size="100%">Breuers, Sebastian</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Fels, Gregor</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Kacsuk, Peter</style></author><author><style face="normal" font="default" size="100%">Kozlovszky, Miklos</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Packschies, Lars</style></author><author><style face="normal" font="default" size="100%">Schäfer, Patrick</style></author><author><style face="normal" font="default" size="100%">Schuller, Bernd</style></author><author><style face="normal" font="default" size="100%">Schuster, Johannes</style></author><author><style face="normal" font="default" size="100%">Steinke, Thomas</style></author><author><style face="normal" font="default" size="100%">Szikszay Fabri, Anna</style></author><author><style face="normal" font="default" size="100%">Wewior, Martin</style></author><author><style face="normal" font="default" size="100%">Müller-Pfefferkorn, Ralph</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Granular Security for a Science Gateway in Structural Bioinformatics</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Workshop on Science Gateways for Life Sciences (IWSG-Life 2011)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Shahriar Bijani</style></author><author><style face="normal" font="default" size="100%">David Robertson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Intrusion Detection in Open Peer-to-Peer Multi-agent Systems</style></title><secondary-title><style face="normal" font="default" size="100%">5th International Conference on Autonomous Infrastructure, Management and Security (AIMS 2011)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Managing the dynamics of networks and services </style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">13/06/2011</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag Berlin</style></publisher><isbn><style face="normal" font="default" size="100%">978-3-642-21483-7</style></isbn><abstract><style face="normal" font="default" size="100%">One way to build large-scale autonomous systems is to develop open peer-to-peer architectures in which peers are not pre-engineered to work together and in which peers themselves determine the social norms that govern collective behaviour. A major practical limitation to such systems is security because the very openness of such systems negates most traditional security solutions. We propose a programme of research that addresses this problem by devising ways of attack detection and damage limitation that take advantage of social norms described by electronic institutions. We have analysed security issues of open peer-to-peer multi-agent systems and focused on probing attacks against confidentiality. We have proposed a framework and adapted an inference system, which shows the possibility of private information disclosure by an adversary. We shall suggest effective countermeasures in such systems and propose attack response techniques to limit possible damages.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David A. Bacigalupo</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano I.</style></author><author><style face="normal" font="default" size="100%">Xiaoyu Chen</style></author><author><style face="normal" font="default" size="100%">Asif Usmani</style></author><author><style face="normal" font="default" size="100%">Adam P. Chester</style></author><author><style face="normal" font="default" size="100%">Ligang He</style></author><author><style face="normal" font="default" size="100%">Donna N. Dillenberger</style></author><author><style face="normal" font="default" size="100%">Gary B. Wills</style></author><author><style face="normal" font="default" size="100%">Lester Gilbert</style></author><author><style face="normal" font="default" size="100%">Stephen A. Jarvis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Managing dynamic enterprise and urgent workloads on clouds using layered queuing and historical performance models</style></title><secondary-title><style face="normal" font="default" size="100%">Simulation Modelling Practice and Theory</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><number><style face="normal" font="default" size="100%">6</style></number><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">1479–1495</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The automatic allocation of enterprise workload to resources can be enhanced by being able to make what–if response time predictions whilst different allocations are being considered. We experimentally investigate an historical and a layered queuing performance model and show how they can provide a good level of support for a dynamic-urgent cloud environment. Using this we define, implement and experimentally investigate the effectiveness of a prediction-based cloud workload and resource management algorithm. Based on these experimental analyses we: (i) comparatively evaluate the layered queuing and historical techniques; (ii) evaluate the effectiveness of the management algorithm in different operating scenarios; and (iii) provide guidance on using prediction-based workload and resource management.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gary McGilvary</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Barker, Adam</style></author><author><style face="normal" font="default" size="100%">Ashley Lloyd</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Optimum Platform Selection and Configuration for Computational Jobs</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">26/09/11</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">York</style></pub-location><abstract><style face="normal" font="default" size="100%">The performance and cost of many scientific applications which execute on a variety of High Performance Computing (HPC), local cluster environments and cloud services could be enhanced, and costs reduced if the platform was carefully selected on a per-application basis and the application itself was optimally configured for a given platform.

With a wide-variety of computing platforms on offer, each possessing different properties, all too frequently platform decisions are made on an ad-hoc basis with limited ‘black-box’ information. The limitless number of possible application configurations also make it difficult for an individual who wants to achieve cost-effective results with the maximum performance available. Such individuals may include biomedical researchers analysing microarray data, software developers running aviation simulations or bankers performing risk assessments. However in either case, it is likely that many may not have the required knowledge to select the optimum platform and setup for their application; to do so, would require extensive knowledge of their applications and various platforms.

In this paper we describe a framework that aims to resolve such issues by (i) reducing the detail required in the decision making process by placing this information within a selection framework, thereby (ii) maximising an application’s performance gain and/or reducing costs. We present a set of preliminary results where we compare the performance of running the Simple Parallel R INTerface (SPRINT) over a variety of platforms. SPRINT is a framework providing parallel functions of the statistical package R, allowing post genomic data to be easily analysed on HPC resources [1]. We run SPRINT on Amazon’s Elastic Compute Cloud (EC2) to compare the performance with the results obtained from HECToR, the UK’s National Supercomputing Service, and the Edinburgh Compute and Data Facilities (ECDF) cluster.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zhu, Fan.</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Carpenter, Trevor</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Wardlaw, Joanna</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Parallel Deconvolution Algorithm in Perfusion Imaging</style></title><secondary-title><style face="normal" font="default" size="100%">Healthcare Informatics, Imaging, and Systems Biology (HISB)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Deconvolution</style></keyword><keyword><style  face="normal" font="default" size="100%">GPGPU</style></keyword><keyword><style  face="normal" font="default" size="100%">Parallelization</style></keyword><keyword><style  face="normal" font="default" size="100%">Perfusion Imaging</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">26/07/2011</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6061411&amp;tag=1</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/PID1888641.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">San Jose, California </style></pub-location><isbn><style face="normal" font="default" size="100%">978-1-4577-0325-6 </style></isbn><abstract><style face="normal" font="default" size="100%">In this paper, we will present the implementation of a deconvolution algorithm for brain perfusion quantification on GPGPU (General Purpose Graphics Processor Units) using the CUDA programming model. GPUs originated as graphics generation dedicated co-processors, but the modern GPUs have evolved to become a more general processor capable of executing scientific computations. It provides a highly parallel computing environment due to its huge number of computing cores and constitutes an affordable high performance computing method. The objective of brain perfusion quantification is to generate parametric maps of relevant haemodynamic quantities such as Cerebral Blood Flow (CBF), Cerebral Blood Volume (CBV) and Mean Transit Time (MTT) that can be used in diagnosis of conditions such as stroke or brain tumors. These calculations involve deconvolution operations that in the case of using local Arterial Input Functions (AIF) can be very expensive computationally. We present the serial and parallel implementations of such algorithm and the evaluation of the performance gains using GPUs.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chee Sun Liew</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Radoslaw Ostrowski</style></author><author><style face="normal" font="default" size="100%">Murray Cole</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano I.</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Performance database: capturing data for optimizing distributed streaming workflows</style></title><secondary-title><style face="normal" font="default" size="100%">Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">measurement framework</style></keyword><keyword><style  face="normal" font="default" size="100%">performance data</style></keyword><keyword><style  face="normal" font="default" size="100%">streaming workflows</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><volume><style face="normal" font="default" size="100%">369</style></volume><pages><style face="normal" font="default" size="100%">3268-3284</style></pages><abstract><style face="normal" font="default" size="100%">The performance database (PDB) stores performance-related data gathered during workflow enactment. We argue that by carefully understanding and manipulating this data, we can improve efficiency when enacting workflows. This paper describes the rationale behind the PDB, and proposes a systematic way to implement it. The prototype is built as part of the Advanced Data Mining and Integration Research for Europe project. We use workflows from real-world experiments to demonstrate the usage of PDB.</style></abstract><issue><style face="normal" font="default" size="100%">1949</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Shahriar Bijani</style></author><author><style face="normal" font="default" size="100%">David Robertson</style></author><author><style face="normal" font="default" size="100%">David Aspinall</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Probing Attacks on Multi-agent Systems using Electronic Institutions</style></title><secondary-title><style face="normal" font="default" size="100%">Declarative Agent Languages and Technologies Workshop (DALT), AAMAS 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">02/05/2011</style></date></pub-dates></dates></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kenton D'Mellow</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Carpenter, Trevor</style></author><author><style face="normal" font="default" size="100%">Jos Koetsier</style></author><author><style face="normal" font="default" size="100%">Dominic Job</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Wardlaw, Joanna</style></author><author><style face="normal" font="default" size="100%">Fan Zhu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">RapidBrain: Developing a Portal for Brain Research Imaging</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2011, York </style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><pub-location><style face="normal" font="default" size="100%">York</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Brain imaging researchers execute complex multistep workflows in their computational analysis. Those workflows often include applications that have very different user interfaces and sometimes use different data formats. A good example is the brain perfusion quantification workflow used at the BRIC (Brain Research Imaging Centre) in Edinburgh.
Rapid provides an easy method for creating portlets for computational jobs, and at the same it is extensible.
We have exploited this extensibility with additions that stretch the functionality beyond the original limits. These changes can be used by other projects to create their own portals, but it should be noted that the development of such portals involve a greater effort than the required in the regular use of Rapid for creating portlets. In our case it has been used to provide a user-friendly interface for perfusion analysis that covers from volume </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Kacsuk, Peter</style></author><author><style face="normal" font="default" size="100%">Kozlovszky, Miklos</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Blunk, Dirk</style></author><author><style face="normal" font="default" size="100%">Breuers, Sebastian</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Fels, Gregor</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Packschies, Lars</style></author><author><style face="normal" font="default" size="100%">Müller-Pfefferkorn, Ralph</style></author><author><style face="normal" font="default" size="100%">Schäfer, Patrick</style></author><author><style face="normal" font="default" size="100%">Steinke, Thomas</style></author><author><style face="normal" font="default" size="100%">Szikszay Fabri, Anna</style></author><author><style face="normal" font="default" size="100%">Warzecha, Klaus</style></author><author><style face="normal" font="default" size="100%">Wewior, Martin</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Science Gateway for Molecular Simulations</style></title><secondary-title><style face="normal" font="default" size="100%">EGI User Forum 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><isbn><style face="normal" font="default" size="100%">978 90 816927 1 7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author><author><style face="normal" font="default" size="100%">Kacsuk, P.</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, O.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Special Issue: Portals for life sciences---Providing intuitive access to bioinformatic tools</style></title><secondary-title><style face="normal" font="default" size="100%">Concurrency and Computation: Practice and Experience</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">Wiley</style></publisher><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">223--234</style></pages><abstract><style face="normal" font="default" size="100%">The topic ‘Portals for life sciences’ includes various research fields, on the one hand many different
topics out of life sciences, e.g. mass spectrometry, on the other hand portal technologies and different
aspects of computer science, such as usability of user interfaces and security of systems. The main aspect
about portals is to simplify the user’s interaction with computational resources that are concerted to a
supported application domain.</style></abstract><issue><style face="normal" font="default" size="100%">23</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">J. Rius</style></author><author><style face="normal" font="default" size="100%">F. Cores</style></author><author><style face="normal" font="default" size="100%">F. Solsona</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Koetsier, J.</style></author><author><style face="normal" font="default" size="100%">C. Notredame</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A user-friendly web portal for T-Coffee on supercomputers</style></title><secondary-title><style face="normal" font="default" size="100%">BMC Bioinformatics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword><keyword><style  face="normal" font="default" size="100%">portal</style></keyword><keyword><style  face="normal" font="default" size="100%">rapid</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.biomedcentral.com/1471-2105/12/150</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">150</style></number><volume><style face="normal" font="default" size="100%">12</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Background Parallel T-Coffee (PTC) was the first parallel implementation of the T-Coffee multiple sequence alignment tool. It is based on MPI and RMA mechanisms. Its purpose is to reduce the execution time of the large-scale sequence alignments. It can be run on distributed memory clusters allowing users to align data sets consisting of hundreds of proteins within a reasonable time. However, most of the potential users of this tool are not familiar with the use of grids or supercomputers. Results In this paper we show how PTC can be easily deployed and controlled on a super computer architecture using a web portal developed using Rapid. Rapid is a tool for efficiently generating standardized portlets for a wide range of applications and the approach described here is generic enough to be applied to other applications, or to deploy PTC on different HPC environments. Conclusions The PTC portal allows users to upload a large number of sequences to be aligned by the parallel version of TC that cannot be aligned by a single machine due to memory and execution time constraints. The web portal provides a user-friendly solution.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yaikhom, Gagarine</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Oscar Corcho</style></author><author><style face="normal" font="default" size="100%">Krause, Amy</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Validation and mismatch repair of workflows through typed data streams</style></title><secondary-title><style face="normal" font="default" size="100%">Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><volume><style face="normal" font="default" size="100%">369</style></volume><pages><style face="normal" font="default" size="100%">3285-3299</style></pages><abstract><style face="normal" font="default" size="100%">The type system of a language guarantees that all of the operations on a set of data comply with the rules and conditions set by the language. While language typing is a fundamental requirement for any programming language, the typing of data that flow between processing elements within a workflow is currently being treated as optional. In this paper, we introduce a three-level type system for typing workflow data streams. These types are parts of the Data Intensive System Process Engineering Language programming language, which empowers users with the ability to validate the connections inside a workflow composition, and apply appropriate data type conversions when necessary. Furthermore, this system enables the enactment engine in carrying out type-directed workflow optimizations.</style></abstract><issue><style face="normal" font="default" size="100%">1949</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Han, L</style></author><author><style face="normal" font="default" size="100%">Saengngam, T.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Accelerating Data-Intensive Applications: a Cloud Computing Approach Image Pattern Recognition Tasks</style></title><secondary-title><style face="normal" font="default" size="100%">The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">25/10/2010</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">David E. Singh</style></author><author><style face="normal" font="default" size="100%">Alejandro Calderón</style></author><author><style face="normal" font="default" size="100%">Félix García Carballeira</style></author><author><style face="normal" font="default" size="100%">Jesús Carretero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive CoMPI: Enhancing MPI based applications performance and scalability by using adaptive compression.</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of High Performance Computing and Applications, 2010. Sage</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><abstract><style face="normal" font="default" size="100%">This paper presents an optimization of MPI communication, called Adaptive-CoMPI, based on runtime compression of MPI messages exchanged by applications. The technique developed can be used for any application, because its implementation is transparent for the user, and integrates different compression algorithms for both MPI collective and point-to-point primitives. Furthermore, compression is turned on and off and the most appropriate compression algorithms are selected at runtime, depending on the characteristics of each message, the network behavior, and compression algorithm behavior, following a runtime adaptive strategy. Our system can be optimized for a specific application, through a guided strategy, to reduce the runtime strategy overhead. Adaptive-CoMPI has been validated using several MPI benchmarks and real HPC applications. Results show that, in most cases, by using adaptive compression, communication time is reduced, enhancing application performance and scalability.</style></abstract><issue><style face="normal" font="default" size="100%">25 (3)</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marc Cuggia</style></author><author><style face="normal" font="default" size="100%">Paolo Besana</style></author><author><style face="normal" font="default" size="100%">David Glasspool.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Comparing Clinical Decision Support Systems for Recruitment in Clinical Trials</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Medical Informatics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">R. R. Kitchen</style></author><author><style face="normal" font="default" size="100%">V. S. Sabine</style></author><author><style face="normal" font="default" size="100%">A. H. Sims</style></author><author><style face="normal" font="default" size="100%">E. J. Macaskill</style></author><author><style face="normal" font="default" size="100%">L. Renshaw</style></author><author><style face="normal" font="default" size="100%">J. S. Thomas</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">J. M. Dixon</style></author><author><style face="normal" font="default" size="100%">J. M. S. Bartlett</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Correcting for intra-experiment variation in Illumina BeadChip data is necessary to generate robust gene-expression profiles</style></title><secondary-title><style face="normal" font="default" size="100%">BMC Genomics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.biomedcentral.com/1471-2164/11/134</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/1471-2164-11-134.pdf</style></url></related-urls></urls><volume><style face="normal" font="default" size="100%">11</style></volume><abstract><style face="normal" font="default" size="100%">Background

Microarray technology is a popular means of producing whole genome transcriptional profiles, however high cost and scarcity of mRNA has led many studies to be conducted based on the analysis of single samples. We exploit the design of the Illumina platform, specifically multiple arrays on each chip, to evaluate intra-experiment technical variation using repeated hybridisations of universal human reference RNA (UHRR) and duplicate hybridisations of primary breast tumour samples from a clinical study.

Results

A clear batch-specific bias was detected in the measured expressions of both the UHRR and clinical samples. This bias was found to persist following standard microarray normalisation techniques. However, when mean-centering or empirical Bayes batch-correction methods (ComBat) were applied to the data, inter-batch variation in the UHRR and clinical samples were greatly reduced. Correlation between replicate UHRR samples improved by two orders of magnitude following batch-correction using ComBat (ranging from 0.9833-0.9991 to 0.9997-0.9999) and increased the consistency of the gene-lists from the duplicate clinical samples, from 11.6% in quantile normalised data to 66.4% in batch-corrected data. The use of UHRR as an inter-batch calibrator provided a small additional benefit when used in conjunction with ComBat, further increasing the agreement between the two gene-lists, up to 74.1%.

Conclusion

In the interests of practicalities and cost, these results suggest that single samples can generate reliable data, but only after careful compensation for technical bias in the experiment. We recommend that investigators appreciate the propensity for such variation in the design stages of a microarray experiment and that the use of suitable correction methods become routine during the statistical analysis of the data. </style></abstract><issue><style face="normal" font="default" size="100%">134</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Roure, David De</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Shantenu Jha</style></author><author><style face="normal" font="default" size="100%">Ruth McNally</style></author><author><style face="normal" font="default" size="100%">Robert Mann</style></author><author><style face="normal" font="default" size="100%">Stratis Viglas</style></author><author><style face="normal" font="default" size="100%">Chris Williams</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data-Intensive Research Workshop (15-19 March 2010) Report</style></title><secondary-title><style face="normal" font="default" size="100%">National e-Science Centre</style></secondary-title><alt-title><style face="normal" font="default" size="100%">Data-Intensive Research Workshop Report 15-19 March 2010</style></alt-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data-intensive Computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Data-Intensive Machines</style></keyword><keyword><style  face="normal" font="default" size="100%">Machine Learning</style></keyword><keyword><style  face="normal" font="default" size="100%">Scientific Databases</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2010</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/DIRWS.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Data-Intensive Research Group, School of Informatics, University of Edinburgh</style></publisher><pub-location><style face="normal" font="default" size="100%">Edinburgh</style></pub-location><pages><style face="normal" font="default" size="100%">77 pages</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We met at the National e-Science Institute in Edinburgh on 15-19 March 2010 to develop our understanding of DIR. Approximately 100 participants (see Appendix A) worked together to develop their own understanding, and we are offering this report as the first step in communicating that to a wider community.  We present this in turns of our developing/emerging understanding of &quot;What is DIR?&quot; and &quot;Why it is important?'&quot;. We then review the status of the field, report what the workshop achieved and what remains as open questions.</style></abstract><work-type><style face="normal" font="default" size="100%">e-Science Report</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">Jesús Carretero</style></author><author><style face="normal" font="default" size="100%">David E. Singh</style></author><author><style face="normal" font="default" size="100%">Alejandro Calderón</style></author><author><style face="normal" font="default" size="100%">Alberto Nunez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Dynamic-CoMPI: Dynamic optimization techniques for MPI parallel applications.</style></title><secondary-title><style face="normal" font="default" size="100%">The Journal of Supercomputing.</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Adaptive systems</style></keyword><keyword><style  face="normal" font="default" size="100%">Clusters architectures</style></keyword><keyword><style  face="normal" font="default" size="100%">Collective I/O</style></keyword><keyword><style  face="normal" font="default" size="100%">Compression algorithms</style></keyword><keyword><style  face="normal" font="default" size="100%">Heuristics</style></keyword><keyword><style  face="normal" font="default" size="100%">MPI library - Parallel techniques</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2010</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><abstract><style face="normal" font="default" size="100%">This work presents an optimization of MPI communications, called Dynamic-CoMPI, which uses two techniques in order to reduce the impact of communications and non-contiguous I/O requests in parallel applications. These techniques are independent of the application and complementaries to each other. The first technique is an optimization of the Two-Phase collective I/O technique from ROMIO, called Locality aware strategy for Two-Phase I/O (LA-Two-Phase I/O). In order to increase the locality of the file accesses, LA-Two-Phase I/O employs the Linear Assignment Problem (LAP) for finding an optimal I/O data communication schedule. The main purpose of this technique is the reduction of the number of communications involved in the I/O collective operation. The second technique, called Adaptive-CoMPI, is based on run-time compression of MPI messages exchanged by applications. Both techniques can be applied on every application, because both of them are transparent for the users. Dynamic-CoMPI has been validated by using several MPI benchmarks and real HPC applications. The results show that, for many of the considered scenarios, important reductions in the execution time are achieved by reducing the size and the number of the messages. Additional benefits of our approach are the reduction of the total communication time and the network contention, thus enhancing, not only performance, but also scalability.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Nick Antonopoulos</style></author><author><style face="normal" font="default" size="100%">Georgios Exarchakos</style></author><author><style face="normal" font="default" size="100%">Maozhen Li</style></author><author><style face="normal" font="default" size="100%">Antonio Liottac</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Exploiting P2P and Grid Computing Technologies for Resource Sharing to support High Performance Distributed System</style></title><secondary-title><style face="normal" font="default" size="100%">Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications </style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><section><style face="normal" font="default" size="100%">19</style></section><publisher><style face="normal" font="default" size="100%">IGI Global publishing</style></publisher><volume><style face="normal" font="default" size="100%">1</style></volume><num-vols><style face="normal" font="default" size="100%">2</style></num-vols></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yaikhom, Gagarine</style></author><author><style face="normal" font="default" size="100%">Liew, Chee</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Krause, Amy</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">D’Ambra, Pasqua</style></author><author><style face="normal" font="default" size="100%">Guarracino, Mario</style></author><author><style face="normal" font="default" size="100%">Talia, Domenico</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Federated Enactment of Workflow Patterns</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-15277-1_31</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><volume><style face="normal" font="default" size="100%">6271</style></volume><pages><style face="normal" font="default" size="100%">317-328</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we address two research questions concerning workflows: 1) how do we abstract and catalogue recurring workflow patterns?; and 2) how do we facilitate optimisation of the mapping from workflow patterns to actual resources at runtime? Our aim here is to explore techniques that are applicable to large-scale workflow compositions, where the resources could change dynamically during the lifetime of an application. We achieve this by introducing a registry-based mechanism where pattern abstractions are catalogued and stored. In conjunction with an enactment engine, which communicates with this registry, concrete computational implementations and resources are assigned to these patterns, conditional to the execution parameters. Using a data mining application from the life sciences, we demonstrate this new approach.</style></abstract><work-type><style face="normal" font="default" size="100%">incollection</style></work-type><notes><style face="normal" font="default" size="100%">10.1007/978-3-642-15277-1_31</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Breuers, Sebastian</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Blunk, Dirk</style></author><author><style face="normal" font="default" size="100%">Fels, Gregor</style></author><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Packschies, Lars</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Grid-Workflows in Molecular Science</style></title><secondary-title><style face="normal" font="default" size="100%">Software Engineering 2010, Grid Workflow Workshop</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">GI-Edition - Lecture Notes in Informatics (LNI)</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dobrzelecki, B.</style></author><author><style face="normal" font="default" size="100%">Krause, A.</style></author><author><style face="normal" font="default" size="100%">Hume, A. C.</style></author><author><style face="normal" font="default" size="100%">Grant, A.</style></author><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Alemu, T. Y.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Jackson, M.</style></author><author><style face="normal" font="default" size="100%">Theocharopoulos, E.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Integrating distributed data sources with OGSA--DAI DQP and Views</style></title><secondary-title><style face="normal" font="default" size="100%">Philosophical Transactions A</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><number><style face="normal" font="default" size="100%">1926</style></number><volume><style face="normal" font="default" size="100%">368</style></volume><pages><style face="normal" font="default" size="100%">4133--4145</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">OGSA-DAI (Open Grid Services Architecture Data Access and Integration) is a framework for building distributed data access and integration systems. Until recently, it lacked the built-in functionality that would allow easy creation of federations of distributed data sources. The latest release of the OGSA-DAI framework introduced the OGSA-DAI DQP (Distributed Query Processing) resource. The new resource encapsulates a distributed query processor, that is able to orchestrate distributed data sources when answering declarative user queries. The query processor has many extensibility points, making it easy to customize. We have also introduced a new OGSA-DAI Views  resource that provides a flexible method for defining views over relational data. The interoperability of the two new resources, together with the flexibility of the OGSA-DAI framework, allows the building of highly customized data integration solutions.

</style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">C. A. Morrison</style></author><author><style face="normal" font="default" size="100%">N. Robertson</style></author><author><style face="normal" font="default" size="100%">Turner, A.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author><author><style face="normal" font="default" size="100%">Koetsier, J.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J. Derek Woollins</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Molecular Orbital Calculations of Inorganic Compounds</style></title><secondary-title><style face="normal" font="default" size="100%">Inorganic Experiments</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><section><style face="normal" font="default" size="100%">3.33</style></section><edition><style face="normal" font="default" size="100%">3</style></edition><publisher><style face="normal" font="default" size="100%">Wiley-VCH</style></publisher><pages><style face="normal" font="default" size="100%">261--267</style></pages><isbn><style face="normal" font="default" size="100%">978-3527292530</style></isbn></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Wewior, Martin</style></author><author><style face="normal" font="default" size="100%">Packschies, Lars</style></author><author><style face="normal" font="default" size="100%">Blunk, Dirk</style></author><author><style face="normal" font="default" size="100%">Wickeroth, D.</style></author><author><style face="normal" font="default" size="100%">Warzecha, Klaus</style></author><author><style face="normal" font="default" size="100%">Herres-Pawlis, Sonja</style></author><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Breuers, Sebastian</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Lang, Ulrich</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Barbera, Roberto</style></author><author><style face="normal" font="default" size="100%">Andronico, Giuseppe</style></author><author><style face="normal" font="default" size="100%">La Rocca, Giuseppe</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The MoSGrid Gaussian Portlet – Technologies for the Implementation of Portlets for Molecular Simulations</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Workshop on Science Gateways (IWSG10)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">Consorzio COMETA</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Carpenter, Trevor K.</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano I.</style></author><author><style face="normal" font="default" size="100%">Wardlaw, Joanna M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An open source toolkit for medical imaging de-identification</style></title><secondary-title><style face="normal" font="default" size="100%">European Radiology</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Anonymisation</style></keyword><keyword><style  face="normal" font="default" size="100%">Data Protection Act (DPA)</style></keyword><keyword><style  face="normal" font="default" size="100%">De-identification</style></keyword><keyword><style  face="normal" font="default" size="100%">Digital Imaging and Communications in Medicine (DICOM)</style></keyword><keyword><style  face="normal" font="default" size="100%">Privacy policies</style></keyword><keyword><style  face="normal" font="default" size="100%">Pseudonymisation</style></keyword><keyword><style  face="normal" font="default" size="100%">Toolkit</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/j20844338623m167/</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">1896--1904</style></pages><abstract><style face="normal" font="default" size="100%">Objective  
Medical imaging acquired for clinical purposes can have several legitimate secondary uses in research projects and teaching libraries. No commonly accepted solution for anonymising these images exists because the amount of personal data that should be preserved varies case by case. Our objective is to provide a flexible mechanism for anonymising Digital Imaging and Communications in Medicine (DICOM) data that meets the requirements for deployment in multicentre trials.
Methods  
We reviewed our current de-identification practices and defined the relevant use cases to extract the requirements for the de-identification process. We then used these requirements in the design and implementation of the toolkit. Finally, we tested the toolkit taking as a reference those requirements, including a multicentre deployment.
Results  
The toolkit successfully anonymised DICOM data from various sources. Furthermore, it was shown that it could forward anonymous data to remote destinations, remove burned-in annotations, and add tracking information to the header. The toolkit also implements the DICOM standard confidentiality mechanism.
Conclusion  
A DICOM de-identification toolkit that facilitates the enforcement of privacy policies was developed. It is highly extensible, provides the necessary flexibility to account for different de-identification requirements and has a low adoption barrier for new users.</style></abstract><issue><style face="normal" font="default" size="100%">8</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tichopad, Ales</style></author><author><style face="normal" font="default" size="100%">Tzachi Bar</style></author><author><style face="normal" font="default" size="100%">Ladislav Pecen</style></author><author><style face="normal" font="default" size="100%">Robert R. Kitchen</style></author><author><style face="normal" font="default" size="100%">Kubista, Mikael</style></author><author><style face="normal" font="default" size="100%">Michael W. Pfaffl</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Quality control for quantitative PCR based on amplification compatibility test</style></title><secondary-title><style face="normal" font="default" size="100%">Methods</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science?_ob=ArticleURL&amp;_udi=B6WN5-4Y88DBN-3&amp;_user=10&amp;_coverDate=04%2F30%2F2010&amp;_alid=1247745718&amp;_rdoc=1&amp;_fmt=high&amp;_orig=search&amp;_cdi=6953&amp;_sort=r&amp;_docanchor=&amp;view=c&amp;_ct=2&amp;_acct=C000050221&amp;_version=1&amp;_urlVersion=0&amp;_userid=10&amp;md5</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><volume><style face="normal" font="default" size="100%">50</style></volume><pages><style face="normal" font="default" size="100%">308-312 </style></pages><abstract><style face="normal" font="default" size="100%">Quantitative qPCR is a routinely used method for the accurate quantification of nucleic acids. Yet it may generate erroneous results if the amplification process is obscured by inhibition or generation of aberrant side-products such as primer dimers. Several methods have been established to control for pre-processing performance that rely on the introduction of a co-amplified reference sequence, however there is currently no method to allow for reliable control of the amplification process without directly modifying the sample mix. Herein we present a statistical approach based on multivariate analysis of the amplification response data generated in real-time. The amplification trajectory in its most resolved and dynamic phase is fitted with a suitable model. Two parameters of this model, related to amplification efficiency, are then used for calculation of the Z-score statistics. Each studied sample is compared to a predefined reference set of reactions, typically calibration reactions. A probabilistic decision for each individual Z-score is then used to identify the majority of inhibited reactions in our experiments. We compare this approach to univariate methods using only the sample specific amplification efficiency as reporter of the compatibility. We demonstrate improved identification performance using the multivariate approach compared to the univariate approach. Finally we stress that the performance of the amplification compatibility test as a quality control procedure depends on the quality of the reference set.</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bacigalupo, D. A.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author><author><style face="normal" font="default" size="100%">Usmani, A.</style></author><author><style face="normal" font="default" size="100%">Dillenberger, D. N.</style></author><author><style face="normal" font="default" size="100%">Wills, G. B.</style></author><author><style face="normal" font="default" size="100%">Jarvis, S. A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Resource management of enterprise cloud systems using layered queuing and historical performance models</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE International Symposium on Parallel Distributed Processing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><pages><style face="normal" font="default" size="100%">1--8</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The automatic allocation of enterprise workload to resources can be enhanced by being able to make `what-if' response time predictions, whilst different allocations are being considered. It is important to quantitatively compare the effectiveness of different prediction techniques for use in cloud infrastructures. To help make the comparison of relevance to a wide range of possible cloud environments it is useful to consider the following. 1.) urgent cloud customers such as the emergency services that can demand cloud resources at short notice (e.g. for our FireGrid emergency response software). 2.) dynamic enterprise systems, that must rapidly adapt to frequent changes in workload, system configuration and/or available cloud servers. 3.) The use of the predictions in a coordinated manner by both the cloud infrastructure and cloud customer management systems. 4.) A broad range of criteria for evaluating each technique. However, there have been no previous comparisons meeting these requirements. This paper, meeting the above requirements, quantitatively compares the layered queuing and (\^A¿HYDRA\^A¿) historical techniques - including our initial thoughts on how they could be combined. Supporting results and experiments include the following: i.) defining, investigating and hence providing guidelines on the use of a historical and layered queuing model; ii.) using these guidelines showing that both techniques can make low overhead and typically over 70% accurate predictions, for new server architectures for which only a small number of benchmarks have been run; and iii.) defining and investigating tuning a prediction-based cloud workload and resource management algorithm.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Robert R. Kitchen</style></author><author><style face="normal" font="default" size="100%">Kubista, Mikael</style></author><author><style face="normal" font="default" size="100%">Tichopad, Ales</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Statistical aspects of quantitative real-time PCR experiment design</style></title><secondary-title><style face="normal" font="default" size="100%">Methods</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Error propagation</style></keyword><keyword><style  face="normal" font="default" size="100%">Experiment design</style></keyword><keyword><style  face="normal" font="default" size="100%">Gene expression</style></keyword><keyword><style  face="normal" font="default" size="100%">Nested analysis of variance</style></keyword><keyword><style  face="normal" font="default" size="100%">powerNest</style></keyword><keyword><style  face="normal" font="default" size="100%">Prospective power analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">qPCR</style></keyword><keyword><style  face="normal" font="default" size="100%">Real-time PCR</style></keyword><keyword><style  face="normal" font="default" size="100%">Sampling plan</style></keyword><keyword><style  face="normal" font="default" size="100%">Statistical power</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science?_ob=GatewayURL&amp;_method=citationSearch&amp;_uoikey=B6WN5-4Y88DBN-1&amp;_origin=SDEMFRHTML&amp;_version=1&amp;md5=7bb0b5b797d6e1f7c5c2df478fc88e5a</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><volume><style face="normal" font="default" size="100%">50</style></volume><pages><style face="normal" font="default" size="100%">231-236</style></pages><abstract><style face="normal" font="default" size="100%">Experiments using quantitative real-time PCR to test hypotheses are limited by technical and biological variability; we seek to minimise sources of confounding variability through optimum use of biological and technical replicates. The quality of an experiment design is commonly assessed by calculating its prospective power. Such calculations rely on knowledge of the expected variances of the measurements of each group of samples and the magnitude of the treatment effect; the estimation of which is often uninformed and unreliable. Here we introduce a method that exploits a small pilot study to estimate the biological and technical variances in order to improve the design of a subsequent large experiment. We measure the variance contributions at several ‘levels’ of the experiment design and provide a means of using this information to predict both the total variance and the prospective power of the assay. A validation of the method is provided through a variance analysis of representative genes in several bovine tissue-types. We also discuss the effect of normalisation to a reference gene in terms of the measured variance components of the gene of interest. Finally, we describe a software implementation of these methods, powerNest, that gives the user the opportunity to input data from a pilot study and interactively modify the design of the assay. The software automatically calculates expected variances, statistical power, and optimal design of the larger experiment. powerNest enables the researcher to minimise the total confounding variance and maximise prospective power for a specified maximum cost for the large study.</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Jos Koetsier</style></author><author><style face="normal" font="default" size="100%">Bertsch, Andreas</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">TOPP goes Rapid</style></title><secondary-title><style face="normal" font="default" size="100%">Cluster Computing and the Grid, IEEE International Symposium on</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%">Los Alamitos, CA, USA</style></pub-location><pages><style face="normal" font="default" size="100%">598--599</style></pages><isbn><style face="normal" font="default" size="100%">978-0-7695-4039-9</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Proteomics, the study of all the proteins contained in a particular sample, e.g., a cell, is a key technology in current biomedical research. The complexity and volume of proteomics data sets produced by mass spectrometric methods clearly suggests the use of grid-based high-performance computing for analysis. TOPP and OpenMS are open-source packages for proteomics data analysis; however, they do not provide support for Grid computing. In this work we present a portal interface for high-throughput data analysis with TOPP. The portal is based on Rapid, a tool for efficiently generating standardized portlets for a wide range of applications. The web-based interface allows the creation and editing of user-defined pipelines and their execution and monitoring on a Grid infrastructure. The portal also supports several file transfer protocols for data staging. It thus provides a simple and complete solution to high-throughput proteomics data analysis for inexperienced users through a convenient portal interface.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chee Sun Liew</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards Optimising Distributed Data Streaming Graphs using Parallel Streams</style></title><secondary-title><style face="normal" font="default" size="100%">Data Intensive Distributed Computing (DIDC'10), in conjunction with the 19th International Symposium on High Performance Distributed Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Data-intensive Computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Distributed Computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Optimisation</style></keyword><keyword><style  face="normal" font="default" size="100%">Parallel Stream</style></keyword><keyword><style  face="normal" font="default" size="100%">Scientific Workflows</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">20/06/2010</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.cct.lsu.edu/~kosar/didc10/index.php</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">Chicago, Illinois</style></pub-location><pages><style face="normal" font="default" size="100%">725-736</style></pages><abstract><style face="normal" font="default" size="100%">Modern scientific collaborations have opened up the opportunity of solving complex problems that involve multi- disciplinary expertise and large-scale computational experiments. These experiments usually involve large amounts of data that are located in distributed data repositories running various software systems, and managed by different organisations. A common strategy to make the experiments more manageable is executing the processing steps as a workflow. In this paper, we look into the implementation of fine-grained data-flow between computational elements in a scientific workflow as streams. We model the distributed computation as a directed acyclic graph where the nodes represent the processing elements that incrementally implement specific subtasks. The processing elements are connected in a pipelined streaming manner, which allows task executions to overlap. We further optimise the execution by splitting pipelines across processes and by introducing extra parallel streams. We identify performance metrics and design a measurement tool to evaluate each enactment. We conducted ex- periments to evaluate our optimisation strategies with a real world problem in the Life Sciences—EURExpress-II. The paper presents our distributed data-handling model, the optimisation and instrumentation strategies and the evaluation experiments. We demonstrate linear speed up and argue that this use of data-streaming to enable both overlapped pipeline and parallelised enactment is a generally applicable optimisation strategy.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Smith-Miles, Kate</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Lim, Xin</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Blum, Christian</style></author><author><style face="normal" font="default" size="100%">Battiti, Roberto</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Understanding TSP Difficulty by Learning from Evolved Instances</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-13800-3_29</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Berlin / Heidelberg</style></publisher><volume><style face="normal" font="default" size="100%">6073</style></volume><pages><style face="normal" font="default" size="100%">266-280</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Whether the goal is performance prediction, or insights into the relationships between algorithm performance and instance characteristics, a comprehensive set of meta-data from which relationships can be learned is needed. This paper provides a methodology to determine if the meta-data is sufficient, and demonstrates the critical role played by instance generation methods. Instances of the Travelling Salesman Problem (TSP) are evolved using an evolutionary algorithm to produce distinct classes of instances that are intentionally easy or hard for certain algorithms. A comprehensive set of features is used to characterise instances of the TSP, and the impact of these features on difficulty for each algorithm is analysed. Finally, performance predictions are achieved with high accuracy on unseen instances for predicting search effort as well as identifying the algorithm likely to perform best.</style></abstract><work-type><style face="normal" font="default" size="100%">incollection</style></work-type><notes><style face="normal" font="default" size="100%">10.1007/978-3-642-13800-3_29</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Marton, Istvan</style></author><author><style face="normal" font="default" size="100%">Birkenheuer, Georg</style></author><author><style face="normal" font="default" size="100%">Schuller, Bernd</style></author><author><style face="normal" font="default" size="100%">Grunzke, Richard</style></author><author><style face="normal" font="default" size="100%">Krüger, Jens</style></author><author><style face="normal" font="default" size="100%">Breuers, Sebastian</style></author><author><style face="normal" font="default" size="100%">Blunk, Dirk</style></author><author><style face="normal" font="default" size="100%">Fels, Gregor</style></author><author><style face="normal" font="default" size="100%">Packschies, Lars</style></author><author><style face="normal" font="default" size="100%">Brinkmann, André</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author><author><style face="normal" font="default" size="100%">Kozlovszky, Miklos</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Workflow Interoperability in a Grid Portal for Molecular Simulations</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the International Workshop on Science Gateways (IWSG10)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">Consorzio COMETA</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Peter Brezany</style></author><author><style face="normal" font="default" size="100%">Ivan Janciak</style></author><author><style face="normal" font="default" size="100%">Alexander Woehrer</style></author><author><style face="normal" font="default" size="100%">Carlos Buil Aranda</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">ADMIRE D1.5 – Report defining an iteration of the model and language: PM3 and DL3</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">09/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.admire-project.eu/docs/ADMIRE-D1.5-model-language-ontology.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ADMIRE project</style></publisher><abstract><style face="normal" font="default" size="100%">This document is the third deliverable to report on the progress of the model, language and ontology research conducted within Workpackage 1 of the ADMIRE project. Significant progress has been made on each of the above areas. The new results that we achieved are recorded against the targets defined for project month 18 and are reported in four sections of this document</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Voss, A.</style></author><author><style face="normal" font="default" size="100%">Asgari-Targhi, M.</style></author><author><style face="normal" font="default" size="100%">Procter, R.</style></author><author><style face="normal" font="default" size="100%">Halfpenny, P.</style></author><author><style face="normal" font="default" size="100%">Fragkouli, E.</style></author><author><style face="normal" font="default" size="100%">Anderson, S.</style></author><author><style face="normal" font="default" size="100%">Hughes, L.</style></author><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Vander Meer, E.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adoption of e-Infrastructure Services: inhibitors, enablers and opportunities</style></title><secondary-title><style face="normal" font="default" size="100%">5th International Conference on e-Social Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">24-06-2009</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/adoption%20of%20e-infrastructure%20services.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Maternushaus, Cologne</style></pub-location><abstract><style face="normal" font="default" size="100%">Based on more than 100 interviews with respondents from the academic community and information services, we present findings from our study of inhibitors and enablers of adoption of e-Infrastructure services for research. We discuss issues raised and potential ways of addressing them.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Brezany, P.</style></author><author><style face="normal" font="default" size="100%">Corcho, O.</style></author><author><style face="normal" font="default" size="100%">Han, L</style></author><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author><author><style face="normal" font="default" size="100%">Hluchy, L.</style></author><author><style face="normal" font="default" size="100%">Hume, A.</style></author><author><style face="normal" font="default" size="100%">Janciak, I.</style></author><author><style face="normal" font="default" size="100%">Krause, A.</style></author><author><style face="normal" font="default" size="100%">Snelling, D.</style></author><author><style face="normal" font="default" size="100%">Wöhrer, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Advanced Data Mining and Integration Research for Europe</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2009</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">07/12/2009</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/AHM2009-ADMIRE%20abstract.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Oxford</style></pub-location><abstract><style face="normal" font="default" size="100%">There is a rapidly growing wealth of data [1]. The number of sources of data is increasing,
while, at the same time, the diversity, complexity and scale of these data resources are also increasing
dramatically. This cornucopia of data oers much potential; a combinatorial explosion of opportunities
for knowledge discovery, improved decisions and better policies. Today, most of these opportunities are
not realised because composing data from multiple sources and extracting information is too dicult.
Every business, organisation and government faces problems that can only be addressed successfully if
we improve our techniques for exploiting the data we gather.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Richard Baldock</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ronghuai Huang</style></author><author><style face="normal" font="default" size="100%">Qiang Yang</style></author><author><style face="normal" font="default" size="100%">Jian Pei</style></author><author><style face="normal" font="default" size="100%">et al</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Automating Gene Expression Annotation for Mouse Embryo</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science (Advanced Data Mining and Applications, 5th International Conference)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">LNAI 5678</style></volume><pages><style face="normal" font="default" size="100%">469-478</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barker, A.</style></author><author><style face="normal" font="default" size="100%">Weissman, J.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Circulate Architecture: Avoiding Workflow Bottlenecks Caused By Centralised Orchestration</style></title><secondary-title><style face="normal" font="default" size="100%">Cluster Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">grid computing</style></keyword><keyword><style  face="normal" font="default" size="100%">workflow</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/080q5857711w2054/?p=824749739c6a432ea95a0c3b59f4025f&amp;pi=1</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">12</style></volume><pages><style face="normal" font="default" size="100%">221--235</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">David E. Singh</style></author><author><style face="normal" font="default" size="100%">Alejandro Calderón</style></author><author><style face="normal" font="default" size="100%">Jesús Carretero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">CoMPI: Enhancing MPI Based Applications Performance and Scalability Using Run-Time Compression.</style></title><secondary-title><style face="normal" font="default" size="100%">EUROPVM/MPI 2009.Espoo, Finland. September 2009</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">01/09/2009</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Espoo. Finland</style></pub-location><volume><style face="normal" font="default" size="100%">5759/2009</style></volume><abstract><style face="normal" font="default" size="100%">This paper presents an optimization of MPI communications, called CoMPI, based on run-time compression of MPI messages exchanged by applications. A broad number of compression algorithms have been fully implemented and tested for both MPI collective and point to point primitives. In addition, this paper presents a study of several compression algorithms that can be used for run-time compression, based on the datatype used by applications. This study has been validated by using several MPI benchmarks and real HPC applications. Show that, in most of the cases, using compression reduces the application communication time enhancing application performance and scalability. In this way, CoMPI obtains important improvements in the overall execution time for many of the considered scenarios.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Coveney, P. V.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Coveney, P. V.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Crossing boundaries: computational science, e-Science and global e-Infrastructure I</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands meeting 2008</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Philosophical Transactions of the Royal Society Series A</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/09/2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://rsta.royalsocietypublishing.org/content/367/1897.toc</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Royal Society Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Edinburgh</style></pub-location><volume><style face="normal" font="default" size="100%">367</style></volume><pages><style face="normal" font="default" size="100%">2423-2617</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Coveney, P. V.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Coveney, P. V.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Crossing boundaries: computational science, e-Science and global e-Infrastructure  II</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2008</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Philosophical Transactions of the Royal Society Series A</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/09/2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://rsta.royalsocietypublishing.org/content/367/1898.toc</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Royal Society Publishing</style></publisher><pub-location><style face="normal" font="default" size="100%">Edinburgh</style></pub-location><volume><style face="normal" font="default" size="100%">367</style></volume><pages><style face="normal" font="default" size="100%">2619-2806</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Tichopad, Ales</style></author><author><style face="normal" font="default" size="100%">Kitchen, Rob</style></author><author><style face="normal" font="default" size="100%">Riedmaier, Irmgard</style></author><author><style face="normal" font="default" size="100%">Becker, Christiane</style></author><author><style face="normal" font="default" size="100%">Stahlberg, Anders</style></author><author><style face="normal" font="default" size="100%">Kubista, Mikael</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Design and Optimization of Reverse-Transcription Quantitative PCR Experiments</style></title><secondary-title><style face="normal" font="default" size="100%">Clin Chem</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.clinchem.org/cgi/content/abstract/clinchem.2009.126201v1</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">clinchem.2009.126201</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">BACKGROUND: Quantitative PCR (qPCR) is a valuable technique for accurately and reliably profiling and quantifying gene expression.  Typically, samples obtained from the organism of study have to be processed via several preparative steps before qPCR. METHOD: We estimated the errors of sample withdrawal and extraction, reverse transcription (RT), and qPCR that are introduced into measurements of mRNA concentrations.  We performed hierarchically arranged experiments with 3 animals, 3 samples, 3 RT reactions, and 3 qPCRs and quantified the expression of several genes in solid tissue, blood, cell culture, and single cells. RESULTS: A nested ANOVA design was used to model the experiments, and relative and absolute errors were calculated with this model for each processing level in the hierarchical design.  We found that intersubject differences became easily confounded by sample heterogeneity for single cells and solid tissue.  In cell cultures and blood, the noise from the RT and qPCR steps contributed substantially to the overall error because the sampling noise was less pronounced. CONCLUSIONS: We recommend the use of sample replicates preferentially to any other replicates when working with solid tissue, cell cultures, and single cells, and we recommend the use of RT replicates when working with blood.  We show how an optimal sampling plan can be calculated for a limited budget. </style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Ally Hume</style></author><author><style face="normal" font="default" size="100%">Chee Sun Liew</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Distributed Architecture for Data Mining and Integration</style></title><secondary-title><style face="normal" font="default" size="100%">Data-Aware Distributed Computing (DADC'09), in conjunction with the 18th International Symposium on High Performance Distributed Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pages><style face="normal" font="default" size="100%">11-20</style></pages><abstract><style face="normal" font="default" size="100%">This paper presents the rationale for a new architecture to support a signiﬁcant increase in the scale of data integration and data mining. It proposes the composition into one framework of (1) data mining and (2) data access and integration. We name the combined activity “DMI”. It supports enactment of DMI processes across heterogeneous and distributed data resources and data mining services. It posits that a useful division can be made between the facilities established to support the deﬁnition of DMI processes and the computational infrastructure provided to enact DMI processes. Communication between those two divisions is restricted to requests submitted to gateway services in a canonical DMI language. Larger-scale processes are enabled by incremental reﬁnement of DMI-process deﬁnitions often by recomposition of lower-level deﬁnitions. Autonomous types and descriptions which will support detection of inconsistencies and semi-automatic insertion of adaptations.These architectural ideas are being evaluated in a feasibility study that involves an application scenario and representatives of the community. 
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barker, Adam</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano I.</style></author><author><style face="normal" font="default" size="100%">Baldock, Richard A.</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An e-Infrastructure for Collaborative Research in Human Embryo Development</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">01/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://arxiv.org/pdf/0901.2310v1</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">6</style></pages><abstract><style face="normal" font="default" size="100%">Within the context of the EU Design Study Developmental Gene Expression Map, we identify a set of challenges when facilitating collaborative research on early human embryo development. These challenges bring forth requirements, for which we have identified solutions and technology. We summarise our solutions and demonstrate how they integrate to form an e-infrastructure to support collaborative research in this area of developmental biology. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barker, Adam</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano I.</style></author><author><style face="normal" font="default" size="100%">Baldock, Richard A.</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An E-infrastructure to Support Collaborative Embryo Research</style></title><secondary-title><style face="normal" font="default" size="100%">Cluster Computing and the Grid</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pages><style face="normal" font="default" size="100%">520--525</style></pages><isbn><style face="normal" font="default" size="100%">978-0-7695-3622-4</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">la Poutré, J. A.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pereira Babtista, F.</style></author><author><style face="normal" font="default" size="100%">Tavares, J.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Exploiting Fruitful Regions in Dynamic Routing using Evolutionary Computation</style></title><secondary-title><style face="normal" font="default" size="100%">Studies in Computational Intelligence </style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">161</style></volume><pages><style face="normal" font="default" size="100%">131--149</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-85151-6</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">incollection</style></work-type><notes><style face="normal" font="default" size="100%">Awaiting publication (due October 2008)</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Koetsier, J.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Giving Computational Science a Friendly Face</style></title><secondary-title><style face="normal" font="default" size="100%">Zero-In</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.beliefproject.org/zero-in/zero-in-third-edition/zero-in-issue-3</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Zero-In-Issue3.pdf</style></url></related-urls></urls><volume><style face="normal" font="default" size="100%">1</style></volume><pages><style face="normal" font="default" size="100%">12--13</style></pages><abstract><style face="normal" font="default" size="100%">Today, most researchers from any discipline will successfully use web-based e-commerce systems to book flights to attend their conferences. But when these same researchers are confronted with compute-intensive problems, they cannot expect elaborate web-based systems to enable their domain-specific tasks.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Guest Editorial: Research Data: It’s What You Do With Them</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Digital Curation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.ijdc.net/index.php/ijdc/article/view/96</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">4</style></volume><abstract><style face="normal" font="default" size="100%">These days it may be stating the obvious that the number of data resources, their complexity and diversity is growing rapidly due to the compound effects of increasing speed and resolution of digital instruments, due to pervasive data-collection automation and due to the growing power of computers. Just because we are becoming used to the accelerating growth of data resources, it does not mean we can be complacent; they represent an enormous wealth of opportunity to extract information, to make discoveries and to inform policy. But all too often it still takes a heroic effort to discover and exploit those opportunities, hence the research and progress, charted by the Fourth International Digital Curation Conference1 and recorded in this issue of the International Journal of Digital Curation, are an invaluable step on a long and demanding journey. 
</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mahdi Seify</style></author><author><style face="normal" font="default" size="100%">Shahriar Bijani</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Methodology for Mobile Network Security Risk Management</style></title><secondary-title><style face="normal" font="default" size="100%">Sixth International Conference on Information Technology: New Generations (ITNG '09)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">27/04/2009</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Ferrari, Luna</style></author><author><style face="normal" font="default" size="100%">Stuart Aitken</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Goryanin, Igor</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A model of social collaboration in Molecular Biology knowledge bases</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 6th Conference of the European Social Simulation    Association (ESSA'09)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">European Social Simulation Association</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Manual annotation of biological data cannot keep up with data production.
   Open annotation models using wikis have been proposed to address
   this problem. In this empirical study we analyse 36 years of knowledge
   collection by 738 authors in two Molecular Biology wikis (EcoliWiki
   and WikiPathways) and two knowledge bases (OMIM and Reactome). We
   first investigate authorship metrics (authors per entry and edits
   per author) which are power-law distributed in Wikipedia and we find
   they are heavy-tailed in these four systems too. We also find surprising
   similarities between the open (editing open to everyone) and the
   closed systems (expert curators only). Secondly, to discriminate
   between driving forces in the measured distributions, we simulate
   the curation process and find that knowledge overlap among authors
   can drive the number of authors per entry, while the time the users
   spend on the knowledge base can drive the number of contributions
   per author.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Grimshaw, Andrew</style></author><author><style face="normal" font="default" size="100%">Morgan, Mark</style></author><author><style face="normal" font="default" size="100%">Merrill, Duane</style></author><author><style face="normal" font="default" size="100%">Kishimoto, Hiro</style></author><author><style face="normal" font="default" size="100%">Savva, Andreas</style></author><author><style face="normal" font="default" size="100%">Snelling, David</style></author><author><style face="normal" font="default" size="100%">Smith, Chris</style></author><author><style face="normal" font="default" size="100%">Dave Berry</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Open Grid Services Architecture Primer</style></title><secondary-title><style face="normal" font="default" size="100%">Computer</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><publisher><style face="normal" font="default" size="100%">IEEE Computer Society Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Los Alamitos, CA, USA</style></pub-location><volume><style face="normal" font="default" size="100%">42</style></volume><pages><style face="normal" font="default" size="100%">27--34</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The performance model of dynamic Virtual Organization (VO) formations within grid computing context </style></title><secondary-title><style face="normal" font="default" size="100%"> Chaos, Solitons &amp; Fractals </style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">complex network</style></keyword><keyword><style  face="normal" font="default" size="100%">graph theory</style></keyword><keyword><style  face="normal" font="default" size="100%">grid computing</style></keyword><keyword><style  face="normal" font="default" size="100%">virtual organization formation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">Elsevier Science </style></publisher><volume><style face="normal" font="default" size="100%">40</style></volume><pages><style face="normal" font="default" size="100%">1599-1608</style></pages><issue><style face="normal" font="default" size="100%">4</style></issue><notes><style face="normal" font="default" size="100%">In press</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, O.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Portals for Life Sciences—a Brief Introduction</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the IWPLS09 International Workshop on Portals for Life Sciences</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-513/paper01.pdf</style></url></web-urls></urls><abstract><style face="normal" font="default" size="100%">The topic ”‘Portals for Life Sciences”’ includes various research fields, on the one hand many different topics out of life sciences, e.g. mass spectrometry, on the other hand portal technologies and different aspects of computer science, such as usability of user interfaces and security of systems. The main aspect about portals is to simplify the user’s interaction with computational resources which are concer- ted to a supported application domain.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Coveney, P. V.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Preface. Crossing boundaries: computational science, e-Science and global e-Infrastructure</style></title><secondary-title><style face="normal" font="default" size="100%">Philosophical Transactions of the Royal Society Series A</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">06/2009</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Royal Society Publishing</style></publisher><volume><style face="normal" font="default" size="100%">367</style></volume><pages><style face="normal" font="default" size="100%">2425-2427</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Proceedings of the 1st International Workshop on Portals for Life Sciences</style></title><secondary-title><style face="normal" font="default" size="100%">IWPLS09 International Workshop on Portals for Life Sciences</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">14/09/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-513</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">e-Science Institute, Edinburgh, UK</style></pub-location></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Koetsier, J.</style></author><author><style face="normal" font="default" size="100%">Turner, A.</style></author><author><style face="normal" font="default" size="100%">Richardson, P.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Trefethen, A</style></author><author><style face="normal" font="default" size="100%">De Roure, D</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Rapid chemistry portals through engaging researchers</style></title><secondary-title><style face="normal" font="default" size="100%">Fifth IEEE International Conference on e-Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><pub-location><style face="normal" font="default" size="100%">Oxford, UK</style></pub-location><pages><style face="normal" font="default" size="100%">284-291</style></pages><abstract><style face="normal" font="default" size="100%">In this study, we apply a methodology for rapid development of portlets for scientific computing to the domain of computational chemistry. We report results in terms of the portals delivered, the changes made to our methodology and the experience gained in terms of interaction with domain-specialists. Our major contributions are: several web portals for teaching and research in computational chemistry; a successful transition to having our development tool used by the domain specialist as opposed by us, the developers; and an updated version of our methodology and technology for rapid development of portlets for computational science, which is free for anyone to pick up and use.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Koetsier, J.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Gesing, S.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Rapid development of computational science portals</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the IWPLS09 International Workshop on Portals for Life Sciences</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">CEUR Workshop Proceedings</style></tertiary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">portal</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">14-15 September</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-513/paper05.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">e-Science Institute</style></publisher><pub-location><style face="normal" font="default" size="100%">Edinburgh</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Schneeberger, Korbinian</style></author><author><style face="normal" font="default" size="100%">Hagmann, Jörg</style></author><author><style face="normal" font="default" size="100%">Ossowski, Stephan</style></author><author><style face="normal" font="default" size="100%">Warthmann, Norman</style></author><author><style face="normal" font="default" size="100%">Gesing, Sandra</style></author><author><style face="normal" font="default" size="100%">Kohlbacher, Oliver</style></author><author><style face="normal" font="default" size="100%">Weigel, Detlef</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Simultaneous alignment of short reads against multiple genomes</style></title><secondary-title><style face="normal" font="default" size="100%">Genome Biol</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.biomedsearch.com/nih/Simultaneous-alignment-short-reads-against/19761611.html</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">R98</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Elizabeth Vander Meer</style></author><author><style face="normal" font="default" size="100%">Fergusson, David</style></author><author><style face="normal" font="default" size="100%">Clive Davenhall</style></author><author><style face="normal" font="default" size="100%">Hamza Mehammed</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Strategies and Policies to Support and Advance Education in e-Science</style></title><secondary-title><style face="normal" font="default" size="100%">Computing Now</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2009</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.computer.org/portal/web/computingnow/education</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Computing%20Now%20Online%20-%20Strategies%20and%20Policies.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">In previous installments of this series, we’ve presented tools and resources that university undergraduate and graduate environments must provide to allow for the continued development and success of e-Science education. We’ve introduced related summer (http://doi.ieeecomputersociety.org/ 10.1109/MDSO.2008.20) and winter (http://doi.ieeecomputersociety.org/10.1109/MDSO.2008.26) schools and important issues such as t-Infrastructure provision (http://doi.ieeecomputersociety.org/ 10.1109/MDSO.2008.28), intellectual property rights in the context of digital repositories (http://doi.ieeecomputersociety.org/10.1109/MDSO.2008.34), and curriculum content (http://www2. computer.org/portal/web/computingnow/0309/education). We conclude now with an overview of areas in which we must focus effort and strategies and policies that could provide much-needed support in these areas.

We direct these strategy and policy recommendations toward key stakeholders in e-Science education, such as ministries of education, councils in professional societies, and professional teachers and educational strategists. Ministries of education can influence funding councils, thus financially supporting our proposals. Professional societies can assist in curricula revision, and teachers and strategists shape curricula in institutions, which makes them valuable in improving and developing education in e-Science and (perhaps) e-Science in education.

We envision incremental change in curricula, so our proposals aim to evolve existing courses, rather than suggesting drastic upheavals and isolated additions. The long-term goal is to ensure that every graduate obtains the appropriate level of e-Science competency for their field, but we don’t presume to define that level for any given discipline or institution. We set out issues and ideas but don’t offer rigid prescriptions, which would take control away from important stakeholders.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">e-Science Directors’ Forum Strategy Working Group</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Britton, D.</style></author><author><style face="normal" font="default" size="100%">Coveney, P.</style></author><author><style face="normal" font="default" size="100%">De Roure, D</style></author><author><style face="normal" font="default" size="100%">Garnett, N.</style></author><author><style face="normal" font="default" size="100%">Geddes, N.</style></author><author><style face="normal" font="default" size="100%">Gurney, R.</style></author><author><style face="normal" font="default" size="100%">Haines, K.</style></author><author><style face="normal" font="default" size="100%">Hughes, L.</style></author><author><style face="normal" font="default" size="100%">Ingram, D.</style></author><author><style face="normal" font="default" size="100%">Jeffreys, P.</style></author><author><style face="normal" font="default" size="100%">Lyon, L.</style></author><author><style face="normal" font="default" size="100%">Osborne, I.</style></author><author><style face="normal" font="default" size="100%">Perrott, P.</style></author><author><style face="normal" font="default" size="100%">Procter. R.</style></author><author><style face="normal" font="default" size="100%">Rusbridge, C.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Strategy for Research and Innovation in the Century of Information</style></title><secondary-title><style face="normal" font="default" size="100%">Prometheus</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><volume><style face="normal" font="default" size="100%">27</style></volume><pages><style face="normal" font="default" size="100%">27-45</style></pages><abstract><style face="normal" font="default" size="100%">More data will be produced in the next five years than in the entire history of human kind, a digital deluge that marks the beginning of the Century of Information. Through a year‐long consultation with UK researchers, a coherent strategy has been developed, which will nurture Century‐of‐Information Research (CIR); it crystallises the ideas developed by the e‐Science Directors’ Forum Strategy Working Group. This paper is an abridged version of their latest report which can be found at: http://wikis.nesc.ac.uk/escienvoy/Century_of_Information_Research_Strategy which also records the consultation process and the affiliations of the authors. This document is derived from a paper presented at the Oxford e‐Research Conference 2008 and takes into account suggestions made in the ensuing panel discussion.

The goals of the CIR Strategy are to facilitate the growth of UK research and innovation that is data and computationally intensive and to develop a new culture of ‘digital‐systems judgement’ that will equip research communities, businesses, government and society as a whole, with the skills essential to compete and prosper in the Century of Information. The CIR Strategy identifies a national requirement for a balanced programme of coordination, research, infrastructure, translational investment and education to empower UK researchers, industry, government and society. The Strategy is designed to deliver an environment which meets the needs of UK researchers so that they can respond agilely to challenges, can create knowledge and skills, and can lead new kinds of research. It is a call to action for those engaged in research, those providing data and computational facilities, those governing research and those shaping education policies. The ultimate aim is to help researchers strengthen the international competitiveness of the UK research base and increase its contribution to the economy.

The objectives of the Strategy are to better enable UK researchers across all disciplines to contribute world‐leading fundamental research; to accelerate the translation of research into practice; and to develop improved capabilities, facilities and context for research and innovation. It envisages a culture that is better able to grasp the opportunities provided by the growing wealth of digital information. Computing has, of course, already become a fundamental tool in all research disciplines. The UK e‐Science programme (2001–06)—since emulated internationally—pioneered the invention and use of new research methods, and a new wave of innovations in digital‐information technologies which have enabled them. The Strategy argues that the UK must now harness and leverage its own, plus the now global, investment in digital‐information technology in order to spread the benefits as widely as possible in research, education, industry and government.

Implementing the Strategy would deliver the computational infrastructure and its benefits as envisaged in the Science &amp; Innovation Investment Framework 2004–2014 (July 2004), and in the reports developing those proposals.

To achieve this, the Strategy proposes the following actions:
	

1. support the continuous innovation of digital‐information research methods;
2. provide easily used, pervasive and sustained e‐Infrastructure for all research;
3. enlarge the productive research community which exploits the new methods efficiently;
4. generate capacity, propagate knowledge and develop skills via new curricula; and
5. develop coordination mechanisms to improve the opportunities for interdisciplinary research and to make digital‐infrastructure provision more cost effective.

To gain the best value for money strategic coordination is required across a broad spectrum of stakeholders. A coherent strategy is essential in order to establish and sustain the UK as an international leader of well‐curated national data assets and computational infrastructure, which is expertly used to shape policy, support decisions, empower researchers and to roll out the results to the wider benefit of society. The value of data as a foundation for wellbeing and a sustainable society must be appreciated; national resources must be more wisely directed to the collection, curation, discovery, widening access, analysis and exploitation of these data. Every researcher must be able to draw on skills, tools and computational resources to develop insights, test hypotheses and translate inventions into productive use, or to extract knowledge in support of governmental decision making. This foundation plus the skills developed will launch significant advances in research, in business, in professional practice and in government with many consequent benefits for UK citizens. The Strategy presented here addresses these complex and interlocking requirements.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Armstrong, J. D.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards a Virtual Fly Brain</style></title><secondary-title><style face="normal" font="default" size="100%">Philosophical Transactions A</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://rsta.royalsocietypublishing.org/content/367/1896/2387.abstract</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1896 </style></number><volume><style face="normal" font="default" size="100%">367</style></volume><pages><style face="normal" font="default" size="100%">2387--2397</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Models of the brain that simulate sensory input, behavioural output and information processing in a biologically plausible manner pose significant challenges to both Computer Science and Biology. Here we investigated strategies that could be used to create a model of the insect brain, specifically that of Drosophila melanogaster which is very widely used in laboratory research. The scale of the problem is an order of magnitude above the most complex of the current simulation projects and it is further constrained by the relative sparsity of available electrophysiological recordings from the fly nervous system. However, fly brain research at the anatomical and behavioural level offers some interesting opportunities that could be exploited to create a functional simulation. We propose to exploit these strengths of Drosophila CNS research to focus on a functional model that maps biologically plausible network architecture onto phenotypic data from neuronal inhibition and stimulation studies, leaving aside biophysical modelling of individual neuronal activity for future models until more data is available.</style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Javier Fernández</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Alberto Nuñez</style></author><author><style face="normal" font="default" size="100%">Jesus Carretero</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Using architectural simulation models to aid the design of data intensive application</style></title><secondary-title><style face="normal" font="default" size="100%">The Third International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2009)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%">11/10/2009</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%">Sliema, Malta</style></pub-location><pages><style face="normal" font="default" size="100%">163--168</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gerhard Wickler</style></author><author><style face="normal" font="default" size="100%">George Beckett</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Sung Han Koo</style></author><author><style face="normal" font="default" size="100%">Stephen Potter</style></author><author><style face="normal" font="default" size="100%">Gavin Pringle</style></author><author><style face="normal" font="default" size="100%">Austin Tate</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J. Landgren, U. Nulden</style></author><author><style face="normal" font="default" size="100%">B. Van de Walle</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Using Simulation for Decision Support: Lessons Learned from FireGrid</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 6th International Conference on Information Systems for Crisis Response and Management (ISCRAM 2009)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year><pub-dates><date><style  face="normal" font="default" size="100%"> 10-13/05/2009</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Gothenburg, Sweden</style></pub-location></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">O’Donoghue, J.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Using the DCC Lifecycle Model to Curate a Gene Expression Database: A Case Study</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Digital Curation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.ijdc.net/index.php/ijdc/article/view/134</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">UKOLN</style></publisher><volume><style face="normal" font="default" size="100%">4</style></volume><abstract><style face="normal" font="default" size="100%">Developmental Gene Expression Map (DGEMap) is an EU-funded Design Study, which will accelerate an integrated European approach to gene expression in early human development. As part of this design study, we have had to address the challenges and issues raised by the long-term curation of such a resource. As this project is primarily one of data creators, learning about curation, we have been looking at some of the models and tools that are already available in the digital curation field in order to inform our thinking on how we should proceed with curating DGEMap. This has led us to uncover a wide range of resources for data creators and curators alike. Here we will discuss the future curation of DGEMap as a case study. We believe our experience could be instructive to other projects looking to improve the curation and management of their data.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rochan Upadhyay</style></author><author><style face="normal" font="default" size="100%">Galvin Pringle</style></author><author><style face="normal" font="default" size="100%">George Beckett</style></author><author><style face="normal" font="default" size="100%">Stephen Potter</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Stephen Welch</style></author><author><style face="normal" font="default" size="100%">Asif Usmani</style></author><author><style face="normal" font="default" size="100%">Jose Torero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%"> An Architecture for an Integrated Fire Emergency Response System for the Built Environment</style></title><secondary-title><style face="normal" font="default" size="100%">9th Symposium of the International Association for Fire Safety Science (IAFSS)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">emergency response system</style></keyword><keyword><style  face="normal" font="default" size="100%">FireGrid</style></keyword><keyword><style  face="normal" font="default" size="100%">system architecture</style></keyword><keyword><style  face="normal" font="default" size="100%">technology integration</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">21-26 September </style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IAFSS</style></publisher><pub-location><style face="normal" font="default" size="100%">Karlsruhe, GERMANY</style></pub-location><abstract><style face="normal" font="default" size="100%">FireGrid is a modern concept that aims to leverage a number of modern technologies to aid 
fire emergency response. In this paper we provide a brief introduction to the FireGrid project. A number 
of different technologies such as wireless sensor networks, grid-enabled High Performance Computing 
(HPC) implementation of fire models, and artificial intelligence tools need to be integrated to build up a 
modern fire emergency response system. We propose a system architecture that provides the framework for integration of the various technologies. We describe the components of the generic FireGrid system architecture in detail. Finally we present a small-scale demonstration experiment which has been completed to highlight the concept and application of the FireGrid system to an actual fire. Although our proposed system architecture provides a versatile framework for integration, a number of new and interesting research problems need to be solved before actual deployment of the system. We outline some of the challenges involved which require significant interdisciplinary collaborations. 

</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juhos, I.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Cotta, C.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Studies in Computational Intelligence</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">graph colouring</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">167--184</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">incollection</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">David E. Singh</style></author><author><style face="normal" font="default" size="100%">Juan Carlos Pichel</style></author><author><style face="normal" font="default" size="100%">Florin Isaila</style></author><author><style face="normal" font="default" size="100%">Jesús Carretero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Locality Aware Strategy for Two-Phase Collective I/O</style></title><secondary-title><style face="normal" font="default" size="100%">VECPAR</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Hopkins, R.</style></author><author><style face="normal" font="default" size="100%">Romano, D.</style></author><author><style face="normal" font="default" size="100%">Vander Meer, E.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Distributed Computing Education, Part 1: A Special Case?</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Distributed Systems Online</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dsonline.computer.org/portal/site/dsonline/menuitem.9ed3d9924aeb0dcd82ccc6716bbe36ec/index.jsp?&amp;pName=dso_level1&amp;path=dsonline/2008/06&amp;file=o6002edu.xml&amp;xsl=article.xsl&amp;;jsessionid=LZ5zjySvc2xPnVv4qTYJXhlvwSnRGGj7S7WvPtrPyv23rJGQdjJr!982319602</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">0806-o6002</style></pages><issue><style face="normal" font="default" size="100%">6</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Hopkins, R.</style></author><author><style face="normal" font="default" size="100%">Romano, D.</style></author><author><style face="normal" font="default" size="100%">Vander Meer, E.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Distributed Computing Education, Part 2: International Summer Schools</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Distributed Systems Online</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dsonline.computer.org/portal/site/dsonline/menuitem.9ed3d9924aeb0dcd82ccc6716bbe36ec/index.jsp?&amp;pName=dso_level1&amp;path=dsonline/2008/07&amp;file=o7002edu.xml&amp;xsl=article.xsl&amp;</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">0807-o7002</style></pages><issue><style face="normal" font="default" size="100%">7</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Low, B.</style></author><author><style face="normal" font="default" size="100%">Cassidy, K.</style></author><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Vander Meer, E.</style></author><author><style face="normal" font="default" size="100%">McGeever, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Distributed Computing Education, Part 3: The Winter School Online Experience</style></title><secondary-title><style face="normal" font="default" size="100%">Distributed Systems Online</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">09/2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&amp;arnumber=4659260</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">8</style></pages><abstract><style face="normal" font="default" size="100%">The International Summer Schools in Grid Computing (ISSGC) have provided numerous international students with the opportunity to learn grid systems, as detailed in part 2 of this series (http://doi.ieeecomputersociety.org/10.1109/MDSO.2008.20). The International Winter School on Grid Computing 2008 (IWSGC 08) followed the successful summer schools, opening up the ISSGC experience to a wider range of students because of its online format. The previous summer schools made it clear that many students found the registration and travel costs and the time requirements prohibitive. The EU FP6 ICEAGE project held the first winter school from 6 February to 12 March 2008. The winter school repurposed summer school materials and added resources such as the ICEAGE digital library and summer-school-tested t-Infrastructures such as GILDA (Grid INFN Laboratory for Dissemination Activities).

The winter schools shared the goals of the summer school, which emphasized disseminating grid knowledge. The students act as multipliers, spreading the skills and knowledge they acquired at the winter school to their colleagues to build strong and enthusiastic local grid communities.</style></abstract><issue><style face="normal" font="default" size="100%">9</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Barbera, R.</style></author><author><style face="normal" font="default" size="100%">Giorgio, E.</style></author><author><style face="normal" font="default" size="100%">Fargetta, M.</style></author><author><style face="normal" font="default" size="100%">Sipos, G.</style></author><author><style face="normal" font="default" size="100%">Romano, D.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Vander Meer, E.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Distributed Computing Education, Part 4: Training Infrastructure</style></title><secondary-title><style face="normal" font="default" size="100%">Distributed Systems Online</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&amp;arnumber=4752926</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">6</style></pages><abstract><style face="normal" font="default" size="100%">In the first article of this series (see http://doi.ieeecomputersociety.org/10.1109/MDSO.2008.16), we identified the need for teaching environments that provide infrastructure to support education and training in distributed computing. Training infrastructure, or t-infrastructure, is analogous to the teaching laboratory in biology and is a vital tool for educators and students. In practice, t-infrastructure includes the computing equipment, digital communications, software, data, and support staff necessary to teach a course. The International Summer Schools in Grid Computing (ISSGC) series and the first International Winter School on Grid Computing (IWSGC 08) used the Grid INFN Laboratory of Dissemination Activities (GILDA) infrastructure so students could gain hands-on experience with middleware. Here, we describe GILDA, related summer and winter school experiences, multimiddleware integration, t-infrastructure, and academic courses, concluding with an analysis and recommendations.</style></abstract><issue><style face="normal" font="default" size="100%">10</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Boon Low</style></author><author><style face="normal" font="default" size="100%">Kathryn Cassidy</style></author><author><style face="normal" font="default" size="100%">Fergusson, David</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Elizabeth Vander Meer</style></author><author><style face="normal" font="default" size="100%">Mags McGeever</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Distributed Computing Education, Part 5: Coming to Terms with Intellectual Property Rights</style></title><secondary-title><style face="normal" font="default" size="100%">Distributed Systems Online</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&amp;arnumber=4755177</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">6</style></pages><abstract><style face="normal" font="default" size="100%">In part 1 of this series on distributed computing education, we introduced a list of components important for teaching environments. We outlined the first three components, which included development of materials for education, education for educators and teaching infrastructures, identifying current practice, challenges, and opportunities for provision. The final component, a supportive policy framework that encourages cooperation and sharing, includes the need to manage intellectual property rights (IPR).</style></abstract><issue><style face="normal" font="default" size="100%">12</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Vander Meer, E.</style></author><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Artacho, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Education and Training Task Force Report</style></title><secondary-title><style face="normal" font="default" size="100%">e-Infrastructure Reflection Group</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08-07-2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.e-irg.eu/index.php?option=com_content&amp;task=view&amp;id=38&amp;Itemid=37</style></url></web-urls></urls><abstract><style face="normal" font="default" size="100%">The development of e-Infrastructure, of which grid computing is a fundamental element, will
have major economic and social benefits. Online and financial businesses already
successfully use grid computing technologies, for instance. There are already demonstrations
showing the benefits to engineering, medicine and the creative industries as well. New
research methods and technologies generate large data sets that need to be shared in order to
ensure continued social and scientific research and innovation. e-Infrastructure provides an
environment for coping with these large data sets and for sharing data across regions. An
investment in educating people in this technology, then, is an investment that will strengthen
our economies and societies. In order to deliver e-Infrastructure education and training
successfully in the EU, we must develop a policy framework that will ensure shared
responsibility and equivalent training in the field. This document focuses primarily on the
current state of grid and e-Science education, introducing key challenges and the
opportunities available to educational planners that serve as a starting point for further work.
It then proposes strategies and policies to provide a supportive framework for e-Infrastructure
education and training.

The ETTF Report concludes with policy recommendations to be taken forward by the e-IRG.
These recommendations address issues such as the level of Member State investment in
e-Infrastructure education, the harmonisation of education in distributed-computation thinking
and in the use of e-Infrastructure and the development of standards for student and teacher
identification, for the sharing of t-Infrastructure (and training material) and for accreditation.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barker, Adam</style></author><author><style face="normal" font="default" size="100%">Weissman, Jon B.</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Eliminating the Middle Man: Peer-to-Peer Dataflow</style></title><secondary-title><style face="normal" font="default" size="100%">HPDC '08: Proceedings of the 17th International Symposium on High Performance Distributed Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">grid computing</style></keyword><keyword><style  face="normal" font="default" size="100%">workflow</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pages><style face="normal" font="default" size="100%">55--64</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Di Chio, Cecilia</style></author><author><style face="normal" font="default" size="100%">Giacobini, Mario</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Di Chio, Cecilia</style></author><author><style face="normal" font="default" size="100%">Giacobini, Mario</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">European Graduate Student Workshop on Evolutionary Computation</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Evolutionary computation involves the study of problem-solving and optimization techniques inspired by principles of evolution and genetics. As any other scientific field, its success relies on the continuity provided by new researchers joining the field to help it progress. One of the most important sources for new researchers is the next generation of PhD students that are actively studying a topic relevant to this field. It is from this main observation the idea arose of providing a platform exclusively for PhD students. </style></abstract><work-type><style face="normal" font="default" size="100%">proceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Cotta, Carlos</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Cotta, Carlos</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary Computation in Combinatorial Optimization, 8th European Conference</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">LNCS 4972</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Metaheuristics have shown to be effective for difficult combinatorial
optimization problems appearing in various industrial, economical, and
scientific domains. Prominent examples of metaheuristics are evolutionary
algorithms, tabu search, simulated annealing, scatter search, memetic
algorithms, variable neighborhood search, iterated local search, greedy
randomized adaptive search procedures, ant colony optimization and estimation
of distribution algorithms. Problems solved successfully include scheduling,
timetabling, network design, transportation and distribution, vehicle routing,
the travelling salesman problem,  packing and cutting, satisfiability and
general mixed integer programming.

EvoCOP began in 2001 and has been held annually since then. It is
the first event specifically dedicated to the application of
evolutionary computation and related methods to combinatorial
optimization problems. Originally held as a workshop, EvoCOP became
a conference in 2004. The events gave researchers an excellent
opportunity to present their latest research and to discuss current
developments and applications. Following
the general trend of hybrid metaheuristics and diminishing
boundaries between the different classes of metaheuristics, EvoCOP
has broadened its scope over the last years and invited submissions
on any kind of metaheuristic for combinatorial optimization.</style></abstract><work-type><style face="normal" font="default" size="100%">proceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">David E. Singh</style></author><author><style face="normal" font="default" size="100%">Juan Carlos Pichel</style></author><author><style face="normal" font="default" size="100%">Jesús Carretero</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Exploiting data compression in collective I/O techniques.</style></title><secondary-title><style face="normal" font="default" size="100%">Cluster Computing 2008.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/09/2008</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Tsukuba, Japand.</style></pub-location><isbn><style face="normal" font="default" size="100%">978-1-4244-2639-3</style></isbn></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Voss, A.</style></author><author><style face="normal" font="default" size="100%">Asgari-Targhi, M.</style></author><author><style face="normal" font="default" size="100%">Halfpenny, P.</style></author><author><style face="normal" font="default" size="100%">Procter, R.</style></author><author><style face="normal" font="default" size="100%">Anderson, S.</style></author><author><style face="normal" font="default" size="100%">Dunn, S.</style></author><author><style face="normal" font="default" size="100%">Fragkouli, E.</style></author><author><style face="normal" font="default" size="100%">Hughes, L.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Mineter, M.</style></author><author><style face="normal" font="default" size="100%">Rodden, T.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Fostering e-Infrastructures: from user-designer relations to community engagement</style></title><secondary-title><style face="normal" font="default" size="100%">Symposium on Project Management in e-Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10-04-2008</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/fostering%20e-infrastructures%20-%20from%20user-designer%20relations%20to%20community%20engagement.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Oxford</style></pub-location><abstract><style face="normal" font="default" size="100%">In this paper we discuss how e-Science can draw on the findings, approaches and methods developed in other disciplines to foster e-Infrastructures for research. We also discuss the issue of making user involvement in IT development scale across an open ommunity of researchers and from single systems to distributed e-Infrastructures supporting collaborative research.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juhos, Istv\'{a}n</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Cotta, Carlos</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Graph Colouring Heuristics Guided by Higher Order Graph Properties</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">graph colouring</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">4972</style></volume><pages><style face="normal" font="default" size="100%">97--109</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Graph vertex colouring can be defined in such a way where colour assignments are substituted by vertex contractions. We present various hyper-graph representations for the graph colouring problem all based on the approach where vertices are merged into groups. In this paper, we show this provides a uniform and compact way to define algorithms, both of a complete or a heuristic nature. Moreover, the representation provides information useful to guide algorithms during their search. In this paper we focus on the quality of solutions obtained by graph colouring heuristics that make use of higher order properties derived during the search. An evolutionary algorithm is used to search permutations of possible merge orderings.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gomes, J.</style></author><author><style face="normal" font="default" size="100%">Borges, B.</style></author><author><style face="normal" font="default" size="100%">Montecelo, M.</style></author><author><style face="normal" font="default" size="100%">David, M.</style></author><author><style face="normal" font="default" size="100%">Silva, B.</style></author><author><style face="normal" font="default" size="100%">Dias, N.</style></author><author><style face="normal" font="default" size="100%">Martins, JP</style></author><author><style face="normal" font="default" size="100%">Fernandez, C.</style></author><author><style face="normal" font="default" size="100%">Garcia-Tarres, L. ,</style></author><author><style face="normal" font="default" size="100%">Veiga, C.</style></author><author><style face="normal" font="default" size="100%">Cordero, D.</style></author><author><style face="normal" font="default" size="100%">Lopez, J.</style></author><author><style face="normal" font="default" size="100%">J Marco</style></author><author><style face="normal" font="default" size="100%">Campos, I.</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Marco,  R.</style></author><author><style face="normal" font="default" size="100%">Lopez, A.</style></author><author><style face="normal" font="default" size="100%">Orviz, P.</style></author><author><style face="normal" font="default" size="100%">Hammad, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Grid infrastructure for parallel and interactive applications</style></title><secondary-title><style face="normal" font="default" size="100%">Computing and Informatics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><section><style face="normal" font="default" size="100%">173</style></section><volume><style face="normal" font="default" size="100%">27</style></volume><issue><style face="normal" font="default" size="100%">2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Shahriar Bijani</style></author><author><style face="normal" font="default" size="100%">Maryam Kazemitabar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">HIDGM: A Hybrid Intrusion Detection System for Mobile networks</style></title><secondary-title><style face="normal" font="default" size="100%">International Conference on Computer and Electrical Engineering (ICEEE)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">20/12/2008</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">J Marco</style></author><author><style face="normal" font="default" size="100%">Campos, I.</style></author><author><style face="normal" font="default" size="100%">Coterillo, I.</style></author><author><style face="normal" font="default" size="100%">Diaz, I.</style></author><author><style face="normal" font="default" size="100%">Lopez, A.</style></author><author><style face="normal" font="default" size="100%">Marco,  R.</style></author><author><style face="normal" font="default" size="100%">Martinez-Rivero, C.</style></author><author><style face="normal" font="default" size="100%">Orviz, P.</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Gomes, J.</style></author><author><style face="normal" font="default" size="100%">Borges, G.</style></author><author><style face="normal" font="default" size="100%">Montecelo, M.</style></author><author><style face="normal" font="default" size="100%">David, M.</style></author><author><style face="normal" font="default" size="100%">Silva, B.</style></author><author><style face="normal" font="default" size="100%">Dias, N.</style></author><author><style face="normal" font="default" size="100%">Martins, JP</style></author><author><style face="normal" font="default" size="100%">Fernandez, C.</style></author><author><style face="normal" font="default" size="100%">Garcia-Tarres, L.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The interactive European Grid: Project objectives and achievements</style></title><secondary-title><style face="normal" font="default" size="100%">Computing and Informatics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><section><style face="normal" font="default" size="100%">161</style></section><volume><style face="normal" font="default" size="100%">27</style></volume><issue><style face="normal" font="default" size="100%">2</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Baldock, R. A.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">M. Elloumi</style></author><author><style face="normal" font="default" size="100%">\emph</style></author><author><style face="normal" font="default" size="100%">et al</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Matching Spatial Regions with Combinations of Interacting Gene Expression Patterns</style></title><secondary-title><style face="normal" font="default" size="100%">Communications in Computer and Information Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">biomedical</style></keyword><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">DGEMap</style></keyword><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pages><style face="normal" font="default" size="100%">347--361</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The Edinburgh Mouse Atlas aims to capture in-situ gene expression patterns in a common spatial framework. In this study, we construct a grammar to define spatial regions by combinations of these patterns. Combinations are formed by applying operators to curated gene expression patterns from the atlas, thereby resembling gene interactions in a spatial context. The space of combinations is searched using an evolutionary algorithm with the objective of finding the best match to a given target pattern. We evaluate the method by testing its robustness and the statistical significance of the results it finds.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Srihathai Prammanee</style></author><author><style face="normal" font="default" size="100%">Klaus Moessner</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mobile Multimodality: A Theoretical Approach to Facilitate Virtual Device Environments</style></title><secondary-title><style face="normal" font="default" size="100%">Mobile Networks and  Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s11036-008-0091-z</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">569--582</style></pages><issue><style face="normal" font="default" size="100%">6</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">J. Hemert</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A novel visual discriminator on network traffic pattern</style></title><secondary-title><style face="normal" font="default" size="100%">The Second International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2008)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">29/09/2008</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%">Valencia, Spain</style></pub-location><pages><style face="normal" font="default" size="100%">141-146</style></pages><abstract><style face="normal" font="default" size="100%">The wavelet transform has been shown to be a powerful tool for characterising network traffic. However, the resulting decomposition of a wavelet transform typically forms a high-dimension space. This is obviously problematic on compact representations, visualizations, and modelling approaches that are based on these high-dimensional data. In this study, we show how data projection techniques can represent the high-dimensional wavelet decomposition in a low dimensional space to facilitate visual analysis. A low-dimensional representation can significantly reduce the model complexity. Hence, features in the data can be presented with a small number of parameters. We demonstrate these projections in the context of network traffic pattern analysis. The experimental results show that the proposed method can effectively discriminate between different application flows, such as FTP and P2P. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Grant, Alistair</style></author><author><style face="normal" font="default" size="100%">Antonioletti, Mario</style></author><author><style face="normal" font="default" size="100%">Hume, Alastair C.</style></author><author><style face="normal" font="default" size="100%">Krause, Amy</style></author><author><style face="normal" font="default" size="100%">Dobrzelecki, Bartosz</style></author><author><style face="normal" font="default" size="100%">Jackson, Michael J.</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Theocharopoulos, Elias</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">OGSA-DAI: Middleware for Data Integration: Selected Applications</style></title><secondary-title><style face="normal" font="default" size="100%">ESCIENCE '08: Proceedings of the 2008 Fourth IEEE International Conference on eScience</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%">Washington, DC, USA</style></pub-location><pages><style face="normal" font="default" size="100%">343</style></pages><isbn><style face="normal" font="default" size="100%">978-0-7695-3535-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barker, Adam</style></author><author><style face="normal" font="default" size="100%">Weissman, Jon B.</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Orchestrating Data-Centric Workflows</style></title><secondary-title><style face="normal" font="default" size="100%">The 8th IEEE International Symposium on Cluster Computing and the Grid (CCGrid)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">grid computing</style></keyword><keyword><style  face="normal" font="default" size="100%">workflow</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pages><style face="normal" font="default" size="100%">210--217</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cotta, Carlos</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Recent Advances in Evolutionary Computation for Combinatorial Optimization</style></title><secondary-title><style face="normal" font="default" size="100%">Studies in Computational Intelligence</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springer.com/engineering/book/978-3-540-70806-3</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">153</style></volume><pages><style face="normal" font="default" size="100%">338</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-70806-3</style></isbn><abstract><style face="normal" font="default" size="100%">Combinatorial optimisation is a ubiquitous discipline whose usefulness spans vast applications domains. The intrinsic complexity of most combinatorial optimisation problems makes classical methods unaffordable in many cases. To acquire practical solutions to these problems requires the use of metaheuristic approaches that trade completeness for pragmatic effectiveness. Such approaches are able to provide optimal or quasi-optimal solutions to a plethora of difficult combinatorial optimisation problems.

The application of metaheuristics to combinatorial optimisation is an active field in which new theoretical developments, new algorithmic models, and new application areas are continuously emerging. This volume presents recent advances in the area of metaheuristic combinatorial optimisation, with a special focus on evolutionary computation methods. Moreover, it addresses local search methods and hybrid approaches. In this sense, the book includes cutting-edge theoretical, methodological, algorithmic and applied developments in the field, from respected experts and with a sound perspective.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barker, Adam</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Scientific Workflow: A Survey and Research Directions</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword><keyword><style  face="normal" font="default" size="100%">workflow</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-540-68111-3_78</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">4967</style></volume><pages><style face="normal" font="default" size="100%">746--753</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Workflow technologies are emerging as the dominant approach to coordinate groups of distributed services. However with a space filled with competing specifications, standards and frameworks from multiple domains, choosing the right tool for the job is not always a straightforward task. Researchers are often unaware of the range of technology that already exists and focus on implementing yet another proprietary workflow system. As an antidote to this common problem, this paper presents a concise survey of existing workflow technology from the business and scientific domain and makes a number of key suggestions towards the future development of scientific workflow systems. </style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Self-adaptation to dynamic failures for efficient Virtual Organization formation in Grid computing context</style></title><secondary-title><style face="normal" font="default" size="100%">Chaos, Solitons and Fractals</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">complex network system</style></keyword><keyword><style  face="normal" font="default" size="100%">failure recovery</style></keyword><keyword><style  face="normal" font="default" size="100%">graph theory</style></keyword><keyword><style  face="normal" font="default" size="100%">grid computing</style></keyword><keyword><style  face="normal" font="default" size="100%">virtual organization formation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2008</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Elsevier Science</style></publisher><abstract><style face="normal" font="default" size="100%">Grid computing aims to enable “resource sharing and coordinated problem solving in dynamic, multi-institutional Virtual Organizations (VOs)”. However, due to the nature of heterogeneous and dynamic resources, dynamic failures in the distributed grid environment usually occur more than in traditional computation platforms, which cause failed VO formations. In this paper, we develop a novel self-adaptive mechanism to dynamic failures during VO formations. Such a self-adaptive scheme allows an individual and member of VOs to automatically find other available or replaceable one once a failure happens and therefore makes systems automatically recover from dynamic failures. We define dynamic failure situations of a system by using two standard indicators: Mean Time between Failures (MTBF) and Mean Time to Recover (MTTR). We model both MTBF and MTTR as Poisson distributions. We investigate and analyze the efficiency of the proposed self-adaptation mechanism to dynamic failures by comparing the success probability of VO formations before and after adopting it in three different cases: 1) different failure situations; 2) different organizational structures and scales; 3) different task complexities. The experimental results show that the proposed scheme can automatically adapt to dynamic failures and effectively improve the dynamic VO formation performance in the event of node failures, which provide a valuable addition to the field.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Dave Berry</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Semantic-Supported and Agent-Based Decentralized Grid Resource Discovery</style></title><secondary-title><style face="normal" font="default" size="100%">Future Generation Computer Systems</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">grid resource discovery, decentralization, agent, semantic similarity, ontology</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">ScienceDirect</style></publisher><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">806-812 </style></pages><abstract><style face="normal" font="default" size="100%">One of open issues in grid computing is efficient resource discovery. In this paper, we propose a novel semantic-supported and agent-based decentralized grid resource discovery mechanism. Without overhead of negotiation, the algorithm allows individual resource agents to semantically interact with neighbour agents based on local knowledge and dynamically form a resource service chain to complete a task. The algorithm ensures resource agent’s ability to cooperate and coordinate on neighbour knowledge requisition for flexible problem solving. The developed algorithm is evaluated by investigating the relationship between the success probability of resource discovery and semantic similarity under different factors. The experiments show the algorithm could flexibly and dynamically discover resources and therefore provide a valuable addition to the field.</style></abstract><issue><style face="normal" font="default" size="100%">8</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Voss, A.</style></author><author><style face="normal" font="default" size="100%">Asgari-Targhi, M.</style></author><author><style face="normal" font="default" size="100%">Procter, R.</style></author><author><style face="normal" font="default" size="100%">Halfpenny, P.</style></author><author><style face="normal" font="default" size="100%">Dunn, S.</style></author><author><style face="normal" font="default" size="100%">Fragkouli, E.</style></author><author><style face="normal" font="default" size="100%">Anderson, S.</style></author><author><style face="normal" font="default" size="100%">Hughes, L.</style></author><author><style face="normal" font="default" size="100%">Mineter, M.</style></author><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Widening Uptake of e-Infrastructure Services</style></title><secondary-title><style face="normal" font="default" size="100%">4th International Conference on e-Social Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">18-06-2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.ncess.ac.uk/events/conference/programme/workshop1/?ref=/programme/thurs/1aVoss.htm</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Manchester</style></pub-location><abstract><style face="normal" font="default" size="100%">This paper presents findings from the e-Uptake project which aims to widen the uptake of e-Infrastructure Services for research. We focus specifically on the identification of barriers and enablers of uptake and the taxonomy developed to structure our findings. Based on these findings, we describe the development of a number of interventions such as training and outreach events, workshops and the deployment of a UK 'one-stop-shop' for support and event information as well as training material. Finally, we will describe how the project relates to other ongoing community engagement efforts in the UK and worldwide. Introduction Existing investments in e-Science and Grid computing technologies have helped to develop the capacity to build e-Infrastructures for research: distributed, networked, interoperable computing and data resources that are available to underpin a wide range of research activities in all research disciplines. In the UK, the Research Councils and the JISC are funding programmes to support the development of essential components of such infrastructures such as National Grid Service (www.ngs.ac.uk) or the UK Access Management Federation (www.ukfederation.org.uk) as well as discipline-specific efforts to build consistent and accessible instantiations of e-Infrastructures, for example the e- Infrastructure for the Social Sciences (Daw et al. 2007). These investments are complemented by an active programme of community engagement (Voss et al. 2007). As part of the community engagement strand of its e-Infrastructure programme, JISC has funded the e-Uptake project, a collaboration between the ESRC National Centre for e-Social Science at the University of Manchester, the Arts &amp; Humanities e-Science Support Centre at King's College London and the National e-Science Centre at the University of Edinburgh. In this paper we present the project's activities to date to widen the uptake of e-Infrastructure services by eliciting information about the barriers to and enablers of uptake, developing adequate interventions such as training and outreach events, running workshops and the deploying a UK 'one-stop-shop' for support and event information as well as training material. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De~Ferrari, Luna</style></author><author><style face="normal" font="default" size="100%">Stuart Aitken</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author><author><style face="normal" font="default" size="100%">Goryanin, Igor</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">WikiSim: simulating knowledge collection and curation in structured    wikis.</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 2008 International Symposium on Wikis in Porto,    Portugal</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The aim of this work is to model quantitatively one of the main properties
   of wikis: how high quality knowledge can emerge from the individual
   work of independent volunteers. The approach chosen is to simulate
   knowledge collection and curation in wikis. The basic model represents
   the wiki as a set of of true/false values, added and edited at each
   simulation round by software agents (users) following a fixed set
   of rules. The resulting WikiSim simulations already manage to reach
   distributions of edits and user contributions very close to those
   reported for Wikipedia. WikiSim can also span conditions not easily
   measurable in real-life wikis, such as the impact of various amounts
   of user mistakes. WikiSim could be extended to model wiki software
   features, such as discussion pages and watch lists, while monitoring
   the impact they have on user actions and consensus, and their effect
   on knowledge quality. The method could also be used to compare wikis
   with other curation scenarios based on centralised editing by experts.
   The future challenges for WikiSim will be to find appropriate ways
   to evaluate and validate the models and to keep them simple while
   still capturing relevant properties of wiki systems.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chue Hong, N. P.</style></author><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Karasavvas, K. A.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Talia, D.</style></author><author><style face="normal" font="default" size="100%">Bilas, A.</style></author><author><style face="normal" font="default" size="100%">Dikaiakos, M.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Accessing Data in Grids Using OGSA-DAI</style></title><secondary-title><style face="normal" font="default" size="100%">Knowledge and Data Management in Grids</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springer.com/computer/communication+networks/book/978-0-387-37830-5</style></url></web-urls></urls><isbn><style face="normal" font="default" size="100%">978-0-387-37830-5</style></isbn><abstract><style face="normal" font="default" size="100%">The grid provides a vision in which resources, including storage and data, can be shared across organisational boundaries. The original emphasis of grid computing lay in the sharing of computational resources but technological and scientific advances have led to an ongoing data explosion in many fields. However, data is stored in many different storage systems and data formats, with different schema, access rights, metadata attributes, and ontologies all of which are obstacles to the access, integration and management of this information.

In this chapter we examine some of the ways in which these differences can be addressed by grid technology to enable the meaningful sharing of data. In particular, we present an overview of the OGSA-DAI (Open Grid Service Architecture - Data Access and Integration) software, which provides a uniform, extensible framework for accessing structured and semi-structured data and provide some examples of its use in other projects. The open-source OGSA-DAI software is freely available from http://www.ogsadai.org.uk.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Srihathai Prammanee</style></author><author><style face="normal" font="default" size="100%">Klaus Moessner</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Architectural Design of Multi Interface-Device Binding (MID-B) System</style></title><secondary-title><style face="normal" font="default" size="100%">The 3rd Workshop on Context Awareness for Proactive Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.geocities.com/sprammanee/</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Guildford, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">The Multi Interface-Device Binding (MID-B) System enhances a multimodal interaction in a virtual-device environment. The system promises to overcome the drawbacks of classic multimodal interaction. In the classic sense,  multimodality uses a strategy of simultaneously utilising several modalities  generally offered on a single device. In contrast, the MID-B’s mechanism gets  multimodality out of the solitary-device scenario. In MID-B, a ‘controller- device’ (UE_C) is aware of the availability of various devices in the vicinity,  each of which may host one or more user interfaces (modalities). The 
capabilities of each of the co-located devices, together with the context in which the user acts, is exploited to dynamically customise the interface services available. This paper describes the MID-B architecture and its mechanisms to collect and exploit device and user context information to dynamically adapt the user interfaces.  
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stuart Aitken</style></author><author><style face="normal" font="default" size="100%">Yin Chen</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Albert Burger</style></author><author><style face="normal" font="default" size="100%">Duncan Davidson</style></author><author><style face="normal" font="default" size="100%">Richard Baldock</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">COBrA and COBrA-CT: Ontology Engineering Tools</style></title><secondary-title><style face="normal" font="default" size="100%">Anatomy Ontologies for Bioinformatics: Principles and Practice</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.amazon.ca/Anatomy-Ontologies-Bioinformatics-Principles-Practice/dp/1846288843</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><isbn><style face="normal" font="default" size="100%">ISBN-10:1846288843</style></isbn><language><style face="normal" font="default" size="100%">Einglish</style></language><abstract><style face="normal" font="default" size="100%">COBrA is a Java-based ontology editor for bio-ontologies and anatomies that dif- 
fers from other editors by supporting the linking of concepts between two ontologies, and 
providing sophisticated analysis and verification functions. In addition to the Gene Ontology 
and Open Biology Ontologies formats, COBrA can import and export ontologies in the Se- 
mantic Web formats RDF, RDFS and OWL. 
COBrA is being re-engineered as a Prot  ́eg  ́e plug-in, and complemented by an ontology 
server and a tool for the management of ontology versions and collaborative ontology de- 
velopment. We describe both the original COBrA tool and the current developments in this 
chapter. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ure, J.</style></author><author><style face="normal" font="default" size="100%">Proctor, R.</style></author><author><style face="normal" font="default" size="100%">Martone, M.</style></author><author><style face="normal" font="default" size="100%">Porteous, D.</style></author><author><style face="normal" font="default" size="100%">Lloyd, S.</style></author><author><style face="normal" font="default" size="100%">Lawrie, S.</style></author><author><style face="normal" font="default" size="100%">Job, D.</style></author><author><style face="normal" font="default" size="100%">Baldock, R.</style></author><author><style face="normal" font="default" size="100%">Philp, A.</style></author><author><style face="normal" font="default" size="100%">Liewald, D.</style></author><author><style face="normal" font="default" size="100%">Rakebrand, F.</style></author><author><style face="normal" font="default" size="100%">Blaikie, A.</style></author><author><style face="normal" font="default" size="100%">McKay, C.</style></author><author><style face="normal" font="default" size="100%">Anderson, S.</style></author><author><style face="normal" font="default" size="100%">Ainsworth, J.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author><author><style face="normal" font="default" size="100%">Blanquer, I.</style></author><author><style face="normal" font="default" size="100%">Sinno</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">N. Jacq</style></author><author><style face="normal" font="default" size="100%">Y. Legr{\'e}</style></author><author><style face="normal" font="default" size="100%">H. Muller</style></author><author><style face="normal" font="default" size="100%">I. Blanquer</style></author><author><style face="normal" font="default" size="100%">V. Breton</style></author><author><style face="normal" font="default" size="100%">D. Hausser</style></author><author><style face="normal" font="default" size="100%">V. Hern{\'a}ndez</style></author><author><style face="normal" font="default" size="100%">T. Solomonides</style></author><author><style face="normal" font="default" size="100%">M. Hofman-Apitius</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Integration in eHealth: A Domain/Disease Specific Roadmap</style></title><secondary-title><style face="normal" font="default" size="100%">Studies in Health Technology and Informatics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">IOPress</style></publisher><volume><style face="normal" font="default" size="100%">126</style></volume><pages><style face="normal" font="default" size="100%">144--153</style></pages><isbn><style face="normal" font="default" size="100%">978-1-58603-738-3</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The paper documents a series of data integration workshops held in 2006 at the UK National e-Science Centre, summarizing a range of the problem/solution scenarios in multi-site and multi-scale data integration with six HealthGrid projects using schizophrenia as a domain-specific test case. It outlines 
emerging strategies, recommendations and objectives for collaboration on shared ontology-building and harmonization of data for multi-site trials in this domain.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Voss, A.</style></author><author><style face="normal" font="default" size="100%">Mascord, M.</style></author><author><style face="normal" font="default" size="100%">Fraser, M.</style></author><author><style face="normal" font="default" size="100%">Jirotka, M.</style></author><author><style face="normal" font="default" size="100%">Procter, R.</style></author><author><style face="normal" font="default" size="100%">Halfpenny, P.</style></author><author><style face="normal" font="default" size="100%">Fergusson, D.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Dunn, S.</style></author><author><style face="normal" font="default" size="100%">Blanke, T.</style></author><author><style face="normal" font="default" size="100%">Hughes, L.</style></author><author><style face="normal" font="default" size="100%">Anderson, S.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">e-Research Infrastructure Development and Community Engagement</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2007</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/09/2007</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/e-Infrastructure%20Development%20and%20Community%20Engagement.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">The UK and wider international e-Research initiatives are entering a critical phase in which they need to move from the development of the basic underlying technology, demonstrators, prototypes and early applications to wider adoption and the development of stable infrastructures. In this paper we will review existing work on studies of infrastructure and community development, requirements elicitation for existing services as well as work within the arts and humanities and the social sciences to establish e-Research in these communities. We then describe two projects recently funded by JISC to study barriers to adoption and responses to them as well as use cases and service usage models.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giacobini, Mario</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Mario Giacobini</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">European Graduate Student Workshop on Evolutionary Computation</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><pub-location><style face="normal" font="default" size="100%">Valencia, Spain</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Evolutionary computation involves the study of problem-solving and optimization techniques inspired by principles of evolution and genetics. As any other scientific field, its success relies on the continuity provided by new researchers joining the field to help it progress. One of the most important sources for new researchers is the next generation of PhD students that are actively studying a topic relevant to this field. It is from this main observation the idea arose of providing a platform exclusively for PhD students. </style></abstract><work-type><style face="normal" font="default" size="100%">proceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cotta, Carlos</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Carlos Cotta</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary Computation in Combinatorial Optimization, 7th European Conference</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://springerlink.metapress.com/content/105633/</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">LNCS 4446</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Metaheuristics have often been shown to be effective for difficult combinatorial 
optimization problems appearing in various industrial, economical, and scientific 
domains. Prominent examples of metaheuristics are evolutionary algorithms, 
simulated annealing, tabu search, scatter search, memetic algorithms, variable 
neighborhood search, iterated local search, greedy randomized adaptive search 
procedures, estimation of distribution algorithms, and ant colony optimization. 
Successfully solved problems include scheduling, timetabling, network design, 
transportation and distribution, vehicle routing, the traveling salesman problem, 
satisfiability, packing and cutting, and general mixed integer programming. 

EvoCOP began in 2001 and has been held annually since then. It was the 
first event specifically dedicated to the application of evolutionary computation 
and related methods to combinatorial optimization problems. Originally held as 
a workshop, EvoCOP became a conference in 2004. The events gave researchers 
an excellent opportunity to present their latest research and to discuss current 
developments and applications as well as providing for improved interaction 
between members of this scientific community. Following the general trend of 
hybrid metaheuristics and diminishing boundaries between the different classes 
of metaheuristics, EvoCOP has broadened its scope over the last years and 
invited submissions on any kind of metaheuristic for combinatorial optimization.</style></abstract><work-type><style face="normal" font="default" size="100%">proceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Chue Hong, N. P.</style></author><author><style face="normal" font="default" size="100%">Dobrzelecki, B.</style></author><author><style face="normal" font="default" size="100%">Hume, A. C.</style></author><author><style face="normal" font="default" size="100%">Jackson, M.</style></author><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Krause, A.</style></author><author><style face="normal" font="default" size="100%">Schopf, J. M.</style></author><author><style face="normal" font="default" size="100%">Sugden. T.</style></author><author><style face="normal" font="default" size="100%">Theocharopoulos, E.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Grid Enabling Your Data Resources with OGSA-DAI</style></title><secondary-title><style face="normal" font="default" size="100%">Applied Parallel Computing. State of the Art in Scientific Computing</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><volume><style face="normal" font="default" size="100%">4699</style></volume><pages><style face="normal" font="default" size="100%">799--808</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Robertson, D.</style></author><author><style face="normal" font="default" size="100%">Walton, C.</style></author><author><style face="normal" font="default" size="100%">Barker, A.</style></author><author><style face="normal" font="default" size="100%">Besana, P.</style></author><author><style face="normal" font="default" size="100%">Chen-Burger, Y.</style></author><author><style face="normal" font="default" size="100%">Hassan, F.</style></author><author><style face="normal" font="default" size="100%">Lambert, D.</style></author><author><style face="normal" font="default" size="100%">Li, G.</style></author><author><style face="normal" font="default" size="100%">McGinnis, J</style></author><author><style face="normal" font="default" size="100%">Osman, N.</style></author><author><style face="normal" font="default" size="100%">Bundy, A.</style></author><author><style face="normal" font="default" size="100%">McNeill, F.</style></author><author><style face="normal" font="default" size="100%">van Harmelen, F.</style></author><author><style face="normal" font="default" size="100%">Sierra, C.</style></author><author><style face="normal" font="default" size="100%">Giunchiglia, F.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Interaction as a Grounding for Peer to Peer Knowledge Sharing</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Web Semantics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">LNCS-IFIP</style></publisher><volume><style face="normal" font="default" size="100%">1</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">S. Aitken</style></author><author><style face="normal" font="default" size="100%">Y. Chen</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Managing the transition from OBO to OWL: The COBrA-CT Bio-Ontology Tools</style></title><secondary-title><style face="normal" font="default" size="100%">UK e-Science Al l Hands Meeting 2007</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Bio-ontology, Grid, OBO, OWL</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/09/2007</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">This paper presents the COBrA-CT ontology tools, which include an ontology server database and
version manager client tool for collaborative ontology development, and an editor for bio-ontologies that are represented in the Web Ontology Language (OWL) format. The ontology server
uses OGSA-DAI Grid technology to provide access to the ontology server database. These tools
implement the agreed standard for representing Open Biomedical Ontologies (OBO) in OWL and
interoperate with other tools developed for this standard. Such tools are essential for the uptake of
OWL in the biomedical ontology community.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sanchez, A.</style></author><author><style face="normal" font="default" size="100%">Perez, M. S.</style></author><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Herrero, P.</style></author><author><style face="normal" font="default" size="100%">Perez, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">MAPFS-DAI, an extension of OGSA-DAI based on a parallel file system</style></title><secondary-title><style face="normal" font="default" size="100%">Future Generation Computer Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">138--145</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gyenesei, Attila</style></author><author><style face="normal" font="default" size="100%">Wagner, Ulrich</style></author><author><style face="normal" font="default" size="100%">Barkow-Oesterreicher, Simon</style></author><author><style face="normal" font="default" size="100%">Stolte, Etzard</style></author><author><style face="normal" font="default" size="100%">Schlapbach, Ralph</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Mining co-regulated gene profiles for the detection of functional associations in gene expression data</style></title><secondary-title><style face="normal" font="default" size="100%">Bioinformatics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><number><style face="normal" font="default" size="100%">15</style></number><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">1927-1935</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Baldock, R. A.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">S. Hochreiter</style></author><author><style face="normal" font="default" size="100%">R. Wagner</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Mining spatial gene expression data for association rules</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Bioinformatics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">biomedical</style></keyword><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">DGEMap</style></keyword><keyword><style  face="normal" font="default" size="100%">e-Science</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-540-71233-6_6</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pages><style face="normal" font="default" size="100%">66--76</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We analyse data from the Edinburgh Mouse Atlas Gene-Expression Database (EMAGE) which is a high quality data source for spatio-temporal gene expression patterns. Using a novel process whereby generated patterns are used to probe spatially-mapped gene expression domains, we are able to get unbiased results as opposed to using annotations based predefined anatomy regions. We describe two processes to form association rules based on spatial configurations, one that associates spatial regions, the other associates genes.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stuart Aitken</style></author><author><style face="normal" font="default" size="100%">Yin Chen</style></author><author><style face="normal" font="default" size="100%">Jonathan Bard</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">OBO Explorer: An Editor for Open Biomedical Ontologies in OWL</style></title><secondary-title><style face="normal" font="default" size="100%">Bioinformatics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2007</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://bioinformatics.oxfordjournals.org/cgi/content/abstract/btm593?</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Oxford Journals</style></publisher><abstract><style face="normal" font="default" size="100%">To clarify the semantics, and take advantage of tools and algorithms developed for the Semantic Web, a mapping from the Open Biomedical Ontologies (OBO) format to the Web Ontology Language (OWL) has been established. We present an ontology editor that allows end users to work directly with this OWL representation of OBO format ontologies.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Hong, N. P. Chue</style></author><author><style face="normal" font="default" size="100%">Hume, A. C.</style></author><author><style face="normal" font="default" size="100%">Jackson, M.</style></author><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Krause, A.</style></author><author><style face="normal" font="default" size="100%">Schopf, J. M.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author><author><style face="normal" font="default" size="100%">Dobrzelecki, B.</style></author><author><style face="normal" font="default" size="100%">Illingworth, M.</style></author><author><style face="normal" font="default" size="100%">McDonnell, N.</style></author><author><style face="normal" font="default" size="100%">Parsons, M.</style></author><author><style face="normal" font="default" size="100%">Theocharopoulous, E.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">OGSA-DAI 3.0 - The What's and Whys</style></title><secondary-title><style face="normal" font="default" size="100%">UK e-Science All Hands Meeting</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author><author><style face="normal" font="default" size="100%">David E. Singh</style></author><author><style face="normal" font="default" size="100%">Florin Isaila</style></author><author><style face="normal" font="default" size="100%">Jesús Carretero</style></author><author><style face="normal" font="default" size="100%">Antonio Garcia Loureiro</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Optimization and evaluation of parallel I/O in BIPS3D parallel irregular application</style></title><secondary-title><style face="normal" font="default" size="100%">IPDPS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Walker, D. W.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author><author><style face="normal" font="default" size="100%">Sommerville, I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Walker, D. W.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author><author><style face="normal" font="default" size="100%">Sommerville, I.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Special Issue: Selected Papers from the 2004 U.K. e-Science All Hands Meeting</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2004</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Concurrency and Computation: Practice and Experience</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">31-08-2004</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons Ltd</style></publisher><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">129-131</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Newhouse, S.</style></author><author><style face="normal" font="default" size="100%">Schopf, J. M.</style></author><author><style face="normal" font="default" size="100%">Richards, A.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Study of User Priorities for e-Infrastructure for e-Research (SUPER)</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the UK e-Science All Hands Meeting</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Asen Asenov</style></author><author><style face="normal" font="default" size="100%">Dave Berry</style></author><author><style face="normal" font="default" size="100%">Campbell Millar</style></author><author><style face="normal" font="default" size="100%">Gareth Roy</style></author><author><style face="normal" font="default" size="100%">Scott Roy</style></author><author><style face="normal" font="default" size="100%">Richard Sinnott</style></author><author><style face="normal" font="default" size="100%">Gordon Stewart</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards a Grid-Enabled Simulation Framework for Nano-CMOS Electronics</style></title><secondary-title><style face="normal" font="default" size="100%">3rd IEEE International Conference on eScience and Grid Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/12/2007</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%">Bangalore, India </style></pub-location><abstract><style face="normal" font="default" size="100%">The electronics design industry is facing major challenges as transistors continue to decrease in size.
The next generation of devices will be so small that the position of individual atoms will affect their behaviour.
This will cause the transistors on a chip to have highly variable characteristics, which in turn will impact
circuit and system design tools. The EPSRC project “Meeting the Design Challenges of Nano-CMOS
Electronics” (Nano-CMOS) has been funded to explore this area. In this paper, we describe the
distributed data-management and computing framework under development within Nano-CMOS. A
key aspect of this framework is the need for robust and reliable security mechanisms that support distributed
electronics design groups who wish to collaborate by sharing designs, simulations, workflows, datasets and
computation resources. This paper presents the system design, and an early prototype of the project which hasbeen useful in helping us to understand the benefits of such a grid infrastructure. In particular, we also present two typical use cases: user authentication, and execution of large-scale device simulations.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Y. Chen</style></author><author><style face="normal" font="default" size="100%">D. Berry</style></author><author><style face="normal" font="default" size="100%">P. Dantressangle</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Transaction-Based Grid Database Replication</style></title><secondary-title><style face="normal" font="default" size="100%">UK e-Science Al l Hands Meeting 2007</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Grid, Replication, Transaction-based, OGSA-DAI</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/09/2007</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">We present a framework for grid database replication. Data replication is one of the most useful
strategies to achieve high levels of availability and fault tolerance as well as minimal access time in
grids. It is commonly demanded by many grid applications. However, most existing grid replication
systems only deal with read-only files. By contrast, several relational database vendors provide
tools that offer transaction-based replication, but the capabilities of these products are insufficient to
address grid issues. They lack scalability and cannot cope with the heterogeneous nature of grid
resources.
Our approach uses existing grid mechanisms to provide a metadata registry and to make initial
replicas of data resources. We then define high-level APIs for managing transaction-based
replication. These APIs can be mapped to a variety of relational database replication mechanisms
allowing us to use existing vendor-specific solutions. The next stage in the project will use OGSA-
DAI to manage replication across multiple domains. In this way, our framework can support
transaction-based database synchronisation that maintains consistency in a data-intensive, large-
scale distributed, disparate networking environment.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Berlich, R{\&quot;u}diger</style></author><author><style face="normal" font="default" size="100%">Hardt, Marcus</style></author><author><style face="normal" font="default" size="100%">Kunze, Marcel</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Fergusson, David</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">EGEE: building a pan-European grid training organisation</style></title><secondary-title><style face="normal" font="default" size="100%">ACSW Frontiers</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><pages><style face="normal" font="default" size="100%">105-111</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giacobini, Mario</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Giacobini, Mario</style></author><author><style face="normal" font="default" size="100%">van Hemert, Jano</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">European Graduate Student Workshop on Evolutionary Computation</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><pub-location><style face="normal" font="default" size="100%">Budapest, Hungary</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Evolutionary computation involves the study of problem-solving and optimization techniques inspired by principles of evolution and genetics. As any other scientific field, its success relies on the continuity provided by new researchers joining the field to help it progress. One of the most important sources for new researchers is the next generation of PhD students that are actively studying a topic relevant to this field. It is from this main observation the idea arose of providing a platform exclusively for PhD students. </style></abstract><work-type><style face="normal" font="default" size="100%">proceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolving combinatorial problem instances that are difficult to solve</style></title><secondary-title><style face="normal" font="default" size="100%">Evolutionary Computation</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint programming</style></keyword><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">problem evolving</style></keyword><keyword><style  face="normal" font="default" size="100%">satisfiability</style></keyword><keyword><style  face="normal" font="default" size="100%">travelling salesman</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.mitpressjournals.org/toc/evco/14/4</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">14</style></volume><pages><style face="normal" font="default" size="100%">433--462</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we demonstrate how evolutionary computation can be used to acquire difficult to solve combinatorial problem instances, thereby stress-testing the corresponding algorithms used to solve these instances. The technique is applied in three important domains of combinatorial optimisation, binary constraint satisfaction, Boolean satisfiability, and the travelling salesman problem. Problem instances acquired through this technique are more difficult than ones found in popular benchmarks. We analyse these evolved instances with the aim to explain their difficulty in terms of structural properties, thereby exposing the weaknesses of corresponding algorithms.</style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">D. Berry</style></author><author><style face="normal" font="default" size="100%">Usmani, A.</style></author><author><style face="normal" font="default" size="100%">Torero, J.</style></author><author><style face="normal" font="default" size="100%">Tate, A.</style></author><author><style face="normal" font="default" size="100%">McLaughlin, S.</style></author><author><style face="normal" font="default" size="100%">Potter, S.</style></author><author><style face="normal" font="default" size="100%">Trew, A.</style></author><author><style face="normal" font="default" size="100%">Baxter, R.</style></author><author><style face="normal" font="default" size="100%">Bull, M.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">FireGrid: Integrated emergency response and fire safety engineering for the future built environment</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2005</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">20/09/2005</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/FireGrid%20-%20Integrated%20emergency%20response%20and%20fire%20safety%20engineering%20for%20the%20future%20built%20environment.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">Analyses of disasters such as the Piper Alpha explosion (Sylvester-Evans and Drysdale, 1998), the World Trade Centre collapse (Torero et al, 2002, Usmani et al, 2003) and the fires at Kings Cross (Drysdale et al, 1992) and the Mont Blanc tunnel (Rapport Commun, 1999) have revealed many mistaken decisions, such as that which sent 300 fire-fighters to their deaths in the World Trade Centre. Many of these mistakes have been attributed to a lack of information about the conditions within the fire and the imminent consequences of the event.

E-Science offers an opportunity to significantly improve the intervention in fire emergencies. The FireGrid Consortium is working on a mixture of research projects to make this vision a reality. This paper describes the research challenges and our plans for solving them.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Hong, N. Chue</style></author><author><style face="normal" font="default" size="100%">Dobrzelecki, B.</style></author><author><style face="normal" font="default" size="100%">Hume, A.</style></author><author><style face="normal" font="default" size="100%">Jackson, M.</style></author><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Krause, A.</style></author><author><style face="normal" font="default" size="100%">Sugden, T.</style></author><author><style face="normal" font="default" size="100%">Theocharopoulos, E.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Grid Enabling your Data Resources with OGSA-DAI</style></title><secondary-title><style face="normal" font="default" size="100%">Workshop on State-of-the-Art in Scientific and Parallel Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Richard O. Sinnott</style></author><author><style face="normal" font="default" size="100%">Micha Bayer</style></author><author><style face="normal" font="default" size="100%">A. J. Stell</style></author><author><style face="normal" font="default" size="100%">Jos Koetsier</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Grid Infrastructures for Secure Access to and Use of Bioinformatics Data: Experiences from the BRIDGES Project</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the First International Conference on Availability, Reliability and Security, ARES</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Proceedings of the The First International Conference on Availability, Reliability and Security</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">20/04/2006</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Vienna, Austria</style></pub-location><pages><style face="normal" font="default" size="100%">950--957</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juhos, I.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J. Gottlieb</style></author><author><style face="normal" font="default" size="100%">G. Raidl</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">graph colouring</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><number><style face="normal" font="default" size="100%">3906</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pages><style face="normal" font="default" size="100%">123--134</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, our model provides useful information for guiding heuristics as well as a compact description for algorithms. To verify the potential of the model, we use it in dsatur, in an evolutionary algorithm, and in the same evolutionary algorithm extended with heuristics. An empiricial investigation is performed to show an increase in efficiency on two problem suites , a set of practical problem instances and a set of hard problem instances from the phase transition.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juhos, I.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Increasing the efficiency of graph colouring algorithms with a representation based on vector operations</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Software</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">graph colouring</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">1</style></volume><pages><style face="normal" font="default" size="100%">24--33</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of graph colouring algorithms. Moreover, this model provides useful information to aid in the creation of heuristics that can make the colouring process even faster. It also serves as a compact definition for the description of graph colouring algorithms. To verify the potential of the model, we use it in the complete algorithm DSATUR, and in two version of an incomplete approximation algorithm; an evolutionary algorithm and the same evolutionary algorithm extended with guiding heuristics. Both theoretical and empirical results are provided investigation is performed to show an increase in the efficiency of solving graph colouring problems. Two problem suites were used for the empirical evidence: a set of practical problem instances and a set of hard problem instances from the phase transition.</style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chue Hong, N. P.</style></author><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Karasavvas, K. A.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Lehner, W.</style></author><author><style face="normal" font="default" size="100%">Meyer, N.</style></author><author><style face="normal" font="default" size="100%">Streit, A.</style></author><author><style face="normal" font="default" size="100%">Stewart, C.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Knowledge and Data Management in Grids, CoreGRID</style></title><secondary-title><style face="normal" font="default" size="100%">Euro-Par'06 Proceedings of the CoreGRID 2006, UNICORE Summit 2006, Petascale Computational Biology and Bioinformatics conference on Parallel processing</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springer.com/computer/communication+networks/book/978-3-540-72226-7</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin, Germany</style></pub-location><volume><style face="normal" font="default" size="100%">4375</style></volume><isbn><style face="normal" font="default" size="100%">978-3-540-72226-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inbook</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gruber, M.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Raidl, G. R.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Maarten Keijzer</style></author><author><style face="normal" font="default" size="100%">et al</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">variable neighbourhood search</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">Seattle, USA</style></pub-location><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">1187--1194</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable neighbourhood search (VNS), an evolutionary algorithm (EA) utilising a new encoding of solutions, and an ant colony optimisation (ACO).We compare the performance in terms of effectiveness between these three hybrid methods on a suite  f popular benchmark instances, which contains instances too large to solve by current exact methods. Our results show that the EA and the ACO outperform the VNS on almost all used benchmark instances. Furthermore, the ACO yields most of the time better solutions than the EA in long-term runs, whereas the EA dominates when the computation time is strongly restricted.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dobrzelecki, B.</style></author><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Schopf, J. M.</style></author><author><style face="normal" font="default" size="100%">Hume, A. C.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Hong, N. P. Chue</style></author><author><style face="normal" font="default" size="100%">Jackson, M.</style></author><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Krause, A.</style></author><author><style face="normal" font="default" size="100%">Parsons, M.</style></author><author><style face="normal" font="default" size="100%">Sugden, T.</style></author><author><style face="normal" font="default" size="100%">Theocharopoulos, E.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Profiling OGSA-DAI Performance for Common Use Patterns</style></title><secondary-title><style face="normal" font="default" size="100%">UK e-Science All Hands Meeting</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">J. Watt</style></author><author><style face="normal" font="default" size="100%">Oluwafemi Ajayi</style></author><author><style face="normal" font="default" size="100%">J. Jiang</style></author><author><style face="normal" font="default" size="100%">Jos Koetsier</style></author><author><style face="normal" font="default" size="100%">Richard O. Sinnott</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Shibboleth-Protected Privilege Management Infrastructure for e-Science Education</style></title><secondary-title><style face="normal" font="default" size="100%">Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">security</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2006</style></year><pub-dates><date><style  face="normal" font="default" size="100%">16/05/2006</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%">Singapore</style></pub-location><pages><style face="normal" font="default" size="100%">357--364</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Defaweux, A.</style></author><author><style face="normal" font="default" size="100%">Lenaerts, T.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Parent, J.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Complexity Transitions in Evolutionary Algorithms: Evaluating the impact of the initial population</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Congress on Evolutionary Computation</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">transition models</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">{IEEE} Press</style></publisher><pages><style face="normal" font="default" size="100%">196--203</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity discussed in the context of evolutionary biology. Partially defined solutions interact and evolve into aggregations until a full solution for the problem at hand is found. The impact of the initial population on the outcome and the dynamics of the process is evaluated using the domain of binary constraint satisfaction problems.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Baldock, R.</style></author><author><style face="normal" font="default" size="100%">Burger, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Criticality-Based Framework for Task Composition in Multi-Agent Bioinformatics Integration Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Bioinformatics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><number><style face="normal" font="default" size="100%">14</style></number><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">3155--3163</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dedinski, I.</style></author><author><style face="normal" font="default" size="100%">De Meer, H.</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Mathy, L.</style></author><author><style face="normal" font="default" size="100%">Pezaros, D.</style></author><author><style face="normal" font="default" size="100%">P. , Sventek, J. S.</style></author><author><style face="normal" font="default" size="100%">Xiaoying, Z.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Cross-Layer Peer-to-Peer Traffic Identification and Optimization Based on Active Networking</style></title><secondary-title><style face="normal" font="default" size="100%"> 7th International Working Conference on Active and Programmable Networks</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Nov. 21 2005</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Sophia Antipolis, French Riviera, La Cote d'Azur, France, November 21-23, 2005.</style></pub-location></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonioletti, Mario</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Baxter, Robert M.</style></author><author><style face="normal" font="default" size="100%">Borley, Andrew</style></author><author><style face="normal" font="default" size="100%">Hong, Neil P. Chue</style></author><author><style face="normal" font="default" size="100%">Collins, Brian</style></author><author><style face="normal" font="default" size="100%">Hardman, Neil</style></author><author><style face="normal" font="default" size="100%">Hume, Alastair C.</style></author><author><style face="normal" font="default" size="100%">Knox, Alan</style></author><author><style face="normal" font="default" size="100%">Mike Jackson</style></author><author><style face="normal" font="default" size="100%">Krause, Amrey</style></author><author><style face="normal" font="default" size="100%">Laws, Simon</style></author><author><style face="normal" font="default" size="100%">Magowan, James</style></author><author><style face="normal" font="default" size="100%">Pato</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The design and implementation of Grid database services in OGSA-DAI</style></title><secondary-title><style face="normal" font="default" size="100%">Concurrency - Practice and Experience</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><number><style face="normal" font="default" size="100%">2-4</style></number><volume><style face="normal" font="default" size="100%">17</style></volume><pages><style face="normal" font="default" size="100%">357-376</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Rusbridge, C.</style></author><author><style face="normal" font="default" size="100%">P. Burnhill</style></author><author><style face="normal" font="default" size="100%">S. Ross</style></author><author><style face="normal" font="default" size="100%">P. Buneman</style></author><author><style face="normal" font="default" size="100%">D. Giaretta</style></author><author><style face="normal" font="default" size="100%">Lyon, L.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Digital Curation Centre: a vision for digital curation</style></title><secondary-title><style face="normal" font="default" size="100%">2005 IEEE International Symposium on Mass Storage Systems and Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">20/06/2005</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Digital%20Curation%20Centre%20-%20a%20vision%20for%20the%20future%20of%20digital%20curation.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pub-location><style face="normal" font="default" size="100%">Sardinia, Italy</style></pub-location><isbn><style face="normal" font="default" size="100%">0-7803-9228-0</style></isbn><abstract><style face="normal" font="default" size="100%">We describe the aims and aspirations for the Digital Curation Centre (DCC), the UK response to the realisation that digital information is both essential and fragile. We recognise the equivalence of preservation as &quot;interoperability with the future&quot;, asserting that digital curation is concerned with &quot;communication across time&quot;. We see the DCC as having relevance for present day data curation and for continuing data access for generations to come. We describe the structure and plans of the DCC, designed to support these aspirations and based on a view of world class research being developed into curation services, all of which are underpinned by outreach to the broadest community.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Defaweux, A.</style></author><author><style face="normal" font="default" size="100%">Lenaerts, T.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">M. Capcarrere</style></author><author><style face="normal" font="default" size="100%">A. A. Freitas</style></author><author><style face="normal" font="default" size="100%">P. J. Bentley</style></author><author><style face="normal" font="default" size="100%">C. G. Johnson</style></author><author><style face="normal" font="default" size="100%">J. Timmis</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary Transitions as a Metaphor for Evolutionary Optimization</style></title><secondary-title><style face="normal" font="default" size="100%">LNAI 3630</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">transition models</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pages><style face="normal" font="default" size="100%">342--352</style></pages><isbn><style face="normal" font="default" size="100%">3-540-28848-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper proposes a computational model for solving optimisation problems that mimics the principle of evolutionary transitions in individual complexity. More specifically it incorporates mechanisms for the emergence of increasingly complex individuals from the interaction of  more simple ones. The biological principles for transition are outlined and mapped onto  an evolutionary computation context.  The class of binary constraint satisfaction problems is used to illustrate the transition mechanism.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gomes, J.</style></author><author><style face="normal" font="default" size="100%">David, M.</style></author><author><style face="normal" font="default" size="100%">Martins, J.</style></author><author><style face="normal" font="default" size="100%">Bernardo, L.</style></author><author><style face="normal" font="default" size="100%">A García</style></author><author><style face="normal" font="default" size="100%">Hardt, M.</style></author><author><style face="normal" font="default" size="100%">Kornmayer, H.</style></author><author><style face="normal" font="default" size="100%">Marco, Jesus</style></author><author><style face="normal" font="default" size="100%">Marco,  Rafael</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Diaz, Irma</style></author><author><style face="normal" font="default" size="100%">Cano, Daniel</style></author><author><style face="normal" font="default" size="100%">Salt, J.</style></author><author><style face="normal" font="default" size="100%">Gonzalez, S.</style></author><author><style face="normal" font="default" size="100%">J Sánchez</style></author><author><style face="normal" font="default" size="100%">Fassi, F.</style></author><author><style face="normal" font="default" size="100%">Lara, V.</style></author><author><style face="normal" font="default" size="100%">Nyczyk, P.</style></author><author><style face="normal" font="default" size="100%">Lason, P.</style></author><author><style face="normal" font="default" size="100%">Ozieblo, A.</style></author><author><style face="normal" font="default" size="100%">Wolniewicz, P.</style></author><author><style face="normal" font="default" size="100%">Bluj, M.</style></author><author><style face="normal" font="default" size="100%">K Nawrocki</style></author><author><style face="normal" font="default" size="100%">A Padee</style></author><author><style face="normal" font="default" size="100%">W Wislicki</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Peter M. A. Sloot, Alfons G. Hoekstra, Thierry Priol, Alexander Reinefeld</style></author><author><style face="normal" font="default" size="100%">Marian Bubak</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Experience with the international testbed in the crossgrid project</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Grid Computing-EGC 2005</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">LNCS</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Berlin/Heidelberg</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam</style></pub-location><volume><style face="normal" font="default" size="100%">3470</style></volume><pages><style face="normal" font="default" size="100%">172-271</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Keijzer, M.</style></author><author><style face="normal" font="default" size="100%">Tettamanzi, A.</style></author><author><style face="normal" font="default" size="100%">Collet, P.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author><author><style face="normal" font="default" size="100%">Tomassini, M.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">M. Keijzer</style></author><author><style face="normal" font="default" size="100%">A. Tettamanzi</style></author><author><style face="normal" font="default" size="100%">P. Collet</style></author><author><style face="normal" font="default" size="100%">van Hemert, J.</style></author><author><style face="normal" font="default" size="100%">M. Tomassini</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Genetic Programming, Proceedings of the 8th European Conference</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springeronline.com/sgw/cda/frontpage/0,11855,3-40100-22-45347265-0,00.html?changeHeader=true</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">3447</style></volume><isbn><style face="normal" font="default" size="100%">3-540-25436-6</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">proceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juhos, I.</style></author><author><style face="normal" font="default" size="100%">Tóth, A.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">G. Raidl</style></author><author><style face="normal" font="default" size="100%">J. Gottlieb</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">graph colouring</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">132--143</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics that exploit information about the partial colouring in an aim to improve performance. An evolutionary algorithm is used to drive the search. We compare the different strategies to each other on several very hard benchmarks and on generated problem instances, and show where the novel strategies improve the efficiency.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Hong, N. C.</style></author><author><style face="normal" font="default" size="100%">Sugden, T.</style></author><author><style face="normal" font="default" size="100%">Hume, A.</style></author><author><style face="normal" font="default" size="100%">Jackson, M.</style></author><author><style face="normal" font="default" size="100%">Krause, A.</style></author><author><style face="normal" font="default" size="100%">Palansuriya, C.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Introduction to OGSA-DAI Services</style></title><secondary-title><style face="normal" font="default" size="100%">Scientific Applications of Grid Computing</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><volume><style face="normal" font="default" size="100%">3458</style></volume><pages><style face="normal" font="default" size="100%">1--12</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-25810-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Antonioletti, M.</style></author><author><style face="normal" font="default" size="100%">Baxter, R.</style></author><author><style face="normal" font="default" size="100%">Borley, A.</style></author><author><style face="normal" font="default" size="100%">Hong, N. C.</style></author><author><style face="normal" font="default" size="100%">Hume, A.</style></author><author><style face="normal" font="default" size="100%">Jackson, M.</style></author><author><style face="normal" font="default" size="100%">Krause, A.</style></author><author><style face="normal" font="default" size="100%">Laws, S.</style></author><author><style face="normal" font="default" size="100%">Paton, N.</style></author><author><style face="normal" font="default" size="100%">Schopf, J.</style></author><author><style face="normal" font="default" size="100%">Sugden, T.</style></author><author><style face="normal" font="default" size="100%">Tourlas, K.</style></author><author><style face="normal" font="default" size="100%">Watson, P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A New Architecture for OGSA-DAI</style></title><secondary-title><style face="normal" font="default" size="100%">UK e-Science All Hands Meeting</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonioletti, Mario</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Andrew Borle</style></author><author><style face="normal" font="default" size="100%">Hong, Neil P. Chue</style></author><author><style face="normal" font="default" size="100%">Patrick Dantressangle</style></author><author><style face="normal" font="default" size="100%">Hume, Alastair C.</style></author><author><style face="normal" font="default" size="100%">Mike Jackson</style></author><author><style face="normal" font="default" size="100%">Krause, Amy</style></author><author><style face="normal" font="default" size="100%">Laws, Simon</style></author><author><style face="normal" font="default" size="100%">Parsons, Mark</style></author><author><style face="normal" font="default" size="100%">Paton, Norman W.</style></author><author><style face="normal" font="default" size="100%">Jennifer M. Schopf</style></author><author><style face="normal" font="default" size="100%">Tom Sugden</style></author><author><style face="normal" font="default" size="100%">Watson, Paul</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">OGSA-DAI Status and Benchmarks</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2005</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">20/09/05</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/OGSA-DAI%20Status%20and%20Benchmarks.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">This paper presents a status report on some of the highlights that have taken place within the OGSADAI project since the last AHM. A description of Release 6.0 functionality and details of the forthcoming release, due in September 2005, is given. Future directions for this project are discussed. This paper also describes initial results of work being done to systematically benchmark recent OGSADAI releases. The OGSA-DAI software distribution, and more information about the project, is available from the project website at www.ogsadai.org.uk.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gomes, J.</style></author><author><style face="normal" font="default" size="100%">David, M.</style></author><author><style face="normal" font="default" size="100%">Martins, J.</style></author><author><style face="normal" font="default" size="100%">Bernardo, L.</style></author><author><style face="normal" font="default" size="100%">Garcia, A.</style></author><author><style face="normal" font="default" size="100%">Hardt, M.</style></author><author><style face="normal" font="default" size="100%">Kornmayer, H.</style></author><author><style face="normal" font="default" size="100%">Marco,  Rafael</style></author><author><style face="normal" font="default" size="100%">Rodríguez, David</style></author><author><style face="normal" font="default" size="100%">Diaz, Irma</style></author><author><style face="normal" font="default" size="100%">Cano, Daniel</style></author><author><style face="normal" font="default" size="100%">Salt, J.</style></author><author><style face="normal" font="default" size="100%">Gonzalez, S.</style></author><author><style face="normal" font="default" size="100%">Sanchez, J.</style></author><author><style face="normal" font="default" size="100%">Fassi, F.</style></author><author><style face="normal" font="default" size="100%">Lara, V.</style></author><author><style face="normal" font="default" size="100%">Nyczyk, P.</style></author><author><style face="normal" font="default" size="100%">Lason, P.</style></author><author><style face="normal" font="default" size="100%">Ozieblo, A.</style></author><author><style face="normal" font="default" size="100%">Wolniewicz, P.</style></author><author><style face="normal" font="default" size="100%">Bluj, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Organization of the International Testbed of the CrossGrid Project</style></title><secondary-title><style face="normal" font="default" size="100%">Cracow Grid Workshop 2005</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">G. Raidl</style></author><author><style face="normal" font="default" size="100%">J. Gottlieb</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Property analysis of symmetric travelling salesman problem instances acquired through evolution</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">problem evolving</style></keyword><keyword><style  face="normal" font="default" size="100%">travelling salesman</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">122--131</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those sets to guide us towards deferring general knowledge about the efficiency of the two variants in relation to structural properties of the symmetric travelling salesman problem.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">José Daniel Garcia</style></author><author><style face="normal" font="default" size="100%">Jesús Carretero</style></author><author><style face="normal" font="default" size="100%">José Maria Pérez</style></author><author><style face="normal" font="default" size="100%">Félix García Carballeira</style></author><author><style face="normal" font="default" size="100%">Rosa Filgueira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Specifying use case behavior with interaction models</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Object Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">143-159</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">José Daniel García,Jesús Carretero,José María Pérez,Félix García,Rosa Filgueira.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Specifying use case behavior with interaction models</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Object Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">11/2005</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">143</style></section><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">16</style></pages><abstract><style face="normal" font="default" size="100%">Functional requirements for information systems can be modeled through use cases. Furthermore, use case models have been successfully used in broader contexts than software engineering, as systems engineering. Even if small systems may be modeled as a set of use cases, when large systems requirements are modeled with a plain use case model several difficulties arise. Traditionally, the behavior of use cases has been modeled through textual specifications. In this paper we present an alternate approach based on interaction modeling. The behavior modeling has two variants (one for UML 1.x and one for UML 2.0). We also integrate our behavior modeling with standard use case relationships.</style></abstract><issue><style face="normal" font="default" size="100%">9</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Defaweux, A.</style></author><author><style face="normal" font="default" size="100%">Lenaerts, T.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Parent, J.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">H.-G. Beyer</style></author><author><style face="normal" font="default" size="100%">et al</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Transition Models as an incremental approach for problem solving in Evolutionary Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Genetic and Evolutionary Computation Conference</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">transition models</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">{ACM} Press</style></publisher><pages><style face="normal" font="default" size="100%">599--606</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model. It lets building units of a solution interact and then uses an evolutionary process to merge these units toward a full solution for the problem at hand. The paper provides a preliminary study on the evolutionary dynamics of this model as well as an empirical comparison with other evolutionary techniques on binary constraint satisfaction.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Roure, David De</style></author><author><style face="normal" font="default" size="100%">Dunlop, Alistair N.</style></author><author><style face="normal" font="default" size="100%">Fox, Geoffrey</style></author><author><style face="normal" font="default" size="100%">Henderson, Peter</style></author><author><style face="normal" font="default" size="100%">Hey, Anthony J. G.</style></author><author><style face="normal" font="default" size="100%">Paton, Norman W.</style></author><author><style face="normal" font="default" size="100%">Newhouse, Steven</style></author><author><style face="normal" font="default" size="100%">Parastatidis, Savas</style></author><author><style face="normal" font="default" size="100%">Trefethen, Anne E.</style></author><author><style face="normal" font="default" size="100%">Watson, Paul</style></author><author><style face="normal" font="default" size="100%">Webber, Jim</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Web Service Grids: an evolutionary approach</style></title><secondary-title><style face="normal" font="default" size="100%">Concurrency - Practice and Experience</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><number><style face="normal" font="default" size="100%">2-4</style></number><volume><style face="normal" font="default" size="100%">17</style></volume><pages><style face="normal" font="default" size="100%">377-389</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juhos, I.</style></author><author><style face="normal" font="default" size="100%">Tóth, A.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J. Gottlieb</style></author><author><style face="normal" font="default" size="100%">G. Raidl</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Binary Merge Model Representation of the Graph Colouring Problem</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">graph colouring</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><number><style face="normal" font="default" size="100%">3004</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">124--134</style></pages><isbn><style face="normal" font="default" size="100%">3-540-21367-8</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper describes a novel representation and ordering model that aided by an evolutionary algorithm, is used in solving the graph \emph{k}-colouring problem. Its strength lies in reducing the search space by breaking symmetry. An empirical comparison is made with two other algorithms on a standard suit of problem instances and on a suit of instances in the phase transition where it shows promising results.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Baldock, R.</style></author><author><style face="normal" font="default" size="100%">Burger, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Bioinformatics System Integration and Agent Technology</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Biomedical Informatics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">37</style></volume><pages><style face="normal" font="default" size="100%">205--219</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sinnott, R. O.</style></author><author><style face="normal" font="default" size="100%">Bayer, M.</style></author><author><style face="normal" font="default" size="100%">Houghton, D.</style></author><author><style face="normal" font="default" size="100%">D. Berry</style></author><author><style face="normal" font="default" size="100%">Ferrier, M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Development of a Grid Infrastructure for Functional Genomics</style></title><secondary-title><style face="normal" font="default" size="100%">Life Science Grid Conference (LSGrid 2004)</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">LNCS</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Kanazawa, Japan </style></pub-location></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">la Poutré, J. A.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Xin Yao</style></author><author><style face="normal" font="default" size="100%">Edmund Burke</style></author><author><style face="normal" font="default" size="100%">Jose A. Lozano</style></author><author><style face="normal" font="default" size="100%">Jim Smith</style></author><author><style face="normal" font="default" size="100%">Juan J. Merelo-Guerv\'os</style></author><author><style face="normal" font="default" size="100%">John A. Bullinaria</style></author><author><style face="normal" font="default" size="100%">Jonathan Rowe</style></author><author><style face="normal" font="default" size="100%">Peter Ti\v{n}o Ata Kab\'an</style></author><author><style face="normal" font="default" size="100%">Hans-Paul Schwefel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation</style></title><secondary-title><style face="normal" font="default" size="100%">LNCS</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">dynamic problems</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">vehicle routing</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Birmingham, UK</style></pub-location><volume><style face="normal" font="default" size="100%">3242</style></volume><pages><style face="normal" font="default" size="100%">690--699</style></pages><isbn><style face="normal" font="default" size="100%">3-540-23092-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to maximise the number of loads transported, while keeping to capacity and time constraints. Loads arrive while the problem is being solved, which makes it a real-time routing problem. The solver is a self-adaptive evolutionary algorithm that ensures feasible solutions at all times. We investigate under what conditions the exploration of fruitful regions improves the effectiveness of the evolutionary algorithm.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Richard Sinnott</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Micha Bayer</style></author><author><style face="normal" font="default" size="100%">Dave Berry</style></author><author><style face="normal" font="default" size="100%">Anna Dominiczak</style></author><author><style face="normal" font="default" size="100%">Magnus Ferrier</style></author><author><style face="normal" font="default" size="100%">David Gilbert</style></author><author><style face="normal" font="default" size="100%">Neil Hanlon</style></author><author><style face="normal" font="default" size="100%">Derek Houghton</style></author><author><style face="normal" font="default" size="100%">Hunt, Ela</style></author><author><style face="normal" font="default" size="100%">David White</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Grid Services Supporting the Usage of Secure Federated, Distributed Biomedical Data</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2004</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">31/08/2004</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.allhands.org.uk/2004/proceedings/papers/87.pdf</style></url></web-urls></urls><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">The BRIDGES project is a UK e-Science project that provides grid based support for biomedical research into the genetics of hypertension – the Cardiovascular Functional Genomics Project (CFG). Its main goal is to provide an effective environment for CFG, and biomedical research in general, including access to integrated data, analysis and visualization, with appropriate authorisation and privacy, as well as grid based computational tools and resources. It also aims to provide an improved understanding of the requirements of academic biomedical research virtual organizations and to evaluate the utility of existing data federation tools.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Deelman, Ewa</style></author><author><style face="normal" font="default" size="100%">Singh, Gurmeet Singh</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Chervenak, Ann L.</style></author><author><style face="normal" font="default" size="100%">Hong, Neil P. Chue</style></author><author><style face="normal" font="default" size="100%">Kesselman, Carl</style></author><author><style face="normal" font="default" size="100%">Patil, Sonal</style></author><author><style face="normal" font="default" size="100%">Pearlman, Laura</style></author><author><style face="normal" font="default" size="100%">Su, Mei-Hui</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Grid-Based Metadata Services</style></title><secondary-title><style face="normal" font="default" size="100%">SSDBM</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><pages><style face="normal" font="default" size="100%">393-402</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonioletti, Mario</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Borley, Andrew</style></author><author><style face="normal" font="default" size="100%">Hong, Neil P. Chue</style></author><author><style face="normal" font="default" size="100%">Collins, Brian</style></author><author><style face="normal" font="default" size="100%">Jonathan Davies</style></author><author><style face="normal" font="default" size="100%">Desmond Fitzgerald</style></author><author><style face="normal" font="default" size="100%">Hardman, Neil</style></author><author><style face="normal" font="default" size="100%">Hume, Alastair C.</style></author><author><style face="normal" font="default" size="100%">Mike Jackson</style></author><author><style face="normal" font="default" size="100%">Krause, Amrey</style></author><author><style face="normal" font="default" size="100%">Laws, Simon</style></author><author><style face="normal" font="default" size="100%">Paton, Norman W.</style></author><author><style face="normal" font="default" size="100%">Tom Sugden</style></author><author><style face="normal" font="default" size="100%">Watson, Paul</style></author><author><style face="normal" font="default" size="100%">Mar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">OGSA-DAI Status Report and Future Directions</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2004</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">31/08/2004</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/OGSA-DAI%20Status%20Report%20and%20Future%20Directions.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">Data Access and Integration (DAI) of data resources, such as relational and XML databases, within a Grid context. Project members also participate in the development of DAI standards through the GGF DAIS WG. The standards that emerge through this effort will be adopted by OGSA-DAI once they have stabilised. The OGSA-DAI developers are also engaging with a growing user community to gather their data and functionality requirements. Several large projects are already using OGSA-DAI to provide their DAI capabilities. This paper presents a status report on OGSA-DAI activities since the last AHM and announces future directions. The OGSA-DAI software distribution and more information about the project is available from the project website at http://www.ogsadai.org.uk/.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonioletti, Mario</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Borley, Andrew</style></author><author><style face="normal" font="default" size="100%">Neil Chue Hong</style></author><author><style face="normal" font="default" size="100%">Collins, Brian</style></author><author><style face="normal" font="default" size="100%">Jonathan Davies</style></author><author><style face="normal" font="default" size="100%">Hardman, Neil</style></author><author><style face="normal" font="default" size="100%">George Hicken</style></author><author><style face="normal" font="default" size="100%">Ally Hume</style></author><author><style face="normal" font="default" size="100%">Mike Jackson</style></author><author><style face="normal" font="default" size="100%">Krause, Amrey</style></author><author><style face="normal" font="default" size="100%">Laws, Simon</style></author><author><style face="normal" font="default" size="100%">Magowan, James</style></author><author><style face="normal" font="default" size="100%">Jeremy Nowell</style></author><author><style face="normal" font="default" size="100%">Paton, Norman W.</style></author><author><style face="normal" font="default" size="100%">Dave Pearson</style></author><author><style face="normal" font="default" size="100%">To</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">OGSA-DAI: Two Years On</style></title><secondary-title><style face="normal" font="default" size="100%">GGF10</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/OGSA-DAI%20-%20Two%20Years%20On.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Berlin, Germany</style></pub-location><abstract><style face="normal" font="default" size="100%">The OGSA-DAI project has been producing Grid-enabled middleware for almost two years now, providing data access and integration capabilities to data resources, such as databases, within an OGSA context. In these two years, OGSA-DAI has been tracking rapidly evolving standards, managing changes in software dependencies, contributing to the standardisation process and liasing with a growing user community together with their associated data requirements. This process has imparted important lessons and raised a number of issues that need to be addressed if a middleware product is to be widely adopted. This paper examines the experiences of OGSA-DAI in implementing proposed standards, the likely impact that the still-evolving standards landscape will have on future implementations and how these affect uptake of the software. The paper also examines the gathering of requirements from and engagement with the Grid community, the difficulties of defining a process for the management and publishing of metadata, and whether relevant standards can be implemented in an efficient manner. The OGSA-DAI software distribution and more details about the project are available from the project Web site at http://www.ogsadai.org.uk/.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Urquhart, N. B.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Xin Yao</style></author><author><style face="normal" font="default" size="100%">Edmund Burke</style></author><author><style face="normal" font="default" size="100%">Jose A. Lozano</style></author><author><style face="normal" font="default" size="100%">Jim Smith</style></author><author><style face="normal" font="default" size="100%">Juan J. Merelo-Guerv\'os</style></author><author><style face="normal" font="default" size="100%">John A. Bullinaria</style></author><author><style face="normal" font="default" size="100%">Jonathan Rowe</style></author><author><style face="normal" font="default" size="100%">Peter Ti\v{n}o Ata Kab\'an</style></author><author><style face="normal" font="default" size="100%">Hans-Paul Schwefel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation</style></title><secondary-title><style face="normal" font="default" size="100%">LNCS</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">problem evolving</style></keyword><keyword><style  face="normal" font="default" size="100%">travelling salesman</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.vanhemert.co.uk/files/clustered-phase-transition-tsp.tar.gz</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer-Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Birmingham, UK</style></pub-location><volume><style face="normal" font="default" size="100%">3242</style></volume><pages><style face="normal" font="default" size="100%">150--159</style></pages><isbn><style face="normal" font="default" size="100%">3-540-23092-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps consisting of clustered nodes. Uniform random sampling methods do not result in maps where the nodes are spread out to form identifiable clusters. To improve upon this, we propose an evolutionary algorithm that uses the layout of nodes on a map as its genotype. By optimising the spread until a set of constraints is satisfied, we are able to produce better clustered maps, in a more robust way. When varying the number of clusters in these maps and, when solving the Euclidean symmetric travelling salesman person using Chained Lin-Kernighan, we observe a phase transition in the form of an easy-hard-easy pattern.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">yan Liu</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Research of Relationship between Self-similar of TCP and Network Performance</style></title><secondary-title><style face="normal" font="default" size="100%">Journal on communications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2004</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">550</style></section><volume><style face="normal" font="default" size="100%">25</style></volume><pages><style face="normal" font="default" size="100%">550~554</style></pages><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Bäck, T.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Heuristics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword><keyword><style  face="normal" font="default" size="100%">resampling ratio</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><number><style face="normal" font="default" size="100%">6</style></number><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">629--640</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this article, we try to provide insight into the consequence of mutation and crossover rates when solving binary constraint satisfaction problems. This insight is based on a measurement of the space searched by an evolutionary algorithm. From data empirically acquired we describe the relation between the success ratio and the searched space. This is achieved using the resampling ratio, which is a measure for the amount of points revisited by a search algorithm. This relation is based on combinations of parameter settings for the variation operators. We then show that the resampling ratio is useful for identifying the quality of parameter settings, and provide a range that corresponds to robust parameter settings.</style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Harding, N. J.</style></author><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SPLAT: (Suffix-tree Powered Local Alignment Tool): A Full-Sensitivity Protein Database Search Program that Accelerates the Smith-Waterman Algorithm using a Generalised Suffix Tree Index.</style></title><secondary-title><style face="normal" font="default" size="100%">Department of Computer Science (DCS Tech Report TR-2003-141)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">02/2004</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/SPLAT.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">University of Glasgow</style></publisher></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Solnon, C.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J. Gottlieb</style></author><author><style face="normal" font="default" size="100%">G. Raidl</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Study into Ant Colony Optimization, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction Problems</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">ant colony optimisation</style></keyword><keyword><style  face="normal" font="default" size="100%">constraint programming</style></keyword><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">evolutionary computation</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><number><style face="normal" font="default" size="100%">3004</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">114--123</style></pages><isbn><style face="normal" font="default" size="100%">3-540-21367-8</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, so that it can actually compete with constraint programming.  The resampling ratio is used to provide insight into heuristic algorithms performances. Regarding efficiency, we show that if constraint programming is the fastest when instances have a low number of variables, ant colony optimisation becomes faster when increasing the number of variables.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Roure, David De</style></author><author><style face="normal" font="default" size="100%">Alistair Dunlop</style></author><author><style face="normal" font="default" size="100%">Fox, Geoffrey</style></author><author><style face="normal" font="default" size="100%">Henderson, Peter</style></author><author><style face="normal" font="default" size="100%">Tony Hey</style></author><author><style face="normal" font="default" size="100%">Norman Paton</style></author><author><style face="normal" font="default" size="100%">Newhouse, Steven</style></author><author><style face="normal" font="default" size="100%">Parastatidis, Savas</style></author><author><style face="normal" font="default" size="100%">Anne Trefethen</style></author><author><style face="normal" font="default" size="100%">Watson, Paul</style></author><author><style face="normal" font="default" size="100%">Webber, Jim</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Web Service Grids: An Evolutionary Approach</style></title><secondary-title><style face="normal" font="default" size="100%">UK e-Science Technical Report Series</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Web%20Service%20Grids%20-%20an%20evolutionary%20approach.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">The UK e-Science Programme is a £250M, 5 year initiative which has funded over 100 projects. These application-led projects are under-pinned by an emerging set of core middleware services that allow the coordinated, collaborative use of distributed resources. This set of middleware services runs on top of the research network and beneath the applications we call the ‘Grid’. Grid middleware is currently in transition from pre-Web Service versions to a new version based on Web Services. Unfortunately, only a very basic set of Web Services embodied in the Web Services Interoperability proposal, WS-I, are agreed by most IT companies. IBM and others have submitted proposals for Web Services for Grids - the Web Services ResourceFramework and Web Services Notification specifications - to the OASIS organisation for standardisation. This process could take up to 12 months from March 2004 and the specifications are subject to debate and potentially significant changes.

Since several significant UK e-Science projects come to an end before the end of this process, the UK therefore needs to develop a strategy that will protect the UK’s investment in Grid middleware by informing the Open Middleware Infrastructure Institute’s (OMII) roadmap and UK middleware repository in Southampton. This paper sets out an evolutionary roadmap that will allow us to capture generic middleware components from projects in a form that will facilitate migration or interoperability with the emerging Grid Web Services standards and with on-going OGSA developments. In this paper we therefore define a set of Web Services specifications - that we call ‘WS-I+’ to reflect the fact that this is a larger set than currently accepted by WS-I – that we believe will enable us to achieve the twin goals of capturing these components and facilitating migration to future standards. We believe that the extra Web Services specifications we have included in WS-I+ are both helpful in building e-Science Grids and likely to be widely accepted.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Craenen, B. G. W.</style></author><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems</style></title><secondary-title><style face="normal" font="default" size="100%">IEEE Transactions on Evolutionary Computation</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ieeexplore.ieee.org/xpl/abs_free.jsp?isNumber=27734&amp;prod=JNL&amp;arnumber=1237162&amp;arSt=+424&amp;ared=+444&amp;arAuthor=+Craenen%2C+B.G.W.%3B++Eiben%2C+A.E.%3B++van+Hemert%2C+J.I.&amp;arNumber=1237162&amp;a_id0=1237161&amp;a_id1=1237162&amp;a_id2=1237163&amp;a_id3=1237164&amp;a_id4=12</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">424--444</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Constraint handling is not straightforward in evolutionary algorithms (EA) since the usual search operators, mutation and recombination, are `blind' to constraints. Nevertheless, the issue is highly relevant, for many challenging problems involve constraints. Over the last decade numerous EAs for solving constraint satisfaction problems (CSP) have been introduced and studied on various problems. The diversity of approaches and the variety of problems used to study the resulting algorithms prevents a fair and accurate comparison of these algorithms. This paper aligns related work by presenting a concise overview and an extensive performance comparison of all these EAs on a systematically generated test suite of random binary CSPs. The random problem instance generator is based on a theoretical model that fixes deficiencies of models and respective generators that have been formerly used in the Evolutionary Computing (EC) field.</style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Crowcroft, J.</style></author><author><style face="normal" font="default" size="100%">Goble, C.</style></author><author><style face="normal" font="default" size="100%">Gurd, J.</style></author><author><style face="normal" font="default" size="100%">Rodden, T.</style></author><author><style face="normal" font="default" size="100%">Shadbolt, N.</style></author><author><style face="normal" font="default" size="100%">Sloman, M.</style></author><author><style face="normal" font="default" size="100%">Sommerville, I.</style></author><author><style face="normal" font="default" size="100%">Storey, T.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computer Challenges to emerge from e-Science. </style></title><secondary-title><style face="normal" font="default" size="100%">EPSRC</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Computer%20Challenges%20to%20Emerge%20from%20e-Science.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">The UK e-Science programme has initiated significant developments that allow networked grid technology to be used to form virtual colaboratories. The e-Science vision of a globally connected community has broader application than science with the same fundamental technologies being used to support eCommerce and e-Government. 

The broadest vision of e-Science outlines a challenging research agenda for the computing community. New theories and models will be needed to provide a sound foundation for the tools used to specify, design, analyse and prove the properties of future grid technologies and applications. Fundamental research is needed in order to build a future e-Science infrastructure and to understand how to exploit the infrastructure to best effect. 

A future infrastructure needs to be dynamic, universally available and promote trust. Realising this infrastructure will need new theories, methods and techniques to be developed and deployed. Although often not directly visible these fundamental infrastructure advances will provide the foundation for future scientific advancement, wealth generation and governance. 

• We need to move from the current data focus to a semantic grid with facilities for the generation, support and traceability of knowledge. 
• We need to make the infrastructure more available and more trusted by developing trusted ubiquitous systems. 
• We need to reduce the cost of development by enabling the rapid customised assembly of services. 
• We need to reduce the cost and complexity of managing the infrastructure by realising autonomic computing systems. 
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson. M.</style></author><author><style face="normal" font="default" size="100%">Chervenak, A. L.</style></author><author><style face="normal" font="default" size="100%">Kunszt, P.</style></author><author><style face="normal" font="default" size="100%">Narang, I.</style></author><author><style face="normal" font="default" size="100%">Paton, N. W.</style></author><author><style face="normal" font="default" size="100%">Pearson, D.</style></author><author><style face="normal" font="default" size="100%">Shoshani, A.</style></author><author><style face="normal" font="default" size="100%">Watson, P.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Foster, I.</style></author><author><style face="normal" font="default" size="100%">Kesselman, C</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Data Access, Integration, and Management</style></title><secondary-title><style face="normal" font="default" size="100%">The Grid 2: Blueprint for a New Computing Infrastructure (2nd edition),</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><edition><style face="normal" font="default" size="100%">2nd</style></edition><publisher><style face="normal" font="default" size="100%">Morgan Kaufmann</style></publisher><isbn><style face="normal" font="default" size="100%">1-55860-933-4</style></isbn></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Databases and the Grid: Who Challenges Whom?</style></title><secondary-title><style face="normal" font="default" size="100%">BNCOD</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><pages><style face="normal" font="default" size="100%">1-2</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Stuart Anderson</style></author><author><style face="normal" font="default" size="100%">Yin Chen</style></author><author><style face="normal" font="default" size="100%">Glen Dobson</style></author><author><style face="normal" font="default" size="100%">Stephen Hall</style></author><author><style face="normal" font="default" size="100%">Conrad Hughes</style></author><author><style face="normal" font="default" size="100%">Yong Li</style></author><author><style face="normal" font="default" size="100%">Sheng Qu</style></author><author><style face="normal" font="default" size="100%">Ed Smith</style></author><author><style face="normal" font="default" size="100%">Ian Sommerville</style></author><author><style face="normal" font="default" size="100%">Ma Tiejun</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Proceedings of UK e-Science All Hands Meeting 2003</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Dependable Grid Services</style></title><secondary-title><style face="normal" font="default" size="100%">UK e-Science All Hands Meeting 2003, 2-4th September, Nottingham, UK</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">02/09/2003</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/014.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">The provision of dependable computer systems by deploying diverse, redundant components
in order to mask or provide recovery from component failures has mostly been restricted to
systems with very high criticality. In this paper we present an architecture and prototype implementation of an approach to providing such redundancy at low cost in service-based infrastructures. In particular we consider services that are supplied by composing a number of component
services and consider how service discovery, automatic monitoring and failure detection have the
potential to create composed services that are more dependable than might be possible using a
straightforward approach. The work is still in its early stages and so far no evaluation of the
approach has been carried out.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ali Anjomshoaa</style></author><author><style face="normal" font="default" size="100%">Antonioletti, Mario</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author><author><style face="normal" font="default" size="100%">Rob Baxter</style></author><author><style face="normal" font="default" size="100%">Borley, Andrew</style></author><author><style face="normal" font="default" size="100%">Hong, Neil P. Chue</style></author><author><style face="normal" font="default" size="100%">Collins, Brian</style></author><author><style face="normal" font="default" size="100%">Hardman, Neil</style></author><author><style face="normal" font="default" size="100%">George Hicken</style></author><author><style face="normal" font="default" size="100%">Ally Hume</style></author><author><style face="normal" font="default" size="100%">Knox, Alan</style></author><author><style face="normal" font="default" size="100%">Mike Jackson</style></author><author><style face="normal" font="default" size="100%">Krause, Amrey</style></author><author><style face="normal" font="default" size="100%">Laws, Simon</style></author><author><style face="normal" font="default" size="100%">Magowan, James</style></author><author><style face="normal" font="default" size="100%">Charaka Palansuriya</style></author><author><style face="normal" font="default" size="100%">Paton, Norman W.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Design and Implementation of Grid Database Services in OGSA-DAI</style></title><secondary-title><style face="normal" font="default" size="100%">All Hands Meeting 2003</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">02/09/2003</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Design%20and%20Implementation%20of%20Grid%20Database%20Services%20in%20OGSA-DAI.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Nottingham, UK</style></pub-location><abstract><style face="normal" font="default" size="100%">This paper presents a high-level overview of the design and implementation of the core components of the OGSA-DAI project. It describes the design decisions made, the project’s interaction with the Data Access and Integration Working Group of the Global Grid Forum and provides an overview of implementation characteristics. Further details of the implementation are provided in the extensive documentation available from the project web site.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cong Suo</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The DWMM network traffic model</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Communication</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2003</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">43</style></section><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">43~48</style></pages><issue><style face="normal" font="default" size="100%">5</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolving binary constraint satisfaction problem instances that are difficult to solve</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the IEEE 2003 Congress on Evolutionary Computation</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">problem evolving</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE Press</style></publisher><pages><style face="normal" font="default" size="100%">1267--1273</style></pages><isbn><style face="normal" font="default" size="100%">0-7803-7804-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We present a study on the difficulty of solving binary constraint satisfaction problems where an evolutionary algorithm is used to explore the space of problem instances. By directly altering the structure of problem instances and by evaluating the effort it takes to solve them using a complete algorithm we show that the evolutionary algorithm is able to detect problem instances that are harder to solve than those produced with conventional methods. Results from the search of the evolutionary algorithm confirm conjectures about where the most difficult to solve problem instances can be found with respect to the tightness.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Antonioletti, Mario</style></author><author><style face="normal" font="default" size="100%">Neil Chue Hong</style></author><author><style face="normal" font="default" size="100%">Ally Hume</style></author><author><style face="normal" font="default" size="100%">Mike Jackson</style></author><author><style face="normal" font="default" size="100%">Krause, Amy</style></author><author><style face="normal" font="default" size="100%">Jeremy Nowell</style></author><author><style face="normal" font="default" size="100%">Charaka Palansuriya</style></author><author><style face="normal" font="default" size="100%">Tom Sugden</style></author><author><style face="normal" font="default" size="100%">Martin Westhead</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Experiences of Designing and Implementing Grid Database Services in the OGSA-DAI project</style></title><secondary-title><style face="normal" font="default" size="100%">Global Grid Forum Workshop on Designing and Building Grid Services/GGF9</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">08/10/2003</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Experiences%20of%20Designing%20and%20Implementing%20Grid%20Database%20Services%20in%20the%20OGSA-DAI%20Project.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Chicago, USA</style></pub-location><abstract><style face="normal" font="default" size="100%">This paper describes the experiences of the OGSA-DAI team in designing and building a database access layer using the OGSI and the emerging DAIS GGF recommendations. This middleware is designed for enabling other UK e-Science projects that require database access and providing the basic primitives for higher-level services such as Distributed Query Processing. OGSA-DAI also intends to produce one of the required reference implementations of the DAIS specification once this becomes a proposed recommendation and, until then, scope out their ideas, provide feedback as well as directly contributing to the GGF working group. This paper enumerates the issues that have arisen in tracking the DAIS and OGSI specifications whilst developing a software distribution using the Grid services model; trying to serve the needs of the various target communities; and using the Globus Toolkit OGSI core distribution. The OGSA-DAI software distribution and more details are available from the project web site at http://www.ogsadai.org.uk/.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author><author><style face="normal" font="default" size="100%">Dialani, V.</style></author><author><style face="normal" font="default" size="100%">Guy, L.</style></author><author><style face="normal" font="default" size="100%">Narang, I.</style></author><author><style face="normal" font="default" size="100%">Paton, N. W.</style></author><author><style face="normal" font="default" size="100%">Pearson, D.</style></author><author><style face="normal" font="default" size="100%">Storey, T.</style></author><author><style face="normal" font="default" size="100%">Watson, P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Grid Database Access and Integration: Requirements and Functionalities</style></title><secondary-title><style face="normal" font="default" size="100%">Global Grid Forum</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year><pub-dates><date><style  face="normal" font="default" size="100%">03/2003</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Grid%20Database%20Access%20and%20Integration%20-%20Requirements%20and%20Functionalities.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">This document is intended to provide the context for developing Grid data service standard recommendations within the Global Grid Forum. It defines the generic requirements for accessing and integrating persistent structured and semi-structured data. In addition, it defines the generic functionalities which a Grid data service needs to provide in supporting discovery of and controlled access to data, in performing data manipulation operations, and in virtualising data resources. The document also defines the scope of Grid data service standard recommendations which are presented in a separate document.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Juhos, I.</style></author><author><style face="normal" font="default" size="100%">Tóth, A.</style></author><author><style face="normal" font="default" size="100%">Tezuka, M.</style></author><author><style face="normal" font="default" size="100%">Tann, P.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A new permutation model for solving the graph k-coloring problem</style></title><secondary-title><style face="normal" font="default" size="100%">Kalmàr Workshop on Logic and Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">graph colouring</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><pages><style face="normal" font="default" size="100%">189--199</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper describes a novel representation and ordering model, that is aided by an evolutionary algorithm, is used in solving the graph k-coloring. A comparison is made between the new representation and an improved version of the traditional graph coloring technique DSATUR on an extensive list of graph k-coloring problem instances with different properties. The results show that our model outperforms the improved DSATUR on most of the problem instances.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Evans, Huw</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Brown, Margaret</style></author><author><style face="normal" font="default" size="100%">Cargill, Julie</style></author><author><style face="normal" font="default" size="100%">Crease, Murray</style></author><author><style face="normal" font="default" size="100%">Draper, Steve</style></author><author><style face="normal" font="default" size="100%">Gray, Philip D.</style></author><author><style face="normal" font="default" size="100%">Thomas, Richard</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The pervasiveness of evolution in GRUMPS software</style></title><secondary-title><style face="normal" font="default" size="100%">Softw., Pract. Exper.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">33</style></volume><pages><style face="normal" font="default" size="100%">99-120</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">F. Berman</style></author><author><style face="normal" font="default" size="100%">G. Fox</style></author><author><style face="normal" font="default" size="100%">T. Hey</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Rationale for Choosing the Open Grid Services Architecture</style></title><secondary-title><style face="normal" font="default" size="100%">Grid Computing: Making the Global Infrastructure a Reality</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><publisher><style face="normal" font="default" size="100%">John Wiley &amp; Sons, Ltd</style></publisher><pub-location><style face="normal" font="default" size="100%">Chichester, UK</style></pub-location><isbn><style face="normal" font="default" size="100%">9780470853191</style></isbn></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Application of the methodology combined formal method with Object-Oriented technology in E-commerce</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Computer Engineering</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">65</style></section><volume><style face="normal" font="default" size="100%">29</style></volume><pages><style face="normal" font="default" size="100%"> 65~67 </style></pages><issue><style face="normal" font="default" size="100%">z1</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">S. Cagnoni</style></author><author><style face="normal" font="default" size="100%">J. Gottlieb</style></author><author><style face="normal" font="default" size="100%">E. Hart</style></author><author><style face="normal" font="default" size="100%">M. Middendorf</style></author><author><style face="normal" font="default" size="100%">G. Raidl</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><number><style face="normal" font="default" size="100%">2279</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">81--90</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Constraint Satisfaction Problems form a class of problems that are generally computationally difficult and have been addressed with many complete and heuristic algorithms. We present two complete algorithms, as well as two evolutionary algorithms, and compare them on randomly generated instances of binary constraint satisfaction prob-lems. We find that the evolutionary algorithms are less effective than the classical techniques.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Baldock, R.</style></author><author><style face="normal" font="default" size="100%">Burger, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Criticality-Based Task Composition in Distributed Bioinformatics Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Twelfth International Conference on Intelligent Systems for Molecular Biology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Hunt, Ela</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Irving, Robert W.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Database indexing for large DNA and protein sequence collections</style></title><secondary-title><style face="normal" font="default" size="100%">VLDB J.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">11</style></volume><pages><style face="normal" font="default" size="100%">256-271</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Bäck, T.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J. J. Merelo</style></author><author><style face="normal" font="default" size="100%">A. Panagiotis</style></author><author><style face="normal" font="default" size="100%">H.-G. Beyer</style></author><author><style face="normal" font="default" size="100%">Jos{\'e}-Luis Fern{\'a}ndez-Villaca{\~n}as</style></author><author><style face="normal" font="default" size="100%">Hans-Paul Schwefel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Measuring the Searched Space to Guide Efficiency: The Principle and Evidence on Constraint Satisfaction</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">resampling ratio</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><number><style face="normal" font="default" size="100%">2439</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">23--32</style></pages><isbn><style face="normal" font="default" size="100%">3-540-44139-5</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we present a new tool to measure the efficiency of evolutionary algorithms by storing the whole searched space of a run, a process whereby we gain insight into the number of distinct points in the state space an algorithm has visited as opposed to the number of function evaluations done within the run. This investigation demonstrates a certain inefficiency of the classical mutation operator with mutation-rate 1/l, where l is the dimension of the state space. Furthermore we present a model for predicting this inefficiency and verify it empirically using the new tool on binary constraint satisfaction problems.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Burger, A.</style></author><author><style face="normal" font="default" size="100%">Baldock, R.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Multi-Agent Bioinformatics Integration System with Adjustable Autonomy: An Overview</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the First International Conference on Autonomous Agents and Multi-Agent Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pages><style face="normal" font="default" size="100%">302--303</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Burger, A.</style></author><author><style face="normal" font="default" size="100%">Baldock, R.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Multi-Agent Bioinformatics Integration System with Adjustable Autonomy</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><volume><style face="normal" font="default" size="100%">2417</style></volume><pages><style face="normal" font="default" size="100%">492--501</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">yan Liu</style></author><author><style face="normal" font="default" size="100%">Zhiwei Cen</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A network traffic model based on the cascade process</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Mini-Micro Computer System</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">1483</style></section><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">1483~1485</style></pages><issue><style face="normal" font="default" size="100%">12</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Zhiwei Ceng</style></author><author><style face="normal" font="default" size="100%">Chuanshan Gao</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A new multifractal network traffic model</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Chaos, solitons &amp; fractals </style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2002</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">1507</style></section><publisher><style face="normal" font="default" size="100%">Elsevier Science</style></publisher><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">1507~1513</style></pages><issue><style face="normal" font="default" size="100%">7</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Grim, R.</style></author><author><style face="normal" font="default" size="100%">Jansen, M. L. M.</style></author><author><style face="normal" font="default" size="100%">Baan, A.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">de Wolf, H.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Torben Anderson</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Use of Evolutionary Algorithms for Telescope Scheduling</style></title><secondary-title><style face="normal" font="default" size="100%">Integrated Modeling of Telescopes</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">scheduling</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><publisher><style face="normal" font="default" size="100%">The International Society for Optical Engineering ({SPIE})</style></publisher><volume><style face="normal" font="default" size="100%">4757</style></volume><pages><style face="normal" font="default" size="100%">51--61</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">LOFAR, a new radio telescope, will be designed to observe with up to 8 independent beams, thus allowing several simultaneous observations. Scheduling of multiple observations parallel in time, each having their own constraints, requires a more intelligent and flexible scheduling function then operated before.  
	  In support of the LOFAR radio telescope project, and in co-operation with Leiden University, Fokker Space has started a study to investigate the suitability of the use of evolutionary algorithms applied to complex scheduling problems. After a positive familiarisation phase, we now examine the potential use of evolutionary algorithms via a demonstration project. Results of the familiarisation phase, and the first results of the demonstration project are presented in this paper.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eggermont, J.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J. Miller</style></author><author><style face="normal" font="default" size="100%">Tomassini, M.</style></author><author><style face="normal" font="default" size="100%">P. L. Lanzi</style></author><author><style face="normal" font="default" size="100%">C. Ryan</style></author><author><style face="normal" font="default" size="100%">A. G. B. Tettamanzi</style></author><author><style face="normal" font="default" size="100%">W. B. Langdon</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><number><style face="normal" font="default" size="100%">2038</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">23--35</style></pages><isbn><style face="normal" font="default" size="100%">9-783540-418993</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we continue our study on adaptive genetic pro-gramming. We use Stepwise Adaptation of Weights to boost performance of a genetic programming algorithm on simple symbolic regression problems. We measure the performance of a standard GP and two variants of SAW extensions on two different symbolic regression prob-lems from literature. Also, we propose a model for randomly generating polynomials which we then use to further test all three GP variants.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">Cong Suo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The characterizing network traffic based on the wavelet technique</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Mini-Micro Computer System</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year><pub-dates><date><style  face="normal" font="default" size="100%">2001</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">1110</style></section><volume><style face="normal" font="default" size="100%">22</style></volume><pages><style face="normal" font="default" size="100%">1110~ 1114</style></pages><issue><style face="normal" font="default" size="100%">9</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Hunt, Ela</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Irving, Robert W.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Database Index to Large Biological Sequences</style></title><secondary-title><style face="normal" font="default" size="100%">VLDB</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><pages><style face="normal" font="default" size="100%">139-148</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Printezis, Tony</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An efficient object promotion algorithm for persistent object systems</style></title><secondary-title><style face="normal" font="default" size="100%">Softw., Pract. Exper.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><number><style face="normal" font="default" size="100%">10</style></number><volume><style face="normal" font="default" size="100%">31</style></volume><pages><style face="normal" font="default" size="100%">941-981</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Jansen, M. L. M.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Lee Spector</style></author><author><style face="normal" font="default" size="100%">Erik D. Goodman</style></author><author><style face="normal" font="default" size="100%">Annie Wu</style></author><author><style face="normal" font="default" size="100%">W. B. Langdon</style></author><author><style face="normal" font="default" size="100%">Hans-Michael Voigt</style></author><author><style face="normal" font="default" size="100%">Mitsuo Gen</style></author><author><style face="normal" font="default" size="100%">Sandip Sen</style></author><author><style face="normal" font="default" size="100%">Marco Dorigo</style></author><author><style face="normal" font="default" size="100%">Shahram Pezeshk</style></author><author><style face="normal" font="default" size="100%">Max H. Garzon</style></author><author><style face="normal" font="default" size="100%">Edmund Burke</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An Engineering Approach to Evolutionary Art</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary art</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><publisher><style face="normal" font="default" size="100%">Morgan Kaufmann Publishers, San Francisco</style></publisher><pages><style face="normal" font="default" size="100%">177</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We present a general system that evolves art on the Internet. The system runs on a server which enables it to collect information about its usage world wide; its core uses operators and representations from genetic program-ming. We show two types of art that can be evolved using this general system.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Anne Defaweux</style></author><author><style face="normal" font="default" size="100%">Bernard Manderick</style></author><author><style face="normal" font="default" size="100%">Tom Lenearts</style></author><author><style face="normal" font="default" size="100%">Johan Parent</style></author><author><style face="normal" font="default" size="100%">Piet van Remortel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary Computation in Constraint Satisfaction and Machine Learning --- An abstract of my PhD.</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Brussels Evolutionary Algorithms Day (BEAD-2001)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><publisher><style face="normal" font="default" size="100%">Vrije Universiteit Brussel (VUB)</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Van Hoyweghen, C.</style></author><author><style face="normal" font="default" size="100%">Lukschandl, E.</style></author><author><style face="normal" font="default" size="100%">Verbeeck, K.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">J. Branke</style></author><author><style face="normal" font="default" size="100%">Th. B{\&quot;a}ck</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A ``Futurist'' approach to dynamic environments</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Workshops at the Genetic and Evolutionary Computation Conference, Dynamic Optimization Problems</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">dynamic problems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><publisher><style face="normal" font="default" size="100%">Morgan Kaufmann Publishers, San Francisco</style></publisher><pages><style face="normal" font="default" size="100%">35--38</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">The optimization of dynamic environments has proved to be a difficult area for Evolutionary Algorithms. As standard haploid populations find it difficult to track a moving target, diffKerent schemes have been suggested to improve the situation. We study a novel approach by making use of a meta learner which tries to predict the next state of the environment, i.e. the next value of the goal the individuals have to achieve, by making use of the accumulated knowledge from past performance.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Evans, Huw</style></author><author><style face="normal" font="default" size="100%">Peter Dickman</style></author><author><style face="normal" font="default" size="100%">Malcolm Atkinson</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The GRUMPS Architecture: Run-time Evolution in a Large Scale Distributed System</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Workshop on Engineering Complex Object-Oriented Solutions for Evolution (ECOOSE), held as part of OOPSLA 2001.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/The%20Grumps%20Architecture%20-%20Run-time%20Evolution%20in%20a%20Large%20Scale%20Distributed%20System.pdf</style></url></related-urls></urls><abstract><style face="normal" font="default" size="100%">This paper describes the first version of the distributed programming architecture for the Grumps1 project. The architecture consists of objects that communicate in terms of both asynchronous and synchronous events. A novel three-level extensible naming scheme is discussed that allows Grumps developers to deploy systems that can refer to entities not identified at the time when the Grumps system and application-level code were implemented. Examples detailing how the topology of a Grumps system may be changed at run-time and how new object implementations may be distributed during system execution are given. The separation of policy from mechanism is shown to be a major part of how system evolution is supported and this is made even more flexible when expressed through the use of Java interfaces for crucial core concepts.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author><author><style face="normal" font="default" size="100%">Brown, M.</style></author><author><style face="normal" font="default" size="100%">Cargill, J.</style></author><author><style face="normal" font="default" size="100%">Crease, M.</style></author><author><style face="normal" font="default" size="100%">Draper, S.</style></author><author><style face="normal" font="default" size="100%">Evans, H.</style></author><author><style face="normal" font="default" size="100%">Gray, P.</style></author><author><style face="normal" font="default" size="100%">Mitchell, C.</style></author><author><style face="normal" font="default" size="100%">Ritchie, M.</style></author><author><style face="normal" font="default" size="100%">Thomas, R.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GRUMPS Summer Anthology, 2001</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/GRUMPS%20Summer%20Anthology%202001.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Academic Press</style></publisher><abstract><style face="normal" font="default" size="100%">This is the first collection of papers from GRUMPS [http://grumps.dcs.gla.ac.uk]. The project only started up in February 2001, and this collection (frozen at 1 Sept 2001) shows that it got off to a productive start. Versions of some of these papers have been submitted to conferences and workshops: the website will have more information on publication status and history.
GRUMPS decided to begin with a first study, partly to help the team coalesce. This involved installing two pieces of software in a first year computing science lab: one (the &quot;UAR&quot;) to record a large volume of student actions at a low level with a view to mining them later, another (the &quot;LSS&quot;) directly designed to assist tutor-student interaction. Some of the papers derive from that, although more are planned. Results from this first study can be found on the website. The project also has a link to UWA in Perth, Western Australia, where related software has already been developed and used as described in one of the papers. Another project strand concerns using handsets in lecture theatres to support interactivity there, as two other papers describe. As yet unrepresented in this collection, GRUMPS will also be entering the bioinformatics application area.

The GRUMPS project operates on several levels. It is based in the field of Distributed Information Management (DIM), expecting to cover both mobile and static nodes, synchronous and detached clients, high and low volume data sources. The specific focus of the project (see the original proposal on the web site) is to address records of computational activity (where any such pre-existing usage might have extra record collection installed) and data experimentation, where the questions to be asked of the data emerge concurrently with data collection which will therefore be dynamically modifiable: a requirement that further pushes on the space of DIM. The level above concerns building and making usable tools for asking questions of the data, or rather of the activities that generate the data. Above that again is the application domain level: what the original computational activities serve, education and bioinformatics being two identified cases.  The GRUMPS team is therefore multidisciplinary, from DIM architecture researchers to educational evaluators. The mix of papers reflects this.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Chuanshan Gao</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A new multifractal traffic model based on the wavelet transform</style></title><secondary-title><style face="normal" font="default" size="100%">ISCA 14th International Conference on Parallel and Distributed Computing systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year><pub-dates><date><style  face="normal" font="default" size="100%">8th Aug,2001</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">Texas, USA</style></pub-location><pages><style face="normal" font="default" size="100%">157-162</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Klaus Dittrich</style></author><author><style face="normal" font="default" size="100%">Giovanna Guerrini</style></author><author><style face="normal" font="default" size="100%">Isabella Merlo</style></author><author><style face="normal" font="default" size="100%">Marta Oliva</style></author><author><style face="normal" font="default" size="100%">M. Elena Rodriguez</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Persistence and Java — A Balancing Act </style></title><secondary-title><style face="normal" font="default" size="100%">Objects and Databases</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/8t7x3m1ehtdqk4bm/?p=7ece1338fff3480b83520df395784cc6&amp;pi=0</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">1944</style></volume><pages><style face="normal" font="default" size="100%">1-31</style></pages><abstract><style face="normal" font="default" size="100%">Large scale and long-lived application systems, enterprise applications, require persistence, that is provision of storage for many of their data structures. The JavaTM programming language is a typical example of a strongly-typed, object-oriented programming language that is becoming popular for building enterprise applications. It therefore needs persistence. The present options for obtaining this persistence are reviewed. We conclude that the Orthogonal Persistence Hypothesis, OPH, is still persuasive. It states that the universal and automated provision of longevity or brevity for all data will significantly enhance developer productivity and improve applications. This position paper reports on the PJama project with particular reference to its test of the OPH. We review why orthogonal persistence has not been taken up widely, and why the OPH is still incompletely tested. This leads to a more general challenge of how to conduct experiments which reveal large-scale and long-term effects and some thoughts on how that challenge might be addressed by the software research community. </style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, M. P.</style></author><author><style face="normal" font="default" size="100%">Dmitriev, M. A.</style></author><author><style face="normal" font="default" size="100%">Hamilton, C.</style></author><author><style face="normal" font="default" size="100%">Printezis, T.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Graham N. C.</style></author><author><style face="normal" font="default" size="100%">Kirby, Alan Dearle</style></author><author><style face="normal" font="default" size="100%">Dag I. K. Sjøberg</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Scalable and Recoverable Implementation of Object Evolution for the PJama1 Platform </style></title><secondary-title><style face="normal" font="default" size="100%">Persistent Object Systems: Design, Implementation, and Use 9th International Workshop, POS-9 Lillehammer, Norway, September 6–8, 2000 Revised Papers</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/content/09hx07h9lw0p1h82/?p=2bc20319905146bab8ba93b2fcc8cc01&amp;pi=23</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://research.nesc.ac.uk/files/Scalable%20and%20Recoverable%20Implementation%20of%20Object%20Evolution%20for%20the%20PJama%20Platform.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">2135</style></volume><pages><style face="normal" font="default" size="100%">292-314,</style></pages><abstract><style face="normal" font="default" size="100%">PJama1 is the latest version of an orthogonally persistent platform for Java. It depends on a new persistent object store, Sphere, and provides facilities for class evolution. This evolution technology supports an arbitrary set of changes to the classes, which may have arbitrarily large populations of persistent objects. We verify that the changes are safe. When there are format changes, we also convert all of the instances, while leaving their identities unchanged. We aspire to both very large persistent object stores and freedom for developers to specify arbitrary conversion methods in Java to convey information from old to new formats.

Evolution operations must be safe and the evolution cost should be approximately linear in the number of objects that must be reformatted. In order that these conversion methods can be written easily, we continue to present the pre-evolution state consistently to Java executions throughout an evolution. At the completion of applying all of these transformations, we must switch the store state to present only the post-evolution state, with object identity preserved. We present an algorithm that meets these requirements for eager, total conversion.

This paper focuses on the mechanisms built into Sphere to support safe, atomic and scalable evolution. We report our experiences in using this technology and include a preliminary set of performance measurements.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">van den Bosch, A.</style></author><author><style face="normal" font="default" size="100%">H. Weigand</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Constraint Satisfaction Problems and Evolutionary Algorithms: A Reality Check</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Twelfth Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'00)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><publisher><style face="normal" font="default" size="100%">BNVKI, Dutch and the Belgian AI Association</style></publisher><pages><style face="normal" font="default" size="100%">267--274</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Constraint satisfaction has been the subject of many studies. Different areas of research have tried to solve all kind of constraint problems. Here we will look at a general model for constraint satisfaction problems in the form of binary constraint satisfaction. The problems generated from this model are studied in the research area of constraint programming and in the research area of evolutionary computation. This paper provides an empirical comparison of two techniques from each area. Basically, this is a check on how well both areas are doing. It turns out that, although evolutionary algorithms are doing well, classic approaches are still more successful.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">De Creatieve Computer</style></title><secondary-title><style face="normal" font="default" size="100%">AIgg Kennisgeving</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary art</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><publisher><style face="normal" font="default" size="100%">Artifici{\&quot;e}le Intelligentie gebruikers groep</style></publisher><volume><style face="normal" font="default" size="100%">13</style></volume><pages><style face="normal" font="default" size="100%">10--18</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Here we show an application that generates images resembling art as it was produced by Mondriaan, a Dutch artist, well known for his minimalistic and pure abstract pieces of art. The current version generates images using a linear chromosome and a recursive function as a decoder.</style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type><notes><style face="normal" font="default" size="100%">invited article (in Dutch)</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Guest editorial</style></title><secondary-title><style face="normal" font="default" size="100%">VLDB J.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">175-176</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karasavvas, K.</style></author><author><style face="normal" font="default" size="100%">Baldock, R.</style></author><author><style face="normal" font="default" size="100%">Burger, A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Managing Transparency in Distributed Bioinformatics Systems</style></title><secondary-title><style face="normal" font="default" size="100%">European Media Lab Workshop on Management and Integration of Biochemical Data</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">cen, Z</style></author><author><style face="normal" font="default" size="100%">Gao, C</style></author><author><style face="normal" font="default" size="100%">Cong S</style></author><author><style face="normal" font="default" size="100%">Han, L</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Measurement and analysis of IP network traffic</style></title><secondary-title><style face="normal" font="default" size="100%">In Proceedings of the 3th International Asia-Pacific Web Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year><pub-dates><date><style  face="normal" font="default" size="100%">Oct.27-29</style></date></pub-dates></dates><pub-location><style face="normal" font="default" size="100%">xi'an China </style></pub-location><pages><style face="normal" font="default" size="100%">46~50</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Persistence and Java - A Balancing Act</style></title><secondary-title><style face="normal" font="default" size="100%">Objects and Databases</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><pages><style face="normal" font="default" size="100%">1-31</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Dmitriev, Misha</style></author><author><style face="normal" font="default" size="100%">Hamilton, Craig</style></author><author><style face="normal" font="default" size="100%">Printezis, Tony</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Scalable and Recoverable Implementation of Object Evolution for the PJama1 Platform</style></title><secondary-title><style face="normal" font="default" size="100%">POS</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><pages><style face="normal" font="default" size="100%">292-314</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eggermont, J.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">van den Bosch, A.</style></author><author><style face="normal" font="default" size="100%">H. Weigand</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Stepwise Adaptation of Weights for Symbolic Regression with Genetic Programming</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Twelfth Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'00)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">genetic programming</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><publisher><style face="normal" font="default" size="100%">BNVKI, Dutch and the Belgian AI Association</style></publisher><pages><style face="normal" font="default" size="100%">259--266</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we continue study on the Stepwise Adaptation of Weights (SAW) technique. Previous studies on constraint satisfaction and data clas-sification have indicated that SAW is a promising technique to boost the performance of evolutionary algorithms. Here we use SAW to boost per-formance of a genetic programming algorithm on simple symbolic regression problems. We measure the performance of a standard GP and two variants of SAW extensions on two different symbolic regression problems.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eggermont, J.</style></author><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">R. Poli</style></author><author><style face="normal" font="default" size="100%">P. Nordin</style></author><author><style face="normal" font="default" size="100%">W. B. Langdon</style></author><author><style face="normal" font="default" size="100%">T. C. Fogarty</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Adapting the Fitness Function in GP for Data Mining</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">genetic programming</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><number><style face="normal" font="default" size="100%">1598</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">195--204</style></pages><isbn><style face="normal" font="default" size="100%">3-540-65899-8</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we describe how the Stepwise Adaptation of Weights (SAW) technique can be applied in genetic programming. The SAW-ing mechanism has been originally developed for and successfully used in EAs for constraint satisfaction problems. Here we identify the very basic underlying ideas behind SAW-ing and point out how it can be used for different types of problems. In particular, SAW-ing is well suited for data mining tasks where the fitness of a candidate solution is composed by `local scores' on data records. We evaluate the power of the SAW-ing mechanism on a number of benchmark classification data sets. The results indicate that extending the GP with the SAW-ing feature increases its performance when different types of misclassifications are not weighted differently, but leads to worse results when they are.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eggermont, J.</style></author><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">E. Postma</style></author><author><style face="normal" font="default" size="100%">M. Gyssens</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Comparing genetic programming variants for data classification</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Eleventh Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'99)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">classification</style></keyword><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">genetic programming</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><publisher><style face="normal" font="default" size="100%">BNVKI, Dutch and the Belgian AI Association</style></publisher><pages><style face="normal" font="default" size="100%">253--254</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This article is a combined summary of two papers written by the authors.  Binary data classification problems (with exactly two disjoint classes) form an important application area of machine learning techniques, in particular genetic programming (GP). In this study we compare a number of different variants of GP applied to such problems whereby we investigate the effect of two significant changes in a fixed GP setup in combination with two different evolutionary models</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eggermont, J.</style></author><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">D. J. Hand</style></author><author><style face="normal" font="default" size="100%">J. N. Kok</style></author><author><style face="normal" font="default" size="100%">M. R. Berthold</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A comparison of genetic programming variants for data classification</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">classification</style></keyword><keyword><style  face="normal" font="default" size="100%">data mining</style></keyword><keyword><style  face="normal" font="default" size="100%">genetic programming</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><number><style face="normal" font="default" size="100%">1642</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">281--290</style></pages><isbn><style face="normal" font="default" size="100%">3-540-66332-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper we report the results of a comparative study on different variations of genetic programming applied on binary data classification problems. The first genetic programming variant is weighting data records for calculating the classification error and modifying the weights during the run. Hereby the algorithm is defining its own fitness function in an on-line fashion giving higher weights to `hard' records. Another novel feature we study is the atomic representation, where `Booleanization' of data is not performed at the root, but at the leafs of the trees and only Boolean functions are used in the trees' body.  As a third aspect we look at generational and steady-state models in combination of both features.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Printezis, Tony</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Jordan, Mick J.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Defining and Handling Transient Fields in PJama</style></title><secondary-title><style face="normal" font="default" size="100%">DBPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">129-151</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dmitriev, Misha</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary Data Conversion in the PJama Persistent Language</style></title><secondary-title><style face="normal" font="default" size="100%">ECOOP Workshop on Object-Oriented Databases</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">25-36</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Dmitriev, Misha</style></author><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Evolutionary Data Conversion in the PJama Persistent Language</style></title><secondary-title><style face="normal" font="default" size="100%">ECOOP Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">211-212</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Jordan, Mick J.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java</style></title><secondary-title><style face="normal" font="default" size="100%">ICDT</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><pages><style face="normal" font="default" size="100%">1-30</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">E. Postma</style></author><author><style face="normal" font="default" size="100%">M. Gyssens</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Mondriaan Art by Evolution</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Eleventh Belgium/Netherlands Conference on Artificial Intelligence (BNAIC'99)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">evolutionary art</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><publisher><style face="normal" font="default" size="100%">BNVKI, Dutch and the Belgian AI Association</style></publisher><pages><style face="normal" font="default" size="100%">291--292</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Here we show an application that generates images resembling art as it was produced by Mondriaan, a Dutch artist, well known for his minimalistic and pure abstract pieces of art. The current version generates images using a linear chromosome and a recursive function as a decoder.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lianghao Han</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author><author><style face="normal" font="default" size="100%">zengdian Liu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Neural network applied to the prediction of the failure stress for pressurized cylinders containing defects</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Pressure Vessels and Piping</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1999</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">215</style></section><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><volume><style face="normal" font="default" size="100%">76</style></volume><pages><style face="normal" font="default" size="100%">pp 215~219</style></pages><issue><style face="normal" font="default" size="100%">4</style></issue></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">Elia, D.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">W. Banzhaf</style></author><author><style face="normal" font="default" size="100%">J. Daida</style></author><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">M. H. Garzon</style></author><author><style face="normal" font="default" size="100%">V. Honavar</style></author><author><style face="normal" font="default" size="100%">M. Jakiela</style></author><author><style face="normal" font="default" size="100%">R. E. Smith</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Population dynamics and emerging features in AEGIS</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Genetic and Evolutionary Computation Conference</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">dynamic problems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><publisher><style face="normal" font="default" size="100%">Morgan Kaufmann Publishers, San Francisco</style></publisher><pages><style face="normal" font="default" size="100%">1257--1264</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We describe an empirical investigation within an artificial world, aegis, where a population of animals and plants is evolving. We compare different system setups in search of an `ideal' world that allows a constantly high number of inhabitants for a long period of time. We observe that high responsiveness at individual level (speed of movement) or population level (high fertility) are `ideal'.  Furthermore, we investigate the emergence of the so-called mental features of animals determining their social, consumptional and aggressive behaviour. The tests show that being socially oriented is generally advantageous, while agressive behaviour only emerges under specific circumstances.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Questions considered in object-oriented software quality metrics based on Java environment</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of East China University of Science and Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1999</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">85</style></section><publisher><style face="normal" font="default" size="100%">East China University of Science and Technology</style></publisher><pages><style face="normal" font="default" size="100%">pp 85~87</style></pages></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">D. Corne</style></author><author><style face="normal" font="default" size="100%">M. Dorigo</style></author><author><style face="normal" font="default" size="100%">F. Glover</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">SAW-ing EAs: adapting the fitness function for solving constrained problems</style></title><secondary-title><style face="normal" font="default" size="100%">New ideas in optimization</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><section><style face="normal" font="default" size="100%">26</style></section><publisher><style face="normal" font="default" size="100%">McGraw-Hill, London</style></publisher><pages><style face="normal" font="default" size="100%">389--402</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this chapter we describe a problem independent method for treating constrain ts in an evolutionary algorithm. Technically, this method amounts to changing the defini tion of the fitness function during a run of an EA, based on feedback from the search pr ocess. Obviously, redefining the fitness function means redefining the problem to be sol ved. On the short term this deceives the algorithm making the fitness values deteriorate , but as experiments clearly indicate, on the long run it is beneficial. We illustrate t he power of the method on different constraint satisfaction problems and point out other application areas of this technique.</style></abstract><work-type><style face="normal" font="default" size="100%">incollection</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Maria E. Orlowska</style></author><author><style face="normal" font="default" size="100%">Patrick Valduriez</style></author><author><style face="normal" font="default" size="100%">Stanley B. Zdonik</style></author><author><style face="normal" font="default" size="100%">Michael L. Brodie</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Atkinson, Malcolm P.</style></author><author><style face="normal" font="default" size="100%">Maria E. Orlowska</style></author><author><style face="normal" font="default" size="100%">Patrick Valduriez</style></author><author><style face="normal" font="default" size="100%">Stanley B. Zdonik</style></author><author><style face="normal" font="default" size="100%">Michael L. Brodie</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">VLDB'99, Proceedings of 25th International Conference on Very Large Data Bases, September 7-10, 1999, Edinburgh, Scotland, UK</style></title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><publisher><style face="normal" font="default" size="100%">Morgan Kaufmann</style></publisher><isbn><style face="normal" font="default" size="100%">1-55860-615-7</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">proceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Marchiori, E.</style></author><author><style face="normal" font="default" size="100%">Steenbeek, A. G.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">la Poutré, J. A.</style></author><author><style face="normal" font="default" size="100%">van den Herik, J.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Extended abstract: Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Xth Netherlands/Belgium Conference on Artificial Intelligence (NAIC'98)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1998</style></year></dates><publisher><style face="normal" font="default" size="100%">BNVKI, Dutch and the Belgian AI Association</style></publisher><pages><style face="normal" font="default" size="100%">299--301</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type><notes><style face="normal" font="default" size="100%">Abstract of \cite{EHMS98}</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">van der Hauw, J. K.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Graph Coloring with Adaptive Evolutionary Algorithms</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Heuristics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword><keyword><style  face="normal" font="default" size="100%">graph colouring</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1998</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><publisher><style face="normal" font="default" size="100%">Kluwer Academic Publishers</style></publisher><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">25--46</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EA). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the fitness function during the evolution.  This adaptive EA is general, using no domain specific knowledge, except, of course, from the decoder (fitness function). We compare this adaptive EA to a powerful traditional graph coloring technique DSatur and the Grouping GA on a wide range of problem instances with different size, topology and edge density. The results show that the adaptive EA is superior to the Grouping GA and outperforms DSatur on the hardest problem instances. Furthermore, it scales up better with the problem size than the other two algorithms and indicates a linear computational complexity.</style></abstract><work-type><style face="normal" font="default" size="100%">article</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">van Hemert, J. I.</style></author><author><style face="normal" font="default" size="100%">Marchiori, E.</style></author><author><style face="normal" font="default" size="100%">Steenbeek, A. G.</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Eiben, A. E.</style></author><author><style face="normal" font="default" size="100%">Th. B{\&quot;a}ck</style></author><author><style face="normal" font="default" size="100%">M. Schoenauer</style></author><author><style face="normal" font="default" size="100%">H.-P. Schwefel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Solving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function</style></title><secondary-title><style face="normal" font="default" size="100%">Springer Lecture Notes on Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">constraint satisfaction</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">1998</style></year></dates><number><style face="normal" font="default" size="100%">1498</style></number><publisher><style face="normal" font="default" size="100%">Springer-Verlag, Berlin</style></publisher><pages><style face="normal" font="default" size="100%">196--205</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of constraint violations and the penalties are adapted during the execution. Three different EAs based on this approach are implemented. For highly connected constraint networks, the results provide further empirical support to the theoretical prediction of the phase transition in binary CSPs.</style></abstract><work-type><style face="normal" font="default" size="100%">inproceedings</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Wang, Y.</style></author><author><style face="normal" font="default" size="100%">Liangxiu Han</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On Zero-symmetric BZ-algebras</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of East China University of Science and Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1997</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1997</style></date></pub-dates></dates><section><style face="normal" font="default" size="100%">755</style></section><publisher><style face="normal" font="default" size="100%">East China University of Science and Technology</style></publisher><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">pp 755~761</style></pages><issue><style face="normal" font="default" size="100%">6</style></issue></record></records></xml>