Genady Grabarnik

US Patent:

7389347, Jun 17, 2008

Filed:

Apr 16, 2004

Appl. No.:

10/826575

Inventors:

Mark A. Brodie - Briarcliff NY, US
Genady Grabarnik - Scarsdale NY, US
Sheng Ma - Briarcliff Manor NY, US
Natalia V. Odintsova - Elmsford NY, US
Irina Rish - White Plains NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/16
G06F 15/173
G06F 15/177

US Classification:

709224, 709203, 700195, 702168

Abstract:

Improved problem diagnosis techniques for use in accordance with computing systems, e. g. , distributed computing systems, are disclosed. In one aspect of the invention, a technique for diagnosing a problem associated with a computing system comprises the following steps/operations. One or more probes are executed in accordance with at least a portion of a previously selected probe schedule. When a result of one or more of the probes of the previously selected probe schedule indicates, at least, a potential problem associated with the computing system, one or more probes which optimize at least one criterion are selected in real-time. The one or more selected probes are executed so as to diagnose the potential problem.

US Patent:

7475150, Jan 6, 2009

Filed:

Sep 7, 2004

Appl. No.:

10/935035

Inventors:

Genady Grabarnik - Scarsdale NY, US
Sheng Ma - Briarcliff NY, US
Abdolreza Salahshour - Raleigh NC, US
Balan Subramanian - Morrisville NC, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/16
G06F 15/173
G06F 9/54

US Classification:

709228, 709223, 709246, 709313, 709318

Abstract:

Methods, systems, and computer program products for generating a common event format representation of information from a plurality of messages include parsing a rule associated with a current message to determine if a property of a common event format representation for the current message is to be populated with a property value from a previous message. If the rule specifies to obtain the property value from the previous message, the property value is obtained from the previous message and the common event format representation for the current message is populated with the obtained property value from the previous message. The property value may be obtained by generating a computed key based on properties of the current message that are common to the previous message, and identifying the previous message based on the key of the current message. The rule associated with the current message may also be parsed to determine if the property of the common event format representation for the current message is to be populated with a property value determined by specified code. If the rule specifies to obtain the property value using the specified code, the property value is obtained using the specified code and the common event format representation for the current message is populated with the obtained property value obtained using the specified code.

US Patent:

7512985, Mar 31, 2009

Filed:

Apr 30, 2008

Appl. No.:

12/112069

Inventors:

Genady Grabarnik - Scarsdale NY, US
Jonathan Lenchner - North Salem NY, US
Laura Z. Luan - Scarsdale NY, US
Larisa Shwartz - Scarsdale NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/04
G06F 17/30
G06K 9/00
H03M 1/68
H04K 1/00
H04L 9/00
H04L 9/32
H04N 7/16

US Classification:

726 26, 707 9, 707 10, 715230

Abstract:

A system for implementing search- and retrieval-compatible data obfuscation includes an annotator that annotates data, metadata, and relationships thereof that are privacy sensitive according to privacy policies. The system also includes an indexing server that indexes the annotated data according to the policies that specify rules for controlling access to the data. The system also includes an obfuscation server for serving user requests for data search and retrieval, and specifies data entitlement and access rights for the users by applying the privacy policies to user profiles. In response to receiving a search request from a user, the obfuscation server forwards the search terms in the request, along with a privacy level determined from a corresponding user profile and the policies, to a search engine that searches indices of a database having the privacy level in the request, and returning to the user only the results which match the search terms and the privacy level. In response to receiving a data retrieval request, the obfuscation server retrieves the requested data with annotations from the database, applies the obfuscation scheme to the annotated data according to the privacy policies and the user profile, and returns to the user the obfuscated data in compliance with the privacy policies.

US Patent:

7596793, Sep 29, 2009

Filed:

Dec 31, 2002

Appl. No.:

10/334254

Inventors:

Genady Grabarnik - Irvington NY, US
Sheng Ma - Briar Cliff Manor NY, US
Abdolreza Salahshour - Raleigh NC, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 9/46

US Classification:

719318, 711118, 711160, 706 47, 707 6

Abstract:

An autonomic event parser configured for association with a message adapter. An autonomic event parser can include a store of parsing rules, the parsing rules having a strategically specified order. Additionally, a pattern analyzer can be programmed to identify patterns of received messages and to recommend the strategically specified order of the parsing rules. Finally, a parsing rules manager can be communicatively coupled both to the pattern analyzer and the store of parsing rules, the parsing rules manager having a configuration for ordering the parsing rules in the store based upon the recommended order of the pattern analyzer.

US Patent:

7631058, Dec 8, 2009

Filed:

Oct 12, 2001

Appl. No.:

09/976543

Inventors:

Genady Grabarnik - Briarcliff Manor NY, US
Joseph L. Hellerstein - Ossining NY, US
Sheng Ma - Briarcliff Manor NY, US
David Hutchinson Thoenen - Raleigh NC, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/173

US Classification:

709223

Abstract:

Techniques for data-driven validation, completion and construction of event relationship networks (ERNs) are provided. Event relationship networks are widely used in event management system design. To date, ERNs are constructed purely based on human expertise and there is no automatic or event semi-automatic method that validates or completes ERNs. The present invention provides techniques for automatically validating and completing existing ERNs and/or constructing new ERNs, based on collected event data.

US Patent:

7714912, May 11, 2010

Filed:

Jan 24, 2007

Appl. No.:

11/626406

Inventors:

Alexander Faisman - Croton-on-Hudson NY, US
Genady Grabarnik - Scarsdale NY, US
David Nahamoo - Great Neck NY, US
Apostol Ivanov Natsev - Harrison NY, US
Ganesh N. Ramaswamy - Mohegan Lake NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H04N 5/262
G09B 25/00
G06F 17/30
G09G 5/00

US Classification:

348239, 434395, 705 27, 345633

Abstract:

An intelligent imaging system, includes an image generator that projects multiple angle views of a user, a plurality of cameras for capturing a plurality of images of the user, an image processing unit, a style advisor, and a control mechanism.

US Patent:

7769899, Aug 3, 2010

Filed:

Jun 6, 2008

Appl. No.:

12/134940

Inventors:

Genady Grabarnik - Scarsdale NY, US
Sheng Ma - Briarcliff NY, US
Abdolreza Salahshour - Raleigh NC, US
Balan Subramanian - Morrisville NC, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/16
G06F 15/173
G06F 9/54

US Classification:

709246, 709223, 709228, 709313, 709318

Abstract:

Methods, systems, and computer program products for generating a common event format representation of information from a plurality of messages include parsing a rule associated with a current message to determine if a property of a common event format representation for the current message is to be populated with a property value from a previous message. If the rule specifies to obtain the property value from the previous message, the property value is obtained from the previous message and the common event format representation for the current message is populated with the obtained property value from the previous message. The property value may be obtained by generating a computed key based on properties of the current message that are common to the previous message, and identifying the previous message based on the key of the current message. The rule associated with the current message may also be parsed to determine if the property of the common event format representation for the current message is to be populated with a property value determined by specified code. If the rule specifies to obtain the property value using the specified code, the property value is obtained using the specified code and the common event format representation for the current message is populated with the obtained property value obtained using the specified code.

US Patent:

7827132, Nov 2, 2010

Filed:

Sep 14, 2006

Appl. No.:

11/531901

Inventors:

Genady Grabarnik - Scarsdale NY, US
Abdolreza Salahshour - Raleigh NC, US
Balan Subramanian - Cary NC, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06E 1/00
G06E 3/00

US Classification:

706 48, 370328, 709224

Abstract:

A rule set to convert an event into a standardized format can be established based on cooperation among peer processing nodes. A processing node that receives the event takes the initial responsibility to convert the event. The responsible processing node initially attempts to convert the event using locally available rules. If the initial attempt fails, the responsible processing node will communicate the event to peer processing nodes and request them to provide conversion rules. Upon receipt of the rules provided by the peer processing nodes, the responsible processing node combines the received rules with the locally available rules to generate a rule set to convert the event. The responsible processing node may also transfer the event to another processing node for the other processing node to take the responsibility to convert the event.