International Business Machines Corporation

Alan Michael Webb

Steven Jay Greenspan

Joshua W Knight

David B Emmes

John L Czukkermann

Roger E Bonsteel

Donald W Schmidt

Juliet C Candee

Susan Patricia Paice

Elizabeth Anne Hutchison

Valentina Salapura

Brian Paul Gaucher

Donna N Dillenberger

Robert F Berry

Clifford A Pickover

James R Kozloski

Aaron K Baughman

Peter Kenneth Malkin

Jonathan Lenchner

Peter George Finn

Paul Brian Moody

Rajesh Ramkrishna Bordawekar

Robert Francis Berry

David Francis Bacon

Thomas Edward Cook

Martin G Kienzle

Dario Gil

Martin John Trotter

Roland Albert Merrick

Paul Joseph Ledak

Edmund James Whittaker West

David Os Melville

Juilet C Candee

Donna Ngar Ting Dillenberger

Data is obtained specifying a measure of a data set to be analyzed by human experts and allotted time for analysis completion. Based on same, a schedule is created for a primary meeting of human experts, whose aim is to analyze the data. The meeting is evaluated to create rate estimates for hypothetical meeting partitions; and, if the primary meeting is not adhering to schedule and/or can be speeded up, the meeting partitions are simulated until a partitioning scheme is determined that can restore the meeting to schedule and/or speed it up. In another aspect, a model of focus of attention of each member of a group of individuals engaged in an activity requiring cooperation is dynamically updated, and a cooperation index is determined based on the model of focus of attention, an interaction graph, and at least one physiological parameter of at least one of the members.

Predicting outcomes from measures of group cooperation with applications in traffic alert and control

In an approach to determining an introduction of a user in a meeting, one or more computer processors retrieve a document containing information associated with a user, wherein the document includes one or more fragments describing the user. The one or more computer processors determine an audience of a meeting associated with the user. The one or more computer processors determine a description of the meeting. The one or more computer processors prioritize one or more of the one or more fragments, based, at least in part, on the audience of the meeting and on the description of the meeting. The one or more computer processors select one or more of the one or more fragments for the introduction of the user in the meeting, based, at least in part, on the prioritization of the one or more fragments.

Greeting agent for meeting introductions

A media viewing method and system monitors user interaction with an electronic program guide. An awareness engine collects data generated by the user interaction and forms awareness indicators and information. The awareness information is output to end users and is indicative of which users in a social circle are accessing (e.g. viewing, playing, or recording) or have accessed which media works. Some output enables user-to-user interaction. The media works may be supplied by cable television, satellite television, online or global computer network sources.

Method and apparatus for displaying interactions with media by members of a social software system

A system for porting code from a native platform to a non-native platform is provided which utilizes a non-native, platform-specific layer of code and a platform-neutral layer of code. The platform-neutral layer substantially emulates the native platform of ported code and provides a platform-neutral interface to the ported code. Together, the platform-specific layer and the platform-neutral layer provide an execution environment in which the ported code operates as a kernel extension of the non-native platform. The platform-neutral layer of the execution environment is portable to other non-native platforms so that code can be ported to another non-native platform by replacing the platform-specific layer with a customized platform-specific layer, which is adapted to the other non-native platform.

System and program product for porting code utilizing a portable execution environment

A system and method for processing a request by a first control service using a first control specification language, and a second control service using a second control specification language includes steps of: receiving the request from a requestor; providing the request to the first and second control services; receiving a decision on the request from each of the first and second control services; and comparing the decisions. The first control specification language is an access control policy.

Policy-based method for configuring an access control service

A system and program product for facilitating computing-environment control of a resource to be accessed by existing program code is provided which includes transparently replacing an uncontrolled resource referenced by existing program code with a resource controlled by a computing environment. The protocol also includes transparently interposing at least one resource management service of the computing environment between the existing program code and the resource controlled by the computing environment, wherein the at least one resource management service provides computing-environment control of the resource to be accessed by the existing program code. The replacing of the uncontrolled resource prevents the existing program code from directly accessing the resource.

System and program product for providing computing-environment control of a resource to be accessed by program code

