Academic literature on the topic 'Exact match'

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 'Exact match.'

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 "Exact match"

1

Fay, Michael P. "Confidence intervals that match Fisher's exact or Blaker's exact tests." Biostatistics 11, no. 2 (2009): 373–74. http://dx.doi.org/10.1093/biostatistics/kxp050.

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

Pontarelli, Salvatore, Pedro Reviriego, and Michael Mitzenmacher. "EMOMA: Exact Match in One Memory Access." IEEE Transactions on Knowledge and Data Engineering 30, no. 11 (2018): 2120–33. http://dx.doi.org/10.1109/tkde.2018.2818716.

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

Jalaleddine, Sateh M. "Associative Memories and Processors: The Exact Match Paradigm." Journal of King Saud University - Computer and Information Sciences 11 (1999): 45–67. http://dx.doi.org/10.1016/s1319-1578(99)80003-2.

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

Heidinger, Clemens, Klemens Böhm, Erik Buchmann, and Martin Spoo. "Efficient and secure exact-match queries in outsourced databases." World Wide Web 18, no. 3 (2013): 567–605. http://dx.doi.org/10.1007/s11280-013-0270-0.

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

Liu, Yongchao, and Bertil Schmidt. "Long read alignment based on maximal exact match seeds." Bioinformatics 28, no. 18 (2012): i318—i324. http://dx.doi.org/10.1093/bioinformatics/bts414.

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

Yang, Jialun, Tao Li, Jinli Yan, Junnan Li, Chenglong Li, and Baosheng Wang. "PipeCache: High Hit Rate Rule-Caching Scheme Based on Multi-Stage Cache Tables." Electronics 9, no. 6 (2020): 999. http://dx.doi.org/10.3390/electronics9060999.

Full text
Abstract:
OpenFlow switches hardware cannot store all the OpenFlow rules due to a limited resource. The rule-caching scheme is one of the best solutions to solve the hardware size limitation. In OpenFlow switches, Multiple Flow Tables (MFTs) provide more flexible flow control than a single table. Exact match and wildcard match are two typical matching methods. The exact match applies to a single flow table and multiple flow tables, but the performance is low under frequently changing traffic. Many commodity switches use Ternary Content Addressable Memory (TCAM) to support fast wildcard lookups. Earlier
APA, Harvard, Vancouver, ISO, and other styles
7

Logvinenko, Alexander D., and Rumi Tokunaga. "Colour Constancy as Measured by Least Dissimilar Matching." Seeing and Perceiving 24, no. 5 (2011): 407–52. http://dx.doi.org/10.1163/187847511x588746.

Full text
Abstract:
AbstractAlthough asymmetric colour matching has been widely used in experiments on colour constancy, an exact colour match between objects lit by different chromatic lights is impossible to achieve. We used a modification of this technique, instructing our observers to establish the least dissimilar pair of differently illuminated coloured papers. The stimulus display consisted of two identical sets of 22 Munsell papers illuminated independently by neutral, yellow, blue, green and red lights. The lights produced approximately the same illuminance. Four trichromatic observers participated in th
APA, Harvard, Vancouver, ISO, and other styles
8

Rony Sina, Derwin, and Agus Harjoko. "Deteksi Copy Move Forgery Pada Citra Menggunakan Exact Match, DWT Haar dan Daubechies." IJEIS (Indonesian Journal of Electronics and Instrumentation Systems) 6, no. 1 (2016): 25. http://dx.doi.org/10.22146/ijeis.10768.

Full text
Abstract:
AbstrakCopy-Move Forgery adalah satu tipe gangguan citra digital, di mana bagian dari citra dicopy dan dipastekan ke bagian lain dalam citra yang sama untuk menutupi fitur citra yang penting. Pada penelitian ini, dibangun sistem pendeteksi copy move forgery pada citra. Sistem ini dimaksudkan untuk membantu user mengetahui bahwa suatu citra masih asli atau sudah terdapat copy move dan dibagian mana terjadinya copy move tersebut. Sistem ini dibangun dengan menggunakan metode Exact Match, DWT Haar, DWT DB2 dan DWT DB4 dengan menggunakan blok 4 x 4, 8 x 8 dan 16 x 16. Masukan dari sistem ini berup
APA, Harvard, Vancouver, ISO, and other styles
9

