Patents by Inventor Thomas Lumpp

Thomas Lumpp 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: 6952690
    Abstract: This invention describes a method to verify non-looping properties of programs implemented as rule-based expert systems. Our method detects conditions under which the expert system enters erroneous infinite program loops, which lead to non-terminating or oscillating computations, or otherwise proves the absence of such conditions. Our automatic procedure also gives advice on how to correct these errors. The expert systems considered consist of condition-action rules (IF-THEN-statements), where the conditions are logical expressions (formulas of a propositional finite domain logic), and the actions modify the value of a single variable which in turn can be part of other logical expressions. There may be additional (external) variables not controlled by the expert system, and each rule may have an associated evaluation priority.
    Type: Grant
    Filed: August 22, 2002
    Date of Patent: October 4, 2005
    Assignee: International Business Machines Corporation
    Inventors: Thomas Lumpp, Juergen Schneider, Wolfgang Kuechlin, Carsten Sinz
  • Publication number: 20050091352
    Abstract: An autonomic computing system and method determine policy definitions (404) and a set of available actions (410); monitor resources distributed within the system; determine if the system is at a desired end state; and modify resource states by sending instructions for the resources to perform available actions. The policy definitions (404) specify: start order between resources, prioritization between resources, conditional activation of policies, desired end state of resources, and location limitation of resources. The system and method receive status information from available resources, and monitor and modify the system until it reaches the desired end state. The policy definitions (404) can be determined by specifying a user-defined system end state and resource relationships. The policy definitions (404) can further harvest implicit relationships between resources, via self-discovery, and underlying relationships among resources.
    Type: Application
    Filed: September 30, 2003
    Publication date: April 28, 2005
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: John Alex, Peter Badovinatz, Reinhard Buendgen, Chun-Shi Chang, Gregory Laib, Rong-Sheng Lee, Jeffrey Lucash, Thomas Lumpp, Juergen Schneider
  • Publication number: 20050081097
    Abstract: The present invention provides a system and method for the execution of jobs in a distributed computing architecture that uses worker clients which are characterized by a checkpointing mechanism component for generating checkpointing information being assigned to at least one worker client, at least one failover system being assigned to the worker client, a component (failover system selection component) for automatically assigning at least one existing or newly created failover system to the failure system being assigned to a worker client in the case said worker clients fails, wherein the assigned failover system provides all function components in order to take over the execution of the job when said assigned worker client fails, wherein the assigned failover system further includes at least a failover monitor component for detecting failover situations of said assigned worker client.
    Type: Application
    Filed: September 9, 2004
    Publication date: April 14, 2005
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Utz Bacher, Oliver Benke, Boas Betzler, Thomas Lumpp, Eberhard Pasch
  • Publication number: 20050071449
    Abstract: An autonomic computing system and method determine that a desired end state cannot be reached, determine that an acceptable sub-state can be reached using at least one of priority ratings, conditional relationship specifications, and alternative relationship specifications, and place the computing system in an acceptable sub-state. The priority ratings can contain an attribute assigned to a policy definition that determines a sequence for applying the policy definition. The attribute can be “mandatory”, a numerical value, or “not required”. The conditional relationship specifications have policy definitions that are applied when the state of a specified resource meets a predetermined requirement. An alternative relationship specification has policy definitions and/or conditional relationship specifications that are applied when the state of a specified resource does not meet a predetermined requirement.
    Type: Application
    Filed: September 30, 2003
    Publication date: March 31, 2005
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: John Alex, Reinhard Buendgen, Chun-Shi Chang, Rong-Sheng Lee, Jeffrey Lucash, Thomas Lumpp, Juergen Schneider
  • Publication number: 20040119986
    Abstract: A method and apparatus for retrieving information about an object of interest to an observer. A position sensor wearable by the observer generates position information indicating the position of the observer relative to a fixed position. A direction sensor wearable by the observer generates direction information indicating the orientation of the observer relative to a fixed orientation. An object database stores position information and descriptive information for each of one or more objects. An identification and retrieval unit uses the position and direction information to identify from the object database an object being viewed by the observer by determining whether the object is along a line of sight of the observer and retrieves information about the object from the database. The identification and retrieval unit retrieves the descriptive information stored for the object in the database for presentation to the observer via an audio or video output device.
    Type: Application
    Filed: December 23, 2002
    Publication date: June 24, 2004
    Applicant: International Business Machines Corporation
    Inventors: Oliver Benke, Boas Betzler, Thomas Lumpp, Eberhard Pasch
  • Publication number: 20040039718
    Abstract: This invention describes a method to verify non-looping properties of programs implemented as rule-based expert systems. Our method detects conditions under which the expert system enters erroneous infinite program loops, which lead to non-terminating or oscillating computations, or otherwise proves the absence of such conditions. Our automatic procedure also gives advice on how to correct these errors. The expert systems considered consist of condition-action rules (IF-THEN-statements), where the conditions are logical expressions (formulas of a propositional finite domain logic), and the actions modify the value of a single variable which in turn can be part of other logical expressions. There may be additional (external) variables not controlled by the expert system, and each rule may have an associated evaluation priority.
    Type: Application
    Filed: August 22, 2002
    Publication date: February 26, 2004
    Applicant: International Business Machines Corps.
    Inventors: Thomas Lumpp, Juergen Schneider, Wolfgang Kuechlin, Carsten Sinz