Готові списки джерел за темами / String algorithms

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Книги
  4. Частини книг
  5. Тези доповідей конференцій
  6. Звіти організацій

Добірка наукової літератури з теми "String algorithms"

Автор: Grafiati
Опубліковано: 11 березня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "String algorithms".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "String algorithms"

1

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

Повний текст джерела
Анотація:
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 experimentation, this work has used two types of documents, i.e. .txt and .docx. Performance measures used are search time, number of iterations and accuracy. From the experimental results, it is realized that the enhanced KMP algorithm gives better accuracy compared to other string matching algorithms. Application/Improvements: Normally, these algorithms are used in the field of text mining, document classification, content analysis and plagiarism detection. In future, these algorithms have to be enhanced to improve their performance and the various types of documents will be used for experimentation.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Анотація:
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 Matching (BNDM) algorithm is a modern practical algorithm that is an outstanding combination of theoretical research and practical application. Those meaningful algorithms play a guiding role in future research in string-search algorithm to improve the average performance of the algorithm and reduce resource consumption.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Анотація:
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 quantum algorithm has O˜(nk) complexity. The second one is searching the most frequent string among n strings of length k. We show that the classical complexity of the problem is Θ(nk), but our quantum algorithm has O˜(nk) complexity. The third problem is searching for an intersection of two sequences of strings. All strings have the same length k. The size of the first set is n, and the size of the second set is m. We show that the classical complexity of the problem is Θ((n+m)k), but our quantum algorithm has O˜((n+m)k) complexity.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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

Повний текст джерела
Анотація:
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 knowledge of right-maximal Lyndon substrings of the input string. Among those presented were two well-known algorithms for computing the Lyndon array: a quadratic in-place algorithm based on the iterated Duval algorithm for Lyndon factorization and a linear algorithmic scheme based on linear suffix sorting, computing the inverse suffix array, and applying to it the next smaller value algorithm. Duval’s algorithm works for strings over any ordered alphabet, while for linear suffix sorting, a constant or an integer alphabet is required. The authors at that time were not aware of Baier’s algorithm. In 2017, our research group proposed a novel algorithm for the Lyndon array. Though the proposed algorithm is linear in the average case and has O(nlog(n)) worst-case complexity, it is interesting as it emulates the fast Fourier algorithm’s recursive approach and introduces τ-reduction, which might be of independent interest. In 2018, we presented a linear algorithm to compute the Lyndon array of a string inspired by Phase I of Baier’s algorithm for suffix sorting. This paper presents the theoretical analysis of these two algorithms and provides empirical comparisons of both of their C++ implementations with respect to the iterated Duval algorithm.
Стилі APA, Harvard, Vancouver, ISO та ін.
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 (September 5, 2019): 140. http://dx.doi.org/10.3991/ijim.v13i09.10848.

Повний текст джерела
Анотація:
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 matching issues discovered in other string searching algorithms especially with abilities to skip the pre-processing of the pattern, uses simple rules during matching process and does not involved complex computations. Due to those reasons,<strong> </strong>IP algorithm is used in this study due to the ability of this algorithm to produce a good result in string searching process. This article aims to apply IP algorithm together with Optical Character Recognition (OCR) tool for mobile-based word matching detection. There are four phases in this study consists of data preparation, mobile based system design, algorithm implementation and result analysis. The efficiency of the proposed algorithm was evaluated based on the execution time of searching process among the selected algorithms. The result shows that the IP algorithm for string searching process is more efficient in execution time compared to well-known algorithm i.e. Boyer Moore algorithm. In future work, the performance of string searching process can be enhanced by using other suitable optimization searching techniques such as Genetic Algorithm, Particle Swarm Optimization, Ant Colony Optimization and many others.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Nazeen, Sumaiya, M. Sohel Rahman, and Rezwana Reaz. "Indeterminate string inference algorithms." Journal of Discrete Algorithms 10 (January 2012): 23–34. http://dx.doi.org/10.1016/j.jda.2011.08.002.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Parshukova, N. B. "CRYPTOGRAPHIC ALGORITHMS IN SPREADSHEETS." Informatics in school, no. 8 (November 9, 2019): 51–55. http://dx.doi.org/10.32517/2221-1993-2019-18-8-51-55.

