Abstract: An approach is provided for color clustering for preprocessing an image. A cross-product on values of pixels in a source image and a number of bits per channel is determined, rounded to integer values, and left aligned to specify a target image. The following actions are repeatedly performed until a count of colors in the target image equals a target: a least frequent color in the target image is identified, distances between the least frequent color and other colors in the target image are determined, a least distance among the distances is determined, where the least distance is between the least frequent color and a closest color, a merged color is generated by merging the least frequent color and the closest color, and the count of the colors in the target image is reduced by replacing the least frequent color and the closest color with the merged color.

Abstract: An approach is provided for color clustering for preprocessing an image. A cross-product on values of pixels in a source image and a number of bits per channel is determined, rounded to integer values, and left aligned to specify a target image. The following actions are repeatedly performed until a count of colors in the target image equals a target: a least frequent color in the target image is identified, distances between the least frequent color and other colors in the target image are determined, a least distance among the distances is determined, where the least distance is between the least frequent color and a closest color, a merged color is generated by merging the least frequent color and the closest color, and the count of the colors in the target image is reduced by replacing the least frequent color and the closest color with the merged color.

Abstract: In an approach to image compression while retaining feature information at original coordinates, one or more computer processors compress an image while retaining pattern and feature information at original coordinates, wherein the image is a full resolution 3D image. The one or more computer processors create one or more image subsets based on the one or more determined regions of interest identified by utilizing a first pass selection of the regions of interest based on the compressed image. The one or more computer processors train one or more models based the created one or more image subsets that contain one or more regions of interest based on the compressed image.

Abstract: In an approach to image compression while retaining feature information at original coordinates, one or more computer processors compress an image while retaining pattern and feature information at original coordinates, wherein the image is a full resolution 3D image. The one or more computer processors create one or more image subsets based on the one or more determined regions of interest identified by utilizing a first pass selection of the regions of interest based on the compressed image. The one or more computer processors train one or more models based the created one or more image subsets that contain one or more regions of interest based on the compressed image.

Abstract: A method includes creating an input matrix of image data for a received input image and responsive to selecting a first image filter for generating an artificial image, the method applies a first filter computation for the first image filter to the input matrix of image data, where applying the first filter computation generates a first resulting matrix of image data. The method concatenates the first resulting matrix of image data to the input matrix of image data to generate a first concatenated matrix of image data. The method generates an artificial image suitable for use in neural networks based on the concatenated matrix of image data.

Abstract: A method for preventing the divulging information to an unauthorized requestor includes: receiving a request to view a data set, the receiving from a requestor; obtaining a policy associated with the data set; and determining a context for the requestor to view the data, the context including at least one of: information about the requestor, information about the data set, and conditions related to viewing the data set. The method further includes: applying the policy to the context; determining whether the context agrees with the policy; presenting the data set to the requestor based on the context agreeing with the policy; and preventing the data set from being presented to the requestor based on the context not agreeing with the policy.

Abstract: A method includes creating an input matrix of image data for a received input image and responsive to selecting a first image filter for generating an artificial image, the method applies a first filter computation for the first image filter to the input matrix of image data, where applying the first filter computation generates a first resulting matrix of image data. The method concatenates the first resulting matrix of image data to the input matrix of image data to generate a first concatenated matrix of image data. The method generates an artificial image suitable for use in neural networks based on the concatenated matrix of image data.

Abstract: An approach for creating an artificial intelligence machine learning model is provided. In an embodiment, a set of unstructured documents stored in an intelligence database is selected. Attributes associated with entities contained in the selected unstructured documents are retrieved from structured data that is also stored within the intelligence database. In addition, a natural language scan of the unstructured documents is performed to identify relationships between the entities. These relationships and the attributes are used to annotate the originally selected documents. Then the machine learning model is automatically created based on the annotated documents. This machine learning model can be used to train an AI to perform a specific set of problem solving tasks.

Abstract: A tool for creating mechanical stamps that produce machine-readable optical labels. The tool selects an initial element of a list of two-dimensional labels. The tool selects a pixel difference to apply to a two-dimensional label for the initial element. The tool selects a cardinality for bits in one or more bytes to encode. The tool determines whether a cardinality of a bit difference for each element compared to the initial element equals the selected bit difference cardinality. The tool determines whether a pixel difference between a two-dimensional label for each element and the two-dimensional label for the initial element equals the selected pixel difference. The tool selects one or more elements from the list of two-dimensional labels to create one or more mechanical stamps.

Abstract: A tool for creating mechanical stamps that produce machine-readable optical labels. The tool selects an initial element of a list of two-dimensional labels. The tool selects a pixel difference to apply to a two-dimensional label for the initial element. The tool selects a cardinality for bits in one or more bytes to encode. The tool determines whether a cardinality of a bit difference for each element compared to the initial element equals the selected bit difference cardinality. The tool determines whether a pixel difference between a two-dimensional label for each element and the two-dimensional label for the initial element equals the selected pixel difference. The tool selects one or more elements from the list of two-dimensional labels to create one or more mechanical stamps.

