Hydro/Battery Hybrid Systems for frequency regulation

An innovative Hydro/Battery Hybrid System (HBHS), composed of a hydropower plant (HPP) and a Battery Energy Storage System (BESS) is proposed to provide frequency regulation services in the Nordic Power System (NPS). The HBHS is envisioned to have a faster and more efficient response compared to HPPs currently providing these services, whilst retaining their high energy capacity and endurance, thus alleviating stand-alone BESS operation constraints. This Thesis aims to explore the operation and optimization of such a hybrid system in order to make it efficient and economically viable. A power plant perspective is employed, evaluating the impact different control algorithms and parameters have on the HBHS performance. Providing Frequency Containment Reserves for Normal Operation (FCR-N), to the national TSO in Sweden, is defined from technology and market analyses as the use case for the HBHS. The characteristics of HPPs suitable for HBHS implementation are found theoretically, by evaluating HPP operational constraints and regulation mechanisms. With the aim of evaluating the dynamic performance of the proposed HBHS, a frequency regulation model of the NPS is built in MATLAB and Simulink. Two different HBHS architectures are introduced, the Hydro Recharge, in which the BESS is regulating the frequency and the HPP is controlling its state of charge (SoC), and the Frequency Split, in which both elements are regulating the frequency with the HPP additionally compensating for the SoC. The dynamic performance of the units is qualitatively evaluated through existing and proposed FCR-N prequalification tests, prescribed by the TSO and ENTSO-E. Quantitative performance comparison to a benchmark HPP is performed with regards to the estimated HPP regulation wear and tear and BESS degradation during 30-day operation with historical frequency data. The two proposed HBHS architectures demonstrate significant reductions of estimated HPP wear and tear compared to the benchmark unit. Simulations consistently report a 90 % reduction in the number of movements HPP regulation mechanism performs and a more than 50 % decrease in the distance it travels. The BESS lifetime is evaluated at acceptable levels and compared for different architectures. Two different applications are identified, the first being installing the HBHS to enable the HPP to pass FCR-N prequalification tests. The second application is increasing the FCR-N capacity of the HPP by installing the HBHS. The Frequency Split HBHS shows more efficient performance when installed in the first application, as opposed to the Hydro Recharge HBHS, which shows better performance in the second application. Finally, it is concluded that a large-scale implementation of HBHSs would improve the frequency quality in the NPS, linearly decreasing the amount of time outside the normal frequency band with increasing the total installed HBHS power capacity

Harer-Zagier formula via Fock space

The goal of this note is to provide a very short proof of Harer-Zagier formula for the number of ways of obtaining a genus g Riemann surface by identifying in pairs the sides of a (2d)-gon, using semi-infinite wedge formalism operators.Comment: 5 pages, comments are welcom

Existence of solutions for Hamiltonian field theories by the Hamilton-Jacobi technique

The paper is devoted to prove the existence of a local solution of the Hamilton-Jacobi equation in field theory, whence the general solution of the field equations can be obtained. The solution is adapted to the choice of the submanifold where the initial data of the field equations are assigned. Finally, a technique to obtain the general solution of the field equations, starting from the given initial manifold, is deduced.Comment: 16 page

Stream cipher based on quasigroup string transformations in Zp∗Z_p^*

In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group \bbbz_p^* (where p is a big prime number used in ElGamal algorithm), by defining a quasigroup of order $p-1$ and by doing quasigroup string transformations. The cryptographical strength of the proposed stream cipher is based on the fact that breaking it would be at least as hard as solving systems of multivariate polynomial equations modulo big prime number $p$ which is NP-hard problem and there are no known fast randomized or deterministic algorithms for solving it. Unlikely the speed of known ciphers that work in \bbbz_p^* for big prime numbers $p$, the speed of this stream cipher both in encryption and decryption phase is comparable with the fastest symmetric-key stream ciphers.Comment: Small revisions and added reference

Candidate One-Way Functions and One-Way Permutations Based on Quasigroup String Transformations

In this paper we propose a definition and construction of a new family of one-way candidate functions ${\cal R}_N:Q^N \to Q^N$, where $Q=\{0,1,...,s-1\}$ is an alphabet with $s$ elements. Special instances of these functions can have the additional property to be permutations (i.e. one-way permutations). These one-way functions have the property that for achieving the security level of $2^n$ computations in order to invert them, only $n$ bits of input are needed. The construction is based on quasigroup string transformations. Since quasigroups in general do not have algebraic properties such as associativity, commutativity, neutral elements, inverting these functions seems to require exponentially many readings from the lookup table that defines them (a Latin Square) in order to check the satisfiability for the initial conditions, thus making them natural candidates for one-way functions.Comment: Submitetd to conferenc

Logical Omnipotence and Two notions of Implicit Belief

The most widespread models of rational reasoners (the model based on modal epistemic logic and the model based on probability theory) exhibit the problem of logical omniscience. The most common strategy for avoiding this problem is to interpret the models as describing the explicit beliefs of an ideal reasoner, but only the implicit beliefs of a real reasoner. I argue that this strategy faces serious normative issues. In this paper, I present the more fundamental problem of logical omnipotence, which highlights the normative content of the problem of logical omniscience. I introduce two developments of the notion of implicit belief (accessible and stable belief ) and use them in two versions of the most common strategy applied to the problem of logical omnipotence