Chang, Chin-Chen, and Tzong-Chen Wu. "An exact match retrieval scheme based upon principal component analysis." Pattern Recognition Letters 16, no. 5 (1995): 465–70. http://dx.doi.org/10.1016/0167-8655(95)00002-x.

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

ROBBINS, R. S., B. R. PERRI, S. D. AHUJA, et al. "Exploring genotype concordance in epidemiologically linked cases of tuberculosis in New York City." Epidemiology and Infection 145, no. 3 (2016): 503–14. http://dx.doi.org/10.1017/s0950268816002399.

Full text
Abstract:
SUMMARYComparing genotype results of tuberculosis (TB) isolates from individuals diagnosed with TB can support or refute transmission; however, these conclusions are based upon the criteria used to define a genotype match. We used a genotype-match definition which allowed for variation in IS6110restriction fragment length polymorphism (RFLP) to support transmission between epidemiologically linked persons. Contacts of individuals with infectious TB (index cases) diagnosed in New York City from 1997 to 2003 who subsequently developed TB (contact cases) from 1997 to 2007 were identified. For eac
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Exact match"

1

Crépeau, Emmanuelle. "Contrôlabilité exacte d'équations dispersives issues de la mécanique." Phd thesis, Université Paris Sud - Paris XI, 2002. http://tel.archives-ouvertes.fr/tel-00003637.

Full text
Abstract:
Le sujet principal de cette thèse est l'étude de la contrôlabilité exacte de deux équations dispersives, l'équation de Korteweg-de Vries et la "bonne" équation de Boussinesq. En ce qui concerne l'équation de Korteweg-de Vrie, on étend un résultat de Rosier en montrant la contrôlabilité exacte en tout temps de l'équation non linéaire autour d'une solution stationnaire proche de zéro mais non nulle, ce pour des longueurs de domaine spatial critiques. Cette démonstration utilise en particulier la méthode d'unicité hilbertienne couplée avec la méthode des multiplicateurs et un théorème de point fi
APA, Harvard, Vancouver, ISO, and other styles
2

Sbihi, Abdelkader. "Les Méthodes Hybrides en Optimisation Combinatoire :Algorithmes Exacts et Heuristiques." Phd thesis, Université Panthéon-Sorbonne - Paris I, 2003. http://tel.archives-ouvertes.fr/tel-00012188.

Full text
Abstract:
La thèse se situe dans le domaine de l'optimisation combinatoire, en particulier celui de la<br />modélisation et de la résolution algorithmique. Dans cette thèse, nous étudions deux variantes<br />NP-difficiles de problèmes de type sac-à-dos. Plus précisément, nous traitons le problème de<br />la distribution équitable (le Knapsack Sharing Problem : KSP) et le problème du sac-à-dos<br />généralisé à choix multiple (le Multiple-choice Multidimensional Knapasck Problem : MMKP).<br />Dans la première partie de cette thèse, nous nous intéressons au développement d'algorithmes<br />approchés pour
APA, Harvard, Vancouver, ISO, and other styles
3

Sène, Abdou. "Modélisation asymptotique de plaques : contrôlabilité exacte frontière, piézoélectricité." Phd thesis, Université Joseph Fourier (Grenoble), 1999. http://tel.archives-ouvertes.fr/tel-00004849.

Full text
Abstract:
Le mémoire est consacré à divers aspects de la modélisation de plaques : contrôlabilité frontière de structures bidimensionnelles et construction de modèles de plaques piézoélectriques, en relation avec des situations technologiques d'actualité, puis étude de singularités. Dans le premier chapitre on obtient un résultat de contrôlabilité exacte frontière pour une plaque élastique bidimensionnelle. On résout d'abord le problème de contrôlabilité exacte pour une plaque tridimensionnelle d'épaisseur h en controlant uniquement l'intérieur et la frontière latérale de la plaque ; le choix effectué d
APA, Harvard, Vancouver, ISO, and other styles
4

