Quantum dynamics of the parabolic model

Kvanttimekaniikan teoriassa suljettuja, ympäristöstään eristettyjä systeemejä koskevat tulokset ovat hyvin tunnettuja. Eräs tärkeä erityispiirre tällaisille systeemeille on, että niiden aikakehitys on unitaarista. Oletus siitä, että systeemi on suljettu, on osaltaan tietysti vain yksinkertaistus. Käytännössä kaikki kvanttimekaaniset systeemit vuorovaikuttavat ympäristönsä kanssa ja tästä johtuen niiden dynamiikka monimutkaistuu oleellisesti. Kuitenkin tietyissä tapauksissa systeemin aikakehitys voidaan ratkaista, ainakin approksimatiivisesti. Tärkeimpinä esimerkkeinä on ympäristön joko nopea tai erittäin hidas muutos kvanttisysteemin ominaiseen aikaskaalaan verrattuna. Näistä erityisesti jälkimmäinen on käyttökelpoinen oletus monissa fysikaalisissa tilanteissa. Tällöin voidaan suorittaa niin sanottu adiabaattinen approksimaatio. Sen mukaan systeemi, joka on aikakehityksen generoivan Hamiltonin operaattorin ominaistilassa, pysyy vastaavassa ominaistilassa ympäristön muuttuessa äärettömän hitaasti, mikäli systeemin eri energiatasot eivät leikkaa toisiaan. Todellisissa tilanteissa muutos ei tietenkään voi olla äärettömän hidasta ja myös energiatasojen leikkaukset ovat mahdollisia, jolloin tapahtuu transitio eri ominaistilojen välillä. Energiatasojen leikkauksilla on oleellisia vaikutuksia erittäin monissa fysikaalisissa prosesseissa ja niitä kuvaamaan on luotu monia malleja kvanttimekaniikan alkuajoista lähtien aina tähän päivään saakka. Nykyinen teknologinen kehitys on avannut uudenlaisen mahdollisuuden ilmiön kokeelliseen varmentamiseen ja hyödyntämiseen. Tämän vuoksi kyseisten mallien dynamiikan ja erityisesti energiatasojen useiden peräkkäisten leikkausten aiheuttamien koherenssi-ilmiöiden selvittäminen on tärkeää. Tässä työssä käsitellään kvanttimekaanisia kaksitasosysteemejä, joissa esiintyy energiatasojen leikkauksia sekä niiden pitkän aikavälin dynamiikkaa. Tutkielmassa perehdytään tarkemmin kahteen tiettyyn malliin. Näistä ensimmäinen, Landau-Zener -malli, on tunnetuin ja sovelluksissa käytetyin malli. Kuitenkin erityisen mielenkiinnon kohteena on niin kutsuttu parabolinen malli, jolle johdetaan eri approksimaatioita käyttäen asymptoottiset transitiotodennäköisyydet eri tilojen välille. Näitä verrataan numeerisiin tuloksiin.

On convergence of transforms based on parabolic scaling

This thesis studies properties of transforms based on parabolic scaling, like Curvelet-, Contourlet-, Shearlet- and Hart-Smith-transform. Essentially, two di erent questions are considered: How these transforms can characterize H older regularity and how non-linear approximation of a piecewise smooth function converges. In study of Hölder regularities, several theorems that relate regularity of a function f : R2 → R to decay properties of its transform are presented. Of particular interest is the case where a function has lower regularity along some line segment than elsewhere. Theorems that give estimates for direction and location of this line, and regularity of the function are presented. Numerical demonstrations suggest also that similar theorems would hold for more general shape of segment of low regularity. Theorems related to uniform and pointwise Hölder regularity are presented as well. Although none of the theorems presented give full characterization of regularity, the su cient and necessary conditions are very similar. Another theme of the thesis is the study of convergence of non-linear M ─term approximation of functions that have discontinuous on some curves and otherwise are smooth. With particular smoothness assumptions, it is well known that squared L2 approximation error is O(M-2(logM)3) for curvelet, shearlet or contourlet bases. Here it is shown that assuming higher smoothness properties, the log-factor can be removed, even if the function still is discontinuous.

Boundary identification in the domain of a parabolic partial differential equation

