TY - CONF T1 - A databank, rather than statistical, model of normal ageing brain structure to indicate pathology T2 - OHBM 2012 Y1 - 2012 A1 - Dickie, David Alexander A1 - Dominic Job A1 - Rodríguez, David A1 - Shenkin, Susan A1 - Wardlaw, Joanna JF - OHBM 2012 UR - http://ww4.aievolution.com/hbm1201/index.cfm?do=abs.viewAbs&abs=5102 ER - TY - CHAP T1 - Multi-agent Negotiation of Virtual Machine Migration Using the Lightweight Coordination Calculus T2 - Agent and Multi-Agent Systems. Technologies and Applications Y1 - 2012 A1 - Anderson, Paul A1 - Shahriar Bijani A1 - Vichos, Alexandros ED - Jezic, Gordan ED - Kusek, Mario ED - Nguyen, Ngoc-Thanh ED - Howlett, Robert ED - Jain, Lakhmi JF - Agent and Multi-Agent Systems. Technologies and Applications T3 - Lecture Notes in Computer Science PB - Springer Berlin / Heidelberg VL - 7327 SN - 978-3-642-30946-5 UR - http://dx.doi.org/10.1007/978-3-642-30947-2_16 ER - TY - JOUR T1 - Searching in peer-to-peer networks JF - Computer Science Review (Elsevier) Y1 - 2012 A1 - I.A. Klampanos A1 - J.M. Jose UR - http://www.sciencedirect.com/science/article/pii/S1574013712000238 ER - TY - JOUR T1 - A Single Sign-On Infrastructure for Science Gateways on a Use Case for Structural Bioinformatics JF - Journal of Grid Computing Y1 - 2012 A1 - Gesing, Sandra A1 - Grunzke, Richard A1 - Krüger, Jens A1 - Birkenheuer, Georg A1 - Wewior, Martin A1 - Schäfer, Patrick A1 - Schuller, Bernd A1 - Schuster, Johannes A1 - Herres-Pawlis, Sonja A1 - Breuers, Sebastian A1 - Balaskó, Ákos A1 - Kozlovszky, Miklos A1 - Fabri, AnnaSzikszay A1 - Packschies, Lars A1 - Kacsuk, Peter A1 - Blunk, Dirk A1 - Steinke, Thomas A1 - Brinkmann, André A1 - Fels, Gregor A1 - Müller-Pfefferkorn, Ralph A1 - Jäkel, René A1 - Kohlbacher, Oliver KW - DCIs KW - Science gateway KW - security KW - Single sign-on KW - Structural bioinformatics VL - 10 UR - http://dx.doi.org/10.1007/s10723-012-9247-y ER - TY - CONF T1 - Workflow-enhanced conformational analysis of guanidine zinc complexes via a science gateway T2 - HealthGrid Applications and Technologies Meet Science Gateways for Life Sciences Y1 - 2012 A1 - Herres-Pawlis, Sonja A1 - Birkenheuer, Georg A1 - Brinkmann, André A1 - Gesing, Sandra A1 - Grunzke, Richard A1 - Jäkel, René A1 - Kohlbacher, Oliver A1 - Krüger, Jens A1 - Dos Santos Vieira, Ines JF - HealthGrid Applications and Technologies Meet Science Gateways for Life Sciences PB - IOS Press ER - TY - JOUR T1 - Managing dynamic enterprise and urgent workloads on clouds using layered queuing and historical performance models JF - Simulation Modelling Practice and Theory Y1 - 2011 A1 - David A. Bacigalupo A1 - van Hemert, Jano I. A1 - Xiaoyu Chen A1 - Asif Usmani A1 - Adam P. Chester A1 - Ligang He A1 - Donna N. Dillenberger A1 - Gary B. Wills A1 - Lester Gilbert A1 - Stephen A. Jarvis KW - e-Science AB - 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. VL - 19 ER - TY - CONF T1 - RapidBrain: Developing a Portal for Brain Research Imaging T2 - All Hands Meeting 2011, York Y1 - 2011 A1 - Kenton D'Mellow A1 - Rodríguez, David A1 - Carpenter, Trevor A1 - Jos Koetsier A1 - Dominic Job A1 - van Hemert, Jano A1 - Wardlaw, Joanna A1 - Fan Zhu AB - 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 JF - All Hands Meeting 2011, York CY - York ER - TY - RPRT T1 - Data-Intensive Research Workshop (15-19 March 2010) Report Y1 - 2010 A1 - Malcolm Atkinson A1 - Roure, David De A1 - van Hemert, Jano A1 - Shantenu Jha A1 - Ruth McNally A1 - Robert Mann A1 - Stratis Viglas A1 - Chris Williams KW - Data-intensive Computing KW - Data-Intensive Machines KW - Machine Learning KW - Scientific Databases AB - 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 "What is DIR?" and "Why it is important?'". We then review the status of the field, report what the workshop achieved and what remains as open questions. JF - National e-Science Centre PB - Data-Intensive Research Group, School of Informatics, University of Edinburgh CY - Edinburgh ER - TY - JOUR T1 - Integrating distributed data sources with OGSA--DAI DQP and Views JF - Philosophical Transactions A Y1 - 2010 A1 - Dobrzelecki, B. A1 - Krause, A. A1 - Hume, A. C. A1 - Grant, A. A1 - Antonioletti, M. A1 - Alemu, T. Y. A1 - Atkinson, M. A1 - Jackson, M. A1 - Theocharopoulos, E. AB - 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. VL - 368 ER - TY - CONF T1 - Resource management of enterprise cloud systems using layered queuing and historical performance models T2 - IEEE International Symposium on Parallel Distributed Processing Y1 - 2010 A1 - Bacigalupo, D. A. A1 - van Hemert, J. A1 - Usmani, A. A1 - Dillenberger, D. N. A1 - Wills, G. B. A1 - Jarvis, S. A. KW - e-Science AB - 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. JF - IEEE International Symposium on Parallel Distributed Processing ER - TY - RPRT T1 - ADMIRE D1.5 – Report defining an iteration of the model and language: PM3 and DL3 Y1 - 2009 A1 - Peter Brezany A1 - Ivan Janciak A1 - Alexander Woehrer A1 - Carlos Buil Aranda A1 - Malcolm Atkinson A1 - van Hemert, Jano AB - 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 PB - ADMIRE project UR - http://www.admire-project.eu/docs/ADMIRE-D1.5-model-language-ontology.pdf ER - TY - CONF T1 - Advanced Data Mining and Integration Research for Europe T2 - All Hands Meeting 2009 Y1 - 2009 A1 - Atkinson, M. A1 - Brezany, P. A1 - Corcho, O. A1 - Han, L A1 - van Hemert, J. A1 - Hluchy, L. A1 - Hume, A. A1 - Janciak, I. A1 - Krause, A. A1 - Snelling, D. A1 - Wöhrer, A. AB - 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 dicult. Every business, organisation and government faces problems that can only be addressed successfully if we improve our techniques for exploiting the data we gather. JF - All Hands Meeting 2009 CY - Oxford ER - TY - JOUR T1 - A Strategy for Research and Innovation in the Century of Information JF - Prometheus Y1 - 2009 A1 - e-Science Directors’ Forum Strategy Working Group A1 - Atkinson, M. A1 - Britton, D. A1 - Coveney, P. A1 - De Roure, D A1 - Garnett, N. A1 - Geddes, N. A1 - Gurney, R. A1 - Haines, K. A1 - Hughes, L. A1 - Ingram, D. A1 - Jeffreys, P. A1 - Lyon, L. A1 - Osborne, I. A1 - Perrott, P. A1 - Procter. R. A1 - Rusbridge, C. AB - 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 & 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. VL - 27 ER - TY - CONF T1 - Using Simulation for Decision Support: Lessons Learned from FireGrid T2 - Proceedings of the 6th International Conference on Information Systems for Crisis Response and Management (ISCRAM 2009) Y1 - 2009 A1 - Gerhard Wickler A1 - George Beckett A1 - Liangxiu Han A1 - Sung Han Koo A1 - Stephen Potter A1 - Gavin Pringle A1 - Austin Tate ED - J. Landgren, U. Nulden ED - B. Van de Walle JF - Proceedings of the 6th International Conference on Information Systems for Crisis Response and Management (ISCRAM 2009) CY - Gothenburg, Sweden ER - TY - CHAP T1 - Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem T2 - Studies in Computational Intelligence Y1 - 2008 A1 - Juhos, I. A1 - van Hemert, J. I. ED - Cotta, C. ED - van Hemert, J. I. KW - constraint satisfaction KW - evolutionary computation KW - graph colouring JF - Studies in Computational Intelligence PB - Springer ER - TY - CONF T1 - Graph Colouring Heuristics Guided by Higher Order Graph Properties T2 - Lecture Notes in Computer Science Y1 - 2008 A1 - Juhos, Istv\'{a}n A1 - van Hemert, Jano ED - van Hemert, Jano ED - Cotta, Carlos KW - evolutionary computation KW - graph colouring AB - 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. JF - Lecture Notes in Computer Science PB - Springer VL - 4972 ER - TY - CONF T1 - OGSA-DAI: Middleware for Data Integration: Selected Applications T2 - ESCIENCE '08: Proceedings of the 2008 Fourth IEEE International Conference on eScience Y1 - 2008 A1 - Grant, Alistair A1 - Antonioletti, Mario A1 - Hume, Alastair C. A1 - Krause, Amy A1 - Dobrzelecki, Bartosz A1 - Jackson, Michael J. A1 - Parsons, Mark A1 - Atkinson, Malcolm P. A1 - Theocharopoulos, Elias JF - ESCIENCE '08: Proceedings of the 2008 Fourth IEEE International Conference on eScience PB - IEEE Computer Society CY - Washington, DC, USA SN - 978-0-7695-3535-7 ER - TY - CONF T1 - Data Integration in eHealth: A Domain/Disease Specific Roadmap T2 - Studies in Health Technology and Informatics Y1 - 2007 A1 - Ure, J. A1 - Proctor, R. A1 - Martone, M. A1 - Porteous, D. A1 - Lloyd, S. A1 - Lawrie, S. A1 - Job, D. A1 - Baldock, R. A1 - Philp, A. A1 - Liewald, D. A1 - Rakebrand, F. A1 - Blaikie, A. A1 - McKay, C. A1 - Anderson, S. A1 - Ainsworth, J. A1 - van Hemert, J. A1 - Blanquer, I. A1 - Sinno ED - N. Jacq ED - Y. Legr{\'e} ED - H. Muller ED - I. Blanquer ED - V. Breton ED - D. Hausser ED - V. Hern{\'a}ndez ED - T. Solomonides ED - M. Hofman-Apitius KW - e-Science AB - 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. JF - Studies in Health Technology and Informatics PB - IOPress VL - 126 SN - 978-1-58603-738-3 ER - TY - CONF T1 - e-Research Infrastructure Development and Community Engagement T2 - All Hands Meeting 2007 Y1 - 2007 A1 - Voss, A. A1 - Mascord, M. A1 - Fraser, M. A1 - Jirotka, M. A1 - Procter, R. A1 - Halfpenny, P. A1 - Fergusson, D. A1 - Atkinson, M. A1 - Dunn, S. A1 - Blanke, T. A1 - Hughes, L. A1 - Anderson, S. AB - 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. JF - All Hands Meeting 2007 CY - Nottingham, UK ER - TY - CONF T1 - Grid Enabling Your Data Resources with OGSA-DAI T2 - Applied Parallel Computing. State of the Art in Scientific Computing Y1 - 2007 A1 - Antonioletti, M. A1 - Atkinson, M. A1 - Chue Hong, N. P. A1 - Dobrzelecki, B. A1 - Hume, A. C. A1 - Jackson, M. A1 - Karasavvas, K. A1 - Krause, A. A1 - Schopf, J. M. A1 - Sugden. T. A1 - Theocharopoulos, E. JF - Applied Parallel Computing. State of the Art in Scientific Computing T3 - Lecture Notes in Computer Science VL - 4699 ER - TY - CONF T1 - OGSA-DAI 3.0 - The What's and Whys T2 - UK e-Science All Hands Meeting Y1 - 2007 A1 - Antonioletti, M. A1 - Hong, N. P. Chue A1 - Hume, A. C. A1 - Jackson, M. A1 - Karasavvas, K. A1 - Krause, A. A1 - Schopf, J. M. A1 - Atkinson, M. P. A1 - Dobrzelecki, B. A1 - Illingworth, M. A1 - McDonnell, N. A1 - Parsons, M. A1 - Theocharopoulous, E. JF - UK e-Science All Hands Meeting ER - TY - CONF T1 - Grid Enabling your Data Resources with OGSA-DAI T2 - Workshop on State-of-the-Art in Scientific and Parallel Computing Y1 - 2006 A1 - Antonioletti, M. A1 - Atkinson, M. A1 - Hong, N. Chue A1 - Dobrzelecki, B. A1 - Hume, A. A1 - Jackson, M. A1 - Karasavvas, K. A1 - Krause, A. A1 - Sugden, T. A1 - Theocharopoulos, E. JF - Workshop on State-of-the-Art in Scientific and Parallel Computing ER - TY - CONF T1 - Improving Graph Colouring Algorithms and Heuristics Using a Novel Representation T2 - Springer Lecture Notes on Computer Science Y1 - 2006 A1 - Juhos, I. A1 - van Hemert, J. I. ED - J. Gottlieb ED - G. Raidl KW - constraint satisfaction KW - graph colouring AB - 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. JF - Springer Lecture Notes on Computer Science PB - Springer-Verlag ER - TY - JOUR T1 - Increasing the efficiency of graph colouring algorithms with a representation based on vector operations JF - Journal of Software Y1 - 2006 A1 - Juhos, I. A1 - van Hemert, J. I. KW - graph colouring AB - 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. VL - 1 ER - TY - CONF T1 - Profiling OGSA-DAI Performance for Common Use Patterns T2 - UK e-Science All Hands Meeting Y1 - 2006 A1 - Dobrzelecki, B. A1 - Antonioletti, M. A1 - Schopf, J. M. A1 - Hume, A. C. A1 - Atkinson, M. A1 - Hong, N. P. Chue A1 - Jackson, M. A1 - Karasavvas, K. A1 - Krause, A. A1 - Parsons, M. A1 - Sugden, T. A1 - Theocharopoulos, E. JF - UK e-Science All Hands Meeting ER - TY - CONF T1 - A Shibboleth-Protected Privilege Management Infrastructure for e-Science Education T2 - Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006 Y1 - 2006 A1 - J. Watt A1 - Oluwafemi Ajayi A1 - J. Jiang A1 - Jos Koetsier A1 - Richard O. Sinnott KW - security JF - Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006 PB - IEEE Computer Society CY - Singapore ER - TY - JOUR T1 - The design and implementation of Grid database services in OGSA-DAI JF - Concurrency - Practice and Experience Y1 - 2005 A1 - Antonioletti, Mario A1 - Atkinson, Malcolm P. A1 - Baxter, Robert M. A1 - Borley, Andrew A1 - Hong, Neil P. Chue A1 - Collins, Brian A1 - Hardman, Neil A1 - Hume, Alastair C. A1 - Knox, Alan A1 - Mike Jackson A1 - Krause, Amrey A1 - Laws, Simon A1 - Magowan, James A1 - Pato VL - 17 ER - TY - CONF T1 - Evolutionary Transitions as a Metaphor for Evolutionary Optimization T2 - LNAI 3630 Y1 - 2005 A1 - Defaweux, A. A1 - Lenaerts, T. A1 - van Hemert, J. I. ED - M. Capcarrere ED - A. A. Freitas ED - P. J. Bentley ED - C. G. Johnson ED - J. Timmis KW - constraint satisfaction KW - transition models AB - 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. JF - LNAI 3630 PB - Springer-Verlag SN - 3-540-28848-1 ER - TY - CONF T1 - Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring T2 - Springer Lecture Notes on Computer Science Y1 - 2005 A1 - Juhos, I. A1 - Tóth, A. A1 - van Hemert, J. I. ED - G. Raidl ED - J. Gottlieb KW - constraint satisfaction KW - graph colouring AB - 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. JF - Springer Lecture Notes on Computer Science PB - Springer-Verlag, Berlin ER - TY - CONF T1 - Introduction to OGSA-DAI Services T2 - Scientific Applications of Grid Computing Y1 - 2005 A1 - Karasavvas, K. A1 - Antonioletti, M. A1 - Atkinson, M. A1 - Hong, N. C. A1 - Sugden, T. A1 - Hume, A. A1 - Jackson, M. A1 - Krause, A. A1 - Palansuriya, C. JF - Scientific Applications of Grid Computing VL - 3458 SN - 978-3-540-25810-0 ER - TY - CONF T1 - A New Architecture for OGSA-DAI T2 - UK e-Science All Hands Meeting Y1 - 2005 A1 - Atkinson, M. A1 - Karasavvas, K. A1 - Antonioletti, M. A1 - Baxter, R. A1 - Borley, A. A1 - Hong, N. C. A1 - Hume, A. A1 - Jackson, M. A1 - Krause, A. A1 - Laws, S. A1 - Paton, N. A1 - Schopf, J. A1 - Sugden, T. A1 - Tourlas, K. A1 - Watson, P. JF - UK e-Science All Hands Meeting ER - TY - CONF T1 - OGSA-DAI Status and Benchmarks T2 - All Hands Meeting 2005 Y1 - 2005 A1 - Antonioletti, Mario A1 - Malcolm Atkinson A1 - Rob Baxter A1 - Andrew Borle A1 - Hong, Neil P. Chue A1 - Patrick Dantressangle A1 - Hume, Alastair C. A1 - Mike Jackson A1 - Krause, Amy A1 - Laws, Simon A1 - Parsons, Mark A1 - Paton, Norman W. A1 - Jennifer M. Schopf A1 - Tom Sugden A1 - Watson, Paul AB - 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. JF - All Hands Meeting 2005 CY - Nottingham, UK ER - TY - JOUR T1 - Specifying use case behavior with interaction models JF - Journal of Object Technology Y1 - 2005 A1 - José Daniel García,Jesús Carretero,José María Pérez,Félix García,Rosa Filgueira. AB - 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. VL - 4 IS - 9 ER - TY - CONF T1 - Binary Merge Model Representation of the Graph Colouring Problem T2 - Springer Lecture Notes on Computer Science Y1 - 2004 A1 - Juhos, I. A1 - Tóth, A. A1 - van Hemert, J. I. ED - J. Gottlieb ED - G. Raidl KW - constraint satisfaction KW - graph colouring AB - 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. JF - Springer Lecture Notes on Computer Science PB - Springer-Verlag, Berlin SN - 3-540-21367-8 ER - TY - CONF T1 - OGSA-DAI Status Report and Future Directions T2 - All Hands Meeting 2004 Y1 - 2004 A1 - Antonioletti, Mario A1 - Malcolm Atkinson A1 - Rob Baxter A1 - Borley, Andrew A1 - Hong, Neil P. Chue A1 - Collins, Brian A1 - Jonathan Davies A1 - Desmond Fitzgerald A1 - Hardman, Neil A1 - Hume, Alastair C. A1 - Mike Jackson A1 - Krause, Amrey A1 - Laws, Simon A1 - Paton, Norman W. A1 - Tom Sugden A1 - Watson, Paul A1 - Mar AB - 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/. JF - All Hands Meeting 2004 CY - Nottingham, UK ER - TY - CONF T1 - OGSA-DAI: Two Years On T2 - GGF10 Y1 - 2004 A1 - Antonioletti, Mario A1 - Malcolm Atkinson A1 - Rob Baxter A1 - Borley, Andrew A1 - Neil Chue Hong A1 - Collins, Brian A1 - Jonathan Davies A1 - Hardman, Neil A1 - George Hicken A1 - Ally Hume A1 - Mike Jackson A1 - Krause, Amrey A1 - Laws, Simon A1 - Magowan, James A1 - Jeremy Nowell A1 - Paton, Norman W. A1 - Dave Pearson A1 - To AB - 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/. JF - GGF10 CY - Berlin, Germany ER - TY - CONF T1 - The Design and Implementation of Grid Database Services in OGSA-DAI T2 - All Hands Meeting 2003 Y1 - 2003 A1 - Ali Anjomshoaa A1 - Antonioletti, Mario A1 - Malcolm Atkinson A1 - Rob Baxter A1 - Borley, Andrew A1 - Hong, Neil P. Chue A1 - Collins, Brian A1 - Hardman, Neil A1 - George Hicken A1 - Ally Hume A1 - Knox, Alan A1 - Mike Jackson A1 - Krause, Amrey A1 - Laws, Simon A1 - Magowan, James A1 - Charaka Palansuriya A1 - Paton, Norman W. AB - 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. JF - All Hands Meeting 2003 CY - Nottingham, UK ER - TY - CONF T1 - Experiences of Designing and Implementing Grid Database Services in the OGSA-DAI project T2 - Global Grid Forum Workshop on Designing and Building Grid Services/GGF9 Y1 - 2003 A1 - Antonioletti, Mario A1 - Neil Chue Hong A1 - Ally Hume A1 - Mike Jackson A1 - Krause, Amy A1 - Jeremy Nowell A1 - Charaka Palansuriya A1 - Tom Sugden A1 - Martin Westhead AB - 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/. JF - Global Grid Forum Workshop on Designing and Building Grid Services/GGF9 CY - Chicago, USA ER - TY - CONF T1 - A new permutation model for solving the graph k-coloring problem T2 - Kalmàr Workshop on Logic and Computer Science Y1 - 2003 A1 - Juhos, I. A1 - Tóth, A. A1 - Tezuka, M. A1 - Tann, P. A1 - van Hemert, J. I. KW - constraint satisfaction KW - graph colouring AB - 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. JF - Kalmàr Workshop on Logic and Computer Science ER - TY - CONF T1 - Use of Evolutionary Algorithms for Telescope Scheduling T2 - Integrated Modeling of Telescopes Y1 - 2002 A1 - Grim, R. A1 - Jansen, M. L. M. A1 - Baan, A. A1 - van Hemert, J. I. A1 - de Wolf, H. ED - Torben Anderson KW - constraint satisfaction KW - scheduling AB - 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. JF - Integrated Modeling of Telescopes PB - The International Society for Optical Engineering ({SPIE}) VL - 4757 ER - TY - CONF T1 - An Engineering Approach to Evolutionary Art T2 - Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) Y1 - 2001 A1 - van Hemert, J. I. A1 - Jansen, M. L. M. ED - Lee Spector ED - Erik D. Goodman ED - Annie Wu ED - W. B. Langdon ED - Hans-Michael Voigt ED - Mitsuo Gen ED - Sandip Sen ED - Marco Dorigo ED - Shahram Pezeshk ED - Max H. Garzon ED - Edmund Burke KW - evolutionary art AB - 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. JF - Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) PB - Morgan Kaufmann Publishers, San Francisco ER - TY - CONF T1 - Defining and Handling Transient Fields in PJama T2 - DBPL Y1 - 1999 A1 - Printezis, Tony A1 - Atkinson, Malcolm P. A1 - Jordan, Mick J. JF - DBPL ER - TY - CONF T1 - Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java T2 - ICDT Y1 - 1999 A1 - Atkinson, Malcolm P. A1 - Jordan, Mick J. JF - ICDT ER - TY - CONF T1 - Population dynamics and emerging features in AEGIS T2 - Proceedings of the Genetic and Evolutionary Computation Conference Y1 - 1999 A1 - Eiben, A. E. A1 - Elia, D. A1 - van Hemert, J. I. ED - W. Banzhaf ED - J. Daida ED - Eiben, A. E. ED - M. H. Garzon ED - V. Honavar ED - M. Jakiela ED - R. E. Smith KW - dynamic problems AB - 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. JF - Proceedings of the Genetic and Evolutionary Computation Conference PB - Morgan Kaufmann Publishers, San Francisco ER -