Abstract: A computer-implemented method for performing an analytic workflow process is provided. The method includes storing data from multiple input sources into a data storage pool, performing at least one analytic workflow executed by computing nodes, identifying data, by an analyzer module, expected to be required for a downstream analytic step. Thereby, the identified data have not yet been received in the in-memory database. The method also includes triggering a push module to move the identified data from the data storage pool to the in-memory database. Additionally, the method includes monitoring, by the analyzer module, output data of an analytic step and identifying pointers to additional data expected to be required for a downstream analytic step of a parallel analytic workflow process different to the analytic step of the monitored output data, and moving, by a push module, the data referred to by the pointers to the in-memory database.

Abstract: Aspects of the present invention disclose a method for color reconstruction of individual detected objects of an underwater image using a library of reference images. The method includes one or more processors obtaining image data of a computing device that includes an underwater image. The method further includes determining a depth measurement corresponding to the underwater image. The method further includes identifying an object of the underwater image based at least in part on a shape of the object. The method further includes reconstructing one or more colors of the object of the underwater image based at least in part on a reference image.

Abstract: Aspects of the present invention disclose a method for color reconstruction of individual detected objects of an underwater image using a library of reference images. The method includes one or more processors obtaining image data of a computing device that includes an underwater image. The method further includes determining a depth measurement corresponding to the underwater image. The method further includes identifying an object of the underwater image based at least in part on a shape of the object. The method further includes reconstructing one or more colors of the object of the underwater image based at least in part on a reference image.

Abstract: A computer-implemented method for performing an analytic workflow process is provided. The method includes storing data from multiple input sources into a data storage pool, performing at least one analytic workflow executed by computing nodes, identifying data, by an analyzer module, expected to be required for a downstream analytic step. Thereby, the identified data have not yet been received in the in-memory database. The method also includes triggering a push module to move the identified data from the data storage pool to the in-memory database. Additionally, the method includes monitoring, by the analyzer module, output data of an analytic step and identifying pointers to additional data expected to be required for a downstream analytic step of a parallel analytic workflow process different to the analytic step of the monitored output data, and moving, by a push module, the data referred to by the pointers to the in-memory database.

Abstract: A method, computer system, and computer program product for eliminating a redundant node from a knowledge graph is provided. A structural analysis of a knowledge graph is performed by determining that two nodes have a similar structure. An empirical analysis is performed by determining a search result correlation of potentially redundant nodes, said search result correlation comprising a correlation of search result nodes generated from different search queries to said knowledge graph or a correlation of search results due to selected search result nodes in subtrees of said potentially redundant nodes. Results of said structural analysis and said empirical analysis are combined to generate a redundancy confidence level value for two said nodes. One of said two nodes is determined as redundant. One of said two redundant nodes is removed from the knowledge graph.

Abstract: A method and system for deleting a node of a knowledge graph may be provided. The method comprises receiving knowledge graph data comprising nodes and edges, determining a first relevance degree value for a node and a second relevance degree value for the node, combining the first and the second relevance degree value and marking the node as deletable if the final relevance degree value is above a predefined relevance threshold value. The method comprises further applying queries against the knowledge graph, wherein at least a certain number of such queries invokes accessing of a node, marked as deletable, revising at least one of the first and second relevance degree value based on the accessing of the node marked as deletable, and deleting the node, marked as deletable, if over a predetermined period of time queries against the knowledge graph invoke no access of the node marked as deletable.

Abstract: A mechanism is provided in a data processing system for data integrity and acceleration in compressed storage environments in combination with software defined native redundant array of independent disks (RAID). The mechanism receives a data portion to write to storage and divides the data portion into a plurality of chunks. The mechanism performs real-time compression on a given chunk within the plurality of chunks and determines a compression rate for the given chunk. The mechanism determines a RAID level for the given chunk based on a value of the compression rate and stores the given chunk based on the determined RAID level.

Abstract: A method, computer system, and computer program product for eliminating a redundant node from a knowledge graph is provided. A structural analysis of a knowledge graph is performed by determining that two nodes have a similar structure. An empirical analysis is performed by determining a search result correlation of potentially redundant nodes, said search result correlation comprising a correlation of search result nodes generated from different search queries to said knowledge graph or a correlation of search results due to selected search result nodes in subtrees of said potentially redundant nodes. Results of said structural analysis and said empirical analysis are combined to generate a redundancy confidence level value for two said nodes. One of said two nodes is determined as redundant. One of said two redundant nodes is removed from the knowledge graph.

Abstract: A method and system for deleting a node of a knowledge graph may be provided. The method comprises receiving knowledge graph data comprising nodes and edges, determining a first relevance degree value for a node and a second relevance degree value for the node, combining the first and the second relevance degree value and marking the node as deletable if the final relevance degree value is above a predefined relevance threshold value. The method comprises further applying queries against the knowledge graph, wherein at least a certain number of such queries invokes accessing of a node, marked as deletable, revising at least one of the first and second relevance degree value based on the accessing of the node marked as deletable, and deleting the node, marked as deletable, if over a predetermined period of time queries against the knowledge graph invoke no access of the node marked as deletable.

