Wednesday, December 7, 2016

dmanet Digest, Vol 106, Issue 10

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 - ISNN 2017 (Sapporo, Hokkaido, Japan, June
21-23, 2017), Paper Submission: January 1, 2017 (Nian Ashlee Zhang)
2. CFP: (Deadline Ext.) - ICC'17 Workshop - 5th IEEE SCPA 2017 -
May 21-25, 2017. Paris, France (Sandra Sendra)
3. Large-Scale Structures in Random Graphs Workshop 2016 –
PUBLIC LECTURES -- Tuesday 13 December (Peter Allen)
4. Open PhD Position in the DFG priority program
"Cyber-Physical,Networking (SPP 1914) (Hannes Frey)
5. EuroCG 2017 - 2nd Call for Papers (Christiane Schmidt)


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

Message: 1
Date: Tue, 6 Dec 2016 14:05:55 -0500
From: Nian Ashlee Zhang <nian.zhang6@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Papers - ISNN 2017 (Sapporo, Hokkaido,
Japan, June 21-23, 2017), Paper Submission: January 1, 2017
Message-ID:
<CAHSfCZvqaqTOu9viO7Otj5PBxZn-JMwwMp9UD6Q3_0+ompPpMQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8

*Call for Papers*


*The 14th International Symposium on Neural Networks (ISNN 2017), Sapporo,
Hokkaido, Japan, June 21-23, 2017 *
https://conference.cs.cityu.edu.hk/isnn/
<https://mail.udc.edu/owa/redir.aspx?REF=bw1boz8lQCQ-mmqyordoQSXEx-wFtjGq46edBpLTCzQ5sOa6VAbUCAFodHRwczovL2NvbmZlcmVuY2UuY3MuY2l0eXUuZWR1LmhrL2lzbm4v>

The 14th International Symposium on Neural Networks (ISNN 2017) will be
held in Sapporo, Hokkaido, Japan during June 21-23, 2017, following the
successes of previous events. Located in northern island of Hokkaido,
Sapporo is the fourth largest Japanese city and a popular summer/winter
tourist venue. ISNN 2017 aims to provide a high-level international forum
for scientists, engineers, and educators to present the state of the art of
neural network research and applications in related fields. The symposium
will feature plenary speeches given by world renowned scholars, regular
sessions with broad coverage, and special sessions focusing on popular
topics.


Authors are invited to submit full-length papers by the submission deadline
through the online submission system. The submission of a paper implies
that the paper is original and has not been submitted under review or is
not copyright-protected elsewhere and will be presented by an author if
accepted. All submitted papers will be refereed by experts in the field
based on the criteria of originality, significance, quality, and clarity.
Papers presented at ISNN 2017 will be published in the EI-indexed
proceedings in the Springer LNCS series and selected good papers will be
included in special issues of several SCI journals.


*Important Dates*

- Paper submission: January 1, 2017

- Notification of acceptance: February 1, 2017

- Camera-ready copy and author registration: March 1, 2017

- Conference: June 21-23, 2017

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

Message: 2
Date: Tue, 6 Dec 2016 22:40:49 +0100
From: Sandra Sendra<sandra.sendra.upv@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: (Deadline Ext.) - ICC'17 Workshop - 5th IEEE
SCPA 2017 - May 21-25, 2017. Paris, France
Message-ID: <201612062140.uB6Lenac027477@smtp.upv.es>
Content-Type: text/plain; charset=us-ascii

-------------------- CALL FOR PAPERS (DEADLINE EXTENDED) -----------------
5th IEEE International Workshop on Smart Communication Protocols and Algorithms (SCPA 2017)
May 21-25, 2017. Paris, France
In conjunction with IEEE ICC 2017
http://scpa.it.ubi.pt/2017/
------------------------------------------------------------------------------------------------

Selected papers will be invited to the Special Issue on Smart Protocols and Algorithms of the International Journal Network Protocols and Algorithms (ISSN: 1943-3581) or to the Special Issue on Recent Advances on Communications and Networking Technology Journal (ISSN: 2215-082X (Online); ISSN: 2215-0811 (Print)).


