Patents by Inventor Ying-Chau R. Mak

Ying-Chau R. Mak 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).

  • Patent number: 10558690
    Abstract: A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.
    Type: Grant
    Filed: July 6, 2015
    Date of Patent: February 11, 2020
    Assignee: International Business Machines Corporation
    Inventors: Chi-Wai Cheung, Ying-Chau R. Mak
  • Patent number: 10546002
    Abstract: A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.
    Type: Grant
    Filed: September 2, 2015
    Date of Patent: January 28, 2020
    Assignee: International Business Machines Corporation
    Inventors: Chi-Wai Cheung, Ying-Chau R. Mak
  • Patent number: 10303493
    Abstract: Methods and systems for cross-language program execution include setting a signature of a second programming language in a first program that is written in a first programming language. A second program that is written in the second programming language is called from the first program, such that the second program omits checks to verify a runtime environment for the second programming language based on the presence of the signature.
    Type: Grant
    Filed: November 4, 2016
    Date of Patent: May 28, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Toshihiko Koju, Ying Chau R. Mak, Toshio Suganuma
  • Publication number: 20180129517
    Abstract: Methods and systems for cross-language program execution include setting a signature of a second programming language in a first program that is written in a first programming language. A second program that is written in the second programming language is called from the first program, such that the second program omits checks to verify a runtime environment for the second programming language based on the presence of the signature.
    Type: Application
    Filed: November 4, 2016
    Publication date: May 10, 2018
    Inventors: Toshihiko Koju, Ying Chau R. Mak, Toshio Suganuma
  • Publication number: 20170212740
    Abstract: Techniques are described for parsing a software program using parallel processing. In one example, a method includes tokenizing input source text to form a token stream having a plurality of tokens, partitioning the token stream into partitions by division and by statement, parsing two or more of the partitions in parallel, and traversing the common symbol dictionary to detect semantic errors. Partitioning includes storing an entry representing each partition in a partition table, including scanning the token stream in reverse starting at the end of each division. Parsing the partitions in parallel includes building, for each statement partition, an annotated syntax tree (AST) to represent the statement, storing, for each symbol, an entry in a common symbol dictionary, and generating error messages corresponding to syntax errors detected while parsing the partitions.
    Type: Application
    Filed: January 27, 2016
    Publication date: July 27, 2017
    Inventors: Cinderella Lee, Ying Chau R. Mak
  • Patent number: 9715375
    Abstract: Techniques are described for parsing a software program using parallel processing. In one example, a method includes tokenizing input source text to form a token stream having a plurality of tokens, partitioning the token stream into partitions by division and by statement, parsing two or more of the partitions in parallel, and traversing the common symbol dictionary to detect semantic errors. Partitioning includes storing an entry representing each partition in a partition table, including scanning the token stream in reverse starting at the end of each division. Parsing the partitions in parallel includes building, for each statement partition, an annotated syntax tree (AST) to represent the statement, storing, for each symbol, an entry in a common symbol dictionary, and generating error messages corresponding to syntax errors detected while parsing the partitions.
    Type: Grant
    Filed: January 27, 2016
    Date of Patent: July 25, 2017
    Assignee: International Business Machines Corporation
    Inventors: Cinderella Lee, Ying Chau R. Mak
  • Publication number: 20170011115
    Abstract: A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.
    Type: Application
    Filed: July 6, 2015
    Publication date: January 12, 2017
    Inventors: Chi-Wai Cheung, Ying-Chau R. Mak
  • Publication number: 20170011120
    Abstract: A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.
    Type: Application
    Filed: September 2, 2015
    Publication date: January 12, 2017
    Inventors: Chi-Wai Cheung, Ying-Chau R. Mak