I will discuss the limitations of the current state of the art, and present a proposal for an integrated pipeline, considering data acquisition, meshing, basis design, and numerical optimization as a single challenge, where tradeoffs can be made between different phases to increase automation and efficiency. I will demonstrate that this integrated approach offers many advantages, while opening exciting new geometry processing challenges, and that a fully opaque meshing and analysis solution is already possible for heat transfer and elasticity problems with contact. I will present a set of applications enabled by this approach in reinforcement learning for robotics, force measurements in biology, shape design in mechanical engineering, stress estimation in biomechanics, and simulation of deformable objects in graphics.

Many tasks in the analysis and synthesis of (collections of) 3D shapes boils down to computing a map between two surfaces. Such inter-surface maps can be used to establish correspondences, to transfer information or annotation from one object to another, or to plausibly deform one shape into another. If the two shapes are represented as polygon meshes, a continuous inter-surface map does not only assign the vertices of the source mesh to the target mesh but also maps the interior of the triangles which adds to the complexity of the task.

We will discuss several settings in which smooth developable strips are attached to each other or assembled in some other way to obtain surfaces with interesting geometric properties. Driven by the view towards applications we will investigate collections of strips which lie orthogonal or tangential to a reference surface and assume particular shapes. Such strips can serve as support structures or cladding panels of free-form shapes in architectural contexts. Our focus will lie on surfaces with a constant ratio of principal curvatures, cone nets, geodesic grid shells, and others.

In this talk I will discuss the shift towards hardware acceleration and show with several examples from industry and from research the large role that FPGAs are playing. I will hypothesize that we are in a new era where most of the established assumptions, rules of thumb, and accumulated wisdom about many aspects of computation in general and of data processing in particular no longer hold and need to be revisited.

We present a topological analysis of the vorticity formulation in describing fluid dynamics.  Despite its widespread use in fluid mechanics, this formulation is insufficient at describing fluid dynamics on a non-simply-connected domain.  What is missing is an equation of motion for fluid's cohomology component, which exhibits fascinating dynamics previously under explored.  Using geometric language, we derive the new equation of motion and establish new conservation laws, as Casimir invariants in Hamiltonian mechanics, for fluids on domains with general topology.  Significantly, we present the first physically correct vortex method on curved surfaces with genus and boundaries.

Being able to accurately solve PDEs on arbitrary polygonal/polyhedral meshes is a central goal and has been considered for various differential operators over the last years. In this talk I will present a simple approach for computing (piecewise) linear and quadratic basis functions for general polygons and polyhedra, from which discrete operators for gradient, divergence and Laplacian can be derived.

In this talk, I will discuss our recent advances in approximation of free-form surfaces by motions of curvature varying tools in the context of 5-axis flank CNC machining. In particular, I will discuss path-planning strategies using fixed tools, or custom-shaped ones, and on an example of spiral bevel gears will demonstrate even more efficient variant of flank machining, called double-flank.

The “KAUST Workshop on Applied Geometry and Visual Computing” brings together leading scientists from Europe and the United States, presenting their latest results in - Applied and Discrete Differential Geometry - Geometry Processing - Computational Fabrication The talks are related to various problems in Applied Mathematics in general and to further areas of Visual Computing such as Computer Graphics, Physical Simulation and Scientific Visualization. The workshop provides a great opportunity to learn about latest developments and to discuss ongoing work with top researchers in the field.

I will present a data science pipeline which starts with Earth observation data arriving in the ground segment of a satellite mission and ends with a complete user application. I will first briefly present all the tools my group has been developing since 2010 for supporting the various stages of the pipeline. Then, I will concentrate on the recently developed system Strabo 2 which can store big geospatial data encoded in RDF and query them using the Open Geospatial Consortium standard GeoSPARQL. Strabo 2 is the only parallel and distributed RDF store available today that can manage terabytes of geospatial data efficiently.

Inevitably, the projection of most graph structures on two-dimensional screens will create errors and therefore visually wrong impressions. In the past, two types of methods have been developed to minimize projection errors and distribute them in a visually pleasing way. The first group of methods, force-directed layouts, interpret the links of a graph as physical springs, while stress-based methods minimize an energy function, which aims to map graph distances faithfully.

In computer vision, generative AI models are typically built for images, videos, and 3D objects. Recently, there has emerged a paradigm of neural fields, which unifies the representations of such types of data by parametrizing them via neural networks. In this thesis, we develop generative models for images, videos, and 3D scenes which treat the underlying data in such a form and explore the benefits which such a perspective provides.

The success of Generative Adversarial Networks (GANs) has resulted in unprecedented quality both for image generation and manipulation. Recent state-of-the-art GANs (e.g., the StyleGAN series) have demonstrated outstanding results in photo-realistic image generation. In this dissertation, we explore the latent space properties, including image manipulation, extraction of 3D properties, and performing various weakly supervised and unsupervised downstream tasks using StyleGAN and its derivative architectures.

Entrepreneurs continue to be the driver for economic development and innovation. Some startups invent brand new markets while other manage to enter markets crowded by existing large companies. In this seminar we will explore making critical early decisions starting from chaos and creating an exciting new business. We will gain insights on the value of learning by doing, prototyping, discussing tradeoffs between analysis, experimentation and scale.  We will also review courses offered by KAUST Entrepreneurship Center.

