公开(公告)号：GB2578981B

公开(公告)日：2021-04-21

申请号：GB202000528

申请日：2018-07-18

Applicant: IBM

Inventor： STEFAN RAVIZZA ,  TIM UWE SCHEIDELER ,  ERIK RUEGER ,  THORSTEN MUEHGE

IPC: G06F16/185

Abstract: A cognitive hierarchical storage-management system receives feedback describing users' satisfaction with the way that one or more prior data-access requests were serviced. The system uses this feedback to associate each previously requested data element's metadata and storage tier with a level of user satisfaction, and to optimize user satisfaction when the system is trained. As feedback continues to be received, the system uses machine-learning methods to identify how closely specific metadata patterns correlate with certain levels of user satisfaction and with certain storage tiers. The system then uses the resulting associations when determining whether to migrate data associated with a particular metadata pattern to a different tier. Data elements may be migrated between different tiers when two metadata sets share metadata values. A user's degree of satisfaction may be encoded as a metadata element that may be used to train a neural network of a machine-learning module. If detecting that two metadata sets share metadata values, the system determines whether to migrate data elements to different tiers.

公开(公告)号：GB2592335A

公开(公告)日：2021-08-25

申请号：GB202108987

申请日：2019-11-22

Applicant: IBM

Inventor： TIM SCHEIDELER ,  ERIK RUEGER ,  STEFAN RAVIZZA ,  FREDERIK FLOETHER

IPC: G06F16/35 ,  G06F16/901 ,  G06F16/906

Abstract: A method for partitioning a knowledge graph is provided. The method analyzes past searches and determines an access frequency of a plurality of edges. The method marks, as intermediate cluster cores, edges having the highest access frequencies, sorts the marked 5intermediate cluster cores according to their access frequencies, and selects a first cluster core having the highest access frequency. The method assigns first edges in a first radiusaround the first cluster core to build the first cluster. The method selects a second cluster core having the highest access frequency apart from edges of the first cluster, and assignssecond edges in a second radius around second cluster core to build the second cluster. The 0method partitions the knowledge graph into a first sub-knowledge-graph comprising the first cluster and a second sub-knowledge-graph comprising the second cluster.

公开(公告)号：GB2584063B

公开(公告)日：2021-04-21

申请号：GB202014014

申请日：2019-02-12

Applicant: IBM

Inventor： STEFAN RAVIZZA ,  ANDREA GIOVANNINI ,  TIM UWE SCHEIDELER ,  FREDERIK FRANK FLÖTHER ,  FLORIAN GRAF ,  ERIK RUEGER

IPC: G06F21/60 ,  G06F21/62

Abstract: A computer-implemented method, system, and computer program product for dynamic access control to a node in a knowledge graph includes: structuring nodes of a knowledge graph into a plurality of hierarchically organized graph layers; assigning, to one or more users, an access right to a first node of the knowledge graph, the access right to the node selected from a plurality of access rights, where different types of users have different access rights; and assigning, to at least one user from the one or more users, an additional access right to a second node of the knowledge graph.

公开(公告)号：GB2564318A

公开(公告)日：2019-01-09

申请号：GB201815487

申请日：2017-02-15

Applicant: IBM

Inventor： CHRISTIAN MUELLER ,  DOMINIC MUELLER-WICKE ,  ERIK RUEGER

IPC: H04L9/08 ,  G06F11/14 ,  G06F21/60 ,  G06F21/62

Abstract: A computer receives a set of objects from a client (201), whereby at least one of the objects of the set are respectively associated and encrypted with a unique file encryption key (FEK). The computer encrypts each of the FEKs with a common master encryption key (MEK), resulting in respective locked keys. In an initial backup, the encrypted objects together with their associated locked keys are transmitted to a backup server (205) where a first module determines if locked key has changed via referencing an encryption state associated with the encrypted objects. If an MEK has changed, the existing FEKs are re-encrypted with the changed MEK to generate new locked keys, and, in a subsequent backup operation, sending the new locked keys to the backup server (205) to replace the existing locked keys, while avoiding transmitting to the backup server (205) the objects whose associated FEKs are affected by the changed MEK.

公开(公告)号：GB2584063A

公开(公告)日：2020-11-18

申请号：GB202014014

申请日：2019-02-12

Applicant: IBM

Inventor： STEFAN RAVIZZA ,  ANDREA GIOVANNINI ,  TIM UWE SCHEIDELER ,  FREDERIK FRANK FLÖTHER ,  FLORIAN GRAF ,  ERIK RUEGER

IPC: G06F21/60 ,  G06F21/62

Abstract: A computer-implemented method, system, and computer program product for dynamic access control to a node in a knowledge graph includes: structuring nodes of a knowledge graph into a plurality of hierarchically organized graph layers; assigning, to a user, an access right to a node of the knowledge graph, the access right to the node selected from a plurality of access rights; and changing the access right to the node dynamically, the changing based on at least one of a structure of the knowledge graph, an access history of the user to the node, and a parameter of the user indicative of a condition outside the knowledge graph.

公开(公告)号：GB2581455A

公开(公告)日：2020-08-19

