Patents by Inventor Hanzhao GAO

Hanzhao GAO has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Method and equipment for determining common subsequence of text strings
    Patent number: 10769192
    Abstract: 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.
    Type: Grant
    Filed: September 21, 2016
    Date of Patent: September 8, 2020
    Assignee: BEIJING HANSIGHT TECH CO., LTD.
    Inventors: Xiaochuan Wan, Hanzhao Gao
  • METHOD OF DETECTING ABNORMAL BEHAVIOR OF USER OF COMPUTER NETWORK SYSTEM
    Publication number: 20200053110
    Abstract: Provided in the present invention is a method of detecting an abnormal behavior of a user of a computer network system, the method comprising: selecting at least two data sources in the computer network system; extracting data of user behaviors respectively from the corresponding data sources using a configured tensor data structure, and aggregating the extracted data; and detecting abnormality of user behaviors on the basis of the aggregated tensor data. The method of the present invention can efficiently integrate a large volume of irrelevant security data and identify an abnormal behavior automatically.
    Type: Application
    Filed: March 26, 2018
    Publication date: February 13, 2020
    Inventors: Xiaochuan WAN, Hanzhao GAO, Rui WU
  • METHOD AND EQUIPMENT FOR DETERMINING COMMON SUBSEQUENCE OF TEXT STRINGS
    Publication number: 20190057148
    Abstract: 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.
    Type: Application
    Filed: September 21, 2016
    Publication date: February 21, 2019
    Inventors: Xiaochuan WAN, Hanzhao GAO