In this work we focus our attention on distributed optimization problems in the context where the communication time between the server and the workers is non-negligible. We obtain novel methods supporting bidirectional compression (both from the server to the workers and vice versa) that enjoy new state-of-the-art theoretical communication complexity for convex and nonconvex problems.

In this talk, we will define prototypical random walks, a mechanism we introduced to improve visual classification with limited data (few-shot learning), and then developed the mechanism in a conceptually different way to facilitate novel image generation and unseen class recognition tasks. More specifically, in the few-shot learning setting, we will show how we can develop a random walk semi-supervised loss that enables the network to learn representations that are compact and well-separated.

The Visual Computing Center at KAUST offers a unique opportunity to strengthen this link between architecture and science. We invite interested students of architecture to a week-long workshop on computational architecture. We want to bridge the gap between the latest research in geometry, computer graphics, simulation and modeling, and machine learning and design practice. Participants will have the opportunity to learn directly from our professors about their latest results in their fields.

With video data dominating the internet traffic, it is crucial to develop automated models that can analyze and understand what humans do in videos. Such models must solve tasks such as action classification, temporal activity localization, spatiotemporal action detection, and video captioning. This dissertation aims to identify the challenges hindering the progress in human action understanding and propose novel solutions to overcome these challenges.

Trusted Execution Environments (TEEs) ensure the confidentiality and integrity of computations in hardware. Subject to the TEE's threat model, the hardware shields a computation from most externally induced fault behavior except crashes. As a result, a crash-fault tolerant (CFT) replication protocol should be sufficient when replicating trusted code inside TEEs.  However, TEEs do not provide efficient and general means of ensuring the freshness of the external, persistent state. Therefore, CFT replication is insufficient for TEE computations with an external state, as this state could be rolled back to an earlier version when a TEE restarts.  Furthermore, using BFT protocols in this setting is too conservative, because these protocols are designed to tolerate arbitrary behavior, not just rollback during a restart.

Building on the work of Schöberl, Olshanskii, and Benzi, in this talk we present the first preconditioner for the Newton linearization of the stationary Navier--Stokes equations in three dimensions that achieve both optimal complexity in of count and Reynolds-robustness. The exact details of the preconditioner varies with discretization, but the general theme is to combine augmented Lagrangian stabilisation, a custom multigrid prolongation operator involving local solves on coarse cells, and an additive patchwise relaxation on each level that captures the kernel of the divergence operator.

This seminar focuses on providing the audience with the context and scope of our internship program. The program is for the young and talented graduate students with an active interest in solving real-world problems. Some of the projects that will be presented in the seminar are actively developed in Elm and include domains such as computer vision, robotics and automation, healthcare, IoT, video analytics, and NLP. The seminar will serve as a launch pad to allow students to discuss their future interests and aspirations with the speaker. It will also enable them to develop a better awareness of domains more relevant to their future research aspirations.

In this talk, I will first give a convergence analysis of gradient descent (GD) method for training neural networks by relating them with finite element method. I will then present some acceleration techniques for GD method and also give some alternative training algorithms

Parameter-free online optimization is a class of algorithms that does not require tuning hyperparameters, yet they achieve the theoretical optimal performance. Moreover, they often achieve state-of-the-art performance too. An example would be gradient descent algorithms completely without learning rates. In this talk, I review my past and present contributions to this field. Building upon a fundamental idea connecting optimization, gambling, and information theory, I discuss selected applications of parameter-free algorithms to machine learning and statistics. Finally, we conclude with an overview of the future directions of this field.

The aim of this course is to familiarize the students with the usage of Computer Simulation tools for complex problems. The course will introduce the basic concepts of computation through modeling and simulation that are increasingly being used in industry and academia. The basic concepts of Discrete Event Simulation will be introduced along with the reliable methods of random variate generation and variance reduction. Later in the course, the concept of simulation-based optimization and output analysis will be discussed. The example of simulation (and optimization) applied to design an optimal organ allocation policy in the US will be discussed.

The aim of this course is to familiarize the students with the usage of Computer Simulation tools for complex problems. The course will introduce the basic concepts of computation through modeling and simulation that are increasingly being used in industry and academia. The basic concepts of Discrete Event Simulation will be introduced along with the reliable methods of random variate generation and variance reduction. Later in the course, the concept of simulation-based optimization and output analysis will be discussed. The example of simulation (and optimization) applied to design an optimal organ allocation policy in the US will be discussed.

In this talk I will report on various research projects that I carried out with my students to better understand the interaction landscape and will report on lessons we learned. I will focus mostly on AR-based setups with application examples from physical flow visualization, molecular visualization, visualization of particle collisions, biomolecular dynamics in cells, and oceanography. I will show interaction techniques that rely on purely gestural interaction, phones or tablets as input and control devices, and hybrid setups that combine traditional workstations with AR views. I will discuss navigation, data selection, and visualization system control as different interaction tasks. With this overview I aim to provide an understanding of typical challenges in immersive visualization environments and how to address some of these challenges.