Повний текст джерела
Анотація:
The article examines three well known cryptographic algorithm — Skytale, Caesar's cipher, Vigenere's cipher and the method of their implementation using spreadsheets. Functions on work with strings, such as calculation of string length, search of a substring position in a string, substring selection, concatenation are considered.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Анотація:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 121-125).
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 as models based on linear and semidefinite programming for graph layout problems. We apply these techniques to some well-known optimization problems. In particular, we give improved approximation algorithms for the string folding problem on the two- and three-dimensional square lattices. This combinatorial graph problem is motivated by the protein folding problem, which is central in computational biology. We then present a new semidefinite programming formulation for the linear ordering problem (also known as the maximum acyclic subgraph problem) and show that it provides an improved bound on the value of an optimal solution for random graphs. This is the first relaxation that improves on the trivial "all edges" bound for random graphs.
by Alantha Newman.
Ph.D.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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 dynamic computer malware detection model; a novel approach for detecting malware code embedded in different types of computer files, with consistency, accuracy and in high speed without excessive memory usages. This model was inspired by REAL; an efficient read aligner used by next generation sequencing for processing biological data. In addition, we introduce a novel algorithmic approach to detect malicious URLs in image secret communications. Secondly, we also focus on biometrics, specifically fingerprint which is considered to be one of the most reliable and used technique to identify individuals. In particular, we introduce a new fingerprint matching technique, which matches the fingerprint information using circular approximate string matching to solve the rotation problem overcoming the previous methods’ obstacles. Finally, we conclude with an algorithmic approach to analyse big data readings from smart meters to confirm some privacy issues concerns.
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Анотація:
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 introduced. These algorithms have been proven to perform well when searching through large volumes of text and may be able to perform equally well in the context of Deep Packet Inspection. String search algorithms are designed to match a single pattern to a substring of a given piece of text. This is not unlike the heuristics employed by traditional Deep Packet Inspection systems. This research compares the performance of a large number of string search algorithms during packet processing. Deep Packet Inspection places stringent restrictions on the reliability and speed of the algorithms due to increased performance pressures. A test system had to be designed in order to properly test the string search algorithms in the context of Deep Packet Inspection. The system allowed for precise and repeatable tests of each algorithm and then for their comparison. Of the algorithms tested, the Horspool and Quick Search algorithms posted the best results for both speed and reliability. The Not So Naive and Rabin-Karp algorithms were slowest overall.
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "String algorithms"

1

String searching algorithms. Singapore: World Scientific, 1994.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Efficient recovery algorithms with restricted access to strings. [New York, N.Y.?]: [publisher not identified], 2022.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

United States. National Aeronautics and Space Administration., ed. An algorithm for unsteady flows with strong convection. [Washington, DC]: National Aeronautics and Space Administration, 1988.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Schannath, Heinz. Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme. Wiesbaden: Deutscher Universitäts-Verlag, 1991.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "String algorithms"

1

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Brisaboa, Nieves R., Rodrigo Cánovas, Francisco Claude, Miguel A. Martínez-Prieto, and Gonzalo Navarro. "Compressed String Dictionaries." In Experimental Algorithms, 136–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20662-7_12.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "String algorithms"

1

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Mirabal, Pedro, Ignacio Lincolao-Venegas, Mario Castillo-Sanhueza, and Jose Abreu. "Parallel Implementation of Median String Algorithms." In 2021 40th International Conference of the Chilean Computer Science Society (SCCC). IEEE, 2021. http://dx.doi.org/10.1109/sccc54552.2021.9650389.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Katsumata, A., T. Miura, and I. Shioya. "Approximate String Matching Using Markovian Distance." In Third International Symposium on Parallel Architectures, Algorithms and Programming (PAAP 2010). IEEE, 2010. http://dx.doi.org/10.1109/paap.2010.11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Seidel, Raimund. "Data-Specific Analysis of String Sorting." In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611973075.102.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Kotus, J., P. Szczuko, M. Szczodrak, and A. Czyzewski. "Application of fast cameras to string vibrations recording." In 2015 Signal Processing: Algorithms, Architectures, Arrangements, and Applications (SPA). IEEE, 2015. http://dx.doi.org/10.1109/spa.2015.7365142.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Tiskin, Alexander. "Communication vs Synchronisation in Parallel String Comparison." In SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3350755.3400225.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "String algorithms"

