Bücher der Reihe Theoretical Computer Science and General Issues

In a dynamic computing environment, such as the Grid, resource management plays a crucial role for making distributed resources available on-demand to anyone from anywhere at any time without undermining the resource autonomy; this becomes an art when dealing with heterogeneous resources distributed under multiple trust domains spanning across the Internet. Today Grid execution environments provide abstract workflow descriptions that need a dynamic mapping to actual deployments; this further accentuates the importance of resource management in the Grid.This monograph renders boundaries of the Grid resource management, identifies research challenges and proposes new solutions with innovative techniques for on-demand provisioning, automatic deployments, dynamic synthesis, negotiation-based advance reservation and capacity planning of Grid resources. The Grid capacity planning is performed with multi-constrained optimized resource allocations by modelling resource allocation as an on-line strip packing problem and introducing a new solution that optimizes resource utilization and QoS while generating contention-free solutions.On-demand resource provisioning becomes possible by simplifying abstract resource descriptions independent from the concrete installations. The book further explains the use of the semantic web technologies in the Grid to specify explicit definitions and unambiguous machine interpretable resource descriptions for intelligent resource matching and synthesis; the synthesis process generates new compound resources with aggregated capabilities and prowess. The newly introduced techniques haven been developed and integrated in ASKALON Grid application development and runtime environment, deployed in the Austrian Grid, and demonstrated through well performed experiments.

This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011. The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%.The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.

Arti?cial Immune Systems have come of age. They are no longer an obscure computersciencetechnique,workedonbyacoupleoffarsightedresearchgroups. Today, researchers across the globe are working on new computer algorithms inspired by the workings of the immune system. This vigorous ?eld of research investigates how immunobiology can assist our technology, and along the way is beginning to help biologists understand their unique problems. AIS is now old enough to understand its roots, its context in the research community, and its exciting future. It has grown too big to be con?ned to s- cial sessions in evolutionary computation conferences. AIS researchers are now forming their own community and identity. The International Conference on Arti?cial Immune Systems is proud to be the premiere conference in the area. As its organizers, we were honored to have such a variety of innovative and original scienti?c papers presented this year. ICARIS 2004 was the third international conference dedicated entirely to the ?eld of Arti?cial Immune Systems (AIS). It was held in Catania, on the beautiful island of Sicily, Italy, during September 13-16, 2004. While hosting the conference, the city of Catania gave the participants the opportunity to enjoy the richness of its historical and cultural atmosphere and the beauty of its natural resources, the sea, and the Etna volcano.

This Festschrift volume, published in honor of Brian Randell on the occasion of his 75th birthday, contains a total of 37 refereed contributions. Two biographical papers are followed by the six invited papers that were presented at the conference 'Dependable and Historic Computing: The Randell Tales', held during April 7-8, 2011 at Newcastle University, UK. The remaining contributions are authored by former scientific colleagues of Brian Randell.The papers focus on the core of Brian Randell's work: the development of computing science and the study of its history. Moreover, his wider interests are reflected and so the collection comprises papers on software engineering, storage fragmentation, computer architecture, programming languages and dependability. There is even a paper that echoes Randell's love of maps.After an early career with English Electric and then with IBM in New York and California, Brian Randell joined Newcastle University. His main research has been on dependable computing in all its forms, especially reliability, safety and security aspects, and he has led several major European collaborative projects.

This book constitutes the refereed proceedings of the 19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012, held in Reykjavik, Iceland for 3 days starting June 30, 2012. The 28 revised full papers presented were carefully reviewed and selected from 54 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories, and randomized/probabilistic issues in networks.

This book constitutes thoroughly refereed post-conference proceedings of the workshops of the 16th International Conference on Parallel Computing, Euro-Par 2010, held in Ischia, Italy, in August/September 2010. The papers of these 9 workshops HeteroPar, HPCC, HiBB, CoreGrid, UCHPC, HPCF, PROPER, CCPI, and VHPC focus on promotion and advancement of all aspects of parallel and distributed computing.

This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Models for the Web-Graph, WAW 2012, held in Halifax, Nova Scotia, Canada, in June 2012. The 13 papers presented were carefully reviewed and selected for inclusion in this volume. They address a number of topics related to the complex networks such hypergraph coloring games and voter models; algorithms for detecting nodes with large degrees; random Appolonian networks; and a sublinear algorithm for Pagerank computations.

This book constitutes the refereed proceedings of the 7th International Conference on Sequences and Their Applications, SETA 2012, held in Waterloo, Canada, in June 2012. The 28 full papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 48 submissions. The papers are grouped in topical sections on perfect sequences; finite fields; boolean functions; Golomb 80th birthday session; linear complexity; frequency hopping; correlation of sequences; bounds on sequences, cryptography; aperiodic correlation; and Walsh transform.

