The Effect of Electricity Prices on Residential Solar PV Adoption : Fukushima as a Natural Experiment

Publisher PD

Retrofit and New-Build Installations of Residential Solar PV : Fukushima as a Natural Experiment

Publisher PD

Private Summation in the Multi-Message Shuffle Model

The shuffle model of differential privacy (Erlingsson et al. SODA 2019; Cheu et al. EUROCRYPT 2019) and its close relative encode-shuffle-analyze (Bittau et al. SOSP 2017) provide a fertile middle ground between the well-known local and central models. Similarly to the local model, the shuffle model assumes an untrusted data collector who receives privatized messages from users, but in this case a secure shuffler is used to transmit messages from users to the collector in a way that hides which messages came from which user. An interesting feature of the shuffle model is that increasing the amount of messages sent by each user can lead to protocols with accuracies comparable to the ones achievable in the central model. In particular, for the problem of privately computing the sum of $n$ bounded real values held by $n$ different users, Cheu et al. showed that $O(\sqrt{n})$ messages per user suffice to achieve $O(1)$ error (the optimal rate in the central model), while Balle et al. (CRYPTO 2019) recently showed that a single message per user leads to $\Theta(n^{1/3})$ MSE (mean squared error), a rate strictly in-between what is achievable in the local and central models. This paper introduces two new protocols for summation in the shuffle model with improved accuracy and communication trade-offs. Our first contribution is a recursive construction based on the protocol from Balle et al. mentioned above, providing $\mathrm{poly}(\log \log n)$ error with $O(\log \log n)$ messages per user. The second contribution is a protocol with $O(1)$ error and $O(1)$ messages per user based on a novel analysis of the reduction from secure summation to shuffling introduced by Ishai et al. (FOCS 2006) (the original reduction required $O(\log n)$ messages per user).Comment: Published at CCS'2

Influenza Virus in Human Exhaled Breath: An Observational Study

Background: Recent studies suggest that humans exhale fine particles during tidal breathing but little is known of their composition, particularly during infection. Methodology/Principal Findings: We conducted a study of influenza infected patients to characterize influenza virus and particle concentrations in their exhaled breath. Patients presenting with influenza-like-illness, confirmed influenza A or B virus by rapid test, and onset within 3 days were recruited at three clinics in Hong Kong, China. We collected exhaled breath from each subject onto Teflon filters and measured exhaled particle concentrations using an optical particle counter. Filters were analyzed for influenza A and B viruses by quantitative polymerase chain reaction (qPCR). Twelve out of thirteen rapid test positive patients provided exhaled breath filter samples (7 subjects infected with influenza B virus and 5 subjects infected with influenza A virus). We detected influenza virus RNA in the exhaled breath of 4 (33%) subjects–three (60%) of the five patients infected with influenza A virus and one (14%) of the seven infected with influenza B virus. Exhaled influenza virus RNA generation rates ranged from <3.2 to 20 influenza virus RNA particles per minute. Over 87% of particles exhaled were under 1 µm in diameter. Conclusions: These findings regarding influenza virus RNA suggest that influenza virus may be contained in fine particles generated during tidal breathing, and add to the body of literature suggesting that fine particle aerosols may play a role in influenza transmission

Nutraceutical augmentation of circulating endothelial progenitor cells and hematopoietic stem cells in human subjects

The medical significance of circulating endothelial or hematopoietic progenitors is becoming increasing recognized. While therapeutic augmentation of circulating progenitor cells using G-CSF has resulted in promising preclinical and early clinical data for several degenerative conditions, this approach is limited by cost and inability to perform chronic administration. Stem-Kine is a food supplement that was previously reported to augment circulating EPC in a pilot study. Here we report a trial in 18 healthy volunteers administered Stem-Kine twice daily for a 2 week period. Significant increases in circulating CD133 and CD34 cells were observed at days 1, 2, 7, and 14 subsequent to initiation of administration, which correlated with increased hematopoietic progenitors as detected by the HALO assay. Augmentation of EPC numbers in circulation was detected by KDR-1/CD34 staining and colony forming assays. These data suggest Stem-Kine supplementation may be useful as a stimulator of reparative processes associated with mobilization of hematopoietic and endothelial progenitors

Sensitivity analysis of stormpav composite pavement

This study investigates the design and performance of modified composite pavement called StormPav. In this study, the sensitivity analysis is carried out by using available freeware to prove whether the StormPav composite pavement is able to provide long-life pavement and better levels of performance, both structural and functionally, than the traditional pavements. For this case, the sensitivity analysis is included data for fatigue behavior, rutting in the HMA (Hot Mix Asphalt) layer, and temperature gradient reduction of PCC slab with an HMA overlay. The StormPav composite pavement is actually an innovation IBS green pavement with structural, environmental and economic advantages. Inspired from Legos concept, the StormPav is made out of modular panels or "roadblocks" that are like enormous lego pieces that assemble and interlocking together forming a uniform settlement and at the same time acting as the monolithic character. The idea of StormPav is actually to minimize the usage of material in the composite pavement but provide the same strength and benefits as composite pavement

Recent Advances in Graph Partitioning

We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions