Abstract: One embodiment of the present invention includes a system and method for managing a travel plan. In response to a travel plan being identified for a traveler, a search is performed for one or more persons based on a predetermined relation to the traveler. In response to identifying one or more persons based on the predetermined relation to the traveler, it is determined if the one or more such persons is to be present at a location in proximity to the traveler's location according to the travel plan. If the one or more such persons is to be present at a location in proximity to the traveler's location, an opportunity is presented to modify the travel plan to accommodate those persons.

Abstract: A system, method, means, and/or computer program code may be provided to facilitate a presentation of business information to a user. According to some embodiments, a request from a client is received at a server, and the request is associated with a query. The server also receives notifications associated with business information and may block a connection with the client and/or a response to the request based on a determination that the business information does not currently satisfy a condition associated with the query (e.g., no such notification has been received). The server may subsequently determine the business information has changed and now satisfies the condition (e.g., when a notification is received). In this case, the server may unblock the connection and transmit a response, including new resulting data associated with the query, to the client.

Abstract: Data may be provided in a language chosen by a user. A data record may be stored in a database using symbols to represent data. These symbols may be converted into various languages. A resource file for a given language defines a correspondence between the symbols in the record and the words in that language. A user indicates a choice of language in which to receive data. The user's choice is stored in the database, and conversion information from the resource file for the user's chosen language is copied to the database. When a program connects to a database and requests data records, the user's language choice is retrieved from the data, and the conversion information stored in the database is used to convert the data records into the chosen language. The requested data is then provided to the application in the user's chosen language.

Abstract: A system and method are provided for augmenting information on business directory databases. Using the business name contained in a business directory database and Web data mining technology, the website of a business is found and validated, prior to enriching the database entries.

Abstract: An apparatus, methods, and computer program products for selection of content. The content search method includes receiving a search request having search data including search terms, utilizing the search request to query against databases comprising transcripts of programs yet to be released, and returning results to the search request.

Abstract: The invention provides an efficient apparatus and method for deleting items within a distributed datastore. Deletion of items is accomplished using anti-items having the same structure as a conventional data item, but for a single tag, flag, or bit which indicates that it is an anti-item, wherein the single tag, flag, or bit but does not affect the location at which a data item or anti-item is ultimately stored within the datastore, thereby ensuring that, upon insertion, the anti-item reaches the same location or locations within the datastore as the original data item.

Abstract: A memory stores a file attached to a message generated by using a structure language. Data containing an element contained in the message to which information for obtaining type information and a file referred by the element are obtained from the memory is added is constructed. This data has a construction corresponding to an application programming interface for the structured language.

Abstract: A garbage collection algorithm that achieves hierarchical copy order with parallel garbage collection threads. More specifically, the present invention provides a garbage collection method and system for copying objects from a from-space to a to-space. The method comprises the steps of (a) having multiple threads that simultaneously perform work for garbage collection (GC), (b) examining the placement of objects on blocks, and (c) changing the placement of objects on blocks based on step (b). Preferably, the method includes the additional step of calculating a placement of object(s) based on step (b), and using the result of the calculation for step (c). For example, the calculation may be used to increase the frequency of intra-block pointers and/or to increase the frequency of siblings on the same block.

Abstract: A system for allowing multiple users to access and unlock shared electronic documents in a computer system. A group of users are defined as potential “lock-breaker” users for a document, such that they are automatically contacted in the event that a user wishes to unlock the document after it has been locked by another user. The lock-breaker users defined for a document are given access rights to the document that allow them to break a current lock on the document, so that it can be opened for editing, and accordingly re-locked. The lock-breaker users for a document may be organized in a hierarchy, such as a hierarchy matching the relationships of employees of an organization. The lock-breaker hierarchy may define the order in which the lock-breaker users are automatically contacted when a user wishes to access a locked document (e.g. an LDAP directory tree or social network).

Abstract: Meta-data from any meta-data source or feed, whose selection is customizable, is associated with media objects, such as photographs or video. In specific example embodiments, the meta-data from the custom-selected feeds are used to provide selectable feed tags that can be used to tag media objects. An architecture is provided that allows any combination of feeds to be selected for creation of a custom set of selected feeds that are to be used as sources of feed tags for media objects, and this custom set of selected feeds is extensible. In specific applications, different sets of feeds and feed tags may be utilized for facilitating the annotation of media objects.

Abstract: Demographic information of an Internet user is predicted based on an analysis of accessed web pages. Web pages accessed by the Internet user are detected and mapped to a user path vector which is converted to a normalized weighted user path vector. A centroid vector identifies web page access patterns of users with a shared user profile attribute. The user profile attribute is assigned to the Internet user based on a comparison of the vectors. Bias values are also assigned to a set of web pages and a user profile attribute can be predicted for an Internet user based on the bias values of web pages accessed by the user. User attributes can also be predicted based on the results of an expectation maximization process. Demographic information can be predicted based on the combined results of a vector comparison, bias determination, or expectation maximization process.

Abstract: The Best Practices Analyzer scans one or more instances of the database server for conformance to a set of guidelines and recommendations (“best practices” or “best practice rules”). Best practice rules may be defined by the user and/or may be provided. The Best Practices Analyzer performs analysis of usage of database programming (query) language and conformance to guidelines. Best Practices Analyzer may check for correct execution of common administrative tasks. Rules may be implemented as procedural code in any language.

Abstract: Methods, systems, and products are disclosed for classifying content segments. A set of annotations is received that occur within a segment of time-varying content. Each annotation is scored to each node in an ontology. The segment is classified based on at least one of the scores.

Abstract: Methods and computer-readable media are provided for performing a federated search using a library description file to locate multiple data sources. For a federated search, a library description can be used to describe a set of data sources searched, and may further be used to describe how search results should be presented to a user. The format of such a library description file can include multiple elements, some of which provide information on how to display the library and others that define which data sources are included in the library. The library description file can be created according to library description template.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to time stamp based data synchronization and provide a method, system and computer program product for scalable, ranging time stamp based data synchronization. In an embodiment of the invention, a ranging time stamp synchronization method can include computing a time range for a specified time, and producing time stamp synchronization anchors using the time range for each of the anchors. Optionally, a drift value can be computed for the time range and the computing and producing steps can be repeated when the drift value exceeds a threshold. Finally, the anchors can be used to determine whether to update data items in a remote data source in the remote host computing platform with data items from a primary data source in the primary host computing platform.

Abstract: A system is provided for storing knowledge, information and data (KID). The system includes a plurality of sources of KID, at least one receiver of KID from the plurality of sources, a universal knowledge, information and data store and an interface coupling the receiver and the UKIDS. The interface provides a plurality of logical partitions for storing KID within the UKIDS. In one embodiment, a first level of the logical partitions segregates information into personal and professional KID. A plurality of second personal levels under the first personal level segregates KID storage into a teams of people subset, an activities and organization subset and an organization and administration subset. A plurality of second professional levels under said first professional level segregates KID storage into a clients subset, an output subset, a teams subset and an administration subset.

Abstract: A method is provided that includes specifying enabling relationships, which map enabling sets of one or more enabling attribute-value pairs to respective enableable attributes. Responsively to the search query, a current state is designated that comprises current-state attribute-value pairs, and a result set is generated containing some of the items of a corpus. An enableable attribute of one of the enabling relationships is identified as enabled when the current-state attribute-value pairs include all of the enabling attribute-value pairs of the enabling relationship. A populated attribute-value pair is found that comprises the enabled attribute and a value therefor, and which, when added to the search query, results in an extended query that is satisfied by at least one of the items in the corpus. The result set is presented in association with the value of the populated attribute-value pair as a refinement option. Other embodiments are also described.

Abstract: A computer program product comprising computer readable program configured to implement a method for providing processed data definition documents (DDDs) or processed document object models (DOMs) for object oriented programming. The use of these processed data definitions simplifies the data structures and streamlines programming to access the data. A standard DDD/DOM has a hierarchical branched structure having a number of levels each with elements/nodes and attributes. The DDD is written in a platform independent markup language. An element/node is selected and its attributes are identified. All ‘children’ of the selected element/node are identified. The attributes of the selected element/node (parent) are then copied to each child for all children in the DDD/DOM. This is repeated for all elements/nodes in the DDD/DOM to result in a processed DDD/processed DOM which is now structured to allow program access to data in a more direct manner.

Abstract: A system, method, and computer program product are provided for synchronizing configuration values between a database and a remote input utility by configuring the database for remote input and loading the configuration values to a control file at the server, and copying the configuration values to a control file at remote system including the input utility, executing the input utility at a remote system using configuration values from the control file at the remote system to prepare data for input to the database, and responsive to the configuration values at the control file of the server, updating the configuration values in the control file at the remote system before migrating the new data from the input utility to the database.

Abstract: A computer system including a processor and a memory unit containing instructions that when executed by the processor implement a method for providing processed data definition documents (DDDs) or processed document object models (DOMs) for object oriented programming. The use of these processed data definitions simplifies the data structures and streamlines programming to access the data. A standard DDD/DOM has a hierarchical branched structure having a number of levels each with elements/nodes and attributes. The DDD is written in a platform independent markup language. An element/node is selected and its attributes are identified. All ‘children’ of the selected element/node are identified. The attributes of the selected element/node (parent) are then copied to each child for all children in the DDD/DOM. This is repeated for all elements/nodes in the DDD/DOM, resulting in a processed DDD/processed DOM which is structured to allow program access to data in a more direct manner.