• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 220
  • 141
  • 135
  • 46
  • 24
  • 13
  • 11
  • 9
  • 7
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • Tagged with
  • 694
  • 97
  • 92
  • 66
  • 65
  • 64
  • 63
  • 60
  • 58
  • 56
  • 50
  • 49
  • 43
  • 40
  • 36
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
281

Modèles mathématiques de l'imprécis et de l'incertain en vue d'applications aux techniques d'aide à la décision

Dubois, Didier 19 November 1983 (has links) (PDF)
Cette thèse est d'abord motivée par le souci d'élucider certains liens existant entre la théorie des ensembles flous et celle des probabilités, en les replaçant toutes deux dans un contexte plus général de mesures dites « d'incertitude ». Sur cette base, on développe des outils mathématiques susceptibles d'exprimer rigoureusement, de façon quantitative, les concepts duaux de possibilité et de nécessité. On montre notamment qu'on peut par là généraliser les opérations logiques ainsi que d'autres notions, telles que la cardinalité, à des ensembles dont les frontières sont mal définies, représentés par le biais d'une fonction d'appartenance, qu'on peut voir comme une distribution de possibilité. On développe, dans le cadre de la théorie des possibilités, un calcul analogue à celui des fonctions de variables aléatoires, appelé calcule des intervalles flous, qui généralise le calcule d'erreurs. Des éléments d'analyse de fonctions floues, étendant l'analyse des correspondances, sont fournis, notamment l'intégration de Riemann.<br /><br />Ces outils mathématiques sont appliqués à la formulation et à la résolution de problèmes d'analyse de la décision et de recherche opérationnelle. On étudie plus particulièrement l'agrégation de critère, l'évaluation des décisions et le choix en environnement incertain et imprécisément décrit, les algorithmes de plus courts chemins dans les graphes imprécisément valués, la programmation linéaire avec contraintes floues. On tente dans chaque cas de discuter les mérites et les limites de la théorie des possibilités par rapport à celle des probabilités, tant sur le plan de leur pouvoir descriptif que sur celui des calculs qu'elles entraînent, et des résultats qu'elles permettent d'obtenir.
282

Intramolecular hydrogen-bonding studies by NMR spectroscopy

Cantalapiedra, Nuria Aboitiz January 2000 (has links)
No description available.
283

Measurements of the mass of the W boson in the W'+W'- #-># qqqq channel with the ALEPH detector

Chalmers, Matthew Donald Kennedy January 1999 (has links)
No description available.
284

Thermal energy recovery of low grade waste heat in hydrogenation process / Återvinning av lågvärdig spillvärme från en hydreringsprocess

Hedström, Sofia January 2014 (has links)
The waste heat recovery technologies have become very relevant since many industrial plants continuously reject large amounts of thermal energy during normal operation which contributes to the increase of the production costs and also impacts the environment. The simulation programs used in industrial engineering enable development and optimization of the operational processes in a cost-effective way. The company Chematur Engineering AB, which supplies chemical plants in many different fields of use on a worldwide basis, was interested in the investigation of the possibilities for effective waste heat recovery from the hydrogenation of dinitrotoluene, which is a sub-process in the toluene diisocyanate manufacture plant. The project objective was to implement waste heat recovery by application of the Organic Rankine Cycle and the Absorption Refrigeration Cycle technologies. Modeling and design of the Organic Rankine Cycle and the Absorption Refrigeration Cycle systems was performed by using Aspen Plus® simulation software where the waste heat carrier was represented by hot water, coming from the internal cooling system in the hydrogenation process. Among the working fluids investigated were ammonia, butane, isobutane, propane, R-123, R-134a, R-227ea, R-245fa, and ammonia-water and LiBr-water working pairs. The simulations have been performed for different plant capacities with different temperatures of the hydrogenation process. The results show that the application of the Organic Rankine Cycle technology is the most feasible solution where the use of ammonia, R-123, R-245fa and butane as the working fluids is beneficial with regards to power production and pay-off time, while R-245fa and butane are the most sustainable choices considering the environment.
285

The measurement of the BO and BO+- lifetimes

Stevenson, K. J. January 1999 (has links)
No description available.
286

La conjecture de partitionnement des chemins