Bertin, Karine. "Estimation asymptotiquement exacte en norme sup de fonctions multidimensionnelles." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2004. http://tel.archives-ouvertes.fr/tel-00008028.

Full text
Abstract:
On étudie deux modèles statistiques: le modèle de régression à pas aléatoire et le modèle de bruit blanc gaussien. Dans ces modèles, le but est d'estimer en norme sup une fonction f inconnue, à partir des observations, en supposant que f appartient à une classe de Holder. Dans le modèle de régression, pour l'estimation d'une fonction unidimensionnelle, on obtient la constante exacte et un estimateur asymptotiquement exact. Dans le modèle de bruit blanc, on s'intéresse à l'estimation sur deux classes de fonctions multidimensionnelles anisotropes dont une est une classe additive. Pour ces deux c
APA, Harvard, Vancouver, ISO, and other styles
5

Laanaia, Nabil. "Etude de quelques problèmes de contrôlabilité exacte, de contrôle optimal et de stabilisation pour des domaines minces à frontières ondulées." Phd thesis, Université de Metz, 2001. http://tel.archives-ouvertes.fr/tel-00001188.

Full text
Abstract:
Cette thèse est consacrée à l'étude de quelques problèmes de contrôlabilité exacte, de contrôle optimal et de stabilisation dans un domaine tridimensionnel de faible épaisseur à frontière ondulée. On étudie aussi le comportement asymptotique correspondant à chaque problème lorsque l'épaisseur tend vers zéro. Dans une première partie, on montre à l'aide de multiplicateurs adaptés au domaine, la contrôlabilité exacte pour l'équation des ondes en agissant avec un contrôle de Dirichlet sur une partie de la frontière latérale et un contrôle de Neumann sur la frontière supérieure et inférieure. On c
APA, Harvard, Vancouver, ISO, and other styles
6

Garaix, Thierry. "Étude et résolution exacte de problèmes de transport à la demande avec qualité de service." Phd thesis, Université d'Avignon, 2007. http://tel.archives-ouvertes.fr/tel-00534894.

Full text
Abstract:
Nous étudions dans cette thèse un problème de construction de tournées de véhicules pour le transport de personnes à la demande (TAD) qui, combinant la souplesse des taxis à la capacité de regroupement des transports en commun, est une voie pour repenser nos pratiques en terme de mobilité. Après avoir défini puis classé plusieurs critères de qualité de service, nous en sélectionnons trois pour leur représentativité : la minimisation de la distance totale parcourue, la maximisation du taux de remplissage des véhicules et la minimisation du temps perdu en transport. La méthode d'optimisation uti
APA, Harvard, Vancouver, ISO, and other styles
7

Sbai, Mohamed. "Modélisation de la dépendance et simulation de processus en finance." Phd thesis, Université Paris-Est, 2009. http://tel.archives-ouvertes.fr/tel-00451008.

Full text
Abstract:
La première partie de cette thèse est consacrée aux méthodes numériques pour la simulation de processus aléatoires définis par des équations différentielles stochastiques (EDS). Nous commençons par l'étude de l'algorithme de Beskos et al. [13] qui permet de simuler exactement les trajectoires d'un processus solution d'une EDS en dimension 1. Nous en proposons une extension à des fins de calcul exact d'espérances et nous étudions l'application de ces idées à l'évaluation du prix d'options asiatiques dans le modèle de Black & Scholes. Nous nous intéressons ensuite aux schémas numériques. Dans le
APA, Harvard, Vancouver, ISO, and other styles
8

Bontoux, Boris. "Techniques hybrides de recherche exacte et approchée : application à des problèmes de transport." Phd thesis, Université d'Avignon, 2008. http://tel.archives-ouvertes.fr/tel-00459367.

Full text
Abstract:
Nous nous intéressons dans cette thèse aux possibilités d'hybridation entre les méthodes exactes et les méthodes heuristiques afin de pouvoir tirer avantage de chacune des deux approches : optimalité de la résolution exacte, caractère moins déterministe et rapidité de la composante heuristique. Dans l'objectif de résoudre des problèmes NPdifficiles de taille relativement importante tels que les problèmes de transports, nous nous intéressons dans les deux dernières parties de ce mémoire à la conception de méthodes incomplètes basées sur ces hybridations. Dans la première partie, nous allons nou
APA, Harvard, Vancouver, ISO, and other styles
9

