Patents by Inventor Jason Ma

Jason Ma 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: 9569070
    Abstract: Systems, methods, and graphical user interfaces are disclosed that assist a user in deconflicting concurrency conflicts in a peering network in which ambiguous concurrency conflicts can arise. In accordance with some embodiments, a method for assisting a user in deconflicting concurrency conflicts is disclosed. The method includes detecting a plurality of ambiguous data conflicts between the local deployment and the peer deployment. The method further includes providing a graphical user interface to a user at the local deployment that allows the user to filter the plurality of ambiguous data conflicts according to a selected data conflict type of a plurality of predefined data conflict types selectable by the user through the graphical user interface. By providing such as graphical user interface, the user can easily filter a large number (e.g., hundreds) of ambiguous concurrency conflicts that may exist at a given time between the local deployment and the peer deployment.
    Type: Grant
    Filed: November 11, 2013
    Date of Patent: February 14, 2017
    Assignee: Palantir Technologies, Inc.
    Inventors: Jason Ma, James Thompson, Tony Poor, Richard Allen Ducott, III, Alexander Landau
  • Patent number: 9544388
    Abstract: Disclosed are various embodiments for client-side predictive caching of content to facilitate instantaneous use of the content. If a user is likely to commence use of a content item through a client, the client is configured to predictively cache the content item before the user commences use. In doing so, the client may obtain metadata for the content item and an initial portion of the content item from another computing device. The client may then initialize various resources to facilitate instantaneous use of the content item by the client based at least in part on the metadata and the initial portion. The client-side cache may be divided into multiple segments with different content selection criteria.
    Type: Grant
    Filed: May 9, 2014
    Date of Patent: January 10, 2017
    Assignee: Amazon Technologies, Inc.
    Inventors: Lei Li, Andrew Jason Ma, Gurpreet Singh Ahluwalia, Abhishek Dubey, Sachin Shah, Vijay Sen, Gregory Scott Benjamin, Prateek RameshChandra Shah, Cody Wayne Maxwell Powell, Meltem Celikel, Darryl Hudgin, James Marvin Freeman, Aaron M. Bromberg, Bryant F. Herron-Patmon, Nush Karmacharya, Joshua B. Barnard, Peter Wei-Chih Chen, Stephen A. Slotnick, Andrew J. Watts, Richard J. Winograd
  • Publication number: 20170003880
    Abstract: In at least one embodiment, a controller of a non-volatile memory array including a plurality of subdivisions stores write data within the non-volatile memory array utilizing a plurality of block stripes of differing numbers of blocks, where all of the blocks within each block stripe are drawn from different ones of the plurality of subdivisions. The controller builds new block stripes for storing write data from blocks selected based on estimated remaining endurances of blocks in each of the plurality of subdivisions.
    Type: Application
    Filed: June 30, 2015
    Publication date: January 5, 2017
    Inventors: TIMOTHY J. FISHER, AARON D. FRY, NIKOLAS IOANNOU, IOANNIS KOLTSIDAS, JASON MA, ROMAN A. PLETKA, LINCOLN T. SIMMONS, SASA TOMIC
  • Publication number: 20160369260
    Abstract: Reverse transcriptase mixtures with improved storage stability are provided.
    Type: Application
    Filed: August 31, 2016
    Publication date: December 22, 2016
    Inventors: Jason Ma, Xiao-Song Gong
  • Publication number: 20160366164
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Application
    Filed: September 15, 2014
    Publication date: December 15, 2016
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Publication number: 20160344758
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Application
    Filed: August 29, 2014
    Publication date: November 24, 2016
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Patent number: 9458484
    Abstract: Reverse transcriptase mixtures with improved storage stability are provided.
    Type: Grant
    Filed: October 20, 2011
    Date of Patent: October 4, 2016
    Assignee: Bio-Rad Laboratories, Inc.
    Inventors: Jason Ma, Xiao-Song Gong
  • Publication number: 20160253750
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, automatically tag and group those clustered data structures, and provide results of the automated analysis and grouping in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a tiled display of the groups of related data clusters such that the analyst may quickly and efficiently evaluate the groups of data clusters. In particular, the groups of data clusters may be dynamically re-grouped and/or filtered in an interactive user interface so as to enable an analyst to quickly navigate among information associated with various groups of data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation.
    Type: Application
    Filed: May 11, 2016
    Publication date: September 1, 2016
    Inventors: Alexander Visbal, James Thompson, Marvin Sum, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Devin Witherspoon, Victoria Lai, Steven Berler, Alexei Smaliy, Suchan Lee
  • Publication number: 20160180451
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, automatically tag and group those clustered data structures, and provide results of the automated analysis and grouping in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a tiled display of the groups of related data clusters such that the analyst may quickly and efficiently evaluate the groups of data clusters. In particular, the groups of data clusters may be dynamically re-grouped and/or filtered in an interactive user interface so as to enable an analyst to quickly navigate among information associated with various groups of data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation.
    Type: Application
    Filed: December 22, 2014
    Publication date: June 23, 2016
    Inventors: Alexander Visbal, James Thompson, Marvin Sum, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Devin Witherspoon, Victoria Lai, Steven Berler, Alexei Smaliy, Suchan Lee
  • Publication number: 20160171616
    Abstract: According to some embodiments, a communication may be received from a customer in connection with an insurance policy. A system may then transmit, to a service representative device, data associated with an insurance knowledge management enterprise portal displaying information to facilitate interaction with the customer. A type of insurance event associated with the communication from the customer may be determined, and customized data associated with the insurance knowledge management enterprise portal may be transmitted to the service representative device, the customized data being based at least in part on the type of insurance event associated with the communication from the customer.
    Type: Application
    Filed: December 15, 2014
    Publication date: June 16, 2016
    Inventors: Mark Richard Wagner, Sandra J. Stevens, Belinda A. Lellock, Anthony Jason Ma'luf, Kurt E. Grashaw
  • Patent number: 9367872
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, automatically tag and group those clustered data structures, and provide results of the automated analysis and grouping in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a tiled display of the groups of related data clusters such that the analyst may quickly and efficiently evaluate the groups of data clusters. In particular, the groups of data clusters may be dynamically re-grouped and/or filtered in an interactive user interface so as to enable an analyst to quickly navigate among information associated with various groups of data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation.
    Type: Grant
    Filed: December 22, 2014
    Date of Patent: June 14, 2016
    Assignee: PALANTIR TECHNOLOGIES INC.
    Inventors: Alexander Visbal, James Thompson, Marvin Sum, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Devin Witherspoon, Vicktoria Lai, Steven Berler, Alexei Smaliy, Suchan Lee
  • Patent number: 9344447
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analysis (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Grant
    Filed: September 15, 2014
    Date of Patent: May 17, 2016
    Assignee: Palantir Technologies Inc.
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Publication number: 20160006749
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyses (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Application
    Filed: September 15, 2014
    Publication date: January 7, 2016
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Patent number: 9202249
    Abstract: Embodiments of the present disclosure relate to a data analysis system that may automatically generate memory-efficient clustered data structures, automatically analyze those clustered data structures, and provide results of the automated analysis in an optimized way to an analyst. The automated analysis of the clustered data structures (also referred to herein as data clusters) may include an automated application of various criteria or rules so as to generate a compact, human-readable analysis of the data clusters. The human-readable analyzes (also referred to herein as “summaries” or “conclusions”) of the data clusters may be organized into an interactive user interface so as to enable an analyst to quickly navigate among information associated with various data clusters and efficiently evaluate those data clusters in the context of, for example, a fraud investigation. Embodiments of the present disclosure also relate to automated scoring of the clustered data structures.
    Type: Grant
    Filed: August 29, 2014
    Date of Patent: December 1, 2015
    Assignee: Palantir Technologies Inc.
    Inventors: David Cohen, Jason Ma, Bing Jie Fu, Ilya Nepomnyashchiy, Steven Berler, Alex Smaliy, Jack Grossman, James Thompson, Julia Boortz, Matthew Sprague, Parvathy Menon, Michael Kross, Michael Harris, Adam Borochoff
  • Publication number: 20150309719
    Abstract: Embodiments of the present disclosure relate to user interfaces and systems that may enable dynamic and interactive access of, investigation of, and analysis of data objects stored in one or more databases. The data objects may be accessed from the one or more databases, and presented in multiple related portions of a display. In particular, the system provides a time-based visualization of data objects (and/or properties associated with the data objects) to a user such that the user may, for example, determine connections between various data objects, observe flows of information among data objects, and/or investigate related data objects.
    Type: Application
    Filed: April 24, 2015
    Publication date: October 29, 2015
    Inventors: Jason Ma, Aaron Davidson
  • Publication number: 20150253978
    Abstract: An event matrix may comprise labels and indicators corresponding to objects and links of an ontology. The objects and links may be determined from a plurality of data sources by a data integration system. Some of the labels may correspond to event objects, and may be arranged in a first spatial dimension at least in part on the basis of dates associated with said event objects. Other labels may correspond to non-event objects, and may be arranged in a second spatial dimension. Indicators may correspond to links between the event and non-event objects. An indicator for a particular link may be positioned with respect to the first and second spatial dimensions in accordance with the locations of the labels that correspond to the objects connected by the link.
    Type: Application
    Filed: December 15, 2014
    Publication date: September 10, 2015
    Inventors: Jason Ma, Brian Lee, Evan Minamoto
  • Patent number: 8917274
    Abstract: An event matrix may comprise labels and indicators corresponding to objects and links of an ontology. The objects and links may be determined from a plurality of data sources by a data integration system. Some of the labels may correspond to event objects, and may be arranged in a first spatial dimension at least in part on the basis of dates associated with said event objects. Other labels may correspond to non-event objects, and may be arranged in a second spatial dimension. Indicators may correspond to links between the event and non-event objects. An indicator for a particular link may be positioned with respect to the first and second spatial dimensions in accordance with the locations of the labels that correspond to the objects connected by the link.
    Type: Grant
    Filed: December 19, 2013
    Date of Patent: December 23, 2014
    Assignee: Palantir Technologies Inc.
    Inventors: Jason Ma, Brian Lee, Evan Minamoto
  • Publication number: 20140267294
    Abstract: An event matrix may comprise labels and indicators corresponding to objects and links of an ontology. The objects and links may be determined from a plurality of data sources by a data integration system. Some of the labels may correspond to event objects, and may be arranged in a first spatial dimension at least in part on the basis of dates associated with said event objects. Other labels may correspond to non-event objects, and may be arranged in a second spatial dimension. Indicators may correspond to links between the event and non-event objects. An indicator for a particular link may be positioned with respect to the first and second spatial dimensions in accordance with the locations of the labels that correspond to the objects connected by the link.
    Type: Application
    Filed: December 19, 2013
    Publication date: September 18, 2014
    Applicant: Palantir Technologies, Inc.
    Inventors: Jason Ma, Brian Lee, Evan Minamoto
  • Publication number: 20120129238
    Abstract: Reverse transcriptase mixtures with improved storage stability are provided.
    Type: Application
    Filed: October 20, 2011
    Publication date: May 24, 2012
    Applicant: Bio-Rad Laboratories, Inc.
    Inventors: Jason Ma, Xiao-Song Gong