Schneider, Stephanie (2015): Einfluss von Entwurmungsmethoden auf die Strongylidenpopulation bei Pferden in Deutschland. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1EZfN...
Schiller, Nicole (2015): Radiologische Diagnostik von abdominalen Erkrankungen beim Hund: ein interaktives Lernprogramm. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1NJyO...
McDaniel, Barbara Jane (2015): Evaluierung des vollautomatischen Hämatologiegerätes Celltac alpha im klinischen Einsatz bei Hund und Katze. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik4K...
Baumann, Dominik (2015): Novel phosphorus (oxo)nitrides at extreme conditions. Dissertation, LMU München: Fakultät für Chemie und Pharmazie
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik4K...
Mühlbacher, Wolfgang (2015): Conserved architecture of the core RNA polymerase II transcription initiation complex and an integrative model of Ctk3. Dissertation, LMU München: Fakultät für Chemie und Pharmazie
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik4K...
Jahn, Thomas (2015): Higher Brauer groups. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
from Elektronische Dissertationen der LMU München: http://ift.tt/1K8e4...
Gerhofer, Carolin (2015): Vorkommen und Bedeutung von Antibiotikaresistenzen und Extended-Spectrum Beta-Lactamasen (ESBL) bei Escherichia coli aus Wildvögeln mit Kontakt zu Menschen aus Südbayern, Occurence and importance of antibiotic resistances and extended-spectrum beta-lactamase (ESBL) production...
Visco, Ilaria (2015): Breaking symmetry: reconstitution of unmixing and polarization events in model membranes. Dissertation, LMU München: Fakultät für Biologie
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik1y...
Osberg, Brendan (2015): One-dimensional lattice gasses with soft interaction: application to nucleosome positioning in yeast. Dissertation, LMU München: Fakultät für Physik
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik1y...
Cai, Hung (2015): Investigation of stratospheric variability from intra-decadal to seasonal time scales. Dissertation, LMU München: Fakultät für Physik
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik1y...
Even, Marie-Paule (2015): Twin-screw extruded lipid implants for vaccine delivery. Dissertation, LMU München: Fakultät für Chemie und Pharmazie
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik1y...
Deutsch, Daniela Ramona (2015): Stage specific proteome signatures in bovine oocyte maturation and early embryogenesis. Dissertation, LMU München: Fakultät für Chemie und Pharmazie
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik1x...
Lettmann, Sarah (2015): Einfluss der intestinalen Mikroflora auf die Entwicklung des mukosalen Immunsystems des Hühnerdarms. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1K88M...
Feilke, Martina (2015): Estimation and model selection for dynamic biomedical images. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik1y...
Pfeiffer, Nadine (2015): Untersuchungen zur akuten kardiovaskulären und hämodynamischen Wirkung der i.v. injizierbaren Hypnotika Propofol und Alfaxalon beim Schwein. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1MWUa...
Reistle, Annette (2015): Histologische, histochemische und ultrastrukturelle Untersuchungen an der Niere des Strausses (Struthio camelus), Histological, ultrastructural, glyco- and immunohistochemical studies of the ostrich kidney (Struthio camelus). Dissertation, LMU München: Tierärztliche Fakultät
from...
Rzezniczek, Magdalena (2015): Comparison of the behaviour of piglets raised in an artificial rearing system or reared by the sow. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1KPZl...
Schulz, Catharina (2015): Vergleich verschiedener Lokalisationen zum Nachweis von felinem Herpesvirus-1, felinem Calicivirus und Chlamydia felis bei Katzen mit Katzenschnupfen mittels Polymerase-Kettenreaktion. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der...
Wächter, Miriam (2015): Serologische Untersuchungen zu Vorkommen und Differenzierung von Antikörpern gegen Rickettsien der Spotted Fever Group bei Hunden aus Deutschland. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1KPZk...
Schewe, Julia (2015): Ischämische Postkonditionierung (IPostC) als neue Strategie zum Schutz verschiedener Modelle von Lebererkrankungen vor Ischämie-Reperfusionsschäden nach kalter und warmer Ischämie. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München:...
Müller, Anke (2015): Verträglichkeit einer mehrfach wiederholten Anästhesie mit Methadon, Alfaxalon und Isofluran während der Therapie des inoperablen felinen Fibrosarkoms mit in thermosensitiven Phosphatidyldiglycerin-Liposomen eingeschlossenem Doxorubicin in Kombination mit regionaler Hyperthermie....
Stoz, Valerie Susanne (2015): Einfluss von Anästhesien mit lokaler Hyperthermie und Applikation von Doxorubicin in thermosensitiven Liposomen auf die Integrität der Nierentubuli bei Katzen mit Fibrosarkom evaluiert mit dem Biomarker Retinol-binding Protein. Dissertation, LMU München: Tierärztliche Fakultät
from...
Kamerer, Andrea (2015): Entwicklung der Kariesprävalenz bei Kindern in Augsburg und Vergleich mit Befunden aus Salzburg. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1LoU6...
Fuerst, Sophie-Theresa (2015): Ex vivo Untersuchung zur Wechselwirkung von 1470 nm-Laserlicht mit Uterusgewebe. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1LoU6...
Zhang, Lei (2015): Rapid motor responses to external perturbations during reaching movements: experimental results and modelling. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1LoU6...
Müller, Peter (2015): Interventioneller Vorhofohrverschluss bei Patienten mit Vorhofflimmern und hohem Schlaganfallrisiko. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1LoU9...
Scharl, Simone Cornelia (2015): Die Effekte von Schlaf auf die physiologische Reizverarbeitung und die emotionale Gedächtnisbildung: eine simultane hautwiderstands- und hochaufgelöste elektroenzephalographische Studie. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen...
Langemak, Shari (2015): Evozierte Potenziale und Oszillationen bei Gewinn-und Verlusterleben: Auswertung anhand eines neu entwickelten Gambling-Paradigmas. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1LoU6...
Treusch-Riemenschneider, Maria (2015): Hausärztlich-palliativmedizinische Versorgung von Patienten im Pflegeheim: eine Analyse der allgemeinen ambulanten Palliativversorgung in einem Pflegeheim. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen der LMU München: htt...
Rembold, Vanessa (2015): Immungenetische Untersuchung zur Assoziation des Promotor Polymorphismus des Interleukin-6-Gens in Position -174G/C bei Patienten mit systemischer Sklerodermie. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen der LMU München: http://ift.t...
Hoehne, Christopher Ludwig (2015): Die Rolle von High Mobility Group Box 1 Protein (HMGB1) in der Immunpathogenese der Pneumokokkenmeningitis. Dissertation, LMU München: Medizinische Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1LoU6...
Martin, Larissa (2013): Die spezifische T-Zellantwort gegen das humane Herpesvirus 6B. Dissertation, LMU München: Fakultät für Chemie und Pharmazie
from Elektronische Dissertationen der LMU München: http://ift.tt/1LoU8...
Koll, Sarah (2014): Erbliche Augenerkrankungen beim Teckel unter besonderer Berücksichtigung der Katarakt und der Progressiven Retinaatrophie. Dissertation, LMU München: Tierärztliche Fakultät
from Elektronische Dissertationen der LMU München: http://ift.tt/1LoU8...
par Joseph Sékou B Dembélé institut polytechnique rural de formation et de la recherche appliquée de Katibougou(IPR/IFRA) 2014
from Memoire Online http://ift.tt/1NiT8...
par Franck MUKANYA-LUSANGA IFASIC (Institut Facultaire des Sciences de l'Information et de la Communication) à KINSHASA/GOMBE 2015
from Memoire Online http://ift.tt/1NiT8...
A Study on Porous Silicon Gas Sensors: Metal Oxide Depositions to Organic Materials Lin, Arthur This paper has two main topics. The first topics covers the detection of volatile organic compounds with porous silicon (PSi) sensors. The second part explores the possibility of using conducting polymers...
Reduced Model for Gravitational Wave Sources Maganazertuche, Lorena One of the most interesting and exotic systems in the universe is a system of two black holes. When black holes orbit each other, they will eventually collide, forming a single black hole with a mass less than the sum of the two initial...
Nontrivial Impact Karsai, Andras The purpose of this investigation is to identify and calculate the forces that occur on an impulsive object as it intrudes into granular media. The system analyzed is a computational model of a sinusoidally actuated spring-mass system jumping on a bed of granular material....
A double 2-(v,k,2λ ) design is a design which is reducible into two 2-(v,k,λ ) designs. It is called uniquely reducible if it has, up to equivalence, only one reduction. We present properties of uniquely reducible double designs which show that their total number can be determined if only the designs...
An L(2,1)-labeling of a graph is a mapping c:V(G)→\0,\ldots,K\ such that the labels assigned to neighboring vertices differ by at least 2 and the labels of vertices at distance two are different. Griggs and Yeh [SIAM J. Discrete Math. 5 (1992), 586―595] conjectured that every graph G with maximum degree...
We introduce a notion of a \emphbroken circuit and an \emphNBC complex for an (abstract) convex geometry. Based on these definitions, we shall show the analogues of the Whitney-Rota's formula and Brylawski's decomposition theorem for broken circuit complexes on matroids for convex geometries. We also...
In our paper we consider the P_3-packing problem in subcubic graphs of different connectivity, improving earlier results of Kelmans and Mubayi [KM04]. We show that there exists a P_3-packing of at least \lceil 3n/4\rceil vertices in any connected subcubic graph of order n>5 and minimum vertex degree...
A graph G=(V,E) is said to be \emphmagic if there exists an integer labeling f: V∪ E →[1, |V∪ E|] such that f(x)+f(y)+f(xy) is constant for all edges xy∈E. Enomoto, Masuda and Nakamigawa proved that there are magic graphs of order at most 3n^2+o(n^2) which contain a complete graph of order n. Bounds...
We are looking for the maximum number of subsets of an n-element set not containing 4 distinct subsets satisfying A ⊂B, C ⊂B, C ⊂D. It is proved that this number is at least the number of the \lfloor n / 2\rfloor -element sets times 1+2 / n, on the other hand an upper bound is given with 4 replaced...
We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic graphs which arise naturally from the model....
A strong stable set in a graph G is a stable set that contains a vertex of every maximal clique of G. A Meyniel obstruction is an odd circuit with at least five vertices and at most one chord. Given a graph G and a vertex v of G, we give a polytime algorithm to find either a strong stable set containing...
Barabási and Albert [1] suggested modeling scale-free networks by the following random graph process: one node is added at a time and is connected to an earlier node chosen with probability proportional to its degree. A recent empirical study of Newman [5] demonstrates existence of degree-correlation...
A class of graphs \mathcalC ordered by the homomorphism relation is \emphuniversal if every countable partial order can be embedded in \mathcalC. It was shown in [ZH] that the class \mathcalC_k of k-colorable graphs, for any fixed k≥3, induces a universal partial order. In [HN1], a surprisingly small...
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation guarantee known so far for these problems has ratio 3/2 + ɛ, a result that follows from...
Let K_ℓ^- denote the graph obtained from K_ℓ by deleting one edge. We show that for every γ >0 and every integer ℓ≥4 there exists an integer n_0=n_0(γ ,ℓ) such that every graph G whose order n≥n_0 is divisible by ℓ and whose minimum degree is at least (ℓ^2-3ℓ+1 / ℓ(ℓ-2)+γ )n contains a K_ℓ^--factor,...
The deep theorem of Mader concerning the number of internally disjoint H-paths is a very powerfull tool. Nevertheless its use is very difficult, because one has to deal with a very reach family of separators. This paper shows several ways to strengthen Mader's theorem by certain additional restrictions...
Due to some intractability considerations, reasonable formulation of necessary and sufficient conditions for decomposability of a general multigraph G into a fixed connected multigraph H, is probably not feasible if the underlying simple graph of H has three or more edges. We study the case where H...
Rhombus tilings are tilings of zonotopes with rhombohedra. We study a class of \emphlexicographic rhombus tilings of zonotopes, which are deduced from higher Bruhat orders relaxing the unitarity condition. Precisely, we fix a sequence (v_1, v_2,\ldots, v_D) of vectors of ℝ^d and a sequence (m_1, m_2,\ldots,...
It was conjectured by Reed [reed98conjecture] that for any graph G, the graph's chromatic number χ (G) is bounded above by \lceil Δ (G) +1 + ω (G) / 2\rceil , where Δ (G) and ω (G) are the maximum degree and clique number of G, respectively. In this paper we prove that this bound holds if G is the line...
For any graph G, the k-\emphimproper chromatic number χ ^k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate the ratio of the k-improper chromatic number to the clique number for unit disk graphs and random...
Constantly, the assumption is made that there is an independent contribution of the individual feature extraction and classifier parameters to the recognition performance. In our approach, the problems of feature extraction and classifier design are viewed together as a single matter of estimating the...
The design of a data warehouse from the databases of the enterprise is a very important feature to specify the strategy of this enterprise. The strategy is indeed deduced from the enterprise results stored in its databases. The business processes of the enterprise have moreover to be consistent with...
Cette recherche a pour objet l’étude des comportements des utilisateurs d’une plateforme de visioconférence poste à poste. Les utilisateurs de la plateforme sont deux groupes de tuteurs et leurs étudiantes ; le groupe de tuteurs est constitué de tuteurs en formation (de futurs enseignants en formation...
Data collected by multiple physiological sensors are being increasingly used for wellness monitoring or disease management, within a pervasiveness context facilitated by the massive use of mobile devices. These abundant complementary raw data are challenging to understand and process, because of their...
L'ingénierie dirigée par les modèles ou MDE est souvent utilisée en entreprise dans des tâches de développement proches du code. L'objectif de cette étude réalisée pour l'opérateur de télécommunication Orange est de montrer comment les tâches amont du processus de développement préconisé dans l'entreprise...
We identify the class of directed one-trees and prove the so-called min-max theorem for them. As a consequence, we establish the equality of directed tree-width and a new measure, d-width, on this class of graphs. In addition, we prove a property of all directed one-trees and use this property to create...
Using a fixed set of colors C, Ann and Ben color the edges of a graph G so that no monochromatic cycle may appear. Ann wins if all edges of G have been colored, while Ben wins if completing a coloring is not possible. The minimum size of C for which Ann has a winning strategy is called the \emphgame...
In this note we prove Sterboul's conjecture, that provides a sufficient condition for the bicolorability of hypergraphs.
from HAL : Dernières publications http://ift.tt/1DQQQ...
Let f_m(a,b,c,d) denote the maximum size of a family \mathcalF of subsets of an m-element set for which there is no pair of subsets A,B∈\mathcalF with |A ∩ B|≥a, |<bar>A</bar> ∩ B|≥b, |A ∩ <bar>B</bar>| ≥c, and |<bar>A</bar> ∩ <bar>B</bar>|≥d.\par By symmetry...
Let T_t denote the t-threshold function on the n-cube: T_t(x) = 1 if |\i : x_i=1\| ≥t, and 0 otherwise. Define the distance between Boolean functions g and h, d(g,h), to be the number of points on which g and h disagree. We consider the following extremal problem: Over a monotone Boolean function g...
We study the notion of hypertree-width of hypergraphs. We prove that, up to a constant factor, hypertree-width is the same as a number of other hypergraph invariants that resemble graph invariants such as bramble-number, branch-width, linkedness, and the minimum number of cops required to win Seymour...
Let D(G) be the minimum quantifier depth of a first order sentence Φ that defines a graph G up to isomorphism in terms of the adjacency and the equality relations. Let D_0(G) be a variant of D(G) where we do not allow quantifier alternations in Φ . Using large graphs decomposable in complement-connected...
We consider permutations of 1,2,...,n^2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres Theorem. Such permutations correspond via the Robinson-Schensted correspondence to pairs of square n× n Young tableaux. We show that all the bumping sequences are...
Besides precise and dense geometric information, some LiDARs also provide intensity information and multiple echoes, information that can advantageously be exploited to enhance the performance of the purely geometric classification approaches. This information indeed depends on the physical nature of...
Let G be an n-vertex m-edge graph with weighted vertices. A pair of vertex sets A,B⊆V(G) is a \emph2/3-separation of \emphorder |A∩ B| if A ∪ B = V(G), there is no edge between A \ B and B \ A, and both A \ B and B \ A have weight at most 2/3 the total weight of G. Let ℓ∈ℤ+ be fixed. Alon, Seymour and...
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximise the number (or the total weight) of satisfied...
A vertex coloring of a graph G is k\emph-nonrepetitive if one cannot find a periodic sequence with k blocks on any simple path of G. The minimum number of colors needed for such coloring is denoted by π _k(G) . This idea combines graph colorings with Thue sequences introduced at the beginning of 20th...
A double 2-(v,k,2λ ) design is a design which is reducible into two 2-(v,k,λ ) designs. It is called uniquely reducible if it has, up to equivalence, only one reduction. We present properties of uniquely reducible double designs which show that their total number can be determined if only the designs...
An L(2,1)-labeling of a graph is a mapping c:V(G)→\0,\ldots,K\ such that the labels assigned to neighboring vertices differ by at least 2 and the labels of vertices at distance two are different. Griggs and Yeh [SIAM J. Discrete Math. 5 (1992), 586―595] conjectured that every graph G with maximum degree...
We introduce a notion of a \emphbroken circuit and an \emphNBC complex for an (abstract) convex geometry. Based on these definitions, we shall show the analogues of the Whitney-Rota's formula and Brylawski's decomposition theorem for broken circuit complexes on matroids for convex geometries. We also...
In our paper we consider the P_3-packing problem in subcubic graphs of different connectivity, improving earlier results of Kelmans and Mubayi [KM04]. We show that there exists a P_3-packing of at least \lceil 3n/4\rceil vertices in any connected subcubic graph of order n>5 and minimum vertex degree...
A graph G=(V,E) is said to be \emphmagic if there exists an integer labeling f: V∪ E →[1, |V∪ E|] such that f(x)+f(y)+f(xy) is constant for all edges xy∈E. Enomoto, Masuda and Nakamigawa proved that there are magic graphs of order at most 3n^2+o(n^2) which contain a complete graph of order n. Bounds...
This article depicts an algorithm which matches the output of a Lidar with an initial terrain model to estimate the absolute pose of a robot. Initial models do not perfectly fit the reality and the acquired data set can contain an unknown, and potentially large, proportion of outliers. We present an...
We are looking for the maximum number of subsets of an n-element set not containing 4 distinct subsets satisfying A ⊂B, C ⊂B, C ⊂D. It is proved that this number is at least the number of the \lfloor n / 2\rfloor -element sets times 1+2 / n, on the other hand an upper bound is given with 4 replaced...
We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic graphs which arise naturally from the model....
A strong stable set in a graph G is a stable set that contains a vertex of every maximal clique of G. A Meyniel obstruction is an odd circuit with at least five vertices and at most one chord. Given a graph G and a vertex v of G, we give a polytime algorithm to find either a strong stable set containing...
Barabási and Albert [1] suggested modeling scale-free networks by the following random graph process: one node is added at a time and is connected to an earlier node chosen with probability proportional to its degree. A recent empirical study of Newman [5] demonstrates existence of degree-correlation...
A class of graphs \mathcalC ordered by the homomorphism relation is \emphuniversal if every countable partial order can be embedded in \mathcalC. It was shown in [ZH] that the class \mathcalC_k of k-colorable graphs, for any fixed k≥3, induces a universal partial order. In [HN1], a surprisingly small...
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation guarantee known so far for these problems has ratio 3/2 + ɛ, a result that follows from...
Jelizarow, Monika (2015): Global tests of association for multivariate ordinal data: Knowledge-based statistical analysis strategies for studies using the international classification of functioning, disability and health (ICF). Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik
from...
Köhler, Martin (2015): Cb-LIKE: Gewittervorhersagen bis zu sechs Stunden mit Fuzzy-Logik. Dissertation, LMU München: Fakultät für Physik
from Elektronische Dissertationen der LMU München: http://ift.tt/1Pmh6...
Dans cet article, on propose une représentation géométrique de l'’univers. Cette modélisation est construite à partir d’une section de Dirac à structures et s'’étend à la notion de multivers de Banach-Schauder. On interprète l'’univers comme un sous-espace connexe d’une singularité de dimension quatre...
Vahl, Johann Christoph (2013): TCR signals in the identity and function of mature NKT and regulatory T cells. Dissertation, LMU München: Fakultät für Chemie und Pharmazie
from Elektronische Dissertationen der LMU München: http://ift.tt/1WhVc...
Hessel, Philipp (2015) Long-term effects of economic fluctuations on health and cognition in Europe and the United States. PhD thesis, London School of Economics and Political Science (LSE).
from LSE Theses Online: No conditions. Results ordered -Date Deposited. http://ift.tt/1MkR5...
Crossley, Noële (2015) Humanitarian intervention: from le droit d'Ingérence to the responsibility to protect. PhD thesis, London School of Economics and Political Science (LSE).
from LSE Theses Online: No conditions. Results ordered -Date Deposited. http://ift.tt/1Iz6V...
Asahi, Kenzo (2015) Impacts of better transport accessibility: evidence from Chile. PhD thesis, London School of Economics and Political Science (LSE).
from LSE Theses Online: No conditions. Results ordered -Date Deposited. http://ift.tt/1L1Pl...
Parsons, Kênia (2015) Reaching out to the persistently poor in rural areas: an analysis of Brazil’s Bolsa Família conditional cash transfer programme. PhD thesis, London School of Economics and Political Science (LSE).
from LSE Theses Online: No conditions. Results ordered -Date Deposited. http://...
Rietkerk, Aaron (2015) In pursuit of development: the United Nations, decolonization and development aid, 1949-1961. PhD thesis, London School of Economics and Political Science (LSE).
from LSE Theses Online: No conditions. Results ordered -Date Deposited. http://ift.tt/1IEbb...
Relativité générale et Théorie de jauges : deux conceptions de l'espace-temps jusqu'à présent inconciliables. Et si une lecture simple de la première en termes de dynamique, de localité, de procédures de mesures, et de détermination d'entité spatio-temporelle référence, était une clef possible ouvrant...
La membrane cellulaire est l’interface de communication et d’échange entre la cellule et le monde extérieur. En tant que telle, sa structure et composition ont une importance centrale à la viabilité de la cellule. Les protéines qui résident dans la membrane apportent la fonctionnalité nécessaire pour...
Cet article présente un état de l'art de la génération numérique d'hologrammes. Les méthodes présentées permettent de générer l'hologramme d'une scène synthétique ou réelle sans passer par le processus physique réel d'interférence entre deux ondes lumineuses. Les principales limitations liées à l'holographie...