Tuesday, February 16, 2010

Data Mining Conference - Call for Papers

CALL FOR PAPERS
and
Call For Workshop/Session Proposals

DMIN'10
The 2010 International Conference on Data Mining

http://www.dmin-2010.com

Date and Location: July 12-15, 2010, Las Vegas, USA

You are invited to submit a full paper for consideration. All
accepted papers will be published in the 2010 DMIN conference
proceedings (in printed book form; later, the proceedings will
also be accessible online). Those interested in proposing a
workshop, special session, or a tutorial should refer to the
relevant sections that appear below.

SCOPE: Topics of interest include, but are not limited to, the following:

O Data Mining Tasks
- Regression/Classification
- Time series forecasting
- Segmentation/Clustering/Association
- Deviation and outlier detection
- Explorative and visual data mining
- Web mining
- Mining text and semi-structured data
- Temporal and spatial data mining
- Multimedia mining (audio/video)
- Others

O Data Mining Algorithms
- Artificial neural networks
- Fuzzy logic and rough sets
- Decision trees/rule learners
- Support vector machines
- Evolutionary computation/meta heuristics
- Statistical methods
- Collaborative filtering
- Case based reasoning
- Link and sequence analysis
- Ensembles/committee approaches
- Others

O Data Mining Integration
- Mining large scale data
- Distributed and grid based data mining
- Data and knowledge representation
- Data warehousing and OLAP integration
- Integration of prior/domain knowledge
- Metadata and ontologies
- Agent technologies for data mining
- Legal and social aspects of data mining
- Others

O Data Mining Process
- Data cleaning and preparation
- Feature selection and transformation
- Attribute discretisation and encoding
- Sampling and rebalancing
- Missing value imputation
- Model selection/assessment and comparison
- Induction principles
- Model interpretation
- Others

O Data Mining Applications
- Bioinformatics/Medicine
- Business/Industrial
- Engineering
- Military/Security
- Social science
- Others

O Data Mining Software
We particularly encourage submissions of industrial applications and
case studies from practitioners. These will not be evaluated using
solely theoretical research criteria, but will take general interest
and presentation stringer into consideration.

O Alternative and additional examples of possible topics include:
Data Mining for Business Intelligence; Emerging technologies in data
mining; Computational performance issues in data mining; Data mining
in usability; Advanced prediction modelling using data mining; Data
mining and national security; Data mining tools; Data analysis;
Data preparation techniques (selection, transformation, and
preprocessing); Information extraction methodologies; Clustering
algorithms used in data mining; Genetic algorithms and categorization
techniques used in data mining; Data and information integration;
Microarray design and analysis; Privacy-preserving data mining; Active
data mining; Statistical methods used in data mining; Multidimensional
data; Automatic data cleaning; Data visualization; Theory and practice
(knowledge representation and discovery); Knowledge Discovery in
Databases (KDD); Uncertainty management; Data reduction methods; Data
engineering; Content mining; Indexing schemes; Information retrieval;
Metadata use and management; Multidimensional query languages and
query; Multimedia information systems; Search engine query processing;
Pattern mining; Applications (examples: data mining in education,
marketing, finance and financial services, business applications,
medicine, bioinformatics, biological sciences, science and technology,
industry and government, ...).


USEFUL WEB LINKS

To see the DBLP list of accepted papers in the last offering of DMIN, go to:
http://www.informatik.uni-trier.de/~ley/db/conf/dmin/dmin2009.html

The main web site of DMIN'10 can be found at:
http://www.dmin-2010.com

The web site of WORLDCOMP'10 can be found at:
http://www.world-academy-of-science.org/


ACADEMIC CO-SPONSORS:

Currently being prepared - The sponsors will include a number
of active research labs and centers that have helped to shape
our field. The Academic sponsors of the last offering of
DMIN & WORLDCOMP included research labs and centers
affiliated with United States Military Academy, Harvard
University, MIT, Argonne National Lab., University of Illinois
at Urbana-Champaign, University of Minnesota, University of
Texas at Austin, Georgia Institute of Technology, George Mason
University, Vienna University of Technology, University of
Siegen, Russian Academy of Sciences, University of Iowa,
SECLAB (Italy), University of North Dakota, Texas A&M
University, National Institute for Health Research,
International Society of Intelligent Biological Medicine,
Academy of Biomedical Sciences and Technologies, and European
Commission. For 2010, we will also include The Berkeley
Initiative in Soft Computing/BISC of University of California,
Berkeley (confirmed.) In recent offerings of WORLDCOMP/DMIN,
corporate sponsors included: Google, Intel, Salford Systems,
Element CXI, Synplicity, NIIT, SuperMicro, HPCNano, Council on
Medical & Care Compunetics, Scientific Tech. Corp., HoIP, GridToday.


DMIN'10 Conference Chairs:

Dr. Robert Stahlbock
University of Hamburg, Germany
conference-chair@dmin-2010.com
(General Conference Chair)

Dr. Sven F. Crone
Lancaster University, United Kingdom
s.crone@lancaster.ac.uk
(Program Chair)

Members of the Steering Committee of WORLDCOMP 2010:

(DMIN'10 is an important track of WORLDCOMP which is a federated
event. What appears below is a partial list of members of the
steering committee.)

Prof. Hamid R. Arabnia
Coordinator & General Co-Chair, WORLDCOMP 2010,
Professor, Computer Science,
Editor-in-Chief, The Journal of Supercomputing (Springer),
Co-Editor/Board, Journal of Computational Science (Elsevier),
Advisory Board, IEEE Technical Committee on Scalable Computing,
The University of Georgia, Georgia, USA
email: hra@cs.uga.edu

Dr. Selim Aissi
Chief Strategist - Security, Manageability and Virtualization,
Ultra Mobile Group, Intel Corporation, USA

Prof. Ruzena Bajcsy
Member, National Academy of Engineering,
IEEE Fellow, ACM Fellow,
Professor, Electrical Engineering & Computer Sciences
University of California, Berkeley, California, USA

Prof. Hyunseung Choo
ITRC Director of Ministry of Information & Communication, Korea,
Director, ITRC: Intelligent HCI Convergence Research Center, Korea,
Director, Korea Information Processing Society,
Assoc. Editor, ACM Transactions on Internet Technology,
Assoc. Editor, Transactions on Computational Science, Springer-Verlag;
Director, Korean Society for Internet Info. (KSII) + Society for Sim.;
Sungkyunkwan University, Korea

