Log in

Relevant bibliographies by topics / String algorithms

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'String algorithms'

Author: Grafiati

Published: 11 March 2023

Last updated: 25 July 2025

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 'String algorithms.'

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 "String algorithms"

1

Bhagya Sri, Mukku, Rachita Bhavsar, and Preeti Narooka. "String Matching Algorithms." International Journal Of Engineering And Computer Science 7, no. 03 (2018): 23769–72. http://dx.doi.org/10.18535/ijecs/v7i3.19.

Full text

Abstract:

To analyze the content of the documents, the various pattern matching algorithms are used to find all the occurrences of a limited set of patterns within an input text or input document. In order to perform this task, this research work used four existing string matching algorithms; they are Brute Force algorithm, Knuth-Morris-Pratt algorithm (KMP), Boyer Moore algorithm and Rabin Karp algorithm. This work also proposes three new string matching algorithms. They are Enhanced Boyer Moore algorithm, Enhanced Rabin Karp algorithm and Enhanced Knuth-Morris-Pratt algorithm. Findings: For expe

APA, Harvard, Vancouver, ISO, and other styles

2

Zhang, Zhaoyang. "Review on String-Matching Algorithm." SHS Web of Conferences 144 (2022): 03018. http://dx.doi.org/10.1051/shsconf/202214403018.

Full text

Abstract:

String-matching algorithm is one of the most researched algorithms in computer science which has become an important factor in many technologies. This field aims at utilizing the least time and resources to find desired sequence of character in complex data content. The most classical and famous string-search algorithms are Knuth-Morris-Pratt (KMP) algorithm and Boyer-Moore (DM) algorithm. These two algorithms provide efficient heuristic jump rules by prefix or suffix. Bitap algorithm was the first to introduce bit-parallelism into string-matching field. Backward Non-Deterministic DAWG Matchin

APA, Harvard, Vancouver, ISO, and other styles

3

Franek, Frantisek, and Michael Liut. "Computing Maximal Lyndon Substrings of a String." Algorithms 13, no. 11 (2020): 294. http://dx.doi.org/10.3390/a13110294.

Full text

Abstract:

There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal Lyndon substrings of the input string, and secondly, Franek et al. showed in 2017 a linear equivalence of sorting suffixes and sorting right-maximal Lyndon substrings of a string, inspired by a novel suffix sorting algorithm of Baier. In 2016, Franek et al. presented a brief overview of algorithms for computing the Lyndon array that encodes the k

APA, Harvard, Vancouver, ISO, and other styles

4

Latorre, Omar. "Exact and kernelization algorithms for Closet String." Selecciones Matemáticas 7, no. 2 (2020): 257–66. http://dx.doi.org/10.17268/sel.mat.2020.02.08.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Khadiev, Kamil, Artem Ilikaev, and Jevgenijs Vihrovs. "Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator." Mathematics 10, no. 3 (2022): 377. http://dx.doi.org/10.3390/math10030377.

Full text

Abstract:

We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”. We construct quantum algorithms that are faster than classical (randomized or deterministic) counterparts for each of these problems. The quantum algorithms are based on the quantum procedure for comparing two strings of length k in O(k) queries. The first problem is sorting n strings of length k. We show that classical complexity of the problem is Θ(nk) for constant size alphabet, but our qua

APA, Harvard, Vancouver, ISO, and other styles

6

Jantan, Hamidah, and Nurul Aisyiah Baharudin. "Mobile-Based Word Matching Detection using Intelligent Predictive Algorithm." International Journal of Interactive Mobile Technologies (iJIM) 13, no. 09 (2019): 140. http://dx.doi.org/10.3991/ijim.v13i09.10848.

Full text

Abstract:

Word matching is a string searching technique for information retrieval in Natural Language Processing (NLP). There are several algorithms have been used for string search and matching such as Knuth Morris Pratt, Boyer Moore, Horspool, Intelligent Predictive and many other. However, there some issues need to be considered in measuring the performance of the algorithms such as the efficiency for searching small alphabets, time taken in processing the pattern of the text and extra space to support a huge table or state machines. Intelligent Predictive (IP) algorithm capable to solve several word

