Décomposition automatique de signaux EMG intramusculaires

Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal.

Gender Benders: Shakespeare's Rosalind and Woolf's Orlando

English Renaissance playwright, William Shakespeare and twentieth century modernist author, Virginia Woolf’s works, “As You Like It” (1599) and “Orlando” (1928), respectively posit a vision of gender that transcends the physical sex of the body. The play’s heroine, Rosalind, and the novel’s protagonist, Orlando, each challenge the stability of the binary categories of male and female, demonstrating how gender is not absolute but rather a constantly adapting and evolving construct. This thesis traces the development of Rosalind and Orlando by analyzing and comparing both protagonists’ journeys towards concordia discors, considering how gender transformation plays a pivotal role in helping both figures transcend prescribed gender roles and restraints placed upon them by family and society. Both Rosalind and Orlando mount challenges to prescribed gender norms during periods when conservative gender roles were strictly enforced. By doing so, each character positions themselves as pivotal and progressive representations of gender performance for their time.

Parallel nonconvex generalized Benders decomposition for natural gas production network planning under uncertainty

A scenario-based two-stage stochastic programming model for gas production network planning under uncertainty is usually a large-scale nonconvex mixed-integer nonlinear programme (MINLP), which can be efficiently solved to global optimality with nonconvex generalized Benders decomposition (NGBD). This paper is concerned with the parallelization of NGBD to exploit multiple available computing resources. Three parallelization strategies are proposed, namely, naive scenario parallelization, adaptive scenario parallelization, and adaptive scenario and bounding parallelization. Case study of two industrial natural gas production network planning problems shows that, while the NGBD without parallelization is already faster than a state-of-the-art global optimization solver by an order of magnitude, the parallelization can improve the efficiency by several times on computers with multicore processors. The adaptive scenario and bounding parallelization achieves the best overall performance among the three proposed parallelization strategies.

Formalin fixation affects equilibrium partitioning of an ionic contrast agent-microcomputed tomography (EPIC-[mu]CT) imaging of osteochondral samples

Equilibrium Partitioning of an Ionic Contrast agent with microcomputed tomography (EPIC-[mu]CT) is a non-invasive technique to quantify and visualize the three-dimensional distribution of glycosaminoglycans (GAGs) in fresh cartilage tissue. However, it is unclear whether this technique is applicable to already fixed tissues. Therefore, this study aimed at investigating whether formalin fixation of bovine cartilage affects X-ray attenuation, and thus the interpretation of EPIC-[mu]CT data.Design Osteochondral samples (n = 24) were incubated with ioxaglate, an ionic contrast agent, for 22 h prior to [mu]CT scanning. The samples were scanned in both formalin-fixed and fresh conditions. GAG content was measured using a biochemical assay and normalized to wet weight, dry weight, and water content to determine potential reasons for differences in X-ray attenuation.Results The expected zonal distribution of contrast agent/GAGs was observed for both fixed and fresh cartilage specimens. However, despite no significant differences in GAG concentrations or physical properties between fixed and fresh samples, the average attenuation levels of formalin-fixed cartilage were 14.3% lower than in fresh samples.Conclusions EPIC-[mu]CT is useful for three-dimensional visualization of GAGs in formalin-fixed cartilage. However, a significant reduction in X-ray attenuation for fixed (compared to fresh) cartilage must be taken into account and adjusted for accordingly when quantifying GAG concentrations using EPIC-[mu]CT.

Comparative study of depth-dependent characteristics of equine and human osteochondral tissue from the medial and lateral femoral condyles

