Patents by Inventor Xiaoxu Meng

Xiaoxu Meng 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: 11988927
    Abstract: Provided is an array substrate. The array substrate includes a plurality of sub-pixels; wherein a storage capacitor and an extended storage capacitor are disposed in each of the plurality of sub-pixels, the extended storage capacitor and the storage capacitor being connected in parallel; and the array substrate includes a gate electrode layer, a source and drain electrode layer, and a pixel electrode.
    Type: Grant
    Filed: March 9, 2021
    Date of Patent: May 21, 2024
    Assignees: Chengdu BOE Optoelectronics Technology Co., Ltd., BOE Technology Group Co., Ltd.
    Inventors: Zhengdong Zhang, Xiaofei Yang, Lei Su, Limiao Wang, Hongjun Wang, Jia Meng, Xiaoxu Hu
  • Patent number: 11939631
    Abstract: This invention provides a process for sequencing single-stranded DNA by employing a nanopore and modified nucleotides.
    Type: Grant
    Filed: August 18, 2021
    Date of Patent: March 26, 2024
    Assignee: THE TRUSTEES OF COLUMBIA UNIVERSITY IN THE CITY OF NEW YORK
    Inventors: Jingyue Ju, Dae Hyun Kim, Lanrong Bi, Qinglin Meng, Xiaoxu Li
  • Patent number: 11631218
    Abstract: Techniques of compressing triangular mesh data involve generating a neighborhood table (i.e., a table) of fixed size that represents a neighborhood of a predicted vertex of a triangle within a triangular mesh for input into a machine-learning (ML) engine. For example, such a neighborhood table as input into a ML engine can output a prediction for a value (e.g., a position) of a vertex. The residual between the prediction and the actual value of the vertex is stored in an array. The data in the array representing the residuals may be compressed and transmitted over a network. Upon receipt by a computer, the array may be decompressed by the computer. Obtaining the actual value involves the receiving computer generating the same neighborhood table, inputting that neighborhood table into the same ML engine to produce the predicted value, and adding the predicted value to the residual from the decompressed file.
    Type: Grant
    Filed: December 5, 2019
    Date of Patent: April 18, 2023
    Assignee: Google LLC
    Inventors: Igor Vytyaz, Ondrej Stava, Michael Hemmer, Xiaoxu Meng
  • Publication number: 20220020211
    Abstract: Techniques of compressing triangular mesh data involve generating a neighborhood table (i.e., a table) of fixed size that represents a neighborhood of a predicted vertex of a triangle within a triangular mesh for input into a machine-learning (ML) engine. For example, such a neighborhood table as input into a ML engine can output a prediction for a value (e.g., a position) of a vertex. The residual between the prediction and the actual value of the vertex is stored in an array. The data in the array representing the residuals may be compressed and transmitted over a network. Upon receipt by a computer, the array may be decompressed by the computer. Obtaining the actual value involves the receiving computer generating the same neighborhood table, inputting that neighborhood table into the same ML engine to produce the predicted value, and adding the predicted value to the residual from the decompressed file.
    Type: Application
    Filed: December 5, 2019
    Publication date: January 20, 2022
    Inventors: Igor Vytyaz, Ondrej Stava, Michael Hemmer, Xiaoxu Meng