Reminder -- Call for applications for 2010-11 Computing Innovation Fellows

This is a reminder that the Computing Community Consortium (CCC) and Computing Research Association (CRA) have issued a call for applications for the 2010-11 Computing Innovation Fellows (CIFellows) Project--offering new Ph.D. graduates in computer science, computer engineering, information science, or a closely related field an exciting opportunity to obtain one- to two-year positions at universities, industrial research laboratories, and other organizations pursuing innovation in computing.

The deadline for receipt of all application materials, including letters of recommendation, is 5pm ET this Sunday, May 23, 2010.  See below for more details.

Complete information, including the application form, is available on the CIFellows Project website at cifellows.org.

If you have any questions, contact contact@cifellows.org.

Thank you.

Best regards,

Greg Andrews, Chair, CIFellows Steering Committee

Ed Lazowska, Chair, CCC Council

Eric Grimson, Chair, CRA

Erwin Gianchandani, Director, CCC & CIFellows Project

Begin forwarded message:

From: CIFellows Project Announcements <cifannounce@cifellows.org>

Date: April 27, 2010 5:27:06 PM EDT

To: "forsythe@cra.org" <forsythe@cra.org>

Subject: Call for applications for 2010-11 Computing Innovation Fellows

Reply-To: "cifannounce@cifellows.org" <cifannounce@cifellows.org>

Dear New PhD Graduates & Prospective Mentors,

The Computing Community Consortium (CCC) and the Computing Research Association (CRA) recently announced a second year of their CIFellows (Computing Innovation Fellowship) Project, which offers new Ph.D. graduates in computer science, computer engineering, information science, or a closely related field an exciting opportunity to obtain one- to two-year positions at universities, industrial research laboratories, and other organizations that are pursuing innovation in computing and its positive impact on society.  The goals of the CIFellows Project are to retain new Ph.D. scholars in research and teaching during challenging economic times, and to support intellectual renewal and diversity in the computing fields at U.S. organizations.
  
With anticipated funding from the National Science Foundation, the CIFellows Project expects to offer around 40 new positions starting during the 2010-11 academic year.  These positions follow a successful inaugural class of 60 PhD graduates in 2009-10.  All of them are completing outstanding research and teaching enrichment experiences, and at least six have already received faculty appointments in part as a result of their CIFellowships.
  
Graduates awarded the Ph.D. or equivalent from a U.S. institutions between May 1, 2009, and Aug. 31, 2010, have through 5 p.m. EDT on May 23, 2010, to apply to be a 2010-11 CIFellow, and will need commitments from one to three prospective hosts/mentors at U.S. institutions.  Each prospective mentor must be with an organization other than the institution of the applicant's graduate research.  The CIFellow is expected to be in residence at the mentor's organization during the fellowship period.  CCC and CRA will announce the awards by July 1, 2010.  The positions will begin this fall.
  
For more information, see the CIFellows Project website at http://cifellows.org.  Details on the submission procedures for applicants and mentors as well as the eligibility requirements can be found at http://www.cifellows.org/cifellows-announce.pdf.  Again, applications must be received by 5 p.m. on May 23, 2010.
  
Thank you.

Best regards,

- Greg Andrews, Chair of the CIFellows Steering Committe
- Ed Lazowska, Chair of the Computing Community Consortium Council
- Eric Grimson, Chair of the Computing Research Association
  - Erwin Gianchandani, Director of the Computing Community Consortium & the CIFellows Project

 

[DMANET] PhD Positions at INRIA

Hello,

Two PhD positions in mathematical programming / operations research are
available at the French Institute for Computer Science and Automatic
(INRIA):

* one on the topic of decomposition approaches to planning and routing
problems at INRIA Bordeaux (application must be sent by the end of May),
see
https://wiki.bordeaux.inria.fr/realopt/pmwiki.php/Project/DoctoralScholarship

* the other on the topic of electricity production planning in
partnership between EDF, INRIA Bordeaux, and INRIA Lille, see
https://wiki.bordeaux.inria.fr/realopt/pmwiki.php/Project/DoctoralScholarshipEDF

Best regards,
francois.vanderbeck@inria.fr
**********************************************************
*
* 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/
*
**********************************************************

Prize 2010 for Innovation In DC: Jean-Claude Bermond

The Prize for Innovation In Distributed Computing is awarded by the
Colloquium on Structural Information and Communication Complexity
(SIROCCO). It is established to recognize individuals whose research
contributions on the relationships between information and efficiency
in decentralized computing have expanded the collective investigative
horizon by formulating new problems, or identifying new research
areas, that were at the time of their introduction unorthodox and
outside the mainstream. The prize recognizes originality, innovation,
and creativity. The recipient of the Prize is chosen among the
nominated persons for the current year.

**********************************************************************
* The Award Committee has selected *Jean-Claude BERMOND* as the *
* recipient of this year's Prize for Innovation In Distributed *
* Computing. *
**********************************************************************

The prize is given in recognition of Bermond for his contribution to
the study of the impact of structure of networks on the efficiency of
parallel or distributed algorithms, as illustrated by several papers,
including some that appeared in the proceedings of past SIROCCO
meetings. These papers tackled a wide variety of problems including
routing, broadcasting, gossip protocols, traffic grooming, fault
tolerant network design, monopolies, and other topics, illustrated,
in particular, by the following papers:

- J.-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot.
Cycle Covering.
In Proc. SIROCCO 2001: 21-34.
- J.-C. Bermond, B. Jackson, F. Jaeger.
Shortest coverings of graphs with cycles.
J. Comb. Theory, Ser. B 35(3): 297-308 (1983)
- J.-C. Bermond, C. Peyrat.
De Bruijn and Kautz networks: a competitor for the hypercube?
In Proc. 1st European Workshop on Hypercubes and Distributed
Computers: 279-293 (1989).
- J.-C. Bermond, Stephane Perennes.
Efficient Broadcasting Protocols on the de Bruijn and Similar Networks.
In Proc. SIROCCO 1995: 199-209
- J.-C. Bermond, L. Gargano, A. Rescigno, U. Vaccaro.
Fast Gossiping by Short Messages.
SIAM J. Comput. 27(4): 917-941 (1998)
- J.-C. Bermond, P. Fraigniaud.
Broadcasting and Gossiping in de Bruijn Networks.
SIAM J. Comput. 23(1): 212-225 (1994)

The paper "De Bruijn and Kautz networks: a competitor for the
hypercube?" is a pioneering paper investigating the design of networks
for parallel and distributed computers. This paper promoted the
de Bruijn graph as a suitable network for efficient communication and
management. Under the reign of the hypercubes and meshes
tightly-coupled multi-processors, this paper was definitively
unorthodox. It was visionary too, as the de Bruijn graph was later
found particularly rich in applications, especially in the framework
of overlay network design for P2P systems.

The paper "Cycle Covering" appeared in SIROCCO 1995 deals with
protection by cycles in wavelength division multiplexing networks, a
subject originated in the operation of telecommunication networks. The
most important contribution is the use of design theory to tackle the
questions at hand, using tools developed in the paper "Shortest
coverings of graphs with cycles" (J. Comb. Theory, Ser. B). This
clever perspective can be used to show that other combinatorial
problems in communication networks are special cases of traffic
grooming, like, for instance, the problem of the minimization of the
number of ADMs for all-to-all traffic in unidirectional rings. This
allowed the tools and techniques developed in this article to be
extended to answer all-to-all traffic grooming in unidirectional rings
with larger grooming factors. Most of the techniques used in the
literature to prove lower bounds in related problems were established
in this article.

Last but not least, Bermond was among the first to identify the
importance of designing efficient protocols for structured
communication problems, including one-to-all broadcasting,
multicasting, and all-to-all broadcasting (a.k.a. gossiping). His many
contributions in this field enabled deep understanding of the
capabilities and limitations of networks in terms of efficiently
propagating informations and data.

