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. Deadline extension!! : HM 2014 (9th Intl. Workshop on Hybrid
Metaheuristics) until 28/02 (Maria J. Blesa)
2. Fully-funded PhD studentship in Algorithms and Complexity at
University of Edinburgh (Rahul Santhanam)
3. LATA 2014: call for participation (GRLMC)
4. Summer school on Network analysis and applications
(N.Litvak@utwente.nl)
5. I-CORE Day, April 9, 2014, The Hebrew University of Jerusalem
(Yishay Mansour)
----------------------------------------------------------------------
Message: 1
Date: Fri, 21 Feb 2014 17:47:13 +0100
From: "Maria J. Blesa" <mjblesa@lsi.upc.edu>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Deadline extension!! : HM 2014 (9th Intl. Workshop
on Hybrid Metaheuristics) until 28/02
Message-ID: <53078311.4030303@lsi.upc.edu>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Dear colleague, apologies if you receive multiple copies of this CfP.
Deadline EXTENDED until 28/02 !!
************************************************************************
HM 2014
9th International Workshop on Hybrid Metaheuristics
June 9-13, 2014
Hamburg, Germany
(http://iwi.econ.uni-hamburg.de/hm14/)
Back to back with the
5th international Workshop on Model-Based Metaheuristics
CALL FOR PAPERS
************************************************************************
General Chair
Stefan Voss (Universit?t Hamburg, Germany)
Program chair
Christian Blum (IKERBASQUE and Univ. of the Basque Country, Spain)
************************************************************************
Steering Committee
Maria Blesa (Universitat Polit?cnica de Catalunya, Spain)
Christian Blum (IKERBASQUE and Univ. of the Basque Country, Spain)
Luca di Gaspero (University of Udine, Italy)
Paola Festa (University of Napoli FEDERICO II, Italy)
G?nther Raidl (Technische Universit?t Wien, Austria)
Michael Sampels (Universit? Libre de Bruxelles, Belgium)
************************************************************************
Important Dates
Submissions Due: February 28, 2014 (EXTENDED !)
Notification: March 28, 2014
Final Papers Due: April 4, 2014
************************************************************************
Aims & Scope
The HM Workshops are intended to be an international forum for
researchers in the area of design, analysis, and experimental
evaluation of metaheuristics. Metaheuristics, such as simulated
annealing, evolutionary algorithms, tabu search, ant colony
optimization, scatter search and iterated local search, are
considered state-of-the-art methods for many problems. In
recent years, however, it has become evident that the
concentration on a sole metaheuristic is rather restrictive. A
skilled combination of concepts from different optimization
techniques can provide a more efficient behavior and a higher
flexibility when dealing with real-world and large-scale
problems.
Hybrid Metaheuristics are such techniques for optimization that
combine different metaheuristics or integrate AI/OR techniques
into metaheuristics. Previously organized Workshops were held
in Ischia Island (HM 2013), Vienna (HM 2010), Udine (HM 2009),
Malaga (HM 2008), Dortmund (HM 2007), Gran Canaria (HM 2006),
Barcelona (HM 2005), and Val?ncia (HM 2004).
HM2014 is organized as a non-profit event.
************************************************************************
Topics of Interest
Contributions solicited cover a variety of topics including but
not limited to:
- Novel combinations of components from different metaheuristics
- Hybridization of metaheuristics and AI/OR techniques
- Low-level hybridization
- High-level hybridization, portfolio techniques, expert systems
- Cooperative search
- Automated parameter tuning
- Empirical and statistical comparison
- Theoretical aspects of hybridization
- Parallelization
- Software libraries
************************************************************************
Paper Submission
Authors are invited to submit a full paper describing original,
unpublished research with at most 15 pages (in LNCS style).
Proofs omitted due to space constraints must be put into an
appendix to be read by the program committee members at their
discretion.
Electronic submissions should be formatted in pdf. Simultaneous
submission to other conferences or workshops with published
proceedings is not allowed.
The proceedings will be published in Springer's LNCS series.
************************************************************************
Further and Contact information:
Stefan Voss (stefan.voss@uni-hamburg.de)
Institute of Information Systems
Department for Business and Economics
University of Hamburg
Von-Melle-Park 5
Office VMP 5, Room 3064
D-20146 Hamburg
Germany
Tel.: +49 (0)40 42838-3064
Fax: +49 (0)40 42838-5535
Conference Website: http://iwi.econ.uni-hamburg.de/hm14/
************************************************************************
------------------------------
Message: 2
Date: Fri, 21 Feb 2014 19:00:53 +0000 (GMT)
From: Rahul Santhanam <rsanthan@inf.ed.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Fully-funded PhD studentship in Algorithms and
Complexity at University of Edinburgh
Message-ID: <alpine.LRH.2.02.1402211837540.23377@bolt.inf.ed.ac.uk>
Content-Type: TEXT/PLAIN; format=flowed; charset=US-ASCII
A fully funded 3 year PhD studentship is available at the School of
Informatics, University of Edinburgh, on the topic of "Design and Analysis
of Satisfiability Algorithms". The studentship is funded by the ERC
Consolidator Grant ALUnif: "Algorithms and Lower Bounds: A Unified
Approach", and will be supervised by Rahul Santhanam.
The goal of the project is to design and analyze better algorithms for
Satisfiability and other NP-complete algorithms, guided by
complexity-theoretic ideas. The project belongs to the field of exact
algorithms for NP-hard problems, where we are interested in finding
algorithms for NP-hard problems with worst-case complexity O(2^{cn}),
where c < 1 is as small as possible. Here "n" is the witness size of the
instance. Recently discovered connections between complexity lower bound
techniques and algorithmic analysis suggest new approaches to finding
better exact algorithms, and the student will work with the supervisor in
exploring these new approaches.
The student will join the Algorithms and Complexity Group at the
Laboratory for Foundations of Computer Science (LFCS) in the School of
Informatics. The School of Informatics at Edinburgh is the UK's largest
and strongest research centre for computing and informatics. In the latest
UK Research Assessment Exercise in 2008, Informatics at Edinburgh was
adjudged to deliver more world-leading research than any other university
in the UK. Two winners of the ACM Turing award, which is the highest
distinction in computer science, have taught at Edinburgh.
Applicants should have a strong mathematical background, with an
undergraduate degree in Computer Science, Mathematics or a related area.
Prior experience with the theory of algorithms and/or
complexity theory is highly recommended.
The position is available to UK/EU applicants, but exceptional
international applicants may also be considered. The deadline is March
31. Informal queries may be addressed to Rahul Santhanam
(rsanthan@inf.ed.ac.uk).
To apply, click on the apply button at this link:
http://www.jobs.ac.uk/job/AIF821/phd-studentship/
---------------
Rahul Santhanam
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
------------------------------
Message: 3
Date: Fri, 21 Feb 2014 21:24:46 +0100
From: "GRLMC" <grlmc@urv.cat>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] LATA 2014: call for participation
Message-ID: <0426F32D352C4A1F8DB52DE2A98CD328@Carlos1>
Content-Type: text/plain; charset="utf-8"
*************************************************************************
8th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
LATA 2014
Madrid, Spain
March 10-14, 2014
http://grammars.grlmc.com/lata2014/
*********************************************************************
PROGRAM
Monday, March 10:
9:30 - 10:30 Registration
10:30 - 10:40 Opening
10:40 - 11:30 Helmut Seidl: Interprocedural Information Flow Analysis of XML Processors - Invited Lecture
11:30 - 11:45 Break
11:45 - 13:00 Alberto Dennunzio, Enrico Formenti, Luca Manzoni: Extremal Combinatorics of Reaction Systems
Fernando Arroyo, Sandra G?mez Canaval, Victor Mitrana, ?tefan Popescu: Networks of Polarized Evolutionary Processors are Computationally Complete
Liang Ding, Abdul Samad, Xingran Xue, Xiuzhen Huang, Russell L. Malmberg, Liming Cai: Stochastic k-Tree Grammar and its Application in Biomolecular Structure Modeling
13:00 - 14:30 Lunch
14:30 - 15:45 B?atrice B?rard, Olivier Carton: Channel Synthesis Revisited
Daniel Pr??a: Weight-reducing Hennie Machines and Their Descriptional Complexity
Manfred Droste, Stefan D?ck: Weighted Automata and Logics for Infinite Nested Words
15:45 - 16:00 Break
16:00 - 17:15 Friedrich Otto, Franti?ek Mr?z: Extended Two-Way Ordered Restarting Automata for Picture Languages
Sang-Ki Ko, Yo-Sub Han, Kai Salomaa: Top-Down Tree Edit-Distance of Regular Tree Languages
Bertram Felgenhauer, Ren? Thiemann: Reachability Analysis with State-Compatible Automata
17:15 - 17:45 Coffee Break
17:45 - 18:35 Leslie A. Goldberg: The Complexity of Approximate Counting - Invited Lecture
Tuesday, March 11:
9:00 - 9:50 Sanjeev Khanna: Matchings, Random Walks, and Sampling - Invited Lecture
9:50 - 10:00 Break
10:00 - 11:15 Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni, Riccardo Dondi, Yuri Pirola: Covering Pairs in Directed Acyclic Graphs
Eike Best, Raymond Devillers: Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
Mar?a Martos-Salgado, Fernando Rosa-Velardo: Expressiveness of Dynamic Networks of Timed Petri Nets
11:15 - 11:45 Coffee Break
11:45 - 13:00 Bireswar Das, Patrick Scharpfenecker, Jacobo Tor?n: Succinct Encodings of Graph Isomorphism
Matthias Gall?, Mat?as Tealdi: On Context-Diverse Repeats and their Incremental Computation
Marcella Anselmo, Dora Giammarresi, Maria Madonia: Picture Codes with Finite Deciphering Delay
13:00 - 14:30 Lunch
14:30 - 15:45 Paul Tarau: Computing with Catalan Families
Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro L?pez-Ortiz: On the List Update Problem with Advice
Rob Gysel: Minimal Triangulation Algorithms for Perfect Phylogeny Problems
15:45 - 16:00 Break
16:00 - 17:15 Gr?goire Laurence, Aur?lien Lemay, Joachim Niehren, S?awek Staworko, Marc Tommasi: Learning Sequential Tree-to-word Transducers
Dariusz Kaloci?ski: On Computability and Learnability of the Pumping Lemma Function
Slimane Bellaouar, Hadda Cherroun, Djelloul Ziadi: Efficient List-based Computation of the String Subsequence Kernel
Wednesday, March 12:
9:00 - 9:50 Oscar H. Ibarra: On the Parikh Membership Problem for FAs, PDAs, and CMs - Invited Lecture
9:50 - 10:00 Break
10:00 - 11:15 Marius Konitzer, Hans Ulrich Simon: DFA with a Bounded Activity Level
Shenggen Zheng, Jozef Gruska, Daowen Qiu: On the State Complexity of Semi-Quantum Finite Automata
Vojt?ch Vorel: Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata
11:15 - 11:45 Coffee Break
11:45 - 13:00 Pascal Caron, Marianne Flouret, Ludovic Mignot: (k,l)-Unambiguity and Quasi-Deterministic Structures: an Alternative for the Determinization
Zuzana Bedn?rov?, Viliam Geffert: Two Double-Exponential Gaps for Automata with a Limited Pushdown
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman: Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata
13:00 - 14:30 Lunch
15:45 - 17:45 Sightseeing in Madrid by Bus
Thursday, March 13:
9:00 - 9:50 Javier Esparza: A Brief History of Strahler Numbers (I) - Invited Tutorial
9:50 - 10:00 Break
10:00 - 11:15 Zeinab Mazadi, Ziyuan Gao, Sandra Zilles: Distinguishing Pattern Languages with Membership Examples
Francine Blanchet-Sadri, Andrew Lohr, Sean Simmons, Brent Woodhouse: Computing Depths of Patterns
Alexandre Blondin Mass?, S?bastien Gaboury, Sylvain Hall?, Micha?l Larouche: Solving Equations on Words with Morphisms and Antimorphisms
11:15 - 11:45 Coffee Break
11:45 - 13:00 Anton Cern?: Solutions to the Multi-Dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms
Enrico Formenti, Markus Holzer, Martin Kutrib, Julien Provillard: ?-rational Languages: High Complexity Classes vs. Borel Hierarchy
Thomas Weidner: Probabilistic ?-Regular Expressions
13:00 - 14:30 Lunch
14:30 - 15:45 Haizhou Li, Fran?ois Pinet, Farouk Toumani: Probabilistic Simulation for Probabilistic Data-aware Business Processes
Daniel Bundala, Jakub Z?vodn?: Optimal Sorting Networks
Etienne Dubourg, David Janin: Algebraic Tools for the Overlapping Tile Product
15:45 - 16:00 Break
16:00 - 17:15 Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti: Shift-Reduce Parsers for Transition Networks
Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet, Ronnie Barequet: Formulae for Polyominoes on Twisted Cylinders
Alexandre Blondin Mass?, Amadou Makhtar Tall, Hugo Tremblay: On the Arithmetics of Discrete Figures
Friday, March 14:
9:00 - 9:50 Javier Esparza: A Brief History of Strahler Numbers (II) - Invited Tutorial
9:50 - 10:00 Break
10:00 - 11:15 Hanna Klaudel, Maciej Koutny, Zhenhua Duan: Interval Temporal Logic Semantics of Box Algebra
Pierre Ganty, Ahmed Rezine: Ordered Counter-Abstraction: Refinable Subword Relations for Parameterized Verification
Matthew Gwynne, Oliver Kullmann: On SAT Representations of XOR Constraints
11:15 - 11:45 Coffee Break
11:45 - 13:00 Bernd Finkbeiner, Hazem Torfah: Counting Models of Linear-time Temporal Logic
Claudia Carapelle, Shiguang Feng, Oliver Fern?ndez Gil, Karin Quaas: Satisfiability for MTL and TPTL over Non-Monotonic Data Words
Joachim Klein, David M?ller, Christel Baier, Sascha Kl?ppelholz: Are Good-for-games Automata Good for Probabilistic Model Checking?
13:00 Closing
------------------------------
Message: 4
Date: Sat, 22 Feb 2014 20:36:30 +0000
From: <N.Litvak@utwente.nl>
To: <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] Summer school on Network analysis and applications
Message-ID:
<F64303580C22ED479A32979F44780E946A52DFC5@EXMBX24.ad.utwente.nl>
Content-Type: text/plain; charset="iso-8859-1"
Summer school on Network analysis and applications takes place at a beautiful location in the Pyrenees,
Ecole de sciences avancees de Luchon
Luchon, France
June 21 - July 5, 2014
http://www.quantware.ups-tlse.fr/ecoleluchon2014/
Organized by:
A.Benczur (Hungarian Academy of Sciences)
A.Kaltenbrunner (Barcelona Media)
D.Shepelyansky (CNRS Toulouse)
List of confirmed lecturers and main topics:
* Alain Barrat (CNRS Marseille)
<http://www.cpt.univ-mrs.fr/%7Ebarrat/> - /Epidemics and networks/
* Andr?s Bencz?r (MTA_SZTAKI Budapest)
<https://dms.sztaki.hu/en/people/andras-benczur> - /Recommendation
systems/
* Paolo Boldi (U Milano) <http://boldi.di.unimi.it/> - /Algorithms for
search engines/
* Sergey Dorogovtsev (U Averio) <http://sweet.ua.pt/sdorogov/> -
/Giant components in complex networks and epidemics/
* Klaus Frahm (U Toulouse) <http://www.quantware.ups-tlse.fr/> -
/Spectral properties of Google matrix/
* Aristides Gionis (U Aalto) <http://users.ics.aalto.fi/gionis/> -
/Dense-subgraph discovery/
* Andreas Kaltenbrunner (Barcelona Media)
<http://www.dtic.upf.edu/%7Eakalten/> - /Network analysis and
visualization for social media/
* Victor Solovyev (KAUST)
<http://www.molquest.kaust.edu.sa/?topic=about&no_menu=on> -
/Genomics and transcriptomics big data analysis/
Special topics:
* Young-Ho Eom (CNRS Toulouse) <http://www.quantware.ups-tlse.fr> -
/Network based rankings of people across multilingual Wikipedia
editions /
* Bertrand Georgeot (CNRS Toulouse)
<http://www.lpt.ups-tlse.fr/spip.php?article28> - /Game of GO as a
complex network/
* Katia Jaffres-Runser (ENSEEIHT Toulouse)
<http://www.irit.fr/%7EKatia.Jaffres/> - /Network analysis for
context and content oriented wireless networking/
* Bertrand Jouve (CNRS - U Toulouse 2)
<http://framespa.univ-tlse2.fr/m-jouve-bertrand-52811.kjsp> -
/Graphs to analyze medieval social networks/
* Nelly Litvak (U Twente)
<http://www.utwente.nl/ewi/sor/about/staff/litvak/> - /Quick
detection of popular entities in large on-line networks /
* Esteban Moro (U Carlos III de Madrid )
<http://matematicas.uc3m.es/index.php/dpto-people/titulares/emoro-menu>
- /To be announced /
* Dima Shepelyansky (CNRS Toulouse)
<http://www.quantware.ups-tlse.fr/dima/> - /Google matrix analysis
of world trade network /
* Marc Spaniol (MPI Saarbrucken)
<http://www.mpi-inf.mpg.de/%7Emspaniol/> - /Entity-level temporal
Web analytics /
* Taha Yasseri (Oxford Internet Inst)
<http://www.oii.ox.ac.uk/people/yasseri/> - /Conflict and editorial
wars in Wikipedia, a network approach /
* and others
<http://www.quantware.ups-tlse.fr/ecoleluchon2014/index.html> - /TBA /
Registration form is available at the school web page.
We are looking forward to see your students at the school.
Dr. Nelly Litvak
Associate Professor,
Department of Applied Mathematics,
University of Twente, The Netherlands
Tel: +31(53)4893388
------------------------------
Message: 5
Date: Sun, 23 Feb 2014 08:36:18 +0200
From: Yishay Mansour <mansour@tau.ac.il>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] I-CORE Day, April 9, 2014, The Hebrew University of
Jerusalem
Message-ID:
<CAM90oAgJsQi6D343NyRDTMz4bccs4BqCGqzdYfpNc2FNdtyZhQ@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
I-CORE Day, April 9, 2014
http://www.cs.tau.ac.il/workshop/icore-day/
Save the Date and Register (It's Free)!
Location:
The Hebrew University of Jerusalem
The Rachel and Selim Benin School of Computer Science and Engeeniring,
Rothberg Buildings.
The I-CORE day will include two plenary talks and
four parallel tracks, on the following research topics:
* Cryptography and Security
* Computer Networks
* Algorithmic Game Theory
* Algorithms and Computation
Plenary Joint Speakers:
Prof. Chris Umans, California Institute of Technology:
Prof. Luca Trevisan, Stanford University:
Partial list of speakers:
Prof. Amir Shpilka (The Technion)
Prof. Amos Fiat (Tel Aviv University)
Dr. Avinatan Hassidim (Bar Ilan University)
Dr. Aviv Zohar(The Hebrew University)
Prof. Danny Raz (The Technion)
Eli Meiron (The Technion)
Dr. Gil Segev (The Hebrew University)
Dr. Haya Shulman (Technische Universitat Darmstadt)
Ilan Cohn (Tel Aviv University)
Lior Kamma (Weizmann Institute)
Prof. Michael Walfish (New York University)
Noa Avigdor-Elgrabli (The Technion)
Nir Bitansky (Tel Aviv University)
Prof. Ran Spiegler (Tel Aviv University)
Ron Rothblum (The Weizmann Institute)
Prof. Sharon Goldberg (Boston University)
Prof. Uri Feige (Weizmann Institute)
Prof. Yehuda Afek (Tel Aviv University)
Prof. Yuval Ishai (The Technion)
See you there!
I-CORE ALGO Team
------------------------------
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 72, Issue 23
**************************************
No comments:
Post a Comment