Relevant bibliographies by topics / Matching Schemes

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Matching Schemes'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Matching Schemes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Matching Schemes"

1

Hirano, Shinji. "Matching renormalization schemes in holography." Modern Physics Letters A 33, no. 24 (August 3, 2018): 1850138. http://dx.doi.org/10.1142/s0217732318501389.

Full text
Abstract:
In holography, there is a one-to-one correspondence between physical observables in the bulk and boundary theories. To define physical observables, however, regularization needs to be implemented in both sides of the correspondence. It is arguable whether the correspondence should extend to regularization and renormalization scheme which are not physical in the conventional sense. However, if we are to take the renormalization group (RG) interpretation of holography seriously, its precise understanding appears to require the matching of regularizations and renormalization schemes in the bulk and boundary theories. We address this question in the AdS5/CFT4 correspondence by considering the simplest physical quantity, the Casimir energy of the [Formula: see text] super Yang–Mills (SYM) theory on [Formula: see text], in a [Formula: see text]-function regularization and show that there are choices of scheme which match the bulk AdS result, including the radial cutoff-dependent corrections when the cutoff is kept finite. We further discuss the implication of this result to the RG interpretation of holography.
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Xiuguang, Yuanyuan He, Ben Niu, Kai Yang, and Hui Li. "An Exact and Efficient Privacy-Preserving Spatiotemporal Matching in Mobile Social Networks." International Journal of Technology and Human Interaction 12, no. 2 (April 2016): 36–47. http://dx.doi.org/10.4018/ijthi.2016040103.

Full text
Abstract:
With the rapid development of mobile smartphone and its built-in location-aware devices, people are possible to establish trust relationships and further interaction with each other based their matched interests, hobbies, experiences, or spatiotemporal profiles. However, the possibility of sensitive information leakage and heavy computation overhead constrain the widespread use of the matching schemes in mobile social networks. Many privacy-preserving matching schemes were proposed recently years, but how to achieve privacy-preserving spatiotemporal matching exactly and efficiently remains an open question. In this paper, the authors propose a novel spatiotemporal matching scheme. The overlapping grid system is introduced into the scheme to improve the accuracy of spatiotemporal matching, and many repetitive records in a user's spatiotemporal profile are counted as one item so as to cut down the computation overhead. Their scheme decreases the spatiotemporal matching error, and promotes the efficiency of private matchmaking simultaneously. Thorough security analysis and evaluation results indicate that our scheme is effective and efficient.
APA, Harvard, Vancouver, ISO, and other styles
3

Ameer, Salah. "Histogram Matching Schemes for Image Thresholding." American Journal of Engineering and Applied Sciences 12, no. 3 (March 1, 2019): 413–19. http://dx.doi.org/10.3844/ajeassp.2019.413.419.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pang, Xue Liang, and Run Xiang Jang. "Study on Method of Key Target Tracking Parameter Matching." Advanced Materials Research 591-593 (November 2012): 2636–41. http://dx.doi.org/10.4028/www.scientific.net/amr.591-593.2636.

Full text
Abstract:
This paper addresses the issue of how to get the optimal tracking parameter matching scheme. At first it establishes the comprehensive evaluation system of target tracking parameter matching scheme which includes four indexes such as capturing probability, getting probability and so on. Then based on the AHP it brings forward the evaluation method based on multi-index decision making to realize the optimized scheme evaluation. Because of the number and level of the parameters, there are numerous parameter matching schemes. So it utilized Uniform Design to optimize simulation experiment number and calculated optimized parameters matching scheme by generalized regression equation. At last, the design examples present the validity and practicability of this method on solving the problems of key target tracking parameter matching scheme.
APA, Harvard, Vancouver, ISO, and other styles
5

Son, J., H. Kim, and T. Kim. "COMPARISON OF GEOMETRIC CORRECTION SCHEMES FOR GEOSTATIONARY OCEAN COLOR IMAGER SLOTS WITHOUT GCPS." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-4 (September 19, 2018): 587–90. http://dx.doi.org/10.5194/isprs-archives-xlii-4-587-2018.

Full text
Abstract:
<p><strong>Abstract.</strong> Currently, the geometric correction process of GOCI (Geostationary Ocean Color Imager) image is performed by matching slot images against shorelines and utilizing the matching results as GCPs (Ground Control Point). However, there are several GOCI slots without shorelines and for such slots acquiring GCPs is not easy. The purpose of this paper is to compare several alternative geometric correction schemes applicable to the slots without GCPs. We analyzed three schemes. The first scheme is to apply the correction angle of the same slot in the most recent dataset. The second scheme is to apply correction angle of the previous slot in the current dataset. And the last scheme is to apply correction angle of the slot with the largest number of GCPs in the same time dataset. Overall process for comparing the quality of the three geometric correction schemes consisted of the following steps. Firstly, using ephemeris metadata of GOCI Level 1A, we established initial sensor model, which defines geometry relationship between ground coordinate system and image coordinate system of a GOCI image. And then, by matching edge detected from GOCI slot images and shoreline landmark chips, we obtained GCPs. Using these GCPs, we calculated correction angle of each slot. After then, through the three schemes, we conducted precision sensor modeling. Among three schemes, geometric correction applying the previous slot correction angle showed the best quality. The average RMSE of this scheme was about 1.4<span class="thinspace"></span>km, which was quite close to geometric correction quality applying correction angles from GCPs.</p>
APA, Harvard, Vancouver, ISO, and other styles
6

