Patents by Inventor Mark A. Simos

Mark A. Simos 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).

  • Conceptual factoring and unification of graphs representing semantic models
    Patent number: 6847979
    Abstract: Techniques for factoring one or more source graphs into a composite graph containing nodes representing analogous elements of the source graphs and a variability graph containing nodes representing differences in the source graphs. The composite graph is made by taking analogous input trees from the source graphs and traversing the trees from top to bottom looking for nodes in each tree at each level that are analogous to the nodes at that level in the other input trees. The sets of analogous nodes are found by first automatically correlating the nodes in the level currently being examined. Correlation may, for example, be based on similar values of a property of the nodes being correlated. Representations of the sets of correlated nodes are then displayed to a user, who indicates which sets of correlated nodes are in fact analogous.
    Type: Grant
    Filed: February 23, 2001
    Date of Patent: January 25, 2005
    Assignee: Synquiry Technologies, LTD
    Inventors: Dean T. Allemang, Mark A. Simos
  • Conceptual factoring and unification of graphs representing semantic models
    Publication number: 20030050915
    Abstract: Techniques for factoring one or more source graphs into a composite graph containing nodes representing analogous elements of the source graphs and a variability graph containing nodes representing differences in the source graphs. The composite graph is made by taking analogous input trees from the source graphs and traversing the trees from top to bottom looking for nodes in each tree at each level that are analogous to the nodes at that level in the other input trees. The sets of analogous nodes are found by first automatically correlating the nodes in the level currently being examined. Correlation may, for example, be based on similar values of a property of the nodes being correlated. Representations of the sets of correlated nodes are then displayed to a user, who indicates which sets of correlated nodes are in fact analogous.
    Type: Application
    Filed: August 23, 2002
    Publication date: March 13, 2003
    Inventors: Dean T. Allemang, Mark A. Simos