By his results and ideas, Jean-Claude Bermond has enriched Distributed
Computing considerably, in demonstrating the importance of network
structural properties on the performances of distributed algorithms,
with applications ranging from fundamental aspects of distributed
computing to network design.

The prize will be officially delivered at the the Business meeting of
the 17th edition of the Colloquium on Structural Information and
Communication Complexity (SIROCCO), Sirince, Turkey, June 7-11, 2010.

Award Committee 2010:

Pierre Fraigniaud CNRS and University Paris Diderot, France
Shay Kutten Technion, Israel
Nicola Santoro Carleton University, Canada
Alexander A. Shvartsman University of Connecticut, USA
Shmuel Zaks Technion, Israel

[DMANET] Prize 2010 for Innovation In DC: Jean-Claude Bermond

The Prize for Innovation In Distributed Computing is awarded by the
Colloquium on Structural Information and Communication Complexity
(SIROCCO). It is established to recognize individuals whose research
contributions on the relationships between information and efficiency
in decentralized computing have expanded the collective investigative
horizon by formulating new problems, or identifying new research
areas, that were at the time of their introduction unorthodox and
outside the mainstream. The prize recognizes originality, innovation,
and creativity. The recipient of the Prize is chosen among the
nominated persons for the current year.

**********************************************************************
* The Award Committee has selected *Jean-Claude BERMOND* as the *
* recipient of this year's Prize for Innovation In Distributed *
* Computing. *
**********************************************************************

The prize is given in recognition of Bermond for his contribution to
the study of the impact of structure of networks on the efficiency of
parallel or distributed algorithms, as illustrated by several papers,
including some that appeared in the proceedings of past SIROCCO
meetings. These papers tackled a wide variety of problems including
routing, broadcasting, gossip protocols, traffic grooming, fault
tolerant network design, monopolies, and other topics, illustrated,
in particular, by the following papers:

- J.-C. Bermond, L. Chacon, D. Coudert, and F. Tillerot.
Cycle Covering.
In Proc. SIROCCO 2001: 21-34.
- J.-C. Bermond, B. Jackson, F. Jaeger.
Shortest coverings of graphs with cycles.
J. Comb. Theory, Ser. B 35(3): 297-308 (1983)
- J.-C. Bermond, C. Peyrat.
De Bruijn and Kautz networks: a competitor for the hypercube?
In Proc. 1st European Workshop on Hypercubes and Distributed
Computers: 279-293 (1989).
- J.-C. Bermond, Stephane Perennes.
Efficient Broadcasting Protocols on the de Bruijn and Similar Networks.
In Proc. SIROCCO 1995: 199-209
- J.-C. Bermond, L. Gargano, A. Rescigno, U. Vaccaro.
Fast Gossiping by Short Messages.
SIAM J. Comput. 27(4): 917-941 (1998)
- J.-C. Bermond, P. Fraigniaud.
Broadcasting and Gossiping in de Bruijn Networks.
SIAM J. Comput. 23(1): 212-225 (1994)

The paper "De Bruijn and Kautz networks: a competitor for the
hypercube?" is a pioneering paper investigating the design of networks
for parallel and distributed computers. This paper promoted the
de Bruijn graph as a suitable network for efficient communication and
management. Under the reign of the hypercubes and meshes
tightly-coupled multi-processors, this paper was definitively
unorthodox. It was visionary too, as the de Bruijn graph was later
found particularly rich in applications, especially in the framework
of overlay network design for P2P systems.

The paper "Cycle Covering" appeared in SIROCCO 1995 deals with
protection by cycles in wavelength division multiplexing networks, a
subject originated in the operation of telecommunication networks. The
most important contribution is the use of design theory to tackle the
questions at hand, using tools developed in the paper "Shortest
coverings of graphs with cycles" (J. Comb. Theory, Ser. B). This
clever perspective can be used to show that other combinatorial
problems in communication networks are special cases of traffic
grooming, like, for instance, the problem of the minimization of the
number of ADMs for all-to-all traffic in unidirectional rings. This
allowed the tools and techniques developed in this article to be
extended to answer all-to-all traffic grooming in unidirectional rings
with larger grooming factors. Most of the techniques used in the
literature to prove lower bounds in related problems were established
in this article.

Last but not least, Bermond was among the first to identify the
importance of designing efficient protocols for structured
communication problems, including one-to-all broadcasting,
multicasting, and all-to-all broadcasting (a.k.a. gossiping). His many
contributions in this field enabled deep understanding of the
capabilities and limitations of networks in terms of efficiently
propagating informations and data.

By his results and ideas, Jean-Claude Bermond has enriched Distributed
Computing considerably, in demonstrating the importance of network
structural properties on the performances of distributed algorithms,
with applications ranging from fundamental aspects of distributed
computing to network design.

The prize will be officially delivered at the the Business meeting of
the 17th edition of the Colloquium on Structural Information and
Communication Complexity (SIROCCO), Sirince, Turkey, June 7-11, 2010.

Award Committee 2010:

Pierre Fraigniaud CNRS and University Paris Diderot, France
Shay Kutten Technion, Israel
Nicola Santoro Carleton University, Canada
Alexander A. Shvartsman University of Connecticut, USA
Shmuel Zaks Technion, Israel
**********************************************************
*
* 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/
*
**********************************************************

Postdoctoral research associate in trusted computing

Responsibilities: A postdoctoral research position is available for work on
an NSF-funded project in trusted computing in the Department of Computer
Science at the University of North Carolina at Greensboro. This is a
one-year appointment, with the possibility of renewal for a second year.
This project involves formal modeling of (and rigorous reasoning about)
protocols designed using hardware-assisted security in general, and trusted
computing technology in particular. Experience in cryptography or computer
security is vital, and prior experience with trusted computing technology is
helpful. Proficiency in formal areas of computer science and writing proofs,
whether in cryptography or more general theoretical computer science, is
also a very valuable skill for this position. The postdoctoral researcher
will also be expected to contribute to the design of software libraries that
parallel the formal models, and to help supervise master's and bachelor's
level students developing this software.

For more information, see http://www.uncg.edu/cmp/jobs.html#pos999843

MADALGO Summer School on Geometric Data Structures

MADALGO Summer School on

GEOMETRIC DATA STRUCTURES

August 16-19, 2010, Aarhus, Denmark

www.madalgo.au.dk/datastructures2010

OVERVIEW AND GOAL
Geometric data structures are methods of efficiently storing and
querying data in two or more dimensions. Working with geometric data
often requires the use of specialized and fundamentally geometric
techniques. The goal of the summer school is to provide an in-depth
introduction to some of the key techniques in geometric data
structures, while highlighting a number of open problems.

LECTURES
The school will be taught by experts in the area of geometric data
structures:

* Timothy Chan (University of Waterloo)
* John Iacono (Polytechnic Institute of New York University)
* Sariel Har-Paled (University of Illinois at Urbana-Champaign)
* Mihai Patrascu (AT&T)

PARTICIPATION
The summer school will take place on August 16-19, 2010 at Center for
Massive Data Algorithmics (MADALGO) in the Department of Computer
Science, University of Aarhus, Denmark.

The school is targeted at graduate students, as well as researchers
interested in an in-depth introduction to geometric data structures.

The capacity of the summer school is limited. Prospective participants
should register using the online registration form available at
www.madalgo.au.dk/datastructures2010 as soon as possible. Registering
graduate students must also have their supervisor send a letter
confirming their graduate student status directly to
madalgo@madalgo.au.dk; the subject line of the email should be
'student_last_name/SS_2010/confirming'. Registration is on a
first-come-first-serve basis and will close on July 1, 2010.

Registration is free; handouts, coffee breaks, lunches and a dinner will
be provided by MADALGO and the University of Aarhus.

ORGANIZING COMMITTEE
* Lars Arge (MADALGO)
* Gerth S. Brodal (MADALGO)
* John Iacono (Polytechnic Institute of New York University)
* Else Magard (MADALGO)
* Sara &#8730;òlholm (Aarhus University)

ABOUT MADALGO
Center for MAssive Data ALGOrithmics is a major basic research center
funded by the Danish National Research Foundation. The center is located
at the Department of Computer Science, University of Aarhus, Denmark,
but also includes researchers at CSAIL, Massachusetts Institute of
Technology in the US, and at the Max Planck Institute for Informatics
and at Frankfurt University in Germany. The center covers all areas of
the design, analysis and implementation of algorithms and data
structures for processing massive data (interpreted broadly to cover
computations where data is large compared to the computational
resources), but with a main focus on I/O-efficient, cache-oblivious and
data stream algorithms.

[DMANET] Lectureship/Readership in Pure Mathematics in St Andrews

Dear all

A lectureship/readership in Pure Mathematics at the University of St Andrews
has recently been advertised. I've been a bit slow forwarding
this, please note that the closing date is MAY 28.

Further particulars can be found online here:

https://www.vacancies.st-andrews.ac.uk/welcome.aspx

and also on jobs.ac.uk

www.jobs.ac.uk/job/ABA679/lecturer-reader-in-pure-mathematics/

The intention is to attract candidates of highest calibre, so
compatibility (or complementarity) with our current research expertise
should be interpreted broadly. In case of an outstandingly strong field
there is a possibility that we may be allowed to make more than one
appointment. I would be grateful if you could bring it to attention of
any individuals or groups you think might be suitable.

Best wishes

Colva Roney-Dougal

The University of St Andrews is a charity registered in Scotland : No
SC013532

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

[DMANET] Call for papers - AITC 2010

Advances in the Theory of Computing" (AITC'2010) is a special session
of SYNASC 2010, the 12th Annual Symposium on Symbolic and Numeric
Algorithms for Scientific Compting.

Conference location: West University of Timisoara, Romania, September
26-29, 2010.

AITC Website: http://tcs.ieat.ro/aitc2010

Program Committee:

Olaf Beyersdorff (Hannover, Germany)
Francine Blanchet-Sadri (Greensboro NC, U.S.A.)
Gabriel Ciobanu (Iasi, Romania)
Jerome Durand-Lose (Orleans, France)
Gabriel Istrate (Timisoara, Romania, co-chair)
Shiva Prasad Kasiviswanathan (Los Alamos NM, U.S.A.)
Miklos Kresz (Szeged, Hungary)
Florin Manea (Magdeburg, Germany, co-chair)
Ion Mandoiu (Storrs CT, U.S.A.)
Daniel Reidenbach (Loughborough, U.K.)
Gheorghe Stefanescu (Bucharest, Romania)

We invite submissions presenting significant advances in the Theory of
Computing in the form of:

+ full-length research papers,
+ informal presentations.

Accepted research papers will be published on electronic media
(distributed during the conference) and in the conference
post-proceedings, published by the IEEE Computer Society Press. (For
previous editions of SYNASC see
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5459479)

All areas of Theoretical Computer Science, broadly construed, are of
interest. In particular a non-exhaustive list of topics includes:

- Data Structures and algorithms
- Combinatorial Optimization
- Formal languages and Combinatorics on Words.
- Graph-theoretic and Combinatorial methods in Computer Science
- Algorithmic paradigms, including distributed, online, approximation,
probabilistic, game-theoretic algorithms.
- Computational Complexity Theory, including structural complexity,
boolean complexity, communication complexity, average-case complexity,
derandomization and property testing.
- Logical approaches to complexity, including finite model theory.
- Algorithmic and computational learning theory.
- Aspects of computability theory, including computability in analysis
and algorithmic information theory.
- Proof complexity.
- Computational social choice and game theory
- New computational paradigms: CNN computing, quantum, holographic and
other non-standard approaches to Computability.
- Randomized methods, random graphs, threshold phenomena and
typical-case complexity.
- Automata theory and other formal models, particularly in relation to
formal verification methods such as model checking and runtime
verification.
- Applications of theory, including wireless and sensor networks,
computational biology
and computational economics.
- Experimental algorithmics.

Papers of up to 8 pages (IEEE conference style), must be submitted
electronically through EasyChair. Please select the Advances in the
Theory of Computing track when prompted by the system.

Research papers must contain original results, not concurrently
submitted to other publication venues and not published elsewhere.

Informal presentations can also be submitted (as a one-page pdf
document) to synasc-tcs@info.uvt.ro. Some of the submissions may be
accepted as an informal presentations only.

All authors of accepted papers are expected to present their
contribution(s) at the conference.

IMPORTANT DATES:

July 1st: Paper submission deadline.
August 20: Notification of acceptance
September 08: Deadline for submitting revised versions
September 23-26: Main conference
November 30: Deadline for post-proceedings publication (IEEE DL)
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] 2nd Call for Papers: WAOA 2010

8th Workshop on Approximation and Online Algorithms (WAOA 2010)
University of Liverpool, United Kingdom
9-10 September 2010

CALL FOR PAPERS

Scope

Approximation and online algorithms are fundamental tools to deal with
computationally hard problems and problems in which the input is gradually
disclosed over time. Both kinds of problems have a large number of
applications, arising from a variety of fields.

The workshop focuses on the design and analysis of approximation and
online algorithms. It also covers experimental methods used to design and
analyze efficient approximation and online algorithms. WAOA 2010 will be
part of ALGO 2010, which also hosts ESA, ATMOS, and WABI. ALGO 2010 will
take place 6-10 September 2010 in Liverpool, United Kingdom.

This year, WAOA's invited speaker is Claire Mathieu from Brown University.

Topics

Papers are solicited in all research areas related to approximation and
online algorithms, including, but not limited to:

* algorithmic game theory
* approximation classes
* coloring and partitioning
* competitive analysis
* computational finance
* cuts and connectivity
* geometric problems
* inapproximability results
* mechanism design
* network design
* packing and covering
* paradigms for the design and analysis of approximation and online
algorithms
* parameterized complexity
* randomization techniques
* real-world applications
* scheduling problems

Publication

Proceedings will be published after the workshop takes place in the
Springer
series Lecture Notes in Computer Science. Instructions for authors can be
found at http://www.springer.de/comp/lncs/authors.html. The proceedings of
WAOA 2003, WAOA 2004, WAOA 2005, WAOA 2006, WAOA 2007, WAOA 2008, and
WAOA 2009 have appeared as volumes 2909, 3351, 3879, 4368, 4927, 5426,
and 5893, respectively, of Lecture Notes in Computer Science.

Submission guidelines

Authors are invited to submit an extended abstract or full paper of at most
12 pages describing original unpublished research. Simultaneous submission
to other conferences with published proceedings is not permitted. The title
page of the submission should include the authors' full names,
addresses,
e-mail addresses, and an abstract summarizing the results in roughly
100-200
words; the remainder of the submission should contain a description of the
main results and an explanation of their importance. The submission must
include a full proof of the results, part of which can be placed in the
appendix, whose length is not constrained.

Papers must be submitted electronically at

http://www.easychair.org/conferences/?conf=waoa2010

The submission must be received by 23:59 (GMT) on June 6, 2010. Each
accepted
paper must be presented at the workshop by one of the authors.
Important dates

Submissions: June 6, 2010.
Notifications: July 16, 2010.
Workshop: September 9-10, 2010.
Camera Ready: November 1, 2010.

Program Chairs

* Klaus Jansen, University of Kiel
* Roberto Solis-Oba, University of Western Ontario

Program committee

