Abstract: An invention for generating an alternative representation of virtual content in a virtual universe is provided. In one embodiment, there is an alternative representation tool, including a visual component configured to determine a visual capacity of a user of a virtual universe. The alternative representation tool further includes an alternative component configured to provide an alternative representation of a virtual content renderable in the virtual universe based on the visual capacity of the user of the virtual universe.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to virtual world navigation and provide a method, system and computer program product for applying temporal rankings to elements in a virtual world. In an embodiment of the invention, a method for temporally ranking locations in a virtual world can be provided. The method can include timing a duration of visit for different locations in a virtual world, computing a temporal score for the different locations, and displaying a ranking of the locations by temporal score. For instance, computing a temporal score for the different locations can include computing a sum of durations for each of the different locations, or computing an average of durations for each of the different locations, to name two examples. Optionally, computing a temporal score for the different locations also can include filtering the durations according to a date or time range.

Abstract: A method, computer program product, and system for de-centralized stream processing is provided. The method may include providing a plurality of processing nodes in a hierarchical genome having a plurality of levels, wherein each of said processing nodes is configured to transmit and receive a stream of data. The method may further include restricting a subset of the plurality of processing nodes from differentiating into a role within each level of the hierarchical genome. The method may also include identifying a failure at one of the processing nodes and replacing the failed node with one of the processing nodes from the restricted subset.

Abstract: A method, computer program product, and system for de-centralized stream processing is provided. The method may include providing a plurality of processing nodes each of said processing nodes configured to transmit and receive a stream of data. The method may further include adding one or more new processing nodes to the computing system. The method may also include determining a source node based upon, at least in part, an activation level being above or below a particular threshold. The method may additionally include, for each of the one or more added processing nodes, automatically determining an appropriate role, based upon, at least in part, a neighboring processing node.

Abstract: A method, computer program product, and system for de-centralized stream processing is provided. The method may include providing a plurality of processing nodes each of said processing nodes configured to transmit and receive a stream of data. The method may further include restricting a subset of the plurality of processing nodes from differentiating into a role. The method may also include identifying a failure at one of the processing nodes and replacing the failed node with one of the processing nodes from the restricted subset.

Abstract: A method, computer program product, and system for de-centralized stream processing is provided. The method may include providing a plurality of processing nodes each of said processing nodes configured to transmit and receive a stream of data. The method may also include providing a genome including a hierarchical set of tasks that represent a hierarchical functional decomposition of one or more problem scenarios. The method may further include identifying, at each of the processing nodes, one or more tasks for a first genome level. The method may additionally include differentiating, at one or more of the plurality of processing nodes, into one or more tasks, based upon, at least in part, the first genome level. The method may further include grouping a plurality of the processing nodes together to achieve a power level. The method may also include activating a second genome level once the power level has been reached.

Abstract: A method, computer program product, and system for de-centralized stream processing is provided. The method may include providing a plurality of processing nodes each of said processing nodes configured to transmit and receive a stream of data. The method may further include restricting a subset of the plurality of processing nodes from differentiating into a role. The method may also include identifying a failure at one of the processing nodes and replacing the failed node with one of the processing nodes from the restricted subset.

Abstract: A method, computer program product, and system for de-centralized stream processing is provided. The method may include providing a plurality of processing nodes in a hierarchical genome having a plurality of levels, wherein each of said processing nodes is configured to transmit and receive a stream of data. The method may further include restricting a subset of the plurality of processing nodes from differentiating into a role within each level of the hierarchical genome. The method may also include identifying a failure at one of the processing nodes and replacing the failed node with one of the processing nodes from the restricted subset.

Abstract: A method, computer program product, and system for de-centralized stream processing is provided. The method may include providing a plurality of processing nodes each of said processing nodes configured to transmit and receive a stream of data. The method may also include providing a genome including a hierarchical set of tasks that represent a hierarchical functional decomposition of one or more problem scenarios. The method may further include identifying, at each of the processing nodes, one or more tasks for a first genome level. The method may additionally include differentiating, at one or more of the plurality of processing nodes, into one or more tasks, based upon, at least in part, the first genome level. The method may further include grouping a plurality of the processing nodes together to achieve a power level. The method may also include activating a second genome level once the power level has been reached.

Abstract: A method, computer program product, and system for de-centralized stream processing is provided. The method may include providing a plurality of processing nodes each of said processing nodes configured to transmit and receive a stream of data. The method may further include adding one or more new processing nodes to the computing system. The method may also include determining a source node based upon, at least in part, an activation level being above or below a particular threshold. The method may additionally include, for each of the one or more added processing nodes, automatically determining an appropriate role, based upon, at least in part, a neighboring processing node.

