Patents by Inventor Irene Liu

Irene Liu 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).

  • Publication number: 20210079065
    Abstract: Provided herein are methods of producing an antibody composition comprising a desired or predetermined or pre-selected level of total afucosylated (TAF) glycoforms. In exemplary embodiments, the method comprises maintaining glycosylation-competent cells in a cell culture medium comprising fucose and/or glucose at a specific concentration as described herein, depending on the level of TAF glycoforms desired. Related compositions comprising glycosylated proteins and TAF glycoforms thereof are also provided herein. Also provided are cell culture media.
    Type: Application
    Filed: March 26, 2019
    Publication date: March 18, 2021
    Inventors: Prince BHEBE, Matthew JERUMS, Irene LIU, Kurt KUNAS
  • Publication number: 20060287979
    Abstract: Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.
    Type: Application
    Filed: June 17, 2005
    Publication date: December 21, 2006
    Inventors: Thomas Beavin, Mengchu Cai, Yao-Ching Chen, Hsiuying Cheng, Fen-Ling Lin, Irene Liu, Jerry Mukai, Demai Ni, Yoichi Tsuji, Li Xia, Ying Zeng
  • Publication number: 20060106758
    Abstract: A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.
    Type: Application
    Filed: November 16, 2004
    Publication date: May 18, 2006
    Inventors: Yao-Ching Chen, Irene Liu, Demai Ni, Guogen Zhang, Qinghua Zou
  • Publication number: 20050114307
    Abstract: A heuristic approach is used to order materialized view (MW) candidates in a list based on descending order of their reduction power. A query (e.g., SQL query) is then matched with the MVs in the list order, wherein searching is stopped as soon as good enough matching has been found. The query is matched with materialized views in the ordered list by identifying a materialized view candidate as follows: identifying an MV that is not locked by a REFRESH process; identifying a matching MV that does not require a regroup; identifying a matching MV that does not require a rejoin; identifying a matching MV that does not require a residual join; or identifying an MV with largest reduction power from the list of candidates.
    Type: Application
    Filed: November 25, 2003
    Publication date: May 26, 2005
    Inventors: Ruiping Li, Irene Liu, Lee-Chin Liu, Guogen Zhang