Gotowe bibliografie tematyczne / Matching Schemes / Rozprawy doktorskie
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Matching Schemes.

Rozprawy doktorskie na temat „Matching Schemes”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 1 lutego 2022

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Matching Schemes”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Lie, Chin Cheong Patrick. "Geometrically constrained matching schemes." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=39316.

Pełny tekst źródła
Streszczenie:
We present an effective method for solving different types of noisy pattern matching problems in Euclidean space. The matching is performed in either a least-squares or a mixed-norm sense under the constraint that a transformation matrix $ Theta$ is restricted to belong to the orthogonal group. Matching problems of this type can be recast as function optimization problems which can be solved by representing the orthogonal group to which $ Theta$ belongs as a Lie group and then investigating the gradient vector field associated with the function to be optimized. The projection of the gradient f
Style APA, Harvard, Vancouver, ISO itp.
2

Elgedawy, Islam Moukhtar, and islam_elgedawy@yahoo com au. "Correctness-Aware High-Level Functional Matching Approaches For Semantic Web Services." RMIT University. Computer Science and Information Technology, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20070511.162143.

Pełny tekst źródła
Streszczenie:
Existing service matching approaches trade precision for recall, creating the need for humans to choose the correct services, which is a major obstacle for automating the service matching and the service aggregation processes. To overcome this problem, the matchmaker must automatically determine the correctness of the matching results according to the defined users' goals. That is, only service(s)-achieving users' goals are considered correct. This requires the high-level functional semantics of services, users, and application domains to be captured in a machine-understandable format. Also th
Style APA, Harvard, Vancouver, ISO itp.
3

Zhang, Nan. "TRANSFORM BASED AND SEARCH AWARE TEXT COMPRESSION SCHEMES AND COMPRESSED DOMAIN TEXT RETRIEVAL." Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3938.

Pełny tekst źródła
Streszczenie:
In recent times, we have witnessed an unprecedented growth of textual information via the Internet, digital libraries and archival text in many applications. While a good fraction of this information is of transient interest, useful information of archival value will continue to accumulate. We need ways to manage, organize and transport this data from one point to the other on data communications links with limited bandwidth. We must also have means to speedily find the information we need from this huge mass of data. Sometimes, a single site may also contain large collections of data such as
Style APA, Harvard, Vancouver, ISO itp.
4

ARATA, LINDA. "Il Ruolo dei Programmi Agro-ambientali: un'analisi attraverso il Propensity Score Matching e la Programmazione Matematica Positiva con il Rischio." Doctoral thesis, Università Cattolica del Sacro Cuore, 2014. http://hdl.handle.net/10280/2469.

Pełny tekst źródła
Streszczenie:
La crescente attenzione riguardo l’interconnessione tra agricoltura e aspetti ambientali così come la crescita di volatilità dei prezzi dei prodotti agricoli ha posto una nuova enfasi sull’introduzione di misure ambientali nella politiche agricole e sulla ricerca di nuovi strumenti di stabilizzazione del reddito degli agricoltori. La ricerca di questa tesi di dottorato si inserisce in questo contesto e analizza i contratti agro-ambientali, misure della Politica Agricola Comunitaria (PAC) in Unione Europea (UE), sotto una duplice prospettiva. Il primo lavoro di ricerca consiste in un’analisi de
Style APA, Harvard, Vancouver, ISO itp.
5

Van, der Merwe Nick. "Development of an image matching scheme using feature- and area based matching techniques." Doctoral thesis, University of Cape Town, 1995. http://hdl.handle.net/11427/21341.

Pełny tekst źródła
Streszczenie:
Image matching is widely considered to be one of the most difficult tasks of a digital photogrammetric system. Traditionally image matching has been approached from either an area based or a feature based point of view. In recent years significant progress has been made in Area Based Matching (ABM) techniques such as Multiphoto Geometrically Constrained Least Squares Matching. Also in the field of Feature Based Matching (FBM) improvements have been made in extracting and matching image features, using for example the Forstner Operator followed by feature matching. Generally, area- and feature
Style APA, Harvard, Vancouver, ISO itp.
6

Liu, Yau-Jr. "Marital-property scheme, marriage promotion and matching market equilibrium." Diss., Columbia, Mo. : University of Missouri-Columbia, 2006. http://hdl.handle.net/10355/5856.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--University of Missouri-Columbia, 2006.<br>The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (March 5, 2007) Vita. Includes bibliographical references.
Style APA, Harvard, Vancouver, ISO itp.
7

