Patents by Inventor Manuel Aparicio, IV

Manuel Aparicio, IV 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: 10635967
    Abstract: Methods, systems and computer program products memorize multiple inputs into an artificial neuron that includes multiple dendrites each having multiple dendrite compartments. Operations include computing coincidence detection as distal synapse activation that flows from more proximal ones of the dendrite compartments to a soma of the artificial neuron, generating a dendritic action potential responsive to the coincidence detection from a non-zero activation value input received at a corresponding one of the dendrite compartments that includes a non-zero receptivity, and responsive to generating the dendritic action potential, decrementing the activation value and the receptivity and passing the decremented activation value to a next one of the dendrite compartments.
    Type: Grant
    Filed: April 15, 2015
    Date of Patent: April 28, 2020
    Assignee: Intel Corporation
    Inventor: Manuel Aparicio, IV
  • Patent number: 10437893
    Abstract: Provided are methods, systems, and computer program products that generate a plurality of query queues that correspond to a plurality of row-based identifiers corresponding to a plurality of physical memory locations in at least one of a plurality of associative memory networks in response to a semantic-space based query that includes at least one query search element, determine count information responsive to the plurality of query queues and compute information distances between the at least one query search element and ones of associative memory query result elements to determine closeness values corresponding to the information distances.
    Type: Grant
    Filed: October 24, 2014
    Date of Patent: October 8, 2019
    Assignee: Intel Corporation
    Inventors: Paul Hofmann, Manuel Aparicio, IV, James S. Fleming
  • Patent number: 10296823
    Abstract: Associative memory systems, methods and computer program products are provided. An associative memory system includes a distributed associative memory base including a network of networks of associative memory networks. A respective associative memory network includes associations among a respective observer memories and a plurality of observed memories that are observed by the respective observer memory. Ones of the associative memory networks are physically and/or logically independent from other ones of the associative memory networks. A processing system is configured to observe associations into and imagine associations from, the distributed associative memory base using multiple streaming queues that correspond to respective ones of multiple rows in the associative memory networks. The processing system is further configured to determine a cognitive distance between a term and a class of terms, the cognitive distance being returned responsive to a query of the distributed associative memory base.
    Type: Grant
    Filed: November 14, 2014
    Date of Patent: May 21, 2019
    Assignee: Intel Corporation
    Inventors: Paul Hofmann, Manuel Aparicio, IV
  • Publication number: 20150294217
    Abstract: Methods, systems and computer program products memorize multiple inputs into an artificial neuron that includes multiple dendrites each having multiple dendrite compartments. Operations include computing coincidence detection as distal synapse activation that flows from more proximal ones of the dendrite compartments to a soma of the artificial neuron, generating a dendritic action potential responsive to the coincidence detection from a non-zero activation value input received at a corresponding one of the dendrite compartments that includes a non-zero receptivity, and responsive to generating the dendritic action potential, decrementing the activation value and the receptivity and passing the decremented activation value to a next one of the dendrite compartments.
    Type: Application
    Filed: April 15, 2015
    Publication date: October 15, 2015
    Inventor: Manuel Aparicio, IV
  • Publication number: 20150142807
    Abstract: Associative memory systems, methods and computer program products are provided. An associative memory system includes a distributed associative memory base including a network of networks of associative memory networks. A respective associative memory network includes associations among a respective observer memories and a plurality of observed memories that are observed by the respective observer memory. Ones of the associative memory networks are physically and/or logically independent from other ones of the associative memory networks. A processing system is configured to observe associations into and imagine associations from, the distributed associative memory base using multiple streaming queues that correspond to respective ones of multiple rows in the associative memory networks. The processing system is further configured to determine a cognitive distance between a term and a class of terms, the cognitive distance being returned responsive to a query of the distributed associative memory base.
    Type: Application
    Filed: November 14, 2014
    Publication date: May 21, 2015
    Inventors: Paul Hofmann, Manuel Aparicio, IV
  • Publication number: 20150120706
    Abstract: Provided are methods, systems, and computer program products that generate a plurality of query queues that correspond to a plurality of row-based identifiers corresponding to a plurality of physical memory locations in at least one of a plurality of associative memory networks in response to a semantic-space based query that includes at least one query search element, determine count information responsive to the plurality of query queues and compute information distances between the at least one query search element and ones of associative memory query result elements to determine closeness values corresponding to the information distances.
    Type: Application
    Filed: October 24, 2014
    Publication date: April 30, 2015
    Inventors: Paul Hoffman, Manuel Aparicio, IV, James S. Fleming
  • Patent number: 8972339
    Abstract: Analogies among entities may be detected by obtaining associative counts among the entities and computing similarity measures among given entities and other entities, using the associative counts. First and second entities are then identified as being analogies if the first entity has a strongest similarity measure with respect to the second entity and the second entity also has a strongest similarity measure with respect to the first entity. The similarity measures may be calculated using a normalized entropy inverted among a given entity and other entities.
    Type: Grant
    Filed: December 22, 2008
    Date of Patent: March 3, 2015
    Assignee: Saffron Technology, Inc.
    Inventors: Manuel Aparicio, IV, Yen-min Huang, David R. Cabana
  • Patent number: 8160981
    Abstract: A time of occurrence of an interest event of multiple events is anticipated based on time intervals between at least two previously occurring events and a previous occurrence of the interest event and based on a new occurrence of at least one of the events. For a respective event, multiple inter-event interval pairs based on occurrence times of pairs of respective remaining events relative to an occurrence time of the respective event are memorized. For a respective event, a time of future occurrence of the interest event from the respective event is predicted based on the inter-event interval pairs that have been memorized. The predicted time of future occurrence is also based on the new occurrence of the respective event and at least one of the events to obtain multiple interest event predictions of times of future occurrences of the interest event. The predictions are processed to generate an anticipated time when the interest event will occur in the future.
    Type: Grant
    Filed: September 25, 2008
    Date of Patent: April 17, 2012
    Assignee: Saffron Technology, Inc.
    Inventor: Manuel Aparicio, IV
  • Patent number: 7908438
    Abstract: Associative matrix compression methods, systems, computer program products and data structures compress an association matrix that contains counts that indicate associations among pairs of attributes. Selective bit plane representations of those selected segments of the association matrix that have at least one count is performed, to allow compression. More specifically, a set of segments is generated, a respective one of which defines a subset, greater than one, of the pairs of attributes. Selective identifications of those segments that have at least one count are stored. The at least one count that is associated with a respective identified segment is also stored as at least one bit plane representation. The at least one bit plane representation identifies a value of the at least one associated count for a bit position of the count that corresponds to the associated bit plane.
    Type: Grant
    Filed: June 3, 2009
    Date of Patent: March 15, 2011
    Assignee: Saffron Technology, Inc.
    Inventors: Michael J. Lemen, James S. Fleming, Manuel Aparicio, IV
  • Patent number: 7774291
    Abstract: Associative memory systems, methods and/or computer program products include a network of networks of associative memory networks. A network of entity associative memory networks is provided, a respective entity associative memory of which includes associations among a respective observer entity and observed entities that are observed by the respective observer entity, based on input documents. A network of feedback associative memory networks includes associations among observed entities for a respective positive and/or negative evaluation for a respective task of a respective user. A network of document associative memory networks includes associations among observed entities in a respective observed input source, such as a respective input document. A network of community associative memory networks includes associations among a respective observer entity, observed entities that are observed by the respective observer entity, and observed tasks of users in which the observer entity was queried.
    Type: Grant
    Filed: December 5, 2008
    Date of Patent: August 10, 2010
    Assignee: Saffron Technology, Inc.
    Inventors: James S. Fleming, Brian J. McGiverin, Manuel Aparicio, IV
  • Patent number: 7657496
    Abstract: Associative memories include associative memory cells. A respective cell includes a sensor input, a prior association representation, a next association representation and an associative output. The cells are serially interconnected to form a linear array, such that the sensor inputs, the prior association representations and the next association representations of the serially connected cells are arranged in a sequence from distal to proximal cells based on affinities of associations among the series of sensor inputs. A respective cell also includes processing logic. The processing logic is responsive to the associated sensor input being active, to send a measure of the next association representation to an adjacent proximal cell and/or to send a measure of prior association representation to an adjacent distal cell.
    Type: Grant
    Filed: June 26, 2006
    Date of Patent: February 2, 2010
    Assignee: Saffron Technology, Inc.
    Inventor: Manuel Aparicio, IV
  • Publication number: 20100023683
    Abstract: Associative matrix compression methods, systems, computer program products and data structures compress an association matrix that contains counts that indicate associations among pairs of attributes. Selective bit plane representations of those selected segments of the association matrix that have at least one count is performed, to allow compression. More specifically, a set of segments is generated, a respective one of which defines a subset, greater than one, of the pairs of attributes. Selective identifications of those segments that have at least one count are stored. The at least one count that is associated with a respective identified segment is also stored as at least one bit plane representation. The at least one bit plane representation identifies a value of the at least one associated count for a bit position of the count that corresponds to the associated bit plane.
    Type: Application
    Filed: June 3, 2009
    Publication date: January 28, 2010
    Inventors: Michael J. Lemen, James S. Fleming, Manuel Aparicio, IV
  • Publication number: 20090307057
    Abstract: Provided are an associative memory operator system and methods for predictive marketing analysis using a computer implemented social network. A system includes multiple associative memory cells corresponding to multiple computer implemented social network users. A respective one of the associative memory cells corresponds to a user in the computer implemented social network and includes a sink memory of associations corresponding to which ones of the computer implemented social network users have been influenced by the user and a source memory of associations corresponding to which other ones of the computer implemented social network users have influenced the user.
    Type: Application
    Filed: June 4, 2009
    Publication date: December 10, 2009
    Inventors: Albert Azout, Manuel Aparicio, IV
  • Patent number: 7574416
    Abstract: A location of a missing object is predicted based on past sightings of objects including the missing object, and a new sighting of the objects except for the missing object. For a respective given object in the objects, the past sightings are memorized based on respective distances of respective remaining objects from the respective given object. Distance-based memorization may take place using an agent or associative memory for a respective given object. Then, for a respective given object, except for the missing object, a distance of the missing object from the respective given object is predicted, based on the past sightings that have been memorized and the new sighting, to obtain candidate locations for the missing object. The candidate locations are then disambiguated, to predict the location of the missing object.
    Type: Grant
    Filed: January 14, 2005
    Date of Patent: August 11, 2009
    Assignee: Saffron Technology, Inc.
    Inventors: Manuel Aparicio, IV, David R. Cabana
  • Publication number: 20090198692
    Abstract: Analogies among entities may be detected by obtaining associative counts among the entities and computing similarity measures among given entities and other entities, using the associative counts. First and second entities are then identified as being analogies if the first entity has a strongest similarity measure with respect to the second entity and the second entity also has a strongest similarity measure with respect to the first entity. The similarity measures may be calculated using a normalized entropy inverted among a given entity and other entities.
    Type: Application
    Filed: December 22, 2008
    Publication date: August 6, 2009
    Inventors: Manuel Aparicio, IV, Yen-min Huang, David R. Cabana
  • Patent number: 7565491
    Abstract: Associative matrix compression methods, systems, computer program products and data structures compress an association matrix that contains counts that indicate associations among pairs of attributes. Selective bit plane representations of those selected segments of the association matrix that have at least one count is performed, to allow compression. More specifically, a set of segments is generated, a respective one of which defines a subset, greater than one, of the pairs of attributes. Selective identifications of those segments that have at least one count are stored. The at least one count that is associated with a respective identified segment is also stored as at least one bit plane representation. The at least one bit plane representation identifies a value of the at least one associated count for a bit position of the count that corresponds to the associated bit plane.
    Type: Grant
    Filed: August 4, 2005
    Date of Patent: July 21, 2009
    Assignee: Saffron Technology, Inc.
    Inventors: Michael J. Lemen, James S. Fleming, Manuel Aparicio, IV
  • Publication number: 20090119240
    Abstract: Associative memory systems, methods and/or computer program products include a network of networks of associative memory networks. A network of entity associative memory networks is provided, a respective entity associative memory of which includes associations among a respective observer entity and observed entities that are observed by the respective observer entity, based on input documents. A network of feedback associative memory networks includes associations among observed entities for a respective positive and/or negative evaluation for a respective task of a respective user. A network of document associative memory networks includes associations among observed entities in a respective observed input source, such as a respective input document. A network of community associative memory networks includes associations among a respective observer entity, observed entities that are observed by the respective observer entity, and observed tasks of users in which the observer entity was queried.
    Type: Application
    Filed: December 5, 2008
    Publication date: May 7, 2009
    Inventors: James S. Fleming, Brian J. McGiverin, Manuel Aparicio, IV
  • Publication number: 20090083207
    Abstract: A time of occurrence of an interest event of multiple events is anticipated based on time intervals between at least two previously occurring events and a previous occurrence of the interest event and based on a new occurrence of at least one of the events. For a respective event, multiple inter-event interval pairs based on occurrence times of pairs of respective remaining events relative to an occurrence time of the respective event are memorized. For a respective event, a time of future occurrence of the interest event from the respective event is predicted based on the inter-event interval pairs that have been memorized. The predicted time of future occurrence is also based on the new occurrence of the respective event and at least one of the events to obtain multiple interest event predictions of times of future occurrences of the interest event. The predictions are processed to generate an anticipated time when the interest event will occur in the future.
    Type: Application
    Filed: September 25, 2008
    Publication date: March 26, 2009
    Inventor: Manuel Aparicio, IV
  • Patent number: 7478192
    Abstract: Associative memory systems, methods and/or computer program products include a network of networks of associative memory networks. A network of entity associative memory networks is provided, a respective entity associative memory of which includes associations among a respective observer entity and observed entities that are observed by the respective observer entity, based on input documents. A network of feedback associative memory networks includes associations among observed entities for a respective positive and/or negative evaluation for a respective task of a respective user. A network of document associative memory networks includes associations among observed entities in a respective observed input source, such as a respective input document. A network of community associative memory networks includes associations among a respective observer entity, observed entities that are observed by the respective observer entity, and observed tasks of users in which the observer entity was queried.
    Type: Grant
    Filed: November 3, 2004
    Date of Patent: January 13, 2009
    Assignee: Saffron Technology, Inc.
    Inventors: James S. Fleming, Brian J. McGiverin, Manuel Aparicio, IV
  • Patent number: 7478090
    Abstract: Analogies among entities may be detected by obtaining associative counts among the entities and computing similarity measures among given entities and other entities, using the associative counts. First and second entities are then identified as being analogies if the first entity has a strongest similarity measure with respect to the second entity and the second entity also has a strongest similarity measure with respect to the first entity. The similarity measures may be calculated using a normalized entropy inverted among a given entity and other entities.
    Type: Grant
    Filed: January 14, 2005
    Date of Patent: January 13, 2009
    Assignee: Saffron Technology, Inc.
    Inventors: Manuel Aparicio, IV, Yen-min Huang, David R. Cabana