During last Monday’s seminar, which was the first of the Applied Mathematics chapter, we discovered a lot of things on Mesh adaptations and Fluid Dynamics, thanks to a really wonderful presentation by Eleanore Gauci of team ECUADOR. If you would like to find out more about this work, Eleanore suggests…
| Monday | Tuesday | Wednesday | Thursday | Friday | Saturday | Sunday |
|---|---|---|---|---|---|---|
| December 31, 2018 | January 1, 2019 | January 2, 2019 | January 3, 2019 | January 4, 2019 | January 5, 2019 | January 6, 2019 |
January 7, 20192:00 pm: PhD Seminars V2:00 pm: PhD Seminars VJanuary 7, 2019 – Talk 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
|
January 8, 2019 | January 9, 2019 | January 10, 2019 | January 11, 2019 | January 12, 2019 | January 13, 2019 |
| January 14, 2019 | January 15, 2019 | January 16, 2019 | January 17, 2019 | January 18, 2019 | January 19, 2019 | January 20, 2019 |
January 21, 20192:00 pm: PhD Seminars VI2:00 pm: PhD Seminars VIJanuary 21, 2019 – Talk 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
|
January 22, 2019 | January 23, 2019 | January 24, 2019 | January 25, 2019 | January 26, 2019 | January 27, 2019 |
| January 28, 2019 | January 29, 2019 | January 30, 2019 | January 31, 2019 | February 1, 2019 | February 2, 2019 | February 3, 2019 |
