Abstract: According to one embodiment, a system on a chip includes multiple agents each corresponding to an intellectual property (IP) logic and a fabric to couple the agents. The fabric can include a primary message interface and a sideband message interface. The fabric further includes one or more routers to provide out-of-band communications between the agents via this sideband message interface. To effect such communication, the router can perform a subset of ordering rules of a personal computer (PC)-based specification for sideband messages. Other embodiments are described and claimed.

Abstract: Chip select (‘CS’) multiplication in an SPI system that includes an SPI master, a CS multiplier, a plurality of SPI slaves, and a fall time detection circuit, where the SPI master is coupled to the CS multiplier and the fall time detection circuit by a CS signal line, the CS multiplier includes a plurality of CS outputs with each CS output coupled to an SPI slave, and CS multiplication includes: receiving, from the SPI master, the CS signal on the CS signal line; detecting fall time of the CS signal; and, if the fall time of the CS signal is less than a predefined threshold, configuring, by the fall-time detection circuit, the CS multiplier to vary from providing a CS signal on a first CS output to providing a CS signal on a second CS output.

Abstract: A PCIe Fabric that includes an IO tier switch, hub tier switches, and a target device connected to one of the hub tier switches. The IO tier switch is configured to receive a TLP from a client, make a determination that an address in the TLP is not associated with any multicast address range in the first IO tier switch and is not associated with any downstream port in the first IO tier switch, and, based on the determinations, route the TLP to the first hub tier switch via a upstream port on the IO tier switch. The hub tier switch is configured to make a determination that the TLP is associated with a multicast group, and, based on the determination, generate a rewritten TLP and route the rewritten TLP to a target device via a downstream port on the hub tier switch.

Abstract: A system and method to sort search results based upon a desirability value is illustrated. This desirability value may be based upon the difference between a demand value and a supply value. Demand may be based upon user activity such as click-throughs, purchases, price, or location. Supply may be based upon a supply of keywords that may be the number of times a word is used in search or item title. The system and method may include receiving a search query, associating a first numerical value with a keyword that is a part of the search query, tracking user activity associated with the keyword, associating a second numerical value with the keyword based upon the user activity, finding a difference value between the first and second numerical values, associating this difference value with the keyword, sorting keywords based upon the difference values, and returning the search results of the sorting.

Abstract: Implementing application specific management policies on a content addressed storage device is disclosed. In one embodiment, each data object stored on the content addressed storage device is associated with one of a plurality of data sets. A corresponding data set specific management policy is associated with at least each of a subset of said plurality of data sets. The applicable data set specific management policy is applied to the data objects of each data set with which a corresponding data set specific management policy has been associated.

Abstract: A media system includes at least a source media device and a playback media device coupled through a network. The source media device presents media to the network. The media comprises at least one digital content file with a first format. A playback media device plays back digital content files formatted in a second format. A transcoder, also coupled to the network, converts the first format of the digital content file to a second format. In one embodiment, the transcoder comprises a device separate from the source media device and the playback media device. In another embodiment, the transcoder comprises a device integrated with the source media device. The playback device receives the digital content file, formatted in the second format, over the network, and processes the digital content file in the second format to generate processed signals. The processed signals drive the playback device to play the digital content file.

Abstract: Systems, methods, and computer program products are provided for facilitating the assigning, generating, managing, and distributing of identifiers. In one implementation, a system is provided that comprises a first Web service for returning an identifier to a requester in response to an identifier request of the requester. The system also comprises a second Web service for mirroring identifiers that have been returned by the first Web service.

Abstract: Methods, apparatuses, and computer program products are provided for assigning Access Control Lists (‘ACLs’) to a hierarchical namespace to optimize ACL inheritance. Embodiments include creating an entitlement matrix for a plurality of resources; creating a tree structure having a plurality of nodes for the hierarchical namespace in dependence upon the entitlement matrix; creating a plurality of ACLs in dependence upon the entitlement matrix; identifying a plurality of attachment points in the hierarchical namespace for the ACLs in dependence upon ACL attachment rules; and attaching the ACLs to the attachment points. Creating an entitlement matrix for a plurality of resources may be carried out by creating a matrix of resources and permissions for users.

Abstract: Map updating systems, methods, and programs that store map information, including one or more pieces of difference update information, obtain the one or more pieces of difference update information used for updating a part of the map information to a new piece of map information, update the map information based on the one or more pieces of difference update information, and obtain total update information used for updating an entirety of the map information to a new piece of map information. The systems, methods, and programs perform a total update on the map information based on the total update information, update the map information on which the total update has been performed based on the one or more pieces of difference update information, and delete the one or more pieces of difference update information from the memory after the map information is updated by the re-updating means.

Abstract: Systems and methods for backing up and/or restoring data. When a backup operation is initiated, systems and methods are provided for creating a single snapshot of the backup items, including backup groupings. The single snapshot is used by a backup/recovery application to perform a save process on each backup grouping. By using the same snapshot, the backup is performed based on the same point in time so that the backed up data across the client system is consistent and synchronized. When a recovery operation is initiated, recovery items (e.g., backup groupings, writers and writer components) are selected from backup grouping of the client.