Articular cartilage defects are common after joint injuries. When left untreated, the biomechanical protective function of cartilage is gradually lost, making the joint more susceptible to further damage, causing progressive loss of joint function and eventually osteoarthritis (OA). In the process of translating promising tissue-engineering cartilage repair approaches from bench to bedside, pre-clinical animal models including mice, rabbits, goats, and horses, are widely used. The equine species is becoming an increasingly popular model for the in vivo evaluation of regenerative orthopaedic approaches. As there is also an increasing body of evidence suggesting that successful lasting tissue reconstruction requires an implant that mimics natural tissue organization, it is imperative that depth-dependent characteristics of equine osteochondral tissue are known, to assess to what extent they resemble those in humans. Therefore, osteochondral cores (4-8 mm) were obtained from the medial and lateral femoral condyles of equine and human donors. Cores were processed for histology and for biochemical quantification of DNA, glycosaminoglycan (GAG) and collagen content. Equine and human osteochondral tissues possess similar geometrical (thickness) and organizational (GAG, collagen and DNA distribution with depth) features. These comparable trends further underscore the validity of the equine model for the evaluation of regenerative approaches for articular cartilage.

Thermal decomposition of zirconyl oxalates I. Barium zirconyl oxalate

Conditions for the preparation of stoichiometric barium zirconyl oxalate heptahydrate (BZO) have been standardized. The thermal decomposition of BZO has been investigated employing TG, DTG and DTA techniques and chemical and gas analysis. The decomposition proceeds through four steps and is not affected much by the surrounding gas atmosphere. Both dehydration and oxalate decomposition take place in two steps. The formation of a transient intermediate containing both oxalate and carbonate groups is inferred. The decomposition of oxalate groups results in a carbonate of composition Ba2Zr2O5CO3, which decomposes between 600 and 800° and yields barium zirconate. Chemical analysis, IR spectra and X-ray powder diffraction data support the identity of the intermediate as a separate entity.Die Bedingungen für die Herstellung von stöchiometrischem Barium-zirconyl-oxalat Heptahydrat (BZO) wurden standardisiert. Die thermische Zersetzung von BZO wurde unter Einsatz der TG-, DTG- und DTA, sowie der chemischen und Gasanalyse untersucht. Die Zersetzung verläuft über vier Stufen und wird von der umgebenden Gasathmosphäre nicht besonders beeinflusst. Sowohl die Dehydratisierung als auch die Oxalatzersetzung erfolgt in zwei Stufen. Die Bildung einer intermediären Übergangsverbindung mit sowohl Oxalat- als auch Carbonatgruppen wirken hierbei mit. Die Zersetzung der Oxalatgruppen ergibt ein Carbonat der Zusammensetzung Ba2Zr2O5CO3, das zwischen 600 und 800° zersetzt wird und Bariumzirconat ergibt. Die Angaben der chemischen Analyse, der IR-Spekren und der Röntgen-Pulver-Diffraktion unterstützen die Identität der Intermediärverbindung als eine separate Einheit.On a standardisé les conditions de préparation de l'oxalate heptahydraté de zirconyle et de baryum (BZO) stoechiométrique. On a étudié la décomposition thermique de BZO par TG, TGD et ATD ainsi que par analyses chimiques et analyses des gaz. La décomposition a lieu en quatre étapes et n'est pas trop influencée par l'atmosphère ambiante. La déshydratation et la décomposition de l'oxalate ont lieu en deux étapes. Il se forme un composé intermédiaire de transition contenant à la fois les groupes oxalate et carbonate. La décomposition des groupes oxalate fournit un carbonate de composition Ba2Zr2O5CO3 qui se décompose entre 600 et 800° pour fournir du zirconate de baryum. L'analyse chimique, les spectres IR et la diffraction des rayons X sur poudre, apportent les preuves de l'existence d'un composé intermédiaire comme entité séparée.

Evolution of the DRD2 gene haplotype and its association with alcoholism in Mexican Americans