APA, Harvard, Vancouver, ISO, and other styles

7

Nguyen, Van Truong, and Xuan Hoai Nguyen. "A Novel Negative Selection Algorithm with Optimal Worst-case Training Time Complexity for R-chunk Detectors." Indian Journal of Science and Technology 13, no. 10 (2020): 1160–71. https://doi.org/10.17485/ijst/2020/v13i10/149803.

Full text

Abstract:

Abstract <strong>Objectives:</strong> To generate complete and non-redundant detector set with optimal worst-case time complexity. <strong>Methods:</strong> In this study, a novel exact matching and string-based Negative Selection Algorithm utilizing r-chunk detectors is proposed. Improved algorithms are tested on some data sets; the experiments’ results are compared with recently published ones. Moreover, algorithms’ complexities are also proved mathematically. <strong>Findings:</strong> For string-based Artificial Immune Systems, r-chunk detector is the most common

APA, Harvard, Vancouver, ISO, and other styles

8

Lasch, Robert, Ismail Oukid, Roman Dementiev, Norman May, Suleyman S. Demirsoy, and Kai-Uwe Sattler. "Faster & strong: string dictionary compression using sampling and fast vectorized decompression." VLDB Journal 29, no. 6 (2020): 1263–85. http://dx.doi.org/10.1007/s00778-020-00620-x.

Full text

Abstract:

AbstractString dictionaries constitute a large portion of the memory footprint of database applications. While strong string dictionary compression algorithms exist, these come with impractical access and compression times. Therefore, lightweight algorithms such as front coding (PFC) are favored in practice. This paper endeavors to make strong string dictionary compression practical. We focus on Re-Pair Front Coding (RPFC), a grammar-based compression algorithm, since it consistently offers better compression ratios than other algorithms in the literature. To accelerate compression times, we p

APA, Harvard, Vancouver, ISO, and other styles

9

Baeza-Yates, R. A. "Algorithms for string searching." ACM SIGIR Forum 23, no. 3-4 (1989): 34–58. http://dx.doi.org/10.1145/74697.74700.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Evans, D. J., and S. Ghanemi. "Parallel String Matching Algorithms." Kybernetes 17, no. 3 (1988): 32–44. http://dx.doi.org/10.1108/eb005791.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "String algorithms"

1

Pinzon, Yoan Jose. "String algorithms on sequence comparison." Thesis, King's College London (University of London), 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.395648.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Fischer, Johannes. "Data Structures for Efficient String Algorithms." Diss., lmu, 2007. http://nbn-resolving.de/urn:nbn:de:bvb:19-75053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Newman, Alantha. "Algorithms for string and graph layout." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28745.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.<br>Includes bibliographical references (p. 121-125).<br>Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on a line or a circle, on a two- or three-dimensional lattice, etc. The goal is usually to place all the vertices so as to optimize some specified objective function. We develop combinatorial methods as well a

APA, Harvard, Vancouver, ISO, and other styles

4

Luccio, Flaminia L. Carleton University Dissertation Computer Science. "Distributed algorithms for routing and string recognition." Ottawa, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Aljamea, Mudhi Mohammed. "Advances in string algorithms for information security applications." Thesis, King's College London (University of London), 2016. https://kclpure.kcl.ac.uk/portal/en/theses/advances-in-string-algorithms-for-information-security-applications(93f6c82c-8b7a-4fb1-a0bd-29f14549d57c).html.

Full text

Abstract:

This thesis focuses on introducing novel algorithms in information security through studying successful algorithms in bioinformatics and adapting them to solve some open problems in information security. Although, the problems in both bioinformatics and information security are different, yet, they might be considered very similar when it comes to identifying and solving them using Stringology techniques. Different successful bioinformatics algorithms have been studied and introduced to solve different security problems such as malware detection, biometrics and big data. Firstly, we present a

APA, Harvard, Vancouver, ISO, and other styles

6

Cheng, Lok-lam, and 鄭樂霖. "Approximate string matching in DNA sequences." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B29350591.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Hunt, Kieran. "A comparison of exact string search algorithms for deep packet inspection." Thesis, Rhodes University, 2018. http://hdl.handle.net/10962/60629.

Full text

Abstract:

Every day, computer networks throughout the world face a constant onslaught of attacks. To combat these, network administrators are forced to employ a multitude of mitigating measures. Devices such as firewalls and Intrusion Detection Systems are prevalent today and employ extensive Deep Packet Inspection to scrutinise each piece of network traffic. Systems such as these usually require specialised hardware to meet the demand imposed by high throughput networks. Hardware like this is extremely expensive and singular in its function. It is with this in mind that the string search algorithms are

APA, Harvard, Vancouver, ISO, and other styles

8

Pockrandt, Christopher Maximilian [Verfasser]. "Approximate String Matching : Improving Data Structures and Algorithms / Christopher Maximilian Pockrandt." Berlin : Freie Universität Berlin, 2019. http://d-nb.info/1183675879/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

黎少斌 and Shiao-bun Lai. "Trading off time for space for the string matching problem." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31214216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Lai, Shiao-bun. "Trading off time for space for the string matching problem /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18061795.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "String algorithms"

1

Mailund, Thomas. String Algorithms in C. Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5920-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

1951-, Aoe Jun-ichi, ed. Computer algorithms: String pattern matching strategies. IEEE Computer Society Press, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

1948-, Apostolico Alberto, and Research Institute for Advanced Computer Science (U.S.), eds. Efficient parallel algorithms for string editing and related problems. Research Institute for Advanced Computer Science, NASA Ames Research Center, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Smyth, Bill. Computing patterns in strings. Pearson Addison-Wesley, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

United States. National Aeronautics and Space Administration., ed. An algorithm for unsteady flows with strong convection. National Aeronautics and Space Administration, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Schannath, Heinz. Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme. Deutscher Universitäts-Verlag, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Gusfield, Dan. Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Gusfield, Dan. Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Augurzky, Boris. Assessing the performance of matching algorithms when selection into treatment is strong. IZA, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Castillo, Oscar, and Luis Rodriguez. A New Meta-heuristic Optimization Algorithm Based on the String Theory Paradigm from Physics. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-82288-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "String algorithms"

1

Kao, Ming-Yang. "String." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_407.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Erciyes, K. "String Algorithms." In Computational Biology. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24966-7_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Laaksonen, Antti. "String Algorithms." In Undergraduate Topics in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-72547-5_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Laaksonen, Antti. "String Algorithms." In Undergraduate Topics in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39357-1_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Laaksonen, Antti. "String Algorithms." In Undergraduate Topics in Computer Science. Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-61794-2_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Crochemore, Maxime, and Thierry Lecroq. "String Matching." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Fagerberg, Rolf. "String Sorting." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_408.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Crochemore, Maxime, and Thierry Lecroq. "String Matching." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_365-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Fagerberg, Rolf. "String Sorting." In Encyclopedia of Algorithms. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_408-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Fagerberg, Rolf. "String Sorting." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_408.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "String algorithms"

1

Suzgun, Mirac, Stuart Shieber, and Dan Jurafsky. "string2string: A Modern Python Library for String-to-String Algorithms." In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations). Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.acl-demos.26.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chaves, Ricardo, and Alba Alves de Melo. "A Framework for Reproducible Parallel DNA String Matching." In 16th International Conference on Bioinformatics Models, Methods and Algorithms. SCITEPRESS - Science and Technology Publications, 2025. https://doi.org/10.5220/0013302600003911.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Amruth, A., R. Ramanan, Rhea Paul, C. Vimal, and Meena Belwal. "Advancements in String-Searching Algorithms Fastrack-StringSearch: A Novel Approach." In 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2024. http://dx.doi.org/10.1109/icccnt61001.2024.10724792.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Nath, Ravindra, Prashant Srivastava, and Shachi Mall. "Pattern Matching of Gene Sequencing Using LCS and String-Matching Algorithms." In 2025 3rd International Conference on Communication, Security, and Artificial Intelligence (ICCSAI). IEEE, 2025. https://doi.org/10.1109/iccsai64074.2025.11063778.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Saleh, Taj, Fatma Corut Ergin, Malek Malkawi, and Reda Alhajj. "Performance and Implementation Comparison of Knuth-Morris-Pratt and Boyer-Moore String Search Algorithms." In 2025 2nd International Conference on Advanced Innovations in Smart Cities (ICAISC). IEEE, 2025. https://doi.org/10.1109/icaisc64594.2025.10959692.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hagerup, Torben. "Optimal parallel string algorithms." In the twenty-sixth annual ACM symposium. ACM Press, 1994. http://dx.doi.org/10.1145/195058.195202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kadhim, Hakem Adil, and NurAini AbdulRashidx. "Maximum-shift string matching algorithms." In 2014 International Conference on Computer and Information Sciences (ICCOINS). IEEE, 2014. http://dx.doi.org/10.1109/iccoins.2014.6868423.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Thorup, Mikkel. "String Hashing for Linear Probing." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.72.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Mishin, Nikita, Daniil Berezun, and Alexander Tiskin. "Efficient Parallel Algorithms for String Comparison." In ICPP 2021: 50th International Conference on Parallel Processing. ACM, 2021. http://dx.doi.org/10.1145/3472456.3472489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mishin, Nikita, Daniil Berezun, and Alexander Tiskin. "Efficient Parallel Algorithms for String Comparison." In ICPP 2021: 50th International Conference on Parallel Processing. ACM, 2021. http://dx.doi.org/10.1145/3472456.3472489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "String algorithms"

1

Laub, Alan J., and Charles Kenney. Numerically Stable Algorithms in String Dynamics. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada275898.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lorenz, Markus. Auswirkungen des Decoy-Effekts auf die Algorithm Aversion. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850013.

Full text

Abstract:

Limitations in the human decision-making process restrict the technological potential of algorithms, which is also referred to as "algorithm aversion". This study uses a laboratory experiment with participants to investigate whether a phenomenon known since 1982 as the "decoy effect" is suitable for reducing algorithm aversion. For numerous analogue products, such as cars, drinks or newspaper subscriptions, the Decoy Effect is known to have a strong influence on human decision-making behaviour. Surprisingly, the decisions between forecasts by humans and Robo Advisors (algorithms) investigated

APA, Harvard, Vancouver, ISO, and other styles

3

Helgason, R. V., J. L. Kennington, and K. H. Lewis. Grid Free Algorithms for Strike Planning for Cruise Missiles. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada338548.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hart, James, Nasir Zulfiqar, and Carl Popelar. L52289 Use of Pipeline Geometry Monitoring to Assess Pipeline Condition. Pipeline Research Council International, Inc. (PRCI), 2008. http://dx.doi.org/10.55274/r0010254.

Full text

Abstract:

Describes an algorithm is developed for deducing the longitudinal or axial strain from geometry pig measurements of a laterally displaced pipeline; often caused by geohazards. The development is limited to those lateral displacements of the pipeline that results in a predominantly transverse loading; i.e., the induced transverse component of the loading is much greater than its axial component. The emphasis is upon evaluating inelastic straining that accompanies large lateral displacement of the pipeline. The induced extensional strain is found to vary linearly with the change in curvature of

APA, Harvard, Vancouver, ISO, and other styles

5

Wijaya, Ignasius P. A., Eric Kreiger, and Asuf Masud. An elastic-inelastic model and embedded bounce-back control for layered printing with cementitious materials. Engineer Research and Development Center (U.S.), 2024. http://dx.doi.org/10.21079/11681/48091.

Full text

Abstract:

This paper presents a finite-deformation model for extrusion-based layered printing with cementitious materials. The evolution of mechanical properties as the printed material cures and stiffens results in nonphysical reduction in the magnitude of elastic strains when standard constitutive models are employed. This elastic recovery of the printing induced deformation contradicts the experimentally observed behavior of the printed cementitious materials that harden at a nearly-frozen deformed state. A thermodynamically motivated constraint on the evolution of elastic strains is imposed on the c

APA, Harvard, Vancouver, ISO, and other styles

6

Belkin, Shimshon, Sylvia Daunert, and Mona Wells. Whole-Cell Biosensor Panel for Agricultural Endocrine Disruptors. United States Department of Agriculture, 2010. http://dx.doi.org/10.32747/2010.7696542.bard.

Full text

Abstract:

Objectives: The overall objective as defined in the approved proposal was the development of a whole-cell sensor panel for the detection of endocrine disruption activities of agriculturally relevant chemicals. To achieve this goal several specific objectives were outlined: (a) The development of new genetically engineered wholecell sensor strains; (b) the combination of multiple strains into a single sensor panel to effect multiple response modes; (c) development of a computerized algorithm to analyze the panel responses; (d) laboratory testing and calibration; (e) field testing. In the course

APA, Harvard, Vancouver, ISO, and other styles

7

Hu, Zhengzheng, Ralph C. Smith, and Jon Ernstberger. The Homogenized Energy Model (HEM) for Characterizing Polarization and Strains in Hysteretic Ferroelectric Materials: Implementation Algorithms and Data-Driven Parameter Estimation Techniques. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada556961.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hajj, Ramez, Marshall Thompson, Renan Santos Maia, et al. Updates to Mechanistic-Empirical Design Inputs for Illinois Flexible Pavements. Illinois Center for Transportation, 2024. http://dx.doi.org/10.36501/0197-9191/24-010.

Full text

Abstract:

This study reviews the Illinois Department of Transportation’s full-depth asphalt, limiting strain criterion, and asphalt over rubblized concrete design procedures, considering technological advancements in hot-mix asphalt—namely, the increased use of recycled materials and modified asphalt binders. The researchers evaluated the current |E*| algorithm by conducting laboratory tests with four mix designs and seven asphalt binders of different Superpave performance grades. They compared predictive models, including the current Illinois modulus algorithm as well as the Witczak, Hirsch, and newly

APA, Harvard, Vancouver, ISO, and other styles

9

Irudayaraj, Joseph, Ze'ev Schmilovitch, Amos Mizrach, Giora Kritzman, and Chitrita DebRoy. Rapid detection of food borne pathogens and non-pathogens in fresh produce using FT-IRS and raman spectroscopy. United States Department of Agriculture, 2004. http://dx.doi.org/10.32747/2004.7587221.bard.

Full text

Abstract:

Rapid detection of pathogens and hazardous elements in fresh fruits and vegetables after harvest requires the use of advanced sensor technology at each step in the farm-to-consumer or farm-to-processing sequence. Fourier-transform infrared (FTIR) spectroscopy and the complementary Raman spectroscopy, an advanced optical technique based on light scattering will be investigated for rapid and on-site assessment of produce safety. Paving the way toward the development of this innovative methodology, specific original objectives were to (1) identify and distinguish different serotypes of Escherichi

APA, Harvard, Vancouver, ISO, and other styles

10

Mahajan, Aprajit, Shekhar Mittal, Ofir Reich, and Taha Barwahwala. Using Machine Learning to Catch Bogus Firms. Institute of Development Studies, 2024. http://dx.doi.org/10.19088/ictd.2024.050.

Full text

Abstract:

We investigate the use of a machine learning algorithm to identify non-existent(fraudulent) firms that are used for tax evasion. Using a rich dataset of tax returns in an Indian state over several years, we train a machine learning-based model to predict fraudulent firms. We then use the model predictions to carry out field inspections of firms identified as suspicious by the machine learning tool. We find that the machine learning model is accurate in both simulated and field settings in identifying non-existent firms. Withholding a randomly selected group of firms from inspection, we estimat

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!