| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 706056000 | Predicate logic or predicate calculus | 12 |
| 20090157589 | SYSTEM FOR OPINION RECONCILIATION - A system is disclosed for reconciling opinions generated by agents with respect to one or more predicates. The disclosed system may use observed variables and a probabilistic model including latent parameters to estimate a truth score associated with each of the predicates. The truth score, as well as one or more of the latent parameters of the probabilistic model, may be estimated based on the observed variables. The truth score generated by the disclosed system may enable publishers to reliably represent the truth of a predicate to interested users. | 06-18-2009 |
| 20090281981 | Discriminant Forest Classification Method and System - A hybrid machine learning methodology and system for classification that combines classical random forest (RF) methodology with discriminant analysis (DA) techniques to provide enhanced classification capability. A DA technique which uses feature measurements of an object to predict its class membership, such as linear discriminant analysis (LDA) or Andersen-Bahadur linear discriminant technique (AB), is used to split the data at each node in each of its classification trees to train and grow the trees and the forest. When training is finished, a set of n DA-based decision trees of a discriminant forest is produced for use in predicting the classification of new samples of unknown class. | 11-12-2009 |
| 20100042577 | SYSTEMS AND METHODS FOR CALIBRATING USER RATINGS - A website may allow users to rate content items displayed thereon. The user ratings associated with the content items may be weighted according to user rating weight. The rating weight of a particular user may be based, in whole or part, upon whether the user consistently rates content items similarly to one or more “expert” raters. The experts may be selected based on various factors including: professional training, experience, reputation on the website, or the like. If a particular user consistently rates content items similarly to the experts, the user may be given a high rating weight. Users whose ratings consistently diverge from the ratings assigned by the experts may be given a lower rating weight. The weights may be displayed in connection with a user profile, or may be hidden from the user community. The rating weights may be used in calculating an overall rating of a particular content item. | 02-18-2010 |
| 20110040722 | PREDICATE SELECTION IN EVENT FILTERING - An apparatus, method and computer program for evaluating an event in a data processing system, wherein the event comprises a plurality of predicates, the apparatus comprising: a receive component operable for receiving the event; an analyze component, operable for analyzing a plurality of first relationships between the plurality of predicates and a plurality of first values; an order component, operable for ordering the plurality of predicates; an evaluate component, responsive to the order component identifying that one of the plurality of predicates is a primary predicate, operable for evaluating the event for the primary predicate and for determining a result, wherein the result indicates whether the event is true or false for the primary predicate; and an update component, responsive to the evaluate component evaluating the event for the primary predicate, operable for updating the plurality of first values. | 02-17-2011 |
| 20130036085 | METHOD FOR SOLVING LINEAR PROGRAMS - The invention provides for a computer-implemented method for solving a linear program (LP), the method comprising the steps of:
| 02-07-2013 |
| 20130124451 | CLUSTER SYSTEMS AND METHODS - Information cluster systems and methods are presented. In one embodiment, a cluster method comprises: performing an engine process including issuing requests to bring a resource online, offline, and monitor the resources, wherein the engine process is performed by an engine; performing a resource interaction process including interacting with a resource and directing a resource to comply with the request from the engine process, wherein the resource interaction process is performed by a resource interaction agent; performing a predicate logic process including performing predicate logic operations to determine if a predicate logic condition associated with the resource is satisfied and forwarding an indication of the results of the predicate logic operations to the engine process, wherein the predicate logic process is performed by a predicate logic agent that is separate from the engine performing the engine process. | 05-16-2013 |
| 20130124452 | MODEL-THEORETIC APPROACH TO DATA ANONYMITY AND INFERENCE CONTROL - A system and method for secure data management is presented. The method comprises receiving a query, performing the query and obtaining answers to it, creating certain formulas representing the answers; and determining whether there is a minimum number of distinct models of these formulas conjoined with the relevant anonymity predicates along with previous answers and general background knowledge, and when that number of models does not exist, suppressing the answers. In one aspect, the method further comprises creating formulas encoding the information conveyed by the answer; and combining the formulas encoding the information with prior information. | 05-16-2013 |
| 20130138600 | APPARATUS AND METHOD FOR MANAGAING AXIOM, AND REASONING APPARATUS INCLUDING THE SAME - A method of managing an axiom includes determining if an H in an A→H axiom in existing axioms is a predetermined expression; and if the H is the predetermined expression, collecting, from the existing axioms, a B→I axiom in which the B includes the H, deleting the A→H axiom from the existing axioms, and generating a new B→I axiom from the collected B→I axiom by replacing the H in the B with the A. | 05-30-2013 |
| 20140181000 | INTERPRETATION ENGINE AND ASSOCIATED METHOD - An interpretation engine for an interoperable device is disclosed. The interpretation engine is configured to receive data and to determine a function to be executed in response to the received data and in accordance with a knowledge base that comprises one or more relationships that are structured in triplets. Each triplet comprises a subject, a predicate and an object. The interpretation engine is configured to recognize only a predetermined, fixed plurality of predicate values. | 06-26-2014 |
| 20150066836 | Methods and Systems of Four-Valued Simulation - A system for the dynamic encoding in a semantic network of both syntactic and semantic information into a common four valued logical notation. The encoding of new information being benign to prior syntactic constructions, tests for N conditionals in time O(C) and allows for the proper quantification of variables at each recursive step. The query/inference engine constructed from such an implementation is able to optimize short term memory for maximizing long term storage in the automaton. In a parallel context this can be viewed as optimizing communication and memory allocation between processes. Disclosed embodiments of a four valued encoding achieve efficiencies in minimizing the run time stack and maximizing heap size especially in a parallel architecture. Disclosed embodiments are useful in simulation and search engine implementations. | 03-05-2015 |
| 20150371140 | Minimizing Symbolic Finite Automata - Techniques are provided herein for minimizing symbolic finite automata. The techniques for minimizing symbolic finite automata include the selection of a set of states, which may include a set of final states or a set of non-final states. By following the transitions from the selected states, techniques disclosed herein define partitions between various states of the SFA. Techniques are applied to the states in each partition to determine the states and state transitions of a minimized symbolic finite automaton. Techniques disclosed herein allow for the minimization of a symbolic finite automaton without the need to calculate minterms. | 12-24-2015 |
| 20160379131 | FUZZY OPAQUE PREDICATES - Disclosed are secure processes based upon fuzzy opaque predicates and machines such as processors and non-transitory machine-readable storage mediums encoded with instructions containing fuzzy opaque predicates. | 12-29-2016 |
