Bücher der Reihe Theoretical Computer Science and General Issues

This book constitutes the refereed proceedings of the 27th China Conference on Information Retrieval, CCIR 2021, held in Dalian, China, in October 2021.The 15 full papers presented were carefully reviewed and selected from 124 submissions.

This book constitutes the thoroughly refereed post-conference proceedings of the 24th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2021, held as a virtual event in May 2021 (due to the Covid-19 pandemic).The 10 revised full papers presented were carefully reviewed and selected from 17 submissions.

LION deals with designing and engineering ways of "learning" about the performance of different techniques, and ways of using past experience about the algorithm behavior to improve performance in the future.

This book constitutes the proceedings of the 18th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2021, which was held in Paris, France during November 3-5, 2021.The 20 papers presented in this volume were carefully reviewed and selected from 62 submissions. and networks and communications.

This book constitutes the refereed proceedings of the 14th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. The 33 papers were carefully reviewed and selected from a total of 134 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures including but not limited to approximation algorithms, parameterized algorithms, computational biology, computational geometry and topology, distributed algorithms, external-memory algorithms, exponential algorithms, graph algorithms, online algorithms, optimization algorithms, randomized algorithms, streaming algorithms, string algorithms, sublinear algorithms and algorithmic game theory.

Developments in Computational Science and the CrossGrid Project; Alok Choudhary - Scienti?c Data Management; and David Keyes - Scienti?c Discovery through Advanced Computing.

This volume contains revised versions of the papers submitted to the workshop by the participants and accepted by the program committee after a thorough reviewing process. The collection of papers included in the proceedings covers not only various expanding applications of computer algebra to scienti?c computing but also the computer algebra systems themselves and the CA algorithms. The eight earlier CASC conferences, CASC 1998, CASC 1999, CASC 2000, CASC 2001, CASC 2002, CASC 2003, CASC 2004, and CASC 2005 were held, - spectively, in St. Petersburg, Russia, in Munich, Germany, in Samarkand, Uzb- istan, in Konstanz, Germany, in Crimea, Ukraine, in Passau, Germany, in St. Petersburg, Russia, and in Kalamata, Greece, and they proved to be successful. It was E. A. Grebenikow (Computing Center of the Russian Academy of S- ences, Moscow) who drew our attention to the group of mathematicians and c- puter scientists at the Academy of Sciences of Moldova conducting research in the ?eld of computer algebra. We were impressed that this group not only is concerned with applications of CA methods to problems of scienti?c computing but also c- ries out research on the fundamental principles underlying the current computer algebra systems themselves, see also their papers in the present proceedings v- ume. It was therefore decided to organize the 9th workshop on Computer Algebra in Scienti?c Computing, CASC 2006, in Chi¿ sin? au, the capital of Moldova.

The two-volume set of LNCS 10941 and 10942 constitutes the proceedings of the 9th International Conference on Advances in Swarm Intelligence, ICSI 2018, held in Shanghai, China, in June 2018. The total of 113 papers presented in these volumes was carefully reviewed and selected from 197 submissions. The papers were organized in topical sections namely: multi-agent systems; swarm robotics; fuzzy logic approaches; planning and routing problems; recommendation in social media; predication; classification; finding patterns; image enhancement; deep learning; theories and models of swarm intelligence; ant colony optimization; particle swarm optimization; artificial bee colony algorithms; genetic algorithms; differential evolution; fireworks algorithm; bacterial foraging optimization; artificial immune system; hydrologic cycle optimization; other swarm-based optimization algorithms; hybrid optimization algorithms; multi-objective optimization; large-scale global optimization.

This book constitutes the refereed proceedings of the 5th International Conference on Algebra and Coalgebra in Computer Science, CALCO 2013, held in Warsaw, Poland, in September 2013. The 18 full papers presented together with 4 invited talks were carefully reviewed and selected from 33 submissions. The papers cover topics in the fields of abstract models and logics, specialized models and calculi, algebraic and coalgebraic semantics, system specification and verification, as well as corecursion in programming languages, and algebra and coalgebra in quantum computing. The book also includes 6 papers from the CALCO Tools Workshop, co-located with CALCO 2013 and dedicated to tools based on algebraic and/or coalgebraic principles.

This volume contains papers selected for presentation at the 31st Annual C- ference on Current Trends in Theory and Practice of Informatics - SOFSEM 2005, held on January 22-28, 2005 in LiptovskyJ ' an, ' Slovakia. The series of SOFSEM conferences, organized alternately in the Czech - public and Slovakia since 1974, has a well-established tradition. The SOFSEM conferences were originally intended to break the Iron Curtain in scienti?c - change. After the velvet revolution SOFSEM changed to a regular broad-scope international conference. Nowadays, SOFSEM is focused each year on selected aspects of informatics. This year the conference was organized into four tracks, each of them complemented by two invited talks: - Foundations of Computer Science (Track Chair: Bernadette Charron-Bost) - Modeling and Searching Data in the Web-Era (Track Chair: Peter Vojt' a? s) - Software Engineering (Track Chair: M' aria Bielikova) ' - Graph Drawing (Track Chair: Ondrej Syk ' ora) The aim of SOFSEM 2005 was, as always, to promote cooperation among professionalsfromacademiaandindustryworkinginvariousareasofinformatics. Each track was complemented by two invited talks. The SOFSEM 2005 Program Committee members coming from 13 countries evaluated 144 submissions (128 contributed papers and 16 student research - rum papers). After a careful review process (counting at least 3 reviews per paper), followed by detailed discussions in the PC, and a co-chairs meeting held on October 8, 2005 in Bratislava, Slovakia, 44 papers (overall acceptance rate 34.

A central theme in the study of dynamic systems is the modelling and control of uncertain systems. While 'uncertainty' has long been a strong motivating factor behind many techniques developed in the modelling, control, statistics and mathematics communities, the past decade, in particular, has witnessed remarkable progress in this area with the emergence of a number of powerful newmethodsforbothmodellingandcontrollinguncertaindynamicsystems. The speci?c objective of this book is to describe and review some of these exciting new approaches within a single volume. Our approach was to invite some of the leading researchers in this area to contribute to this book by submitting both tutorial papers on their speci?c area of research, and to submit more focussed research papers to document some of the latest results in the area. We feel that collecting some of the main results together in this manner is particularly important as many of the important ideas that emerged in the past decade were derived in a variety of academic disciplines. By providing both tutorial and researchpaperswehopetobeabletoprovidetheinterestedreaderwithsu?cient background to appreciate some of the main concepts from a variety of related, but nevertheless distinct ?elds, and to provide a ?avor of how these results are currently being used to cope with 'uncertainty. ' It is our sincere hope that the availability of these results within a single volume will lead to further cro- fertilization of ideas and act as a spark for further research in this important area of applied mathematics.

This book contains the Proceedings of the 5th Workshop on OpenMP Appli- tionsandTools(WOMPAT2004),whichtookplaceattheUniversityofHouston, Houston, Texas on May 17 and 18, 2004. Previous workshops in this series took place in Toronto, Canada, Fairbanks, Alaska, Purdue, Indiana, and San Diego, California.Thepurposeoftheworkshopwastobringtogetherusersanddevel- ers of the OpenMP API for shared memory parallel programming to disseminate their ideas and experiences and discuss the latest developments in OpenMP and its application. To support this aim, the program comprised a mixture of invited talks from research and industry, experience reports, and submitted papers, the last of which are presented in this volume. A tutorial introduction to OpenMP was held at the same location on May 18 by Ruud van der Pas from Sun Microsystems. Further, a two-day lab session called OMPlab was held immediately following the workshop and the tutorial on May 19 and 20, and was attended by both novice and advanced users. Many of the hardware vendors and several researchers gave in-depth tutorials on their softwareandmadetheirsystemsavailabletobothnoviceandadvancedattendees during OMPlab. Contributors to the WOMPAT 2004 OMPlab included IBM, Intel, Sun, the University of Tennessee, NASA, the University of Greenwich, Cornell University, the University of Oregon and the University of Houston. TheOpenMPAPIisawidelyacceptedstandardforhigh-levelsharedmemory parallel programming that was put forth by a consortium of vendors in 1997.

On February 26-27, 2004, the 3rd International Workshop on Peer-to-Peer S- tems (IPTPS 2004) brought researchers and practitioners together to discuss the latest developments in peer-to-peer technologies, applications, and systems. As the third workshop in the series, IPTPS 2004 continued the success of the previous workshops in pioneering the state of the art in peer-to-peer systems and identifying key research challenges in the area. The workshop received 145 submissions in the form of ?ve-page position papers. As with previous workshops, submissions went through two rounds of reviews by an international program committee of 14 experts from industry and academia.In the ?rst round eachsubmission receivedtwo reviews.In the second round we focused our attention on submissions with either positive reviews, or with reviews that expressed substantially di?erent opinions. In addition to the technical merit, the reviewing process emphasized originality and the potential of the submission to lead to interesting discussions during the workshop. Intheend,theprogramcommitteeselectedaworkshopprogramof27papers coveringawiderangeoftopicsincludingnewpeer-to-peerapplications,advances in routing, load balancing, searching, as well as transport, mobility, and other networking topics. Authors revised accepted position papers to six pages for the workshop program, and made a ?nal round of revision for this volume. The workshop was composed of eight sessions that spanned two days. To focus discussions, attendance was limited to 67 participants and included s- stantialtimeforinteractionanddiscussionbetweensessionsandatsocialevents.

'Network' is a heavily overloaded term, so that 'network analysis' means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models.From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks.In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.