Champagne-Paradis, Audrey 05 1900 (has links)
Soit G = (V, E) un graphe simple fini. Soit (a, b) un couple d’entiers positifs. On note par τ(G) le nombre de sommets d’un chemin d’ordre maximum dans G. Une partition (A,B) de V(G) est une (a,b)−partition si τ(⟨A⟩) ≤ a et τ(⟨B⟩) ≤ b. Si G possède une (a, b)−partition pour tout couple d’entiers positifs satisfaisant τ(G) = a+b, on dit que G est τ−partitionnable. La conjecture de partitionnement des chemins, connue sous le nom anglais de Path Partition Conjecture, cherche à établir que tout graphe est τ−partitionnable. Elle a été énoncée par Lovász et Mihók en 1981 et depuis, de nombreux chercheurs ont tenté de démontrer cette conjecture et plusieurs y sont parvenus pour certaines classes de graphes. Le présent mémoire rend compte du statut de la conjecture, en ce qui concerne les graphes non-orientés et ceux orientés. / Let G = (V,E) be a finite simple graph. We denote the number of vertices in a longest path in G by τ(G). A partition (A,B) of V is called an (a,b)−partition if τ(⟨A⟩) ≤ a and τ(⟨B⟩) ≤ b. If G can be (a,b)−partitioned for every pair of positive integers (a, b) satisfying a + b = τ (G), we say that G is τ −partitionable. The following conjecture, called The Path Partition Conjecture, has been stated by Lovász and Mihók in 1981 : every graph is τ−partitionable. Since that, many researchers prove that this conjecture is true for several classes of graphs and digraphs. This study summarizes the different results about the Path Partition conjecture.
287

Problèmes de tournées multicritères dans des graphes

Bérubé, Jean-François January 2007 (has links)
Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal.
288

Chování tří populací myši domácí ( Mus musculus sensu lato) v baterii pěti behaviorálních testů: vliv poddruhové příslušnosti a komensálního způsobu života / Behavioural patterns exhibited by three populations of house mouse ( Mus musculus lato) in five-tests battery: the effects of subspecies and commensal way of life

Voráčková, Petra January 2015 (has links)
The term "personality" nowadays occurs more often not only in psychological studies of humans but also in animal studies. Studying of personality help us to define the behavioural characteristics which can vary within the age, sexes, species or enviroments. Behavioral experiments are used to detect these behavioral patterns and they can divide the animals into the different groups. The subject of our research became three populations of house mouse (Mus musculus sensu lato) which we tested in a series of experiments involving free exploration, forced exploration, hole- board test, test of vertical activity and Elevated plus-maze. These experiments should reveal wheter the mice differ in their behaviour through the context of sex, comensalism or subspecies. We found (with in excepcion of one test) that intrapopulation variability differences are very small but interpopulation differences purely increase in the cas of comensalism and effects of subspecies. Keywords: Mus musculus, comensalism, open fieldtest, Elevated plus-maze, Principal Component Analysis (PCA)
289

Modélisation de la variabilité des temps de parcours et son intégration dans des algorithmes de recherche du plus court chemin stochastique / Travel time variability modeling and integration into stochastic shortest path problem algorithms

