var sms = '<div id="sms_bulletin">  <div id="sms_header">  <div class="do_not_print" id="arrow_left"><a href="?next=-3"><img src="//www2.math.ethz.ch/smsjs/images/arrow_left.png"/></a></div><div class="do_not_print" id="arrow_right"><a href="?next=-1"><img src="//www2.math.ethz.ch/smsjs/images/arrow_right.png"/></a></div>    <div class="sms_title">      <span style="float: left;">SMS</span>      <span>SWISS MATHEMATICAL SOCIETY</span>      <span style="float: right;">SMG</span>    </div>    <div class="sms_info">      <span style="float: left; width: 250px;">Bulletin no. 5</span>      <span style="float: right; text-align:right; width: 250px;">1.7 - 5.7.2024</span>      <span style="text-align: center; display: block; width: 250px; margin: auto; position: relative;">Summer Break 2024</span>    </div>  </div>  <div></div>  <div id="sms_content">    <div class="day">      <div class="day_title">        Monday, July 1      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_la"><a class="external" href="https://www.epfl.ch">EPF Lausanne</a></div><div class="event_type"><a class="external" href="https://theory.epfl.ch/seminar/">Theory and Combinatorics Seminar</a></div><br /><div class="event_speaker"> Moritz Venzin</div><div class="event_title">Stronger adversaries for better forests <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />We consider the online node-weighted Steiner forest problem (NWSF): given a graph and a node-weight function, terminal pairs arrive one by one and we need to immediately augment a subgraph to connect the pair. To use an edge, we need to have purchased its two incident vertices. The node-weighted setting is a significant generalisation of the edge-weighted setting and unifies network design problems and covering problems such as set cover and non-metric facility location.In this talk, I will present a near-optimal online algorithm for the online node-weighted Steiner forest. Key to our approach is to consider stronger, partially adaptive adversaries which permits to combine the natural greedy algorithm with a non-standard instance of randomised non-metric facility location. For the latter and this new adversarial setting, we provide an online algorithm with sharper bounds on the cost of facilities and connections opened, which can then be leveraged to give tight control on the cost incurred by greedy. Specifically, we obtain a competitive ratio of $O(\\log k \\log n)$ for NWSF, where $k$ is the number of terminals pairs arriving and $n$ is the number of nodes in the graph.This is joint work with Sander Borst (CWI) and Marek Elias (Bocconi).</div><div class="event_time">11:00 &bull; EPF Lausanne, CM 517</div>        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Tuesday, July 2      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_ge"><a class="external" href="https://unige.ch">Université de Genève</a></div><div class="event_type"><a class="external" href="https://www.unige.ch/math/annonces/seminaire-danalyse-numerique">Séminaire d\'Analyse Numérique </a></div><br /><div class="event_speaker"> Conor  McCoid (Laval Universitiy, Quebec)</div><div class="event_title">Adaptively optimized Schwarz methods <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />Optimized Schwarz methods use Fourier analysis or similar to find transmission conditions between subdomains that provide faster convergence over standard Schwarz methods. However, this requires significant upfront analysis of the operator, and may not be straightforward for all problems. This work presents black box methods for adaptively optimizing the transmission conditions, which is equivalent to an optimal Krylov subspace method.</div><div class="event_time">14:00 &bull; Université de Genève, Conseil Général 7-9, Room 1-05</div>        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Wednesday, July 3      </div>      <div class="day_content">        <div class="day_content_item normal"><div class="event_location uni_la"><a class="external" href="https://www.epfl.ch">EPF Lausanne</a></div><div class="event_type"><a class="external" href="https://www.epfl.ch/labs/mathicse/">Computational Science and Engineering </a></div><br /><div class="event_speaker"> Tan Bui  Thanh (The University of Texas at Austin)</div><div class="event_title">Learn2Solve: A Deep Learning Framework for Real-Time Solutions of forward, inverse, and UQ Problems <span class="abstract-button do_not_print">abstract</span></div><div class="abstract-text" style="display: none"><strong>Abstract:</strong><br />Digital models (DMs) are designed to be replicas of systems and processes. At the core of a digital model (DM) is a physical/mathematical model that captures the behavior of the real system across temporal and spatial scales. One of the key roles of DMs is enabling “what if” scenario testing of hypothetical simulations to understand the implications at any point throughout the life cycle of the process, to monitor the process, to calibrate parameters to match the actual process and to quantify the uncertainties. In this talk, we will present various (faster than) real-time Scientific Deep Learning (SciDL) approaches for forward, inverse, and UQ problems. Both theoretical and numerical results for various problems including transport, heat, Burgers, (transonic and supersonic) Euler, and Navier-Stokes equations will be presented.</div><div class="event_time">11:15 &bull; EPF Lausanne, CM 1 517</div>        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Thursday, July 4      </div>      <div class="day_content">        <div class="day_content_item no_event">        No events scheduled today!        </div>      </div>    </div>    <div class="day">      <div class="day_title">        Friday, July 5      </div>      <div class="day_content">        <div class="day_content_item no_event">        No events scheduled today!        </div>      </div>    </div>  </div>  <div id="sms_footer">    address: Alessandra Naldi Windler, Departement Mathematik, HG G 51.4, ETH Zurich, Raemistrasse 101, CH-8092 Zurich<br />    email: <a href="mailto:bulletin@math.ch">bulletin@math.ch</a> | phone: +41 44 632 3684 | url: <a href="https://math.ch">https://math.ch</a>    <br /><br /><img src="//www2.math.ethz.ch/smsjs/sms_logo.gif" width="150" alt="SMS/SMG Logo" title="SMS/SMG Logo" />  </div></div>';