-
公开(公告)号：US10769192B2
公开(公告)日：2020-09-08
申请号：US15770486
申请日：2016-09-21
发明人： Xiaochuan Wan , Hanzhao Gao
IPC分类号： G06F16/35 , G06F16/00 , G06F21/55 , G06F40/186 , G06F40/279 , G06F16/31
摘要： A method for determining a longest common subsequence in a plurality of text strings. The method comprises: separately converting a plurality of text strings into word sequences (S100); classifying the word sequences (S400); and performing longest common subsequence computation on every class (S500). The time needed by LCS computation can be saved by classifying text strings.
-
公开(公告)号：US10404731B2
公开(公告)日：2019-09-03
申请号：US15570585
申请日：2016-03-11
发明人： Xiaochuan Wan
摘要： The present invention provides a method for detecting a website attack, comprising: selecting multiple uniform resource locators (URLs) from history access records of a website; clustering the multiple uniform resource locators; and generating a whitelist from the multiple uniform resource locators according to a clustering result. In some embodiments of the present invention, a common OWASP attack at URL level can be checked.
-
公开(公告)号：US20180139222A1
公开(公告)日：2018-05-17
申请号：US15570585
申请日：2016-03-11
发明人： Xiaochuan Wan
CPC分类号： H04L63/1425 , H04L43/04 , H04L63/10 , H04L63/101 , H04L63/14 , H04L63/1458
摘要： The present invention provides a method for detecting a website attack, comprising: selecting multiple uniform resource locators (URLs) from history access records of a website; clustering the multiple uniform resource locators; and generating a whitelist from the multiple uniform resource locators according to a clustering result. In some embodiments of the present invention, a common OWASP attack at URL level can be checked.
-
-
搜索结果
3 条记录 (耗时 0.013 秒)