Delhome, Raphaël 01 December 2016 (has links)
La représentation des temps de parcours est un enjeu influençant la qualité de l’information transmise aux usagers des réseaux de transport. En particulier, la congestion constitue un inconvénient majeur dont la prise en compte n’est pas toujours maîtrisée au sein des calculateurs d’itinéraires. De même, les évènements comme les réductions de capacité, les perturbations climatiques, ou encore les pics de fréquentation incitent à dépasser la définition statique des temps de parcours. Des travaux antérieurs se sont focalisés sur des temps dynamiques, i.e. dépendants de la date de départ, de manière à affiner le détail de la représentation, et à prendre notamment en compte le caractère périodique des congestions. La considération d’informations en temps réel est aussi une amélioration indéniable, que ce soit lors de la préparation du trajet, ou lorsqu’il s’agit de s’adapter à des perturbations rencontrées en cours de route. Ceci dit, aussi fines qu’elles soient dans les calculateurs disponibles, ces modélisations présentent un inconvénient majeur : elles ne prennent pas en compte toutes les facettes de la variabilité des temps de parcours. Cette variabilité est très importante, en particulier si l’on considère le niveau d’aversion au risque des usagers. En outre, dans un réseau multimodal, les correspondances éventuelles rendent encore plus critique l’incertitude associée aux temps de parcours. En réponse à ces enjeux, les présents travaux de thèse ont ainsi été consacrés à l’étude de temps de parcours stochastiques, i.e. vus comme des variables aléatoires distribuées.Dans une première étape, nous nous intéressons à la modélisation statistique des temps de parcours et à la quantification de leur variabilité. Nous proposons l’utilisation d’un système de lois développé dans le domaine de l’hydrologie, la famille des lois de Halphen. Ces lois présentent les caractéristiques typiques des distributions de temps de parcours, elles vérifient par ailleurs la propriété de fermeture par l’addition sous certaines hypothèses afférentes à leurs paramètres. En exploitant les ratios de moments associés aux définitions de ces lois de probabilité, nous mettons également au point de nouveaux indicateurs de fiabilité, que nous confrontons avec la palette d’indicateurs classiquement utilisés. Cette approche holistique de la variabilité des temps de parcours nous semble ainsi ouvrir de nouvelles perspectives quant au niveau de détail de l’information, notamment à destination des gestionnaires de réseaux.Par la suite, nous étendons le cadre d’analyse aux réseaux, en utilisant les résultats obtenus à l’étape précédente. Différentes lois de probabilité sont ainsi testées dans le cadre de la recherche du plus court chemin stochastique. Cette première étude nous permet de dresser un panorama des chemins identifiés en fonction du choix de modélisation. S’il est montré que le choix du modèle est important, il s’agit surtout d’affirmer que le cadre stochastique est pertinent. Ensuite, nous soulevons la relative inefficacité des algorithmes de recherche du plus court chemin stochastique, ceux-ci nécessitant des temps de calcul incompatibles avec un passage à l’échelle industrielle. Pour pallier cette difficulté, un nouvel algorithme mettant en oeuvre une technique d’accélération tirée du cadre déterministe est développé dans la dernière partie de la thèse. Les résultats obtenus soulignent la pertinence de l’intégration de modèles stochastiques au sein des calculateurs d’itinéraires. / The travel time representation has a major impact on user-oriented routing information. In particular, congestion detection is not perfect in current route planners. Moreover, the travel times cannot be considered as static because of events such as capacity drops, weather disturbances, or demand peaks. Former researches focused on dynamic travel times, i.e. that depend on departure times, in order to improve the representation details, for example concerning the periodicity of congestions. Real-time information is also a significant improvement for users aiming to prepare their travel or aiming to react to on-line events. However these kinds of model still have an important drawback : they do not take into account all the aspects of travel time variability. This dimension is of huge importance, in particular if the user risk aversion is considered. Additionally in a multimodal network, the eventual connections make the travel time uncertainty critical. In this way the current PhD thesis has been dedicated to the study of stochastic travel times, seen as distributed random variables.In a first step, we are interested in the travel time statistical modeling as well as in the travel time variability. In this goal, we propose to use the Halphen family, a probability law system previously developed in hydrology. The Halphen laws show the typical characteristics of travel time distributions, plus they are closed under addition under some parameter hypothesis. By using the distribution moment ratios, we design innovative reliability indexes, that we compare with classical metrics. This holistic approach appears to us as a promising way to produce travel time information, especially for infrastructure managers.Then we extend the analysis to transportation networks, by considering previous results. A set of probability laws is tested during the resolution of the stochastic shortest path problem. This research effort helps us to describe paths according to the different statistical models. We show that the model choice has an impact on the identified paths, and above all, that the stochastic framework is crucial. Furthermore we highlight the inefficiency of algorithms designed for the stochastic shortest path problem. They need long computation times and are consequently incompatible with industrial applications. An accelerated algorithm based on a deterministic state-of-the-art is provided to overcome this problem in the last part of this document. The obtained results let us think that route planners might include travel time stochastic models in a near future.
290

Histamina intra-amídala modula a memória aversiva de camundongos submetidos à esquiva inibitória, mas não à reexposição no LCE / Histamine Intra-amygdala Modulation on Aversive Memory for Mice-subjected Inhibitory Avoidance Task while not in the Elevated Plus-maze.