Gaiffas, Stéphane. "Régression non-paramétrique et information spatialement inhomogène." Phd thesis, Université Paris-Diderot - Paris VII, 2005. http://tel.archives-ouvertes.fr/tel-00011261.

Full text
Abstract:
Nous étudions l'estimation non-paramétrique d'un signal à partir de<br />données bruitées spatialement inhomogènes (données dont la quantité<br />varie sur le domaine d'estimation). Le prototype d'étude est le modèle<br />de régression avec design aléatoire. Notre objectif est de comprendre<br />les conséquences du caractère inhomogène des données sur le problème<br />d'estimation dans le cadre d'étude minimax. Nous adoptons deux points<br />de vue : local et global. Du point de vue local, nous nous intéressons<br />à l'estimation de la régression en un point avec peu ou beaucoup de<br />donné
APA, Harvard, Vancouver, ISO, and other styles
10

Mazoit, Frédéric. "Décomposition algorithmique des graphes." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2004. http://tel.archives-ouvertes.fr/tel-00148807.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à deux types de décompositions des graphes introduits par Robertson et Seymour: les décompositions arborescentes et les décompositions en branches. À ces décompositions sont associés deux paramètres des graphes: la largeur arborescente et la largeur de branches. Nous montrons que ces deux décompositions peuvent être vues comme issues d'une même structure combinatoire; les deux paramètres mentionné ci-dessus sont égaux aux valeurs minimales de deux paramètres de cette structure commune. En poussant plus avant cette analogie, nous montrons comment adapter
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Exact match"

1

Crouch, Holmes F. Capital Gains & Losses: How to "Exact Match" Your Broker Reportings, Revamp Your Cost Basis, & Optimize the 15% Tax Rate on Long-term Gains (Series 200: Investors & Businesses). Allyeartax Guides, 2006.

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

Exact Path Diagnostic Assessment - Math. Edmentum, Inc., 2024.

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

Johnes, Martin, and Bob Nicholson. Sport History and Digital Archives in Practice. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252038938.003.0003.

Full text
Abstract:
This chapter identifies the limitations of the digitization of newspapers—one of the most popular resources for sport historians. First, copyright restricts the scope of digitization of some twentieth-century newspapers and periodicals. Second, digitization is compromised when the quality of newspaper print affects the ability to scan accurately and when scanning software confuses letters in texts using old fonts. Finally, searching by scanning software relies on an exact match between the keyword selected by the researcher and the description used by the journalist. Nevertheless, digital arch
APA, Harvard, Vancouver, ISO, and other styles
4

Adelstein, Richard. Crime and Punishment. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190694272.003.0010.

Full text
Abstract:
This chapter elaborates the operation of criminal liability by closely considering efficient crimes and the law’s stance toward them, shows how its commitment to proportional punishment prevents the probability scaling that systemically efficient allocation requires, and discusses the procedures that determine the actual liability prices imposed on offenders. Efficient crimes are effectively encouraged by proportional punishment, and their nature and implications are examined. But proportional punishment precludes probability scaling, and induces far more than the systemically efficient number
APA, Harvard, Vancouver, ISO, and other styles
5

Steward, David R. Analytic Element Method. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198856788.001.0001.

Full text
Abstract:
The Analytic Element Method provides a foundation to solve boundary value problems commonly encountered in engineering and science. The goals are: to introduce readers to the basic principles of the AEM, to provide a template for those interested in pursuing these methods, and to empower readers to extend the AEM paradigm to an even broader range of problems. A comprehensive paradigm: place an element within its landscape, formulate its interactions with other elements using linear series of influence functions, and then solve for its coefficients to match its boundary and interface conditions
APA, Harvard, Vancouver, ISO, and other styles
6

Gomez, Jeff. Math Rock. Bloomsbury Publishing Inc, 2024. http://dx.doi.org/10.5040/9798765103401.

Full text
Abstract:
Math rock sounds like blueprints look: exact, precise, architectural. This trance-like progressive metal music with indie rock and jazz influences has been captivating and challenging listeners for decades. Bands associated with the genre include King Crimson, Black Flag, Don Caballero, Slint, American Football, Toe, Elephant Gym, Covet, and thousands more. In an online age of bedroom producers and sampled beats and loops, math rock is music that is absolutely and resolutely played: men and woman in rooms with instruments creating chaos, beauty, and beautiful chaos. This is the first book-leng
APA, Harvard, Vancouver, ISO, and other styles
7

Mathai, A. M. Distributions of Test Statistics: Exact Asymptotic, Null and Non-Null, Methods-Comparisons-Research Frontiers (Math & Mngnt Sciences Ser. : Vol. 18). American Sciences Press, Inc., 1989.

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

Tracing Letters, Numbers and Drawing Activities: Preschool Workbook - Ages 3 to 5, Colors, Shapes, Numbers, Early Math, Pre-Writing, Phonics Count and Color the Exact Number of Farm Animals, Following Directions, and More. Independently Published, 2022.

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

Contributors, Multiple. Exact Copy of the Poll Taken at the Guild-Hall in the Borough of Leicester, ... from March 22d. to April 6th. 1768. for Electing Two Burgesses to Represent the Said Borough in the Ensuing Parliament. Creative Media Partners, LLC, 2018.

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

Noyes, Benjamin Lake 1870-1945. Exact Transcription of the First Church Records of the First Congo Church of Deer Island: Baptisms, 1785-1853, Marriages, 1785-1818, As I Find Them at This Date, March 1906, with Annotations, Corrections, Explanations and Additions. Creative Media Partners, LLC, 2021.

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

Book chapters on the topic "Exact match"

1

Fan, Zhen, Luyu Gao, Rohan Jha, and Jamie Callan. "COILcr: Efficient Semantic Matching in Contextualized Exact Match Retrieval." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-28244-7_19.

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

Sormunen, Eero. "A Retrospective Evaluation Method for Exact-Match and Best-Match Queries Applying an Interactive Query Performance Analyser." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45886-7_22.

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

Chang, Ye-In, Chen-Chang Wu, and Ching-I. Wang. "Spatial Exact Match Query Based on the NA-Tree Approach in P2P Systems." In Next-Generation Applied Intelligence. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02568-6_42.

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

Oussaidene, Smail, Lynda Said Lhadj, and Mohand Boughanem. "MarkedDPR: Enhancing Dense Passage Retrieval with Exact Match Signals and Synthetic Data Augmentation." In Lecture Notes in Computer Science. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-96-0579-8_4.

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

Ulm, Eric R. "An Overview of Exact Solution Methods for Guaranteed Minimum Death Benefit Options in Variable Annuities." In Proceedings of the Forum "Math-for-Industry" 2018. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-5576-0_3.

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

Heule, Marijn J. H., and Manfred Scheucher. "Happy Ending: An Empty Hexagon in Every Set of 30 Points." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57246-3_5.

Full text
Abstract:
AbstractSatisfiability solving has been used to tackle a range of long-standing open math problems in recent years. We add another success by solving a geometry problem that originated a century ago. In the 1930s, Esther Klein’s exploration of unavoidable shapes in planar point sets in general position showed that every set of five points includes four points in convex position. For a long time, it was open if an empty hexagon, i.e., six points in convex position without a point inside, can be avoided. In 2006, Gerken and Nicolás independently proved that the answer is no. We establish the exact bound: Every 30-point set in the plane in general position contains an empty hexagon. Our key contributions include an effective, compact encoding and a search-space partitioning strategy enabling linear-time speedups even when using thousands of cores.
APA, Harvard, Vancouver, ISO, and other styles
7

Varghese, George. "Exact-Match Lookups." In Network Algorithmics. Elsevier, 2005. http://dx.doi.org/10.1016/b978-012088477-3/50013-8.

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

Varghese, George, and Jun Xu. "Exact-match lookups." In Network Algorithmics. Elsevier, 2022. http://dx.doi.org/10.1016/b978-0-12-809927-8.00017-8.

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

Huh, Sookyung. "Comparative Analysis of ChatGPT-4 for Automated Mapping of Local Medical Terminologies to SNOMED CT." In Studies in Health Technology and Informatics. IOS Press, 2025. https://doi.org/10.3233/shti250472.

Full text
Abstract:
Standardizing medical terminology is critical for healthcare informatics, particularly for improving data interoperability and patient management systems. This study evaluated four distinct GPT-4-based approaches for mapping local medical terminologies to SNOMED CT: baseline, prompt-engineered, fine-tuned, and Retrieval-Augmented Generation (RAG). Using 1,200 diagnostic terms from a Korean hospital, we assessed the models’ accuracy and error rates. The RAG model achieved the highest performance with a 96.2% valid SNOMED CT term match rate and a 57.6% overall exact match rate, surpassing the fine-tuned model (69.2% valid term match, 47.2% exact match). Error analysis showed that the RAG model also minimized structural errors to 14%, significantly lower than other models. While the fine-tuned and RAG models struggled with specificity, they showed promise for improving automated mapping and Named Entity Recognition (NER) tasks in clinical settings. This study highlights the potential of AI-human collaboration for enhancing autocoding and data standardization in healthcare. Further research is needed to refine specificity and validate these systems for clinical use.
APA, Harvard, Vancouver, ISO, and other styles
10

Grouin Cyril and Zweigenbaum Pierre. "Automatic De-Identification of French Clinical Records: Comparison of Rule-Based and Machine-Learning Approaches." In Studies in Health Technology and Informatics. IOS Press, 2013. https://doi.org/10.3233/978-1-61499-289-9-476.

Full text
Abstract:
In this paper, we present a comparison of two approaches to automatically de-identify medical records written in French: a rule-based system and a machine-learning based system using a conditional random fields (CRF) formalism. Both systems have been designed to process nine identifiers in a corpus of medical records in cardiology. We performed two evaluations: first, on 62 documents in cardiology, and on 10 documents in foetopathology &amp;ndash; produced by optical character recognition (OCR) &amp;ndash; to evaluate the robustness of our systems. We achieved a 0.843 (rule-based) and 0.883 (machine-learning) exact match overall F-measure in cardiology. While the rule-based system allowed us to achieve good results on nominative (first and last names) and numerical data (dates, phone numbers, and zip codes), the machine-learning approach performed best on more complex categories (postal addresses, hospital names, medical devices, and towns). On the foetopathology corpus, although our systems have not been designed for this corpus and despite OCR character recognition errors, we obtained promising results: a 0.681 (rule-based) and 0.638 (machine-learning) exact-match overall F-measure. This demonstrates that existing tools can be applied to process new documents of lower quality.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Exact match"

1

Fane, Enfa, Md Nayem Uddin, Oghenevovwe Ikumariegbe, Daniyal Kashif, Eduardo Blanco, and Steven Corman. "BEMEAE: Moving Beyond Exact Span Match for Event Argument Extraction." In Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). Association for Computational Linguistics, 2025. https://doi.org/10.18653/v1/2025.naacl-long.295.

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

Atac, Meryem, and Altan Kayran. "Comparative Study of Finite Element Analysis and Geometrically Exact Beam Analysis of a Composite Helicopter Blade." In Vertical Flight Society 72nd Annual Forum & Technology Display. The Vertical Flight Society, 2016. http://dx.doi.org/10.4050/f-0072-2016-11536.

Full text
Abstract:
In this paper, comparative study of the finite element analysis and geometrically exact beam analysis of a composite helicopter blade is performed. The objective of this study is to investigate the applicability of the geometrically exact beam analysis of the composite helicopter blade in predicting the structural response of the composite blade. To evaluate the structural response determined by the geometrically exact beam analysis of the composite blade, detailed finite element model of the blade is prepared and the structural response of two methods are compared for different static and tra
APA, Harvard, Vancouver, ISO, and other styles
3

Manjhi, Ashish, Umberto Saetti, and Joseph Horn. "Analytical Linearization of a State-Space Free Vortex Wake Model." In Vertical Flight Society 80th Annual Forum & Technology Display. The Vertical Flight Society, 2024. http://dx.doi.org/10.4050/f-0080-2024-1254.

Full text
Abstract:
This paper presents the development and application of analytical linearization of a State-Space Free Vortex Wake Model. Previous work developed a state-space free wake model that could be numerically linearized via finite differences into a Linear Time Periodic (LTP) system, but the numerical linearization process was computationally expensive. An improved method is developed that uses exact analytical linearization of the Biot-Savart Law. The analytical method is found to speed up linearization computations by O(N), where N is the number of free wake nodes. A simple decoupled wake model is u
APA, Harvard, Vancouver, ISO, and other styles
4

Ingber, Amir, Thomas Courtade, and Tsachy Weissman. "Compression for exact match identification." In 2013 IEEE International Symposium on Information Theory (ISIT). IEEE, 2013. http://dx.doi.org/10.1109/isit.2013.6620307.

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

Boinski, Tomasz, Julian Szymanski, and Tymoteusz Cejrowski. "Exact-match Based Wikipedia-WordNet Integration." In 2019 IEEE International Symposium on INnovations in Intelligent SysTems and Applications (INISTA). IEEE, 2019. http://dx.doi.org/10.1109/inista.2019.8778336.

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

Nelson, Chad, Kevin Townsend, Bhavani Satyanarayana Rao, Phillip Jones, and Joseph Zambreno. "Shepard: A fast exact match short read aligner." In 2012 10th IEEE/ACM International Conference on Formal Methods and Models for Codesign (MEMOCODE 2012). IEEE, 2012. http://dx.doi.org/10.1109/memcod.2012.6292304.

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

Halachev, Mihail, Nematollaah Shiri, and Anand Thamildurai. "Exact match search in sequence data using suffix trees." In the 14th ACM international conference. ACM Press, 2005. http://dx.doi.org/10.1145/1099554.1099579.

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

Goodwin, Morten. "A solution to the exact match on rare item searches." In the International Conference. ACM Press, 2011. http://dx.doi.org/10.1145/1988688.1988734.

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

