To be held in conjunction with theThe 30th IEEE International Conference on Computer Communications(IEEE INFOCOM 2011)April 10-15, 2011, Shanghai, China.

Wireless sensor and actor networks (WSAN) are the confluence pointwhere the traditional fields of wireless sensor networks (WSN),robot networks and control theory meet. In WSAN, nodes collaborateto accomplish distributed sensing and actuation tasks. Leveraged bythe control and mobility of actors, the networking process andapplications embrace a whole new set of possibilities. Actors maydeploy, repair and relocate sensors to improve coverage, build routesand fix network partition to ensure data communication, change networktopology to shape routing patterns and balance energy consumption,and respond to reported events in a timely and effective manner.The benefits are limited only by imagination. As an emerging field,WSAN are in need of new networking techniques, by which they can fullyexploit their particularities and potentials. WiSARN aims to bringtogether state-of-the-art contributions on the design, specificationand implementation of architectures, algorithms and protocols forcurrent and future applications of WSAN.

Papers must not exceed 6 single-spaced and two-column pages usingat least 10 point size type on 8.5 x 11 inches pages, and must beformated in strict accordance with the IEEE author guidelines.Submissions are being considered with the understanding that theydescribe original research, neither published nor under reviewelsewhere. Accepted papers will be published in the IEEE DigitalLibrary after the conference and included in INFOCOM 2012 proceedings.Selected best papers will be invited to a special issue ofAd Hoc & Sensor Wireless Networks: an international journal (SCIE).

For further information, please refer to the above WiSARN 2011 website,or contact the program co-chairs:Dr. Jiming Chen at jmchen.zju@gmail.comDr. Hannes Frey at hannes.frey@uni-paderborn.deDr. Xu Li at easylix@gmail.com*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

One of the most eagerly anticipated books for some years has finally been published. It is the first book in the new CiE book series "Theory and Applications of Computability". Please ensure your library orders this mammoth work, a book destined to be a standard reference work in the field for many years.

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

I would like to close by expressing our sadness at the passing of Prof.Jerrold Marsden, co-Chair of the Scientific Program Committee for ICIAM2011 and a member of the Steering Committee, who lost his battle withcancer on September 21, 2010. Jerry's influence and imprint will bestrongly felt in the structure and scientific content of the Congressand his enthusiasm and knowledge will be deeply missed by his colleaguesat ICIAM 2011.

We look forward to seeing you in Vancouver!

Arvind Gupta

President, ICIAM 2011

CEO & Scientific Director, MITACS*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

*The International Max Planck Research School for Computer Science inSaarbrücken*

The International Max Planck Research School for Computer Science(IMPRS-CS) is a graduate school jointly run by the Max PlanckInstitute for Informatics (MPI-INF), the Max Planck Institute forSoftware Systems (MPI-SWS), and the Computer Science Department atSaarland University.MPI-INF and MPI-SWS are among 80 institutes (MPIs) of the Max PlanckSociety. The MPIs are Germany's prime research facilities withworld-class, foundational research in the fields of medicine, biology,chemistry, physics, technology, and the humanities. Since 1948, MPIresearchers have won 17 Nobel prizes, which testifies to the quality and innovation of MPI research programs.

The IMPRS-CS (International Max Planck Research School for ComputerScience) offers a PhD program upon successful completion of whichstudents receive a Doctorate Degree in Computer Science from SaarlandUniversity. The PhD program is supplemented by a Master's program forstudents entering the school with a Bachelor's degree.

During the two to three years period of the PhD program, thecandidates carry out their scientific research within the twoparticipating MPIs or in one of the research groups of the ComputerScience faculty members at Saarland University.

The Master's program comprises a 1.5-year (three semesters) teachingprogram with lectures and seminars. This serves as preparation andqualification for the PhD program. The Master's program includes athesis project and is completed with a Master of Computer Science degree.

The IMPRS-CS awards the students financial support in the form of ascholarship for their participation in the Master's and PhD programs.

*PhD scholarships:*Any student with an excellent Master's or Diploma Degree in ComputerScience or Computer Engineering may apply for our PhD program.

*Master's scholarships:*Any student with a Bachelor's degree in Computer Science or ComputerEngineering is eligible to apply for our Master's program.

