No description available.

Serverless is a fascinating trend in modern software development which consists of pay-as-you-go, autoscaling services. Promised reduction in operational and development costs attracts not only startups but also enterprise clients despite that serverless is a relatively fresh field where new patterns and services continue to emerge. Serverless started as independent services which solve specific problems (highly scalable storage and computing), and now it's become a paradigm shift how systems are built. This thesis addressed questions when and how to start with serverless by reviewing available literature, conducting interviews with IT professionals, analyzing available tools, identifying limitations of serverless architecture and providing checklist when serverless is applicable. The focus was on AWS serverless stack, but main findings are generic and hold for all serverless providers serverless delivers what it promises, however, the devil is in the detail. Providers are continuously working to resolve limitations or building new services as solutions in order to make serverless the next phase of cloud evolution. / Serverless är en fascinerande trend inom nutida mjukvaruutveckling som består av pay-as-you-go, autoscaling-tjänster. Löftet om reducerade kostnader för drift och utveckling attraherar såväl startupföretag som storföretag, trots att serverless är ett relativt nytt område där nya inriktningar och tjänster fortsätter att uppkomma. Serverless började som en oberoende tjänst som löste specifika problem (högt skalbar lagring och databehandling), och har nu blivit ett paradigmskifte för hur system byggs. Denna uppsats sökte svar på frågor om när och hur man ska börja med serverless genom att granska tillgängliga publikationer, genomföra intervjuer med IT-experter, analysera tillgängliga verktyg och identifiera begränsningarna i serverless-arkitekturen. Fokus ligger på AWS serverless stack, men de huvudsakliga slutsatserna är generiska och gäller för alla serverless-leverantörer – serverless håller vad den lovar, men djävulen bor i detaljerna. Tjänsteleverantörerna jobbar oavbrutet med att lösa begränsningarna eller skapa nya tjänster och lösningar som ska göra serverless till nästa fas i molnevolutionen.

Animals have evolved over billions of years and understanding these complex and intertwined systems have potential to advance the technology in the field of sports science, robotics and more. As such, a gait analysis using Motion Capture (MOCAP) technology is the subject of a number of research and development projects aimed at obtaining quantitative measurements. Existing MOCAP technology has limited the majority of studies to the analysis of the steady-state locomotion in a controlled (indoor) laboratory environment. MOCAP systems such as the optical, non-optical acoustic and non-optical magnetic MOCAP systems require predefined capture volume and controlled environmental conditions whilst the non-optical mechanical MOCAP system impedes the motion of the subject. Although the non-optical inertial MOCAP system allows MOCAP in an outdoor environment, it suffers from measurement noise and drift and lacks global trajectory information. The accuracy of these MOCAP systems are known to decrease during the tracking of the transient locomotion. Quantifying the manoeuvrability of animals in their natural habitat to answer the question “Why are animals so manoeuvrable?” remains a challenge. This research aims to develop an outdoor MOCAP system that will allow tracking of the steady-state as well as the transient locomotion of an animal in its natural habitat outside a controlled laboratory condition. A number of researchers have developed novel MOCAP systems with the same aim of creating an outdoor MOCAP system that is aimed at tracking the motion outside a controlled laboratory (indoor) environment with unlimited capture volume. These novel MOCAP systems are either not validated against the commercial MOCAP systems or do not have comparable sub-millimetre accuracy as the commercial MOCAP systems. The developed DGPS/MEMS-IMU multi-receiver fusion MOCAP system was assessed to have global trajectory accuracy of _0:0394m, relative limb position accuracy of _0:006497m. To conclude the research, several recommendations are made to improve the developed MOCAP system and to prepare for a field-testing with a wild animal from a family of a terrestrial megafauna.

<p> Lambda carrageenan when injected subcutaneously causes the formation of a connective tissue granuloma. Initially there is a proliferation of connective tissue elements up to about fourteen days followed by regression so that by six weeks most collagenous tissue has disappeared and been replaced by adipose tissue. Lambda carrageenan has been identified in the granuloma by staining reactions with toluidine blue and other stains for acid polysaccharides. The present study was undertaken to localize the carrageenan by means of fluorescent antibody and autoradiography. For this purpose labelling of carrageenan by photoassimilation of 14CO2 into carrageenan was done. Different parameters affecting the incorporation of 14C into the carrageenan fractions were studied.</p> / Thesis / Master of Science (MSc)

A simulation-based reliability analysis method is presented and evaluated. This method is intended for problems for which most probable point of failure (MPP) search-based methods fail or provide inaccurate results, and for which Monte Carlo simulation and its variants are too costly to apply. This may occur in the evaluation of complex engineering problems of low failure probability. The method used to address this problem is a variant of conditional expectation and works by sampling on the failure boundary without relying on the MPP. The effectiveness of the method is compared to a selection of other commonly available reliability methods considering a variety of analytical as well as more complex engineering problems. The results indicate that the method has the potential to deliver solutions of high efficiency and accuracy for a wide range of difficult reliability problems.

No description available.

No description available.

La construction de la fonction L p-adique de Kubota-Leopoldt L[indice p](χω[exposant 1+β])(s) d'un caractère χ associé à un corps de nombres K par la méthode Daniel Delbourgo dans [Del09] permet de l'exprimer comme une série infinie à coefficients dans O[indice K] pour chaque branche β modulo p-1. Par cette méthode, inspirée par N. Alharbi, R. Kammoun et C.Ozel dans [AKO19] pour un corps quadratique imaginaire Q( √[c.-à-d. racine carrée](-D)) et par D. Delbourgo and Q. Chao dans [DC15] pour un corps cubique cyclique totalement réel de conducteur f = (a²+3b²)/4 et de discriminant D = f², ce mémoire a pour but de calculer numériquement le lambda invariant, noté par λ[indice p](χ), de la fonction L p-adique d'un caractère de Dirichlet χ de degré 4 à valeurs dans Z[exposant ×][indice p] sur l'extension quartique K sous-corps de Q(μ[indice ℓ]) pour ℓ ≡ 1 (mod 4) en utilisant le logiciel PARI/GP. Pour p = 5, on établira que λ[indice p](χ) = λ[indice p](χ⁻¹) pour χ⁻¹ l'inverse de χ. / The method given by Daniel Delbourgo in [Del09] allows us to write down an expansion of the p-adic L function L[subscript p](χω[superscript 1+β])(s) of a character χ associated to a number field K as an infinite series with coefficients in O[subscript K]. From this method, inspired by N. Alharbi, R. Kammoun and C. Ozel in [AKO19] for an imaginary quadratic field Q( √[i.e. square root](-D)) and by D. Delbourgo and Q. Chao in [DC15] for a totally real cyclic cubic field with conductor f = (a²+3b²)/4 and discriminant D = f², the aim of this thesis is to compute numerically the lambda invariant, denoted by λ[subscript p](χ), of the p-adic L function for a Dirichlet character χ of degree 4 with Z[superscript ×][subscript p] -values over the quartic extension K subfield of the cyclotomic extension Q(μ[subscript ℓ]) for ℓ ≡ 1 (mod 4) using PARI/GP. For p = 5, we will etablish that λ[subscript p](χ) = λ[subscript p](χ⁻¹) for χ⁻¹ the inverse of χ.

We construct a strong filtered graph $\Gamma_s(\Lambda)$ dependent on the dominant weight $\Lambda$, and a weak filtered graph $\Gamma_w(\Kcen)$ dependent on the canonical central element $\Kcen$ for an arbitrary Kac-Moody algebra $g$. In our construction, both graphs $(\Gamma_s(\Lambda), \Gamma_w(\Kcen))$ have the vertex set as the Weyl group of $g$, with the grading given by the length function. The edges of the graph $\Gamma_s(\La)$ are labeled versions of the $\lambda$-chain model of K-Chevalley rules for Kac-Moody flag manifolds as developed by Lenart and Shimozono, originally defined by Lenart and Postnikov. Meanwhile, the labels on $\Gamma_w(\Kcen)$ come from the dual multiplication map of K-cohomology of affine Grassmannian $Gr_G$. We conjecture that the strong filtered graph and weak filtered graph are dual, which means we get an identity when we apply the up and down operators on the vertices. We proved this identity except one case that where we call the chain is $j$-present. Our identity is similar to the Möbius construction of the dual filtered graph, as previously studied by Patrias and Pylyavskyy, and in fact, in the limit $n\rightarrow \infty$ of the $A^{(1)}_{n-1}$, our construction recovers their identity. We also expect to recover their combinatorics of Möbius deformation of the shifted Young's lattice in type $C^{(1)}_n$ as $n$ approaches infinity. / Doctor of Philosophy / In this thesis, we introduce a pair of graphs $(\Gamma_s(\La),\Gamma_w(\Kcen))$ motivated by the study of affine Schubert calculus. Affine Schubert calculus emerges as an extension and generalization of classical Schubert calculus, which involves questions such as determining the number of lines intersecting four lines in three-dimensional space. This type of questions can often be translated into computations aimed at finding the structure constants for the Schubert basis in the K-(co)homology of the flag varieties such as affine Grassmannian. These structure constants represent the coefficients of the Schubert basis in the product of the other two Schubert bases, all indexed by the Weyl group of the affine Lie algebra $g$. We define up and down operators on the vertices of graphs $(\Gamma_s(\Lambda), \Gamma_w(\Kcen))$, which are elements in Weyl group of $g$, utilizing the structure constants as essential components. We conjecture that, in general, and prove in certain cases, this approach yields new identities for these operators, leading us to define this pair of graphs as a dual filtered graph.

At the heart of the connections between Proof Theory and Type Theory, the Curry-Howard correspondence provides proof-terms with computational features and equational theories, i.e. notions of normalisation and equivalence. This dissertation contributes to extend its framework in the directions of proof-theoretic formalisms (such as sequent calculus) that are appealing for logical purposes like proof-search, powerful systems beyond propositional logic such as type theories, and classical (rather than intuitionistic) reasoning. Part I is entitled Proof-terms for Intuitionistic Implicational Logic. Its contributions use rewriting techniques on proof-terms for natural deduction (Lambda-calculus) and sequent calculus, and investigate normalisation and cut-elimination, with call-by-name and call-by-value semantics. In particular, it introduces proof-term calculi for multiplicative natural deduction and for the depth-bounded sequent calculus G4. The former gives rise to the calculus Lambdalxr with explicit substitutions, weakenings and contractions that refines the Lambda-calculus and Beta-reduction, and preserves strong normalisation with a full notion of composition of substitutions. The latter gives a new insight to cut-elimination in G4. Part II, entitled Type Theory in Sequent Calculus develops a theory of Pure Type Sequent Calculi (PTSC), which are sequent calculi that are equivalent (with respect to provability and normalisation) to Pure Type Systems but better suited for proof-search, in connection with proof-assistant tactics and proof-term enumeration algorithms. Part III, entitled Towards Classical Logic, presents some approaches to classical type theory. In particular it develops a sequent calculus for a classical version of System F_omega. Beyond such a type theory, the notion of equivalence of classical proofs becomes crucial and, with such a notion based on parallel rewriting in the Calculus of Structures, we compute canonical representatives of equivalent proofs.