Pitta, Fernanda Daher 22 August 2013 (has links)
O Sistema Neural Histaminérgico tem importante papel na memória emocional, ansiedade e medo, processos com mediação pela amídala. O presente estudo investigou os efeitos da histamina (HA) microinjetada na amídala préexposição/teste de aquisição e/ou pré-reexposição/teste de retenção sobre os comportamentos de camundongos submetidos ao Labirinto em Cruz Elevado (LCE) ou à caixa de Esquiva Inibitória (EI). Para tanto, os animais passaram por cirurgia para implantação bilateral de cânulas-guia 1 mm acima da amídala. Após recuperação, eles receberam infusões centrais bilaterais pré-testes (LCE) ou pré-sessões (EI) de salina (SAL) ou HA nas doses de 0,1; 0,5 e 1,0 g em volume de 0,1 l. Os testes no LCE consistiram na exposição dos camundongos ao aparato (T1) e, após 24 h, na sua reexposição (T2). O número de entradas e tempo total nos braços abertos e suas porcentagens (EBA, TBA, %EBA, %TBA, respectivamente) em T1 foram considerados medidas para inferir ansiedade e em T2 para inferência da memória. As sessões na caixa de EI se iniciaram com a habituação. Após 30 min, os camundongos passaram pelo treino 1, com choque nas patas quando da presença do animal no ambiente escuro. Depois de 2 min, houve o treino 2 e, após 24 h, o teste de retenção com ausência de choque. As latências de transição em direção ao ambiente escuro foram registradas. Ao final, para cada modelo experimental e dose, quatro grupos foram formados: SAL-SAL, SALHA, HA-SAL e HA-HA. A análise estatística incluiu a ANOVA de duas vias e teste post hoc de Duncan. Para distribuições não homogêneas foram utilizados os testes de Kruskal-Wallis e Wilcoxon. O nível de significância adotado foi p0,05. No LCE, houve uma diminuição da %EBA e %TBA durante T2 em relação a T1 para todos os grupos tratados. Na comparação entre grupos em T1, a exploração dos braços abertos não mostrou alterações significativas, indicando que não houve alteração sobre o estado de ansiedade. Na caixa de EI, não houve aumento na latência de transição durante o teste de retenção para os grupos SAL-HA das doses de 0,5 e 1,0 g, em relação aos treinos 1 e 2; porém, no grupo HA-HA essa latência apresentou-se elevada. Para o LCE, houve ausência de efeito da HA intra-amídala sobre a memória emocional. Para a tarefa de EI, a HA nas doses de 0,5 e 1,0 g induziu prejuízo da evocação da memória emocional mediada pela amídala e evocação estado-dependente para os animais tratados com HA nos dois dias de sessões. / There is evidence that histamine (HA) modulates learning and memory in different types of behavioral tasks, but the exact course of modulation and its mechanisms are controversial. Well known that the amygdala plays an importante role in modulation of emotions. That is able to influence mnemonic processes. The goal of this research was to compare HA microinjected into the amygdala of mice subjected to elevated plus-maze (EPM) or inhibitory avoidance task (IAT) in effects on anxiety-related behavior and emotional memory. For this purpose, male Swiss mice, weighing from 25 and 35g, were bilaterally implanted with guide cannulas. The recovery took from three to five days after surgery, then behavioral tests in the EPM or IAT were performed on two consecutive days. In the first experiment, the animals received microinjections before Trial 1 of salina (SAL) or HA in the amygdala (0.1; 0.5 and 1.0 g by 0.1 l/side volume) and were exposed to EPM for 5 min. 24h later the same protocol was repeated (Trial 2). The second experiment consisted of four sessions in the IAT: Habituation, Training 1 and 2 (interval of 2min between the two; footshock; 0.5mA/3sec) and Test (24h later; without footshock). Mice were microinjected before Training 1 and Test with SAL or HA at the same dose mentioned. The animals were assigned into four groups for each experiment: SAL-SAL, SAL-HA, HA-SAL and HA-HA. The data was analyzed using two-way ANOVA and Duncans tests to the homogeneous data, and Kruskal-Wallis and Wilcoxon to the inhomogeneous distributions. For the tests in the EPM, the percentage of open arm entries (%OAE) were reduced in Trial 2 relative to Trial 1 for SAL-HA and HA-SAL and the percentage of time spent in the open arms (%OAT) also decreased in all groups at the doses of 0.5 and 1.0 g. No significant changes were observed in that measures in Trial 1 compared all groups, an EPM index of anxiety. For the sessions in the IAT, the step-through latency increased in SAL-SAL, HA-SAL and HA-HA on the test day relative to training day, and no statistical differences were observed to SAL-HA group. The latency were increased whith HA infusions pre-trial and pré-test as a condition. Based on our results, the HA intra-amygdala of mice at the doses studied is not involved on the anxiety-like behaviors and mnemonic process in the EPM, but impairs the emotional memory retrieval in the IAT at the doses of 0.5 and 1.0 g. HA intra-amygdala also induces state-dependent emotional memory in those doses for HA-HA group. We suggest that HA is distinctly involved at pathways that mediates anxiety and fear.

Page generated in 0.0294 seconds