International Business Machines Corporation

Ravi B Konuru

Olivier Gruber

Sambit Sahu

Yaoping Ruan

Lawrence David Bergman

Milton H Hernandez

Hai Huang

Robert Alan Flavin

Wim De Pauw

Kumar Bhaskaran

Winnie W Cheng

Gary Seth Sevitsky

Ching-Yung Lin

John J Ponzo

Paul Christesten Castro

Jong-Deok Choi

Zhen Wen

Hanghang Tong

Harini Srinivasan

Jingrui He

Frederique Anne Giraud

Wim DePauw

Access is obtained to a plurality of intermediately transformed electronic documents (with a plurality of sections and subsections) which have been transformed, by topical analysis and text summarization techniques, from a plurality of original electronic documents comprising at least some unstructured electronic documents. Audit and retrieval agent code is appended to the sections and subsections to create a plurality of finally transformed electronic documents. Users are allowed to access the finally transformed electronic documents. The users are provided with accountability reminders contemporaneous with the access. The access of the users to the sections and subsections of the finally transformed electronic documents is logged. An audit report is provided based on the logging. Also provided is a cloud service for enterprise-level sensitive data protection with variable data granularity, using one or more one guest virtual machine images.

Enterprise-level data protection with variable data granularity and data disclosure control with hierarchical summarization, topical structuring, and traversal audit

A method, system and computer program product for finding a diversified ranking list for a given query. In one embodiment, a multitude of date items responsive to the query are identified, a marginal score is established for each data item; and a set, or ranking list, of the data items is formed based on these scores. This ranking list is formed by forming an initial set, and one or more data items are added to the ranking list based on the marginal scores of the data items. In one embodiment, each of the data items has a measured relevance and a measured diversity value, and the marginal scores for the data items are based on the measured relevance and the measured diversity values of the data items.

Finding a top-K diversified ranking list on graphs

A method, system, and computer program product are provided for managing data in a browser-based application. The application is opened in the browser, and a subset of the application is arbitrarily specified as data. Different versions of the subset of the application specified as data are caused to persist so that they may be recovered later. Persistence and recovery of the subset of the application specified as data are performed in a manner transparent to the application.

Method, apparatus, and computer program product for managing data in a browser-based application

A method for recording and replaying execution of distributed programs on a computer system in a distributed environment, includes identifying an execution order of critical events of a program, generating groups of critical events of the program, wherein for each group, critical events belonging to the group belong to a common execution thread, and generating for each execution thread a logical thread schedule that identifies a sequence of the groups so as to allow deterministically replaying a non-deterministic arrival of stream socket connection requests, a non-deterministic number of bytes received during message reads, and a non-deterministic binding of stream sockets to local ports.

Method and system for recording and replaying the execution of distributed java programs

A technique for monitoring events generated by an object-oriented system comprises the steps/operations of: (i) monitoring events which describe executed operations associated with the object-oriented system; and (ii) applying one or more sequencing rules when reporting a subset of the monitored events, the one or more sequencing rules substantially ensuring consistent reporting of the subset of monitored events. Preferably, monitoring continues when event reporting is at least partially disabled. Further, the monitoring step/operation may include dividing the monitored events into categories. One category may include entity events, an entity event defining an existence status of a given event. Another category may include activity events, an activity event defining an operation associated with a given event. Still further, the entity events and activity events may be further divided into at least one of an object event category, an execution event category, a type event category and a synchronization event category. The sequencing rules are applied to maintain substantial consistency with respect to information associated with the categories.

Methods and apparatus for partial and consistent monitoring of object-oriented programs and systems

A method and system for analyzing dynamic behavior of a computer program using user-defined classifications of an execution trace. The method comprises the step of forming a database describing the executions of the program. The database includes static information obtained from the program source, and dynamic information describing particular executions of the program. The database is structured into entities, and each of the entities is comprised of a single type of information about the program execution. Each entity is comprised of elements representing individual program elements of said single type, and each element has attributes with values describing the element. The database is augmented by classifying every element of the database as a member of zero or more user defined execution slices; and dynamic behavior of the program is analyzed using the execution slices.

Methods for analyzing dynamic program behavior using user-defined classifications of an execution trace

Methods are provided for extracting reference patterns in JAVA and depicting the same. The extracted and depicted reference patterns may be used to interactively and selectively explore data structures, and to identify and solve memory leaks. A method for extracting reference relationships among objects corresponding to a running program includes the step of designating a starting set of objects. The starting set of objects is partitioned into subsets of objects grouped by class. A recursive operation is applied to each of the starting subsets. The recursive operation includes the step of, given a subset of objects, identifying a second set of objects. The second set includes all objects that refer to at least one object in the subset when a direction of reference terminates at the starting set. Alternatively, the second set includes all objects that are referred to by at least one object in the subset when the direction of reference originates from the starting set. The recursive operation also includes the step of partitioning the second set into new subsets of objects grouped by class. The recursive operation is applied to each of the new subsets until a predefined depth is reached.

Methods for extracting reference patterns in JAVA and depicting the same

Growing community of inventors

Tarrytown, NY, United States of America

Ravi B Konuru