International Business Machines Corporation

Robert J Schloss

Philip Shi-lung Yu

Peter Kenneth Malkin

Geetika Tewari Lakshmanan

Brent Tzion Hailpern

Yuri G Rabinovich

Clifford A Pickover

Komminist S Weldemariam

Satyanarayana Venkata Nitta

Mukesh Kumar Mohania

Malolan Chetlur

Prasenjit Dey

Lin Zhou

Chalapathy Venkata Neti

Bikram Sengupta

Charu Chandra Aggarwal

Steve Richard White

Edward Charles Snible

Marc Hubert Willebeek-LeMair

Charles Campbell Palmer

Linda Sue Tetzlaff

Providing targeted, evidence-based recommendations to improve digital content quality, in one aspect, may include partitioning digital content into a sequence of logical content modules. Quality scores for the logical content modules along a plurality of quality dimensions may be determined. User interactions with the digital content on a user interface are monitored. Raw events generated from user interaction in accessing the digital content are captured. Raw event patterns for the logical content modules are detected. The raw event patterns of user interaction are transformed into a set of dynamic states representing potential user experience and performance. The set of dynamic states are associated with a respective logical content module. The quality dimensions of the logical content modules and associated quality scores are correlated with the dynamic states.

Providing targeted, evidence-based recommendations to improve content by combining static analysis and usage analysis

A method is disclosed including presenting a concept to a user via one or more presentation devices and monitoring the user's response to the presentation of the concept by a sensing device. The sensing device may generate sensor data based on the monitored user's response. The method further includes determining based on the sensor data generated by the sensor that the user requires clarification of the presented concept. In response to determining that the user requires clarification of the presented concept, the method further includes identifying an analogy that is configured to clarify the presented concept and presenting the identified analogy to the user via one or more of the presentation devices.

Automatic real-time identification and presentation of analogies to clarify a concept

Methods, systems, and computer program products for reducing distractions caused by user devices are provided herein. A computer-implemented method includes processing items of activity arising from user devices within a group setting, wherein each device is associated with a participating user of the group setting and coupled to a distinct status indicator that designates the corresponding user device as engaging in distracting activity or not engaging in distracting activity. The method also includes comparing each of the items of activity to a collection of user device usage policies for the group setting that identifies context-dependent items of activity arising that serve as a distraction within the group setting. Also, the method includes generating a signal to modify the status indicator of at least one of the user devices corresponding to an item of activity deemed as serving as a distraction, and transmitting the signal to the given user devices.

Reducing distractions caused by user devices in group settings

A computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart.

Decentralized load distribution to reduce power and/or cooling costs in an event-driven system

A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load placement in an event-driven system so as to minimize energy and cooling related costs. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Nodes are considered for quiescing whose current tasks can migrate to other nodes while meeting load distribution and energy efficiency parameters and the expected duration of the quiesce provides benefits commensurate with the costs of quiesce and later restart. Additionally, tasks are considered for migrating to neighbor nodes to distribute the system load of processing the tasks and reduce cooling costs.

A computer-implemented method, computer program product and computer readable storage medium directed to decentralized load distribution in an event-driven system. Included are receiving a data flow to be processed by a plurality of tasks at a plurality of nodes in the event-driven system having stateful and stateless event processing components, wherein the plurality of tasks are selected from the group consisting of hierarchical tasks (a task that is dependent on the output of another task), nonhierarchical tasks (a task that is not dependent on the output of another task) and mixtures thereof. Tasks are considered for migration to distribute the system load of processing tasks. The target node, to which the at least one target task is migrated, is chosen wherein the target node meets predetermined criteria in terms of load distribution quality. The computer-implemented method, computer program product and computer readable storage medium of the present invention may also include migrating tasks to target nodes to reduce cooling costs and selecting at least one node to go into quiescent mode.

Method for decentralized load distribution in an event-driven system using localized migration between physically connected nodes and load exchange protocol preventing simultaneous migration of plurality of tasks to or from a same node