The IMPRS-CS holds a funding agreement with Microsoft ResearchCambridge (MSRC), which contributes 15 PhD fellowships in researchareas related to MSRC. Recipients of these fellowships have theopportunity for internships at MSRC and other collaboration with aworld-leading industrial research lab.

Further information, including instructions on how to apply and therespective application deadlines, can be found at:

Kindly forward this information to interested students and colleagues at your university or research institute in your home country.

*We are looking forward to your applications!*

Gerhard Weikum and Jennifer Gerling(Spokesperson and Coordinator of the IMPRS-CS)

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

We are looking for applicants from all areas of algorithmics, includingrelated areas like computer algebra, complexity theory and discretemathematics. We are also explicitly looking for people interested inalgorithm engineering and the design and implementation of algorithmlibraries.

The Max-Planck-Institute for Computer Science is located on the campusof the Universitaet des Saarlandes in Saarbruecken, Germany. Currently,around 40 researchers from several nationalities work in the Algorithmsand Complexity Department. Our working language is English. The groupcollaborates with several of the major research institutions in Europeand the U.S. and has high international visibility. There is generoustravel support available for all group members. Postdoctoralfellowships are available for one or two years. Stipends are 2.300 Europer month, taxfree. Other conditions are possible in some special cases,subject to case-by-case review.

Applications from disabled applicants are appreciated. Our institutesupports the principle of equal opportunity for men and women, and istherefore interested in applications from women.

Applications (including curriculum vitae, list of publications, aresearch plan (1 page is enough), names of references with their e-mailaddresses, intended period of stay, and your two most "interesting"papers (preferably just URLs)) must be sent by email in PDF format toChristina Fries (chfries@mpi-inf.mpg.de) by January 30, 2011. Inaddition, written applications may be sent to

For further information, also on other offers, please refer tohttp://www.mpi-inf.mpg.de/departments/ag1/offers.html*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

funded by the German Science Foundation (DFG) at the three BerlinUniversities offers

several SCHOLARSHIPs

for Ph.D. Studies starting January 15th, 2011 or later.

The scholarships are 1350 EUR (tax-free) per month - according to DFG rules. They are usually granted as 2-year fellowships, extendible by a third year.

The MDS course program consists of the Monday Afternoon Colloquium lectures, block courses, summer schools, regular predoc programs, etc. - all this in a very lively Berlin discrete mathematics context, which also includes the DFG Research Center MATHEON (http://www.matheon.de).

The RTG "Methods for Discrete Structures" is also a registered unit for the "Phase II" part of BERLIN MATHEMATICAL SCHOOL (http://www.math-berlin.de), the joint international graduate program of the three major Berlin universities - which has a lot to offer! Students of the MDS program may apply to be members of the BERLIN MATHEMATICAL SCHOOL.

Applicants for Ph.D. scholarships are expected to have a Diploma/Master's degree or equivalent, usually in Mathematics or Computer Science. Applications for scholarships starting in 2011 consisting of

Please send your application before December 31st, 2010.Applications by email are welcome. If you have applied to BERLIN MATHEMATICAL SCHOOL Phase II, then please just inform us about this - there is no need to submit your materials again.*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/********************************************************************************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Deadline for submissions (abstract, 2 pages): November 16, 2010_____________________________________________________________________*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Best regards,Nikolai K. Vereshchagin, program committee chairandAlexander S. Kulikov, conference chair*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

EWSCS is a series of regional-scope international winter schools heldannually in Estonia. EWSCS are organized by Institute of Cybernetics,a research institute of Tallinn University of Technology.

The main objective of EWSCS is to expose Estonian, Baltic, and Nordicgraduate students in computer science (but also interested studentsfrom elsewhere) to frontline research topics usually not coveredwithin the regular curricula. The working language of the schools isEnglish.

EWSCS '11 is the sixteenth event of the series.

PROGRAMME

The schools' scientific programme consists of short courses byrenowned specialists and a student session.

The purpose of the student session is to give students an opportunityto present their work (typically, thesis work) and getfeedback. Registrants are invited to propose short talks (20 min) ontopics of theoretical computer science, broadly understood. Theselection will be based on abstracts of 150-400 words.

The social programme consists of an excursion and a conference dinner.

VENUE

Palmse is a small settlement 80 kms to the east from Tallinn in thecounty of Laeaene-Viru. It is renowned for a large manor thatused to belong to the von Pahlen family, today hosting the visitors'center of the Lahemaa National Park, a museum, and a hotel.

Tallinn, Estonia's capital, is famous for its picturesque medieval OldTown, a UNESCO World Heritage site. In 2011, Tallinn, along with Turkuin Finland, is the cultural capital of Europe. There are directflights to Tallinn Lennart Meri airport from Amsterdam, Brussels,Copenhagen, Dublin, Duesseldorf Weeze, Edinburgh, Frankfurt,Gothenburg, Helsinki, Kiev, London Gatwick, Luton and Stansted, MilanBergamo and Malpensa, Moscow, Munich, Oslo Gardermoen and Rygge,Prague, Riga, Stockholm Arlanda and Skavsta, St Petersburg, Warsaw andVilnius, ferries from Stockholm and Helsinki. From Vilnius, Riga, StPetersburg the Lux Express coach services are the practical traveloption.

APPLICATION AND COST

The deadline for application and submission of student talk abstractsis 14 January 2011. All applicants will be notified of admission tothe school and acceptance of their talks by 28 January 2011.

Admitted applicants are entitled and expected to attend the coursesand student session of the school. They will also receive a binderwith the course material and access to additional materials on theschool website.

The participation fee is 320 EUR and includes full board accommodationat Palmse, transportation from Tallinn to Palmse, the excursion andconference dinner (by contributing towards the associated expense).

We may be able to reduce the fee for a small number of participants.To apply for fee reduction, please fill in the online fee reductionrequest form.

I have been assured that they are looking for the strongest candidate, regardless of field. In particular, the attribute "computer-oriented" included in the advertisement should not discourage otherwise strong candidates who feel they might fall short of this expectation.

While the Technical University is not the same as the University of Hamburg, the graph theory group at the University of Hamburg hopes that the successful candidate will be able and willing to foster close links between the two.

For candidates whose native language is not German it may be possible to negotiate conditions that will allow them to delay the point in time from which they are expected to teach in German.

Reinhard Diestel

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

I have been assured that they are looking for the strongest candidate, regardless of field. In particular, the attribute "computer-oriented" included in the advertisement should not discourage otherwise strong candidates who feel they might fall short of this expectation.

While the Technical University is not the same as the University of Hamburg, the graph theory group at the University of Hamburg hopes that the successful candidate will be able and willing to foster close links between the two.

For candidates whose native language is not German it may be possible tonegotiate conditions that will allow them to delay the point in time from which they are expected to teach in German.

Reinhard Diestel

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Today most computer scientists believe that NP-hard problems cannot besolved by polynomial-time algorithms. From the polynomial-timeperspective, all NP-complete problems are equivalent but theirexponential-time properties vary widely. Why do some NP-hard problemsappear to be easier than others? Are there algorithmic techniques forsolving hard problems that are significantly faster than theexhaustive, brute-force methods? The algorithms that address thesequestions are known as exact exponential algorithms.

The history of exact exponential algorithms for NP-hard problems datesback to the 1960s. The two classical examples are Bellman, Held andKarp's dynamic programming algorithm for the traveling salesmanproblem and Ryser's inclusion–exclusion formula for the permanent of amatrix. The design and analysis of exact algorithms leads to a betterunderstanding of hard problems and initiates interesting newcombinatorial and algorithmic challenges. The last decade haswitnessed a rapid development of the area, with many new algorithmictechniques discovered. This has transformed exact algorithms into avery active research field. This book provides an introduction to thearea and explains the most common algorithmic techniques, and the textis supported throughout with exercises and detailed notes for furtherreading.

The book is intended for advanced students and researchers in computerscience, operations research, optimization and combinatorics.

Fedor Fominhttp://www.ii.uib.no/~fomin/*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

We cordially invite you to look at the summary information below about the highlights on tutorials and keynotes (the technical program is available at the URL: http://www.icdcn.org) and to join us at the Conference in wonderful Bangalore in January 2011 (note that early registration deadline is upcoming: November 30, 2010).

Organized by Infosys Technologies, Bangalore, and IIIT-Bangalore, the 12th International Conference on Distributed Computing and Networking (ICDCN 2011) will be held in Bangalore, India, during January 2-5, 2011. Over the years, ICDCN has become a leading forum for disseminating the latest research results in distributed computing and networking.The conference will have a full day of 4 tutorials and 3 workshops on January 2, followed by the main conference on January 3-5. The main conference will have an industry track consisting of well-renowned invited speakers from industry and a panel discussion. Here are the highlights:

Local Arrangements Srinivas Padmanabhuni Amitabha Das Infosys Technologies, IndiaDebabrata Das IIIT, India*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

After six annual meetings in China ('04-'09) and one in Czech Republic ('10), TAMC2011 will be held in Japan, at the University of Electro-Communications, approximately 10 miles southwest of the Shinjuku district in Tokyo.

AIM AND SCOPE

TAMC aims at bringing together a wide range of researchers with interestsin computational models and their applications. The main themes of theconference are computability, complexity, and algorithms. The topics ofinterest include (but are not limited to):

A submission must be typeset with LaTeX using the Springer-Verlag LectureNotes style. Its length must be no more than ten pages. A clearly markedappendix may be added, but it will be read at the discretion of PC.Submission of papers accepted for publication in journals is notpermitted. Nor is simultaneous submission to other conferences withpublished proceedings.

PROCEEDINGS

The conference proceedings will be published as a volume in Lecture Notesin Computer Science.

JOURNAL SPECIAL ISSUES

A special issue of selected papers from TAMC2011 in Theoretical ComputerScience is being planned. Another TAMC special issue may be published inMathematical Structures in Computer Science.

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

We would like to draw your attention to the re-launch of the InternetMathematics journal, the leading reference for fast-breaking research inthe field of complex networks.

In the renewed journal, the scope is broadening:-- high-quality papers from all areas of complex networks will beaccepted, such as those on the web graph, Internet graph, online socialnetworks, wireless networks, and biological networks.-- In addition to more mathematically oriented papers, the journal willaccept experimental and empirical works reporting on important newdiscoveries.

Internet Mathematics is a highly cited journal known for outstandingquality of the board and efficient peer-review process.

Tel: +31(53)4893388 Fax: +31(53)4893069*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

UNIVERSITY OF BIRMINGHAMSchool of MathematicsCollege of Engineering and Physical Sciences

Research fellow in Graph Theory.

Starting salary 27,319 a year, in a range up to 35,646 a year, with potential progression to 37,839 a year.

Post is available for a period of up to 3 years from 1st March 2011 or later by mutual agreement.

The University invites applications for a Research fellow to work with Dr Daniela Kuhn on an ERC-funded project in Extremal and Probabilistic Graph Theory.

Applicants will be expected to hold a first degree in an area of Mathematics and normally hold a PhD degree in Combinatorics or equivalent qualifications. Applicants should also possess a proven research track record in Graph Theory.

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

=========================================================Our apologies if you receive multiple copies of this CFP=========================================================

The Second Nordic Workshop onSystem and Network Optimization for Wireless:-----------------------------------------------SNOW-----------------------------------------------24-26 March 2011, Sälen, Sweden-----------------------------------------------webpage: http://snow.itn.liu.se

The Second Nordic Workshop on System and Network Optimization for Wireless (SNOW) aims at bringing together Researchers and Students from the Academia working in wireless networking, primarily in the Nordic region.This year, the Nordic SNOW Workshop aims to have a special focus on broadband cellular access (HSPA, LTE/LTE-A, etc) and emerging wireless networking paradigms such as collaborative and heterogeneous networking. We further welcome presentations within a broad range of wireless networking cross-layer optimization, from fundamental communication performance analysis to considerations for multimedia QoS.Our goal is to have a single track meeting with lively scientific discussions and exchange of views, and to accommodate a wide variety of backgrounds and research attitudes. The program will be organized in such a way to promote networking activities between the participants, including daily social outdoors activities like skiing.

Registration and Costs:-----------------------Registration of accepted presenters and workshop attendants will be done online through the workshop webpage. No registration fee will be charged. Participants will have to support their own lodging and transportation costs.

Venue and transportation:-------------------------The 2nd Nordic SNOW workshop will take place at the Swedish ski resort of Stöten in Sälen. Stöten has direct access to 27 individual slopes, served by 15 ski lifts and provides snow guarantee up to the last week of April: http://www.stoten.se/

A limited number of single and double rooms have been block booked (in a package of 4 nights from 23 to 27 of March) at the Stöten Hotel and at 2- bedroom apartments in Stöten Mitt.We strongly urge the participants to prefer the apartments in line with the networking spirit of the workshop.-- For details visit: http://snow.itn.liu.se

Travel information------------------Stöten is mainly reachable through the town of Mora in Sälen. From Mora, there is a 1.5 hrs drive by bus, or car rental. We shall arrange to have 2 busses at two fixed times (to be announced) from Mora on Wednesday March 23rd.* Flying to Mora:Operated by Nextjet: http://www.nextjet.se/On Wednesday 23 March there are two direct flights from Stockholm's Arlanda Airport (ARN) to Mora (MXX).* By Train to Mora:Operated by SJ: http://www.sj.seThere are train departures to Mora from the Stockholm central train station every 45', with a trip duration ranging approximately 3:30 – 4 hrs.

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The Information Theory research group at Aalto University,Helsinki, Finland, led by Professor Patric Ostergard(http://users.tkk.fi/u/pat/), has an open

PhD Position in Combinatorial Algorithms

The Information Theory group at Aalto University does research on a widevariety of topics within discrete mathematics, including coding theory,combinatorial algorithms, and design theory. In particular, studies onclassification of basic combinatorial structures have been pursued(P. Kaski & P.R.J. Ostergard, Classification Algorithmsfor Codes and Designs, Springer, Berlin, 2006). Members of theresearch group have twice---in 2005 and 2009---been awarded the prize forthe best dissertation of the year at the university.

The main topic of the research work within the open position will bealgorithms for various combinatorial packing, covering, and tilingproblems. The applicant should have an excellentMaster's degree in mathematics or computer science, excellentprogramming skills (C), and documented knowledge (and perhaps evensome research, but this is not necessary) in some of the fieldslisted above, or in discrete mathematics and algorithms more generally.

The position will be filled for the period 1.2.2011 (or later)--31.12.2013.The position is fully paid, with a starting salary of 2000--2600 EUR permonth before taxes. Minor participation in teaching duties is assumed.

-a CV and (if applicable) a list of publications,-copies of relevant study transcripts and diplomas,-one or two letters of reference, and-a short English text as well as a C program written by the applicant

should be sent by regular mail---as soon as possible,but no later than December 31, 2010---to

To be held in conjunction with theThe 30th IEEE International Conference on Computer Communications(IEEE INFOCOM 2011)April 10-15, 2011, Shanghai, China.

Wireless sensor and actor networks (WSAN) are the confluence pointwhere the traditional fields of wireless sensor networks (WSN),robot networks and control theory meet. In WSAN, nodes collaborateto accomplish distributed sensing and actuation tasks. Leveraged bythe control and mobility of actors, the networking process andapplications embrace a whole new set of possibilities. Actors maydeploy, repair and relocate sensors to improve coverage, build routesand fix network partition to ensure data communication, change networktopology to shape routing patterns and balance energy consumption,and respond to reported events in a timely and effective manner.The benefits are limited only by imagination. As an emerging field,WSAN are in need of new networking techniques, by which they can fullyexploit their particularities and potentials. WiSARN aims to bringtogether state-of-the-art contributions on the design, specificationand implementation of architectures, algorithms and protocols forcurrent and future applications of WSAN.

Papers must not exceed 6 single-spaced and two-column pages usingat least 10 point size type on 8.5 x 11 inches pages, and must beformated in strict accordance with the IEEE author guidelines.Submissions are being considered with the understanding that theydescribe original research, neither published nor under reviewelsewhere. Accepted papers will be published in the IEEE DigitalLibrary after the conference and included in INFOCOM 2012 proceedings.Selected best papers will be invited to a special issue ofAd Hoc & Sensor Wireless Networks: an international journal (SCIE).

For further information, please refer to the above WiSARN 2011 website,or contact the program co-chairs:Dr. Jiming Chen at jmchen.zju@gmail.comDr. Hannes Frey at hannes.frey@uni-paderborn.deDr. Xu Li at easylix@gmail.com------------------------------------------------------------------------*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Scatter search (SS) is an evolutionary, population-based approach that has been proposed in the late 1970s. SS combines diversification and intensification methods to find good solutions for difficult optimization problems. Path relinking (PR) is a generalized form of SS where paths are generated between and beyond good solutions in neighborhood space, rather than in Euclidean space. SS and PR have been successfully applied to a wide range of optimization problems (e.g. single and multi-objective routing, scheduling, nonlinear optimization, optimization in graphs, neural network training, simulation optimization, unconstrained function optimization, etc.).

One difference between SS/PR and other evolutionary and swarm-based approaches is that SS and PR place greater emphasis on strategic designs to combine solutions in contrast to the strong emphasis on randomization in other methods. Another difference is the focus on incorporating adaptive memory strategies, which derives from the SS/PR association with tabu search. These differences have resulted in producing proposals that are useful for exploiting structure and for equipping a method to learn from the search history.

OBJECTIVE OF THE SPECIAL ISSUE:

The main goals of this special issue are to familiarize the swarm intelligence community with the concepts of SS and PR and to allow researchers to consider ways that SS and PR may provide useful contributions to the swarm perspective.

RECOMMENDED TOPICS:Topics to be discussed in this special issue include (but are not limited to) the following:

- Using concepts from SS and PR within a swarm-based method (e.g. PSO, ACO, etc.)- Using concepts from swarm-based approaches in SS/PR methods.- Comparing the performance of SS/PR and swarm-based methods when applied to some optimization problems.- Real-world, complex or novel applications of SS and PR.- Proposing new SS/PR variants.- Developing swarm-based approaches that utilize strategic designs in place of randomization

SUBMISSION PROCEDURE:Researchers and practitioners are invited to submit papers for this special theme issue on scatter search and path relinking methods on or before November 15, 2010. All submissions must be original and may not be under review by another publication. INTERESTED AUTHORS SHOULD CONSULT THE JOURNAL'S GUIDELINES FOR MANUSCRIPT SUBMISSIONS at http://www.igi-global.com/development/author_info/guidelines submission.pdf. All submitted papers will be reviewed on a double-blind, peer review basis. Papers must follow APA style for reference citations.

ABOUT International Journal of Swarm Intelligence Research (IJSIR):The mission of the IJSIR is to become a leading international and well-referred journal in swarm intelligence, nature-inspired optimization algorithms, and their applications. This journal publishes original and previously unpublished articles including research papers, survey papers, and application papers, to serve as a platform for facilitating and enhancing the information shared among researchers in swarm intelligence research areas ranging from algorithm developments to real-world applications

PUBLISHER:The International Journal of Swarm Intelligence Research (IJSIR) is published by IGI Global (formerly Idea Group Inc.), publisher of the 'Information Science Reference' (formerly Idea Group Reference) and 'Medical Information Science Reference' imprints. For additional information regarding the publisher, please visit www.igi-global.com.

All submissions should be directed to the attention of:

Mahamed G.H. OmranGuest EditorInternational Journal of Swarm Intelligence ResearchE-mail: omran.m@gust.edu.kw*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

----------------------------------------------------------------------- Our apologies if you receive duplicates of this posting. Please feel free to distribute it to those who might be interested. -----------------------------------------------------------------------

Authors are invited to submit original unpublished manuscripts thatdemonstrate current research on computational aspects of distributedsensor systems. Topics of interest include but are not limited to:

IMPORTANT DATESPaper submission: Feb 4, 2011Notification: March 25, 2011Camera-ready: April 11, 2011*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

SCOPEWireless sensor and robot networks (WSRN) are the confluence point where the two traditional fields of wireless sensor networks (WSN) and robot networks meet, and nodes collaborate to accomplish distributed sensing and actuation tasks. Leveraged by the control and mobility of robots, the networking process and applications embrace a whole new set of possibilities.

The objective of this special issue is to bring together state-of-the-art contributions on the design, specification, and implementation of architectures, algorithms and protocols for current and future applications of WSRN. Original, unpublished contributions are solicited in ALL aspects of WSRN and traditional WSN, robot networks, as well as robotics and automation. Possible topics of interest include, but are certainly not limited to the following:

* Autonomous sensor networks* Emergent behavior in WSRN* Distributed control and management in WSRN* Modeling, simulation and experimentation of WSRN* Autonomic and self-organizing communication and coordination* Robot task assignment and mobility management* Biologically inspired communication* Data management, gathering, aggregation and query processing in WSRN* Location service, neighborhood discovery and service discovery in WSRN* Map exploration and pattern formation and flocking of mobile robots* Localization and time synchronization in WSRN* Energy efficiency, Quality of Service and robustness issues in WSRN* Architectures, coverage and topology control in WSRN* Probabilistic integration in WSRN* Applications and prototypes of WSRN

PAPER SUBMISSION* The submitted papers must be written in English and describe original research which is not published nor currently under review by other journals or conferences. Author guidelines for preparation of manuscript can be found at http://www.ees.elsevier.com/comcom.

* The submission website for this journal is located at http://ees.elsevier.com/comcom.To ensure that all manuscripts are correctly identified for inclusion into the Special Issue, the authors have to select "Special Issue: WSRN" when they reach the "Article Type" step in the submission process.

Friday, November 19, 2010

-------------------------------------------------------------------------DIMAP Workshop on Combinatorics and Graph Theory4-7 April, 2011, University of Warwick, UK-------------------------------------------------------------------------The recently established Centre for Discrete Mathematics andits Applications (DIMAP) at the University of Warwick (UK)is organizing a series of workshops on different emergingresearch topics. From 4 to 7 April 2011, we will be holdinga workshop on

"Combinatorics and Graph Theory".

The idea is to bring together the best people in the fieldto discuss the latest developments as well as future directions.Keynote talks will be given by the following speakers:

Thursday, November 18, 2010

Microsoft Research New England has available postdoc positions in various areas (including theoretical CS) for the next academic year. The deadline to apply is December 1st. Please see http://research.microsoft.com/en-us/jobs/fulltime/postdoc.aspx for more details. Some candidates may also want to apply to the joint MIT/MSR Schramm postdoctoral fellowship in probability theory and discrete mathematics (same deadline, apply through MIT). We also have summer internship positions as well for graduate students- email Irene Money at msrnejob@microsoft.com for details on how to apply.

Authors are invited to submit an extended abstract or a full paper of at most12 pages, not including references, in the LNCS format (LaTeX, as pdf; finalversion with source); instructions are here:http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0Proofs and other material omitted due to space constraints are to be put intoa clearly marked appendix to be read at discretion of the referees. Papersmust present original (and not previously published) research. Simultaneoussubmission to journals or to other conferences with published proceedings isnot allowed. The proceedings of the symposium will be published in Springer'sLNCS series.

On behalf of the Organizing Committee, we invite you to participate in thespecial session (workshop) on "APPLICATIONS OF METAHEURISTICS TO LARGE-SCALEPROBLEMS" at the 7th International Conference on Large Scale ScientificComputation - LSSC'11, June 6 - 10, 2011, Sozopol, Bulgaria, with arrival:June 5 and departure: noon June 10.

The session is organized by:Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)from the Institut of Information and Communication Technologies (formerInstitute for Parallel Processing), Bulgarian Academy of Sciences andGabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.

Carlos Cotta from University of Malaga, Spain will be a key lecture of ourspecial sesssion.

ProceedingsWe plan to continue publishing the proceedings of only refereed andpresented papers as a special volume of Springer Lecture Notes in ComputerScience (LNCS).

Important deadlines Deadline for submission of abstracts January 15, 2011 Notification of acceptance of the talks on the basis of the submittedabstract January 31, 2011 Deadline for submission of full papers March 15, 2011 Notification of acceptance of full papers April 30, 2011

Abstracts and contributed papersThe abstracts (up to 1 page stating clearly the originality of the results)are to be written in standard LaTeX. The length of the contributed papers islimited up to 8 pages. It is assumed that one participant will present notmore than one talk.

Send the abstracts and papers to special session organizers and conferenceorganizers, indicating the name of the special session. After sending theabstract go to the conference web page and fill in the registration form(personal data of the participants, minimum one per paper, and the name ofthe special session).

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Deadline for submissions (abstract, 2 pages): November 16, 2010_____________________________________________________________________*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************