Le but de cette thèse était d'étudier, in vivo, la cinématique en 3D du genou lors de la marche sur des patients souffrant d'arthrose du genou et de quantifier l'apport de l'arthroplastie totale du genou (PTG) sur la restauration d'une cinématique normale. Trente patients et un groupe de contrôle composé de 12 participants du même âge ont été inclus dans la première étude. Sur ces 30 patients, nous avons obtenu des évaluations de suivi après l'arthroplastie totale du genou sur 20 patients, avec un délai moyen de 11 mois. L'analyse cinématique tridimensionnelle du genou a été réalisée en utilisant le système KneeKGTM. Cette analyse de la marche a révélé que la cinématique de genou avec arthrose médiale diffère de la cinématique du genou sain. Le groupe avec arthrose du genou montrait une stratégie de raidissement de la marche en présentant une réduction de mouvement non seulement dans le plan sagittal, mais aussi dans le plan axial. Après PTG, les patients avaient de meilleurs paramètres cliniques, spatio-temporels et cinématiques. Malgré les améliorations, la cinématique du genou lors de la marche dans le groupe PTG différaient de celle du groupe contrôle / Patients with knee osteoarthritis tend to modify spatial and temporal parameters during walking to reduce the pain. There are common gait features which are consistently shown to be significantly linked to osteoarthritis severity such as knee adduction moment, knee flexion angle, stiffness and walking speed. Total knee arthroplasty (TKA) is considered the gold standard treatment for end-stage knee osteoarthritis. Nearly a million of total knee prosthesis are implanted worldwide each year. However, reduced physical function of the knee is partly, but apparently not fully, remedied by surgery. The purpose of this thesis was to investigate the in vivo, three dimensional knee kinematics during gait at the patients with knee osteoarthritis and the influence of total knee arthroplasty on restoration of normal kinematics. Weight bearing kinematics in medial OA knees differ from normal knee kinematics. Knee OA group showed an altered “screw-home” mechanism by decreased excursion in sagittal and axial tibial rotation and a posterior translation of the tibia. Following TKA, patients had better clinical, spatiotemporal and kinametic parameters. They walked longer, faster and with a better range of motion. Despite improvements, the knee kinematics during gait in TKA group differed from healthy control group. They had a lower extension, lower range of axial rotation and an increased tibial posterior translation. Future research should be focused on comparing different designs of prosthesis pre- and post operatively in a longer follow-up delay

<p dir="ltr"> The general design goal of low latency communication systems is to minimize the end-to-end delay while attaining the predefined reliability and throughput requirements. The burgeoning demand for low latency communications motivates a renewed research interest of the tradeoff between delay, throughput, and reliability. In this dissertation research, we consider slotted-based systems and explore the potential advantages of the so-called sequential codes in low latency network communications.</p><p dir="ltr"> The first part of this dissertation analyzes the exact error probability of random linear streaming codes (RLSCs) in the large field size regime over the stochastic independently and identically distributed (i.i.d.) symbol erasure channels (SECs). A closed-form expression of the error probability <i>p</i>_<em>e</em> of large-field-size RLSCs is derived under, simultaneously, the finite memory length α and decoding deadline Δ constraints. The result is then used to examine the intricate tradeoff between memory length (complexity), decoding deadline (delay), code rate (throughput), and error probability (reliability). Numerical evaluation shows that under the same code rate and error probability requirements, the end-to-end delay of RLSCs is 40-48% of that of the optimal block codes (i.e., MDS codes). This implies that switching from block codes to streaming codes not only eliminates the queueing delay completely (which accounts for the initial 50% of the delay reduction) but also improves the reliability (which accounts for the additional 2-10% delay reduction).</p><p dir="ltr"> The second part of this dissertation focuses on the asymptotics of the error probability of RLSCs in the same system model of the first part. Two important scenarios are analyzed: (i) tradeoff between Δ and <i>p</i>_<em>e</em> under infinite α; and (ii) tradeoff between α and <i>p</i>_<em>e</em> under infinite Δ. In the first scenario, the asymptote of <i>p</i>_<em>e</em>(Δ) is shown to be <i>ρ</i>Δ^-1.5<i>e</i>^-^<em>η</em>^Δ. The asymptotic power term Δ^-1.5 of RLSCs is a strict improvement over the Δ^-0.5 term of random linear block codes. A pair of upper and lower bound on the asymptotic constant <i>ρ</i> is also derived, which are tight (i.e., identical) for one specific class of SECs. In the second scenario, a refine approximation is proposed by computing the parameters in a multiterm asymptotic form, which closely matches the exact error probability even for small memory length (≈ 20). The results of the asymptotics can be further exploited to find the <i>c</i>-optimal memory length <i>α</i>_<em>c</em>^*(Δ), which is defined as the minimal memory length α needed for the resulting <i>p</i>_<em>e</em> to be within a factor of <i>c</i>>1 of the best possible <i>p</i>_<em>e</em>^<em>*</em>_{<em> </em>}for any Δ, an important piece of information for practical implementation.</p><p dir="ltr"> Finally, we characterize the channel dispersions of RLSCs and MDS block codes, respectively. New techniques are developed to quantify the channel dispersion of sequential (non-block-based) coding, the first in the literature. The channel dispersion expressions are then used to compare the levels of error protection between RLSCs and MDS block codes. The results show that if and only if the target error probability <i>p</i>_<em>e</em> is smaller than a threshold (≈ 0.1774), RLSCs offer strictly stronger error protection than MDS block codes, which is on top of the already significant 50% latency savings of RLSCs that eliminate the queueing delay completely.</p>