Droits et protection des peuples autochtones en droit international public

par Pierre Romond Université d'Auvergne 2015

from Memoire Online http://ift.tt/1NiT8q3

Commande numérique de la GADA dans une chaine éolienne

par Herinjaka ANDRIANARIVO Ecole Supérieure Polytechnique d'Antsiranana 2015

from Memoire Online http://ift.tt/1NiT8q3

Einfluss von Entwurmungsmethoden auf die Strongylidenpopulation bei Pferden in Deutschland

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/1EZfN4l

Das immunsuppressive B7-H1 Molekül bei regulatorischen T-Zellen, suppressiven Zellen myeloider Abstammung und dendritischen Zellen in antitumoraler Immunantwort beim Pankreasadenokarzinom

Maier, Caroline (2015): Das immunsuppressive B7-H1 Molekül bei regulatorischen T-Zellen, suppressiven Zellen myeloider Abstammung und dendritischen Zellen in antitumoraler Immunantwort beim Pankreasadenokarzinom. Dissertation, LMU München: Tierärztliche Fakultät

from Elektronische Dissertationen der LMU München: http://ift.tt/1EZfNRX

Validierung eines humanisierten Tiermodelles für Colitis ulcerosa

Schwaab, Kilian (2015): Validierung eines humanisierten Tiermodelles für Colitis ulcerosa. Dissertation, LMU München: Tierärztliche Fakultät

from Elektronische Dissertationen der LMU München: http://ift.tt/1hhmuJp

Radiologische Diagnostik von abdominalen Erkrankungen beim Hund

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/1NJyO25

Evaluierung des vollautomatischen Hämatologiegerätes Celltac alpha im klinischen Einsatz bei Hund und Katze

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/1Ik4KCT

Novel phosphorus (oxo)nitrides at extreme conditions

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/1Ik4Kmw

Conserved architecture of the core RNA polymerase II transcription initiation complex and an integrative model of Ctk3

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/1Ik4Kmu

Higher Brauer groups

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/1K8e44q

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 of Escherichia coli from wild birds in contact with humans living in southern Bavaria

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 of Escherichia coli from wild birds in contact with humans living in southern Bavaria. Dissertation, LMU München: Tierärztliche Fakultät

from Elektronische Dissertationen der LMU München: http://ift.tt/1Ik1APu

Breaking symmetry

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/1Ik1yY3

One-dimensional lattice gasses with soft interaction

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/1Ik1yXU

Investigation of stratospheric variability from intra-decadal to seasonal time scales

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/1Ik1yHA

Twin-screw extruded lipid implants for vaccine delivery

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/1Ik1yHn

Stage specific proteome signatures in bovine oocyte maturation and early embryogenesis

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/1Ik1xDt

Einfluss der intestinalen Mikroflora auf die Entwicklung des mukosalen Immunsystems des Hühnerdarms

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/1K88Mps

Estimation and model selection for dynamic biomedical images

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/1Ik1yar

Untersuchungen zur akuten kardiovaskulären und hämodynamischen Wirkung der i.v. injizierbaren Hypnotika Propofol und Alfaxalon beim Schwein

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/1MWUad8

Histologische, histochemische und ultrastrukturelle Untersuchungen an der Niere des Strausses (Struthio camelus), Histological, ultrastructural, glyco- and immunohistochemical studies of the ostrich kidney (Struthio camelus)

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 Elektronische Dissertationen der LMU München: http://ift.tt/1KPZj0m

Comparison of the behaviour of piglets raised in an artificial rearing system or reared by the sow

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/1KPZl8y

Vergleich verschiedener Lokalisationen zum Nachweis von felinem Herpesvirus-1, felinem Calicivirus und Chlamydia felis bei Katzen mit Katzenschnupfen mittels Polymerase-Kettenreaktion

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 LMU München: http://ift.tt/1MWUad0

Serologische Untersuchungen zu Vorkommen und Differenzierung von Antikörpern gegen Rickettsien der Spotted Fever Group bei Hunden aus Deutschland

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/1KPZkS8

Ischämische Postkonditionierung (IPostC) als neue Strategie zum Schutz verschiedener Modelle von Lebererkrankungen vor Ischämie-Reperfusionsschäden nach kalter und warmer Ischämie

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: http://ift.tt/1MWU9WH

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

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. Dissertation, LMU München: Tierärztliche Fakultät

from Elektronische Dissertationen der LMU München: http://ift.tt/1KPZitz

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

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 Elektronische Dissertationen der LMU München: http://ift.tt/1MWU9Ww

Impôt comme facteur majeur du developpement socio-économique de la république démocratique du Congo

par Heritier LENGI ISC Kinshasa 2015

from Memoire Online http://ift.tt/1NiT8q3

Etude de l'evolution de la production de cacao en territoire de Beni de 2006 à 2014

par Aime Bwambale Bayolo UNILUK 0000

from Memoire Online http://ift.tt/1NiT8q3

Stabilisation des sols gonflants

par Djoudi A. Krim NEDJAHI A.RAOUF Université SOUK AHRAS 2015

from Memoire Online http://ift.tt/1NiT8q3

Performance sociale et viabilité financière des IMF au Sénégal

par Moussa DIOUF Université Cheikh Anta Diop de Dakar 2012