申请号：GB202008075

申请日：2018-10-31

Applicant: IBM

Inventor： CESAR AUGUSTO RODRIGUEZ BRAVO ,  ERIK RUEGER

IPC: G06K9/00 ,  A61B5/0484 ,  G06N3/08

Abstract: Aspects provide human detector devices based on neuronal response, wherein the devices are configured to obtain electroencephalogram signals from an entity during a presentation of first sensory information to the entity, and compares the obtained electroencephalogram signals to each of a plurality of trained electroencephalogram signal profile portions that are labeled as the first sensory information that represent electroencephalogram signals most commonly generated by different persons as a function of presentation to the persons of sensory information corresponding to the first sensory information. Thus, the configured processor determines whether the entity is a human as a function of a strength of match of the obtained electroencephalogram signals to ones of the trained electroencephalogram signal profile portions labeled as first sensory information that have highest most-common weightings.

公开(公告)号：GB2579988A

公开(公告)日：2020-07-08

申请号：GB202003917

申请日：2018-08-21

Applicant: IBM

Inventor： ERIK RUEGER ,  OLE ASMUSSEN ,  ROBERT BEIDERBECK ,  MARKUS SCHAEFER

IPC: G06F3/06 ,  G06F7/00

Abstract: A method and system for improving tape drive memory storage is provided. The method includes receiving, by a storage tape drive, a data stream for storage. The data stream is passed through a non-volatile memory device (NVS2)of the storage tape drive. The data stream is divided into adjacent variable length data chunks and a chunk list file including similarity identifiers for each of the adjacent variable length data chunks is generated and stored within a (non-volatile memory device) NVS1. Duplicate data including duplicated data with respect to a group of data chunks of the adjacent variable length data chunks is identified and deleted from the NVS2 of the storage tape drive such that the group of data chunks remains within NVS2. The group of data chunks is written to a data storage tape cartridge. Pointers identifying each data chunk and an associated storage position are generated and stored.

公开(公告)号：GB2564318B

公开(公告)日：2019-07-31

申请号：GB201815487

申请日：2017-02-15

Applicant: IBM

Inventor： CHRISTIAN MUELLER ,  DOMINIC MUELLER-WICKE ,  ERIK RUEGER

IPC: H04L9/08 ,  G06F11/14 ,  G06F21/60 ,  G06F21/62

Abstract: A computer receives a set of objects from a client, whereby at least one of the objects of the set are respectively associated and encrypted with a unique file encryption key (FEK). The computer encrypts each of the FEKs with a common master encryption key, MEK, resulting in respective locked keys. In an initial backup, the encrypted objects together with their associated locked keys are transmitted to a backup server where a first module determines if locked key has changed via referencing an encryption state associated with the encrypted objects. If an MEK has changed, the existing FEKs are re-encrypted with the changed MEK to generate new locked keys, and, in a subsequent backup operation, sending the new locked keys to the backup server to replace the existing locked keys, while avoiding transmitting to the backup server the objects whose associated FEKs are affected by the changed MEK.

公开(公告)号：GB2533098A

公开(公告)日：2016-06-15

申请号：GB201421826

申请日：2014-12-09

Applicant: IBM

Inventor： ERIK RUEGER ,  THORSTEN MUEHGE ,  MARCUS BREUER ,  MATTHIAS SEUL ,  ITZHACK GOLDBERG

IPC: G06F21/62

Abstract: Storing data in a Cloud environment where the Cloud environment comprises a security layer. The method comprises physically separating the Cloud storage from a key vault system 102, and receiving a storage request together with a confidentiality rating 104, wherein the storage request together with data and the confidentiality rating is received via the Cloud storage access interface by the security layer. The method further comprises encrypting the data to be stored and the confidentiality rating on request of the security layer by the key vault system into a data container 106. The Cloud storage is categorised into Cloud zones, wherein each Cloud zone is assigned a trust level 108 and data container is stored in one of the Cloud zones of the Cloud storage such that the trust level of the one of the Cloud zones corresponds to the data confidentiality rating 110. Cloud zone may denote an area in which storage systems may be physically or logically located.

公开(公告)号：GB2579988B

公开(公告)日：2022-01-05

申请号：GB202003917

申请日：2018-08-21

Applicant: IBM

Inventor： ERIK RUEGER ,  OLE ASMUSSEN ,  ROBERT BEIDERBECK ,  MARKUS SCHAEFER

IPC: G06F3/06 ,  G06F7/00

Abstract: A method and system for improving tape drive memory storage is provided. The method includes receiving, by a storage tape drive, a data stream for storage. The data stream is passed through a non-volatile memory device (NVS2) of the storage tape drive. The data stream is divided into adjacent variable length data chunks and a chunk list file including similarity identifiers for each of the adjacent variable length data chunks is generated and stored within a (non-volatile memory device) NVS1. Duplicate data including duplicated data with respect to a group of data chunks of the adjacent variable length data chunks is identified and deleted from the NVS2 of the storage tape drive such that the group of data chunks remains within NVS2. The group of data chunks is written to a data storage tape cartridge. Pointers identifying each data chunk and an associated storage position are generated and stored.