Tuesday, September 29, 2015

The Simons Institute for the Theory of Computing at UC Berkeley invites applications for Research Fellowships for academic year 2016-17.

Simons-Berkeley Research Fellowships are an opportunity for outstanding junior scientists (at most 6 years from PhD by Fall 2016) to spend one or both semesters at the Institute in connection with one or more of its programs. The programs for 2016-17 are as follows:

Applicants who already hold junior faculty or postdoctoral positions are welcome to apply. In particular, applicants who hold, or expect to hold, postdoctoral appointments at other institutions are encouraged to apply to spend one semester as a Simons-Berkeley Fellow subject to the approval of the postdoctoral institution.

The Simons Institute for the Theory of Computing at UC Berkeley invites applications for Research Fellowships for academic year 2016-17.

Simons-Berkeley Research Fellowships are an opportunity for outstanding junior scientists (at most 6 years from PhD by Fall 2016) to spend one or both semesters at the Institute in connection with one or more of its programs. The programs for 2016-17 are as follows:

Applicants who already hold junior faculty or postdoctoral positions are welcome to apply. In particular, applicants who hold, or expect to hold, postdoctoral appointments at other institutions are encouraged to apply to spend one semester as a Simons-Berkeley Fellow subject to the approval of the postdoctoral institution.

Alistair SinclairAssociate Director, Simons Institute for the Theory of Computing

************************************************************ Contributions to be spread via DMANET are submitted to** DMANET@zpr.uni-koeln.de** Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.** DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The widespread adoption of digitization has opened the way to gathering large amounts of data that record detailed information for many systems of interest. Examples include telecommunication networks, online social-media platforms, and biological systems. Many of these systems are typically represented as networks, and graph-theoretic techniques are used to analyze the available data. Furthermore, as our data-gathering capacity has increased, it is now possible to collect data the record not only a static aggregate view of the underlying network, but a continuous stream of events that captures the full dynamic behavior of the network. Such events may take the form of structural changes, or they may encode different types of actions and interactions performed by the network entities. This view of time-evolving networks poses new challenges and opens new research directions. The objective is to develop the theoretical foundations and to design the algorithmic principles that will allow to efficiently manage and analyze such evolving networks. This special issue of Internet Mathematics invites original research papers on algorithmic and mathematical methods for modeling, processing, and analyzing evolving networks. The topics of interest include but are not limited to

Papers that have previously appeared in peer-reviewed conferences may be submitted, provided that significant extensions and additional non-trivial contributions are presented. In the latter case, submissions should be accompanied by a cover letter summarizing the additional contributions with respect to the earlier conference version.

The papers should be prepared and submitted according to the general guidelines for authors of Internet Mathematics. Please indicate in your submission that the paper is submitted for the special issue.

Aristides Gionis, Aalto University Suresh Venkatasubramanian, University of Utah

************************************************************ Contributions to be spread via DMANET are submitted to** DMANET@zpr.uni-koeln.de** Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.** DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

We are pleased to announce the release of our graph drawing framework KaDraw (Karlsruhe Graph Drawing). So far, it contains MulMent which is a multilevel algorithm to optimize maxent-stress on large networks. Its main drawing routine is a local optimizer suggested by Gansner et al., which we accelerated in practice. The speed of the local optimizer stems from (i) shared-memory parallelism and (ii) approximation of long-range forces by using coarser representatives stored in the multilevel hierarchy.

We are glad for any comments and error reports (or even bug fixes) that you send us.

Henning Meyerhenke, Martin Nöllenburg and Christian Schulz,Karlsruhe Institute of Technology (KIT) and TU Wien (TUW)************************************************************ Contributions to be spread via DMANET are submitted to** DMANET@zpr.uni-koeln.de** Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.** DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Monday, September 28, 2015

In the scope of the European Projects being developed at the CEA LIST(*http://www.cea.fr/english_portal<http://www.cea.fr/english_portal>*) data analysis and system Intelligencelab (LADIS) in the Paris (France) area, a research engineer position isavailable for developers who are interested in multi-agent solutions for anefficient management of the smart grid.

The successful candidate will join a research and development team toinvestigate and develop a multi-agent platform devoted to management andoptimization of energy systems.

The successful applicant is expected to be able to successfully collaboratewith the project team and with researchers of the LADIS lab.

The position is open (start planned in January/February 2016). Review ofapplications will begin as soon applications are received and continueuntil the position is filled.

*Working context:* The CEA is the French Alternative Energies and AtomicEnergy Commission. Leader in research, development and innovation with its16000 employees, CEA is active in four main areas: low-carbon energies,defense and security, information technologies and health technologies. Keyfigures include about 150 start-ups since 1984 in the innovativetechnologies sector, a 4,3 billion euros yearly budget and more than 530 EUprojects obtained with CEA participation under the European FP7 since 2007.Inside CEA, the CEA LIST institute (700 researchers, located in theParis-Saclay scientific cluster) focuses its research activities ondeveloping innovative technologies for smart and complex systems. Its R&Dprograms focus on interactive systems (ambient intelligence), embeddedsystems (architecture, software and systems engineering), sensors andsignal processing (industrial control systems, health, security andmetrology). The LADIS is a CEA LIST lab (60 researchers, post-doctoral &PhD students) which activities aim at applying advanced artificialintelligence, data/signal processing and software engineering approaches tomeet industrial needs, through its industrial partnerships and involvementin collaborative research projects. Our activities essentially focus onHealth, Manufacturing and Energy domains, with the objective to deliverindustry-focused solutions and to be in line with the highest academicexcellence standards.

*Job description:* In the recent years, Multi-Agent Systems (MAS) haveemerged as one of the most promising technologies for the management of newenergy systems [1,2]. However, this interrelation between MAS and energysystems still has many challenges.

This study will take place in the scope of a European collaborativeresearch project. The aim of this project is to design, develop, anddemonstrate a multi-agent holonic platform for distributed management,control and optimization of energy systems (generation, storage anddistribution). This platform will rely on generic high-level softwarecomponents (mainly agents and behaviours to be able to representsocio-economic and physical entities), generic interaction protocols andthe recursive and hierarchical structures that support a holonicarchitecture. Multi-agent optimization protocols will be integrated inorder to allow agents to coordinate their different goals andbi-directional communications will be secured. Goals will be based onindividual interests (e.g. balance for distribution operators; reduction ofgeneration price for producers; reduction of consumption and comfortmaximization for consumers, etc). Collective optimization protocols willproduce as output global agreed generation, distribution, storage andconsumption schedules.

The project includes prominent industrial organizations and researchinstitutes from the European energy, telecom and security fields.

The selected candidate will be part of a multi-agent systems team, whichincludes two PhD students, two postdocs, two research engineers and onesoftware architect. The aim will be to participate in the development ofalready existing multi-agent platform (developed in the institute). Thiswork will also rely on previous research results. The focus of this studymay be adapted depending on the candidate profile. However, excellentskills in software development are a mandatory requirement.

************************************************************ Contributions to be spread via DMANET are submitted to** DMANET@zpr.uni-koeln.de** Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.** DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

TWO POSITIONS IN FORMAL METHODS (PHD OR POSTDOC LEVEL)
AT THE TECHNICAL UNIVERSITY OF MUNICH

* The Department of Computer Science of the Technical University of Munich
(Chair for Compiler and Software Construction, and Chair for Foundations of
Software Reliability) offers two positions at PhD or postdoc level in the area
of Formal Methods. The chairs, lead by Javier Esparza and Helmut Seidl,
conduct research on program analysis, model checking, compiler construction,
programming languages, automata theory, and concurrency models like

Petri nets or communicating automata.

* We offer:
- excellent research environment at a leading university
- intensive thesis supervision
- close cooperation with top researchers at international level
- two-year contract, extensible for another two years
- pay according to the TV-L 13 German scale (full position). Information
on the scale can be found at http://www.cats.rwth-aachen.de/jobs/bat.

* We seek candidates with:
- MSc/PhD in computer science or mathematics
- excellent academic record
- strong interest and some previous knowledge in automata theory, logic,
programming languages, concurrency theory, or some area of Formal Methods
- fluency in spoken and written English or German

* Applicants should submit a letter of interest, a CV, and the names and
contact information of three references to Claudia Link, link@in.tum.de.
Review of applications will begin November 1, and continue until the positions
are filled. The starting date is negotiable.

* The Technical University of Munich is an equal opportunity employer.
Qualified women are particularly encouraged to apply. Applicants with
disabilities are treated with preference given comparable qualification.

ETAPS is the primary European forum for academic and industrialresearchers working on topics relating to software science. ETAPS,established in 1998, is a confederation of five main annualconferences, accompanied by satellite workshops. ETAPS 2016 is theninteenth event in the series.

ETAPS conferences accept two types of contributions: research papersand tool demonstration papers. Both types will appear in theproceedings and have presentations during the conference.

ESOP and FoSSaCS accept only research papers.

A condition of submission is that, if the submission is accepted, oneof the authors attends the conference to give the presentation.

Submitted papers must be in English presenting originalresearch. They must be unpublished and not submitted for publicationelsewhere. In particular, simultaneous submission of the samecontribution to multiple ETAPS conferences is forbidden. Theproceedings will be published in the Advanced Research in Computingand Software Science (ARCoSS) subline of Springer's Lecture Notes inComputer Science series.

Additional material intended for the referees but not for publicationin the final version - for example, details of proofs - may be placedin a clearly marked appendix that is not included in the pagelimit. ETAPS referees are at liberty to ignore appendices and papersmust be understandable without them.

* The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.)

* The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated.

ESOP and FOSSACS do not accept tool demonstration papers.

TACAS has a page limit of 6 pages for tool demonstrations.

-- SATELLITE EVENTS (2-3 April, 8 April) --

Around 20 satellite workshops will take place before and after themain conferences.

-- HOST CITY --

Eindhoven is located in the province of North Brabant in the south ofthe Netherlands. It is the fifth-largest city of the Netherlands. Thecity is well known for modern art, design and technology. The mainairport of the Netherlands is the Amsterdam Airport, Schiphol. Allmajor airlines fly to Schiphol, and Schiphol has a direct and veryfrequent train connection to Eindhoven. Eindhoven also has a smallinternational airport, Eindhoven Airport, with direct connections tomore than thirty destinations in Europe.

************************************************************ Contributions to be spread via DMANET are submitted to** DMANET@zpr.uni-koeln.de** Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.** DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Sunday, September 27, 2015

The International Conference on Computer, Electronics, and BiomedicalEngineering (ICCEBE2015)Islamic Azad University, Academic City, Dubai, UAEOctober 12-14, 2015http://sdiwc.net/conferences/iccebe2015/ =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*The proposed conference will be held at Islamic Azad University, AcademicCity, Dubai, UAE From October 12-14, 2015 which aims to enable researchersbuild connections between different digital applications.The conference welcomes papers on the following (but not limited to)research topics:

Researchers are encouraged to submit their work electronically. All paperswill be fully refereed by a minimum of two specialized referees. Beforefinal acceptance, all referees comments must be considered.Best selected papers will be published in one of the following specialissues provided that the author do major improvements and extension withinthe time frame that will be set by the conference and his/her paper isapproved by the chief editor:

International Journal of New Computer Architectures and their Applications(IJNCAA)International Journal of Digital Information and Wireless Communications(IJDIWC)International Journal of Cyber-Security and Digital Forensics (IJCSDF)International Journal of E-Learning and Educational Technologies in theDigital Media (IJEETDM)

=*=*=*=*=*=*=*=*=*=*=*=IMPORTANT DATES

Submission Dates: Open from now until October 03, 2015Notification of Acceptance: October 06, 2015Camera Ready Submission: Open from now until Oct. 08, 2015Registration: Open from now until Oct. 08, 2015Conference Dates: October 12-14, 2015

************************************************************ Contributions to be spread via DMANET are submitted to** DMANET@zpr.uni-koeln.de** Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.** DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Saturday, September 26, 2015

An opportunity has arisen at the Computer Laboratory, University of Cambridge for a postdoctoral researcher and developer to work with us in creating a platform to enable new, engaging interactive experiences within event/exhibition spaces.

