TY - JOUR T1 - Requirements for Provenance on the Web JF - IJDC Y1 - 2012 A1 - Paul T. Groth A1 - Yolanda Gil A1 - James Cheney A1 - Simon Miles VL - 7 ER - TY - Generic T1 - A Review of Attacks and Security Approaches in Open Multi-agent Systems Y1 - 2012 A1 - Shahriar Bijani A1 - David Robertson AB - 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. 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 - 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 - CONF T1 - Rapid chemistry portals through engaging researchers T2 - Fifth IEEE International Conference on e-Science Y1 - 2009 A1 - Koetsier, J. A1 - Turner, A. A1 - Richardson, P. A1 - van Hemert, J. I. ED - Trefethen, A ED - De Roure, D AB - 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. JF - Fifth IEEE International Conference on e-Science CY - Oxford, UK ER - TY - CONF T1 - Rapid development of computational science portals T2 - Proceedings of the IWPLS09 International Workshop on Portals for Life Sciences Y1 - 2009 A1 - Koetsier, J. A1 - van Hemert, J. I. ED - Gesing, S. ED - van Hemert, J. I. KW - portal JF - Proceedings of the IWPLS09 International Workshop on Portals for Life Sciences T3 - CEUR Workshop Proceedings PB - e-Science Institute CY - Edinburgh UR - http://ceur-ws.org/Vol-513/paper05.pdf ER - TY - BOOK T1 - Recent Advances in Evolutionary Computation for Combinatorial Optimization T2 - Studies in Computational Intelligence Y1 - 2008 A1 - Cotta, Carlos A1 - van Hemert, Jano AB - 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. JF - Studies in Computational Intelligence PB - Springer VL - 153 SN - 978-3-540-70806-3 UR - http://www.springer.com/engineering/book/978-3-540-70806-3 ER - TY - JOUR T1 - The Research of Relationship between Self-similar of TCP and Network Performance JF - Journal on communications Y1 - 2004 A1 - yan Liu A1 - Liangxiu Han VL - 25 IS - 4 ER - TY - JOUR T1 - Robust parameter settings for variation operators by measuring the resampling ratio: A study on binary constraint satisfaction problems JF - Journal of Heuristics Y1 - 2004 A1 - van Hemert, J. I. A1 - Bäck, T. KW - constraint satisfaction KW - evolutionary computation KW - resampling ratio AB - 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. VL - 10 ER - TY - CHAP T1 - Rationale for Choosing the Open Grid Services Architecture T2 - Grid Computing: Making the Global Infrastructure a Reality Y1 - 2003 A1 - Atkinson, M. ED - F. Berman ED - G. Fox ED - T. Hey JF - Grid Computing: Making the Global Infrastructure a Reality PB - John Wiley & Sons, Ltd CY - Chichester, UK SN - 9780470853191 ER -