Patents by Inventor Christian A. Lang

Christian A. Lang 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: 20240029403
    Abstract: Methods and systems for machine learning are disclosed for automated high content screening of drug compounds. Functions in one method include, receiving an assay layout; receiving images of a plurality of wells in one or more plates; training binary AI models based on the positive phenotype controls versus negative control to generate probabilities of an input image being the positive control to which the binary AI models were trained; training an all-control AI model based on all of the positive phenotype controls and the negative control to generate a set of probabilities of an input image being one of the positive phenotype controls or the negative control; and generating one or more visual representations of the set of probabilities to evaluate performance of the trained all-control AI model and the binary AI models.
    Type: Application
    Filed: June 27, 2023
    Publication date: January 25, 2024
    Inventors: Ilya Goldberg, Christian A. Lang, Dmitry Fedorov, Kristian Kvilekval, Katherine Yeung, Henry Rupert Dodkins, Teresa Findley
  • Patent number: 11827582
    Abstract: The present disclosure provides small molecule drugs and pharmaceutical compositions for the treatment and prevention of diseases related to the formation of A?42 oligomers in a subject. It further provides a method of reducing formation of or disrupting A?42 oligomers in a subject, the method comprising the step of administering to the subject in need thereof a therapeutically effective amount of a pharmaceutical composition.
    Type: Grant
    Filed: March 31, 2020
    Date of Patent: November 28, 2023
    Assignee: ACELOT, INC.
    Inventors: Ambuj K. Singh, Christian A. Lang
  • Publication number: 20230331658
    Abstract: The present invention provides small molecule drugs and pharmaceutical compositions for the treatment and prevention of diseases related to the formation of A?42 oligomers in a subject. It further provides a method of reducing formation of or disrupting A?42 oligomers in a subject, the method comprising the step of administering to the subject in need thereof a therapeutically effective amount of a pharmaceutical composition.
    Type: Application
    Filed: February 2, 2023
    Publication date: October 19, 2023
    Applicant: ACELOT, INC.
    Inventors: Ambuj K. Singh, Christian A. Lang
  • Publication number: 20230281749
    Abstract: Methods, apparatus, and systems for high-resolution image storage and analysis are disclosed. In one disclosed embodiment, a method includes analyzing a high-resolution image; partitioning the high-resolution image into logical blocks; detecting objects in the high-resolution image within the logical blocks, assigning objects that differ or with differing measures to differing layers, and assigning objects that are similar or with similar measures to the same layer; tabulating the detected objects into a table, wherein each row indicates a spatial position of each detected object and at least one measure of each detected object; storing the spatial position and the at least one measure of each detected object into the table; spatially rendering selected objects over the high-resolution image; and displaying the selected objects at a selected resolution within a portion of the high-resolution image on a display device.
    Type: Application
    Filed: December 27, 2022
    Publication date: September 7, 2023
    Inventors: Dmitry Fedorov, Christian A. Lang, Kristian Kvilekval, Ilya Goldberg
  • Publication number: 20220261990
    Abstract: Methods and systems for machine learning are disclosed for early detection of morphological changes in cell condition of biological cells. In one disclosed embodiment, the development of vaccines and anti-virals are sped up using machine learning to identify viral plaques earlier than can be detected using human observation alone. In the disclosed embodiment, detecting morphological changes in virus-infected cells can be made before plaques caused by cell death are observable (typical cell death in 2-14 days). Machine learning brings high-content/high-throughput techniques to the study of virology for the development of novel anti-viral compounds. Machine learning can also be used to characterize the effectiveness of novel anti-viral compounds on rapidly mutating viral strains, such as influenza and SARS-CoV-2.
    Type: Application
    Filed: February 4, 2022
    Publication date: August 18, 2022
    Inventors: Ilya Goldberg, Dmitry Fedorov, Christian A. Lang, Kristian Kvilekval, Katherine Yeung, Henry Rupert Dodkins
  • Publication number: 20210052519
    Abstract: The present invention provides small molecule drugs and pharmaceutical compositions for the treatment and prevention of diseases related to the formation of certain types of oligomers in a subject. More specifically, the drugs and compositions reduce or prevent the formation of oligomers formed from tau protein, TDP-43, Huntingtin's protein and/or alpha-synuclein. It further provides a method of reducing formation of or disrupting TDP-43, alpha-synuclein, Huntingtin's protein and/or tau protein oligomers in a subject, the method comprising the step of administering to the subject in need thereof a therapeutically effective amount of a pharmaceutical composition.
    Type: Application
    Filed: July 31, 2020
    Publication date: February 25, 2021
    Applicant: ACELOT,INC
    Inventors: Ambuj K. SINGH, Christian A. LANG
  • Publication number: 20200223788
    Abstract: The present invention provides small molecule drugs and pharmaceutical compositions for the treatment and prevention of diseases related to the formation of A?42 oligomers in a subject. It further provides a method of reducing formation of or disrupting A?42 oligomers in a subject, the method comprising the step of administering to the subject in need thereof a therapeutically effective amount of a pharmaceutical composition.
    Type: Application
    Filed: March 31, 2020
    Publication date: July 16, 2020
    Inventors: Ambuj K. Singh, Christian A. Lang
  • Patent number: 10703711
    Abstract: The present invention provides small molecule drugs and pharmaceutical compositions for the treatment and prevention of diseases related to the formation of A?42 oligomers in a subject. It further provides a method of reducing formation of or disrupting A?42 oligomers in a subject, the method comprising the step of administering to the subject in need thereof a therapeutically effective amount of a pharmaceutical composition.
    Type: Grant
    Filed: November 5, 2018
    Date of Patent: July 7, 2020
    Assignee: Acelot, Inc.
    Inventors: Ambuj K. Singh, Christian A. Lang
  • Publication number: 20190210959
    Abstract: The present invention provides small molecule drugs and pharmaceutical compositions for the treatment and prevention of diseases related to the formation of A?42 oligomers in a subject. It further provides a method of reducing formation of or disrupting A?42 oligomers in a subject, the method comprising the step of administering to the subject in need thereof a therapeutically effective amount of a pharmaceutical composition.
    Type: Application
    Filed: November 5, 2018
    Publication date: July 11, 2019
    Inventors: Ambuj K. Singh, Christian A. Lang
  • Patent number: 9785674
    Abstract: A method is provided for compressing results of a join query. A join order of a result set is determined from the join query, where the result set includes a plurality of tuples. A plurality of dictionary entries for the result set is received. A nested hierarchy of dictionaries is created based on the join order and the dictionary entries. A plurality of encoded tuples is received. The nested hierarchy of dictionaries is used by a processor to decode the plurality of encoded tuples so as to produce the plurality of tuples of the result set.
    Type: Grant
    Filed: December 5, 2016
    Date of Patent: October 10, 2017
    Assignee: International Business Machines Corporation
    Inventors: Christian A. Lang, Lipyeow Lim
  • Publication number: 20170083582
    Abstract: A method is provided for compressing results of a join query. A join order of a result set is determined from the join query, where the result set includes a plurality of tuples. A plurality of dictionary entries for the result set is received. A nested hierarchy of dictionaries is created based on the join order and the dictionary entries. A plurality of encoded tuples is received. The nested hierarchy of dictionaries is used by a processor to decode the plurality of encoded tuples so as to produce the plurality of tuples of the result set.
    Type: Application
    Filed: December 5, 2016
    Publication date: March 23, 2017
    Inventors: Christian A. Lang, Lipyeow LIM
  • Patent number: 9529853
    Abstract: A method is provided for compressing results of a join query. A join order of a result set is determined from the join query, where the result set includes a plurality of tuples. A plurality of dictionary entries for the result set is received. A nested hierarchy of dictionaries is created based on the join order and the dictionary entries. A plurality of encoded tuples is received. The nested hierarchy of dictionaries is used by a processor to decode the plurality of encoded tuples so as to produce the plurality of tuples of the result set.
    Type: Grant
    Filed: October 23, 2015
    Date of Patent: December 27, 2016
    Assignee: Armonk Business Machines Corporation
    Inventors: Christian A. Lang, Lipyeow Lim
  • Publication number: 20160042037
    Abstract: A method is provided for compressing results of a join query. A join order of a result set is determined from the join query, where the result set includes a plurality of tuples. A plurality of dictionary entries for the result set is received. A nested hierarchy of dictionaries is created based on the join order and the dictionary entries. A plurality of encoded tuples is received. The nested hierarchy of dictionaries is used by a processor to decode the plurality of encoded tuples so as to produce the plurality of tuples of the result set.
    Type: Application
    Filed: October 23, 2015
    Publication date: February 11, 2016
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Christian A. Lang, Lipyeow LIM
  • Patent number: 9218354
    Abstract: A method is provided for compressing results of a join query. A join order of a result set is determined from the join query, where the result set includes a plurality of tuples. A plurality of dictionary entries for the result set is received. A nested hierarchy of dictionaries is created based on the join order and the dictionary entries. A plurality of encoded tuples is received. The nested hierarchy of dictionaries is used by a processor to decode the plurality of encoded tuples so as to produce the plurality of tuples of the result set.
    Type: Grant
    Filed: February 28, 2013
    Date of Patent: December 22, 2015
    Assignee: International Business Machines Corporation
    Inventors: Christian A. Lang, Lipyeow Lim
  • Patent number: 8719295
    Abstract: Techniques are disclosed for multi-granularity hierarchical aggregate selection based on update, storage and response constraints. For example, for a temporal hierarchy of aggregation statistics associated with a plurality of database records, wherein the temporal hierarchy comprises two or more aggregation statistics levels and each level has a different temporal granularity associated therewith, a method comprises iteratively modifying the temporal hierarchy to at least one of: (a) minimize a storage usage cost while satisfying a temporal hierarchy update constraint and a query response time constraint; (b) reduce a temporal hierarchy update time and a query response time while satisfying a storage usage constraint; and (c) minimize a query response time for frequently applied queries that do not shift in time while satisfying the storage usage constraint, wherein the resulting temporal hierarchy that achieves at least one of (a), (b) and (c) is identified as an optimal temporal hierarchy.
    Type: Grant
    Filed: June 27, 2011
    Date of Patent: May 6, 2014
    Assignee: International Business Machines Corporation
    Inventors: Yuan-Chi Chang, Lawrence Koved, Christian A. Lang, Igor Sominsky
  • Patent number: 8423522
    Abstract: A method is provided for compressing results of a join query. A join order of a result set comprising multiple tuples is determined from the join query, and a nested hierarchy of dictionaries is maintained based on the join order. The nested hierarchy of dictionaries is used to encode each of the tuples of the result set so as to produce an encode tuple, and each of the encoded tuples is transmitted to a client system. Also provided is a method for decompressing results of a join query.
    Type: Grant
    Filed: January 4, 2011
    Date of Patent: April 16, 2013
    Assignee: International Business Machines Corporation
    Inventors: Christian A. Lang, Lipyeow Lim
  • Patent number: 8392577
    Abstract: A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. The logical operator is pinned to the given physical processing node. The pinning prevents any subsequent reassignment of the logical operator to another physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus. A determination is made as to whether at least one logical operating in the plurality of logical operators needs to be reassigned to a different physical processing node. The at least one logical operator is reassigned to the different physical processing node.
    Type: Grant
    Filed: July 27, 2012
    Date of Patent: March 5, 2013
    Assignee: International Business Machines Corporation
    Inventors: Jun-Jang Jeng, Christian A. Lang, Ioana Stanoi
  • Patent number: 8364818
    Abstract: A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. In response to determining that the logical operator requires processing on the given physical processing node, the logical operator is pinned to the given physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus.
    Type: Grant
    Filed: May 4, 2009
    Date of Patent: January 29, 2013
    Assignee: International Business Machines Corporation
    Inventors: Jun-Jang Jeng, Christian A. Lang, Ioana Stanoi
  • Publication number: 20120330996
    Abstract: Techniques are disclosed for multi-granularity hierarchical aggregate selection based on update, storage and response constraints. For example, for a temporal hierarchy of aggregation statistics associated with a plurality of database records, wherein the temporal hierarchy comprises two or more aggregation statistics levels and each level has a different temporal granularity associated therewith, a method comprises iteratively modifying the temporal hierarchy to at least one of: (a) minimize a storage usage cost while satisfying a temporal hierarchy update constraint and a query response time constraint; (b) reduce a temporal hierarchy update time and a query response time while satisfying a storage usage constraint; and (c) minimize a query response time for frequently applied queries that do not shift in time while satisfying the storage usage constraint, wherein the resulting temporal hierarchy that achieves at least one of (a), (b) and (c) is identified as an optimal temporal hierarchy.
    Type: Application
    Filed: June 27, 2011
    Publication date: December 27, 2012
    Applicant: International Business Machines Corporation
    Inventors: Yuan-Chi Chang, Lawrence Koved, Christian A. Lang, Igor Sominsky
  • Publication number: 20120297085
    Abstract: A system, method, and computer readable medium for reducing message flow on a message bus are disclosed. The method includes determining if at least one logical operator in a plurality of logical operators requires processing on a given physical processing node in a group of physical nodes. The logical operator is pinned to the given physical processing node. The pinning prevents any subsequent reassignment of the logical operator to another physical processing node. Each logical operator in the plurality of logical operators is assigned to an initial physical processing node in the group of physical processing nodes on a message bus. A determination is made as to whether at least one logical operating in the plurality of logical operators needs to be reassigned to a different physical processing node. The at least one logical operator is reassigned to the different physical processing node.
    Type: Application
    Filed: July 27, 2012
    Publication date: November 22, 2012
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jun-Jang JENG, Christian A. LANG, Ioana STANOI