The project entails close collaboration with partners from a number of internationally renowned arts organisations.

The work involves two main aspects:

1) To design and develop a communications management platform, for supporting distributed systems (in the context of the emerging "Internet of Things")

2) To work with partners in building demonstrators for live, public deployments within their spaces.

The successful candidate will have a good knowledge of distributed systems, developed through their PhD, and demonstrable (though not necessarily commercial) programming experience in the field. They will also be enthusiastic and self motivated, as there is much room for creativity and flexibility regarding technology and scope. An interest in digital art, media and social applications is desirable, and any experience with such is a definite plus.

Note that though this is a fixed term position, it is envisaged that a successful project will lead to a number of follow-on opportunities, both academic and commercial.

- Through this link above you can "subscribe", "unsubscribe", or change your settings in the list, using "username=ufsc" and "password=ufsc".- If you need any help, please send a message to mycolleagues-owner@mailman.ufsc.br.- ENJOY this COURTESY offered by FEDERAL UNIVERSITY OF SANTA CATARINA.

=================The submission deadline is October 19, 2015.Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to:- ICDT 2016, The Eleventh International Conference on Digital TelecommunicationsAuthors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org=================

============== ICDT 2016 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

ICDT 2016, The Eleventh International Conference on Digital Telecommunications

The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.

All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Friday, September 25, 2015

Dear colleagues,We are pleased to invite you to participate in the ninth Triennial Symposium on Transportation Analysis (TRISTAN IX). TRISTAN is an international scientific conference that provides a high-quality forum for the presentation of mathematical models, methodologies and computational results, and for the exchange of ideas and scientific discussions on advanced applications and technologies in transportation. TRISTAN IX will be held June 13 through 17, 2016, on the island of Aruba.We hope to welcome you at TRISTAN 2016.

************************************************************ Contributions to be spread via DMANET are submitted to** DMANET@zpr.uni-koeln.de** Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.** DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Scope--------The purpose of SCSS 2016 is to promote research on theoretical and practicalaspects of symbolic computation in software science. The symposium provides aforum for active dialog between researchers from several fields of computeralgebra, algebraic geometry, algorithmic combinatorics, computational logic,and software analysis and verification.

Submissions of regular research papers are invited. Regular research papersmust not exceed 12 pages in the EasyChair LaTeX Class format(www.easychair.org/publications/easychair.zip), with up to 3 additional pagesfor technical appendices.

Publication----------The proceedings of SCSS 2016 will be published in the EasyChair Proceedings inComputing (EPiC).

After the symposium, we will have a combined special issue of the Journal ofSymbolic Computation on SCSS 2014 & 2016. The full version of selected papersat SCSS 2014 & 2016 will be considered for the publication of the special issuesubjected to the normal peer review process of the journal. The submissiondeadline of the special issue will be 2 months after the symposium.************************************************************ Contributions to be spread via DMANET are submitted to** DMANET@zpr.uni-koeln.de** Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.** DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The 32nd International Symposium on Computational Geometry (SoCG) will be held in
Boston, MA, as part of Computational Geometry Week. SoCG will be collocated
with the 48th Symposium on the Theory of Computing (STOC), which will be held
June 18-21, 2016. Making use of this collocation, it is intended to hold joint
workshops with STOC (at the conference hotel of STOC) on June 18, and
coordinate other aspects of the program where appropriate.

We invite submissions of high-quality papers that describe original research on
computational problems in a geometric setting, in particular their algorithmic
solutions, implementation issues, applications, and mathematical foundations.
The program committee intends to interpret the scope of the conference
broadly, and will seriously consider all papers that are of significant
interest to the computational geometry research community.

Topics of interest include, but are not limited to:

* Design, analysis, and implementation of geometric algorithms and data structures;
lower bounds on the computational complexity of geometric problems;

