International Business Machines Corporation

Blair Wyman

Yariv Aridor

Alan Jay Wecker

Cary Lee Bates

Cary Huettner

Kyle Gilbertson

Igar Shepelev

Jim Coon

Aaron C Evans

Embodiments of the present invention are directed to a computer-implemented method for serving content. A non-limiting example of the computer-implemented method includes identifying, using a processor, a first user and a second user among a group of users viewing a display. Next, the method includes examining, using the processor, known information about the first user and the second user. The method includes computing a content profile, using the processor, based on the known information about the first user and the second user. The method further includes selecting relevant content, using the processor, to display to the group based on the content profile and presenting, using the processor, the relevant content to the group of users.

Targeted content for simultaneous multi-users for a shared device

An apparatus and program product generate difference data representative of modifications made to one release of a standard code base to facilitate the adaptation of later releases of the standard code base. The difference data is generated at least in part in connection with canonical parsing of a modified version of a release of a standard code base such that the difference data is representative of semantic changes made in the modified version.

Automated semantic-based updates to modified code base

A monitoring process for a NUMA system collects data from multiple monitored threads executing in different nodes of the system. The monitoring process executes on different processors in different nodes. The monitoring process intelligently collects data from monitored threads according to the node it which it is executing to reduce the proportion of inter-node data accesses. Preferably, the monitoring process has the capability to specify a node to which it should be dispatched next to the dispatcher, and traverses the nodes while collecting data from threads associated with the node in which the monitor is currently executing. By intelligently associating the data collection with the node of the monitoring process, the frequency of inter-node data accesses for purposes of collecting data by the monitoring process is reduced, increasing execution efficiency.

Monitoring processes in a non-uniform memory access (NUMA) computer system

An apparatus, program product and method generate difference data representative of modifications made to one release of a standard code base to facilitate the adaptation of later releases of the standard code base. The difference data is generated at least in part in connection with canonical parsing of a modified version of a release of a standard code base such that the difference data is representative of semantic changes made in the modified version.

Method and apparatus for monitoring processes in a non-uniform memory access (NUMA) computer system

An electronic video camera temporarily records and saves motion video in a relatively high-resolution form in a frame aging buffer. While video frames are saved in high-resolution form, it is possible to extract a relatively high-resolution still image from the buffer. The camera holds the video data in high-resolution form a limited time, eventually 'aging' it as more frames are captured. The motion video is stored in persistent storage in a lower resolution form. At the user's option, relatively higher resolution frames from the buffer can also be saved.

Method and apparatus for producing still video images using electronic motion video apparatus

A system for the in-line expansion of a portion of the program body otherwise rejected as too expensive for full in-line expansion during intermediate code optimization by a compiler. The partial in-lining system first attempts the full in-line expansion of a procedure call by replacing it with the procedure body in the usual manner. If the procedure body is rejected for exceeding an in-lining threshold, a control flow graph for the procedure body is generated and examined for 'emittable' subgraphs, each of which is replaced by a new procedure call to a new procedure body containing the emitted (expensive) subgraph. Following one or more subgraph emissions to eliminate the expensive portions of the original procedure body, the 'reduced' procedure body is again passed to the in-line expansion process.

Growing community of inventors

Rochester, MN, United States of America

Blair Wyman