DMANET: DISCRETE MATHEMATICS AND ALGORITHMS: October 2013

Thursday, October 31, 2013

dmanet Digest, Vol 68, Issue 28

Wednesday, October 30, 2013

dmanet Digest, Vol 68, Issue 27

Tuesday, October 29, 2013

dmanet Digest, Vol 68, Issue 26

Monday, October 28, 2013

dmanet Digest, Vol 68, Issue 25

dmanet Digest, Vol 68, Issue 24

Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de

To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de

You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de

When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."

Today's Topics:

1. Postdoc positions in TCS at KTH Royal Institute of Technology
(Jakob Nordstrom)
2. PhD position in TCS at KTH Royal Institute of Technology
(Jakob Nordstrom)
3. Call for Book Chapter Proposals: Simulation-Optimization
Approaches (Daniel Guimarans)
4. Evomusart 2014. Submission deadline extended to Nov 11
(Juan Romero)

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

Message: 1
Date: Sun, 27 Oct 2013 06:38:33 +0100
From: "Jakob Nordstrom" <jakobn@kth.se>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc positions in TCS at KTH Royal Institute of
Technology
Message-ID:
<3c0872ec240769a8936c91a0c5b1caf3.squirrel@webmail.csc.kth.se>
Content-Type: text/plain;charset=utf-8

The Theory Group at KTH Royal Institute of Technology invites applications
for two postdoctoral positions in Theoretical Computer Science.

