Abstract: Method and system are provided for font personalization. The method carried out at a client includes: receiving a user-specific font transformation at a first client for storing at the first client, wherein the user-specific font transformation is a font transformation of a base font for an author user to which the font transformation applies; receiving content associated with the author user, wherein the content associated with the author user is received with an identifier of the user-specific font transformation of the author user; receiving the base font at the first client for storing at the first client for use with the user-specific font transformation; and applying the user-specific font transformation to the base font when rendering the content associated with the author user.

Abstract: Provided is a data storage system for a computer network adapted to store a message. The data storage system includes a data storage unit and a processing unit. The processing unit stores message data of the message across one or more data elements of a data list entry of an auxiliary list in the data storage unit. The processing unit further stores an indexing pointer of the message across one or more indexing elements of an indexing list entry of an indexing list in the data storage unit. The indexing pointer is adapted to point to the data list entry. The indexing list entry further includes an indexing control element containing control information associated with the indexing list entry. The data list entry further includes control information associated with the data list entry.

Abstract: Method and system are provided for font personalization. The method carried out at a client includes: receiving a user-specific font transformation at a first client for storing at the first client, wherein the user-specific font transformation is a font transformation of a base font for an author user to which the font transformation applies; receiving content associated with the author user, wherein the content associated with the author user is received with an identifier of the user-specific font transformation of the author user; receiving the base font at the first client for storing at the first client for use with the user-specific font transformation; and applying the user-specific font transformation to the base font when rendering the content associated with the author user.

Abstract: Method and system are provided for font personalization. The method carried out at a client includes: receiving a user-specific font transformation at a first client for storing at the first client, wherein the user-specific font transformation is a font transformation of a base font for an author user to which the font transformation applies; receiving content associated with the author user, wherein the content associated with the author user is received with an identifier of the user-specific font transformation of the author user; receiving the base font at the first client for storing at the first client for use with the user-specific font transformation; and applying the user-specific font transformation to the base font when rendering the content associated with the author user.

Abstract: A method, system, and computer program product for automatically generating service definitions for application clients of a message broker is provided. The method includes retrieving a trace of interactions between different application instances and corresponding message queues in a message brokering system. Thereafter, messages in the trace can be analyzed to identify the application instances and related message exchange data. Finally, a service definition document can be generated for each identified application instance using the related message exchange data to describe computational services provided by the identified application instance.

Abstract: Provided is a data storage system for a computer network adapted to store a message. The data storage system includes a data storage unit and a processing unit. The processing unit stores message data of the message across one or more data elements of a data list entry of an auxiliary list in the data storage unit. The processing unit further stores an indexing pointer of the message across one or more indexing elements of an indexing list entry of an indexing list in the data storage unit. The indexing pointer is adapted to point to the data list entry. The indexing list entry further includes an indexing control element containing control information associated with the indexing list entry. The data list entry further includes control information associated with the data list entry.

Abstract: Provided is a data storage system for a computer network adapted to store a message. The data storage system includes a data storage unit and a processing unit. The processing unit stores message data of the message across one or more data elements of a data list entry of an auxiliary list in the data storage unit. The processing unit further stores an indexing pointer of the message across one or more indexing elements of an indexing list entry of an indexing list in the data storage unit. The indexing pointer is adapted to point to the data list entry. The indexing list entry further includes an indexing control element containing control information associated with the indexing list entry. The data list entry further includes control information associated with the data list entry.

Abstract: A computer system defines a list structure on the shared medium wherein the list structure has multiple lists; and provides a list which is allocated to a single queue manager in which message entries are located which belong to multiple shared temporary dynamic queues (STDQs) created by the single queue manager, wherein the message entries are located by reference to a key which determines a message entry's position in the list, the list including: a list header which can be partitioned for multiple current STDQs by assignment of key ranges to message entries belonging each current STDQ; and a list control entry which holds information about the assignment of key ranges to the multiple current STDQs and shares the information with other queue managers using the STDQs, wherein the list control entry is updated by the single queue manager when an STDQ is created or deleted.

Abstract: A computer system defines a list structure on the shared medium wherein the list structure has multiple lists; and provides a list which is allocated to a single queue manager in which message entries are located which belong to multiple shared temporary dynamic queues (STDQs) created by the single queue manager, wherein the message entries are located by reference to a key which determines a message entry's position in the list, the list including: a list header which can be partitioned for multiple current STDQs by assignment of key ranges to message entries belonging each current STDQ; and a list control entry which holds information about the assignment of key ranges to the multiple current STDQs and shares the information with other queue managers using the STDQs, wherein the list control entry is updated by the single queue manager when an STDQ is created or deleted.