Prof. Andy Marsh
Director HoIP (Healthcare over Internet Protocol),
Secretary-General WABT (World Academy of Biomedical Science & Tech.),
Vice-president ICET (Int'l Council for Engineering & Technology),
Vice-president ICMCC (Int'l Council on Medical & Care Compunetics),
Visiting Professor, University of Westminster, UK

Prof. Lotfi A. Zadeh
Member, National Academy of Engineering,
IEEE Fellow, ACM Fellow, AAAS Fellow, AAAI Fellow, IFSA Fellow,
Director, Berkeley Initiative in Soft Computing,
Professor, University of California, Berkeley, USA


PURPOSE / HISTORY:

DMIN'10 Conference is being held jointly (same location and dates)
with a number of other research conferences (WORLDCOMP).
WORLDCOMP is the largest annual gathering of researchers in computer
science, computer engineering and applied computing. We anticipate
to have 2,000 or more attendees from over 85 countries participating
at WORLDCOMP Congress. A number of individual research tracks of
the Congress have been held for many years; for example, PDPTA has
been held annually since 1995 (PDPTA'10 is the 16th annual
conference); ERSA has been held annually since 2001 (ERSA'10 is the
10th annual conference); ICAI has been held annually since 1999
(ICAI'10 is the 12th annual conference); DMIN has been held
annually since 2003 (DMIN'10 is the 8th annual conference;
originally it was offered as part of IKE). Other tracks of
WORLDCOMP Congress have similar records.

The motivation behind this federated congress is to assemble
a spectrum of affiliated research conferences into a coordinated
research meeting held in a common place at a common time. The
main goal is to provide a forum for exchange of ideas in a
number of research areas that interact. The model used to form
DMIN facilitates communication among researchers from all
over the world in different fields of computer science,
computer engineering, applied computing, information science,
and computational biology. Both inward research (core areas)
and outward research (multi-disciplinary, inter-disciplinary,
and applications) will be covered during the conference.
DMIN makes concerted effort to reach out to participants
affiliated with diverse entities (such as: universities,
institutions, corporations, government agencies, and research
centers/labs) from all over the world.

DMIN'10 will be composed of research presentations, keynote
lectures, invited presentations, tutorials, panel discussions,
and poster presentations. In recent past, keynote/tutorial/panel
speakers have included (as part of the federated event):
Prof. David A. Patterson (pioneer/computer architecture, U. of
California, Berkeley), Dr. K. Eric Drexler (known as Father of
Nanotechnology), Prof. John H. Holland (known as Father of
Genetic Algorithms; U. of Michigan), Prof. Ian Foster (known as
Father of Grid Computing; U. of Chicago & ANL), Prof. Ruzena
Bajcsy (pioneer/VR, U. of California, Berkeley), Prof. Barry
Vercoe (Founding member of MIT Media Lab, MIT), Dr. Jim Gettys
(known as X-man, developer of X Window System, xhost; OLPC),
Prof. John Koza (known as Father of Genetic Programming,
Stanford U.), Prof. Brian D. Athey (NIH Program Director, U. of
Michigan), Prof. Viktor K. Prasanna (pioneer, U. of Southern
California), Dr. Jose L. Munoz (NSF Program Director and
Consultant), Prof. Jun Liu (Broad Institute of MIT & Harvard U.),
Anousheh Ansari (CEO, Prodea Systems & first female private
space explorer), and many other distinguished speakers.
Tutorial speakers for data mining oriented tutorials have included
Prof. Eamonn Keogh (U. of California,Riverside), Ashu M.G. Solo
(Principal of Maverick Technologies America Inc.), Mikhail Golovnya
(Senior Scientist, Salford Systems), Prof. Nitesh V. Chawla
(U. of Notre Dame, USA), Dr. Peter Geczy (National Institute of
Advanced Industrial Science and Technology (AIST), Japan),
Prof. Asim Roy (Arizona State University), and Dr. Dan Steinberg
(CEO of Salford Systems).
To get a feeling about the events' atmosphere, see the
2009 delegates photos available at:
http://www.pixagogo.com/1672514104
2008 delegates photos can be viewed at:
http://www.pixagogo.com/8658134154


SUBMISSION OF PAPERS, PUBLICATION, INDEXING INFORMATION:

Prospective authors are invited to submit their papers by
uploading them to the DMIN'10 online paper collection and
review system. Submissions must be uploaded by March 1, 2010
and they must be in pdf format. Details (submission system,
typesetting formats etc.) can be found on the DMIN'10 web site at:
http://www.dmin-2010.com/submission.htm

The length of the Camera-Ready papers (if accepted) will be
limited to 7 (IEEE style) pages. Papers must not have been
previously published or currently submitted for publication
elsewhere. The first page of the draft paper should include:
title of the paper, name, affiliation, postal address, and
email address for each author. The first page should also
identify the name of the Contact Author and a maximum of 5
topical keywords that would best represent the content of
the paper.

Full papers will be evaluated for originality, significance,
clarity, impact, and soundness. Each paper will be refereed
by at least two experts in the field who are independent of the
conference program committee. The referees' evaluations will
then be reviewed by one member of the program committee who
will recommend a decision to the chair of the track that
the paper has been submitted to. The chair will make the
final decision. Lastly, the final papers will be reviewed
by one member of the program committee.

All accepted papers will be published in the respective
conference proceedings (in both, printed book form as well as
online). The proceedings will be indexed in Inspec/IET/
The Institute for Engineering and Technology, DBLP/Computer
Science Bibliography, and others.) The printed proceedings
will be available for distribution on site at the conference.

In addition to the publication of the proceedings, selected
authors will be invited to submit extended versions of their
papers for publication in a number of research books being
proposed/contracted with various publishers (such as, Springer,
Elsevier, IOS, ...) - these books would be composed after the
conference. Also, many chairs of sessions and workshops will
be forming journal special issues to be published after the
conference. For DMIN'10, it is planned to publish extended
papers in a Special Issue in Annals of Information Systems
focused on Web Mining.


PROPOSAL FOR ORGANIZING SPECIAL SESSIONS/WORKSHOPS:

Each session will have at least 6 paper presentations from
different authors (12 papers in the case of workshops). The
session chairs will be responsible for all aspects of their
sessions; including, soliciting papers, reviewing, selecting, ...
The names of session chairs will appear as Associate Editors
in the conference proceedings and on the cover of the books.

Proposals to organize sessions should include the following
information: name and address (+ email) of proposer, his/her
biography, title of session, a 100-word description of the
topic of the session, the relevance for DMIN), and a short
description on how the session will be advertised (in most
cases, session proposers solicit papers from colleagues and
researchers whose work is known to the session proposer).
Please email your session/workshop proposal to the DMIN'10
Special Session Chair Gary M. Weiss via
special-session-chair@dmin-2010.com .
We would like to receive the session proposals
by January 30, 2010.


IMPORTANT DATES:

Jan. 30, 2010: Proposals for organizing sessions/workshops
March 1, 2010: Submission of papers (about 5 to 7 pages)
March 25, 2010: Notification of acceptance
April 22, 2010: Final papers + Copyright + Registration
July 12-15, 2010: The 2010 International Conference on Data
Mining (DMIN'10)


MEMBERS OF PROGRAM AND ORGANIZING COMMITTEES:

The Program Committee includes members of chapters of World
Academy of Science (chapters: supercomputing; scientific
computing; AI; imaging science; databases; simulation;
software eng.; embedded systems; internet & web technologies;
communications; computer security; & bioinformatics.) The
Program Committee for DMIN'10 conference is currently
being formed. Many who have already joined the committees
of individual tracks are renowned leaders, scholars,
researchers, scientists and practitioners of the highest
ranks; many are directors of research labs., fellows of
various societies, heads/chairs of departments, program
directors of research funding agencies, deans and provosts.
You can view the list of program committee of the last offering
of DMIN at: http://www.dmin--2009.com/committees.htm
Program Committee members are expected to have established
a strong and documented research track record. Those
interested in joining the Program Committee should email
to the Program Chair (programme-chair@dmin-2010.com), the
following information for consideration/evaluation:
Name, affiliation and position, complete mailing address,
email address, and a one-page biography that includes research
expertise.


LOCATION OF CONFERENCE:

DMIN'10 will be held at Monte Carlo Resort, Las Vegas,
Nevada, USA (with any overflows at other near-by hotels).
This is a mega hotel with excellent conference facilities and
over 3,000 rooms. It is minutes from the airport with 24-hour
shuttle service to and from the airport. This hotel has many
recreational attractions, including: waterfalls, spa, pools,
sunning decks, Easy River, wave pool, nightly shows, many
restaurants, ... The hotel is adjacent to CityCenter
( http://en.wikipedia.org/wiki/CityCenter ) which is the
largest private development in the United States' history
(costing over $11 Billion); this offers access to additional
recreational and entertainment attractions. The negotiated
room rate for conference attendees is very reasonable.

CMCS 2010: Call for Short Submissions & Call for Participation

------------------------------------------------------------------------
CMCS 2010
Call for Short Submissions & Call for Participation
------------------------------------------------------------------------

The 10th International Workshop on Coalgebraic Methods in Computer Science
26-28 March 2010, Paphos, Cyprus
(co-located with ETAPS 2010)
<http://event.cwi.nl/cmcs10/>

Aims and scope
-------------------------

The aim of the workshop is to bring together researchers with a common
interest in the theory of coalgebras and its applications. Over the
last two decades, coalgebra has developed into a field of its own,
presenting a mathematical foundation for various kinds of dynamical
systems, infinite data structures, and logics. Coalgebra has an ever
growing range of applications in and interactions with other fields such
as reactive and interactive system theory, object oriented and
concurrent programming, formal system specification, modal logic,
dynamical systems, control systems, category theory, algebra, analysis,
etc.

The topics of the workshop include, but are not limited to:

* the theory of coalgebras (including set theoretic and categorical
approaches);
* coalgebras as computational and semantical models (for programming
languages, dynamical systems, etc.);
* coalgebras in (functional, object-oriented, concurrent) programming;
* coalgebras and data types;
* (coinductive) definition and proof principles for coalgebras (with
bisimulations or invariants);
* coalgebras and algebras;
* coalgebraic specification and verification;
* coalgebras and (modal) logic;
* coalgebra and control theory (notably of discrete event and hybrid
systems).


An anniversary: the 10th CMCS
---------------------------------------------

CMCS took place for the first time when ETAPS started, in 1998. Since
then, it has always been collocated with ETAPS, becoming bi-annual since
the start of CALCO (Conference on Algebra and Coalgebra) in 2005.

In 2010, we will celebrate the 10th edition of CMCS, by inviting a
number of specialists in the field to present overviews of both obtained
results and future challenges.

Invited Speakers
-------------------------

At this tenth meeting the following invited speakers will present
overviews of important subareas.

* Venanzio Capretta: Coalgebra in functional programming and type theory
* Bartek Klin: Operational semantics coalgebraically
* Dirk Pattinson: Logic and coalgebra
* Ana Sokolova: Probabilistic systems coalgebraically


Short contributions
-----------------------------

Apart from the presentation of regular papers (see list below) and
invited contributions, some time has been reserved for *short
contributions* .

These will not be published in the proceedings but will be bundled in a
CWI technical report.

They should be no more than two pages and may describe work in progress,
summarise work submitted to a conference or workshop elsewhere, or in
some other way appeal to the CMCS audience. The instructions for
submitting short contributions can be found at:
<http://event.cwi.nl/cmcs10/submission.html>


Important dates
-------------------
* 27 February 2010: strict submission deadline short contributions
* 28 February 2010: deadline normal registration
* 6 March 2010: notification short contributions
* 26-28 March 2010: the workshop


List of accepted regular papers
---------------------------------------------
* Jan Komenda . Coinduction in concurrent timed systems
* Jiri Adamek, Stefan Milius and Jiri Velebil . Recursive Program
Schemes and Context-Free Monads
* Bartek Klin . Structural operational semantics and modal logic,
revisited
* Hauhs Michael and Baltasar Tranc n y Widemann . Applications of
Algebra and Coalgebra in Scientific Modelling: Illustrated with the
Logistic Map
* Kazuyuki Asada and Ichiro Hasuo . Categorifying Computations into
Components via Arrows as Profunctors
* Corina Cirstea . Generic Infinite Traces and Path-Based Coalgebraic
Temporal Logics
* Vincenzo Ciancia, Alexander Kurz and Ugo Montanari . Families of
symmetries for the semantics of programming languages
* Jiho Kim . Higher-order algebras and coalgebras from parameterized
endofunctors
* Bart Jacobs . From Coalgebraic to Monoidal Traces
* Adriana Balan and Alexander Kurz . On coalgebras over algebras


Programme Committee
----------------------------------
Jiri Adamek (Braunschweig)
Alexandru Baltag (Oxford)
Luis Barbosa (Braga)
Marcello Bonsangue (Leiden)
Corina Cirstea (Southampton)
Robin Cockett (Calgary)
Andrea Corradini (Pisa)
Neil Ghani (Glasgow)
Peter Gumm (Marburg)
Furio Honsell (Udine)
Bart Jacobs (Nijmegen, co-chair)
Bartek Klin (Cambridge)
Clemens Kupke (London)
Alexander Kurz (Leicester)
Marina Lenisa (Udine)
Stefan Milius (Braunschweig)
Ugo Montanari (Pisa)
Larry Moss (Bloomington)
Milad Niqui (Amsterdam)
Dirk Pattinson (London)
Dusko Pavlovic (Oxford)
John Power (Edinburgh)
Horst Reichel (Dresden)
Grigore Rosu (Urbana)
Jan Rutten (Amsterdam, co-chair)
Davide Sangiorgi (Bologna)
Lutz Schr der (Bremen)
Alexandra Silva (Amsterdam)
Hendrik Tews (Nijmegen)
Tarmo Uustalu (Tallinn)
Yde Venema (Amsterdam)
Hiroshi Watanabe (Osaka)
James Worrell (Oxford)

Organising Committee
--------------------------

Bart Jacobs,
Milad Niqui (co-chair, CWI),
Jan Rutten,
Alexandra Silva (co-chair, CWI).


Contact
----------
cmcs10@cwi.nl

.

[DMANET] CMCS 2010: Call for Short Submissions & Call for Participation

------------------------------------------------------------------------
CMCS 2010
Call for Short Submissions & Call for Participation
------------------------------------------------------------------------

The 10th International Workshop on Coalgebraic Methods in Computer Science
26-28 March 2010, Paphos, Cyprus
(co-located with ETAPS 2010)
<http://event.cwi.nl/cmcs10/>

Aims and scope
-------------------------

The aim of the workshop is to bring together researchers with a common
interest in the theory of coalgebras and its applications. Over the
last two decades, coalgebra has developed into a field of its own,
presenting a mathematical foundation for various kinds of dynamical
systems, infinite data structures, and logics. Coalgebra has an ever
growing range of applications in and interactions with other fields such
as reactive and interactive system theory, object oriented and
concurrent programming, formal system specification, modal logic,
dynamical systems, control systems, category theory, algebra, analysis,
etc.

The topics of the workshop include, but are not limited to:

* the theory of coalgebras (including set theoretic and categorical
approaches);
* coalgebras as computational and semantical models (for programming
languages, dynamical systems, etc.);
* coalgebras in (functional, object-oriented, concurrent) programming;
* coalgebras and data types;
* (coinductive) definition and proof principles for coalgebras (with
bisimulations or invariants);
* coalgebras and algebras;
* coalgebraic specification and verification;
* coalgebras and (modal) logic;
* coalgebra and control theory (notably of discrete event and hybrid
systems).


An anniversary: the 10th CMCS
---------------------------------------------

CMCS took place for the first time when ETAPS started, in 1998. Since
then, it has always been collocated with ETAPS, becoming bi-annual since
the start of CALCO (Conference on Algebra and Coalgebra) in 2005.

In 2010, we will celebrate the 10th edition of CMCS, by inviting a
number of specialists in the field to present overviews of both obtained
results and future challenges.

Invited Speakers
-------------------------

At this tenth meeting the following invited speakers will present
overviews of important subareas.

* Venanzio Capretta: Coalgebra in functional programming and type theory
* Bartek Klin: Operational semantics coalgebraically
* Dirk Pattinson: Logic and coalgebra
* Ana Sokolova: Probabilistic systems coalgebraically


Short contributions
-----------------------------

Apart from the presentation of regular papers (see list below) and
invited contributions, some time has been reserved for *short
contributions* .

These will not be published in the proceedings but will be bundled in a
CWI technical report.

They should be no more than two pages and may describe work in progress,
summarise work submitted to a conference or workshop elsewhere, or in
some other way appeal to the CMCS audience. The instructions for
submitting short contributions can be found at:
<http://event.cwi.nl/cmcs10/submission.html>


Important dates
-------------------
* 27 February 2010: strict submission deadline short contributions
* 28 February 2010: deadline normal registration
* 6 March 2010: notification short contributions
* 26-28 March 2010: the workshop


Organising Committee
--------------------------

Bart Jacobs,
Milad Niqui (co-chair, CWI),
Jan Rutten,
Alexandra Silva (co-chair, CWI).


Contact
----------
cmcs10@cwi.nl

.
**********************************************************
*
* 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] Ph.D. studentship at INRIA Lille

Applications are invited for a Ph.D. studentship at Sequential Learning
Lab in INRIA Lille, France.
The topic is time series prediction, and non-parametric statistical
analysis of time series.


Position:
3 years, fully funded position.
The position will start in September 2010. The deadline for applications
will be around mid March,
but interested candidates are encouraged to contact me earlier.


Environment:
The PhD student will work with Daniil Ryabko http://daniil.ryabko.net ,
and with other members of the SequeL group
http://sequel.futurs.inria.fr/ at INRIA Lille.
SequeL is one of the most dynamic labs at INRIA, with over 20
researchers (including PhD students)
working on both fundamental and practical aspects of sequential learning
problems:
from statistical learning, through reinforcement learning, to computer
poker and Go players.
INRIA is France's leading institution in Computer Science, with over
2800 scientists
employed, of which around 250 in Lille.

Lille is the capital of the north of France, a metropolis with 1 million
inhabitants,
with excellent train connection to Brussels (40 min), Paris (1h) and
London (1.5h by train).

Subject:
The basic problem setup is as follows. There is an unknown stochastic
source of data, generating observations in a sequential fashion. The
data can be anything from stock market observations, to DNA sequences,
to behavioural sequences. There are several learning and inference
problems connected with it, of which the two most basic ones are:
predicting the probabilities of the next observations, and testing
hypotheses about the source (such as independence, homogeneity, etc.)
To solve these problems, one has to consider models of the data.
Different types of data require different models.

The goal is to describe those probabilistic models under which
successful learning is possible, for the inference problems
considered: sequential prediction, and hypothesis testing. This would
eventually lead to an automated modelling algorithms for sequential
learning. The primary goal, however, is to establish a theoretical
understanding of what is possible to learn, in the sequential problems
of inference considered, under which assumptions. More precisely, a data
source is a probability distribution on the set of all possible
sequences of observations, and a model is a set of such probability
distributions. We are interested in identifying the properties of models
which ensure the existence of efficient algorithms that are successful
(e.g. as predictors) given the model.


Requirements:

The successful candidate will have a MSc or equivalent degree in
mathematics or computer science,
with strong background in probability and statistics.
Programming skills will be considered a plus.
The working language in the lab is English.

For further information please email daniil.ryabko at inria.fr ,
with subject -SeqPHD-, joining a CV and a description of interests.

See also http://www.inria.fr/travailler/opportunites/doc.en.html

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

[DMANET] Five PhD Scholarships in Algorithmics

The Department of Mathematics and Computer Science at the
University of Southern Denmark has funding for five PhD students
for projects in Algorithmics. Each project will be in one of the
areas of On-Line Algorithms, Graph Algorithms, and Bioinformatics.
Further information about these areas and projects can be found at:
http://www1.imada.sdu.dk/areas.html

The qualifications necessary for applicants are:

1. A course in Algorithms and Complexity. This is a course beyond a
low level course on Data Structures.

2. A Master's degree in Computer Science, or a Bachelor's degree in
Computer Science with one year of courses beyond a 3-year Bachelor's
degree. (Note that the PhD programme lasts three years in the first
case and four in the second.) The degree cannot be from the University
of Southern Denmark. For the area graph algorithms, degrees in Mathematics
are also acceptable.

3. Excellent grades and letters of recommendation.

4. Interest and motivation to work in one of these areas.

5. Fluency in English.

The start date for these scholarships is August 16, 2010. The amount of the
scholarship, which is paid as salary (including pension contribuations and
vacation money), is about 380,000.00 DKK (equivalent to approx. 51,000.00 Euros
or $71,000.00 US) per year for students who already have a Master's degree.
The salary starts lower for students who do not have a Master's degree making
the total salary over four years approximately the same as the salary over
three years for the students with a Master's degree.

The algorithmics group at the Department of Mathematics and Computer Science
provides a very strong scientific environment combined with a friendly atmosphere.
The University of Southern Denmark was founded in 1966 and currently has several
campuses, with a total of almost 20,000 students. The Department of Mathematics
and Computer Science resides at the main campus which is located in Odense, the
third largest city in Denmark, a country known for its high standard of living,
high tech industry, and cultural scene.

The application deadline is April 1, 2010.
For application details see: http://www.jobs.sdu.dk/vis_stilling.php?id=5693&lang=eng
For further information, please contact Joan Boyar, joan@imada.sdu.dk.
**********************************************************
*
* 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/
*
**********************************************************

Monday, February 15, 2010

[DMANET] AAAC 2010 - Call for Participation

*** The registration server is open. ***
*** Hotel and Early registration until March 19 ***

-----------------------------------------------------------------------
The 3rd Annual Meeting of the Asian Association for
Algorithms and Computation (AAAC 2010)
April 17-19, 2010
Pohang, Korea

http://geo.postech.ac.kr/aaac2010

Asian Association for Algorithms and Computation (AAAC) was founded in
2007 to give a place for promoting collaborations of Asian people in
all areas of theoretical computer science. Its inaugural meeting was
held in Hong Kong on April 26-27, 2008, and its second meeting in
Hangzhou, China on April 11-12, 2009.

The Third Annual Meeting of the AAAC will be held in Pohang, Korea,
on April 17-19, 2010. We invite submissions of one-page abstracts that
can be based on original research or survey of existing
results in areas of theoretical computer science, especially design
and analysis of algorithms and complexity theory.

----- Meeting Format -----

Two invited talks and parallel contributed
talks, in which 8-10 will be accepted as long talks. The meeting starts
around 9 a.m. on April 17 (Saturday) and ends around 5 p.m. on 19
(Monday). There will be a conference dinner in the evening of April
18.

----- Paper Submission -----

Authors are invited to submit one-page (A4) abstracts
that can be based on original results or survey of existing
results. Informal working notes including the one-page abstracts will
be distributed at the meeting, which does not prevent any form of
future publication on the same work.

All submissions should be made electronically;
see the AAAC 2010 web pages
http://geo.postech.ac.kr/aaac2010
for detailed submission instructions.

----- Important Dates -----

* February 5, 2010 : Abstract submissions due
* March 1, 2010 : Notification of acceptance/rejection of papers
* March 15, 2010 : Early registration due
* April 17-19, 2010 : Meeting at Pohang, Korea

----- Invited Speakers -----

Jin-Yi Cai (Wisconsin, USA) - "Progress on the Complexity of Counting Problems"
Jeong Han Kim (NIMS, Korea) - TBA.

----- Program Committee -----

Hee-Kap Ahn (Pohang University of Science and Technology)
Siu-Wing Cheng (The Hong Kong University of Science and Technology)
Francis Chin (The University of Hong Kong)
Peter Eades (University of Sydney)
Rudolf Fleischer (Fudan University)
Kazuo Iwama (Kyoto University, chair)
D.T. Lee (Academia Sinica)
Subhas Nandy (Indian Statistical Institute)
Kunsoo Park (Seoul National University)
Md. Saidur Rahman (Bangladesh University of Engineering and Technology)
Xiaoming Sun (Tsinghua University)
Takeshi Tokuyama (Tohoku University)
Guochuan Zhang (Zhejiang University)
Louxin Zhang (National University of Singapore)

----- Organizing Committee -----

Hee-Kap Ahn (Pohang University of Science and Technology, chair)
Iris Reinbacher (Pohang University of Science and Technology)
Wanbin Son (Pohang University of Science and Technology)
Donghun Yeo (Pohang University of Science and Technology)

----- Contacts -----

Kazuo Iwama (Kyoto University, Program Committee chair)
iwama@kuis.kyoto-u.ac.jp

Hee-Kap Ahn (Pohang University of Science and Technology, Organizing
Committee chair)
heekap@postech.ac.kr
**********************************************************
*
* 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] COCOON 2010 - Deadline extended

Dear all,

Due to multiple requests, we are extending the submission deadline to Feb
22, 11:59pm PST. This will be a firm deadline.

Thanks,
My

###################################################################################
COCOON 2010 - CALL FOR PAPERS
The 16th Annual International Computing and Combinatorics Conference
(COCOON 2010)

http://www.cise.ufl.edu/cocoon2010/

July 19 - July 21, 2010.
Sheraton Hotel, NhaTrang, Vietnam
###################################################################################

IMPORTANT DATES

* Submission Deadline: February 22, 2010, 11:59pm PST (Extended)
* Notification of acceptance: April 12, 2010
* Camera Ready / Registration: April 29, 2010
* Early Registration: May 17, 2010
* Conference Dates: July 19 - 21, 2010


SCOPE and MISSION

The 16th Annual International Computing and Combinatorics Conference
(COCOON 2010) will be held in Nha Trang, Vietnam during July 19 -- 21.
The conference organizers would like to extend their most cordial
invitation to researchers around the world to come to one of the most
beautiful countries in South East Asia, to explore its 4000-year-old
culture, to enjoy the beach scenery and to exchange their most
significant research works.

Original research works in the areas of algorithms, theory of
computation, computational complexity, and combinatorics related to
computing are solicited. In addition to theoretical studies,
submissions that report on experimental and applied research of
general algorithmic interest are especially encouraged.

Topics of interest (but not limited to)

* Algorithms and data structures;
* Algorithmic game theory and online algorithms;
* Automata, languages, logic, and computability;
* Combinatorics related to algorithms and complexity;
* Complexity theory;
* Computational learning theory and knowledge discovery;
* Cryptography, reliability and security, and database theory;
* Computational biology and bioinformatics ;
* Computational algebra, geometry, and number theory;
* Graph drawing and information visualization;
* Graph theory, communication networks, and optimization;
* Parallel and distributed computing;
* Experimental analysis of algorithms


Submitted manuscripts must be no longer than 10 pages long (including
figures, references, and appendices) and be formatted in standard LNCS
format (for LNCS templates, please refer to
http://www.springer.com/lncs).

The proceedings of the conference will be published by Springer-Verlag
in the Lecture Notes in Computer Science. High quality papers will be
invited to a special issue in Algorithmica and Journal of
Combinatorial Optimization.

Best Regards,

My T. Thai and Sartaj Sahni
TPC co-chairs

CISE Department
University of Florida
http://www.cise.ufl.edu/cocoon2010
**********************************************************
*
* 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] 4th International Conference on Information Security and Cryptology, Ankara, Turkey, May 6-7, 2010

===============================
CALL FOR PAPERS

ISCTURKEY 2010

The 4th International Conference on
Information Security and Cryptology
(ISC'10)

Ankara, Turkey, May 6-7, 2010

http://www.iscturkey.org

===============================
Dear Colleague,

The 4th International Conference on Information Security and Cryptology
(ISC'10) organized by the Information Security Association, Information
Technologies and Communications Authority (BTK), Gazi University and
Middle East Technical University (METU) to be held in Ankara in Turkey on
May, 06-07 2010. The conference focuses on a different topic each year and
this year's topic is 'Data Privacy'.

A. The last date for submission of full papers is April 1, 2010. Accepted
contributions will appear in the conference proceedings.

B. ISC'10 will feature the following invited talks:

1. Berry Schoenmakers (http://www.win.tue.nl/~berry/)

'Secure Multiparty Computation: A Showcase for Modern Cryptography'

2. Jianying Zhou (http://icsd.i2r.a-star.edu.sg/staff/jianying/)

'Non-repudiation Protocols and Applications'

We kindly invite you to participate in the conference (with or without a
paper) to share your knowledge with others.

For more information about the ISC'10 please visit our website at
http://www.iscturkey.org

Yours sincerely,

On behalf of the Organizing Committee

Prof. Dr. Ersan Akyildiz
ersan@metu.edu.tr

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

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

Sunday, February 14, 2010

[DMANET] Workshop on Mathematical Foundations of Constraint Programming (MFCP'10)

Call for Papers

International Workshop on Mathematical Foundations of Constraint Programming
(MFCP 2010)

http://zivny.cz/mfcp10/

28 August 2010, Brno, Czech republic.

The workshop will be co-located with Joint MFCS & CSL 2010 (35th International
Symposiums on Mathematical Foundations of Computer Science & 19th EACSL Annual
Conferences on Computer Science Logic) , 23-27 August 2010, Brno, Czech
republic.

The aim of the workshop is to bring together researchers with a common interest
in constraint programming and constraint satisfaction problems.

Submissions of interesting theoretical and mathematical results related to
constraints are encouraged. Topics include (but are not limited to):

* Theoretical relationships between classes of CSPs and other problems.
* Complexity and expressivity of different constraint representations.
* Complexity and expressivity in the context of propagation.
* Relational structures and CSPs.
* Soft and valued constraints.
* Tractability of CSPs.
* Max-CSP, #CSP.

Survey talks, preliminary results, developments of published results, and work
in progress are welcome. Prospective speakers are invited to submit a 1-2 pages
abstract which provides sufficient detail to allow the program committee to
assess the merits of the proposal.

Organising Committee:

Standa Zivny, University of Oxford, UK

Programme Committee:

Hubie Chen, Universitat Pompeu Fabra, Spain
Dave Cohen, Royal Holloway, University of London, UK
Martin Cooper, IRIT, University of Toulouse, France
Georg Gottlob, University of Oxford, UK
Peter Jeavons, University of Oxford, UK
Chris Jefferson, University of St Andrews, UK
Peter Jonsson, Linkoping University, Sweden
Kristen Brent Venable, University of Padova, Italy
Nic Wilson, University College Cork, Ireland

Dates:

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

Friday, February 12, 2010

[DMANET] Postdoc in Combinatorics & Optimization at the University of Waterloo

The Combinatorics & Optimization Department at the University of
Waterloo is seeking candidates for one-year postdoctoral
fellowship(s), renewable to a second year. Candidates with research
focus in all areas related to Combinatorial Optimization are
encouraged to apply; emphasis will be given to candidates in the
following areas:

- Algorithms
- Algorithmic Game Theory
- Discrete Optimization
- Graph Theory/Matroid Theory
- Integer Programming

The salary for these positions will be competitive with comparable
positions at other North American universities. Candidates will be
given the opportunity to teach within UW's Math undergraduate
program if they wish.

A PhD in mathematics, computer science, operations research or a
related field is required.

Each applicant must submit an application package containing a
curriculum vitae, a short statement of research interests and goals,
as well as a list of three or more individuals who will provide
letters of recommendation. Application materials and letters of
recommendation must be sent to
combopt@math.uwaterloo.ca. Alternatively, application materials can
also be sent to the following address:

PDF Search Committee
Department of Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario, Canada N2L 3G1

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

Thursday, February 11, 2010

[DMANET] Postdoctoral and senior researcher positions in computing research, Helsinki

Helsinki Institute for Information Technology HIIT and the Aalto
University Department of Information and Computer Science are inviting
applications for postdoctoral and senior researcher positions in
several areas of computing research including: machine learning and
data analysis; computational methods for networks, interaction and
economics; large constraint models; nanoscale self-assembly;
enhancement of internet infrastructure; human-centric ubiquitous IT.

The closing date for applications is 15 March 2010. The positions will
be filled for three years maximum starting at the earliest 1 August 2010.

Further details of the posts and the application procedure are available at:
http://www.hiit.fi/jobs (3 positions)
http://ics.tkk.fi/en/vacancies/ (4 positions)

---

Aalto University is a newly created research university resulting from
the merger of three Finnish universities: Helsinki University of
Tehnology TKK, the Helsinki School of Economics, and the University of
Art and Design Helsinki. The new university was launched in January
2010, and opens up a new world of possibilities for multidisciplinary
education and research. For further information, see www.aalto.fi/en/.

HIIT is a joint research institute of Aalto University and the
University of Helsinki conducting basic and strategic research on
information technology.
**********************************************************
*
* 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] Job opportunities at Linkoeping University

The Department of Computer Science at
Linkoeping University announces 1-3 postdoc
positions. Subject areas include:

- Autonomous systems and artificial intelligence (Prof. P. Doherty)
- Computer networks and security (Prof. N. Shahmehri)
- Dependable systems and networks (Prof. S. Nadjm-Tehrani)
- Software engineering (Prof. P. Fritzson)
- Theoretical computer science (Prof. P. Jonsson)

Closing date is 2010-03-31. Further details are available here:

http://www.liu.se/en/job/show.html?3218


**********************************************************
*
* 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] CFP: Workshop Proposals at IEEE MASS 2010

7th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
IEEE MASS 2010
https://mass2010.soe.ucsc.edu/
San Francisco, California, November 2010
-------------------------------------------------------------------------------------------------------
**** Workshop Proposals Deadline: March 31, 2010 ****

Sponsored by
IEEE and IEEE Computer Society
Co-sponsored by the IEEE TCCC and the IEEE TCPP
-------------------------------------------------------------------------------------------------------
IEEE MASS 2010 will be the seventh annual conference on the rapidly
expanding area of multi-hop wireless computing and sensor networking,
and will provide an exciting platform for discussing research vision of
a digitally networked wireless environment.

The MASS Organizing Committee invites proposals for one-day workshops
affiliated with the conference. The workshops will be held prior to, or
after, the main conference.

The purpose of these workshops is to provide a platform for presenting
novel ideas and more specific research areas in a less formal and
possibly more focused way than at the conference itself. Please visit
http://www.cs.cityu.edu.hk/mass09/workshops.shtml to view information on
workshops held last year at MASS 2009.

Workshops Proposals are solicited in all areas and topics pertaining to
ad-hoc wireless and sensor networking research and applications.

All papers included in the MASS 2010 workshops will appear in the MASS
2010 Proceedings published by IEEE. We expect all selected workshops to
adhere to a common paper submission and reviewing schedule outlined below:

Workshop proposals deadline: March 31, 2010
Proposals notification: April 9, 2010
Manuscripts due: June 18, 2010
Acceptance notification: August 13, 2010
Camera-ready submission: September 3, 2010

------------------------------------------------
Proposal Submission Guidelines:
------------------------------------------------
Each workshop proposal must include:

1. The name of the workshop
2. The names, addresses, and a short bio (up to 200 words) of the
organizers (maximum up to three)
3. A brief description (up to 1 page) of the technical issues that the
workshop will address, and the reasons why the workshop is of interest
this time
4. The names of potential participants, such as program committee members
5. Planned format of the workshop, such as number of refereed papers,
keynotes, panels etc.
6. If appropriate, a description of past versions of the workshop,
including: number of submitted and accepted papers, number of attendees
7. A description of the publicity plan
8. A call for papers
9. The workshop website address

Workshop proposals should be submitted, no later than March 31, 2010 by
e-mail (in PDF format) with "MASS 2010 Workshop Proposal" in the
subject, to BOTH MASS 2010 Workshop Co-chairs:

Christine Pépin,
DoCoMo Labs USA
pepin@docomolabs-usa.com

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

[DMANET] Postdoc positions at the Univ. of Vienna

Universitaet Wien - Fakultaet fuer Mathematik

Applications are invited for several positions for

Postdocs

in the Combinatorics Group at the Faculty of Mathematics of the
University of Vienna.
http://www.mat.univie.ac.at/~kratt/comb.html

The positions will be for a period of up to three years.
Normally, salaries will follow the salary scheme of the funding agency FWF.
http://www.fwf.ac.at/de/projects/personalkostensaetze.html

The positions will be filled starting September 2010 (but other starting dates
are possible as well).

Applications received by March 31, 2010 will receive full consideration.

Informal inquiries may be addressed to Christian Krattenthaler
(email: <first name>.<last name> at univie.ac.at).

Candidates should send applications with CV and list of publications,
together with the names and addresses of 2 references, to

JULIA CHENG
e-mail: hui-chun.<first name>.<last name> at univie.ac.at
Fakult\"at f\"ur Mathematik
Universit\"at Wien
Nordbergstra{\ss}e 15
A-1090 Vienna
AUSTRIA

**********************************************************
*
* 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 positions at the Univ. of Vienna

Universitaet Wien - Fakultaet fuer Mathematik

Applications are invited for several positions for

PhD students

in the Combinatorics Group at the Faculty of Mathematics of the
University of Vienna.
http://www.mat.univie.ac.at/~kratt/comb.html

The positions will be for a period of up to three years.
Salaries will follow the salary scheme of the funding agency FWF.
http://www.fwf.ac.at/de/projects/personalkostensaetze.html

The positions will be filled starting September 2010 (but other starting dates
are possible as well).

Applications received by March 15, 2010 will receive full consideration.

Informal inquiries may be addressed to Christian Krattenthaler
(email: <first name>.<last name> at univie.ac.at).

Candidates are advised to consult the website
http://www.mat.univie.ac.at/algebra/doctorate/
http://www.mat.univie.ac.at/algebra/doctorate/application.shtml

A full application includes:

* Curriculum vitae
* University diplomas
* A record of academic education
* A Statement of Purpose, indicating your mathematical interests
* At least one letter of recommendation

and should be sent to

Doctoral Program ALGEBRA
c/o Julia Cheng
Fakult\"at f\"ur Mathematik
Universit\"at Wien
Nordbergstra{\ss}e 15
A-1090 Vienna
AUSTRIA


**********************************************************
*
* 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] ESA 2010 Call for Papers

18th European Symposium on Algorithms (ESA 2010) - Call for Papers


The European Symposium on Algorithms (ESA) is one of the premier conferences on
algorithms. The symposium covers research in all aspects of the design,
analysis, and application of algorithms and data structures. ESA 2010 has two
tracks: the Design and Analysis Track focuses on the theoretical aspects, while
the Engineering and Applications Track focuses on experimental aspects and
applications. ESA 2010 is sponsored by the European Association for Theoretical
Computer Science (EATCS) and organized as part of ALGO 2010.


Topics

Papers presenting original research in all areas of algorithmic research are
sought, including but not limited to:

- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Combinatorial optimization
- Computational biology
- Computational finance
- Distributed algorithms
- Computational geometry
- Data compression
- Data structures
- Databases and information retrieval
- Graph algorithms
- Hierarchical memories
- Machine learning
- Mathematical programming
- Mobile computing
- On-line algorithms
- Parallel algorithms
- Parametrized complexity
- Pattern matching
- Quantum computing
- Randomized algorithms
- Streaming algorithms


Submission guidelines

Authors are invited to submit an extended abstract or full paper of at most 12
pages and an optional appendix.

Papers must be formatted in LaTeX, using the LNCS style file
(availablethrough the conference website).

The maximum length of the paper (including references, but excluding the optional
appendix) is 12 pages.

Proofs omitted due to space constraints must be placed in an appendix
to be read by the program committee members at their discretion.

These guidelines are strict: papers failing to adhere to the guidelines (by
not being in LNCS format, being more than 12 pages, or not providing the omitted
proofs in an appendix) will be rejected without consideration of their merits.

Papers should be submitted electronically via the EasyChair submission system,
accessible via the conference website. Simultaneous submission to other
conferences with published proceedings, or to both tracks of ESA 2010, is not
permitted.There will be a Best Student Paper Award, as well as a Best Paper
Award. The ESA proceedings will be published in the Lecture Notes in Computer
Science series by Springer-Verlag.


Important dates
- Submission deadline: Monday, April 12, 2010
- Notification: Friday, June 4, 2010
- Final version due: Monday, June 28, 2010
- Symposium: September 6-8, 2010 (Liverpool, UK)


More information
ESA 2010 will be co-located with WABI (10th Workshop on Algorithms in
Bioinformatics, September 6-8), ATMOS (10th Workshop on Algorithmic Approaches
for Transportation Modelling, Optimization, and Systems, September 9), and WAOA
(8th Workshop on Approximation and Online Algorithms, September 9-10).

Conference website: http://algo2010.csc.liv.ac.uk/
**********************************************************
*
* 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] CFP (3): 6th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010)

Second call for papers


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

36th International Workshop on
Graph-Theoretic Concepts in Computer Science
(WG 2010)

Zaros, Crete, Greece
June 28-30, 2010

http://www.math.uoa.gr/wg2010/

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


The WG 2010 conference will be held in Zaros, Creta, Greece. It
continues a long series of 35 previous WG's. Since 1975, it took
place twenty times in Germany, four times in the Netherlands,
twice in Austria, twice in France as well as once in Italy,
Slovakia, Switzerland, Czech Republic, Norway, and in
the United Kingdom.


AIMS AND SCOPE

WG 2010 aims at uniting theory and practice by demonstrating how
Graph-Theoretic concepts can be applied to various areas in
Computer Science, or by extracting new problems from applications.
The goal is to present recent research results and to identify
and explore directions of future research. The conference is
well-balanced with respect to established researchers and young
scientists. For many years now, the proceedings have been
published in the LNCS series of Springer-Verlag. We need the
final version of accepted papers approximately two months after
the conference.

Papers are solicited describing original results on all aspects
of graph-theoretic concepts in Computer Science, e.g. structural
graph theory, sequential, parallel, randomised, parameterized,
and distributed graph and network algorithms and their
complexity, graph grammars and graph rewriting systems, graph-
based modelling, graph-drawing and layout, random graphs, diagram
methods, and support of these concepts by suitable
implementations. The scope of WG includes all applications of
graph-theoretic concepts in Computer Science, including data
structures, data bases, programming languages, computational
geometry, tools for software construction, communications,
computing on the web, models of the web and scale-free networks,
mobile computing, concurrency, computer architectures, VLSI,
artificial intelligence, graphics, CAD, operations research, and
pattern recognition.


SUBMISSION

Authors are invited to submit an extended abstract written in
English, no longer than 10 pages on letter-size or A4-size paper
using at least 11-point font (and preferably LaTeX article style
11pt a4paper). Proofs omitted due to space constraints must be
put into an appendix to be read by the program committee members
at their discretion. Simultaneous submission to other conferences
with published proceedings or to journals is not allowed.

Authors who wish to submit an extended abstract to WG 2010 must
submit a PDF file with their paper by using the electronic
submission system at:
https://www.easychair.org/login.cgi?conf=wg2010


IMPORTANT DATES

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

Paper submission deadline: March 5, 2010
Notification of acceptance: April 30, 2010
Workshop: June 28-30, 2010

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


PROGRAM COMMITTEE

Fedor V. Fomin, University of Bergen, Norway
Pierre Fraigniaud, CNRS and University Paris Diderot, France
Gregory Z. Gutin, Royal Holloway, University of London, UK
Frederic Havet, INRIA Sophia-Antipolis, France
Giuseppe F. Italiano, University of Rome Tor Vergata, Italy
Kazuo Iwama, Kyoto University, Japan
Jan Kratochvil, Charles University, Czech Republic
Jan van Leeuwen, Utrecht University, The Netherlands
Bojan Mohar, Simon Fraser University, Canada
David Peleg, Weizmann Institute of Science, Israel
Prabhakar Ragde, University of Waterloo, Canada
Dieter Rautenbach, Ilmenau University of Technology, Germany
Saket Saurabh, Institute of Mathematical Sciences, India
Ingo Schiermeyer, Freiberg University of Mining & Technology, Germany
Maria Serna, Technical University of Catalonia, Spain
Martin Skutella, Technical University of Berlin, Germany
Dimitrios M. Thilikos (Chair), National & Kapodistrian
Univ. of Athens, Greece
Peter Widmayer, Federal Institute of Technology Zurich, Switzerland
Gerhard J. Woeginger, Eindhoven University of Technology,
The Netherlands


INVITED SPEAKERS

* Dimitris Achlioptas (Department of Computer Science UC Santa Cruz)
* Erik Demaine (MIT Computer Science and Artificial Intelligence
Laboratory)


ORGANIZATION

* Anogia Academic Village
* Department of Mathematics of the National and Kapodistrian University
of Athens
**********************************************************
*
* 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/
*
**********************************************************

Wednesday, February 10, 2010

[DMANET] CFP: APPROX/RANDOM 2010

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


APPROX 2010 and RANDOM 2010

13th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2010
14th Intl. Workshop on Randomization and Computation - RANDOM 2010

http://cui.unige.ch/tcs/random-approx/

1-3 September 2010

UPC Barcelona, Spain

Call for papers

SCOPE

13th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2010
14th Intl. Workshop on Randomization and Computation - RANDOM 2010
1-3 September 2010 UPC Barcelona, Spain
The 13th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2010),
and the 14th. International Workshop on Randomized Techniques in
Computation (RANDOM'2010) will be held in
UPC Barcelona, Spain, on 1-3 September, 2010.
APPROX'2010 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate
solutions to computationally difficult problems, while RANDOM'2010 focuses
on applications of randomness to computational
and combinatorial problems. RANDOM'2010 is the fourteenth workshop in the
series; APPROX'2010 is the thirteenth in the series.

TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:
APPROX
- design and analysis of approximation algorithms
- hardness of approximation
- small space, sub-linear time, and streaming algorithms
- embeddings and metric space methods
- mathematical programming methods
- combinatorial problems in graphs and networks
- game theory, markets, and economic applications
- geometric problems
- packing, covering, and scheduling
- approximate learning
- other applications
RANDOM
- design and analysis of randomized algorithms
- randomized complexity theory
- pseudorandomness and derandomization
- random combinatorial structures
- random walks/Markov chains
- expander graphs and randomness extractors
- probabilistic proof systems
- random projections and embeddings
- error-correcting codes
- average-case analysis
- property testing
- computational learning theory

SUBMISSIONS

Abstract Format: Electronic submissions are solicited. Please consult the
following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx10
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random10
Note: You will be asked to login using an EasyChair account.
Directions on how to register for such an account are available at the
submission servers (you may also have an old account from a previous
conference submission).

The postscript must be received by 17:00pm (PDT) of April 18 for your
submission to be considered.

Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract should start with the title of the paper,
each author's name, affiliation, and e-mail address, followed by a
one-paragraph summary of the results to be presented. This should then
be followed by a technical exposition of the main ideas and techniques
used to achieve these results including motivation and a clear comparison
with related work. The abstract should not exceed 10 single-spaced pages
on letter-size paper, using reasonable margins and at least 11-point font
(not including the references). If the authors believe that more details
are essential to substantiate the main claims of the paper, they may
include a clearly marked appendix that will be read at the discretion
of the program committee.

Simultaneous submission

Simultaneous submission to other conferences with published proceedings is
not allowed.

PROCEEDINGS

Proceedings will be published in the Springer-Verlag series Lecture Notes
in Computer Science.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624, 4110 and 4627
while previous proceedings of RANDOM appeared as LNCS 1269, 1518, 1671,
2129, 2483, 2764, 3122, 3624, 4110, 4627
and as Proceedings in Informatics 8.

IMPORTANT DATES

Submissions: April 18
Notifications: June 12

Camera ready: June 23
Conference: September 1-3

PROGRAM COMMITTEES

Approx

Chandra Chekuri, University of Illinois, Urbana-Champaign.
Uriel Feige, The Weizmann Institute.
Pierre Fraigniaud, CNRS and University Paris Diderot.
Magnús M. Halldórsson, Reykjavik University.
Christos Kaklamanis, Patras University.
Anna Karlin, University of Washington.
Samir Khuller, University of Maryland.
Guy Kortsarz, Rutgers at Camden.
Monaldo Mastrolilli, IDSIA Lugano.
Claire Mathieu, Brown University.
Zeev Nutov, The Open University of Israel.
Giuseppe Persiano, University of Salerno.
Maria Serna, UPC Barcelona (chair).
Martin Skutella, TU Berlin.
Maxim Sviridenko, IBM T.J. Watson Research Center.
David P. Williamson, Cornell University.


Random

Dimitris Achlioptas, UC Santa Cruz and University of Athens.
Alexandr Andoni, Princeton University.
Anna Gal, University of Texas at Austin.
Valentine Kabanets, Institute for Advanced Study and Simon Fraser
University.
Swastik Kopparty, MIT.
Michael Krivelevich, Tel-Aviv University.
Sofya Raskhodnikova, Pennsylvania State University.
Ran Raz, Weizmann Institute.
Atri Rudra, University at Buffalo, State University of New York.
Rocco Servedio, Columbia University.
Ronen Shaltiel, University of Haifa (chair).
Angelika Steger, ETH Zurich.
Christopher Umans, California Institute of Technology.
Eric Vigoda, Georgia Tech.
Sergey Yekhanin, Microsoft Research Silicon Valley.


PROGRAM CHAIRS

APPROX

Maria Serna,
Universitat Politècnica de Catalunya
email: mjserna@lsi.upc.edu

RANDOM

Ronen Shaltiel,
University of Haifa
email: ronen@cs.haifa.ac.il

Workshop Chairs

Klaus Jansen,
U. of Kiel
e-mail: kj@informatik.uni-kiel.de
José Rolim,
U. of Geneva
e-mail: Jose.Rolim@unige.ch

Local Chairs

Maria Blesa,
Universitat Politècnica de Catalunya
mjblesa@lsi.upc.edu
Maria Serna,
Universitat Politècnica de Catalunya
mjserna@lsi.upc.edu

CONFERENCE WEB PAGE

http://cui.unige.ch/tcs/random-approx/

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

FOCS Call for Papers

CALL FOR PAPERS 

51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010)

Las Vegas, Nevada, October 23-26, 2010.


The 51st Annual Symposium on Foundations of Computer Science (FOCS2010), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held at the Monte Carlo Hotel in Las Vegas, Nevada, October 24-26, 2010. A series of tutorial presentations will be given on October 23. Papers presenting new and original research on the theory of computation are sought, including papers that broaden the reach of computer science theory, or raise important problems that can benefit from theoretical investigation and analysis.

Important Dates:

  • Submission deadline: April 7, 2010, 7pm PST.
  • Notification: June 29, 2010
  • Final version of accepted papers due: August 7, 2010

Submission format:

Authors should submit an extended abstract, which should contain a scholarly exposition of ideas, techniques, and results, including motivation and a clear comparison with related work. Authors are expected to include all the ideas necessary for an expert to verify the central claims in the paper.There is no bound on the length of a submission, but a submission must contain within its first 10 pages a clear presentation of the merits of the paper, including (i) what the paper's main contributions are, (ii) why these contributions are of interest, and (iii) how the new contributions relate to prior work. Material other than the abstract, references and the first 10 pages may be considered as supplementary and will be read at the committee's discretion.
The extended abstract should be typeset using 11-point or larger fonts, in a single-column format with ample spacing and 1-inch margins all around.
All submissions will be treated as confidential, and will only be disclosed to the committee and their chosen sub-referees.
While there is no page limit for the submissions, there will be a page limit for the proceedings version. Authors are strongly encouraged to post a full version of their accepted papers on a freely accessible forum such as, for example, the arxiv, theECCC, or the Cryptology ePrint archive.

