Patents Assigned to NAMESFORLIFE, LLC
-
Patent number: 10896236Abstract: The present invention provides systems and methods for automatically identifying name-like-strings in digital resources, matching these name-like-string against a set of names held in an expertly curated database, and for those name-like-strings found in said database, enhancing the content by associating additional matter with the name, wherein said matter includes information about the names that is held within said database and pointers to other digital resources which include the same name and it synonyms.Type: GrantFiled: February 11, 2019Date of Patent: January 19, 2021Assignee: NAMESFORLIFE, LLCInventors: Charles T. Parker, Catherine M. Lyons, Gerald P. Roston, George M. Garrity
-
Patent number: 10535003Abstract: A method for establishing semantic equivalence between a plurality of concepts including: providing an Orthogonal Semantic Equivalence Map in which first, second, and third extensional concept models are related; selecting or de-selecting a concept in the first concept model; selecting or deselecting a (relation, concept) pair representing an intensional relation from a concept in the first concept model to a concept in the second concept model over a concept in the third concept model; determining a subset of intensional relations from the selected concepts in the first concept model to concepts in the second concept model; determining a set of concepts from the first concept model that are related to concepts in the second concept model over the selected (relation, concept) pairs; and determining the narrowest common extension of the set of concepts from the first, second, or third concept models that are related over the selected intensional relations.Type: GrantFiled: September 22, 2014Date of Patent: January 14, 2020Assignees: NamesForLife, LLC, Board of Trustees of Michigan State UniversityInventors: Charles T. Parker, Jr., George M. Garrity, Nenad Krdzavac
-
Patent number: 10204168Abstract: The present invention provides systems and methods for automatically identifying name-like-strings in digital resources, matching these name-like-string against a set of names held in an expertly curated database, and for those name-like-strings found in said database, enhancing the content by associating additional matter with the name, wherein said matter includes information about the names that is held within said database and pointers to other digital resources which include the same name and it synonyms.Type: GrantFiled: June 6, 2017Date of Patent: February 12, 2019Assignee: NAMESFORLIFE, LLCInventors: Charles T. Parker, Catherine M. Lyons, Gerald P. Roston, George M. Garrity
-
Patent number: 9672293Abstract: The present invention provides systems and methods for automatically identifying name-like-strings in digital resources, matching these name-like-string against a set of names held in an expertly curated database, and for those name-like-strings found in said database, enhancing the content by associating additional matter with the name, wherein said matter includes information about the names that is held within said database and pointers to other digital resources which include the same name and it synonyms.Type: GrantFiled: January 12, 2010Date of Patent: June 6, 2017Assignee: NAMESFORLIFE, LLCInventors: Charles T. Parker, Catherine M. Lyons, Gerald P. Roston, George M. Garrity
-
Patent number: 9659145Abstract: DNA sequences are analyzed using latent semantic analysis. A set of nucleotide sequences is received in which the set has a first number of sequences. A set of basis vectors is determined, in which the set has a second number of basis vectors, the second number being smaller than the first number. Each basis vector represents a specific combination of predetermined nucleotide segments. For each of the nucleotide sequences, an approximate representation of the nucleotide sequence is determined based on a combination of the basis vectors. For each pair of nucleotide sequences, a distance between the pair of nucleotide sequences is determined according the distance between the approximate representation of the pair of nucleotide sequences. The set of nucleotide sequences are classified based on the distances between the pairs of nucleotide sequences.Type: GrantFiled: July 30, 2013Date of Patent: May 23, 2017Assignees: NUtech Ventures, NamesforLife, LLCInventors: Khalid Sayood, Sam Way, Ozkan Ufuk Nalbantoglu, George Garrity
-
Publication number: 20160224893Abstract: A method for establishing semantic equivalence between a plurality of concepts including: providing an Orthogonal Semantic Equivalence Map in which first, second, and third extensional concept models are related; selecting or de-selecting a concept in the first concept model; selecting or deselecting a (relation, concept) pair representing an intensional relation from a concept in the first concept model to a concept in the second concept model over a concept in the third concept model; determining a subset of intensional relations from the selected concepts in the first concept model to concepts in the second concept model; determining a set of concepts from the first concept model that are related to concepts in the second concept model over the selected (relation, concept) pairs; and determining the narrowest common extension of the set of concepts from the first, second, or third concept models that are related over the selected intensional relations.Type: ApplicationFiled: September 22, 2014Publication date: August 4, 2016Applicants: NamesForlife, LLC, Bord of Trustees of Michigan State UniversityInventors: Charles T. Parker, Jr., George M. Garrity, Nenad Krdzavac
-
Patent number: 8903825Abstract: A method of classifying a plurality of documents. The method includes steps of providing a first set of classification terms and a second set of classification terms, the second set of classification terms being different from the first set of classification terms; generating a first frequency array of a number of occurrences of each term from the first set of classification terms in each document; generating a second frequency array of a number of occurrences of each term from the second set of classification terms in each document; generating a first similarity matrix from the first frequency array; generating a second similarity matrix from the second frequency array; determining an entrywise combination of the first similarity matrix and the second similarity matrix; and clustering the plurality of documents based on the result of the entrywise combination.Type: GrantFiled: May 23, 2012Date of Patent: December 2, 2014Assignee: NamesforLife LLCInventors: Charles T. Parker, George M. Garrity
-
Publication number: 20130013603Abstract: A method of classifying a plurality of documents. The method includes steps of providing a first set of classification terms and a second set of classification terms, the second set of classification terms being different from the first set of classification terms; generating a first frequency array of a number of occurrences of each term from the first set of classification terms in each document; generating a second frequency array of a number of occurrences of each term from the second set of classification terms in each document; generating a first similarity matrix from the first frequency array; generating a second similarity matrix from the second frequency array; determining an entrywise combination of the first similarity matrix and the second similarity matrix; and clustering the plurality of documents based on the result of the entrywise combination.Type: ApplicationFiled: May 23, 2012Publication date: January 10, 2013Applicant: NAMESFORLIFE, LLCInventors: Charles T. Parker, George M. Garrity