* Evripidis Bampis, University of Evry
* Jianer Chen, Texas A&M University
* Jose Correa, University of Chile
* Khaled Elbassioni, Max Planck Institute for Informatics
* Rudolf Fleischer, Fudan University
* Thomas Erlebach, University of Leicester
* Martin Fuerer, The Pennsylvania State University
* Klaus Jansen, University of Kiel
* Christos Kaklamanis, University of Patras
* Jochen Koenemann, University of Waterloo
* Stefano Leonardi, Sapienza University of Rome
* Alejandro Lopez-Ortiz, University of Waterloo
* Monaldo Mastrolilli, IDSIA Lugano
* Hadas Shachnai, Israel Institute of Technology
* Martin Skutella, TU Berlin
* Roberto Solis-Oba, University of Western Ontario
* Clifford Stein, Columbia University
* Denis Trystram, Grenoble Institute of Technology

For more information please contact Klaus Jansen
(kj@informatik.uni-kiel.de)
or Roberto Solis-Oba (solis@csd.uwo.ca) or check WAOA's web-site:

http://algo2010.csc.liv.ac.uk/waoa
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] IEEE MASS 10 Workshops Announcement and CFPs

[We apologize in advance if you receive multiple copies of this message]
-----------------------------------------------------------------------

IEEE MASS 2010 Workshops
https://mass2010.soe.ucsc.edu/node/4

November 8-12, 2010 - San Francisco, CA, USA
-----------------------------------------------------------------------

The following workshops will be held in conjunction with the IEEE
MASS'10 conference, which will be held in the San Francisco bay area on
November 8-12, 2010:

