Abstract: An object of this invention is to filter the results of a website search or a published list on a website, by applying mathematical or logical criteria selected by the user or program, to any of the informational details of an element in the search result or list. An object of this invention is to expand the set of details associated with each element of the search result or published list by gathering user specified information associated with each element from the same or different websites. An object of this invention is to allow the user to identify details of interest of an element in the search result or published list and to limit the presentation of the results to the details of interest. An object of this invention is to accomplish this functionality in a generic manner independent of a specific or set of websites.

Abstract: Methods and apparatus are described for scoring documents in response, in part, to parameters related to the document, source, and/or cluster score. Methods and apparatus are also described for scoring a cluster in response, in part, to parameters related to documents within the cluster and/or sources corresponding to the documents within the cluster. In one embodiment, the invention may detect at least one document within the cluster; analyze a parameter corresponding to the document; and compute a cluster score based, in part, on the parameter, wherein the cluster score corresponds with at least one document within the cluster.

Abstract: Disclosed herein is a content conversion apparatus and method. The content conversion apparatus includes a table generation unit for generating a media dependent table and a weight table. An information management unit receives information about a terminal and information about a player of the terminal from the terminal and manages the received information. A content conversion unit generates a content information table, related to content that is to be converted, using the media dependent table, the weight table, the terminal information and the player information, and converts the content using the content information table so as to transmit converted content to the terminal.

Abstract: A method, a system and computer program product for resolving conflicts in applications are disclosed, A first set of instructions configured to use a second set of instructions is identified during execution of a program having the first set of instructions. A third set of instructions couples the first set of instructions to the second set of instructions. I Incompatibility between the first set of instructions and the second set of instructions is identified, in response to compiling the first set of instructions and compiling the second set of instructions. A mechanism is provided for the third set of instructions to modify the second set of instructions, which result in a modified second set of instructions compatible with the first set of instructions.

Abstract: A method, a system and computer program product for resolving conflicts in applications are disclosed, A first set of instructions configured to use a second set of instructions is identified during execution of a program having the first set of instructions. A third set of instructions couples the first set of instructions to the second set of instructions. I Incompatibility between the first set of instructions and the second set of instructions is identified, in response to compiling the first set of instructions and compiling the second set of instructions. A mechanism is provided for the third set of instructions to modify the second set of instructions, which result in a modified second set of instructions compatible with the first set of instructions.

Abstract: Resolving ambiguous variable names in processing of a computer application includes representing variable declarations with dynamic variable scopes of the computer application in a tree data structure where the nodes of the tree data structure are variable names of the computer application. Ambiguous variable names are resolved by calculating distances between a context node and two or more candidate nodes of the tree data structure where each of the candidate nodes contains the searched variable name. The weighted distance between the context node and each candidate node equals the number of downward steps from the context node to the candidate node multiplied by a first constant plus the number of upward steps from the context node to the candidate node multiplied by a second constant. The node having a desired weighted distance is selected and information from the selected node is returned to the computer application as the variable value.