Hyperfine effects in the nuclear magnetic resonance of paramagnetic molecules

Paramagnetic, or open-shell, systems are often encountered in the context of metalloproteins, and they are also an essential part of molecular magnets. Nuclear magnetic resonance (NMR) spectroscopy is a powerful tool for chemical structure elucidation, but for paramagnetic molecules it is substantially more complicated than in the diamagnetic case. Before the present work, the theory of NMR of paramagnetic molecules was limited to spin-1/2 systems and it did not include relativistic corrections to the hyperfine effects. It also was not systematically expandable. --- The theory was first expanded by including hyperfine contributions up to the fourth power in the fine structure constant α. It was then reformulated and its scope widened to allow any spin state in any spatial symmetry. This involved including zero-field splitting effects. In both stages the theory was implemented into a separate analysis program. The different levels of theory were tested by demonstrative density functional calculations on molecules selected to showcase the relative strength of new NMR shielding terms. The theory was also tested in a joint experimental and computational effort to confirm assignment of 11 B signals. The new terms were found to be significant and comparable with the terms in the earlier levels of theory. The leading-order magnetic-field dependence of shielding in paramagnetic systems was formulated. The theory is now systematically expandable, allowing for higher-order field dependence and relativistic contributions. The prevailing experimental view of pseudocontact shift was found to be significantly incomplete, as it only includes specific geometric dependence, which is not present in most of the new terms introduced here. The computational uncertainty in density functional calculations of the Fermi contact hyperfine constant and zero-field splitting tensor sets a limit for quantitative prediction of paramagnetic shielding for now.

Optimisation problems in wireless sensor networks

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating–dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating–dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs – these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating–dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Planar subgraphs without low-degree nodes

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 1) leads to NP-hard problems.

A maximal operator, Carleson's embedding, and tent spaces for vector-valued functions

This thesis is concerned with the area of vector-valued Harmonic Analysis, where the central theme is to determine how results from classical Harmonic Analysis generalize to functions with values in an infinite dimensional Banach space. The work consists of three articles and an introduction. The first article studies the Rademacher maximal function that was originally defined by T. Hytönen, A. McIntosh and P. Portal in 2008 in order to prove a vector-valued version of Carleson's embedding theorem. The boundedness of the corresponding maximal operator on Lebesgue-(Bochner) -spaces defines the RMF-property of the range space. It is shown that the RMF-property is equivalent to a weak type inequality, which does not depend for instance on the integrability exponent, hence providing more flexibility for the RMF-property. The second article, which is written in collaboration with T. Hytönen, studies a vector-valued Carleson's embedding theorem with respect to filtrations. An earlier proof of the dyadic version assumed that the range space satisfies a certain geometric type condition, which this article shows to be also necessary. The third article deals with a vector-valued generalizations of tent spaces, originally defined by R. R. Coifman, Y. Meyer and E. M. Stein in the 80's, and concerns especially the ones related to square functions. A natural assumption on the range space is then the UMD-property. The main result is an atomic decomposition for tent spaces with integrability exponent one. In order to suit the stochastic integrals appearing in the vector-valued formulation, the proof is based on a geometric lemma for cones and differs essentially from the classical proof. Vector-valued tent spaces have also found applications in functional calculi for bisectorial operators. In the introduction these three themes come together when studying paraproduct operators for vector-valued functions. The Rademacher maximal function and Carleson's embedding theorem were applied already by Hytönen, McIntosh and Portal in order to prove boundedness for the dyadic paraproduct operator on Lebesgue-Bochner -spaces assuming that the range space satisfies both UMD- and RMF-properties. Whether UMD implies RMF is thus an interesting question. Tent spaces, on the other hand, provide a method to study continuous time paraproduct operators, although the RMF-property is not yet understood in the framework of tent spaces.

Inverse problem for the wave equation : partial data and novel boundary sources

An inverse problem for the wave equation is a mathematical formulation of the problem to convert measurements of sound waves to information about the wave speed governing the propagation of the waves. This doctoral thesis extends the theory on the inverse problems for the wave equation in cases with partial measurement data and also considers detection of discontinuous interfaces in the wave speed. A possible application of the theory is obstetric sonography in which ultrasound measurements are transformed into an image of the fetus in its mother's uterus. The wave speed inside the body can not be directly observed but sound waves can be produced outside the body and their echoes from the body can be recorded. The present work contains five research articles. In the first and the fifth articles we show that it is possible to determine the wave speed uniquely by using far apart sound sources and receivers. This extends a previously known result which requires the sound waves to be produced and recorded in the same place. Our result is motivated by a possible application to reflection seismology which seeks to create an image of the Earth s crust from recording of echoes stimulated for example by explosions. For this purpose, the receivers can not typically lie near the powerful sound sources. In the second article we present a sound source that allows us to recover many essential features of the wave speed from the echo produced by the source. Moreover, these features are known to determine the wave speed under certain geometric assumptions. Previously known results permitted the same features to be recovered only by sequential measurement of echoes produced by multiple different sources. The reduced number of measurements could increase the number possible applications of acoustic probing. In the third and fourth articles we develop an acoustic probing method to locate discontinuous interfaces in the wave speed. These interfaces typically correspond to interfaces between different materials and their locations are of interest in many applications. There are many previous approaches to this problem but none of them exploits sound sources varying freely in time. Our use of more variable sources could allow more robust implementation of the probing.

Valikoiva muuttoliike Uudellamaalla

This thesis explores selective migration in Greater Helsinki region from the perspective of counterurbanisation. The aim of the study is to research whether the migration is selective by migrants age, education, income level or the rate of employment and to study any regional patterns formed by the selectivity. In the Helsinki region recent migratory developments have been shifting the areas of net migration gain away from the city of Helsinki to municipalities farther off on the former countryside. There has been discussion about Helsinki s decaying tax revenue base and whether the city s housing policy has contributed to the exodus of wealthier households. The central question of the discussion is one of selective migration: which municipalities succeed in capturing the most favourable migrants and which will lose in the competition. Selective migration means that region s in-migrants and out-migrants significantly differ from each other demographically, socially and economically. Sometimes selectivity is also understood as some individuals greater propensity to migrate than others but the proper notion for this would be differential migration. In Finnish parlance these two concepts have tended to get mixed up. The data of the study covers the total migration of the 34 municipalities of Uusimaa provinces during the years 2001 to 2003. The data was produced by Statistics Finland. Two new methods of representing the selectivity of migration as a whole were constructed during the study. Both methods look at the proportions of favourably selected migrants in regions inward and outward migrant flow. A large share in the inward flow and a small share in the outward flow is good for region s economy and demography. The first method calculates the differences of the proportions of favourably selected four migrant groups and sums the differences up. The other ranks the same proportions between regions giving value 1 to the largest proportion in inward flow and 34 to the smallest, and respectively in outward flow the smallest proportion gets value 1 and the largest 34. The total sum of the ranks or differences in proportions represents region s selectivity of migration. The results show that migration is indeed selective in the Greater Helsinki region. There also seems to be a spatial pattern centred around the Helsinki metropolitan region. The municipalities surrounding the four central communes are generally better of than those farther away. Not only these eight municipalities of the so called capital region benefit from the selective migration, but the favourable structure of migration extends to some of the small municipalities farther away. Some municipalities situated along the main northbound railway line are not coming through as well as other municipalities of the capital region. The selectivity of migration in Greater Helsinki region shows signs of counter-urbanisation. People look for suburban or small-town lifestyle no longer from Espoo or Vantaa, the neighbouring municipalities to Helsinki, but from the municipalities surrounding these two or even farther off. This kind of pattern in selective migration leads to unbalanced development in population structure and tax revenue base in the region. Migration to outskirts of the urban area also leads to urban sprawl and fragmentation of the urban structure: these issues have ecological implications. Selective migration should be studied more. Also the concept itself needs clearer definition and so do the methods to study the selectivity of migration.