[CvGmt News] [Fwd: Lettre MODE (supplément )]

buttazzo at dm.unipi.it buttazzo at dm.unipi.it
Tue Dec 21 20:43:46 CET 2010


-------------------------- Messaggio originale ---------------------------
Oggetto: Lettre MODE (supplément)
Da:      "Thierry Champion" <champion at univ-tln.fr>
Data:    Mar, Dicembre 21, 2010 14:22
A:       lettre-mode-smai at emath.fr
--------------------------------------------------------------------------

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

Lettre MODE
fin décembre 2010

Envoyez vos contributions en format simple texte à
champion at univ-tln.fr avant la fin du mois.

Prière d'indiquer "pour la lettre MODE" dans l'objet.

L'inscription et la désinscription automatiques se font en écrivant à
lettre-mode-smai-request at emath.fr
et en mettant dans le sujet suivant le cas subscribe ou unsubscribe.

-------------------------------------------------------------
Table des matières

-- Postes
1- Research staff position in CASTLE Lab at Princeton University
2- CRM Junior visiting positions 2011-2012

-- Conférences
3- Final Call for Papers Workshop PCO'11
4- The Second World Congress on Global Optimization in Engineering & Science

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

1- Research staff position in CASTLE Lab at Princeton University
(source: F. Bonnans)


CASTLE Laboratory is looking to add to its research staff to solve
stochastic
optimization problems in energy systems analysis.  The appointment will be
made at the rank of Associate Professional Specialist, and requires
designing,
coding and testing algorithms, and working with research sponsors to meet
their needs.  We are looking for candidates with a Ph.D. in operations
research,
computer science, engineering systems or electrical engineering with strong
skills in mathematics and computer programming (our development is in Java).
Prior knowledge of stochastic optimization is desirable but not
necessary, but
we do expect strong training in probability, statistics and mathematical
programming.
The successful candidate will be expected to publish and present research
results in appropriate professional publications and venues. Strong oral and
written communication skills are a must, as well as an enthusiasm for
exciting
research.
CASTLE Lab (www.castlelab.princeton.edu
<http://www.castlelab.princeton.edu>) specializes in solving
high-dimensional
stochastic optimization problems.  We have a computer cluster with over 200
threads spread over 10 nodes.  The lab is currently supported by two
senior staff
members, 5-7 Ph.D. students and a host of undergraduates who participate
in our
energy and algorithmic research.  We maintain a strong record of
publications and
presentations in the major conferences.
Applications will be considered from the date of this announcement until
filled.
To apply, please visit our website at http://jobs.princeton.edu, create
an online
application, and submit a CV, cover letter, and contact information for
three
references to Requisition Number 1000960, or click on

https://jobs.princeton.edu/applicants/jsp/shared/position/JobDetails_css.jsp?postingId=178074


Princeton University is an equal opportunity employer and complies with
applicable
EEO and affirmative action regulations.



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

2- CRM Junior visiting positions 2011-2012
(source: M. Giaquinta)


The "Centro di Ricerca Matematica Ennio De Giorgi" invites applications
for the junior
visiting programme for 2011 to be performed in the academic year 2011-2012.

4 Junior Visiting positions are offered, each one carrying a salary of
 25.000 Euros per
year. An additional grant is also made available to invite other
researchers to work with.

The junior visitors can take part and benefit from all the scientific
activities carried out
at the Centre that include intensive periods, workshops, seminars, and
of the
interdisciplinary character of most of such activities. The contact with
international
visitors is also an opportunity.

Senior mathematicians that have prospective candidates are invited to
encourage them
to apply.

Full details about the Junior Visiting Programme 2011-2012 and the
application process
can be found at:

http://www.crm.sns.it (grants and open positions)

and at:
http://www.sns.it/it/borse/collaboratoriesterni/annoincorso/avviso122/ (in
Italian)

Please note that this year the application process will be handled by
the administration
of the Scuola Normale Superiore, so prospective candidates must submit
the application
form and related documents by e-mail to the following address:
job.opportunities at sns.it <mailto:job.opportunities at sns.it> .



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

3- Final Call for Papers Workshop PCO'11
(sources: D. Aussel)


Parallel Computing and Optimization

http://spiderman-2.laas.fr/PCO/

to be held in conjunction with IEEE IPDPS 2011, Anchorage USA, May
16-20, 2011

http://www.ipdps.org

Final Submission Deadline: December 22, 2010

Scope of the Workshop:

The workshop on new trends in Parallel Computing and Optimization aims
at providing a forum for scientific researchers
and engineers on recent advances in the field of parallel or distributed
computing for difficult combinatorial optimization
problems, like 0-1 multidimensional knapsack problems and cutting stock
problems, large scale linear programming
problems, nonlinear optimization problems and global optimization
problems. Emphasis will be placed on new techniques
for the solution of these difficult problems like cooperative methods
for integer programming problems and polynomial
optimization methods. Aspects related to Combinatorial Scientific
Computing (CSC) will be treated.
New trends in parallel computing like hybrid computing, peer to peer
computing and cloud computing
will be considered. Application to planning, logistics, manufacturing,
finance, telecommunications and computational biology
will be considered.

Topics:

* Integer programming, linear programming, nonlinear programming.
* Global optimization, polynomial optimization.
* Exact methods, heuristics
* Parallel algorithms for combinatorial optimization.
* Parallel metaheuristics.
* Distributed optimization algorithms.
* Graph partitioning, preconditioning, Combinatorial Scientific Computing,
* hybrid computing and the solution of optimization problems.
* Peer to peer computing and optimization problems.
* Applications: planning, logistics, manufacturing, finance,
telecommunications,
computational biology, combinatorial algorithms in high performance
computing.

Important Dates:

Paper submission deadline: December 22, 2010
Notification of acceptance: February 7, 2011
Camera ready papers due: February 21, 2011
Workshop: May 20, 2011

Submission Details:

Prospective authors should submit their papers through workshop PCO'11
submission system,
i.e. EDAS conference management service: http://edas.info/N9464
Please, follow the instructions given on the site. Abstract and paper
can be uploaded on December 22, 2010.
Authors should preferably follow the manuscript specifications of IEEE
IPDPS,
i.e. submitted manuscripts may not exceed 12 single-spaced double-column
pages using 10-point size font on 8.5x11 inch pages
(IEEE conference style), including figures, tables and references.
Style templates are available at the IPDPS 2011 web page:
http://www.ipdps.org/ipdps2011/2011_cfp.html

Chair: Dr Didier El Baz, LAAS-CNRS, France

Contact: elbaz at laas.fr
LAAS-CNRS
Toulouse, France



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

4- The Second World Congress on Global Optimization in Engineering & Science
(source: M. Théra)


July 3-7, 2011 Chania, Greee

http://www.ise.ufl.edu/cao/WCGO2011/WCGO2011/Welcome.html

The Second World Congress on Global Optimization in Engineering &
Science (WCGO-2011)
July 3-7, 2011 Chania, Greee
Organized by Panos M. Pardalos and Christodoulos A. Floudas



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

Thierry Champion
-- 
Laboratoire Imath -- Université du Sud Toulon-Var
page personnelle: http://champion.univ-tln.fr



More information about the News mailing list