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. MATCOS:: CFP - deadline extension!!! (Andrej (Andy) Brodnik)
2. Assistant professor position at CSI of Charles University in
Prague (Jiri Sgall)
3. Postdoc mathematical optimization Tartu (Estonia) (Ah Bee)
4. Workshop, fast abstract, posters in conjunction with IEEE
PRDC 2017 in Christchurch, New Zealand (葛萌萌)
5. MSRI semester in "Geometric and Topological
Combinatorics" (Santos Leal, Francisco)
----------------------------------------------------------------------
Message: 1
Date: Sat, 6 Aug 2016 12:06:17 +0200
From: "Andrej (Andy) Brodnik" <andrej.brodnik@fri.uni-lj.si>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] MATCOS:: CFP - deadline extension!!!
Message-ID: <57A5B699.7070205@fri.uni-lj.si>
Content-Type: text/plain; charset="utf-8"; format=flowed
Hi there,
there were a number of requests to extend the deadline due to the Summer
time. Please, look at the CFP and consider submitting the paper!
All the best and LPA
PS: And sorry for X-posting.
-----------
Call for Papers
Middle-European Conference on Applied Theoretical Computer Science
(MATCOS-16)
*** EXTENDED DEADLINE ***
Koper, Slovenia, October 12th and 13th, 2016.
http://matcos.iam.upr.si
Held in conjunction with the 19th Multi-Conference on Information
Society, October 10-14, 2016, Ljubljana, Slovenia. (http://is.ijs.si)
Scope and Topics
----------------
During the past years, other fields have used several subjects,
methods and approaches of Theoretical Computer Science, and several
results have been integrated into practical applications. Solutions
for NP-hard problems, algorithmic-oriented AI and data mining
procedures, new models and methods in system biology and
bioinformatics, automata theory approaches in software and hardware
verification, prospective new models of computation and future
computer architecture are good examples to buttress the above
statement.
We set double aims as the scope of this conference: on one hand side
we expect ideas and solutions from the field of Theoretical Computer
Science which have been directly applied in real world
applications. On the other side we want to collect theoretical results
based on some fruitful idea that may be useful to adopt for practical
problems.
Suggested, but not exclusive, topics of interest include:
- Automata and formal languages, computability,
- Algorithms and data structures,
- Computational complexity,
- Artificial intelligence, machine learning,
- Optimization, approximation methods, NP-hard problems,
- Graph theory,
- Computational geometry.
There is a special emphasis on use in applications such as simulation,
bioinformatics, digital signal and image processing, data compression,
logistics etc.
Program Committee
-----------------
Jacek Blazevicz (Poznan, Poland)
Andrej Brodnik (Koper, Ljubljana, Slovenia) co-chair
Angel Corberan (Valencia, Spain)
Ruben Dorado Vicente (Jaén, Spain)
Elena Fernandez (Barcelona, Spain)
Gábor Galambos (Szeged, Hungary) co-chair
Gabriel Istrate (Timisoara, Romania)
Miklós Krész (Szeged, Hungary)
Silvano Martello (Bologna, Italy)
Benedek Nagy (Famagusta, Cyprus, Turkey)
Gerhard Reinelt (Heidelberg, Germany)
Giovanni Rinaldi (Rome, Italy)
Borut Žalik (Maribor, Slovenia)
Keynote speaker
---------------
Sándor Fekete, TU Braunschweig, Germany
Paper submission
----------------
Papers presenting original research in conference topics are being
sought. Papers must be in English and provide sufficient details to
allow the program committee to assess their merits. Submissions are
limited to 4 pages sharp and will be published in an Information
Society multiconference proceeding.
Revised and extended versions of selected papers will appear in a
special issue of the journal Informatica (http://www.informatica.si/).
Instructions for preparing the papers can be downloaded from
Conference Website.
Only electronic submissions will be accepted (in pdf format), via
EasyChair:
https://easychair.org/conferences/?conf=matcos2016
Important dates
---------------
Paper submission: August 29th, 2016. (*** EXTENDED ***)
Notification: September 15th, 2016.
Website and Contacts
--------------------
More detailed on-line information is at http://matcos.iam.upr.si.
Personal inquires should be sent to matcos16@iam.upr.si.
Organized by University of Primorska, Institute Andrej Marušič, and
Faculty of Mathematics, Natural Sciences and Information Technologies.
--
Andrej (Andy) Brodnik
University of Ljubljana
Faculty of Computer and Information Science
------------------------------
Message: 2
Date: Sat, 6 Aug 2016 21:28:20 +0200 (CEST)
From: Jiri Sgall <sgall@iuuk.mff.cuni.cz>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Assistant professor position at CSI of Charles
University in Prague
Message-ID:
<alpine.DEB.2.11.1608062121010.67056@turing.kam.mff.cuni.cz>
Content-Type: TEXT/PLAIN; format=flowed; charset=US-ASCII
Assistant professor position
Computer Science Institute of Charles University
Prague, Czech Republic
Applications are invited for a 3-year position as Assistant Professor in
Computer Science in the area of Theoretical Computer Science and Discrete
Mathematics at the Computer Science Institute (CSI), Faculty of
Mathematics and Physics, Charles University in Prague, Czech Republic.
The expected starting date is between December 1, 2016, and February 1,
2017, and is negotiable.
The institute is looking for candidates that would strengthen and/or
complement existing research areas in the group, such as structural graph
theory, computational complexity or approximation algorithms. Strong
candidates from all areas of theoretical computer science and discrete
mathematics will be considered. For further information about the research
group see the webpages of CSI and the closely related Department of
Applied Mathematics at http://iuuk.mff.cuni.cz/ and
http://kam.mff.cuni.cz/. Informal inquiries are welcome and may be sent to
Prof. Jiri Sgall <sgall@iuuk.mff.cuni.cz>.
A successful candidate is expected to pursue an active research program,
teach advanced and introductory classes and possibly supervise
undergraduate and graduate students. Candidates are expected to have a
proven international research record and postdoctoral experience. A PhD in
computer science, discrete mathematics or a closely related field is
required. Knowledge of the Czech language is advantageous; the candidate
is expected to be able to teach in Czech after the first year of
employment.
The contract duration is three years. Potentially, the position is
renewable; also a habilitation (associate professor promotion) and a
permanent position is a possibility (subject to a separate review
process).
A signed application in paper form, accompanied by a curriculum vitae, a
proof of education, a list of publications, and a description of
pedagogical experience should be sent to the Personnel Department of MFF,
Ke Karlovu 3, CZ-12116 Praha 2, by
*** September 30, 2016. ***
The candidate should also arrange for two letters of recommendation to be
sent directly to the director of CSI Prof. Jiri Sgall
<sgall@iuuk.mff.cuni.cz>.
Shortlisted candidates will be invited for an interview in October.
------------------------------
Message: 3
Date: Sun, 7 Aug 2016 14:41:03 +0900
From: Ah Bee <dotjimdot@gmail.com>
To: dmanet <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] Postdoc mathematical optimization Tartu (Estonia)
Message-ID:
<CAMRWt11YtUpLPmSDp59L_Uf=Vmdrajm7JCRwa011v1RssD3=2Q@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
The Algorithms & Theory group at the Computer Science Institute of the
University of Tartu, Estonia, is looking for candidates for a
2-year Postdoc in Mathematical Optimization.
The project involves theoretical (proving theorems!!) and practical
(writing code) work in applying convex, semidefinite, and linear
programming to a group of problems which are of interest in Data
Mining and Computational Biology, among others. Ultimately, the nature
of the problems is combinatorial, so there are connections to
SDP/LP-based approximation algorithms.
Your Qualifications
===================
* PhD in Math or CS.
* PhD less than 5 years ago.
* Publications in top journals (Math.Prog., SIAM J.Opt, ...)
* Skills and strong interest in Theory, i.e., proving theorems.
* Background in combinatorial optimization (approximation algorithms)
is welcome!
* Fluency in English is required.
Remuneration
============
* Salary after tax: up to Euro 1700 (negotiable)
* Health insurance (w/o dental) included
* Relocation support (~ Euro 6500)
[Average after tax income in Estonia is ~ Euro 930
(https://www.stat.ee/277448; or Google average net income Estonia), so
Euro 1700 in Estonia means much more relative wealth than, say, Euro
2200 in Germany.]
Your Duties
===========
* Conduct research within the project
* Develop an independent research profile
* Co-supervise PhD students
* Supervise Master Students
* Teaching: 90 minutes per term week (classroom time, negotiable)
The Work Place
==============
The CS Institute
* English is the working language in the CS institute.
* All teaching on graduate level is in English.
* A large portion of the faculty are expats.
* Strong research focus.
The University
* See QS university overview:
www.topuniversities.com/universities/university-tartu .
Tartu
* Picturesque student city (= cafes, bars, restaurants, nightlife,
tons of exchange students), with ~100,000 inhabitants + ~17,000
students.
* Home to the region's most venerable university.
* Climate:
5 months party in the streets (summer)
5 months party in the sauna (winter).
* www.lonelyplanet.com/estonia/southeastern-estonia/tartu .
Estonia
* Eurozone since 2011
* Bustling economy
* Language similar to Finnish...
* ...no need to learn it though: English works everywhere.
How To Apply
============
If you are interested, please send your informal inquiries to:
Dr. rer.nat. habil. Dirk Oliver Theis
Associate Professor
dotheis [at] ut [dot] ee
Do this as soon as possible. The funding for the position is
competitive, and requires that we submit the candidate's application
data together with the description of his research plan by the end of
August. The sooner you contact us, the better we can fine-tune the
material.
------------------------------
Message: 4
Date: Mon, 8 Aug 2016 16:32:34 +1200
From: 葛萌萌 <gmmcrystal@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Workshop, fast abstract, posters in conjunction with
IEEE PRDC 2017 in Christchurch, New Zealand
Message-ID:
<CAHM6UR0trGUW7pVtPHNy=2b7LY7K0cX1U6wgH8qAdZErS5sJGw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
CALL FOR PAPERS for the Workshop, fast abstract, poster and industry track.
********************************************************************************
The 22nd IEEE Pacific Rim International Symposium on Dependable Computing
(PRDC 2017)
Christchurch, New Zealand
January 22-25, 2017
http://prdc.dependability.org/PRDC2017/
********************************************************************************
Selected papers, after further revisions, will be published in several SCI
& EI indexed special issues:
(1) Future Generation Computer Systems - Elsevier (SCI&EI Indexed, Impact
Factor: 2.639) (confirmed)
http://www.journals.elsevier.com/future-generation-computer-systems/
(2) Elsevier Journal of Network and Computer Applications (SCI&EI Indexed,
Impact Factor: 2.33) (pending)
http://www.journals.elsevier.com/journal-of-network-and-computer-applications/
(3) IEEE Internet of Things Journal (SCI&EI Indexed) (pending)
http://iot-journal.weebly.com/
IEEE PRDC 2017 is the twenty-second event in the series of symposia started
in 1989 that are devoted
to dependable and fault-tolerant computing. PRDC is recognized as the main
event in the Pacific area
that covers many dimensions of dependability and fault tolerance,
encompassing fundamental theoretical
approaches, practical experimental projects, and commercial components and
systems. As applications
of computing systems have permeated into all aspects of daily life, the
dependability of computing system
has become increasingly critical. This symposium provides a forum for
countries around the Pacific Rim and
other areas of the world to exchange ideas for improving the dependability
of computing systems.
"Christchurch City is alive with colour, atmosphere and world-class
attractions,
including the International Antarctic Centre, Orana Park and Willowbank
Wildlife Park.
Christchurch is known internationally as the "Garden City" because of its
spectacular gardens.
Christchurch is also home to a number of excellent cafes, bars and
restaurants.
Many popular destinations such as Kaikoura, Akaroa, Mt Hutt and South
Canterbury are less than two hours drive from Christchurch."
(from NZ tourism guide, http://www.tourism.net.nz/region/christchurch)
Topics of interest include (but not limited to):
- Architecture and System Design for Dependability
- Dependability issues in Computer Networks and the Internet
- Dependability issues in Parallel and Distributed Systems
- Dependability issues in Real-time Systems
- Dependability issues in Databases and Transaction Processing Systems
- Dependability issues in Autonomic Computing
- Dependability Issues in Cloud Computing
- Dependability issues in Cyber-Physical Systems
- Dependability issues in Socio-Technical Systems
- Dependability Measurement, Modeling, Evaluation, and Tools
- Cloud Computing Security and Privacy
- Internet of Things Architectures and Protocols
- Internet of Things Security
- Fault-tolerant Algorithms and Protocols
- Software Defined Networks Architectures and Protocols
- Software and Hardware Reliability
- Self-healing, Self-protecting, and Fault-tolerant Systems
- Safety-Critical Systems and Software
- Reliability in Web Systems and Applications
Paper Submissions and Important Dates
Call for workshop Submissions
The First International Workshop on Frontiers in Dependable Computing (FDC
2017)
The submission deadline is September 28, 2016.
http://prdc.dependability.org/PRDC2017/cfw.html
Call for Industry Track Submissions
The Industry Track provides a forum for researchers and practitioners to
present and debate R&D challenges,
practical solutions, case studies, and share field reliability data.
Industry Track submissions should be
a maximum of 6 pages using IEEE format guidelines.
The submission deadline is September 28, 2016.
Call for Fast Abstracts
Fast Abstracts are lightly-reviewed 2-page manuscripts in IEEE format
describing unpublished,
in-progress, novel work, opinions or ideas.
The submission deadline is September 28, 2016.
Call for Posters
The Poster Session provides a forum to present and discuss
works-in-progress with topics related to dependable systems.
A poster paper should use the same format as a regular paper but with a
maximum of 2 pages.
The submission Deadline is September 28, 2016.
General Chair:
Dong Seong Kim, U. of Canterbury, New Zealand
Program Co-Chairs:
Masato Kitakami, Chiba U., Japan
Vijay Varadharajan, Macquarie U., Australia
Fast Abstract Chair:
Paulo R. M. Maciel, Federal U. of Pernambuco , Brazil
Industry Track Chair:
Fumio Machida, NEC, Japan
Poster Chair:
Matthias Galster, U. of Canterbury, New Zealand
Publicity Co-Chairs:
Tatsuhiro Tsuchiya, Osaka University, Japan
Javier Alonso, University of Leon, Spain
Steering Committee:
Yennun Huang, Academia Sinica, Taiwan (Chair)
Leon Alkalai, California Institute of Tech., USA
Takashi Nanya, U of Tyoko, Japan
------------------------------
Message: 5
Date: Mon, 8 Aug 2016 09:33:10 +0000
From: "Santos Leal, Francisco" <francisco.santos@unican.es>
To: "<dmanet@zpr.uni-koeln.de>" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] MSRI semester in "Geometric and Topological
Combinatorics"
Message-ID: <55898B53-5143-4114-9CC8-D02537563588@unican.es>
Content-Type: text/plain; charset="Windows-1252"
MSRI semester in "Geometric and Topological Combinatorics"
August 14, 2017 to December 15, 2017.
http://www.msri.org/programs/309
Application period is now open. See details below.
Description
-----------
Combinatorics is one of the fastest growing areas in contemporary Mathematics, and much of this growth is due to the connections and interactions with other areas of Mathematics. This program is devoted to the very vibrant and active area of interaction between Combinatorics with Geometry and Topology. That is, we focus on (1) the study of the combinatorial properties or structure of geometric and topological objects and (2) the development of geometric and topological techniques to answer combinatorial problems.
Key examples of geometric objects with intricate combinatorial structure are point configurations and matroids, hyperplane and subspace arrangements, polytopes and polyhedra, lattices, convex bodies, and sphere packings. Examples of topology in action answering combinatorial challenges are the by now classical Lovász's solution of the Kneser conjecture, which yielded functorial approaches to graph coloring, and the more recent, extensive topological machinery leading to breakthroughs on Tverberg-type problems.
As specific topics that should be addressed during the semester we include the following:
1. Combinatorics of polytopes and cell complexes.
2. Topological methods in combinatorics and discrete geometry
3. Geometric combinatorics in optimization and mathematical economics
4. Algebraic and algebro-geometric methods.
Workshops
---------
Connections for Women Workshop: Geometric and Topological Combinatorics, August 31, 2017 - September 01, 2017
Introductory Workshop: Geometric and Topological Combinatorics, September 05, 2017 - September 08, 2017
Geometric and Topological Combinatorics: Modern Techniques and Methods, October 09, 2017 - October 13, 2017
Organizers
----------
Jesus A. De Loera (University of California, Davis),
Vic Reiner (University of Minnesota Twin Cities),
Francisco Santos (University of Cantabria),
Francis Su (Harvey Mudd College),
Rekha Thomas (University of Washington),
Günter M. Ziegler (Freie Universität Berlin)
Application
-----------
Interested researchers can apply to participate in the program in one of the following three categories. See http://www.msri.org/web/msri/scientific/member-application for more details.
1) Research professors: For mathematical scientists who are at the tenured associate professor or subsequent stages of their careers, and have received their PhD before the year 2007. They are expected to make key contributions to the program, including the mentoring of postdoctoral fellows. Normally, research professorships will be awarded to candidates who plan to be in residency for three or more months.
2) Research members: For researchers with a Ph. D., in any stage of their career. Research memberships may be offered with no support, with a travel allowance and/or with per diem support. It is expected that Research Members will visit MSRI with full or partial support from other sources. Research memberships are normally not offered for stays of less than one month.
3) Postdoctoral fellows: These awards provide support for five months. The fellowship stipend is currently $6,000 per month (plus a round-trip from your current institution, and some research travel money). Fellows must hold a Ph.D. in mathematics awarded on or after August 1, 2012. They must be in residence for the duration of the program.
Deadline for applications
-------------------------
For research professors: ** October 1st, 2016 **.
For research members and postdocs: December 1st, 2016.
--
Francisco Santos, francisco.santos@unican.es
Departamento de Matematicas, Estadistica y Computacion
Universidad de Cantabria, E-39005 Santander, SPAIN.
Phone: +34-942-201522 - Fax: +34-942-201402
http://personales.unican.es/santosf
------------------------------
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 102, Issue 7
**************************************
No comments:
Post a Comment