The human D2 dopamine receptor gene (DRD2) plays a central role in the neuromodulation of appetitive behaviors and is implicated in having a possible role in susceptibility to alcoholism. We genotyped an SNP in DRD2 Exon 8 in 251 nonalcoholic, unrelated, healthy controls and 200 alcoholic Mexican Americans. The DRD2 haplotypes were analyzed using the Exon 8 genotype in combination with five other SNP genotypes, which were obtained from our previous study. The ancestral origins of the DRD2 polymorphisms have been determined by sequencing the homologous region in other higher primates. Twenty DRD2 haplotypes, defined as H1 to H20 based on their frequency from high to low, were obtained in this major minority population. The ancestral haplotype "I-132-G-C-G-A1" and two one-step mutation haplotypes were absent in our study population. The haplotype H1, "I-B1-T-C-A-A1", with the highest frequency in the population, is a three-step mutation from the ancestral form. The first five or eight major haplotypes make up 87% or 95% of the entire population, respectively. The prevalence of the haplotype H1+ (H1/H1 and H1/Hn genotypes) is significantly higher in alcoholics and alcoholic subgroups, including early onset drinkers and benders, than in their respective control groups. The Promoter -141C allele is in linkage disequilibrium (LD) with five other loci in the nonalcoholic group, but not in the alcoholic group. All of the other five loci are in LD in both the alcoholic and control groups. The DRD2 TaqI B allele is in complete LD with the allele located in intron 6. Five SNPs, Promoter -141C, TaqI B (or Intron 6), Exon 7, Exon 8, and TaqI A, are sufficient to define the DRD2 haplotypes in Mexican Americans. Our data indicate that the DRD2 haplotypes are associated with alcoholism in Mexican Americans. (c) 2005 Elsevier Inc. All rights reserved.

Optimization techniques for power distribution planning with uncertainties: a comparative study

Important research effort has been devoted to the topic of optimal planning of distribution systems. The non linear nature of the system, the need to consider a large number of scenarios and the increasing necessity to deal with uncertainties make optimal planning in distribution systems a difficult task. Heuristic techniques approaches have been proposed to deal with these issues, overcoming some of the inherent difficulties of classic methodologies. This paper considers several methodologies used to address planning problems of electrical power distribution networks, namely mixedinteger linear programming (MILP), ant colony algorithms (AC), genetic algorithms (GA), tabu search (TS), branch exchange (BE), simulated annealing (SA) and the Bender´s decomposition deterministic non-linear optimization technique (BD). Adequacy of theses techniques to deal with uncertainties is discussed. The behaviour of each optimization technique is compared from the point of view of the obtained solution and of the methodology performance. The paper presents results of the application of these optimization techniques to a real case of a 10-kV electrical distribution system with 201 nodes that feeds an urban area.

Optimal methodology for distribution systems reconfiguration based on OPF and solved by decomposition technique

This paper presents a new and efficient methodology for distribution network reconfiguration integrated with optimal power flow (OPF) based on a Benders decomposition approach. The objective minimizes power losses, balancing load among feeders and subject to constraints: capacity limit of branches, minimum and maximum power limits of substations or distributed generators, minimum deviation of bus voltages and radial optimal operation of networks. The Generalized Benders decomposition algorithm is applied to solve the problem. The formulation can be embedded under two stages; the first one is the Master problem and is formulated as a mixed integer non-linear programming problem. This stage determines the radial topology of the distribution network. The second stage is the Slave problem and is formulated as a non-linear programming problem. This stage is used to determine the feasibility of the Master problem solution by means of an OPF and provides information to formulate the linear Benders cuts that connect both problems. The model is programmed in GAMS. The effectiveness of the proposal is demonstrated through two examples extracted from the literature.

Aversion Analysis

In this paper : a) the consumer’s problem is studied over two periods, the second one involving S states, and the consumer being endowed with S+1 incomes and having access to N financial assets; b) the consumer is then representable by a continuously differentiable system of demands, commodity demands, asset demands and desirabilities of incomes (the S+1 Lagrange multiplier of the S+1 constraints); c) the multipliers can be transformed into subjective Arrow prices; d) the effects of the various incomes on these Arrow prices decompose into a compensation effect (an Antonelli matrix) and a wealth effect; e) the Antonelli matrix has rank S-N, the dimension of incompleteness, if the consumer can financially adjust himself when facing income shocks; f) the matrix has rank S, if not; g) in the first case, the matrix represents a residual aversion; in the second case, a fundamental aversion; the difference between them is an aversion to illiquidity; this last relation corresponds to the Drèze-Modigliani decomposition (1972); h) the fundamental aversion decomposes also into an aversion to impatience and a risk aversion; i) the above decompositions span a third decomposition; if there exists a sure asset (to be defined, the usual definition being too specific), the fundamental aversion admits a three-component decomposition, an aversion to impatience, a residual aversion and an aversion to the illiquidity of risky assets; j) the formulas of the corresponding financial premiums are also presented.

