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
1
9,311,476
8
11
8. A system for detecting masquerade attacks, the system comprising: at least one hardware processor that is configured to: monitor a first plurality of user actions in a computing environment; generate a user intent model based on the first plurality of user actions; monitor a second plurality of user actions in the computing environment; determine whether at least one of the second plurality of user actions deviates from the generated user intent model; determine whether the second plurality of user actions include performing an action on a file in the computing environment that contains decoy information in response to determining that at least one of the second plurality of user actions deviates from the generated user intent model; and generate an alert in response to determining that the second plurality of user actions include performing an action on a file in the computing environment that contains decoy information.
8. A system for detecting masquerade attacks, the system comprising: at least one hardware processor that is configured to: monitor a first plurality of user actions in a computing environment; generate a user intent model based on the first plurality of user actions; monitor a second plurality of user actions in the computing environment; determine whether at least one of the second plurality of user actions deviates from the generated user intent model; determine whether the second plurality of user actions include performing an action on a file in the computing environment that contains decoy information in response to determining that at least one of the second plurality of user actions deviates from the generated user intent model; and generate an alert in response to determining that the second plurality of user actions include performing an action on a file in the computing environment that contains decoy information. 11. The system of claim 8 , wherein the hardware processor is further configured to calculate a first Hellinger distance between a first frequency table that models the first plurality of user actions and a second frequency table that models the second plurality of user actions.
0.659756
9,311,386
24
27
24. The non-transitory computer readable medium of claim 19 , wherein an interest level of the user among the hierarchy of categories is inferred based on the first adjusted category score vector.
24. The non-transitory computer readable medium of claim 19 , wherein an interest level of the user among the hierarchy of categories is inferred based on the first adjusted category score vector. 27. The non-transitory computer readable medium of claim 24 , wherein the second network resource is separate from the plurality of network resources and has not been used by the user, and wherein the plurality of edges further represents the measure of cross-references between the second resource description data record and the plurality of resource description data collections.
0.925478
5,550,928
1
3
1. An image recognition apparatus for passively identifying individuals in a monitored area comprising: means for storing a first set of reference facial image signatures wherein each reference facial image signature in the first set corresponds to a predetermined one of said individuals and is formed from an initial image of a predetermined individual by a first facial recognition methodology; means for storing a second set of reference facial image signatures wherein each reference facial image signature in the second set corresponds to a predetermined one of said individuals and is formed from an initial image of a predetermined individual by a second facial recognition methodology which is different from the first facial recognition methodology; image capturing means for capturing video images of a monitored area; means for extracting a first current facial image signature from the video image by processing the video images and by utilizing the first facial recognition methodology and for providing a first set of identity-indicating scores by comparing the first current facial image signature to each reference facial image signature of the first set of reference facial image signatures; means for extracting a second current facial image signature from the video image by processing the video images and by utilizing the second facial recognition methodology and for providing a second set of identity-indicating scores by comparing the second current facial image signature to each reference facial image signature of the second set of reference facial image signatures; and, means for fusing the first and second sets of identity-indicating scores to form a set of composite identity-indicating scores from which individuals may be identified.
1. An image recognition apparatus for passively identifying individuals in a monitored area comprising: means for storing a first set of reference facial image signatures wherein each reference facial image signature in the first set corresponds to a predetermined one of said individuals and is formed from an initial image of a predetermined individual by a first facial recognition methodology; means for storing a second set of reference facial image signatures wherein each reference facial image signature in the second set corresponds to a predetermined one of said individuals and is formed from an initial image of a predetermined individual by a second facial recognition methodology which is different from the first facial recognition methodology; image capturing means for capturing video images of a monitored area; means for extracting a first current facial image signature from the video image by processing the video images and by utilizing the first facial recognition methodology and for providing a first set of identity-indicating scores by comparing the first current facial image signature to each reference facial image signature of the first set of reference facial image signatures; means for extracting a second current facial image signature from the video image by processing the video images and by utilizing the second facial recognition methodology and for providing a second set of identity-indicating scores by comparing the second current facial image signature to each reference facial image signature of the second set of reference facial image signatures; and, means for fusing the first and second sets of identity-indicating scores to form a set of composite identity-indicating scores from which individuals may be identified. 3. The image recognition apparatus of claim 1 wherein the second set of reference facial image signatures are reference Eigenface signatures and wherein the means for extracting a second current facial image signature comprises means for extracting a current image Eigenface signature and for providing the second set of identity-indicating scores by comparing the current image Eigenface signature to each of the reference Eigenface signatures.
0.628548
8,768,766
11
12
11. The system of claim 1 , wherein the processor is programmed for analyzing secondary data.
11. The system of claim 1 , wherein the processor is programmed for analyzing secondary data. 12. The system of claim 11 , wherein the secondary data comprises information regarding any of a target audience and a locality.
0.985956
9,621,624
1
4
1. A system for inserting content, the system comprising: a processor; and a memory, wherein the memory stores instructions that, when executed by the processor, cause the processor to: analyze elements of a conversation taking place at a first destination to detect elements relating to expression of need for information in the conversation; identify a pool of one or more candidate second destinations based on relevance of the second destinations to the expression of need for information in the conversation; identify a pool of one or more candidate templates relevant to the pool of one or more candidate second destinations; construct a set of candidate creatives by combining one or more of the pool of candidate templates with one or more of the candidate second destinations; score the set of candidate creatives for relevance to the expression of need for information; select at least one of the set of candidate creatives based on the scoring for presentation at the first destination; and insert the selected one of the set of candidate creatives at the first destination.
1. A system for inserting content, the system comprising: a processor; and a memory, wherein the memory stores instructions that, when executed by the processor, cause the processor to: analyze elements of a conversation taking place at a first destination to detect elements relating to expression of need for information in the conversation; identify a pool of one or more candidate second destinations based on relevance of the second destinations to the expression of need for information in the conversation; identify a pool of one or more candidate templates relevant to the pool of one or more candidate second destinations; construct a set of candidate creatives by combining one or more of the pool of candidate templates with one or more of the candidate second destinations; score the set of candidate creatives for relevance to the expression of need for information; select at least one of the set of candidate creatives based on the scoring for presentation at the first destination; and insert the selected one of the set of candidate creatives at the first destination. 4. The system of claim 1 , wherein each template includes at least one of an introduction and a call to action, and the second destination comprises a landing page.
0.703971
9,330,664
7
8
7. A method for a voice-controlled device, comprising: detecting, with an environment detector, an environment to obtain an environmental parameter associated with a volume value; setting, with a setting module, a threshold according the environmental parameter, wherein the threshold is set to a higher threshold when the volume value is higher and the threshold is set to a lower threshold when the volume value is lower; receiving a speech, and performing speech recognition on the speech to generate a confidence score of speech recognition; and comparing the confidence score of speech recognition with the threshold to generate a control signal.
7. A method for a voice-controlled device, comprising: detecting, with an environment detector, an environment to obtain an environmental parameter associated with a volume value; setting, with a setting module, a threshold according the environmental parameter, wherein the threshold is set to a higher threshold when the volume value is higher and the threshold is set to a lower threshold when the volume value is lower; receiving a speech, and performing speech recognition on the speech to generate a confidence score of speech recognition; and comparing the confidence score of speech recognition with the threshold to generate a control signal. 8. The method according to claim 7 , wherein the environmental parameter is a volume value of a speaker of the voice-controlled device which is controlled by a user.
0.747706
8,909,667
1
22
1. A method of generating media item recommendations, the method comprising: using at least a processor and memory of a computing device for: obtaining play schedules associated with a plurality of other computing devices, the other computing devices currently playing or recently having played a reference media item, at least one of the play schedules comprising media items scheduled to be played and recently played media items; determining recommendation scores for candidate media items contained in the play schedules; and generating a media item recommendation for the reference media item based on the recommendation scores.
1. A method of generating media item recommendations, the method comprising: using at least a processor and memory of a computing device for: obtaining play schedules associated with a plurality of other computing devices, the other computing devices currently playing or recently having played a reference media item, at least one of the play schedules comprising media items scheduled to be played and recently played media items; determining recommendation scores for candidate media items contained in the play schedules; and generating a media item recommendation for the reference media item based on the recommendation scores. 22. The method of claim 1 , wherein the reference media item is the media item currently being played by the computing device requesting the media item recommendation.
0.586634
8,666,931
1
8
1. A computer-implemented method for implementing regular expression matching using ternary content-addressable memory devices, comprising: receiving a set of regular expressions that specify characters to be extracted from data packets; constructing a deterministic finite automaton from the set of regular expressions; building a state transition table for each node of the deterministic finite automaton, the table having an input field having a fixed number of bits for encoding characters to be extracted from data packets, by constructing a space reduction graph from the deterministic finite automaton, where vertices of the graph represent a distinct state of the automaton and weight assigned to each edge of the graph is a number of common transitions between two connected states; trimming away edges in the graph having a weight below a predefined threshold; computing a deferment forest by finding a maximum weight spanning forest for the space reduction graph; and assigning identifiers of source states and destination states for states of the deferment forest; combining the state transition tables into a single lookup table; instantiating the lookup table in a ternary content-addressable memory device, wherein assigning identifiers further comprises constructing an assignment tree by adding a virtual root node whose children are root nodes of all deferment trees comprising the deferment forest; assigning nonzero binary identifiers to each node in the assignment tree such that all siblings have the same identifier; setting source state identifiers for each node in the assignment tree such that a source state identifier of a given node is set to a concatenation of the binary identifiers assigned to the given node and its parent nodes; identifying longest source state identifier from amongst the nodes in the assignment tree and padding remaining source state identifiers with trailing wildcard bits; and setting destination state identifiers for each node in the assignment tree such that a destination state identifier of a given node is set to corresponding source state identifier for the given node with trailing wildcard bits replaced by zeros.
1. A computer-implemented method for implementing regular expression matching using ternary content-addressable memory devices, comprising: receiving a set of regular expressions that specify characters to be extracted from data packets; constructing a deterministic finite automaton from the set of regular expressions; building a state transition table for each node of the deterministic finite automaton, the table having an input field having a fixed number of bits for encoding characters to be extracted from data packets, by constructing a space reduction graph from the deterministic finite automaton, where vertices of the graph represent a distinct state of the automaton and weight assigned to each edge of the graph is a number of common transitions between two connected states; trimming away edges in the graph having a weight below a predefined threshold; computing a deferment forest by finding a maximum weight spanning forest for the space reduction graph; and assigning identifiers of source states and destination states for states of the deferment forest; combining the state transition tables into a single lookup table; instantiating the lookup table in a ternary content-addressable memory device, wherein assigning identifiers further comprises constructing an assignment tree by adding a virtual root node whose children are root nodes of all deferment trees comprising the deferment forest; assigning nonzero binary identifiers to each node in the assignment tree such that all siblings have the same identifier; setting source state identifiers for each node in the assignment tree such that a source state identifier of a given node is set to a concatenation of the binary identifiers assigned to the given node and its parent nodes; identifying longest source state identifier from amongst the nodes in the assignment tree and padding remaining source state identifiers with trailing wildcard bits; and setting destination state identifiers for each node in the assignment tree such that a destination state identifier of a given node is set to corresponding source state identifier for the given node with trailing wildcard bits replaced by zeros. 8. The method of claim 1 further comprises modifying the lookup table so that the input field is enlarged to accommodate multiple sub-fields, where each sub-field having the fixed number of bits, and the decision includes an identifier for a decision state and a stride length indicating a number of characters consumed in a table lookup.
0.504399
8,335,787
17
18
17. The system of claim 16 wherein each document comprises an index, and the evaluation module produces a sorted list of document indices that include the at least one seed word based on relevance to the at least one seed word, and identifies at least one key topic document index that is highly relevant to at least one seed word.
17. The system of claim 16 wherein each document comprises an index, and the evaluation module produces a sorted list of document indices that include the at least one seed word based on relevance to the at least one seed word, and identifies at least one key topic document index that is highly relevant to at least one seed word. 18. The system of claim 17 wherein the relevance of a document index is evaluated by comparison of the at least one seed word to the title of each document and keywords contained within each document index.
0.915781
9,477,656
5
6
5. A non-transitory computer readable media encoded with instructions that are operable, when executed by one or more computers, to cause the one or more computers to perform operations comprising: retrieving, by an information retrieval system comprising one or more computers, a group of documents over a network, each document in the group of documents being located at a respective network location; identifying links occurring in the group of documents, wherein each link occurring in the group of documents has associated anchor text and points to a network location of another document in the group of documents; translating, by one or more translation engines installed on one or more computers of the information retrieval system, each document in the group of documents into each of a plurality of target languages using a respective context-specific translation model for each of the target languages to generate a respective translated document in each target language for each of the documents in the group, wherein the context of each respective context-specific translation model depends at least in part on the anchor text of one or more of the identified links pointing to the document; translating, by one or more translation engines, into each of the target languages the anchor text of the links pointing to documents in the group to generate translated anchor texts; indexing the translated anchor texts; indexing the documents in the group and the translated documents; receiving, over the network by a search engine installed on the one or more computers of the information retrieval system, a query in a first language, the first language being one of the target languages, after the translating and indexing of the documents and the anchor texts; and searching, by the search engine, the documents in the group that are in the first language, the translated documents that are in the first language, and the translated anchor texts that are in the first language to identify documents responsive to the query.
5. A non-transitory computer readable media encoded with instructions that are operable, when executed by one or more computers, to cause the one or more computers to perform operations comprising: retrieving, by an information retrieval system comprising one or more computers, a group of documents over a network, each document in the group of documents being located at a respective network location; identifying links occurring in the group of documents, wherein each link occurring in the group of documents has associated anchor text and points to a network location of another document in the group of documents; translating, by one or more translation engines installed on one or more computers of the information retrieval system, each document in the group of documents into each of a plurality of target languages using a respective context-specific translation model for each of the target languages to generate a respective translated document in each target language for each of the documents in the group, wherein the context of each respective context-specific translation model depends at least in part on the anchor text of one or more of the identified links pointing to the document; translating, by one or more translation engines, into each of the target languages the anchor text of the links pointing to documents in the group to generate translated anchor texts; indexing the translated anchor texts; indexing the documents in the group and the translated documents; receiving, over the network by a search engine installed on the one or more computers of the information retrieval system, a query in a first language, the first language being one of the target languages, after the translating and indexing of the documents and the anchor texts; and searching, by the search engine, the documents in the group that are in the first language, the translated documents that are in the first language, and the translated anchor texts that are in the first language to identify documents responsive to the query. 6. The non-transitory computer readable media of claim 5 , wherein: each document in the group of documents is a page on a respective web site and the context of each respective context-specific translation model depends on the text of all the pages on the web site or the text of pages that are linked to directly or indirectly from the document.
0.501437
7,792,675
5
7
5. A method for automatic merging of multiple time-stamped transcriptions comprising the steps of: transferring a signal having timestamp information encoded therein to a splitter; the splitter yielding a mixed audio output having resultant corresponding audio channels; transferring the mixed audio output to a transcriber server; the transcriber server thereby yielding one or more text outputs; and, the text outputs being merged by a merging utility with the timestamps included in the signal thereby providing a single text file.
5. A method for automatic merging of multiple time-stamped transcriptions comprising the steps of: transferring a signal having timestamp information encoded therein to a splitter; the splitter yielding a mixed audio output having resultant corresponding audio channels; transferring the mixed audio output to a transcriber server; the transcriber server thereby yielding one or more text outputs; and, the text outputs being merged by a merging utility with the timestamps included in the signal thereby providing a single text file. 7. The method for automatic merging of multiple time-stamped transcriptions according to claim 5 wherein the merging utility operates separate from the transcriber server.
0.770161
9,875,297
4
5
4. The method of claim 1 , further comprising determining the at least one task associated with the task suggestion.
4. The method of claim 1 , further comprising determining the at least one task associated with the task suggestion. 5. The method of claim 4 , wherein determining the at least one task comprises determining the at least one task based on one or more terms of the task suggestion.
0.953535
8,260,583
1
4
1. A method for identifying wall features in an object model represented in a CAD system, comprising: loading an object model in a CAD system; receiving a selection of a first face of the object model by the CAD system; finding candidate wall faces by the CAD system and storing the candidate wall faces in a candidate list; designating at least one candidate wall face in the candidate list as a counterpart face to the first face based on at least one of geometric conditions, spatial proximity, or topological proximity; and storing the first face and the counterpart faces in the CAD system as a wall of the object model.
1. A method for identifying wall features in an object model represented in a CAD system, comprising: loading an object model in a CAD system; receiving a selection of a first face of the object model by the CAD system; finding candidate wall faces by the CAD system and storing the candidate wall faces in a candidate list; designating at least one candidate wall face in the candidate list as a counterpart face to the first face based on at least one of geometric conditions, spatial proximity, or topological proximity; and storing the first face and the counterpart faces in the CAD system as a wall of the object model. 4. The method of claim 1 , wherein finding candidate wall faces includes determining if the first face has opposing normal vectors as a second face.
0.650943
8,892,186
30
31
30. The non-transitory computer readable medium of claim 28 , wherein the computer executable instructions defining the step of initializing a catheter electrode model in a first frame of a fluoroscopic image sequence based on input locations of a plurality of CS catheter electrodes in the first frame comprise computer executable instructions defining the steps of: determining a number of CS catheter electrodes in the first frame; and if the number of CS catheter electrodes in the first frame is greater than a threshold, decomposing the plurality of CS catheter electrodes into multiple parts, and initializing separate catheter electrode models in the first frame for the multiple parts, wherein the catheter electrode model initialized in the first frame comprises the separate catheter electrode models initialized for the multiple parts.
30. The non-transitory computer readable medium of claim 28 , wherein the computer executable instructions defining the step of initializing a catheter electrode model in a first frame of a fluoroscopic image sequence based on input locations of a plurality of CS catheter electrodes in the first frame comprise computer executable instructions defining the steps of: determining a number of CS catheter electrodes in the first frame; and if the number of CS catheter electrodes in the first frame is greater than a threshold, decomposing the plurality of CS catheter electrodes into multiple parts, and initializing separate catheter electrode models in the first frame for the multiple parts, wherein the catheter electrode model initialized in the first frame comprises the separate catheter electrode models initialized for the multiple parts. 31. The non-transitory computer readable medium of claim 30 , wherein the computer executable instructions defining the step of decomposing the plurality of CS catheter electrodes into multiple parts comprise computer executable instructions defining the step of: splitting the CS catheter electrodes into multiple parts based on curvature of a spline representing the CS catheter.
0.895674
9,830,912
9
16
9. A computing device configured to provide a multimodal interface for entering input, the computing device comprising: a hardware input mechanism; a hardware audio unit; a computer storage medium storing computer-readable components comprising computer-readable instructions: a processor configured to execute the computer-readable instructions, the computer-readable components comprising: a key-input module configured to collect one or more key inputs entered by a user using the hardware input mechanism; an audio-input module configured to collect, in parallel with the key inputs, one or more speech samples spoken by the user using the hardware audio unit; a multimodal module that dynamically reduces a vocabulary as key inputs are entered, but waits for performing speech recognition until an end of utterance indicator is entered, the vocabulary is dynamically reduced based on the key inputs and on a classification type associated with the key inputs, wherein one classification type includes the end of word indicator that is not a letter, and, upon receiving the end of word indicator, obtains and stores the key inputs and an utterance detected segment from the one or more speech samples, wherein the utterance detected segment comprises speech samples spoken by the user corresponding to the word, and performs speech recognition when the end of word indicator is received on the utterance detected segment using a current state of the dynamically reduced vocabulary.
9. A computing device configured to provide a multimodal interface for entering input, the computing device comprising: a hardware input mechanism; a hardware audio unit; a computer storage medium storing computer-readable components comprising computer-readable instructions: a processor configured to execute the computer-readable instructions, the computer-readable components comprising: a key-input module configured to collect one or more key inputs entered by a user using the hardware input mechanism; an audio-input module configured to collect, in parallel with the key inputs, one or more speech samples spoken by the user using the hardware audio unit; a multimodal module that dynamically reduces a vocabulary as key inputs are entered, but waits for performing speech recognition until an end of utterance indicator is entered, the vocabulary is dynamically reduced based on the key inputs and on a classification type associated with the key inputs, wherein one classification type includes the end of word indicator that is not a letter, and, upon receiving the end of word indicator, obtains and stores the key inputs and an utterance detected segment from the one or more speech samples, wherein the utterance detected segment comprises speech samples spoken by the user corresponding to the word, and performs speech recognition when the end of word indicator is received on the utterance detected segment using a current state of the dynamically reduced vocabulary. 16. The computing device of claim 9 , wherein if the classification type for the key inputs includes an object, a vocabulary associated with the object is dynamically activated as the vocabulary.
0.833048
8,606,786
14
16
14. A system comprising: a processor; and a memory that comprises a plurality of components that are executed by the processor, the plurality of components comprising: a receiver component that receives a dataset that is stored in a computer-readable medium of a computing device, wherein the dataset comprises a plurality of queries issued by users to a search engine and a plurality of search results selected by the users upon issuing the plurality of queries; a distribution determiner component that determines click distributions over the search results selected by the users with respect to the plurality of queries; a labeler component that receives click distributions over the search results for query pairs and computes a measure of similarity between queries in each query pair based at least in part upon the click distributions over the search results, the measure of similarity being a cosine similarity of click distributions over respective sets of search results for the queries in each query pair, wherein labeler component computes the measure of similarity between a first query and a second query based at least in part upon a first probability that a first searcher that issued the first query will select a first search result, and a second probability that a second searcher that issued the second query will select the first search result, wherein the first probability and the second probability are computed based at least in part upon the click distributions over the search results for the first query and the second query; a seed selector component that selects, as a seed query, a query most often issued by users of the search engine from unclustered queries in the plurality of queries; and a clusterer component that generates a cluster of queries from the unclustered queries based at least in part upon the seed query and measures of similarity between the seed query and other respective queries in the unclustered queries, wherein the seed selector component and the clusterer component repeat acts of selecting seed queries and clustering queries until there are no unclustered queries in the plurality of queries.
14. A system comprising: a processor; and a memory that comprises a plurality of components that are executed by the processor, the plurality of components comprising: a receiver component that receives a dataset that is stored in a computer-readable medium of a computing device, wherein the dataset comprises a plurality of queries issued by users to a search engine and a plurality of search results selected by the users upon issuing the plurality of queries; a distribution determiner component that determines click distributions over the search results selected by the users with respect to the plurality of queries; a labeler component that receives click distributions over the search results for query pairs and computes a measure of similarity between queries in each query pair based at least in part upon the click distributions over the search results, the measure of similarity being a cosine similarity of click distributions over respective sets of search results for the queries in each query pair, wherein labeler component computes the measure of similarity between a first query and a second query based at least in part upon a first probability that a first searcher that issued the first query will select a first search result, and a second probability that a second searcher that issued the second query will select the first search result, wherein the first probability and the second probability are computed based at least in part upon the click distributions over the search results for the first query and the second query; a seed selector component that selects, as a seed query, a query most often issued by users of the search engine from unclustered queries in the plurality of queries; and a clusterer component that generates a cluster of queries from the unclustered queries based at least in part upon the seed query and measures of similarity between the seed query and other respective queries in the unclustered queries, wherein the seed selector component and the clusterer component repeat acts of selecting seed queries and clustering queries until there are no unclustered queries in the plurality of queries. 16. The system of claim 14 , wherein the dataset comprises a session click graph.
0.940089
7,945,600
1
8
1. A method comprising: generating, by a computer system, a summary representation for each electronic document in a plurality of electronic documents, the summary representation representing a summary of content of the electronic document; filtering, by the computer system, the plurality of electronic documents based upon their summary representations to generate a filtered subset; organizing, by the computer system, the electronic documents in the filtered subset into a hierarchical collection of folders, the organizing comprising: determining similarity metrics between the electronic documents in the filtered subset based upon their summary representations; determining concepts associated with the electronic documents in the filtered subset based upon their summary representations; and grouping the electronic documents in the filtered subset into the hierarchical collection of folders based upon the similarity metrics and the concepts; and assigning, by the computer system based upon a set of rules pertaining to document similarity, a number to each electronic document in the filtered subset by traversing the hierarchical collection of folders, such that when the electronic documents in the filtered subset are sorted based upon the assigned numbers to generate a sorted list of electronic documents, related electronic documents occur consecutively in the sorted list of electronic documents.
1. A method comprising: generating, by a computer system, a summary representation for each electronic document in a plurality of electronic documents, the summary representation representing a summary of content of the electronic document; filtering, by the computer system, the plurality of electronic documents based upon their summary representations to generate a filtered subset; organizing, by the computer system, the electronic documents in the filtered subset into a hierarchical collection of folders, the organizing comprising: determining similarity metrics between the electronic documents in the filtered subset based upon their summary representations; determining concepts associated with the electronic documents in the filtered subset based upon their summary representations; and grouping the electronic documents in the filtered subset into the hierarchical collection of folders based upon the similarity metrics and the concepts; and assigning, by the computer system based upon a set of rules pertaining to document similarity, a number to each electronic document in the filtered subset by traversing the hierarchical collection of folders, such that when the electronic documents in the filtered subset are sorted based upon the assigned numbers to generate a sorted list of electronic documents, related electronic documents occur consecutively in the sorted list of electronic documents. 8. The method of claim 1 further comprising: for at least one folder in the hierarchical collection of folders, organizing electronic documents grouped in the at least one folder into an organized list of electronic documents such that related electronic documents occur next to each other in the organized list.
0.865979
8,117,242
2
58
2. A computer program product embodied on a non-transitory computer-readable medium, comprising: code for registering a global unique user login information configured to allow access to a plurality of different online applications in association with an online application system, the different online applications including a first online application that provides access to a first one or more files stored at one or more servers associated with the first online application, a second online application that provides access to a second one or more files stored at one or more servers associated with the second online application, a third online application that provides access to a third one or more files stored at one or more servers associated with the third online application, and a fourth online application that provides access to a fourth one or more files stored at one or more servers associated with the fourth online application; code for receiving the global unique user login information in connection with a user logging in; code for identifying at least one first online application identifier associated with the first online application for registration purposes; code for identifying at least one second online application identifier associated with the second online application for registration purposes; code for identifying at least one third online application identifier associated with the third online application for registration purposes; code for identifying at least one fourth online application identifier associated with the fourth online application for registration purposes; code for receiving an indication to add access to the first online application for registration purposes; code for receiving an indication to add access to the second online application for registration purposes; code for receiving an indication to add access to the third online application for registration purposes; code for receiving an indication to add access to the fourth online application for registration purposes; code for, in connection with the at least one first online application identifier associated with the first online application, allowing registration of the first online application by: utilizing data required for the first online application, and receiving preference information associated with the first online application; code for, in connection with the at least one second online application identifier associated with the second online application, allowing registration of the second online application by: utilizing data required for the second online application, and receiving preference information associated with the second online application; code for, in connection with the at least one third online application identifier associated with the third online application, allowing registration of the third online application by: utilizing data required for the third online application, and receiving preference information associated with the third online application; code for, in connection with the at least one fourth online application identifier associated with the fourth online application, allowing registration of the fourth online application by: utilizing data required for the fourth online application, and receiving preference information associated with the fourth online application; code for displaying the at least one first online application identifier associated with the first online application for access purposes; code for displaying the at least one second online application identifier associated with the second online application for access purposes; code for displaying the at least one third online application identifier associated with the third online application for access purposes; code for displaying the at least one fourth online application identifier associated with the fourth online application for access purposes; code for receiving a selection of the at least one first online application identifier associated with the first online application for access purposes; code for receiving a selection of the at least one second online application identifier associated with the second online application for access purposes; code for receiving a selection of the at least one third online application identifier associated with the third online application for access purposes; code for receiving a selection of the at least one fourth online application identifier associated with the fourth online application for access purposes; code for, in response to the selection of the at least one first online application identifier associated with the first online application for access purposes, allowing access to the first online application, utilizing the data required for the first online application; code for, in response to the selection of the at least one second online application identifier associated with the second online application for access purposes, allowing access to the second online application, utilizing the data required for the second online application; code for, in response to the selection of the at least one third online application identifier associated with the third online application for access purposes, allowing access to the third online application, utilizing the data required for the third online application; code for, in response to the selection of the at least one fourth online application identifier associated with the fourth online application for access purposes, allowing access to the fourth online application, utilizing the data required for the fourth online application; code for identifying a document in association with the online application system; code for receiving a request from a logged-in user; code for, in response to the request, displaying an interface for receiving an indication of one or more tags, the interface including: at least one text box for receiving manually inserted tags, and a list of potential tags; code for, utilizing the interface, receiving the indication of the one or more tags; and code for correlating the one or more tags with the document.
2. A computer program product embodied on a non-transitory computer-readable medium, comprising: code for registering a global unique user login information configured to allow access to a plurality of different online applications in association with an online application system, the different online applications including a first online application that provides access to a first one or more files stored at one or more servers associated with the first online application, a second online application that provides access to a second one or more files stored at one or more servers associated with the second online application, a third online application that provides access to a third one or more files stored at one or more servers associated with the third online application, and a fourth online application that provides access to a fourth one or more files stored at one or more servers associated with the fourth online application; code for receiving the global unique user login information in connection with a user logging in; code for identifying at least one first online application identifier associated with the first online application for registration purposes; code for identifying at least one second online application identifier associated with the second online application for registration purposes; code for identifying at least one third online application identifier associated with the third online application for registration purposes; code for identifying at least one fourth online application identifier associated with the fourth online application for registration purposes; code for receiving an indication to add access to the first online application for registration purposes; code for receiving an indication to add access to the second online application for registration purposes; code for receiving an indication to add access to the third online application for registration purposes; code for receiving an indication to add access to the fourth online application for registration purposes; code for, in connection with the at least one first online application identifier associated with the first online application, allowing registration of the first online application by: utilizing data required for the first online application, and receiving preference information associated with the first online application; code for, in connection with the at least one second online application identifier associated with the second online application, allowing registration of the second online application by: utilizing data required for the second online application, and receiving preference information associated with the second online application; code for, in connection with the at least one third online application identifier associated with the third online application, allowing registration of the third online application by: utilizing data required for the third online application, and receiving preference information associated with the third online application; code for, in connection with the at least one fourth online application identifier associated with the fourth online application, allowing registration of the fourth online application by: utilizing data required for the fourth online application, and receiving preference information associated with the fourth online application; code for displaying the at least one first online application identifier associated with the first online application for access purposes; code for displaying the at least one second online application identifier associated with the second online application for access purposes; code for displaying the at least one third online application identifier associated with the third online application for access purposes; code for displaying the at least one fourth online application identifier associated with the fourth online application for access purposes; code for receiving a selection of the at least one first online application identifier associated with the first online application for access purposes; code for receiving a selection of the at least one second online application identifier associated with the second online application for access purposes; code for receiving a selection of the at least one third online application identifier associated with the third online application for access purposes; code for receiving a selection of the at least one fourth online application identifier associated with the fourth online application for access purposes; code for, in response to the selection of the at least one first online application identifier associated with the first online application for access purposes, allowing access to the first online application, utilizing the data required for the first online application; code for, in response to the selection of the at least one second online application identifier associated with the second online application for access purposes, allowing access to the second online application, utilizing the data required for the second online application; code for, in response to the selection of the at least one third online application identifier associated with the third online application for access purposes, allowing access to the third online application, utilizing the data required for the third online application; code for, in response to the selection of the at least one fourth online application identifier associated with the fourth online application for access purposes, allowing access to the fourth online application, utilizing the data required for the fourth online application; code for identifying a document in association with the online application system; code for receiving a request from a logged-in user; code for, in response to the request, displaying an interface for receiving an indication of one or more tags, the interface including: at least one text box for receiving manually inserted tags, and a list of potential tags; code for, utilizing the interface, receiving the indication of the one or more tags; and code for correlating the one or more tags with the document. 58. The computer program product of claim 2 , wherein the computer program product is configured such that the at least one first online application identifier is identified by a provider other than the user.
0.963316
9,913,098
13
14
13. An apparatus comprising: a mobile device comprising headset and a Global Positioning System (GPS)-enabled device connectable to a database from a remote location, wherein the GPS-enable device having at least a controller and a position sensor to determine a location of the mobile device and the headset including at least a digital compass being adapted to orient the mobile device pointing in a direction to intersect a particular one of an object, a geographic feature or a location of interest to a user, the controller of the GPS-enabled device being adapted to receive a thematic query from the user, the thematic query related to at least one selected theme for the particular one of the object, geographic feature, or location of interest to the user, the controller being further adapted to retrieve a portion of the geographic information from the database selected by a combination of the location of the mobile device, a pointing direction of the mobile device, the thematic query, and the geographic information is about the particular object, the geographic feature or the location.
13. An apparatus comprising: a mobile device comprising headset and a Global Positioning System (GPS)-enabled device connectable to a database from a remote location, wherein the GPS-enable device having at least a controller and a position sensor to determine a location of the mobile device and the headset including at least a digital compass being adapted to orient the mobile device pointing in a direction to intersect a particular one of an object, a geographic feature or a location of interest to a user, the controller of the GPS-enabled device being adapted to receive a thematic query from the user, the thematic query related to at least one selected theme for the particular one of the object, geographic feature, or location of interest to the user, the controller being further adapted to retrieve a portion of the geographic information from the database selected by a combination of the location of the mobile device, a pointing direction of the mobile device, the thematic query, and the geographic information is about the particular object, the geographic feature or the location. 14. The apparatus of claim 13 , further comprising: a database containing the geographic information, the database accessible via a network connection; a wireless router to connect the mobile device to the database; a display device connected to the GPS-enabled device to present the geographic information of interest to the user.
0.805979
7,934,194
10
13
10. The method of claim 6 , wherein the at least one descendant class of graphical objects includes at least one additional aspect that is not included in the first class of graphical objects.
10. The method of claim 6 , wherein the at least one descendant class of graphical objects includes at least one additional aspect that is not included in the first class of graphical objects. 13. The method of claim 10 , wherein the at least one additional aspect is a graphical affordance.
0.965614
8,577,632
17
18
17. The method of identifying complex permittivity of transmission line dielectric by executing computer-executable instructions stored on a nontransitory computer-readable medium of claim 16 , further comprising the step of selecting of dielectric model is to describe complex dielectric constant as causal and continuous function of frequency and not by just a set of points measured at different frequencies and computing a mixture model including wideband Debye model or multi-pole Debye model with finite number of poles to fit an effective dielectric constant (DK) and Loss Tangent (LT) of a dielectric mixture using Multi-pole Debye model as a simple superposition of multiple one-pole Debye models using formula for the relative dielectric constant of such material can be expressed as equation: ɛ ⁡ ( f ) = ɛ ⁡ ( ∞ ) + ∑ n = 1 N ⁢ Δ ⁢ ⁢ ɛ n 1 + i ⁢ ⁢ f f rn Wherein multi-pole Debye model with N real poles can be built by specifying N values for complex permittivity by fitting the specified data with real poles and the said model can be described by a set of the poles f rn and corresponding them residues Δ∈ n , and the value at infinite frequency ∈(∞).
17. The method of identifying complex permittivity of transmission line dielectric by executing computer-executable instructions stored on a nontransitory computer-readable medium of claim 16 , further comprising the step of selecting of dielectric model is to describe complex dielectric constant as causal and continuous function of frequency and not by just a set of points measured at different frequencies and computing a mixture model including wideband Debye model or multi-pole Debye model with finite number of poles to fit an effective dielectric constant (DK) and Loss Tangent (LT) of a dielectric mixture using Multi-pole Debye model as a simple superposition of multiple one-pole Debye models using formula for the relative dielectric constant of such material can be expressed as equation: ɛ ⁡ ( f ) = ɛ ⁡ ( ∞ ) + ∑ n = 1 N ⁢ Δ ⁢ ⁢ ɛ n 1 + i ⁢ ⁢ f f rn Wherein multi-pole Debye model with N real poles can be built by specifying N values for complex permittivity by fitting the specified data with real poles and the said model can be described by a set of the poles f rn and corresponding them residues Δ∈ n , and the value at infinite frequency ∈(∞). 18. The method of identifying complex permittivity of transmission line dielectric by executing computer-executable instructions stored on a nontransitory computer-readable medium of claim 17 , further comprising the step of computing generalized modal S-parameters of line segment difference by solving Maxwell's equations for the transmission line cross-section with possibility to choose complex permittivity model for at least one dielectric in the line cross-section; and further constructing generalized modal S-parameters of line segment with length L, for a transmission line with N modes (N-conductor line), computed as equation: S ~ ⁢ ⁢ g ⁡ ( f , l ) = [ 0 Sm Sm 0 ] , Sm = diag ⁡ ( ⅇ - Γ n ⁢ ⁡ ( f ) · l , n = 1 , … ⁢ , N ) where Γ(f)=α n (f)+i·β n (f), n=1, . . . , N are complex frequency-dependent propagation constant (Gamma) of the transmission line mode computed by solving Maxwell's equations.
0.642184
8,260,049
1
4
1. A method for determining a logical structure of a document, the method comprising: acquiring an image of the document; identifying one or more blocks in the image of the document; generating a hypothesis for at least one of the identified blocks in the image of the document (a “block hypothesis”); generating at least one document hypothesis for the image of the document, wherein said generating included referencing a plurality of document models, wherein each document model describes one or more possible logical structures, and wherein such logical structures are based on the presence of one or more blocks; selecting a document hypothesis based on its degree of correspondence with at least one block hypothesis; and forming a representation of the document based on the selected document hypothesis.
1. A method for determining a logical structure of a document, the method comprising: acquiring an image of the document; identifying one or more blocks in the image of the document; generating a hypothesis for at least one of the identified blocks in the image of the document (a “block hypothesis”); generating at least one document hypothesis for the image of the document, wherein said generating included referencing a plurality of document models, wherein each document model describes one or more possible logical structures, and wherein such logical structures are based on the presence of one or more blocks; selecting a document hypothesis based on its degree of correspondence with at least one block hypothesis; and forming a representation of the document based on the selected document hypothesis. 4. The method of claim 1 , the method further comprising: saving the representation of the document in an extended format in a memory.
0.790625
8,650,189
17
18
17. The method of claim 16 , wherein the hit sentiment score is derived by determining one or more elements in the content that convey the positive or the negative image about the target entity.
17. The method of claim 16 , wherein the hit sentiment score is derived by determining one or more elements in the content that convey the positive or the negative image about the target entity. 18. The method of claim 17 , wherein the hit sentiment score is derived by determining a correlation in the content between each of the one or more elements in the content with the target entity.
0.923649
9,747,284
3
4
3. The method of claim 2 , wherein: the glossary data is configured to associate strings in the source language with strings in the target language; the translation memory data is configured to associate strings in the source language with strings in the target language; or the source-identification rule data comprises regular expressions for identifying strings in the source language.
3. The method of claim 2 , wherein: the glossary data is configured to associate strings in the source language with strings in the target language; the translation memory data is configured to associate strings in the source language with strings in the target language; or the source-identification rule data comprises regular expressions for identifying strings in the source language. 4. The method of claim 3 , wherein: the strings associated by the glossary data are words or phrases, the strings associated by the translation memory data are translation units comprising sentences and grammatically independent translation units, the user-specific translation data is stored in at least one of: a database, a comma-separated values file, or a translation memory exchange file, and the at least one temporary textual element is a unique textual or alphanumeric token.
0.833677
5,537,622
10
11
10. A database coprocessor, as recited in claim 9, wherein said control processor further processes said database commands, with a subcommand being selectively generated for selected ones of said extractor, said Predicate Evaluator, said sort-merge unit and said hasher.
10. A database coprocessor, as recited in claim 9, wherein said control processor further processes said database commands, with a subcommand being selectively generated for selected ones of said extractor, said Predicate Evaluator, said sort-merge unit and said hasher. 11. A database coprocessor, as recited in claim 10, wherein said subcommands being selectively loadable by said control processor into selected ones of said extractor, said Predicate Evaluator, said sort-merge unit and said hasher.
0.925676
7,899,836
2
4
2. The computer program product of claim 1 , wherein the conditional expression component includes a representation of the conditional expression in a hierarchical tree format.
2. The computer program product of claim 1 , wherein the conditional expression component includes a representation of the conditional expression in a hierarchical tree format. 4. The computer program product of claim 2 , wherein the hierarchical tree format includes conditional expressions that may alternatively be satisfied being depicted as connected by dotted lines.
0.972894
9,129,606
12
16
12. A system for providing a query history expansion, the system comprising: a memory storage; and a processing unit coupled to the memory storage, wherein the processing unit is operable to: receive a plurality of previous queries associated with a user, create an adapted language model that includes interpolating previous queries associated with the user and previous queries associated with a plurality of other users that share at least one common characteristic, wherein the previous queries of the plurality of other users is identified based on queries from the plurality of other users that contain click URLs as the user's previous queries and identified based on queries of the plurality of other users that are within a threshold distance of the user's previous queries, receive a spoken query from the user, convert the spoken query into a text string and apply the created adapted language model to generate at least one result for the converted spoken query, and transmit the at least one result of the converted spoken query to the user.
12. A system for providing a query history expansion, the system comprising: a memory storage; and a processing unit coupled to the memory storage, wherein the processing unit is operable to: receive a plurality of previous queries associated with a user, create an adapted language model that includes interpolating previous queries associated with the user and previous queries associated with a plurality of other users that share at least one common characteristic, wherein the previous queries of the plurality of other users is identified based on queries from the plurality of other users that contain click URLs as the user's previous queries and identified based on queries of the plurality of other users that are within a threshold distance of the user's previous queries, receive a spoken query from the user, convert the spoken query into a text string and apply the created adapted language model to generate at least one result for the converted spoken query, and transmit the at least one result of the converted spoken query to the user. 16. The system of claim 12 , wherein the at least a subset of the second plurality of previous queries are selected according to a lexical similarity to at least one of the plurality of previous queries associated with the user.
0.785714
9,411,802
7
8
7. The method of claim 1 , wherein the performance of the joint inference in step 4 produces an SRL result on a source side and an SRL result on a target side and the joint interference is based on: a correctness of the SRL result on the source side, a correctness of the SRL result on the target side, and an argument structure consistency between the SRL results on the source side and the target side.
7. The method of claim 1 , wherein the performance of the joint inference in step 4 produces an SRL result on a source side and an SRL result on a target side and the joint interference is based on: a correctness of the SRL result on the source side, a correctness of the SRL result on the target side, and an argument structure consistency between the SRL results on the source side and the target side. 8. The method of claim 7 , wherein when considering the correctness of the SRL result on the source side or the target side, the objective is to maximize an expectation of a number of correctly labeled arguments, and a plurality of constraints comprise: 1) No duplication: There is no duplication for key arguments: A0˜A5; and 2) No overlapping: Arguments cannot overlap with each other.
0.898532
9,513,941
1
7
1. A method for generating a plurality of application programming interfaces (APIs) in a codeless manner, the method comprising: receiving a request for a plurality of APIs based on a description of a database schema; upon identifying the database schema description, generating a set of data graphs that identifies relationships between a set of data objects included in the description; generating the plurality of APIs based on the set of data graphs and providing the generated APIs to a user for selecting a subset of the plurality of APIs; and upon selection of an API, generating a JavaScript object notation based model (JSON-based model) associated with the selected API, the JSON-based model comprising a JSON file and a JavaScript (JS) file for an application to use to exchange data with the database.
1. A method for generating a plurality of application programming interfaces (APIs) in a codeless manner, the method comprising: receiving a request for a plurality of APIs based on a description of a database schema; upon identifying the database schema description, generating a set of data graphs that identifies relationships between a set of data objects included in the description; generating the plurality of APIs based on the set of data graphs and providing the generated APIs to a user for selecting a subset of the plurality of APIs; and upon selection of an API, generating a JavaScript object notation based model (JSON-based model) associated with the selected API, the JSON-based model comprising a JSON file and a JavaScript (JS) file for an application to use to exchange data with the database. 7. The method of claim 1 , wherein the database comprises a relational database (RDB).
0.908511
8,571,859
12
13
12. An article of manufacture including a non-transitory computer-readable storage medium, having stored thereon program instructions that, upon execution by a computing device, cause the computing device to perform operations comprising: selecting a first gender-specific speaker adaptation technique based on characteristics of a first set of feature vectors, wherein the first set of feature vectors correspond to a first unit of input speech, and wherein the first set of feature vectors are configured for use in automatic speech recognition (ASR) of the first unit of input speech, wherein the first gender-specific speaker adaptation technique is associated with a particular gender; modifying a second set of feature vectors based on the first gender-specific speaker adaptation technique, wherein the second set of feature vectors correspond to a second unit of input speech, and wherein the modified second set of feature vectors are configured for use in ASR of the second unit of input speech; based on characteristics of the second set of feature vectors and the first gender-specific speaker adaptation technique being associated with a particular gender, selecting a first speaker-dependent speaker adaptation technique that is associated with a particular speaker of the particular gender; and modifying a third set of feature vectors based on the first speaker-dependent speaker adaptation technique, wherein the third set of feature vectors correspond to a third unit of input speech, and wherein the modified third set of feature vectors are configured for use in ASR of the third unit of input speech.
12. An article of manufacture including a non-transitory computer-readable storage medium, having stored thereon program instructions that, upon execution by a computing device, cause the computing device to perform operations comprising: selecting a first gender-specific speaker adaptation technique based on characteristics of a first set of feature vectors, wherein the first set of feature vectors correspond to a first unit of input speech, and wherein the first set of feature vectors are configured for use in automatic speech recognition (ASR) of the first unit of input speech, wherein the first gender-specific speaker adaptation technique is associated with a particular gender; modifying a second set of feature vectors based on the first gender-specific speaker adaptation technique, wherein the second set of feature vectors correspond to a second unit of input speech, and wherein the modified second set of feature vectors are configured for use in ASR of the second unit of input speech; based on characteristics of the second set of feature vectors and the first gender-specific speaker adaptation technique being associated with a particular gender, selecting a first speaker-dependent speaker adaptation technique that is associated with a particular speaker of the particular gender; and modifying a third set of feature vectors based on the first speaker-dependent speaker adaptation technique, wherein the third set of feature vectors correspond to a third unit of input speech, and wherein the modified third set of feature vectors are configured for use in ASR of the third unit of input speech. 13. The article of manufacture of claim 12 , the operations further comprising: determining that (i) the third unit of input speech was originated proximate to a particular location, and (ii) the particular speaker is also associated with an environment-specific, speaker-dependent speaker adaptation technique, wherein the environment-specific, speaker-dependent speaker adaptation technique is associated with the particular location; selecting the environment-specific, speaker-dependent speaker adaptation technique; and modifying a fourth set of feature vectors based on the environment-specific, speaker-dependent speaker adaptation technique, wherein the fourth set of feature vectors correspond to a fourth unit of input speech, and wherein the modified fourth set of feature vectors are configured for use in ASR of the fourth unit of input speech.
0.533224
8,086,463
7
9
7. Apparatus for dynamically generating a vocal help prompt in a multimodal application, the apparatus comprising: a computer processor; and a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, perform a method comprising: detecting a help-triggering event for an input element of a VoiceXML dialog, wherein the help-triggering event is selected from the group consisting of a request by a user for help, speech input that does not match any active grammar, and no speech input being received for a specified period of time, the detecting implemented with the multimodal application operating on a multimodal device supporting multiple modes of interaction including a voice mode and one or more non-voice modes, the multimodal application operatively coupled to a VoiceXML interpreter; retrieving, by the VoiceXML interpreter from a speech recognition grammar updated based on a changing information source, retrieved help text, associated with at least one non-terminal element of the speech recognition grammar and at least one terminal element of the speech recognition grammar, wherein the at least one non-terminal element includes a reference to at least one other element of the speech recognition grammar, wherein at least some of the help text is not hard-coded by a programmer of the multimodal application. forming, by the VoiceXML interpreter, the retrieved help text into a vocal help prompt; and presenting by the multimodal application the vocal help prompt through a computer user interface to a user.
7. Apparatus for dynamically generating a vocal help prompt in a multimodal application, the apparatus comprising: a computer processor; and a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, perform a method comprising: detecting a help-triggering event for an input element of a VoiceXML dialog, wherein the help-triggering event is selected from the group consisting of a request by a user for help, speech input that does not match any active grammar, and no speech input being received for a specified period of time, the detecting implemented with the multimodal application operating on a multimodal device supporting multiple modes of interaction including a voice mode and one or more non-voice modes, the multimodal application operatively coupled to a VoiceXML interpreter; retrieving, by the VoiceXML interpreter from a speech recognition grammar updated based on a changing information source, retrieved help text, associated with at least one non-terminal element of the speech recognition grammar and at least one terminal element of the speech recognition grammar, wherein the at least one non-terminal element includes a reference to at least one other element of the speech recognition grammar, wherein at least some of the help text is not hard-coded by a programmer of the multimodal application. forming, by the VoiceXML interpreter, the retrieved help text into a vocal help prompt; and presenting by the multimodal application the vocal help prompt through a computer user interface to a user. 9. The apparatus of claim 7 wherein: the grammar includes two or more alternative terminal elements; and retrieving help text further comprises retrieving, for use as help text, text from a number of the alternative terminal elements, the number limited by a predefined maximum.
0.501792
9,251,206
13
14
13. The system of claim 9 , wherein the operations further comprise: receiving a current query and a plurality of suggested queries, each of the current and suggested queries including one or more terms; for each suggested query: calculating a transition cost between the suggested query and the current query based on a transition cost of a current term and a suggested term; and selecting a suggested query from the plurality of suggested queries based on the edit distance.
13. The system of claim 9 , wherein the operations further comprise: receiving a current query and a plurality of suggested queries, each of the current and suggested queries including one or more terms; for each suggested query: calculating a transition cost between the suggested query and the current query based on a transition cost of a current term and a suggested term; and selecting a suggested query from the plurality of suggested queries based on the edit distance. 14. The system of claim 13 , wherein the calculating the edit distance comprises: identifying a value in a cost matrix based on a substitution query pair including the current term and the suggested term.
0.942857
7,805,310
6
11
6. A method of implementing voice-enabled applications in a converged voice and data network IP environment that supports and implements VoIP connections, protocols and traffic, comprising: a. entering human voice data as data packets from a speaker into a converged VoIP voice and data packet-switched IP based network for later processing and acoustic matching; b. non-intrusively processing the voice data from an end user biometrically while the end user is speaking into the converged VoIP voice and data packet-switched IP based network; c. preparing the voice data for VoIP speech processing function with a front-end processing module to separate the pauses in the speech from the voice data and utilizing a voice feature extraction module to ready the speech for a processing algorithm from a speech engine; d. synchronizing generated control information with a data exchange between a data preparation module and the speech engine through a speech application interface; e. processing the voice features by the speech engine to perform at least one combination of the speech processing and pattern recognition algorithms implemented by the speech engine; f. providing feedback to the end user to communicate the result from the speech processing; and g. taking an action responsive to the result from the processing of the voice.
6. A method of implementing voice-enabled applications in a converged voice and data network IP environment that supports and implements VoIP connections, protocols and traffic, comprising: a. entering human voice data as data packets from a speaker into a converged VoIP voice and data packet-switched IP based network for later processing and acoustic matching; b. non-intrusively processing the voice data from an end user biometrically while the end user is speaking into the converged VoIP voice and data packet-switched IP based network; c. preparing the voice data for VoIP speech processing function with a front-end processing module to separate the pauses in the speech from the voice data and utilizing a voice feature extraction module to ready the speech for a processing algorithm from a speech engine; d. synchronizing generated control information with a data exchange between a data preparation module and the speech engine through a speech application interface; e. processing the voice features by the speech engine to perform at least one combination of the speech processing and pattern recognition algorithms implemented by the speech engine; f. providing feedback to the end user to communicate the result from the speech processing; and g. taking an action responsive to the result from the processing of the voice. 11. The method of claim 6 , wherein the step of providing the feedback to the end user is accomplished by using a graphical interface on a screen of a device selected from the group consisting of a computer, a mobile phone, a personal handheld device and a specialized hardware, said graphical interface displaying written messages as prompts and results from the speech processing operation.
0.744125
7,598,942
50
74
50. The method of claim 43 , wherein controlling the component comprises controlling a three-space object through three translational degrees of freedom and three rotational degrees of freedom.
50. The method of claim 43 , wherein controlling the component comprises controlling a three-space object through three translational degrees of freedom and three rotational degrees of freedom. 74. The method of claim 50 , wherein the detecting comprises detecting when an extrapolated position of the object intersects virtual space, wherein the virtual space comprises space depicted on a display device coupled to the computer.
0.80937
9,690,768
1
7
1. A method for annotating a video, comprising: displaying by a computer on a device a video player graphical user interface, the user interface including a display area for presenting a video and associated control buttons, the video including a plurality of annotated intervals; displaying, by the computer, a timeline associated with the video; displaying, by the computer in the display area, a frame of the video ; receiving, by the computer, a user selection of a region of the displayed frame; responsive to receiving the selection of the region, displaying, by the computer in the displayed frame, an annotation definition image indicating the selected region; receiving, by the computer, a user selection of a control button to create an annotation; providing, by the computer, a display area for receiving user input of annotation content; receiving, by the computer in the display area, user input of annotation content; associating the received annotation content with the displayed frame of the video and the selected region to generate an annotated video frame; ranking the plurality of annotated intervals based on a number of annotations associated with each annotated interval; indicating on the timeline a marker associated with the annotated video frame; while displaying the timeline, displaying an annotated thumbnail associated with the annotated video frame in the user interface responsive to a user interaction with the marker; and displaying indications of ranked orders with markers associated with each of the annotated intervals on the timeline.
1. A method for annotating a video, comprising: displaying by a computer on a device a video player graphical user interface, the user interface including a display area for presenting a video and associated control buttons, the video including a plurality of annotated intervals; displaying, by the computer, a timeline associated with the video; displaying, by the computer in the display area, a frame of the video ; receiving, by the computer, a user selection of a region of the displayed frame; responsive to receiving the selection of the region, displaying, by the computer in the displayed frame, an annotation definition image indicating the selected region; receiving, by the computer, a user selection of a control button to create an annotation; providing, by the computer, a display area for receiving user input of annotation content; receiving, by the computer in the display area, user input of annotation content; associating the received annotation content with the displayed frame of the video and the selected region to generate an annotated video frame; ranking the plurality of annotated intervals based on a number of annotations associated with each annotated interval; indicating on the timeline a marker associated with the annotated video frame; while displaying the timeline, displaying an annotated thumbnail associated with the annotated video frame in the user interface responsive to a user interaction with the marker; and displaying indications of ranked orders with markers associated with each of the annotated intervals on the timeline. 7. The method of claim 1 wherein the video includes a plurality of annotated frames, and the timeline includes a plurality of markers associated with the annotated frames.
0.861201
9,015,728
10
14
10. A method of accessing runtime values of object instances, comprising: storing a plurality of executable instructions at a first software module, the plurality of executable instructions collectively configured to provide an identifier of a first object instance to a second software module stored at a memory and executed at a processor; receiving the identifier of the first object instance at the second software module in response to execution of the plurality of executable instructions; selecting, in response to the receiving, a textual object element identifier from a plurality of textual object element identifiers that are accessed at a same time, each textual object element identifier from the plurality of textual object element identifiers uniquely associated with an object element; reflectively accessing an identifier of a second object instance, the first object instance derived from the second object instance; and reflectively accessing at the second object instance the object element uniquely associated with the textual object element identifier wherein the object element is not made accessible by the first software module.
10. A method of accessing runtime values of object instances, comprising: storing a plurality of executable instructions at a first software module, the plurality of executable instructions collectively configured to provide an identifier of a first object instance to a second software module stored at a memory and executed at a processor; receiving the identifier of the first object instance at the second software module in response to execution of the plurality of executable instructions; selecting, in response to the receiving, a textual object element identifier from a plurality of textual object element identifiers that are accessed at a same time, each textual object element identifier from the plurality of textual object element identifiers uniquely associated with an object element; reflectively accessing an identifier of a second object instance, the first object instance derived from the second object instance; and reflectively accessing at the second object instance the object element uniquely associated with the textual object element identifier wherein the object element is not made accessible by the first software module. 14. The method of claim 10 , wherein the reflectively accessing at the second object instance the object element uniquely associated with the textual object element identifier is at a first time, the method further comprising: accessing, before the first time, a first permissions value at the second object instance; storing, before the first time, a second permissions value different from the first permissions value at the second object instance; and storing, after the first time, the first permissions value at the second object instance.
0.7794
9,275,640
11
13
11. The method of claim 1 , wherein accepting the new vocabulary item includes accepting a term that is present in a result set of an automatic discovery action.
11. The method of claim 1 , wherein accepting the new vocabulary item includes accepting a term that is present in a result set of an automatic discovery action. 13. The method of claim 11 , wherein the automatic discovery action comprises a speech recognition action that is performed on a subset of the set of audio signals or a disjoint set of the set of audio signals using a different vocabulary.
0.918151
10,140,975
5
6
5. The method of claim 1 , comprising: after receiving the second utterance, updating a user interface to include the first transcription and the second transcription, without updating the user interface after the given user has stopped speaking for longer than the fixed duration after the end of the first utterance to include only the first transcription.
5. The method of claim 1 , comprising: after receiving the second utterance, updating a user interface to include the first transcription and the second transcription, without updating the user interface after the given user has stopped speaking for longer than the fixed duration after the end of the first utterance to include only the first transcription. 6. The method of claim 5 , wherein the user interface is updated after the second utterance to include both the first transcription and the second transcription in response to receiving the first utterance and the second utterance.
0.942963
8,185,830
27
32
27. An article comprising a non-transitory computer-accessible medium storing instructions that are operable when executed to cause data processing apparatus to perform operations including: receiving an identification of user group configuration settings for a user group comprising a plurality of users, the user group configuration settings identifying a first plurality of content items to be retrieved from a first plurality of remote content provider servers and to be provided in a user group container document; generating the user group container document based on the user group configuration settings, the user group container document comprising a first plurality of content modules that provide the first plurality of content items from the first plurality of remote content provider servers; sending the user group container document over a public network to each of a plurality of client devices; receiving from the client devices data identifying personal configuration settings for each of the plurality of users in the user group, each of the personal configuration settings specifying a second plurality of content items to be retrieved from a second plurality of remote content provider servers and to be included in personal container documents; generating a first personal container document based on the user group configuration settings and the personal configuration settings for a first user, the container document comprising: one or more of the first plurality of content modules that provide the first plurality of content items from the first plurality of remote content provider servers; and a second plurality of content modules that provide the second plurality of content items from a second plurality of remote content provider servers.
27. An article comprising a non-transitory computer-accessible medium storing instructions that are operable when executed to cause data processing apparatus to perform operations including: receiving an identification of user group configuration settings for a user group comprising a plurality of users, the user group configuration settings identifying a first plurality of content items to be retrieved from a first plurality of remote content provider servers and to be provided in a user group container document; generating the user group container document based on the user group configuration settings, the user group container document comprising a first plurality of content modules that provide the first plurality of content items from the first plurality of remote content provider servers; sending the user group container document over a public network to each of a plurality of client devices; receiving from the client devices data identifying personal configuration settings for each of the plurality of users in the user group, each of the personal configuration settings specifying a second plurality of content items to be retrieved from a second plurality of remote content provider servers and to be included in personal container documents; generating a first personal container document based on the user group configuration settings and the personal configuration settings for a first user, the container document comprising: one or more of the first plurality of content modules that provide the first plurality of content items from the first plurality of remote content provider servers; and a second plurality of content modules that provide the second plurality of content items from a second plurality of remote content provider servers. 32. The article of claim 27 , wherein the user group configuration settings specify an authentication method to authenticate the users in the user group.
0.892405
4,471,459
21
22
21. Means according to claim 16 wherein the first and second compare type indications are formed using a query character in a first character position and a second query character in a second higher valued character position of the query word, the means for processing and utilizing comprising: means for utilizing at least the first compare type indication for forming a first tentative spelling classification indication; and means for utilizing at least the second compare type indication and the first tentative spelling classification indication for forming a second tentative spelling classification indication.
21. Means according to claim 16 wherein the first and second compare type indications are formed using a query character in a first character position and a second query character in a second higher valued character position of the query word, the means for processing and utilizing comprising: means for utilizing at least the first compare type indication for forming a first tentative spelling classification indication; and means for utilizing at least the second compare type indication and the first tentative spelling classification indication for forming a second tentative spelling classification indication. 22. Means according to claim 21 comprising means for utilizing the second tentative spelling classification indication in forming said spelling classification indication.
0.953855
8,060,869
4
8
4. The method for providing a binary instrumentation using a binary instrumentation tool to detect memory problems in runtime application executing on a computer system of claim 1 , wherein the source code includes a user provided executable code (UPE), the UPE including a function having an instruction that accesses memory, the examination of the UPE is performed through a user interface, wherein the UPE is not associated with any compiler annotations.
4. The method for providing a binary instrumentation using a binary instrumentation tool to detect memory problems in runtime application executing on a computer system of claim 1 , wherein the source code includes a user provided executable code (UPE), the UPE including a function having an instruction that accesses memory, the examination of the UPE is performed through a user interface, wherein the UPE is not associated with any compiler annotations. 8. The method for providing a binary instrumentation using a binary instrumentation tool to detect memory problems in runtime application executing on a computer system of claim 4 , wherein generating a modified executable binary code of the runtime application further including inserting the checker code associated with each function in the UPE at an appropriate location within the original executable binary code, the insertion of the checker code performed by the PED based on the memory semantic description associated with the appropriate function.
0.867808
7,584,421
26
27
26. A method implemented by a provider in a broadcasting system for updating metadata related to multimedia program content scheduled for broadcast in the broadcasting system, the method comprising: receiving by the provider a request from a client device in the broadcasting system for an updated version of a lower fragment in the metadata related to the scheduled multimedia program content, the client device storing an earlier version of the metadata, wherein the metadata has a hierarchical structure based on a prescribed syntax and the hierarchical structure includes an upper fragment above the lower fragment, and wherein the earlier version is identified by a version identifier; and in response to the request, sending from the provider to the client device an update document having a structure based on the prescribed syntax, the update document including the upper fragment and an invalid element, wherein the invalid element specifies that information in the lower fragment of the earlier version of the metadata is invalid.
26. A method implemented by a provider in a broadcasting system for updating metadata related to multimedia program content scheduled for broadcast in the broadcasting system, the method comprising: receiving by the provider a request from a client device in the broadcasting system for an updated version of a lower fragment in the metadata related to the scheduled multimedia program content, the client device storing an earlier version of the metadata, wherein the metadata has a hierarchical structure based on a prescribed syntax and the hierarchical structure includes an upper fragment above the lower fragment, and wherein the earlier version is identified by a version identifier; and in response to the request, sending from the provider to the client device an update document having a structure based on the prescribed syntax, the update document including the upper fragment and an invalid element, wherein the invalid element specifies that information in the lower fragment of the earlier version of the metadata is invalid. 27. The method of claim 26 , wherein the lower fragment of the earlier version of the metadata stored in the client device is deleted in response to the invalid element.
0.785533
9,535,908
5
6
5. The method of claim 1 wherein the document set associated with the workflow instance comprises a set of one or more documents.
5. The method of claim 1 wherein the document set associated with the workflow instance comprises a set of one or more documents. 6. The method of claim 5 wherein the retrieving of the document based on the document source activity identifier of the retrieved document, by the workflow instance, is based on a set of instructions.
0.952517
8,245,135
1
13
1. A method of producing a visual text summarization, the method comprising the steps of: extracting a plurality of topics from a collection of text documents, wherein each of the topics comprises a plurality of topic keywords; determining an importance ranking for each of the topics; determining an importance ranking for each of the topic keywords of a topic; displaying a graph having a plurality of stacked layers representing a group of topics selected from the plurality of topics based on the importance ranking of the topics; grouping a subset of text documents included in a topic, wherein the grouping is based on a grouping constraint; selecting a subset of topic keywords included in the topic, wherein the subset of topic keywords summarize a content of the subset of text documents, wherein the at least one keyword cloud displayed within each layer of the graph is the subset of topic keywords that summarize the content of the subset of text document grouped based on the grouping constraint; and displaying at least one keyword cloud within each layer of the graph, wherein the at least one keyword cloud is a group of topic keywords selected from the extracted topic keywords based on the importance ranking of the extracted topic keywords; wherein at least one of the steps is carried out using a computer device.
1. A method of producing a visual text summarization, the method comprising the steps of: extracting a plurality of topics from a collection of text documents, wherein each of the topics comprises a plurality of topic keywords; determining an importance ranking for each of the topics; determining an importance ranking for each of the topic keywords of a topic; displaying a graph having a plurality of stacked layers representing a group of topics selected from the plurality of topics based on the importance ranking of the topics; grouping a subset of text documents included in a topic, wherein the grouping is based on a grouping constraint; selecting a subset of topic keywords included in the topic, wherein the subset of topic keywords summarize a content of the subset of text documents, wherein the at least one keyword cloud displayed within each layer of the graph is the subset of topic keywords that summarize the content of the subset of text document grouped based on the grouping constraint; and displaying at least one keyword cloud within each layer of the graph, wherein the at least one keyword cloud is a group of topic keywords selected from the extracted topic keywords based on the importance ranking of the extracted topic keywords; wherein at least one of the steps is carried out using a computer device. 13. The method of claim 1 , wherein the keyword clouds are associated with a relevant time and the step of displaying the at least one keyword cloud within each layer is carried out by placing the at least one keyword cloud near the relevant time.
0.675
7,689,033
1
20
1. A method for use in detecting faces within a digital image, the method comprising: processing via a processor, in a pre-filter stage, a set of digital image data to produce a set of initial candidate portions using at least one feature algorithm, the pre-filter stage including a linear filter based on a decision function having coefficients that are determined during a learning procedure; processing via the processor, in a boosting filter stage, the set of initial candidate portions to produce a set of intermediate candidate portions, the boosting filter stage including: a boosting chain having a plurality of boosting chain nodes to identify candidate portions and a boot strap function following each of the plurality of boosting chain nodes, the boot strap function to use a weak learner of a previous boosting chain node in training another boosting chain node of the boosting chain, wherein the weak learner includes building a simple decision stump on a histogram of a Haar-like feature on a training set; and processing via the processor, the set of intermediate candidate portions in a post-filter stage to produce a set of final candidate portions, wherein the post-filter stage includes an image pre-processing process, a color-filter process, and a support vector machine (SVM) filter process.
1. A method for use in detecting faces within a digital image, the method comprising: processing via a processor, in a pre-filter stage, a set of digital image data to produce a set of initial candidate portions using at least one feature algorithm, the pre-filter stage including a linear filter based on a decision function having coefficients that are determined during a learning procedure; processing via the processor, in a boosting filter stage, the set of initial candidate portions to produce a set of intermediate candidate portions, the boosting filter stage including: a boosting chain having a plurality of boosting chain nodes to identify candidate portions and a boot strap function following each of the plurality of boosting chain nodes, the boot strap function to use a weak learner of a previous boosting chain node in training another boosting chain node of the boosting chain, wherein the weak learner includes building a simple decision stump on a histogram of a Haar-like feature on a training set; and processing via the processor, the set of intermediate candidate portions in a post-filter stage to produce a set of final candidate portions, wherein the post-filter stage includes an image pre-processing process, a color-filter process, and a support vector machine (SVM) filter process. 20. The method as recited in claim 1 , further comprising outputting information associated with the set of final candidate portions.
0.67561
8,670,985
6
7
6. The method of claim 1 , further comprising: determining the relative importance of each prompt; and varying the length of the time period of each prompt based on the determined relative importance of that prompt.
6. The method of claim 1 , further comprising: determining the relative importance of each prompt; and varying the length of the time period of each prompt based on the determined relative importance of that prompt. 7. The method of claim 6 , wherein varying further comprises: varying the amount by which the final time stamp exceeds the time stamp that corresponds to stopping to provide the prompt.
0.909046
8,370,158
31
32
31. Server apparatus, comprising: a processor; a communications interface in data communication with the processor; and a storage device in data communication with the processor, said storage device comprising a storage medium, said storage medium comprising at least one computer program with a plurality of instructions, said at least one program being configured to: receive a digital representation of speech input received from a user, the speech input relating to an organization or entity which the user wishes to locate; based at least in part on the digital representation, identify a location associated with the organization or entity; and enable generation of a graphical or visual representation of the location in order to aid the user in finding the organization or entity, the graphical or visual representation of the location also comprising a graphical or visual representation of the surroundings of the organization or entity.
31. Server apparatus, comprising: a processor; a communications interface in data communication with the processor; and a storage device in data communication with the processor, said storage device comprising a storage medium, said storage medium comprising at least one computer program with a plurality of instructions, said at least one program being configured to: receive a digital representation of speech input received from a user, the speech input relating to an organization or entity which the user wishes to locate; based at least in part on the digital representation, identify a location associated with the organization or entity; and enable generation of a graphical or visual representation of the location in order to aid the user in finding the organization or entity, the graphical or visual representation of the location also comprising a graphical or visual representation of the surroundings of the organization or entity. 32. The server apparatus of claim 31 , wherein the graphical or visual representation of the location further comprises a graphical representation of directions from a known location to the organization or entity.
0.910202
8,478,747
1
7
1. A method for making recommendations to a user, the method comprising: storing data relating to user usage patterns, wherein the data includes an application portion having information as to items which were used and a context portion having information as to the context in which the items were used, wherein the context is the situation in which the user or device operated by the user is operating when the items were used; clustering the data into clusters of data points; computing, for each of the clusters, a centroid, wherein the centroid includes an application portion and a context portion; selecting at least one cluster similar to a current user context by comparing a data point representing the current user context to the context portions of one or more of the centroids; and computing, for each of one or more items, an expectation value of user usage pattern for the corresponding item by selecting data points within the selected similar clusters that have application portions indicating the use of the corresponding item and determining the similarity of the current user context to the context portions of the selected data points, wherein the expectation values are used to recommend one or more of the items.
1. A method for making recommendations to a user, the method comprising: storing data relating to user usage patterns, wherein the data includes an application portion having information as to items which were used and a context portion having information as to the context in which the items were used, wherein the context is the situation in which the user or device operated by the user is operating when the items were used; clustering the data into clusters of data points; computing, for each of the clusters, a centroid, wherein the centroid includes an application portion and a context portion; selecting at least one cluster similar to a current user context by comparing a data point representing the current user context to the context portions of one or more of the centroids; and computing, for each of one or more items, an expectation value of user usage pattern for the corresponding item by selecting data points within the selected similar clusters that have application portions indicating the use of the corresponding item and determining the similarity of the current user context to the context portions of the selected data points, wherein the expectation values are used to recommend one or more of the items. 7. The method of claim 1 , wherein the context includes the location of the user.
0.775
7,505,463
30
43
30. A computer accessible medium, comprising program instructions configured to implement: receiving a plurality of packet flow rules from multiple network services, wherein each packet flow rule comprises a packet filter and an action list including one or more prioritized actions, wherein each network service has a priority, and wherein the packet flow rules from each network service comprise a priority expressed either by longest prefix, or ordered precedence; generating a unified rule set according to the received packet flow rules, wherein said generating comprises: identifying conflicts between rule pairs, wherein each rule pair includes a higher priority rule and a lower priority rule; and resolving the identified conflicts according to a priority relationship between the higher priority rule and the lower priority rule.
30. A computer accessible medium, comprising program instructions configured to implement: receiving a plurality of packet flow rules from multiple network services, wherein each packet flow rule comprises a packet filter and an action list including one or more prioritized actions, wherein each network service has a priority, and wherein the packet flow rules from each network service comprise a priority expressed either by longest prefix, or ordered precedence; generating a unified rule set according to the received packet flow rules, wherein said generating comprises: identifying conflicts between rule pairs, wherein each rule pair includes a higher priority rule and a lower priority rule; and resolving the identified conflicts according to a priority relationship between the higher priority rule and the lower priority rule. 43. The computer accessible medium of claim 30 , wherein the program instructions are further configured to implement: receiving a new packet flow rule from a network service; inserting the new packet flow rule into the unified rule set according to the priority of the new packet flow rule; identifying one or more conflicts between the new packet flow rule and existing rules of the unified rule set; and resolving the identified conflicts according to a priority relation between the conflicting rules.
0.627581
10,122,657
11
20
11. The communication method of claim 10 , wherein one or more portions of the content of the first message are highlighted, rearranged, added, or deleted based on the communication policy.
11. The communication method of claim 10 , wherein one or more portions of the content of the first message are highlighted, rearranged, added, or deleted based on the communication policy. 20. The communication method of claim 11 , wherein the new message is sent from the user to a second recipient, and wherein the communication policy of the new message causes the one or more portions of the content to have a first ordering for the recipient and a second ordering for the second recipient, and wherein the second ordering is a rearrangement of the first ordering.
0.890589
8,321,448
14
17
14. A keyword suggestion system, comprising: a processor; a memory coupled to the processor, wherein the processor is configured for: processing raw search click-through log data based at least in part on set time intervals including a month, a day, and a year, to generate a click-through log, the ordered query keywords include keywords that are frequently submitted by users; generating ordered query keywords from the raw search click-through log data in which the ordered query keywords include query-uniform resource locator pairs; constructing a bipartite graph based at least in part on the query-uniform resource locator pairs in which one set of vertices corresponds to queries and a second set of vertices corresponds to uniform resource locators; based at least in part on the bipartite graph, utilizing an algorithm to compute (a) similarities between queries in which the similarities of the queries are based at least in part on visiting similar web pages associated with the uniform resource locators, and (b) similarities between the web pages associated with the uniform resource locators in which the similarities of the web pages are based at least in part on being visited by similar type queries to capture related phrases, wherein the algorithm comprises determining relationships between the queries and the web pages by iteratively computing similarities between the queries and the web pages; identifying advertising keywords based at least in part on the similarities of the queries and the similarities of the web pages used to capture the related phrases by using a keyword expansion file associated with the set time intervals to expand the queries to include the advertising keywords according to a query-uniform resource locator (URL) correlation, the advertising keywords are based at least in part on a bidding criteria for advertisements, wherein the bidding criteria comprises at least one of a click-through rate or a revenue per search; and suggesting the related phrases that have similar page-click behaviors based at least in part on the bidding criteria for the advertisements.
14. A keyword suggestion system, comprising: a processor; a memory coupled to the processor, wherein the processor is configured for: processing raw search click-through log data based at least in part on set time intervals including a month, a day, and a year, to generate a click-through log, the ordered query keywords include keywords that are frequently submitted by users; generating ordered query keywords from the raw search click-through log data in which the ordered query keywords include query-uniform resource locator pairs; constructing a bipartite graph based at least in part on the query-uniform resource locator pairs in which one set of vertices corresponds to queries and a second set of vertices corresponds to uniform resource locators; based at least in part on the bipartite graph, utilizing an algorithm to compute (a) similarities between queries in which the similarities of the queries are based at least in part on visiting similar web pages associated with the uniform resource locators, and (b) similarities between the web pages associated with the uniform resource locators in which the similarities of the web pages are based at least in part on being visited by similar type queries to capture related phrases, wherein the algorithm comprises determining relationships between the queries and the web pages by iteratively computing similarities between the queries and the web pages; identifying advertising keywords based at least in part on the similarities of the queries and the similarities of the web pages used to capture the related phrases by using a keyword expansion file associated with the set time intervals to expand the queries to include the advertising keywords according to a query-uniform resource locator (URL) correlation, the advertising keywords are based at least in part on a bidding criteria for advertisements, wherein the bidding criteria comprises at least one of a click-through rate or a revenue per search; and suggesting the related phrases that have similar page-click behaviors based at least in part on the bidding criteria for the advertisements. 17. The system of claim 14 , further comprising selecting at least one option to amend the keyword expansion file or to replace the keyword expansion file.
0.6125
9,086,788
9
10
9. A method for collaborating, the method comprising: modifying, by a computer system, a presentation of a document that includes a plurality of portions by making each portion of the document selectable by a user; responsive to receiving, by the computer system, a selection by the user of a portion of the document, identifying, by the computer system, a context of the user-selected portion of the document; identifying, by the computer system, a set of collaboration channels corresponding to the context of the user-selected portion of the document; determining, by the computer system, whether the set of collaboration channels corresponding to the context of the user-selected portion of the document is empty; responsive to the computer system determining that the set of collaboration channels corresponding to the context of the user-selected portion of the document is empty, creating, by the computer system, a new collaboration channel based on the context of the user-selected portion of the document; responsive to the computer system determining that the set of collaboration channels corresponding to the context of the user-selected portion of the document is not empty, selecting, by the computer system, one or more of the set of collaboration channels corresponding to the context of the user-selected portion of the document; and establishing, by the computer system, a collaboration that communicates information about the user-selected portion of the document between the user and other users by utilizing the one or more of the set of collaboration channels corresponding to the context of the user-selected portion of the document.
9. A method for collaborating, the method comprising: modifying, by a computer system, a presentation of a document that includes a plurality of portions by making each portion of the document selectable by a user; responsive to receiving, by the computer system, a selection by the user of a portion of the document, identifying, by the computer system, a context of the user-selected portion of the document; identifying, by the computer system, a set of collaboration channels corresponding to the context of the user-selected portion of the document; determining, by the computer system, whether the set of collaboration channels corresponding to the context of the user-selected portion of the document is empty; responsive to the computer system determining that the set of collaboration channels corresponding to the context of the user-selected portion of the document is empty, creating, by the computer system, a new collaboration channel based on the context of the user-selected portion of the document; responsive to the computer system determining that the set of collaboration channels corresponding to the context of the user-selected portion of the document is not empty, selecting, by the computer system, one or more of the set of collaboration channels corresponding to the context of the user-selected portion of the document; and establishing, by the computer system, a collaboration that communicates information about the user-selected portion of the document between the user and other users by utilizing the one or more of the set of collaboration channels corresponding to the context of the user-selected portion of the document. 10. The method of claim 9 further comprising: determining, by the computer system, whether the set of collaboration channels corresponding to the context of the user-selected portion of the document includes a first collaboration channel and a second collaboration channel corresponding to the context; establishing, by the computer system, a first collaboration using the first collaboration channel and a second collaboration using the second collaboration channel responsive to the set of collaboration channels corresponding to the context of the user-selected portion of the document including the first collaboration channel and the second collaboration channel; responsive to receiving, by the computer system, a collaboration message from the user about the user-selected portion of the document, sending, by the computer system, the collaboration message about the user-selected portion of the document to the first collaboration and the second collaboration; and presenting, by the computer system, collaboration messages from the other users to the user received, by the computer system, from the first collaboration and the second collaboration.
0.524651
9,607,038
12
14
12. A system comprising: a processor; and a computer readable storage medium having code executed by the processor for performing operations, the operations comprising: in response to a determination that a target fragment in a target document matches a source fragment in a source document, generating a linkage metadata for the target fragment, wherein the linkage metadata is generated for target fragments from the target document and source fragments from multiple source documents to provide information on how the target fragments in the target document relate to the source documents having matching source fragments, wherein the source documents have content to compare against received target documents.
12. A system comprising: a processor; and a computer readable storage medium having code executed by the processor for performing operations, the operations comprising: in response to a determination that a target fragment in a target document matches a source fragment in a source document, generating a linkage metadata for the target fragment, wherein the linkage metadata is generated for target fragments from the target document and source fragments from multiple source documents to provide information on how the target fragments in the target document relate to the source documents having matching source fragments, wherein the source documents have content to compare against received target documents. 14. The system of claim 12 , wherein the linkage metadata associates at least two fragments that are members of a set of fragments comprising the target fragment and at least one matching source fragment that have a same value for a metadata attribute.
0.746988
6,078,878
37
39
37. The method of claim 36 wherein steps (a) and (b) are repeated a plurality of times.
37. The method of claim 36 wherein steps (a) and (b) are repeated a plurality of times. 39. The method of claim 37, further comprising the step of: after steps (a) and (b) are repeated a plurality of times, for each node not having a sense characterization: assigning to the node a default characterization for the word represented by the node, such that each word in the lexical knowledge base has a sense characterization.
0.893469
8,488,146
1
4
1. An image forming system comprising: an image forming apparatus configured to function as a groupware terminal; and a groupware server of a groupware, said groupware server comprising: plural document databases configured to store document data; and an attribute database configured to store multiple lists of different plural kinds of attribute information, each kind of the attribute information being setting items unique to each document database, the setting items being required to be set when storing the document data in the document database, said image forming apparatus comprising: a scan part configured to scan a paper document and to obtain document data; a first display screen that displays a selection screen enabling selection of one of the plural document databases; an acquiring part configured to acquire one of the lists of attribute information from the attribute database corresponding to the selected document database; a second display screen that displays an input screen to set the unique predetermined setting items included in the acquired list of attribute information; a setting part configured to add the attribute information including the set setting items to the document data obtained by the scan part; and a sending part configured to send to the groupware server the document data having the added attribute information, said groupware server storing the document data having the added attribute information including the set setting items, received from the sending part, in the document database.
1. An image forming system comprising: an image forming apparatus configured to function as a groupware terminal; and a groupware server of a groupware, said groupware server comprising: plural document databases configured to store document data; and an attribute database configured to store multiple lists of different plural kinds of attribute information, each kind of the attribute information being setting items unique to each document database, the setting items being required to be set when storing the document data in the document database, said image forming apparatus comprising: a scan part configured to scan a paper document and to obtain document data; a first display screen that displays a selection screen enabling selection of one of the plural document databases; an acquiring part configured to acquire one of the lists of attribute information from the attribute database corresponding to the selected document database; a second display screen that displays an input screen to set the unique predetermined setting items included in the acquired list of attribute information; a setting part configured to add the attribute information including the set setting items to the document data obtained by the scan part; and a sending part configured to send to the groupware server the document data having the added attribute information, said groupware server storing the document data having the added attribute information including the set setting items, received from the sending part, in the document database. 4. The image forming system as claimed in claim 1 , wherein the attribute information further includes environment information of the groupware, setting information of the respective document database to which the document data is stored, and document information related to the document data stored in the document database.
0.797634
9,832,622
1
11
1. A computer implemented method comprising: receiving a client identifier from a client device associated with a user of a social-networking system; establishing, based on the client identifier, a wireless communication link with the client device, wherein the wireless communication link is established after a particular duration of time has passed; determining based on the particular duration of time being above a threshold duration, an operational context indicating that quality of a data connection with the client device is too low to transmit an image in its original form; determining one or more image parameters based on the operational context of the client device, wherein the image parameters: specify creation of an optimized image that is based on the image in its original form; and comprises one or more modifications for the optimized image, wherein the modifications reduce the data size of the optimized image; creating the optimized image based on the image parameters for provision to the user; and providing the optimized image to the client device and to an image repository.
1. A computer implemented method comprising: receiving a client identifier from a client device associated with a user of a social-networking system; establishing, based on the client identifier, a wireless communication link with the client device, wherein the wireless communication link is established after a particular duration of time has passed; determining based on the particular duration of time being above a threshold duration, an operational context indicating that quality of a data connection with the client device is too low to transmit an image in its original form; determining one or more image parameters based on the operational context of the client device, wherein the image parameters: specify creation of an optimized image that is based on the image in its original form; and comprises one or more modifications for the optimized image, wherein the modifications reduce the data size of the optimized image; creating the optimized image based on the image parameters for provision to the user; and providing the optimized image to the client device and to an image repository. 11. The computer implemented method of claim 1 , wherein the operational context comprises a viewing interface of the client device.
0.75
7,895,531
8
10
8. The method of claim 1 , wherein displaying the command object adjacent to the selected text includes displaying the command object adjacent to an editing insertion point in the selected text.
8. The method of claim 1 , wherein displaying the command object adjacent to the selected text includes displaying the command object adjacent to an editing insertion point in the selected text. 10. The method of claim 8 , further comprising displaying the command object in a consistent location relative to the selected text upon subsequent displays of the command object.
0.95277
7,788,246
4
5
4. The system of claim 3 , wherein the dynamic grammar component includes a discovery component that locates the plurality of available adapters and reports to the data flow language parser.
4. The system of claim 3 , wherein the dynamic grammar component includes a discovery component that locates the plurality of available adapters and reports to the data flow language parser. 5. The system of claim 4 , wherein the discovery component accesses a registry component to locate the plurality of available adapters.
0.948552
4,635,262
1
2
1. A method of synchronizing a data sink with a data source in a data transmission system in which data provided by the data source is encoded as code words (c.sub.L) in a linear block code and such code words are transmitted as messages over a transmission channel in the form of sequentially linked modified code words (c'.sub.L), the modified code words (c'.sub.L) being formed by linking each data code word (c.sub.L) to a protection word (w.sub.L) which is transmitted over such transmission channel, characterized in that: each protection word (w.sub.L) identifies the position within the transmitted message of the code word (c.sub.L) linked thereto; the modified code words (c'.sub.L) are interleaved bit-sequentially, transmitted, and at the receiver are de-interleaved to derive received code words (c.sub.K); and each received code word (c.sub.K) is linked to a check word (w.sub.K) which characterizes the position of such code word (c.sub.K) within the received message.
1. A method of synchronizing a data sink with a data source in a data transmission system in which data provided by the data source is encoded as code words (c.sub.L) in a linear block code and such code words are transmitted as messages over a transmission channel in the form of sequentially linked modified code words (c'.sub.L), the modified code words (c'.sub.L) being formed by linking each data code word (c.sub.L) to a protection word (w.sub.L) which is transmitted over such transmission channel, characterized in that: each protection word (w.sub.L) identifies the position within the transmitted message of the code word (c.sub.L) linked thereto; the modified code words (c'.sub.L) are interleaved bit-sequentially, transmitted, and at the receiver are de-interleaved to derive received code words (c.sub.K); and each received code word (c.sub.K) is linked to a check word (w.sub.K) which characterizes the position of such code word (c.sub.K) within the received message. 2. A method as claimed in claim 1, further characterized in that at the receiver the protection words (w.sub.L) of the transmitted code words (c'.sub.L) are combined with the check words (w.sub.K) of the received code words (c.sub.K), the lengths of the protection words and check words being a portion of the length of the code words.
0.501488
7,630,959
18
22
18. A system for processing a database query, comprising: a server; a client coupled to the server through a network; user interface running on the client; a selector, implemented in the user interface, to present, to a user, a plurality of query elements, each query element having a plurality of allowed query element values, the plurality of allowed query element values for each query element being presented to the user for selection of a query element value from the plurality of allowed query element values, the query element values not selected by the user being non-selected query element values; said server, receiving from the user, a selected query element value for at least one of the plurality of query elements; a database coupled to the server, the database comprising information objects, the database storing a first relevance value which defines the relevance of at least one of the information objects with respect to the selected query element value and a second relevance value which defines a relevance of the at least one information object with respect to a non-selected query element value, the first relevance value and the second relevance value being assigned by a human editor other than the user, the first relevance value and the second relevance value being assigned before the plurality of query elements is presented to the user; an indexer for forming an index to the database, the index associating at least one of the information objects with at least the selected query element value; wherein information objects are retrieved from the database based on the first relevance value and the second relevance value, in response to the selection of the selected query element value by the user via the selector, wherein the information objects correspond to the index, and wherein a result to the database query is returned to the user and the result corresponds to the information objects.
18. A system for processing a database query, comprising: a server; a client coupled to the server through a network; user interface running on the client; a selector, implemented in the user interface, to present, to a user, a plurality of query elements, each query element having a plurality of allowed query element values, the plurality of allowed query element values for each query element being presented to the user for selection of a query element value from the plurality of allowed query element values, the query element values not selected by the user being non-selected query element values; said server, receiving from the user, a selected query element value for at least one of the plurality of query elements; a database coupled to the server, the database comprising information objects, the database storing a first relevance value which defines the relevance of at least one of the information objects with respect to the selected query element value and a second relevance value which defines a relevance of the at least one information object with respect to a non-selected query element value, the first relevance value and the second relevance value being assigned by a human editor other than the user, the first relevance value and the second relevance value being assigned before the plurality of query elements is presented to the user; an indexer for forming an index to the database, the index associating at least one of the information objects with at least the selected query element value; wherein information objects are retrieved from the database based on the first relevance value and the second relevance value, in response to the selection of the selected query element value by the user via the selector, wherein the information objects correspond to the index, and wherein a result to the database query is returned to the user and the result corresponds to the information objects. 22. The system of claim 18 , further comprising a classification-based analyzer, coupled to the database, for analyzing data based on the query.
0.526316
8,565,389
5
8
5. A voicemail to text device comprising: a processor; and memory coupled to the processor, the memory having stored thereon executable instructions that when executed by the processor cause the processor to effectuate operations that comprise: request a status of a network resource associated with the mobile device after receiving the request to retrieve the voicemail message from the mobile device, the network resource comprising at least one of: a router, a switch, a network tower, or a landline; receive an indication of the status of the network resource; and provide instructions to transcribe, from audio to text, a voicemail message based on the received status of the network resource.
5. A voicemail to text device comprising: a processor; and memory coupled to the processor, the memory having stored thereon executable instructions that when executed by the processor cause the processor to effectuate operations that comprise: request a status of a network resource associated with the mobile device after receiving the request to retrieve the voicemail message from the mobile device, the network resource comprising at least one of: a router, a switch, a network tower, or a landline; receive an indication of the status of the network resource; and provide instructions to transcribe, from audio to text, a voicemail message based on the received status of the network resource. 8. The voicemail to text device of claim 5 , wherein the status of the network resource comprises an amount of memory of the network resource.
0.783537
9,652,443
1
6
1. A computer-implemented method comprising: receiving an input to a search field in a graphical user interface (GUI); displaying a plurality of content elements as search results in a search results region of the GUI, the search results based on a search utilizing the input to the search field, one or more of the plurality of content elements displayed in the search results region comprising an edit button configured to allow a user, responsive to selecting the button, to edit a respective content element; receiving a selection of one of the content elements in the GUI; adding, via the GUI, an indication of the one of the content elements to a content region of the GUI configured to be populated with indications of content to be used for a page of an electronic document; and displaying, in the GUI, how the one of the content elements is currently configured to appear in the page of the electronic document at a selected future publication date and time.
1. A computer-implemented method comprising: receiving an input to a search field in a graphical user interface (GUI); displaying a plurality of content elements as search results in a search results region of the GUI, the search results based on a search utilizing the input to the search field, one or more of the plurality of content elements displayed in the search results region comprising an edit button configured to allow a user, responsive to selecting the button, to edit a respective content element; receiving a selection of one of the content elements in the GUI; adding, via the GUI, an indication of the one of the content elements to a content region of the GUI configured to be populated with indications of content to be used for a page of an electronic document; and displaying, in the GUI, how the one of the content elements is currently configured to appear in the page of the electronic document at a selected future publication date and time. 6. The computer-implemented method of claim 1 , further comprising receiving selection of the future publication date and time via a calendar tool.
0.832955
8,015,011
1
8
1. A system for generating synthetic speech, comprising: a phoneme segment storage section operable to store a plurality of phoneme segment data pieces indicating a plurality of sounds of phonemes which are different from each other; and a synthesis section operable to generate voice data representing synthetic speech of text by receiving an inputted text, reading out phoneme segment data pieces that correspond to respective phonemes indicating the pronunciation of the inputted text, and connecting the read-out phoneme segment data pieces to each other; a computing section operable to compute a score indicating naturalness of the synthetic speech of the text, on the basis of the voice data; a paraphrase storage section operable to store a plurality of notations each comprising a word or phrase, the plurality of notations comprising a plurality of first notations and a plurality of second notations, each second notation being a paraphrase of a respective first notation; a replacement section operable to search the text for a notation matching any of the first notations and to replace a matching notation with the second notation corresponding to the first notation; and a judgment section operable to receive the score computed by the computing section and determine whether the score indicates the synthetic speech is sufficiently natural, and: if the score indicates the synthetic speech is sufficiently natural, output the generated voice data; and if the score indicates the synthetic speech is not sufficiently natural, cause the replacement section to generate revised text by replacing at least one other notation in the inputted text matching a first notation with a corresponding second notation, and cause the synthesis section to generate voice data for the revised text.
1. A system for generating synthetic speech, comprising: a phoneme segment storage section operable to store a plurality of phoneme segment data pieces indicating a plurality of sounds of phonemes which are different from each other; and a synthesis section operable to generate voice data representing synthetic speech of text by receiving an inputted text, reading out phoneme segment data pieces that correspond to respective phonemes indicating the pronunciation of the inputted text, and connecting the read-out phoneme segment data pieces to each other; a computing section operable to compute a score indicating naturalness of the synthetic speech of the text, on the basis of the voice data; a paraphrase storage section operable to store a plurality of notations each comprising a word or phrase, the plurality of notations comprising a plurality of first notations and a plurality of second notations, each second notation being a paraphrase of a respective first notation; a replacement section operable to search the text for a notation matching any of the first notations and to replace a matching notation with the second notation corresponding to the first notation; and a judgment section operable to receive the score computed by the computing section and determine whether the score indicates the synthetic speech is sufficiently natural, and: if the score indicates the synthetic speech is sufficiently natural, output the generated voice data; and if the score indicates the synthetic speech is not sufficiently natural, cause the replacement section to generate revised text by replacing at least one other notation in the inputted text matching a first notation with a corresponding second notation, and cause the synthesis section to generate voice data for the revised text. 8. The system according to claim 1 , wherein: the paraphrase storage section is operable to store a similarity score in association with each of combinations of a first notation and a second notation that is a paraphrase of the first notation, the similarity score indicating a degree of similarity between meanings of the first and second notations, and when a notation contained in the inputted text matches with each of a plurality of first notations, the replacement section replaces the matching notation with the second notation having a highest similarity to the corresponding first notation.
0.750417
9,323,485
1
2
1. A verifiable document security system comprising: a validation center for generating a security architecture for a secured document and transmitting print instructions for printing the security architecture on a document in a form of a check payable to a recipient, the validation center communicating with an issuer and the recipient to receive and validate transaction information, wherein the recipient receives the secured document after printing; wherein the security architecture comprises a plurality of security elements comprising indicia printed with a print media and in a print configuration; wherein the print media is selected from the group consisting of a transparent magnetizable fluid, an ultraviolet (UV) excitable fluid, an infrared (IR) fluid, an x-ray excitable fluid, a gamma ray excitable fluid, an electron beam (EB) excitable fluid, an alternative energy excitable fluid, and a fluorescent fluid, further wherein at least one of the security elements is printed with the transparent magnetizable fluid; wherein the print configuration is selected from the group consisting of at least two sizes, a non-linear configuration, a curved configuration and an angled configuration; and a printing means comprising an ink suite, which comprises the print media, wherein the printing means is capable of receiving print instructions and capable of printing the security architecture on the document.
1. A verifiable document security system comprising: a validation center for generating a security architecture for a secured document and transmitting print instructions for printing the security architecture on a document in a form of a check payable to a recipient, the validation center communicating with an issuer and the recipient to receive and validate transaction information, wherein the recipient receives the secured document after printing; wherein the security architecture comprises a plurality of security elements comprising indicia printed with a print media and in a print configuration; wherein the print media is selected from the group consisting of a transparent magnetizable fluid, an ultraviolet (UV) excitable fluid, an infrared (IR) fluid, an x-ray excitable fluid, a gamma ray excitable fluid, an electron beam (EB) excitable fluid, an alternative energy excitable fluid, and a fluorescent fluid, further wherein at least one of the security elements is printed with the transparent magnetizable fluid; wherein the print configuration is selected from the group consisting of at least two sizes, a non-linear configuration, a curved configuration and an angled configuration; and a printing means comprising an ink suite, which comprises the print media, wherein the printing means is capable of receiving print instructions and capable of printing the security architecture on the document. 2. The verifiable document security system according to claim 1 , wherein the validation center is operably connected to a database for storing account information for the issuer or the recipient.
0.805169
8,126,437
9
11
9. The method of claim 1 , further comprising sending by the server system a text message to the second communication device advising of the receipt of the redirected call.
9. The method of claim 1 , further comprising sending by the server system a text message to the second communication device advising of the receipt of the redirected call. 11. The method of claim 9 , wherein the advising includes advising by the server system of the voice message from the first communication device and the common identifier associated with the first and second communication devices.
0.895928
7,580,719
1
3
1. A computer-implemented method comprising: parsing a Short Message with a Server; generating a Context Metadata of the Short Message; and, associating explicitly the Context Metadata to the Short Message; and, delivering the Short Message and its Context Metadata.
1. A computer-implemented method comprising: parsing a Short Message with a Server; generating a Context Metadata of the Short Message; and, associating explicitly the Context Metadata to the Short Message; and, delivering the Short Message and its Context Metadata. 3. A The method as in claim 1 , further comprising: allowing a Sender to explicitly enter the Context Metadata; and, using a permutation of the Context Metadata entered by the Sender to explicitly govern a sending operation of a prepared Short Message.
0.919949
9,880,540
10
17
10. A user interface system for a process control system, comprising: a computer processor; a computer-readable storage medium having instructions stored thereon which, when executed by the computer processor provide: a graphic display editor to configure a process graphic display having a graphic display element representative of a process plant element of the process control system, wherein the process plant element corresponds to an object entity within an object oriented programming environment that includes the graphic display element, and wherein configuration information for the process graphic display generated by the graphic display editor is stored in the computer-readable medium in accordance with a declarative language, the object entity including the configuration information; a conversion engine for generating commands in accordance with a further declarative language different from the declarative language based on graphics related information of the configuration information and for generating a data source reference file from the configuration information for the process graphic display that identifies a data source for data to be displayed in connection with the graphic display element, and generating commands specifying a data conversion routine for the graphic display element for converting data values from the data source to graphically and dynamically display the data from the data source in association with the display of the graphics display element and to simulate on-line operation of the process plant element, wherein the process graphic display operates to depict both on-line and simulation operation of the process plant element that includes displaying data calculated from the simulation of the process plant element via the graphic display element; and a graphics rendering engine to generate a depiction of the process graphic display during runtime based on commands derived from the configuration information.
10. A user interface system for a process control system, comprising: a computer processor; a computer-readable storage medium having instructions stored thereon which, when executed by the computer processor provide: a graphic display editor to configure a process graphic display having a graphic display element representative of a process plant element of the process control system, wherein the process plant element corresponds to an object entity within an object oriented programming environment that includes the graphic display element, and wherein configuration information for the process graphic display generated by the graphic display editor is stored in the computer-readable medium in accordance with a declarative language, the object entity including the configuration information; a conversion engine for generating commands in accordance with a further declarative language different from the declarative language based on graphics related information of the configuration information and for generating a data source reference file from the configuration information for the process graphic display that identifies a data source for data to be displayed in connection with the graphic display element, and generating commands specifying a data conversion routine for the graphic display element for converting data values from the data source to graphically and dynamically display the data from the data source in association with the display of the graphics display element and to simulate on-line operation of the process plant element, wherein the process graphic display operates to depict both on-line and simulation operation of the process plant element that includes displaying data calculated from the simulation of the process plant element via the graphic display element; and a graphics rendering engine to generate a depiction of the process graphic display during runtime based on commands derived from the configuration information. 17. The user interface system of claim 10 , wherein the declarative language defines an XML-based format for describing the configuration information.
0.563953
9,818,405
1
3
1. A computer implemented method for dialog management, comprising the steps of: S 1000 : receiving an utterance from a user by a terminal; S 2000 : recognizing and converting the utterance from sound into sequential words in a written text; S 3000 : determining if there is a phrase in the written text matching with a predefined phrase in a menu tree; wherein the menu tree comprises a root node, the root node comprises a plurality of parent nodes, and each parent node comprises at least one leaf node, each leaf node corresponds to an operation, each of the predefined phrases corresponds to a parent node or a leaf node; if the phrase in the written text matches with more than one of the predefined phrases in the menu tree, S 3110 : attempting to recognize at least one dynamic field in the written text; S 3120 : converting the sequential words into corresponding predefined terms in sequence, wherein different words with similar meaning are converted into a term; each of the predefined terms corresponds to a parent node or a leaf node; S 3130 : matching terms with the corresponding parent node or leaf node in a matched phrase node; S 4000 : conducting the operation according to the matched phrase node; if the phrase in the written text matches with exactly one of the predefined phrase in the menu tree, S 3210 : attempting to recognize at least one dynamic field in the written text; S 3220 : matching the phrases with the parent node or the leaf node, S 4000 : conducting the operation according to the matched phrase node; if the phrase in the written text does not matches with any of the predefined phrase in the menu tree, S 3310 : attempting to recognize at least one dynamic field in the written text; S 3320 : converting the sequential words into corresponding predefined terms in sequence, wherein different words indicating the similar intent are converted into a term; S 3330 : matching the terms with the corresponding parent node or leaf node in all nodes; S 4000 : conducting the operation according to the matched phrase node.
1. A computer implemented method for dialog management, comprising the steps of: S 1000 : receiving an utterance from a user by a terminal; S 2000 : recognizing and converting the utterance from sound into sequential words in a written text; S 3000 : determining if there is a phrase in the written text matching with a predefined phrase in a menu tree; wherein the menu tree comprises a root node, the root node comprises a plurality of parent nodes, and each parent node comprises at least one leaf node, each leaf node corresponds to an operation, each of the predefined phrases corresponds to a parent node or a leaf node; if the phrase in the written text matches with more than one of the predefined phrases in the menu tree, S 3110 : attempting to recognize at least one dynamic field in the written text; S 3120 : converting the sequential words into corresponding predefined terms in sequence, wherein different words with similar meaning are converted into a term; each of the predefined terms corresponds to a parent node or a leaf node; S 3130 : matching terms with the corresponding parent node or leaf node in a matched phrase node; S 4000 : conducting the operation according to the matched phrase node; if the phrase in the written text matches with exactly one of the predefined phrase in the menu tree, S 3210 : attempting to recognize at least one dynamic field in the written text; S 3220 : matching the phrases with the parent node or the leaf node, S 4000 : conducting the operation according to the matched phrase node; if the phrase in the written text does not matches with any of the predefined phrase in the menu tree, S 3310 : attempting to recognize at least one dynamic field in the written text; S 3320 : converting the sequential words into corresponding predefined terms in sequence, wherein different words indicating the similar intent are converted into a term; S 3330 : matching the terms with the corresponding parent node or leaf node in all nodes; S 4000 : conducting the operation according to the matched phrase node. 3. The method according to claim 1 , wherein a minimum and a maximum occurrence threshold are predetermined for recognizing the dynamic field in order to handle inadequate or excessive data.
0.800839
8,762,132
3
4
3. The textual entailment recognition apparatus according to claim 1 , wherein the combination identification unit calculates a similarity between the vector generated for each predicate-argument structure for the first text and the vector generated for each predicate-argument structure for the second text, and identifies combinations of the predicate-argument structures of the first text and the predicate-argument structure of second text based on the calculated similarities.
3. The textual entailment recognition apparatus according to claim 1 , wherein the combination identification unit calculates a similarity between the vector generated for each predicate-argument structure for the first text and the vector generated for each predicate-argument structure for the second text, and identifies combinations of the predicate-argument structures of the first text and the predicate-argument structure of second text based on the calculated similarities. 4. The textual entailment recognition apparatus according to claim 3 , wherein the combination identification unit performs normalization processing during calculation of the similarity, in accordance with an amount of information of the vector.
0.883222
7,703,047
3
6
3. In a computer system including a display and an information display region, a computer-implemented method, the method comprising: providing a movable typing tool approximately the width of the information display region and overlaying a portion of the information display region by aligning the typing tool under a first diagional line of typed text in the information display region by dragging and rotating the typing tool to a diagional orientation, by simultaneously dragging and rotating a stylus, wherein the movable typing tool comprises a writing zone; and responsive to a user inputting handwriting strokes in the writing zone, displaying the handwriting strokes in the writing zone and concurrently displaying text corresponding to the handwriting strokes in the first line of typed text.
3. In a computer system including a display and an information display region, a computer-implemented method, the method comprising: providing a movable typing tool approximately the width of the information display region and overlaying a portion of the information display region by aligning the typing tool under a first diagional line of typed text in the information display region by dragging and rotating the typing tool to a diagional orientation, by simultaneously dragging and rotating a stylus, wherein the movable typing tool comprises a writing zone; and responsive to a user inputting handwriting strokes in the writing zone, displaying the handwriting strokes in the writing zone and concurrently displaying text corresponding to the handwriting strokes in the first line of typed text. 6. The method of claim 3 further comprising dragging the typing tool to be aligned under a second line of typed text in the information display region.
0.701581
9,171,066
16
17
16. The one or more non-transitory computer-readable media of claim 13 , wherein the instructions, when executed by the one or more computers, further cause the one or more computers to rank the second set of interpretation candidates.
16. The one or more non-transitory computer-readable media of claim 13 , wherein the instructions, when executed by the one or more computers, further cause the one or more computers to rank the second set of interpretation candidates. 17. The one or more non-transitory computer-readable media of claim 16 , wherein the instructions, when executed by the one or more computers, cause the one or more computers to configure the client device to re-rank the second set of interpretation candidates.
0.925936
4,881,197
80
81
80. Apparatus according to claim 79, including means for storing with each record an indication of the manes which are active at the end of each record.
80. Apparatus according to claim 79, including means for storing with each record an indication of the manes which are active at the end of each record. 81. Apparatus according to claim 80, further including means assigning a hierarchical level to said first name and to any other assigned names which have been defined, and wherein said means for means for storing with each record includes means for organizing by hierarchical levels the stored indication of names which are active at the end of the record.
0.938451
7,894,596
1
6
1. A method of providing language interpretation comprising: providing a language interpretation number that services multiple languages, wherein the language interpretation number can be used to place a telephone call for language interpretation; receiving a language interpretation telephone call at a language interpretation provider from a caller speaking a first language, wherein the caller places the language interpretation telephone call by dialing the language interpretation number; identifying a business need of the caller; determining a group of business entities that can each satisfy the business need of the caller; selecting, from the group of business entities, a first business entity that is a subscriber for a subscription fee to the language interpretation provider for language interpretation for the first business entity over a second business entity that is not a subscriber for a subscription fee to the language interpretation provider for language interpretation for the second business entity; identifying an interpreter that can interpret between the first language and a second language spoken by an agent of the first business entity; and telephonically engaging the interpreter and the agent of the first business entity in the language interpretation telephone call, wherein the interpreter interprets a conversation between the caller and the agent of the first business entity.
1. A method of providing language interpretation comprising: providing a language interpretation number that services multiple languages, wherein the language interpretation number can be used to place a telephone call for language interpretation; receiving a language interpretation telephone call at a language interpretation provider from a caller speaking a first language, wherein the caller places the language interpretation telephone call by dialing the language interpretation number; identifying a business need of the caller; determining a group of business entities that can each satisfy the business need of the caller; selecting, from the group of business entities, a first business entity that is a subscriber for a subscription fee to the language interpretation provider for language interpretation for the first business entity over a second business entity that is not a subscriber for a subscription fee to the language interpretation provider for language interpretation for the second business entity; identifying an interpreter that can interpret between the first language and a second language spoken by an agent of the first business entity; and telephonically engaging the interpreter and the agent of the first business entity in the language interpretation telephone call, wherein the interpreter interprets a conversation between the caller and the agent of the first business entity. 6. The method of claim 1 , further comprising establishing a billing that accounts a time count accruing from a time at which the language interpretation telephone call starts until a time at which the interpreter is engaged.
0.662162
9,384,731
9
12
9. On a computing device comprising a processor, a method of detecting phrase confusion risk in proposed speech grammar for a computer program, the method comprising: obtaining via the processor a speech grammar development tool by downloading the speech grammar development tool from a server computing system; receiving via the processor an input of a text representation of a speech grammar term; determining via the processor a phonetic representation of the speech grammar term from the text representation; if a portion of the speech grammar term comprises a duration below a threshold duration, then omitting via the processor the portion of the phonetic representation of the speech grammar term; comparing via a speech recognition engine executed by the processor the phonetic representation of the speech grammar term to a phonetic representation of another speech grammar term, wherein comparing comprises using a weighted similarity matrix; outputting to a display a representation of a risk of confusion between the speech grammar term and the other speech grammar term based upon a comparison by the speech recognition engine of the speech grammar term and the other speech grammar term; determining that the speech grammar term was incorrectly identified; sending data regarding the incorrect determination to the server computing system; receiving a modified weighted similarity matrix from the server computing system; and modifying via the processor the speech grammar used by the speech recognition engine based upon the modified weighted similarity matrix.
9. On a computing device comprising a processor, a method of detecting phrase confusion risk in proposed speech grammar for a computer program, the method comprising: obtaining via the processor a speech grammar development tool by downloading the speech grammar development tool from a server computing system; receiving via the processor an input of a text representation of a speech grammar term; determining via the processor a phonetic representation of the speech grammar term from the text representation; if a portion of the speech grammar term comprises a duration below a threshold duration, then omitting via the processor the portion of the phonetic representation of the speech grammar term; comparing via a speech recognition engine executed by the processor the phonetic representation of the speech grammar term to a phonetic representation of another speech grammar term, wherein comparing comprises using a weighted similarity matrix; outputting to a display a representation of a risk of confusion between the speech grammar term and the other speech grammar term based upon a comparison by the speech recognition engine of the speech grammar term and the other speech grammar term; determining that the speech grammar term was incorrectly identified; sending data regarding the incorrect determination to the server computing system; receiving a modified weighted similarity matrix from the server computing system; and modifying via the processor the speech grammar used by the speech recognition engine based upon the modified weighted similarity matrix. 12. The method of claim 9 , wherein comparing the phonetic representation of the speech grammar term to a phonetic representation of another speech grammar term comprises using a weighted similarity matrix.
0.86285
9,633,657
13
17
13. A system of providing speech recognition to a user on a mobile device, the system comprising: a hearing assistance application on a mobile device, the mobile device having a display screen, the hearing assistance application configured to receive audio data and transmit the audio data; a hearing assistance processor configured for real-time data exchange with the hearing assistance application, at least one voice processor and at least one recognition processor, the hearing assistance processor configured to receive the audio data from the hearing assistance application and transmit the audio data to the at least one recognition processor to convert the audio data into corresponding text data, receive the text data from the at least one recognition processor, and transmit the text data to the hearing assistance application; the hearing assistance application configured to display at least a portion of the text data on the display screen of the mobile device and receive confirmation to transmit the audio data, the text data or additional audio data derived from the text data to the telephony device, and transmit the confirmation to the hearing assistance processor; and the hearing assistance processor is configured to, in response to receiving the confirmation, transmit the audio data, the text data, or the additional audio data derived from the text data to the telephony device via the at least one voice processor, the hearing assistance processor is configured to receive additional audio data from the telephony device and interact with the at least one recognition processor to determine if the additional audio data is clear or otherwise of sufficient quality to be processed by the at least one recognition processor, and upon determining that the additional audio data is not clear or of insufficient quality to be processed, sending audio feedback to the telephony device that prompts for improved audio data; the hearing assistance application being configured to receive additional audio data from the user of the mobile device and transmit the additional audio data to the hearing assistance processor; the hearing assistance processor being configured to transmit the additional audio data to the at least one recognition processor to convert the additional audio data into corresponding additional text data, receive the additional text data from the at least one recognition processor, and transmit the additional text data to the hearing assistance application; the hearing assistance application being configured to display at least a portion of the additional text data on the display screen of the mobile device and receive confirmation to transmit the additional audio data or the text data to the telephony device, and transmit the confirmation to the hearing assistance processor; and the hearing assistance processor being configured to, in response to receiving the confirmation, transmit the additional audio data, the text data or generated audio data corresponding to the text data to the telephony device via the at least one voice processor.
13. A system of providing speech recognition to a user on a mobile device, the system comprising: a hearing assistance application on a mobile device, the mobile device having a display screen, the hearing assistance application configured to receive audio data and transmit the audio data; a hearing assistance processor configured for real-time data exchange with the hearing assistance application, at least one voice processor and at least one recognition processor, the hearing assistance processor configured to receive the audio data from the hearing assistance application and transmit the audio data to the at least one recognition processor to convert the audio data into corresponding text data, receive the text data from the at least one recognition processor, and transmit the text data to the hearing assistance application; the hearing assistance application configured to display at least a portion of the text data on the display screen of the mobile device and receive confirmation to transmit the audio data, the text data or additional audio data derived from the text data to the telephony device, and transmit the confirmation to the hearing assistance processor; and the hearing assistance processor is configured to, in response to receiving the confirmation, transmit the audio data, the text data, or the additional audio data derived from the text data to the telephony device via the at least one voice processor, the hearing assistance processor is configured to receive additional audio data from the telephony device and interact with the at least one recognition processor to determine if the additional audio data is clear or otherwise of sufficient quality to be processed by the at least one recognition processor, and upon determining that the additional audio data is not clear or of insufficient quality to be processed, sending audio feedback to the telephony device that prompts for improved audio data; the hearing assistance application being configured to receive additional audio data from the user of the mobile device and transmit the additional audio data to the hearing assistance processor; the hearing assistance processor being configured to transmit the additional audio data to the at least one recognition processor to convert the additional audio data into corresponding additional text data, receive the additional text data from the at least one recognition processor, and transmit the additional text data to the hearing assistance application; the hearing assistance application being configured to display at least a portion of the additional text data on the display screen of the mobile device and receive confirmation to transmit the additional audio data or the text data to the telephony device, and transmit the confirmation to the hearing assistance processor; and the hearing assistance processor being configured to, in response to receiving the confirmation, transmit the additional audio data, the text data or generated audio data corresponding to the text data to the telephony device via the at least one voice processor. 17. The system of claim 13 , wherein the hearing assistance processor is configured to determine, for the audio data, a recognition index as an estimation of accuracy and switch to connect to at least one other recognition processor or at least one other voice processor in attempt to improve the recognition index.
0.716727
8,094,942
1
12
1. A method for recognizing characters, comprising: receiving touch-based input relating to a sequence of strokes at a touch-based interface of a computing device, wherein a first subset of the sequence of strokes corresponds to a first area of the touch-based interface and a second subset of the sequence of strokes corresponds to a second area of the touch-based interface that at least partially overlaps the first area; displaying a graphical representation of the first subset of the sequence of strokes on an output device coupled to the computing device; arranging the sequence of strokes into a chronological order based at least on when at least one stroke of the sequence of strokes was received at the touch-based interface; selecting at least a first stroke and comparing at least the first stroke to one or more characters; performing a first ranking of the one or more characters based at least in part on the comparison between the first stroke and the one or more characters; comparing a combination of the first stroke and at least a second stroke consecutive with the first stroke to the one or more characters; performing a second ranking of the one or more characters based at least on the comparison of the one or more characters with the combination of the first and second strokes; determining a confidence level that a first character approximately matches the first subset of the sequence of strokes based on at least the first ranking and the second ranking, wherein the confidence level is of at least a first confidence threshold; altering the display of the graphical representation of the first subset of the sequence of strokes based on the confidence level; and providing the first character for processing by an application executing on the computing device when the confidence level is of at least a second confidence threshold, wherein the application is designed to process characters from touch-based input.
1. A method for recognizing characters, comprising: receiving touch-based input relating to a sequence of strokes at a touch-based interface of a computing device, wherein a first subset of the sequence of strokes corresponds to a first area of the touch-based interface and a second subset of the sequence of strokes corresponds to a second area of the touch-based interface that at least partially overlaps the first area; displaying a graphical representation of the first subset of the sequence of strokes on an output device coupled to the computing device; arranging the sequence of strokes into a chronological order based at least on when at least one stroke of the sequence of strokes was received at the touch-based interface; selecting at least a first stroke and comparing at least the first stroke to one or more characters; performing a first ranking of the one or more characters based at least in part on the comparison between the first stroke and the one or more characters; comparing a combination of the first stroke and at least a second stroke consecutive with the first stroke to the one or more characters; performing a second ranking of the one or more characters based at least on the comparison of the one or more characters with the combination of the first and second strokes; determining a confidence level that a first character approximately matches the first subset of the sequence of strokes based on at least the first ranking and the second ranking, wherein the confidence level is of at least a first confidence threshold; altering the display of the graphical representation of the first subset of the sequence of strokes based on the confidence level; and providing the first character for processing by an application executing on the computing device when the confidence level is of at least a second confidence threshold, wherein the application is designed to process characters from touch-based input. 12. The method of claim 1 , wherein determining the confidence level that the first character approximately matches the first subset of the sequence of strokes further comprises: ranking the first character based at least in part on a determined character, wherein the ranking is related to the confidence level; and selecting the first character when the ranking is above a selected threshold level.
0.66443
7,703,003
1
6
1. A system, comprising: one or more processors; and one or more memories respectively coupled to the one or more processors, wherein the one or more memories store one or more sets of program instructions that when executed by the one or more processors, cause the one or more processors to implement: a database comprising a plurality of service objects each corresponding to a different service, wherein each service object has a hierarchical structure specifying a plurality of activities and one or more service elements for each activity, wherein each activity is a procedure to be carried out in providing the corresponding service, wherein each service object includes activity data identifying the service object's respective plurality of activities and specifying the one or more service elements for each activity, wherein each service element represents a component of the corresponding activity, and wherein the database comprises a representation of each service element for inclusion in a document to be used in performing the service; wherein a particular service element of an activity of a service object stored in the database comprises at least one of: a description of the activity, an input for the activity, an output or deliverable from the activity, an assumption for the activity, information regarding responsibility for the activity, a subsidiary activity of the activity, or a sub-work plan of the activity; a document template store comprising one or more document templates, wherein each document template specifies an organization of a type of document to be used in performing a service; and a document provider configured to: identify, for a given service selected by a user, and for a given document template selected by the user, one or more service elements of one or more activities of a service object corresponding to the given service, wherein representations of the one or more service elements are to be included in a document organized in accordance with the given document template; and generate a document including representations of the one or more service elements, wherein the document is organized in accordance with the given document template, wherein the representations of the one or more service elements are included in the document without the user having to identify each representation separately.
1. A system, comprising: one or more processors; and one or more memories respectively coupled to the one or more processors, wherein the one or more memories store one or more sets of program instructions that when executed by the one or more processors, cause the one or more processors to implement: a database comprising a plurality of service objects each corresponding to a different service, wherein each service object has a hierarchical structure specifying a plurality of activities and one or more service elements for each activity, wherein each activity is a procedure to be carried out in providing the corresponding service, wherein each service object includes activity data identifying the service object's respective plurality of activities and specifying the one or more service elements for each activity, wherein each service element represents a component of the corresponding activity, and wherein the database comprises a representation of each service element for inclusion in a document to be used in performing the service; wherein a particular service element of an activity of a service object stored in the database comprises at least one of: a description of the activity, an input for the activity, an output or deliverable from the activity, an assumption for the activity, information regarding responsibility for the activity, a subsidiary activity of the activity, or a sub-work plan of the activity; a document template store comprising one or more document templates, wherein each document template specifies an organization of a type of document to be used in performing a service; and a document provider configured to: identify, for a given service selected by a user, and for a given document template selected by the user, one or more service elements of one or more activities of a service object corresponding to the given service, wherein representations of the one or more service elements are to be included in a document organized in accordance with the given document template; and generate a document including representations of the one or more service elements, wherein the document is organized in accordance with the given document template, wherein the representations of the one or more service elements are included in the document without the user having to identify each representation separately. 6. The system as recited in claim 1 , wherein the document generator generates the document without the user providing text to be included in the document.
0.831887
9,760,634
17
18
17. A non-transitory computer readable medium storing an application which when executed by at least one processor defines a content relevance model for a particular category, the application comprising: a keyword generator for identifying a set of key word sets for the particular category based on an analysis of (i) a first set of content segments previously defined as relevant to the particular category and (ii) a second set of content segments previously defined as relevant to a set of categories related to the particular category, but not relevant to the particular category, the set of key word sets comprising word sets that appear with greater frequency in the first set of content segments than in the second set of content segments; and a word pair generator for: identifying a set of pairs of word sets, each word set pair comprising a key word set identified by the keyword generator and a word set that appears within a defined context of the key word set in at least one content segment from the first and second sets of content segments; and determining scores for each of the word set pairs by comparing a first number of occurrences of the word set pair in the first set of content segments with a second number of occurrences of the word set pair in the second set of content segments, wherein the score for a particular word set pair is for use in determining the relevancy to the particular category of a new content segment that contains the particular word set pair.
17. A non-transitory computer readable medium storing an application which when executed by at least one processor defines a content relevance model for a particular category, the application comprising: a keyword generator for identifying a set of key word sets for the particular category based on an analysis of (i) a first set of content segments previously defined as relevant to the particular category and (ii) a second set of content segments previously defined as relevant to a set of categories related to the particular category, but not relevant to the particular category, the set of key word sets comprising word sets that appear with greater frequency in the first set of content segments than in the second set of content segments; and a word pair generator for: identifying a set of pairs of word sets, each word set pair comprising a key word set identified by the keyword generator and a word set that appears within a defined context of the key word set in at least one content segment from the first and second sets of content segments; and determining scores for each of the word set pairs by comparing a first number of occurrences of the word set pair in the first set of content segments with a second number of occurrences of the word set pair in the second set of content segments, wherein the score for a particular word set pair is for use in determining the relevancy to the particular category of a new content segment that contains the particular word set pair. 18. The non-transitory computer readable medium of claim 17 , wherein the application further comprises a user interface for enabling user input.
0.824029
6,141,002
23
32
23. A set top box for receiving from a broadcast center an application program and a glyph, wherein the application program includes a character for display on a television, wherein the glyph describes a graphic representation of the character, the set top box comprising: a receiver configured to receive said application program and said glyph from the broadcast center; an operating environment configured to accept one or more glyph sets; a processor configured to operably receive said application program from said receiver and execute said application program; a hash table configured to store information regarding said one or more glyph sets; and a rendering engine for rendering said character for display on the television, wherein said rendering engine is operable to determine an index using the character, use the index to retrieve information from the hash table, and use the information from the hash table to render said character for display on the television.
23. A set top box for receiving from a broadcast center an application program and a glyph, wherein the application program includes a character for display on a television, wherein the glyph describes a graphic representation of the character, the set top box comprising: a receiver configured to receive said application program and said glyph from the broadcast center; an operating environment configured to accept one or more glyph sets; a processor configured to operably receive said application program from said receiver and execute said application program; a hash table configured to store information regarding said one or more glyph sets; and a rendering engine for rendering said character for display on the television, wherein said rendering engine is operable to determine an index using the character, use the index to retrieve information from the hash table, and use the information from the hash table to render said character for display on the television. 32. The set top box as recited in claim 23, wherein said character is encoded according to a multilingual character encoding standard.
0.711207
7,823,119
1
5
1. A method of controlling the operation of a Radio Frequency Identification (RFID) system comprising: on at least one computer, performing the following steps: receiving, from a first user, a plurality of domain level RFID system constraints, wherein the domain level RFID system constraints are applicable across one or more components of the RFID system; translating the plurality of domain level RFID system constraints into RFID system level constraints, wherein the RFID system level constraints are applicable across the RFID system as a whole; and controlling the RFID system using the RFID system level constraints; receiving RFID data and generating an RFID system incident in response to the RFID data; receiving, at a system level, the RFID system incident; forwarding, at the system level, the RFID system incident to a domain level; modifying the domain level RFID system constraints in response to the RFID system incident; and translating the modified domain level RFID system constraints into modified RFID system level constraints to control the RFID system.
1. A method of controlling the operation of a Radio Frequency Identification (RFID) system comprising: on at least one computer, performing the following steps: receiving, from a first user, a plurality of domain level RFID system constraints, wherein the domain level RFID system constraints are applicable across one or more components of the RFID system; translating the plurality of domain level RFID system constraints into RFID system level constraints, wherein the RFID system level constraints are applicable across the RFID system as a whole; and controlling the RFID system using the RFID system level constraints; receiving RFID data and generating an RFID system incident in response to the RFID data; receiving, at a system level, the RFID system incident; forwarding, at the system level, the RFID system incident to a domain level; modifying the domain level RFID system constraints in response to the RFID system incident; and translating the modified domain level RFID system constraints into modified RFID system level constraints to control the RFID system. 5. The method of claim 1 wherein the system is a supply logistics system.
0.934705
9,032,343
7
8
7. The system of claim 6 , further comprising means for generating a bit mask that includes a first set of bits each having a first logical value and a second set of bits each having a second logical value, each of the first set of bits being in a location of the bitmask that corresponds to a programming bit in the programming file used by the secret portion.
7. The system of claim 6 , further comprising means for generating a bit mask that includes a first set of bits each having a first logical value and a second set of bits each having a second logical value, each of the first set of bits being in a location of the bitmask that corresponds to a programming bit in the programming file used by the secret portion. 8. The system of claim 7 , wherein the bitmask is configured to enable extraction of the programming bits for the secret portion so that they can be integrated with programming bits of a programming file generated by a third party the user that includes programming bits for the public portion of the design.
0.873874
10,095,696
12
15
12. The method of claim 11 , wherein the one or more temporal attributes and/or spatial attributes include one or more of a geolocation attribute, a device attribute, and/or a content attribute.
12. The method of claim 11 , wherein the one or more temporal attributes and/or spatial attributes include one or more of a geolocation attribute, a device attribute, and/or a content attribute. 15. The method of claim 12 , wherein the content attribute includes one or more of an action depicted within the digital media content, an activity depicted within the digital media content, and/or one or more objects depicted within the digital media content.
0.941415
8,046,222
15
19
15. A computer program product, tangibly stored on a computer-readable medium, comprising instructions operable to cause a programmable processor to: receive a probability of a n-gram identifying a word; determine a number of atomic units in the n-gram; identify a scaling weight depending on the number of atomic units in the n-gram; and apply the scaling weight to the probability of the n-gram identifying a word to determine a scaled probability of the n-gram identifying a word.
15. A computer program product, tangibly stored on a computer-readable medium, comprising instructions operable to cause a programmable processor to: receive a probability of a n-gram identifying a word; determine a number of atomic units in the n-gram; identify a scaling weight depending on the number of atomic units in the n-gram; and apply the scaling weight to the probability of the n-gram identifying a word to determine a scaled probability of the n-gram identifying a word. 19. The computer program product of claim 15 , further comprising instructions operable to cause a programmable processor to: identify lesser order n-grams, the lesser order n-grams being derived from the n-gram; receive probabilities corresponding to each of the lesser order n-grams identifying words; compare the probability of the n-gram identifying a word to the probabilities of combinations of the lesser order n-grams identifying words; and when a probability of a combination of lesser order n-grams identifying a word differs from the probability of the n-gram identifying a word by a specified threshold amount, modify the scaling weight corresponding to the probability of the n-gram identifying a word.
0.516892
9,251,791
15
16
15. A non-transitory computer-readable storage device encoded with instructions that, when executed by a data processing apparatus, cause the data processing apparatus to perform operations comprising: receiving spoken input from a user of an electronic device in an application among a plurality of applications that are capable of being executed on the electronic device; determining a category for the application; providing the spoken input and data that indicates the application category to a server that includes a speech recognition system configured to select one or more language models to generate text based on the spoken input, wherein the one or more language models are selected based on the data that indicates the application category; receiving text from the server, wherein the text represents a transcription of the spoken input; and providing the text as input to the application.
15. A non-transitory computer-readable storage device encoded with instructions that, when executed by a data processing apparatus, cause the data processing apparatus to perform operations comprising: receiving spoken input from a user of an electronic device in an application among a plurality of applications that are capable of being executed on the electronic device; determining a category for the application; providing the spoken input and data that indicates the application category to a server that includes a speech recognition system configured to select one or more language models to generate text based on the spoken input, wherein the one or more language models are selected based on the data that indicates the application category; receiving text from the server, wherein the text represents a transcription of the spoken input; and providing the text as input to the application. 16. The non-transitory computer-readable storage device of claim 15 , wherein the operations further comprise: receiving a written input from the user; determining a language of the written input; and providing a language indicator to the server based on the determined language indicating the language of the written input.
0.730897
7,613,616
1
10
1. A method for training a user to utter a sequence of commands in a game environment by using voice control, the method comprising: executing first instructions stored in memory to determine a context based on a state of the game environment, the first instructions executed using a processor; displaying a menu of available commands based on the context; prompting the user to issue a vocal utterance associated with an available command from the menu of available commands; receiving a vocal utterance from the user; executing second instructions stored in memory to match the received vocal utterance with an available command from the menu of available commands, whereby the matching of the vocal utterance with an available command selects the command, the second instructions executed using a processor; adding the selected command to a sequence of commands including commands selected since a previously executed complete command; and executing the sequence of commands when the sequence of commands forms a complete command.
1. A method for training a user to utter a sequence of commands in a game environment by using voice control, the method comprising: executing first instructions stored in memory to determine a context based on a state of the game environment, the first instructions executed using a processor; displaying a menu of available commands based on the context; prompting the user to issue a vocal utterance associated with an available command from the menu of available commands; receiving a vocal utterance from the user; executing second instructions stored in memory to match the received vocal utterance with an available command from the menu of available commands, whereby the matching of the vocal utterance with an available command selects the command, the second instructions executed using a processor; adding the selected command to a sequence of commands including commands selected since a previously executed complete command; and executing the sequence of commands when the sequence of commands forms a complete command. 10. The method of claim 1 , wherein matching includes disregarding all vocal utterances other than a vocal utterance corresponding to an available command from the menu of available commands.
0.78683
8,214,354
20
24
20. An apparatus for enforcing a referential integrity constraint between a constraint set of objects and constrained object having values that are terms of an ontology in a relational database management system, the objects in the constraint set being possible values in the constrained object and the relational database management system being implemented in a workstation having a processor and a storage device to which the processor has access and the apparatus comprising: the storage device having an association between the constrained object and the constraint set of objects, the constraint set of objects having been returned by an ontology query that is executed in the relational database system and returns the objects in the constraint set to be used to define the referential integrity constraint, wherein different constraint sets can be derived by querying the same ontology, the constrained object comprising a constrained column that is defined in the relational database management system; the constraint set associated with the constrained object is a term object with a column, values in the column being the members of the constraint set; and a referential integrity constraint for the constrained object which references the column in the term object; and the processor for executing a constraint enforcer which, when an operation in the relational database management system adds a value to the constrained object, permits the operation only if the added value is a member of the constraint set, and when a modification is performed on the ontology in the relational database management system that results in a different set of values being returned by the ontology query, altering one or more values in the constrained object that are not contained in the different set of values.
20. An apparatus for enforcing a referential integrity constraint between a constraint set of objects and constrained object having values that are terms of an ontology in a relational database management system, the objects in the constraint set being possible values in the constrained object and the relational database management system being implemented in a workstation having a processor and a storage device to which the processor has access and the apparatus comprising: the storage device having an association between the constrained object and the constraint set of objects, the constraint set of objects having been returned by an ontology query that is executed in the relational database system and returns the objects in the constraint set to be used to define the referential integrity constraint, wherein different constraint sets can be derived by querying the same ontology, the constrained object comprising a constrained column that is defined in the relational database management system; the constraint set associated with the constrained object is a term object with a column, values in the column being the members of the constraint set; and a referential integrity constraint for the constrained object which references the column in the term object; and the processor for executing a constraint enforcer which, when an operation in the relational database management system adds a value to the constrained object, permits the operation only if the added value is a member of the constraint set, and when a modification is performed on the ontology in the relational database management system that results in a different set of values being returned by the ontology query, altering one or more values in the constrained object that are not contained in the different set of values. 24. The apparatus set forth in claim 20 wherein: when a value in the constrained object is no longer contained in the different constraint set, the apparatus that alters one or more values sets the one or more values to a default value.
0.649852
9,171,265
18
22
18. A system comprising: one or more processors; and one or more computer-readable media storing computer-executable instructions that, when executed on the one or more processors, cause the one or more processors to perform acts comprising: publishing a request to a pool of human workers via a crowdsourcing electronic marketplace to request the pool of human workers to locate documents for categorization using a classifier and to request contact information of candidates associated with the documents, wherein the candidates are not included in the pool of human workers; receiving a document from a human worker included in the pool of human workers, wherein the document is associated with a candidate that is not included in the pool of human workers; determining that the document is publicly available based at least in part on receiving at least one of a publicly-accessible uniform resource locator (URL) associated with the document or the contact information of the candidate; and categorizing, using the classifier, the document into one of multiple classes based, at least in part, on determining that the document is publicly available and on the contact information of the candidate being received from the human worker; and wherein the trained classifier applies predetermined criteria to classify the document.
18. A system comprising: one or more processors; and one or more computer-readable media storing computer-executable instructions that, when executed on the one or more processors, cause the one or more processors to perform acts comprising: publishing a request to a pool of human workers via a crowdsourcing electronic marketplace to request the pool of human workers to locate documents for categorization using a classifier and to request contact information of candidates associated with the documents, wherein the candidates are not included in the pool of human workers; receiving a document from a human worker included in the pool of human workers, wherein the document is associated with a candidate that is not included in the pool of human workers; determining that the document is publicly available based at least in part on receiving at least one of a publicly-accessible uniform resource locator (URL) associated with the document or the contact information of the candidate; and categorizing, using the classifier, the document into one of multiple classes based, at least in part, on determining that the document is publicly available and on the contact information of the candidate being received from the human worker; and wherein the trained classifier applies predetermined criteria to classify the document. 22. A system as recited in claim 18 , the acts further comprising: providing documents categorized into a first of the multiple classes for further analysis; and refraining from providing documents categorized into a second of the multiple classes for further analysis.
0.804221
9,280,535
4
6
4. The method of claim 1 , further comprising representing the at least one relationship as an edge between two nodes in a graph.
4. The method of claim 1 , further comprising representing the at least one relationship as an edge between two nodes in a graph. 6. The method of claim 4 , wherein the second conditional random field is a skip-chain conditional random field, and wherein the edge is a skip-edge.
0.96629
9,619,024
13
18
13. A virtual inputting method, comprising: collecting bioelectrical signals and acceleration signals reflecting a user's gesture; performing preprocessing for the collected bioelectrical signals and the collected acceleration signals; performing segmentation processing for the preprocessed bioelectrical signals and the preprocessed acceleration signals so as to obtain a plurality of gesture segments; extracting feature values from the bioelectrical signals and the acceleration signals for respective gesture segments; combining the extracted feature values to form a combined feature vector; performing gesture recognition based on the combined feature vector; and obtaining characters corresponding to the recognized gesture according to a predetermined mapping relationship between characters and gestures, wherein the segmentation processing comprises: determining starting points and ending points for the preprocessed bioelectrical signals and the preprocessed acceleration signals respectively; and averaging the starting points so as to obtain a starting point of a gesture segment, and averaging the ending points so as to obtain an ending point of the gesture segment.
13. A virtual inputting method, comprising: collecting bioelectrical signals and acceleration signals reflecting a user's gesture; performing preprocessing for the collected bioelectrical signals and the collected acceleration signals; performing segmentation processing for the preprocessed bioelectrical signals and the preprocessed acceleration signals so as to obtain a plurality of gesture segments; extracting feature values from the bioelectrical signals and the acceleration signals for respective gesture segments; combining the extracted feature values to form a combined feature vector; performing gesture recognition based on the combined feature vector; and obtaining characters corresponding to the recognized gesture according to a predetermined mapping relationship between characters and gestures, wherein the segmentation processing comprises: determining starting points and ending points for the preprocessed bioelectrical signals and the preprocessed acceleration signals respectively; and averaging the starting points so as to obtain a starting point of a gesture segment, and averaging the ending points so as to obtain an ending point of the gesture segment. 18. The method of claim 13 , wherein the mapping relationship between characters and recognized gesture result is a mapping relationship between characters and different parts of four fingers except thumb.
0.8881
8,099,283
4
5
4. The method of claim 3 , wherein the determining step further includes: accessing a first XML document configured for storing user-specific application state and attribute information; and determining whether the first XML document for the corresponding user specifies the presence of the user-specific XML document for the requested prescribed voice application operation.
4. The method of claim 3 , wherein the determining step further includes: accessing a first XML document configured for storing user-specific application state and attribute information; and determining whether the first XML document for the corresponding user specifies the presence of the user-specific XML document for the requested prescribed voice application operation. 5. The method of claim 4 , wherein the step of accessing an external database includes accessing an Internet Message Access Protocol (IMAP) database for retrieval of the user-specific XML document.
0.74282
8,301,454
25
26
25. A non-transitory computer-readable medium having a computer-executable component for providing cues to a user while capturing an utterance, the computer-executable component comprising: a cue-providing component configured to: cause an electronic communication device to capture a user utterance; and cause the electronic communication device to provide to the user in at least near real-time one or more cues associated with the user utterance, wherein said providing includes, for each portion of a plurality of portions of the user utterance: causing the electronic communication device to communicate data representative of the respective portion of the user utterance to a remote electronic device; in response to the communication of data representative of the respective portion of the user utterance, causing the electronic communication device to receive data representative of at least one parameter associated with the respective portion of the user utterance; and causing the electronic communication device to provide at least one cue based at least in part on the at least one parameter associated with the respective portion of the user utterance; wherein the electronic communication device is caused to provide at least one cue of the one or more cues prior to completion of capturing the user utterance.
25. A non-transitory computer-readable medium having a computer-executable component for providing cues to a user while capturing an utterance, the computer-executable component comprising: a cue-providing component configured to: cause an electronic communication device to capture a user utterance; and cause the electronic communication device to provide to the user in at least near real-time one or more cues associated with the user utterance, wherein said providing includes, for each portion of a plurality of portions of the user utterance: causing the electronic communication device to communicate data representative of the respective portion of the user utterance to a remote electronic device; in response to the communication of data representative of the respective portion of the user utterance, causing the electronic communication device to receive data representative of at least one parameter associated with the respective portion of the user utterance; and causing the electronic communication device to provide at least one cue based at least in part on the at least one parameter associated with the respective portion of the user utterance; wherein the electronic communication device is caused to provide at least one cue of the one or more cues prior to completion of capturing the user utterance. 26. The non-transitory computer-readable medium of claim 25 , wherein each respective portion of the user utterance comprises at least one of a syllable, a word, a phrase, or a sentence.
0.962874
9,866,506
1
9
1. A method of controlling a group chat, the method comprising: controlling, by a controller, a display unit to display a group chatting window for the group chat, if a request of a user of a portable device for the group chat is detected through an input unit; detecting, by the controller, a request for an extraction of a dialog for at least one certain conversation partner of conversation partners in the group chat; if the request for the extraction of the dialog is detected, extracting, by the controller, the dialog of the at least one certain conversation partner from one or more dialogs in the group chat; and controlling, by the controller, the display unit to display the extracted dialog on a sub-chatting window, wherein the controller extracts automatically the dialog of the at least one certain conversation partner during the group chatting, and controls the display unit to display the dialog on the sub-chatting window.
1. A method of controlling a group chat, the method comprising: controlling, by a controller, a display unit to display a group chatting window for the group chat, if a request of a user of a portable device for the group chat is detected through an input unit; detecting, by the controller, a request for an extraction of a dialog for at least one certain conversation partner of conversation partners in the group chat; if the request for the extraction of the dialog is detected, extracting, by the controller, the dialog of the at least one certain conversation partner from one or more dialogs in the group chat; and controlling, by the controller, the display unit to display the extracted dialog on a sub-chatting window, wherein the controller extracts automatically the dialog of the at least one certain conversation partner during the group chatting, and controls the display unit to display the dialog on the sub-chatting window. 9. The method of claim 1 , further comprising: selecting a certain conversation partner to be added if a request for an addition of the certain conversation partner is detected; extracting a dialog of the certain conversation partner to be added; and displaying the extracted dialog of the certain conversation partner to be added on the sub-chatting window.
0.632444
8,781,991
1
36
1. An emotion recognition apparatus, comprising: a data collection unit configured to collect sensing data from a terminal; a first emotion value acquisition unit configured to acquire a first emotion value corresponding to a first axis of a multidimensional emotion model based on an amount or an intensity of the sensing data; a second emotion value acquisition unit configured to acquire a second emotion value corresponding to a second axis of the multidimensional emotion model based on a textual meaning of the sensing data; and an emotion estimation unit configured to estimate an emotional state of a user based on the first emotion value and the second emotion value.
1. An emotion recognition apparatus, comprising: a data collection unit configured to collect sensing data from a terminal; a first emotion value acquisition unit configured to acquire a first emotion value corresponding to a first axis of a multidimensional emotion model based on an amount or an intensity of the sensing data; a second emotion value acquisition unit configured to acquire a second emotion value corresponding to a second axis of the multidimensional emotion model based on a textual meaning of the sensing data; and an emotion estimation unit configured to estimate an emotional state of a user based on the first emotion value and the second emotion value. 36. The emotion recognition apparatus of claim 1 , wherein the first emotion value acquisition unit is configured to acquire the first emotion value based on a pattern of a user input using a physical contact with the terminal.
0.871896
8,688,452
13
18
13. A non-transitory computer-readable storage device in which computer-executable code is stored, the computer-executable code configured to cause a computing device to execute the steps of: for dynamically generating a speech recognition grammar, the method comprising: determining a target entry; accessing a plurality of potential distractors; selecting at least one distractor from the plurality of potential distractors, wherein the selected at least one distractor is selected based upon an acoustic dissimilarity between the distractor and the target entry; and generating a speech recognition grammar that includes the target entry and the at least one distractor.
13. A non-transitory computer-readable storage device in which computer-executable code is stored, the computer-executable code configured to cause a computing device to execute the steps of: for dynamically generating a speech recognition grammar, the method comprising: determining a target entry; accessing a plurality of potential distractors; selecting at least one distractor from the plurality of potential distractors, wherein the selected at least one distractor is selected based upon an acoustic dissimilarity between the distractor and the target entry; and generating a speech recognition grammar that includes the target entry and the at least one distractor. 18. The non-transitory computer-readable storage device of claim 13 , wherein the target entry is a character string comprising letters of a pre-selected alphabet, wherein the plurality of potential distractors comprises the pre-selected alphabet, and wherein the step of selecting at least one distractor comprises iteratively selecting for each character of the character string every letter of the pre-selected alphabet that is acoustically dissimilar to a particular character of the character string.
0.500988
9,251,217
1
2
1. A method, comprising: receiving a search query from a member of a social network; identifying two or more categories of data within the social network that include information satisfying the received search query; ranking the identified two or more categories of data based on a selection criteria associated with the member of the social network and including a quality metric assigned to the information satisfying the received search query within the categories of data, the quality metric including: a percentage of users who have previously selected the at least one search query suggestion; and a percentage of users who have previously selected displayed results associated with the search query; and presenting at least one search query suggestion based on the ranking of the identified categories of data within the social network.
1. A method, comprising: receiving a search query from a member of a social network; identifying two or more categories of data within the social network that include information satisfying the received search query; ranking the identified two or more categories of data based on a selection criteria associated with the member of the social network and including a quality metric assigned to the information satisfying the received search query within the categories of data, the quality metric including: a percentage of users who have previously selected the at least one search query suggestion; and a percentage of users who have previously selected displayed results associated with the search query; and presenting at least one search query suggestion based on the ranking of the identified categories of data within the social network. 2. The method of claim 1 , wherein ranking the identified two or more categories of data based on a selection criteria includes ranking the identified two or more categories of data based on member attributes associated with the member of the social network.
0.769643
7,900,208
2
4
2. A system as described in claim 1 , said processor further configured to validate said decoded message, based on said particular one of the plurality of extensible document format protocol plug-ins, to produce a validated message.
2. A system as described in claim 1 , said processor further configured to validate said decoded message, based on said particular one of the plurality of extensible document format protocol plug-ins, to produce a validated message. 4. A system as described in claim 2 , said processor further configured to translate said validated message, based on said particular one of the plurality of extensible document format protocol plug-ins, into said message of said native format.
0.934338
7,483,824
2
4
2. The self-checking test generator of claim 1 further comprising: an instruction selector for selecting the selected instruction from a plurality of instructions intended for executing on the target device; a resource manager that determines when an operation determined by the selected instruction is capable of being executed by the plurality of fuzzy models wherein resources required by the selected instruction are not contained in the plurality of unknown models; a value generator that generates operand or pointer values for use by the selected instruction; and a self-check instruction generator that generates the self-check instruction to verify a result generated by the selected instruction; wherein the instruction selector selects a different instruction from the plurality of instructions when the resource manager determines that the operation determined by the selected instruction requires an unknown model in the plurality of unknown models, the instruction writer not writing selected instructions to the self-check test program for selected instructions that require unknown models, whereby instructions that perform operations that require unknown models are not added to the self-check test program.
2. The self-checking test generator of claim 1 further comprising: an instruction selector for selecting the selected instruction from a plurality of instructions intended for executing on the target device; a resource manager that determines when an operation determined by the selected instruction is capable of being executed by the plurality of fuzzy models wherein resources required by the selected instruction are not contained in the plurality of unknown models; a value generator that generates operand or pointer values for use by the selected instruction; and a self-check instruction generator that generates the self-check instruction to verify a result generated by the selected instruction; wherein the instruction selector selects a different instruction from the plurality of instructions when the resource manager determines that the operation determined by the selected instruction requires an unknown model in the plurality of unknown models, the instruction writer not writing selected instructions to the self-check test program for selected instructions that require unknown models, whereby instructions that perform operations that require unknown models are not added to the self-check test program. 4. The self-checking test generator of claim 2 wherein the target device is a processor that executes instructions in an instruction set that includes the plurality of instructions.
0.962039
9,836,301
7
8
7. A component discovery system comprising: a processor; and a memory storing machine readable instructions that when executed by the processor cause the processor to: determine business classes by excluding packages and classes in source code; extract textual features from the business classes by extracting packaging information for each of the business classes, wherein extracting packaging information for each of the business classes includes extracting concept words embedded in business class names, extracting a packaging hierarchy as a string, and extracting a substring that describes the packaging hierarchy; estimate similarity for business class pairs based on the extracted features; cluster the business classes based on the similarity by generating seed populations by sorting a list of edges between business class pairs, and generating, based on the seed populations, a set of seed clusters, wherein clusters generated by the clustering represent components of the source code; and determine interfaces for the components based on the clustering.
7. A component discovery system comprising: a processor; and a memory storing machine readable instructions that when executed by the processor cause the processor to: determine business classes by excluding packages and classes in source code; extract textual features from the business classes by extracting packaging information for each of the business classes, wherein extracting packaging information for each of the business classes includes extracting concept words embedded in business class names, extracting a packaging hierarchy as a string, and extracting a substring that describes the packaging hierarchy; estimate similarity for business class pairs based on the extracted features; cluster the business classes based on the similarity by generating seed populations by sorting a list of edges between business class pairs, and generating, based on the seed populations, a set of seed clusters, wherein clusters generated by the clustering represent components of the source code; and determine interfaces for the components based on the clustering. 8. The component discovery system according to claim 7 , wherein the machine readable instructions to extract the textual features from the business classes further comprise machine readable instructions that when executed by the processor further cause the processor to: extract inheritance and interface realization relationships for each of the business classes.
0.716615
8,700,592
1
9
1. A method of displaying relevance ranked results on a computer used in Internet searching, comprising: generating a set of queries; executing each of the set of queries on an Internet search engine to develop a corresponding result set; selecting a limited number of documents from each corresponding result set; developing a subjective rating for each of the limited number of documents with respect to a subjective criteria, the subjective criteria including a count of clicks for each of the limited number of documents, the count of clicks decaying exponentially over time and including clicks where the query producing each document is unrelated to the generated set of queries; programming a machine learning categorization tool at least in part using the subjective rating of each of the limited number of documents; performing a query that returns a set of documents; generating an absolute relevance score for at least a portion of the set of documents using the machine learning categorization tool; creating a subset of documents from the at least a portion of the set of documents, each document in the subset of documents having its respective absolute relevance score above a threshold value; selecting one or more related refinements based on characteristics of documents in the subset of documents; displaying on the computer the one or more related refinements; and displaying on the computer the subset of documents in an order by highest relevance to the query based on the absolute relevance score of each document of the subset of documents.
1. A method of displaying relevance ranked results on a computer used in Internet searching, comprising: generating a set of queries; executing each of the set of queries on an Internet search engine to develop a corresponding result set; selecting a limited number of documents from each corresponding result set; developing a subjective rating for each of the limited number of documents with respect to a subjective criteria, the subjective criteria including a count of clicks for each of the limited number of documents, the count of clicks decaying exponentially over time and including clicks where the query producing each document is unrelated to the generated set of queries; programming a machine learning categorization tool at least in part using the subjective rating of each of the limited number of documents; performing a query that returns a set of documents; generating an absolute relevance score for at least a portion of the set of documents using the machine learning categorization tool; creating a subset of documents from the at least a portion of the set of documents, each document in the subset of documents having its respective absolute relevance score above a threshold value; selecting one or more related refinements based on characteristics of documents in the subset of documents; displaying on the computer the one or more related refinements; and displaying on the computer the subset of documents in an order by highest relevance to the query based on the absolute relevance score of each document of the subset of documents. 9. The method of claim 1 , further comprising: developing a boosted characteristic related to the at least a portion of the set of documents; re-generating the absolute relevance score for each document of the at least a portion of the set of documents based on the boosted characteristic; and re-creating the subset of documents with the regenerated absolute relevance score.
0.634241
7,735,073
1
9
1. A tangible storage medium having computer readable program code for performing data profiling, comprising: a first set of instructions, stored in at least one computer readable storage medium and executable by at least one processing unit, that tags instruction instances, that may consume execution time based on loading of data, with identifiers that describe the instruction instances with source-level data object language constructs; a second set of instructions, stored in the at least one computer readable storage medium and executable by the at least one processing unit, that identifies an instruction instance of the tagged instruction instances that corresponds to a runtime event detected in execution of code that includes the identified instruction instance; a third set of instructions, stored in the at least one computer readable storage medium and executable by the at least one processing unit, that attributes the runtime event detected to source-level data objects describing units of data identifiable in source code, wherein the attributing is based at least in part on a predefined association between the identified instruction instance in executable code and the source-level data object language construct corresponding thereto.
1. A tangible storage medium having computer readable program code for performing data profiling, comprising: a first set of instructions, stored in at least one computer readable storage medium and executable by at least one processing unit, that tags instruction instances, that may consume execution time based on loading of data, with identifiers that describe the instruction instances with source-level data object language constructs; a second set of instructions, stored in the at least one computer readable storage medium and executable by the at least one processing unit, that identifies an instruction instance of the tagged instruction instances that corresponds to a runtime event detected in execution of code that includes the identified instruction instance; a third set of instructions, stored in the at least one computer readable storage medium and executable by the at least one processing unit, that attributes the runtime event detected to source-level data objects describing units of data identifiable in source code, wherein the attributing is based at least in part on a predefined association between the identified instruction instance in executable code and the source-level data object language construct corresponding thereto. 9. The tangible storage medium having computer readable program code of claim 1 wherein the instruction instance includes one or more of an instance of an instruction from a processor instruction set, an instance of an operation corresponding to a processor instruction set, an instance of a virtual machine instruction, or an instance of a byte code.
0.5125