JONARD, NICOLAS. "ON THE SURVIVAL OF COOPERATION UNDER DIFFERENT MATCHING SCHEMES." International Game Theory Review 04, no. 04 (December 2002): 459–73. http://dx.doi.org/10.1142/s0219198902000811.

Full text
Abstract:
In this note, the persistence of cooperation in the standard Prisoner's Dilemma is examined under five distinct matching mechanisms. The general model is a birth-and-death process, which is studied using a simple direct method and the mutation-counting technique. Mean matching is discussed first, before two variants of random matching and viscosity are analyzed. Finally payoff assortative matching is considered. In all five cases the stochastic stability of the absorbing sets of the evolutionary process is examined; assortative matching is shown to sustain significant amounts of cooperation.
APA, Harvard, Vancouver, ISO, and other styles
7

JOSHI, BANSIDHAR, and MANISH K. THAKUR. "Stable Matching based Virtual Channels Allocation Scheme in Network-on-Chip." Journal of Interconnection Networks 20, no. 02 (June 2020): 2050008. http://dx.doi.org/10.1142/s0219265920500085.

Full text
Abstract:
While designing router micro-architecture of an On-Chip network, a good allocation of virtual channels (VCs) governs an effective resources utilization which essentially results in an optimized number of packets received at destination(s). Generally, the VC allocation schemes deal with the one-way approach of VC allocation to the contending flits. However, this approach produces non-optimal matching of flits to the available VCs on next routers, and therefore leads to the under-utilization of these VCs. This paper proposes a 2-Way VC Allocation scheme to map input VCs (requestors) to output VCs (resources). The proposed scheme is compared with the conventional VC allocation scheme under two different mesh configurations with a 100% channel load. Simulations performed under two different routing schemes in diverse traffic scenarios demonstrate an increase in the number of packets received at destinations by up to 76%. Also, the network’s latency exhibits trade-off with total power consumption while reducing hotspots.
APA, Harvard, Vancouver, ISO, and other styles
8

Jung, Chanju, Yong-Hyuk Kim, Yourim Yoon, and Byung-Ro Moon. "A New Adaptive Hungarian Mating Scheme in Genetic Algorithms." Discrete Dynamics in Nature and Society 2016 (2016): 1–13. http://dx.doi.org/10.1155/2016/3512546.

Full text
Abstract:
In genetic algorithms, selection or mating scheme is one of the important operations. In this paper, we suggest an adaptive mating scheme using previously suggested Hungarian mating schemes. Hungarian mating schemes consist of maximizing the sum of mating distances, minimizing the sum, and random matching. We propose an algorithm to elect one of these Hungarian mating schemes. Every mated pair of solutions has to vote for the next generation mating scheme. The distance between parents and the distance between parent and offspring are considered when they vote. Well-known combinatorial optimization problems, the traveling salesperson problem, and the graph bisection problem are used for the test bed of our method. Our adaptive strategy showed better results than not only pure and previous hybrid schemes but also existing distance-based mating schemes.
APA, Harvard, Vancouver, ISO, and other styles
9

Nettleton, David F., and Julian Salas. "Approximate Matching of Neighborhood Subgraphs — An Ordered String Graph Levenshtein Method." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 24, no. 03 (June 2016): 411–31. http://dx.doi.org/10.1142/s0218488516500215.

Full text
Abstract:
Given that exact pair-wise graph matching has a high computational cost, different representational schemes and matching methods have been devised in order to make matching more efficient. Such methods include representing the graphs as tree structures, transforming the structures into strings and then calculating the edit distance between those strings. However many coding schemes are complex and are computationally expensive. In this paper, we present a novel coding scheme for unlabeled graphs and perform some empirical experiments to evaluate its precision and cost for the matching of neighborhood subgraphs in online social networks. We call our method OSG-L (Ordered String Graph-Levenshtein). Some key advantages of the pre-processing phase are its simplicity, compactness and lower execution time. Furthermore, our method is able to match both non-isomorphisms (near matches) and isomorphisms (exact matches), also taking into account the degrees of the neighbors, which is adequate for social network graphs.
APA, Harvard, Vancouver, ISO, and other styles
10

Komano, Yuichi, Kazuo Ohta, Kazuo Sakiyama, Mitsugu Iwamoto, and Ingrid Verbauwhede. "Single-Round Pattern Matching Key Generation Using Physically Unclonable Function." Security and Communication Networks 2019 (January 1, 2019): 1–13. http://dx.doi.org/10.1155/2019/1719585.

Full text
Abstract:
Paral and Devadas introduced a simple key generation scheme with a physically unclonable function (PUF) that requires no error correction, e.g., by using a fuzzy extractor. Their scheme, called a pattern matching key generation (PMKG) scheme, is based on pattern matching between auxiliary data, assigned at the enrollment in advance, and a substring of PUF output, to reconstruct a key. The PMKG scheme repeats a round operation, including the pattern matching, to derive a key with high entropy. Later, to enhance the efficiency and security, a circular PMKG (C-PMKG) scheme was proposed. However, multiple round operations in these schemes make them impractical. In this paper, we propose a single-round circular PMKG (SC-PMKG) scheme. Unlike the previous schemes, our scheme invokes the PUF only once. Hence, there is no fear of information leakage by invoking the PUF with the (partially) same input multiple times in different rounds, and, therefore, the security consideration can be simplified. Moreover, we introduce another hash function to generate a check string which ensures the correctness of the key reconstruction. The string enables us not only to defeat manipulation attacks but also to prove the security theoretically. In addition to its simple construction, the SC-PMKG scheme can use a weak PUF like the SRAM-PUF as a building block if our system is properly implemented so that the PUF is directly inaccessible from the outside, and, therefore, it is suitable for tiny devices in the IoT systems. We discuss its security and show its feasibility by simulations and experiments.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Matching Schemes"

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.