1

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Повний текст джерела
Анотація:
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 in this study are not influenced by the Decoy Effect at all. This is true both a priori and after observing forecast errors.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Анотація:
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 of the project, mostly due to the change in the US partner, three modifications were introduced to the original objectives: (a) the scope of the project was expanded to include pharmaceuticals (with a focus on antibiotics) in addition to endocrine disrupting chemicals, (b) the computerized algorithm was not fully developed and (c) the field test was not carried out. Background: Chemical agents, such as pesticides applied at inappropriate levels, may compromise water quality or contaminate soils and hence threaten human populations. In recent years, two classes of compounds have been increasingly implicated as emerging risks in agriculturally-related pollution: endocrine disrupting compounds (EDCs) and pharmaceuticals. The latter group may reach the environment by the use of wastewater effluents, whereas many pesticides have been implicated as EDCs. Both groups pose a threat in proportion to their bioavailability, since that which is biounavailable or can be rendered so is a priori not a threat; bioavailability, in turn, is mediated by complex matrices such as soils. Genetically engineered biosensor bacteria hold great promise for sensing bioavailability because the sensor is a live soil- and water-compatible organism with biological response dynamics, and because its response can be genetically “tailored” to report on general toxicity, on bioavailability, and on the presence of specific classes of toxicants. In the present project we have developed a bacterial-based sensor panel incorporating multiple strains of genetically engineered biosensors for the purpose of detecting different types of biological effects. 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 of the project, mostly due to the change in the US partner, three modifications were introduced to the original objectives: (a) the scope of the project was expanded to include pharmaceuticals (with a focus on antibiotics) in addition to endocrine disrupting chemicals, (b) the computerized algorithm was not fully developed and (c) the field test was not carried out. Major achievements: (a) construction of innovative bacterial sensor strains for accurate and sensitive detection of agriculturally-relevant pollutants, with a focus on endocrine disrupting compounds (UK and HUJ) and antibiotics (HUJ); (b) optimization of methods for long-term preservation of the reporter bacteria, either by direct deposition on solid surfaces (HUJ) or by the construction of spore-forming Bacillus-based sensors (UK); (c) partial development of a computerized algorithm for the analysis of sensor panel responses. Implications: The sensor panel developed in the course of the project was shown to be applicable for the detection of a broad range of antibiotics and EDCs. Following a suitable development phase, the panel will be ready for testing in an agricultural environment, as an innovative tool for assessing the environmental impacts of EDCs and pharmaceuticals. Furthermore, while the current study relates directly to issues of water quality and soil health, its implications are much broader, with potential uses is risk-based assessment related to the clinical, pharmaceutical, and chemical industries as well as to homeland security.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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. Fort Belvoir, VA: Defense Technical Information Center, January 2012. http://dx.doi.org/10.21236/ada556961.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

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, October 2004. http://dx.doi.org/10.32747/2004.7587221.bard.

