Restaurer, réformer, agir : la France en 1945 / [la Documentation française] ; textes rassemblés par Patrice Liquière ; préf. de François Bloch-Lainé

Collection : Les études de la Documentation française

A prospective observational study comparing a non-operator dependent automatic PWV analyser to pulse pressure, in assessing arterial stiffness in hemodialysis.

BACKGROUND: Chronic kidney disease (CKD) accelerates vascular stiffening related to age. Arterial stiffness may be evaluated measuring the carotid-femoral pulse wave velocity (PWV) or more simply, as recommended by KDOQI, monitoring pulse pressure (PP). Both correlate to survival and incidence of cardiovascular disease. PWV can also be estimated on the brachial artery using a Mobil-O-Graph; a non-operator dependent automatic device. The aim was to analyse whether, in a dialysis population, PWV obtained by Mobil-O-Graph (MogPWV) is more sensitive for vascular aging than PP. METHODS: A cohort of 143 patients from 4 dialysis units has been followed measuring MogPWV and PP every 3 to 6 months and compared to a control group with the same risk factors but an eGFR > 30 ml/min. RESULTS: MogPWV contrarily to PP did discriminate the dialysis population from the control group. The mean difference translated in age between the two populations was 8.4 years. The increase in MogPWV, as a function of age, was more rapid in the dialysis group. 13.3% of the dialysis patients but only 3.0% of the control group were outliers for MogPWV. The mortality rate (16 out of 143) was similar in outliers and inliers (7.4 and 8.0%/year). Stratifying patients according to MogPWV, a significant difference in survival was seen. A high parathormone (PTH) and to be dialysed for a hypertensive nephropathy were associated to a higher baseline MogPWV. CONCLUSIONS: Assessing PWV on the brachial artery using a Mobil-O-Graph is a valid and simple alternative, which, in the dialysis population, is more sensitive for vascular aging than PP. As demonstrated in previous studies PWV correlates to mortality. Among specific CKD risk factors only PTH is associated with a higher baseline PWV. TRIAL REGISTRATION: ClinicalTrials.gov Identifier: NCT02327962.

On balanced CSPs with high treewidth

Tractable cases of the binary CSP are mainly divided in two classes: constraint language restrictions and constraint graph restrictions. To better understand and identify the hardest binary CSPs, in this work we propose methods to increase their hardness by increasing the balance of both the constraint language and the constraint graph. The balance of a constraint is increased by maximizing the number of domain elements with the same number of occurrences. The balance of the graph is defined using the classical definition from graph the- ory. In this sense we present two graph models; a first graph model that increases the balance of a graph maximizing the number of vertices with the same degree, and a second one that additionally increases the girth of the graph, because a high girth implies a high treewidth, an important parameter for binary CSPs hardness. Our results show that our more balanced graph models and constraints result in harder instances when compared to typical random binary CSP instances, by several orders of magnitude. Also we detect, at least for sparse constraint graphs, a higher treewidth for our graph models.

Generating hard SAT/CSP instances using expander graphs

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.

Using Pareto optimality to explore the topology and dynamics of the human connectome.

Graph theory has provided a key mathematical framework to analyse the architecture of human brain networks. This architecture embodies an inherently complex relationship between connection topology, the spatial arrangement of network elements, and the resulting network cost and functional performance. An exploration of these interacting factors and driving forces may reveal salient network features that are critically important for shaping and constraining the brain's topological organization and its evolvability. Several studies have pointed to an economic balance between network cost and network efficiency with networks organized in an 'economical' small-world favouring high communication efficiency at a low wiring cost. In this study, we define and explore a network morphospace in order to characterize different aspects of communication efficiency in human brain networks. Using a multi-objective evolutionary approach that approximates a Pareto-optimal set within the morphospace, we investigate the capacity of anatomical brain networks to evolve towards topologies that exhibit optimal information processing features while preserving network cost. This approach allows us to investigate network topologies that emerge under specific selection pressures, thus providing some insight into the selectional forces that may have shaped the network architecture of existing human brains.

Modelització i simulació de processos dinàmics en xarxes complexes adaptatives

El 1736, Leonhard Euler va ser pioner en l'estudi de la teoria de grafs, i des de llavorsmúltiples autors com Kirchoff, Seymour, etc. continuaren amb l'estudi de la teoria i topologiade grafs. La teoria de xarxes, part de la teoria de grafs, també ha estat estudiada abastament.D'altra banda, la dinàmica de xarxes fou popularitzada per Dan Gillespie el 1977, en el qual proposà un algorisme que permet la simulació discreta i estocàstica d'un sistema de partícules, el qual és la base del treball ja que serveix per dur a terme les simulacions de processos sobre les xarxes complexes. El camp de l'anàlisi de la dinàmica de xarxes, de fet, és un campemergent en l'actualitat; comprèn tant l'anàlisi estadística com la utilització de simulacions persolucionar problemes de la mateixa dinàmica.Les xarxes complexes (xarxes de característiques complexes, sovint xarxes reals) també sónobjecte d'estudi de l'actualitat, sobretot a causa de l'aparició de les xarxes socials. S'han convertiten un paradigma per l'estudi de processos dinàmics en sistemes formats per molts componentsque interactuen entre si de manera molt homogèniaL'objectiu del treball és triple:1. Estudiar i entendre els conceptes bàsics i la topologia de les xarxes complexes, així comdiferents tipus de dinàmiques de processos sobre elles.2. Programar un simulador estocàstic en llenguatge C++ capaç de generar trajectòries mitjantçant l'algorisme de Gillespie tant pel model epidèmic com pel model de dinàmicad'enllaços amb reconnexió.3. Utilitzar el simulador tant per estudiar casos que ja han estat tractats en la literatura comcasos nous que no han estat tractats i que poden ser assimilables a xarxes reals com, perexemple, xarxes socials

