Bond graph model of doubly fed three phase induction motor using the Axis Rotator element for frame transformation

Induction motor is a typical member of a multi-domain, non-linear, high order dynamic system. For speed control a three phase induction motor is modelled as a d–q model where linearity is assumed and non-idealities are ignored. Approximation of the physical characteristic gives a simulated behaviour away from the natural behaviour. This paper proposes a bond graph model of an induction motor that can incorporate the non-linearities and non-idealities thereby resembling the physical system more closely. The model is validated by applying the linearity and idealities constraints which shows that the conventional ‘abc’ model is a special case of the proposed generalised model.

High-quality polar UV measurements : scientific analyses and transfer of the irradiance scale

The Earth's ecosystems are protected from the dangerous part of the solar ultraviolet (UV) radiation by stratospheric ozone, which absorbs most of the harmful UV wavelengths. Severe depletion of stratospheric ozone has been observed in the Antarctic region, and to a lesser extent in the Arctic and midlatitudes. Concern about the effects of increasing UV radiation on human beings and the natural environment has led to ground based monitoring of UV radiation. In order to achieve high-quality UV time series for scientific analyses, proper quality control (QC) and quality assurance (QA) procedures have to be followed. In this work, practices of QC and QA are developed for Brewer spectroradiometers and NILU-UV multifilter radiometers, which measure in the Arctic and Antarctic regions, respectively. These practices are applicable to other UV instruments as well. The spectral features and the effect of different factors affecting UV radiation were studied for the spectral UV time series at Sodankylä. The QA of the Finnish Meteorological Institute's (FMI) two Brewer spectroradiometers included daily maintenance, laboratory characterizations, the calculation of long-term spectral responsivity, data processing and quality assessment. New methods for the cosine correction, the temperature correction and the calculation of long-term changes of spectral responsivity were developed. Reconstructed UV irradiances were used as a QA tool for spectroradiometer data. The actual cosine correction factor was found to vary between 1.08-1.12 and 1.08-1.13. The temperature characterization showed a linear temperature dependence between the instrument's internal temperature and the photon counts per cycle. Both Brewers have participated in international spectroradiometer comparisons and have shown good stability. The differences between the Brewers and the portable reference spectroradiometer QASUME have been within 5% during 2002-2010. The features of the spectral UV radiation time series at Sodankylä were analysed for the time period 1990-2001. No statistically significant long-term changes in UV irradiances were found, and the results were strongly dependent on the time period studied. Ozone was the dominant factor affecting UV radiation during the springtime, whereas clouds played a more important role during the summertime. During this work, the Antarctic NILU-UV multifilter radiometer network was established by the Instituto Nacional de Meteorogía (INM) as a joint Spanish-Argentinian-Finnish cooperation project. As part of this work, the QC/QA practices of the network were developed. They included training of the operators, daily maintenance, regular lamp tests and solar comparisons with the travelling reference instrument. Drifts of up to 35% in the sensitivity of the channels of the NILU-UV multifilter radiometers were found during the first four years of operation. This work emphasized the importance of proper QC/QA, including regular lamp tests, for the multifilter radiometers also. The effect of the drifts were corrected by a method scaling the site NILU-UV channels to those of the travelling reference NILU-UV. After correction, the mean ratios of erythemally-weighted UV dose rates measured during solar comparisons between the reference NILU-UV and the site NILU-UVs were 1.007±0.011 and 1.012±0.012 for Ushuaia and Marambio, respectively, when the solar zenith angle varied up to 80°. Solar comparisons between the NILU-UVs and spectroradiometers showed a ±5% difference near local noon time, which can be seen as proof of successful QC/QA procedures and transfer of irradiance scales. This work also showed that UV measurements made in the Arctic and Antarctic can be comparable with each other.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

Optimal multicommodity flow through the complete graph with random edge capacities

We consider a multicommodity flow problem on a complete graph whose edges have random, independent, and identically distributed capacities. We show that, as the number of nodes tends to infinity, the maximumutility, given by the average of a concave function of each commodity How, has an almost-sure limit. Furthermore, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.

Kriitkko Einari J. Vehmas ja moderni taide

The doctoral dissertation Critic Einari J. Vehmas and Modern Art deals with one of the central figures of the Finnish art scene and his work as an art critic, art museum curator and cultural critic. The main body of research material consists of the writings of Einari J. Vehmas (1902 1980) from 1937 to the late 1960s. Vehmas wrote art reviews for magazines, and from the year 1945 he was a regular art critic for one of the major newspapers in Finland. Vehmas was heavily inclined towards French literature and visual arts. Marcel Proust and Charles Baudelaire influenced his views on the nature of art from the late 1920s onwards. Vehmas is commonly regarded as the most influential art critic of post-war Finland. His writings have been referred to and cited in numerous research papers on Finnish 20th-century art. A lesser known aspect of his work is his position as the deputy director of the Ateneum Art Museum, the Finnish national gallery. Through his art museum work, his opinions also shaped the canon of modern art considered particularly Finnish following the second world war. The main emphasis of the dissertation is on studying Vehmas s writings, but it also illustrates the diversity of his involvement in Finnish cultural life through biographical documents. The long chronological span of the dissertation emphasises how certain central themes accumulate in Vehmas s writings. The aim of the dissertation is also to show how strongly certain philosophical and theoretical concepts from the early 20th century, specifically Wassily Kandinsky s principle of inner necessity and Henri Bergson s epistemology highlighting intuition and instinct, continued to influence the Finnish art discourse even in the early 1960s, in part thanks to the writings of Vehmas. Throughout his production, Vehmas contemplated the state and future of modern art and humanity. Vehmas used a colourful, vitalistic rhetoric to emphasise the role of modern art as a building block of culture and humanity. At the same time, however, he was a cultural pessimist whose art views became infused with anxiety, a sense of loss, and a desire to turn his back on the world.

Describing syntax with star-free regular expressions

Koskenniemen Äärellistilaisen leikkauskieliopin (FSIG) lauseopilliset rajoitteet ovat loogisesti vähemmän kompleksisia kuin mihin niissä käytetty formalismi vittaisi. Osoittautuukin että vaikka Voutilaisen (1994) englannin kielelle laatima FSIG-kuvaus käyttää useita säännöllisten lausekkeiden laajennuksia, kieliopin kuvaus kokonaisuutenaan palautuu äärelliseen yhdistelmään unionia, komplementtia ja peräkkäinasettelua. Tämä on oleellinen parannus ENGFSIG:n descriptiiviseen kompleksisuuteen. Tulos avaa ovia FSIG-kuvauksen loogisten ominaisuuksien syvemmälle analyysille ja FSIG kuvausten mahdolliselle optimoinnillle. Todistus sisältää uuden kaavan, joka kääntää Koskenniemien rajoiteoperaation ilman markkerimerkkejä.

Local structure and magneto-transport in Sr2FeMoO6 oxides

Double perovskite oxides Sr2FeMoO6 have attracted a great interest for their peculiar magneto-transport properties, and, ill particular, for the large values of low-field magneto-resistance (MR) which remains elevated even at room temperature, thanks to their high Curie temperature (T-c > 400 K). These properties are strongly influenced by chemical cation disorder, that is by the relative arrangement of Fe and Mo on their sublattices: the regular alternation of Fe and Mo enhances the M R and saturation magnetization. On the contrary the disorder generally depresses the magnetization and worsen the MR response. In this work the X-ray absorption fine structure (XAFS) technique has been employed in order to probe the cation order from a local point of view. XAFS spectra were collected at the Fe and Mo K edges on Sr2FeMoO6 samples with different degree of long-range chemical order. The XAFS results prove that a high degree of short-range cation order is preserved, despite the different long-range order: the Fe-Mo correlations are always preferred over the Fe-Fe and Mo-Mo ones in the perfectly ordered as well as in highly disordered samples.

Geometric quantum computation using fictitious spin-1/2 subspaces of strongly dipolar coupled nuclear spins

Geometric phases have been used in NMR to implement controlled phase shift gates for quantum-information processing, only in weakly coupled systems in which the individual spins can be identified as qubits. In this work, we implement controlled phase shift gates in strongly coupled systems by using nonadiabatic geometric phases, obtained by evolving the magnetization of fictitious spin-1/2 subspaces, over a closed loop on the Bloch sphere. The dynamical phase accumulated during the evolution of the subspaces is refocused by a spin echo pulse sequence and by setting the delay of transition selective pulses such that the evolution under the homonuclear coupling makes a complete 2 pi rotation. A detailed theoretical explanation of nonadiabatic geometric phases in NMR is given by using single transition operators. Controlled phase shift gates, two qubit Deutsch-Jozsa algorithm, and parity algorithm in a qubit-qutrit system have been implemented in various strongly dipolar coupled systems obtained by orienting the molecules in liquid crystal media.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Dipolar cross-correlation effects in the nuclear overhauser experiments of weakly and strongly coupled spins

The effect of dipolar cross correlation in 1H---1H nuclear Overhauser effect experiments is investigated by detailed calculation in an ABX spin system. It is found that in weakly coupled spin systems, the cross-correlation effects are limited to single-quantum transition probabilities and decrease in magnitude as ωτc increases. Strong coupling, however, mixes the states and the cross correlations affect the zero-quantum and double-quantum transition probabilities as well. The effect of cross correlation in steady-state and transient NOE experiments is studied as a function of strong coupling and ωτc. The results for steady-state NOE experiments are calculated analytically and those for transient NOE experiments are calculated numerically. The NOE values for the A and B spins have been calculated by assuming nonselective perturbation of all the transitions of the X spin. A significant effect of cross correlation is found in transient NOE experiments of weakly as well as strongly coupled spins when the multiplets are resolved. Cross correlation manifests itself largely as a multiplet effect in the transient NOE of weakly coupled spins for nonselective perturbation of all X transitions. This effect disappears for a measuring pulse of 90° or when the multiplets are not resolved. For steady-state experiments, the effect of cross correlation is analytically zero for weakly coupled spins and small for strongly coupled spins.

Simulation and graph mining tools for improving gene mapping efficiency

Gene mapping is a systematic search for genes that affect observable characteristics of an organism. In this thesis we offer computational tools to improve the efficiency of (disease) gene-mapping efforts. In the first part of the thesis we propose an efficient simulation procedure for generating realistic genetical data from isolated populations. Simulated data is useful for evaluating hypothesised gene-mapping study designs and computational analysis tools. As an example of such evaluation, we demonstrate how a population-based study design can be a powerful alternative to traditional family-based designs in association-based gene-mapping projects. In the second part of the thesis we consider a prioritisation of a (typically large) set of putative disease-associated genes acquired from an initial gene-mapping analysis. Prioritisation is necessary to be able to focus on the most promising candidates. We show how to harness the current biomedical knowledge for the prioritisation task by integrating various publicly available biological databases into a weighted biological graph. We then demonstrate how to find and evaluate connections between entities, such as genes and diseases, from this unified schema by graph mining techniques. Finally, in the last part of the thesis, we define the concept of reliable subgraph and the corresponding subgraph extraction problem. Reliable subgraphs concisely describe strong and independent connections between two given vertices in a random graph, and hence they are especially useful for visualising such connections. We propose novel algorithms for extracting reliable subgraphs from large random graphs. The efficiency and scalability of the proposed graph mining methods are backed by extensive experiments on real data. While our application focus is in genetics, the concepts and algorithms can be applied to other domains as well. We demonstrate this generality by considering coauthor graphs in addition to biological graphs in the experiments.

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.