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: One embodiment of the disclosure can represent within a K-partite graph, weighting factors between a set of identifier elements and a set of data elements. The K-partite graph can also represent weighting factors between the set of identifier elements and a set of metadata elements. In the K-partite graph, the set of identifier elements, the set of data elements, and the set of metadata elements are independent and disjoint sets such that no two vertices within a same set are adjacent. A score vector can be calculated that ranks each data element in a set of data elements. The score vector can be calculated from the weighting factors. At least one data element from the set of data elements can be selected using the score vector and a predetermined selection criterion.

Abstract: One embodiment of the disclosure can represent within a K-partite graph, weighting factors between a set of identifier elements and a set of data elements. The K-partite graph can also represent weighting factors between the set of identifier elements and a set of metadata elements. In the K-partite graph, the set of identifier elements, the set of data elements, and the set of metadata elements are independent and disjoint sets such that no two vertices within a same set are adjacent. A score vector can be calculated that ranks each data element in a set of data elements. The score vector can be calculated from the weighting factors. At least one data element from the set of data elements can be selected using the score vector and a predetermined selection criterion.

Abstract: In one embodiment, a method receives a plurality of documents. The documents may be received from different medical providers. Also, the documents may be medical record documents generated or captured in a first format and a second format. The first format may be an unstructured data format and the second format may be a structured data format. The first and second documents are then converted to a common format. For example, a common format may emerge as the most restrictive or constrained denominator of the first format and the second format. A schema is determined that provides an organizational structure with categories that can be used to index the content of the first and second documents while they are being converted to the common format. The schema and indexing enable the different formats of documents to be combined and organized simultaneously into a single view for a comprehensive review.

Abstract: A computer-implemented method, a computer system, and computer media for discovering links in scripts are provided. The computer system includes a crawler, a rules engine, and an index that are utilized to store links generated by scripts located in webpages in the index. The crawler traverses a network to locate webpages having scripts. The rules engine parses the located webpages and extracts the scripts based on rules that are satisfied by segments of the extracted scripts. The rules engine evaluates the segments of the extracted scripts to generate links. After the rules engine validates the links, the rules engine transmits the links to the index for storage.

Abstract: A garbage collector includes a core, and extension handlers to support collection of objects of a designated managed class. The handler, which may be implemented in managed code, receives notification of garbage collection phases, and receives control from the core when the core encounters an object of the designated class. The handler can then thread together discovered objects of the designated class, walk a list of objects and detect whether any are unreachable, and/or provide an executor for the designated class. The core notifies handlers about progress in tracing strong pointers, tracing weak pointers, pointer update, pinning, weak pointer forwarding, and untraced pointer relocation. A pointer can be marked as untraced, so the core ignores it during pointer tracing phases. If the core encounters an object which has a weak pointer field, the core can pass control to a handler's tracing method. The core may perform generational garbage collection.

Abstract: This disclosure relates to database systems and, more particularly, to database systems with version controlled data. A version controlled database program resides on a computer readable medium, having a plurality of instructions stored thereon, which, when executed by a processor, cause the processor to perform operations. The operations include defining a version object software layer. The version object software layer may be configured to read and write data of a version controlled database to a physical storage medium, maintain one or more versions of at least one element of the data, and provide access to the data. The operations may also include defining a database management software layer. The database management software layer may be configured to read and write data to the version object software layer and provide a database access interface for accessing the data.

Abstract: Techniques are disclosed for evaluating tuples for processing by a stream application having a plurality of process elements. In one embodiment, at least one tuple to be processed by at least one processing element of the stream application is identified. A maximum duration for which the at least one processing element is allowed to process the at least one tuple is determined. A duration for which the at least one processing element is likely to process the at least one tuple is also estimated. Processing of the at least one tuple is managed based on a comparison between the maximum duration and the estimated duration.

Abstract: Exemplary method, system, and computer program product embodiments for real-time column compression of data are provided. In one embodiment, by way of example only, a data structure is estimated for an initially unknown structured data. The estimated data structure is placed in a stream. A columnar compression operation is applied to the stream to generate an achieved compression ratio. The stream is compressed. Feedback of the achieved compression ratio is analyzed from the stream to determine if an optimal one of the columnar compression operations has been applied. If the optimal one of the columnar compression operations has been applied, the actual data structure of the initially unknown structured data is determined.

Abstract: Automatic detection of question and answer pairs contained in electronic communications channels is provided. Communications channels for a given enterprise, for example, emails, text message strings, and discussion forum strings are analyzed according to one or more features or patterns that are indicative of questions for detecting whether one or more questions are posed in a given communication. Next, answers that are relevant to identified questions are similarly identified by analyzing one or more communications for features and patterns that are indicative of answers to a question, and more particularly, to an identified question. Once an identified question is linked to an identified answer, the linked question and answer pair is stored in a publicly available repository for future reference by users having access to the repository.