Gao, Luyu, Zhuyun Dai, and Jamie Callan. "COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List." In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.naacl-main.241.

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

Liu, Quan, Isabella M. Gaeta, Bryan A. Millis, Matthew J. Tyska, and Yuankai Huo. "GAN based unsupervised segmentation: should we match the exact number of objects." In Image Processing, edited by Bennett A. Landman and Ivana Išgum. SPIE, 2021. http://dx.doi.org/10.1117/12.2580671.

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

Reports on the topic "Exact match"

1

Fourth national report on human exposure to environmental chemicals. Updated tables, March 2021 : volume two: NHANES 2011-2016. National Center for Environmental Health (U.S.), 2021. http://dx.doi.org/10.15620/105345.

Full text
Abstract:
"The Fourth National Report on Human Exposure to Environmental Chemicals: Updated Tables, March 2021 (the Updated Tables, March 2021) presents nationally representative, cumulative biomonitoring data gathered from 1999–2000 through 2015–2016. It includes all the data from each of the previous National Reports on Human Exposure to Environmental Chemicals and each of the previous Updated Tables (collectively, the Report and Updated Tables). In each survey period, the reported chemicals or their metabolites were measured in blood, serum, and urine samples from random subsamples of the National He
APA, Harvard, Vancouver, ISO, and other styles
2

Fourth national report on human exposure to environmental chemicals. National Center for Environmental Health, 2021. http://dx.doi.org/10.15620/cdc:105345.

Full text
Abstract:
"The Updated Tables, March 2021) presents nationally representative, cumulative biomonitoring data gathered from 1999–2000 through 2015–2016. It includes all the data from each of the previous National Reports on Human Exposure to Environmental Chemicals and each of the previous Updated Tables (collectively, the Report and Updated Tables). In each survey period, the reported chemicals or their metabolites were measured in blood, serum, and urine samples from random subsamples of the National Health and Nutrition Examination Survey (NHANES). These subsamples typically consisted of about 2,500 p
APA, Harvard, Vancouver, ISO, and other styles
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!