Larisa S Shwartz

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:

7543058, Jun 2, 2009

Filed:

Jun 30, 2008

Appl. No.:

12/165021

Inventors:

Naga A. Ayachitula - Elmsford NY, US
Melissa J. Buco - Amawalk NY, US
Lalitha Kamesam - Cortlandt Manor NY, US
David Loewenstern - New York NY, US
Larisa Shwartz - Scarsdale NY, US
Christopher Ward - Glen Ridge NJ, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

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

US Classification:

709224, 709220, 709223, 709225, 709229

Abstract:

A method for facilitating compliance testing in an environment is provided. The method includes defining each component as a set of attribute value pairs represented as a configuration item (CI) and defining relationships among the CIs. Configuration Standards for the CIs are defined to include scope identifying CIs to which the Configuration Standards apply and restrictions defining requirements for compliance. Compliance testing is performed for components against a selected Configuration Standards by determining, depending on the scope and the restrictions of each of the selected Configuration Standards, which of the components within the scope of the selected Configuration Standards fails to meet the restrictions of respective ones of the selected Configuration Standards; and by outputting results as a list, which includes each of the components that failed to meet respective ones of the selected Configuration Standards.

US Patent:

7756999, Jul 13, 2010

Filed:

Mar 5, 2008

Appl. No.:

12/042631

Inventors:

Genady Grabarmik - Scarsdale NY, US
Dimitri Kanevsky - Ossining NY, US
Debanjan Saha - Mohegan Lake NY, US
Larisa Shwartz - Scarsdale NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/173

US Classification:

709244, 709238, 709241

Abstract:

A method and system are disclosed for creating portfolios of requests so as to reduce or minimize the variance in the workloads generated by those requests. The invention also takes into account the throughput of the servers that are servicing the requests. In a preferred embodiment, the method comprises the steps of establishing a set of system parameters; using said parameters to generate a model, said model including a defined optimization problem; and solving said optimization problem to output a set of mixing weights. The set of parameters and said mixing weights are used to generate a task; and the service requests are distributed to different service teams according to the generated task. Also, for example, the distributing may be done by distributing requests of type i to team j with weight proportional to w.

US Patent:

7822785, Oct 26, 2010

Filed:

Jun 30, 2006

Appl. No.:

11/478745

Inventors:

Naga A. Ayachitula - Elmsford NY, US
Krishna S. Garimella - San Jose CA, US
Yan Or - San Francisco CA, US
Larisa Shwartz - Scarsdale NY, US
Maheswaran Surendra - Croton-On-Hudson NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707804

Abstract:

Methods and apparatus of managing a CMDB are provided. At least one composite CI is utilized in the CMDB. The at least one composite CI is represented as a graph of navigable relationships between one or more supporting elements in accordance with a template. The one or more supporting elements comprise at least a root element of the composite CI.

US Patent:

7831976, Nov 9, 2010

Filed:

May 4, 2005

Appl. No.:

11/121828

Inventors:

Genady Grabarnik - Scarsdale NY, US
Moon Ju Kim - Wappingers Falls NY, US
Lev Kozakov - Stamford CT, US
Larisa Shwartz - Scarsdale NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 9/46
G06F 15/16
G06F 15/177

US Classification:

718104, 718105, 709208, 709220

Abstract:

Under the present invention, a computer work gradient matrix is built for each computer system that is interconnected in an environment. For each computer system for which resource consumption is desired to be predicted (e. g. , “target” computer systems), a transition work cocycle is generated and provided to a master computer system. A set of task work paths will be constructed for the master computer system. Thereafter, an initial resource consumption value can be computed on the master computer system based on the computer work gradient matrix and the set of task work paths for the master computer system as well as a current background loading level that is being experienced by the target computer system. Then, using the initial resource consumption and the transition work cocycle for the target computer system(s), a resource consumption of the target computer system(s) can be predicted on the master computer system.

US Patent:

7844441, Nov 30, 2010

Filed:

Mar 27, 2006

Appl. No.:

11/390527

Inventors:

Genady Grabarnik - Scarsdale NY, US
Moon Ju Kim - Wappingers Falls NY, US
Lev Kozakov - Stamford CT, US
Volodimir F. Lemberg - Ossining NY, US
Larisa Shwartz - Scarsdale NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1/02
G06F 7/32
G06F 7/60
G06F 9/44
G06F 13/10
G06F 13/12
G06F 15/18
G06F 17/10
G06F 17/15
G06E 1/00
G06E 3/00
G06G 7/00

US Classification:

703 21, 703 2, 706 17, 708274, 708422, 708520

Abstract:

In general, the present invention provides a method, system and program product for approximating/estimating computer resource consumption of a computer system. Specifically, under the present invention, a more efficient or reduced computer work gradient matrix (hereinafter “matrix”) is first built. This occurs by creating load measurements for a set of computer resource metrics of the computer system to analyze dependencies between different computer resource metrics. Then, a correlation matrix between the set of computer resource metrics is created based on the dependencies. The set of computer system resource metrics in the correlation matrix is thereafter clustered into a set of clusters, and a reduced matrix is built based thereon. Once the reduced matrix is built, it can be restored to a “full” matrix using linear transformation or the like.

US Patent:

7860816, Dec 28, 2010

Filed:

Oct 31, 2007

Appl. No.:

11/931601

Inventors:

Genady Grabarnik - Scarsdale NY, US
Nagui Halim - Yorktown Heights NY, US
Aaron Kershenbaum - New City NY, US
Edith Schonberg - New York NY, US
Larisa Shwartz - Scarsdale NY, US
Kavitha Srinivas - Rye NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06N 5/00

US Classification:

706 47, 706 45

Abstract:

The present invention is a method and apparatus for safe ontology reasoning. In one embodiment, a method for building safe sub-ontology that includes one or more elements of a given ontology includes designating at least one the elements as a sensitive element, where a sensitive element is an element not to be revealed. The method then designates a safe sub-ontology such that the safe sub-ontology does not include any elements that, alone or in combination, allow inference of a sensitive element, in accordance with one or more given inference rules. In another embodiment, a method for building a potential sub-ontology includes designating at least one of the elements as a sensitive element and including a maximal number of the elements in the potential sub-ontology, wherein the maximal number includes the greatest number of elements that can be revealed, cumulatively, without allowing inference of a sensitive element, in accordance with one or more given inference rules.

US Patent:

7904547, Mar 8, 2011

Filed:

Feb 21, 2006

Appl. No.:

11/358304

Inventors:

Genady Y. Grabarnik - Scarsdale NY, US
Moon J. Kim - Wappingers Falls NY, US
Lev Kozakov - Stamford CT, US
Yefim Haim Michlin - Nesher, IL
Larisa Shwartz - Scarsdale NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/173

US Classification:

709224, 709203, 709223, 370252, 370254, 370442, 714 2, 714 3

Abstract:

Under the present invention, a stability and updateability (SUP) ratio for a grid computing environment is generated. Thereafter, a size of a set (e. g. , at least one) of scale free graphs for the grid computing environment is estimated. Then, based on at least one predetermined parameter such as a quantity of nodes in the grid computing environment, the set of scale free graphs is actually generated. Based on the set of scale free graphs a set of perturbed scale free graphs is generated. In one example, this may be accomplished using a preferential rewiring technique. This process is repeated for each of the monitoring and discovery services, which will yield at least two sets of perturbed scale free graphs. Using these sets of graphs, a set of monitoring and discovery service (MDS) topology graphs for the grid computing environment will be generated and deployed for optimization.