International Business Machines Corporation

David Phillip Johnson

David Louis Kaminsky

Mark Edward Molander

Karen Ruth Kluttz

Randal Lee Bertram

James Corvin Fletcher

John Raithel Hind

Richard J Redpath

Kimberly Diane Kenna

Brent Alan Miller

Neeraj Joshi

Randal Le Bertram

Daniel S Rabinovitz

The computer detects a request from a first computer to store a data item, and determines if a volatile memory in a second computer comports with an isolation rule for the data item. In response to determining that the volatile memory in the second computer comports with the isolation rule for the data item, the computer compares access time for data in the volatile memory in the second computer with access time for data in a local hard drive in the first computer, and then selectively stores the data item in a storage location that has a lower access time. The computer establishes a threshold resource consumption rate for both the volatile memory in the second computer and the local hard drive in the first computer to further select the volatile memory in the second computer or the local hard drive in the first computer to store the data item.

Assigning a data item to a storage location in a computing environment

A computer implemented method assigns a data item to a storage location in a computing environment. A request to store a data item is detected. A determination is made as to whether a volatile memory in the second computer comports with an isolation rule for the data item. In response to determining that the volatile memory in the second computer comports with the isolation rule for the data item, access time for data in the volatile memory in the second computer is compared with access time for data in a local hard drive in a first computer. The data item is then selectively stored in either the volatile memory in the second computer or the local hard drive in the first computer as determined by their relative access times.

A mechanism is provided for indexing commercials. A viewer may query a search engine for a particular product or service. The index may include descriptors that are provided within a blanking interval within the media stream or within program guide information associated with the stream. The index information may also include Internet hyperlinks. Commercials may also have associated therewith a value that is relative to a value of media content. A viewer may accumulate value by viewing advertisements. Accumulated value may then be used to acquire more content.

Searchable television commercials

Each of a group of visible widgets are registered by an aggregated widget request processing module for aggregated data request processing. It is determined that an aggregated data update event associated with at least one of the registered visible widgets has occurred. Data associated with the aggregated data update event is obtained from a server. The data is distributed among the group of visible widgets based upon an aggregated data distribution profile.

Aggregated widget request processing

A request for a mashup widget having multiple versions from an identifiable source can be identified. A data store can be queried to determine if a previous request for the mashup widget was made by the identifiable source. When the previous request exists, a version of the mashup widget used to handle the previous request can be automatically determined. The determined version can be one of many versions of the mashup widget. The determined version of the mashup widget can be used to generate a response to the request. When the previous request is not found when querying the data store, one of the mashup versions that is to be used can be determined based upon a programmatic rule. Historical data regarding widget version use can be saved in the data store and used to determine which widget version is to be selected to handle future requests.

Automatically managing versioning of mashup widgets

Embodiments of the present invention address deficiencies of the art in respect to URI management for bookmarks and provide a novel and non-obvious method, system and computer program product for autonomic management of URIs in a URI bookmark list. In one embodiment of the invention, a method for autonomically managing bookmarks in a bookmark list can be provided. The method can include parsing a list of bookmarks to test validity for network addresses within the bookmarks, and, for each of the bookmarks containing an invalid network address, inferring a correct network address. For example, inferring a correct network address can include comparing a chunk of an image of expected content for the bookmark with pre-stored chunks of content and retrieving a network address for a closely matching one of the pre-stored chunks of content.

Autonomic management of uniform resource identifiers in uniform resource identifier bookmark lists

A method in a data processing system for providing a user of the data processing system with control of a software object organized into a plurality of information levels including initially displaying a first display window having a first size. The first display window includes a first level tab navigation frame to allow the user interactive access to a first information level of the plurality of information levels. The first display window additionally includes a first window-sizing interface to allow the user interactive access to a second display window having a second size which includes a second level tab navigation frame to allow the user interactive access to a second information level of the plurality of information levels and to subsequently display the second display window in response to the user interacting with the first window-sizing interface.

Automatically scaling the information and controls in navigation tabs per available window area

Under the present invention, a request for a Uniform Resource Locator (URL) is received from a client on a server. Upon receipt, a corresponding session object is obtained, and a response identifier is generated. Based on the response identifier, it is determined whether the URL was previously requested by the client. If not, generation of a final response begins. As the response is being generated, a response refresh header is generated and returned to the client with a temporary response. The response refresh header contains a time value for causing the client to automatically send a subsequent request for the URL. After generation of the final response is complete, it is stored in a cache according to the response identifier. Then, when the subsequent request is received from the client, the final response is retrieved from the cache and served to the client.

Method, system and program product for asynchronously processing requests

A method, system, and computer program product for the automatic detection and fixing of security vulnerabilities in both individual software components and across complex, multi-component software solutions. The architecture of the software solution to be monitored is analyzed prior to its being monitored. Data derived from the analysis is used to proactively identify possible ways to attack the software solution. The software solution being monitored and the system on which it runs is periodically scanned, and attacks on it are attempted. A list of possible attacks is continuously updated, for example, in a manner similar to virus signatures provided by virus security companies, and a log is generated describing which attacks were successful and which ones failed.

Method, system and computer program product for computer system vulnerability analysis and fortification

In an event detection and monitoring system displaying event data in both tabular and chart formats, the displays of each are tightly-coupled to one another so that when a user selects an event in one format the corresponding event in the other format is highlighted or otherwise emphasized. When a user selects a row containing an event of interest in the event log table, the symbol in the event log chart corresponding to the selected event is simultaneously highlighted. Similarly, when a user selects a symbol in the event log chart corresponding to an event of interest, the row in the event log table containing the corresponding event is simultaneously highlighted. In addition, the rows of the event log table can be sorted and filtered according to predetermined criteria, and the events selected by the filters are highlighted in the chart with indicia distinguishing the filter.

Tightly-coupled synchronized selection, filtering, and sorting between log tables and log charts

Systems, methods and computer program products are provided for debugging markup language source code of JSP files via Java class files generated therefrom. A Java class file is subjected to introspection to locate a source file specifier that identifies the filename of a Java source file from which the Java class file was compiled. The Java class file is also subjected to introspection to identify one or more source-to-bytecode tables associated with the Java class file. Identified source-to-bytecode tables are modified to include information provided within the comments of the Java source file source code to link respective portions of the Java source code with respective portions of the markup language source code of the JSP file. The located source file specifier is modified to indicate the JSP file as the source file from which the Java class file is compiled.

Growing community of inventors

Cary, NC, United States of America

David Phillip Johnson