Full text
Abstract:
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 field onto the tangent space of the Lie group at $ Theta$, i.e., the Lie algebra, results in a descent/ascent equation for the function. The descent/ascent equation so obtained is used in a classical steepest-descent/ascent algorithm and a singular value decomposition-based recursive method in order to determine the maximum or minimum point of the function under consideration. Since $ Theta$ belongs to the orthogonal group which includes the group of permutations as a subgroup, the proposed procedure works not only for patterns consisting of ordered feature points, but also for the combinatorial problem involving patterns having unordered feature points. Generalizations of the matching problem are also formulated and include the matching of patterns from Euclidean spaces of different dimensions and the matching of patterns having unequal numbers of feature points from the same Euclidean space. Simulations are performed which demonstrate the effectiveness and the efficiency of the proposed approach in solving some practical matching problems which arise in computer vision and pattern analysis.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 this requires the matchmaker to determine the achievement of users' goals without invoking the services. We propose the G+ model to capture the high-level functional specifications of services and users (namely goals, achievement contexts and external behaviors) providing the basis for automated goal achievement determination; also we propose the concepts substitutability graph to capture the application domains' semantics. To avoid the false negatives resulting from adopting existing constraint and behavior matching approaches during service matching, we also propose new constraint and behavior matching approaches to match constraints with different scopes, and behavior models with different number of state transitions. Finally, we propose two correctness-aware matching approaches (direct and aggregate) that semantically match and aggregate semantic web services according to their G+ models, providing the required theoretical proofs and the corresponding verifying simulation experiments.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 a library database, thereby requiring an efficient search mechanism even to search within the local data. To facilitate the information retrieval, an emerging ad hoc standard for uncompressed text is XML which preprocesses the text by putting additional user defined metadata such as DTD or hyperlinks to enable searching with better efficiency and effectiveness. This increases the file size considerably, underscoring the importance of applying text compression. On account of efficiency (in terms of both space and time), there is a need to keep the data in compressed form for as much as possible. Text compression is concerned with techniques for representing the digital text data in alternate representations that takes less space. Not only does it help conserve the storage space for archival and online data, it also helps system performance by requiring less number of secondary storage (disk or CD Rom) accesses and improves the network transmission bandwidth utilization by reducing the transmission time. Unlike static images or video, there is no international standard for text compression, although compressed formats like .zip, .gz, .Z files are increasingly being used. In general, data compression methods are classified as lossless or lossy. Lossless compression allows the original data to be recovered exactly. Although used primarily for text data, lossless compression algorithms are useful in special classes of images such as medical imaging, finger print data, astronomical images and data bases containing mostly vital numerical data, tables and text information. Many lossy algorithms use lossless methods at the final stage of the encoding stage underscoring the importance of lossless methods for both lossy and lossless compression applications. In order to be able to effectively utilize the full potential of compression techniques for the future retrieval systems, we need efficient information retrieval in the compressed domain. This means that techniques must be developed to search the compressed text without decompression or only with partial decompression independent of whether the search is done on the text or on some inversion table corresponding to a set of key words for the text. In this dissertation, we make the following contributions: (1) Star family compression algorithms: We have proposed an approach to develop a reversible transformation that can be applied to a source text that improves existing algorithm's ability to compress. We use a static dictionary to convert the English words into predefined symbol sequences. These transformed sequences create additional context information that is superior to the original text. Thus we achieve some compression at the preprocessing stage. We have a series of transforms which improve the performance. Star transform requires a static dictionary for a certain size. To avoid the considerable complexity of conversion, we employ the ternary tree data structure that efficiently converts the words in the text to the words in the star dictionary in linear time. (2) Exact and approximate pattern matching in Burrows-Wheeler transformed (BWT) files: We proposed a method to extract the useful context information in linear time from the BWT transformed text. The auxiliary arrays obtained from BWT inverse transform brings logarithm search time. Meanwhile, approximate pattern matching can be performed based on the results of exact pattern matching to extract the possible candidate for the approximate pattern matching. Then fast verifying algorithm can be applied to those candidates which could be just small parts of the original text. We present algorithms for both k-mismatch and k-approximate pattern matching in BWT compressed text. A typical compression system based on BWT has Move-to-Front and Huffman coding stages after the transformation. We propose a novel approach to replace the Move-to-Front stage in order to extend compressed domain search capability all the way to the entropy coding stage. A modification to the Move-to-Front makes it possible to randomly access any part of the compressed text without referring to the part before the access point. (3) Modified LZW algorithm that allows random access and partial decoding for the compressed text retrieval: Although many compression algorithms provide good compression ratio and/or time complexity, LZW is the first one studied for the compressed pattern matching because of its simplicity and efficiency. Modifications on LZW algorithm provide the extra advantage for fast random access and partial decoding ability that is especially useful for text retrieval systems. Based on this algorithm, we can provide a dynamic hierarchical semantic structure for the text, so that the text search can be performed on the expected level of granularity. For example, user can choose to retrieve a single line, a paragraph, or a file, etc. that contains the keywords. More importantly, we will show that parallel encoding and decoding algorithm is trivial with the modified LZW. Both encoding and decoding can be performed with multiple processors easily and encoding and decoding process are independent with respect to the number of processors.
Ph.D.
School of Computer Science
Engineering and Computer Science
Computer Science
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 degli effetti dell’adesione a tali contratti sulle scelte produttive e sulle perfomance economiche degli agricoltori in cinque Paesi dell’UE. I risultati indicano un’eterogeneità di questi effetti: in alcuni Paesi i contratti agro-ambientali sembrano essere più efficaci nel promuovere pratiche agricole sostenibili, così come in alcuni Paesi il pagamento compensativo agro-ambientale sembra non essere sufficiente a compensare la perdita di reddito dei partecipanti. Questo studio è stato condotto combinando il Propensity Score Matching con lo stimatore Difference-in-Differences. Il secondo lavoro di ricerca sviluppa una nuova proposta metodologica che incorpora il rischio in un framework di Programmazione Matematica Positiva (PMP). Il modello elaborato presenta caratteri innovativi rispetto alla letteratura sull’argomento e permette di stimare simultaneamente i prezzi ombra delle risorse, la funzione di costo non lineare dell’azienda agricola e un coefficiente di avversione al rischio specifico per ciascuna azienda. Il modello è stato applicato a tre campioni di aziende e i risultati delle stime testano la calibrazione del modello e indicano valori del coefficiente di avversione al rischio coerenti con la letteratura. Infine il modello è stato impiegato nella simulazione di diversi scenari al fine di verificare il ruolo potenziale di un contratto agro-ambientale come strumento di gestione del rischio a diversi livelli di volatilità dei prezzi agricoli.
The increasing attention to the relationship between agriculture and the environment and the rise in price volatility on agricultural markets has led to a new emphasis on agri-environmental policies as well as to a search for new risk management strategies for the farmer. The research objective of this PhD thesis is in line with this challenging context, since it provides an analysis of the EU agri-environmental schemes (AESs) from two viewpoints. First, an ex-post analysis aims at investigating the AESs for their traditional role as measures which encourage sustainable farming while compensating the farmer for the income foregone in five EU Member States. The effects of AESs participation on farmer’s production plans and economic performances differs widely across Member States and in some of them the environmental payment is not enough to compensate the income foregone of participants. This study has been performed by applying a semi-parametric technique which combines a Difference-in-Differences estimator with a Propensity Score Matching estimator. The second piece of research develops a new methodological proposal to incorporate risk into a farm level Positive Mathematical Programming (PMP) model. The model presents some innovations with respect to the previous literature and estimates simultaneously the resource shadow prices, the farm non-linear cost function and a farm-specific coefficient of absolute risk aversion. The proposed model has been applied to three farm samples and the estimation results confirm the calibration ability of the model and show values for risk aversion coefficients consistent with the literature. Finally different scenarios have been simulated to test the potential role of an AES as risk management tool under different scenarios of crop price volatility.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 based matching techniques have been developed independently from each other. The aim of this research project was to design an automated image matching scheme that combines aspects of Feature Based Matching (FBM) and Area Based Matching (ABM). The reason for taking a hybrid approach is to encapsulate only the advantages of each matching scheme while cancelling out the disadvantages. The approach taken was to combine traditional aspects of ABM in digital photogrammetry with image analysis techniques found more commonly in the area of image processing and specifically machine vision.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
Thesis (Ph. D.)--University of Missouri-Columbia, 2006.
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.
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
Abstract:
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 échelle, ces approches ne sont plus pertinentes et sont voire même infaisables à cause du nombre important de schémas et de leur taille (de l'ordre d'un millier d'éléments). Il est donc nécessaire d'automatiser la découverte de correspondances. Cependant, une méthode automatique doit préserver la qualité des correspondances et garantir des performances acceptables si l'on veut qu'elle soit utilisable. Nous avons développé des méthodes qui passent à l'échelle et qui réaliseront une découverte automatique. Nous avons proposé une méthode PORSCHE (Performance ORiented SCHEma Mediation) qui permet d'intégrer plusieurs schémas simultanément et de fournir un schéma médiateur. Cette méthode utilise un algorithme basé sur la fouille d'arbres (tree mining) et a été implémentée et expérimentée sur un grand nombre de schémas disponibles sur le web. Le Web sémantique est fortement dépendant du paradigme XML, qui suit une structure hiérarchique. Par ailleurs, l'utilisation d'ontologie se développe fortement. Nous nous intéressons à la construction d'ontologie à partir de schemas XML disponible sur le web. Nous proposons une approche automatique pour modéliser la sémantique émergente des ontologies. C'est une méthode collaborative pour la construction d'ontologie sans l'interaction directe avec les utilisateurs du domaine, des experts ou des développeurs. Une des caractéristiques très importante d'une ontologie est sa structure hiérarchique des concepts. Nous considérons des grands ensembles de schémas pour un domaine spécifique comme étant des arbres et leur appliquons des algorithmes d'extraction de sous-arbres fréquents pour découvrir des motifs (patterns) hiérarchiques en vue de construire une ontologie. Nous présentons un technique pour découvrir et proposer des correspondances complexes entre deux schemas. Ces correspondances sont ensuite validées à l'aide des mini-taxonomies qui sont les sous-arbres fréquents. La technique démontre une fois de plus la construction de la taxonomie ontologie de domaine. À cet égard, nous considérons le plus grand arbre ou un arbre créé par la fusion de l'ensemble des plus grands souvent sous-arbres comme étant une taxonomie. Nous plaidons en faveur de la confiance d'une telle taxonomie et des concepts associés car elle a été extraite à partir des schémas utilisés dans le domaine spécifié considéré
Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. The dissertation presents a new robust automatic method which integrates a large set of domain specific schemas, represented as tree structures, based upon semantic correspondences among them. The method also creates the mappings from source schemas to the integrated schema. Existing mapping tools employ semi-automatic techniques for mapping two schemas at a time. In a large-scale scenario, where data sharing involves a large number of data sources, such techniques are not suitable. Semi-automatic matching requires user intervention to finalize a certain mapping. Although it provides the flexibilty to compute the best possible mapping but time performance wise abates the whole matching process. At first, the dissertation gives a detail discussion about the state of the art in schema matching. We summarize the deficiencies in the currently available tools and techniques for meeting the requirements of large scale schema matching scenarios. Our approach, PORSCHE (Performance ORiented SCHEma Mediation) is juxtaposed to these shortcomings and its advantages are highlighted with sound experimental support. PORSCHE associated algorithms, first cluster the tree nodes based on linguistic label similarity. Then, it applies a tree mining technique using node ranks calculated during depth-first traversal. This minimises the target node search space and improves time performance, which makes the technique suitable for large scale data sharing. PORSCHE implements a hybrid approach, which also in parallel, incrementally creates an integrated schema encompassing all schema trees, and defines mappings from the contributing schemas to the integrated schema. The approach discovers 1:1 mappings for integration and mediation purposes. Formal experiments on real and synthetic data sets show that PORSCHE is scalable in time performance for large scale scenarios. The quality of mappings and integrity of the integrated schema is also verified by the experimental evaluation. Moreover, we present a technique for discovering complex match (1:n, n:1 and n:m) propositions between two schemas, validated by mini-taxonomies. These mini-taxonomies are extracted from the large set of domain specific metadata instances represented as tree structures. We propose a framework, called ExSTax (Extracting Structurally Coherent Mini-Taxonomies) based on frequent sub-tree mining, to support our idea. We further extend the ExSTax framework for extracting a reliable domain specific taxonomy
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
Abstract:
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 models represented in the standardized PMML format. It is then necessary to map a particular column (attribute) from the dataset (in PMML) to a relevant 'metaattribute' of the BKEF representation. This specific type of schema mapping problem is addressed in my thesis in terms of algorithms for automatic suggestion of mapping of columns to metaattributes and from values of these columns to BKEF 'metafields'. Manual corrections of this mapping by the user are also supported. The implementation is based on the PHP language and then it was tested on datasets with information about courses taught in 5 universities in the U.S.A. from Illinois Semantic Integration Archive. On this datasets, the auto-mapping suggestion process archieved the precision about 70% and recall about 77% on unknown columns, but when mapping the previously user-mapped data (using implemented learning module), the recall is between 90% and 100%.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Matching Schemes"

1

Indonesia. Badan Penelitian dan Pengembangan Perindustrian dan Perdagangan. Industrial technology development project: Loan 3972-Ind : letter of invitation (LOI) for technology services matching grant scheme (dana kemitraan peningkatan teknologi industri-Dapati) management contract. Jakarta: Ministry of Industry and Trade, Agency for Industrial and Trade Research and Development, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Phillips, David A. Implementing the market approach to enterprise support: An evaluation of ten matching grant schemes. World Bank, Europe and Central Asia, Private and Financial Sectors Development Unit, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Phillips, David A. Implementing the Market Approach to Enterprise Support: An Evaluation of Ten Matching Grant Schemes. The World Bank, 2001. http://dx.doi.org/10.1596/1813-9450-2589.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Campbell, John, Joey Huston, and Frank Krauss. QCD to All Orders. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199652747.003.0005.

Full text
Abstract:
This chapter centres around the treatment of QCD emissions to all orders. After introductory remarks about the analytic properties of the radiation pattern, some of the most striking phenomenological consequences of non-trivial quantum effects, in particular, the angular ordering property of QCD, are highlighted. Next, analytic resummation techniques are considered, expanding on the treatment of transverse momentum resummation from Chapter 2, and introducing the idea of threshold resummation. BFKL resummation, which resums large logarithms emerging in the high-energy limit, is also introduced. In the second part of this chapter, the probabilistic simulation of QCD radiation through the parton shower is discussed. After a detailed introduction to different schemes and algorithms, the discussion of the combination of the parton shower with fixed-order matrix elements beyond the Born approximation is considered, with a discussion of matching with NLO calculations and the merging with multijet matrix elements.
APA, Harvard, Vancouver, ISO, and other styles
5

Marshall, Colin. Compassion and Being in Touch. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198809685.003.0005.

Full text
Abstract:
This chapter argues that only compassion can provide the epistemic good of putting an agent in touch with a suffering creature’s pain. The argument proceeds by showing that only compassion satisfies the conditions for being in touch, according to which a subject must experience the suffering creature in a way that reveals the property of pain. To show that compassion can be part of phenomenologically basic experience, the views of René Descartes, Arthur Schopenhauer, and Max Scheler are discussed. Neither propositional knowledge nor accurate imagination, it is argued, are sufficient for an agent to be in touch. This chapter also proposes capturing the motivational structure of pain and compassion in imperatival terms (drawing on recent work in the philosophy of mind), and argues that there is no barrier to states with imperatival content providing epistemic, world-matching goods.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Matching Schemes"

1

Crisafulli, Daniel. "13. Matching grant schemes." In Business Development Services, 176–86. Rugby, Warwickshire, United Kingdom: Practical Action Publishing, 2000. http://dx.doi.org/10.3362/9781780442808.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Klein, Shmuel T. "Improving Static Compression Schemes by Alphabet Extension." In Combinatorial Pattern Matching, 210–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45123-4_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Backofen, Rolf, Danny Hermelin, Gad M. Landau, and Oren Weimann. "Local Alignment of RNA Sequences with Arbitrary Scoring Schemes." In Combinatorial Pattern Matching, 246–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11780441_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Crihalmeanu, Simona, Arun Ross, and Reza Derakhshani. "Enhancement and Registration Schemes for Matching Conjunctival Vasculature." In Advances in Biometrics, 1240–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01793-3_125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Farràs, Oriol, Josep Domingo-Ferrer, and Alberto Blanco-Justicia. "Privacy-Preserving Trust Management Mechanisms from Private Matching Schemes." In Data Privacy Management and Autonomous Spontaneous Security, 390–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54568-9_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Bo, and Henry Johan. "A Comparison Study on Two Multi-scale Shape Matching Schemes." In Advances in Visual Computing, 440–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89646-3_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chantrapornchai, Chantana, and Chidchanok Choksuchat. "Improving Cytogenetic Search with GPUs Using Different String Matching Schemes." In Advanced Data Mining and Applications, 188–202. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49586-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Farooqui, Maria, Ajay Mishra, Nimish Dixit, and A. K. Gupta. "Study of Phase Matching Schemes in PPLN for THz Generation." In Physics of Semiconductor Devices, 803–6. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-03002-9_206.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hangai, Seiichiro, Tomoaki Sano, and Takahiro Yoshida. "A Comparison of Three Kinds of DP Matching Schemes in Verifying Segmental Signatures." In Biometric ID Management and Multimodal Communication, 333–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04391-8_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Riazati, Dariush, and James A. Thom. "Matching Star Schemas." In Lecture Notes in Computer Science, 428–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23091-2_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Matching Schemes"

1

Chen, Hsieh, Hooisweng Ow, and Martin E. Poitzsch. "Optimization of Tracer Injection Schemes for Improved History Matching." In SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/206142-ms.

Full text
Abstract:
Abstract Interwell tracers are powerful reservoir surveillance tools that provide direct reservoir flow paths and dynamics, which, when integrated with near real-time production optimization, can greatly improve recovery factor, and return on investment, the so-called "Advanced Tracers System" (ATS). Applying full field ATS is attractive for resource-holders, especially for those with large waterflood operations. However, to scale up ATS to cover large fields with potentially tens to hundreds of injectors and producers, the required unique tracer variations ("barcodes") and materials and associated analysis may increase rapidly. Here, we explore different tracer injection schemes that can acquire the most information while using reduced numbers of tracers, thereby controlling costs in field operations. We tested the designs of various modified tracer injection schemes with reservoir simulations. Numerical experiments were performed on synthetic fields with multiple injector and producer wells in waterflooding patterns. Two tracer injection schemes were considered: In Scheme 1, all injectors were injected with unique tracers representing the most information-rich case. In Scheme 2, some injectors were injected with the same tracers ("recycling" the same barcodes), and some injectors received no tracer injection ("null" barcodes). Production and tracer breakthrough data was collected for history matching after waterflooding simulations on the synthetic fields. The ensemble smoother with multiple data assimilation with tracers algorithm was used for history matching. We calculated the root-mean-square errors (RMSE) between the reference data and the history matched production simulation data. To improve the statistics, 20 independent testing reference synthetic fields were constructed by randomizing the number and locations of high permeability zones crossing different injectors and producers. In all cases, the history matching algorithms largely reduced the RMSE thereby enhancing reservoir characterization. Analyzing the statistical significance with p-values among testing cases, first, as expected, the data mismatch is highly significantly lower after history matching than before history matching (p &lt; 0.001). Second, the data mismatch is even lower when history matching with tracers (both in Scheme 1 and 2) than without tracers (p &lt; 0.05), demonstrating clearly that tracers can provide extra information for the reservoir dynamics. Finally, and most importantly, history matching with tracers in Scheme 1 or in Scheme 2 result in statistically the same data mismatch (p &gt; 0.05), indicating the cost-saving "recycling" and "null" tracer barcodes can provide equally competent reservoir information. To the best of our knowledge, this is the first study that evaluated the history matching qualities deriving from different tracer injection schemes. We showed that through optimal designs of the tracer injections, we can acquire very similar information with reduced tracer materials and barcodes, thus reducing costs and field operational complexities. We believe this study facilitates the deployment of large-scale reservoir monitoring and optimization campaigns using tracers such as ATS.
APA, Harvard, Vancouver, ISO, and other styles
2

Kleb, Bil, Bram van Leer, and Bill Wood. "Matching Multistage Schemes to Viscous Flow." In 17th AIAA Computational Fluid Dynamics Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2005. http://dx.doi.org/10.2514/6.2005-4708.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dalvi, Nilesh, Vibhor Rastogi, Anirban Dasgupta, Anish Das Sarma, and Tamas Sarlos. "Optimal hashing schemes for entity matching." In the 22nd international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2488388.2488415.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Leimhofer, Gerald, and Andreas Uhl. "Partial Encryption Schemes for Matching Pursuit." In 2007 IEEE International Conference on Signal Processing and Communications. IEEE, 2007. http://dx.doi.org/10.1109/icspc.2007.4728612.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nohara, Yasunobu, Sozo Inoue, Kensuke Baba, and Hiroto Yasuura. "Quantitative evaluation of unlinkable ID matching schemes." In the 2005 ACM workshop. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1102199.1102212.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cheong, P. L. C., and S. D. Morgera. "Matching schemes using the steepest-ascent/descent methods." In [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing. IEEE, 1991. http://dx.doi.org/10.1109/icassp.1991.150784.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gong, Zitong, Francisco Alejandro Díaz De la O, and Michael Beer. "SAMPLING SCHEMES FOR HISTORY MATCHING USING SUBSET SIMULATION." In 1st International Conference on Uncertainty Quantification in Computational Sciences and Engineering. Athens: Institute of Structural Analysis and Antiseismic Research School of Civil Engineering National Technical University of Athens (NTUA) Greece, 2017. http://dx.doi.org/10.7712/120217.5359.16948.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Berland, Julien, Christophe Bogey, and Christophe Bailly. "Optimized Explicit Schemes: Matching and Boundary Schemes, and 4th-order Runge-Kutta Algorithm." In 10th AIAA/CEAS Aeroacoustics Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2004. http://dx.doi.org/10.2514/6.2004-2814.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Thanh, Ta Minh, and Keisuke Tanaka. "Comparison of Watermarking Schemes Using Linear and Nonlinear Feature Matching." In 2015 Seventh International Conference on Knowledge and Systems Engineering (KSE). IEEE, 2015. http://dx.doi.org/10.1109/kse.2015.67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Guan, Ying, Kai H. Luo, and Tong Q. Wang. "Sound Transmission in a Lined Annular Duct With Mean Swirling Flow." In ASME 2008 Noise Control and Acoustics Division Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/ncad2008-73081.

Full text
Abstract:
Sound transmission in a finite-length lined annular duct with mean swirling flow is investigated using mode-matching methods. The main application of this work is the acoustics of aeroengine duct systems, especially the prediction of sound transmission behind a fan/rotor stage where the swirl velocity could be comparable to the axial velocity. First, a spectral collocation technique is used to determine the eigenmodes of three-dimensional linearized Euler equations, then two mode-matching schemes are utilized for calculating the sound transmission in ducts. The two schemes are compared with each other and also with the finite element method. The modified matching scheme is believed to deal with the impedance discontinuity more accurately at the interface. A sound power definition for high frequencies in the presence of mean swirling flow is used for the analysis of sound transmission characteristics. The modified matching scheme is then used to analyze the effect of mean swirling flow on the sound power transmission loss and conduct liner optimization in the impedance plane, compared with the uniform axial mean flow case. Finally, sound attenuation due to inner wall lining, outer wall lining, and combined inner and outer wall lining, respectively, is investigated.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Matching Schemes"

1

Chilton, Sven H. Implementation of an interactive matching scheme for the Kapchinskij-Vladimirskij equations in the WARP code. Office of Scientific and Technical Information (OSTI), January 2008. http://dx.doi.org/10.2172/940580.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chilton, Sven H. Implementation of an iterative matching scheme for the Kapchinskij-Vladimirskij equations in the WARP code. Office of Scientific and Technical Information (OSTI), March 2008. http://dx.doi.org/10.2172/936526.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

McPhedran, R., K. Patel, B. Toombs, P. Menon, M. Patel, J. Disson, K. Porter, A. John, and A. Rayner. Food allergen communication in businesses feasibility trial. Food Standards Agency, March 2021. http://dx.doi.org/10.46756/sci.fsa.tpf160.

Full text
Abstract:
Background: Clear allergen communication in food business operators (FBOs) has been shown to have a positive impact on customers’ perceptions of businesses (Barnett et al., 2013). However, the precise size and nature of this effect is not known: there is a paucity of quantitative evidence in this area, particularly in the form of randomised controlled trials (RCTs). The Food Standards Agency (FSA), in collaboration with Kantar’s Behavioural Practice, conducted a feasibility trial to investigate whether a randomised cluster trial – involving the proactive communication of allergen information at the point of sale in FBOs – is feasible in the United Kingdom (UK). Objectives: The trial sought to establish: ease of recruitments of businesses into trials; customer response rates for in-store outcome surveys; fidelity of intervention delivery by FBO staff; sensitivity of outcome survey measures to change; and appropriateness of the chosen analytical approach. Method: Following a recruitment phase – in which one of fourteen multinational FBOs was successfully recruited – the execution of the feasibility trial involved a quasi-randomised matched-pairs clustered experiment. Each of the FBO’s ten participating branches underwent pair-wise matching, with similarity of branches judged according to four criteria: Food Hygiene Rating Scheme (FHRS) score, average weekly footfall, number of staff and customer satisfaction rating. The allocation ratio for this trial was 1:1: one branch in each pair was assigned to the treatment group by a representative from the FBO, while the other continued to operate in accordance with their standard operating procedure. As a business-based feasibility trial, customers at participating branches throughout the fieldwork period were automatically enrolled in the trial. The trial was single-blind: customers at treatment branches were not aware that they were receiving an intervention. All customers who visited participating branches throughout the fieldwork period were asked to complete a short in-store survey on a tablet affixed in branches. This survey contained four outcome measures which operationalised customers’: perceptions of food safety in the FBO; trust in the FBO; self-reported confidence to ask for allergen information in future visits; and overall satisfaction with their visit. Results: Fieldwork was conducted from the 3 – 20 March 2020, with cessation occurring prematurely due to the closure of outlets following the proliferation of COVID-19. n=177 participants took part in the trial across the ten branches; however, response rates (which ranged between 0.1 - 0.8%) were likely also adversely affected by COVID-19. Intervention fidelity was an issue in this study: while compliance with delivery of the intervention was relatively high in treatment branches (78.9%), erroneous delivery in control branches was also common (46.2%). Survey data were analysed using random-intercept multilevel linear regression models (due to the nesting of customers within branches). Despite the trial’s modest sample size, there was some evidence to suggest that the intervention had a positive effect for those suffering from allergies/intolerances for the ‘trust’ (β = 1.288, p<0.01) and ‘satisfaction’ (β = 0.945, p<0.01) outcome variables. Due to singularity within the fitted linear models, hierarchical Bayes models were used to corroborate the size of these interactions. Conclusions: The results of this trial suggest that a fully powered clustered RCT would likely be feasible in the UK. In this case, the primary challenge in the execution of the trial was the recruitment of FBOs: despite high levels of initial interest from four chains, only one took part. However, it is likely that the proliferation of COVID-19 adversely impacted chain participation – two other FBOs withdrew during branch eligibility assessment and selection, citing COVID-19 as a barrier. COVID-19 also likely lowered the on-site survey response rate: a significant negative Pearson correlation was observed between daily survey completions and COVID-19 cases in the UK, highlighting a likely relationship between the two. Limitations: The trial was quasi-random: selection of branches, pair matching and allocation to treatment/control groups were not systematically conducted. These processes were undertaken by a representative from the FBO’s Safety and Quality Assurance team (with oversight from Kantar representatives on pair matching), as a result of the chain’s internal operational restrictions.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Matching Schemes' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography