patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
---|---|---|---|---|---|
9,710,703 | 1 | 12 |
1. A method for detecting texts included in a specific image, comprising steps of: (a) an apparatus detecting or allowing another device to detect one or more text candidates in the specific image by referring to feature values of pixels in the specific image; (b) the apparatus classifying or allowing another device to classify one or more weak texts in the specific image as strong texts by referring to information on at least one text classified as a strong text in another image related to the specific image if more than a certain percentage of the detected text candidates are classified as the weak texts as a result of comparison between at least one threshold value and at least one feature value of at least one pixel selected in a region where the detected text candidates are included or a value converted from the feature value.
|
1. A method for detecting texts included in a specific image, comprising steps of: (a) an apparatus detecting or allowing another device to detect one or more text candidates in the specific image by referring to feature values of pixels in the specific image; (b) the apparatus classifying or allowing another device to classify one or more weak texts in the specific image as strong texts by referring to information on at least one text classified as a strong text in another image related to the specific image if more than a certain percentage of the detected text candidates are classified as the weak texts as a result of comparison between at least one threshold value and at least one feature value of at least one pixel selected in a region where the detected text candidates are included or a value converted from the feature value. 12. The method of claim 1 , further comprising a step of: (c) the apparatus grouping or allowing another device to group the strong texts if the number of the strong texts converted from the weak texts are more than two.
| 0.888325 |
9,960,932 | 19 | 20 |
19. A non-transitory computer-readable medium, according to claim 18 , wherein modifications to the document are performed using an authoring application.
|
19. A non-transitory computer-readable medium, according to claim 18 , wherein modifications to the document are performed using an authoring application. 20. A non-transitory computer-readable medium, according to claim 19 , wherein less than all of the plurality of authors have the authoring application.
| 0.5 |
9,146,908 | 19 | 21 |
19. A computer program product comprising a non-transitory computer readable storage medium including a computer readable program code, where the computer readable program code when executed on a computer causes the computer to: parse at least one XML document to be validated and to represent XML data in the at least one XML document as data objects in at least one data object model in a memory; parse at least one rule document and create a rule object model comprising rule objects in the memory; extract part of the data objects from the at least one data object model and extract part of the rule objects from the rule object model; search an execution context for at least one rule object of the extracted part of the rule objects from a context registry; perform validation for the at least one rule object in the execution context; and perform a partial validation in a corresponding execution context comprising validating the extracted part of the data objects based upon the extracted part of the rule objects.
|
19. A computer program product comprising a non-transitory computer readable storage medium including a computer readable program code, where the computer readable program code when executed on a computer causes the computer to: parse at least one XML document to be validated and to represent XML data in the at least one XML document as data objects in at least one data object model in a memory; parse at least one rule document and create a rule object model comprising rule objects in the memory; extract part of the data objects from the at least one data object model and extract part of the rule objects from the rule object model; search an execution context for at least one rule object of the extracted part of the rule objects from a context registry; perform validation for the at least one rule object in the execution context; and perform a partial validation in a corresponding execution context comprising validating the extracted part of the data objects based upon the extracted part of the rule objects. 21. The computer program product of claim 19 , where the computer readable program code when executed on the computer further causes the computer to extract the part of the data objects from the data object model according to predefined data extraction criteria.
| 0.560403 |
9,135,341 | 13 | 14 |
13. A system for paginating and previewing content within one or more data files received in response to an information search, the content within the one or more data files being in an essentially continuously-flowing non-paginated format, wherein information content within the one or more data files include content formatted by markup language code, the system comprising: one or more clients with a processor, a user interface, and a communication interface to a network that facilitates a connection between the clients and a search engine; and a preview engine that performs the following: receives a search result from the search engine in response to a query sent to the search engine, the sear result having a list of data files each of which comprises content represented in markup language code matching the search query, and for each of the data files in the list: retrieves the data file; paginates the content of the data file into discrete pages by applying pagination rules for dividing the content of the retrieved data file into multiple parts each suitable for page-level previewing purposes; generates preview pages each for rendering the same visible content of the retrieved data file that has been paginated into a respective discrete page of the retrieved data file; sending the preview pages to a corresponding client device which constructs a data file preview for the data file that simultaneously displays a subset of the preview pages generated for the data file, wherein, for each of the data files, the preview engine automatically selects from the preview pages generated for the data file the preview pages to be displayed in the constructed data file preview by virtue of the selected preview pages containing content matches that matches the search query, and wherein the constructed data file preview is configured to allow an end user of the client device to select preview pages, which are displayed in the data file preview, in order to view higher resolution versions of those preview pages matching the corresponding discrete pages of the retrieved data file.
|
13. A system for paginating and previewing content within one or more data files received in response to an information search, the content within the one or more data files being in an essentially continuously-flowing non-paginated format, wherein information content within the one or more data files include content formatted by markup language code, the system comprising: one or more clients with a processor, a user interface, and a communication interface to a network that facilitates a connection between the clients and a search engine; and a preview engine that performs the following: receives a search result from the search engine in response to a query sent to the search engine, the sear result having a list of data files each of which comprises content represented in markup language code matching the search query, and for each of the data files in the list: retrieves the data file; paginates the content of the data file into discrete pages by applying pagination rules for dividing the content of the retrieved data file into multiple parts each suitable for page-level previewing purposes; generates preview pages each for rendering the same visible content of the retrieved data file that has been paginated into a respective discrete page of the retrieved data file; sending the preview pages to a corresponding client device which constructs a data file preview for the data file that simultaneously displays a subset of the preview pages generated for the data file, wherein, for each of the data files, the preview engine automatically selects from the preview pages generated for the data file the preview pages to be displayed in the constructed data file preview by virtue of the selected preview pages containing content matches that matches the search query, and wherein the constructed data file preview is configured to allow an end user of the client device to select preview pages, which are displayed in the data file preview, in order to view higher resolution versions of those preview pages matching the corresponding discrete pages of the retrieved data file. 14. The system of claim 13 , wherein the preview engine has at least a user interface manager, connectors, a content converter, a page indexer, and a cache manager.
| 0.790816 |
9,319,181 | 4 | 5 |
4. The method according to claim 1 , further comprising the step of: executing a plurality of threads using a plurality of controllers to control said decoding of said parsed first words.
|
4. The method according to claim 1 , further comprising the step of: executing a plurality of threads using a plurality of controllers to control said decoding of said parsed first words. 5. The method according to claim 4 , wherein each of said threads controls said decoding of a respective one of said first words.
| 0.620588 |
7,752,536 | 13 | 14 |
13. A method according to claim 12 , further comprising: requesting the parameter information stored with the spreadsheet document.
|
13. A method according to claim 12 , further comprising: requesting the parameter information stored with the spreadsheet document. 14. A method according to claim 13 , further comprising: via the user interface component, displaying the list of one or more parameters.
| 0.5 |
8,719,041 | 7 | 8 |
7. The method of claim 1 including selecting a primary language for displaying and entering information at the seller application.
|
7. The method of claim 1 including selecting a primary language for displaying and entering information at the seller application. 8. The method of claim 7 wherein the primary language selected may be different than a language of the at least one targeted site.
| 0.5 |
9,594,750 | 1 | 5 |
1. A method for language translation comprising: providing program code to launch a translation window associated with a primary window, wherein when the primary window is displayed on a screen, the translation window will be positioned so that the translation window does not overlap the primary window; in the translation window, indicating input information in a first language; translating the input information from the first language to information in a second language; in the translation window, displaying the information in the second language; and permitting scrolling of the primary window independently from the translation window.
|
1. A method for language translation comprising: providing program code to launch a translation window associated with a primary window, wherein when the primary window is displayed on a screen, the translation window will be positioned so that the translation window does not overlap the primary window; in the translation window, indicating input information in a first language; translating the input information from the first language to information in a second language; in the translation window, displaying the information in the second language; and permitting scrolling of the primary window independently from the translation window. 5. The method of claim 1 wherein the input information comprises two or more words in the first language.
| 0.842342 |
5,499,319 | 3 | 5 |
3. The fuzzy logic decision-maker of claim 2 in which said fuzzifier second means receives said input signals and said representations of input fuzzy patterns generated by said fuzzifier first means from said input signals, said fuzzifier second means comprising means for selecting a clearness distribution from said knowledge-base corresponding to each of said input fuzzy patterns, and means for utilizing each said clearness distribution, and the input signal utilized by said fuzzifier first means in generating the representation of the fuzzy pattern which corresponds to said clearness distribution, to generate a representation of a clearness degree.
|
3. The fuzzy logic decision-maker of claim 2 in which said fuzzifier second means receives said input signals and said representations of input fuzzy patterns generated by said fuzzifier first means from said input signals, said fuzzifier second means comprising means for selecting a clearness distribution from said knowledge-base corresponding to each of said input fuzzy patterns, and means for utilizing each said clearness distribution, and the input signal utilized by said fuzzifier first means in generating the representation of the fuzzy pattern which corresponds to said clearness distribution, to generate a representation of a clearness degree. 5. The fuzzy logic decision-maker of claim 3 wherein each clearness distribution has an x-axis representing the range of input variable values for the fuzzy pattern which is associated with the input variable and which corresponds with said each clearness distribution and a y-axis representing clearness degrees and wherein said means for utilizing each said clearness distribution, and the input signal utilized by said fuzzifier first means in generating the representation of the fuzzy pattern which corresponds to said clearness distribution, locates said input signal on the x-axis of said clearness distribution and projects said input signal onto the y-axis of said clearness distribution in order to obtain the clearness degree of said input fuzzy pattern for said input signal.
| 0.5 |
7,548,913 | 1 | 8 |
1. A method, performed on one or more processing devices, for generating a report from multiple sources, the method comprising: obtaining a topic by processing input queries relating to the topic, the input queries corresponding to queries from multiple users made over a predefined period of time; obtaining information about the topic from the multiple sources, the information comprising excerpts from the search results that meet one or more criteria; wherein obtaining the information comprises: if the topic is ambiguous, disambiguating the topic by combining names of the one or more categories with the topic, thereby producing a disambiguated topic and formulating a search query based on the disambiguated topic; if the topic is not ambiguous, formulating the search query based on the topic; and searching the multiple sources using the search query to obtain the information; and generating the report using the excerpts, wherein generating comprises: obtaining subtopics by analyzing the excerpts from the multiple sources for commonalities; organizing the excerpts and hyperlinks associated with the excerpts under appropriate subtopics to provide a narrative flow relating to the topic, the excerpts being organized by subtopic and, in a subtopic, being organized in an order; and editing text in the excerpts, wherein editing comprises editing text in excerpts so that excerpts from different sources under subtopics read more like the excerpts from different sources came from a single source; and displaying the report.
|
1. A method, performed on one or more processing devices, for generating a report from multiple sources, the method comprising: obtaining a topic by processing input queries relating to the topic, the input queries corresponding to queries from multiple users made over a predefined period of time; obtaining information about the topic from the multiple sources, the information comprising excerpts from the search results that meet one or more criteria; wherein obtaining the information comprises: if the topic is ambiguous, disambiguating the topic by combining names of the one or more categories with the topic, thereby producing a disambiguated topic and formulating a search query based on the disambiguated topic; if the topic is not ambiguous, formulating the search query based on the topic; and searching the multiple sources using the search query to obtain the information; and generating the report using the excerpts, wherein generating comprises: obtaining subtopics by analyzing the excerpts from the multiple sources for commonalities; organizing the excerpts and hyperlinks associated with the excerpts under appropriate subtopics to provide a narrative flow relating to the topic, the excerpts being organized by subtopic and, in a subtopic, being organized in an order; and editing text in the excerpts, wherein editing comprises editing text in excerpts so that excerpts from different sources under subtopics read more like the excerpts from different sources came from a single source; and displaying the report. 8. The method of claim 1 , wherein the multiple sources comprise Web sites and the report comprises a Web page.
| 0.829231 |
8,718,368 | 18 | 19 |
18. A system for providing text flow around a non-rectangular graphic, comprising: a processor configured to find a two-dimensional area of intersection, if any, between a proposed text rectangle and the graphic; determine a bounding rectangle of the two-dimensional area of intersection; subtract the bounding rectangle of the two-dimensional area of intersection from the proposed text rectangle; and identify as a valid text area within the proposed text rectangle a valid rectangle, if any, that remains after the bounding rectangle has been subtracted from the proposed rectangle; and a memory configured to provide instructions to the processor.
|
18. A system for providing text flow around a non-rectangular graphic, comprising: a processor configured to find a two-dimensional area of intersection, if any, between a proposed text rectangle and the graphic; determine a bounding rectangle of the two-dimensional area of intersection; subtract the bounding rectangle of the two-dimensional area of intersection from the proposed text rectangle; and identify as a valid text area within the proposed text rectangle a valid rectangle, if any, that remains after the bounding rectangle has been subtracted from the proposed rectangle; and a memory configured to provide instructions to the processor. 19. A system as recited in claim 18 , wherein comprises a Bezier or other curve and finding the intersection, if any, between a proposed text rectangle and the graphic includes determining a polygon that at least approximates the graphic.
| 0.5 |
7,672,852 | 12 | 13 |
12. A computer-implemented method for executing, by a processor of a computing device, a prompt statement having a NAME variable and a KEY variable associated therewith, said method comprising: determining that the prompt statement specifies a resource string; identifying, by the processor a grammar variable that corresponds to the KEY variable; concatenating the grammar variable to the NAME variable; and identifying a resource string for the prompt statement that corresponds to the NAME variable.
|
12. A computer-implemented method for executing, by a processor of a computing device, a prompt statement having a NAME variable and a KEY variable associated therewith, said method comprising: determining that the prompt statement specifies a resource string; identifying, by the processor a grammar variable that corresponds to the KEY variable; concatenating the grammar variable to the NAME variable; and identifying a resource string for the prompt statement that corresponds to the NAME variable. 13. The computer-implemented method of claim 12 , further comprising: retrieving one or more media files that correspond to the resource string; and rendering the retrieved media files in response to the prompt statement.
| 0.5 |
9,417,709 | 11 | 20 |
11. A method for implementing sliding input of a text based upon an on-screen soft keyboard on an electronic equipment having a memory device and a processor, characterized in that, said method comprises the following steps: recording user-sliding trajectories; converting the recorded user-sliding trajectories into a user-sliding trajectory feature set to be processed; filtering in the memory device and originally choosing the words, wherein each of the originally chosen words has similar ideal sliding trajectory features with the user-sliding trajectory feature set; calculating a similarity between the ideal sliding trajectory features of each originally chosen word and said user-sliding trajectory features set according to key points on said trajectory, characterized in that, calculating said similarity including the following steps: calculating a rough similarity between the ideal sliding trajectory features of each originally chosen word and said user-sliding trajectory features set; calculating an accurate similarity between the ideal sliding trajectory features of each word obtained from the rough similarity calculation result and said user-sliding trajectory features set; wherein calculating said accurate similarity including calculating an accurate linear matching distance between the ideal sliding trajectory feature of each word obtained from the rough similarity calculation result and said user-sliding trajectory feature set; obtaining candidate words according to the similarity, wherein the ideal sliding trajectory of each candidate word contains at least one of the key points or at least one of the surrounding points of at least one of the key points on said user-sliding trajectory; feedbacking the candidate words.
|
11. A method for implementing sliding input of a text based upon an on-screen soft keyboard on an electronic equipment having a memory device and a processor, characterized in that, said method comprises the following steps: recording user-sliding trajectories; converting the recorded user-sliding trajectories into a user-sliding trajectory feature set to be processed; filtering in the memory device and originally choosing the words, wherein each of the originally chosen words has similar ideal sliding trajectory features with the user-sliding trajectory feature set; calculating a similarity between the ideal sliding trajectory features of each originally chosen word and said user-sliding trajectory features set according to key points on said trajectory, characterized in that, calculating said similarity including the following steps: calculating a rough similarity between the ideal sliding trajectory features of each originally chosen word and said user-sliding trajectory features set; calculating an accurate similarity between the ideal sliding trajectory features of each word obtained from the rough similarity calculation result and said user-sliding trajectory features set; wherein calculating said accurate similarity including calculating an accurate linear matching distance between the ideal sliding trajectory feature of each word obtained from the rough similarity calculation result and said user-sliding trajectory feature set; obtaining candidate words according to the similarity, wherein the ideal sliding trajectory of each candidate word contains at least one of the key points or at least one of the surrounding points of at least one of the key points on said user-sliding trajectory; feedbacking the candidate words. 20. The method according to claim 11 , characterized in that, said step of filtering in the memory device and originally choosing the words includes following substeps: obtaining a corresponding character string set according to the key point sequence on said user-sliding trajectory; inquiring in the memory device according to said character string set; fetching out probabilities of all the inquired-out strings and obtain words corresponding to individual probability; calculating a rough matching degree between those words and said user-sliding trajectory feature set.
| 0.5 |
9,824,470 | 15 | 17 |
15. The system of claim 11 , wherein a visual format of at least one a portion of the graphical element displayed that satisfy the user input highlight rules is modified relative to a format of other graphical elements that do not satisfy the user input highlight rules.
|
15. The system of claim 11 , wherein a visual format of at least one a portion of the graphical element displayed that satisfy the user input highlight rules is modified relative to a format of other graphical elements that do not satisfy the user input highlight rules. 17. The system of claim 15 , wherein the portion of the graphical element is displayed in a larger dimension relative to dimensions of other graphical elements that do not satisfy the user input highlight rules.
| 0.576305 |
9,356,574 | 26 | 28 |
26. The method of claim 23 , further comprising: receiving the first search query at a search engine service; constructing, in response to receiving the first search query, the first set of one or more response snippets using information from the first server content version of the sourced document; generating the first query response document comprising the first set of one or more response snippets; transmitting the second query response document from the search engine service to the user agent; receiving the second search query at the search engine service; constructing, in response to receiving the second search query, the second set of one or more response snippets using information from the second server content version of the sourced document; generating the second query response document comprising the second set of one or more response snippets; and transmitting the second query response document from the search engine service to the user agent.
|
26. The method of claim 23 , further comprising: receiving the first search query at a search engine service; constructing, in response to receiving the first search query, the first set of one or more response snippets using information from the first server content version of the sourced document; generating the first query response document comprising the first set of one or more response snippets; transmitting the second query response document from the search engine service to the user agent; receiving the second search query at the search engine service; constructing, in response to receiving the second search query, the second set of one or more response snippets using information from the second server content version of the sourced document; generating the second query response document comprising the second set of one or more response snippets; and transmitting the second query response document from the search engine service to the user agent. 28. The method of claim 26 , wherein the first client content version of the sourced document is a different version of the document than the first server content version of the sourced document.
| 0.679276 |
9,830,563 | 1 | 4 |
1. A method for managing legal obligations for data associated with a matter, comprising: determining, by at least one processor, at least one legal obligation with respect to the matter based at least in part on utilizing an enterprise map that comprises relationships between objects that represent data in an enterprise; generating, by the at least one processor, a workflow for performing the at least one legal obligation, the workflow providing instructions to personnel responsible for data management of one or more affected systems containing the data associated with the matter, the instructions being provided in a context of actions to be performed on the one or more affected systems; performing, by a conflicts module executing on the at least one processor a conflicts check of legal obligations across all matters to determine one or more conflicts in legal obligations for the personnel; in response to receiving, by the at least one processor, a criteria that specifies at least one of: an affected system of interest and a matter of interest: determining, by a cross-check module executing on the at least one processor, matters associated with the criteria and performing, by the cross-check module executing on the at least one processor, a cross-check of correlations between legal obligations across the matters associated with the criteria to determine an overlap between a first legal obligation and a second legal obligation for the personnel for a matter in the matters associated with the criteria; providing, by a portal module executing on the at least one processor, the instructions to the personnel via an information portal which provides a visual interface that displays in a single location all legal obligations to be performed by the personnel including the at least one legal obligation, all workflows for the personnel including the workflow, an indication of the one or more conflicts in legal obligations for the personnel, an indication of the overlap between a first legal obligation and a second legal obligation for the personnel for the matter and one or more retention schedules for the one or more affected systems in a single location for the personnel, wherein the indication of the overlap between the first legal obligation and a second legal obligation for the personnel for the matter includes an indication that the first legal obligation remains in effect for the personnel for the matter after removal of the second legal obligation; and providing, by the information portal executing on the at least one processor, an ability for the personnel to reroute conflicted legal obligations indicated by the information portal for review.
|
1. A method for managing legal obligations for data associated with a matter, comprising: determining, by at least one processor, at least one legal obligation with respect to the matter based at least in part on utilizing an enterprise map that comprises relationships between objects that represent data in an enterprise; generating, by the at least one processor, a workflow for performing the at least one legal obligation, the workflow providing instructions to personnel responsible for data management of one or more affected systems containing the data associated with the matter, the instructions being provided in a context of actions to be performed on the one or more affected systems; performing, by a conflicts module executing on the at least one processor a conflicts check of legal obligations across all matters to determine one or more conflicts in legal obligations for the personnel; in response to receiving, by the at least one processor, a criteria that specifies at least one of: an affected system of interest and a matter of interest: determining, by a cross-check module executing on the at least one processor, matters associated with the criteria and performing, by the cross-check module executing on the at least one processor, a cross-check of correlations between legal obligations across the matters associated with the criteria to determine an overlap between a first legal obligation and a second legal obligation for the personnel for a matter in the matters associated with the criteria; providing, by a portal module executing on the at least one processor, the instructions to the personnel via an information portal which provides a visual interface that displays in a single location all legal obligations to be performed by the personnel including the at least one legal obligation, all workflows for the personnel including the workflow, an indication of the one or more conflicts in legal obligations for the personnel, an indication of the overlap between a first legal obligation and a second legal obligation for the personnel for the matter and one or more retention schedules for the one or more affected systems in a single location for the personnel, wherein the indication of the overlap between the first legal obligation and a second legal obligation for the personnel for the matter includes an indication that the first legal obligation remains in effect for the personnel for the matter after removal of the second legal obligation; and providing, by the information portal executing on the at least one processor, an ability for the personnel to reroute conflicted legal obligations indicated by the information portal for review. 4. The method of claim 1 wherein determining the at least one legal obligation comprises determining, by the at least one processor, affected entities for the matter, the affected entities possessing the data associated with the legal matter.
| 0.550186 |
6,061,682 | 14 | 18 |
14. A method for discovering association rules in a database using item constraints and items having a hierarchial taxonomy, the taxonomy defining descendant and ancestor relationships between the items, the method comprising: generating a set of selected items from a database based on predefined constraints, the predefined constraints involving one or more of the items in a mining input expression; determining a support value for an itemset; if the support value of the itemset is greater than a minimum support value and the itemset contains at least one of the selected items, determining the number of times the itemset appears in the database; entering the itemset into a set of large itemsets; outputting an association rule when the number of times the entered itemset appears in the database bears a predetermined relationship to a number of times an associated itemset appears in the database and thereby satisfies a minimum confidence constraint.
|
14. A method for discovering association rules in a database using item constraints and items having a hierarchial taxonomy, the taxonomy defining descendant and ancestor relationships between the items, the method comprising: generating a set of selected items from a database based on predefined constraints, the predefined constraints involving one or more of the items in a mining input expression; determining a support value for an itemset; if the support value of the itemset is greater than a minimum support value and the itemset contains at least one of the selected items, determining the number of times the itemset appears in the database; entering the itemset into a set of large itemsets; outputting an association rule when the number of times the entered itemset appears in the database bears a predetermined relationship to a number of times an associated itemset appears in the database and thereby satisfies a minimum confidence constraint. 18. The method recited in claim 14, further comprising: forming a second itemset by concatenating the large itemsets with a set of large items in accordance with a predetermined concatenation regime to generate a set of candidate itemsets, where an item is large if the support value of the item is greater than a minimum support value; arranging the candidate itemsets so that each item within an itemset which is also contained in the set of selected items precedes any item not in the set of selected items; and using the set of candidate itemsets to output the association rules.
| 0.5 |
7,908,019 | 19 | 20 |
19. The method of claim 18 further comprising the step of executing the well formed command in the cycle of operation in the current state of the appliance.
|
19. The method of claim 18 further comprising the step of executing the well formed command in the cycle of operation in the current state of the appliance. 20. The method of claim 19 further comprising the steps of updating the current state of the cycle of operation in the appliance, and generating a new taxonomy dataset based on the updated state.
| 0.5 |
9,076,459 | 14 | 15 |
14. The method of operation of claim 1 , further comprising: generating features based at least in part on the received classifications of the frames of audio.
|
14. The method of operation of claim 1 , further comprising: generating features based at least in part on the received classifications of the frames of audio. 15. The method of operation of claim 14 wherein generating features based at least in part on the received classifications of the frames of audio includes generating features based on fragments classified as speech and not on fragments classified as either non-transient background noise or transient noise events.
| 0.5 |
9,830,362 | 8 | 11 |
8. A computer-implemented method, comprising: receiving a first character set search string comprising one or more characters in a first character set; converting the one or more characters in the first character set to one or more characters in a second character set; executing a search using the one or more characters in the second character set to obtain one or more second character set ranked search results; determining that the one or more ranked search results includes a character in the first character set; and re-ranking the one or more second character set ranked search results based on a match strength, the match strength being determined based on the number of appearances of characters from the first character set in each result in the search results in the second character set.
|
8. A computer-implemented method, comprising: receiving a first character set search string comprising one or more characters in a first character set; converting the one or more characters in the first character set to one or more characters in a second character set; executing a search using the one or more characters in the second character set to obtain one or more second character set ranked search results; determining that the one or more ranked search results includes a character in the first character set; and re-ranking the one or more second character set ranked search results based on a match strength, the match strength being determined based on the number of appearances of characters from the first character set in each result in the search results in the second character set. 11. The computer-implemented method of claim 8 , ranking the one or more ranked search results comprising: raising a ranking of an individual ranked search result when there is a match between a first character set character in the search string and a first character set character in the individual ranked search result; lowering the ranking of an individual ranked search result when there is not a match between a first character set character in the search string and a first character set character in the individual ranked search result; and leaving the ranking of an individual ranked search result unchanged when there is no first character set character in the search string.
| 0.5 |
8,775,454 | 1 | 3 |
1. A mobile telephone communication system, comprising: an input port configured to obtain voice data from at least one user, wherein the input port is configured to further communicate the voice data as part of a conversation through a mobile telephone communication network; at least one memory configured to store the voice data, a plurality of searchable transcripts of voice data obtained during a respective plurality of communications, each searchable transcript comprising a plurality of words, data indicating a time offset of the plurality of words with respect to the obtained voice data, and a synopsis of the conversation, wherein the searchable transcript is derived from at least a portion of the voice data obtained by the input port which is not communicated as part of a telephone conversation through the mobile telephone communication system, a respective word of a respective searchable transcript being synchronized with the voice data corresponding to the respective word; and a processor configured to: associate searchable metadata with the voice data for each of the plurality of communications, the searchable metadata comprising at least a physical location of the user during the respective communication, store the associated searchable metadata with the respective searchable transcript and synopsis of the conversation for each of the respective plurality of communications, in a manner searchable based on a content of the searchable transcript, a content of the synopsis, and the physical location of the user during a respective communication, and associate targeted advertising for presentation to a user in dependence on both the physical location and the searchable transcript.
|
1. A mobile telephone communication system, comprising: an input port configured to obtain voice data from at least one user, wherein the input port is configured to further communicate the voice data as part of a conversation through a mobile telephone communication network; at least one memory configured to store the voice data, a plurality of searchable transcripts of voice data obtained during a respective plurality of communications, each searchable transcript comprising a plurality of words, data indicating a time offset of the plurality of words with respect to the obtained voice data, and a synopsis of the conversation, wherein the searchable transcript is derived from at least a portion of the voice data obtained by the input port which is not communicated as part of a telephone conversation through the mobile telephone communication system, a respective word of a respective searchable transcript being synchronized with the voice data corresponding to the respective word; and a processor configured to: associate searchable metadata with the voice data for each of the plurality of communications, the searchable metadata comprising at least a physical location of the user during the respective communication, store the associated searchable metadata with the respective searchable transcript and synopsis of the conversation for each of the respective plurality of communications, in a manner searchable based on a content of the searchable transcript, a content of the synopsis, and the physical location of the user during a respective communication, and associate targeted advertising for presentation to a user in dependence on both the physical location and the searchable transcript. 3. The system as in claim 1 , wherein the metadata further comprises time data representing a time of a portion of the searchable transcript of a respective communication.
| 0.5 |
7,627,582 | 1 | 9 |
1. A system for visualization of search results comprising: (a) A system for visualization of search results comprising: (b) a processor, a memory and a display screen having separate first, second and third portions; (c) a two-dimensional map displayed to a user on the first portion of the display screen, the map showing search query terms; (d) a window for entering the search query terms in the third portion of the display screen; (e) a plurality of additional terms derived from the search query terms and from the search results and displayed on the two-dimensional map, (f) wherein the additional terms comprise both single words and multi-word phrases, and (g) wherein a location of the additional terms relative to each other on the map corresponds to a contextual relationship between the additional terms; (h) at least one pictorial graphical image displayed on the map in proximity to the search query terms; and (i) a plurality of URLs representing the search results displayed in the second portion of the display screen; and (j) a plurality of annotations displayed in the second portion of the display screen, each annotation displayed adjacent to its corresponding URL, (k) wherein at least some of the search terms are also displayed on the second portion of the display screen using a different font effect than the rest of the text displayed in the second portion of the display screen.
|
1. A system for visualization of search results comprising: (a) A system for visualization of search results comprising: (b) a processor, a memory and a display screen having separate first, second and third portions; (c) a two-dimensional map displayed to a user on the first portion of the display screen, the map showing search query terms; (d) a window for entering the search query terms in the third portion of the display screen; (e) a plurality of additional terms derived from the search query terms and from the search results and displayed on the two-dimensional map, (f) wherein the additional terms comprise both single words and multi-word phrases, and (g) wherein a location of the additional terms relative to each other on the map corresponds to a contextual relationship between the additional terms; (h) at least one pictorial graphical image displayed on the map in proximity to the search query terms; and (i) a plurality of URLs representing the search results displayed in the second portion of the display screen; and (j) a plurality of annotations displayed in the second portion of the display screen, each annotation displayed adjacent to its corresponding URL, (k) wherein at least some of the search terms are also displayed on the second portion of the display screen using a different font effect than the rest of the text displayed in the second portion of the display screen. 9. The system of claim 1 , wherein a plurality of pictorial graphical images are displayed in proximity to the search query terms.
| 0.563758 |
7,499,931 | 7 | 12 |
7. A method of projecting a representation of an Extensible Markup Language (XML) document, the method comprising steps of: A) receiving the XML document as input; B) receiving at least one XPath query to be evaluated against the XML document; C) deriving a set of XPath expressions from the XML document, wherein the XPath expressions are represented as a rooted XPath expression tree with labeled vertices and edges, and wherein the XPath expression tree comprises at least one axis selected from a group consisting of: backward, ancestor, parent, following, preceding, following-sibling, and preceding-sibling axes; and D) constructing a projection of the XML document for evaluation of the XPath query, the projection based on the XPath expression tree, wherein the constructing step comprises: 1) normalizing the XPath expression tree into a canonical form, wherein the normalizing step comprises: a) rewriting instances of following, preceding, following-sibling and preceding-sibling axes in the XPath expression tree into order-blind axes, such as parent and ancestor, by introducing new vertices such that there are no more instances of following and preceding in the rewritten XPath expression tree; and b) merging vertices of the rewritten XPath expression tree to remove redundancies; 2) traversing the XML document in a depth-first manner to build a tree representation of the XML document, the traversing step comprising: a) generating start events when the traversal first visits an element; b) generating end events once the traversal of a subtree rooted at that element is finished; c) concurrently with generating the events, constructing nodes for all elements that may participate in an embedding; and d) adding all ancestor nodes of the elements that may participate in an embedding; E) evaluating the at least one XPath query against the tree representation in a bottom-up manner to produce a result such that the result of the evaluation of the XPath query on the projection of the XML document is the same as a result of evaluation of the XPath query on the XML document and comprises all nodes that are solutions of the XPath query, and their backward axes; and F) serializing the result.
|
7. A method of projecting a representation of an Extensible Markup Language (XML) document, the method comprising steps of: A) receiving the XML document as input; B) receiving at least one XPath query to be evaluated against the XML document; C) deriving a set of XPath expressions from the XML document, wherein the XPath expressions are represented as a rooted XPath expression tree with labeled vertices and edges, and wherein the XPath expression tree comprises at least one axis selected from a group consisting of: backward, ancestor, parent, following, preceding, following-sibling, and preceding-sibling axes; and D) constructing a projection of the XML document for evaluation of the XPath query, the projection based on the XPath expression tree, wherein the constructing step comprises: 1) normalizing the XPath expression tree into a canonical form, wherein the normalizing step comprises: a) rewriting instances of following, preceding, following-sibling and preceding-sibling axes in the XPath expression tree into order-blind axes, such as parent and ancestor, by introducing new vertices such that there are no more instances of following and preceding in the rewritten XPath expression tree; and b) merging vertices of the rewritten XPath expression tree to remove redundancies; 2) traversing the XML document in a depth-first manner to build a tree representation of the XML document, the traversing step comprising: a) generating start events when the traversal first visits an element; b) generating end events once the traversal of a subtree rooted at that element is finished; c) concurrently with generating the events, constructing nodes for all elements that may participate in an embedding; and d) adding all ancestor nodes of the elements that may participate in an embedding; E) evaluating the at least one XPath query against the tree representation in a bottom-up manner to produce a result such that the result of the evaluation of the XPath query on the projection of the XML document is the same as a result of evaluation of the XPath query on the XML document and comprises all nodes that are solutions of the XPath query, and their backward axes; and F) serializing the result. 12. The method of claim 7 wherein the traversing step further comprises removing unsatisfiable XPath expressions.
| 0.68956 |
8,560,935 | 2 | 6 |
2. The computer-implemented system of claim 1 , further comprising: the first entity includes two or more medical professional users; and the master field component creates one or more copied subsets of questions, wherein the one or more copied subsets of questions are a copy of the second subset of questions for each of the two or more medical professional users, wherein the one or more copied subsets enable each of the two or more medical professional users to concurrently access the master field list to provide information responsive to the second subset of questions, and wherein the second subset of questions and one or more copied subsets persist in two or more storage locations on the memory.
|
2. The computer-implemented system of claim 1 , further comprising: the first entity includes two or more medical professional users; and the master field component creates one or more copied subsets of questions, wherein the one or more copied subsets of questions are a copy of the second subset of questions for each of the two or more medical professional users, wherein the one or more copied subsets enable each of the two or more medical professional users to concurrently access the master field list to provide information responsive to the second subset of questions, and wherein the second subset of questions and one or more copied subsets persist in two or more storage locations on the memory. 6. The computer-implemented system of claim 2 , further comprising: the first entity is at least one of a medical practice or a dentistry practice, the at least one medical professional user is at least one of a doctor or a dentist; the administrator user is an employee with the first entity that handles administrative duties related to at least one of the medical practice or the dentistry practice.
| 0.900396 |
7,487,469 | 7 | 8 |
7. A computer readable storage medium according to claim 1 , wherein when the long push operation is performed for a predetermined time period or longer in the entry word candidate display area, the entry word change operation detection means detects the long push operation as the entry word change operation by the user.
|
7. A computer readable storage medium according to claim 1 , wherein when the long push operation is performed for a predetermined time period or longer in the entry word candidate display area, the entry word change operation detection means detects the long push operation as the entry word change operation by the user. 8. A computer readable storage medium according to claim 7 , wherein: the entry word data includes the plurality of entry words which are sequentially ordered from a first entry word to a final entry word; when the long push operation is performed for the predetermined time period or longer in the entry word candidate display area, the entry word change operation detection means detects which of the first sub area and the second sub area of the entry word candidate display area is represented by the input coordinate set from the coordinate set input means; and (a) when the input coordinate set from the coordinate set input means represents the second sub area, the second display control means erases at least an entry word displayed at a most forward position in the entry word candidate display area, and displays a new entry word subsequent to an entry word displayed at a most rearward position in the entry word candidate display area; and (b) when the input coordinate set from the coordinate set input means represents the first sub area, the second display control means erases at least an entry word displayed at the most rearward position in the entry word candidate display area, and displays a new entry word preceding an entry word displayed at the most forward position in the entry word candidate display area.
| 0.599218 |
10,162,315 | 5 | 10 |
5. The process control configuration method of claim 1 , wherein the one or more configurable logic algorithms provide one or more logic states based on whether conditions are satisfied in accordance with the one or more configurable logical expressions.
|
5. The process control configuration method of claim 1 , wherein the one or more configurable logic algorithms provide one or more logic states based on whether conditions are satisfied in accordance with the one or more configurable logical expressions. 10. The process control configuration method of claim 5 , further comprising: for each of the first and the second adapter component templates, displaying an adapter diagnostic window that (i) concurrently presents each of the one or more logic states associated with the first and the second adapter component templates in terms of natural language, and (ii) identifies an overall state of the first and the second adapter component templates.
| 0.5 |
8,396,894 | 14 | 15 |
14. A non-transitory storage device storing a computer program product operable to cause one or more processors to perform operations comprising: receiving structured data and unstructured data, the structured data including a data record having multiple data fields as defined in a database schema, the unstructured data including an electronic document; generating a first event record representing the structured data and a second event record representing the unstructured data, the first event record and second event record being stored in an event data structure that is monitored by a collection manager configured for generating metadata of the structured data and a file manager configured for generating metadata of the unstructured data; integrating the structured data and the unstructured data, including, based on the metadata of the structured data and the metadata of the structured data, configuring an abstraction layer to perform a database operation on both the structured data and the unstructured data; and providing an integrated view of the structured data and the unstructured data for display, the integrated view including a user interface for allowing the user to control the database operation of the abstraction layer.
|
14. A non-transitory storage device storing a computer program product operable to cause one or more processors to perform operations comprising: receiving structured data and unstructured data, the structured data including a data record having multiple data fields as defined in a database schema, the unstructured data including an electronic document; generating a first event record representing the structured data and a second event record representing the unstructured data, the first event record and second event record being stored in an event data structure that is monitored by a collection manager configured for generating metadata of the structured data and a file manager configured for generating metadata of the unstructured data; integrating the structured data and the unstructured data, including, based on the metadata of the structured data and the metadata of the structured data, configuring an abstraction layer to perform a database operation on both the structured data and the unstructured data; and providing an integrated view of the structured data and the unstructured data for display, the integrated view including a user interface for allowing the user to control the database operation of the abstraction layer. 15. The non-transitory storage device of claim 14 , where: the electronic document has an internal structure that is different from a structure defined in the database schema.
| 0.5 |
8,910,117 | 13 | 18 |
13. An apparatus for setting customized policy for version control, comprising: a memory; and a processor programmed to execute: a policy generating unit configured to generate, in response to detecting a user selection of a version control option, at least one executable version control customized policy entity that provides source code file processing capabilities according to the detected selection of the version control option; a policy customizing unit configured to associate the at least one executable version control customized policy entity generated by the policy generating unit with a project or user to create one of a project-customized and a user-customized version control policy association, respectively, where the at least one executable version control customized policy entity is executed as source code files are processed in association with the respective project or the user; and a saving unit configured to save the generated at least one executable version control customized policy entity and information of the associated project or user within the memory.
|
13. An apparatus for setting customized policy for version control, comprising: a memory; and a processor programmed to execute: a policy generating unit configured to generate, in response to detecting a user selection of a version control option, at least one executable version control customized policy entity that provides source code file processing capabilities according to the detected selection of the version control option; a policy customizing unit configured to associate the at least one executable version control customized policy entity generated by the policy generating unit with a project or user to create one of a project-customized and a user-customized version control policy association, respectively, where the at least one executable version control customized policy entity is executed as source code files are processed in association with the respective project or the user; and a saving unit configured to save the generated at least one executable version control customized policy entity and information of the associated project or user within the memory. 18. The apparatus according to claim 13 , where the policy customizing unit associates each user related to the project with the generated at least one executable version control customized policy entity associated with that project.
| 0.819659 |
9,514,219 | 14 | 15 |
14. A method according to claim 11 , further comprising: determining the unclassified documents with the same text comprising: generating a search string comprising one or more words from the highlighted text; applying the search string to the unclassified documents; and selecting the unclassified documents with the same text when the text is highly inclusive of the words in the search string.
|
14. A method according to claim 11 , further comprising: determining the unclassified documents with the same text comprising: generating a search string comprising one or more words from the highlighted text; applying the search string to the unclassified documents; and selecting the unclassified documents with the same text when the text is highly inclusive of the words in the search string. 15. A method according to claim 14 , further comprising: selecting the unclassified documents with similar text when the text is less inclusive of the words in the search string than the text that is the same as the compared portion of the highlighted text in the document.
| 0.5 |
7,711,573 | 411 | 417 |
411. A computer program product, to be used on a computer, for improving a precision ratio when searching a resume database, comprising: a computer readable medium storing: program code for receiving a resume; program code for parsing the resume to: locate at least one skill or experience-related phrase in the resume; determine an experience range for each said at least one skill or experience-related phrase by examining a use of each said at least one skill or experience-related phrase in the resume; and compute a term of experience for each said at least one skill or experience-related phrase based on the experience range, wherein the term of experience for each said at least one skill or experience-related phrase is a summation of the term of experience for each occurrence of the phrase associated with a different experience range; program code for storing the resume in the resume database; program code for associating at least one of said at least one skill or experience-related phrase located in the resume with at least one implied skill or experience-related phrase, wherein a term of experience for each said at least one implied skill or experience-related phrase is the term of experience computed for said at least one of said at least one skill or experience-related phrase, and wherein said at least one skill or experience-related phrase and said at least one implied skill or experience-related phrase are searchable phrases in the resume; program code for creating a parsed resume based on the resume, the parsed resume including each searchable phrase in the resume, the term of experience for each searchable phrase, and a relationship between the term of experience and each searchable phrase; program code for storing the parsed resume in the resume database; program code for sending a database query to the resume database, the database query including a job description that includes at least one job requirement, each said at least one job requirement including a required skill or experience-related phrase, and a required term of experience; and program code for receiving a result set in response to the database query, wherein the result set includes the resume when the parsed resume satisfies the job description.
|
411. A computer program product, to be used on a computer, for improving a precision ratio when searching a resume database, comprising: a computer readable medium storing: program code for receiving a resume; program code for parsing the resume to: locate at least one skill or experience-related phrase in the resume; determine an experience range for each said at least one skill or experience-related phrase by examining a use of each said at least one skill or experience-related phrase in the resume; and compute a term of experience for each said at least one skill or experience-related phrase based on the experience range, wherein the term of experience for each said at least one skill or experience-related phrase is a summation of the term of experience for each occurrence of the phrase associated with a different experience range; program code for storing the resume in the resume database; program code for associating at least one of said at least one skill or experience-related phrase located in the resume with at least one implied skill or experience-related phrase, wherein a term of experience for each said at least one implied skill or experience-related phrase is the term of experience computed for said at least one of said at least one skill or experience-related phrase, and wherein said at least one skill or experience-related phrase and said at least one implied skill or experience-related phrase are searchable phrases in the resume; program code for creating a parsed resume based on the resume, the parsed resume including each searchable phrase in the resume, the term of experience for each searchable phrase, and a relationship between the term of experience and each searchable phrase; program code for storing the parsed resume in the resume database; program code for sending a database query to the resume database, the database query including a job description that includes at least one job requirement, each said at least one job requirement including a required skill or experience-related phrase, and a required term of experience; and program code for receiving a result set in response to the database query, wherein the result set includes the resume when the parsed resume satisfies the job description. 417. The computer program product of claim 411 , wherein the program code for storing the resume further comprises: program code for storing the resume as a public resume, wherein the resume database is accessible by at least one recruiter, and the public resume is accessible by every recruiter.
| 0.741259 |
5,559,969 | 29 | 30 |
29. An improvement according to claim 28 wherein the width of the second bus is twice as wide as the width of the first bus.
|
29. An improvement according to claim 28 wherein the width of the second bus is twice as wide as the width of the first bus. 30. An improvement according to claim 29 wherein said second control means sequentially receives one second data packets from the second bus during one successive bus cycles of the second bus, then said second formatting means disassembles the one second data packet and produces two first data packets, the resulting two first data packets being transmitted over the first bus on the next succeeding two bus cycle of the first bus.
| 0.5 |
8,082,277 | 10 | 17 |
10. A document generation method, comprising the steps of: storing, in memory, data defining a document; defining a plurality of permission levels, including at least a first permission level, a second permission level, and a third permission level; assigning each of a plurality of users to a respective one of the permission levels; authorizing users assigned to the first permission level to at least modify the document; authorizing users assigned to the second permission level to at least review the document and make comments for reading by at least one user assigned to the first permission level; authorizing users assigned to the third permission level to at least review the document and approve the document on a section-by-section basis; receiving first user inputs from a first user assigned to the first permission level; editing a first section of the document based on the first user inputs; determining when the first section is ready for review by at least one user assigned to the second permission level based on at least one of the first user inputs; automatically sending a notice to a second user assigned to the second permission level based on the determining step; receiving from the second user a comment relating to the first section; providing the comment to the first user; receiving a second user input from the second user indicating that the first section is approved for review by at least one user assigned to the third permission level; automatically sending a notice to a third user assigned to the third permission level in response to the second user input; receiving a third user input from the third user indicating that the first section is approved by the third user; associating each section of the document with a respective status indicator indicating whether the respective section has been approved by at least one user assigned to the second permission level; and updating the status indicator associated with the first section in response to the second user input.
|
10. A document generation method, comprising the steps of: storing, in memory, data defining a document; defining a plurality of permission levels, including at least a first permission level, a second permission level, and a third permission level; assigning each of a plurality of users to a respective one of the permission levels; authorizing users assigned to the first permission level to at least modify the document; authorizing users assigned to the second permission level to at least review the document and make comments for reading by at least one user assigned to the first permission level; authorizing users assigned to the third permission level to at least review the document and approve the document on a section-by-section basis; receiving first user inputs from a first user assigned to the first permission level; editing a first section of the document based on the first user inputs; determining when the first section is ready for review by at least one user assigned to the second permission level based on at least one of the first user inputs; automatically sending a notice to a second user assigned to the second permission level based on the determining step; receiving from the second user a comment relating to the first section; providing the comment to the first user; receiving a second user input from the second user indicating that the first section is approved for review by at least one user assigned to the third permission level; automatically sending a notice to a third user assigned to the third permission level in response to the second user input; receiving a third user input from the third user indicating that the first section is approved by the third user; associating each section of the document with a respective status indicator indicating whether the respective section has been approved by at least one user assigned to the second permission level; and updating the status indicator associated with the first section in response to the second user input. 17. The method of claim 10 , further comprising the step of providing an indication when each section of the document has been approved by at least one user assigned to the third permission level.
| 0.524272 |
8,977,555 | 1 | 3 |
1. A system comprising: a computer-readable memory storing executable instructions; and one or more processors in communication with the computer-readable memory, wherein the one or more processors are programmed by the executable instructions to at least: generate text to be presented to a user, wherein the text comprises a sequence of items; generate an audio presentation using the text; associate a plurality of identifiers with the sequence of items, wherein each item of the sequence of items is associated with at least one identifier of the plurality of identifiers; transmit, to a client device, the audio presentation and the plurality of identifiers; receive, from the client device: audio data comprising a user utterance; and a first identifier of the plurality of identifiers; perform speech recognition on the user utterance to obtain speech recognition results; identify a first item, of the sequence of items, based at least partly on the first identifier and the speech recognition results; and perform an action based at least partly on the first item.
|
1. A system comprising: a computer-readable memory storing executable instructions; and one or more processors in communication with the computer-readable memory, wherein the one or more processors are programmed by the executable instructions to at least: generate text to be presented to a user, wherein the text comprises a sequence of items; generate an audio presentation using the text; associate a plurality of identifiers with the sequence of items, wherein each item of the sequence of items is associated with at least one identifier of the plurality of identifiers; transmit, to a client device, the audio presentation and the plurality of identifiers; receive, from the client device: audio data comprising a user utterance; and a first identifier of the plurality of identifiers; perform speech recognition on the user utterance to obtain speech recognition results; identify a first item, of the sequence of items, based at least partly on the first identifier and the speech recognition results; and perform an action based at least partly on the first item. 3. The system of claim 1 , wherein the first identifier and the audio data are received in a single data transmission.
| 0.800676 |
9,092,673 | 4 | 7 |
4. The method of claim 1 wherein processing the image-to-image data structure, the word-to-word data structure, and the image-to-word data structure simultaneously comprises performing heterogeneous affinity propagation to determine a set of exemplars.
|
4. The method of claim 1 wherein processing the image-to-image data structure, the word-to-word data structure, and the image-to-word data structure simultaneously comprises performing heterogeneous affinity propagation to determine a set of exemplars. 7. The method of claim 4 wherein performing heterogeneous affinity propagation comprises iterating to update homogeneous messages using heterogeneous messages and to update heterogeneous messages using homogeneous messages, until computed candidate exemplars do not change from a previous iteration.
| 0.54 |
8,185,427 | 1 | 34 |
1. A method of representing user tasks to be performed by one or more of a plurality of electronic devices in a task orchestration system, the method comprising: employing a controller device for: obtaining device function descriptions, wherein each device function description describes a function that a device can perform; obtaining task descriptions from multiple electronic devices of a plurality of electronic devices, wherein the task descriptions are dynamically determined at run-time of the task orchestration system, wherein each task description describes the device functionality a certain task requires; generating task suggestions based on the obtained task descriptions and device function descriptions, wherein each task suggestion represents a user task as an abstraction of one or more of the obtained device functions descriptions and task descriptions; applying user preferences over the generated task suggestions to determine a rank order for the generated task suggestions; and displaying task suggestions in the rank order on a display for the user to select from, wherein the user selected task suggestion is to be performed by one or more of the devices.
|
1. A method of representing user tasks to be performed by one or more of a plurality of electronic devices in a task orchestration system, the method comprising: employing a controller device for: obtaining device function descriptions, wherein each device function description describes a function that a device can perform; obtaining task descriptions from multiple electronic devices of a plurality of electronic devices, wherein the task descriptions are dynamically determined at run-time of the task orchestration system, wherein each task description describes the device functionality a certain task requires; generating task suggestions based on the obtained task descriptions and device function descriptions, wherein each task suggestion represents a user task as an abstraction of one or more of the obtained device functions descriptions and task descriptions; applying user preferences over the generated task suggestions to determine a rank order for the generated task suggestions; and displaying task suggestions in the rank order on a display for the user to select from, wherein the user selected task suggestion is to be performed by one or more of the devices. 34. The method of claim 1 , wherein the modifiers describe a particular location to apply to the task suggestions.
| 0.751092 |
9,274,820 | 10 | 11 |
10. The method of claim 9 , wherein the local qualifier command and the local mnemonic command are defined within a macro in the computer program.
|
10. The method of claim 9 , wherein the local qualifier command and the local mnemonic command are defined within a macro in the computer program. 11. The method of claim 10 , further comprising: interpreting the local qualifier command or the local mnemonic command called within the macro to apply only to instances of the mnemonic called within the macro in response to the local qualifier command or the local mnemonic command being specified to have a macro scope and to not affect the interpretation of the mnemonic provided by any local qualifier command or local mnemonic command external to the macro.
| 0.5 |
8,538,704 | 1 | 13 |
1. A method, implemented by a computing device, in a healthcare information technology system for providing inferred genetic findings for a person, the method comprising: receiving a request issued by a user for genetic test results for a subject gene for a person; incident to receiving the request, accessing a first data store to discover whether there exists the genetic test results for the person; and when the genetic test results of the person are undiscovered, automatically inferring, at the computing device, one or more genetic findings, wherein the process of inferring comprises: (a) accessing an inference table that associates genes with a plurality of modes of inheritance; (b) identifying a mode of inheritance associated with the subject gene by querying the inference table with the subject gene; (c) determining a traversal pattern of the subject gene within a family of the person as a function of the identified mode of inheritance; (d) employing the traversal pattern to target at least one member of the family of the person that potentially carries the subject gene; (e) accessing a second data store to discover whether there exists genetic test results for the at least one targeted member of the person's family; and (f) when the genetic test results of the at least one targeted member of the person's family are discovered, calculating a probability that the person exhibits a mutated form of the subject gene using the genetic test results of the at least one targeted member of the person's family.
|
1. A method, implemented by a computing device, in a healthcare information technology system for providing inferred genetic findings for a person, the method comprising: receiving a request issued by a user for genetic test results for a subject gene for a person; incident to receiving the request, accessing a first data store to discover whether there exists the genetic test results for the person; and when the genetic test results of the person are undiscovered, automatically inferring, at the computing device, one or more genetic findings, wherein the process of inferring comprises: (a) accessing an inference table that associates genes with a plurality of modes of inheritance; (b) identifying a mode of inheritance associated with the subject gene by querying the inference table with the subject gene; (c) determining a traversal pattern of the subject gene within a family of the person as a function of the identified mode of inheritance; (d) employing the traversal pattern to target at least one member of the family of the person that potentially carries the subject gene; (e) accessing a second data store to discover whether there exists genetic test results for the at least one targeted member of the person's family; and (f) when the genetic test results of the at least one targeted member of the person's family are discovered, calculating a probability that the person exhibits a mutated form of the subject gene using the genetic test results of the at least one targeted member of the person's family. 13. The method of claim 1 , further comprising inquiring whether the at least one targeted member of the family of the person has genetic markers associated with the subject gene.
| 0.820281 |
7,930,262 | 8 | 9 |
8. A non-transitory computer usable storage medium having computer usable program product encoded thereon for performing analysis on a plurality of data stored in a database, the computer program product including: computer usable program code for generating a first cohort from the plurality of data; computer usable program code for generating an optimal control cohort from the plurality of data, wherein generating is performed based on the first cohort and at least one constraint, and wherein a mathematical process is used to derive the optimal control cohort; computer usable program code for generating a first inference based on a comparison of the first cohort to the optimal control cohort, wherein the first inference is absent from the database; and storing the first inference; computer usable program code for receiving an I th query at the database regarding an I th fact, wherein I is an integer reflecting how many times a recursion process has been conducted, wherein the I th fact becomes a compound fact that includes multiple sub-facts on a subsequent iteration of the recursion process; computer usable program code for establishing the I th fact as a frame of reference for the I th query based on the first cohort and based on the optimal control cohort; computer usable program code for applying an I th set of rules to the I th query, wherein the I th set of rules is determined for the I th query according to a J th set of rules, wherein J is equal to I−1, wherein the I th set of rules determines how the plurality of data are to be compared to the I th fact, and wherein the first set of rules determines an I th search space for the I th query; computer usable program code for executing the I th query to generate a second inference, wherein the second inference is determined from comparing the plurality of data according to the I th set of rules; storing the second inference; and evaluating a hypothesis within a research study based on the first cohort, the optimal control cohort, the first inference, and the second inference.
|
8. A non-transitory computer usable storage medium having computer usable program product encoded thereon for performing analysis on a plurality of data stored in a database, the computer program product including: computer usable program code for generating a first cohort from the plurality of data; computer usable program code for generating an optimal control cohort from the plurality of data, wherein generating is performed based on the first cohort and at least one constraint, and wherein a mathematical process is used to derive the optimal control cohort; computer usable program code for generating a first inference based on a comparison of the first cohort to the optimal control cohort, wherein the first inference is absent from the database; and storing the first inference; computer usable program code for receiving an I th query at the database regarding an I th fact, wherein I is an integer reflecting how many times a recursion process has been conducted, wherein the I th fact becomes a compound fact that includes multiple sub-facts on a subsequent iteration of the recursion process; computer usable program code for establishing the I th fact as a frame of reference for the I th query based on the first cohort and based on the optimal control cohort; computer usable program code for applying an I th set of rules to the I th query, wherein the I th set of rules is determined for the I th query according to a J th set of rules, wherein J is equal to I−1, wherein the I th set of rules determines how the plurality of data are to be compared to the I th fact, and wherein the first set of rules determines an I th search space for the I th query; computer usable program code for executing the I th query to generate a second inference, wherein the second inference is determined from comparing the plurality of data according to the I th set of rules; storing the second inference; and evaluating a hypothesis within a research study based on the first cohort, the optimal control cohort, the first inference, and the second inference. 9. The computer usable medium of claim 8 wherein the second inference either validates the first inference or is based on the first inference.
| 0.646766 |
8,311,999 | 9 | 10 |
9. A knowledge research and mapping system, comprising: at least one computer processor coupled to at least one non-transitory storage medium; a research knowledge map stored in the at least one non-transitory storage medium and generated by the at least one processor using an entity-relationship model comprising entity-relationship-entity triplets, such that topics determined from the one or more queries are represented as entities and relationships between entities are determined based on an informational taxonomy; a query input module that: receives a query related to a domain of research; stores the query in the research knowledge map; and submits the query to one or more knowledge bases; a results presenter that filters one or more responses to the query into response relationship subsets; and a research event recorder that links one or more responses from the response relationship subsets to the stored query in the research knowledge map, wherein the knowledge map provides interrelated information for one or more queries within the domain of research.
|
9. A knowledge research and mapping system, comprising: at least one computer processor coupled to at least one non-transitory storage medium; a research knowledge map stored in the at least one non-transitory storage medium and generated by the at least one processor using an entity-relationship model comprising entity-relationship-entity triplets, such that topics determined from the one or more queries are represented as entities and relationships between entities are determined based on an informational taxonomy; a query input module that: receives a query related to a domain of research; stores the query in the research knowledge map; and submits the query to one or more knowledge bases; a results presenter that filters one or more responses to the query into response relationship subsets; and a research event recorder that links one or more responses from the response relationship subsets to the stored query in the research knowledge map, wherein the knowledge map provides interrelated information for one or more queries within the domain of research. 10. The system of claim 9 , wherein the entities representing one or more queries have linked to them one or more responses to the queries.
| 0.760345 |
7,992,082 | 1 | 8 |
1. A method for determining information associated with documents, comprising: receiving documents, wherein the documents include images; determining a first set of editing instructions and classification information associated with the documents using image-processing software; and providing the images and first set of editing instructions and classification to a group of individuals receiving a second set of editing instructions and classification information associated with the documents, wherein the second set of editing instructions and classification information are generated by a group of individuals and include modifications and additions to the first set of editing instructions and classification information, and wherein the second set of editing instructions and classification information include subjective comments about content in the documents storing the documents and the second set of editing instructions and classification information in a non-transitory computer-readable medium, wherein the second set of editing instructions and classification information facilitate searches for content in the stored documents; receiving a request for information that is associated with a time-varying subjective value identifying information by searching through the stored documents using the second set of editing instructions and the classification information; and providing the information in response to the request, wherein the information includes multiple versions of at least one of the documents, and wherein the multiple versions are, at least in part, based on different editing instructions and classification information in the second set of editing instructions and classification information from different individuals in the group, which includes different identified subjective content, thereby proving different images that reflect the time-varying subjective value.
|
1. A method for determining information associated with documents, comprising: receiving documents, wherein the documents include images; determining a first set of editing instructions and classification information associated with the documents using image-processing software; and providing the images and first set of editing instructions and classification to a group of individuals receiving a second set of editing instructions and classification information associated with the documents, wherein the second set of editing instructions and classification information are generated by a group of individuals and include modifications and additions to the first set of editing instructions and classification information, and wherein the second set of editing instructions and classification information include subjective comments about content in the documents storing the documents and the second set of editing instructions and classification information in a non-transitory computer-readable medium, wherein the second set of editing instructions and classification information facilitate searches for content in the stored documents; receiving a request for information that is associated with a time-varying subjective value identifying information by searching through the stored documents using the second set of editing instructions and the classification information; and providing the information in response to the request, wherein the information includes multiple versions of at least one of the documents, and wherein the multiple versions are, at least in part, based on different editing instructions and classification information in the second set of editing instructions and classification information from different individuals in the group, which includes different identified subjective content, thereby proving different images that reflect the time-varying subjective value. 8. The method of claim 1 , wherein the images include photographs taken at a tradeshow.
| 0.930622 |
9,153,284 | 15 | 16 |
15. A video signal generating and receiving system comprising: a video signal generating apparatus; and a video signal receiving apparatus external to said video signal generating apparatus; wherein said video signal generating apparatus includes a camera configured to generate a video signal, and circuitry configured to operate at least either said camera or said video signal receiving apparatus configured to receive said video signal, the circuitry having a plurality of options, each option corresponding to a different operation to be performed on the video signal receiving apparatus, generate text data in response to selection of an option from the plurality of options on said circuitry, and insert said generated text data into said video signal, said text data inserted into said video signal is representative of a selected operation corresponding to the selected option, said video signal receiving apparatus configured to receive said video signal with said inserted text data, wherein said video signal receiving apparatus includes circuitry configured to receive said video signal into which said text data was inserted, extract said text data from said received video signal, and interpret, as the selected operation to be performed on said video signal receiving apparatus, said extracted text data, and said video signal receiving apparatus automatically performs the selected operation corresponding to the selected option represented in said text data, and wherein the video signal receiving apparatus performs the selected operation at a point in time in the video signal from which the inserted text corresponding to the selected operation was extracted.
|
15. A video signal generating and receiving system comprising: a video signal generating apparatus; and a video signal receiving apparatus external to said video signal generating apparatus; wherein said video signal generating apparatus includes a camera configured to generate a video signal, and circuitry configured to operate at least either said camera or said video signal receiving apparatus configured to receive said video signal, the circuitry having a plurality of options, each option corresponding to a different operation to be performed on the video signal receiving apparatus, generate text data in response to selection of an option from the plurality of options on said circuitry, and insert said generated text data into said video signal, said text data inserted into said video signal is representative of a selected operation corresponding to the selected option, said video signal receiving apparatus configured to receive said video signal with said inserted text data, wherein said video signal receiving apparatus includes circuitry configured to receive said video signal into which said text data was inserted, extract said text data from said received video signal, and interpret, as the selected operation to be performed on said video signal receiving apparatus, said extracted text data, and said video signal receiving apparatus automatically performs the selected operation corresponding to the selected option represented in said text data, and wherein the video signal receiving apparatus performs the selected operation at a point in time in the video signal from which the inserted text corresponding to the selected operation was extracted. 16. The video signal generating and receiving system according to claim 15 , wherein said camera of said video signal generating apparatus generates a serial digital video signal in HD-SDI format, said circuitry of said video signal generating apparatus further configured to generate as said text data a term value which is a type of metadata stipulated by SMPTE, said circuitry of said video signal generating apparatus further configured to insert said term value as ancillary data into a vertical blanking interval of said serial digital video signal in said HD-SDI format, said circuitry of said video signal receiving apparatus further configured to receive said serial digital video signal in said HD-SDI format, and said circuitry of said video signal receiving apparatus further configured to extract said term value as said text data from an ancillary data area in said vertical blanking interval of said serial digital video signal in said HD-SDI format.
| 0.5 |
6,100,825 | 19 | 20 |
19. The invention as set forth in claim 18, wherein: assigning each data set context further comprises using a clustering technique to determine the assignments.
|
19. The invention as set forth in claim 18, wherein: assigning each data set context further comprises using a clustering technique to determine the assignments. 20. The invention as set forth in claim 19, wherein the clustering technique is the Reallocation Method.
| 0.5 |
9,966,112 | 1 | 2 |
1. A method to add a tagged snippet of multimedia content to a playlist based on a number of viewers, the method comprising: searching a fingerprint database to find a match between query fingerprints for a snippet of multimedia content captured from a multimedia program at a timestamp and original fingerprints of matching original multimedia content stored in the fingerprint database that identifies the snippet of multimedia content and the multimedia program; generating a tag representing the snippet of multimedia content, wherein the tag, the timestamp, meta information associated with the matching original multimedia content, and a monitored variable for a number of viewers of the snippet of multimedia content are stored in a database storage as a tagged snippet of multimedia content; and adding the tagged snippet of multimedia content to a playlist for the identified multimedia program if the number of viewers of the tagged snippet exceeds a threshold.
|
1. A method to add a tagged snippet of multimedia content to a playlist based on a number of viewers, the method comprising: searching a fingerprint database to find a match between query fingerprints for a snippet of multimedia content captured from a multimedia program at a timestamp and original fingerprints of matching original multimedia content stored in the fingerprint database that identifies the snippet of multimedia content and the multimedia program; generating a tag representing the snippet of multimedia content, wherein the tag, the timestamp, meta information associated with the matching original multimedia content, and a monitored variable for a number of viewers of the snippet of multimedia content are stored in a database storage as a tagged snippet of multimedia content; and adding the tagged snippet of multimedia content to a playlist for the identified multimedia program if the number of viewers of the tagged snippet exceeds a threshold. 2. The method of claim 1 further comprising: generating additional query fingerprints to improve identification of the captured snippet of multimedia content; and supplying the generated additional query fingerprints to be stored with the tag.
| 0.782258 |
8,494,273 | 13 | 14 |
13. A computer program product stored on a non-transitory tangible computer readable storage medium for performing adaptive optical character recognition on a document with distorted characters, the computer program including code for: providing a group of images of candidate characters; receiving a document in an image format; segmenting the document so as to provide a sub-image of a segmented character; and for one or more of the candidate characters: performing a distortion-correction transformation on the segmented character, so as to modify the segmented character in the sub-image into a transformed character more closely resembling the candidate character; comparing the transformed segmented character to the candidate character so as to calculate a comparison score; analyzing the distortion-correction transformation so as to assign the transformation a distortion score; and determining whether to identify the segmented character with the candidate character, responsively to both the comparison score and the distortion score.
|
13. A computer program product stored on a non-transitory tangible computer readable storage medium for performing adaptive optical character recognition on a document with distorted characters, the computer program including code for: providing a group of images of candidate characters; receiving a document in an image format; segmenting the document so as to provide a sub-image of a segmented character; and for one or more of the candidate characters: performing a distortion-correction transformation on the segmented character, so as to modify the segmented character in the sub-image into a transformed character more closely resembling the candidate character; comparing the transformed segmented character to the candidate character so as to calculate a comparison score; analyzing the distortion-correction transformation so as to assign the transformation a distortion score; and determining whether to identify the segmented character with the candidate character, responsively to both the comparison score and the distortion score. 14. A computer program product as claimed in claim 13 , wherein the transformation comprises a vector field that describes a change in shape between the segmented character and the candidate character and the distortion score a divergence of the vector field.
| 0.5 |
10,101,752 | 8 | 15 |
8. A hydrocarbon extractor evaluator system comprising: a central controller in communication with other components of the hydrocarbon extractor evaluator system across a communication bus; a data store operably coupled to the communication bus; a hydrocarbon extractor evaluator model coupled to the communication bus; the hydrocarbon extractor evaluator model including: a hierarchical equipment model of classes representing hydrocarbon extractor type, subtype, and property of heterogeneous hydrocarbon extractor types; a rule library having a plurality of rules arrangeable as a hierarchical equipment rule set, and arrangeable as a hierarchical well feature rule set; the hierarchical equipment rule set arranged by hydrocarbon extractor type, subtype, and property classes; the hierarchical well feature rule set arranged by a plurality of well feature categories; a rules engine operable on rules; the hierarchical well feature rule set in a format that facilitates a multi-factor comparison by the rules engine, the comparison made between data of heterogeneous hydrocarbon extractor types from disparate sources applied to the hierarchical equipment model; the central controller configured to perform operations included in executable instructions stored in the data store, the operations including: consolidate data of the heterogeneous hydrocarbon extractor types from disparate sources into the hierarchical equipment model; receive a query; extract at least a portion of the hierarchical equipment model relevant to the query; apply at least a portion of the plurality of rules in the rules engine using class structure and one or more categories to the extracted portion of the hierarchical equipment model to generate results; the results displayable to a user as at least one of a table and a graphical visualization; and wherein the user can select from the results to determine a hydrocarbon extractor type suitable for a particular well.
|
8. A hydrocarbon extractor evaluator system comprising: a central controller in communication with other components of the hydrocarbon extractor evaluator system across a communication bus; a data store operably coupled to the communication bus; a hydrocarbon extractor evaluator model coupled to the communication bus; the hydrocarbon extractor evaluator model including: a hierarchical equipment model of classes representing hydrocarbon extractor type, subtype, and property of heterogeneous hydrocarbon extractor types; a rule library having a plurality of rules arrangeable as a hierarchical equipment rule set, and arrangeable as a hierarchical well feature rule set; the hierarchical equipment rule set arranged by hydrocarbon extractor type, subtype, and property classes; the hierarchical well feature rule set arranged by a plurality of well feature categories; a rules engine operable on rules; the hierarchical well feature rule set in a format that facilitates a multi-factor comparison by the rules engine, the comparison made between data of heterogeneous hydrocarbon extractor types from disparate sources applied to the hierarchical equipment model; the central controller configured to perform operations included in executable instructions stored in the data store, the operations including: consolidate data of the heterogeneous hydrocarbon extractor types from disparate sources into the hierarchical equipment model; receive a query; extract at least a portion of the hierarchical equipment model relevant to the query; apply at least a portion of the plurality of rules in the rules engine using class structure and one or more categories to the extracted portion of the hierarchical equipment model to generate results; the results displayable to a user as at least one of a table and a graphical visualization; and wherein the user can select from the results to determine a hydrocarbon extractor type suitable for a particular well. 15. The hydrocarbon extractor evaluator system of claim 8 , including: the hierarchical well feature rule set partitioned into a first group, a second group, and a third group; the first group applied by the rules engine to determine a disallowance of a hydrocarbon extractor type; the second group applied by the rules engine to determine one or more warnings regarding a hydrocarbon extractor type; and the third group applied by the rules engine to determine at least one of the table and the graphical visualization.
| 0.5 |
8,441,454 | 11 | 12 |
11. The system of claim 1 , wherein the selection component identifies a highest ranked candidate object and presents the identified object on the output device.
|
11. The system of claim 1 , wherein the selection component identifies a highest ranked candidate object and presents the identified object on the output device. 12. The system of claim 11 , wherein the selection component presents the identified object on the output device at or near the current interaction location.
| 0.750794 |
9,471,569 | 15 | 18 |
15. A computer-implemented method comprising: identifying, in at least one computing device, parameter metadata associated with constructing one of a plurality of tailored documents from a first general document; obtaining, in the at least one computing device, a plurality of supplied values associated with the parameter metadata; identifying, in the at least one computing device, a plurality of values that may be retrieved, the plurality of values being identified based at least in part on the parameter metadata, the plurality of supplied values, and at least one data store; obtaining, in the at least one computing device, a plurality of retrieved values associated with the parameter metadata; constructing, in the at least one computing device, the one of the plurality of tailored documents from the first general document, at least one portion of a second general document, the plurality of supplied values, and the plurality of retrieved values, wherein the plurality of supplied values and the plurality of retrieved values supplant at least a portion of a plurality of parameter labels within a body of the first general document and the second general document; determining, in the at least one computing device, a positive degree of correlation between a subset of the plurality of tailored documents, wherein the subset of the plurality of tailored documents includes multiple tailored documents and the positive degree of correlation indicates that the subset of the plurality of tailored documents are positively correlated by recognizing similarities within the plurality of tailored documents; recognizing, in the at least one computing device, at least one symptom of a systemic event collectively reported within the subset of the plurality of tailored documents that are positively correlated; identifying, in the at least one computing device, a response to the at least one symptom of the systemic event; and implementing the response as part of the subset of the plurality of tailored documents.
|
15. A computer-implemented method comprising: identifying, in at least one computing device, parameter metadata associated with constructing one of a plurality of tailored documents from a first general document; obtaining, in the at least one computing device, a plurality of supplied values associated with the parameter metadata; identifying, in the at least one computing device, a plurality of values that may be retrieved, the plurality of values being identified based at least in part on the parameter metadata, the plurality of supplied values, and at least one data store; obtaining, in the at least one computing device, a plurality of retrieved values associated with the parameter metadata; constructing, in the at least one computing device, the one of the plurality of tailored documents from the first general document, at least one portion of a second general document, the plurality of supplied values, and the plurality of retrieved values, wherein the plurality of supplied values and the plurality of retrieved values supplant at least a portion of a plurality of parameter labels within a body of the first general document and the second general document; determining, in the at least one computing device, a positive degree of correlation between a subset of the plurality of tailored documents, wherein the subset of the plurality of tailored documents includes multiple tailored documents and the positive degree of correlation indicates that the subset of the plurality of tailored documents are positively correlated by recognizing similarities within the plurality of tailored documents; recognizing, in the at least one computing device, at least one symptom of a systemic event collectively reported within the subset of the plurality of tailored documents that are positively correlated; identifying, in the at least one computing device, a response to the at least one symptom of the systemic event; and implementing the response as part of the subset of the plurality of tailored documents. 18. The computer-implemented method of claim 15 , further comprising storing, in the at least one computing device, the one of the plurality of tailored documents in a memory associated with the at least one computing device.
| 0.643987 |
8,965,876 | 10 | 11 |
10. A system having at least one processor, storage, and a communication platform connected to a network for generating searchable feeds for websites, the system comprising: a user interface module configured to display at least one page of a website via a designated window; a content retrieval engine configured to receive, via the designated window, an indication of content of interest of the website, retrieve a plurality of pages from the website, identify the indicated content of interest from the retrieved pages, and generate structured content comprising the indicated content of interest identified from the retrieved pages; an indexing engine configured to generate an index for the structured content; and a query interface configured to receive a query from an entity, wherein the query includes at least one query term and a feed identifier associated with the index, and query, based on the feed identifier, the index with the at least one query term to receive a response to the query.
|
10. A system having at least one processor, storage, and a communication platform connected to a network for generating searchable feeds for websites, the system comprising: a user interface module configured to display at least one page of a website via a designated window; a content retrieval engine configured to receive, via the designated window, an indication of content of interest of the website, retrieve a plurality of pages from the website, identify the indicated content of interest from the retrieved pages, and generate structured content comprising the indicated content of interest identified from the retrieved pages; an indexing engine configured to generate an index for the structured content; and a query interface configured to receive a query from an entity, wherein the query includes at least one query term and a feed identifier associated with the index, and query, based on the feed identifier, the index with the at least one query term to receive a response to the query. 11. The system of claim 10 , wherein the user interface module is configured to generate a user interface that enables a user to mark the at least one page of the website to indicate the content of interest.
| 0.784375 |
9,710,843 | 1 | 12 |
1. A computer-based recommendation system for generating recommendations of unique items, the recommendation system comprising: one or more computer readable storage devices configured to store: a plurality of computer executable instructions; an items information database containing data relating to a plurality of unique items; one or more hardware computer processors in communication with the one or more computer readable storage devices and configured to execute the plurality of computer executable instructions in order to cause the computer system to: receive an input from a user that comprises user-expressed preferences associated with the plurality of unique items; calculate a customization score for each unique item in the plurality of unique items, the customization score at least partially based on at least one customization attribute associated with that unique item; calculate a condition score for each unique item in the plurality of unique items, the condition score at least partially based on at least one condition attribute associated with that unique item; generate a dissimilarity penalty for each unique item in the plurality of unique items by combining the customization score and the condition score for that unique item, the dissimilarity penalty at least partially generated based on a magnitude of dissimilarity between the unique item and the user-expressed preferences; and generate a recommendation of unique items by ranking at least a portion of the plurality of the unique items based at least partially on the calculated dissimilarity penalties.
|
1. A computer-based recommendation system for generating recommendations of unique items, the recommendation system comprising: one or more computer readable storage devices configured to store: a plurality of computer executable instructions; an items information database containing data relating to a plurality of unique items; one or more hardware computer processors in communication with the one or more computer readable storage devices and configured to execute the plurality of computer executable instructions in order to cause the computer system to: receive an input from a user that comprises user-expressed preferences associated with the plurality of unique items; calculate a customization score for each unique item in the plurality of unique items, the customization score at least partially based on at least one customization attribute associated with that unique item; calculate a condition score for each unique item in the plurality of unique items, the condition score at least partially based on at least one condition attribute associated with that unique item; generate a dissimilarity penalty for each unique item in the plurality of unique items by combining the customization score and the condition score for that unique item, the dissimilarity penalty at least partially generated based on a magnitude of dissimilarity between the unique item and the user-expressed preferences; and generate a recommendation of unique items by ranking at least a portion of the plurality of the unique items based at least partially on the calculated dissimilarity penalties. 12. The computer-based recommendation system of claim 1 , wherein the items information database is configured to store data relating to at least 1,000 unique items.
| 0.876497 |
9,214,156 | 8 | 9 |
8. The method according to claim 1 further comprising: upon determining that the user-input data is indicative of the refinement request by the user, filtering a list of data items based on the generic semantic representation; and returning an indication of the result of filtering the list of the data items in the multi-facet output data.
|
8. The method according to claim 1 further comprising: upon determining that the user-input data is indicative of the refinement request by the user, filtering a list of data items based on the generic semantic representation; and returning an indication of the result of filtering the list of the data items in the multi-facet output data. 9. The method according to claim 8 , wherein the list of data items represents search results received from a backend system and said filtering is further based on at least one of the maintained state of the dialogue, general knowledge data representing one or more concepts, and data representing the history of the dialogue.
| 0.5 |
9,311,282 | 1 | 3 |
1. A method for enriching contents of a current website, the method comprising: obtaining a corpus from the current website and other websites, and extracting object features from the corpus, wherein the corpus comprises specifications of the object and user reviews about the object; according to the corpus, constructing multi-dimensional vectors for the extracted features; for a specific feature, making similarity comparison of its multi-dimensional vector and multi-dimensional vectors of other extracted features; and determining features with similarities being higher than a predetermined threshold as a same feature, and reinforcing the current website with at least one feature which is different from those on the website and corresponding attributes of the at least one feature; wherein for a specific feature, comparing the similarity of its multi-dimensional vectors and multi-dimensional vectors of other extracted features comprises: aligning dimensions of multi-dimensional vectors of all extracted features, wherein for a specific feature, dimensions of multi-dimensional vectors of other features are treated as dimensions of the specific feature, so that each feature has the same number of dimensions; calculating mutual information between the specific feature in the corpus and each dimension of its multi-dimensional vectors as a weight of each dimension; and calculating similarities between multi-dimensional vectors of various features according to the weights, wherein similarities between multi-dimensional vectors of various features are calculated based on Euclidean distance between the multi-dimensional vectors.
|
1. A method for enriching contents of a current website, the method comprising: obtaining a corpus from the current website and other websites, and extracting object features from the corpus, wherein the corpus comprises specifications of the object and user reviews about the object; according to the corpus, constructing multi-dimensional vectors for the extracted features; for a specific feature, making similarity comparison of its multi-dimensional vector and multi-dimensional vectors of other extracted features; and determining features with similarities being higher than a predetermined threshold as a same feature, and reinforcing the current website with at least one feature which is different from those on the website and corresponding attributes of the at least one feature; wherein for a specific feature, comparing the similarity of its multi-dimensional vectors and multi-dimensional vectors of other extracted features comprises: aligning dimensions of multi-dimensional vectors of all extracted features, wherein for a specific feature, dimensions of multi-dimensional vectors of other features are treated as dimensions of the specific feature, so that each feature has the same number of dimensions; calculating mutual information between the specific feature in the corpus and each dimension of its multi-dimensional vectors as a weight of each dimension; and calculating similarities between multi-dimensional vectors of various features according to the weights, wherein similarities between multi-dimensional vectors of various features are calculated based on Euclidean distance between the multi-dimensional vectors. 3. The method according to claim 1 , wherein extracting the object features from the corpus comprises: extracting at least one feature seed from the specifications about the object on the current website and other websites, wherein the at least one feature seed is extracted from corresponding fields according to the layouts of the specifications about the object of the current website and other websites; and based on the extracted feature seed, extracting additional features from the user reviews about the object.
| 0.752622 |
8,804,178 | 1 | 16 |
1. A method for routing a confirmation of receipt of a facsimile or portion thereof, comprising: analyzing text of a facsimile for at least one of a meaning and a context of the text; recognizing one or more global document features of the facsimile based at least in part on the analysis; comparing at least one recognized global document feature in the facsimile to a plurality of known document types; routing one or more confirmations to one or more destinations based at least in part on the analysis and the comparison; and determining a type of information contained within each physical area of significance and each logical area of significance; wherein the global document features comprise physical areas of significance and logical areas of significance, and wherein the determining does not utilize any OCR techniques.
|
1. A method for routing a confirmation of receipt of a facsimile or portion thereof, comprising: analyzing text of a facsimile for at least one of a meaning and a context of the text; recognizing one or more global document features of the facsimile based at least in part on the analysis; comparing at least one recognized global document feature in the facsimile to a plurality of known document types; routing one or more confirmations to one or more destinations based at least in part on the analysis and the comparison; and determining a type of information contained within each physical area of significance and each logical area of significance; wherein the global document features comprise physical areas of significance and logical areas of significance, and wherein the determining does not utilize any OCR techniques. 16. A method as recited in claim 1 , wherein the each of the known document types corresponds to one of a plurality of document classes, at least one document class further comprising a plurality of document sub-classes.
| 0.713542 |
8,086,619 | 36 | 37 |
36. A method, performed by one or more server devices, the method comprising: creating, by one or more processors of the one or more server devices, a query source reference, including: identifying, by one or more processors of the one or more server devices, associations between issued search queries and retrieved search documents in a one-to-one relation, and assigning, by one or more processors of the one or more server devices, a weight to each of the associations; receiving, by one or more processors of the one or more server devices, a search query; forming, by one or more processors of the one or more server devices, a plurality of clusters based on the query source reference; selecting, by one or more processors of the one or more server devices, at least one of the plurality of clusters; computing, by one or more processors of the one or more server devices, a centroid for each of the selected at least one of the plurality of clusters; computing, by one or more processors of the one or more server devices, a score for each unique issued search query associated with a document in the selected at least one of a plurality of clusters based on the computed centroid; formulating, by one or more processors of the one or more server devices, a refinement suggestion for the received search query based on the computed scores; and sorting, by one or more processors of the one or more server devices, the formulated search query refinement suggestion among a group of search query refinement suggestions.
|
36. A method, performed by one or more server devices, the method comprising: creating, by one or more processors of the one or more server devices, a query source reference, including: identifying, by one or more processors of the one or more server devices, associations between issued search queries and retrieved search documents in a one-to-one relation, and assigning, by one or more processors of the one or more server devices, a weight to each of the associations; receiving, by one or more processors of the one or more server devices, a search query; forming, by one or more processors of the one or more server devices, a plurality of clusters based on the query source reference; selecting, by one or more processors of the one or more server devices, at least one of the plurality of clusters; computing, by one or more processors of the one or more server devices, a centroid for each of the selected at least one of the plurality of clusters; computing, by one or more processors of the one or more server devices, a score for each unique issued search query associated with a document in the selected at least one of a plurality of clusters based on the computed centroid; formulating, by one or more processors of the one or more server devices, a refinement suggestion for the received search query based on the computed scores; and sorting, by one or more processors of the one or more server devices, the formulated search query refinement suggestion among a group of search query refinement suggestions. 37. The method of claim 36 , further comprising: obtaining at least one search result document using the received search query, where the formulating the search query refinement suggestion further comprises: comparing the at least one search result document to the retrieved search documents, identifying the retrieved search documents that match the at least one search result document, and using the issued search queries associated with the identified search documents in the formulating.
| 0.5 |
7,761,475 | 1 | 3 |
1. In an information technology system having an OODBMS, a method for managing dynamic object associations of a parent software object as an array of object references, the method comprising: a. generating a key pair listing, each listing containing at least one key pair, each key pair including an object relationship identifier and an OID; b. associating the key pair listing with the parent software object; c. maintaining a history of OODBMS interaction with the key pair listing; and d. organizing the access order of the key pairs to cause the key pairs more frequently satisfying OODBMS queries to be examined earlier in the execution of a query than key pairs that have less frequently satisfied OODBMS queries.
|
1. In an information technology system having an OODBMS, a method for managing dynamic object associations of a parent software object as an array of object references, the method comprising: a. generating a key pair listing, each listing containing at least one key pair, each key pair including an object relationship identifier and an OID; b. associating the key pair listing with the parent software object; c. maintaining a history of OODBMS interaction with the key pair listing; and d. organizing the access order of the key pairs to cause the key pairs more frequently satisfying OODBMS queries to be examined earlier in the execution of a query than key pairs that have less frequently satisfied OODBMS queries. 3. The method of claim 1 , wherein the history of OODBMS interaction with the key pair listing is stored within the parent object.
| 0.575163 |
7,917,847 | 51 | 58 |
51. The terminal device according to claim 49 , wherein the controller further performs a function of judging whether or not predetermined user operation is performed, wherein the predetermined user operation includes operation for canceling the switching of the onscreen representation, and wherein the switching of the onscreen representation is cancelled if it is judged by the judging that the predetermined user operation is performed, and the switching of the onscreen representation is performed if it is judged by the judging that the predetermined user operation is not performed.
|
51. The terminal device according to claim 49 , wherein the controller further performs a function of judging whether or not predetermined user operation is performed, wherein the predetermined user operation includes operation for canceling the switching of the onscreen representation, and wherein the switching of the onscreen representation is cancelled if it is judged by the judging that the predetermined user operation is performed, and the switching of the onscreen representation is performed if it is judged by the judging that the predetermined user operation is not performed. 58. The terminal device according to claim 51 , wherein the operation for canceling the switching of the onscreen representation includes at least one of scrolling operation, storing operation and printing operation.
| 0.878788 |
8,447,604 | 1 | 6 |
1. A method, comprising: receiving, using a computing device, script data comprising ordered script words of a script, wherein the ordered script words are indicative of speakable dialogue words; receiving audio data corresponding to at least a portion of the dialogue words, wherein the audio data includes timecodes associated with dialogue words; generating a matrix of the ordered script words versus the dialogue words; performing an alignment of the matrix to determine hard alignment points, including matching consecutive sequences of ordered script words with corresponding sequences of dialogue words; partitioning the matrix of ordered script words into sub-matrices, wherein the bounds of each of the sub-matrices are defined by adjacent hard-alignment points, and wherein each of the sub-matrices includes a sub-set of the ordered script words and a corresponding sub-set of dialogue words that occur between respective hard-alignment points; performing an alignment of each of the sub-matrices, including: matching ordered script words of the sub-set of ordered script words of a respective sub-matrix with dialogue words of the sub-set of dialogue words of the respective sub-matrix; assigning, to the matched ordered script words, timecodes associated with corresponding matching dialogue words; and determining timecodes for the unmatched ordered script words of sub-set of ordered script words of the sub-matrix using interpolation based on the timecodes associated with the matching ordered script words; and generating time-aligned script data comprising the ordered script words of the script and their corresponding timecodes.
|
1. A method, comprising: receiving, using a computing device, script data comprising ordered script words of a script, wherein the ordered script words are indicative of speakable dialogue words; receiving audio data corresponding to at least a portion of the dialogue words, wherein the audio data includes timecodes associated with dialogue words; generating a matrix of the ordered script words versus the dialogue words; performing an alignment of the matrix to determine hard alignment points, including matching consecutive sequences of ordered script words with corresponding sequences of dialogue words; partitioning the matrix of ordered script words into sub-matrices, wherein the bounds of each of the sub-matrices are defined by adjacent hard-alignment points, and wherein each of the sub-matrices includes a sub-set of the ordered script words and a corresponding sub-set of dialogue words that occur between respective hard-alignment points; performing an alignment of each of the sub-matrices, including: matching ordered script words of the sub-set of ordered script words of a respective sub-matrix with dialogue words of the sub-set of dialogue words of the respective sub-matrix; assigning, to the matched ordered script words, timecodes associated with corresponding matching dialogue words; and determining timecodes for the unmatched ordered script words of sub-set of ordered script words of the sub-matrix using interpolation based on the timecodes associated with the matching ordered script words; and generating time-aligned script data comprising the ordered script words of the script and their corresponding timecodes. 6. The method of claim 1 , wherein performing an alignment of each of the sub-matrices is performed in parallel, such that multiple sub-matrices are processed simultaneously.
| 0.831721 |
7,584,120 | 20 | 23 |
20. An apparatus for extracting information of interest from at least one web site of a plurality of web sites, the apparatus comprising: (A) for each respective web site W in the plurality of web sites, (i) means for creating a respective description of data of interest that identifies the web site W; (ii) means for developing an extraction pattern from a web page output from the respective web site W using a graphical user interface tool, the extraction pattern being adapted to extract data from a plurality of web pages of the web site, wherein the extraction pattern comprises a regular expression; and (iii) means for associating the developed extraction pattern with the respective description of data of interest for the respective web site W; (B) means for receiving a value for use as an extraction parameter in the developed extraction patterns; and (C) means for obtaining said data of interest by querying the at least one web site of the plurality of web sites using the value and the developed extraction patterns associated with the respective descriptions of data of interest; and (D) means for extracting said data of interest from the at least one web site of the plurality of web sites and storing said extracted data of interest.
|
20. An apparatus for extracting information of interest from at least one web site of a plurality of web sites, the apparatus comprising: (A) for each respective web site W in the plurality of web sites, (i) means for creating a respective description of data of interest that identifies the web site W; (ii) means for developing an extraction pattern from a web page output from the respective web site W using a graphical user interface tool, the extraction pattern being adapted to extract data from a plurality of web pages of the web site, wherein the extraction pattern comprises a regular expression; and (iii) means for associating the developed extraction pattern with the respective description of data of interest for the respective web site W; (B) means for receiving a value for use as an extraction parameter in the developed extraction patterns; and (C) means for obtaining said data of interest by querying the at least one web site of the plurality of web sites using the value and the developed extraction patterns associated with the respective descriptions of data of interest; and (D) means for extracting said data of interest from the at least one web site of the plurality of web sites and storing said extracted data of interest. 23. The apparatus of claim 20 wherein the data of interest is information associated with a product or information associated with a service.
| 0.675115 |
10,120,952 | 9 | 11 |
9. A method for specifying an application stored in a storage unit, the method comprising: providing an application definition language that has an XML schema definition that defines computational and data access aspects of an application, the application hosting a web presence on a computing device, the XML schema definition of the application definition language provides a consistent definition of the computational and data access aspects of an application used to develop a new web application running on a third party system; providing one or more cells with each cell having one or more components wherein each component defines the computational and data access aspects of an application and one or more presentations wherein each presentation defines a user interface for a particular application, each cell further comprising one or more lines of XML code, each component further comprising one or more lines of XML code, each web presence further comprising one or more lines of XML code, each component further comprises a widget that comprises one or more lines of XML code and component further comprises an action item that comprises one or more lines of XML code; providing a web presence for performing one or more applications is instantiated from a cell instance that has one or more components, one or more presentations and content associated with the cell instance, the one or more applications of the web presence are defined by the application definition language and one or more components of the cell instance and the user interface of the one or more applications are defined by the one or more presentations of the cell instance wherein the one or more applications are configured to operate on the content associated with the cell instance; and wherein the web presence is one of a web site, one or more web pages and a web service.
|
9. A method for specifying an application stored in a storage unit, the method comprising: providing an application definition language that has an XML schema definition that defines computational and data access aspects of an application, the application hosting a web presence on a computing device, the XML schema definition of the application definition language provides a consistent definition of the computational and data access aspects of an application used to develop a new web application running on a third party system; providing one or more cells with each cell having one or more components wherein each component defines the computational and data access aspects of an application and one or more presentations wherein each presentation defines a user interface for a particular application, each cell further comprising one or more lines of XML code, each component further comprising one or more lines of XML code, each web presence further comprising one or more lines of XML code, each component further comprises a widget that comprises one or more lines of XML code and component further comprises an action item that comprises one or more lines of XML code; providing a web presence for performing one or more applications is instantiated from a cell instance that has one or more components, one or more presentations and content associated with the cell instance, the one or more applications of the web presence are defined by the application definition language and one or more components of the cell instance and the user interface of the one or more applications are defined by the one or more presentations of the cell instance wherein the one or more applications are configured to operate on the content associated with the cell instance; and wherein the web presence is one of a web site, one or more web pages and a web service. 11. The method of claim 9 , wherein each object is based on an abstract base type object having one or more general characteristics elements of an object and one or more semantic property elements, and a plurality of base components, each base component being a child of the abstract base type object and inheriting the one or more general characteristics, each base component being a container item kind that describes a type of object and encapsulates the particular type of object wherein each type of object associated with the system is represented by the abstract base type object and one of the base components.
| 0.5 |
9,679,496 | 4 | 5 |
4. The method of claim 1 , further comprising: highlighting at least one of the cloud words in the word cloud or dropping at least one of the cloud words from the word cloud; and speaking, by the learner, at least one sentence containing the highlighted or dropped cloud word into the audio input; deriving a sentence sound image from the sentence spoken into the audio input containing the at least one highlighted or dropped cloud word; determining a number of words contained in the sentence sound image; determining a speech time of the sentence sound image; and dividing the number of words by the speech time to determine fluency as a speech rate in words per minute.
|
4. The method of claim 1 , further comprising: highlighting at least one of the cloud words in the word cloud or dropping at least one of the cloud words from the word cloud; and speaking, by the learner, at least one sentence containing the highlighted or dropped cloud word into the audio input; deriving a sentence sound image from the sentence spoken into the audio input containing the at least one highlighted or dropped cloud word; determining a number of words contained in the sentence sound image; determining a speech time of the sentence sound image; and dividing the number of words by the speech time to determine fluency as a speech rate in words per minute. 5. The method of claim 4 , further comprising: repeating at least once: highlighting an additional cloud word in the word cloud or dropping an additional cloud word from the word cloud; instructing the learner to speak at least one additional sentence containing the highlighted or dropped additional cloud word into the audio input; deriving an additional sentence sound image from the additional sentence spoken into the audio input containing the highlighted or dropped additional cloud word; determining a number of words contained in the additional sentence sound image; determining a speech time of the additional sentence sound image; and dividing the number of words in the additional sentence sound image by the speech time of the additional sentence sound image to determine fluency as a speech rate of the additional sentence sound image in words per minute; averaging the speech rates of the sentence sound image and all the additional sentence sound images to determine a fluency score; and displaying the fluency score on the display to provide feedback to the learner.
| 0.5 |
9,110,984 | 18 | 19 |
18. The computer-implemented method of claim 16 , further comprising generating a second aggregate data file for each cluster within the second level of the hierarchy of clusters.
|
18. The computer-implemented method of claim 16 , further comprising generating a second aggregate data file for each cluster within the second level of the hierarchy of clusters. 19. The computer-implemented method of claim 18 , further comprising generating a third level of the hierarchy of clusters.
| 0.5 |
9,720,899 | 30 | 31 |
30. The method of claim 15 , wherein the defined and selected communication goal data structure is the explain status communication goal data structure, and wherein the narrative analytics models for the content block data structures associated therewith specify data and algorithms for describing a value for the driver over the time frame and for explaining how the driver affected the subject metric over the time frame.
|
30. The method of claim 15 , wherein the defined and selected communication goal data structure is the explain status communication goal data structure, and wherein the narrative analytics models for the content block data structures associated therewith specify data and algorithms for describing a value for the driver over the time frame and for explaining how the driver affected the subject metric over the time frame. 31. The method of claim 30 wherein the driver is a component driver.
| 0.84186 |
8,832,200 | 8 | 9 |
8. A computer program product for processing external events in a persistent human-to-human conservational space, the computer program product comprising: a machine readable storage device having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for persisting a human-to-human conversational space; computer readable program code for posting turns in said persistent human-to-human conversational space; computer readable program code for receiving different notifications of external events, the different notifications of external events indicate events occurring externally to said persistent human-to-human conversational space, the external events including a creation of a timestamp for a file, a creation of a timestamp for a different human-to-human conversational space, a creation of meta-data for a file, a creation of meta-data for a message, and a creation of meta-data for a different human-to-human conversational space; computer readable program code for converting said notifications of external events into respectively different textual descriptions of the different notifications of external events responsive to receiving said notifications of external events; and, computer readable program code for further posting the converted different textual descriptions of the different notifications of external events in said persistent human-to-human conversational space.
|
8. A computer program product for processing external events in a persistent human-to-human conservational space, the computer program product comprising: a machine readable storage device having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for persisting a human-to-human conversational space; computer readable program code for posting turns in said persistent human-to-human conversational space; computer readable program code for receiving different notifications of external events, the different notifications of external events indicate events occurring externally to said persistent human-to-human conversational space, the external events including a creation of a timestamp for a file, a creation of a timestamp for a different human-to-human conversational space, a creation of meta-data for a file, a creation of meta-data for a message, and a creation of meta-data for a different human-to-human conversational space; computer readable program code for converting said notifications of external events into respectively different textual descriptions of the different notifications of external events responsive to receiving said notifications of external events; and, computer readable program code for further posting the converted different textual descriptions of the different notifications of external events in said persistent human-to-human conversational space. 9. The computer program product of claim 8 , wherein the computer readable program code further comprises: computer readable program code for persisting additional human-to- human conversational spaces; and, computer readable program code for performing query operations against said human-to-human conversational space and said additional human-to-human conversational spaces.
| 0.5 |
8,781,830 | 1 | 4 |
1. A method for differential dynamic content delivery, the method comprising: providing to a multiplicity of users a presentation including content from a session document; streaming presentation speech to the user including individual speech from at least one user participating in the presentation; converting the presentation speech to text; detecting whether the presentation speech contains simultaneous individual speech from two or more users; and displaying the text if the presentation speech contains simultaneous individual speech from two or more users.
|
1. A method for differential dynamic content delivery, the method comprising: providing to a multiplicity of users a presentation including content from a session document; streaming presentation speech to the user including individual speech from at least one user participating in the presentation; converting the presentation speech to text; detecting whether the presentation speech contains simultaneous individual speech from two or more users; and displaying the text if the presentation speech contains simultaneous individual speech from two or more users. 4. The method of claim 1 wherein displaying the text further comprises segregating display text.
| 0.905697 |
9,715,325 | 15 | 16 |
15. The system of claim 1 , wherein the text-based tag identifies the object associated with the desired application action.
|
15. The system of claim 1 , wherein the text-based tag identifies the object associated with the desired application action. 16. The system of claim 15 , wherein the object comprises a document stored in a storage repository.
| 0.5 |
8,244,720 | 10 | 11 |
10. A method performed by one or more server devices, the method comprising: receiving, by a blog search engine of the one or more server devices, a search query; identifying, by the blog search engine of the one or more server devices, a blog document that is responsive to the search query; generating, by the blog search engine of the one or more server devices, a relevance score for the blog document, the relevance score being based on a relevance of the blog document to the search query; generating, by the blog search engine of the one or more server devices, a quality score for the blog document, the quality score based on quality of the blog document independent of the search query, where the quality score is based on a plurality of indicators that include at least one of one or more positive indicators or one or more negative indicators, where the one or more positive indicators include an indication that the blog document is referenced in a blogroll; where the one or more negative indicators include a location of ads in the blog document; generating, by the blog search engine of the one or more server devices, a ranking score based on the relevance score and the quality score; and providing, by the blog search engine of the one or more server devices, information regarding the blog document based on the ranking score.
|
10. A method performed by one or more server devices, the method comprising: receiving, by a blog search engine of the one or more server devices, a search query; identifying, by the blog search engine of the one or more server devices, a blog document that is responsive to the search query; generating, by the blog search engine of the one or more server devices, a relevance score for the blog document, the relevance score being based on a relevance of the blog document to the search query; generating, by the blog search engine of the one or more server devices, a quality score for the blog document, the quality score based on quality of the blog document independent of the search query, where the quality score is based on a plurality of indicators that include at least one of one or more positive indicators or one or more negative indicators, where the one or more positive indicators include an indication that the blog document is referenced in a blogroll; where the one or more negative indicators include a location of ads in the blog document; generating, by the blog search engine of the one or more server devices, a ranking score based on the relevance score and the quality score; and providing, by the blog search engine of the one or more server devices, information regarding the blog document based on the ranking score. 11. The method of claim 10 , where the one or more positive indicators include an existence of a link to the blog document in one or more blogrolls associated with other blog documents.
| 0.5 |
8,583,574 | 10 | 13 |
10. A user authentication method for use in controlling user access to a data information system having an input, that comprises, inputting at such input the owner's log-in name and password; extracting the owner's timing vectors from biometric inputting characteristics with which the owner repeatedly inputs the owner's password to form a training set; setting up a semantic network using multiple links to indicate that different pattern components of a user's behavioral access to the input create different kinds of symbolic representations rather than just simple connections or links; setting up neural network training by using each of the owner's timing vectors in the training set as the input thereto; checking if the user's password is identical to the owner's password when a user thereafter inputs the owner's log-in name and password; extracting the user's timing vector from said user's inputting characteristics to derive the user's password if user-checking is affirmative; otherwise, demoting the user in confidence level for accessing the system; applying the user's timing vector to the training neural network as an input; comparing the difference between such input and an output of the neural network with a predetermined threshold; and permitting user access to the system if the difference is not greater than such threshold, while demoting the confidence level or totally prohibiting access to the system, if otherwise; and wherein artificial intelligence (AI) architecture features are added to the system wherein highly personal questions are asked of the user that only the owner of the password and ID would be able to answer instantaneously, as distinguished from another user other than the owner who would require a finite response time to commence a response; establishing access authorization confidence levels in accordance with such response times; measuring the time for the user to commence responding to such personal questions; and assigning a level of confidence for access in accordance with such measured response times.
|
10. A user authentication method for use in controlling user access to a data information system having an input, that comprises, inputting at such input the owner's log-in name and password; extracting the owner's timing vectors from biometric inputting characteristics with which the owner repeatedly inputs the owner's password to form a training set; setting up a semantic network using multiple links to indicate that different pattern components of a user's behavioral access to the input create different kinds of symbolic representations rather than just simple connections or links; setting up neural network training by using each of the owner's timing vectors in the training set as the input thereto; checking if the user's password is identical to the owner's password when a user thereafter inputs the owner's log-in name and password; extracting the user's timing vector from said user's inputting characteristics to derive the user's password if user-checking is affirmative; otherwise, demoting the user in confidence level for accessing the system; applying the user's timing vector to the training neural network as an input; comparing the difference between such input and an output of the neural network with a predetermined threshold; and permitting user access to the system if the difference is not greater than such threshold, while demoting the confidence level or totally prohibiting access to the system, if otherwise; and wherein artificial intelligence (AI) architecture features are added to the system wherein highly personal questions are asked of the user that only the owner of the password and ID would be able to answer instantaneously, as distinguished from another user other than the owner who would require a finite response time to commence a response; establishing access authorization confidence levels in accordance with such response times; measuring the time for the user to commence responding to such personal questions; and assigning a level of confidence for access in accordance with such measured response times. 13. The method claim 10 , wherein once said system access has been given to the user, the activity of the user in the system is continually monitored to adjust the confidence level in security as determined by subsequent behavior of the user in the system.
| 0.5 |
8,244,750 | 1 | 2 |
1. A computer-implemented method for providing search results, the method comprising: receiving search input from an end user via an input box configured to receive input for a search engine; determining if the search input comprises one or more search terms or a web page identifier; if the search input comprises one or more search terms, performing a traditional search to identify one or more web pages as search results; if the search input comprises a web page identifier, performing an inversion search to identify one or more related search queries as search results, wherein the one or more related search queries are for a web page corresponding with the web page identifier, wherein the one or more related search queries are identified for the web page by: crawling content of the web page, extracting one or more keywords from the content of the web page, identifying patterns of frequently occurring words used in past search queries that correspond with the one or more keywords, and determining the one or more related search queries for the web page based on the patterns of frequently occurring words used in past search queries identified as corresponding with the one or more keywords; and directly responsive to receiving the search input via the input box, communicating a search results page including at least a portion of the search results for presentation to the end user, wherein the search results page includes at least a portion of the one or more web pages if the search input comprises one or more search terms and the search results page includes at least a portion of the one or more related search queries if the search input comprises a web page identifier.
|
1. A computer-implemented method for providing search results, the method comprising: receiving search input from an end user via an input box configured to receive input for a search engine; determining if the search input comprises one or more search terms or a web page identifier; if the search input comprises one or more search terms, performing a traditional search to identify one or more web pages as search results; if the search input comprises a web page identifier, performing an inversion search to identify one or more related search queries as search results, wherein the one or more related search queries are for a web page corresponding with the web page identifier, wherein the one or more related search queries are identified for the web page by: crawling content of the web page, extracting one or more keywords from the content of the web page, identifying patterns of frequently occurring words used in past search queries that correspond with the one or more keywords, and determining the one or more related search queries for the web page based on the patterns of frequently occurring words used in past search queries identified as corresponding with the one or more keywords; and directly responsive to receiving the search input via the input box, communicating a search results page including at least a portion of the search results for presentation to the end user, wherein the search results page includes at least a portion of the one or more web pages if the search input comprises one or more search terms and the search results page includes at least a portion of the one or more related search queries if the search input comprises a web page identifier. 2. The computer-implemented method of claim 1 , wherein the web page identifier comprises a uniform resource locator.
| 0.850765 |
7,991,825 | 16 | 17 |
16. The personal service support system according to claim 10 , further comprising: a receiver unit which receives a dialog between the user and the agent, wherein said agent answers said inquiry about user operation.
|
16. The personal service support system according to claim 10 , further comprising: a receiver unit which receives a dialog between the user and the agent, wherein said agent answers said inquiry about user operation. 17. The system according to claim 16 , wherein said dialog creating unit produces the created dialog based on (i) said received dialog having said list structure in which utterance units of said user and said agent are set as nodes and (ii) on the information on said nodes.
| 0.5 |
9,183,257 | 15 | 20 |
15. A computer-program product, the product tangibly encoded on a machine-readable storage medium, including instructions configured to cause one or more data processing apparatus to: receiving a first query; receiving a second, follow-up query; determining that an anaphora is present in the second, follow-up query by determining that the second, follow-up query includes a pronoun that refers to an entity that is not present in the second, follow-up query; in response to determining that the anaphora is present in the second, follow-up query, determining that the first query is associated with a plurality of possible entities; generating a plurality of candidate queries, wherein each candidate query of the plurality of candidate queries is generated by replacing the pronoun in the second, follow-up query with a corresponding possible entity; obtaining a ranking for the plurality of candidate queries from a ranking engine; determining that a corresponding possible entity in a highest-ranked candidate query of the plurality of candidate queries is an entity associated with the anaphora from the second, follow-up query, wherein the entity associated with the anaphora from the second, follow-up query is the entity that is not present in the second, follow-up query and is referred to by the pronoun in the second, follow-up query; and based on determining that the corresponding possible entity in the highest-ranked candidate query is the entity associated with the anaphora, providing the highest-ranked candidate query to a search engine and obtaining search results for the highest-ranked candidate query from the search engine.
|
15. A computer-program product, the product tangibly encoded on a machine-readable storage medium, including instructions configured to cause one or more data processing apparatus to: receiving a first query; receiving a second, follow-up query; determining that an anaphora is present in the second, follow-up query by determining that the second, follow-up query includes a pronoun that refers to an entity that is not present in the second, follow-up query; in response to determining that the anaphora is present in the second, follow-up query, determining that the first query is associated with a plurality of possible entities; generating a plurality of candidate queries, wherein each candidate query of the plurality of candidate queries is generated by replacing the pronoun in the second, follow-up query with a corresponding possible entity; obtaining a ranking for the plurality of candidate queries from a ranking engine; determining that a corresponding possible entity in a highest-ranked candidate query of the plurality of candidate queries is an entity associated with the anaphora from the second, follow-up query, wherein the entity associated with the anaphora from the second, follow-up query is the entity that is not present in the second, follow-up query and is referred to by the pronoun in the second, follow-up query; and based on determining that the corresponding possible entity in the highest-ranked candidate query is the entity associated with the anaphora, providing the highest-ranked candidate query to a search engine and obtaining search results for the highest-ranked candidate query from the search engine. 20. The product of claim 15 wherein the ranking engine ranks the plurality of candidate queries by ranking n-grams contained within the candidate queries.
| 0.798956 |
8,983,974 | 1 | 3 |
1. A computer-implemented method, comprising: determining, using one or more processors, a first score for a first user based on interactions by other users with messages of the first user, or a quantity of other users that subscribe to messages of the first user; determining, using one or more processors, a second score for a second user based on interactions by other users with messages of the second user, or a quantity of other users that subscribe to messages of the second user; selecting a third user to which the first user and the second user subscribe; determining, using one or more processors, a third score for the third user, based on the first score for the first user and the second score for the second user; using the third score for the third user in a determination of a score for a particular message of the third user; ranking the particular message of the third user with respect to other messages of other users based on the score for the particular message and scores for the other messages; and providing the particular message and the other messages for display by a computing device in a ranked order according to the score for the particular message and the scores for the other messages.
|
1. A computer-implemented method, comprising: determining, using one or more processors, a first score for a first user based on interactions by other users with messages of the first user, or a quantity of other users that subscribe to messages of the first user; determining, using one or more processors, a second score for a second user based on interactions by other users with messages of the second user, or a quantity of other users that subscribe to messages of the second user; selecting a third user to which the first user and the second user subscribe; determining, using one or more processors, a third score for the third user, based on the first score for the first user and the second score for the second user; using the third score for the third user in a determination of a score for a particular message of the third user; ranking the particular message of the third user with respect to other messages of other users based on the score for the particular message and scores for the other messages; and providing the particular message and the other messages for display by a computing device in a ranked order according to the score for the particular message and the scores for the other messages. 3. The computer-implemented method of claim 1 , wherein: determining the first score for the first user is based on a quantity of comments that other users have submitted as replies to the messages of the first user, and determining the second score for the second user is based on a quantity of comments that other users have submitted as replies to the messages of the second user.
| 0.5 |
8,200,516 | 5 | 6 |
5. A server for a delivery/collection business connected to a delivery/collection control terminal and a terminal at a transfer point via a network, wherein the server, the delivery/collection control terminal, and the terminal at the transfer point are disposed at different human language areas, the server comprising: an instruction-information generator which generates instruction information including delivery destination/collection destination information and transfer point information for instructing a driver regarding handling of delivery/collection of a freight package in a first human language; a dispatch-memory information section which stores vehicle information for controlling a vehicle used in delivery/collection business; an instruction-information transmission section which transmits the generated instruction information in the first human language toward said delivery/collection control terminal and said terminal at the transfer point used in the delivery/collection of the package based on said vehicle information; a human language specifying section which specifies, in response to a request from said delivery/collection control terminal, a second human language to be used in an area belonging to one of a delivery destination/collection destination of the package and a current location of said delivery/collection control terminal, based on one of the delivery destination/collection destination information included in the transmitted instruction information in the first human language and information of the current location thereof based on said vehicle information; a second human language specifying section which specifies, in response to a request from said terminal at the transfer point, a third human language to be used in an area belonging to one of a transfer point of the package and the current location of said terminal at the transfer point, based on one of the transfer point information included in the transmitted instruction information in the first human language and the information of the current location thereof based on said vehicle information; and a translation section which translates the instruction information in the second human language and in the third human language, wherein said delivery/collection control terminal is used by a driver of an area of a human language different from the first human language, wherein said terminal at the transfer point is used by a driver of an area of a human language different from the first and second human languages, and wherein said instruction-information transmission section transmits the instruction information translated in the second human language toward the delivery/collection control terminal so as to display the instruction information translated in the second human language for a driver of an area of the second human language and transmits the instruction information translated in the third human language toward the terminal at the transfer point so as to display the instruction information translated in the third human language for a driver of an area of the third human language.
|
5. A server for a delivery/collection business connected to a delivery/collection control terminal and a terminal at a transfer point via a network, wherein the server, the delivery/collection control terminal, and the terminal at the transfer point are disposed at different human language areas, the server comprising: an instruction-information generator which generates instruction information including delivery destination/collection destination information and transfer point information for instructing a driver regarding handling of delivery/collection of a freight package in a first human language; a dispatch-memory information section which stores vehicle information for controlling a vehicle used in delivery/collection business; an instruction-information transmission section which transmits the generated instruction information in the first human language toward said delivery/collection control terminal and said terminal at the transfer point used in the delivery/collection of the package based on said vehicle information; a human language specifying section which specifies, in response to a request from said delivery/collection control terminal, a second human language to be used in an area belonging to one of a delivery destination/collection destination of the package and a current location of said delivery/collection control terminal, based on one of the delivery destination/collection destination information included in the transmitted instruction information in the first human language and information of the current location thereof based on said vehicle information; a second human language specifying section which specifies, in response to a request from said terminal at the transfer point, a third human language to be used in an area belonging to one of a transfer point of the package and the current location of said terminal at the transfer point, based on one of the transfer point information included in the transmitted instruction information in the first human language and the information of the current location thereof based on said vehicle information; and a translation section which translates the instruction information in the second human language and in the third human language, wherein said delivery/collection control terminal is used by a driver of an area of a human language different from the first human language, wherein said terminal at the transfer point is used by a driver of an area of a human language different from the first and second human languages, and wherein said instruction-information transmission section transmits the instruction information translated in the second human language toward the delivery/collection control terminal so as to display the instruction information translated in the second human language for a driver of an area of the second human language and transmits the instruction information translated in the third human language toward the terminal at the transfer point so as to display the instruction information translated in the third human language for a driver of an area of the third human language. 6. The server according to claim 5 , wherein the generated instruction information includes at least an address of the delivery destination/collection destination, and an address of the transfer point, said human language specifying section specifies the second human language to be used in the area to which the address of the delivery destination/collection destination belongs, according to information indicating a relationship between the area to which the address of the delivery destination/collection destination belongs and a human language in use, and said second human language specifying section specifies the third human language to be used in the area to which the address of the transfer point belongs, according to information indicating a relationship between the area to which the address of the transfer point belongs and a human language in use.
| 0.5 |
8,504,537 | 1 | 6 |
1. A computer-implemented method comprising: intercepting packets being transmitted over a network at a distributed match agent of a document registration system; reassembling the packets into an intercepted document; generating a set of signatures associated with the intercepted document; comparing the set of signatures associated with the intercepted document with signatures associated with registered documents, wherein the signatures associated with the registered documents are stored in a local signature database of the distributed match agent; and determining whether to notify a manager agent of the registration system based on the result of the comparison.
|
1. A computer-implemented method comprising: intercepting packets being transmitted over a network at a distributed match agent of a document registration system; reassembling the packets into an intercepted document; generating a set of signatures associated with the intercepted document; comparing the set of signatures associated with the intercepted document with signatures associated with registered documents, wherein the signatures associated with the registered documents are stored in a local signature database of the distributed match agent; and determining whether to notify a manager agent of the registration system based on the result of the comparison. 6. The method of claim 1 , wherein determining whether to notify the manager agent comprises: comparing the number of different documents the matched signatures originated from with a threshold number.
| 0.5 |
10,108,702 | 15 | 17 |
15. The computer program product of claim 14 , wherein the computer readable program code instructions for execution by the processor further cause the processor to: generate a response to the second spoken query that satisfies: the initial topic, in response to determining that the second spoken query is directed to the initial topic; the new topic, in response to determining that the second spoken query is directed to the new topic and is independent of the initial topic; and the initial topic and the new topic, in response to determining that the second spoken query is directed to the new topic within a context of the initial topic.
|
15. The computer program product of claim 14 , wherein the computer readable program code instructions for execution by the processor further cause the processor to: generate a response to the second spoken query that satisfies: the initial topic, in response to determining that the second spoken query is directed to the initial topic; the new topic, in response to determining that the second spoken query is directed to the new topic and is independent of the initial topic; and the initial topic and the new topic, in response to determining that the second spoken query is directed to the new topic within a context of the initial topic. 17. The computer program product of claim 15 , wherein the computer readable program code instructions for execution by the processor further cause the processor to, in response to determining that the time elapsed between the first and second queries is shorter than a threshold contextual continuity time period, generate the response to the second query to satisfy the new topic and the topic of the first query.
| 0.5 |
9,286,548 | 11 | 15 |
11. An online shopping system comprising: an index of documents; a search engine for receiving a query and returning a set of search results responsive to the query based on the index of documents; and a ranking engine for ranking the search results based at least in part on a classification based on the concatenation of a first distribution and a second distribution, wherein the first distribution and the second distribution result from inferences on different sets of training data using different classifiers.
|
11. An online shopping system comprising: an index of documents; a search engine for receiving a query and returning a set of search results responsive to the query based on the index of documents; and a ranking engine for ranking the search results based at least in part on a classification based on the concatenation of a first distribution and a second distribution, wherein the first distribution and the second distribution result from inferences on different sets of training data using different classifiers. 15. The system of claim 11 , wherein the search engine organizes the ranked search results according to a product taxonomy of the search engine.
| 0.68 |
7,984,035 | 1 | 6 |
1. A system comprising: a computer readable storage medium having computer readable instructions stored thereon that are operable by one or more system components, the one or more system components comprising: a context analyzer component that establishes context of each of a plurality of documents, wherein the context analyzer component includes an image analyzer that employs facial recognition to establish the context; a search engine component that identifies a plurality of search results based upon the context of each of the plurality of documents in view of a search query; and a category association component that maps each context to a category and ranks each context within the category, the category being determined by mining a plurality of search queries submitted.
|
1. A system comprising: a computer readable storage medium having computer readable instructions stored thereon that are operable by one or more system components, the one or more system components comprising: a context analyzer component that establishes context of each of a plurality of documents, wherein the context analyzer component includes an image analyzer that employs facial recognition to establish the context; a search engine component that identifies a plurality of search results based upon the context of each of the plurality of documents in view of a search query; and a category association component that maps each context to a category and ranks each context within the category, the category being determined by mining a plurality of search queries submitted. 6. The system of claim 1 , further comprising an index generator component that generates a context-based index of the plurality of documents, wherein the context analyzer component employs the context-based index to establish the context of each of the plurality of documents.
| 0.5 |
8,131,559 | 19 | 21 |
19. The method according to claim 18 , the step of receiving the first document also comprises receiving a submission payment of tokens.
|
19. The method according to claim 18 , the step of receiving the first document also comprises receiving a submission payment of tokens. 21. The method according to claim 19 , wherein the tokens added to the account of participants that own shares in the second document is substantially equal to the tokens of the submissions payment.
| 0.5 |
9,746,932 | 14 | 15 |
14. A method, comprising: tracking a gesture, wherein the gesture represents a user interaction with a computing device; identifying the gesture from amongst a plurality of gestures; determining, based at least in part on the gesture, a global term to assign to a data item associated with the gesture; and assigning the global term to the data item associated with the gesture.
|
14. A method, comprising: tracking a gesture, wherein the gesture represents a user interaction with a computing device; identifying the gesture from amongst a plurality of gestures; determining, based at least in part on the gesture, a global term to assign to a data item associated with the gesture; and assigning the global term to the data item associated with the gesture. 15. The method of claim 14 , wherein the determining of the global term is based on use of a look-up table that correlates global terms to data types.
| 0.682203 |
7,953,736 | 1 | 8 |
1. A non-transitory computer-readable storage medium comprising program code for causing a computer to perform a method for creating a user community consensus of the relevance of a metadata tag to a content item, the method comprising: receiving a metadata tag submitted by a first user of the user community the metadata tag describing an associated content item; receiving a plurality of relevance ratings of the metadata tag submitted by the first user from other users of the user community, the metadata tag relevance ratings each rating the relevance of the metadata tag as pertaining to the associated content item, each user having a respective rating weight that determines the weight afforded to ratings of the user relative to other users in the user community; weighting the relevance ratings submitted by the users relative to one another based on the respective rating weights of the users; calculating an average relevance rating of the metadata tag using the weighted relevance ratings; and storing the relevance ratings and the average relevance rating of the metadata tag.
|
1. A non-transitory computer-readable storage medium comprising program code for causing a computer to perform a method for creating a user community consensus of the relevance of a metadata tag to a content item, the method comprising: receiving a metadata tag submitted by a first user of the user community the metadata tag describing an associated content item; receiving a plurality of relevance ratings of the metadata tag submitted by the first user from other users of the user community, the metadata tag relevance ratings each rating the relevance of the metadata tag as pertaining to the associated content item, each user having a respective rating weight that determines the weight afforded to ratings of the user relative to other users in the user community; weighting the relevance ratings submitted by the users relative to one another based on the respective rating weights of the users; calculating an average relevance rating of the metadata tag using the weighted relevance ratings; and storing the relevance ratings and the average relevance rating of the metadata tag. 8. The non-transitory computer-readable storage medium of claim 1 , the method further comprising: calculating a respective consistency level of relevance ratings of each of a plurality of metadata tags submitted by users in the user community; and ordering a search result comprising a plurality of content items based on a relevance rating consistency level of one or more metadata tags assigned to the content items in the search result.
| 0.56 |
7,996,396 | 1 | 4 |
1. A computer-implemented method for ranking web pages in a result set, comprising: under control of one or more computer systems configured with executable instructions, establishing, in response to receiving a query containing one or more query terms, a plurality of rating scores, a first subset of the plurality of rating scores reflecting a first determined level of relevance of one of a plurality of web pages generated in response to the query to one of a plurality of query terms, a second subset of the plurality of rating scores reflecting a second determined level of relevance of the one of the plurality of web pages generated in response to the query to one of a plurality of terms not included in the query terms and associated with the one of the plurality of web pages; observing interaction of a plurality of users with a selected web page of the plurality of web pages during a rating period to detect any of a type of content interaction, each of the type of content interaction being performed with respect to the selected web page, the type of content interaction comprising printing the content and copying the content; in response to detecting any of the type of content interaction performed by any of the plurality of users, adjusting at least one of the established first subset of the plurality of rating scores for at least one combination of the selected web page and a query term among the one or more query terms, the rating score being adjusted by an amount based at least in part upon the detected content interaction, the adjustment to the rating score being configured to be positive based at least in part on the detected content interaction, each adjustment to the rating score corresponding to an inferred relevance of the web page to one of the query terms; and adjusting at least one of the established second subset of the plurality of rating scores for at least one combination of the selected web page and one of the plurality of terms not included in the query terms and associated with the one of the plurality of web pages, the rating score being adjusted by an amount based at least in part upon the detected content interaction, the adjustment to the rating score being configured to be positive based at least in part on the detected content interaction, each adjustment to the rating score corresponding to an inferred relevance of the selected web page to the one of the plurality of terms; and for each of a plurality of web pages included generated in response to the query: selecting established and adjusted rating scores for each combination of the web page and a query term and for each combination of the web page and a term not included in the query terms, and determining a ranking score for the web page by combining the selected rating scores.
|
1. A computer-implemented method for ranking web pages in a result set, comprising: under control of one or more computer systems configured with executable instructions, establishing, in response to receiving a query containing one or more query terms, a plurality of rating scores, a first subset of the plurality of rating scores reflecting a first determined level of relevance of one of a plurality of web pages generated in response to the query to one of a plurality of query terms, a second subset of the plurality of rating scores reflecting a second determined level of relevance of the one of the plurality of web pages generated in response to the query to one of a plurality of terms not included in the query terms and associated with the one of the plurality of web pages; observing interaction of a plurality of users with a selected web page of the plurality of web pages during a rating period to detect any of a type of content interaction, each of the type of content interaction being performed with respect to the selected web page, the type of content interaction comprising printing the content and copying the content; in response to detecting any of the type of content interaction performed by any of the plurality of users, adjusting at least one of the established first subset of the plurality of rating scores for at least one combination of the selected web page and a query term among the one or more query terms, the rating score being adjusted by an amount based at least in part upon the detected content interaction, the adjustment to the rating score being configured to be positive based at least in part on the detected content interaction, each adjustment to the rating score corresponding to an inferred relevance of the web page to one of the query terms; and adjusting at least one of the established second subset of the plurality of rating scores for at least one combination of the selected web page and one of the plurality of terms not included in the query terms and associated with the one of the plurality of web pages, the rating score being adjusted by an amount based at least in part upon the detected content interaction, the adjustment to the rating score being configured to be positive based at least in part on the detected content interaction, each adjustment to the rating score corresponding to an inferred relevance of the selected web page to the one of the plurality of terms; and for each of a plurality of web pages included generated in response to the query: selecting established and adjusted rating scores for each combination of the web page and a query term and for each combination of the web page and a term not included in the query terms, and determining a ranking score for the web page by combining the selected rating scores. 4. The computer-implemented method of claim 1 , further comprising using the determined ranking scores to select a proper subset of the web pages included in the distinguished query result for display.
| 0.723901 |
9,990,419 | 1 | 4 |
1. A system for generating answers to questions, comprising: a computer device comprising: at least one distinct software module, each distinct software module being embodied on a tangible computer-readable medium; a memory; and at least one processor coupled to the memory device and operative for: receiving an input query; obtaining, from an unstructured data source, a plurality of candidate answers to the input query; performing context independent answer processing to produce first scores for each of the candidate answers; computing specified information about each of the candidate answers during the context independent answer processing; sending the candidate answers to a model selection module; using the model selection module to use said specified information computed about the candidate answers during the context independent answer processing, to select one of a plurality of scoring models; sending each of the candidate answers to the selected one of the scoring models; using the selected one of the scoring models for weighting the first scores for the candidate answers to determine an answer score for each of the candidate answers; and generating at least one answer to the input query based on the answer scores.
|
1. A system for generating answers to questions, comprising: a computer device comprising: at least one distinct software module, each distinct software module being embodied on a tangible computer-readable medium; a memory; and at least one processor coupled to the memory device and operative for: receiving an input query; obtaining, from an unstructured data source, a plurality of candidate answers to the input query; performing context independent answer processing to produce first scores for each of the candidate answers; computing specified information about each of the candidate answers during the context independent answer processing; sending the candidate answers to a model selection module; using the model selection module to use said specified information computed about the candidate answers during the context independent answer processing, to select one of a plurality of scoring models; sending each of the candidate answers to the selected one of the scoring models; using the selected one of the scoring models for weighting the first scores for the candidate answers to determine an answer score for each of the candidate answers; and generating at least one answer to the input query based on the answer scores. 4. The system according to claim 1 , wherein the computed specified information is intrinsic to the candidate answers.
| 0.753138 |
9,548,951 | 1 | 8 |
1. A method, comprising: identifying a message that is associated with two or more users, wherein the users include a sender and one or more recipients, and wherein the message includes one or more terms; determining a vague term of the terms, wherein the vague term includes a plurality of consecutive words, the consecutive words including at least a word and an additional word; determining that at least the word of the vague term is a reference to a given user of the users, the given user being the sender or one of the recipients; identifying, based on determining that the word is a reference to the given user, a user-restricted database associated with the given user, wherein the user-restricted database includes content personal to the given user, and wherein access to the user-restricted database is limitable by the given user; determining, based on the user-restricted database, additional information that is related to the vague term, wherein the user-restricted database is used in determining the additional information that is related to the vague term based on the user-restricted database being associated with the given user and based on the given user being referenced by the word of the vague term; and providing the additional information to at least one of the users.
|
1. A method, comprising: identifying a message that is associated with two or more users, wherein the users include a sender and one or more recipients, and wherein the message includes one or more terms; determining a vague term of the terms, wherein the vague term includes a plurality of consecutive words, the consecutive words including at least a word and an additional word; determining that at least the word of the vague term is a reference to a given user of the users, the given user being the sender or one of the recipients; identifying, based on determining that the word is a reference to the given user, a user-restricted database associated with the given user, wherein the user-restricted database includes content personal to the given user, and wherein access to the user-restricted database is limitable by the given user; determining, based on the user-restricted database, additional information that is related to the vague term, wherein the user-restricted database is used in determining the additional information that is related to the vague term based on the user-restricted database being associated with the given user and based on the given user being referenced by the word of the vague term; and providing the additional information to at least one of the users. 8. The method of claim 1 , wherein providing the additional information includes providing a notification to at least one of the recipients.
| 0.809264 |
7,788,254 | 1 | 2 |
1. A method of analyzing web pages, comprising: accessing a plurality of web pages; generating a plurality of different graphical representations of the web pages, each graphical representation having nodes that represent the web pages and links between the nodes, the nodes in each of the graphical representations representing a same set of the web pages as represented in other of the graphical representations, and the links in each graphical representation representing different relationships between the nodes in each graphical representation from the other graphical representations; generating a model that models a random walk through all of the different graphical representations; receiving training pages, wherein each of a plurality of training nodes, in the graphical representations, corresponding to a training page has a target function value indicative of a label for the corresponding training page, the label indicating the corresponding training page belongs to one of a plurality of different groups; generating a classifier based on the model, based on classifier function values of nodes in the graphical representations, and based on the target function values of the training pages; and grouping the web pages into groups with the classifier.
|
1. A method of analyzing web pages, comprising: accessing a plurality of web pages; generating a plurality of different graphical representations of the web pages, each graphical representation having nodes that represent the web pages and links between the nodes, the nodes in each of the graphical representations representing a same set of the web pages as represented in other of the graphical representations, and the links in each graphical representation representing different relationships between the nodes in each graphical representation from the other graphical representations; generating a model that models a random walk through all of the different graphical representations; receiving training pages, wherein each of a plurality of training nodes, in the graphical representations, corresponding to a training page has a target function value indicative of a label for the corresponding training page, the label indicating the corresponding training page belongs to one of a plurality of different groups; generating a classifier based on the model, based on classifier function values of nodes in the graphical representations, and based on the target function values of the training pages; and grouping the web pages into groups with the classifier. 2. The method of claim 1 wherein generating a classifier comprises: selecting a classifier function by optimizing a cost function that penalizes differences between the target function value and a classifier function value for the training nodes.
| 0.5 |
8,583,563 | 4 | 5 |
4. The apparatus of claim 1 , wherein the information is provided in a profile, which includes relevant characteristics of corresponding end users, and wherein the profile is used in conjunction with the personality type determination to match two or more end users.
|
4. The apparatus of claim 1 , wherein the information is provided in a profile, which includes relevant characteristics of corresponding end users, and wherein the profile is used in conjunction with the personality type determination to match two or more end users. 5. The apparatus of claim 4 , wherein an administrator weights the profile and the personality determination within an algorithm that matches the end users.
| 0.5 |
8,463,768 | 10 | 13 |
10. A tangible computer-readable storage medium storing a plurality of instructions which, when executed by a processor, cause the processor to perform operations for using user provided tags for searching, the operations comprising: collecting, by an application server, a plurality of user provided tags associated with a plurality of entities, wherein the plurality of user provided tags comprises semantic descriptions entered by a plurality of different users; creating, by the application server, a tag topological network layer that is managed by a service provider, wherein the tag topological network layer predefines a next entity for each one of the plurality of entities based upon the plurality of user provided tags; receiving, by the application server, a user query that contains a search term; and generating, by the application server, a search result containing an entity of the plurality of entities in the tag topological network layer, wherein the entity is found based on a distance measure of a tag vector, t p , for the entity, p, wherein a function t p (i) represents a measure of a weight of a tag, i, that is used to tag the entity, p, based on a normalized count of times tag, i, is used to tag the entity, p, wherein the entity contains a link to another entity in accordance with the tag topological network layer, wherein the link is created in accordance with the tag vector of the entity.
|
10. A tangible computer-readable storage medium storing a plurality of instructions which, when executed by a processor, cause the processor to perform operations for using user provided tags for searching, the operations comprising: collecting, by an application server, a plurality of user provided tags associated with a plurality of entities, wherein the plurality of user provided tags comprises semantic descriptions entered by a plurality of different users; creating, by the application server, a tag topological network layer that is managed by a service provider, wherein the tag topological network layer predefines a next entity for each one of the plurality of entities based upon the plurality of user provided tags; receiving, by the application server, a user query that contains a search term; and generating, by the application server, a search result containing an entity of the plurality of entities in the tag topological network layer, wherein the entity is found based on a distance measure of a tag vector, t p , for the entity, p, wherein a function t p (i) represents a measure of a weight of a tag, i, that is used to tag the entity, p, based on a normalized count of times tag, i, is used to tag the entity, p, wherein the entity contains a link to another entity in accordance with the tag topological network layer, wherein the link is created in accordance with the tag vector of the entity. 13. The tangible computer-readable storage medium of claim 10 , wherein the distance measure is an earth mover distance measure.
| 0.777003 |
9,836,508 | 14 | 16 |
14. The system of claim 10 , wherein the at least one processor is further configured to execute the computer-executable instructions to cause the system to perform the method further comprising: determining, from the merged table, and based at least in part from the aggregate weights, a first leading scorer of the matched fields and a second leading scorer of the matched fields, the first leading scorer associated with a record having a highest aggregate weight and the second leading scorer associated with a record having a second highest aggregate weight; determining a first condition comprising whether a first weight associated with the first leading scorer meets or exceeds a first predetermined value; determining a second condition comprising whether a difference between the first weight and a second weight associated with the second leading scorer meets or exceeds a second predetermined value; and wherein the matching entity corresponds to the first leading scorer and is based at least in part on the determining of the first condition and on the determining of the second condition, and wherein the matching entity further corresponds to an entity associated with a lowest hierarchy level associated with the grouping.
|
14. The system of claim 10 , wherein the at least one processor is further configured to execute the computer-executable instructions to cause the system to perform the method further comprising: determining, from the merged table, and based at least in part from the aggregate weights, a first leading scorer of the matched fields and a second leading scorer of the matched fields, the first leading scorer associated with a record having a highest aggregate weight and the second leading scorer associated with a record having a second highest aggregate weight; determining a first condition comprising whether a first weight associated with the first leading scorer meets or exceeds a first predetermined value; determining a second condition comprising whether a difference between the first weight and a second weight associated with the second leading scorer meets or exceeds a second predetermined value; and wherein the matching entity corresponds to the first leading scorer and is based at least in part on the determining of the first condition and on the determining of the second condition, and wherein the matching entity further corresponds to an entity associated with a lowest hierarchy level associated with the grouping. 16. The system of claim 14 , wherein the at least one processor is further configured to execute the computer-executable instructions to cause the system to perform the method further comprising: merging aggregate weights of one or more entities associated with intermediate hierarchy levels in the grouping in response to determining that the first condition or the second condition is not met; re-determining the first condition and the second condition; and outputting a record identifier corresponding to an entity associated with a lowest hierarchy level of the grouping in response to re-determining the first condition and the second condition.
| 0.5 |
8,458,163 | 23 | 32 |
23. A non-transitory computer readable storage medium storing at least one program for execution by a computer system, the at least one program comprising instructions for: storing, for each website of a multiplicity of websites, a corresponding current crawl rate limit; comparing a maximum crawl rate for the respective website over a defined period of time with the current crawl rate limit for crawling the respective website to determine if the current crawl rate limit is a limiting factor in crawling the respective website; and performing a website crawling management function in accordance with the determination of whether the current crawl rate limit is the limiting factor in crawling the respective website; and providing a crawl rate control mechanism to a respective owner of the respective website, wherein the crawl rate control mechanism enables selection of a new crawl rate limit corresponding to the respective website by the respective owner.
|
23. A non-transitory computer readable storage medium storing at least one program for execution by a computer system, the at least one program comprising instructions for: storing, for each website of a multiplicity of websites, a corresponding current crawl rate limit; comparing a maximum crawl rate for the respective website over a defined period of time with the current crawl rate limit for crawling the respective website to determine if the current crawl rate limit is a limiting factor in crawling the respective website; and performing a website crawling management function in accordance with the determination of whether the current crawl rate limit is the limiting factor in crawling the respective website; and providing a crawl rate control mechanism to a respective owner of the respective website, wherein the crawl rate control mechanism enables selection of a new crawl rate limit corresponding to the respective website by the respective owner. 32. The non-transitory computer program product of claim 23 , wherein the instructions for providing the crawl rate control mechanism further include instructions providing, for concurrent display: the current crawl rate associated with the crawling of the respective website; crawl data, including statistical information associated with crawling the respective website; and an interface for enabling the respective owner to select the new crawl rate limit.
| 0.5 |
9,734,141 | 18 | 19 |
18. A method for replacing a word in a sentence automatically using a computer comprising the steps of: identifying a subject to form the word map for; providing, by a computer, the subject with a base word; recording, using the computer, a plurality of related words that the subject provides based on the base word; recording, using the computer, a second plurality of words provided by the subject related to each of the plurality of related words; providing, by the computer, the subject with a second base word; recording, using the computer, a third plurality of related words that the subject provides based on the base word; recording, using the computer, a fourth plurality of words provided by the subject related to each of the plurality of related words; plotting, by the computer, each of the recorded plurality, second plurality, third plurality, and fourth plurality of words, and connecting, using a link, a connection of all of the recorded words as recorded, such that a first word links to the word to which it relates, and also links to other words through the word to which it relates, and has links to other related words as provided by the subject; identifying, using the computer, a word of a sentence in a document to be optimized, wherein the word is a first word in a sentence or a last word in a sentence, the word having one of a preceding word and a following word, the optimizing comprising replacing the word with a replacement word; the step of optimizing comprising: identifying, by the computer, a plurality of words of the plot that connect by one link to the preceding if the identified word is the last word in the sentence, or the following word if the identified word is the first word in the sentence; selecting a replacement word, automatically by the computer by the computer selecting one of the plurality of words identified having a greatest number of links connecting to it; and replacing the identified word with the selected replacement word automatically in the document by the computer.
|
18. A method for replacing a word in a sentence automatically using a computer comprising the steps of: identifying a subject to form the word map for; providing, by a computer, the subject with a base word; recording, using the computer, a plurality of related words that the subject provides based on the base word; recording, using the computer, a second plurality of words provided by the subject related to each of the plurality of related words; providing, by the computer, the subject with a second base word; recording, using the computer, a third plurality of related words that the subject provides based on the base word; recording, using the computer, a fourth plurality of words provided by the subject related to each of the plurality of related words; plotting, by the computer, each of the recorded plurality, second plurality, third plurality, and fourth plurality of words, and connecting, using a link, a connection of all of the recorded words as recorded, such that a first word links to the word to which it relates, and also links to other words through the word to which it relates, and has links to other related words as provided by the subject; identifying, using the computer, a word of a sentence in a document to be optimized, wherein the word is a first word in a sentence or a last word in a sentence, the word having one of a preceding word and a following word, the optimizing comprising replacing the word with a replacement word; the step of optimizing comprising: identifying, by the computer, a plurality of words of the plot that connect by one link to the preceding if the identified word is the last word in the sentence, or the following word if the identified word is the first word in the sentence; selecting a replacement word, automatically by the computer by the computer selecting one of the plurality of words identified having a greatest number of links connecting to it; and replacing the identified word with the selected replacement word automatically in the document by the computer. 19. The method of claim 18 further comprising the step of performing the identifying, selecting, and replacing step for each sentence of the document.
| 0.809645 |
10,007,728 | 12 | 18 |
12. A method comprising: maintaining a plurality of pages on a social networking system; clustering the plurality of pages by a concept; ranking, by a processor, a plurality of pages of the cluster of pages based on one or more rules analyzing attributes of the plurality of pages of the cluster of pages, the one or more rules applied based on a predetermined hierarchy and profile information of a user requesting a page of the cluster of pages; selecting, based on the ranking associated with the plurality of pages of the cluster, a best page for the concept; and directing the user requesting a page of the plurality of pages of the cluster to the selected best page.
|
12. A method comprising: maintaining a plurality of pages on a social networking system; clustering the plurality of pages by a concept; ranking, by a processor, a plurality of pages of the cluster of pages based on one or more rules analyzing attributes of the plurality of pages of the cluster of pages, the one or more rules applied based on a predetermined hierarchy and profile information of a user requesting a page of the cluster of pages; selecting, based on the ranking associated with the plurality of pages of the cluster, a best page for the concept; and directing the user requesting a page of the plurality of pages of the cluster to the selected best page. 18. The method of claim 12 , wherein directing a user requesting a page of the plurality of pages of the cluster to the selected best page further comprises: providing for display in a profile page for a user of the social networking system, the user expressing an interest in a page of the plurality of pages, the selected best page for the cluster in place of the page in which the user expressed interest.
| 0.566879 |
9,584,526 | 5 | 6 |
5. The method of claim 2 , wherein determining the respective likeness scores of the particular users in relation to the first user, comprises: identifying one or more discriminating attributes; obtaining a weighted vector of attributes for the first user and for each of the particular users; adjusting a respective weight of the discriminating attributes in each of the vectors; and calculating the respective likeness score of each of the particular users as a difference between the weighted vector of attributes of the particular user and the weighted vector of attributes of the first user.
|
5. The method of claim 2 , wherein determining the respective likeness scores of the particular users in relation to the first user, comprises: identifying one or more discriminating attributes; obtaining a weighted vector of attributes for the first user and for each of the particular users; adjusting a respective weight of the discriminating attributes in each of the vectors; and calculating the respective likeness score of each of the particular users as a difference between the weighted vector of attributes of the particular user and the weighted vector of attributes of the first user. 6. The method of claim 5 , wherein identifying one or more discriminating attributes comprises identifying one or more discriminating attributes of the author.
| 0.67551 |
6,131,082 | 1 | 4 |
1. A translation memory comprising: an aligned file having a number of source language text segments encoded in a computer readable format, each of the source language text segments positioned at a unique address and paired with a target language text segment encoded in the computer readable format; an inverted index comprising a listing of source language letter n-grams, wherein each listed letter n-gram includes an associated entry for an entropy weight for the listed letter n-gram, a count of the number of source language text segments in the aligned file that include an entry for the listed letter n-gram, and a pointer to a unique location in the translation memory; and a posting vector file having a posting vector associated with each listed letter n-gram in the inverted index, each posting vector positioned at one of the unique locations pointed to in the inverted index, each posting vector including: i) a plurality of document identification numbers each corresponding to a selected one of the source language text strings in the aligned file, and ii) a number of entropy weight values, each of the number of entropy weight values associated with one document identification number.
|
1. A translation memory comprising: an aligned file having a number of source language text segments encoded in a computer readable format, each of the source language text segments positioned at a unique address and paired with a target language text segment encoded in the computer readable format; an inverted index comprising a listing of source language letter n-grams, wherein each listed letter n-gram includes an associated entry for an entropy weight for the listed letter n-gram, a count of the number of source language text segments in the aligned file that include an entry for the listed letter n-gram, and a pointer to a unique location in the translation memory; and a posting vector file having a posting vector associated with each listed letter n-gram in the inverted index, each posting vector positioned at one of the unique locations pointed to in the inverted index, each posting vector including: i) a plurality of document identification numbers each corresponding to a selected one of the source language text strings in the aligned file, and ii) a number of entropy weight values, each of the number of entropy weight values associated with one document identification number. 4. The translation memory of claim 1 wherein the entropy weight is calculated from: ##EQU3## Entropy.sub.i =entropy weight for a letter n-gram i; freq.sub.i =frequency of term i in text segment k; tfreq.sub.i =total frequency of term i in all text segments; and N=total number of text segments.
| 0.5 |
8,627,299 | 1 | 8 |
1. A virtual machine for executing a program, comprising: an instruction executor for executing instructions from the program using a computer, wherein: the instructions from the program have been generated in an intermediate language, by a compiler, to cause processing of an execution sequence according to a specification of a model, the model specification encoded using a model notation that is distinct from the intermediate notation; the instructions from the program are encoded in a markup language notation by the compiler and are selected by the compiler from allowable instructions of the intermediate language, the markup language notation being distinct from the intermediate language; and the allowable instructions of the intermediate language comprise: an event instruction for receiving an inbound event; an assignment instruction for assigning a value; a branch instruction for conditional transfer to a different one of the instructions; an emit instruction for specifying that an outbound event is to be emitted; a terminate instruction for specifying that a current execution context object is to be terminated; and a fan-out instruction for at least one of specifying event correlation and enabling a context switch, the context switch causing a particular execution context object to be used as the current execution context object.
|
1. A virtual machine for executing a program, comprising: an instruction executor for executing instructions from the program using a computer, wherein: the instructions from the program have been generated in an intermediate language, by a compiler, to cause processing of an execution sequence according to a specification of a model, the model specification encoded using a model notation that is distinct from the intermediate notation; the instructions from the program are encoded in a markup language notation by the compiler and are selected by the compiler from allowable instructions of the intermediate language, the markup language notation being distinct from the intermediate language; and the allowable instructions of the intermediate language comprise: an event instruction for receiving an inbound event; an assignment instruction for assigning a value; a branch instruction for conditional transfer to a different one of the instructions; an emit instruction for specifying that an outbound event is to be emitted; a terminate instruction for specifying that a current execution context object is to be terminated; and a fan-out instruction for at least one of specifying event correlation and enabling a context switch, the context switch causing a particular execution context object to be used as the current execution context object. 8. The virtual machine according to claim 1 , wherein the executing of the assignment instruction further comprises: evaluating an expression of the assignment instruction; and assigning, as the value, a result of the evaluating to a target identified by the assignment instruction, the target comprising a slot of a current execution context object or of an outbound event that is to be emitted.
| 0.754342 |
8,825,583 | 10 | 11 |
10. The system of claim 8 , wherein the non-transitory machine readable fact memory is configured to receive facts declared by a user of the system via the interface.
|
10. The system of claim 8 , wherein the non-transitory machine readable fact memory is configured to receive facts declared by a user of the system via the interface. 11. The system of claim 10 , wherein the system is configured to prompt a declaration of a fact by a user.
| 0.5 |
7,720,845 | 34 | 44 |
34. The computer-implemented method according to claim 1 , further comprising: causing a plurality of batched results to be returned to the user interface; optimizing a batch size dynamically in view of a number of changes and an amount of time passed since a last batch was processed.
|
34. The computer-implemented method according to claim 1 , further comprising: causing a plurality of batched results to be returned to the user interface; optimizing a batch size dynamically in view of a number of changes and an amount of time passed since a last batch was processed. 44. The computer-implemented method according to claim 34 , further comprising: enabling scalable concurrency of queries by running a large number of query runners in parallel.
| 0.5 |
9,324,070 | 2 | 4 |
2. The method of claim 1 further comprising: verifying the proposed account number associated with the new best guess by: sending the proposed account number associated with the best guess to a financial institution; and receiving, from the financial institution, a confirmation that the proposed account number associated with the new best guess indicates valid account data.
|
2. The method of claim 1 further comprising: verifying the proposed account number associated with the new best guess by: sending the proposed account number associated with the best guess to a financial institution; and receiving, from the financial institution, a confirmation that the proposed account number associated with the new best guess indicates valid account data. 4. The method of claim 2 further comprising: sending the verified account number associated with the new best guess to a second server, wherein the second server is configured to perform a transaction using the verified account number associated with the new best guess.
| 0.693182 |
9,977,656 | 19 | 20 |
19. The non-transitory computer-readable medium of claim 17 , wherein the non-transitory computer-readable medium stores instructions that, when executed by the processor, cause the processor to further perform operations including: determining a functional and technical match score for each of the plurality of software components based on the input and a metadata repository, the metadata repository including metadata for each of the plurality of software components; determining a weight corresponding to functional and technical match score based on the requirements matching score; and determining a combined score for each of the plurality of software components based on the weight corresponding to the requirements matching score, the weight corresponding to the performance score, and the weight corresponding to the functional and technical match score.
|
19. The non-transitory computer-readable medium of claim 17 , wherein the non-transitory computer-readable medium stores instructions that, when executed by the processor, cause the processor to further perform operations including: determining a functional and technical match score for each of the plurality of software components based on the input and a metadata repository, the metadata repository including metadata for each of the plurality of software components; determining a weight corresponding to functional and technical match score based on the requirements matching score; and determining a combined score for each of the plurality of software components based on the weight corresponding to the requirements matching score, the weight corresponding to the performance score, and the weight corresponding to the functional and technical match score. 20. The non-transitory computer-readable medium of claim 19 , wherein the input includes one or more words in natural language, and the non-transitory computer-readable medium stores instructions that, when executed by the processor, cause the processor to further perform operations including: determining the functional and technical match score includes searching the metadata repository for the one or more words using natural language processing.
| 0.5 |
7,707,142 | 17 | 28 |
17. A computer-readable storage medium containing program code, comprising: (a) program code for receiving a search query; (b) program code for determining whether the search query has been previously received; (c) program code for if the search query has not been previously received, (i) receiving a new result set associated with the search query, (ii) storing the new result set associated with the search query in an offline-accessible data store, and (iii) outputting the new result set as a search result of the search query; (d) program code for if the search query has been previously received, (i) retrieving a previously stored result set associated with the search query from the offline-accessible data store, the previously stored result set comprising a plurality of categories each of which comprises one or more articles, (ii) determining whether at least one of the plurality of categories of the previously stored result set associated with the search query is a valid search result set for the search query, and (iii) responsive to a determination that the at least one of the plurality of categories of the previously stored result set associated with the search query is a valid search result set for the search query, outputting the at least one of the plurality of categories of the previously stored result set associated with the search query as a search result of the search query.
|
17. A computer-readable storage medium containing program code, comprising: (a) program code for receiving a search query; (b) program code for determining whether the search query has been previously received; (c) program code for if the search query has not been previously received, (i) receiving a new result set associated with the search query, (ii) storing the new result set associated with the search query in an offline-accessible data store, and (iii) outputting the new result set as a search result of the search query; (d) program code for if the search query has been previously received, (i) retrieving a previously stored result set associated with the search query from the offline-accessible data store, the previously stored result set comprising a plurality of categories each of which comprises one or more articles, (ii) determining whether at least one of the plurality of categories of the previously stored result set associated with the search query is a valid search result set for the search query, and (iii) responsive to a determination that the at least one of the plurality of categories of the previously stored result set associated with the search query is a valid search result set for the search query, outputting the at least one of the plurality of categories of the previously stored result set associated with the search query as a search result of the search query. 28. The computer-readable storage medium of claim 17 , wherein (c) further comprises: (iv) program code for determining expiration data for the new result set.
| 0.943457 |
8,640,030 | 11 | 12 |
11. The method of claim 8 , wherein enabling a user to filter video tags comprises: enabling the user to prioritize one or more video tags over one or more other video tags.
|
11. The method of claim 8 , wherein enabling a user to filter video tags comprises: enabling the user to prioritize one or more video tags over one or more other video tags. 12. The method of claim 11 , further comprising: causing display of one or more video tags instead of one or more other video tags based on predetermined prioritization of each video tag.
| 0.5 |
9,594,872 | 23 | 28 |
23. A method for implementing an interface terminology in a longitudinal electronic medical record, the interface terminology comprising a plurality of concepts and a plurality of descriptions, a description being an alternative way to express a concept, the method comprising: linking, in a database, each concept to two or more respective descriptions via a directed graph structure; storing, in a database, an external code set comprising a plurality of external codes; mapping each concept to a respective external code via a directed graph structure; and deploying a front-end file, the front-end file comprises a link between the descriptions and the external code set; wherein each said respective concept provides a unique terminology for a user and can be added, updated, deleted, and merged; wherein said descriptions in said database include terms used by both clinicians and patients; wherein, for each concept, one of said plurality of descriptions is a preferred description for the linked concept and one of said plurality of descriptions is a preferred consumer term for the linked concept; wherein each said concept may map to more than one of said plurality of external codes; and wherein said method for implementing an interface terminology serves the ends of capturing clinician's intent, driving financial aspects including billing, and driving analytical functions; creating a longitudinal electronic medical record by: generating a first instance of a plurality of data objects during a first encounter, said plurality of data objects comprising data elements further comprising a first instance identifier and temporal identifiers; linking a data object in said first instance to a summarization reference with a pointer, where the plurality of data objects and the summarization reference are related as part of a directed graph data structure; creating an additional instance of a plurality of data objects during a later encounter, said additional instance of a plurality of data objects comprising data elements further comprising an additional instance identifier and temporal identifier; and providing continuity for said plurality of data objects of said first instance over time by tracking a relationship between said data object of said first instance and a data object of said additional instance; tagging elements within a domain within the longitudinal electronic medical record with one or more of said plurality of descriptions; and displaying the preferred descriptions and the preferred consumer term.
|
23. A method for implementing an interface terminology in a longitudinal electronic medical record, the interface terminology comprising a plurality of concepts and a plurality of descriptions, a description being an alternative way to express a concept, the method comprising: linking, in a database, each concept to two or more respective descriptions via a directed graph structure; storing, in a database, an external code set comprising a plurality of external codes; mapping each concept to a respective external code via a directed graph structure; and deploying a front-end file, the front-end file comprises a link between the descriptions and the external code set; wherein each said respective concept provides a unique terminology for a user and can be added, updated, deleted, and merged; wherein said descriptions in said database include terms used by both clinicians and patients; wherein, for each concept, one of said plurality of descriptions is a preferred description for the linked concept and one of said plurality of descriptions is a preferred consumer term for the linked concept; wherein each said concept may map to more than one of said plurality of external codes; and wherein said method for implementing an interface terminology serves the ends of capturing clinician's intent, driving financial aspects including billing, and driving analytical functions; creating a longitudinal electronic medical record by: generating a first instance of a plurality of data objects during a first encounter, said plurality of data objects comprising data elements further comprising a first instance identifier and temporal identifiers; linking a data object in said first instance to a summarization reference with a pointer, where the plurality of data objects and the summarization reference are related as part of a directed graph data structure; creating an additional instance of a plurality of data objects during a later encounter, said additional instance of a plurality of data objects comprising data elements further comprising an additional instance identifier and temporal identifier; and providing continuity for said plurality of data objects of said first instance over time by tracking a relationship between said data object of said first instance and a data object of said additional instance; tagging elements within a domain within the longitudinal electronic medical record with one or more of said plurality of descriptions; and displaying the preferred descriptions and the preferred consumer term. 28. The method according to claim 23 , wherein each concept includes a description that is the same as that concept.
| 0.854637 |
8,676,731 | 5 | 18 |
5. In an automated data extraction environment, a non-transitory computer readable storage medium having instructions that when executed by a processor responsive to the instructions, perform a method of generating a confidence attribute comprising: scanning a set of data items, each data item corresponding to a control data value; generating, in a series of transformations, a recognized value from the scanned data item, the series of transformations defining a combined sequence from an input stream of data form to a final data value to convert the scanned data item to the recognized value, each of the transformations in the series converting the data item to a different form of the recognized value; determining, for each of the transformations, a component confidence, the component confidence indicative of a likelihood of accurate conversion from an input form to the different form; combining each of the component confidences determined for a particular data item in a weighted manner using a non-linear statistical model to generate a final confidence; and comparing, in a learning mode, the recognized value from a final transformation of the data item to the corresponding control data value, the recognized value defining a business relevant data value, the final confidence being indicative of the data value being a true representation of the original value in the input data stream.
|
5. In an automated data extraction environment, a non-transitory computer readable storage medium having instructions that when executed by a processor responsive to the instructions, perform a method of generating a confidence attribute comprising: scanning a set of data items, each data item corresponding to a control data value; generating, in a series of transformations, a recognized value from the scanned data item, the series of transformations defining a combined sequence from an input stream of data form to a final data value to convert the scanned data item to the recognized value, each of the transformations in the series converting the data item to a different form of the recognized value; determining, for each of the transformations, a component confidence, the component confidence indicative of a likelihood of accurate conversion from an input form to the different form; combining each of the component confidences determined for a particular data item in a weighted manner using a non-linear statistical model to generate a final confidence; and comparing, in a learning mode, the recognized value from a final transformation of the data item to the corresponding control data value, the recognized value defining a business relevant data value, the final confidence being indicative of the data value being a true representation of the original value in the input data stream. 18. The method of claim 5 wherein the confidence model defines, for each transformation, a relative weight toward the final confidence for a particular data item based on the confidence component from each transformation.
| 0.890377 |
8,370,361 | 8 | 10 |
8. The method of claim 1 , wherein the first and second unsupervised clustering includes agglomerative partitional clustering of said organization entities, said organization entities comprising constituent string tokens; wherein the threshold for the similarity of pairs of organization entities is a fixed value determined using edit distance; and wherein the threshold for similarity of constituent string tokens is a variable value determined using a local sequence alignment algorithm.
|
8. The method of claim 1 , wherein the first and second unsupervised clustering includes agglomerative partitional clustering of said organization entities, said organization entities comprising constituent string tokens; wherein the threshold for the similarity of pairs of organization entities is a fixed value determined using edit distance; and wherein the threshold for similarity of constituent string tokens is a variable value determined using a local sequence alignment algorithm. 10. The method of claim 8 , wherein the edit distance algorithm is a form of a Levenshtein distance.
| 0.73822 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.