Saleem, Khalid. "Schema Matching and Integration in Large Scale Scenarios." Montpellier 2, 2008. http://www.theses.fr/2008MON20126.

Pełny tekst źródła
Streszczenie:
Le besoin d'intégrer et d'analyser des grands ensembles de données issus des bases de données publiées sur le web est présent dans de nombreux domaines d'applications comme la génomique, l'environnement, la médecine et le commerce électronique. Ces données sont, après intégration, utilisées pour prendre des décisions, des échanges de services, etc. Les outils existants pour la découverte de correspondances (appelés matchers) permettent de traiter les schémas deux par deux et nécessitent l'intervention d'un expert afin de garantir une bonne qualité des correspondances. Dans un scénario de large
Style APA, Harvard, Vancouver, ISO itp.
8

Do, Hong-Hai. "Schema matching and mapping based data integration architecture, approaches and evaluation." Saarbrücken VDM, Müller, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2863983&prov=M&dok_var=1&dok_ext=htm.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Vojíř, Stanislav. "Mapování PMML a BKEF dokumentů v projektu SEWEBAR-CMS." Master's thesis, Vysoká škola ekonomická v Praze, 2010. http://www.nusl.cz/ntk/nusl-75744.

Pełny tekst źródła
Streszczenie:
In the data mining process, it is necessary to prepare the source dataset - for example, to select the cutting or grouping of continuous data attributes etc. and use the knowledge from the problem area. Such a preparation process can be guided by background (domain) knowledge obtained from experts. In the SEWEBAR project, we collect the knowledge from experts in a rich XML-based representation language, called BKEF, using a dedicated editor, and save into the database of our custom-tailored (Joomla!-based) CMS system. Data mining tools are then able to generate, from this dataset, mining model
Style APA, Harvard, Vancouver, ISO itp.
10

Tao, Cui. "Schema Matching and Data Extraction over HTML Tables." Diss., CLICK HERE for online access, 2003. http://contentdm.lib.byu.edu/ETD/image/etd279.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
11

Karagoz, Funda. "Application Of Schema Matching Methods To Semantic Web Service Discovery." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607593/index.pdf.

Pełny tekst źródła
Streszczenie:
The Web turns out to be a collection of services that interoperate through the Internet. As the number of services increase, it is getting more and more diffucult for users to find, filter and integrate these services depending on their requirements. Automatic techniques are being developed to fulfill these tasks. The first step toward automatic composition is the discovery of services needed. UDDI which is one of the accepted web standards, provides a registry of web services. However representation capabilities of UDDI are insufficient to search for services on the basis of what they provide
Style APA, Harvard, Vancouver, ISO itp.
12

Riaz, Muhammad Atif, and Sameer Munir. "An Instance based Approach to Find the Types of Correspondence between the Attributes of Heterogeneous Datasets." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1938.

Pełny tekst źródła
Streszczenie:
Context: Determining attribute correspondence is the most important, time consuming and knowledge intensive part during databases integration. It is also used in other data manipulation applications such as data warehousing, data design, semantic web and e-commerce. Objectives: In this thesis the aim is to investigate how to find the types of correspondence between the attributes of heterogeneous datasets when schema design information of the data sets is unknown. Methods: A literature review was conducted to extract the knowledge related to the approaches that are used to find the corresponde
Style APA, Harvard, Vancouver, ISO itp.
13

Warren, Julie. "Talking a good match : a case study of placement matching in a specialist adolescent foster care scheme." Thesis, University of Edinburgh, 2001. http://hdl.handle.net/1842/23247.

Pełny tekst źródła
Streszczenie:
The study addresses an important gap in the research, the nature of foster placement matching for adolescents. The study setting was an established, specialist adolescent fostering scheme in a large local authority social work department. Contextual data was collected by preliminary fieldwork and analysis of agency documents. Data was collected observation and interview at the site of placement decision-making and this was analysed by a novel method which employed text-based, meaning-centred and simple quantitative analytical techniques. The enquiry centred on possible inconsistencies between
Style APA, Harvard, Vancouver, ISO itp.
14