Communication protocols and algorithms are needed to communicate network devices and exchange data between them. The appearance of new technologies usually comes with a protocol procedure and communication rules that allows data communication while taking profit of this new technology. Recent advances in hardware and communication mediums allow proposing new rules, conventions and data structures which could be used by network devices to communicate across the network. Moreover, devices with higher processing capacity let us include more complex algorithms that can be used by the network device to enhance the communication procedure.
Smart communication protocols and algorithms make use of several methods and techniques (such as machine learning techniques, decision making techniques, knowledge representation, network management, network optimization, problem solution techniques, and so on), to communicate the network devices to transfer data between them. They can be used to perceive the network conditions, or the user behavior, in order to dynamically plan, adapt, decide, take the appropriate actions, and learn from the consequences of its actions. The algorithms can make use of the information gathered from the protocol in order to sense the environment, plan actions according to the input, take consciousness of what is happening in the environment, and take the appropriate decisions using a reasoning engine. Goals such as decide which scenario fits best its end-to-end purpose, or environment prediction, can be achieved with smart protocols and algorithms. Moreover, they could learn from the pas!
t and use this knowledge to improve
future decisions.
In this workshop, researchers are encouraged to submit papers focused on the design, development, analysis or optimization of smart communication protocols or algorithms at any communication layer. Algorithms and protocols based on artificial intelligence techniques for network management, network monitoring, quality of service enhancement, performance optimization and network secure are included in the workshop.
We welcome technical papers presenting analytical research, simulations, practical results, position papers addressing the pros and cons of specific proposals, and papers addressing the key problems and solutions. The topics suggested by the conference can be discussed in term of concepts, state of the art, standards, deployments, implementations, running experiments and applications.

Topics of interest:
------------------------------------------------------------------------------------------------
Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal, including, but are not limited to, the following topic areas:
- Smart network protocols and algorithms for multimedia delivery
- Application layer, transport layer and network layer cognitive protocols
- Cognitive radio network protocols and algorithms
- Automatic protocols and algorithms for environment prediction
- Algorithms and protocols to predict data network states
- Intelligent synchronization techniques for network protocols and algorithms
- Smart protocols and algorithms for e-health
- Software applications for smart algorithms design and development
- Dynamic protocols based on the perception of their performance
- Smart protocols and algorithms for Smartgrids
- Protocols and algorithms focused on building conclusions for taking the appropriate actions
- Smart Automatic and self-autonomous ad-hoc and sensor networks
- Artificial intelligence applied in protocols and algorithms for wireless, mobile and dynamic networks
- Smart security protocols and algorithms
- Smart cryptographic algorithms for communication
- Artificial intelligence applied to power efficiency and energy saving protocols and algorithms
- Smart routing and switching protocols and algorithms
- Cognitive protocol and algorithm models for saving communication costs
- Any kind of intelligent technique applied to QoS, content delivery, network Monitoring and network management
- Smart collaborative protocols and algorithms
- Problem recognition and problem solving protocols
- Genetic algorithms, fuzzy logic and neural networks applied to communication protocols and algorithms

Important Dates:
------------------------------------------------------------------------------------------------
Submission Deadline: 16th December, 2016 (Extended deadline)
Acceptance Notification: 17th February, 2016
Camera Ready Deadline: 10th March, 2016

Submission guidelines:
------------------------------------------------------------------------------------------------
All submissions must be full papers in PDF format and uploaded on EDAS: (https://edas.info/newPaper.php?c=22957&track=82208)

All submissions should be written in English with a maximum paper length of five (5) printed pages (10-point font) including figures without incurring additional page charges.

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

General Chairs:
Jaime Lloret Mauri, Universitat Politecnica Val�ncia, Spain
Joel Rodrigues, National Institute of Telecommunications (Inatel), Brazil;
Instituto de Telecomunica��es, Univ. of Beira Interior, Portugal

TPC Chairs:
Sandra Sendra, Universidad de Granada, Spain
Kashif A. Saleem, Kind Saud University, Saudi Arabia
Bruno Silva, Instituto de Telecomunica��es, Universidade da Beira Interior, Portugal

Keynote Chairs:
Danda B. Rawat, Georgia Southern University, USA

Panel Chairs:
Raimir Filho, University of Fortaleza, Brazil
Pascal Lorenz, University of Haute Alsace, France

Industry Chair:
Antonio S�nchez-Esguevillas, Telefonica R&D, Spain

Publicity Chairs:
Sofiane Hamrioui, University of Haute Alsace, France
Jose M. Jimenez, Universidad Polit�cnica de Valencia, Spain

Web Chair:
Jo�o N. Isento, Instituto de Telecomunica��es, Universidade da Beira Interior, Portugal


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

Message: 3
Date: Tue, 6 Dec 2016 22:01:16 +0000
From: Peter Allen <p.david.allen@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Large-Scale Structures in Random Graphs Workshop
2016 – PUBLIC LECTURES -- Tuesday 13 December
Message-ID: <53aeae75-8079-3aea-94ec-29dff604d95d@lse.ac.uk>
Content-Type: text/plain; charset=utf-8; format=flowed

* *Large-Scale Structures in Random Graphs Workshop 2016 – PUBLIC LECTURES

*
Tuesday 13 December – 10.00 - The Alan Turing Institute, headquartered
at the British Library

This event is free to attend but *_pre-registration is required via our
Eventbrite page_*
<https://www.eventbrite.co.uk/e/large-scale-structures-in-random-graphs-public-lectures-tickets-29672085005>
*10.00: *Refreshments and networking
*10.30: *Rob Morris (IMPA) - The sharp threshold for making squares
Many of the fastest known algorithms for factoring large integers rely
on finding subsequences of randomly generated sequences of integers
whose product is a perfect square. Motivated by this, at the 1994 ICM
Pomerance posed the problem of determining the threshold of the event
that a random sequence of /N/ integers, each chosen uniformly from the
set /{1,...,x}/, contains a subsequence, the product of whose elements
is a perfect square. In 1996, Pomerance gave good bounds on this
threshold and also conjectured that it is /sharp/.

A few years ago, in a major breakthrough, Croot, Granville, Pemantle and
Tetali significantly improved these bounds, and stated a conjecture as
to the location of this sharp threshold. In the talk we will discuss a
proof of their conjecture, which combines techniques from number theory
and probabilistic combinatorics. In particular, at the heart of the
proof lies a self-correcting random process of non-uniform hypergraphs.
*11.40: *Stefanie Gerke (RHUL) - Matchings in random bipartite graphs
We consider maximum matchings in random bipartite graphs with a fixed
degree distribution. We then introduce an adversary and show for a
simplified model under which conditions a matching exists that covers
the smaller partition class.
Further details:
_http://www.lse.ac.uk/maths/Seminars/Large-Scale-Structures-in-Random-Graphs-Workshop-2016.aspx_
<http://www.lse.ac.uk/maths/Seminars/Research_Seminars.aspx>

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

Message: 4
Date: Wed, 7 Dec 2016 12:02:06 +0100
From: Hannes Frey <frey@uni-koblenz.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Open PhD Position in the DFG priority program
"Cyber-Physical,Networking (SPP 1914)
Message-ID: <7a597cb6-118f-aa0b-4d03-0e9220691d46@uni-koblenz.de>
Content-Type: text/plain; charset=utf-8; format=flowed

The Faculty of Computer Science at the University of Koblenz-Landau, Campus
Koblenz, Computer Networks Group, is inviting applications for a

PhD Position (research fellow)
(3 years, full time)

for working within the DFG priority program "Cyber-Physical Networking
(SPP 1914)". The position is to be filled as soon as possible, limited to 3
years and is subject to the German law on fixed-term contracts in science
(WissZeitVG). Salary will be according to the German public service salary
scale TV-L EGr. 13.


Topic:

The prospective research assistant will be responsible for the project
"analysis and synthesis of combined cooperative control and topology control
over wireless network models". This is a joint project between the Computer
Networks Group at the University of Koblenz-Landau and the Institute of
Control Systems at the Hamburg-Harburg Technical University. At both sites
one PhD student is supposed to work in this project context. The PhD student
employed at the University of Koblenz-Landau will research appropriate
adaptation of the time-varying wireless communication graph in multi-agent
systems. Such multi-agent systems are for example autonomous AUV or UAV
robot swarms. Of particular interest are topology control schemes to
maintain the highest level of algebraic connectivity (a condition for
performance and robustness of cooperative control) while reducing the number
of message losses due to interference (modeled in this project with the SINR
model). Focus is on distributed and local solutions with the goal to support
any system scale.
The effectiveness of the developed topology control schemes and their
interaction with distributed control will be evaluated by simulation studies
on some selected distributed control scenarios (e.g. distributed source
seeking based on robot swarms).


Requirements:

We expect:
- An above-average completed scientific university study, preferably in the
area of computer science or mathematics (M.Sc or Diploma).
- Ability to carry out independent scientific work
- Skills to mathematically proof theoretical claims
- Interests to do research in the area of algorithms and graphs
- Very good proficiency in written and spoken English

It is the policy of the University Koblenz-Landau to increase the percentage
of female employees. If equally qualified, preference will be given to
female applicants in fields where they are underrepresented. Disabled
candidates are given priority, if equally qualified. International
candidates are highly encouraged to apply.

Applicants should send their documents (curriculum vitae, qualifications
etc.) quoting the reference number Ko-44/2016, before Jan-31-2017 either by
regular mail to Universität Koblenz-Landau, Ref. K 21 Personal,
Organisation, Wahlen, Universitätsstr. 1, 56070 Koblenz or by email to
bewerbung-fb4@uni-koblenz.de. Applications after the deadline will be
considered as long as the position is not filled.

We do not send a confirmation of receipt. In accordance to the protection of
data privacy all documents will be destroyed after the application
procedure.

--
Prof. Dr. Hannes Frey
AG Rechnernetze
Universität Koblenz-Landau

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

Message: 5
Date: Wed, 7 Dec 2016 14:20:28 +0100
From: Christiane Schmidt <christiane.schmidt.bs@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] EuroCG 2017 - 2nd Call for Papers
Message-ID: <435C68A3-8588-496D-9A1D-938BE6733DFB@gmail.com>
Content-Type: text/plain; charset=utf-8


=======================================================================

Call for Papers

EuroCG 2017:
33rd European Workshop on Computational Geometry

April 5-7, 2017 - Malmö, Sweden

http://csconferences.mah.se/eurocg2017/ <http://www.ibr.cs.tu-bs.de/alg/eurocg13/>
=======================================================================

The 33rd European Workshop on Computational Geometry (EuroCG 2017) will be held on
April 5-7, 2017 at the "Niagara" building at Malmö University, at the southern tip of Sweden.
(As usual, there will be a welcome reception on April 4 to launch the conference.)
EuroCG is an annual workshop that combines a strong scientific tradition with a
friendly and informal atmosphere. The workshop is a forum where researchers can meet, present
their results, discuss their work, and establish scientific collaborations.

Topics of interest cover all aspects of computational geometry, including the following:

* discrete and combinatorial geometry and topology
* design and analysis of geometric algorithms and data structures
* implementation and experimental evaluation of geometric algorithms
* numerical and algebraic issues arising from implementations
* analysis of geometric configurations
* geometric modeling, visualization and simulation
* combinatorial optimization
* graph drawing
* computer-aided design and manufacturing
* structural molecular biology
* geographic information systems
* robotics and virtual worlds

SUBMISSIONS AND PROCEEDINGS
---------------------------

We invite authors to submit extended abstracts (4 pages, two columns) of
original research. Submissions will be handled through EasyChair.

EuroCG does not have formally reviewed proceedings. A booklet
of abstracts, without ISBN, will be accessible online from the webpage for the
benefit of the community and must be regarded as a collection of preprints
rather than a formally reviewed selection of papers. Results presented at
EuroCG are expected to appear in other conferences with formal proceedings
and/or in journals. In particular, papers that have just been submitted to other
formally reviewed conferences are eligible for being presented at EuroCG,
assuming they have not appeared by the time of the conference.

IMPORTANT DATES
---------------

* Submission Deadline : January 9, 2017
* Acceptance Notification : February 13, 2017
* Camera-ready version : February 27, 2017
* Early Registration : February 27, 2017

INVITED SPEAKERS
----------------

* Rolf Klein, Universität Bonn
* Joseph Mitchell, Stony Brook University
* Bettina Speckmann, Technische Universiteit Eindhoven

PROGRAM COMMITTEE
-----------------

* Gill Barequet, Technion, Israel
* Prosenjit Bose, Carleton University, Canada
* Kevin Buchin, TU Eindhoven, The Netherlands
* Maike Buchin, Ruhr University Bochum, Germany
* Sergio Cabello, University of Ljubljana, Slovenia
* Éric Colin de Verdière, CNRS and LIGM, Marne-la-Vallée, France
* Mark de Berg, TU Eindhoven, The Netherlands
* Sándor Fekete, TU Braunschweig, Germany
* Fabrizio Frati, Roma Tre University, Italy
* Matt Gibson, University of Texas at San Antonio, USA
* Joachim Gudmundsson, University of Sydney, Australia
* Michael Hoffmann, ETH Zürich, Switzerland
* Bengt J. Nilsson, Malmö University, Sweden (chair)
* Matias Korman, Tohoku University, Japan
* Erik Krohn, University of Wisconsin, USA
* Stefan Langerman, Université Libre de Bruxelles (ULB), Belgium
* Elmar Langetepe, University of Bonn, Germany
* Christos Levcopoulos, Lund University, Sweden
* Andrzej Lingas, Lund University, Sweden
* Maarten Löffler, Utrecht University , The Netherlands
* Alejandro López-Ortiz, University of Waterloo, Canada
* Wolfgang Mulzer, Freie Universität Berlin, Germany
* Valentin Polishchuk, Linköping University, Sweden (organiser)
* Vera Sacristán, Universitat Politècnica de Catalunya (UPC), Spain
* Christiane Schmidt, Linköping University, Sweden (organiser)
* Shakhar Smorodinsky, Ben-Gurion University, Israel
* Kevin Verbeek, TU Eindhoven, The Netherlands
* Birgit Vogtenhuber, TU Graz, Austria
* Carola Wenk, Tulane University , USA
* Pawel Zylinski, University of Gdansk, Poland


ORGANIZING COMMITTEE
--------------------

* Bengt J. Nilsson, Malmö University,
* Valentin Polishchuk, Linköping University
* Christiane Schmidt, Linköping University

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

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 106, Issue 10
***************************************

No comments:

Post a Comment