Concept

État du résultat global

Publications associées (32)

Estimating Future Costs and Carbon Footprints of PEMEC and SOEC Manufacturing

The net-zero emission target necessitates a significantly expanded deployment of clean technologies compared to their current utilization. Precisely estimating the future potential of these technologies requires a thorough understanding of their cost and c ...

2023

Toward Sustainable and Cost-Effective CO2 Conversion Processes to Propylene Carbonate Based on Ionic Liquids

Elia Mercedes Ruiz Pachon

The use of ionic liquids (ILs) for CO2 capture and utilization into a valuable product is attracting interest even though literature evaluating their sustainability is scarce. A liquid-liquid extraction (LLE)-based separation is recently proposed as an alt ...

WILEY-V C H VERLAG GMBH2022

Performance Estimation of High-Level Dataflow Program on Heterogeneous Platforms

Marco Mattavelli, Simone Casale Brunet, Aurélien François Gilbert Bloch

The performance of programs written in languages following the dataflow model of computation (MoC) largely depends on the configuration (partitioning, mapping, scheduling, buffer dimensioning) chosen during the synthesis stages. Furthermore, this programmi ...

2022

Inventory of Problems: The Genesis of the Rotterdam Kunsthal by OMA/Rem Koolhaas, 1987-1992

Tibor Bonaventura Pataky

The Kunsthal in Rotterdam is a key work in the oeuvre of OMA/Rem Koolhaas that marks the threshold between the firmâs architectural production of the decades before and after 1990. This doctoral thesis aims at a deeper and comprehensive understanding of ...

EPFL2021

Interacting Dirac materials

We investigate the extent to which the class of Dirac materials in two-dimensions provides general statements about the behavior of both fermionic and bosonic Dirac quasiparticles in the interacting regime. For both quasiparticle types, we find common feat ...

IOP PUBLISHING LTD2020

On Simplices in Diameter Graphs in R-4

Andrei Kupavskii

A graph G is a diameter graph in R-d if its vertex set is a finite subset in R-d of diameter 1 and edges join pairs of vertices a unit distance apart. It is shown that if a diameter graph G in R-4 contains the complete subgraph K on five vertices, then any ...

Maik Nauka/Interperiodica/Springer2017

A Framework for Collaborative Curation of Neuroscientific Literature

Sean Lewis Hill, Christian O'Reilly, Elisabetta Iavarone

Large models of complex neuronal circuits require specifying numerous parameters, with values that often need to be extracted from the literature, a tedious and error-prone process. To help establishing shareable curated corpora of annotations, we have dev ...

Frontiers Research Foundation2017

The fundamental plane of EDisCS galaxies The effect of size evolution (vol 524, A6, 2010)

Pascale Jablonka

We discovered a mistake in Eqs. (7) and (10) of Saglia et al. (2010, A&A, 524, A6), which propagates to Tables 8 and 9 and Fig. 25. We revise the tables, the figure and the affected statements in the paper. As a result, the reduction in the luminosity evol ...

Edp Sciences S A2016

On The Number Of Ordinary Conics

Frank de Zeeuw, Adrian Claudiu Valculescu

We prove a lower bound on the number of ordinary conics determined by a finite point set in R-2. An ordinary conic for S subset of R-2 is a conic that is determined by five points of S and contains no other points of S. Wiseman and Wilson proved the Sylves ...

Siam Publications2016

Distinct Values Of Bilinear Forms On Algebraic Curves

Frank de Zeeuw, Adrian Claudiu Valculescu

Let B-M : C x C -> C be a bilinear form B-M(p, q) - p(T)Mq, with an invertible matrix M is an element of C-2x2. We prove that any finite set S contained in an irreducible algebraic curve C of degree d in C determines Omega(d)(vertical bar S vertical bar(4/ ...

Univ Calgary, Dept Math & Statistics2016

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