Time Reversibility of Stationary Regular Finite State Markov Chains

We propose an alternate parameterization of stationary regular finite-state Markov chains, and a decomposition of the parameter into time reversible and time irreversible parts. We demonstrate some useful properties of the decomposition, and propose an index for a certain type of time irreversibility. Two empirical examples illustrate the use of the proposed parameter, decomposition and index. One involves observed states; the other, latent states.

Optimization of p-cycle protection schemes in optical networks

La survie des réseaux est un domaine d'étude technique très intéressant ainsi qu'une préoccupation critique dans la conception des réseaux. Compte tenu du fait que de plus en plus de données sont transportées à travers des réseaux de communication, une simple panne peut interrompre des millions d'utilisateurs et engendrer des millions de dollars de pertes de revenu. Les techniques de protection des réseaux consistent à fournir une capacité supplémentaire dans un réseau et à réacheminer les flux automatiquement autour de la panne en utilisant cette disponibilité de capacité. Cette thèse porte sur la conception de réseaux optiques intégrant des techniques de survie qui utilisent des schémas de protection basés sur les p-cycles. Plus précisément, les p-cycles de protection par chemin sont exploités dans le contexte de pannes sur les liens. Notre étude se concentre sur la mise en place de structures de protection par p-cycles, et ce, en supposant que les chemins d'opération pour l'ensemble des requêtes sont définis a priori. La majorité des travaux existants utilisent des heuristiques ou des méthodes de résolution ayant de la difficulté à résoudre des instances de grande taille. L'objectif de cette thèse est double. D'une part, nous proposons des modèles et des méthodes de résolution capables d'aborder des problèmes de plus grande taille que ceux déjà présentés dans la littérature. D'autre part, grâce aux nouveaux algorithmes, nous sommes en mesure de produire des solutions optimales ou quasi-optimales. Pour ce faire, nous nous appuyons sur la technique de génération de colonnes, celle-ci étant adéquate pour résoudre des problèmes de programmation linéaire de grande taille. Dans ce projet, la génération de colonnes est utilisée comme une façon intelligente d'énumérer implicitement des cycles prometteurs. Nous proposons d'abord des formulations pour le problème maître et le problème auxiliaire ainsi qu'un premier algorithme de génération de colonnes pour la conception de réseaux protegées par des p-cycles de la protection par chemin. L'algorithme obtient de meilleures solutions, dans un temps raisonnable, que celles obtenues par les méthodes existantes. Par la suite, une formulation plus compacte est proposée pour le problème auxiliaire. De plus, nous présentons une nouvelle méthode de décomposition hiérarchique qui apporte une grande amélioration de l'efficacité globale de l'algorithme. En ce qui concerne les solutions en nombres entiers, nous proposons deux méthodes heurisiques qui arrivent à trouver des bonnes solutions. Nous nous attardons aussi à une comparaison systématique entre les p-cycles et les schémas classiques de protection partagée. Nous effectuons donc une comparaison précise en utilisant des formulations unifiées et basées sur la génération de colonnes pour obtenir des résultats de bonne qualité. Par la suite, nous évaluons empiriquement les versions orientée et non-orientée des p-cycles pour la protection par lien ainsi que pour la protection par chemin, dans des scénarios de trafic asymétrique. Nous montrons quel est le coût de protection additionnel engendré lorsque des systèmes bidirectionnels sont employés dans de tels scénarios. Finalement, nous étudions une formulation de génération de colonnes pour la conception de réseaux avec des p-cycles en présence d'exigences de disponibilité et nous obtenons des premières bornes inférieures pour ce problème.