A method, apparatus and computer program product for identifying and creating persistent object fragments from a named object. For example, a digital content description of a named digital object can be dynamically parsed, and persistent fragment identities created and maintained to facilitate caching. Named digital objects include but are not limited to: Web pages described in XML, SGML, and HTML. The object description is revised by replacing each object fragment with its newly created persistent identity. The revised object description is then sent to the requesting node. Depending upon the properties of a fragment, this can either enable the fragment or the revised object description to be cacheable at the server and/or client device. For example, the object description can include a dynamic part which would otherwise prevent the object from being cached. The dynamic part can be recognized and treated as a separate fragment from the object description. Thus the revised document becomes static mad therefore cacheable. Furthermore, fragments can be nested. Other features determine which part/segment of a named object to recognize as a fragment identity, based on its properties including: size; processing cost; and static vs. dynamic. Yet other features can determine which fragments to cache and replace, for example based on the fragment size and processing cost. Still other features allow different versions to be generated for a fragment upon request. The version created can be determined by the property of the requesting devices (e.g., handheld device or Internet appliance) and the fragment description.

Identifying, processing and caching object fragments in a web environment

A method and system for manipulating or modifying identifiable objects in a standard broadcast or Internet-based multimedia stream according to a control specification and a content specification. Viewers and/or organizations can independently specify acceptable levels of content on multiple dimensions to satisfy the content specification while minimizing the filtering or blocking to the viewers. A &ldquo;fuzz ball&rdquo; control specification is provided for masking some portion of a video frame. Several fuzz ball specifications can be overlaid to address multidimensional content specifications or rating systems. The manipulation of the multimedia stream can take place at the client (set-top box or computer), intermediate node, the content server or a combination thereof. Proxy servers can modify content specifications for outgoing requests, enabling organizations to specify intranet-wide policies. Multicasting can be supported by using a single stream delivered to multiple clients, each modifying the video using a different specification. The specification to facilitate modification can be done at different granularity levels: the video, a group of frames, or individual frame level and can also be time-based. Various protocols can be used to provide the content and/or control specification, including the VBI of a standard broadcast, PICS, RTSP and MPEG protocols.

Dynamic modification of multimedia content

Method, system and computer program product for collaboratively processing a data object in a client-server hierarchy based on meta-information associated with the object. Processing results are indicated by the server that performed the processing as updates to the meta-information associated with the data object. The PICS protocol may be used to communicate the meta-information. Digital signing and authentication of the object and associated meta-information are also described. Further, servers can determine processing by considering various factors, e.g., their current load condition; if the object is to be multicast; if the object can be cached; and/or if the specified cost and time constraints can be met. The overall processing applied to data objects can be divided between servers based on object types, steps, functions, software packages or versions/releases. Other aspects of the invention are also described.

Collaborative server processing of content and meta-information with application to virus checking in a server network

A method, apparatus and computer program product for identifying and creating persistent object fragments from a named object. For example, a digital content description of a named digital object can be dynamically parsed, and persistent fragment identities created and maintained to facilitate caching. Named digital objects include but are not limited to: Web pages described in XML, SGML, and HTML. The object description is revised by replacing each object fragment with its newly created persistent identity. The revised object description is then sent to the requesting node. Depending upon the properties of a fragment, this can either enable the fragment or the revised object description to be cacheable at the server and/or client device. For example, the object description can include a dynamic part which would otherwise prevent the object from being cached. The dynamic part can be recognized and treated as a separate fragment from the object description. Thus the revised document becomes static and therefore cacheable. Furthermore, fragments can be nested. Other features determine which part/segment of a named object to recognize as a fragment identity, based on its properties including: size; processing cost; and static vs. dynamic. Yet other features can determine which fragments to cache and replace, for example based on the fragment size and processing cost. Still other features allow different versions to be generated for a fragment upon request. The version created can be determined by the property of the requesting devices (e.g., handheld device or Internet appliance) and the fragment description.

