Abstract: A universal distributed search system allows users to find and distribute search results (possibly including advertisements) to those with whom they communicate. The search results can be easily distributed by the user via a simple interface that allows the search results to be easily added to the user's content. In one implementation, the search results may be automatically generated by the system based on user input to a content creation application.

Abstract: Generally described, the present invention is directed to a network operating system that provides more effective ways of leveraging the connectivity of computer networks. In one embodiment, an XML virtual machine is implemented that accepts high-level application code written in an XML programming language as input. Functionality is provided to interpret or translate the application code written in an XML programming language into code that is suitable for execution across computer platforms. Moreover, the XML virtual machine supports the Model View Controller (MVC) design paradigm that facilitates true data abstraction from applications to a common data model. Multi-instance applications, with each instance potentially supporting multiple views, may be created and executed.

Abstract: Generally described, the present invention is directed to a network operating system that provides more effective ways of leveraging the connectivity of computer networks. In one embodiment, an XML virtual machine is implemented that accepts high-level application code written in an XML programming language as input. Functionality is provided to interpret or translate the application code written in an XML programming language into code that is suitable for execution across computer platforms. Moreover, the XML virtual machine supports the Model View Controller (MVC) design paradigm that facilitates true data abstraction from applications to a common data model. Multi-instance applications, with each instance potentially supporting multiple views, may be created and executed.

Abstract: A method and system for identifying a subject of a document and facts included within are described. A source document that includes facts and linking documents that include hyperlinks to the source document are identified. The anchor texts of the hyperlinks are identified and candidate labels are generated based on the anchor texts. One of the candidate labels is selected based on first predefined criteria and associated with the source document and/or the facts included within the source document.

Abstract: A particular method includes searching a database associated with a content provider. The database includes content items available from the content provider as well as content items that are not available from the content provider. The database is searched based on a search query received from a set-top box to generate a list of content items. The list of content items includes at least one entry corresponding to a particular content item that is unavailable and includes a feedback control. The method further includes receiving a request that the content provider make the particular content item available and automatically determining to acquire rights to provide access to the particular content item based at least in part on the request.

Abstract: The present invention provides a system and a computer-implemented method for modifying an entry name in a directory database. The method comprises the steps of: modifying, in response to a request for modifying operation of entry names, entry mapping information in accordance with the modification that is requested for modifying operation of entry names, wherein each piece of entry mapping information is used for indicating the correspondence relation between pre-modification entry name information and post-modification entry name information; asynchronously performing modifying operation of a corresponding entry name in accordance with respective pieces of entry mapping information when a predetermined condition for updating the directory database is met.

Abstract: A schema is provided that describes specific executables and parameters. Relationships between the executables and parameters are also defined. The schema is provided to represent SCM and IM tasks uniformly. Information regarding a specific component is represented by the schema. The schema may then be used to describe metadata for specific components. For example, the schema provides information for components such as how the component is comprised (its parts), its relationship to other components (i.e., dependencies), its parameters, the parameters' constraints and dependencies, etc. This provides a universal framework that is independent of specific component and can be used for SCM as well as for IM.

Abstract: Versioned metadata allows multiple versions of metadata for a given object to exist concurrently on a system thereby supporting the parallel execution of operations which would otherwise be mutually exclusive. Metadata updates are permitted while other objects maintain access to another version of the metadata through a versioning infrastructure. The versioning infrastructure allows the creation of new versions of metadata, maintains obsolete versions in the system as long as they are being used by any object, and deletes the obsolete versions once they are no longer in use.

Abstract: A cluster extractor extracts a plurality of clusters based on communication records between communication terminals. A clustering coefficient calculator, an average path length calculator, and a degree distribution calculator calculate a clustering coefficient, an average path length in an advertisement distribution target cluster, and a degree distribution, respectively, based on communication records between communication terminals belonging to an advertisement distribution target cluster. An advertising strategy determiner determines an advertising strategy, based on the clustering coefficient and the average path length, and a distribution target determiner determines a distribution target terminal, based on the degree distribution and the advertising strategy.

Abstract: A method and computer-readable medium are provided for generating usage rights for an item based upon rights to access the item. According to the method, a request is received at a document management system for an item stored in a library. In response to the request, access rights to the item for the requester are determined and usage rights are generated based upon the access rights. An encrypted file is then created that contains the item and the usage rights for the item. The location of the item in the library may also be included in the protected file. When an attempt is made to store the item back in the library, a comparison is made between the location where the item was previously retrieved from (as specified within the item) and the requested location in the library for saving the item. The item is only saved in the library if the two locations match.

Abstract: A universal distributed search system allows users to find and distribute search results (possibly including advertisements) to those with whom they communicate. The search results can be easily distributed by the user via a simple interface that allows the search results to be easily added to the user's content. Search queries entered by the user or search results received from search components may be automatically refined by the system.

Abstract: A method is described for augmenting sponsored search results in a search engine, which includes extracting attribute data from a plurality of natural searches for a search term linked to a plurality of uniform resource locators (URLs), analyzing the attribute data of one or more attributes for clickers and non-clickers to determine at least one greatest distinguishing factor between the clickers and non-clickers, and integrating the at least one greatest distinguishing factor into a matching algorithm used by the search engine to rank order and display a plurality of the most relevant ads corresponding to the plurality of URLs in response to a search for the term. The method may also integrate the at least one greatest distinguishing factor into a marketer algorithm to enable a marketer of a URL to strategically choose a search term, along with the at least one greatest distinguishing factor, on which to bid.

Abstract: A method and system for anonymizing selected content in a document, by receiving as input a document comprising content; assigning user access privileges to identified users based on an access control policy, the access control policy for the user based on a context and a set of pre-defined named entities stored in a repository; identifying named entities in the document; comparing the pre-defined set of named entities based on a context with named entities in the document; concealing the named entities identified in the document matching with the pre-defined set of named entities; and providing as output a document, wherein the set of pre-defined named entities have been concealed based on the identified user access.

Abstract: In one embodiment, a centralized cache configuration for the regions of cache of a system is described. As regions of cache may require different resources they therefore may need to be configured differently. The system for providing central cache configuration includes a centralized cache manager to transform information regarding applications, services, etc. into proper cache regions for each application, service, etc. In one embodiment, the size of these regions is based on a relative weight schema.

Abstract: A method and system for identifying a subject of a document and facts included within are described. A source document that includes facts and linking documents that include hyperlinks to the source document are identified. The anchor texts of the hyperlinks are identified and candidate labels are generated based on the anchor texts. One of the candidate labels is selected based on first predefined criteria and associated with the source document and/or the facts included within the source document.

Abstract: In transferring data from/to a database server, the size of a network buffer used by a network layer is dynamically adjusted according to the call type and expected size of data to be transferred for the call. Due to such use of appropriate buffer size, throughput performance of the transfer may be enhanced.

Abstract: A facility for logging context attributes is described. For each of a set of selected context attributes, the facility determines a target frequency with which values of the selected context attribute are to be logged. For each of the set of selected context attributes, the facility obtains values of the selected context attribute at a frequency approximating the target frequency determined for the selected context attribute. Then, for each obtained context attribute value, the facility writes the obtained value to a storage device in a manner that identifies its context attribute.

Abstract: An apparatus and method use ontological relationships in a query language and a computer database to improve database performance and utility. A set of ontological relationships are stored in the database and new query clauses are used to query the data in advantageous ways. Ontological relationships are preferably stored in a tree structure. This tree structure then can be used to reflect the ontological relationships of data stored in the columns of a database.

Abstract: The method, system and computer program product for efficient retrieval of knowledge referral are disclosed. In one approach, the method, system and computer program product modify a query for retrieving an entry from a directory information system, that is stored in a relational database, to retrieve the entry and a knowledge referral.

Abstract: A set of programs is disclosed comprising a web display interface program (WIP), a Display Configuration Program (DCP) and a Sequence Logging Program (SLP). Responsive to user actions, the set of programs provide instructions to a server connected to storage containing a facet tree database and a rules database. The WIP comprises a user interface and a set of servlets that read the facet element to be displayed from the facet tree database, and based upon the user characteristics, acquire the appropriate display rules for the user from the rules database. The DCP allows an administrator to select or configure rules that will establish views for different end users that are tailored to those particular end users. The SLP allows end users to navigate through a set of facets using a standard faceted search, or using a previously constructed sequence of facets, and logs the user choices for later use.