Patents by Inventor Jean-Louis Ardoin

Jean-Louis Ardoin 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).

  • Object relationship management system
    Patent number: 6772168
    Abstract: A method for maintaining relationships between entities in a computer system, each entity having a plurality nodes, includes the steps of: modifying one of the plurality of nodes; searching for a plurality of dependent nodes from the plurality of nodes coupled to the one node; ordering the plurality of dependent nodes into an order; and evaluating the plurality of dependent nodes in the order.
    Type: Grant
    Filed: May 7, 2001
    Date of Patent: August 3, 2004
    Assignee: Intergraph Software Technologies Company
    Inventors: Jean-Louis Ardoin, Richard M. Eade, Robert Patience, Alain Falasse, Dave L. Brann, Gerard J. Attilio, Alfredo Arce
  • Managing object relationships using an object repository
    Patent number: 6633869
    Abstract: A method for maintaining consistency between objects in a computer system by defining relationship patterns. A relationship pattern is a collection of entities having relationships with a common entity called an active entity. A semantic entity is associated with the active entity describing the actions to be performed for updating one or more entities of the relationship pattern in response to modification, copying, or deletion of one or more entities participating in the relationship pattern.
    Type: Grant
    Filed: April 28, 2000
    Date of Patent: October 14, 2003
    Assignee: Intergraph Corporation
    Inventors: Yann Limon Duparcmeur, Robert N. Patience, Jean Louis Ardoin
  • Object relationship management system
    Publication number: 20020099684
    Abstract: A method for maintaining relationships between entities in a computer system, each entity having a plurality nodes, includes the steps of: modifying one of the plurality of nodes; searching for a plurality of dependent nodes from the plurality of nodes coupled to the one node; ordering the plurality of dependent nodes into an order; and evaluating the plurality of dependent nodes in the order.
    Type: Application
    Filed: May 7, 2001
    Publication date: July 25, 2002
    Inventors: Jean-Louis Ardoin, Richard M. Eade, Robert Patience, Alain Falasse, Dave L. Brann, Gerard J. Attilio, Alfredo Arce
  • Object relationship management system
    Patent number: 6292804
    Abstract: A method for maintaining relationships between entities in a computer system, each entity having a plurality nodes, includes the steps of: modifying one of the plurality of nodes; searching for a plurality of dependent nodes from the plurality of nodes coupled to the one node; ordering the plurality of dependent nodes into an order; and evaluating the plurality of dependent nodes in the order.
    Type: Grant
    Filed: December 13, 1999
    Date of Patent: September 18, 2001
    Assignee: Intergraph Corporation
    Inventors: Jean-Louis Ardoin, Richard M. Eade, Robert Patience, Alain Falasse, Dave L. Brann, Gerard J. Attilio, Alfredo Arce
  • Object relationship management system
    Patent number: 6052691
    Abstract: A method for maintaining relationships between entities in a computer system, each entity having a plurality nodes, includes the steps of: modifying one of the plurality of nodes; searching for a plurality of dependent nodes from the plurality of nodes coupled to the one node; ordering the plurality of dependent nodes into an order; and evaluating the plurality of dependent nodes in the order.
    Type: Grant
    Filed: September 24, 1997
    Date of Patent: April 18, 2000
    Assignee: Intergraph Corporation
    Inventors: Jean-Louis Ardoin, Richard M. Eade, Robert Patience, Alain Falasse, Dave L. Brann, Gerard J. Attilio, Alfredo Arce
  • Object relationship management system
    Patent number: 5692184
    Abstract: A method for maintaining relationships between entities in a computer system, each entity having a plurality of nodes, includes the steps of: modifying one of the plurality of nodes; searching for a plurality of dependent nodes from the plurality of nodes coupled to the one node; ordering the plurality of dependent nodes into an order; and evaluating the plurality of dependent nodes in the order.
    Type: Grant
    Filed: May 9, 1995
    Date of Patent: November 25, 1997
    Assignee: Intergraph Corporation
    Inventors: Jean-Louis Ardoin, Richard M. Eade, Robert Patience, Alain Falasse, Dave L. Brann, Gerard J. Attilio, Alfredo Arce