Abstract: A method, computer program product, and system for webpage request handling is described. A method may comprise recording, in a memory, a change time for each of a plurality of elements of a website available from an origin server, each time a change to any one of the plurality of elements occurs. The method may further comprise updating a system-last-modified time of the website to a latest change time.

Abstract: A method, computer program product, and system determining the cause of serialization failures is described. A method may comprise, if a first object that has been serialized with all references to member fields by the first object removed passes deserialization, restoring, via at least one of a client electronic device and a server computer, a first reference to a first member field by the first object. The method may further comprise serializing, via at least one of the client electronic device and the server computer, the first object with the restored first reference to the first member field. The method may also comprise, if the serialized first object with the restored first reference to the first member field fails deserialization, determining, via at least one of the client electronic device and the server computer, that the first reference to the first member field by the first object causes the failure.

Abstract: A method, computer program product, and system determining the cause of serialization failures is described. A method may comprise, if a first object that has been serialized with all references to member fields by the first object removed passes deserialization, restoring, via at least one of a client electronic device and a server computer, a first reference to a first member field by the first object. The method may further comprise serializing, via at least one of the client electronic device and the server computer, the first object with the restored first reference to the first member field. The method may also comprise, if the serialized first object with the restored first reference to the first member field fails deserialization, determining, via at least one of the client electronic device and the server computer, that the first reference to the first member field by the first object causes the failure.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to structured content storage and provide a novel and non-obvious method, system and computer program product for managing structured content stored in a BLOB. In an embodiment of the invention, a performance optimized structured content management system can include a content repository, a content manager configured to provide access to structured content in the content repository and multiple different performance optimized containers disposed in the content repository. Each of the containers can store a portion of the structured content, and each of the containers can include a flattened form of original structured content in a primary binary large object (BLOB) and a parsed form of the original structured content in a secondary BLOB, the parsed form of the original structured content in the secondary BLOB indexing the flattened form of the original structured content in the primary BLOB.

Abstract: A method, computer program product, and system for webpage request handling is described. A method may comprise recording, in a memory, a change time for each of a plurality of elements of a website available from an origin server, each time a change to any one of the plurality of elements occurs. The method may further comprise updating a system-last-modified time of the website to a latest change time.

Abstract: An invention for generating an alternative representation of virtual content in a virtual universe is provided. In one embodiment, there is an alternative representation tool, including a visual component configured to determine a visual capacity of a user of a virtual universe. The alternative representation tool further includes an alternative component configured to provide an alternative representation of a virtual content renderable in the virtual universe based on the visual capacity of the user of the virtual universe.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to virtual world navigation and provide a method, system and computer program product for applying temporal rankings to elements in a virtual world. In an embodiment of the invention, a method for temporally ranking locations in a virtual world can be provided. The method can include timing a duration of visit for different locations in a virtual world, computing a temporal score for the different locations, and displaying a ranking of the locations by temporal score. For instance, computing a temporal score for the different locations can include computing a sum of durations for each of the different locations, or computing an average of durations for each of the different locations, to name two examples. Optionally, computing a temporal score for the different locations also can include filtering the durations according to a date or time range.

Abstract: Embodiments of the present invention provide a method, system and computer program product for protecting content in a virtual world. In an embodiment of the invention, a method for securing confidential data in a virtual world can include generating a virtual world for different participants over a computer communications network and placing avatars for a selected set of the participants in a bounded view of the virtual world for viewing by others of the selected set of participants in the bounded view. The method further can include selecting an inanimate object containing private data in the bounded view of the virtual world. Finally, for each participant in the selected set, the method can include determining access rights for viewing the private data and displaying the private data in connection with a display of the inanimate object in the bounded view only if permitted by the access rights and otherwise obscuring the private data in connection with a display of the inanimate object in the bounded view.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to structured content storage and provide a novel and non-obvious method, system and computer program product for managing structured content stored in a BLOB. In an embodiment of the invention, a performance optimized structured content management system can include a content repository, a content manager configured to provide access to structured content in the content repository and multiple different performance optimized containers disposed in the content repository. Each of the containers can store a portion of the structured content, and each of the containers can include a flattened form of original structured content in a primary binary large object (BLOB) and a parsed form of the original structured content in a secondary BLOB, the parsed form of the original structured content in the secondary BLOB indexing the flattened form of the original structured content in the primary BLOB.