- The Third Workshop on Mobile Entity Localization and Tracking (MELT)
(http://meltworks.org)

- The Second Workshop on SCEnarios for Network Evaluation Studies
(SCENES) (http://scenes.cs.bonn.edu)

- The Sixth Workshop on Wireless and Sensor Network Security (WSNS)
(http://www.cs.wcupa.edu/%7Ezjiang/wsns10.htm)

- The Fourth Workshop on Enabling Technologies and Standards for
Wireless Mesh Networking (MESHTECH) (http://www.ing.unipi.it/meshtech10)

- The First BioSense Workshop: Networking and Environmental Sensing meet
Epidemiology and Biology (http://www.cl.cam.ac.uk/%7Eixyl2/biosense10/)

- The Second International Workshop on Intelligent Vehicular Networks
(InVeNet) (http://www.site.uottawa.ca/%7Exuli/InVeNET2010/)

All these workshops are currently accepting submissions. Click on each
link to get the workshop specific information regarding submission
requirements and deadlines.

Please consider submitting your work to one of these workshops.

Workshop registration will grant access to the main conference as well,
so workshops are a great opportunity to attend IEEE MASS too and spend
one week in beautiful California.

Looking forward to seeing you this Fall in San Francisco,

Cedric Westphal & Christine Pepin
IEEE MASS'10 Workshop Chairs.
**********************************************************
*
* 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/
*
**********************************************************

[Goedel fellowship] Kurt Goedel Research Prize Fellowships Announcement

KURT GOEDEL RESEARCH PRIZE FELLOWSHIPS

The Kurt Goedel Society is proud to announce the commencement of the
second round of the Kurt Goedel Research Prize Fellowships Program.

The research fellowship prize program is sponsored by the John Templeton
Foundation and will offer:

* two Ph.D. (pre-doctoral) fellowships of EUR 100,000
* two post-doctoral fellowships of EUR 100,000 and
* one unrestricted fellowship of EUR 100,000

One International Board of Jurors will be in charge of evaluating the
applications and determining up to
twenty finalists whose papers will be published in a special issue of the
Annals of Pure and Applied Logic,
and another international Board of Jurors will be in charge of determining
the winners. Both Boards will be chaired
by Prof. Harvey Friedman, Ohio State University (USA).

Board of Jurors for Determining the Finalists

* Jeremy AVIGAD, Carnegie Mellon University, (USA)
* Lenore BLUM, Carnegie Mellon University, (USA)
* Harvey FRIEDMAN, Ohio State University (USA) CHAIR
* John HARRISON, Intel Corporation, (USA)
* Kenneth KUNEN, University of Wisconsin, (USA)
* Angus MACINTYRE, Queen Mary, University of London and Royal Society, (UK)
* Hiroakira ONO, JAIST Research Center for Integrated Science, (JAPAN)
* Pavel PUDLAK, Czech Academy of Sciences, (Czech Republic)
* Michael RATHJEN, University of Leeds, (UK)
* Frank STEPHAN, National University of Singapore, (SINGAPORE)
* William TAIT, University of Chicago, (USA)
* Simon THOMAS, Rutgers University, (USA)
* Albert VISSER, University of Utrecht (NL)
* Andreas WEIERMANN, Ghent University, (BELGIUM)
* Boris ZILBER, University of Oxford, (UK)

Board of Jurors for Determining the Winners

* Lev BEKLEMISHEV, Russian Academy of Sciences (RUS)
* Harvey FRIEDMAN, Ohio State University (USA) CHAIR
* Dov M. GABBAY, King's College London (UK)
* Warren D. GOLDFARB, Harvard University (USA)
* Howard Jerome KEISLER, University of Wisconsin (USA)

Goal and Criteria of Merit

The purpose of these fellowships is to support original research in, and
areas surrounding, the foundations of mathematics. (See Scope below for
more details.) These fellowships are intended to carry forward the legacy
of Kurt Gödel, whose works exemplify deep insights and breakthrough
discoveries in mathematical logic, with profound impact on the philosophy
and foundations of mathematics. In pursuit of similar insights and
discoveries, we adopt the following criteria of merit for evaluating
Fellowship applications:

1. Intellectual merit, scientific rigor and originality of the
submitted paper and work plan. The paper and research plans should
combine visionary thinking with academic and scientific excellence..
2. Potential for significant contribution to basic fundamental issues
of wide interest, and the likelihood for opening new, seminal lines
of inquiry that bear on such issues.
3. Impact of the Fellowship on the project and likelihood that the
Fellowship will make the proposed new lines of research possible.
4. The expectation that the proposed research will be successful.
5. Qualifications of the applicants will be evaluated on the basis of
all available information including CV, research paper, research
plans, research accomplishments, and letters of recommendation (recommendation
letters are not required for senior applications).

Winners' Model Projects:
http://fellowship.logic.at/2010/files/Bovykin_Project.pdf
http://fellowship.logic.at/2010/files/Koellner_Project.pdf
Model Questions
http://fellowship.logic.at/index.php?questions

Scope

Original fellowship proposals in the areas of

* set theory
* recursion theory
* proof theory/intuitionism
* model theory
* computer assisted reasoning
* philosophy of mathematics

All fellowship proposals, regardless of subject area, will be judged
according to

* the relevance and resemblance of the research (finished and
proposed) to the great insights and originality of Kurt Gödel
* its general interest and clarity of motivation
* its rigorous scientific quality and depth.

Submission Instructions

The three categories of fellowships are specified as follows:
*Ph.D.(pre-doctoral): being in the stage before finishing the thesis (or
equivalent achievements)
*Post-doctoral: being in the stage within 10 years after finishing the
thesis (or equivalent achievements)
*Unrestricted: also open to senior applicants

The submission must consist of:

- one document A in PDF format containing
. the CV
. the project description
. the recommendation letters
- one document B in PDF format containing the article
- one text abstract relating to B
Maximum allowed length of the abstract is 500 words.

Document A containing the CV, the project description, and the
recommendation letters must be prepared in the following way:
- minimum font size: 10pt
- paper size: A4
- maximum length of the CV: 3 pages
The CV must contain the list of all/most important publications.
The CV must clearly state to which category the application belongs.
- maximum length of project description: 4 pages
Project description should clearly state where and at which institution
the applicant intends to carry out the project.
- minimum 2(two)/maximum 3 (three) 1-page recommendation letters,in case
of applications belonging to the categories Ph.D.(pre-doctoral) and
post-doctoral fellowships.
(The recommendation letters should be scanned and included into the PDF
document)

The submission must be in English.

The Board and the Program Chair reserve the right:
*to consider only submissions with reasonable format
*to reassign a submission to another category as applied for.
The applicant will be informed about the reasons for such a
decision.
The submission software will be available online by the end of June 2010.

Timeline

November 15, 2010. Submissions deadline
February 28, 2011. Jury decision on the papers for publication (at most 20)
March 1, 2011. Final versions due
March 6, 2011. Jury decision on winners due
April 28-30, 2011. Conference and the Award Ceremony
June-October, 2011. Commencement of the Fellowships

Web:http://fellowship.logic.at

E-mail contact: goedel-fellowship@logic.at

CPM 2010, June 21-23, New York: CFParticipation

********************************************************************

  21st Annual Symposium on Combinatorial Pattern Matching

               CPM 2010 - CALL FOR PARTICIPATION

        June, 21-23 2010,  NYU-POLY Brooklyn, New York, USA.

               http://cs.nyu.edu/parida/CPM2010/

       Registration:  http://cs.nyu.edu/parida/CPM2010/registration.html

       Hotel deadline May 21: http://cs.nyu.edu/parida/CPM2010/hotel.html
********************************************************************

INVITED SPEAKERS
***********************

Zvi Galil (Tel Aviv University)
Richard M. Karp (University of California at Berkeley)
Jeffrey S. Vitter (Texas A&M University).

PROGRAM
*************
http://cs.nyu.edu/parida/CPM2010/program.html

********************************************************************

Combinatorial Pattern Matching (CPM) addresses issues of searching and
matching strings and more complicated patterns such as trees, regular
expressions, graphs, point sets, and arrays, in various formats. The
goal is deriving non-trivial combinatorial properties of such structures
and exploiting these properties in order to achieve superior performance
for the corresponding computational problems. On the other hand, an
important goal is analyzing and pinpointing the properties and
conditions under which searches can not be performed efficiently.

********************************************************************

CONTACT: cpm2010@catt.poly.edu

[DMANET] WCO Last call for papers

Third Call for Papers

3rd Workshop on Computational Optimization (WCO 2010)
Wisla, Poland, October 18-20, 2010

in the framework of IMCSIT 2010 - International Multiconference
on Computer Science and Information Technology

http://www.imcsit.org
-----------------------------------------------------------------

We invite original contributions related with both theoretical and practical
aspects of optimization methods. The list of topics includes, but is not
limited to:

- unconstrained and constrained optimization
- combinatorial optimization
- global optimization
- multiobjective and multimodal optimization
- dynamic and noisy optimization
- large scale optimization
- parallel and distributed approaches in optimization
- random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
- interval methods
- nature inspired optimization methods (evolutionary algorithms, ant colony
optimization, particle swarm optimization, immune artificial systems etc)
- hybrid optimization algorithms involving natural computing techniques and
other global and local optimization methods
- memetic algorithms
- optimization methods for learning processes and data mining
- computational optimization methods in statistics, econometrics, finance,
physics, medicine, biology, engineering etc.

-----------------------------------------------------------------
Important dates:

31.05.2010 (May 31, 2010) - Full paper submission

12.07.2010 (July 12, 2010) - Notification of acceptance

23.08.2010 (August 23, 2010) - Camera-ready version of the accepted paper

-----------------------------------------------------------------
Submission

* Authors should submit draft papers (as Postscript, PDF of MSWord file) no
longer than 8 pages (IEEE style - available at http://www.submit.imcsit.org/).

* Papers will be refereed and accepted on the basis of their scientific
merit and relevance to the workshop.

-----------------------------------------------------------------
Publication

* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore® database.

* Authors of selected papers presented during the WCO Workshop will be
invited to submit extended versions of their contributions
to one of the following journals (both of them being indexed by Thomson
Institute of Scientific Information):

- Control and Cybernetics (http://www.ibspan.waw.pl/kategorie/control_and_cybernetics_en)
- Carpathian Journal of Mathematics (http://carpathian.ubm.ro/).

-----------------------------------------------------------------

Organizing Committee

Stefka Fidanova, Bulgaria
Josef Tvrdik, Czech Republic
Daniela Zaharie, Romania
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] PhD scholarship available in Berlin

The Research Training Group (Graduiertenkolleg)

METHODS FOR DISCRETE STRUCTURES
http://www.math.tu-berlin.de/MDS/

funded by the German Science Foundation (DFG) at the three Berlin
Universities will in 2010 offer

One SCHOLARSHIP

for Ph.D. Studies starting June 1, 2010 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 the summer of 2010
consisting of

- letter of application
- curriculum vitae
- Diplom/masters' thesis
- proposal for possible thesis topic
- recommendation letter by thesis advisor
(to be sent directly to us)

should be directed to

Prof. Guenter M. Ziegler, Coordinator
RTG "Methods for Discrete Structures"
Inst. Mathematics, MA 6-2
TU Berlin
D-10623 Berlin, Germany

email: ziegler@math.tu-berlin.de
http://www.math.tu-berlin.de/~ziegler
Tel.: +49 - 30 - 314-25730
Fax: +49 - 30 - 314-21269

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

(PN) Call for participation: VTSA 2010 Summer School on Verification Technology, Systems & Applications

****************************************************************
Summer School on Verification Technology, Systems & Applications
http://www.mpi-inf.mpg.de/VTSA10/

Application Deadline: 07/23/2010
Notification until: 08/06/2010
Summer School: 09/06/2010 - 09/10/2010
****************************************************************

A summer school on verification technology, systems and applications
will be organized by the Interdisciplinary Centre for Security,
Reliability and Trust at the University of Luxemburg, in cooperation
with the Max-Planck Institute für Informatik in Saarbrücken and the
INRIA research center in Nancy. The school will take place from
September 6th to 10th 2010 in Luxembourg.

The following speakers have accepted to give courses:

Javier Esparza: Building a Software Model-Checker
Wan Fokkink: Protocol Validation with mCRL
Marta Kwiatkowska: Probabilistic Model Checking
Markus Müller-Olm: Fundamentals of Software Model Checking
Wang Yi: Modeling and Analysis of Timed Systems

Participation is free (except for travel and accommodation costs) and
open to anybody holding at least a Bachelor degree (or equivalent) in
computer science. The number of participants is limited. Please apply
electronically by *July 23th, 2010* by sending

- a one-page CV,
- an application letter explaining your interest in the school and
your experience in the area,
- a copy of your bachelor certificate (or equivalent or higher)

to jun.pang@uni.lu.

For details please see the Web page of the school.
----
[[ Petri Nets World: ]]
[[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]]
[[ Mailing list FAQ: ]]
[[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]]
[[ Post messages/summary of replies: ]]
[[ petrinet@informatik.uni-hamburg.de ]]

The First ACM International Health Informatics Symposium (IHI) 2010

Association for Computing Machinery (ACM)
1st ACM International Health Informatics Symposium (IHI)
CALL FOR PAPERS

IHI 2010
November 11-12, 2010
Arlington, Virginia
http://ihi2010.sighi.org

SCOPE OF THE CONFERENCE

We cordially invite you to submit your contribution to the 2010 ACM International Health Informatics Symposium (IHI 2010).

IHI 2010 is ACM's premier community forum concerned with the application of computer and information science principles as well as information and communication technology to problems in healthcare, public health, the delivery of healthcare services and consumer health informatics aspects, and finally, the related social and ethical issues on the use of computing technology in the health informatics domain.

IHI 2010 is primarily interested in serving as a venue for the discussion of innovative technical contributions highlighting end-to-end applications, systems, and technologies, even if available only in prototype form (where a system is not deployed in production mode and/or evaluation may be performed by giving examples). We strongly encourage authors to submit their original contributions describing their algorithmic contributions, methodological contributions, and well-founded conjectures providing whenever possible an application-oriented context. A paper does not have to be comprehensive and can focus on a single aspect.

Contributions in the realm of social and behavioral issues might include empirical studies of health-related information use and needs, socio-technical studies on the implementation and use of health information technology, studies on health informatics in the context of community impact and implications, studies on public policies on leveraging health informatics infrastructure, among others.

Specific topics of interest for this conference cover various facets of health informatics research, including but not limited to the following:
- Accessibility and Web-enabled technologies
- Analytics applied to direct and remote clinical care
- Assistive and adaptive ubiquitous computing technologies
- Bio-surveillance
- Brain computer interface
- Cleaning, preprocessing, and ensuring quality and integrity of medical records
- Comparative effectiveness research
- Computational support for patient-centered and evidence-based care
- Consumer and clinician health information needs, seeking, sharing and use
- Consumer health and wellness informatics applications
- Continuous monitoring and streaming technologies
- Data management, privacy, security, and confidentiality
- Display and visualization of medical data
- E-commerce in health informatics
- E-communities and networks for patients and consumers 
- E-healthcare infrastructure design
- E-learning for spreading health informatics awareness 
- Engineering of medical data
- Evaluation of health information system
- E-visit system
- Experience of building health information system
- Health informatics education
- Health information system framework and enterprise architecture in the developing world
- Health IT project management
- Health software design
- Health system simulation
- High-performance computing in healthcare
- Human-centered design of health informatics systems
- Information retrieval for health applications
- Information technologies for the management of patient safety and clinical outcomes
- Innovative applications in electronic health records (e.g., ontology or semantic technology, using continuous biomedical signals to trigger alerts)
- Intelligent medical devices and sensors
- Issues involving interoperability and data representation in healthcare delivery
- Keyword and multifaceted search over structured electronic health records
- Knowledge discovery for improving patient-provider communication
- Large-scale longitudinal mining of medical records
- Medical compliance automation for patients and institutions
- Medical recommender system (e.g., medical products, fitness programs)
- Multimodal medical signal analysis
- Natural language processing for biomedical literature, clinical notes, and health consumer texts
- Novel health information systems for chronic disease management
- Open-source software in healthcare
- Optimization models for planning and recommending therapies
- Personalized predictive modeling for clinical management (e.g., trauma, diabetes mellitus, sleep disorders, substance abuse)
- Physiological modeling
- Public health informatics
- Quality assurance
- Semantic Web, linked data, ontology, and healthcare
- Sensor networks and systems for pervasive healthcare
- Social studies of health information technologies
- Survival analysis and related methods for estimating hazard functions
- System software for complex clinical studies that involve combinations of clinical, genetic, genomic, imaging, and pathology data
- Systems for cognitive and decision support
- Technologies for capturing and documenting clinical encounter information in electronic systems
- Telecare
- Telemedicine
- User-interface design issues applied to medical devices and systems

Each contribution will be carefully evaluated by a set of reviewers, including experts with multidisciplinary experience spanning computing, information science, social and behavioral sciences, public health, medicine, and nursing as appropriate, to ensure that proper and comprehensive peer-review analysis and feedback can be provided to authors. Submissions will be judged on validity, originality, technical strength, practical and clinical significance, quality of presentation, and relevance to the conference topics.

Because of IHI's multidisciplinary nature, the review process will include at least a computing expert and a health expert as well as a review editor to reconcile the evaluation, making a single recommendation to the Program Committee Co-Chairs. This process is designed to ensure that experts from multiple areas can assess the importance and validity of the work. Therefore, we encourage submissions from a variety of fields where in-depth application-centric ideas addressing important problems in health informatics are discussed. 

The conference will accept both regular and short papers. Regular papers (6-10 pages in length) will describe more mature ideas, where a substantial amount of implementation, experimentation, or data collection and analysis will be described. Short papers (1-5 pages) can be less formal and will describe innovative ideas where a lesser degree of validation and implementation have occurred. All papers will appear in the ACM Digital Library. The best papers of IHI 2010 will also be considered for journal publication in a special issue of Springer's Journal of Medical Systems. Depending on the availability of time and space, not all papers will be given an oral presentation slot. Papers not selected for oral presentation will be available as posters. The conference organizers will work on ensuring that poster sessions are well attended and have a vibrant discussion environment.

Submitted papers must not have appeared in, or be under consideration for, another conference, workshop, journal, or other target of publication.

All aspects of the submission and notification process will be handled electronically. Submissions must adhere to the following formatting instructions:

" Papers must adhere to the ACM Proceedings Format available for LaTex, WordPerfect, WordPerfect 9, and Word. Changing the template's font size, margins, inter-column spacing, or line spacing is prohibited. Each paper must be submitted as a single PDF file, formatted for 8.5" x 11" paper.

" The length of submission depends on the type of submission:
- Regular papers must be 6-10 pages long.
- Short papers may be at most 5 pages long.

" Each paper must provide an appendix (which is excluded from the page limit) indicating the preferred review approach, including:
- The preferred allocation of reviewing expertise. This can be done by electing the primary and secondary focus of the paper (e.g., Computing, Information Science, Medicine, Nursing, and Social/Behavioral Science).
- A bulleted list with up to 3 topics covered in the paper (from the list of conference topics presented above)

IMPORTANT DATES

Abstract submission deadline: June 2, 2010 11:30pm EST
Paper submission deadline: June 4, 2010 11:30pm EST
Notification of acceptance: August 6, 2010 11:30pm EST
Camera-ready copy due: August 16, 2010 11:30pm EST

General Chair
Umit Catalyurek, Ohio State University (catalyurek.1 at osu dot edu)

Honorary General Chair
Gang Luo, IBM Research (luog at us dot ibm dot com)

Program Committee Co-Chairs
Henrique Andrade, IBM Research (hcma at us dot ibm dot com)
Neil R. Smalheiser, University of Illinois - Chicago (neils at uic dot edu)

Steering Committee Members 
Dorin Comaniciu, Siemens Corporate Research 
Michael D. Larsen, George Washington University 
Ching-Yung Lin, IBM Research 
Chunqiang Tang, IBM Research 
YingLi Tian, City College of New York 
Olivier Verscheure, IBM Research 
Michael Weiner, Indiana University 

Honorary Steering Committee members
Marion J. Ball, Johns Hopkins University & IBM Research
Joseph A. Konstan, University of Minnesota
Joel H. Saltz, Emory University

PROGRAM COMMITTEE MEMBERS
A Ishaq, SZABIST Dubai
Alec Holt, University of Otago
Amar Das, Stanford University
Ani Nahapetian, UCLA
Aryya Gangopadhyay, UMBC
Ashish Joshi, UMBC
Ashish Sharma, Emory University
Balakrishnan Prabhakaran, University of Texas at Dallas 
Barbara Hayes, Indiana University School of Informatics
Barbara Wildemuth, University of North Carolina at Chapel Hill
Chi-Ren Shyu, University of Missouri
Christopher Chute, Mayo Clinic
Chunqiang Tang, IBM Research
Courtney Corley, Pacific Northwest National Laboratory
Dan Morris, Microsoft Research
David Bader, Georgia Institute of Technology
Denise Anthony, Dartmouth College
Egondu Onyejekwe, Federal University of Technology Owerri
Egon L. van den Broek, Human-Centered Computing Consultancy, Vienna, Austria
Gregory Abowd, Georgia Tech
Guergana Savova, Harvard University
Hakan Ferhatosmanoglu, The Ohio State University
Hamid Ekbia, Indiana University
Hao Yang, Nokia Research
Hassan Ghasemzadeh, University of Texas at Dallas
H.Dominic Covvey, University of Waterloo
Honest Kimaro, University of Dar es Salaam
Huajun Chen, Zhejiang University
Javed Mostafa, University of North Carolina at Chapel Hill
Jiahui Liu, Google Inc. 
Jiming Liu, Hong Kong Baptist University
Jorge Ramirez, Apple Inc
Julie Jacko, University of Minnesota
Julie Kientz, University of Washington
Julie Maitland, National Research Council Canada
Julio Facelli, University of Utah
Jyotishman Pathak, Mayo Clinic College of Medicine
Kai Zheng, University of Michigan
Katarzyna Wac, Carnegie Mellon University
Katie Siek, University of Colorado at Boulder
Kay Connelly, Indiana University
Kelly Caine, Indiana University 
Kevin Daimi, University of Detroit Mercy
Kiran Turaga, H. Lee Moffitt Cancer Center and Research Institute
Lei Zhang, IBM Research
Lena Mamykina, Columbia University Medical Center
Liangyou Chen, U.S. Army Medical Research and Materiel Command
Lu Wang, Harvard-MIT
Luke (Jun) Huan, University of Kansas
Madhav Marathe,  Virginia Tech
Madhu C.Reddy, The Pennsylvania State University
Majid Sarrafzadeh, UCLA
Malika Mahoui, Indiana University Purdue University Indianapolis
Mathew Palakal, Indiana University Purdue University Indianapolis
Matt-Mouley Bouamrane, University of Glasgow
Meliha Yetisgen-Yildiz, University of Washington Medicine
Michael Larsen, George Washington University
Michelle Rogers, Drexel University
Minakshi Tikoo, University of Connecticut Health Center 
Mohammad Mahoor, University of Denver
Noemie Elhadad, Columbia University
Olivier Verscheure, IBM Research
Patrick Widener, Emory University
Radhakrishnan Nagarajan, University of Arkansas for Medical Sciences
Robert Patton, Oak Ridge National Laboratory
Roozbeh Jafari, University of Texas at Dallas
Samantha Adams, Erasmus University Rotterdam
Sanguthevar Rajasekaran, University of Connecticut
Selena Thomas, IBM Research
Shafaat Khan, COMSATS Institute of Information Technology
Sheba George, Charles Drew University of Medicine and Science
Soojin Park, University of Pennsylvania
Steven Demurjian, University of Connecticut
Suk-Chung Yoon, Widener University
Supten Sarbadhikari, PSG Institute of Medical Sciences and Research
Tahsin Kurc, Emory University
Ted Pedersen, University of Minnesota in Duluth
Thanos Vasilakos, University of Western Macedonia
Thomas Agresta, University of Connecticut Health Center
Thomas Finholt, University of Michigan
Thomas Karopka, IT Science Center Rügen gGmbH
Timothy Bickmore, Northeastern University
Tony Hu, Drexel University
Tyrone Grandison, IBM Research
Vagelis Hristidis, Florida International University 
Vasant Honavar, Iowa State University
Vincent Tseng, National Cheng Kung University
William Kaiser, UCLA
William Lane, Brigham and Women's Hospital
Xiaoxiao Chen, U.S. Army Medical Research and Materiel Command
Xue-wen Chen, The University of Kansas
Yang Gong, University of Missouri
YingLi Tian, The City College of New York
Ying Tao, IBM Research
Yu Deng, IBM Research
Yunan Chen, University of California Irvine
Zhaohui Cai, AstraZeneca
Zeeshan Syed, University of Michigan
________________________________________________________________________________

CALL FOR DEMOS
1st ACM International Health Informatics Symposium (IHI 2010)

IHI 2010
November 11-12, 2010
Arlington, Virginia
http://ihi2010.sighi.org

SCOPE OF THE DEMO TRACK

We cordially invite you to submit your contribution to the demo track of the 2010 ACM International Health Informatics Symposium (IHI 2010).

The IHI demo track is an exciting and highly interactive way to demonstrate your health informatics system or application. Because of IHI's focus on end-to-end systems, whereby applied informatics is used to address the needs of health and healthcare applications, demos of innovative systems are solicited, which illustrate practical research or engineering contributions in an interesting and interactive manner.

The demo program will be featured prominently in the conference program and should be seen as a vehicle for researchers, practitioners, and commercial/industrial/non-profit institutions to showcase innovative new technologies or applications in health informatics.

The demo review process will look for practical uses of technology and also for a "wow" factor in all submissions. We encourage the description of early prototypes as long as they clearly present a coherent, end-to-end view of what the application might become once it gets deployed in production.

A submission proposal includes a demo paper and can optionally include a demo video, whose URL should be referred to in the textual demo description for reviewers to take into consideration when analyzing the submission. Note that the demo paper should differ from regular papers in several important aspects. First, it should clearly describe the overall architecture of the system or technology demonstrated. Second, the paper should put great emphasis on the motivation of the work, on the applications of the presented system or technology, and on the novelty of the work. Third, the proposal should clearly describe the demo scenario. In particular, it should describe how the demo audience can interact with the demo system, in order to obtain understanding of the underlying technology. For demos running over the web, a back-up scenario should be described, in case of low connectivity at the demo venue.

All topics described in the Call for Papers are eligible for demo track submissions.

WHAT SHOULD BE SUBMITTED

All aspects of the submission and notification process will be handled electronically. Submissions must adhere to the following guidelines:

" The author(s) name and affiliation(s) must be present in the submitted document. Any submitted demo proposal violating the length, file type, or formatting requirements will be rejected without review.
" Papers must adhere to the ACM Proceedings Format available for LaTex, WordPerfect, WordPerfect 9, and Word. Changing the template's font size, margins, inter-column spacing, or line spacing is prohibited. Each paper must be submitted as a single PDF file, formatted for 8.5" x 11" paper.
" The length of submission is 4 pages. This page limit includes all parts of the proposal: title, abstract, body, and bibliography.
" Each paper must provide an appendix (which is excluded from the page limit) indicating the preferred review approach, including:
- The preferred allocation of reviewing expertise. This can be done by electing the primary and secondary focus of the paper (e.g., Computing, Information Science, Medicine, Nursing, and Social/Behavioral Science).
- A bulleted list with up to 3 topics covered in the paper (from the list of conference topics)

The optional demo video should focus on illustrating the demo scenario and the interactive nature of the demo system. The video must be no more than three minutes in length and should start by clearly identifying the authors and title of the proposal. The video should be in common video format (e.g., MPEG, AVI), and should be playable on a wide variety of media players. We strongly encourage authors to produce and submit a demo video and such video will be linked off of the final program on the conference website.

The notification for acceptance of demo papers is the same as that for regular papers. Accepted demo proposals will appear in the final proceedings and in ACM digital library. Note that all deadlines are the same as for regular paper submissions.

IMPORTANT DATES

Demo paper submission deadline: June 4, 2010 11:30pm EST
Notification of acceptance: August 6, 2010 11:30pm EST
Camera-ready copy due: August 16, 2010 11:30pm EST

Workshop on Advances in Algorithmic Game Theory, CWI Amsterdam, Sep. 2-3, 2010

(Apologies if you receive multiple copies!)

PRE-ANNOUNCEMENT / CALL FOR PARTICIPATION
==========================================================

WORKSHOP ON ADVANCES IN ALGORITHMIC GAME THEORY

Center for Mathematics and Computer Science (CWI)
Amsterdam, The Netherlands
September 2-3, 2010

Workshop website: http://www.cwi.nl/~schaefer/agt10

==========================================================

Algorithmic game theory has become a highly active research field that contributed successfully to
the understanding of many fundamental games in recent years. The aim of the workshop is to
provide an international forum for researchers that are active in this field to present and discuss
recent results, exchange ideas and identify potential future research directions. The workshop will
also offer young scientists the opportunity to get an overview of the state-of-the-art of the field.

The two-day workshop will be hosted at the Center for Mathematics and Computer Science (CWI)
in Amsterdam and will take place September 2-3, 2010. There will be four keynote talks and
about 12 contributed talks. The keynote speakers are:

* Ioannis Caragiannis (University of Patras, Greece)
* Michal Feldman (Hebrew University of Jerusalem, Israel)
* Jason Hartline (Nothwestern University, USA)
* Tim Roughgarden (Stanford University, USA)

A preliminary program is available on the website.

The participation at the workshop is free of charge. Participants will be asked to register at some
later stage.

More detailed information about the workshop will be provided soon on the website

http://www.cwi.nl/~schaefer/agt10

Local organizer:
Guido Schäfer

[DMANET] Workshop on Advances in Algorithmic Game Theory, CWI Amsterdam, Sep. 2-3, 2010

(Apologies if you receive multiple copies!)

PRE-ANNOUNCEMENT / CALL FOR PARTICIPATION
------------------------------------------------------------------------

WORKSHOP ON ADVANCES IN ALGORITHMIC GAME THEORY

Center for Mathematics and Computer Science (CWI)
Amsterdam, The Netherlands
September 2-3, 2010

Workshop website: http://www.cwi.nl/~schaefer/agt10

------------------------------------------------------------------------
Algorithmic game theory has become a highly active research field that
contributed successfully to the understanding of many fundamental
games in recent years. The aim of the workshop is to provide an
international forum for researchers that are active in this field to
present and discuss recent results, exchange ideas and identify
potential future research directions. The workshop will also offer
young scientists the opportunity to get an overview of the state-of-
the-art of the field.

The two-day workshop will be hosted at the Center for Mathematics and
Computer Science (CWI) in Amsterdam and will take place September 2-3,
2010. There will be four keynote talks and about 12 contributed talks.
The keynote speakers are:

* Ioannis Caragiannis (University of Patras, Greece)
* Michal Feldman (Hebrew University of Jerusalem, Israel)
* Jason Hartline (Nothwestern University, USA)
* Tim Roughgarden (Stanford University, USA)

A preliminary program is available on the website.

The participation at the workshop is free of charge. Participants will
be asked to register at some later stage.

More detailed information about the workshop will be provided soon on
the website

http://www.cwi.nl/~schaefer/agt10

Local organizer:
Guido Schaefer

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

PSC 2010 - deadline extended, submission link corrected

Submission deadline extended to May 18, 2010.

Check the correct URL for submissions:
http://www.easychair.org/conferences/?conf=psc20100
(There is another conference with only 1 zero at the end of URL.)

---------------------------------------------------------------------------

Prague Stringology Conference 2010

15th event of the Prague Stringology Club

http://www.stringology.org

Call for Papers

Prague, Czech Republic, August 30 - September 1, 2010

---------------------------------------------------------------------------

PSC'10 is the 15th event of the Prague Stringology Club. It is an
international conference focusing on stringology and related areas. It
is organized annually by the Prague Stringology Club, a research group
in the Department of Theoretical Computer Science at the Faculty of
Information Technology of Czech Technical University in Prague. The
proceedings of recent conferences are indexed in DBLP.

TOPICS:

Stringology is a part of algorithmic research that deals with the
processing of text strings. It has existed for at least thirty years
and developed into a respected subfield of its own. The last twenty
years have produced an explosion of new results. This progress is due
in part to the human genome effort, an area to which string algorithms
make important contributions. String processing extends into tree
processing that is called Arbology. The topics of the conference
include but are not limited to:

* algorithms for pattern matching in strings, images and trees
* data structures (automata, trees etc.) for pattern matching
in strings, images and trees
* coding and data compression
* bioinformatics
* information retrieval
* string processing algorithms in databases
* searching for regularities
* natural language processing

INVITED TALK:

* Reactive automata
M. Crochemore, King's College London

SUBMISSION:

Authors are cordially invited to submit their full papers (PDF format,
10-15 pages, A4 page format) by May 11, 2010. The paper should start
with the title, each author's name, affiliation, and e-mail address,
and a one-paragraph summary of the results and ideas. The paper should
be submitted via submission server
(http://www.easychair.org/conferences/?conf=psc2010).

For their final version the papers are required to be prepared using
our new LaTeX style available at http://www.stringology.org/pscproc2
which has an interface compatible to LNCS style.

IMPORTANT DATES:

* Submission of Papers: May 11, 2010
* Notification of Acceptance: June 26, 2010
* Registration: July 12, 2010
* Final Version Due: July 12, 2010

PROGRAM COMMITTEE:

* A. Amir, Bar Ilan University, Israel
* G. Andrejkova, P. J. Safarik University, Slovakia
* M. Crochemore, University of Marne-la-Vallee, France,
and King's College London, UK
* F. Franek, McMaster University, Canada
* J. Holub (co-chair), Czech Technical University in Prague,
Czech Republic
* C. S. Iliopoulos, King's College London, UK
* S. Inenaga, Kyushu University, Japan
* S. T. Klein, Bar Ilan University, Israel
* T. Lecroq, University of Rouen, France
* B. Melichar (co-chair), Czech Technical University in Prague,
Czech Republic
* Y. Pinzon, National University of Colombia, Colombia
* M.-F. Sagot, Inria Rhone-Alpes, France
* W. F. Smyth, McMaster University, Canada, and
Curtin University of Technology, Australia
* B. W. Watson, FASTAR Group (Stellenbosch University
and University of Pretoria), South Africa

ORGANIZING COMMITTEE:

* M. Balik (co-chair), Czech Technical University in Prague,
Czech Republic
* J. Holub (co-chair), Czech Technical University in Prague,
Czech Republic
* J. Janousek, Czech Technical University in Prague, Czech Republic
* B. Melichar, Czech Technical University in Prague, Czech Republic
* L. Vagner, Czech Technical University in Prague, Czech Republic
* J. Zdarek, Czech Technical University in Prague, Czech Republic

HISTORY:

PSC'10 was preceded by Prague Stringology Workshops in 1996-2000 and
by Prague Stringology Conferences in 2001-2006, 2008-2009. Each year
proceedings are prepared for the conference. They are published by
Czech Technical University in Prague and are also available from the
PSC web pages. Selected papers from the later workshops were also
published in a special issue of the journal Kybernetika. Selected
papers from the 2002-2006, 2008 conferences were then published in the
Nordic Journal of Computing, Journal of Automata, Languages, and
Combinatorics, and International Journal of Foundations in Computer
Science.

LOCATION & PUBLICATION:

PSC'10 will be held at the Department of Theoretical Computer Science
the Czech Technical University in Prague on August 30 - September 1,
2010. (The precise location will be announced later.) The working
language is English. As usual, accepted papers will appear in
conference proceedings published by the Czech Technical University in
Prague and distributed at the conference. After further refereeing,
selected papers will then be published in an international journal.

---------------------------------------------------------------------------
We apologize if you have received multiple copies of this announcement.

If you wish to be removed from the mailing list used for distributing
announcements of the Prague Stringology Conferences or other events
related to automata and stringology (see the topics above), reply this
email with the message "REMOVE ME FROM THIS MAILING LIST."

[DMANET] Junior Professorship in Network Analysis

The University of Konstanz invites applications for a newly created
assistant professor position in social network analysis:

http://www.uni-konstanz.de/news/index.php?cont=stellausw&seite=2010/073&id=1

Salary scale W1 translates into approx. 44.000 EUR/year before taxes.
German language skills are not required.

While the position is in the Department of Computer & Information Science,
this is an open call for applicants from any discipline, provided they
have an interest to further the development of network-analytic methods.
Possible backgrounds thus include algorithmics, graph theory, complex
systems theory, stochastic network models, graph drawing, and many more.

The University of Konstanz is a highly reputed institution, and
provides an excellent environment for multidisciplinary collaboration.
Please contact me for further information.

Application deadline: June 4th

Best regards,

B.

--
Prof. Dr. Ulrik Brandes
Department of Computer & | +49 7531 88-4433 (phone)
Information Science, Box 67 | +49 7531 88-3577 (fax)
University of Konstanz | Ulrik.Brandes@uni-konstanz.de
78457 Konstanz, Germany | http://www.inf.uni-konstanz.de/~brandes/
**********************************************************
*
* 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/
*
**********************************************************