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. CFP: Special Issue in IEEE Access on Consensus Problems for
Complex Networked Systems (shang yilun)
2. YAGS - New Free Software for Graph Theory (Miguel Pizana)
3. metaheuristics for optimization problems (Stefka Fidanova)
4. Post-doc positions in Brno, CZ (correction) (Petr Hlineny)
----------------------------------------------------------------------
Message: 1
Date: Tue, 30 Aug 2016 23:45:02 +0000
From: shang yilun <shylmath@hotmail.com>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] CFP: Special Issue in IEEE Access on Consensus
Problems for Complex Networked Systems
Message-ID: <mailman.2.1472724001.34200.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="iso-8859-1"
Call for Papers
IEEE Access
http://www.ieee.org/ieee-access
Special Section on Recent Developments in Consensus Problems for Complex Networked Systems
** Description:
During the last years, consensus problems for complex networked systems composed of interconnected interacting agents have found an ever-increasing number of applications in various areas, such as swarm dynamics, smart grids, sensor networks, intelligent transportation systems, unmanned aerial vehicles, telerobotics and military. The design of consensus protocols takes advantage of nearest neighbour interaction rules, which renders a framework of distributed multi-agent systems so that the group of dynamic agents can reach an agreement or consensus on certain desired cooperative task. The growing complexity of the communication topology and agents' dynamics along with the great demands on system performance brings numerous challenges including consensus under switching topologies, interdependent networks, time-varying transmission delays, parameter variations, uncertainties, nonlinearities, etc. Moreover, deep links between network science and control theory have been gradually revealed within the last couple of years, which shed light into the consensus problem and make it a promising direction.
This Special Section in IEEE Access aims to bring together researchers and practitioners in the broad field of complex networks and systems, and provide a timely discussion on the recent advances and challenges of consensus problems in complex networked systems.
Topics of interested include, but are not limited to the following:
* Mathematical modeling and analysis of consensus processes
* Synchronization of complex networks
* Consensus seeking in multi-agent systems
* Controllability and observability of complex networks
* Distributed computation and distributed estimation
* Coordination in networked systems
* Formation control problems
* Robustness to changes in network topology and dynamics
* Consensus problems in networked dynamical systems
* Analysis of consensus algorithms
* Consensus related problems in engineering, biological, economic and social sciences
We also highly recommend the submission of multimedia with each article as it significantly increases the visibility, downloads, and citations of articles.
** Associate Editor: Yilun Shang, Tongji University, China
Email: shyl@tongji.edu.cn
** Guest Editors:
Dequan Li, Anhui University of Science and Technology, China
Zhaoxia Peng, Beihang University, China
Ali Heydari, Southern Methodist University, USA
Kamran Turkoglu, San Jose State University, USA
Johan Thunberg, University of Luxembourg, Luxembourg
** Manuscript Submission Deadline: 1 March 2017
** Paper submission: Contact Associate Editor and submit manuscript to: http://mc.manuscriptcentral.com/ieee-access
IEEE Access is a multidisciplinary, open access journal that provides a rapid, binary peer-review process with a decision of accept/reject in approximately 4 weeks.
------------------------------
Message: 2
Date: Tue, 30 Aug 2016 19:37:19 -0500
From: Miguel Pizana <map@xanum.uam.mx>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] YAGS - New Free Software for Graph Theory
Message-ID: <mailman.3.1472724001.34200.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset=UTF-8
Dear all,
I am pleased to announce YAGS, new free software for Graph Theory:
http://xamanek.izt.uam.mx/yags/
YAGS is a GAP (http://www.gap-system.org/) package that offers an ample set
of functions; a graph-drawing subsystem; many methods for dealing with
graph homomorphism; an Object-Oriented approach that simplifies the task of
working with several different graph categories; and a generic backtracking
subsystem useful to solve many combinatorial problems easily.
I hope you find it useful.
Cheers,
Miguel Pizaña.
------------------------------
Message: 3
Date: Wed, 31 Aug 2016 13:17:13 +0300
From: Stefka Fidanova <stefka.fidanova@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] metaheuristics for optimization problems
Message-ID: <mailman.4.1472724001.34200.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset=UTF-8
Dear Colleague,
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 10th International Conference on Large
Scale Scientific Computation - LSSC'17, June 5 - 9, 2017, Sozopol,
Bulgaria, with arrival: June 4 and departure: noon June 9.
The session is organized by:
Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institute of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.
Topics
The list of topics includes, but is not limited to:
combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc
Key speaker Kalin Penev, Southampton Solent University, UK
Title: Free Search - in multidimensional space M*+
Abstract: Multidimensional tasks with thousands parameters, seems to be an
embarrassing challenge for modern computational systems in terms of
software abilities and hardware capacity. Presented study focuses on
evaluation of thousands dimensional heterogeneous real-value numerical tests.
*In roman numerical system M = 1000 in decimal numerical system.
Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).
Important deadlines
Deadline for submission of abstracts
January 15, 2017
Notification of acceptance of the talks on the basis of the
submitted abstract
January 31, 2017
Deadline for submission of full papers
March 01, 2017
Notification of acceptance of full papers
April 15, 2017
Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).
Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom17/
Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque
--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
------------------------------
Message: 4
Date: Wed, 31 Aug 2016 12:56:39 +0200
From: Petr Hlineny <petr.hlineny@googlemail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Post-doc positions in Brno, CZ (correction)
Message-ID: <1472640999.19011.3.camel@acerv3>
Content-Type: text/plain; charset="UTF-8"
*** Post-doctoral open call FI MU 2017
(corrected link to the call)
The Faculty of Informatics of Masaryk University (FI MU) in Brno,
Czech Republic, http://www.fi.muni.cz/, invites applications for
Post-doctoral positions in all areas of Computer Science.
This includes, in particular, the area of
Structural and Topological/geometric Graph Theory,
and Algorithmic Metatheorems.
Please contact Petr Hlineny <hlineny@fi.muni.cz> if you are interested
in these particular topics (or can suggest a strong candidate).
* Offer
The positions are awarded for one year with an extension to the second
year after a review. Gross salary is 50,000 CZK per month which, with an
optional 10% bonus, sums to more than 24,000 EUR per year. Additional
funds of 4,000 EUR per year will be available for travel and material
expenses. Expected start date of the contract is Jan 1, 2017, but
a later start date may be negotiated.
* Deadline for application: October 31, 2016
* Requirements and application procedure
See: http://www.muni.cz/general/employment_offers/32687v
All candidates are expected to be fluent in English, while prior
knowledge of Czech is not required. Candidates will be evaluated on
the ground of their strong international research record.
--
Petr Hliněný <hlineny@fi.muni.cz>
FI MU
------------------------------
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 103, Issue 1
**************************************
No comments:
Post a Comment