M.S.

Title: An examination of pelvic floor activity following the application of special exercises Objectives: The aim of this thesis is to validate the usefulness of carrying out local pelvic floor muscle examinations as an indication and education for therapy. A second objective is for the women involved in the research to subjectively evaluate the examination methods and therapy. Furthermore, the thesis aims to establish an example of a comprehensive and detailed local examination of the pelvic floor muscles. Methods: We measured the pelvic floor activity per vaginam using an EMG biofeedback device on clients with a pelvic floor dysfunction and grade I stress incontinence symptoms. Based on the results of the examination, therapy using the vaginal device was recommended and in six weeks a follow-up examination was carried out. The changes in pelvic floor activity were evaluated by comparing the initial and follow-up examinations. Thus the usefulness of carrying out an examination of the local pelvic floor muscles before indicating a therapy was validated. At the end of the examination an interview with participating clients was conducted in order to subjectively evaluate the method. Results: All of the women participating in the research had previously undergone a different method of pelvic floor...

Headlong Developments' application HeadmasterDev is currently adapted for a single user. To turn their application into a multi-user system the programming language Swift will be used. Furthermore, this thesis will evaluate whether Swift is an appropriate programming language for developing a server application, how to handle concurrency of shared resources and if it is possible to deploy the application on a operative system other than macOS. The result is that the concurrency model is dependent on the system's needs and that one should not commit to using Swift as the programming language for a server application, with some regard to the size of the application and it's uses. / Headlong Developments applikation HeadmasterDev är endast anpassad för en användare. För att kunna transformera deras applikation till ett fleranvändarsystem så kommer detta arbete att använda sig av programmeringsspråket Swift. Utöver detta kommer det även undersökas om programmeringsspråket Swift är lämpligt för denna typ av applikation, hur man bäst hanterar samtidighet av delade resurser och om det är möjligt att använda applikationen på en annan plattform än macOS. Resultatet kom att bli att hur man löser samtidighetsproblemen beror på systemets behov och att Swift inte är lämpligt för denna applikation med tanke på dess storlek och användningsområden.

<p>Perfect codes and minimal distance of a code have great importance in the study of theoryof codes. The perfect codes are classified generally and in particular for the Lee metric.However, there are very few perfect codes in the Lee metric. The Lee metric hasnice properties because of its definition over the ring of integers residue modulo q. It isconjectured that there are no perfect codes in this metric for q > 3, where q is a primenumber.The minimal distance comes into play when it comes to detection and correction oferror patterns in a code. A few bounds on the number of codewords and minimal distanceof a code are discussed. Some examples for the codes are constructed and their minimaldistance is calculated. The bounds are illustrated with the help of the results obtained.</p>

This dissertation presents a theory of grammatical aspect in which perfects and prospectives form a sub-group separate from perfectives and imperfectives. I claim that aspects in this sub-group display a number of similar semantic and syntactic behaviors because of the way in which they relate event and reference times. While perfectives and imperfectives situate these times in inclusion relations, perfects and prospectives separate event time from reference time. This effectively creates an interval, homogeneous with respect to the eventuality, that can be interpreted as a state. The separation of the times in these aspects also means that modification of the interval between these times is possible, as is modification by adverbials like since that cannot occur with other aspects. These claims are supported by the morphosyntax and semantics of aspect particles in Scottish Gaelic, with additional data from English. I investigate six particles in Scottish Gaelic, focusing on four I claim to mark various aspects and one I claim to be simply a preposition. I argue that in addition to two inclusion aspects, perfective and imperfective (expressed via a synthetic form and by a' , respectively), Scottish Gaelic shows four distinctions of precedence aspect - two retrospective (air , as dèidh) and two prospective (gu , a' dol do). I provide a neo-Reichenbachian analysis of these particles within event semantics. In each case, the particle is an instantiation of an Aspect head that existentially quantifies over an event and places its runtime in a relation to reference time. I also argue that the particle ann, which seems to appear with both verbal and nominal material, is not an aspect particle but a preposition. Its appearance in the same linear position as the aspect particles belies its distinct syntactic structure. Overall, the data indicate the benefit of a view of grammatical aspect in which the basic time relations of reference time within, before, and after event time delineate groups of aspects rather than individual distinctions. This view of aspect is a more cohesive alternative to one in which aspects that may actually be very similar are taken to exist in separate categories.

Let <b>A</b> and <b>B</b> be finite sets with |<b>A</b>|=<i>n</i> and |<b>B</b>|=<i>m</i>. An (<i>n</i>,<i>m</i>,<i>w</i>)-<i>perfect hash</i> family</i> is a collection <i>F</i> of functions from <b>A</b> to <b>B</b> such that for any <b>X</b> &#8838; <b>A</b> with |<b>X</b>|=<i>w</i>, there exists at least one ? &#8712; <i>F</i> such that ? is one-to-one when restricted to <b>X</b>. Perfect hash families are basic combinatorial structures and they have played important roles in Computer Science in areas such as database management, operating systems, and compiler constructions. Such hash families are used for memory efficient storage and fast retrieval of items such as reserved words in programming languages, command names in interactive systems, or commonly used words in natural languages. More recently, perfect hash families have found numerous applications to cryptography, for example, to broadcast encryption schemes, secret sharing, key distribution patterns, visual cryptography, cover-free families and secure frameproof codes. In this thesis, we survey constructions and applications of perfect hash families. For constructions, we divided the results into three parts, depending on underlying structure and properties of the constructions: combinatorial structures, linear functionals, and algebraic structures. For applications, we focus on those related to cryptography.

This thesis dealt with the English pluperfect in the Czech-English direction of translation. The aim of this thesis was to identify indices/motives leading to the use of the past perfect in the English translation, which could be found in the underlying Czech clauses. 200 examples and their English translational equivalents were analysed. Intercorp was used for excerption. It is an online parallel corpus tool made and run by Český národní korpus (Czech National Corpus). After the examples were excerpted, the complete parts of the Czech texts (used for excerption) were analysed. I tried to assess the constructions that should be translated by the past perfect myself. This should help to identify the Czech indices/motives leading to the use of the pluperfect in the English translation. My accuraccy in assessing the Czech constructions translated by the pluperfect was 38.5% (I managed to identify 77 out 200 examples found in the corpus). The examples found in the corpus were later classified according to the supposed reason for the use of the past perfect in the English translation, found in the Czech original. The groups were as follows: An adverbial or another lexical device contributing to specification of temporal relations (72 examples, 36%), Hypothetical past meaning (11 examples, 5.5%),...

This study contributes to the debate about the importance of focus on form to adult second language acquisition with an investigation of a Portuguese-speaking adult's acquisition of English present perfect from a historical, correlational, and qualitative viewpoint. Using a husband-wife interaction in the L1, it investigates whether explicit grammar instruction and error correction can lead to automatic production. The focus of the study, the distinction between L1 present simple and L2 present perfect, is contrasted with a control distinction: L1 stative and L2 progressive. The importance of these distinctions is that both are semantically challenging for the L2 acquirer; therefore, they might require focus on form. This study argues against claims based on Krashen's input hypothesis that only comprehensible input can promote acquisition and that explicit data and negative evidence only affect performance. The results confirm the importance of noticing (Schmidt and Frota, 1986) as an essential aspect of adult second language acquisition. With a thorough look at the semantics of the present perfect, the study shows that focus on form is highly recommended for the acquisition of complex structures.

Neste trabalho apresentamos condições suficientes para a obtenção de taxas exponenciais de convergência na lei multidimensional dos grandes números para campos aleatórios definidos em R^Z_d. Dentre possíveis aplicações do resultado apresentamos medidas não-gibbsianas e não-FKG (limites de saturaçãoo de processos de estacionamento) e medidas estacionárias originárias de sistemas de partículas (rede com perdas, incluindo o caso onde há interação de longo alcance com cauda pesada). / We describe sufficient conditions for the occurrence of exponential rates of convergence in the multidimensional law of large numbers for random fields in RZd . Non-gibbsian and non-FKG measures from statistical mechanics (jamming limits of RSA models) and IPS (stationary measures of loss networks, including heavy-tail long-range interaction) are indicated as examples where the result applies.

This dissertation contains two parts. The first part introduces the first class of perfect sampling algorithms for the steady-state distribution of multi-server queues in which the arrival process is a general renewal process and the service times are independent and identically distributed (iid); the first-in-first-out FIFO GI/GI/c queue with 2 <= c < 1. Two main simulation algorithms are given in this context, where both of them are built on the classical dominated coupling from the past (DCFTP) protocol. In particular, the first algorithm uses a coupled multi-server vacation system as the upper bound process and it manages to simulate the vacation system backward in time from stationarity at time zero. The second algorithm utilizes the DCFTP protocol as well as the Random Assignment (RA) service discipline. Both algorithms have finite expected termination time with mild moment assumptions on the interarrival time and service time distributions. Our methods are also extended to produce exact simulation algorithms for Fork-Join queues and infinite server systems. The second part presents general principles for the design and analysis of unbiased Monte Carlo estimators in a wide range of settings. The estimators possess finite work-normalized variance under mild regularity conditions. We apply the estimators to various applications including unbiased steady-state simulation of regenerative processes, unbiased optimization in Sample Average Approximations and distribution quantile estimation.