Abstract: A computer implemented method for the retention of a search query, the method comprising selecting a media search source via a user interface; providing a form-based interface that allow the entry of inputs to form a first media search query; submitting the first media search query to the media search source; receiving a first media search result for viewing on the user interface based on the first media search query, the first media search result comprising first media; displaying the first media search result in a collection depository on the user interface; and saving the first media search query as a permalink for later use in submitting a second media search query; wherein the method is performed by one or more processors adapted to execute instructions stored on one or more memory components of the computer, is described herein.

Abstract: Techniques are disclosed for evaluating tuples for processing by a stream application having a plurality of process elements. In one embodiment, at least one tuple to be processed by at least one processing element of the stream application is identified. A maximum duration for which the at least one processing element is allowed to process the at least one tuple is determined. A duration for which the at least one processing element is likely to process the at least one tuple is also estimated. Processing of the at least one tuple is managed based on a comparison between the maximum duration and the estimated duration.

Abstract: A query classification system classifies queries based on query features of search queries and a query classification model. The query classification model can be trained to classify a search query based on the query features independent of (e.g., without accessing) search results or other search log data for the search query. The query classification model can be trained based on query data and search log data corresponding to a plurality of labeled queries.

Abstract: A method for displaying data items in a mobile terminal includes receiving a user search request, automatically identifying data items which individually comprise the search request, and displaying a distinct number in association with each of the identified data items, wherein each of the identified data items are individually selectable responsive to a corresponding number input by a user.

Abstract: The claimed subject matter relates to an architecture that can determine costs associated with updating file formats. In particular, the architecture can interface with a network-accessible data storage service in order to determine a cost-benefit to the data storage service for a wide variety of conversion scenarios applicable to the particular topology of the data storage service. For example, the cost-benefit can differ for storage services configured according to a client-server model relative to storage services configured according to a distributed topology. Regardless, the architecture can identify a legacy format, select a converter for converting the legacy format to the updated format, and then determine the cost-benefit for a variety of conversion or migration scenarios.

Abstract: Various embodiments of the present disclosure provide for an asynchronous state engine incorporated within a host application program. The state engine may operate based on a state transition table that may be updated independently of the host application. The state transition table may instruct the asynchronous state engine as to actions that should be performed prior to changing states. Such actions may include interacting with external applications. The state transition table may also instruct the host application to reside in a hold state until responses from external applications are received. Furthermore, the state transition table may instruct the host application as to follow up actions that should be performed when a state is entered. By allowing an external application to plug-in criteria for state changes within the host application, development of the host application may maintain a significant level of flexibility.

Abstract: Systems and methods are disclosed for creating a user profile for a subject user based on historical aggregate profile data for locations at which the subject user was previously located. In one embodiment, one or more location and time period pairs are determined for the subject user. Each location and time period pair defines a previous location of the subject user and a time period during which the subject user was at the previous location. Historical aggregate profile data is obtained for the location and time period pairs. For each location and time period pair, the historical aggregate profile data is generally an aggregation of user profiles of a number of users relevant to the location and time period pair. A user profile for the subject user is then created based on the historical aggregate profile data for the one or more location and time period pairs.

Abstract: Techniques are disclosed for searching a set of documents using search terms. In one embodiment, a summary is provided for each document in the set. Search terms are received, and the set of documents are parsed using the received search terms. A first relevance value is calculated using only the summary of each document. A subset of documents having the highest relevance is provided by using the first relevance value. The subset of documents is parsed using the received search terms, to calculate a second relevance value for each document using the respective document. Query results are provided, the query results including documents having the highest relevance according to the second relevance value.

Abstract: Disclosed is a method and system for archiving data. A server computer (or any computing device) receives data transmitted over a network from a client computer, wherein at least some of the data was previously collected by a scientific instrument during an experiment. After receiving the data, the server computer updates (e.g., creates) an index for the received data, archives the received data, and automatically transmits a notification to the client computer that the received data has been archived.

Abstract: Rights clearances management for assets, such as media assets. A rights brokerage service enables potential licensees to clears rights to use assets within designated projects, such as advertising campaign projects. The potential licensee uses an interface to select or identify an asset without necessarily accessing the asset itself. The rights holders and the rights held by each rights holder are identified based on the asset identity. A request is automatically issued to the rights holders to approve use of the asset for the project. The potential licensee may use an interface to track progress of approvals from the rights holders. Unenforceable rights are detected and approval is automatically obtained. If all enforceable rights are cleared, the asset may be committed for approval by a project manager or other authority. When approved, a license to use the asset is automatically created between the potential licensee and each of the rights holders.