Submission instructions:

Papers must be submitted electronically. See theory.stanford.edu/focs2010/submit for electronic submission instructions.

Simultaneous submission:

Abstract material that has been previously published in another conference proceedings or journal, or which is scheduled for publication prior to December 2010, will not be considered for acceptance at FOCS 2010. Simultaneous submission of the same (or essentially the same) abstract to FOCS 2010 and to another conference with published proceedings is not allowed.

Awards

The Machtey award will be given to the best paper or papers written solely by one or more students. An abstract is eligible if all authors are full-time students at the time of submission. This should be indicated at the time of submission. All submissions are eligible for the Best Paper award. The committee may decide to split the awards between multiple papers, or to decline to make an award.

Program Committee

Scott Aaronson, Massachusetts Institute of Technology
Dorit Aharonov, Hebrew University
Eli Ben-Sasson, Technion
Julia Chuzhoy, Toyota Technological Institute at Chicago
Ryan O'Donnell, Carnegie Mellon University
Roberto Grossi, University of Pisa
Nick Harvey, University of Waterloo
Adam Kalai, Microsoft Research
Nicole Immorlica, Northwestern University
Yuval Ishai, Technion and University of California, Los Angeles
Lap Chi Lau, The Chinese University of Hong Kong
James Lee, University of Washington
Tal Malkin, Columbia University
Joe Mitchell, Stony Brook University
Dana Moshkovitz, Institute for Advanced Study
S. Muthukrishnan, Rutgers University
Christos Papadimitriou, University of California, Berkeley
Sofya Raskhodnikova, Penn State University
Steve Skiena, Stony Brook University
Mikkel Thorup, ATT Research
Luca Trevisan (chair), Stanford University and University of California, Berkeley
Eric Vigoda, Georgia Institute of Technology

