CFP: (Deadline Ext.) - ICC'17 Workshop - 5th IEEE SCPA 2017 - May 21-25, 2017. Paris, France

--===============8657052866846439618==
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: quoted-printable


Apologies for crossposting


-------------------- CALL FOR PAPERS (DEADLINE EXTENDED) ----------------=
-
5th IEEE International Workshop on Smart Communication Protocols and Algo=
rithms (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 Proto=
cols and Algorithms of the International Journal Network Protocols and Al=
gorithms (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 ne=
twork devices and exchange data between them. The appearance of new techn=
ologies usually comes with a protocol procedure and communication rules t=
hat allows data communication while taking profit of this new technology.=
 Recent advances in hardware and communication mediums allow proposing ne=
w rules, conventions and data structures which could be used by network d=
evices to communicate across the network. Moreover, devices with higher p=
rocessing capacity let us include more complex algorithms that can be use=
d by the network device to enhance the communication procedure.=20
      Smart communication protocols and algorithms make use of several me=
thods and techniques (such as machine learning techniques, decision makin=
g techniques, knowledge representation, network management, network optim=
ization, problem solution techniques, and so on), to communicate the netw=
ork devices to transfer data between them. They can be used to perceive t=
he network conditions, or the user behavior, in order to dynamically plan=
, adapt, decide, take the appropriate actions, and learn from the consequ=
ences of its actions. The algorithms can make use of the information gath=
ered from the protocol in order to sense the environment, plan actions ac=
cording to the input, take consciousness of what is happening in the envi=
ronment, and take the appropriate decisions using a reasoning engine. Goa=
ls such as decide which scenario fits best its end-to-end purpose, or env=
ironment prediction, can be achieved with smart protocols and algorithms.=
 Moreover, they could learn from the pas!
 t and use this knowledge to improve=20
future decisions.=20
      In this workshop, researchers are encouraged to submit papers focus=
ed on the design, development, analysis or optimization of smart communic=
ation protocols or algorithms at any communication layer. Algorithms and =
protocols based on artificial intelligence techniques for network managem=
ent, network monitoring, quality of service enhancement, performance opti=
mization and network secure are included in the workshop.=20
      We welcome technical papers presenting analytical research, simulat=
ions, 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 conce=
pts, state of the art, standards, deployments, implementations, running e=
xperiments and applications.=20

Topics of interest:
-------------------------------------------------------------------------=
-----------------------
      Authors are invited to submit complete unpublished papers, which ar=
e 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 pr=
otocols
     -  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 taki=
ng the appropriate actions
     -  Smart Automatic and self-autonomous ad-hoc and sensor networks
     -  Artificial intelligence applied in protocols and algorithms for w=
ireless, mobile and dynamic networks
     -  Smart security protocols and algorithms
     -  Smart cryptographic algorithms for communication
     -  Artificial intelligence applied to power efficiency and energy sa=
ving 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 deliver=
y, 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 co=
mmunication 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 E=
DAS: (https://edas.info/newPaper.php?c=3D22957&track=3D82208)

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

-------------------------------------------------------------------------=
-----------------------

General Chairs:
      Jaime Lloret Mauri, Universitat Politecnica Val=E8ncia, Spain
      Joel Rodrigues, National Institute of Telecommunications (Inatel), =
Brazil;
                               Instituto de Telecomunica=E7=F5es, Univ. o=
f Beira Interior, Portugal

TPC Chairs:
      Sandra Sendra, Universidad de Granada, Spain
      Kashif A. Saleem, Kind Saud University, Saudi Arabia
      Bruno Silva, Instituto de Telecomunica=E7=F5es, Universidade da Bei=
ra 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=E1nchez-Esguevillas, Telefonica R&D, Spain

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

Web Chair:
      Jo=E3o N. Isento, Instituto de Telecomunica=E7=F5es, Universidade d=
a Beira Interior, Portugal


--===============8657052866846439618==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

------------------------------------------------------------------------------
Developer Access Program for Intel Xeon Phi Processors
Access to Intel Xeon Phi processor-based developer platforms.
With one year of Intel Parallel Studio XE.
Training and support from Colfax.
Order your platform today.http://sdm.link/xeonphi
--===============8657052866846439618==
Content-Type: text/plain; charset="us-ascii"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

_______________________________________________
xine-codec-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/xine-codec-devel

--===============8657052866846439618==--