Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Projection (défense)

Publications associées (6)

Aggregation of Power Capabilities of Heterogeneous Resources for Real-Time Control of Power Grids

Mario Paolone, Jean-Yves Le Boudec, Lorenzo Enrique Reyes Chamorro, Andrey Bernstein, Wajeb Saab

Aggregation of electric resources is a fundamental function for the operation of power grids at different time scales. In the context of a recently proposed framework for the real-time control of microgrids with explicit power setpoints, we define and form ...

Università degli Studi di Genova, Italy2016

Application of Power Time-Projection on the Operator Splitting Coupling Scheme of the TRACE/S3K Coupled Code

Rakesh Chawla, Damar Canggih Wicaksono, Hakim Ferroukhi

This paper reports refinement studies on the temporal coupling scheme and time-stepping management of TRACE/S3K, a dynamically coupled code version of the thermal-hydraulics system code TRACE and the 3D core simulator Simulate-3K. The studies were carried ...

American Nuclear Society2013

Printed sensors on smart RFID labels for logistics

Nico de Rooij, Danick Briand, Andres Felipe Vasquez Quintero, Francisco Molina Lopez, Giorgio Mattana

This communication presents an overview on our activities on the development of printed sensors on flexible polymeric foil for RFID. We are envisioning the direct printing of sensors on different types of products such as smart labels and RFID tags. This t ...

Ieee2012

Transactional Memory: Glimmer of a Theory

Rachid Guerraoui

Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent theoretical work on defining a theory of TM. We first recall some TM correctness properties and then overview results on the inherent powe ...

Springer2009

The Theory of Transactional Memory

Rachid Guerraoui

Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent work on defining a theory of TM. We first present a correctness condition of a TM, ensured by most existing TM implementations. Then, we d ...

2009

A General Characterization of Indulgence (Invited Paper)

Rachid Guerraoui

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevoca ...

2006