Tandem-MAG-hitsauksen soveltuvuus isojen levylakanoiden valmistamiseen

Diplomityön tavoitteena oli selvittää tandem-MAG-hitsausmenetelmän soveltuvuus isojen levylakanoiden valmistamiseen. Päätavoitteena oli selvittää suurimmat saavutettavat hitsausnopeudet sekä railonvalmistukselle asetettavat vaatimukset kahdella laivanrakennusteräksellä. Tutkimuksessa käytettiin omia hitsauskokeita ja liitokset testattiin luokitusseurojen vaatimusten mukaisesti. Selvitettiin myös syntyvät hitsausmuodonmuutokset sekä edut ja rajoitukset verrattuna laserhitsaukseen. Lisäksi laadittiin ei-synergiselle pulssihitsauslaitteistolle suuntaa-antava synergiakäyrä tätä sovellusta varten hitsauskokeiden perusteella. Tandem-MAG-hitsaus osoittautui erittäin kilpailukykyiseksi hitsausmenetelmäksi sovelluksessa. Magneettisen puhalluksen havaittiin olevan merkittävä häiriötekijä tällä menetelmällä hitsattaessa.

Sherali-Adams Relaxations and Indistinguishability in Counting Logics

Two graphs with adjacency matrices $\mathbf{A}$ and $\mathbf{B}$ are isomorphic if there exists a permutation matrix $\mathbf{P}$ for which the identity $\mathbf{P}^{\mathrm{T}} \mathbf{A} \mathbf{P} = \mathbf{B}$ holds. Multiplying through by $\mathbf{P}$ and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional isomorphism. We show that the levels of the Sherali--Adams (SA) hierarchy of linear programming relaxations applied to fractional isomorphism interleave in power with the levels of a well-known color-refinement heuristic for graph isomorphism called the Weisfeiler--Lehman algorithm, or, equivalently, with the levels of indistinguishability in a logic with counting quantifiers and a bounded number of variables. This tight connection has quite striking consequences. For example, it follows immediately from a deep result of Grohe in the context of logics with counting quantifiers that a fixed number of levels of SA suffice to determine isomorphism of planar and minor-free graphs. We also offer applications in both finite model theory and polyhedral combinatorics. First, we show that certain properties of graphs, such as that of having a flow circulation of a prescribed value, are definable in the infinitary logic with counting with a bounded number of variables. Second, we exploit a lower bound construction due to Cai, Fürer, and Immerman in the context of counting logics to give simple explicit instances that show that the SA relaxations of the vertex-cover and cut polytopes do not reach their integer hulls for up to $\Omega(n)$ levels, where $n$ is the number of vertices in the graph.

Laajakaistaverkon topologian visualisointi

Viimeisten vuosien aikana laajakaistaoperaattoreiden laajakaistaverkot ovat nopeiden ja kiinteähintaisten laajakaistaliittymien johdosta kasvaneet suuriksi kokonaisuuksiksi. Kokonaisuuksia hallitaan erilaisilla verkonhallintatyökaluilla. Verkonhallintatyökalut sisältävät suuren määrän eri tasoista tietoa laitteista ja laitteiden välisistä suhteista. Kokonaisuuksien hahmottaminen ilman tiedoista rakennettua kuvaa on vaikeaa ja hidasta. Laajakaistaverkon topologian visualisoinnissa muodostetaan kuva laitteista ja niiden välisistä suhteista. Visualisoitua kuvaa voidaan käyttää osana verkonhallintatyökalua, jolloin käyttäjälle muodostuu nopeasti näkymä verkon laitteista ja rakenteesta eli topologiasta. Visualisoinnissa kuvan piirto-ongelma täytyy muuttaa graafin piirto-ongelmaksi. Graafin piirto-ongelmassa verkon rakennetta käsitellään graafina, joka mahdollistaa kuvan muodostamisen automaattisia piirtomenetelmiä hyväksikäyttäen. Halutunlainen ulkoasu kuvalle muodostetaan automaattisilla piirtomenetelmillä, joilla laitteiden ja laitteiden välisten suhteiden esitystapoja voidaan muuttaa. Esitystavoilla voidaan muuttaa esimerkiksi laitteiden muotoa, väriä ja kokoa. Esitystapojen lisäksi piirtomenetelmien tärkein tehtävä on laskea laitteiden sijaintien koordinaattien arvot, jotka loppujen lopuksi määräävät koko kuvan rakenteen. Koordinaattien arvot lasketaan piirtoalgoritmeilla, joista voimiin perustuvat algoritmit sopivat parhaiten laajakaistaverkkojen laitteiden sijaintien laskemiseen. Tämän diplomityön käytännön työssä toteutettiin laajakaistaverkon topologian visualisointityökalu.