Повний текст джерела
Анотація:
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 Escherichia coli, Listeria monocytogenes, Salmonella typhimurium, and Bacillus cereus by FTIR and Raman spectroscopy, (2) develop spectroscopic fingerprint patterns and detection methodology for fungi such as Aspergillus, Rhizopus, Fusarium, and Penicillium (3) to validate a universal spectroscopic procedure to detect foodborne pathogens and non-pathogens in food systems. The original objectives proposed were very ambitious hence modifications were necessary to fit with the funding. Elaborate experiments were conducted for sensitivity, additionally, testing a wide range of pathogens (more than selected list proposed) was also necessary to demonstrate the robustness of the instruments, most crucially, algorithms for differentiating a specific organism of interest in mixed cultures was conceptualized and validated, and finally neural network and chemometric models were tested on a variety of applications. Food systems tested were apple juice and buffer systems. Pathogens tested include Enterococcus faecium, Salmonella enteritidis, Salmonella typhimurium, Bacillus cereus, Yersinia enterocolitis, Shigella boydii, Staphylococus aureus, Serratiamarcescens, Pseudomonas vulgaris, Vibrio cholerae, Hafniaalvei, Enterobacter cloacae, Enterobacter aerogenes, E. coli (O103, O55, O121, O30 and O26), Aspergillus niger (NRRL 326) and Fusarium verticilliodes (NRRL 13586), Saccharomyces cerevisiae (ATCC 24859), Lactobacillus casei (ATCC 11443), Erwinia carotovora pv. carotovora and Clavibacter michiganense. Sensitivity of the FTIR detection was 103CFU/ml and a clear differentiation was obtained between the different organisms both at the species as well as at the strain level for the tested pathogens. A very crucial step in the direction of analyzing mixed cultures was taken. The vector based algorithm was able to identify a target pathogen of interest in a mixture of up to three organisms. Efforts will be made to extend this to 10-12 key pathogens. The experience gained was very helpful in laying the foundations for extracting the true fingerprint of a specific pathogen irrespective of the background substrate. This is very crucial especially when experimenting with solid samples as well as complex food matrices. Spectroscopic techniques, especially FTIR and Raman methods are being pursued by agencies such as DARPA and Department of Defense to combat homeland security. Through the BARD US-3296-02 feasibility grant, the foundations for detection, sample handling, and the needed algorithms and models were developed. Successive efforts will be made in transferring the methodology to fruit surfaces and to other complex food matrices which can be accomplished with creative sampling methods and experimentation. Even a marginal success in this direction will result in a very significant breakthrough because FTIR and Raman methods, in spite of their limitations are still one of most rapid and nondestructive methods available. Continued interest and efforts in improving the components as well as the refinement of the procedures is bound to result in a significant breakthrough in sensor technology for food safety and biosecurity.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Alchanatis, Victor, Stephen W. Searcy, Moshe Meron, W. Lee, G. Y. Li, and A. Ben Porath. Prediction of Nitrogen Stress Using Reflectance Techniques. United States Department of Agriculture, November 2001. http://dx.doi.org/10.32747/2001.7580664.bard.

Повний текст джерела
Анотація:
Commercial agriculture has come under increasing pressure to reduce nitrogen fertilizer inputs in order to minimize potential nonpoint source pollution of ground and surface waters. This has resulted in increased interest in site specific fertilizer management. One way to solve pollution problems would be to determine crop nutrient needs in real time, using remote detection, and regulating fertilizer dispensed by an applicator. By detecting actual plant needs, only the additional nitrogen necessary to optimize production would be supplied. This research aimed to develop techniques for real time assessment of nitrogen status of corn using a mobile sensor with the potential to regulate nitrogen application based on data from that sensor. Specifically, the research first attempted to determine the system parameters necessary to optimize reflectance spectra of corn plants as a function of growth stage, chlorophyll and nitrogen status. In addition to that, an adaptable, multispectral sensor and the signal processing algorithm to provide real time, in-field assessment of corn nitrogen status was developed. Spectral characteristics of corn leaves reflectance were investigated in order to estimate the nitrogen status of the plants, using a commercial laboratory spectrometer. Statistical models relating leaf N and reflectance spectra were developed for both greenhouse and field plots. A basis was established for assessing nitrogen status using spectral reflectance from plant canopies. The combined effect of variety and N treatment was studied by measuring the reflectance of three varieties of different leaf characteristic color and five different N treatments. The variety effect on the reflectance at 552 nm was not significant (a = 0.01), while canonical discriminant analysis showed promising results for distinguishing different variety and N treatment, using spectral reflectance. Ambient illumination was found inappropriate for reliable, one-beam spectral reflectance measurement of the plants canopy due to the strong spectral lines of sunlight. Therefore, artificial light was consequently used. For in-field N status measurement, a dark chamber was constructed, to include the sensor, along with artificial illumination. Two different approaches were tested (i) use of spatially scattered artificial light, and (ii) use of collimated artificial light beam. It was found that the collimated beam along with a proper design of the sensor-beam geometry yielded the best results in terms of reducing the noise due to variable background, and maintaining the same distance from the sensor to the sample point of the canopy. A multispectral sensor assembly, based on a linear variable filter was designed, constructed and tested. The sensor assembly combined two sensors to cover the range of 400 to 1100 nm, a mounting frame, and a field data acquisition system. Using the mobile dark chamber and the developed sensor, as well as an off-the-shelf sensor, in- field nitrogen status of the plants canopy was measured. Statistical analysis of the acquired in-field data showed that the nitrogen status of the com leaves can be predicted with a SEP (Standard Error of Prediction) of 0.27%. The stage of maturity of the crop affected the relationship between the reflectance spectrum and the nitrogen status of the leaves. Specifically, the best prediction results were obtained when a separate model was used for each maturity stage. In-field assessment of the nitrogen status of corn leaves was successfully carried out by non contact measurement of the reflectance spectrum. This technology is now mature to be incorporated in field implements for on-line control of fertilizer application.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

