CITI Talk: Spectrum sharing and co-exististence of radar and communication systems – ​​Visa Koivunen (Aalto University, Finland​) – 30/11​ at​ 4pm, Amphi Chappe

Leave a comment
Visa Koivunen, Aalto-yliopisto, Aalto University, School of Electrical Engineering, ELEC, 2011
Abstract: The coexistence of radar and communication has received a lot of attention from the research community in the recent years due to a considerable number of wireless systems that share the same spectral band, e.g.,  LTE, 5G, WiFi and S-band radars. In a plain coexistence scenario, each system tries to mitigate the interference from the other one. In a co-operative scenario, there is some exchange of information between the two systems, for example, channel state or interference awareness. In this talk, waveform optimization methods for target detection and parameter estimation are presented in a co-operative scenario. Mutual Information, and channel and interference awareness are exploited in optimization. Generalized multicarrier waveform model is employed in the radar system. Additional constraints on the waveform properties are imposed. In target parameter estimation, the objective function maximizes the Fischer Information (or minimizes CRB). Simulation examples of optimizing waveforms for target detection and parameter are provided. Time allowing, precoder-decoder design approach employing interference alignment is presented for co-existing radar and communication system.

CITI Talk: Complex Event Processing over Data Streams – Syed Gillani (ATER CITI / TC INSA de Lyon), September 25th at 11am in TD-D

Leave a comment
26787db

Title

Complex Event Processing over Data Streams

Abstract
The concept of event processing is established as a generic computational paradigm in various application fields, ranging from data processing in Web environments, over maritime and transport, to finance and medicine. Events report on state changes of a system and its environment. Complex Event Processing  (CEP) in turn, refers to the identification of complex/composite events of interest, which are collections of simple events that satisfy some pattern, thereby providing the opportunity for reactive and proactive measures. Examples include the recognition of attacks in computer network nodes, human activities on video content, emerging stories and trends on the Social Web, traffic and transport incidents in smart cities, fraud in electronic marketplaces, etc. The goal of this talk is to first provide an overview of this field and second discuss some major challenges that arise due to the high volume and velocity of the generated event streams. In the end I will discuss the building blocks of our recent system to mitigate the inherent issues in CEP.

Biography
Syed Gillani is currently an ATER in CITI INSA Lyon. His research interests are in the broad area of database systems, stream processing, query optimisations and Semantic Web. During his PhD he proposed various techniques to bridge the gap between core Semantic Web concepts and database optimisation techniques. Furthermore, he proposed a new query language and its implementation for the Semantic Complex Event Processing.


CITI Talk: “Multi-Agent Simulation and High Performance Computing on Graphics Cards”, Fabien Michel, associate professor HDR (lab. LIRMM, UMR Univ. Montpellier / CNRS)

Leave a comment
fabien-michel

Titre

Simulation multi-agents et calcul haute performance sur carte
graphique

Résumé

Nombre de systèmes complexes sont aujourd’hui étudiés par simulation
grâce à des modèles basés sur le paradigme multi-agents. Dans ces
modèles, les individus, leur environnement  et leurs interactions sont
directement représentés. Ce type de simulation nécessite parfois de
considérer un grand nombre d’entités, ce qui pose des problèmes de
performance et de passage à l’échelle. Dans ce  cadre, la programmation
sur carte graphique  (GPGPU) est une solution attrayante : elle permet
des gains de performances très conséquents sur des ordinateurs
personnels. Le GPGPU nécessite cependant une programmation extrêmement
spécifique qui limite à la fois son accessibilité et la réutilisation
des développements réalisés, ce qui est particulièrement vrai dans le
contexte de la simulation multi-agents. Dans cet exposé, nous
présenterons cette technologie et les travaux de recherche que nous
avons réalisés afin de pallier ces difficultés. Nous décrirons en
particulier une méthode de conception, appelée délégation GPU, qui
permet (1) d’adapter les modèles multi-agents au contexte du GPGPU et de
(2) faciliter la réutilisation des développements associés.

Bio

Fabien Michel est titulaire d’un doctorat en informatique obtenu à
l’Université de Montpellier en 2004. De 2005 à 2008, il a exercé en tant
que maître de conférences au CReSTIC de Reims avant de rejoindre le
Laboratoire d’Informatique, de Robotique et de Microélectronique de
Montpellier (LIRMM) où il exerce actuellement. Ses recherches
s’inscrivent principalement dans le domaine de la modélisation et de la
simulation de systèmes multi-agents (SMA) et reposent sur la proposition
de modèles formels et conceptuels (e.g. le modèle IRM4S) et d’outils
logiciels génériques (plates-formes MaDKit et TurtleKit), ainsi que sur
leur utilisation dans divers domaines tels que le jeu vidéo, le
traitement numérique de l’image ou la robotique collective. Plus
spécifiquement, le fil rouge de ses travaux, synthétisé dans son HDR
obtenue en 2015, repose sur une approche dite
« environement-centrée » (E4MAS) : contrairement aux approches centrées
sur la conception des comportements individuels, il s’agit de considérer
l’environnement des agents comme une abstraction de premier ordre dont
le rôle est primodial. En particulier, il a récemment décliné cette
démarche afin de proposer une approche originale dans le cadre de
l’utilisation du calcul haute performance sur carte graphique (GPGPU)
pour la simulation de SMA.


CITI Talk: “New achievable rate regions for fundamental network information theory problems”, Arun Padakandla (Purdue University, IN, USA), 17/07 14h

Leave a comment
dsc03605furthercropped
Title
New achievable rate regions for fundamental network information theory problems
Speaker
Arun Padakandla (Purdue University, IN, USA)
Abstract
In this talk, we consider the fundamental information-theoretic problems of characterizing 2) the capacity regions of channel coding problems such as broadcast, interference and 2) necessary and sufficient conditions for joint source-channel coding of distributed correlated sources. Going beyond independent and identically distributed codewords, we propose the ensemble of coset codes possessing algebraic closure properties and derive new achievable rate regions (inner bounds) to the capacity regions of the former problems with three or more receivers. Our findings are based on characterizing performance of new encoding and decoding rules that exploit the algebraic properties of these codes. Next, we observe that the conventional approach of single-letter coding is sub-optimal for joint source channel coding over multiple access and interference channels. We propose a novel multi-letter coding technique based on appropriately stitching together single-letter techniques. Most importantly, we characterize an inner bound to its performance via a single-letter expression, which is proven to strictly enlarges currently known single-letter achievable rate regions based on single-letter coding. This puts forth a useful technique for characterizing new inner bounds to problems that might not permit an optimal single-letter technique.
 

CITI Talk: “Machine Learning for Solving Software Maintenance and Evolution Problems”, Gabriela Czibula, Prof. & Istvan Czibula, Ass. Prof, University of Babes-Bolyai, Computer Science Dept, 10/07, 11h

Leave a comment
poza1

Gabriela Czibula, Prof., and Istvan Czibula, Ass. Prof, University of Babes-Bolyai, Computer Science Dept will present “Machine Learning for Solving Software Maintenance and Evolution Problems + Presentation of the Faculty of Mathematics and Computer Science, Babes-Bolyai University and MLyRE Research Group” at the CITI Lab on Monday, July 10th 2017.

http://www.cs.ubbcluj.ro/~gabis/

http://www.cs.ubbcluj.ro/~istvanc/


CITI Talk: “Medium Access Protocols for Wireless Sensor Networks” by Abdelmalik Bachir, Biskra University, Algeria in Amphi Chappe, June 20th 2017

Leave a comment
image011

Abstract
There has been a growing interest on understanding and optimizing Wireless Sensor Network MAC protocols in recent years, where the limited and constrained resources have driven research towards primarily reducing energy consumption of MAC functionalities. In this talk, we expose the prime focus of WSN MAC protocols, design guidelines that inspired these protocols, as well as drawbacks and shortcomings of the existing solutions and how existing and emerging technology will influence future solutions.

Bio
Abdelmalik Bachir received the graduate degree from the National Institute of Informatics, Algiers, Algeria, in 2001, the DEA diploma in informatics from the University of Marseille, France, in 2002, and the PhD degree from Grenoble Institute of Technology, France, in 2007. He took research positions at Avignon University, France Telecom R&D, Grenoble Institute of Technology, Imperial College London, as well as CERIST Research Centre, Algiers. Currently, he is a professor at Biskra University, Algeria and a consultant at Imperial Innovations. His research interests include: MAC and Routing protocols for wireless networks, wireless network deployment optimisation, mobile user mobility profiling, and inter-vehicle communication.


CITI Talk: “Entropy and Cost of Anti Uniform Huffman Codes” by Daniela Tarniceriu, Technical University “Gh. Asachi” of Iasi, Romania in Amphi Chappe, June 12th

Leave a comment
photo

Abstract

In this talk, the class of anti-uniform Huffman (AUH) codes for anti-uniform sources with finite and infinite alphabets is considered. The characteristics of such sources as well as Huffman codes for such sources are first recalled. The sequence of bits corresponding to the output of a anti-uniform source encoded with a Huffman code is modeled by a Markov source. Its characteristics are derived from the encoding procedure describing the Huffman code. The Huffman encoding process is viewed as a transmission through a channel, which input would be the input symbols, and its output, the output bits.
The class of AUH sources is known for their property of achieving minimum redundancy in several situations. It has been shown that AUH codes potentially achieve the minimum redundancy of a Huffman code of a source for which the probability of one of the symbols is known. The AUH codes are efficient in highly unbalanced cost regime, with minimal average cost among all prefix–free codes. These properties determine a wide range of applications and motivate for the study of these sources from the information theory perspective.
Starting from the AUH structure, the average codeword length, the code entropy and the average cost are derived. These results are customized for finite and infinite sources with different distributions (Poisson, negative binomial, geometric and exponential).

Bio
Daniela Tarniceriu (PhD. 1997) is a full professor at the Technical University “Gh. Asachi” of Iasi, Romania since 2001. Her research interests are in the fields of information theory, digital signal processing, statistical signal processing, data compression and encryption. She is the co-author of 8 books, 85 journal papers and 65 conference papers. She was involved in several research grants: two as scientific leader, two as coordinator, and 12 as scientist.
Since 2016, she is the Dean of the Faculty of Electronics, Telecommunications and Information Technology (ETTI) of the Technical University “Gh. Asachi” of Iasi, Romania and between 2008 and 2016 she was the head of the “Telecommunications” Department of the ETTI. Since 2013 she is the head of the Doctoral School of the ETTI.


CITI Talk: “Event Detection in Nanoscale Networks via Molecular Communication” by Trang Mai, Queen’s University of Belfast on June, 16th – 14:00 in TD C

1 Comment
unnamed

Abstract

Recent advances in synthetic biology and chemistry are making it possible to form
networks consisting of nanoscale devices—known as nanomachines—with
applications in medicine and environmental protection. These nanoscale devices,
often known as nanomachines, have a limited ability to sense their environment,
communicate and take simple actions. A key potential application is therefore event
detection, where the nanoscale network seeks to identify the presence of an
undesirable state, such as markers of an illness.

To support event detection, the nanoscale network must be able to communicate
observations from sensing nanomachines to a fusion center, where a decision can
be made. Due to strict size and energy constraints, this communication is a
challenging problem. Recently, a new approach known as molecular communication
has been proposed, where information is encoded in the state of molecules, such as
the release time, number, or type of molecules, which diffuse from the transmitter to
the receiver through a fluid. This new medium has dramatically different features
than traditional electromagnetic and accoustic media, which requires new channel
models, as well as encoding and decoding strategies.

In this seminar, I will introduce the principles of molecular communication,
highlighting the differences from traditional communication schemes. I will then show
how molecular communication can support collaboration in nanoscale networks. In
particular, I will present a new event detection scheme for nanoscale networks,
which accounts for the unique characteristics of the underlying molecular
communication links—known as the anomalous diffusion channel.

Speaker biography

Mai Cong Trang currently is PhD candidate in Molecular Communications under the
supervision of Dr. Trung Q. Duong at Queen’s University Belfast and Dr. Malcolm
Egan at INSA Lyon. He received the B.S. degree in Electronic and Electrical
Engineering in 2008 at Le Quy Don Technical University, Vietnam. Then, in 2013, he
received the M.S. degree in Electronics and Communications Engineering at The
University of Electro‐Communications, Japan. His current research interests include
Molecular Communications, Nanomachine Networks and Bio-inspired Networks.

https://sites.google.com/view/maicongtrang/


CITI talks: “Modeling Energy Packets Networks with Markov chains: Analytical Solutions” by Jean-Michel Fourneau, UVSQ on 6th April

Leave a comment
jmfourneau

In this talk, Jean-Michel Fourneau will present some analytic solutions of Queueing Network models that jointly model the data packets and the energy consumed by the transmission and reception. These models are based on the energy discretization, we talk then about energy Packets.

Bio

Jean-Michel Fourneau is Professor of Computer Science at the University of Versailles St Quentin, France since 1992. He was formerly with Ecole Nationale des Telecommnications, Paris and University of Paris XI Orsay as an Assistant Professor. He graduated in Statistics and Economy from Ecole Nationale de la Statistique et de l’Administation Economique, Paris and he obtained is PHD
and his habilitation in Computer Science at Paris XI Orsay in 87 and 91 respectively. He is a member of IFIP WG7.3. His recent research interests are
algorithmic performance evaluation, Stochastic Automata Networks, G-networks, stochastic bounds, and application to high speed networks, all optical networks and energy consumption.


CITI Talk: “POETS : partially ordered event triggered systems”, Dr David Thomas, Imperial College on 5th April 16:00

Leave a comment
david-tojpeg_1433837016044_x2

POETS : partially ordered event triggered systems

The POETS project is a five-year effort to build a combined software and hardware system which allows applications to be split into 1M+ concurrent state machines, and then to execute them on 100K+ concurrent hardware threads across 100+ tightly-coupled compute nodes. To achieve this we use an event-driven compute system with no global barriers or shared state, and re-write applications to use globally asynchronous algorithms. This talk will give an overview of the hardware that is being built, and show how applications such as finite-volume solvers can be re-cast as a asynchronous system.