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 position on Algorithms in Bioinformatics
(Gianluca Della Vedova)
2. IEEE-ICDIPC2016== Submission Deadline has been EXTENDED to
April 6, 2016! (Lubna Kanan)
3. CCA 2016 (Computability and Complexity in Analysis) Call for
abstracts (Akitoshi Kawamura)
4. 2 assistant-professor positions Applied Geometric Algorithms
at TU Eindhoven (Bettina Speckmann)
5. 4-year Postdoc Position at the University of Vienna
(Monika Henzinger)
6. PhD position in Operations research available at INRIA Lille
(France) (INOCS Team) (Frederic Semet)
----------------------------------------------------------------------
Message: 1
Date: Fri, 11 Mar 2016 18:45:21 +0100
From: Gianluca Della Vedova <gianluca.dellavedova@unimib.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc position on Algorithms in Bioinformatics
Message-ID:
<CAPBr-woSEjbSZPSncF39nqQ7FMA4gBGm7kf8yNpjci2WtxkPfg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
A 1-year postdoc position is available at the Department of Computer
Science of the
University of Milano-Bicocca, starting from June 1st 2016.
The position is within the Experimental Algorithmics research group
focusing on efficient
algorithms in Bioinformatics, especially on NGS data. The position is
funded on joint
project with the National Institute of Molecular Genetics.
We are looking for a postdoc with experience in developing and implementing
algorithms for
indexing, querying, or analyzing genomic and transcriptomics data.
The salary is competitive and negotiable (depending on the applicant's
qualifications).
If you are interested, send a declaration of interest and a CV to Paola
Bonizzoni
(bonizzoni@disco.unimib.it) and Gianluca Della Vedova (
gianluca.dellavedova@unimib.it) by
March 18th.
For more information on the position, please contact Paola Bonizzoni
(bonizzoni@disco.unimib.it) and Gianluca Della Vedova (
gianluca.dellavedova@unimib.it).
--
Paola Bonizzoni, Professor
Department of Computer Science
Univ. Milano-Bicocca
www.algolab.eu/bonizzoni
------------------------------
Message: 2
Date: Mon, 14 Mar 2016 01:03:33 +0000 (UTC)
From: Lubna Kanan <lubna.sdiwc@yahoo.com>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] IEEE-ICDIPC2016== Submission Deadline has been
EXTENDED to April 6, 2016!
Message-ID:
<651890416.823569.1457917413971.JavaMail.yahoo@mail.yahoo.com>
Content-Type: text/plain; charset=UTF-8
====
The Sixth International Conference on Digital Information
Processing and Communications (ICDIPC2016)
April 21-23, 2016 - Beirut, Lebanon
http://sdiwc.net/conferences/icdipc2016/
icdipc16@sdiwc.net
= = = = = = = = = = = = = = = = = = = = =
*** You are invited to submit papers to this exciting event! ***
= = = = = = = = = = = = = = = = = = = = =
** IMPORTANT DATES **
Submission Deadline: April 6, 2016
Notification of Acceptance: April 8, 2016
Camera Ready Submission: Open from now until April 11, 2016 (Last day for CR Submission)
Registration Date: Open from now until April 11, 2016 (Last day for CR Submission)
==========
*** Looking forward to welcoming you to Beirut in April 2016!***
==========
k
------------------------------
Message: 3
Date: Mon, 14 Mar 2016 15:43:08 +0900
From: Akitoshi Kawamura <kawamura@graco.c.u-tokyo.ac.jp>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CCA 2016 (Computability and Complexity in Analysis)
Call for abstracts
Message-ID: <56E65D7C.4060903@graco.c.u-tokyo.ac.jp>
Content-Type: text/plain; charset=utf-8
Dear colleagues,
Due to some requests, the deadline for CCA 2016 submission is extended
to March 28.
______________________________________________________________
Final Call for Papers
Thirteenth International Conference on
Computability and Complexity in Analysis (CCA 2016)
http://cca-net.de/cca2016/
June 15-17, 2016, Faro, Portugal
Abstract submission deadline: March 28, 2016
______________________________________________________________
Topics
* Computable analysis
* Complexity on real numbers
* Constructive analysis
* Domain theory and analysis
* Theory of representations
* Computable numbers, subsets and functions
* Randomness and computable measure theory
* Models of computability on real numbers
* Realizability theory and analysis
* Reverse analysis
* Real number algorithms
* Implementation of exact real number arithmetic
Invited Speakers
* Andrej Bauer (Ljubljana, Slovenia)
* Toby Cubitt (UCL, London, UK)
* Gilda Ferreira (Lisbon, Portugal)
* Vassilis Gregoriades (Turin, Italy)
* Kenshi Miyabe (Kawasaki, Japan)
* Norbert Müller (Trier, Germany)
Scientific Programme Committee
* Matthew de Brecht (Osaka, Japan)
* Fernando Ferreira (Lisbon, Portugal)
* Sicun Gao (Cambridge, USA)
* Mathieu Hoyrup (Nancy, France)
* Akitoshi Kawamura, chair (Tokyo, Japan)
* Bob Lubarsky (Boca Raton, USA)
* Elvira Mayordomo (Zaragoza, Spain)
* Robert Rettinger (Dortmund, Germany)
* Ning Zhong (Cincinnati, USA)
Organising Committee
* Daniel Graça, chair (Faro, Portugal)
* Rui Marreiros (Faro, Portugal)
Submissions
Authors are invited to submit 1-2 pages abstracts in PDF format,
including references via the following web page:
https://easychair.org/conferences/?conf=cca2016
If full versions of papers are already available as technical report
or arXiv version, then corresponding links should be added to the
reference list. Final versions of abstracts might be distributed to
participants in hardcopy and/or in electronic form.
Dates
* Submission deadline: March 28, 2016
* Notification of authors: April 16, 2016
* Final version: April 30, 2016
Conference Web Page
______________________________________________________________
------------------------------
Message: 4
Date: Mon, 14 Mar 2016 08:36:02 +0100
From: Bettina Speckmann <b.speckmann@tue.nl>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] 2 assistant-professor positions Applied Geometric
Algorithms at TU Eindhoven
Message-ID: <56E669E2.4030902@tue.nl>
Content-Type: text/plain; charset="utf-8"; format=flowed
The Department of Mathematics and Computer Science at TU Eindhoven has
two vacancies for assistant-professor positions in the group Applied
Geometric Algorithms, which is part of the section Algorithms and
Visualization. The Applied Geometric Algorithms group
(http://www.win.tue.nl/aga/) mainly focuses on (applications of)
geometric algorithms to spatial data in the areas of GIScience
(including automated cartography and moving object analysis),
geo-visualization, visual analytics, and e-humanities. The Applied
Geometric Algorithms group has recently been founded and currently
consists of one professor, one assistant professor, one postdoc, and
five PhD students.
As a prospective candidate you have expertise and experience in
scientific research and education in (geometric) algorithms. The
research of the group encompasses both algorithmic theory and efficient
engineering to achieve results of theoretical and practical
significance. Candidates who can further strengthen the connections of
the group to various aspects of Data Science, Topology, Statistics, or
Human Computer Interaction, are particularly encouraged to apply. It is
expected that the new assistant professors will develop a vigorous
research program, supervise graduate students, be committed to teaching
at different levels, and attract research funding.
The ideal candidate is an expert in (applied) algorithms research and
complements the existing strengths of the group and the section well. He
or she will develop an independent research line, is (or will become) an
inspiring teacher, and has a proactive attitude towards acquiring
research funding.
Tasks:
• Performing excellent research in the field of applied (geometric)
algorithms.
• Acquiring research funding and supervising PhD students.
• Developing and teaching courses.
• Supervising student projects, internships, and Master's theses.
• Performing organizational activities within the department.
Qualifications:
We are looking for candidates with a PhD in relevant areas of computer
science. We expect experience and excellence in scientific research, as
reflected in peer reviewed scientific publications. We are looking for
candidates with experience in and a passion for academic teaching. Our
ideal candidate has an enthusiastic, motivating, and inspiring
personality, likes taking initiatives, and has a proactive attitude.
Proficiency in written and verbal communication in English is a must.
We offer:
• A challenging job in a dynamic and ambitious university and a
stimulating research environment;
• Support with your professional and personal development;
• A gross salary between € 3.400 and € 4.654 per month depending on
experience and knowledge, plus 8% holiday allowance and 8.3% end-of-year
allowance;
• An extensive package of fringe benefits (e.g. support in moving
expenses and commuting expenses, excellent technical infrastructure,
on-campus child care, and excellent sports facilities).
The department has a policy to appoint all new assistant professors in
the Tenure-Track system. In this case an appointment will be made for
four years. An evaluation will take place after three years, to assess
whether you fulfill the assistant professor appointment criteria. If
this evaluation is positive, the employment contract will be converted
into a contract of employment for an indefinite period. The evaluation
criteria are fixed at the departmental level and are available upon request.
In the case of candidates who are clearly at a further stage in their
career, the department can also offer a tenured position from the start.
More information can be obtained from:
About the position:
prof.dr. Bettina Speckmann, e-mail: b.speckmann@tue.nl
About the employment conditions:
mr. Charl Kuiters, HR advisor, e-mail: pzwin@tue.nl.
-------------------- Deadline: April 24, 2016 --------------------
Application
The application should consist of the following parts:
• Cover letter explaining your motivation and qualifications for the
position;
• Detailed Curriculum Vitae (including a list of publications);
• Research statement;
• Teaching statement;
• Names of at least two referees.
Please apply via
http://jobs.tue.nl/en/vacancy/2-assistantprofessor-positions-applied-geometric-algorithms-256448.html
------------------------------
Message: 5
Date: Mon, 14 Mar 2016 09:53:23 +0100
From: Monika Henzinger <monika.henzinger@univie.ac.at>
To: dmANET@zpr.uni-koeln.de
Subject: [DMANET] 4-year Postdoc Position at the University of Vienna
Message-ID: <56E67C03.9010506@univie.ac.at>
Content-Type: text/plain; charset=utf-8; format=flowed
DEPARTMENTOFCOMPUTERSCIENCE UNIVERSITY OF VIENNA
POSTDOC POSITION IN ALGORITHMS
A PhD student position is available in the research group "Theory and
Applications of Algorithms" led by Professor Monika Henzinger. See
http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/
for more information on the research group.
The position is available starting September 1, 2016 (or later) and will be
of 4 years.See
https://univis.univie.ac.at/ausschreibungstellensuche/
(identifier 6495) for more details.
If you are interested, please send your application to
monika.henzinger@univie.ac.at
<https://webmail.univie.ac.at/src/compose.php?send_to=monika.henzinger%40univie.ac.at>
by March 27, 2016.
------------------------------
Message: 6
Date: Mon, 14 Mar 2016 10:25:26 +0100 (CET)
From: Frederic Semet <frederic.semet@ec-lille.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD position in Operations research available at
INRIA Lille (France) (INOCS Team)
Message-ID:
<4e118980-1e60-41e4-91f2-0d7393c61720@mailstore.priv.ec-lille.fr>
Content-Type: text/plain; charset=utf-8
A PhD position in Operations research is available at INRIA Lille (France) in the INOCS team :
https://team.inria.fr/inocs/
Title : Models and methods for decentralized decision in logistics networks
Keywords : Combinatorial Auctions, Integer Programming, Physical Internet
Co-supervisors : E. Ballot (Ecole des Mines de Paris), L. Brotcorne (INRIA)
Do not hesitate to contact Luce Brotcorne : luce.brotcorne@inria.fr
Description:
This Ph.D. research project consists in designing innovative logistics services based on the concept of physical internet
while taking into account environmental and economic objectives. More precisely, it aims to develop models and decision
making algorithms to design simultaneously several sustainable logistics and transportation chains between origins and d
estinations given a logistics and transportation network. This mesh network will result from information published by
logisticians and carriers from their networks, warehouses, line haul services, less-than-truckload services.
The problem of designing multimodal sustainable chains will be addressed in the case where
the system is shared between actors and decentralized . The shipper will specify the general framework
( potential multimodal platforms to be used ) and the origins and destinations of flows. Then, transportation companies
will put out their offers, which will be considered according to a combinatorial auction mechanism .
This will result in a shared logistics activity that optimizes the use of resources.
The objective of the first part of the thesis will be to define the mathematical models for the problems addressed. The task will be complex as
it is a decentralized approach. Models are required at the level of each partner (shipper, carrier or logistics service providers bidding and auction agents).
Foreseen models are based on: Offer of logistics services; Price determination model for buyers of logistics services;
Combinatorial auctions at the level of the auction agent for the "winner determination problem"; Game sharing solution,
Shapley value for example, to allocate gains resulting from auction between the vendor of the logistics service,
the buyer and the possible intermediate (cross-dock operations…).
The second part of the thesis will be devoted to the development of innovative optimization algorithms. The objective is to solve
the two mains and more complex models: the winner determination problem (allocation of a logistics service to a set of shipments)
and the sharing mechanism resulting of new allocation of services. These two problems are NP-hard problems in general.
Ad-hoc efficient methods based on mathematical programming will have to be developed.
Professor Frédéric Semet
INOCS Team - CRIStAL
Ecole Centrale de Lille
Phone: +33 (0)320 335 404
https://team.inria.fr/inocs/
------------------------------
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 97, Issue 15
**************************************
No comments:
Post a Comment