Final report on research project PS2010, proof of concept of automated mapping of weeds in arable fields

Many weeds occur in patches but farmers frequently spray whole fields to control the weeds in these patches. Given a geo-referenced weed map, technology exists to confine spraying to these patches. Adoption of patch spraying by arable farmers has, however, been negligible partly due to the difficulty of constructing weed maps. Building on previous DEFRA and HGCA projects, this proposal aims to develop and evaluate a machine vision system to automate the weed mapping process. The project thereby addresses the principal technical stumbling block to widespread adoption of site specific weed management (SSWM). The accuracy of weed identification by machine vision based on a single field survey may be inadequate to create herbicide application maps. We therefore propose to test the hypothesis that sufficiently accurate weed maps can be constructed by integrating information from geo-referenced images captured automatically at different times of the year during normal field activities. Accuracy of identification will also be increased by utilising a priori knowledge of weeds present in fields. To prove this concept, images will be captured from arable fields on two farms and processed offline to identify and map the weeds, focussing especially on black-grass, wild oats, barren brome, couch grass and cleavers. As advocated by Lutman et al. (2002), the approach uncouples the weed mapping and treatment processes and builds on the observation that patches of these weeds are quite stable in arable fields. There are three main aspects to the project. 1) Machine vision hardware. Hardware component parts of the system are one or more cameras connected to a single board computer (Concurrent Solutions LLC) and interfaced with an accurate Global Positioning System (GPS) supplied by Patchwork Technology. The camera(s) will take separate measurements for each of the three primary colours of visible light (red, green and blue) in each pixel. The basic proof of concept can be achieved in principle using a single camera system, but in practice systems with more than one camera may need to be installed so that larger fractions of each field can be photographed. Hardware will be reviewed regularly during the project in response to feedback from other work packages and updated as required. 2) Image capture and weed identification software. The machine vision system will be attached to toolbars of farm machinery so that images can be collected during different field operations. Images will be captured at different ground speeds, in different directions and at different crop growth stages as well as in different crop backgrounds. Having captured geo-referenced images in the field, image analysis software will be developed to identify weed species by Murray State and Reading Universities with advice from The Arable Group. A wide range of pattern recognition and in particular Bayesian Networks will be used to advance the state of the art in machine vision-based weed identification and mapping. Weed identification algorithms used by others are inadequate for this project as we intend to collect and correlate images collected at different growth stages. Plants grown for this purpose by Herbiseed will be used in the first instance. In addition, our image capture and analysis system will include plant characteristics such as leaf shape, size, vein structure, colour and textural pattern, some of which are not detectable by other machine vision systems or are omitted by their algorithms. Using such a list of features observable using our machine vision system, we will determine those that can be used to distinguish weed species of interest. 3) Weed mapping. Geo-referenced maps of weeds in arable fields (Reading University and Syngenta) will be produced with advice from The Arable Group and Patchwork Technology. Natural infestations will be mapped in the fields but we will also introduce specimen plants in pots to facilitate more rigorous system evaluation and testing. Manual weed maps of the same fields will be generated by Reading University, Syngenta and Peter Lutman so that the accuracy of automated mapping can be assessed. The principal hypothesis and concept to be tested is that by combining maps from several surveys, a weed map with acceptable accuracy for endusers can be produced. If the concept is proved and can be commercialised, systems could be retrofitted at low cost onto existing farm machinery. The outputs of the weed mapping software would then link with the precision farming options already built into many commercial sprayers, allowing their use for targeted, site-specific herbicide applications. Immediate economic benefits would, therefore, arise directly from reducing herbicide costs. SSWM will also reduce the overall pesticide load on the crop and so may reduce pesticide residues in food and drinking water, and reduce adverse impacts of pesticides on non-target species and beneficials. Farmers may even choose to leave unsprayed some non-injurious, environmentally-beneficial, low density weed infestations. These benefits fit very well with the anticipated legislation emerging in the new EU Thematic Strategy for Pesticides which will encourage more targeted use of pesticides and greater uptake of Integrated Crop (Pest) Management approaches, and also with the requirements of the Water Framework Directive to reduce levels of pesticides in water bodies. The greater precision of weed management offered by SSWM is therefore a key element in preparing arable farming systems for the future, where policy makers and consumers want to minimise pesticide use and the carbon footprint of farming while maintaining food production and security. The mapping technology could also be used on organic farms to identify areas of fields needing mechanical weed control thereby reducing both carbon footprints and also damage to crops by, for example, spring tines. Objective i. To develop a prototype machine vision system for automated image capture during agricultural field operations; ii. To prove the concept that images captured by the machine vision system over a series of field operations can be processed to identify and geo-reference specific weeds in the field; iii. To generate weed maps from the geo-referenced, weed plants/patches identified in objective (ii).

Transreal proof of the existence of universal possible worlds

Transreal arithmetic is total, in the sense that the fundamental operations of addition, subtraction, multiplication and division can be applied to any transreal numbers with the result being a transreal number [1]. In particular division by zero is allowed. It is proved, in [3], that transreal arithmetic is consistent and contains real arithmetic. The entire set of transreal numbers is a total semantics that models all of the semantic values, that is truth values, commonly used in logics, such as the classical, dialetheaic, fuzzy and gap values [2]. By virtue of the totality of transreal arithmetic, these logics can be implemented using total, arithmetical functions, specifically operators, whose domain and counterdomain is the entire set of transreal numbers

An investigation of the required skills for the delivery of low and zero carbon buildings within a region

The United Kingdom is committed to a raft of requirements to create a low-carbon economy. Buildings consume approximately 40% of UK energy demand. Any improvement on the energy performance of buildings therefore can significantly contribute to the delivery of a low-carbon economy. The challenge for the construction sector and its clients is how to meet the policy requirements to deliver low and zero carbon (LZC) buildings, which spans broader than the individual building level, to requirements at the local and regional levels, and wider sustainability pressures. Further, the construction sector is reporting skills shortages coupled with the need for ‘new skills’ for the delivery of LZC buildings. The aim of this paper is to identify, and better understand, the skills required by the construction sector and its clients for the delivery of LZC buildings within a region. The theoretical framing for this research is regional innovation system (RIS) using a socio-technical network analysis (STNA) methodology. A case study of a local authority region is presented. Data is drawn from a review of relevant local authority documentation, observations and semi-structured interviews from one (project 1) of five school retrofit projects within the region. The initial findings highlight the complexity surrounding the form and operation of the LZC network for project 1. The skills required by the construction sector and its clients are connected to different actor roles surrounding the delivery of the project. The key actors involved and their required skills are: project management and energy management skills required by local authority; project management skills (in particular project planning), communication and research skills required by school end-users; and a ‘technical skill’ relating to knowledge of a particular energy efficient measure (EEM) and use of equipment to implement the EEM is required by the EEM contractors.

Educação e desenvolvimento de zero a três anos de idade: contribuições da psicologia histórico-cultural para a organização do ensino

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Two ways to common knowledge

It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towards such a system. We argue that the standard induction rule is not well suited to axiomatize evidence-based common knowledge. As an alternative, we study two different deductive systems for the logic of common knowledge. The first system makes use of an induction axiom whereas the second one is based on co-inductive proof theory. We show the soundness and completeness for both systems.

[Serological and clinical proof of freedom from Equine Infectious Anemia (EIA) in imported and domestic horses in Switzerland]

Since 1991, no cases of Equine Infectious Anemia (EIA) have been reported in Switzerland. Risk factors for introduction of the virus into Switzerland are still present or have even increased as frequent inapparent infections, large numbers of imported horses, (since 2003) absence of compulsory testing prior to importation, EIA cases in surrounding Europe, possible illegal importation of horses, frequent short-term stays, poor knowledge of the disease among horse owners and even veterinarians. The aim of this study was to provide evidence of freedom from EIA in imported and domestic horses in Switzerland. The serum samples from 434 horses imported since 2003 as well as from 232 domestic horses fifteen years of age or older (since older horses have naturally had a longer time of being exposed to the risk of infection) were analysed using a commercially available ELISA test. All samples were seronegative, indicating that the maximum possible prevalence that could have been missed with this sample was 0.5% (95% confidence).

Canonical proof nets for classical logic

Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to proofs in the classical sequent calculus is thus an important step in understanding classical sequent calculus proofs. By convincing, we mean that (a) there should be a canonical function from sequent proofs to proof nets, (b) it should be possible to check the correctness of a net in polynomial time, (c) every correct net should be obtainable from a sequent calculus proof, and (d) there should be a cut-elimination procedure which preserves correctness. Previous attempts to give proof-net-like objects for propositional classical logic have failed at least one of the above conditions. In Richard McKinley (2010) [22], the author presented a calculus of proof nets (expansion nets) satisfying (a) and (b); the paper defined a sequent calculus corresponding to expansion nets but gave no explicit demonstration of (c). That sequent calculus, called LK∗ in this paper, is a novel one-sided sequent calculus with both additively and multiplicatively formulated disjunction rules. In this paper (a self-contained extended version of Richard McKinley (2010) [22]), we give a full proof of (c) for expansion nets with respect to LK∗, and in addition give a cut-elimination procedure internal to expansion nets – this makes expansion nets the first notion of proof-net for classical logic satisfying all four criteria.