A method of facilitating computing-environment control of a resource to be accessed by existing program code is provided which includes transparently replacing an uncontrolled resource referenced by existing program code with a resource controlled by a computing environment. The method also includes transparently interposing at least one resource management service of the computing environment between the existing program code and the resource controlled by the computing environment, wherein the at least one resource management service provides computing-environment control of the resource to be accessed by the existing program code. The replacing of the uncontrolled resource prevents the existing program code from directly accessing the resource.

Method for providing computing-environment control of a resource to be accessed by program code

A method of porting code from a native platform to a non-native platform is provided which utilizes a non-native, platform-specific layer of code and a platform-neutral layer of code. The platform-neutral layer substantially emulates the native platform of ported code and provides a platform-neutral interface to the ported code. Together, the platform-specific layer and the platform-neutral layer provide an execution environment in which the ported code operates as a kernel extension of the non-native platform. The platform-neutral layer of the execution environment is portable to other non-native platforms so that code can be ported to another non-native platform by replacing the platform-specific layer with a customized platform-specific layer, which is adapted to the other non-native platform.

Method, system and program product for porting code utilizing a portable execution environment

In a virtual machine environment, a method and apparatus for the use of multiple heaps to retain persistent data and transient data wherein the multiple heaps enables a single virtual machine to be easily resettable, thus avoiding the need to terminate and start a new Virtual Machine as well as enabling a single virtual machine to retain data and objects across multiple applications, thus avoiding the computing resource overhead of relinking, reloading, reverifying, and recompiling classes. The memory hierarchy includes a System Heap, a Middleware Heap and a Transient Heap. The use of three heaps enables garbage collection to be selectively targeted to one heap at a time in between applications, thus avoiding this overhead during the life of an application.

Serially, reusable virtual machine

A computer system includes a virtual machine supporting an object-oriented environment, in which programs to run on the virtual machine are formed from classes including methods. Applications run on the virtual machine. After a first such application has run on the virtual machine, a reset is performed on the virtual machine. The reset calls a first method in a class to perform a tidy-up operation which effectively puts the virtual machine back into a clean state. Subsequently a second application can be started on the virtual machine. As part of this start-up, the system calls a second method in the class to perform a reinitialization of the class.

Virtual machine with reset operation

A computer system includes a virtual machine supporting an object-oriented environment, in which programs to run on the virtual machine are formed from classes loaded into the virtual machine by a class loader. A class must be initialized before being used by a program. A first application is started on the virtual machine, and a set of one or more classes are loaded and initialized for the first application, which is then run. After the first application has finished running, at least one class from the first application is reset. A second application is then started on the virtual machine. This (re)-initializes any classes that have been reset from the first application, prior to using them, but does not have to reload any reset classes.

Virtual machine with reinitialization

A system includes first and second virtual machines (VM) representing a master and a client respectively. A class file is loading by the first virtual machine into shared memory. The class file includes sharable and non-sharable data, and also references sharable and non-sharable data (including code). When it is desired to load the same class into the second virtual machine, the class is first located within said shared memory. A mirror copy of the class is then formed within private memory in the second virtual machine. Finally the non-sharable data of the class is completed in the private memory. Thereafter, an application in the second virtual machine can utilise the class on the basis of the sharable data in the shared memory of the first virtual machine, and the non-sharable data from the private memory of the second virtual machine.

Class sharing between multiple virtual machines

This invention relates to a method of loading Java ClassFiles on to a Java Virtual Machine. On a regular JVM the ClassFile are loaded as and when required. In this specification there is described a method of implementing an object oriented program language such as Java on a computer. The method comprises identifying a class, one of the basic building blocks of the language, which is not within the program domain, that is not loaded into the Java a Virtual Machine. Next it introduces to the program domain only the minimum components of the class which are necessary for commencing processing of the class. The class may comprise several blocks of data representing the methods of the class, since the class may only have been identified because one of the methods within the class was referenced then only the block of data representing this method is loaded into the Java Virtual Machine along with the other essential components of the class. Other blocks of data representing methods can be loaded as and when required by the programming domain. Redundant method components may be removed from the program domain to save memory.

Growing community of inventors

Ridgefield, CT, United States of America

Alan Michael Webb