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. Call for Papers: APPROX and RANDOM 2015 (Stefan Kraft)
2. 2nd Swedish Summer School in Computer Science (Jakob Nordstrom)
3. BigDat 2015: early registration deadline 23 January (GRLMC)
4. Research Associate in Combinatorics vacancy at the University
of Strathclyde, UK (Mark Dukes)
5. Postdoc position at KTH (deadline Jan 25) (Jakob Nordstrom)
6. Final CFP Ant Colony Optimization and Swarm Intelligence
Track (ACO-SI) @ GECCO 2015 (Manuel L?pez-Ib??ez)
----------------------------------------------------------------------
Message: 1
Date: Fri, 16 Jan 2015 16:59:19 +0100
From: Stefan Kraft <stkr@informatik.uni-kiel.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Papers: APPROX and RANDOM 2015
Message-ID: <54B93557.90809@informatik.uni-kiel.de>
Content-Type: text/plain; charset=utf-8
RANDOM 2015 The 19th International Workshop on
Randomization and Computation
and
APPROX 2015 The 18th International Workshop on
Approximation Algorithms for
Combinatorial Optimization Problems
http://cui.unige.ch/tcs/random-approx/
Aug. 24-26, 2015
Princeton University, New Jersey
CFP - Call for papers
SCOPE:
The 19th International Workshop on Randomization and Computation
(RANDOM 2015)
and
The 18th International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX 2015)
will be held on August 24 ? 26 , 2015 at Princeton University, New
Jersey.
RANDOM 2015 focuses on applications of randomness to computational
and combinatorial problems while APPROX 2015 focuses on algorithmic
and complexity theoretic issues relevant to the development of
efficient approximate solutions to computationally difficult problems.
TOPICS:
Papers are solicited in all research areas related to randomization
and approximation, including but not limited to:
RANDOM
- design and analysis of randomized algorithms
- randomized complexity theory
- pseudorandomness and derandomization
- random combinatorial structures
- random walks/Markov chains
- expander graphs and randomness extractors
- probabilistic proof systems
- random projections and embeddings
- error-correcting codes
- average-case analysis
- property testing
- computational learning theory
APPROX
- design and analysis of approximation algorithms
- hardness of approximation
- small space, sub-linear time and streaming algorithms
- embeddings and metric space methods
- mathematical programming methods
- combinatorial problems in graphs and networks
- algorithmic game theory and economics
- computational geometric problems
- approximate learning
- online algorithms
- approaches that go beyond worst case analysis
- and other applications
IMPORTANT DATES:
Submissions: April 17, 2015
Notifications: June 8, 2015
Camera ready: June 24, 2015
SUBMISSIONS:
Abstract Format: Electronic submissions are solicited. Please
consult the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx2015
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random2015
Note: You will be asked to login using an EasyChair account.
Directions on how to register for such an account are available at
the submission servers (you may also have an old account from a
previous conference submission).
The submission must be received by 17:00pm (PDT) of April 17 for your
submission to be considered.
Submission Format: Submissions should start with the title of the
paper, each author's name, affiliation, and e-mail address,
followed by a one-paragraph summary of the results to be presented.
This should then be followed by a technical exposition on single-
spaced pages on letter-size paper, using reasonable margins and at
least 11-point font. The first 10 pages should contain the main
ideas and techniques used to achieve the results including
motivation and a clear comparison with related work (not including
the references). There is no page limit but any material beyond the
first 10 pages will be read at the sole discretion of the program
committee. Simultaneous submission to other conferences with
published proceedings is not allowed.
PROCEEDINGS:
Accepted papers will be published in the online proceedings of the
conference in the Leibniz International Proceedings in Informatics
(LIPIcs) series, based at Schloss Dagstuhl. This guarantees
perennial, free and easy electronic access, while the authors
retain the rights over their work. Previous proceedings of APPROX
appeared as LNCS 1444, 1671, 1913, 2129, 2462, 2764, 3122, 3624,
4110 and 4627 while previous proceedings of RANDOM appeared as LNCS
1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624, 4110, 4627 and as
Proceedings in Informatics 8.
PROGRAM CHAIRS:
RANDOM
Anup Rao - University of Washington
email: anuprao@cs.washington.edu
APPROX
Naveen Garg - IIT, Delhi
email: naveen@cse.iitd.ac.in
WORKSHOP CHAIRS:
Jos? Rolim - University of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen - University of Kiel
e-mail: kj@informatik.uni-kiel.de
PROGRAM COMMITTEES:
RANDOM
Dimitris Achlioptas UC Santa Cruz
Alex Andoni Simons Institute for Theoretical Computer Science
Ken Clarkson IBM
Anindya De Institute for Advanced Study
Hu Fu Microsoft Research, New England
Nick Harvey UBC
Xin Li John Hopkins U
Aleksander Madry EPFL
Raghu Meka UCLA
Eric Price University of Texas
Aaron Roth UPENN
Mohit Singh Microsoft Research, Redmond
Ali Sinop Simons Institute for Theoretical Computer Science
Madhur Tulsiani TTI Chicago
David Woodruff IBM
Mary Wootters CMU
APPROX
Parinya Chalermsook MPII Saarbruecken
Michael Dinitz Johns Hopkins U.
Naveen Garg IIT Delhi
Fabrizio Grandoni IDSIA, U. of Lugano
Sungjin Im UC Merced
Amit Kumar IIT Delhi
Lap Chi Lau Chinese U. of Hong Kong
Nicole Megow TU Berlin
Harald Raecke TU Munich
Rishi Saket IBM IRL
Piotr Sankowski U. of Warsaw
Roy Schwartz Princeton
Rene Sitters VU Amsterdam
David Steurer Cornell
Chaitanya Swamy U. of Waterloo
Andreas Wiese MPII Saarbruecken
CONFERENCE WEB PAGE
http://cui.unige.ch/tcs/random-approx/
------------------------------
Message: 2
Date: Fri, 16 Jan 2015 23:10:16 +0100
From: "Jakob Nordstrom" <jakobn@kth.se>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd Swedish Summer School in Computer Science
Message-ID:
<07e07c6dc5e55aa6c7ec2854d8d76a74.squirrel@webmail.csc.kth.se>
Content-Type: text/plain;charset=utf-8
The 2nd Swedish Summer School in Computer Science (http://s3cs.csc.kth.se/)
will be held from June 28 to July 4, 2015, in the beautiful Stockholm
archipelago at Djuronaset (http://djuronaset.com/en/).
The school runs for a full week Monday-Friday at the beginning of July when
Sweden is at its loveliest, with arrival on Sunday evening and departure
Saturday morning. It consists of two mini-courses on "List decoding and polar
coding" by Venkatesan Guruswami and "Codes with local decoding procedures" by
Sergey Yekhanin.
The summer school is primarily intended for PhD students, but postdocs and
bright MSc students are also warmly welcome (and also faculty, subject to
availability of slots).
The application deadline is March 15, 2015. Please see http://s3cs.csc.kth.se/
for more information including instructions how to apply. Any questions can be
directed to s3cs-2015@csc.kth.se.
------------------------------
Message: 3
Date: Sat, 17 Jan 2015 16:08:31 +0100
From: "GRLMC" <grlmc@urv.cat>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] BigDat 2015: early registration deadline 23 January
Message-ID: <492A1C2198574980BA50336C872E7DCD@Carlos1>
Content-Type: text/plain; charset="iso-8859-1"
*****************************************************
INTERNATIONAL WINTER SCHOOL ON BIG DATA
BigDat 2015
Tarragona, Spain
January 26-30, 2015
Organized by
Rovira i Virgili University
http://grammars.grlmc.com/bigdat2015/
*****************************************************
--- Early registration deadline: January 23, 2015 ---
*****************************************************
AIM:
BigDat 2015 is a research training event for graduates and postgraduates in
the first steps of their academic career. It aims at updating them about the
most recent developments in the fast developing area of big data, which
covers a large spectrum of current exciting research, development and
innovation with an extraordinary potential for a huge impact on scientific
discoveries, medicine, engineering, business models, and society itself.
Renowned academics and industry pioneers will lecture and share their views
with the audience.
All big data subareas will be displayed, namely: foundations,
infrastructure, management, search and mining, security and privacy, and
applications. Main challenges of analytics, management and storage of big
data will be identified through 4 keynote lectures, 22 six-hour courses, and
1 round table, which will tackle the most lively and promising topics. The
organizers believe outstanding speakers will attract the brightest and most
motivated students. Interaction will be a main component of the event.
ADDRESSED TO:
Graduate and postgraduates from around the world. There are no formal
pre-requisites in terms of academic degrees. However, since there will be
differences in the course levels, specific knowledge background may be
required for some of them.
BigDat 2015 is also appropriate for more senior people who want to keep
themselves updated on recent developments and future trends. They will
surely find it fruitful to listen and discuss with major researchers,
industry leaders and innovators.
REGIME:
In addition to keynotes, 3 courses will run in parallel during the whole
event. Participants will be able to freely choose the courses they will be
willing to attend as well as to move from one to another.
VENUE:
BigDat 2015 will take place in Tarragona, located 90 kms. to the south of
Barcelona. The venue will be:
Campus Catalunya
Universitat Rovira i Virgili
Av. Catalunya, 35
43002 Tarragona
KEYNOTE SPEAKERS:
Ian Foster (Argonne National Laboratory), Taming Big Data: Accelerating
Discovery via Outsourcing and Automation
Geoffrey C. Fox (Indiana University, Bloomington), Mapping Big Data
Applications to Clouds and HPC
C. Lee Giles (Pennsylvania State University, University Park), Scholarly Big
Data: Information Extraction and Data Mining
William D. Gropp (University of Illinois, Urbana-Champaign), Using MPI I/O
for Big Data
COURSES AND PROFESSORS:
Hendrik Blockeel (KU Leuven), [intermediate] Decision Trees for Big Data
Analytics
Diego Calvanese (Free University of Bozen-Bolzano),
[introductory/intermediate] End-User Access to Big Data Using Ontologies
Jiannong Cao (Hong Kong Polytechnic University), [introductory/intermediate]
Programming with Big Data
Edward Y. Chang (HTC Corporation, New Taipei City), [introductory/advanced]
Big Data Analytics: Architectures, Algorithms, and Applications
Ernesto Damiani (University of Milan), [introductory/intermediate] Process
Discovery and Predictive Decision Making from Big Data Sets and Streams
Gautam Das (University of Texas, Arlington), [intermediate/advanced] Mining
Deep Web Repositories
Maarten de Rijke (University of Amsterdam), tba
Geoffrey C. Fox (Indiana University, Bloomington), [intermediate] Using
Software Defined Systems to Address Big Data Problems
Minos Garofalakis (Technical University of Crete, Chania)
[intermediate/advanced], Querying Continuous Data Streams
Vasant G. Honavar (Pennsylvania State University, University Park)
[introductory/intermediate], Learning Predictive Models from Big Data
Tao Li (Florida International University, Miami),
[introductory/intermediate] Data Mining Techniques to Understand Textual
Data
Kwan-Liu Ma (University of California, Davis), [intermediate] Big Data
Visualization
Christoph Meinel (Hasso Plattner Institute, Potsdam),
[introductory/intermediate] New Computing Power by In-Memory and Multicore
to Tackle Big Data
Manish Parashar (Rutgers University, Piscataway), [intermediate] Big Data
Challenges in Simulation-based Science
Srinivasan Parthasarathy (Ohio State University, Columbus), [intermediate]
Scalable Data Analysis
Evaggelia Pitoura (University of Ioannina), [introductory/intermediate]
Online Social Networks
Vijay V. Raghavan (University of Louisiana, Lafayette),
[introductory/intermediate] Visual Analytics of Time-evolving Large-scale
Graphs
Pierangela Samarati (University of Milan), [intermediate], Data Security and
Privacy in the Cloud
Peter Sanders (Karlsruhe Institute of Technology),
[introductory/intermediate] Algorithm Engineering for Large Data Sets
Johan Suykens (KU Leuven), [introductory/intermediate] Fixed-size Kernel
Models for Big Data
Domenico Talia (University of Calabria, Rende), [intermediate] Scalable Data
Mining on Parallel, Distributed and Cloud Computing Systems
Jieping Ye (Arizona State University, Tempe), [introductory/advanced]
Large-Scale Sparse Learning and Low Rank Modeling
ORGANIZING COMMITTEE:
Adrian Horia Dediu (Tarragona)
Carlos Mart?n-Vide (Tarragona, chair)
Florentina Lilica Voicu (Tarragona)
REGISTRATION:
It has to be done at
http://grammars.grlmc.com/bigdat2015/registration.php
The selection of up to 8 courses requested in the registration template is
only tentative and non-binding. For the sake of organization, it will be
helpful to have an approximation of the respective demand for each course.
Since the capacity of the venue is limited, registration requests will be
processed on a first come first served basis. The registration period will
be closed and the on-line registration facility disabled when the capacity
of the venue will be complete. It is much recommended to register prior to
the event.
FEES:
As far as possible, participants are expected to stay full-time. Fees are a
flat rate covering the attendance to all courses during the week. There are
several early registration deadlines. Fees depend on the registration
deadline.
ACCOMMODATION:
Suggestions of accommodation are available on the webpage.
CERTIFICATE:
Participants will be delivered a certificate of attendance.
QUESTIONS AND FURTHER INFORMATION:
florentinalilica.voicu@urv.cat
POSTAL ADDRESS:
BigDat 2015
Lilica Voicu
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain
Phone: +34 977 559 543
Fax: +34 977 558 386
ACKNOWLEDGEMENTS:
Universitat Rovira i Virgili
---
Este mensaje no contiene virus ni malware porque la protecci?n de avast! Antivirus est? activa.
http://www.avast.com
------------------------------
Message: 4
Date: Sat, 17 Jan 2015 15:52:15 +0000
From: Mark Dukes <mark.dukes@ccc.oxon.org>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Research Associate in Combinatorics vacancy at the
University of Strathclyde, UK
Message-ID:
<CAG=crN8kkbMF8j5UWBhne3sfn9o7=tR3eD6n+y8d6DdUV42tgA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
The University of Strathclyde is pleased to announce a Research
Associate position in Combinatorics.
The researcher will work with Dr Mark Dukes on the EPSRC project "New
combinatorial perspectives on the abelian sandpile model."
The position is for 3 years and the starting date is 1st June 2015.
The annual salary will be in the range GBP 30,434 - 33,242 (
approximately EUR 39,800 - 43,500 or USD 46,200 - 50,400).
Applications will be accepted until the 27th February 2015.
Further particulars on this job including details of how to apply can
be found by following the link:
http://www.jobs.ac.uk/job/AKI778/research-associate-in-combinatorics/
Mark Dukes' homepage: https://personal.cis.strath.ac.uk/mark.dukes/
Strathclyde Combinatorics Group: http://combinatorics.cis.strath.ac.uk/
Mark
--
Dr Mark Dukes
Dept of Computer & Information Sciences
University of Strathclyde, Glasgow
United Kingdom
https://personal.cis.strath.ac.uk/mark.dukes/
------------------------------
Message: 5
Date: Sat, 17 Jan 2015 21:34:24 +0100
From: "Jakob Nordstrom" <jakobn@kth.se>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc position at KTH (deadline Jan 25)
Message-ID:
<ac8b270b38f4b9d7a5353706638dd6e7.squirrel@webmail.csc.kth.se>
Content-Type: text/plain;charset=utf-8
The Theory Group at KTH Royal Institute of Technology invites applications for
a postdoctoral position in computational complexity and/or SAT solving.
KTH is the leading technical university in Sweden. The Theory Group at KTH
(http://www.csc.kth.se/tcs/) offers a strong research environment covering a
wide range of research topics such as complexity theory and approximation
algorithms, computer and network security, cryptography, formal methods and
natural language processing. The group has a consistent track record of
publishing in the leading theoretical computer science conferences and
journals worldwide, and the research conducted here has attracted numerous
international awards and grants in recent years.
The postdoctoral researcher will be working in the research group of Jakob
Nordstrom (http://www.csc.kth.se/~jakobn). Much of the activities of this
group revolve around the themes of proof complexity and SAT solving. On the
theoretical side, proof complexity has turned out to have deep, and sometimes
surprising, connections to other topics such as, e.g., circuit complexity,
communication complexity, and hardness of approximation, and therefore
researchers in these or other related areas are more than welcome to apply. On
the practical side, some interesting problems are to gain a better
understanding of the performance of current state-of-the-art SAT solvers ---
in particular, solvers using conflict-driven clause learning (CDCL) --- and to
explore techniques that would go beyond CDCL, such as approaches based on
algebraic or geometric reasoning.
The research project is financed by a Breakthrough Research Grant from the
Swedish Research Council and a Starting Independent Researcher Grant from the
European Research Council. In addition to the research group leader, the group
currently consists of one postdoc and four PhD students. Travel funding is
included, and the group also receives short-term and long-term visitors on a
regular basis.
This is a full-time employed position for one year with a possible one-year
extension. The successful candidate is expected to start in August-September
2015, although this is to some extent negotiable.
The application deadline is January 25, 2015. More information and
instructions how to apply can be found at
http://www.csc.kth.se/~jakobn/openings/D-2014-0761-Eng.php . Informal
enquiries are welcome and may be sent to Jakob Nordstrom.
------------------------------
Message: 6
Date: Mon, 19 Jan 2015 16:09:42 +0100
From: Manuel L?pez-Ib??ez <manuel.lopez-ibanez@ulb.ac.be>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Final CFP Ant Colony Optimization and Swarm
Intelligence Track (ACO-SI) @ GECCO 2015
Message-ID: <54BD1E36.9090809@ulb.ac.be>
Content-Type: text/plain; charset=windows-1252; format=flowed
*******************************************************************************
CALL FOR PAPERS
2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO-2015)
ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE (ACO-SI) TRACK
July 11-15, 2015, Madrid, Spain
Organized by ACM SIGEVO
http://www.sigevo.org/gecco-2015/organizers-tracks.html#acosi
*******************************************************************************
Swarm Intelligence (SI) is the collective problem-solving behavior of groups of
animals or artificial agents that results from the local interactions of the
individuals with each other and with their environment. SI systems rely on
certain key principles such as decentralization, stigmergy, and
self-organization. Since these principles are observed in the organization of
social insect colonies and other animal aggregates, such as bird flocks or fish
schools, SI systems are typically inspired by these natural systems.
The two main application areas of SI have been optimization and robotics. In
the first category, Ant Colony Optimization (ACO) and Particle Swarm
Optimization (PSO) constitute two of the most popular SI optimization
techniques with numerous applications in science and engineering. In the second
category, SI has been successfully used to control large numbers of robots in a
decentralized way, which increases the flexibility, robustness, and
fault-tolerance of the resulting systems.
Scope:
The ACO-SI Track welcomes submissions of original and unpublished work in all
experimental and theoretical aspects of SI, including (but not limited to) the
following areas:
* Biological foundations
* Modeling and analysis of new approaches
* Hybrid schemes with other algorithms
* Multi-swarm and self-adaptive approaches
* Constraint-handling and penalty function approaches
* Combinations with local search techniques
* Benchmarking and new empirical results
* Parallel/distributed implementations and applications
* Large-scale applications
* Applications to multi-objective, many-objective, dynamic, and noisy problems
* Applications to continuous and discrete search spaces
* Software and high-performance implementations
* Theoretical and experimental research in swarm robotics
Each paper will be rigorously evaluated in a double-blind review process.
All accepted papers will be published in the ACM Digital Library.
IMPORTANT DATES
January 21, 2015 Abstract submission
February 4, 2015 Full paper submission (hard deadline)
March 20, 2015 Notification of paper acceptance
April 14, 2015 Camera ready submission
July 11-15, 2015 GECCO 2015 Conference in Madrid, Spain
Track Chairs:
Dr. Manuel L?pez-Ib??ez (IRIDIA, Universit? libre de Bruxelles, Belgium)
http://iridia.ulb.ac.be/~manuel
Prof. Sanaz Mostaghim (Otto von Guericke University of Magdeburg, Germany)
http://www.is.ovgu.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 83, Issue 18
**************************************
No comments:
Post a Comment