[DMANET] EURO Summer Institute ESI 2010 - Call for Participation

Call for Participation

EURO Summer Institute ESI 2010:
NONLINEAR METHODS IN COMBINATORIAL OPTIMIZATION

Alpen-Adria-Universitaet Klagenfurt, Austria
August 20 - September 4, 2010
http://esi2010.uni-klu.ac.at


The ESI combines tutorial lectures given by invited speakers with student
contributions and scientific discussions in small groups. It offers a unique
opportunity for young scientists to acquaint themselves with state of the art
methods in combinatorial optimization, to make some first contacts in the
scientific community, and to share their experience with young colleagues from
all over the world.

Invited Speakers:
Miguel Anjos (University of Waterloo, Canada)
Etienne de Klerk (Tilburg University, The Netherlands)
Christoph Helmberg (Technische Universitaet Chemnitz, Germany)
Florian Jarre (Universitaet Duesseldorf, Germany)
Veronica Piccialli (Universite� degli Studi di Roma Tor Vergata, Italy)

Deadline for application to the national OR Societies is March 15, 2010.

For further information visit http://esi2010.uni-klu.ac.at

[DMANET] CFP: IEEE Communications Magazine SI on Green Communications

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++


CALL FOR PAPERS (CFP)

IEEE Communications Magazine Feature Topic Issue on "Green Communications"

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

