Дисертації з теми "Structure de données persitantes"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Structure de données persitantes".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Lefort, Anatole. "A Support for Persistent Memory in Java." Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAS001.
Повний текст джерелаRecently released non-volatile main memory (NVMM), as fast and durable memory, dramatically increases storage performance over traditional media (SSD, hard disk). A substantial and unique property of NVMM is byte-addressability -- complex memory data structures, maintained with regular load/store instructions,can now resist machine power-cycles, software faults or system crashes. However, correctly managing persistence with the fine grain of memory instructions is laborious, with increased risk of compromising data integrity and recovery at any misstep. Programming abstractions from software libraries and support from language runtime and compilers are necessary to avoid memory bugs that are exacerbated with persistence. In this thesis, we address the challenges of supporting persistent memory in managed language environments by introducing J-NVM, a framework to efficiently access NVMM in Java. With J-NVM, we demonstrate how to design an efficient, simple and complete interface to weave NVMM-devised persistence into object-oriented programming,while remaining unobtrusive to the language runtime itself. In detail, J-NVM offers a fully-fledged interface to persist plain Java objects using failure-atomic sections. This interface relies internally on proxy objects that intermediate direct off-heap access to NVMM. The framework also provides a library of highly-optimized persistent data types that resist reboots and power failures. We evaluate J-NVM by implementing a persistent backend for Infinispan, an industrial-grade data store. Our experimental results, obtained with a TPC-B like benchmark and YCSB, show that J-NVM is consistently faster than other approaches at accessing NVMM in Java
Sozen, Neset. "Structure d'agents explorateur de données." Mémoire, École de technologie supérieure, 2006. http://espace.etsmtl.ca/532/1/SOZEN_Neset.pdf.
Повний текст джерелаLéonard, Michel. "Conception d'une structure de données dans les environnements de bases de données." Grenoble 1, 1988. http://tel.archives-ouvertes.fr/tel-00327370.
Повний текст джерелаBa, Mouhamadou Lamine. "Exploitation de la structure des données incertaines." Electronic Thesis or Diss., Paris, ENST, 2015. http://www.theses.fr/2015ENST0013.
Повний текст джерелаThis thesis addresses some fundamental problems inherent to the need of uncertainty handling in multi-source Web applications with structured information, namely uncertain version control in Web-scale collaborative editing platforms, integration of uncertain Web sources under constraints, and truth finding over structured Web sources. Its major contributions are: uncertainty management in version control of treestructured data using a probabilistic XML model; initial steps towards a probabilistic XML data integration system for uncertain and dependent Web sources; precision measures for location data and; exploration algorithms for an optimal partitioning of the input attribute set during a truth finding process over conflicting Web sources
El, Golli Aïcha. "Extraction de données symboliques et cartes topologiques: application aux données ayant une structure complexe." Phd thesis, Université Paris Dauphine - Paris IX, 2004. http://tel.archives-ouvertes.fr/tel-00178900.
Повний текст джерелаEl, Golli Aicha. "Extraction de données symboliques et cartes topologiques : Application aux données ayant une structure complexe." Paris 9, 2004. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=2004PA090026.
Повний текст джерелаAmarilli, Antoine. "Tirer parti de la structure des données incertaines." Thesis, Paris, ENST, 2016. http://www.theses.fr/2016ENST0021/document.
Повний текст джерелаThe management of data uncertainty can lead to intractability, in the case of probabilistic databases, or even undecidability, in the case of open-world reasoning under logical rules. My thesis studies how to mitigate these problems by restricting the structure of uncertain data and rules. My first contribution investigates conditions on probabilistic relational instances that ensure the tractability of query evaluation and lineage computation. I show that these tasks are tractable when we bound the treewidth of instances, for various probabilistic frameworks and provenance representations. Conversely, I show intractability under mild assumptions for any other condition on instances. The second contribution concerns query evaluation on incomplete data under logical rules, and under the finiteness assumption usually made in database theory. I show that this task is decidable for unary inclusion dependencies and functional dependencies. This establishes the first positive result for finite open-world query answering on an arbitrary-arity language featuring both referential constraints and number restrictions
État-Le, Blanc Marie-Sylvie d'. "Une base de données sédimentologiques : structure, mise en place, applications." Bordeaux 1, 1986. http://www.theses.fr/1986BOR10565.
Повний текст джерелаYahia, Hussein. "Analyse des structures de données arborescentes représentant des images." Paris 11, 1986. http://www.theses.fr/1986PA112292.
Повний текст джерелаCharoy, François. "Construction modulaire d'ateliers logiciels sur une structure d'accueil a objets." Nancy 1, 1992. http://www.theses.fr/1992NAN10173.
Повний текст джерелаAlabau, Miguel. "Une expression des algorithmes massivement parallèles à structure de données irrégulières." Bordeaux 1, 1994. http://www.theses.fr/1994BOR10569.
Повний текст джерелаMalengreau, Barbara. "Structure profonde de la Réunion d'après les données magnétiques et gravimétriques." Clermont-Ferrand 2, 1995. http://www.theses.fr/1995CLF21702.
Повний текст джерелаImberty, Anne. "Nouvelles données sur la structure et le polymorphisme des grains d'amidon." Grenoble 1, 1988. http://www.theses.fr/1988GRE10029.
Повний текст джерелаFesty, Catherine. "Données actuelles sur les mécanismes d'action des antidépresseurs." Paris 5, 1988. http://www.theses.fr/1988PA05P020.
Повний текст джерелаHeulot, Nicolas. "Etude des projections de données comme support interactif de l’analyse visuelle de la structure de données de grande dimension." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112127.
Повний текст джерелаThe cost of data acquisition and processing has radically decreased in both material and time. But we also need to analyze and interpret the large amounts of complex data that are stored. Dimensionality is one aspect of their intrinsic complexity. Visualization is essential during the analysis process to help interpreting and understanding these data. Projection represents data as a 2D scatterplot, regardless the amount of dimensions. However, this visualization technique suffers from artifacts due to the dimensionality reduction. Its lack of reliability implies issues of interpretation and trust. Few studies have been devoted to the consideration of the impact of these artifacts, and especially to give feedbacks on how non-expert users can visually analyze projections. The main approach of this thesis relies on an taking these artifacts into account using interactive techniques, in order to allow data scientists or non-expert users to perform a trustworthy visual analysis of projections. The interactive visualization of the proximities applies a coloring of the original proximities relatives to a reference in the data-space. This interactive technique allows revealing projection artifacts in order to help grasping details of the underlying data-structure. In this thesis, we redesign this technique and we demonstrate its potential by presenting two controlled experiments studying the impact of artifacts on the visual analysis of projections. We also present a design-space based on the lens metaphor, in order to improve this technique and to locally visualize a projection free of artifacts issues
Ernst, Christian. "Conception et implantation d'un système de gestion de bases d'objets de structure complexe : application aux images." Nice, 1987. http://www.theses.fr/1987NICE4089.
Повний текст джерелаPiuzzi, Marc. "Détermination de la structure de protéines à l'aide de données faiblement résolues." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00629362.
Повний текст джерелаLedezma, Ivan. "Structure de marché et productivité : théorie et analyse empirique sur données manufacturières." Phd thesis, Université Panthéon-Sorbonne - Paris I, 2008. http://tel.archives-ouvertes.fr/tel-00364054.
Повний текст джерелаLachance, Bernard. "Développement d'une structure topologique de données 3D pour l'analyse de modèles géologiques." Thesis, Université Laval, 2005. http://www.theses.ulaval.ca/2005/22501/22501.pdf.
Повний текст джерелаPiuzzi, Marc. "Détermination de la structure de protéines à l’aide de données faiblement résolues." Paris 6, 2010. http://www.theses.fr/2010PA066510.
Повний текст джерелаGasnier, Claire. "Nouvelles données sur les relations structure/fonction des chromogranines et leurs applications." Université Louis Pasteur (Strasbourg) (1971-2008), 2006. https://publication-theses.unistra.fr/public/theses_doctorat/2006/GASNIER_Claire_2006.pdf.
Повний текст джерелаCourtois, Virginie. "Le gène Otx2 de souris : nouvelles données de structure et de fonction." Lyon, École normale supérieure (sciences), 2002. http://www.theses.fr/2002ENSL0231.
Повний текст джерелаYasin, Amanullah. "Incremental Bayesian network structure learning from data streams." Nantes, 2013. https://archive.bu.univ-nantes.fr/pollux/show/show?id=b81198e1-9d39-4282-9de6-f29ab95c0664.
Повний текст джерелаIn the last decade, data stream mining has become an active area of research, due to the importance of its applications and an increase in the generation of streaming data. The major challenges for data stream analysis are unboundedness, adaptiveness in nature and limitations over data access. Therefore, traditional data mining techniques cannot directly apply to the data stream. The problem aggravates for incoming data with high dimensional domains such as social networks, bioinformatics, telecommunication etc, having several hundreds and thousands of variables. It poses a serious challenge for existing Bayesian network structure learning algorithms. To keep abreast with the latest trends, learning algorithms need to incorporate novel data continuously. The existing state of the art in incremental structure learning involves only several tens of variables and they do not scale well beyond a few tens to hundreds of variables. This work investigates a Bayesian network structure learning problem in high dimensional domains. It makes a number of contributions in order to solve these problems. In the first step we proposed an incremental local search approach iMMPC to learn a local skeleton for each variable. Further, we proposed an incremental version of Max-Min Hill-Climbing (MMHC) algorithm to learn the whole structure of the network. We also proposed some guidelines to adapt it with sliding and damped window environments. Finally, experimental results and theoretical justifications that demonstrate the feasibility of our approach demonstrated through extensive experiments on synthetic datasets
Todorov, Helena. "Structure learning to unravel mechanisms of the immune system." Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN084.
Повний текст джерелаThe cells of our immune system play an essential role in protecting us from infections from pathogens such as viruses or harmful bacteria. In the context of a disease, the different types of immune cells perform special roles and interact, resulting in a finely orchestrated immune response. However, this complex immune response can in some cases be disrupted. For instance, the cells that are supposed to fight a disease can be silenced. This phenomenon can be observed in tumors, in which cells can start proliferating abnormally without being controlled by a functional immune response. Understanding how the immune system works in the context of a disease is therefore of crucial importance if we want to find efficient therapies. The cells from the immune system can now be thoroughly studied with technologies that generate unprecedented amounts of in- formation on these cells’ shape, type, and on the molecules that they contain. This enormous amount of data represents a challenge for the doctors who need to analyse it. In this context, many computational tools are being developed, to automate the analysis of medical data. These computational tools tackle typical data analysis issues, such as preprocessing (to obtain clean, noise-free data), feature selection (to identify cell features of interest), clustering (to identify groups of similar cells), trajectory inference (to identify developmental processes), and network inference (to identify genes that can influence other genes), among others. The topic of this thesis is the application and design of computational solutions for single-cell data analysis. In the first part of this the- sis, we essentially focus on identifying structure in this type of data. We first present a new computational tool for trajectory inference, TinGa, that can identify cell developmental trajectories in a fast and flexible way. Trajectories are typically identified by compressing the information contained in thousands of genes into a low-dimensional space. We thus secondly present an exploratory study, in which we aimed at computing an optimal low-dimensional space in which the identification of a trajectory would be facilitated. Thirdly, we applied trajectory inference as well as a new network inference method, BRED, to gain biological insight on the response of CD8 T cells upon an acute viral infection. We identified two sources of memory along the developmental trajectory followed by activated CD8 T cells, and we characterised these two memory precursor populations. Finally, we report our results on a multi-omics study that aimed at unraveling differences between patients that were tolerant to a graft trans- plantation and patients who developed graft-versus-host disease. By integrating three different types of data, we were able to uncover the crucial role between an activated state and a steady state of the immune system in these patients. Computational tools allow to analyse new types of large scale datasets in a fast and efficient way. By allowing to automate analyses that were previously performed manually, they present multiple advantages. First, they make it possible to analyse data of unprecedented size and complexity. Secondly, they significantly reduce the time typically needed for the analysis of any type of data. Lastly, they lead to more robust results, since correctly set computational experiments can be repeated by different persons and will lead to identical results. Altogether, the development and application of computational tools can lead to more robust and reproducible single-cell omics research
Moussa, Rim. "Contribution à la conception et l'implantation de la structure de données distribuée & scalable à haute disponibilité LH*RS." Paris 9, 2004. https://portail.bu.dauphine.fr/fileviewer/index.php?doc=2004PA090050.
Повний текст джерелаRahier, Thibaud. "Réseaux Bayésiens pour fusion de données statiques et temporelles." Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM083/document.
Повний текст джерелаPrediction and inference on temporal data is very frequently performed using timeseries data alone. We believe that these tasks could benefit from leveraging the contextual metadata associated to timeseries - such as location, type, etc. Conversely, tasks involving prediction and inference on metadata could benefit from information held within timeseries. However, there exists no standard way of jointly modeling both timeseries data and descriptive metadata. Moreover, metadata frequently contains highly correlated or redundant information, and may contain errors and missing values.We first consider the problem of learning the inherent probabilistic graphical structure of metadata as a Bayesian Network. This has two main benefits: (i) once structured as a graphical model, metadata is easier to use in order to improve tasks on temporal data and (ii) the learned model enables inference tasks on metadata alone, such as missing data imputation. However, Bayesian network structure learning is a tremendous mathematical challenge, that involves a NP-Hard optimization problem. We present a tailor-made structure learning algorithm, inspired from novel theoretical results, that exploits (quasi)-determinist dependencies that are typically present in descriptive metadata. This algorithm is tested on numerous benchmark datasets and some industrial metadatasets containing deterministic relationships. In both cases it proved to be significantly faster than state of the art, and even found more performant structures on industrial data. Moreover, learned Bayesian networks are consistently sparser and therefore more readable.We then focus on designing a model that includes both static (meta)data and dynamic data. Taking inspiration from state of the art probabilistic graphical models for temporal data (Dynamic Bayesian Networks) and from our previously described approach for metadata modeling, we present a general methodology to jointly model metadata and temporal data as a hybrid static-dynamic Bayesian network. We propose two main algorithms associated to this representation: (i) a learning algorithm, which while being optimized for industrial data, is still generalizable to any task of static and dynamic data fusion, and (ii) an inference algorithm, enabling both usual tasks on temporal or static data alone, and tasks using the two types of data.%We then provide results on diverse cross-field applications such as forecasting, metadata replenishment from timeseries and alarms dependency analysis using data from some of Schneider Electric’s challenging use-cases.Finally, we discuss some of the notions introduced during the thesis, including ways to measure the generalization performance of a Bayesian network by a score inspired from the cross-validation procedure from supervised machine learning. We also propose various extensions to the algorithms and theoretical results presented in the previous chapters, and formulate some research perspectives
Raynaud, Jean-Louis. "Exploitation simultanée des données spatiales et fréquentielles dans l'identification modale linéaire et non-linéaire." Besançon, 1986. http://www.theses.fr/1987BESA2013.
Повний текст джерелаVandel, Jimmy. "Apprentissage de la structure de réseaux bayésiens : application aux données de génétique-génomique." Toulouse 3, 2012. http://thesesups.ups-tlse.fr/1913/.
Повний текст джерелаStructure learning of gene regulatory networks is a complex process, due to the high number of variables (several thousands) and the small number of available samples (few hundred). Among the proposed approaches to learn these networks, we use the Bayesian network framework. In this way to learn a regulatory network corresponds to learn the structure of a Bayesian network where each variable is a gene and each edge represents a regulation between genes. In the first part of this thesis, we are interested in learning the structure of generic Bayesian networks using local search. We explore more efficiently the search space thanks to a new stochastic search algorithm (SGS), a new local operator (SWAP) and an extension for classical operators to briefly overcome the acyclic constraint imposed by Bayesian networks. The second part focuses on learning gene regulatory networks. We proposed a model in the Bayesian networks framework taking into account two kinds of information. The first one, commonly used, is gene expression levels. The second one, more original, is the mutations on the DNA sequence which can explain gene expression variations. The use of these combined data, called genetical genomics, aims to improve the structural learning quality. Our different proposals appeared to be efficient on simulated genetical genomics data and allowed to learn a regulatory network for observed data from Arabidopsis thaliana
Astart, Laurent. "Représentation de surfaces ayant une structure arborescente par un modèle paramétrique." Aix-Marseille 2, 2004. http://www.theses.fr/2004AIX22003.
Повний текст джерелаGaillard, Jeremy. "Représentation et échange de données tridimensionnelles géolocalisées de la ville." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSE2023/document.
Повний текст джерелаAdvances in 3D data acquisition techniques (laser scanning, photography, etc.) has led to a sharp increase in the quantity of available 3D geolocated data. More and more cities provide the scanned data on open access platforms. To ensure the intercompatibility of different data sources, standards have been developed for exchange protocols and file formats. Moreover, thanks to new web standards and the increase in processing power of personal devices, it is now possible to integrate rich content, such as 3D applications, directly in a web page. These two elements make it possible to share and exploit 3D city data into a web browser.The subject of my thesis, co-financed by the Oslandia company, is the 3D representation of city data on the Web. More precisely, the goal is to retrieve and visualize a great quantity of city data from one or several distant servers in a thin client. This data is heterogenous: it can be 3D representations of buildings (meshes) or terrain (height maps), but also semantic information such as pollution levels (volume data), the position of bike stations (points) and their availability, etc. During my thesis, I explored various ways of organising this data in generic structures in order to allow the progressive transmission of high volumes of 3D data. Taking into account the multiscale nature of the city is a key element in the design of these structures. Adapting the visualisation of the data to the user is another important objective of my thesis. Because of the high number of uses of 3D city models, the user’s needs vary greatly: some specific areas are of higher interest, data has to be represented in a certain way... I explore different methods to satisfy these needs, either by priroritising some data over others during the loading stage, or by generating personalised scenesbased on a set of preferences defined by the user
Leonardis, Eleonora De. "Méthodes pour l'inférence en grande dimension avec des données corrélées : application à des données génomiques." Thesis, Paris, Ecole normale supérieure, 2015. http://www.theses.fr/2015ENSU0033/document.
Повний текст джерелаThe availability of huge amounts of data has changed the role of physics with respect to other disciplines. Within this dissertation I will explore the innovations introduced in molecular biology thanks to statistical physics approaches. In the last 20 years the size of genome databases has exponentially increased, therefore the exploitation of raw data, in the scope of extracting information, has become a major topic in statistical physics. After the success in protein structure prediction, surprising results have been finally achieved also in the related field of RNA structure characterisation. However, recent studies have revealed that, even if databases are growing, inference is often performed in the under sampling regime and new computational schemes are needed in order to overcome this intrinsic limitation of real data. This dissertation will discuss inference methods and their application to RNA structure prediction. We will discuss some heuristic approaches that have been successfully applied in the past years, even if poorly theoretically understood. The last part of the work will focus on the development of a tool for the inference of generative models, hoping it will pave the way towards novel applications
Michel, Yann. "Assimilation de données d'images télédétectées en météorologie." Phd thesis, Université Paris-Est, 2008. http://tel.archives-ouvertes.fr/tel-00489243.
Повний текст джерелаLavergne-Boudier, Valérie. "Système dynamique d'interrogation des bases de données bibliographiques." Paris 7, 1990. http://www.theses.fr/1990PA077243.
Повний текст джерелаLimasset, Antoine. "Nouvelles approches pour l'exploitation des données de séquences génomique haut débit." Thesis, Rennes 1, 2017. http://www.theses.fr/2017REN1S049/document.
Повний текст джерелаNovel approaches for the exploitation of high throughput sequencing data In this thesis we discuss computational methods to deal with DNA sequences provided by high throughput sequencers. We will mostly focus on the reconstruction of genomes from DNA fragments (genome assembly) and closely related problems. These tasks combine huge amounts of data with combinatorial problems. Various graph structures are used to handle this problem, presenting trade-off between scalability and assembly quality. This thesis introduces several contributions in order to cope with these tasks. First, novel representations of assembly graphs are proposed to allow a better scaling. We also present novel uses of those graphs apart from assembly and we propose tools to use such graphs as references when a fully assembled genome is not available. Finally we show how to use those methods to produce less fragmented assembly while remaining tractable
Opderbecke, Jan. "Localisation d'un robot mobile par fusion de données multi sensorielles dans un environnement structure." Paris 6, 1994. http://www.theses.fr/1994PA066213.
Повний текст джерелаHelbert, William. "Données sur la structure du grain d'amidon et des produits de recristallisation de l'amylose." Université Joseph Fourier (Grenoble ; 1971-2015), 1994. http://www.theses.fr/1994GRE10116.
Повний текст джерелаPopovici, Eugen-Costin. "Information retrieval of text, structure and sequential data in heterogeneous XML document collections." Lorient, 2008. http://www.theses.fr/2008LORIS110.
Повний текст джерелаNowadays digital documents represent a complex and heterogeneous mixture of text, structure, meta-data and multimedia information. The XML description language is now the standard used to represent such documents in digital libraries, product catalogues, scientific data repositories and across the Web. The management of semi structured data requires the development of appropriate indexing, filtering, searching and browsing methods and tools. In particular, the filtering and searching functions of the retrieval systems should be able to answer queries having an incomplete, imprecise or even erroneous knowledge about both the structure and the content of the XML documents. Moreover, these functions should maintain an algorithmic complexity compatible with the complexity of the data while maintaining the scalability of the system. In this thesis, we explore methods for managing and searching collections of heterogeneous multimedia XML documents. We focus on the flexible searching of structure, text, and sequential data embedded in heterogeneous XML document databases. Based on the structural part of the XML documents, we propose a flexible model for the representation, indexing and retrieval of heterogeneous types of sequential data. The matching mechanism simultaneously exploits the structural organization of the sequential/textual data as well as the relevance and the characteristics of the unstructured content of the indexed documents. We also design and evaluate methods both for the approximate matching of structural constraints in an XML Information Retrieval (IR) framework and for the detection of best entry points to locate given topics in XML Documents. Finally, we explore the use of dedicated hardware architecture to accelerate the most expensive processing steps of our XML IR application
Picard, Jacques. "Structure, classification et discrimination des profils évolutifs incomplets et asynchrones." Lyon 1, 1987. http://www.theses.fr/1987LYO19044.
Повний текст джерелаThomopoulos, Rallou. "Représentation et interrogation élargie de données imprécises et faiblement structurées." Paris, Institut national d'agronomie de Paris Grignon, 2003. http://www.theses.fr/2003INAP0018.
Повний текст джерелаThis work is part of a project applied to predictive microbiology, which is built on a database and on its querying system. The data used in the project are weakly structured, they may be imprecise, and cannot provide exact answers to every query, so that a flexible querying system is necessary for the querying of the database. We use the conceptual graph model in order to take into account weakly structured data, and fuzzy set theory, in order to represent imprecise data and fuzzy queries. The purpose of this work is to provide a combination of these two formalisms
Jühling, Frank. "Structure and evolution of animal mitochondrial tRNAs." Thesis, Strasbourg, 2013. http://www.theses.fr/2013STRAJ012.
Повний текст джерелаThe bioinformatic approaches presented in this thesis include the development of databases for classical tRNAs and the mitochondrial tRNAs of metazoans. They are based on new tools for the detection of "bizarre" tRNA genes and sequences, and for the calculation of alignments based on their structural features. The analysis of collected sequences have led to an global overview on the diversity of tRNAs in mitochondrial genomes covering all taxonomic groups of metazoans, but also to a better understanding of genome organization and their evolution. The present study revealed the existence of the smallest known tRNA so far and provides the basis for understanding the three-dimensional folding of mitochondrial tRNA. This work helps to better understand the structure/function relationships of human mitochondrial tRNAs and, in particular, the dysfunctions in mitochondrial pathologies
Lefebvre, Sandrine. "Déformées solaires : diamètre et structure interne : simulations en vue d'intercomparer les données sol et espace." Nice, 2003. http://www.theses.fr/2003NICE4058.
Повний текст джерелаThe objectives of this thesis are, first of all, to make an inventory of ground-based observations of the solar diameter variations, not only temporal but also latitudinal. These last variations reflect surface distortions which are induced by the underlying physical properties (shearing, friction). The quality of ground-based measurements depends on the state of the atmospheric turbulence, which affects the precision. Our team is thus engaged in the construction of a microsatellite, PICARD, of which one of its main objectives is the data analysis algorithms that are necessary to achieve the required high degree of precision. The solar diameter measurements being photometric, any contamination of the solar limb due to the presence of surface magnetic phenomena, such as spots or faculae, affects the precision of the measurements. My work consisted in establishing an algorithm for an automatic control of these phenomena at the solar edge, algorithm which will be then introduced into the future PICARD Date processing. In order to establish this algorithm, a specific and versatile instrumentation, MIRESOL, has been developed. In parallel, in order to physically explain the solar distortions, I established a new theory, based on the thermal wind. Lastly, a final chapter exposes preliminary calculations concerning the possible links between the variations of the solar diameter and the global temperature of the Earth. We show that there is undoubtedly a connection which is through the luminosity variations of the Sun
Fourno, Jean-Pierre. "Inversion des données télésismiques et gravimétriques, sismicité et structure crustale des Hautes Terres de Madagascar." Aix-Marseille 3, 1994. http://www.theses.fr/1994AIX30067.
Повний текст джерелаKaviani, Ayoub. "La chaîne de collision continentale du Zagros (Iran) : structure lithosphérique par analyse de données sismologiques." Université Joseph Fourier (Grenoble), 2004. http://www.theses.fr/2004GRE10084.
Повний текст джерелаThe Zagros mountain belt situated on the northern margin of the Arabian plate, is one of the youngest belts was built by the collision of the Arabian plate with the central Iran micro-continent. A seismological experiment, called "Zagros 2000-2001" was realized by a collaboration between LGIT and IIEES to study the lithospheric structure beneath this collision belt and some part of central Iranian block. We used to investigated the variations of the crustal thickness under the network. By this analysis, we have found a thickening by 20 km over a region of about 100 km width just on the northeast of the MZT ("Main Zagros Thrust"). The average crustal thicknesses of 45 and 40 km were found respectively for the Zagros and central Iran. We've then proposed a crustal model in which the Moho was contrained using the results obtained by analysis of the receveir functions. This model was tried to be compatible with gravimetric data. The thickening of the crust on NE of the MZT was interpreted to be related to overthrusting of the central Iranian crust into the Zagros crust. We could also characterise the upper mantle structure to depth of 350 km by inversion of more than 5000 arrival times of teleseismic P waves. The results of this inversion show a fast upper mantle beneath the Zagros and slow one beneath central Iran. We may relate the presence of a slow upper mantle beneath central Iran to delamination of the lithospheric mantle
Lefèvre, Pascal. "Protection des contenus multimédias pour la certification des données." Thesis, Poitiers, 2018. http://www.theses.fr/2018POIT2273/document.
Повний текст джерелаFor more than twenty years, technology has become more and more easy to access. It is omnipresent in everyday life and is low cost. It allows anyone using a computer or a smartphone to visualize and modify digital contents. Also, with the impressive progress of online massive data storage (cloud), the quantity of digital contents has soared and continues to increase. To ensure the protection of intellectual property and copyright, knowing if an image has been modified or not is an important information in order to authenticate it. One approach to protect digital contents is digital watermarking. It consists in modifying an image to embed an invisible mark which can authenticate the image. In this doctorate thesis, we first study how to improve the robustness of digital image watermarking against image processings thanks to error correcting codes. By studying the error structure produced by the image processing applied on a watermarked image, we can find an optimal choice of error correcting code for the best correction performances. Also, we propose to integrate a new type of error correcting codes called rank metric codes for watermarking applications. Then, we propose to improve the invisibility of color image watermarking methods. At the embedding step, a host image suffers some distortions which are perceived differently in function of the color by the human visual system. We propose a biological model of color perception which allows one to minimize psychovisual distortions applied on the image to protect
Sung, Mee-Young. "Modélisation de documents multimédia incluant des tables, des données calculables et des formules mathématiques." Lyon, INSA, 1990. http://www.theses.fr/1990ISAL0058.
Повний текст джерела[The existence of man document preparation software products and the requirement of the communication between organizational lead to the definition of the standard ODA (Office Document Architecture) which ia a structured multimedia document model. This standard takea account of two aspects of a document : the logical form and the layout form. However, presently ODA does not support the logical description of multidimen signal tables, calculable (parametered) data and mathematical formulae in the processable documents. The representation of these objecta constitues the them. E of this dissertation. The Object-oriented approach is chosen as a basia of the multidimenaional table modeling. Objecta in a table are structured in an aggregation lattice (D. A. G. :Direct Acyclic Graph) in order to ba able to distinguish cella by rows and colum. Ns. A grammar associated with this model defines a constructor ''MSUB (Multiple SUBordination) to permit creating DAG which seems much more adequate for representing multidimensional tables. The evolution aspect of a document, which is characterised by the parametered elements. Also is important inoffice document system. A parametered document model ia designed in the light of the « Data-Qbject » notion to describe the data characteristics and the assoc:lated actions operations on data fot fields situation tion. ) A new mechanism for including data in auch a document is proposed. A logical of mathematical formulae offers the poasibllity to define new graphical symbol to cover the mathematical imagination
McHugh, Rosemarie. "Intégration de la structure matricielle dans les cubes spatiaux." Thesis, Université Laval, 2008. http://www.theses.ulaval.ca/2008/25758/25758.pdf.
Повний текст джерелаBrugger, Bastien. "Structure interne et minéralogie des exoplanètes terrestres de faible masse." Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0324/document.
Повний текст джерелаModeling exoplanetary interiors draws a link between two domains: the detection and characterization of exoplanets, in the context of upcoming missions like PLATO or CHEOPS, and geophysics, with the study of solar system bodies from space missions and laboratory experiments. We have developed a model of internal structure for terrestrial exoplanets describing a metallic core, a silicate mantle, and a water envelope – to span a large range of planetary compositions. Applying this model to confirmed cases strengthens the fact that, beyond the precision on an exoplanet's fundamental parameters (mass and radius), the host star's elemental composition is useful to constrain that of the planet, and thus to progress towards its full characterization. Improving the model goes through several aspects, first by selecting the most appropriate equation of state for extrapolating the Earth's data to the domain of super-Earths. A detailed modeling of the materials is implemented, through the use of a Gibbs free-energy minimization code to describe the mantle's complex chemistry, but also with the incorporation of light elements in the metallic core. This gives the model the precision needed to infer constraints on the interior of solar system bodies, which can then be projected to exoplanet families. The purpose of this work is to better apprehend the vast diversity of exoworlds in terms of dynamics, formation, and composition
Azomahou, Théophile. "Dépendance spatiale et structure de données de panel : application a l'estimation de la demande domestique d'eau." Université Louis Pasteur (Strasbourg) (1971-2008), 2000. http://www.theses.fr/2000STR1EC08.
Повний текст джерелаThis thesis deals with the estimation of spatial models with applications to the residential demand for drinking water. The main results are of two-fold. From a theoretical viewpoint, I investigate the asymptotic biais of the ordinary least squares estimator for spatial autoregressive models. I show that this estimator is biased as well as inconsistent regardless of the distribution of the disturbance. For the general spatial model, I show that the generalized method of moments (GMM) estimator of Kelejian and Prucha (1998, 1999) matches the asymptotic least squares procedure. Then, I suggest an efficient estimation of the general model based on optimal nonparametric instruments. I also provide a consistent (in probability) nonparametric estimatior of the sample autocovariances function for an irregularly spaced spatial process. I then derive the consistency in norm L2 of the resulting asymptotic variance-covariance matrix estimator. Finally, the asymptotic distribution of the GMM estimator is stated. From an empirical viewpoint, I investigate spatial dependence in the residential demand for water from two panel data samples. Estimation results indicate spatial patterns in households' demand for drinking water
Fougeirol, Jérémie. "Structure de variété de Hilbert et masse sur l'ensemble des données initiales relativistes faiblement asymptotiquement hyperboliques." Thesis, Avignon, 2017. http://www.theses.fr/2017AVIG0417/document.
Повний текст джерелаGeneral relativity is a gravitational theory born a century ago, in which the universe is a 4-dimensional Lorentzian manifold (N,gamma) called spacetime and satisfying Einstein's field equations. When we separate the time dimension from the three spatial ones, constraint equations naturally follow on from the 3+1 décomposition of Einstein's equations. Constraint equations constitute a necessary condition,as well as sufficient, to consider the spacetime N as the time evolution of a Riemannian hypersurface (m,g) embeded into N with the second fundamental form K. (m,g,K) is then an element of C, the set of initial data solutions to the constraint equations. In this work, we use Robert Bartnik's method to provide a Hilbert submanifold structure on C for weakly asymptotically hyperbolic initial data, whose regularity can be related to the bounded L^{2} curvature conjecture. Difficulties arising from the weakly AH case led us to introduce two second order differential operators and we obtain Poincaré and Korn-type estimates for them. Once the Hilbert structure is properly described, we define a mass functional smooth on the submanifold C and compatible with our weak regularity assumptions. The geometrical invariance of the mass is studied and proven, only up to a weak regularity conjecture about coordinate changes near infinity. Finally, we make a correspondance between critical points of the mass and static metrics
Pannetier, Benjamin. "Fusion de données pour la surveillance du champ de bataille." Phd thesis, Université Joseph Fourier (Grenoble), 2006. http://tel.archives-ouvertes.fr/tel-00377247.
Повний текст джерела