Abstract:
In an interactive media environment, a model is provided where applications, each comprising zero or more script components and zero or more markup components, are themselves handled as visual elements having a Z order. A resource-efficient rendering order is provided where the application that has focus in an interactive media environment (by virtue of its receipt of user events) is rendered first. The remaining applications are rendered in top down order, i.e., in reverse Z order. Rendering is performed by drawing into one or more graphics buffers associated with respective applications. Frames for applications are composited from the graphics buffers bottoms up, in Z order, to provide the display with the correct appearance.
Abstract:
Refining a user query is disclosed. In one method, a query is received from a user, and then mapped to one or more search concepts. A list of search concepts associated associated with the query is then displayed. Alternatively or additionally, the search concepts associated with the query are used to provide a set of improved search results. In another method, a number of queries from a number of users are analyzed to identify two or more search concepts, and a popularity value is assigned to them based on the queries. Thus, the relative popularity of the respective search concepts can be determined. Alternatively or additionally, a preferred search query for the search concepts can be determined. The popularity and preferred queries can be used to allow automatic or user-initiated refinement.
Abstract:
An arrangement is provided where all applications in an interactive media environment run on a single application thread in a media player. Event queues are utilized to schedule the application thread's processing of workitems corresponding to events that occur in the environment. Workitems include methods to be invoked when the workitem is processed and arguments for the method. Workitems further include a begin time and an end time and are ordered in the event queue first by begin time followed by the order in which they were inserted into the queue. The application thread marks workitems whose begin times corresponds to the current or previous time and then processes marked workitems from the queue in order. Such processing is committed so that once the application thread begins processing of a workitem it does not stop. Workitems are dropped from the event queue if their end times have been passed.
Abstract:
A system and method for scoring documents in a search, wherein the scoring algorithm may be reconfigured dynamically. When a query is submitted, a score data structure is created for each document to be scored, which contains fields of information about how a given document compares to a query. A ranker object embodies a formula that derives a scalar score from the information contained in a score data structure. Scoring software is configured to apply the formula embodied in a ranker object to the values in the score data structure. Thus, the scoring formula can be dynamically changed without recompiling the scoring software by providing a new ranker object. Preferably, ranker objects are organized into rank sets, where each rank set contains a different ranker object for each class of document to be scored.
Abstract:
A system analyzes data from a search engine. A User Search Bundler analyzes User Searches groups similar User Searches into User Search Bundles, and an Intent Processor produces Intents based on the User Search Bundles. A Factor Generator considers User Searches and related information to produce Factors, where each Factor is with regard to a particular Result from a set of Search Results. A Relevance Classifier receives the Factors and operates based thereon to produce a Judgment for each Result. A Metric Generator produces Metrics based on the Factors and the Judgments, and, a data synthesizer formats extracted data into databases.