This book constitutes the refereed proceedings of the 7th International Conference on Grid and Pervasive Computing, GPC 2012, held in Hong Kong, China, in May 2012. The 9 revised full papers and 19 short papers were carefully revised and selected from 55 submissions. They are organized in topical sections on cloud computing, grid and service computing, green computing, mobile and pervasive computing, scheduling and performance, and trust and security. Also included are 4 papers presented at the 2012 International Workshop on Mobile Cloud and Ubiquitous Computing (Mobi-Cloud 2012) held in conjunction with GPC 2012.

This book constitutes the refereed proceedings of the Turing Centenary Conference and the 8th Conference on Computability in Europe, CiE 2012, held in Cambridge, UK, in June 2012. The 53 revised papers presented together with 6 invited lectures were carefully reviewed and selected with an acceptance rate of under 29,8%. The CiE 2012 Turing Centenary Conference will be remembered as a historic event in the continuing development of the powerful explanatory role of computability across a wide spectrum of research areas. The papers presented at CiE 2012 represent the best of current research in the area, and forms a fitting tribute to the short but brilliant trajectory of Alan Mathison Turing. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing.

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finland, in July 2012. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition.

This book constitutes the thoroughly refereed papers of the 17th International Conference on Implementation and Application of Automata, CIAA 2012, held in Porto, Portugal, in July 2012. The 21 revised full papers presented together with 5 invited papers and 7 short papers were carefully selected from 53 submissions. The papers cover various topics such as automata applications in formal verification methods, natural language processing, pattern matching, data storage and retrieval, and bioinformatics, as well as theoretical work on automata theory.

This festschrift volume, published in honor of Jürgen Dassow on the occasion of his 65th birthday, contains 19 contributions by leading researchers, colleagues, and friends. Covering topics on picture languages, cooperating distributed systems of automata, quantum automata, grammar systems, online computation, word equations, biologically motivated formal systems, controlled derivations, descriptional complexity, as well as 'classical' topics of automata and language theory, the articles presented span the range of the scientific work of Jürgen Dassow.

This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Symposium on Trustworthy Global Computing, TGC 2012, held in Newcastle upon Tyne, UK, in September 2012. The 9 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 14 submissions. The papers cover a wide range of topics in the area of global computing and reliable computation in the so-called global computers, i.e., those computational abstractions emerging in large-scale infrastructures such as service-oriented architectures, autonomic systems and cloud computing, providing frameworks, tools, algorithms and protocols for designing open-ended, large-scale applications and for reasoning about their behavior and properties in a rigorous way.

This book constitutes the proceedings of the 4th International Conference on Mathematical Software, ICMS 2014, held in Seoul, South Korea, in August 2014. The 108 papers included in this volume were carefully reviewed and selected from 150 submissions. The papers are organized in topical sections named: invited; exploration; group; coding; topology; algebraic; geometry; surfaces; reasoning; special; Groebner; triangular; parametric; interfaces and general.

This book constitutes the refereed proceedings of the 7th International Conference on Informatics in Schools: Situation, Evolution, and Perspectives, ISSEP 2014, held in Istanbul, Turkey, in September 2014. The 13 full papers presented together with 2 keynotes were carefully reviewed and selected from 33 submissions. The focus of the conference was on following topics: Competence Science Education, Competence Measurement for Informatics, Emerging Technologies and Tools for Informatics, Teacher Education in Informatics, and Curriculum Issues.

This book constitutes the refereed proceedings of the 18th European Conference on Genetic Programming, EuroGP 2015, held in Copenhagen, Spain, in April 2015 co-located with the Evo 2015 events, EvoCOP, Evo MUSART and Evo Applications. The 12 revised full papers presented together with 6 poster papers were carefully reviewed and selected form 36 submissions. The wide range of topics in this volume reflects the current state of research in the field. Thus, we see topics as diverse as semantic methods, recursive programs, grammatical methods, coevolution, Cartesian GP, feature selection, initialisation procedures, ensemble methods and search objectives; and applications including text processing, cryptography, numerical modelling, software parallelisation, creation and optimisation of circuits, multi-class classification, scheduling and artificial intelligence.

This book presents a collection of 36 pieces of scientific work in the areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements. These so far formally unpublished pieces were written by Oded Goldreich, some in collaboration with other scientists. The articles included in this book essentially reflect the topical scope of the scientific career of Oded Goldreich now spanning three decades. In particular the topics dealt with include average-case complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NP-completeness, one-way functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zero-knowledge, and non-iterative zero-knowledge.All in all, this potpourri of studies in complexity and cryptography constitutes a most valuable contribution to the field of theoretical computer science centered around the personal achievements and views of one of its outstanding representatives.