Patents by Inventor Simon Streit

Simon Streit 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).

  • Wearable drug delivery device
    Patent number: 11980737
    Abstract: A modular, semi-disposable patch pump for conducting a medical therapy includes a pump unit releasably connected to a reservoir unit by means of a bayonet connection; and a housing design for supporting both reliability and ease of use of said connection.
    Type: Grant
    Filed: June 21, 2021
    Date of Patent: May 14, 2024
    Assignee: TecMed AG
    Inventors: Ursina Streit, Roland Margot, Jan Baumert, Simon Bosshard, Michael Hanimann, Patrick Hostettler
  • Structuring incoherent nodes by superimposing on a base knowledge graph
    Patent number: 10740398
    Abstract: A computer program product, system, and method for building a knowledge graph may include receiving a plurality of new nodes, receiving a base knowledge graph having existing nodes selectively connected by existing edges, and superimposing the new nodes onto selected ones of the existing nodes of the base knowledge graph. The method may further include connecting the new nodes by creating a new edge with a new weight between at least two of the new nodes if corresponding existing nodes in the underlying base knowledge graph have a connection via zero or a predetermined maximum number of existing edges, wherein the new weight is determined based on the existing weights of the existing edges of connections between the corresponding existing nodes, and detaching the new nodes with the new edges from the base knowledge graph.
    Type: Grant
    Filed: November 27, 2017
    Date of Patent: August 11, 2020
    Assignee: International Business Machines Corporation
    Inventors: Tim U. Scheideler, Stefan Ravizza, Andrea Giovannini, Avdyl Haxhaj, Simon Streit, Florian Graf
  • STRUCTURING INCOHERENT NODES BY SUPERIMPOSING ON A BASE KNOWLEDGE GRAPH
    Publication number: 20190163835
    Abstract: A computer program product, system, and method for building a knowledge graph may include receiving a plurality of new nodes, receiving a base knowledge graph having existing nodes selectively connected by existing edges, and superimposing the new nodes onto selected ones of the existing nodes of the base knowledge graph. The method may further include connecting the new nodes by creating a new edge with a new weight between at least two of the new nodes if corresponding existing nodes in the underlying base knowledge graph have a connection via zero or a predetermined maximum number of existing edges, wherein the new weight is determined based on the existing weights of the existing edges of connections between the corresponding existing nodes, and detaching the new nodes with the new edges from the base knowledge graph.
    Type: Application
    Filed: November 27, 2017
    Publication date: May 30, 2019
    Inventors: Tim U. Scheideler, Stefan Ravizza, Andrea Giovannini, Avdyl Haxhaj, Simon Streit, Florian Graf