TANIMOTO, Masayuki, Toshiaki FUJII, Bunpei TOUJI, Tadahiko KIMOTO, and Takashi IMORI. "A Segmentation-Based Multiple-Baseline Stereo (SMBS) Scheme for Acquisition of Depth in 3-D Scenes." Institute of Electronics, Information and Communication Engineers, 1998. http://hdl.handle.net/2237/14997.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
15

Alserafi, Ayman. "Dataset proximity mining for supporting schema matching and data lake governance." Doctoral thesis, Universitat Politècnica de Catalunya, 2021. http://hdl.handle.net/10803/671540.

Pełny tekst źródła
Streszczenie:
With the huge growth in the amount of data generated by information systems, it is common practice today to store datasets in their raw formats (i.e., without any data preprocessing or transformations) in large-scale data repositories called Data Lakes (DLs). Such repositories store datasets from heterogeneous subject-areas (covering many business topics) and with many different schemata. Therefore, it is a challenge for data scientists using the DL for data analysis to find relevant datasets for their analysis tasks without any support or data governance. The goal is to be able to extract met
Style APA, Harvard, Vancouver, ISO itp.
16

Duchateau, Fabien. "Towards a Generic Approach for Schema Matcher Selection : Leveraging User Pre- and Post-match Effort for Improving Quality and Time Performance." Montpellier 2, 2009. http://www.theses.fr/2009MON20213.

Pełny tekst źródła
Streszczenie:
L'interopérabilité entre applications et les passerelles entre différentes sources de données sont devenues des enjeux cruciaux pour permettre des échanges d'informations op- timaux. Cependant, certains processus nécessaires à cette intégration ne peuvent pas être complétement automatisés à cause de leur complexité. L'un de ces processus, la mise en correspondance de schémas, est maintenant étudié depuis de nombreuses années. Il s'attaque au problème de la découverte de correspondances sémantiques entre éléments de différentes sources de données, mais il reste encore principalement effectué de
Style APA, Harvard, Vancouver, ISO itp.
17

Sottovia, Paolo. "Information Extraction from data." Doctoral thesis, Università degli studi di Trento, 2019. http://hdl.handle.net/11572/242992.

Pełny tekst źródła
Streszczenie:
Data analysis is the process of inspecting, cleaning, extract, and modeling data with the intention of extracting useful information in order to support users in their decisions. With the advent of Big Data, data analysis was becoming more complicated due to the volume and variety of data. This process begins with the acquisition of the data and the selection of the data that is useful for the desiderata analysis. With such amount of data, also expert users are not able to inspect the data and understand if a dataset is suitable or not for their purposes. In this dissertation, we focus on five
Style APA, Harvard, Vancouver, ISO itp.
18

Rodrigues, Diego de Azevedo, and 981997982. "A Study on Machine Learning Techniques for the Schema Matching Networks Problem." Universidade Federal do Amazonas, 2018. https://tede.ufam.edu.br/handle/tede/6801.

Pełny tekst źródła
Streszczenie:
Submitted by Diego Rodrigues (diego.rodrigues@icomp.ufam.edu.br) on 2018-12-07T21:38:02Z No. of bitstreams: 2 Diego Rodrigues.pdf: 3673641 bytes, checksum: f1fdd4162dc6acd590136bb6b886704e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Secretaria PPGI (secretariappgi@icomp.ufam.edu.br) on 2018-12-07T22:27:06Z (GMT) No. of bitstreams: 2 Diego Rodrigues.pdf: 3673641 bytes, checksum: f1fdd4162dc6acd590136bb6b886704e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by
Style APA, Harvard, Vancouver, ISO itp.
19

Pilling, Valerie Kay. "Increasing the effectiveness of messages promoting responsible undergraduate drinking : tailoring to personality and matching to context." Diss., Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/665.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
20

Kabisch, Thomas. "Extraction and integration of Web query interfaces." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2011. http://dx.doi.org/10.18452/16398.

Pełny tekst źródła
Streszczenie:
Diese Arbeit fokussiert auf die Integration von Web Anfrageschnittstellen (Web Formularen). Wir identifizieren mehrere Schritte für den Integrationsprozess: Im ersten Schritt werden unbekannte Anfrageschnittstellen auf ihre Anwendungsdomäne hin analysiert. Im zweiten Schritt werden die Anfrageschnittstellen in ein maschinenlesbares Format transformiert (Extraktion). Im dritten Schritt werden Paare semantisch gleicher Elemente zwischen den verschiedenen zu integrierenden Anfragesschnittstellen identifiziert (Matching). Diese Schritte bilden die Grundlage, um Systeme, die eine integrierte Sich
Style APA, Harvard, Vancouver, ISO itp.
21