from Memoire Online http://ift.tt/1NiT8q3

Les determinants de l'infection palustre chez les enfants de moins de 5 ans dans la région du nord Cameroun

par Arsène Brunelle SANDIE Institut de Formation et de Recherches Demographique, IFORD 2013

from Memoire Online http://ift.tt/1NiT8q3

Les facteurs explicatifs de la déforestation et de la dégradation des forêts dans le département du pool: analyse du processus redd+

par René Darnel BEMBA Marien NGOUABI 2014

from Memoire Online http://ift.tt/1NiT8q3

Entwicklung der Kariesprävalenz bei Kindern in Augsburg und Vergleich mit Befunden aus Salzburg

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/1LoU6T3

Ex vivo Untersuchung zur Wechselwirkung von 1470 nm-Laserlicht mit Uterusgewebe

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/1LoU6SZ

Zwei-Photonen-Endomikroskopie, Two-Photon Endomicroscopy

Thomsen, Katharina (2015): Zwei-Photonen-Endomikroskopie, Two-Photon Endomicroscopy. Dissertation, LMU München: Medizinische Fakultät

from Elektronische Dissertationen der LMU München: http://ift.tt/1U4v2A2

Rapid motor responses to external perturbations during reaching movements

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/1LoU6SN

Funktionen lysosomaler Cysteinproteasen in humanen mesenchymalen Stammzellen

Schuster, Simon (2015): Funktionen lysosomaler Cysteinproteasen in humanen mesenchymalen Stammzellen. Dissertation, LMU München: Medizinische Fakultät

from Elektronische Dissertationen der LMU München: http://ift.tt/1U4v5M7

Interventioneller Vorhofohrverschluss bei Patienten mit Vorhofflimmern und hohem Schlaganfallrisiko

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/1LoU912

Die Effekte von Schlaf auf die physiologische Reizverarbeitung und die emotionale Gedächtnisbildung

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 der LMU München: http://ift.tt/1LoU90Y

Evozierte Potenziale und Oszillationen bei Gewinn-und Verlusterleben

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/1LoU6Cp

Hausärztlich-palliativmedizinische Versorgung von Patienten im Pflegeheim

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: http://ift.tt/1LoU8KE

Immungenetische Untersuchung zur Assoziation des Promotor Polymorphismus des Interleukin-6-Gens in Position -174G/C bei Patienten mit systemischer Sklerodermie

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.tt/1LoU8Kw

Vergleichende Analyse biologischer Alterungsmarker bei Patienten mit chronisch-obstruktiver Lungenerkrankung (COPD)

Lucke, Tanja (2015): Vergleichende Analyse biologischer Alterungsmarker bei Patienten mit chronisch-obstruktiver Lungenerkrankung (COPD). Dissertation, LMU München: Medizinische Fakultät

from Elektronische Dissertationen der LMU München: http://ift.tt/1U4uZ7c

Untersuchung nutritiver kardiovaskulärer Risikofaktoren bei depressiven Erkrankungen unter besonderer Berücksichtigung mehrfach ungesättigter Omega-3 FettsäurenU

Pröls, Franziska (2015): Untersuchung nutritiver kardiovaskulärer Risikofaktoren bei depressiven Erkrankungen unter besonderer Berücksichtigung mehrfach ungesättigter Omega-3 FettsäurenU. Dissertation, LMU München: Medizinische Fakultät

from Elektronische Dissertationen der LMU München: http://ift.tt/1U4uYQH

Die Rolle von High Mobility Group Box 1 Protein (HMGB1) in der Immunpathogenese der Pneumokokkenmeningitis

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/1LoU6lS

Die spezifische T-Zellantwort gegen das humane Herpesvirus 6B

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/1LoU8tZ

Erbliche Augenerkrankungen beim Teckel unter besonderer Berücksichtigung der Katarakt und der Progressiven Retinaatrophie

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/1LoU8dy

Gestion intégrée des engrais minéraux et des résidus de récolte dans un système de production intensif de riz-riz-blé au Sahel

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/1NiT8q3

Fréquence et evolution de la co-infection VIH uberculose chez les adultes à l'hôpital presbytérien de Mbujimayi.

par Josue NZONGOLA ILUNGA ISTM/Mbujimayi 2015

from Memoire Online http://ift.tt/1NiT8q3

Impact de l'exploitation minière industrielle sur la santé humaine et environnementale au Burkina Faso: cas de la mine d'or de Essakane SA

par Issaka OUEDRAOGO Université de Versailles Saint Quentin en Yvelines (France) 2012

from Memoire Online http://ift.tt/1NiT8q3

La communication institutionnelle des entreprises, etablissements et services publics en RDC

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/1NiT8q3

La contribution de l'éducation dans la croissance économique: evidences des données de Madagascar

par Narcisse RANDRIANANTENAINA Université Toamasina-Madagascar 2014

from Memoire Online http://ift.tt/1NiT8q3

Microfinance et lutte contre la pauvreté: une étude des microcrédits octroyés par le réseau mc² de la Menoua

par Cédric Beaudin YMELE Dschang 2013

from Memoire Online http://ift.tt/1NiT8q3

Production radio à la CRTV littoral (au Cameroun-Douala)

par Remi Lionel CHOUAMENI WENDEU IUT-FV de Bandjoun - Université de Dschang 2012

from Memoire Online http://ift.tt/1NiT8q3

Les indiens mapuches dans les médias au Chili : du mythe du barbare à l'activisme identitaire transnational

par Erika Antoine Institut d'Etudes Politiques d'Aix-en-Provence 2006

from Memoire Online http://ift.tt/1NiT8q3

The impact of monetary policy on consumer price index (CPI): 1985-2010

par Sylvie NIBEZA Kigali Independent University (ULK) 2014

from Memoire Online http://ift.tt/1NiT8q3

A Study on Porous Silicon Gas Sensors: Metal Oxide Depositions to Organic Materials

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 as coatings for the PSi sensors as a catalyst for CO and CO2 detection. Porous semiconductor materials have been sought after as volatile organic compound gas sensors due to their optical properties. However, the optical sensors have a major flaw in their inability to distinguish different gases. Additionally, optical porous semiconductor sensors are overly sensitive to environmental factors, demising their ability to be used in an industrial setting. Therefore, in this project, we seek to explore methods using conductometric porous silicon sensors, potentially solving the drawbacks of optical sensors. Additionally, we seek to use the data collected during this period to construct a better understanding of the interaction of gases and porous semiconductor materials, expanding on the inverse hard/soft acid/base theory. Another flaw of porous semiconductor sensors is that they rely on the competing precesses of chemisorption and physisorption. If a gas is both physically and chemically inert, then the sensor will fail to detect the gas. However, certain polymers have the capability of acting as a catalyst, triggering electron exchange between the gas and sensor, producing the signal needed for detection. Studies have shown polypyrrole as a effective catalyst for CO2 detection. We wish to combine that with metal oxide deposits for studying CO2 in the IHSAB model.

from Theses online http://www.rssmix.com/

Reduced Model for Gravitational Wave Sources

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 masses. This missing ``mass," up to ten percent, is converted into gravitational waves (GW) making these systems one of the most energetic in the universe. In the last decade, numerical simulations of the coalescence of binary black hole spacetimes have become a possibility and have since then progressed. Each simulation, with a unique set of initial parameters, constructs a gravitational wave signal, also called a waveform. In this work, I study the modeling of the radiated energy of non-precessing and precessing systems as functions of the binary system' s initial parameters. Because constructing a template bank of these waveforms remains computationally intensive, the next step is to introduce the use of Principal Component Analysis (PCA), which will efficiently capture the essential features over a large parameter space of the simulations. It acts on collections of waveforms to find bulk features such as the energy and momentum radiated. These features may provide the ``smoking gun" of mergers for gravitational wave burst detection.

from Theses online http://www.rssmix.com/

Nontrivial Impact

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. Various types of ground reaction forces on the robot's foot are investigated and their parameters are systematically varied to compare to experimental data taken from the real-world jumping robot system. Different types and combinations of ground reaction forces are investigated since a single force type was found to be insufficient to fully explain the experimental system's dynamics. The mechanics of this setup are modeled as a set of ordinary differential equations, which are computationally solved to determine the jumping mechanics. Maximal jump heights are calculated across a wide variety jumping motions and granular media densities with different types of ground reaction force laws.The relations that are investigated include a depth-dependent spring-like force, a velocity-squared-dependent force, and an added-mass force. The results of finding a well-fitting combination of force laws across many jump types and volume fractions can be used to imply a valid comprehensive force law for impulsive motion on a granular surface. The anticipated outcome is that there exists such a comprehensive force law, but each force type's contribution will vary as a function of volume fraction. Finding optimal jumping motions using this comprehensive law may lead to better implementations of impulsive commands in fields such as robotics and biomechanics where granular material is involved.

from Theses online http://www.rssmix.com/

[hal-01184373] On the enumeration of uniquely reducible double designs

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 with non-trivial automorphisms are classified with respect to their automorphism group. As an application, after proving that a reducible 2-(21,5,2) design is uniquely reducible, we establish that the number of all reducible 2-(21,5,2) designs is 1 746 461 307.

from HAL : Dernières publications http://ift.tt/1DQQNRP

[hal-01184374] Labeling planar graphs with a condition at distance two

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 Δ has an L(2,1)-labeling with K≤Δ ^2. We verify the conjecture for planar graphs with maximum degree Δ ≠3.

from HAL : Dernières publications http://ift.tt/1DQQNBy

[hal-01184369] NBC Complexes of Convex Geometries

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 present an Orlik-Solomon type algebra on a convex geometry, and show the NBC generating theorem. This note is on the same line as the studies in [nakamura03a, okamoto-nakamura, nakamura].

from HAL : Dernières publications http://ift.tt/1UISe9f

[hal-01184370] Packing Three-Vertex Paths in a Subcubic Graph

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 δ ≥2, and that this bound is tight. The proof is constructive and implied by a linear-time algorithm. We use this result to show that any 2-connected cubic graph of order n>8 has a P_3-packing of at least \lceil 7n/9 \rceil vertices.

from HAL : Dernières publications http://ift.tt/1DQQNBm

[hal-01184371] Largest cliques in connected supermagic graphs

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 on Sidon sets show that the order of such a graph is at least n^2+o(n^2). We close the gap between those two bounds by showing that, for any given graph H of order n, there are connected magic graphs of order n^2+o(n^2) containing H as an induced subgraph. Moreover it can be required that the graph admits a supermagic labelling f, which satisfies the additional condition f(V)=[1,|V|].

from HAL : Dernières publications http://ift.tt/1DQQO8r

[hal-01184366] Excluded subposets in the Boolean lattice

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 by the value 2.

from HAL : Dernières publications http://ift.tt/1DQQO8p

[hal-01184367] Infinite limits and folding

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. We characterize the isomorphism type and induced subgraph structure of these infinite graphs using the notion of dismantlability from the theory of vertex pursuit games, and graph homomorphisms.

from HAL : Dernières publications http://ift.tt/1DQQO8l

[hal-01184368] Finding a Strong Stable Set or a Meyniel Obstruction in any Graph

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 v or a Meyniel obstruction in G. This can then be used to find in any graph, a clique and colouring of the same size or a Meyniel obstruction.

from HAL : Dernières publications http://ift.tt/1UIScOy

[hal-01184363] Degree-correlation of Scale-free graphs

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 between degrees of adjacent nodes in real-world networks. Here we define the \textitdegree correlation―-correlation of the degrees in a pair of adjacent nodes―-for a random graph process. We determine asymptotically the joint probability distribution for node-degrees, d and d', of adjacent nodes for every 0≤d≤ d'≤n^1 / 5, and use this result to show that the model of Barabási and Albert does not generate degree-correlation. Our theorem confirms the result in [KR01], obtained by using the mean-field heuristic approach.

from HAL : Dernières publications http://ift.tt/1DQQLcV

[hal-01184364] Density of universal classes of series-parallel graphs

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 subclass of \mathcalC_3 which is a proper subclass of K_4-minor-free graphs (\mathcalG/K_4) is shown to be universal. In another direction, a density result was given in [PZ], that for each rational number a/b ∈[2,8/3]∪ \3\, there is a K_4-minor-free graph with circular chromatic number equal to a/b. In this note we show for each rational number a/b within this interval the class \mathcalK_a/b of K_4-minor-free graphs with circular chromatic number a/b is universal if and only if a/b ≠2, 5/2 or 3. This shows yet another surprising richness of the K_4-minor-free class that it contains universal classes as dense as the rational numbers.

from HAL : Dernières publications http://ift.tt/1UIScOo

[hal-01184365] Packing triangles in low degree graphs and indifference graphs

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 a more general algorithm for set packing obtained by Hurkens and Schrijver in 1989. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs.

from HAL : Dernières publications http://ift.tt/1UIScya

[hal-01184359] K_\ell^--factors in graphs

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, i.e. a collection of disjoint copies of K_ℓ^- which covers all vertices of G. This is best possible up to the error term γ n and yields an approximate solution to a conjecture of Kawarabayashi.

from HAL : Dernières publications http://ift.tt/1haXeVZ

[hal-01184360] Mader Tools

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 of the appearing separators.

from HAL : Dernières publications http://ift.tt/1J5nAhK

[hal-01184362] Multigraph decomposition into multigraphs with two underlying edges

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 consists of two underlying edges. We present necessary and sufficient conditions for H-decomposability of G, which hold when certain size parameters of G lies within some bounds which depends on the multiplicities of the two edges of H. We also show this result to be "tight" in the sense that even a slight deviation of these size parameters from the given bounds results intractability of the corresponding decision problem.

from HAL : Dernières publications http://ift.tt/1J5ny9J

[hal-01184356] Structure of spaces of rhombus tilings in the lexicograhic case

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, m_D) of positive integers. We assume (lexicographic hypothesis) that for each subsequence (v_i_1, v_i_2,\ldots, v_i_d) of length d, we have det(v_i_1, v_i_2,\ldots, v_i_d) > 0. The zonotope Z is the set \ Σα _iv_i 0 ≤α _i ≤m_i \. Each prototile used in a tiling of Z is a rhombohedron constructed from a subsequence of d vectors. We prove that the space of tilings of Z is a graded poset, with minimal and maximal element.

from HAL : Dernières publications http://ift.tt/1J5nA1j

[hal-01184357] An upper bound for the chromatic number of line graphs

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 graph of a multigraph. The proof yields a polynomial time algorithm that takes a line graph G and produces a colouring that achieves our bound.

from HAL : Dernières publications http://ift.tt/1haXcNU

[hal-01184358] Improper colouring of (random) unit disk graphs

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 unit disk graphs to extend results of [McRe99, McD03] (where they considered only proper colouring).

from HAL : Dernières publications http://ift.tt/1J5nzKT

[hal-00667663] Combined pattern search optimization of feature extraction and classification parameters in facial recognition.

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 optimal parameters from limited data. We propose, for the problem of facial recognition, a combination between an Interest Operator based feature extraction technique and a k-NN statistical classifier having the parameters determined using a pattern search based optimization technique. This approach enables us to achieve both higher classification accuracy and faster processing time.

from HAL : Dernières publications http://ift.tt/1DQQOFw

[hal-01184507] A Data Warehouse Logical Design Method Based on the Alignment with Business Processes

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 this strategy. We propose then a rule-based data warehouse design method. The rules target first a data model alignment with respect to the business processes model. The other rules are featured by a data pattern proposing a solution for the data warehouse design in relation to the categorization of the data. The pattern is compliant with the life-cycle of a business process instance. This pattern is moreover relevant for the specification of the queries concerning the data warehouse. This data warehouse design method based on rules is experimented from two epidemiological databases building up for medical research.

