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. CanaDAM 2017 - Preliminary Announcement (Pawel Pralat)
2. Research chairs, postdocs, doctoral and master scholarships
in paris (Communication FSMP)
3. 15th EUROPT Workshop on Advances in Continuous Optimization
(Andrea Lodi)
4. Postdoc and PhD positions in "Distributed and Dynamic Graph
Algorithms and Complexity" at KTH, Sweden (Danupon Nanongkai)
5. faculty position in Athens, Greece (last call)
(Stavros Kolliopoulos)
6. 2nd CfP: ICFCA'17 — 14th International Conference on Formal
Concept Analysis (Daniel Borchmann)
----------------------------------------------------------------------
Message: 1
Date: Fri, 18 Nov 2016 11:14:48 -0500
From: Pawel Pralat <pralat@ryerson.ca>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CanaDAM 2017 - Preliminary Announcement
Message-ID: <1F02EA4B-25C3-43A2-9BCA-F1792EA02FAB@ryerson.ca>
Content-Type: text/plain; charset=utf-8
CanaDAM 2017 - Preliminary Announcement
The sixth Canadian Discrete and Algorithmic Mathematics conference (CanaDAM) https://canadam.math.ca/2017/ <https://canadam.math.ca/2017/> will be held June 12-15, 2017 at Ryerson University in Toronto, Ontario, Canada.
The general topic of the conference is the theory and application of discrete structures. Its goal is to highlight the most salient trends in the field. The conference will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact. The CanaDAM conference is held in odd numbered years using a format similar to the SIAM conference on Discrete Mathematics. Particular areas of interest include graphs and digraphs, hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, combinatorics of words, discrete optimization, discrete and computational geometry, lattice point enumeration, combinatorial algorithms, computational complexity, and applications of discrete and algorithmic mathematics, including (but not limited to) web graphs, computational biology, communication networks and information processing.
Invited Speakers:
Tanya Berger-Wolf (U. Illinois at Chicago)
Peter Keevash (Oxford)
Robert Kleinberg (Cornell)
Bojan Mohar (Simon Fraser)
Shubhangi Saraf (Rutgers)
Andrew Suk (U Illinois at Chicago)
Lauren Williams (Berkeley)
Julia Wolf (Bristol)
Submission deadlines (instructions for making submissions will be available once submissions are open in December):
• Contributed minisymposia proposals, including titles and abstracts for all speakers: March 1, 2017 (acceptance notification by March 8, 2017).
• Titles and abstracts of contributed talks: March 1, 2017 (acceptance notification by March 8, 2017).
• Abstracts of invited talks: February 7, 2017 (acceptance notification by February 14, 2017).
• Abstracts of invited minisymposia: February 7, 2017 (acceptance notification by February 14, 2017).
Registration deadlines:
• Early registration deadline: April 15, 2017 at 23:59 (11:59 pm) eastern daylight time.
• Full fees apply beginning April 16, 2015.
• Early registration fee (until April 15): $260; Students and Post-docs: $100.
• Regular registration fee (after April 15): $360; Students and Post-docs: $200.
• Online registration deadline: May 25, 2017 at 23:59 (11:59 pm) eastern daylight time.
• Student / Post-doctoral funding application deadline: March 15, 2017 (notification by April 5, 2017).
For information about accommodation, including booking deadlines, please see the Accommodation page on the website.
CanaDAM acknowledges the generous support of our sponsors: AARMS, CRM, Fields, PIMS, and Ryerson University.
Thank you,
— Pawel Pralat
————————————
http://www.math.ryerson.ca/~pralat/
Assistant Director for Industry Liaison, The Fields Institute for Research in Mathematical Sciences
Associate Professor, Department of Mathematics, Ryerson University
------------------------------
Message: 2
Date: Fri, 18 Nov 2016 17:25:09 +0100
From: Communication FSMP <communication@fsmp.fr>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Research chairs, postdocs, doctoral and master
scholarships in paris
Message-ID: <2C3408BE-EB01-4015-B260-8204928FA57C@fsmp.fr>
Content-Type: text/plain; charset=utf-8
The Foundation Sciences Mathématiques de Paris is pleased to offer the following opportunities in Paris to outstanding scientists and excellent students in mathematics or in fundamental computer science:
- Research chairs
- Postdoctoral positions
- Doctoral allowances
- Masters scholarships
Procedures of applications are available at:
www.sciencesmaths-paris.fr <http://www.sciencesmaths-paris.fr/>
Contact: contact@fsmp.fr
Best regards,
Gaël Octavia
Responsable de la communication
Fondation Sciences Mathématiques de Paris
www.sciencesmaths-paris.fr <http://www.sciencesmaths-paris.fr/>
IHP - 11 rue Pierre et Marie Curie
75231 Paris Cedex 05
communication@fsmp.fr
Tél : 33 (0)1 44 27 67 70
Fax : 33 (0)1 44 27 68 04
------------------------------
Message: 3
Date: Sun, 20 Nov 2016 03:52:16 +0000
From: Andrea Lodi <andrea.lodi@unibo.it>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 15th EUROPT Workshop on Advances in Continuous
Optimization
Message-ID: <9BEB4D18-3E6D-469B-A0C5-40AB4EE1C23F@unibo.it>
Content-Type: text/plain; charset="utf-8"
Dear colleagues,
We are pleased to announce the 15th EUROPT Workshop on Advances in Continuous Optimization, to be held in Montreal, Quebec, Canada, on July 12-14, 2017:
https://www.gerad.ca/colloques/europt2017/
The EUROPT Workshop on Advances in Continuous Optimization is the annual event of the EUROPT continuous optimization working group of EURO (The Association of European Operational Research Societies). This 15th edition will take place in Montreal just before the 21st IFORS conference that will be held in Quebec City.
The workshop will take place during Montreal's 375th anniversary celebrations. Activities and special events are advertised at http://www.375mtl.com/en <http://www.375mtl.com/en/.>
Plenary Speakers
* Shabbir Ahmed (Georgia Institute of Technology, U.S.A.)
* Timothy C.Y. Chan (University of Toronto, Canada)
* Francisco Facchinei (University of Rome La Sapienza, Italy)
Special Sessions In Memoriam
The scientific program will include special sessions in memory of Jonathan M. Borwein, Roger Fletcher, and Christodoulos A. Floudas.
Abstract Submission is online and is already open at https://symposia.gerad.ca/europt2017/en/submit
Important Dates:
Abstract submission deadline: March 15, 2017
Abstract acceptance: March 31, 2017
Early bird registration deadline: May 1st, 2017
Please see the workshop webpage https://www.gerad.ca/colloques/europt2017/ for more information.
We look forward to seeing you in Montreal next year!
Sébastien Le Digabel, Miguel Anjos, Fabian Bastin and Andrea Lodi, organizers
------------------------------
Message: 4
Date: Sun, 20 Nov 2016 11:48:16 +0100
From: Danupon Nanongkai <danupon@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc and PhD positions in "Distributed and
Dynamic Graph Algorithms and Complexity" at KTH, Sweden
Message-ID:
<CAMmtLngiWqm9Q+3u1F1ua6=S8k7Y4KpiteAnDeV8xKwdJYhyAg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Applications are invited for Postdoc and PhD positions in the group of
Danupon
Nanongkai at the Theoretical Computer Science department, KTH Royal
Institute of Technology, Stockholm, Sweden. We are looking for people who
want to work on one or more aspects of the project "Distributed and Dynamic
Graph Algorithms and Complexity", supported by the ERC starting grant and
the Swedish Research Council grant.
Candidates who have strong interests in exploring the impact of the
following techniques in the fields of distributed and dynamic graph
algorithms are especially desired: (i) algebraic techniques (e.g. fast
algorithms for matrix multiplication and computing ranks), (ii) spectral
techniques (e.g. fast algorithms for computing maximum flow, sparsest cut,
and tree embedding), (iii) communication complexity, (iv) fine-grained
complexity.
For more information and how to apply, please visit
https://sites.google.com/site/dannanongkai/vacancies.
------------------------------
Message: 5
Date: Mon, 21 Nov 2016 14:28:38 +0200
From: Stavros Kolliopoulos <sgk@di.uoa.gr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] faculty position in Athens, Greece (last call)
Message-ID: <51EAC2D3-13FA-40C6-8A32-D7F5F1A41C5D@di.uoa.gr>
Content-Type: text/plain; charset=us-ascii
The Department of Informatics and Telecommunications at the National
and Kapodistrian University of Athens has an opening for a
tenure-track faculty position in "Algorithms and Complexity", at the
rank of Assistant Professor. Candidates must have established a strong
theory research record and demonstrate a clear potential for further
academic advancement. The language of instruction in the department is
Greek.
The hard deadline for applying is December 12, 2016. Details for
the application procedure can be found here (in Greek):
http://www.di.uoa.gr/announcements/faculty/1883
Further enquiries may be directed to Stavros Kolliopoulos
(sgk@di.uoa.gr).
------------------------------
Message: 6
Date: Mon, 21 Nov 2016 15:30:47 +0100
From: Daniel Borchmann <daniel.borchmann@tu-dresden.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd CfP: ICFCA'17 — 14th International Conference
on Formal Concept Analysis
Message-ID: <87twb09a7c.fsf@tu-dresden.de>
Content-Type: text/plain; charset=utf-8
================================================================================
ICFCA 2017
14th International Conference on Formal Concept Analysis
June 12—16, 2017, Rennes, France
Web: <http://icfca2017.irisa.fr/>
Mail: icfca2017@inria.fr
================================================================================
* Overview
Formal Concept Analysis emerged in the 1980's from attempts to restructure
lattice theory in order to promote better communication between lattice
theorists and potential users of lattice theory. Since its early years, Formal
Concept Analysis has developed into a research field in its own right with a
thriving theoretical community and a rapidly expanding range of applications in
information and knowledge processing including visualization, data analysis
(mining) and knowledge management and discovery.
The ICFCA conference series aims at bringing together researchers and
practitioners working on theoretical or applied aspects of Formal Concept
Analysis within major related areas such as Mathematics and Computer and
Information Sciences and their diverse applications to fields like Software
Engineering, Linguistics, Life and Social Sciences, etc.
All accepted submissions will be refereed, and the conference proceedings will
be published by Springer in the LNCS/LNAI series.
* Topics
Main topics of interest include, but are not limited to:
** Fundamental aspects of FCA
- FCA theory
- Lattice theory
- Lattice drawing
- Philosophical foundations
- Algorithms and complexity theory
** Bridging FCA to information sciences and artificial intelligence
- FCA and logic, e.g., semantic web, description logics
- FCA and conceptual structures, e.g., concept graphs, knowledge spaces
- FCA and data analysis, e.g., hierarchical classification, data organization
- FCA and data mining, e.g., pattern mining
- FCA and information retrieval, e.g. exploratory search, navigation, querying
- FCA and machine learning, e.g., learning with hypothesis, feature selection
- FCA and database theory, e.g., dependencies, rules, data cubes
- FCA and software engineering
- FCA and morphological mathematics
** Understanding, modelling real-world data and phenomena with FCA
- Analysis of "big data" with FCA, e.g., sampling, parallel computing
- Analysis of social networks and their dynamics
- Applications for scientific data analysis, e.g., in biology or health care
- Applications for sensors data and user interactions traces
- Other FCA applications
* Submission Details
We invite scientific publications on theory and applications of Formal Concept
Analysis. Papers of up to sixteen pages may be submitted in the PDF format via
the Easychair system
<https://easychair.org/conferences/?conf=icfca2017>.
Authors are requested to follow the formatting instructions for the Springer
LNCS style.[1] Submissions in LaTeX2e are preferred. Authors are encouraged to
provide an ORCID alongside their submission.[2]
Accepted papers have to be presented at the conference. Therefore, at least one
author per paper has to register timely.
[1]: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines
[2]: https://www.springer.com/gp/authors-editors/orcid
* Important Dates
Submission of abstract: December 12, 2016
Submission of full paper: December 19, 2016
Notification of acceptance: February 6, 2017
Camera ready due: February 27, 2017
Conference: June 12—16, 2017
* Organization
The conference will be hosted by IRISA[3] and Centre de Recherche Inria Bretagne
Atlantique[4].
[3]: https://www.irisa.fr/en
[4]: https://www.inria.fr/centre/rennes
** Conference Chairs
Peggy Cellier, IRISA, INSA Rennes, France
Sébastien Ferré, IRISA, University Rennes 1, France
** Program Chairs
Karell Bertet, L3I, Université de La Rochelle, France
Daniel Borchmann, Technische Universität Dresden, Germany
** Editorial Board
Jaume Baixeries, Polytechnic University of Catalonia, Catalonia
Peggy Cellier, IRISA lab, Rennes, France
Florent Domenach, Akita International University, Japan
Peter Eklund, IT University of Copenhagen, Denmark
Sebastien Ferré, Université de Rennes 1, France
Bernhard Ganter, Technische Universität Dresden, Germany
Cynthia Vera Glodeanu
Mehdi Kaytoue, INSA-Lyon, LIRIS, France
Sergei Kuznetsov, Higher School of Economics, Moscow, Russia
Leonard Kwuida, Bern University of Applied Sciences
Rokia Missaoui, Université du Québec en Outaouais (UQO), Canada
Amedeo Napoli, LORIA, Nancy, France
Sergei Obiedkov, Higher School of Economics, Moscow, Russia
Manuel Ojeda-Aciego, University of Malaga, Spain
Uta Priss, Ostfalia University of Applied Sciences, Wolfenbüttel, Germany
Sebastian Rudolph, Technische Universität Dresden, Germany
Christian Sacarea, Babes-Bolyai University of Cluj-Napoca, Romania
Stefan E. Schmidt, Technische Universität Dresden, Germany
Gerd Stumme, Universität Kassel, Germany
Petko Valtchev, Université du Québec à Montréal, Canada
Karl Erich Wolff, University of Applied Sciences, Darmstadt, Germany
** Honorary Members
Vincent Duquenne, ECP6-CNRS, Université Paris 6, France
Rudolf Wille, Technische Universität Darmstadt, Germany
** Program Committee
Simon Andrews, Sheffield Hallam University, United Kingdom
François Brucker, Centrale Marseille, France
Claudio Carpineto, Fondazione Ugo Bordoni, Italy
Pablo Cordero, University of Málaga, Spain
Jean Diatta, Université de la Réunion, France
Felix Distel, d-fine GmbH, Germany
Christophe Demko, L3I lab, Université de La Rochelle, France
Stephan Doerfel, MICROMATA GmbH, Germany
Alain Gély, Université Paul Verlaine, Metz, France
Robert Godin, Université du Québec à Montréal, Canada
Marianne Huchard, LIRMM, Université Montpellier, France
Dmitry Ignatov, Higher School of Economics, Moscow, Russia
Robert Jäschke, University of Sheffield, England
Michal Krupka, Palacky University, Olomouc, Czech Republic
Marzena Kryszkiewicz, Warsaw University of Technology, Poland
Wilfried Lex, Universität Clausthal, Germany
Jesús Medina, Cadiz University, Spain
Engelbert Mephu Nguifo, LIMOS, Université de Clermont Ferrand 2, France
Lhouari Nourine, LIMOS, Université de Clermont Ferrand 2, France
Jan Outrata, Palacky University of Olomouc, Czech Republic
Jean-Marc Petit, LIRIS, INSA Lyon, France
Sandor Radeleczki, University of Miskolc, Hungary
Barış Sertkaya, Frankfurt University of Applied Sciences
Laszlo Szathmary, University of Debrecen, Hungary
Andreja Tepavčević, University of Novi Sad, Serbia
Jean-François Viaud, L3I lab, Université de La Rochelle, France
--
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Dr. rer. nat. Daniel Borchmann
Postdoctoral Research Associate
Technische Universität Dresden
Fakultät Informatik
Institut für Theoretische Informatik
Lehrstuhl für Automatentheorie
01062 Dresden
Tel.: +49 351 463-38351
E-Mail: daniel.borchmann@tu-dresden.de
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
------------------------------
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 105, Issue 20
***************************************
No comments:
Post a Comment