BIG DATA CYBER-SECURITY BASED ON A BI-OBJECTIVE HYPER-HEURISTIC SUPPORT VECTOR MACHINES
DOI:
https://doi.org/10.61841/dwpg8a89Keywords:
string pattern matching, bibliographic search, information re-trieval, text-editingAbstract
This paper portrays a fundamental, capable computation to discover all occasions of any of a predetermined number of watchwords in a string of text. The count involves con-structing a constrained state configuration planning machine from the catchphrases and a short time later using the model organizing machine to process the substance string in a lone pass. Improvement of the model organizing machine requires some speculation relating to the total length of the catchphrases. The amount of state changes made by the model organizing machine in setting up the substance string is self-governing of the amount of catchphrases. The estimation has been used to improve the speed of a library bibliographic chase program by a factor of 5 to 10.
Downloads
References
1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Booth, T.U. Sequential Machines and Automata Theory. Wiley, New York, 1967.
3. Brzozowski, J.A. Derivatives of regular expressions. J. A C M 11:4 (October 1964), 481-494.
4. Bullen, R.H., Jr., and Millen, J.K. Microtext: the design of a microprogrammed finite state search machine for full-text retrieval. Proc. Fall Joint Computer Conference, 1972, pp. 479-488.
5. Fischer, M.J., and Paterson, M.S. String matching and other products. Technical Report 41, Project MAC, M.I.T., 1974.
6. Gimpel, J.A. A theory of discrete patterns and their implementation in SNOBOL4. Comm. A C M 16:2 (February 1973), 91-100.
7. Harrison, M.C. Implementation of the substring test by hash-ing. Comm. ACM14:12 (December 1971), 777-779.
8. Johnson, W.L., Porter, J.H., Ackley, S.I., and Ross, D.T. Au-tomatic generation of efficient lexical processors using finite state techniques. Comm. A C M l l: I 2 (December 1968), 805-813.
9.Kernighan, B.W., and Cherry, L.L. A system for typesetting mathematics. Comm. ACM18:3 (March 1975), 151-156.
10. Kleene, S.C. Representation of events in nerve nets. In Au-tomata Studies, C.E. Shannon and J. McCarthy (eds.), Princeton University Press, 1956, pp. 3-40.
11. Knuth, D.E. Fundamental Algorithms, second edition, The Art of Computer Programming 1, Addison-Wesley, Reading, Mass., 1973.
12. Knuth, D.E. Sorting and Searching, The Art of Computer Programming 3, Addison-Wesley, Reading, Mass., 1973.
13. Knuth, D.E., Morris, J.H., Jr., and Pratt, V.R. Fast pattern matching in strings. TR CS-74-440, Stanford University, Stanford, California, 1974.
Downloads
Published
Issue
Section
License
Copyright (c) 2020 AUTHOR
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