Proof internalization in generalized Frege systems for classical logic

We present a general method for inserting proofs in Frege systems for classical logic that produces systems that can internalize their own proofs.

First-in-Human Proof-of-Concept Study: Intralesional Administration of BQ788, an Endothelin Receptor B Antagonist, to Melanoma Skin Metastases

BACKGROUND This first-in-human proof-of-concept study aimed to check whether safety and preclinical results obtained by intratumoral administration of BQ788, an endothelin receptor B (EDNRB) antagonist, can be repeated in human melanoma patients. METHODS Three patients received a single intralesional BQ788 application of 3 mg. After 3-7 days, the lesions were measured and removed for analysis. The administered dose was increased to a cumulative dosage of 8 mg in patient 4 (4 × 2.0 mg, days 0-3; lesion removed on day 4) and to 10 mg in patient 5 (3 × 3.3 mg, days 0, 3, and 10; lesion removed after 14 days). Control lesions were simultaneously treated with phosphate-buffered saline (PBS). All samples were processed and analyzed without knowledge of the clinical findings. RESULTS No statistical evaluation was possible because of the number of patients (n = 5) and the variability in the mode of administration. No adverse events were observed, regardless of administered dose. All observations were in accordance with results obtained in preclinical studies. Accordingly, no difference in degree of tumor necrosis was detected between BQ788- and PBS-treated samples. In addition, both EDNRB and Ki67 showed decreased expression in patients 2 and 5 and, to a lesser extent, in patient 1. Similarly, decreased expression of EDNRB mRNA in patients 2 and 5 and of BCL2A1 and/or PARP3 in patients 2, 3, and 5 was found. Importantly, semiquantitatively scored immunohistochemistry for CD31 and CD3 revealed more blood vessels and lymphocytes, respectively, in BQ788-treated tumors of patients 2 and 4. Also, in all patients, we observed inverse correlation in expression levels between EDNRB and HIF1A. Finally, in patient 5 (the only patient treated for longer than 1 week), we observed inhibition in lesion growth, as shown by size measurement. CONCLUSION The intralesional applications of BQ788 were well tolerated and showed signs of directly and indirectly reducing the viability of melanoma cells.

A Proof-Theoretic Analysis of Theories for Stratified Inductive Definitions

In this article we study subsystems SIDᵥ of the theory ID₁ in which fixed point induction is restricted to properly stratified formulas.

A simple proof of the strong subadditivity inequality

Arguably the deepest fact known about the von Neumann entropy, the strong subadditivity inequality is a potent hammer in the quantum information theorist's toolkit. This short tutorial describes a simple proof of strong subadditivity due to Petz [Rep. on Math. Phys. 23 (1), 57-65 (1986)]. It assumes only knowledge of elementary linear algebra and quantum mechanics.

Flexible proof reuse for software verification

Proof reuse, or analogical reasoning, involves reusing the proof of a source theorem in the proof of a target conjecture. We have developed a method for proof reuse that is based on the generalisation replay paradigm described in the literature, in which a generalisation of the source proof is replayed to construct the target proof. In this paper, we describe the novel aspects of our method, which include a technique for producing more accurate source proof generalisations (using knowledge of the target goal), as well as a flexible replay strategy that allows the user to set various parameters to control the size and the shape of the search space. Finally, we report on the results of applying this method to a case study from the realm of software verification.

The Productive use of Failure to Generate Witnesses from Divergent Proof Attempts for Coinduction

Coinduction is a proof rule. It is the dual of induction. It allows reasoning about non--well--founded structures such as lazy lists or streams and is of particular use for reasoning about equivalences. A central difficulty in the automation of coinductive proof is the choice of a relation (called a bisimulation). We present an automation of coinductive theorem proving. This automation is based on the idea of proof planning. Proof planning constructs the higher level steps in a proof, using knowledge of the general structure of a family of proofs and exploiting this knowledge to control the proof search. Part of proof planning involves the use of failure information to modify the plan by the use of a proof critic which exploits the information gained from the failed proof attempt. Our approach to the problem was to develop a strategy that makes an initial simple guess at a bisimulation and then uses generalisation techniques, motivated by a critic, to refine this guess, so that a larger class of coinductive problems can be automatically verified. The implementation of this strategy has focused on the use of coinduction to prove the equivalence of programs in a small lazy functional language which is similar to Haskell. We have developed a proof plan for coinduction and a critic associated with this proof plan. These have been implemented in CoClam, an extended version of Clam with encouraging results. The planner has been successfully tested on a number of theorems.