Energy inequality and clientelism in the wake of disasters: From colorblind to affirmative power restoration

Energy Policy ◽  
2021 ◽  
Vol 158 ◽  
pp. 112550
Author(s):  
Fernando Tormos-Aponte ◽  
Gustavo García-López ◽  
Mary Angelica Painter
2009 ◽  
Author(s):  
F. Mekic ◽  
Zhenyuan Wang ◽  
V. Donde ◽  
Fang Yang ◽  
J. Stoupis

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1795 ◽  
Author(s):  
Khaled Saleh

This article is the first of two in which we develop a relaxation finite volume scheme for the convective part of the multiphase flow models introduced in the series of papers (Hérard, C.R. Math. 354 (2016) 954–959; Hérard, Math. Comput. Modell. 45 (2007) 732–755; Boukili and Hérard, ESAIM: M2AN 53 (2019) 1031–1059). In the present article we focus on barotropic flows where in each phase the pressure is a given function of the density. The case of general equations of state will be the purpose of the second article. We show how it is possible to extend the relaxation scheme designed in Coquel et al. (ESAIM: M2AN 48 (2013) 165–206) for the barotropic Baer–Nunziato two phase flow model to the multiphase flow model with N – where N is arbitrarily large – phases. The obtained scheme inherits the main properties of the relaxation scheme designed for the Baer–Nunziato two phase flow model. It applies to general barotropic equations of state. It is able to cope with arbitrarily small values of the statistical phase fractions. The approximated phase fractions and phase densities are proven to remain positive and a fully discrete energy inequality is also proven under a classical CFL condition. For N = 3, the relaxation scheme is compared with Rusanov’s scheme, which is the only numerical scheme presently available for the three phase flow model (see Boukili and Hérard, ESAIM: M2AN 53 (2019) 1031–1059). For the same level of refinement, the relaxation scheme is shown to be much more accurate than Rusanov’s scheme, and for a given level of approximation error, the relaxation scheme is shown to perform much better in terms of computational cost than Rusanov’s scheme. Moreover, contrary to Rusanov’s scheme which develops strong oscillations when approximating vanishing phase solutions, the numerical results show that the relaxation scheme remains stable in such regimes.


2007 ◽  
Vol 36 (2) ◽  
pp. 265-284 ◽  
Author(s):  
Ningxiong Xu ◽  
Seth D. Guikema ◽  
Rachel A. Davidson ◽  
Linda K. Nozick ◽  
Zehra Çağnan ◽  
...  

Nanophotonics ◽  
2017 ◽  
Vol 6 (3) ◽  
pp. 507-530 ◽  
Author(s):  
Joe Touch ◽  
Yinwen Cao ◽  
Morteza Ziyadi ◽  
Ahmed Almaiman ◽  
Amirhossein Mohajerin-Ariaei ◽  
...  

AbstractOptical computing is needed to support Tb/s in-network processing in a way that unifies communication and computation using a single data representation that supports in-transit network packet processing, security, and big data filtering. Support for optical computation of this sort requires leveraging the native properties of optical wave mixing to enable computation and switching for programmability. As a consequence, data must be encoded digitally as phase (M-PSK), semantics-preserving regeneration is the key to high-order computation, and data processing at Tb/s rates requires mixing. Experiments have demonstrated viable approaches to phase squeezing and power restoration. This work led our team to develop the first serial, optical Internet hop-count decrement, and to design and simulate optical circuits for calculating the Internet checksum and multiplexing Internet packets. The current exploration focuses on limited-lookback computational models to reduce the need for permanent storage and hybrid nanophotonic circuits that combine phase-aligned comb sources, non-linear mixing, and switching on the same substrate to avoid the macroscopic effects that hamper benchtop prototypes.


Sign in / Sign up

Export Citation Format

Share Document