Publication and Awards
======================
Final versions of accepted papers will be published by LIPIcs (Leibniz
International Proceedings in Informatics) in the symposium proceedings. An
author of each accepted paper will be expected to attend the Symposium and give
a presentation (approximately 20 minutes) of the paper. Authors of a selection
of papers from the conference will be invited to submit extended versions of
their papers to special issues of "Discrete and Computational Geometry" and
"Journal of Computational Geometry". There will be a best paper award. A best
student presentation award will also be given based on the quality of the
presentation by a student during the conference.

In order to encourage submission from both theory and practice, authors should
clearly identify the main merits of the paper by choosing one of the following
categories.
(T) Contributions to the theory of computational geometry
(P) Contributions to practical aspects of computational geometry
(B) Contributions to both theory and practice
There is no preassigned quota and there will not be separate tracks; the only
purpose is to help the PC in focusing on the main strengths of papers. Authors
should assign these categories by checking one or two of the appropriate boxes
on the easychair submission page.

After the title, authors and abstract, the main body of the submission should
begin with a precise statement of the problem considered, a succinct summary of
the results obtained (emphasizing the significance, novelty, and potential
impact of the research), and a clear comparison with related work. The
remainder of the submission should provide sufficient detail to allow the
Program Committee to evaluate the validity, quality, and relevance of the
contribution. Clarity of presentation is very important; the whole submission
should be written carefully, taking into consideration that it will be read and
evaluated by both experts and non-experts, often under tight time constraints.
All details needed to convince the Program Committee of the validity of the
results should be provided, and supporting materials (including proofs of
theoretical claims and experimental details) that do not fit in the 15-page
limit should be given in an appendix. The appendix should not be a full version
of the paper. It will be read by the program committee members at their
discretion and will not be published as part of the proceedings. Thus, the
submission should be able to stand on its own when references to the appendix
are deleted or replaced by references to an extended version of the paper.
If an appendix was used at the time of submission, authors are strongly
encouraged to post a full version of their paper on some online repository
(such as the arXiv) after acceptance.

Results previously published in another conference proceedings cannot be
submitted. Simultaneous submissions of the results to another conference with
published proceedings are not allowed. Exempted are workshop or conference
handouts containing short abstracts. Results that have already been accepted
(with or without revision) for publication by a journal, at the time of their
submission to the conference, will not be allowed. A paper submitted to a
journal but not yet accepted to a journal can be submitted to the conference.
In such cases, the authors must mention this in the submission appendix and
clearly identify the status of the journal submission on November 27, 2015.

A new computational paradigm has emerged in computer science over the past few decades, which is exemplified by the use of SAT solvers to tackle problems in the complexity class NP. According to this paradigm, a significant research and engineering investment is made towards developing highly efficient solvers for a prototypical problem (e.g., SAT), that is representative of a broader class of problems (e.g., NP). The cost of this investment is then amortized as these solvers are applied to a broader class of problems via reductions (in contrast to developing dedicated algorithms for each encountered problem).

The goal of this workshop is to help unify and promote research areas that advance this emerging computational paradigm, focusing on solvers that reach beyond NP. This includes, but is not limited to:

* Model counters, also known as #SAT solvers, which are now established as the prototypical solvers for the complexity class #P.

* Knowledge compilers, which reach to other problems in the polynomial and counting hierarchies.

* QBF solvers, which are now established as the prototypical solvers for the complexity class PSPACE.

* Solvers for function problems, including optimization and subset minimal problems, e.g. MaxSAT, MUS and MCS, that reach different levels of the function polynomial hierarchy.

TOPICS OF INTEREST

Algorithms underlying Beyond NP solvers; descriptions of implementations and/or evaluations of these solvers; their applications (including encodings); the complexity classes they reach; and their connections to one another. More broadly, submissions are solicited from three types of community members: those who develop solvers, those who use them to solve concrete problems, and those who are interested in the computational complexity of solvers and related problems. Submissions that can help disseminate “best practices” among the relevant research areas are also encouraged (e.g., competitions, benchmarks, and the development of open-source solvers).

SUBMISSIONS

Submissions should be formatted using the AAAI conference style and not exceed 6 pages (shorter submissions are welcome). Submissions should be made through EasyChair and are expected to explicate relevance to one of the Beyond NP themes (see http://beyondnp.org/workshop16/).