Abstract: A method for preventing the divulging information to an unauthorized requestor includes: receiving a request to view a data set, the receiving from a requestor; obtaining a policy associated with the data set; and determining a context for the requestor to view the data, the context including at least one of: information about the requestor, information about the data set, and conditions related to viewing the data set. The method further includes: applying the policy to the context; determining whether the context agrees with the policy; presenting the data set to the requestor based on the context agreeing with the policy; and preventing the data set from being presented to the requestor based on the context not agreeing with the policy.

Abstract: A tool for creating mechanical stamps that produce machine-readable optical labels. The tool selects an initial element of a list of two-dimensional labels. The tool selects a pixel difference to apply to a two-dimensional label for the initial element. The tool selects a cardinality for bits in one or more bytes to encode. The tool determines whether a cardinality of a bit difference for each element compared to the initial element equals the selected bit difference cardinality. The tool determines whether a pixel difference between a two-dimensional label for each element and the two-dimensional label for the initial element equals the selected pixel difference. The tool selects one or more elements from the list of two-dimensional labels to create one or more mechanical stamps.

Abstract: A tool for creating mechanical stamps that produce machine-readable optical labels. The tool selects an initial element of a list of two-dimensional labels. The tool selects a pixel difference to apply to a two-dimensional label for the initial element. The tool selects a cardinality for bits in one or more bytes to encode. The tool determines whether a cardinality of a bit difference for each element compared to the initial element equals the selected bit difference cardinality. The tool determines whether a pixel difference between a two-dimensional label for each element and the two-dimensional label for the initial element equals the selected pixel difference. The tool selects one or more elements from the list of two-dimensional labels to create one or more mechanical stamps.

Abstract: The invention relates to a computerized method for processing a graph containing a set of nodes processing a graph containing a set of nodes, wherein forest of trees is provided corresponding to a directed acyclic graph containing a set of nodes, each of said nodes having a type chosen from a set of types; a depth for each node in said forest of trees is determined; in a breadth-first traversal manner, the depth and type of each node in said forest of trees is compared to a predefined matrix, said matrix defining for each depth and type combination one of the following actions to be carried out: no action, creating a new sub-tree, triggering exception handling.

Abstract: A tool for creating mechanical stamps that produce machine-readable optical labels. The tool selects an initial element of a list of two-dimensional labels. The tool selects a pixel difference to apply to a two-dimensional label for the initial element. The tool selects a cardinality for bits in one or more bytes to encode. The tool determines whether a cardinality of a bit difference for each element compared to the initial element equals the selected bit difference cardinality. The tool determines whether a pixel difference between a two-dimensional label for each element and the two-dimensional label for the initial element equals the selected pixel difference. The tool selects one or more elements from the list of two-dimensional labels to create one or more mechanical stamps.

Abstract: A tool for creating mechanical stamps that produce machine-readable optical labels. The tool selects an initial element of a list of two-dimensional labels. The tool selects a pixel difference to apply to a two-dimensional label for the initial element. The tool selects a cardinality for bits in one or more bytes to encode. The tool determines whether a cardinality of a bit difference for each element compared to the initial element equals the selected bit difference cardinality. The tool determines whether a pixel difference between a two-dimensional label for each element and the two-dimensional label for the initial element equals the selected pixel difference. The tool selects one or more elements from the list of two-dimensional labels to create one or more mechanical stamps.

Abstract: A system and method for automatically generating web services from an existing web site having web page based business processes or transactions. A script is generated representative of the user navigation sequence involved to perform the transaction. The script elements include the web application calls, input/output parameters, and the interrelation between the elements of the transaction. A WSDL file, web service interface code, and web service implementation code are automatically, i.e. computer-aided, generated from the navigation script without a user required to have advance programming skills. The web service may be published locally to the web site or on a remote site.

Abstract: The invention relates to a computerized method for processing a graph containing a set of nodes processing a graph containing a set of nodes, wherein forest of trees is provided corresponding to a directed acyclic graph containing a set of nodes, each of said nodes having a type chosen from a set of types; a depth for each node in said forest of trees is determined; in a breadth-first traversal manner, the depth and type of each node in said forest of trees is compared to a predefined matrix, said matrix defining for each depth and type combination one of the following actions to be carried out: no action, creating a new sub-tree, triggering exception handling.

Abstract: A system and method for automatically generating web services from an existing web site having web page based business processes or transactions. A script is generated representative of the user navigation sequence involved to perform the transaction. The script elements include the web application calls, input/output parameters, and the interrelation between the elements of the transaction. A WSDL file, web service interface code, and web service implementation code are automatically, i.e. computer-aided, generated from the navigation script without a user required to have advance programming skills. The web service may be published locally to the web site or on a remote site.

Abstract: A method and system for managing overlapping windows on a computer screen of a computer system. A hook filter intercepts an event that has occurred. An association of the hook filter with the event was established prior to the occurrence of the event. The event is characterized by an overlapping condition in which a floating window partially or totally overlaps an active window on the computer screen. A software application is associated with the active window. Response to intercepting the event, the hook filter detects the overlapping condition. Response to detecting the overlapping condition, the hook filter eliminates the overlapping condition to make the active window totally visible.