PERFORMANCE OPTIMIZATION OF A STEEL-UHPC COMPOSITE ORTHOTROPIC BRIDGE WITH INTELLIGENT ALGORITHM. The Hong Kong Institute of Steel Construction, August 2022. http://dx.doi.org/10.18057/icass2020.p.160.

Повний текст джерела
Анотація:
To address the problems of pavement damage and fatigue cracking of orthotropic steel deck (OSD) in bridges, an innovative composite bridge deck composed of OSD with open ribs and ultra-high performance concrete (UHPC) layer was proposed. Firstly, the stress responses of fatigue-prone details in the composite bridge deck were investigated by refined two-scale finite element analysis. The results show that the rib-to-deck joint can achieve an infinite fatigue life, while the floorbeam detail of rib-tofloorbeam joint indicates finite fatigue life. Then, response surface models of stress ranges of fatigue details and structure weight were derived via both the central composite design and response surface method. Finally, to improve the fatigue performance for achieving an infinite fatigue life under relatively low structure weight, the multi-objective optimization was executed by an Improved Non-dominated Sorting Genetic Algorithm (NSGA-II). The obtained Pareto front shows that there is a strong competition between the stress range of fatigue-prone detail and structure weight.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Payment Systems Report - June of 2021. Banco de la República, February 2022. http://dx.doi.org/10.32468/rept-sist-pag.eng.2021.

