Saturday, January 30, 2010

AOFA '10 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms

Vienna University of Technology (AUSTRIA) June 28-July 2, 2010

with a Mini-Summerschool from June 25-26, 2010

Scope-----

This conference is the first joint meeting of two previous conference and seminar series on"Mathematics and Computer Science" and "Analysis of Algorithms". The common aim of these and thepresent meeting is to study discrete objects that appear as data structures or algorithms(including graphs, networks etc.) by mathematical methods, in particular by probabilistic,combinatorial and asymptotic methods.

The Organizers*********************************************************** * 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/***********************************************************

Oberwolfach seminars are open to young researchers (pre- and post-doc).The number of participants is restricted to 25. The Institute coversaccommodation and food, travel expenses can be reimbursed up to 200 Euroin average per person.

*********************************************************** * 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/***********************************************************

Friday, January 29, 2010

I am writing to inform you of a new collaborative graduate program in quantum information at the University of Waterloo, in conjunction with the Institute for Quantum Computing, the Departments of Applied Mathematics, Chemistry, Combinatorics & Optimization, Electrical & Computer Engineering, and Physics & Astronomy, and the David R. Cheriton School of Computer Science.

We would appreciate your help in spreading the word about this new program and about graduate research at IQC in general. More information about the program and how to apply is available at www.iqc.ca/positions/graduate/ and general information about IQC is available at www.iqc.ca .

The Ontario Council on Graduate Studies (OCGS) recently approved this new program, and we are ready to process applications for entry in Fall 2010.

Thank you in advance for sharing this news with students who may be interested.

Best regards,

Michele Mosca

Deputy Director, Institute for Quantum Computing, University of Waterloo

The University of Waterloo, in collaboration with the Institute for Quantum Computing, offers graduate students unique opportunities to learn about and engage in world-leading research in quantum information through a wide range of advanced research projects and advanced courses on the foundations, applications and implementations of quantum information processing.

The new collaborative graduate program in Quantum Information leads to MMath, MSc, MASc, and PhD degrees. Students complete the requirements of both their home program and the specific requirements of the quantum information (QI) program to achieve the special QI designation. (E.g., MMath in Computer Science (Quantum Information), PhD in Chemistry (Quantum Information), MASc in Electrical and Computer Engineering (Quantum Information)).

MMath, MSc, and MASc students will receive a strong and broad foundation in quantum information science, coupled with knowledge and expertise from their home program. This will prepare them for the workforce or further graduate studies and research leading towards a PhD.

PhD students will be prepared for careers as scholars and researchers, with advanced expertise in quantum information science, along with the focus of their home program. The new program is designed to provide knowledge of quantum information, including theory and implementations, their home program discipline, and also developed advanced expertise in their particular research area within quantum information.

At present, IQC has a critical mass of expertise in several major research areas within quantum information, including:

Quantum Algorithms and Complexity

Quantum Information and Communication

Quantum Cryptography

Quantum Error Correction and Fault-tolerance

Spin-based implementations

Quantum Optics-based implementations

Nanoelectronics-based implementations.

New State-of-the-Art Building

In line with the expansion goals of the Institute for Quantum Computing, a new, state-of-the-art building for the Institute is on the way, as part of the Mike and Ophelia Lazaridis Quantum-Nano Centre (QNC). The building will contain a new fabrication and metrology facility, and a suite of laboratories for research in areas including quantum optics, nuclear magnetic resonance (NMR) and electron spin resonance (ESR), quantum dots, superconducting qubits, coherent spintronics and quantum cryptography. The building will host IQC researchers from all three faculties (Engineering, Mathematics and Science) starting in 2011, and will have formal and informal meeting spaces designed to facilitate interaction and interdisciplinary research.

Courses

Students in all three faculties will be required to take two core quantum information courses (and must also meet the course requirements of their home program). These interdisciplinary courses provide a strong foundation in quantum information science.

The two required core quantum information courses are:

QIC 710: Quantum Information Processing

QIC 750: Implementation of Quantum Information Processing

PhD students are also required to take two additional courses in quantum information, and fulfill a research seminar requirement, a comprehensive exam and a thesis in quantum information

In addition to the two core courses, students will be able to take a wide range of advanced courses within quantum information, offered by leading researchers in the field.

Eligible supervisors include the core IQC faculty:

Jonathan Baugh

Andrew Childs

Richard Cleve

Joseph Emerson

Thomas Jennewein

Raymond Laflamme

Debbie Leung

Adrian Lupascu

Norbert Lütkenhaus

Hamed Majedi

Michele Mosca

Ashwin Nayak

Ben Reichardt

Kevin Resch

John Watrous

Frank Wilhelm

as well as a wide range of Associate and Affiliate Members of IQC and the University of Waterloo, including:

Daniel Gottesman

Thorsten Hesjedal

Achim Kempf

David Kribs

Jan Kycia

Anthony Leggett

Robert Mann

James Martin

Roger Melko

Bill Power

Pierre-Nicholas Roy

Contact Information:

Inquiries can be directed to Michele Mosca, Program Director at grad@iqc.ca .

Following the workshops in Wroclaw, Poland, Dortmund, Germany, andBirmingham, UK, the 4th workshop on Theory of Randomized SearchHeuristics (ThRaSH'2010) will take place in Paris on the 24th and25th of March 2010. The purpose of the workshop is to addressquestions related to theory of randomized search heuristics such asevolutionary algorithms, ant colony optimization, or simulatedannealing for both combinatorial and numerical optimization. Theprimary focus lies on discussing recent ideas and detectingchallenging topics for future work, rather than on the presentationof final results.

Researchers working on theoretical aspects of randomized searchheuristics are invited to submit a short abstract (one single page)by email to "thrash2010@lri.fr". No registration fee will be chargedbut participants are asked to register before the workshop.*********************************************************** * 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/***********************************************************

LOCATION:The conference will take place in the premisses of Charles University in the historic center of Prague, the capital of the Czech Republic. Six previous annual meetings were held in 2004-2009, in Beijing, Shanghai, Xi'an, and ChangSha, with enthusiastic participation from researchers all around the world. In 2010, the conference is organized for the first time in Europe.

SUBMISSIONS:The submission must not exceed 10 pages in Springer-Verlag Lecture Notes LaTeX style. A clearly marked appendix that will be read at the discretion of the program committee may be added. Simultaneous submission of papers to any other conference with published proceedings or submitting papers previously accepted for journal publication is not allowed. Only electronic submissions in postscript or pdf formats are accepted.

PROCEEDINGS:Invited papers and accepted contributions will be published in the conference proceedings in Lecture Notes in Computer Science, Springer-Verlag. A special issue of Theoretical Computer Science published by Elsevier containing selected contributions presented at the conference is planned.

*********************************************************** * 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/***********************************************************

Institute of Informatics of Academy of Sciences of Tatarstan Republic, and Kazan State University

SUBMISSIONS:

Authors are invited to submit an up to 6 pages abstract which provides an essence of results allowing the program committee to evaluate the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal. Submissions of original or already presented research are welcome. Submissions should be in Postscript or PDF format and should be sent to HPC.CSR2010@gmail.com by February 25, with a subject "Submission". We're applying to publish the extended versions of abstracts in Electronic Proceedings in Theoretical 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/***********************************************************

The newly founded Doctoral College (DK) inDISCRETE MATHEMATICS offers an advanced PhD training andresearch program which is run jointly byGraz University of Technology, University of Graz,and Montanuniversität Leoben, Austria. It is funded by theAustrian Science Fund (FWF) and the three supportinguniversities. We offer 10 PhD positions for up to 4 years and asalary of approximately 25600 Euro per year (before taxes),starting at the earliest with October 1, 2010.The official language of the DK is English.For details as well as the formal application criteria, see

Later applications may be considered at a later stage.With a view toward increasing the number of femalemathematicians, female candidates are especially encouragedto apply.*********************************************************** * 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/***********************************************************

JOB ANNOUNCEMENT 1 Post-Doctoral Position at the Vienna University of Technology

The position is associated to the project "Fuzzy Logics: from Mathematics to Medical Application" funded by the Vienna Science and Technology Fund WWTF. The project is a cooperation between the Vienna University of Technology (Dr. Agata Ciabattoni) and the Medical University of Vienna (Univ.-Prof.Dr.Klaus-Peter Adlassnig). Further details can be found athttp://www.logic.at/WWTF016/.

* Candidates are expected to have very good knowledge in mathematical logic, knowledge representation and/or formal ontologies. They should have (or shortly expect to receive) a PhD in Computer Science, Artificial Intelligence or a closely related field.* The post is for a fixed term appointment of up to 24 months.* Application deadline is March 8, 2010.* The application, containing the candidate's cv, a short description of his/her research interests and achievements and at least one recommendation letter, should be sent to postdoc2010@logic.at.

available at the centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick. The studentships cover a stipend and tuition fees for UK/European students.

DIMAP is a multidisciplinary research centre supporting an internationally competitive programme of research in algorithms, combinatorics, optimisation, and probability. Potential research areas include

DIMAP offers a stimulating, internationally well-connected research environment with a wide range of research expertise in Combinatorics, the Theory of Computing, and Operations Research.

The PhD studentships are within the Warwick Mathematics Institute. In the 2008 research ranking of all UK universities (RAE) Warwick's Pure Mathematics was rated second, and Applied Mathematics came equal first (with Oxford and Cambridge) for the proportion of its research rated as "world leading".

-Amin Coja-Oghlan*********************************************************** * 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/***********************************************************

Due to numerous requests, the SIROCCO 2010 deadline is moved by twodays, to Tuesday, February 2, 2010.For more details about SIROCCO 2010, seehttp://www.sirocco2010.boun.edu.tr/.

Looking forward to your submissions,

Boaz Patt-ShamirSIROCCO 2010 pc chair

-- David IlcinkasSIROCCO publicity 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/***********************************************************

Abstract submission: March 26, 2010Notification date: April 11, 2010Abstract final version: April 25, 2010Workshop: July 9, 2010Submission of full paper for the proceedings: September 5, 2010

Strategies are ubiquitous in programming languages, automateddeduction and reasoning systems, yet only since about ten years havethey been studied in their own right. In the two communities ofRewriting and Programming on one side, and of Deduction and Proofengines (Provers, Assistants, Solvers) on the other side, workshopshave been launched to make progress towards a deeper understanding ofthe nature of strategies, their descriptions, their properties, andtheir usage, in all kinds of computing and reasoning systems. Sincemore recently, strategies are also playing an important role inrewrite-based programming languages, verification tools and techniqueslike SAT/SMT engines or termination provers. Moreover strategies havecome to be viewed more generally as expressing complex designs forcontrol in computing, modeling, proof search, program transformation,and access control.

Possible topics to address in this workshop include:* Foundations for the definition and semantic description of strategies: models of search spaces, logical or mathematical formalisms to define strategies and prove properties about them.* Properties of strategies and corresponding computations: logical or mathematical formalisms to prove properties about them.* Analysis and optimization techniques for strategies: analysis of the search space, evaluation and comparison of strategies.* Integration of strategic deductions and/or strategic computations: interrelations, combinations and applications of deduction and computation under different strategies, control issues and strategies in theintegration of systems, strategies in decision procedures for SMT.* Strategy languages: essential constructs, meta-level features. Definition, design, implementation and application. Comparison of strategies in (existing) systems.* Concrete types of (reduction/evaluation) strategies in rewriting and programming, lambda calculi, normalization, narrowing, constraint solving, as well as their properties and characteristics (complexity, decidability, ...).* Applications and case studies in which strategies play a major role.

FLoC 2010 provides an excellent opportunity to foster exchanges betweenthe communities of Rewriting and Programming on one side, and of Deductionand Proof engines on the other side. This workshop is a joint follow-up oftwo series of workshops, held since 1997: the Strategies workshops held by theCADE-IJCAR community and the Workshops on Reduction Strategies (WRS) heldby the RTA-RDP community.

Submissions----------

The submission process is in two stages.

1) Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in the EasyChair class style

Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop.

2) After the workshop, authors will be invited to submit a full paper of their presentation (typically a 15-pages paper), which will be refereed and considered for publication in the electronicjournal: Electronic Proceedings in Theoretical Computer Science(http://eptcs.org).

Beyond original ideas and recent results not published nor submittedelsewhere, we also invite authors to submit a 5-pages abstract describingrelevant work that has been or will be published elsewhere, or work inprogress. These submissions will be only considered for presentationat the workshop and inclusion in the preliminary proceedings but notin the final proceedings.

Applications are invited for one postdoc and one PhD student position at Durham University, UK.The positions are within the EPSRC-funded project "Submodular optimization, lattice theory, andmaximum constraint satisfaction problems". A short description of the project can be found here:http://gow.epsrc.ac.uk/ViewGrant.aspx?GrantRef=EP/H000666/1

The postdoc position is for three years. The candidates should have (or be close to completing)a PhD in Mathematics or Computer Science, and have excellent knowledge of at least two of thefollowing areas: algorithms, computational complexity, combinatorial optimization, discretemathematics, and algebra. The starting salary is (up to) 31,671 pounds per year.Applications for the postdoc position should be made through the following website:http://www.dur.ac.uk/jobs/ (reference 3667)

A PhD studentship for 3.5 years is available within this project. The current maintenance paymentfor studentship is 13,290 pounds per year. The UK/EU tuition fee is paid by the project.Applications materials for PhD studentship (including CV and the names of two referees) shouldbe sent by email to Dr Andrei Krokhin.

*********************************************************** * 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/***********************************************************

This minicourse will focus on theoretical and computational techniques foroptimization problems with algebraic structure (in particular, thoseinvolving polynomial equations and inequalities), emphasizing theconnections with techniques based on semidefinite programming (SDP). Thecourse will develop in a parallel fashion several algebraic and numericalapproaches to polynomial systems, with a view towards methods thatsimultaneously incorporate both elements. We will study both the complexand real cases, developing techniques of general applicability, andstressing convexity-based ideas, complexity results, and efficientimplementations. We will use examples from several applied math and engineering areas,including systems and control, geometric theorem proving, and classicaland quantuminformation theory. Among the topics covered we will have: semidefiniterelaxations, sum of squares representations, hyperbolic polynomials, SDPrepresentability of convex sets, complex and real Nullstellensatz, convexalgebraic geometry, sparsity and rank minimization problems, etc.

*********************************************************** * 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/***********************************************************

Attractions===========The conference venue is in historic Oaxaca, part of a UNESCO World HeritageSite along with the nearby Monte Alban archaeological site. There are plentyof interesting and enriching attractions, both natural and historic, in theregion around Oaxaca. There will be a conference excursion to explore someof these areas.

Sponsors========This conference is sponsored by Microsoft Research, Yahoo! Research,the University of Waterloo, and the University of Oaxaca (UABJO).

*********************************************************** * 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 Reykjavik Combinatorics Group announces a postdoc positionstarting in the Fall of 2010 (exact starting date is negotiable). Theposition will be for up to two years and is funded as part of a Grantfor Excellence from the Icelandic Research Fund. (This is dependenton continued funding, which should be clear before the applicationdeadline.) The salary will be 330.000 ISK/month.

Applications, including a CV, should be sent by email toeinarst@ru.is. Also, please arrange to have three letters ofrecommendation sent to the same address. To ensure consideration,applications should be submitted by February 28, 2010, but laterapplications may be considered.

We are looking for candidates with research interests in Enumerativeand Algebraic Combinatorics and Combinatorics on Words, who willbenefit from working with us and who will contribute to the group'swork.

Mark DukesScience Institute, University of IcelandDunhaga 5, 107 Reykjavik, Icelande: dukes@hi.ist: +354 525 5871w: http://www.hi.is/~dukes*********************************************************** * 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/***********************************************************

Since the first conference held in Marseilles in 1982, ICLP has beenthe premier international conference for presenting research in logicprogramming. Contributions (papers and posters) are sought in allareas of logic programming including but not restricted to:

In addition to the presentations of accepted papers, the technicalprogram will include plenary invited talks in association with otherFLoC conferences, as well as ICLP invited talks, advanced tutorials,the doctoral consortium, and several workshops.

SUBMISSION DETAILS

The four broad categories for submissions are: (1) technical papersfor describing technically sound, innovative ideas that can advancethe state of the art of logic programming; (2) application papers,where the emphasis will be on their impact on the application domain;(3) system and tool papers, where the emphasis will be on the novelty,practicality, usability and general availability of the systems andtools described; and (4) technical communications, aimed at describingrecent developments, new projects, and other materials that are notready for main publication as standard papers.

All accepted regular papers will be published in the journal Theoryand Practice of Logic Programming (TPLP), Cambridge U. Press (CUP), inone or more special issues. In order to ensure the quality of thefinal version, papers may be subject to more than one round ofrefereeing (within the decision period) and/or "shepherding." Theprogram committee may also recommend standard papers to be publishedas technical communications.

At the time of the conference CUP will make the web page for this(ese)TPLP issue(s) available including volume and issue numbers, table ofcontents, page numbers, and the papers themselves. All registeredattendants at the conference will get a password for on-line access tothis web page during the conference and indefinitely from then on("lifetime access"), which can be used to read papers on line,download them, or print them for personal use. Attendants will alsoreceive all the papers in a memory stick at the conference.

The collection of technical communications will appear as a volume ofthe LIPIcs (Leibniz International Proceedings in Informatics) series,and published online through the Dagstuhl Research Online PublicationServer (DROPS). All technical communications will also get space inthe program for presentation. The journal issue(s) will also includea listing of the technical communications, with pointers to theLIPIcs/DROPS volume.

The Association for Logic Programming has funds to assist financiallydisadvantaged participants and, specially, students in order to beable to attend the conference.

WORKSHOPS

The ICLP 2010 program will include several workshops, held also aspart of FLoC. They are perhaps the best places for the presentation ofpreliminary work, undeveloped novel ideas, and new open problems to awide and interested audience with opportunities for intensivediscussions and project collaboration.

DOCTORAL CONSORTIUM

The 6th Doctoral Consortium (DC) on Logic Programming providesresearch students with the opportunity to present and discuss theirresearch directions, and to obtain feedback from both peers andworld-renown experts in the field. Accepted participants will receivepartial financial support to attend the event and the mainconference. The best paper and presentation from the DC will be giventhe opportunity to present in a special session of the main ICLPconference.

CONFERENCE VENUE / CO-LOCATION

In 2010 (as in the previous two FLoC editions) ICLP will be held aspart of the Fifth Federated Logic Conference, FLoC 2010 in Edinburgh,Scotland, U.K., July 16-19, 2010. FLoC is held every four yearsbringing together several international conferences related tomathematical logic and computer science. Other participatingconferences are:

The 37th International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), will take place from the 5th to the 12th of July 2010 in Bordeaux, France. The main conference will be preceded and followed by a series of Workshops. Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are:

Authors are invited to submit an extended abstract of no more than 12 pages in LNCS style presenting original research on the theory of Computer Science. Submissions should indicate to which track (A, B, or C) the paper is submitted. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. The proceedings will be published in the Lecture Notes in Computer Science Series by Springer-Verlag.

It is recommended that submissions adhere to the specified format and length. Submissions that are clearly too long may be rejected immediately. Additional material intended for the referee but not for publication in the final version - for example details of proofs - may be placed in a clearly marked appendix that is not included in the page limit.

The 7th IEEE International Conference on Mobile Ad-hoc and SensorSystems (IEEE MASS 2010) is to be held in San Francisco, CA betweenOctober TBD, 2010. Wireless ad-hoc communication has applications in avariety of environments, such as conferences, hospitals, battlefieldsand disaster-recovery/rescue operations, and is also being activelyinvestigated as an alternative paradigm for Internet connectivity inboth urban and rural areas. Wireless sensor and actuator networks arealso being deployed for enhancing industrial control processes andsupply-chains, and for various forms of environmental monitoring. TheIEEE MASS 2010 aims at addressing advances in research on multi-hopad-hoc and sensor networks, covering topics ranging from technologyissues to applications and test-bed development. Please keep checkingthis web-space for more information and regular updates about MASS 2010.

Proposals for full day workshops are solicited. Selections will be madeconsidering the expertise and experience of the workshop organizers andthe relevance of the topic to the central theme of the conference.Proposals of at most 4 pages, including a 1-page biographical sketch,should be submitted to the Workshops Chair by March 31, 2009.

Dave Cavalcanti, Phillips Research*********************************************************** * 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/***********************************************************

Submissions should be made through the on-line submission site:http://www.easychair.org/conferences/?conf=sirocco2010Submitted papers must be written in English and must not exceed 12pages, including the title page, figures, tables and references. Thesubmission must be made using 11-point font and reasonable margins.Submissions deviating from these guidelines risk rejection withoutconsideration of their contents. The deadline for submitting apaper is *January 31, 5pm CET*. Notification of acceptance will besent out by March 21, and the camera-ready papers are due on April 4.

Publication===========

The proceedings of SIROCCO 2010 will be published by Springer-Verlagas a part of the LNCS series. Selected papers will be invited to aspecial issue of the journal /Theoretical Computer Science/.______________________________________________________________________

Theme=====

SIROCCO is devoted to the study of communication and knowledge inmulti-processor systems from both the qualitative and quantitativeviewpoints. Special emphasis is given to innovative approaches andfundamental understanding, in addition to efforts to optimize currentdesigns.

Conference==========

SIROCCO has a tradition of interesting and productive scientificmeetings in a relaxed and pleasant atmosphere, attracting leadingresearchers in a variety of fields in which communication andknowledge play a significant role. This year, SIROCCO is held inTurkey, in the Nesin Mathematics Village, located in the midst of abeautiful scenery, close to the sea and to the ancient city ofEphesus.

Scope=====

Original papers are solicited from all areas of study of localstructural knowledge and global communication and computationalcomplexities. Among the typical areas are distributed computing,communication networks, game theory, parallel computing, socialnetworks, mobile computing (including autonomous robots), peer to peersystems, and communication complexity. Keeping with the tradition ofSIROCCO, new areas are always welcome.

SIROCCO Award=============

The Prize for Innovation In Distributed Computing is awarded annuallyin the SIROCCO conference to recognize individuals whose researchcontributions had a major impact on the understanding of therelationships between information and efficiency in decentralizedcomputing. Only authors of papers that were published in SIROCCO areeligible to receive the award. More details are available in theSIROCCO 2010 web site.

Submissions should be made through the on-line submission site:http://www.easychair.org/conferences/?conf=sirocco2010Submitted papers must be written in English and must not exceed 12pages, including the title page, figures, tables and references. Thesubmission must be made using 11-point font and reasonable margins.Submissions deviating from these guidelines risk rejection withoutconsideration of their contents. The deadline for submitting apaper is *January 31, 5pm CET*. Notification of acceptance will besent out by March 21, and the camera-ready papers are due on April 4.

Publication===========

The proceedings of SIROCCO 2010 will be published by Springer-Verlagas a part of the LNCS series. Selected papers will be invited to aspecial issue of the journal /Theoretical Computer Science/.______________________________________________________________________

Theme=====

SIROCCO is devoted to the study of communication and knowledge inmulti-processor systems from both the qualitative and quantitativeviewpoints. Special emphasis is given to innovative approaches andfundamental understanding, in addition to efforts to optimize currentdesigns.

Conference==========

SIROCCO has a tradition of interesting and productive scientificmeetings in a relaxed and pleasant atmosphere, attracting leadingresearchers in a variety of fields in which communication andknowledge play a significant role. This year, SIROCCO is held inTurkey, in the Nesin Mathematics Village, located in the midst of abeautiful scenery, close to the sea and to the ancient city ofEphesus.

Scope=====

Original papers are solicited from all areas of study of localstructural knowledge and global communication and computationalcomplexities. Among the typical areas are distributed computing,communication networks, game theory, parallel computing, socialnetworks, mobile computing (including autonomous robots), peer to peersystems, and communication complexity. Keeping with the tradition ofSIROCCO, new areas are always welcome.

SIROCCO Award=============

The Prize for Innovation In Distributed Computing is awarded annuallyin the SIROCCO conference to recognize individuals whose researchcontributions had a major impact on the understanding of therelationships between information and efficiency in decentralizedcomputing. Only authors of papers that were published in SIROCCO areeligible to receive the award. More details are available in theSIROCCO 2010 web site.

Publicity Chair--------------- David Ilcinkas (CNRS & U. Bordeaux)*********************************************************** * 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/***********************************************************

This is a specialized research-led degree programme, offered by theDepartment of Computer Science, with contributions from the Universityof Liverpool Management School.

First intake anticipated for September 2010.

A general trend in Computer Science over the past 20 years is theperception of computers as managing the interactions between peopleand organisations, as opposed to performing self-contained computations.

Who is the course aimed at?

Recent graduates in either computer science/maths or business/economics,with interests in design of systems to support online transactions,and associated research issues.

Course structure: one year, full time

Semester 1: modules specific to type of background of student (computer science or economics) Semester 2: common set of modules Summer: research project

As computer systems become more interconnected, there is a trend towardsusage of computers to manage human iteraction, including e-commercesystems that support trade and negotiation, systems that may makerecommendations to users. At the same time, competition for resourceson the internet has led to economic phenomena such as network congestion.

Our day-to-day activities are increasingly dominated by the use ofInternet, ranging from on-line shopping and auctioning, e-banking,search for information, web conferencing to participating and sharinginformation in social web-based networks. Behind these applicationsthere are hidden complex computer systems and technologies, whosedevelopment requires knowledge and skills beyond traditional computerscience university curricula. Not only development but sometimes alsothe effective use of these systems requires such advanced knowledge asis, for instance, the case in sponsored search advertising mastered bythe search engines as Google or Yahoo!. Sponsored search advertising isnowadays one of the most successful and vibrant market segments, not tomention also being the most effective means of advertising, withrevenues counted in billions of dollars in quarter of a year.

The academic research field

Algorithmic Game Theory has developed and expanded within the ComputerScience community during the past 10 years. It comprises synergiesbetween economics and computer science at large, and game theory andalgorithmics in particular. By now this research area has grownconsiderably with immense efforts of computer scientists worldwide andeven with its own dedicated fora -- conferences and workshops -- fordisseminating and exchanging research results. On the more applicableside, companies like Google or Yahoo! have established branches and R&Dcenters all around the world and recruit CS graduates for new excitingjobs.

Liverpool

The Economics and Computation research group forms part of the Deptof Computer Science at Liverpool; it is the first of its kind in the UKalthough others exist internationally. The department itself ranked inthe top 10 nationally in the 2008 Research Assessment Exercise.The course also benefits from contributions from the University of LiverpoolManagement School.

Extract from the prospectus entry

The success stories of the Internet giants like Google on the one handfire one's imagination and on the other hand create new professionalcareers' pathways and new demands for such professionals. From thescientific viewpoint the base for such careers is provided by the newresearch area in the intersection of economics and computer science. TheMSc in Computation and Game Theory program is aimed at providingstudents with a broad understanding of current issues in this newresearch area while at the same time providing a focus on the underlyingalgorithmic aspects; thus allowing students to gain specialistqualification in a rapidly expanding field. The program covers a numberof foundational theoretical areas used in designing and buildingelectronic commerce computer systems. It includes cutting edge modules in such areas as algorithmic mechanism design, communicationnetworks, and covers modern applications such as Google's sponsoredsearch auctions.*********************************************************** * 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 Conference on Theory and Applications of Satisfiability Testing SAT is the primary annual meeting for researchers studying the propositional satisfiability problem. SAT 2010 is the thirteenth SAT conference. SAT 2010 features the SAT Race, the Pseudo-Boolean evaluation, and the MAX-SAT evaluation.

Many hard combinatorial problems can be encoded into SAT. Therefore improvements on heuristics on the practical side, as well as theoretical insights into SAT, apply to a large range of real-world problems. More specifically, many important practical verification problems can be rephrased as SAT problems. This applies to verification problems in hardware and software. Thus SAT is becoming one of the most important core technologies to verify secure and dependable systems. The topics of the conference span practical and theoretical research on SAT and its applications, and include, but are not limited to:

SAT is interpreted in a rather broad sense: besides propositional satisfiability, it includes the domain of quantified boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding and particularly satisfiability modulo theories (SMT).

SUBMISSIONS

Paper submissions should contain original material and can either be regular research papers up to 14 pages or short papers up to 6 pages. Submitted papers may include a technical appendix in addition to the page restriction; however, the paper must be intelligible without the appendix and PC members are not required to read the appendix. Regular papers may be accepted as short papers, by decision of the program committee. Double submissions including submissions as short and long papers will be rejected. Submissions should use the Springer LNCS style (seewww.springer.com/comp/lncs/Authors.html). All tables, figures and the bibliography must fit into the page limit. Appendices that the author considers as part of the final submission should fit in the page limit as well. Submissions deviating from these requirements may be rejected without review. All accepted papers including short papers will be published in the proceedings of the conference, which are expected to be published in Springer's LNCS series. The submission page is www.easychair.org/conferences/?conf=sat10. Papers have to be submitted electronically as PDF files.

*********************************************************** * 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/***********************************************************