Abstract: Methods are provided for reordering operations in execution of an effect graph by graphics processing unit. Memory availability is evaluated for storing images rendered using the effect graph. Memory is allocated for multiple parallel intermediate textures that store images. Operations that write to these textures are executed. It is then determined that there is not sufficient memory to perform additional parallel operations. The memory currently allocated is flushed, and memory for an upper-level texture is allocated. The operations that write pixels to the upper-level texture are executed.

Abstract: In various embodiments, systems and methods are provided for using an expanded image format to facilitate image transformations. The expanded image format can include at least a first set of boundaries and a second set of boundaries. The first set of boundaries corresponds to the image for transform, while the second set of boundaries provide a region beyond the image that can assist a graphics processing unit with performing a transform. Optionally, the expanded information can also include pixel value information for pixels in the region between the image boundary and the overboundary.

Abstract: Mipmaps are used to optimize image rendering by intelligently determining which generated mipmaps can be reused and then storing the reusable mipmaps in cache for quick retrieval later. A graphic transformation application (GTA) working with or executed by a graphics processing unit (GPU) identifies images to be rendered on a screen and effects to be applied such images. Transforms to carry out the effects are charged with generating mipmaps of the images, and the GTA monitors the generated mipmaps and images to be rendered to determine what mipmaps to cache for future transforms.

Abstract: Methods are provided for reordering operations in execution of an effect graph by graphics processing unit. Memory availability is evaluated for storing images rendered using the effect graph. Memory is allocated for multiple parallel intermediate textures that store images. Operations that write to these textures are executed. It is then determined that there is not sufficient memory to perform additional parallel operations. The memory currently allocated is flushed, and memory for an upper-level texture is allocated. The operations that write pixels to the upper-level texture are executed.

Abstract: In various embodiments, systems and methods are provided for using an expanded image format to facilitate image transformations. The expanded image format can include at least a first set of boundaries and a second set of boundaries. The first set of boundaries corresponds to the image for transform, while the second set of boundaries provide a region beyond the image that can assist a graphics processing unit with performing a transform. Optionally, the expanded information can also include pixel value information for pixels in the region between the image boundary and the overboundary.

Abstract: An instant messaging client application is provided that receives requests to initiate instant messaging conversations and, in response to the requests, displays a notification window. The notification window includes information that may allow a user to decide whether or not the user would like to participate in the instant messaging conversation. The notification window is displayed gradually and removed gradually. The notification window contains an indication that another instant messaging user would like to initiate an instant messaging conversation and may include an identification of the remote user. The notification window also contains a description of the topic for the requested instant messaging conversation. The instant messaging client application may also display a notification window each time an instant message is received from a remote user and the application window is in a non-visible or non-active window.

Abstract: Provided is a method where a background ARGB must not be taken into consideration before a foreground ARGB including TrueType fonts is combined therewith to create a composite image for display on a display device. A common alpha value is made use of in the process of combining the foreground ARGB with the background ARGB to create the composite image.

Abstract: A system and method is provided for learning data values over time as they are entered by a user on a form such as a web page form. An Internet web browser can be modified to suggest previously used data values for any form field that is the same as or similar to a previously used form field. Application programs that use the web browser can gain access to previously used form field values even if they have no knowledge of the field names. Software in a web browser associates field names across different Universal Resource Locators (URLs), so that when a user enters a value into a field (e.g., username) at a first web site, that same value can be automatically suggested when the user displays a different form on a different web site that uses the same field name.

Abstract: A method and structure for approximating pixel display characteristics for complex displays having overlapping images is provided. Each image in the complex display corresponds to a specification of pixel color values and transparency values. Based on a format defining the number of data bits utilized to define the pixel color and pixel transparency values, each pixel's color value is approximated by mapping to a selective color palette. Depending on the format for the transparency values, each pixel's original transparency value or a mapping to a selective transparency palette is appended to the color value data. The color value and transparency values are used to recreate the complex display without requiring the original image to be reproduced.

Abstract: A method for approximating pixel colors in a display utilizing anoptimized color palette is provided. A color octree of a target display is generated by mapping the RGB color information from each pixel into the color octree. Each is generated such that each node of the octree tracks pixel count and color information. If the number of leaf nodes exceeds the target number of colors for the color palette, the octree is pruned by a recursive algorithm that compares a merging threshold to the number of pixels represented by each node and the number of unique colors represented by the node with a unique color lock threshold. The merging threshold and the unique color lock threshold are adjusted until the number of leaf nodes is less than the target number of colors in the color palette. Each pixel in the original display can be mapped to the color palette to reproduce the display.

Abstract: An instant messaging client application is provided that receives requests to initiate instant messaging conversations and, in response to the requests, displays a notification window. The notification window includes information that may allow a user to decide whether or not the user would like to participate in the instant messaging conversation. The notification window is displayed gradually and removed gradually. The notification window contains an indication that another instant messaging user would like to initiate an instant messaging conversation and may include an identification of the remote user. The notification window also contains a description of the topic for the requested instant messaging conversation. The instant messaging client application may also display a notification window each time an instant message is received from a remote user and the application window is in a non-visible or non-active window.

Abstract: A method for approximating pixel colors in a display utilizing anoptimized color palette is provided. A color octree of a target display is generated by mapping the RGB color information from each pixel into the color octree. Each is generated such that each node of the octree tracks pixel count and color information. If the number of leaf nodes exceeds the target number of colors for the color palette, the octree is pruned by a recursive algorithm that compares a merging threshold to the number of pixels represented by each node and the number of unique colors represented by the node with a unique color lock threshold. The merging threshold and the unique color lock threshold are adjusted until the number of leaf nodes is less than the target number of colors in the color palette. Each pixel in the original display can be mapped to the color palette to reproduce the display.

Abstract: A method and structure for approximating pixel display characteristics for complex displays having overlapping images is provided. Each image in the complex display corresponds to a specification of pixel color values and transparency values. Based on a format defining the number of data bits utilized to define the pixel color and pixel transparency values, each pixel's color value is approximated by mapping to a selective color palette. Depending on the format for the transparency values, each pixel's original transparency value or a mapping to a selective transparency palette is appended to the color value data. The color value and transparency values are used to recreate the complex display without requiring the original image to be reproduced.