Kadri, Imen. "Controlled estimation algorithms of disparity map using a compensation compression scheme for stereoscopic image coding." Thesis, Paris 13, 2020. http://www.theses.fr/2020PA131002.

Pełny tekst źródła
Streszczenie:
Ces dernières années ont vu apparaître de nombreuses applications utilisant la technologie 3D tels que les écrans de télévisions 3D, les écrans auto-stéréoscopiques ou encore la visio-conférence stéréoscopique. Cependant ces applications nécessitent des techniques bien adaptées pour comprimer efficacement le volume important de données à transmettre ou à stocker. Les travaux développés dans cette thèse concernent le codage d’images stéréoscopiques et s’intéressent en particulier à l'amélioration de l'estimation de la carte de disparité dans un schéma de Compression avec Compensation de Dispari
Style APA, Harvard, Vancouver, ISO itp.
22

Mergen, Sérgio Luis Sardi. "Casamento de esquemas XML e esquemas relacionais." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2005. http://hdl.handle.net/10183/10421.

Pełny tekst źródła
Streszczenie:
O casamento entre esquemas XML e esquemas relacionais é necessário em diversas aplicações, tais como integração de informação e intercâmbio de dados. Tipicamente o casamento de esquemas é um processo manual, talvez suportado por uma interface grá ca. No entanto, o casamento manual de esquemas muito grandes é um processo dispendioso e sujeito a erros. Disto surge a necessidade de técnicas (semi)-automáticas de casamento de esquemas que auxiliem o usuário fornecendo sugestões de casamento, dessa forma reduzindo o esforço manual aplicado nesta tarefa. Apesar deste tema já ter sido estudado na lit
Style APA, Harvard, Vancouver, ISO itp.
23

Jain, Prateek. "Linked Open Data Alignment & Querying." Wright State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=wright1345575500.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
24

Watanabe, Toyohide, Yuusuke Uehara, Yuuji Yoshida, and Teruo Fukumura. "A semantic data model for intellectual database access." IEEE, 1990. http://hdl.handle.net/2237/6923.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
25

CARVALHO, Marcus Vinícius Ribeiro de. "UMA ABORDAGEM BASEADA NA ENGENHARIA DIRIGIDA POR MODELOS PARA SUPORTAR MERGING DE BASE DE DADOS HETEROGÊNEAS." Universidade Federal do Maranhão, 2014. http://tedebc.ufma.br:8080/jspui/handle/tede/511.

Pełny tekst źródła
Streszczenie:
Made available in DSpace on 2016-08-17T14:53:26Z (GMT). No. of bitstreams: 1 Dissertacao Marcus Vinicius Ribeiro.pdf: 4694533 bytes, checksum: b84a4bad63b098d054781131cfb9bc26 (MD5) Previous issue date: 2014-02-24<br>Model Driven Engineering (MDE) aims to make face to the development, maintenance and evolution of complex software systems, focusing in models and model transformations. This approach can be applied in other domains such as database schema integration. In this research work, we propose a framework to integrate database schema in the MDE context. Metamodels for defining databas
Style APA, Harvard, Vancouver, ISO itp.
26

Pfeifer, Katja. "Serviceorientiertes Text Mining am Beispiel von Entitätsextrahierenden Diensten." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-150646.

Pełny tekst źródła
Streszczenie:
Der Großteil des geschäftsrelevanten Wissens liegt heute als unstrukturierte Information in Form von Textdaten auf Internetseiten, in Office-Dokumenten oder Foreneinträgen vor. Zur Extraktion und Verwertung dieser unstrukturierten Informationen wurde eine Vielzahl von Text-Mining-Lösungen entwickelt. Viele dieser Systeme wurden in der jüngeren Vergangenheit als Webdienste zugänglich gemacht, um die Verwertung und Integration zu vereinfachen. Die Kombination verschiedener solcher Text-Mining-Dienste zur Lösung konkreter Extraktionsaufgaben erscheint vielversprechend, da so bestehende Stärken
Style APA, Harvard, Vancouver, ISO itp.
27