The unprecedented expansion of wireline and wireless networks has resulted
in increase in energy consumption and left a significant environmental
footprint. Recently, it has been reported that energy costs can account for
as much as half of a mobile service provider's annual operating expenses.
If the aggregate energy consumption of networking devices would follow the
growth trajectories of Internet traffic (i.e., about 60% per year), the
environmental and financial consequences will be dire. Thus, making ICT
equipment and applications "greener" can not only have a tangible positive
impact on environment, but also help operators attain long-term
profitability. Moreover, green communications can help the world reduce
dependence on fossil fuel, enable demand response and distributed energy
resources, and ultimately achieve sustainable prosperity. Accordingly, a
myriad of communications and information technologies have already been
exploited by the global smart grid initiatives to empower conventional power
grid to support two-way energy and information flow.

To meet the green communications challenges, we have to resort to a plethora
of paradigm-shifting technologies, including but not limiting to
energy-efficient network architecture & protocols, energy-efficient wireless
transmission techniques, energy-efficient home networking, energy-aware
backbone networks, Smart Grid, and opportunistic spectrum sharing without
causing harmful interference pollution (e.g., Green Spectrum).

This IEEE Communications Magazine special issue (feature topic issue) aims
to provide a comprehensive overview of the state-of-the-art in technology,
regulation and standardization for "Green Communications", and present a
holistic view of research challenges and opportunities in the coming green
era. Suggested topics include but not limit to the following:

. Energy-efficient circuit and device

. Energy-efficient transmission switching and routing technologies

. Energy-efficient base station architectures and networking

. Energy-efficiency in wired and wireless access networks

. Energy-efficiency in home and enterprise networking

. Energy efficiency of data centers and intelligent cloud computing

. Protocols and protocol extensions to enable energy efficient
networks

. Network-wide cross-layer optimizations to minimize energy
consumption

. Network load balance and smart information storage in distributed
networks

. Instrumentation for energy consumption measurement

. Remote power management for wireless terminals and access networks


. Hierarchical and distributed techniques for energy management

. Harvesting distributed energy generation

. Smart Grid

. Information theory on energy efficiency

. Cognitive, cooperative and reconfigurable networks

. Energy evaluation and comparison of different network technologies

. Novel network concepts and architectures lowering the overall
footprint of ICT (e.g., Compressed Sensing for network monitoring)

. Realistic estimation of the worldwide footprint of communications
and future evolution

. Assessment of the footprint of individual communication devices,
including life cycle assessment

. Regulation and standardization

. Deployment, trial experience, business models and applications
(e.g., green multimedia broadcasting, femtocells)

Articles should be tutorial in nature and should be written in a style
comprehensible to readers outside the specialty of the field. Authors must
follow the IEEE Communications Magazine's guidelines for preparation of the
manuscript. Complete guidelines for prospective authors can be found at
www.comsoc.org/pubs/commag/sub_guidelines.html
<http://www.comsoc.org/livepubs/ci1/info/sub_guidelines.html> . Please send
PDF (preferred) or MS WORD formatted paper to Manuscript Central
(http://commag-ieee.manuscriptcentral.com), resister or log in, go to the
Author Center and follow the instructions there.

Manuscript Submission Due: April 1, 2010

Acceptance Notification: July 1, 2010

Final Manuscript Due: August 15, 2010

Publication: November 2010

Guest Editors:


Honggang Zhang ( <mailto:honggangzhang@zju.edu.cn> honggangzhang@zju.edu.cn)

Zhejiang University, China

Andreas Gladisch (andreas.gladisch@telekom.de)

Deutsche Telekom Laboratories, Germany

Mario Pickavet (mario.pickavet@intec.ugent.be)

University of Ghent - IBBT, Belgium

Zhifeng Tao (tao@merl.com)

Mitsubishi Electric Research Lab (MERL), USA

Werner Mohr (werner.mohr@nsn.com)

Nokia Siemens Networks, Germany
**********************************************************
*
* 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/
*
**********************************************************

Tuesday, February 9, 2010

[DMANET] Mixed Integer Programming 2010, call for posters and participation

*** CALL FOR POSTER PRESENTATIONS, CALL FOR PARTICIPATION ***

Date: July 26-29, 2010
Location: Georgia Institute of Technology, Atlanta, Georgia, USA
Registration: http://www2.isye.gatech.edu/mip2010/
Poster submission deadline: March 31, 2010

You are cordially invited to participate in the upcoming workshop in
Mixed Integer Programming (MIP 2010).

The 2010 Mixed Integer Programming workshop will be the seventh in a
series of annual workshops held in North America designed to bring the
integer programming community together to discuss very recent
developments in the field. The workshop series consists of a single
track of invited talks.

Confirmed speakers:

Karen Aardal, Tobias Achterberg, Egon Balas,
Pierre Bonami, Michele Conforti, Sanjeeb Dash,
Daniel Espinoza, Matteo Fischetti, Antonio Frangioni,
Zonghao Gu, Ellis Johnson, Simge Kucukyavuz,
Jon Lee, Quentin Louveaux, Jim Luedtke,
Andrew Miller, Michele Monaci, James Ostrowski,
Marc Pfetsch, Jean-Philippe Richard, Martin Savelsbergh,
Stefano Smriglio, Andrea Tramontani, Santosh Vempala,
Juan-Pablo Vielma, Giacomo Zambelli

We encourage anyone with interests in mixed integer programming to
participate. Space is limited, and thus early registration is
recommended.

In addition to the invited talks, there will be a contributed poster
session for which we invite all participants to submit an abstract. To
submit an abstract for the poster session, please register for the
conference at the above web page, then email a 1-or-2-page .pdf file
containing your abstract to mip2010@isye.gatech.edu by March 31. Space
for posters is limited, and we may not be able to accommodate all
posters; we expect to send out notifications by April 30.

There will be ample time for discussion and interaction between the
participants during the workshop, as one of its aims is to facilitate
research collaboration.

Thanks to the generous support by our sponsors, registration is free,
and travel support is available. Students and postdocs who wish to
apply for travel support are strongly encouraged to submit a poster
abstract no later than March 31, as funding priority will be given to
students and postdocs who have submitted poster abstracts. We expect
to make funding decisions by April 30.

Our apologies if you happen to receive multiple copies of this announcement.

Sincerely,

Shabbir Ahmed (Georgia Institute of Technology)
Ismael Regis de Farias Jr. (Texas Tech University)
Ricardo Fukasawa (University of Waterloo)
Matthias Koeppe (University of California, Davis)
Andrea Lodi (University of Bologna)

(MIP 2010 Organizing Committee, mip2010@isye.gatech.edu)

--
Matthias Koeppe -- http://www.math.ucdavis.edu/~mkoeppe
**********************************************************
*
* 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/
*
**********************************************************

Portland State faculty position

The Computer Science Department at Portland State University invites
applications for a junior tenure-track faculty position to begin Fall
2010.  Specific areas of computer science under consideration include:
artificial intelligence and machine learning; multi-core architectures
and parallel programming; visualization and graphics; security and
cryptography.  Exceptional applicants in other areas or at other ranks
will also be considered.

The department currently has twenty-five tenure-track faculty,
including four NSF CAREER Award winners and two ACM Fellows.  The
department offers an ABET accredited B.S., an M.S., and a Ph.D. in
Computer Science.  Our teaching loads give faculty time to maintain
funded research programs and to collaborate with local industry.  The
department currently serves approximately 400 undergraduates and 120
graduate students.  Further information about the department is
available at http://www.cs.pdx.edu.

Portland State University is located in downtown Portland, Oregon.
Portland's "Silicon Forest" is one of the major software/hardware
development centers in the country.  The Portland metropolitan area
has over 200 hardware and software organizations, including Intel, the
Open Source Development Lab, Tektronix, InFocus, Mentor Graphics, IBM
and many software start-ups.  The University is approximately one hour
from magnificent beaches and year-round outdoor activities.  Portland
has been ranked highly for quality of life, including the #1 greenest
city, the #1 cleanest city, and the #1 cycling city.  Applicants are
expected to hold or be near completion of a Ph.D. degree in Computer
Science or a closely related field.  All applicants are expected to
show great potential for future external research support and a
demonstrated record of research excellence.

The faculty member will maintain scholarly activity in funded research
and publications; teach undergraduate and graduate classes; provide
professionally related public service; advise students, and support
University activities through committee service.

For more information and application procedure, please visit
http://cs.pdx.edu.  For inquiries about this position, please contact
cssearch@cs.pdx.edu.  Review of applications will begin immediately
and will continue until finalists are identified.

Portland State University is an Affirmative Action, Equal Opportunity
Institution and welcomes applications from diverse candidates and
candidates who support diversity.


[DMANET] CFP Extended Deadline of IEEE CIT-10, ICESS-10, ScalCom-10 and Journal Special Issues

=== Extended Paper Submission Deadline: Friday, 05 March 2010 ===

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

CALL FOR PAPERS

The 10th IEEE International Conference on Computer and Information
Technology (CIT-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/CIT2010/

The 10th IEEE International Conference on Scalable Computing and
Communications (ScalCom-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/ScalCom2010/

The 7th IEEE International Conference on Embedded Software and Systems
(ICESS-10), Bradford, UK, 29 June - 1 July, 2010

http://www.scim.brad.ac.uk/~ylwu/ICESS2010/

Sponsored by
IEEE, IEEE Computer Society and IEEE Technical Committee of Scalable
Computing (TCSC)

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

Distinguished selected papers from the conferences, after further
extensions, will be published in special issues of the following prestigious
Journals indexed by SCI:

. Journal of Supercomputing - Springer
. Journal of Computer and System Sciences - Elsevier
. Concurrency and Computation: Practice and Experience - John Wiley &
Sons
. Telecommunication Systems - Springer
. Simulation Modelling Practice and Theory - Elsevier
. Future Generation Computer Systems - Elsevier
. The Computer Journal - The British Computer Society

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


**********************************************************
*
* 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] NMA'2010 CFP

Dear Colleague,
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "METAHEURISTICS FOR OPTIMIZATION
PROBLEMS" at the 7th Conference on Numerical Methods and Applications
NM&A'10,
to be held 20-24 August 2010 in Borovets, Bulgaria.
The session is organized by: Assoc. Prof. Stefka Fidanova
(stefka@parallel.bas.bg)
from the Institute for Parallel Processing, Bulgarian Academy of
Sciences and Assoc. Prof. Antonio Nebro (antonio@lcc.uma.es)
from University of Malaga, Spain.
Proceedings The refereed and presented papers will be published as a
special volume of Springer Lecture Notes in Computer Science (LNCS).

Important deadlines Deadline for submission of abstracts
February 15, 2010
Notification of acceptance of the talks on the basis of the submitted
abstract
March 1, 2010
Deadline for submission of full papers
April 30, 2010
Notification of acceptance of full papers
June 20, 2010
Submission of accommodation forms
July 15, 2010


Abstracts and contributed papers The abstracts (up to 1 page stating
clearly the originality of the results) are to be written in standard
LaTeX. The length of the contributed papers is limited up to 8 pages. It
is assumed that one participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session. After
sending the abstract go to the conference web page and fill in the
registration form (personal data of the participants, minimum one per
paper, and the name of the special session).

Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page http://www.math.bas.bg/~nummeth/nma10

Special session organizers
Assoc. Prof. S. Fidanova, Institute of Parallel Processing, Bulgarian
Academy of
Science, stefka@parallel.bas.bg
Assoc. Prof. A. Nebro, University of Malaga, Spain, e-mal:
antonio@lcc.uma.es

**********************************************************
*
* 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] Oxford Combinatorics Meeting

------------------------------------------
One-Day Meeting in Combinatorics at Oxford
------------------------------------------

A One-Day Meeting in Combinatorics will be held in Oxford on Wednesday 17
March 2010. The meeting will take place in the Mathematical Institute,
with talks starting at 11am and coffee available beforehand from 10.30am.

The speakers are:

Mark Jerrum (QMUL)
The ferromagnetic Potts model: phase transition,
gadgets and computational complexity

David Gamarnik (MIT)
A combinatorial approach to the interpolation method and scaling
limits in sparse random graphs

Benny Sudakov (UCLA)
Ramsey numbers of graphs and hypergraphs

Günter M. Ziegler (Berlin)
Some centrally-symmetric polytopes derived from perfect graphs

Adrian Bondy (Lyon)
Switching Reconstruction

Anyone interested is welcome to attend. Some funds may be available to
contribute to the expenses of research students who wish to attend the
meeting.

Further details can be obtained from Alex Scott (email:
scott@maths.ox.ac.uk) or from the web page, which can be found at
http://people.maths.ox.ac.uk/~scott/Pages/one-day_meeting.htm
**********************************************************
*
* 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] TAMC 2010 - Extended deadline