A method and apparatus to dynamically maintain META-tag information specifying categorization and/or degree of compound documents, which are collections or hierarchy of collections of objects (possibly web pages), for efficient retrieval of leaf or intermediate objects with specific characteristics without the need to search any content of the collection. The specific characteristic and the contents of the collection can change constantly both qualitatively and quantitatively (including the insertion, deletion and update of objects). While dynamically maintaining the META-tag information, there are no inclusion restrictions on these compound documents, i.e., any collection can contain itself either directly or recursively; and all objects within a META-tagged compound document are not required to participate. The PICS protocol may be used to specify this META-tag information with both categorization and degree; to reflect the obsolescence, currency or freshness of an objects; to validate a given object using a digital signature; and to enable charging for the META-tag service. Aggregation methods are provided to enable maximization, minimization, and averaging; to limit the propagation of META-tags; and to handle the time-out of META-tag and information validity.

Apparatus and method for dynamic meta-tagging of compound documents

A push-based filtering of objects in a client-server hierarchy based on usage information. A method of annotating a push object with meta information on its content and/or urgency is also described. Objects can be staged at the server(s) to provide fast access when the filtered object is later requested. The PICS protocol may be used to communicate various types of information: e.g., by the content provider or a higher level proxy to annotate the object, including an urgency, a summary or title, a group classification, and/or an identity of the push; to convey usage or preference information on pushed objects up the hierarchy, including usage information and user preferences based on object group classifications; and to convey a staging status of each staged object down the hierarchy to improve caching efficiency. An object may include a content hierarchy such as a title, a summary and the full content. The filtering process can factor in not only which next (lower) level nodes will receive the push, but also the content level each node will receive. The push filtering decision can be based on aggregate usage information at the lower level proxy or client nodes. A staging decision can be based on the filtering decision, the successful completion of the push to the selected lower level proxies/clients, object usage information and/or a staging decision on other nodes in the hierarchy. An efficient means to purge a staged object is also described.

Dynamic push filtering based on information exchanged among nodes in a

A method and system of collaboratively caching information to allow improved caching decisions by a lower level or sibling node. In a caching hierarchy, the client and/or servers may factor in the caching status at the higher level in deciding whether to cache an object and which objects are to be replaced. The PICS protocol may be used to pass the caching information of some or all the upper hierarchy down the hierarchy. Furthermore, the caching status information can also be used to direct the object request to the closest higher level proxy which has potentially cached the object, instead of blindly requesting it from the next immediate higher level proxy. A selection policy used to select objects for replacement in the cache may be prioritized not only on the size and the frequency of access of the object, but also on the access time required to get the object if it is not cached. The selection policy may also include a selection weight factor wherein each object is assigned a selection weight based on its replacement cost, the object size and how frequently it is modified. Non-uniform size objects may be classified in ranges of selection weights having geometrically increasing intervals. Multiple LRU stacks may be independently maintained wherein each stack contains objects in a certain range of selection weights. In order to choose candidates for replacement, only the least recently used objects in each group need be considered.

Collaborative caching of a requested object by a lower level node as a

A system and method which can efficiently develop new and revised advisories on content loaded (or available to be loaded) by a client from a content server via a protocol between the client and any number of advisory servers that maintain 'ratings' knowledge bases. In one example, the advisory servers can be any number of independent non-co-located or combined servers in the World Wide Web. Alternatively, the functions of the advisory server can be integrated with the functions of the content server. Advisories can be efficiently developed based on rational factors, including: suggestions from users of an advisory service; as yet unrated content for which queries are being received; and requests from providers of new and revised primary content. Embodiments of the operation of an advisory server and reviewer's tool are described wherein content which clients are sending queries about, but which have not yet been reviewed, (i.e., not stored in an advisories database) are placed on a to-be-reviewed queue for processing by the reviewer's tool. New and revised advisories may also be created as a result of suggested advisories submitted from clients. New and revised advisories may further be created as a result of new or revised content for which a primary publisher desires (and may wish to pay for) an advisory.

Growing community of inventors

Briarcliff Manor, NY, United States of America

Robert J Schloss