Rodrigues, Diego de Azevedo. "Casamento de esquemas de banco de dados aplicando aprendizado ativo." Universidade Federal do Amazonas, 2013. http://tede.ufam.edu.br/handle/tede/4146.

Pełny tekst źródła
Streszczenie:
Submitted by Geyciane Santos (geyciane_thamires@hotmail.com) on 2015-06-18T13:54:27Z No. of bitstreams: 1 Dissertação - Diego de Azevedo Rodrigues.pdf: 8601801 bytes, checksum: 6c2dde718a0b6857ac6e14fd715e240c (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2015-06-19T21:02:00Z (GMT) No. of bitstreams: 1 Dissertação - Diego de Azevedo Rodrigues.pdf: 8601801 bytes, checksum: 6c2dde718a0b6857ac6e14fd715e240c (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2015-06-19T
Style APA, Harvard, Vancouver, ISO itp.
28

NÓBREGA, Thiago Pereira da. "Pareamento privado de atributos no contexto da resolução de entidades com preservação de privacidade." Universidade Federal de Campina Grande, 2018. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1671.

Pełny tekst źródła
Streszczenie:
Submitted by Emanuel Varela Cardoso (emanuel.varela@ufcg.edu.br) on 2018-09-10T19:58:50Z No. of bitstreams: 1 THIAGO PEREIRA DA NÓBREGA – DISSERTAÇÃO (PPGCC) 2018.pdf: 3402601 bytes, checksum: b1a8d86821a4d14435d5adbdd850ec04 (MD5)<br>Made available in DSpace on 2018-09-10T19:58:50Z (GMT). No. of bitstreams: 1 THIAGO PEREIRA DA NÓBREGA – DISSERTAÇÃO (PPGCC) 2018.pdf: 3402601 bytes, checksum: b1a8d86821a4d14435d5adbdd850ec04 (MD5) Previous issue date: 2018-05-11<br>A Resolução de entidades com preservação de privacidade (REPP) consiste em identificar entidades (e.g. Pacientes), armazenadas em
Style APA, Harvard, Vancouver, ISO itp.
29

See, Chan H. "Computation of electromagnetic fields in assemblages of biological cells using a modified finite difference time domain scheme. Computational electromagnetic methods using quasi-static approximate version of FDTD, modified Berenger absorbing boundary and Floquet periodic boundary conditions to investigate the phenomena in the interaction between EM fields and biological systems." Thesis, University of Bradford, 2007. http://hdl.handle.net/10454/4762.

Pełny tekst źródła
Streszczenie:
yes<br>There is an increasing need for accurate models describing the electrical behaviour of individual biological cells exposed to electromagnetic fields. In this area of solving linear problem, the most frequently used technique for computing the EM field is the Finite-Difference Time-Domain (FDTD) method. When modelling objects that are small compared with the wavelength, for example biological cells at radio frequencies, the standard Finite-Difference Time-Domain (FDTD) method requires extremely small time-step sizes, which may lead to excessive computation times. The problem can be overc
Style APA, Harvard, Vancouver, ISO itp.
30

See, Chan Hwang. "Computation of electromagnetic fields in assemblages of biological cells using a modified finite difference time domain scheme : computational electromagnetic methods using quasi-static approximate version of FDTD, modified Berenger absorbing boundary and Floquet periodic boundary conditions to investigate the phenomena in the interaction between EM fields and biological systems." Thesis, University of Bradford, 2007. http://hdl.handle.net/10454/4762.

Pełny tekst źródła
Streszczenie:
There is an increasing need for accurate models describing the electrical behaviour of individual biological cells exposed to electromagnetic fields. In this area of solving linear problem, the most frequently used technique for computing the EM field is the Finite-Difference Time-Domain (FDTD) method. When modelling objects that are small compared with the wavelength, for example biological cells at radio frequencies, the standard Finite-Difference Time-Domain (FDTD) method requires extremely small time-step sizes, which may lead to excessive computation times. The problem can be overcome by
Style APA, Harvard, Vancouver, ISO itp.
31

Abadie, Nathalie. "Formalisation, acquisition et mise en œuvre de connaissances pour l’intégration virtuelle de bases de données géographiques : les spécifications au cœur du processus d’intégration." Thesis, Paris Est, 2012. http://www.theses.fr/2012PEST1054/document.

Pełny tekst źródła
Streszczenie:
Cette thèse traite de l'intégration de bases de données topographiques qui consiste à expliciter les relations de correspondance entre bases de données hétérogènes, de sorte à permettre leur utilisation conjointe. L'automatisation de ce processus d'intégration suppose celle de la détection des divers types d'hétérogénéité pouvant intervenir entre les bases de données topographiques à intégrer. Ceci suppose de disposer, pour chacune des bases à intégrer, de connaissances sur leurs contenus respectifs. Ainsi, l'objectif de cette thèse réside dans la formalisation, l'acquisition et l'exploitation
Style APA, Harvard, Vancouver, ISO itp.
32

Masri, Ali. "Multi-Network integration for an Intelligent Mobility." Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLV091/document.

Pełny tekst źródła
Streszczenie:
Les systèmes de transport sont un des leviers puissants du progrès de toute société. Récemment les modes de déplacement ont évolué significativement et se diversifient. Les distances quotidiennement parcourues par les citoyens ne cessent d'augmenter au cours de ces dernières années. Cette évolution impacte l'attractivité et la compétitivité mais aussi la qualité de vie grandement dépendante de l'évolution des mobilités des personnes et des marchandises. Les gouvernements et les collectivités territoriales développent de plus en plus des politiques d'incitation à l'éco-mobilité. Dans cette thès
Style APA, Harvard, Vancouver, ISO itp.
33

Gentilhomme, Théophile. "Intégration multi-échelles des données de réservoir et quantification des incertitudes." Thesis, Université de Lorraine, 2014. http://www.theses.fr/2014LORR0089/document.

Pełny tekst źródła
Streszczenie:
Dans ce travail, nous proposons de suivre une approche multi-échelles pour simuler des propriétés spatiales des réservoirs, permettant d'intégrer des données directes (observation de puits) ou indirectes (sismique et données de production) de résolutions différentes. Deux paramétrisations sont utilisées pour résoudre ce problème: les ondelettes et les pyramides gaussiennes. A l'aide de ces paramétrisations, nous démontrons les avantages de l'approche multi-échelles sur deux types de problèmes d'estimations des incertitudes basés sur la minimisation d'une distance. Le premier problème traite de
Style APA, Harvard, Vancouver, ISO itp.
34

Wu, Bing-Jhen, and 吳秉禎. "Cluster-Based Pattern-Matching Localization Schemes for Large-Scale Wireless Networks." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/04102399954953427819.

Pełny tekst źródła
Streszczenie:
碩士<br>國立交通大學<br>網路工程研究所<br>95<br>In location-based services, the response time of location determination is critical, especially in real-time applications. This is especially true for pattern-matching localization methods, which rely on comparing an object's current signal strength pattern against a pre-established location database of signal strength patterns collected at the training phase, when the sensing field is large (such as a wireless city). In this work, we propose a cluster-based localization framework to speed up the positioning process for pattern-matching localization schemes. Th
Style APA, Harvard, Vancouver, ISO itp.
35

Lu, Wei-Yuan, and 呂偉元. "A Low Bitrate Video System Using New Block Matching And Rate Control Schemes." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/92340124721772058595.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
36

Chiang, Yun-Jung, and 蔣云容. "Matching Pursuit based DoA Estimation Schemes for Non-Nyquist Spatially Sampled Ultrasound Array Radars." Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5441092%22.&searchmode=basic.

Pełny tekst źródła
Streszczenie:
碩士<br>國立中興大學<br>電機工程學系所<br>107<br>Ultrasound radar has been widely used in short range obstacle detection due to its simplicity and cost effectiveness in implementation. Conventional ultrasound radars use pulse transmission and adopt the principle "time of flight" to calculate distance. The detection quality is susceptible to noise and interference. FMCW (frequency modulation continuous waveform) radars, nonetheless, use the frequency offset between the transmitted and the received signals and can function properly under inferior SNR environments. However, to obtain the direction information o
Style APA, Harvard, Vancouver, ISO itp.
37

Lee, Heung Ki. "Adaptive Resource Management Schemes for Web Services." 2009. http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7608.

Pełny tekst źródła
Streszczenie:
Web cluster systems provide cost-effective solutions when scalable and reliable web services are required. However, as the number of servers in web cluster systems increase, web cluster systems incur long and unpredictable delays to manage servers. This study presents the efficient management schemes for web cluster systems. First of all, we propose an efficient request distribution scheme in web cluster systems. Distributor-based systems forward user requests to a balanced set of waiting servers in complete transparency to the users. The policy employed in forwarding requests from the fronten
Style APA, Harvard, Vancouver, ISO itp.
38

Huang, Chin-Chung, and 黃清忠. "A Methodology for the Integration of Hopfield Network and Genetic Algorithm Schemes for Graph Matching Problems." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/07832368643089770958.

Pełny tekst źródła
Streszczenie:
博士<br>國立中山大學<br>機械與機電工程學系研究所<br>93<br>Object recognition is of much interest in recent industrial automation. Although a variety of approaches have been proposed to tackle the recognition problem, some cases such as overlapping objects, articulated objects, and low-resolution images, are still not easy for the existing schemes. Coping with these more complex images has remained a challenging task in the field. This dissertation, aiming to recognize objects from such images, proposes a new integrated method. For images with overlapping or articulated objects, graph matching methods are often us
Style APA, Harvard, Vancouver, ISO itp.
39

Tsai, Tsung-Lin, and 蔡宗霖. "Integration of data, function, pipeline partition schemes on distributed system--real-time implementation of correspondence matching in stereo images." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/94128290188731236059.

Pełny tekst źródła
Streszczenie:
碩士<br>國立東華大學<br>資訊工程學系<br>92<br>We use distributed system and three partition schemes to make program achieve real-time performance. The three partition schemes are data partition, function partition, pipelining partition. In the paper, we analysis the advantages and disadvantages of the three partition, for example, advantage of data partition is the communication cost of processors is less, but the data partition is only suitable for the condition of algorithm only use local data, function partition can assign different task to different hardware, this can make more efficient utilization of
Style APA, Harvard, Vancouver, ISO itp.
40

Rahm, Erhard, Hong-Hai Do, and Sabine Massmann. "Matching Large XML Schemas." 2004. https://ul.qucosa.de/id/qucosa%3A31966.

Pełny tekst źródła
Streszczenie:
Current schema matching approaches still have to improve for very large and complex schemas. Such schemas are increasingly written in the standard language W3C XML schema, especially in E-business applications. The high expressive power and versatility of this schema language, in particular its type system and support for distributed schemas and namespaces, introduce new issues. In this paper, we study some of the important problems in matching such large XML schemas. We propose a fragment-oriented match approach to decompose a large match problem into several smaller ones and to reuse previou
Style APA, Harvard, Vancouver, ISO itp.
41

Do, Hong-Hai, Sergey Melnik, and Erhard Rahm. "Comparison of Schema Matching Evaluations." 2003. https://ul.qucosa.de/id/qucosa%3A32456.

Pełny tekst źródła
Streszczenie:
Recently, schema matching has found considerable interest in both research and practice. Determining matching components of database or XML schemas is needed in many applications, e.g. for E-business and data integration. Various schema matching systems have been developed to solve the problem semi-automatically. While there have been some evaluations, the overall effectiveness of currently available automatic schema matching systems is largely unclear. This is because the evaluations were conducted in diverse ways making it difficult to assess the effectiveness of each single system, let alon
Style APA, Harvard, Vancouver, ISO itp.
42

Huang, Nai-Lun, and 黃迺倫. "Efficient Pattern Matching Scheme in LZW Compressed Sequences." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/17797263375166320625.

Pełny tekst źródła
Streszczenie:
碩士<br>國立交通大學<br>電信工程系所<br>94<br>Compressed pattern matching (CPM) is an emerging research field addressing the problem: Given a compressed sequence and a pattern, find the pattern occurrence(s) in the (uncompressed) sequence with minimal (or no) decompression. It can be applied to detection of computer virus and confidential information leakage in compressed files directly. In this thesis, we report our work of CPM in LZW compressed sequences. LZW is one of the most effective compression algorithms used extensively. We propose a simple bitmap-based realization of the well-known　 Amir-Benso
Style APA, Harvard, Vancouver, ISO itp.
43

Huang, Lan-Ya. "An Exact String Matching Algorithms Using Hashing Scheme." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200814285000.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
44

Huang, Lan-Ya, and 黃蘭雅. "An Exact String Matching Algorithms Using Hashing Scheme." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/16933370591311289241.

Pełny tekst źródła
Streszczenie:
碩士<br>國立暨南國際大學<br>資訊管理學系<br>96<br>In this thesis, we consider how to solve the exact string matching problem. The exact string matching problem is to find all locations of a pattern string P in a text string T. In general, string matching algorithm problem work in linear time and linear space. The two well-known of them are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (BM) algorithm. We will use the hashing scheme to solve the exact string matching problem. Our method is simple to implement, and our algorithm work in constant space. Experimental shows that our algorithm is better th
Style APA, Harvard, Vancouver, ISO itp.
45

Rau, Shiun-Hau, and 饒訓豪. "An Ontology-Based Matching Scheme for Web Services." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/23813100033825312905.

Pełny tekst źródła
Streszczenie:
碩士<br>國立臺灣大學<br>資訊管理研究所<br>91<br>Automatic Web services discovery, matchmaking, composition, and execution will play an important role in future electronic commerce environments. Service providers need a mechanism to advertise their services to attract service users. Service users also need a way to search the best service provider that can meet their requirements. This paper focuses on the following questions: What language do service providers use to describe their services and service users to describe their requirements?
Style APA, Harvard, Vancouver, ISO itp.
46

Drumm, Christian, Matthias Schmitt, Hong-Hai Do, and Erhard Rahm. "QuickMig: automatic schema matching for data migration projects." 2007. https://ul.qucosa.de/id/qucosa%3A32494.

Pełny tekst źródła
Streszczenie:
A common task in many database applications is the migration of legacy data from multiple sources into a new one. This requires identifying semantically related elements of the source and target systems and the creation of mapping expressions to transform instances of those elements from the source format to the target format. Currently, data migration is typically done manually, a tedious and timeconsuming process, which is difficult to scale to a high number of data sources. In this paper, we describe QuickMig, a new semi-automatic approach to determining semantic correspondences between sch
Style APA, Harvard, Vancouver, ISO itp.
47

Chen, Hui-Min. "An Exact String Matching Problem Using Data Encoding Scheme." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0020-2406200814110600.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
48

Wang, Yuan-chung, and 王原中. "A Fast IP Lookup Scheme for Longest Prefix Matching." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/p48vus.

Pełny tekst źródła
Streszczenie:
碩士<br>國立雲林科技大學<br>電子與資訊工程研究所<br>96<br>IP lookup is the chief bottleneck affecting performance of current routers. A router examines the destination address (DA) of each incoming packet against its forwarding table whereby the longest prefix matching entry would be chosen, and the next-hop decision for this packet is made. In this paper we have designed a scheme named IP Lookup based on Cover-list (IPLC) to construct the forwarding table. The cover list is used to store the covering relation among prefixes. That is, if only a prefix is covered, it will be stored into a cover list with all the p
Style APA, Harvard, Vancouver, ISO itp.
49

Chen, Hui-Min, and 陳慧敏. "An Exact String Matching Problem Using Data Encoding Scheme." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/99302180071058684639.

Pełny tekst źródła
Streszczenie:
碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>The traditional exact string matching problem is to find all locations of a pattern string with length m in a text with length n. Here we propose a new encoding method to shorten the both lengths of pattern and text by substituting the substring between a special character for its length in O(m+n). Then we use an exact matching algorithm to solve the exact string matching problem on the encoding pattern and text. As can be seen、by using the encoding method、the pattern and text can be shortened about 2/|Σ| times the lengths of the original ones. In practice、
Style APA, Harvard, Vancouver, ISO itp.
50

Pin, Shou-Yu, and 賓少鈺. "A Fast IP Lookup Scheme for Longest-Matching Prefix." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/15738688847194388326.

Pełny tekst źródła
Streszczenie:
碩士<br>國立雲林科技大學<br>電子與資訊工程研究所碩士班<br>90<br>A Fast IP Lookup Scheme for Longest-Matching Prefix Lih-Chyau Wuu, Shou-Yu Pin Institute of Electronic and Information Engineering National Yunlin University of Science and Technology wuulc@el.yuntech.edu.tw Abstract One of the key design issues for the next generation IP routers is the IP Lookup mechanism. IP lookup is an important action in router that is to find the next hop of each incoming packet with a longest-prefix-match address in the routing table. In this paper, we propose an I
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany bibliografiami na temat „Matching Schemes” dla innych typów źródeł:
Artykuły w czasopismach
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii