A water-vapor electrolysis cell with phosphoric acid electrolyte

Feasibility of phosphoric acid water vapor electrolysis cell for spacecraft cabin air conditioning syste

An approach to build an event set of European wind storms based on ECMWF EPS

The properties of European wind storms under present climate conditions are estimated on the basis of surface wind forecasts from the European Center of Medium-Range Weather Forecast (ECMWF) Ensemble Prediction System (EPS). While the EPS is designed to provide forecast information of the range of possible weather developments starting from the observed state of weather, we use its archive in a climatological context. It provides a large number of modifications of observed storm events, and includes storms that did not occur in reality. Thus it is possible to create a large sample of storm events, which entirely originate from a physically consistent model, whose ensemble spread represents feasible alternative storm realizations of the covered period. This paper shows that the huge amount of identifiable events in the EPS is applicable to reduce uncertainties in a wide range of fields of research focusing on winter storms. Wind storms are identified and tracked in this study over their lifetime using an algorithm, based on the local exceedance of the 98th percentile of instantaneous 10 m wind speed, calculating a storm severity measure. After removing inhomogeneities in the dataset arising from major modifications of the operational system, the distributions of storm severity, storm size and storm duration are computed. The overall principal properties of the homogenized EPS storm data set are in good agreement with storms from the ERA-Interim dataset, making it suitable for climatological investigations of these extreme events. A demonstrated benefit in the climatological context by the EPS is presented. It gives a clear evidence of a linear increase of maximum storm intensity and wind field size with storm duration. This relation is not recognizable from a sparse ERA-Interim sample for long lasting events, as the number of events in the reanalysis is not sufficient to represent these characteristics

Reduced Purkinje cell number in essential tremor : a postmortem study

Background: Clinical and functional imaging evidence suggests that cerebellar dysfunction occurs in essential tremor (ET). In recent postmortem studies, we documented increased numbers of torpedoes (Purkinje cell axonal swellings) in ET patients without Lewy bodies. Purkinje cell loss, however, has never been rigorously assessed. Objective: To quantitatively assess the number of Purkinje cells in brains of ET patients and similarly aged controls. Methods: Postmortem cerebellar tissue was available in 14 ET cases (6 with Lewy bodies and 8 without Lewy bodies) and 11 controls. Calbindin immunohistochemistry was performed on paraffin sections of the cerebellum. Images were digitally recorded and blinded measurements of the number of Purkinje cells per millimeter of cell layer (linear density) were made. Results: Purkinje cell linear density was inversely correlated with age (r=-0.53, P=.006) and number of torpedoes (r=-0.42, P=.04). Purkinje cell linear density differed by diagnosis (mean [SD], controls, 3.46 [1.27] cells/mm; ET cases with Lewy bodies, 3.33 [1.06] cells/mm; and ET cases without Lewy bodies, 2.14 [0.82] cells/mm; P=.04), with the most significant difference between ET cases without Lewy bodies and controls, where the reduction was 38.2% (P=.04). In an adjusted linear regression analysis that compared ET cases without Lewy bodies with controls, decreased linear density (outcome variable) was associated with ET (β=.56, P=.03). Conclusions: We demonstrated a reduction in Purkinje cell number in the brains of patients with ET who do not have Lewy bodies. These data further support the view that the cerebellum is anatomically, as well as functionally, abnormal in these ET cases

Chosen-ciphertext security from subset sum

We construct a public-key encryption (PKE) scheme whose security is polynomial-time equivalent to the hardness of the Subset Sum problem. Our scheme achieves the standard notion of indistinguishability against chosen-ciphertext attacks (IND-CCA) and can be used to encrypt messages of arbitrary polynomial length, improving upon a previous construction by Lyubashevsky, Palacio, and Segev (TCC 2010) which achieved only the weaker notion of semantic security (IND-CPA) and whose concrete security decreases with the length of the message being encrypted. At the core of our construction is a trapdoor technique which originates in the work of Micciancio and Peikert (Eurocrypt 2012

Testing and benchmarking of a three-dimensional groundwater flow and solute transport model

A three-dimensional finite-difference model was developed to simulate groundwater flow and solute transport. The model is intended for application to a variety of groundwater resource and solute migration evaluations, including several complex sites at the Savannah River Plant (SRP). Because the model, FTWORK, is relatively new, there is a need to provide confidence in the model results. Methodologies that test models include comparisons with analytical solutions, comparisons with empirical data, and checking that conservation properties hold. Another level of testing is the comparison of one code against another. This paper describes the testing and benchmarking procedure used to verify the validate FTWORK

Predictable arguments of knowledge

We initiate a formal investigation on the power of predictability for argument of knowledge systems for NP. Specifically, we consider private-coin argument systems where the answer of the prover can be predicted, given the private randomness of the verifier; we call such protocols Predictable Arguments of Knowledge (PAoK). Our study encompasses a full characterization of PAoK, showing that such arguments can be made extremely laconic, with the prover sending a single bit, and assumed to have only one round (i.e., two messages) of communication without loss of generality. We additionally explore PAoK satisfying additional properties (including zero-knowledge and the possibility of re-using the same challenge across multiple executions with the prover), present several constructions of PAoK relying on different cryptographic tools, and discuss applications to cryptography