Change detection in boreal forests using bi-temporal aerial photographs

[Abstract]

Local and Global Feature Extraction for Invariant Object Recognition

Perceiving the world visually is a basic act for humans, but for computers it is still an unsolved problem. The variability present innatural environments is an obstacle for effective computer vision. The goal of invariant object recognition is to recognise objects in a digital image despite variations in, for example, pose, lighting or occlusion. In this study, invariant object recognition is considered from the viewpoint of feature extraction. Thedifferences between local and global features are studied with emphasis on Hough transform and Gabor filtering based feature extraction. The methods are examined with respect to four capabilities: generality, invariance, stability, and efficiency. Invariant features are presented using both Hough transform and Gabor filtering. A modified Hough transform technique is also presented where the distortion tolerance is increased by incorporating local information. In addition, methods for decreasing the computational costs of the Hough transform employing parallel processing and local information are introduced.

Tool-supported invariant-based programming

The development of correct programs is a core problem in computer science. Although formal verification methods for establishing correctness with mathematical rigor are available, programmers often find these difficult to put into practice. One hurdle is deriving the loop invariants and proving that the code maintains them. So called correct-by-construction methods aim to alleviate this issue by integrating verification into the programming workflow. Invariant-based programming is a practical correct-by-construction method in which the programmer first establishes the invariant structure, and then incrementally extends the program in steps of adding code and proving after each addition that the code is consistent with the invariants. In this way, the program is kept internally consistent throughout its development, and the construction of the correctness arguments (proofs) becomes an integral part of the programming workflow. A characteristic of the approach is that programs are described as invariant diagrams, a graphical notation similar to the state charts familiar to programmers. Invariant-based programming is a new method that has not been evaluated in large scale studies yet. The most important prerequisite for feasibility on a larger scale is a high degree of automation. The goal of the Socos project has been to build tools to assist the construction and verification of programs using the method. This thesis describes the implementation and evaluation of a prototype tool in the context of the Socos project. The tool supports the drawing of the diagrams, automatic derivation and discharging of verification conditions, and interactive proofs. It is used to develop programs that are correct by construction. The tool consists of a diagrammatic environment connected to a verification condition generator and an existing state-of-the-art theorem prover. Its core is a semantics for translating diagrams into verification conditions, which are sent to the underlying theorem prover. We describe a concrete method for 1) deriving sufficient conditions for total correctness of an invariant diagram; 2) sending the conditions to the theorem prover for simplification; and 3) reporting the results of the simplification to the programmer in a way that is consistent with the invariantbased programming workflow and that allows errors in the program specification to be efficiently detected. The tool uses an efficient automatic proof strategy to prove as many conditions as possible automatically and lets the remaining conditions be proved interactively. The tool is based on the verification system PVS and i uses the SMT (Satisfiability Modulo Theories) solver Yices as a catch-all decision procedure. Conditions that were not discharged automatically may be proved interactively using the PVS proof assistant. The programming workflow is very similar to the process by which a mathematical theory is developed inside a computer supported theorem prover environment such as PVS. The programmer reduces a large verification problem with the aid of the tool into a set of smaller problems (lemmas), and he can substantially improve the degree of proof automation by developing specialized background theories and proof strategies to support the specification and verification of a specific class of programs. We demonstrate this workflow by describing in detail the construction of a verified sorting algorithm. Tool-supported verification often has little to no presence in computer science (CS) curricula. Furthermore, program verification is frequently introduced as an advanced and purely theoretical topic that is not connected to the workflow taught in the early and practically oriented programming courses. Our hypothesis is that verification could be introduced early in the CS education, and that verification tools could be used in the classroom to support the teaching of formal methods. A prototype of Socos has been used in a course at Åbo Akademi University targeted at first and second year undergraduate students. We evaluate the use of Socos in the course as part of a case study carried out in 2007.

Some advances in mathematical models for preference relations

Preference relations, and their modeling, have played a crucial role in both social sciences and applied mathematics. A special category of preference relations is represented by cardinal preference relations, which are nothing other than relations which can also take into account the degree of relation. Preference relations play a pivotal role in most of multi criteria decision making methods and in the operational research. This thesis aims at showing some recent advances in their methodology. Actually, there are a number of open issues in this field and the contributions presented in this thesis can be grouped accordingly. The first issue regards the estimation of a weight vector given a preference relation. A new and efficient algorithm for estimating the priority vector of a reciprocal relation, i.e. a special type of preference relation, is going to be presented. The same section contains the proof that twenty methods already proposed in literature lead to unsatisfactory results as they employ a conflicting constraint in their optimization model. The second area of interest concerns consistency evaluation and it is possibly the kernel of the thesis. This thesis contains the proofs that some indices are equivalent and that therefore, some seemingly different formulae, end up leading to the very same result. Moreover, some numerical simulations are presented. The section ends with some consideration of a new method for fairly evaluating consistency. The third matter regards incomplete relations and how to estimate missing comparisons. This section reports a numerical study of the methods already proposed in literature and analyzes their behavior in different situations. The fourth, and last, topic, proposes a way to deal with group decision making by means of connecting preference relations with social network analysis.

Plant-Herbivore Interaction in a Fragmented Landscape: Local Adaptation and Inbreeding

Reciprocal selection between interacting species is a major driver of biodiversity at both the genetic and the species level. This reciprocal selection, or coevolution, has led to the diversification of two highly diverse and abundant groups of organisms, flowering plants and their insect herbivores. In heterogeneous environments, the outcome of coevolved species interactions is influenced by the surrounding community and/or the abiotic environment. The process of adaptation allows species to adapt to their local conditions and to local populations of interacting species. However, adaptation can be disrupted or slowed down by an absence of genetic variation or by increased inbreeding, together with the following inbreeding depression, both of which are common in small and isolated populations that occur in fragmented environments. I studied the interaction between a long-lived plant Vincetoxicum hirundinaria and its specialist herbivore Abrostola asclepiadis in the southwestern archipelago of Finland. I focused on mutual local adaptation of plants and herbivores, which is a demonstration of reciprocal selection between species, a prerequisite for coevolution. I then proceeded to investigate the processes that could potentially hamper local adaptation, or species interaction in general, when the population size is small. I did this by examining how inbreeding of both plants and herbivores affects traits that are important for interaction, as well as among-population variation in the effects of inbreeding. In addition to bi-parental inbreeding, in plants inbreeding can arise from self-fertilization which has important implications for mating system evolution. I found that local adaptation of the plant to its herbivores varied among populations. Local adaptation of the herbivore varied among populations and years, being weaker in populations that were most connected. Inbreeding caused inbreeding depression in both plants and herbivores. In some populations inbreeding depression in herbivore biomass was stronger in herbivores feeding on inbred plants than in those feeding on outbred ones. For plants it was the other way around: inbreeding depression in anti-herbivore resistance decreased when the herbivores were inbred. Underlying some of the among-population variation in the effects of inbreeding is variation in plant phenolic compounds. However, variation in the modification of phenolic compounds in the digestive tract of the herbivore did not explain the inbreeding depression in herbivore biomass. Finally, adult herbivores had a preference for outbred host plants for egg deposition, and herbivore inbreeding had a positive effect on egg survival when the eggs were exposed to predators and parasitoids. These results suggest that plants and herbivores indeed exert reciprocal selection, as demonstrated by the significant local adaptation of V. hirundinaria and A. asclepiadis to one another. The most significant cause of disruption of the local adaptation of herbivore populations was population connectivity, and thus probably gene flow. In plants local adaptation tended to increase with increasing genetic variation. Whether or not inbreeding depression occurred varied according to the life-history stage of the herbivore and/or the plant trait in question. In addition, the effects of inbreeding strongly depended on the population. Taken together, inbreeding modified plant-herbivore interactions at several different levels, and can thus affect the strength of reciprocal selection between species. Thus inbreeding has the potential to affect the outcome of coevolution.

[Topografičeskaâ karta 1:42000]. XIII-51, XIII-52, XII-51, XII-52, Vyborg. gub., Âskis" uězd / snimal" i c̆ertil" Gûbìev".

1:42000.

Business Intelligence: Microsoft Power BI

Työn tavoitteena on tutkia Business Intelligencen ja BI-työkalujen vaatimusten kehittymistä viime vuosien aikana ja tutkia miten Microsoft Power BI -ohjelmisto vastaa modernin päätöksenteon tarpeisiin. Työ on toteutettu suurimmalta osin kirjallisuuskatsauksena, minkä lisäksi Microsoft Power BI:n toiminnallisuutta on tutkittu käytännössä käyttäen ohjelmiston ilmaisversiota. Tutkimuksessa on havaittu, että tiedon lähteiden määrän ja datan monimuotoisuuden kasvaessa on syntynyt tarve uusille, tehokkaille BI-järjestelmäratkaisuille, jotka hyödyntävät uudenlaisia menetelmiä. Modernissa BI 2.0 -mallissa korostuvat kehittyneemmän verkkoinfrastruktuurin ja ohjelmistotekniikan täysi hyödyntäminen, käytön helppous, tiedon tuottaminen ja jakaminen massoille, tiedon rikastamisen mahdollistaminen ja visualisoinnin ja interaktiivisuuden keskeinen asema tiedon tulkinnassa. Tutkimuksen perusteella Microsoft Power BI vaikuttaisi täyttävän keskeneräisyydestään ja muutamista tiedonhallinnallisista puutteistaan huolimatta lähes kaikki toimivan BI 2.0 -järjestelmän määritelmistä. Ohjelmisto tarjoaa riittävät analyyttiset ja esitystekniset työkalut useimpien tyypillisten käyttäjien tarpeisiin, minkä lisäksi paranneltu Location Intelligence -ratkaisu sekä uudet Q&A ja nopea oivallus -toiminnot luovat mielenkiintoisen tavan selata dataa. Jää nähtäväksi, miten ratkaisu kehittyy vielä tulevaisuudessa.