Abstract: A method for message handling between a message producer and a remote message consumer in a shared queue computing environment. The method includes, receiving from a message producer, at least one message by a first queue manager. A first queue manager writes both the message data associated with at least one message, to a shared data repository, and a pointer, associated with the message data to a coupling facility, using an uncommitted key. The second queue manager, upon an indication that an uncommitted key is written to the coupling facility, reads the message from the shared data repository based on the pointer, and stores the message in an internal memory storage buffer. The first queue manager then commits a batch of messages. Finally, the second queue manager merges the pointer and the message from the internal memory storage buffer, in response to a remote message consumer requesting the message.

Abstract: Provided is a data storage system for a computer network adapted to store a message. The data storage system includes a data storage unit and a processing unit. The processing unit stores message data of the message across one or more data elements of a data list entry of an auxiliary list in the data storage unit. The processing unit further stores an indexing pointer of the message across one or more indexing elements of an indexing list entry of an indexing list in the data storage unit. The indexing pointer is adapted to point to the data list entry. The indexing list entry further includes an indexing control element containing control information associated with the indexing list entry. The data list entry further includes control information associated with the data list entry.

Abstract: Method and system are provided for font personalization. The method carried out at a client includes: receiving a user-specific font transformation at a first client for storing at the first client, wherein the user-specific font transformation is a font transformation of a base font for an author user to which the font transformation applies; receiving content associated with the author user, wherein the content associated with the author user is received with an identifier of the user-specific font transformation of the author user; receiving the base font at the first client for storing at the first client for use with the user-specific font transformation; and applying the user-specific font transformation to the base font when rendering the content associated with the author user.

Abstract: A method for message handling between a message producer and a remote message consumer in a shared queue computing environment. The method includes, receiving from a message producer, at least one message by a first queue manager. A first queue manager writes both the message data associated with at least one message, to a shared data repository, and a pointer, associated with the message data to a coupling facility, using an uncommitted key. The second queue manager, upon an indication that an uncommitted key is written to the coupling facility, reads the message from the shared data repository based on the pointer, and stores the message in an internal memory storage buffer. The first queue manager then commits a batch of messages. Finally, the second queue manager merges the pointer and the message from the internal memory storage buffer, in response to a remote message consumer requesting the message.

Abstract: Data is cached at a mobile communication site, such as a cell phone mast or tower computer. The caching is based on collection of “live data,” such as the number of communication devices (for example, cell phones) connected in data communication directly to the site, information known about users of the various communication devices connected directly to the site, etc. By caching data that is likely to be useful to the users before it is actually requested, the information can be supplied from the site to the directly connected users more quickly when it is later requested.

Abstract: A computer-implemented method for revision management of files includes receiving a first file including a first revision, wherein the first revision differentiates the first file from a second file. A first change-identifier is assigned to the first revision. The first change-identifier assigned to the first revision is negated, and it is determined whether the negated first change-identifier matches a second change-identifier assigned to a second revision of the second file. Responsive to determining the negated first change-identifier matches the second change-identifier, a notification is sent, wherein the notification includes the first revision of the first file and the second revision of the second file.

Abstract: A computer-implemented method for revision management of files includes receiving a first file including a first revision, wherein the first revision differentiates the first file from a second file. A first change-identifier is assigned to the first revision. The first change-identifier assigned to the first revision is negated, and it is determined whether the negated first change-identifier matches a second change-identifier assigned to a second revision of the second file. Responsive to determining the negated first change-identifier matches the second change-identifier, a notification is sent, wherein the notification includes the first revision of the first file and the second revision of the second file.

Abstract: A method, program product and a system is provided for managing a cache. The method includes analyzing at least an intermediate product of a computer program. The intermediate product is produced by the computer program in response to a set of control inputs. The method also includes determining a resource measure associated with the first intermediate product and determining a resource measure value for the first intermediate product using a first set of control inputs> The first intermediate product is stored in the cache upon determination that the resource measure value exceeds a predetermined resource threshold.

Abstract: Methods, computer program products, and systems for installing an application at a runtime instance. A method includes receiving a request to install an application and accessing data defining shared resources required by the application. Data that defines shared resources already installed at existing runtime instances is accessed. An existing runtime instance with the greatest number of installed shared resources common to the shared resources required by the application is selected. The application is installed at the selected runtime instance.

Abstract: Data is cached at a mobile communication site, such as a cell phone mast or tower computer. The caching is based on collection of “live data,” such as the number of communication devices (for example, cell phones) connected in data communication directly to the site, information known about users of the various communication devices connected directly to the site, etc. By caching data that is likely to be useful to the users before it is actually requested, the information can be supplied from the site to the directly connected users more quickly when it is later requested.

Abstract: A method, program product and a system is provided for managing a cache. The method includes analyzing at least an intermediate product of a computer program. The intermediate product is produced by the computer program in response to a set of control inputs. The method also includes determining a resource measure associated with the first intermediate product and determining a resource measure value for the first intermediate product using a first set of control inputs> The first intermediate product is stored in the cache upon determination that the resource measure value exceeds a predetermined resource threshold.