International Business Machines Corporation

Marc Charles Fiammante

Frederic J Bauchot

Gerard Marmigere

Joaquin Picon

Jean-Luc Collet

Jean-Armand Broyelle

Peter C Bahrs

Matthias Gruetzner

David Loupia

Lionel Mommeja

Jean-Christophe Dupuy

Eric Menguy

Patrick Boeuf

Stefan Puehl

Martine Linares-Langloys

Witold Szczeponik

R&eacute;mi Piro

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.

Fast color clustering for preprocessing an image

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.

Preventing feature loss when compressing images

A method and system for managing overlapping windows. A hook filter intercepts an event directed to a target application before the event reaches the target application. The event is characterized by an overlapping condition in which a floating window partially or totally overlaps an active window on a computer screen of a computer system. Responsive to intercepting the event, the hook filter detects the overlapping condition. Responsive to detecting the overlapping condition, the hook filter eliminates the overlapping condition to make the active window totally visible. Parameters of the floating window are recorded in a table, the parameters prevailing upon the intercepting of the event, the parameters including an overlap condition parameter. After the overlapping condition is eliminated and responsive to the active window becoming inactive, the floating window is restored on the computer screen in accordance with the recorded parameters.

Managing a floating window

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.

Generating artificial images for use in neural networks

A method and system for managing overlapping windows. A hook filter intercepts an event directed to a target application before the event reaches the target application. An association of the hook filter with the event was established. The event is characterized by an overlapping condition in which a floating window partially or totally overlaps an active window on a computer screen of a computer system. A software application is executed in the active window. Responsive to intercepting the event, the hook filter detects the overlapping condition. Responsive to detecting the overlapping condition, the honk filter eliminates the overlapping condition to make the active window totally visible.

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.

Mechanisms for need to know and leak avoidance

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.

Creating mechanical stamps to produce machine-readable optical labels

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.

Method for processing a graph containing a set of nodes

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.

System and method for managing a floating window

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.

Method and system of encapsulating web site transactions for computer-aided generation of web services

A method for translating source code programs written in a procedural computer language in source code programs written in an Object Oriented language. The method of the invention provides a parser which adds to the lexicographic and syntactical analysis of the source code a semantic analysis: a parser is written for identifying the semantic patterns in the source code. At execution, the parser reads the instructions of the procedural language and classify the sequences of instructions identified as using a known pattern. According to the matched patterns, the parser creates different categories of classes containing both functional (linearly translated code) or references to other object instances. Each time an object is discovered in the code it is stored in an Object Dictionary with its description and reused when referred later in the code. The parser is executed for each program and at each execution new classes and new objects are created; when all the programs are translated the OO classes and objects form the target object model.

Enhanced source code translator from procedural programming language (PPL) to an object oriented programming language (OOPL)

A bridging apparatus for receiving and transmitting broadcast and non-broadcast frames from a first communication network to a second communication network in a network system, is provided. The bridging apparatus includes storage memory for storing the broadcast frames and the non-broadcast frames, and filtering arrangement for controlling and balancing the transmission of the frames to the second communication network. The filtering is performed by alternatively reading and sending a first number of broadcast frames and a second number of non-broadcast frames to the second communication network. The number of broadcast frames and non-broadcast frames being read and send alternatively is based upon the characteristics of the communication networks. The bridging system of the invention further permits to discard either broadcast frames or non-broadcast frames that are received from a first network, when the capacity of the memory in which each type of frame is stored is reached. The system disclosed also permits that a broadcast frame received from a same station may be discarded if it is received within a variable delay. This delay may be defined with respect to the characteristics of the networks, or may be dynamically computed with respect to the time at which the last broadcast frame received from the same station has not been successfully transmitted to the second network.

Growing community of inventors

Sr Laurent du Var, France

Marc Charles Fiammante