from HAL : Dernières publications http://ift.tt/1UISh4M

[tel-01144558] Analyse des comportements et expérience des utilisateurs d'une plateforme de visioconférence pour l'enseignement des langues Le cas de la phase 1.0 de VISU

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 universitaire professionnalisante) et d’enseignants de FLE utilisant les outils du web 2.0. Cette recherche a pour cadre l’enseignement du FLE à destination d’un groupe d'étudiantes américaines de l’université de Californie Berkeley donné de janvier à mars 2010 sur une plateforme d’apprentissage vidéographique synchrone. La plateforme VISU, a été développée suivant une démarche originale, la conception d’une plateforme destinée à l’enseignement/apprentissage des langues. La particularité de ce projet réside dans le fait qu’une équipe de chercheurs et de développeurs ont accompagné les tuteurs et les étudiantes lors de cette expérimentation afin d’améliorer l’utilisabilté de VISU d’une séance sur l’autre. À travers une analyse de deux tâches dans les configurations qui placent un tuteur devant deux étudiantes, deux tuteurs devant deux étudiantes et un tuteur devant une étudiante, et d’une micro-analyse de la communication multimodale portant sur la transmission des consignes, nous tentons d’observer le discours et la mimo-gestualité témoignant de l’expérience utilisateur des utilisateurs de VISU (tuteurs et étudiantes) au contact de la technologie utilisée. Nous étudions également l’utilisation qu’ils font des différents outils textuels de communication, des ressources présentes sur la plateforme, ainsi que celle de la caméra. Nous discutons les résultats qualitatifs en vue de mettre au jour leurs comportements d’utilisateurs d’une plateforme en cours de construction. La méthode s’appuie sur la triangulation des données : aux échanges en ligne du corpus multimodal est appliquée une analyse de la mimo-gestualité, ainsi qu’une analyse de discours et des interactions ; des entretiens, des questionnaires et les perceptions des étudiantes et des tuteurs viennent éclairer l’analyse de leur vécu et de leur ressenti. Ce travail de recherche transdisciplinaire tente donc à travers la description de la communication pédagogique synchrone de mieux comprendre les différents comportements, principalement discursifs et mimogestuels, des tuteurs et des étudiantes engagés dans une formation en ligne.

from HAL : Dernières publications http://ift.tt/1UISh4J

[hal-01184500] Quality analysis of sensors data for personal health records on mobile devices

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 voluminous and heterogeneous nature, as well as the data quality issues that could impede their utilization. This chapter examines the main data quality questions concerning six frequently used physiological sensors - glucometer, scale, blood pressure me-ter, heart rate meter, pedometer, and thermometer -, as well as patient observations that may be associated to a given set of measurements. We discuss specific details that are either overlooked in the literature or avoided by data exploration and information extraction algorithms, but have significant importance to properly pre-process these data. Making use of different types of formalized knowledge, according to the characteristics of physiological measurement devices, relevant data handled by a Personal Health Record on a mobile device, are evaluated from a data quality perspective, considering data deficiencies factors, consequences and reasons. We propose a general scheme for sensors data quality characterization adapted to a pervasive scenario.

from HAL : Dernières publications http://ift.tt/1DQQQNN

[hal-01184499] Processus de développement de système fondé sur l'alignement de modèles

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 peuvent être décrites et outillées par l'utilisation du MDE. La mise en oeuvre se traduit par un enchaînement de transformations de modèles intégrant en entrée des modèles d'analyse des exigences du système et produisant en fin d'enchaînement le modèle résultant du codage. Chacune de ces transformations de modèles est constituée de tâches manuelles d'alignement réservées aux experts comme la conception des éléments du modèle et de tâches automatisées d'alignement telles que la conception des relations entre éléments du modèle. Les tâches amont de ce processus de développement fondé sur l'alignement de modèles sont illustrées avec un service de télécommunication.

from HAL : Dernières publications http://ift.tt/1UISgOj

[hal-01184246] Privacy-Conscious Information Diffusion in Social Networks

[...]

from HAL : Dernières publications http://ift.tt/1UISgO9

[hal-01184386] Directed One-Trees

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 an O(n^2) recognition algorithm and an O(n^2) algorithm for solving the Hamiltonian cycle problem on directed one-trees.

from HAL : Dernières publications http://ift.tt/1UISdSD

[hal-01184385] The game of arboricity

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 arboricity of G, denoted by A_g(G). We prove that A_g(G) ≤3k for any graph G of arboricity k, and that there are graphs such that A_g(G)≥2k-2. The upper bound is achieved by a suitable version of the activation strategy, used earlier for the vertex coloring game. We also provide other strategie based on induction.

from HAL : Dernières publications http://ift.tt/1DQQQNC

[hal-01184384] A sufficient condition for bicolorable hypergraphs

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/1DQQQNA

[hal-01184383] Pairwise Intersections and Forbidden Configurations

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 we can assume a ≥d and b ≥c. We show that f_m(a,b,c,d) is Θ (m^a+b-1) if either b>c or a,b≥1. We also show that f_m(0,b,b,0) is Θ (m^b) and f_m(a,0,0,d) is Θ (m^a). This can be viewed as a result concerning forbidden configurations and is further evidence for a conjecture of Anstee and Sali. Our key tool is a strong stability version of the Complete Intersection Theorem of Ahlswede and Khachatrian, which is of independent interest.

from HAL : Dernières publications http://ift.tt/1DQQQNx

[hal-01184382] Monotone Boolean Functions with s Zeros Farthest from Threshold Functions

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 on the n-cube with s zeros, what is the maximum of d(g,T_t)? We show that the following monotone function p_s maximizes the distance: For x∈\0,1\^n, p_s(x)=0 if and only if N(x) < s, where N(x) is the integer whose n-bit binary representation is x. Our result generalizes the previous work for the case t=\lceil n/2 \rceil and s=2^n-1 by Blum, Burch, and Langford [BBL98-FOCS98], who considered the problem to analyze the behavior of a learning algorithm for monotone Boolean functions, and the previous work for the same t and s by Amano and Maruoka [AM02-ALT02].

from HAL : Dernières publications http://ift.tt/1DQQOp0

[hal-01184381] Hypertree-Width and Related Hypergraph Invariants

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 and Thomas's robber and cops game.

from HAL : Dernières publications http://ift.tt/1UISdC9

[hal-01184380] Decomposable graphs and definitions with no quantifier alternation

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 components by a short sequence of serial and parallel decompositions, we show examples of G on n vertices with D_0(G)≤ 2\log ^*n+O(1). On the other hand, we prove a lower bound D_0(G)≥ \log ^*n-\log ^*\log ^*n-O(1) for all G. Here \log ^*n is equal to the minimum number of iterations of the binary logarithm needed to bring n below 1.

from HAL : Dernières publications http://ift.tt/1UISdC1

[hal-01184378] Permutations with short monotone subsequences

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 constant and therefore these permutations have a simple description in terms of the pair of square tableaux. We deduce a limit shape result for the plot of values of the typical such permutation, which in particular implies that the first value taken by such a permutation is with high probability (1+o(1))n^2/2.

from HAL : Dernières publications http://ift.tt/1DQQOoU

[hal-01182604] Improving LiDAR Point Cloud Classification using Intensities and Multiple Echoes

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 the perceived surfaces, and is not strongly impacted by the scene illumination – contrary to visual information. This article investigates how such information can augment the precision of a point cloud classifier. It presents an empirical evaluation of a low cost LiDAR, introduces features related to the intensity and multiple echoes and their use in a hierarchical classification scheme. Results on varied outdoor scenes are depicted, and show that more precise class identification can be achieved using the intensity and multiple echoes than when using only geometric features.

from HAL : Dernières publications http://ift.tt/1UISeG5

[hal-01184376] Fast separation in a graph with an excluded minor

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 Thomas [\emphJ. Amer. Math. Soc. 1990] presented an algorithm that in \mathcalO(n^1/2m) time, either outputs a K_ℓ-minor of G, or a separation of G of order \mathcalO(n^1/2). Whether there is a \mathcalO(n+m) time algorithm for this theorem was left as open problem. In this paper, we obtain a \mathcalO(n+m) time algorithm at the expense of \mathcalO(n^2/3) separator. Moreover, our algorithm exhibits a tradeoff between running time and the order of the separator. In particular, for any given \epsilon ∈[0,1/2], our algorithm either outputs a K_ℓ-minor of G, or a separation of G with order \mathcalO(n^(2-\epsilon )/3) in \mathcalO(n^1+\epsilon +m) time.

from HAL : Dernières publications http://ift.tt/1DQQNRX

[hal-01184377] Supermodularity on chains and complexity of maximum constraint satisfaction

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 constraints. This problem is NP-hard in general so it is natural to study how restricting the allowed types of constraints affects the complexity of the problem. In this paper, we show that any Max CSP problem with a finite set of allowed constraint types, which includes all constants (i.e. constraints of the form x=a), is either solvable in polynomial time or is NP-complete. Moreover, we present a simple description of all polynomial-time solvable cases of our problem. This description uses the well-known combinatorial property of supermodularity.

from HAL : Dernières publications http://ift.tt/1DQQNRV

[hal-01184372] Nonrepetitive colorings of graphs

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 century. In particular Thue proved that if G is a simple path of any length greater than 4 then π _2(G)=3 and π _3(G)=2. We investigate π _k(G) for other classes of graphs. Particularly interesting open problem is to decide if there is, possibly huge, k such that π _k(G) is bounded for planar graphs.

from HAL : Dernières publications http://ift.tt/1UISdlr

[hal-01184373] On the enumeration of uniquely reducible double designs

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 with non-trivial automorphisms are classified with respect to their automorphism group. As an application, after proving that a reducible 2-(21,5,2) design is uniquely reducible, we establish that the number of all reducible 2-(21,5,2) designs is 1 746 461 307.

from HAL : Dernières publications http://ift.tt/1DQQNRP

[hal-01184374] Labeling planar graphs with a condition at distance two

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 Δ has an L(2,1)-labeling with K≤Δ ^2. We verify the conjecture for planar graphs with maximum degree Δ ≠3.

from HAL : Dernières publications http://ift.tt/1DQQNBy

[hal-01184369] NBC Complexes of Convex Geometries

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 present an Orlik-Solomon type algebra on a convex geometry, and show the NBC generating theorem. This note is on the same line as the studies in [nakamura03a, okamoto-nakamura, nakamura].

from HAL : Dernières publications http://ift.tt/1UISe9f

[hal-01184370] Packing Three-Vertex Paths in a Subcubic Graph

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 δ ≥2, and that this bound is tight. The proof is constructive and implied by a linear-time algorithm. We use this result to show that any 2-connected cubic graph of order n>8 has a P_3-packing of at least \lceil 7n/9 \rceil vertices.

from HAL : Dernières publications http://ift.tt/1DQQNBm

[hal-01184371] Largest cliques in connected supermagic graphs

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 on Sidon sets show that the order of such a graph is at least n^2+o(n^2). We close the gap between those two bounds by showing that, for any given graph H of order n, there are connected magic graphs of order n^2+o(n^2) containing H as an induced subgraph. Moreover it can be required that the graph admits a supermagic labelling f, which satisfies the additional condition f(V)=[1,|V|].

from HAL : Dernières publications http://ift.tt/1DQQO8r

[hal-01182607] Set-Membership Approach to the Kidnapped Robot Problem

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 interval based algorithm that copes with such conditions, by matching the Lidar data with the terrain model in a robust manner. Experimental validations using different terrain model are reported to illustrate the performance of the method.

from HAL : Dernières publications http://ift.tt/1UISe95

[hal-01184366] Excluded subposets in the Boolean lattice

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 by the value 2.

from HAL : Dernières publications http://ift.tt/1DQQO8p

[hal-01184367] Infinite limits and folding

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. We characterize the isomorphism type and induced subgraph structure of these infinite graphs using the notion of dismantlability from the theory of vertex pursuit games, and graph homomorphisms.

from HAL : Dernières publications http://ift.tt/1DQQO8l

[hal-01184368] Finding a Strong Stable Set or a Meyniel Obstruction in any Graph

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 v or a Meyniel obstruction in G. This can then be used to find in any graph, a clique and colouring of the same size or a Meyniel obstruction.

from HAL : Dernières publications http://ift.tt/1UIScOy

[hal-01184363] Degree-correlation of Scale-free graphs

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 between degrees of adjacent nodes in real-world networks. Here we define the \textitdegree correlation―-correlation of the degrees in a pair of adjacent nodes―-for a random graph process. We determine asymptotically the joint probability distribution for node-degrees, d and d', of adjacent nodes for every 0≤d≤ d'≤n^1 / 5, and use this result to show that the model of Barabási and Albert does not generate degree-correlation. Our theorem confirms the result in [KR01], obtained by using the mean-field heuristic approach.

from HAL : Dernières publications http://ift.tt/1DQQLcV

[hal-01184364] Density of universal classes of series-parallel graphs

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 subclass of \mathcalC_3 which is a proper subclass of K_4-minor-free graphs (\mathcalG/K_4) is shown to be universal. In another direction, a density result was given in [PZ], that for each rational number a/b ∈[2,8/3]∪ \3\, there is a K_4-minor-free graph with circular chromatic number equal to a/b. In this note we show for each rational number a/b within this interval the class \mathcalK_a/b of K_4-minor-free graphs with circular chromatic number a/b is universal if and only if a/b ≠2, 5/2 or 3. This shows yet another surprising richness of the K_4-minor-free class that it contains universal classes as dense as the rational numbers.

from HAL : Dernières publications http://ift.tt/1UIScOo

[hal-01184365] Packing triangles in low degree graphs and indifference graphs

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 a more general algorithm for set packing obtained by Hurkens and Schrijver in 1989. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs.

from HAL : Dernières publications http://ift.tt/1UIScya

Rôle de l'état dans la reduction de la pauvreté à Madagascar

par Michel Mélodie RAKOTONIRINA Université TOAMASINA Madagascar 2014

from Memoire Online http://ift.tt/1NiT8q3

L'abà¢à¢, corps de garde et espace de communication chez les Fang d'Afrique centrale. Une préfiguration des réseaux sociaux modernes.

par Gérard Paul ONJI'I ESONO Université de Yaoundé II Cameroun 2015

from Memoire Online http://ift.tt/1NiT8q3

Phénoménologie des droits de l'homme chez Emmanuel Lévinas: de l'humanisme juridique à l'humanisme éthique

par Achile Igor BENAM Université Catholique d'Afrique Centrale 2013

from Memoire Online http://ift.tt/1NiT8q3

Global tests of association for multivariate ordinal data

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 Elektronische Dissertationen der LMU München: http://ift.tt/1Kj3wti

Cb-LIKE

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/1Pmh6R0

On The Growth Of Permutation Classes

[hal-01183554] Singularité et section de Dirac

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 d'’un multivers de Banach-Schauder. On peut à partir de cette représentation, étudier les sections des formes bilinéaires symétriques dégénérées à structures sur une variété fermée de dimension finie.

from HAL : Dernières publications http://ift.tt/1f7bJbf

TCR signals in the identity and function of mature NKT and regulatory T cells

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/1WhVcDo

Long-term effects of economic fluctuations on health and cognition in Europe and the United States

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/1MkR5Dj