Повний текст джерела
Анотація:
Banco de la República provides a comprehensive overview of Colombia’s finan¬cial infrastructure in its Payment Systems Report, which is an important product of the work it does to oversee that infrastructure. The figures published in this edition of the report are for the year 2020, a pandemic period in which the con¬tainment measures designed and adopted to alleviate the strain on the health system led to a sharp reduction in economic activity and consumption in Colom¬bia, as was the case in most countries. At the start of the pandemic, the Board of Directors of Banco de la República adopted decisions that were necessary to supply the market with ample liquid¬ity in pesos and US dollars to guarantee market stability, protect the payment system and preserve the supply of credit. The pronounced growth in mone¬tary aggregates reflected an increased preference for liquidity, which Banco de la República addressed at the right time. These decisions were implemented through operations that were cleared and settled via the financial infrastructure. The second section of this report, following the introduction, offers an analysis of how the various financial infrastructures in Colombia have evolved and per¬formed. One of the highlights is the large-value payment system (CUD), which registered more momentum in 2020 than during the previous year, mainly be¬cause of an increase in average daily remunerated deposits made with Banco de la República by the General Directorate of Public Credit and the National Treasury (DGCPTN), as well as more activity in the sell/buy-back market with sovereign debt. Consequently, with more activity in the CUD, the Central Securi¬ties Depository (DCV) experienced an added impetus sparked by an increase in the money market for bonds and securities placed on the primary market by the national government. The value of operations cleared and settled through the Colombian Central Counterparty (CRCC) continues to grow, propelled largely by peso/dollar non-deliverable forward (NDF) contracts. With respect to the CRCC, it is important to note this clearing house has been in charge of managing risks and clearing and settling operations in the peso/dollar spot market since the end of last year, following its merger with the Foreign Exchange Clearing House of Colombia (CCDC). Since the final quarter of 2020, the CRCC has also been re¬sponsible for clearing and settlement in the equities market, which was former¬ly done by the Colombian Stock Exchange (BVC). The third section of this report provides an all-inclusive view of payments in the market for goods and services; namely, transactions carried out by members of the public and non-financial institutions. During the pandemic, inter- and intra-bank electronic funds transfers, which originate mostly with companies, increased in both the number and value of transactions with respect to 2019. However, debit and credit card payments, which are made largely by private citizens, declined compared to 2019. The incidence of payment by check contin¬ue to drop, exhibiting quite a pronounced downward trend during the past last year. To supplement to the information on electronic funds transfers, section three includes a segment (Box 4) characterizing the population with savings and checking accounts, based on data from a survey by Banco de la República con-cerning the perception of the use of payment instruments in 2019. There also is segment (Box 2) on the growth in transactions with a mobile wallet provided by a company specialized in electronic deposits and payments (Sedpe). It shows the number of users and the value of their transactions have increased since the wallet was introduced in late 2017, particularly during the pandemic. In addition, there is a diagnosis of the effects of the pandemic on the payment patterns of the population, based on data related to the use of cash in circu¬lation, payments with electronic instruments, and consumption and consumer confidence. The conclusion is that the collapse in the consumer confidence in¬dex and the drop in private consumption led to changes in the public’s pay¬ment patterns. Credit and debit card purchases were down, while payments for goods and services through electronic funds transfers increased. These findings, coupled with the considerable increase in cash in circulation, might indicate a possible precautionary cash hoarding by individuals and more use of cash as a payment instrument. There is also a segment (in Focus 3) on the major changes introduced in regulations on the retail-value payment system in Colombia, as provided for in Decree 1692 of December 2020. The fourth section of this report refers to the important innovations and tech¬nological changes that have occurred in the retail-value payment system. Four themes are highlighted in this respect. The first is a key point in building the financial infrastructure for instant payments. It involves of the design and im¬plementation of overlay schemes, a technological development that allows the various participants in the payment chain to communicate openly. The result is a high degree of interoperability among the different payment service providers. The second topic explores developments in the international debate on central bank digital currency (CBDC). The purpose is to understand how it could impact the retail-value payment system and the use of cash if it were to be issued. The third topic is related to new forms of payment initiation, such as QR codes, bio¬metrics or near field communication (NFC) technology. These seemingly small changes can have a major impact on the user’s experience with the retail-value payment system. The fourth theme is the growth in payments via mobile tele¬phone and the internet. The report ends in section five with a review of two papers on applied research done at Banco de la República in 2020. The first analyzes the extent of the CRCC’s capital, acknowledging the relevant role this infrastructure has acquired in pro¬viding clearing and settlement services for various financial markets in Colom¬bia. The capital requirements defined for central counterparties in some jurisdic¬tions are explored, and the risks to be hedged are identified from the standpoint of the service these type of institutions offer to the market and those associated with their corporate activity. The CRCC’s capital levels are analyzed in light of what has been observed in the European Union’s regulations, and the conclusion is that the CRCC has a scheme of security rings very similar to those applied internationally and the extent of its capital exceeds what is stipulated in Colombian regulations, being sufficient to hedge other risks. The second study presents an algorithm used to identify and quantify the liquidity sources that CUD’s participants use under normal conditions to meet their daily obligations in the local financial market. This algorithm can be used as a tool to monitor intraday liquidity. Leonardo Villar Gómez Governor
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "String algorithms" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії