Bücher der Reihe Theoretical Computer Science and General Issues

Welcome to the proceedings of the 2008 International Conference on Grid and Pervasive Computing (GPC 2008) which was held in Kunming, Yunnan, China, May 25-28, 2008. Gridcomputing presentsa newtrendindistributed computing forcoordin- ing large-scale heterogeneous resource sharing and problem solving in dynamic, multi-institutional virtual organizations. Grid computing not only can be used for distributed supercomputing massive data processing, but can also be a c- mon platform and way for utility and service computing. It covers mainframes orsupercomputersaswellasmorepowerful personal computers and even small and smart devices, ranging from personal digital assistants to unseen chips in our cars, appliances and telephones. Projecting this trend into the future, we envision an explosion of interconnected high-performance computers and smart devices that can make our research and daily lives easier and more productive. Grid and Pervasive Computing (GPC) is an annual international conference on the emerging areas of merging grid computing and pervasive computing. GPC provides a high-pro?le, leading-edge forum for researchers and engineers alike to present their latest research in the ?eld of grid computing and pervasive computing.

The Workshop on Experimental Algorithms, WEA, is intended to be an int- national forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 - June 1, 2008. This was the seventh workshop of the series, after Rome (2007),Menorca(2006),Santorini(2005),RiodeJaniero(2004),Asconia(2003), and Riga (2001). This volume contains all contributed papers accepted for presentation at the workshop. The 26 contributed papers were selected by the Program Committee onthebasisofatleastthreerefereereports,somecontributedbytrustedexternal referees. In addition to the 26 contributed papers, the program contained two invited talks. Camil Demetrescu, of the University of Rome "e;La Sapienza,"e; spoke on "e;Visualization in Algorithm Engineering."e; David S. Johnson of AT & T Labs - Research, gave a talk on "e;Bin Packing: From Theory to Experiment and Back Again."e; We would like to thank the authors who responded to the call for papers, our invited speakers, the members of the ProgramCommittee, the external referees, and the Organizing Committee members for making this workshop possible.

The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their applications. It intends to bring together international experts at the research frontiers in those areas to exchange ideas and to present signi?cant new results. The mission of the workshop is to stimulate the various ?elds for which al- rithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western algorithmics research communities. The Second Inter- tional Frontiers in Algorithmics Workshop (FAW 2008) took place in Changsha, China, June 19-21, 2008. In response to the Call for Papers, 80 papers were submitted from 15 co- tries and regions: Canada, China, France, Germany, Greece, Hong Kong, India, Iran, Japan, Mexico, Norway, Singapore, South Korea, Taiwan, and the USA. After a six-week period of careful reviewing and discussion, the Program C- mittee accepted 32 submissions for presentation at the conference. These papers were selected for nine special focus tracks in the areas of biomedical inform- ics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and pro- cols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning. The program of FAW 2008 also included three keynote talks by Xiaotie Deng, John E. Hopcroft, and Milan Sonka.

CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15-20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15-20, 2008.

The 2008 IEEE World Congress on Computational Intelligence (WCCI 2008), held during June 1-6, 2008 in Hong Kong, China, marked an important milestone in advancing the paradigms of the new fields of computational intelligence. As the fifth event in the series that has spanned the globe (Orlando-1994, Anchorage-1998, Honolulu-2002, Vancouver-2006), the congress offered renewed and refreshing focus on the progress in nature-inspired and linguistically motivated computation. Most of the congress's program featured regular and special technical sessions that provided participants with new insights into the most recent developments in the field. As a tradition, in addition to the parallel technical sessions, WCCI holds a series of plenary and invited lectures which are not included in the congress proceedings. As its predecessors, at WCCI 2008, 20 expert speakers shared their expertise on broader, if not panoramic, topics spanning a diverse spectrum of computational intelligence in the areas of neurocomputing, fuzzy systems, evolutionary computation, and adjacent areas. Thanks to their time and expertise, we endeavored to offer this volume to attendees directly at the congress and the general public afterwards.

The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26-28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The ?rst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995 [LNCS 920], Vancouver (Canada) 1996 [LNCS 1084], Houston (USA) 1998 [LNCS 1412], Graz (Austria) 1999 [LNCS 1610], Utrecht (The Netherlands) 2001 [LNCS 2081], Boston (USA) 2002 [LNCS 2337], New York (USA) 2004 [LNCS 2986], Berlin (Germany) 2005 [LNCS 3509], and Ithaca (USA) 2007 [LNCS 4168]. The c- ference is not held in the years when the International Symposium of the Ma- ematical Programming Society takes place.

The Colloquium on Structure, Information, Communication, and Complexity (SIROCCO) is an annual research meeting focused on the relationship between information and e?ciency in decentralized (distributed, parallel, and network) computing.Thisyear,SIROCCOcelebratedits15thanniversary.Overtheyears, the colloquium has become a widely recognized forum bringing together - searchers interested in the fundamental principles underlying the interplay - tween local structural knowledge and global communication and computation complexity. SIROCCO covers topics such as distributed algorithms, compact data structures, information dissemination, informative labeling schemes, c- binatorial optimization, and others, with potential applications to large-scale distributed systems including global computing platforms, peer-to-peer systems andapplications,socialnetworks,wirelessnetworks,andnetworkprotocols(such as routing, broadcasting, localization). SIROCCO 2008 was held in Villars-sur- Ollon, in the Swiss Alps, June 17-20, 2008. There were 52 contributions submitted to SIROCCO 2008. All papers - derwent a thorough refereeing process, where each submission was reviewed by at least 3, and on average 3.4, Program Committee members. After in-depth discussions, the Program Committee selected 22 high-quality contributions for presentation at the colloquium and publication in this volume. We thank the authors of all the submitted papers, the Program Committee members, and the external reviewers. Without their dedication, we could not have prepared a program of such quality. ThereweretwoinvitedspeakersatSIROCCO2008:NicolaSantoro(Carleton University) and Boaz Patt-Shamir (Tel-Aviv University). We express our gratitude to the SIROCCO Steering Committee, and in p- ticulartoPierreFraigniaudforhisenthusiasmandhisinvaluablehelpthroughout the preparation of this event.

Informatics Education - Supporting Computational Thinking contains papers presented at the Third International Conference on Informatics in Secondary Schools - Evolution and Perspective, ISSEP 2008, held in July 2008 in Torun, Poland. As with the proceedings of the two previous ISSEP conferences (2005 in Klag- furt, Austria, and 2006 in Vilnius, Lithuania), the papers presented in this volume address issues of informatics education transcending national boundaries and, the- fore, transcending differences in the various national legislation and organization of the educational system. Observing these issues, one might notice a trend. The p- ceedings of the First ISSEP were termed From Computer Literacy to Informatics F- damentals [1]. There, broad room was given to general education in ICT. The ECDL, the European Computer Driving License, propagated since the late 1990s, had pe- trated school at this time already on a broad scale and teachers, parents, as well as pupils were rather happy with this situation. Teachers had material that had a clear scope, was relatively easy to teach, and especially easy to examine. Parents had the assurance that their children learn "e;modern and relevant stuff,"e; and for kids the c- puter was sufficiently modern so that anything that had to do with computers was c- sidered to be attractive. Moreover, the difficulties of programming marking the early days of informatics education in school seemed no longer relevant. Some colleagues had a more distant vision though.

Research on theoretical aspects of computing has a direct impact on the pr- tice of computer systems development. Over many decades, fundamental t- ories have emerged to describe functionality, temporal behavior and resource consumption. Theories of application domains are beginning to be exploited for modelling and analyzing intended computing systems before the expensive c- mitment is made to real programs and hardware. Recent years have seen major improvements in the cost-e?ectiveness of tools supporting the exploitation of theories through proof, model-checking and testing. Against this encouraging background, we are pleased to present papers that show something of the live- ness and diversity of research in theoretical aspects of computing today. ICTAC 2008, the 5th International Colloquium on Theoretical Aspects of Computing, was held on 1-3 September 2008 in Istanbul, Turkey, hosted by - banc? University. The ICTAC series was founded by the International Institute for SoftwareTechnologyof the United Nations University(UNU-IIST). It brings together practitioners and researchers from academia, industry and government to present results and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methodsandtoolsforsystemdevelopment. Theseriesalsopromotescooperation in research and education between participants and their institutions, from - veloping and industrial countries, in accordance with the mandate of the United Nations University. The previous ICTAC colloquia were held in Guiyang, China (2004, LNCS 3407), Hanoi, Vietnam (2005, LNCS 3722), Tunis, Tunisia (2006, LNCS 4281) and Macau SAR, China (2007, LNCS 4711).

It is a pleasure to welcome you to the proceedings of the second International Castle Meeting on Coding Theory and its Applications, held at La Mota Castle in Medina del Campo. The event provided a forum for the exchange of results and ideas, which we hope will foster future collaboration. The ?rst meeting was held in 1999, and, encouraged by that experience, we now intend to hold the meeting every three years. Springer kindly accepted to publish the proceedings volume you have in your hands in their LNCS series. The topics were selected to cover some of the areas of research in Coding Theory that are currently receiving the most attention. The program consisted of a mixture of invited and submitted talks, with the focus on quality rather than quantity. A total of 34 papers were submitted to themeeting.Afteracarefulreviewprocessconductedbythescienti?ccommittee aided by external reviewers, we selected 14 of these for inclusion in the current volume, along with 5 invited papers. The program was further augmented by the remaining invited papers in addition to papers on recent results, printed in a separate volume. We would like to thank everyone who made this meeting possible by helping with the practical and scienti?c preparations: the organization committee, the scienti?c committee, the invited speakers, and the many external reviewers who shall remain anonymous. I would especially like to mention the General Advisor ofthe meeting, oyvindYtrehus.Finally Iextend mygratitudeto allthe authors and participants who contributed to this meeting.

This volume contains the proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), held November 21-23, 2008 in Detroit, Michigan USA. SSS started as the Workshop on Self-Stabilizing Systems (WSS), which was ?rst held at Austin in 1989. From the second WSS in Las Vegas in 1995, the - rum was held biennially, at Santa Barbara(1997),Austin (1999), Lisbon (2001), San Francisco (2003) and Barcelona (2005). The title of the forum changed to the Symposium on Self-Stabilizing Systems (SSS) in 2003. Since 2005, SSS was run annually, and in 2006 (Dallas) the scope of the conference was extended to cover all safety and security-related aspects of self-* systems. This extension followed the demand for self-stabilization in various areas of distributed c- puting including peer-to-peer networks, wireless sensor networks, mobile ad-hoc networks, robotic networks. To re?ect this change, the name of the symposium changed to the International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). This year we received 43 submissions from 13 countries. Most submissions were from the USA and France. Each submission was carefully reviewed by three to six Program Committee members with the help of external reviewers. For the ?rst time a rebuttal phase allowed the authors to react to the reviews beforethediscussionofthepaperswithintheProgramCommittee. Outofthe43 submissions,17excellentpaperswereselectedforpresentationatthesymposium, whichcorrespondsto anacceptancerateof40%. Itcanbenotedthatthehighest acceptance rate was for papers with keywordssensor networks (86%),MANETs (67%),andsecurityof sensorandmobile networksprotocols (67%).

In 2008 the Workshop on Languages and Compilers for Parallel Computing left the USA to celebrate its 21st anninversary in Edmonton, Alberta, Canada. Following its long-established tradition, the workshop focused on topics at the frontierofresearchanddevelopmentinlanguages,optimizingcompilers,appli- tions, and programming models for high-performance computing. While LCPC continues to focus on parallel computing, the 2008 edition included the pres- tation of papers on program analysis that are precursors of high performance in parallel environments. LCPC 2008 received 35 paper submissions. Eachpaper received at least three independent reviews, and then the papers and the referee comments were d- cussed during a Program Committee meeting. The PC decided to accept 18 papers as regular papers and 6 papers as short papers. The short papers appear at the end of this volume. The LCPC 2008 program was fortunate to include two keynote talks. Keshav Pingali's talk titled "e;Amorphous Data Parallelism in Irregular Programs"e; - gued that irregular programs have data parallelism in the iterative processing of worklists. Pingali described the Galois system developed at The University of Texas at Austin to exploit this kind of amorphous data parallelism. The second keynote talk, "e;Generic ParallelAlgorithms in Threading Building Bocks (TBB),"e; presented by Arch Robison from Intel Corporation addressed very practical aspects of using TBB, a production C++ library, for generic p- allel programming and contrasted TBB with the Standard Template Library (STL).

The 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008) took place in Van Mildert College at Durham University, UK, 30 June - 2 July 2008. The approximately 80 participants came from va- ous countries all over the world, among them Australia, Brazil, Canada, Chile, Czech Republic, France, Greece, Hungary,Israel, Italy, Japan, The Netherlands, Norway, Poland, Spain, Switzerland, UK and the USA. WG 2008 continued the series of 33 previous WG conferences. Since 1975, the WG conference has taken place 21 times in Germany, four times in The Netherlands, twice in Austria as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway and now in the UK. The WG conference traditionally aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent researchresults and to identify and exploredirections of future research. The continuing interest in the WG conferences was re?ected in the number and quality of submissions; 76 papers were submitted and in an evaluation p- cess with four reports per submission, 30 papers were accepted by the Program Committee for the conference. Due to the high number of submissions and the limited schedule of 3 days, various good papers could not be accepted. Therewereexcellent invited talks by Giuseppe Di Battista(UniversitaRoma Tre,Italy)onalgorithmicaspectsof(un)-stableroutingintheInternet,byLeszek G?sieniec (University of Liverpool, UK) on memory-e?cient graph exploration, andbyMartinGrohe(Humboldt-UniversitatzuBerlin,Germany)onalgorithmic meta theorems.

This volume collects the accepted papers presented at the Learning and Intelligent OptimizatioN conference (LION 2007 II) held December 8-12, 2007, in Trento, Italy. The motivation for the meeting is related to the current explosion in the number and variety of heuristic algorithms for hard optimization problems, which raises - merous interesting and challenging issues. Practitioners are confronted with the b- den of selecting the most appropriate method, in many cases through an expensive algorithm configuration and parameter-tuning process, and subject to a steep learning curve. Scientists seek theoretical insights and demand a sound experimental meth- ology for evaluating algorithms and assessing strengths and weaknesses. A necessary prerequisite for this effort is a clear separation between the algorithm and the expe- menter, who, in too many cases, is "e;in the loop"e; as a crucial intelligent learning c- ponent. Both issues are related to designing and engineering ways of "e;learning"e; about the performance of different techniques, and ways of using memory about algorithm behavior in the past to improve performance in the future. Intelligent learning schemes for mining the knowledge obtained from different runs or during a single run can - prove the algorithm development and design process and simplify the applications of high-performance optimization methods. Combinations of algorithms can further improve the robustness and performance of the individual components provided that sufficient knowledge of the relationship between problem instance characteristics and algorithm performance is obtained.

This volume contains the papers from BIOWIRE 2007, the first in a series of wo- shops on the bio-inspired design of networks, and additional papers contributed from the research area of bio-inspired computing and communication. The workshop took place at the University of Cambridge during April 2-5, 2007 with sponsorship from the US/UK International Technology Alliance in Network and Information Sciences. Its objective was to present, discuss and explore the recent developments in the field of bio-inspired design of networks, with particular regard to wireless networks and the self-organizing properties of biological networks. The workshop was organized by Jon Crowcroft (University of Cambridge), Don Towsley (University of Massachusetts), Dinesh Verma (IBM T. J. Watson Research Center), Vasilis Pappas (IBM T. J. Watson Research Center), Ananthram Swami (ARL), Tom McCutcheon (DSTL) and Pietro Lio (University of Cambridge). The program for BIOWIRE 2007 included 54 speakers covering a diverse range of topics, categorized as follows: 1. Self-organized communication networks in insects 2. Neuronal communications 3. Bio-computing 4. Epidemiology 5. Network theory 6. Wireless and sensorial networks 7. Brain: models of sensorial integration The BIOWIRE workshop focuses on achieving a common ground for knowledge sharing among scientists with expertise in investigating the application domain (e. g. , biological, wireless, data communication and transportation networks) and scientists with relevant expertise in the methodology domain (e. g. , mathematics and statistical physics of networks).

people volunteer their time and energy and work in a dedicated fashion to pull everything together each year, including our very supportive Steering Comm- tee members led by Sukumar Ghosh. However, the success of ICDCN is mainly due to the hard work of all those people who submit papers and/or attend the conference. We thank you all. January 2009 Prasad Jayanti Andrew T. Campbell Message from the Technical Program Chairs Welcome to the proceedings of the 10thInternationalConferenceon Distributed Computing and Networking (ICDCN) 2009. As ICDCN celebrates its 10th - niversary,ithasbecomeanimportantforumfordisseminatingthelatestresearch results in distributed computing and networking. We received 179 submissions from all over the world, including Algeria, A- tralia, Canada, China, Egypt, France, Germany, Hong Kong, Iran, Italy, Japan, Malaysia, The Netherlands, Poland, Singapore, South Korea, Taiwan, and the USA, besides India, the host country. The submissions were read and evaluated by the Program Committee, which consisted of 25 members for the Distributed Computing Track and 28 members for the Networking Track, with the ad- tional help of external reviewers. The Program Committee selected 20 regular papers and 32 short papers for inclusion in the proceedings and presentation at the conference. We were fortunate to have several distinguished scientists as keynote speakers. Andrew Campbell (Dartmouth College, USA), Maurice Herlihy (Brown University, USA), and P. R. Kumar (University of of Illinois, Urbana-Champaign) delivered the keynote address. Krithi Ramamritham from IIT Bombay, India, delivered the A. K. Choudhury Memorial talk.

Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequently, it is important to analyze and pinpoint the computational complexity of certain algorithmic tasks related to constraint satisfaction. The complexity-theoretic results of these tasks may have a direct impact on, for instance, the design and processing of database query languages, or strategies in data-mining, or the design and implementation of planners.This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006. A number of speakers were solicited to write surveys presenting the state of the art in their area of expertise. These contributions were peer-reviewed by experts in the field and revised before they were collated to the 9 papers of this volume. In addition, the volume contains a reprint of a survey by Kolaitis and Vardi on the logical approach to constraint satisfaction that first appeared in 'Finite Model Theory and its Applications', published by Springer in 2007.

This book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in Spindleruv Mlyn, Czech Republic, in January 2009.The 49 revised full papers, presented together with 9 invited contributions, were carefully reviewed and selected from 132 submissions. SOFSEM 2009 was organized around the following four tracks: Foundations of Computer Science; Theory and Practice of Software Services; Game Theoretic Aspects of E-commerce; and Techniques and Tools for Formal Verification.

It is commonly assumed that computers process information. But what is inf- mation? In a technical, important, but nevertheless rather narrow sense, Sh- non'sinformationtheorygivesa?rstanswertothisquestion.Thistheoryfocuses on measuring the information content of a message. Essentially this measure is the reduction of the uncertainty obtained by receiving a message. The unc- tainty of a situation of ignorance in turn is measured by entropy. This theory hashad an immense impact on the technologyof information storage,data c- pression, information transmission and coding and still is a very active domain of research. Shannon's theory has also attractedmuch interest in a more philosophic look at information, although it was readily remarked that it is only a "e;syntactic"e; theory of information and neglects "e;semantic"e; issues. Several attempts have been made in philosophy to give information theory a semantic ?avor, but still mostly based on or at least linked to Shannon's theory. Approaches to semantic informationtheoryalsoveryoftenmakeuseofformallogic.Thereby,information is linked to reasoning, deduction and inference, as well as to decision making. Further, entropy and related measure were soon found to have important connotations with regard to statistical inference. Surely, statistical data and observation represent information, information about unknown, hidden para- ters. Thus a whole branch of statistics developed around concepts of Shannon's information theory or derived from them. Also some proper measurements - propriate for statistics, like Fisher's information, were proposed.

This volume contains the papers presented at SAT 2009: 12th International Conference on Theory and Applications of Satis?ability Testing, held from June 30 to July 3, 2009 in Swansea (UK). The International Conference on Theory and Applications of Satis?ability Testing (SAT) started in 1996 as a series of workshops, and, in parallel with the growthof SAT, developedinto the main eventfor SAT research. This year'sc- ference testi?ed to the strong interest in SAT, regarding theoretical research,- searchonalgorithms,investigationsintoapplications,anddevelopmentofsolvers and software systems. As a core problem of computer science, SAT is central for many research areas, and has deep interactions with many mathematical s- jects. Major impulses for the development of SAT came from concrete practical applications as well as from fundamental theoretical research. This fruitful c- laboration can be seen in virtually all papers of this volume. There were 86 submissions (completed papers within the scope of the c- ference). Each submission was reviewed by at least three, and on average 4. 0 Programme Committee members. The Committee decided to accept 45 papers, consisting of 34 regular and 11 short papers (restricted to 6 pages). A main n- elty was a "e;shepherding process"e;, where 29% of the papers were accepted only conditionally, and requirements on necessary improvements were formulated by the ProgrammeCommittee and its installment monitored by the "e;shepherd"e; for thatpaper(using possibly severalroundsoffeedback).

This book constitutes the refereed proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009, held in Taipei, Taiwan, in June 2009.The 80 revised full papers were carefully reviewed and selected from 243 submissions. The papers are organized in topical sections on bioinformatics in parallel computing; cluster, grid and fault-tolerant computing; cluster distributed parallel operating systems; dependability issues in computer networks and communications; dependability issues in distributed and parallel systems; distributed scheduling and load balancing, industrial applications; information security internet; multi-core programming software tools; multimedia in parallel computing; parallel distributed databases; parallel algorithms; parallel architectures; parallel IO systems and storage systems; performance of parallel ditributed computing systems; scientific applications; self-healing, self-protecting and fault-tolerant systems; tools and environments for parallel and distributed software development; and Web service.