Humanitarian intervention: from le droit d'Ingérence to the responsibility to protect

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/1Iz6VGm

Impacts of better transport accessibility: evidence from Chile

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/1L1Pl1v

Reaching out to the persistently poor in rural areas: an analysis of Brazil’s Bolsa Família conditional cash transfer programme

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://ift.tt/1TkzJoQ

In pursuit of development: the United Nations, decolonization and development aid, 1949-1961

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/1IEbblP

L'impact de la coopération sino-russe sur la crise syrienne

par Nixon Mbale Epambilo Université de Lubumbashi 2013

from Memoire Online http://ift.tt/1NiT8q3

L'influence des télévisions étrangères sur la population lushoise

par Etienne ILUNGA KANDOLA Université de Lubumbashi 2012

from Memoire Online http://ift.tt/1NiT8q3

Fondements et régime de la propriété

par Séraphim Herbillon Université de Montpellier 2015

from Memoire Online http://ift.tt/1NiT8q3

[hal-01183133] Sur la dynamique en Relativité générale : gravitation et Théorie de jauges

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 voie à l'établissement d'un pont entre ces deux théories, genre de pierre de Rosette permettant la traduction des équations dans le formalisme de l'une en situations dans le cadre de l'autre, et de montrer qu'en dépit de leurs façons différentes de voir elles n'ont jamais cessé de dire les mêmes réalités?... Reste à déterminer lesquelles. Et comment. C'est la proposition de ce travail.

from HAL : Dernières publications http://ift.tt/1M7ESQN

[tel-01179545] Investigation des Interactions Toxine-Cellule et du Confinement des Récepteurs dans la Membrane Cellulaire

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 permettre à la membrane d’accomplir ces tâches. Ces récepteurs se retrouvent dans un environnement de haute hétérogénéité qui renforce leur efficacité. Nous avons étudié cet environnent en suivant des récepteurs uniques dans la membrane grâce aux nanoparticules dopées aux terres rares. Ces nanoparticules produisent des signaux continus, non-interrompus, permettant de suivre des trajectoires pendant plusieurs minutes. Nous avons ensuite utilisé une méthode basée sur l’inférence bayésienne pour analyser et comparer les trajectoires obtenues, et pour extraire le potentiel de confinement de forme arbitraire correspondant à chaque trajectoire. Nous avons d’abord validé l’approche de l’inférence bayésienne en démontrant que cette méthode peut également être utilisée pour la calibration d’un montage de pinces optiques. Par ailleurs, nous avons démontré que cette approche est supérieure aux techniques couramment utilisées pour la calibration des pinces optiques. Puis, nous avons appliqué cette méthode aux trajectoires des récepteurs de la toxine epsilon (de Clostridium perfringens) dans des cellules rénales canines Madin- Darby (MDCK). En particulier, nous avons étudié l’évolution du potentiel de confinement et de la diffusivité à l’intérieur des domaines confinant les récepteurs pendant l’action d’un agent déstabilisant les domaines de confinement, ainsi que les événement de ‘hopping’ pendant lesquels le récepteur change de domaine de confinement, et déterminé les énergies de ‘hopping’ associées. De plus, nous avons observé l’effet d’une force externe appliquée au récepteur, produite par un flux hydrodynamique. L’application d’une force a mis en évidence une dépendance du confinement des récepteurs du cytosquelette d’actine en plus du confinement produit par la distribution des lipides. Pour approfondir notre investigation du confinement des récepteurs de la membrane, nous avons classifié les potentiels de confinement obtenus pour les récepteurs résidant à l’intérieur et à l’extérieur des radeaux lipidiques. Les potentiels ressentis par les récepteurs en dehors des domaines lipidiques sont plus plats au centre du domaine de confinement et plus abrupts vers les bords du domaine par rapport aux potentiels ressentis par les protéines dans les radeaux. Enfin, nous avons étendu la technique de suivi de particules uniques en 3D en utilisant la largeur de la fonction de réponse du signal de la nanoparticule. De cette manière, nous avons observé le mouvement d’internalisation de nanoparticules couplées à un fragment de la chaine lourde de la toxine botulique A de Clostridium botulinum dans des cellules intestinales de souris de la lignée m-ICcl2.

from HAL : Dernières publications http://ift.tt/1SScCXP

Conception et réalisation d?un système de vote electronique

par Blondel SEUMO NTSIEPDJAP Institut Universitaire de Technologie FOTSO Victor de Bandjoun 2013

from Memoire Online http://ift.tt/1NiT8q3

La finance islamique : réglementation et financement des PME dans la zone UEMOA

par MOUNKAILA Soumana Illiassou Ecole Supérieure de Technologie et de Management de Dakar (ESTM) 2013

from Memoire Online http://ift.tt/1NiT8q3

[hal-01093050] Génération Numérique d'Hologrammes : État de l'Art

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 conventionnelle : (1) la nécessité d'utiliser une source laser cohérente et (2) l'obligation d'avoir un système optique extrêmement stable peuvent ainsi être évitées.

from HAL : Dernières publications http://ift.tt/1IG1xT8

[hal-00545766] Modélisation des antennes électriques et magnétiques du GPR EISS pour la mission Exomars

[...]

from HAL : Dernières publications http://ift.tt/1rabcuU