Abstract: A mechanism is provided in a data processing system for data integrity and acceleration in compressed storage environments in combination with software defined native redundant array of independent disks (RAID). The mechanism receives a data portion to write to storage and divides the data portion into a plurality of chunks. The mechanism performs real-time compression on a given chunk within the plurality of chunks and determines a compression rate for the given chunk. The mechanism determines a RAID level for the given chunk based on a value of the compression rate and stores the given chunk based on the determined RAID level.

Abstract: A mechanism is provided in a data processing system for data integrity and acceleration in compressed storage environments in combination with software defined native redundant array of independent disks (RAID). The mechanism receives a data portion to write to storage and divides the data portion into a plurality of chunks. The mechanism performs real-time compression on a given chunk within the plurality of chunks and determines a compression rate for the given chunk. The mechanism determines a RAID level for the given chunk based on a value of the compression rate and stores the given chunk based on the determined RAID level.

Abstract: A mechanism is provided in a data processing system for data integrity and acceleration in compressed storage environments in combination with software defined native redundant array of independent disks (RAID). The mechanism receives a data portion to write to storage and divides the data portion into a plurality of chunks. The mechanism performs real-time compression on a given chunk within the plurality of chunks and determines a compression rate for the given chunk. The mechanism determines a RAID level for the given chunk based on a value of the compression rate and stores the given chunk based on the determined RAID level.

Abstract: Methods, systems, and computer program products for encrypting photograph metadata are provided. An image file is received. The image file includes digital image data and a plurality of data fields. A first data field of the plurality of data fields includes a first metadata. A rule set for modifying the first metadata is received. In response to determining that at least one rule of the rule set corresponds to the first metadata, the first metadata is encrypted based to create a second metadata. The second metadata is stored in the image file.

Abstract: A computer-implemented method according to one embodiment includes identifying a photograph taken utilizing a mobile device, analyzing a plurality of privacy factors associated with the photograph, and performing one or more security actions, based on the analyzing, including determining and presenting to a user of the mobile device a plurality of security options.

Abstract: Embodiments include a method and associated system and computer program product. A capacity utilization of an application system and a backup system for a first period of time is monitored, resulting in retrieving utilization statistics indicative of the capacity utilization. An application load score for the application system and a backup load score for the backup system are determined for several time slots of a backup schedule. For each time slot, a suitability score is determined, by combining the application load score and the backup load score. The suitability score is indicative of a suitability of the application system and the backup system in combination for execution of a backup during the time slot. A first time slot whose suitability score does not exceed a predefined threshold is selected. The backup is scheduled for the first time slot for the application system and for the backup system.

Abstract: An approach for managing photograph metadata anonymization is provided. The approach receives, by one or more processors, a photograph file, wherein the photograph file comprises a digital photograph and a first metadata. The approach receives, by one or more processors, a rule set for modifying the first metadata. The approach determines, by one or more processors, whether at least one rule of the rule set corresponds to a datum of the first metadata. Responsive to determining at least one rule corresponds to at least one datum of the first metadata, the approach modifies, by one or more processors, the first metadata based on the rule set to create a second metadata. The approach stores, by one or more processors, the first metadata in a database.

Abstract: A method for automated policy-based localization of one or more virtual servers within a distributed network comprising a plurality of data centers includes the steps of: (i) receiving a policy, the policy defining at least one rule regarding localization of a virtual server within the network; (ii) storing the defined policy in a policy database; (iii) calculating, using a policy engine and the defined policy, a current policy score for a virtual server within the distributed network; (iv) optimizing, using a re-deployment engine and the defined policy, the calculated policy score for the virtual server by relocating the virtual server to a new data center within the distributed network; and (v) creating an alert, if the defined policy is violated by relocating the virtual server.

Abstract: A mechanism is provided in a data processing system for data integrity and acceleration in compressed storage environments in combination with software defined native redundant array of independent disks (RAID). The mechanism receives a data portion to write to storage and divides the data portion into a plurality of chunks. The mechanism performs real-time compression on a given chunk within the plurality of chunks and determines a compression rate for the given chunk. The mechanism determines a RAID level for the given chunk based on a value of the compression rate and stores the given chunk based on the determined RAID level.

Abstract: A method for automated policy-based localization of one or more virtual servers within a distributed network comprising a plurality of data centers includes the steps of: (i) receiving a policy, the policy defining at least one rule regarding localization of a virtual server within the network; (ii) storing the defined policy in a policy database; (iii) calculating, using a policy engine and the defined policy, a current policy score for a virtual server within the distributed network; (iv) optimizing, using a re-deployment engine and the defined policy, the calculated policy score for the virtual server by relocating the virtual server to a new data center within the distributed network; and (v) creating an alert, if the defined policy is violated by relocating the virtual server.

Abstract: A mechanism is provided in a data processing system for data integrity and acceleration in compressed storage environments in combination with software defined native redundant array of independent disks (RAID). The mechanism receives a data portion to write to storage and divides the data portion into a plurality of chunks. The mechanism performs real-time compression on a given chunk within the plurality of chunks and determines a compression rate for the given chunk. The mechanism determines a RAID level for the given chunk based on a value of the compression rate and stores the given chunk based on the determined RAID level.