Neuromuscular disorders like myotonic dystrophy (dystrophia myotonica or Steinert's disease) and spinal muscular atrophy are associated with perioperative complications related to muscle weakness. These patients have an increased sensitivity to non-depolarising neuromuscular blocking agents, which can lead to postoperative residual curarization (PORC) and its associated respiratory complication...

Virulence Volume 3 Issue 7 The fate of not sensing phosphate: Downregulation of type 1 fimbriae through activation of the Pho regulon reduces E. coli urinary tract virulence Comment on: Crépin S, et al. Infect Immun 2012; 80:2802-15; PMID:22665376; http://dx.doi.org/10.1128/IAI.00162-12 Sébastien Crépin, Gaëlle Porcheron, Josée Harel and Charles M. Dozois*; INRS-Institut Armand-Frappier; Laval,...

6 Mathieu Houde, Marcelo Gottschalk, Fleur Gagnon, Marie-Rose Van Calsteren, and 7 Mariela Segura* 8 9 10 Groupe de Recherche sur les Maladies Infectieuses du Porc and Centre de Recherche en 11 Infectiologie Porcine, Faculté de médecine vétérinaire, Université de Montréal, and Food 12 Research and Development Centre, Agriculture and Agri-Food Canada, Saint-Hyacinthe, 13 Québec, Canada. 14 15 16...

A new type of decomposition of graphs – the operator decomposition connected with the classical notion of homogeneous set (or module) is introduced. The properties of this decomposition are described. Using this decomposition we prove the following. Let P and Q be two hereditary graph classes such that P is closed with respect to the operation of join and Q is closed with respect to the operati...

A modified k-deck of a graph G is obtained by removing k edges of G in all possible ways, and adding k (not necessarily new) edges in all possible ways. Krasikov and Roditty asked if it was possible to construct the usual k-edge deck of a graph from its modified k-deck. Earlier I solved this problem for the case when k = 1. In this paper, the problem is completely solved for arbitrary k. The pr...

A modified k-deck of a graph is obtained by removing k edges in all possible ways and adding k (not necessarily new) edges in all possible ways. Krasikov and Roditty used these decks to give an independent proof of Müller’s result on the edge reconstructibility of graphs. They asked if a k-edge deck could be constructed from its modified k-deck. In this paper, we solve the problem when k = 1. W...

The NADPH-dependent protochlorophyllide (Pchlide) oxidoreductase (POR) is unique because it is a photoenzyme that requires light for its catalytic activity and uses Pchlide itself as a photoreceptor. In Arabidopsis, there are three structurally related PORs, denoted PORA, PORB, and PORC. The import of one of them, PORA, into plastids of cotyledons is substrate dependent. This substrate dependen...

Site U1316 (Proposal Site PORC-4A) is located in the downslope sediment deposits ~ 700 meters to the southwest of Challenger Mound. The principal objectives at Site U1316 were: • To gain insight into history of drift deposits on the downslope flank of the Challenger Mound and the off-mound transport of mound-related skeletal and non-skeletal grains. • To investigate the character and age of the...

A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. The Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that all triangle-free graphs G with connectivity two such that diam(G) = 2 or diam(G) = diam(G) = 3 are reconstructibl...