*** Following requests of prospective authors, the PC has decided to
extend the submission deadline by 5 days to February 15, 2010. ***

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
TAMC 2010 - 7th Annual Conference on Theory and Applications of Models
of Computation

June 7 - 11, 2010 Prague, Czech Republic

tamc2010@tamc2010.cz http://www.tamc2010.cz
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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.

PLENARY SPEAKERS:
John Hopcroft (Cornell University, USA)
ShangHua Teng (Boston University, USA)

SPECIAL SESSIONS:
Computational Geometry (organized by Jiri Matousek)
Proof Complexity (organized by Jan Krajicek)

IMPORTANT DATES:
Submission of papers: Extended to February 15, 2010
Notification of acceptance: March 20, 2010
Final version due: March 30, 2010
Early registration: April 10, 2010
Conference: June 7-11, 2010

SCOPE:
The three main themes of the conference continue to be Computability,
Complexity, and Algorithms. It aims to bring together researchers with
interests in theoretical computer science, algorithmic mathematics, and
applications to the physical sciences. Typical but not exclusive topics
of interest include:
- algorithmic graph theory and combinatorics,
- algorithmic algebra, number theory and coding theory,
- algorithms and data structures,
- automata and neural networks,
- computable mathematics,
- computational biology,
- computational complexity,
- computational game theory,
- computational geometry,
- continuous and real computation,
- cryptography,
- decidability and undecidability,
- generalized and higher type computation,
- learning theory,
- models of computation,
- natural computation,
- on-line algorithms,
- parallel algorithms,
- physical computability,
- proofs and computation,
- quantum computing,
- randomness,
- relative computability and degree structures,
- theoretical problems in networks and security,
- network information,
- network structures and algorithms,
- Turing definability.

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.

SPONSORS:
DIMATIA - Center for Discrete Mathematics and ITI - Institute for
Theoretical Computer Science, Charles University, Prague

Further details are available on the conference web site
http://www.tamc2010.cz.


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