Abstract: An apparatus and method are disclosed for producing a semantic representation of information in a semantic space. The information is first represented in a table that stores values which indicate a relationship with predetermined categories. The categories correspond to dimensions in the semantic space. The significance of the information with respect to the predetermined categories is then determined. A trainable semantic vector (TSV) is constructed to provide a semantic representation of the information. The TSV has dimensions equal to the number of predetermined categories and represents the significance of the information relative to each of the predetermined categories. Various types of manipulation and analysis, such as searching, classification, and clustering, can subsequently be performed on a semantic level.

Abstract: A method and apparatus for ranked join indices includes a solution providing performance guarantees for top-k join queries over two relations, when preprocessing to construct a ranked join index for a specific join condition is permitted. The concepts of ranking join indices presented herein are also applicable in the case of a single relation. In this case, the concepts herein provide a solution to the top-k selection problem with monotone linear functions, having guaranteed worst case search performance for the case of two ranked attributes and arbitrary preference vectors.

Abstract: Searches can be performed by attaching social contact metadata to a query where the metadata may be related to a degree of separation, chat room participation and geographical information related to an owner's contacts. Searches can then be executed by generalized search engines based at least in part on the metadata. The metadata may include contact identifiers that are unique across one or more social networks, and may include contacts for individual people as well as groups or other affiliations.

Abstract: A system and method for handling an application's access of persisted objects for use within a mobile communications device. The device includes a non-volatile storage device that has at least a portion of its storage locations addressable by the application. A reference table contains the addresses of persisted objects contained in the storage device. Via the reference table, an application can locate persisted objects stored in the storage device.

Abstract: The creator or author of the Web document or page at the Web site source of the page is enabled to prioritize all of the hyperlinks to other Web documents embedded in the Web page in order to optimize the needs such as the business needs of the host. The prioritization is applied in the determination of the order in which the Web documents linked to the activated embedded hyperlinks in the Web document are to be accessed. The system is implemented through the inclusion of a hypertext markup language tag associated with each of the prioritized hyperlinks indicative of the priority level of the associated hyperlink. The implementation for designating a priority level for each of the hyperlinks may be enabled to change any previously designated priority levels for said hyperlinks. Such changes in any previously designated priority levels could be made applicable to the priority levels in previously distributed copies of said Web document.

Abstract: A system and method for concurrency control of hierarchically structured data is provided. Lock requests on a target node are processed by exploiting ancestor-descendant information encoded into prefix encoded node identifiers (IDs). A set of implicit locks on ancestor nodes along a path from an immediate parent of a target node to a root node is derived from an explicit lock request on a target node. A logical lock tree describing existing lock modes for ancestor nodes is consulted to determine compatibility with the derived set of implicit locks. If existing lock modes for ancestor nodes are compatible with the derived set of implicit locks, a lock request on a target node is granted. Otherwise, the lock request is denied. A lock release request follows the reverse process; a target node in a particular transaction is released, as are subsequent locks on its ancestors made by the same transaction.

Abstract: We explore techniques for designing nonblocking algorithms that do not require advance knowledge of the number of processes that participate, whose time complexity and space consumption both adapt to various measures, rather than being based on predefined worst-case scenarios, and that cannot be prevented from future memory reclamation by process failures. These techniques can be implemented using widely available hardware synchronization primitives. We present our techniques in the context of solutions to the well-known Collect problem. We also explain how our techniques can be exploited to achieve other results with similar properties; these include long-lived renaming and dynamic memory management for nonblocking data structures.

Abstract: A method for collaborative teaching and learning, while facilitating simultaneous and dynamic changes by multiple users, includes: receiving a command to add or modify an existing topic record in a series of topic records in response to a user request; creating a new record in the event the received command is to add a new topic record; generating a modify token in the event the received command is to modify an existing topic record; deleting the modify token in response to completion of modifying the existing topic record; wherein the modify token prevents additional users from editing the existing topic record, but allows for the existing record to copied and modified while the first user is modifying the existing topic record; and wherein a collaboration engine generates and manages the modify token.

Abstract: A media player monitors a media feed (e.g., a web feed) for availability of newly published content available over a network. Via the feed, the media player can receive notification that certain retrievable content (e.g., the same content or substantially similar content) is available from multiple different locations over the network. The notification can include multiple pointers for use by the media player to retrieve the content. For example, a first pointer of the multiple pointers can identify a first remote location over the network in which to retrieve the content, a second pointer can identify a second remote location over the network in which to retrieve the content, and so on. The media player can have an associated download manager that selects an appropriate one of the pointers to retrieve the content depending on which of one or more download by applications resides on a computer system.

Abstract: A method and system for cleansing anomalies from sequence-based data at query time. Sequence-based data such as RFID data is loaded into a database. One or more cleansing rules are received at a cleansing rules engine. The cleansing rule engine converts the cleansing rule(s) to a template that includes logic to compensate for anomalies in the sequence-based data. A query to retrieve the sequence-based data is received by a query rewrite engine. The query rewrite engine rewrites the query by applying the template logic. The rewritten query is executed at query time. The result of the rewritten query execution is identical to the result of executing the original query on a data set generated by applying the cleansing rule to all of the sequence-based data.