A user guide to simple monitoring and sustainable operation of PV-diesel hybrid systems : Handbook for system users and operators

This report contains a suggestion for a simple monitoring and evaluation guideline for PV-diesel hybrid systems. It offers system users a way to better understand if their system is operated in a way that will make it last for a long time. It also gives suggestions on how to act if there are signs of unfavourable use or failure. The application of the guide requires little technical equipment, but daily manual measurements. For the most part, it can be managed by pen and paper, by people with no earlier experience of power systems.The guide is structured and expressed in a way that targets PV-diesel hybrid system users with no, or limited, earlier experience of power engineering. It is less detailed in terms of motivations for certain choices and limitations, but rich in details concerning calculations, evaluation procedures and maintenance routines. A more scientific description of the guide can be found in a related journal article.

Towards Presidential Rule in Ukraine : Hybrid Regime Dynamics under Semi-Presidentialism

This article sets out to analyse recent regime developments in Ukraine in relation to semi-presidentialism. The article asks: to what extent and in what ways theoretical arguments against semi-presidentialism (premier-presidential and president-parliamentary systems) are relevant for understanding the changing directions of the Ukrainian regime since the 1990s? The article also reviews the by now overwhelming evidence suggesting that President Yanukovych is turning Ukraine into a more authoritarian hybrid regime and raises the question to what extent the president-parliamentary system might serve this end. The article argues that both kinds of semi-presidentialism have, in different ways, exacerbated rather than mitigated institutional conflict and political stalemate. The return to the president-parliamentary system in 2010 – the constitutional arrangement with the most dismal record of democratisation – was a step in the wrong direction. The premier-presidential regime was by no means ideal, but it had at least two advantages. It weakened the presidential dominance and it explicitly anchored the survival of the government in parliament. The return to the 1996 constitution ties in well with the notion that President Viktor Yanukovych has embarked on an outright authoritarian path.

Fred: An approach to generating real, correct, reusable programs from proofs

In this paper we describe our system for automatically extracting "correct" programs from proofs using a development of the Curry-Howard process. Although program extraction has been developed by many authors, our system has a number of novel features designed to make it very easy to use and as close as possible to ordinary mathematical terminology and practice. These features include 1. the use of Henkin's technique to reduce higher-order logic to many-sorted (first-order) logic; 2. the free use of new rules for induction subject to certain conditions; 3. the extensive use of previously programmed (total, recursive) functions; 4. the use of templates to make the reasoning much closer to normal mathematical proofs and 5. a conceptual distinction between the computational type theory (for representing programs)and the logical type theory (for reasoning about programs). As an example of our system we give a constructive proof of the well known theorem that every graph of even parity, which is non-trivial in the sense that it does not consist of isolated vertices, has a cycle. Given such a graph as input, the extracted program produces a cycle as promised.

Protocols between programs and proofs

In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and the programs extracted from it. This protocol leads to the expansion of the theory and the production of more powerful programs. The methodology we use for automatically extracting “correct” programs from proofs is a development of the well-known Curry-Howard process. Program extraction has been developed by many authors, but our presentation is ultimately aimed at a practical, usable system and has a number of novel features. These include 1. a very simple and natural mimicking of ordinary mathematical practice and likewise the use of established computer programs when we obtain programs from formal proofs, and 2. a conceptual distinction between programs on the one hand, and proofs of theorems that yield programs on the other. An implementation of our methodology is the Fred system. As an example of our protocol we describe a constructive proof of the well-known theorem that every graph of even parity can be decomposed into a list of disjoint cycles. Given such a graph as input, the extracted program produces a list of the (non-trivial) disjoint cycles as promised.

Extraction of structured programs from specification proofs

We present a method using an extended logical system for obtaining programs from specifications written in a sublanguage of CASL. These programs are “correct” in the sense that they satisfy their specifications. The technique we use is to extract programs from proofs in formal logic by techniques due to Curry and Howard. The logical calculus, however, is novel because it adds structural rules corresponding to the standard ways of modifying specifications: translating (renaming), taking unions, and hiding signatures. Although programs extracted by the Curry-Howard process can be very cumbersome, we use a number of simplifications that ensure that the programs extracted are in a language close to a standard high-level programming language. We use this to produce an executable refinement of a given specification and we then provide a method for producing a program module that maximally respects the original structure of the specification. Throughout the paper we demonstrate the technique with a simple example.