2,946 research outputs found

    A water-vapor electrolysis cell with phosphoric acid electrolyte

    Get PDF
    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

    Get PDF
    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

    Chosen-ciphertext security from subset sum

    Get PDF
    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

    Predictable arguments of knowledge

    Get PDF
    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
    • …
    corecore