Bakgrunden och inspirationen till föreliggande studie är tidigare forskning i tillämpningar på randidentifiering i metallindustrin. Effektiv randidentifiering möjliggör mindre säkerhetsmarginaler och längre serviceintervall för apparaturen i industriella högtemperaturprocesser, utan ökad risk för materielhaverier. I idealfallet vore en metod för randidentifiering baserad på uppföljning av någon indirekt variabel som kan mätas rutinmässigt eller till en ringa kostnad. En dylik variabel för smältugnar är temperaturen i olika positioner i väggen. Denna kan utnyttjas som insignal till en randidentifieringsmetod för att övervaka ugnens väggtjocklek. Vi ger en bakgrund och motivering till valet av den geometriskt endimensionella dynamiska modellen för randidentifiering, som diskuteras i arbetets senare del, framom en flerdimensionell geometrisk beskrivning. I de aktuella industriella tillämpningarna är dynamiken samt fördelarna med en enkel modellstruktur viktigare än exakt geometrisk beskrivning. Lösningsmetoder för den s.k. sidledes värmeledningsekvationen har många saker gemensamt med randidentifiering. Därför studerar vi egenskaper hos lösningarna till denna ekvation, inverkan av mätfel och något som brukar kallas förorening av mätbrus, regularisering och allmännare följder av icke-välställdheten hos sidledes värmeledningsekvationen. Vi studerar en uppsättning av tre olika metoder för randidentifiering, av vilka de två första är utvecklade från en strikt matematisk och den tredje från en mera tillämpad utgångspunkt. Metoderna har olika egenskaper med specifika fördelar och nackdelar. De rent matematiskt baserade metoderna karakteriseras av god noggrannhet och låg numerisk kostnad, dock till priset av låg flexibilitet i formuleringen av den modellbeskrivande partiella differentialekvationen. Den tredje, mera tillämpade, metoden kännetecknas av en sämre noggrannhet förorsakad av en högre grad av icke-välställdhet hos den mera flexibla modellen. För denna gjordes även en ansats till feluppskattning, som senare kunde observeras överensstämma med praktiska beräkningar med metoden. Studien kan anses vara en god startpunkt och matematisk bas för utveckling av industriella tillämpningar av randidentifiering, speciellt mot hantering av olinjära och diskontinuerliga materialegenskaper och plötsliga förändringar orsakade av “nedfallande” väggmaterial. Med de behandlade metoderna förefaller det möjligt att uppnå en robust, snabb och tillräckligt noggrann metod av begränsad komplexitet för randidentifiering.

Problems and potentialities of e-Learning for regular undergraduate courses in emergency medicine

BACKGROUND: E-learning techniques are spreading at great speed in medicine, raising concerns about the impact of adopting them. Websites especially designed to host courses are becoming more common. There is a lack of evidence that these systems could enhance student knowledge acquisition. GOAL: To evaluate the impact of using dedicated-website tools over cognition of medical students exposed to a first-aid course. METHODS: Prospective study of 184 medical students exposed to a twenty-hour first-aid course. We generated a dedicated-website with several sections (lectures, additional reading material, video and multiple choice exercises). We constructed variables expressing the student's access to each section. The evaluation was composed of fifty multiple-choice tests, based on clinical problems. We used multiple linear regression to adjust for potential confounders. RESULTS: There was no association of website intensity of exposure and the outcome - beta-coeficient 0.27 (95%CI - 0.454 - 1.004). These findings were not altered after adjustment for potential confounders - 0.165 (95%CI -0.628 - 0.960). CONCLUSION: A dedicated website with passive and active capabilities for aiding in person learning had not shown association with a better outcome.

Algorithmic Solutions for Combinatorial Problems in Resource Management of Manufacturing Environments

This thesis studies the use of heuristic algorithms in a number of combinatorial problems that occur in various resource constrained environments. Such problems occur, for example, in manufacturing, where a restricted number of resources (tools, machines, feeder slots) are needed to perform some operations. Many of these problems turn out to be computationally intractable, and heuristic algorithms are used to provide efficient, yet sub-optimal solutions. The main goal of the present study is to build upon existing methods to create new heuristics that provide improved solutions for some of these problems. All of these problems occur in practice, and one of the motivations of our study was the request for improvements from industrial sources. We approach three different resource constrained problems. The first is the tool switching and loading problem, and occurs especially in the assembly of printed circuit boards. This problem has to be solved when an efficient, yet small primary storage is used to access resources (tools) from a less efficient (but unlimited) secondary storage area. We study various forms of the problem and provide improved heuristics for its solution. Second, the nozzle assignment problem is concerned with selecting a suitable set of vacuum nozzles for the arms of a robotic assembly machine. It turns out that this is a specialized formulation of the MINMAX resource allocation formulation of the apportionment problem and it can be solved efficiently and optimally. We construct an exact algorithm specialized for the nozzle selection and provide a proof of its optimality. Third, the problem of feeder assignment and component tape construction occurs when electronic components are inserted and certain component types cause tape movement delays that can significantly impact the efficiency of printed circuit board assembly. Here, careful selection of component slots in the feeder improves the tape movement speed. We provide a formal proof that this problem is of the same complexity as the turnpike problem (a well studied geometric optimization problem), and provide a heuristic algorithm for this problem.

Solving Challenging Real-World Scheduling Problems

This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use. The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems. The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.

The knapsack problem approach in solving partial hedging problems of options

En option är ett finansiellt kontrakt som ger dess innehavare en rättighet (men medför ingen skyldighet) att sälja eller köpa någonting (till exempel en aktie) till eller från säljaren av optionen till ett visst pris vid en bestämd tidpunkt i framtiden. Den som säljer optionen binder sig till att gå med på denna framtida transaktion ifall optionsinnehavaren längre fram bestämmer sig för att inlösa optionen. Säljaren av optionen åtar sig alltså en risk av att den framtida transaktion som optionsinnehavaren kan tvinga honom att göra visar sig vara ofördelaktig för honom. Frågan om hur säljaren kan skydda sig mot denna risk leder till intressanta optimeringsproblem, där målet är att hitta en optimal skyddsstrategi under vissa givna villkor. Sådana optimeringsproblem har studerats mycket inom finansiell matematik. Avhandlingen "The knapsack problem approach in solving partial hedging problems of options" inför en ytterligare synpunkt till denna diskussion: I en relativt enkel (ändlig och komplett) marknadsmodell kan nämligen vissa partiella skyddsproblem beskrivas som så kallade kappsäcksproblem. De sistnämnda är välkända inom en gren av matematik som heter operationsanalys. I avhandlingen visas hur skyddsproblem som tidigare lösts på andra sätt kan alternativt lösas med hjälp av metoder som utvecklats för kappsäcksproblem. Förfarandet tillämpas även på helt nya skyddsproblem i samband med så kallade amerikanska optioner.

Pain symptoms and sleep problems among school-aged children. Long-term prevalence changes, and pain symptoms as predictors of later mental health

Children’s pain symptoms and sleep problems are among the most common health complaints. They distract children from activities, decrease the quality of life, contribute to a significant economic burden, and have shown continuity into adulthood. The main aims of this thesis were to investigate long-term changes in the prevalence of pain symptoms and sleep problems among Finnish school-aged children, and the later mental health of those who in childhood experience pain. Prevalence, co-occurrence, and associated psychosocial factors of pain symptoms and sleep problems were also assessed. In study I, prevalence changes in eight-year-old children’s pain symptoms and sleep problems were investigated in three cross-sectional population-based samples (years 1989: n=1038, 1999: n=1035, and 2005: n=1030). In study II, cross-sectional associations between pain symptoms, sleep problems, and psychosocial factors were assessed among 13-18-year-old adolescents (n=2476). In studies III and IV, associations between pain symptoms at age eight (n=6017), and register-based data on antidepressant use and severe suicidality by age 24, were examined in a nationwide birth cohort. Pain symptoms and sleep problems were common and often co-occurred. A considerable number of children’s pain symptoms remained unrecognized by the parents. The prevalence of pain symptoms, sleep problems, and multiple concurrent symptoms approximately doubled from 1989 to 2005. Psychiatric difficulties or demographic factors did not explain the increase. Psychosocial factors that were associated with pain, sleep problems, and a higher number of symptoms, were female sex, psychological difficulties, emotional symptoms, smoking, victimization, and feeling not cared about by teachers. In longitudinal analyses, the child’s own report of headache, and to a smaller degree the parental report of the child’s abdominal pain predicted later antidepressant use. Parental report of the child’s abdominal pain predicted severe suicidality among males. If one of the symptoms is present, health care professionals should inquire about other symptoms as well. Questions should be directed to the children, not only to their parents. Inquiring about psychiatric difficulties, substance use, victimization, and relations with teachers should be included as a part of the assessment. Further studies are needed to clarify the reasons that underlie the increased prevalence rates, and the factors that may increase or decrease the risk for later mental health problems among pain-suffering children.

Multidata inverse problems and Bayesian solution methods in astronomy

Statistical analyses of measurements that can be described by statistical models are of essence in astronomy and in scientific inquiry in general. The sensitivity of such analyses, modelling approaches, and the consequent predictions, is sometimes highly dependent on the exact techniques applied, and improvements therein can result in significantly better understanding of the observed system of interest. Particularly, optimising the sensitivity of statistical techniques in detecting the faint signatures of low-mass planets orbiting the nearby stars is, together with improvements in instrumentation, essential in estimating the properties of the population of such planets, and in the race to detect Earth-analogs, i.e. planets that could support liquid water and, perhaps, life on their surfaces. We review the developments in Bayesian statistical techniques applicable to detections planets orbiting nearby stars and astronomical data analysis problems in general. We also discuss these techniques and demonstrate their usefulness by using various examples and detailed descriptions of the respective mathematics involved. We demonstrate the practical aspects of Bayesian statistical techniques by describing several algorithms and numerical techniques, as well as theoretical constructions, in the estimation of model parameters and in hypothesis testing. We also apply these algorithms to Doppler measurements of nearby stars to show how they can be used in practice to obtain as much information from the noisy data as possible. Bayesian statistical techniques are powerful tools in analysing and interpreting noisy data and should be preferred in practice whenever computational limitations are not too restrictive.

Be-Fe coupled method for the analysis of 3D elastodynamic problems in the time domain

By coupling the Boundary Element Method (BEM) and the Finite Element Method (FEM) an algorithm that combines the advantages of both numerical processes is developed. The main aim of the work concerns the time domain analysis of general three-dimensional wave propagation problems in elastic media. In addition, mathematical and numerical aspects of the related BE-, FE- and BE/FE-formulations are discussed. The coupling algorithm allows investigations of elastodynamic problems with a BE- and a FE-subdomain. In order to observe the performance of the coupling algorithm two problems are solved and their results compared to other numerical solutions.