Publication

Distributed modifier-adaptation schemes for the real-time optimisation of uncertain interconnected systems

Publications associées (48)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Paul Scharnhorst

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

EPFL2024

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Robert Granger, Thorsten Kleinjung, Benjamin Pierre Charles Wesolowski

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

AMER MATHEMATICAL SOC2021

Impacts of Metering-Based Dynamic Priority Schemes

Nikolaos Geroliminis, Raphael Ali Francis Lamotte

Several works published over the last two decades have shown for a stylized set-up with homogeneous users that metering-based priority (MBP) schemes may generate Pareto improving departure time adjustments similar to those induced by congestion pricing, bu ...

INFORMS2021

, , ,

Due to the rapidly growing number of devices that need to communicate securely, there is still significant interest in the development of efficient encryption schemes. It is important to maintain a portfolio of different constructions in order to enable a ...

Springer International Publishing2021

Stability properties of a projector-splitting scheme for dynamical low rank approximation of random parabolic equations

Fabio Nobile, Yoshihito Kazashi, Eva Vidlicková

We consider the Dynamical Low Rank (DLR) approximation of random parabolic equations and propose a class of fully discrete numerical schemes. Similarly to the continuous DLR approximation, our schemes are shown to satisfy a discrete variational formulation ...

SPRINGER HEIDELBERG2021

Pathway analysis of atmospheric VOC multi-generational degradation

The report is to build a scheme based on an algorithm proposed by Lehmann in order to do pathway analysis in atmospheric VOC aging. ...

2019

, ,

Currently, schemes based on seminal empirical knowledge about energy piles subjected to mechanical and thermal loads are available to describe the response of such foundations. However, schemes based on theoretical principles may more closely reflect the p ...

Springer Verlag2019

Multimedia contents are inherently sensitive signals that must be protected when processed in untrusted environments. The field of Secure Signal Processing addresses this challenge by developing methods which enable operating with sensitive signals in a pr ...

ASSOC COMPUTING MACHINERY2019

Solving hyperbolic conservation laws on general grids can be important to reduce the computational complexity and increase accuracy in many applications. However, the use of non-uniform grids can introduce challenges when using high-order methods. We propo ...

2018

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

2018