KTH is the leading technical university in Sweden. The Theory Group at KTH
(http://www.csc.kth.se/tcs/) offers a strong research environment covering
a wide range of research topics such as complexity theory and
approximation algorithms, computer and network security, cryptography,
formal methods and natural language processing. The group has a consistent
track record of publishing in the leading theoretical computer science
conferences and journals worldwide, and the research conducted here has
attracted numerous international awards and grants in recent years. We are
now set to expand further, and these positions are just two of several new
openings.

The postdoctoral researchers will be working in the research group of
Jakob Nordstr?m (http://www.csc.kth.se/~jakobn). Much of the activities of
this group revolve around the themes of proof complexity and SAT solving.
However, these areas have also turned out to have deep, and sometimes
surprising, connections to other topics such as, e.g., circuit complexity,
communication complexity, and hardness of approximation, and therefore
researchers in these or other related areas are more than welcome to
apply.

The research project is financed by a Breakthrough Research Grant from the
Swedish Research Council and a Starting Independent Researcher Grant from
the European Research Council. In addition to the project leader, the
group currently consists of one postdoc and two PhD students. Travel
funding is included, and the group also receives short-term and long-term
visitors on a regular basis.

These are full-time employed positions for one year with a possible
one-year extension. The successful candidates are expected to start in
August-September 2014, although this is to some extent negotiable.

The application deadline is December 15, 2013. More information and
instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2013-0712-Eng.php . Informal
enquiries are welcome and may be sent to Jakob Nordstrom.

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

Message: 2
Date: Sun, 27 Oct 2013 07:57:34 +0100
From: "Jakob Nordstrom" <jakobn@kth.se>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD position in TCS at KTH Royal Institute of
Technology
Message-ID:
<a5aa0536fc916657ae1e4e9eb34db38a.squirrel@webmail.csc.kth.se>
Content-Type: text/plain;charset=utf-8

The Theory Group at KTH Royal Institute of Technology invites applications
for a PhD position in theoretical computer science.

KTH Royal Institute of Technology is the leading technical university in
Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a
strong research environment covering a wide range of research topics such
as complexity theory and approximation algorithms, computer and network
security, cryptography, formal methods and natural language processing.
The group has a consistent track record of publishing in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years. We are now set to expand further, and this
position is just one of several new openings.

Proving formulas in propositional logic is a problem of immense importance
both theoretically and practically. This computational task is widely
believed to be intractable in the worst case, although proving (or
disproving) this is a major open problem in theoretical computer science
and mathematics. (This is one of the famous million dollar Millennium
Problems, known as the P vs. NP problem.) In spite of this, today
so-called SAT solvers are routinely used to solve large-scale real-world
problem instances with millions of variables. The intriguing question of
when SAT solvers perform well or badly, and what properties of the
formulas explain this behaviour, remains quite poorly understood.

Proof complexity studies formal systems for reasoning about logic
formulas. This field has deep connections to fundamental questions in
computational complexity, but another important motivation is the
connection to SAT solving. All SAT solvers use some kind of method or
system in which proofs are searched for, and proof complexity analyses the
potential and limitations of such proof systems (and thereby of the
algorithms using them).

Our research aims to advance the frontiers of proof complexity, and to
leverage this research to shed light on questions related to SAT solving.
We want to understand what makes formulas hard or easy in practice, and to
gain theoretical insights into other crucial but poorly understood issues
in SAT solving. We are also interested in exploring the possibility of
basing SAT solvers on stronger proof systems than are currently being
used. In order to do so, however, a crucial step is to obtain a better
understanding of the corresponding proof systems, and in this context
there are a number of well-known and relatively longstanding open
questions in proof complexity that we want to study and try to resolve.

This research project is led by Jakob Nordstrom
(http://www.csc.kth.se/~jakobn) and is financed by a Breakthrough Research
Grant from the Swedish Research Council and a Starting Independent
Researcher Grant from the European Research Council. The group currently
consists of one postdoctoral researcher and two PhD students (in addition
to the project leader). Travel funding is included, and the group also
receives short-term and long-term visitors on a regular basis.

This is a four-year time-limited position, but PhD positions usually (but
not necessarily) include 20% teaching, in which case they are prolonged
for one more year. The successful candidate is expected to start in
August-September 2014, although this is to some extent negotiable.

The application deadline is December 15, 2013. See
http://www.csc.kth.se/~jakobn/openings/D-2013-0620-Eng.php for the full,
formal announcement with more information and instructions for how to
apply. Informal enquiries about this position are welcome and may be sent
to Jakob Nordstrom.

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

Message: 3
Date: Sun, 27 Oct 2013 22:51:36 +0000
From: Daniel Guimarans <Daniel.Guimarans@nicta.com.au>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Call for Book Chapter Proposals:
Simulation-Optimization Approaches
Message-ID: <5021089A-D8C6-4275-8928-5B3241CA3586@nicta.com.au>
Content-Type: text/plain; charset="utf-8"

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

CALL FOR BOOK CHAPTER PROPOSALS

Getting into Practice : Simulation-Optimization Approaches
The use of simulation?optimization approaches in logistics, industrial, and
aeronautical operations
Springer Handbook
Miguel Mujica, Idalia Flores, and Daniel Guimarans (Eds.)
----------------------------------------------------------------------------------------------------------------------------------
----------------------------------------------------------------------------------------------------------------------------------

Upcoming Deadline: 1st December 2013 - intention to prepare a manuscript
Contact us: m.mujica.mota@hva.nl<mailto:m.mujica.mota@hva.nl>, idalia@unam.mx<mailto:idalia@unam.mx>, daniel.guimarans@nicta.com.au<mailto:daniel.guimarans@nicta.com.au>

Simulation is a well?known approach that can have different abstraction levels and can integrate different elements of a studied system. It consists in the development of a representation of a system (logistics one, manufacturing, operative, etc.) using modelling formalisms, off?the?shelf software programs, or programming languages. It is commonly used at industrial level to obtain a better understanding of the studied system. With the use of the model different experiments may be carried out in order to test different research questions, such as the performance of new configurations, identify bottlenecks in the current system, and inefficiencies that are perceived as an increase in operative costs. Unfortunately, the experiments alone cannot ensure the optimal configurations for the objective pursued (allocation of resources, minimizing operative costs, increase throughput etc.). On the other hand, optimization techniques are very?well?accepted techniques which consist in t!
he representation of the problem under study taking into account only the key variables, dependencies, and restrictions of a problem. The main argument against them is that the abstraction process often leaves out of the scope some key elements that participate and affect the performance of a system, giving as a result a potential optimal solution that sometimes results difficult or impossible to implement in the real system.

The book will present techniques, case studies, and methodologies that combine the use of simulation approaches with optimization techniques for facing problems in manufacturing, logistics, or aeronautical problems, which aim at overcoming the shortcomings of both approaches through the combination of them. The book will present detailed techniques and research studies that cope with common industrial problems in several fields, which range from manufacturing to aviation problems, where the common denominator is the combination of simulation?s flexibility with optimization techniques? robustness.

The benefit to the reader will be a comprehensive guide to tackle similar problems in industrial environments. The problems presented will serve only as an example, but methodologies used by the scientific community will be of high value in order to cope with complex problems.

------------------------------------------------------------------------------------------
Topics of Interest
------------------------------------------------------------------------------------------

+ Supply Chain
+ Manufacturing
+ Transportation
+ Aeronautical Operations (Terminal, Side, Services)
+ Facility Location
+ Routing Problems
+ Simulation?Optimization Methodologies
+ Urban logistics
+ Ports and Sea Transport

We strongly welcome other topic suggestions dealing with convergence of the two approaches into an integrated methodology beyond the topics suggested above.

------------------------------------------------------------------------------------------
Schedule & Deadlines
------------------------------------------------------------------------------------------

- 1st December 2013
Notification for intending to contribute with a book chapter to help us in planning the review process (authors, preliminary title, and brief abstract of max. 250 words)

- 31st January 2014
1st manuscript version (also authors who did not notify us their intention to contribute are invited to submit)

- 1st March 2014
Review comments for 1st manuscript version and notification of acceptance

- 8th July 2014
Submission of the 2nd version of accepted book chapters

- 30th July 2014
Feedback from the editors if all criteria are met (e.g. page count, correct template, review comments addressed, appropriate English language, etc.)

- 15th September 2014
Final manuscripts to be sent to Springer. Thereafter manuscripts cannot be updated (strict deadline)

------------------------------------------------------------------------------------------
Manuscript Preparation
------------------------------------------------------------------------------------------

- Please prepare your manuscript according the following guidelines:
http://www.springer.com/authors/book+authors?SGWID=0?154102?12?417900?0

- Send the following files as one .zip file to one of the editors:
+ Authors short bios (collected in one word file)
+ Picture of each author
+ Original manuscript in word, LaTeX, or any other word processing format
+ PDF version of the manuscript

- Make sure that the following conditions are met for the final version of the chapter:
+ The submissions need proper English language editing. Please ensure that your final submission is proof read and written in proper English language
+ The submissions follow the Springer template
+ Each submission has to be structured according the following 'template':
* Introduction and problem discussion
* Literature state of the art/Literature Review
* Methodology & Approach
* ... other content of the chapter ...
* Viewpoint on Convergence (min. 1/2 page, or add to the Conclusions section)
* Conclusions

------------------------------------------------------------------------------------------
Editors:
Dr. Miguel M?jica Mota, Amsterdam University of Applied Sciences, Netherlands. m.mujica.mota@hva.nl<mailto:m.mujica.mota@hva.nl>
Dr. Idalia Flores de la Mota, National Autonomous University of Mexico, Mexico. idalia@unam.mx<mailto:idalia@unam.mx>
Dr. Daniel Guimarans Serrano, National ICT Australia, Australia. daniel.guimarans@nicta.com.au<mailto:daniel.guimarans@nicta.com.au>

Daniel Guimarans
Researcher

NICTA l Lvl 5, 13 Garden Street l Eveleigh NSW 2015 l ?Australia
Locked Bag 9013 l Alexandria NSW 2015?
T + 61 2 9376 2073
Twitter http://twitter.com/NICTA
www.nicta.com.au<http://www.nicta.com.au/> | daniel.guimarans@nicta.com.au<mailto:firstname.lastname@nicta.com.au>

Research Excellence in ICT
Wealth Creation for Australia

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

Message: 4
Date: Mon, 28 Oct 2013 00:21:22 +0000
From: Juan Romero <evomusart@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Evomusart 2014. Submission deadline extended to Nov
11
Message-ID:
<CALsnibt-OFL6HXk=FxViArg7jOPNqUyxjuBejziewL5R6Tpsig@mail.gmail.com>
Content-Type: text/plain; charset=windows-1252

----------------------------------------------------------------------------
Please distribute
(Apologies for cross posting)
----------------------------------------------------------------------------

----------------------------------------------------------------------------
NEWS: Submission deadline extended to Nov 11
----------------------------------------------------------------------------

CALL FOR PAPERS
evomusart 2014
http://www.evostar.org/cfpEvoMUSART.html

3rd International Conference on Evolutionary and Biologically Inspired
Music, Sound, Art and Design

April 2014, GRANADA, Spain
Part of evo* 2014
evo*: http://www.evostar.org

----------------------------------------------------------------------------
New this year: Special track on Artificial Neural Networks applied to
Music, Sound, Art and Design

----------------------------------------------------------------------------
LEONARDO Special Section
----------------------------------------------------------------------------
Authors of selected papers will be invited to submit expanded versions
of their work for a planned special section on Evolutionary Art of the
MIT Press journal "Leonardo".
----------------------------------------------------------------------------

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

Following the success of previous events and the importance of the
field of evolutionary and biologically inspired (artificial neural
network, swarm, alife) music, sound, art and
design, evomusart has become an evo* conference with independent
proceedings since 2012. Thus, evomusart 2014 is the twelfth European
Event and the third International Conference on Evolutionary and
Biologically Inspired Music, Sound, Art and Design.

The use of biologically inspired techniques for the development of
artistic systems is a recent, exciting and significant area of
research. There is a growing interest in the application of these
techniques in fields such as: visual art and music generation,
analysis, and interpretation; sound synthesis; architecture; video;
poetry; design; and other creative tasks.

The main goal of evomusart 2014 is to bring together researchers who
are using biologically inspired computer techniques for artistic
tasks, providing the opportunity to promote, present and discuss
ongoing work in the area.

The event will be held in April, 2014 in Granada, Andalusia, Spain, as
part of the evo* event.

----------------------------------------------------------------------------
Publication Details
----------------------------------------------------------------------------

Submissions will be rigorously reviewed for scientific and artistic
merit. Accepted papers will be presented orally or as posters at the
event and included in the evomusart proceedings, published by Springer
Verlag in a dedicated volume of the Lecture Notes in Computer Science
series. The acceptance rate at evomusart 2013 was 30.5% for papers
accepted for oral presentation, or 44.4% for oral and poster
presentation combined. The evomusart 2013 submissions received on
average 3.4 reviews each.

New this year: submitters are strongly encouraged to provide in all
papers a link for download of media demonstrating their results,
whether music, images, video, or other media types. Links should be
anonymised for double-blind review, e.g. using a URL shortening
service.

----------------------------------------------------------------------------
Topics of interest
----------------------------------------------------------------------------

Submissions should concern the use of biologically inspired computer
techniques -- e.g. Evolutionary Computation, Artificial Life,
Artificial Neural Networks, Swarm Intelligence, other artificial
intelligence techniques -- in the generation, analysis and
interpretation of art, music, design, architecture and other artistic
fields. Topics of interest include, but are not limited to:

-- Generation
- Biologically Inspired Design and Art -- Systems that create
drawings, images, animations, sculptures, poetry, text, designs,
webpages, buildings, etc.;
- Biologically Inspired Sound and Music -- Systems that create
musical pieces, sounds, instruments, voices, sound effects, sound
analysis, etc.;
- Robotic-Based Evolutionary Art and Music;
- Other related artificial intelligence or generative techniques in
the fields of Computer Music, Computer Art, etc.;

-- Theory
- Computational Aesthetics, Experimental Aesthetics; Emotional
Response, Surprise, Novelty;
- Representation techniques;
- Surveys of the current state-of-the-art in the area; identification
of weaknesses and strengths; comparative analysis and classification;
- Validation methodologies;
- Studies on the applicability of these techniques to related areas;
- New models designed to promote the creative potential of
biologically inspired computation;

-- Computer Aided Creativity and computational creativity
- Systems in which biologically inspired computation is used to
promote the creativity of a human user;
- New ways of integrating the user in the evolutionary cycle;
- Analysis and evaluation of: the artistic potential of biologically
inspired art and music; the artistic processes inherent to these
approaches; the resulting artefacts;
- Collaborative distributed artificial art environments;

-- Automation
- Techniques for automatic fitness assignment;
- Systems in which an analysis or interpretation of the artworks is
used in conjunction with biologically inspired techniques to produce
novel objects;
- Systems that resort to biologically inspired computation to perform
the analysis of image, music, sound, sculpture, or some other types of
artistic object.

----------------------------------------------------------------------------
Important Dates (to be confirmed)
----------------------------------------------------------------------------

Submission: November 11 2013
Notification to authors: December 2013
Camera-ready deadline: January 2014
Evo*: April 2014

----------------------------------------------------------------------------
Additional information and submission details
----------------------------------------------------------------------------

Submit your manuscript, at most 12 A4 pages long, in Springer LNCS
format (instructions downloadable from
http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0) no later
than November 1, 2013 (date to be confirmed).

Submission link: http://myreview.csregistry.org/evomusart14
page limit: 12 pages

The reviewing process will be double-blind; please omit information
about the authors in the submitted paper.

----------------------------------------------------------------------------
Programme committee
----------------------------------------------------------------------------

Adrian Carballal,University of A Coruna,Spain
Alain Lioret,Paris 8 University,France
Alan Dorin,Monash University,Australia
Alejandro Pazos,University of A Coruna,Spain
Alice Eldridge,Monash University,Australia
Amilcar Cardoso,University of Coimbra,Portugal
Amy K. Hoover,University of Central Florida,USA
Andrew Brown,Griffith University,Australia
Andrew Gildfind,Google, Inc.,Australia
Andrew Horner,University of Science & Technology,Hong Kong
Anna Ursyn,University of Northern Colorado,USA
Antonino Santos,University of A Coruna,Spain
Antonios Liapis,IT University of Copenhagen ,Denmark
Arne Eigenfeldt,Simon Fraser University,Canada
Artemis Sanchez Moroni,Renato Archer Research Center,Brazil
Benjamin Schroeder,Ohio State University,USA
Benjamin Smith,Indianapolis University, Purdue University,Indianapolis,USA
Bill Manaris,College of Charleston,USA
Brian Ross,Brock University,Canada
Carlos Grilo,Instituto Polit?cnico de Leiria,Portugal
Christian Jacob,University of Calgary,Canada
Colin Johnson,University of Kent,UK
Dan Ashlock,University of Guelph,Canada
Dan Costelloe,Independent Researcher (Solace One Ltd),Ireland
Dan Ventura,Brigham Young University,USA
Daniel Bisig,University of Zurich,Switzerland
Daniel Jones,Goldsmiths College, University of London,UK
Daniel Silva,University of Coimbra,Portugal
Douglas Repetto,Columbia University,USA
Eduardo Miranda,University of Plymouth,UK
Eelco den Heijer,Vrije Universiteit Amsterdam,Netherlands
Eleonora Bilotta ,University of Calabria,Italy
Francois Pachet,Sony CSL Paris,France
Gary Greenfield,University of Richmond,USA
Gary Nelson,Oerlin College,USA
Hans Dehlinger,Independent Artist,Germany
Hern?n Kerlle?evich,National University of Quilmes,Argentina
J. E. Rowe,University of Birmingham,UK
Jane Prophet,Independent Artist,UK
Jate Reed,Imperial College,UK
John Collomosse,University of Surrey,UK
Jon McCormack,Monash University,Australia
Jonathan Byrne,University College Dublin,Ireland
Jonathan Eisenmann,Ohio State University,USA
Jos? Fornari,NICS/Unicamp,Brazil
Kate Reed,Imperial College,UK
Marcelo Freitas Caetano,IRCAM,France
Marcos Nadal,University of Illes Balears,Spain
Matthew Lewis,Ohio State University,USA
Mauro Annunziato,Plancton Art Studio,Italy
Maximos Kaliakatsos-Papakostas,University of Patras,Greece
Michael O?Neill,University College Dublin,Ireland
Nicolas Monmarch?,University of Tours,France
Pablo Gerv?s,Universidad Complutense de Madrid,Spain
Palle Dahlstedt,G?teborg University,Sweden
Patrick Janssen,National University of Singapure,Singapure
Paulo Urbano,Universidade de Lisboa,Portugal
Pedro Abreu,University of Coimbra,Portugal
Pedro Cruz,University of Coimbra,Portugal
Penousal Machado,University of Coimbra,Portugal
Peter Bentley,University College London ,UK
Peter Cariani,University of Binghamton,USA
Philip Galanter,Texas A&M College of Architecture,USA
Philippe Pasquier,Simon Fraser University,Canada
Rafael Ramirez,Pompeu Fabra University,Spain
Roger Malina,International Society for the Arts, Sciences and Technology,USA
Roisin Loughran,University of Limerick,Ireland
Ruli Manurung,University of Indonesia,Indonesia
Scott Draves,Independent Artist,USA
Somnuk Phon-Amnuaisuk,Brunei Institute of Technology,Malaysia
Stephen Todd,IBM,UK
Takashi Ikegami,Tokyo Institute of Technology,Japan
Tim Blackwell,Goldsmiths College, University of London,UK
Troy Innocent,Monash University,Australia
Usman Haque,Haque Design + Research Ltd,UK/Pakistan
Vic Ciesielski,RMIT,Australia
Yang Li,University of Science and Technology Beijing,China

----------------------------------------------------------------------------
Conference chairs
----------------------------------------------------------------------------

Juan Romero
University of A Coruna, Spain
jj(at)udc.es

James McDermott
University College Dublin, Ireland
jmmcd(at)jmmcd.net

Publication chair
Joao Correia, University of Coimbra
jncor(at)dei.uc.pt

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

Subject: Digest Footer

_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet

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

End of dmanet Digest, Vol 68, Issue 24
**************************************

DMANET: DISCRETE MATHEMATICS AND ALGORITHMS

Thursday, October 31, 2013

dmanet Digest, Vol 68, Issue 28

Wednesday, October 30, 2013

dmanet Digest, Vol 68, Issue 27

Tuesday, October 29, 2013

dmanet Digest, Vol 68, Issue 26

Monday, October 28, 2013

dmanet Digest, Vol 68, Issue 25

dmanet Digest, Vol 68, Issue 24

Saturday, October 26, 2013

dmanet Digest, Vol 68, Issue 23

Friday, October 25, 2013

dmanet Digest, Vol 68, Issue 22

Thursday, October 24, 2013

dmanet Digest, Vol 68, Issue 21

About Me