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 a
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
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
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
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 VC
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 optimiza
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 neigh
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,
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 f
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 th
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
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 de
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
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.<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.
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
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 model
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.
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 age
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 assoc
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 ea
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 a
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