Events in January 2019
-
PhD Seminars IV
PhD Seminars IV
–
January 7, 2019Talk 1
Ghada Moualla (DIANA)
Title
Online Robust Placement of Service Chains for Large Data Center Topologies
Abstract
The trend today is to deploy applications and more generally Service Function Chains (SFCs) in public clouds. However, before being deployed in the cloud, chains were deployed on dedicated infrastructures where software, hardware, and network components were managed by the same entity, making it straightforward to provide robustness guarantees. By moving their services to the cloud, the users lose their control on the infrastructure and hence on the robustness. Thus, in our work, we introduce an online algorithm for robust placement of service chains in data centers. Our placement algorithm determines the required number of replicas for each function of the chain and their placement in the data center.
Talk 2
Speaker
Title
Mapping the Human BrainAbstract
Exploring the complexity of the human brain is a challenge that nowadays is tackled by scientists from every field from medicine to mathematics. In this talk I will show how it is possible to locally reconstruct the anatomy of the human brain and how this opens the possibility to study the whole brain as a network called connectome. Finally I will introduce some problem in brain connectivity estimation and analysis.
-
PhD Seminars V
PhD Seminars V
–
January 21, 2019Talk 1
Gibin Bose (FACTAS)
Title
A Convex Approach to the Finite Dimensional Matching Problem in Communication Systems
Abstract
The problem of impedance matching in communication systems is to minimize the power reflection that is to be transmitted, by a generator, to a given load within a frequency band. The matching and filtering requirements in classical communication systems are usually satisfied by using a matching circuit followed by a bandpass filter. We propose here to design finite degree matching filters that integrate both matching and filtering requirements in a single device and thereby increase the overall efficiency and compactness of the system. The matching problem is formulated as a convex optimization problem using two rich theories, namely Youla’s matching theory and analytic interpolation. This formulation provides accurate lower hard bounds for the best feasible matching level, as well as the practical synthesis of matching filters approaching those bounds.
Talk 2
Speaker
Title
Fundamentals of 3D renderingAbstract
Realistic rendering of 3D environments is used in many fields, from engineering and design to entertainment. It allows users to replicate the real world, test new concepts and explore virtual sceneries. Replicating the proper behaviour of materials and the many ways light interacts in a scene is a major challenge, sometimes complexified by the requirement of running in real-time. In this talk, I will introduce the fundamental principles of realistic rendering. Building on the theoretical ground provided by the rendering equation, we will cover the main approaches to simulate realistic illumination in 3D scenes, focusing on raytracing and rasterization. Finally, I will present some alternative rendering techniques studied in our team.