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.

Development of power flows around Baltic countries with new grid links

In the Thesis main focus is done on power flow development paths around the Baltic States as well as on market-based requirements for creation of the common Baltic electricity market. Current market regulations between the countries are presented; barriers for creating competitive common Baltic power market and for electricity trading with third countries are clarified; solutions are offered and corresponding road map is developed. Future power development paths around the Baltic States are analysed. For this purpose the 330 kV transmission grid of Estonia, Latvia and Lithuania is modelled in a power flow tool. Power flow calculations are carried out for winter and summer peak and off-peak load periods in 2020 with different combinations of interconnections. While carrying out power balance experiments several power flow patterns in the Baltic States are revealed. Conclusions are made about security of supply, grid congestion and transmission capacity availability for different scenarios.

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.

Searchig the links between "knowledge governance mechanisms", "the individual conditions of knowledge sharing", and "individual's knowledge sharing behaviour".

The objective of this study was to understand how organizational knowledge governance mechanisms affect individual motivation, opportunity, and the ability to share knowledge (MOA framework), and further, how individual knowledge-sharing conditions affect actual knowledge sharing behaviour. The study followed the knowledge governance approach and a micro-foundations perspective to develop a theoretical model and hypotheses, which could explain the casual relationships between knowledge governance mechanisms, individual knowledge sharing conditions, and individual knowledge sharing behaviour. The quantitative research strategy and multivariate data analysis techniques (SEM) were used in the hypotheses testing with a survey dataset of 256 employees from eleven military schools of Finnish Defence Forces (FDF). The results showed that “performance-based feedback and rewards” affects employee’s “intrinsic motivation towards knowledge sharing”, that “lateral coordination” affects employee’s “knowledge self-efficacy”, and that ”training and development” is positively related to “time availability” for knowledge sharing but affects negatively employee’s knowledge self-efficacy. Individual motivation and knowledge self-efficacy towards knowledge sharing affected knowledge sharing behaviour when work-related knowledge was shared 1) between employees in a department and 2) between employees in different departments, however these factors did not play a crucial role in subordinate–superior knowledge sharing. The findings suggest that individual motivation, opportunity, and the ability towards knowledge sharing affects individual knowledge sharing behaviour differently in different knowledge sharing situations. Furthermore, knowledge governance mechanisms can be used to manage individual-level knowledge sharing conditions and individual knowledge sharing behaviour but their affect also vary in different knowledge sharing situations.