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
|
|---|---|---|---|---|---|
8,090,740 | 13 | 14 | 13. The method of claim 12 wherein more than one search query is received from different search engines that are used to conduct the more than one search query. | 13. The method of claim 12 wherein more than one search query is received from different search engines that are used to conduct the more than one search query. 14. The method of claim 13 further comprising displaying an indicator associated with the name of the search engine used to perform the search query next to each search query. | 0.959055 |
7,584,175 | 7 | 9 | 7. A computer implemented system for automatically generating a description of a document, comprising: a document retrieval system executed by a computer and adapted to retrieve a document in response to a query, the query including a query phase, the document including a plurality of sentences; and a document description system executed by a computer and adapted to: calculate, for sentences of the document, a first count that includes a measure of a number of instances in which the query phrase occurs in the sentences; select one or more of the sentences of the document based on their respective counts, the selecting further comprising: sorting sentences of the document in declining order of their respective counts, the first count constituting a primary sort key, a second count that includes a measure of a number of instances in which any of one or more related phrases of the query phrase occurs in the respective sentences of the document constituting a secondary sort key, and a third count that includes a measure of a number of instances in which any of one or more phrase extensions of the query phrase occurs in the respective sentences of the document constituting a tertiary sort key, and selecting a number of the sentences of the document having the highest counts; and form a description of the document from the selected sentences. | 7. A computer implemented system for automatically generating a description of a document, comprising: a document retrieval system executed by a computer and adapted to retrieve a document in response to a query, the query including a query phase, the document including a plurality of sentences; and a document description system executed by a computer and adapted to: calculate, for sentences of the document, a first count that includes a measure of a number of instances in which the query phrase occurs in the sentences; select one or more of the sentences of the document based on their respective counts, the selecting further comprising: sorting sentences of the document in declining order of their respective counts, the first count constituting a primary sort key, a second count that includes a measure of a number of instances in which any of one or more related phrases of the query phrase occurs in the respective sentences of the document constituting a secondary sort key, and a third count that includes a measure of a number of instances in which any of one or more phrase extensions of the query phrase occurs in the respective sentences of the document constituting a tertiary sort key, and selecting a number of the sentences of the document having the highest counts; and form a description of the document from the selected sentences. 9. The system of claim 7 , wherein a phrase g j is a related phrase of another phrase g k where an information gain of g j with respect to g k exceeds a predetermined threshold, the information gain being a function of both actual and expected co-occurrence rates of g j and g k . | 0.726563 |
6,038,561 | 4 | 9 | 4. A method of analyzing and displaying information regarding a plurality of documents, the method comprising the steps of: generating first and second different representations of each document; for selected pairs of documents, determining (a) a first utility measure based on the respective first representations of the documents in that pair, and (b) a second utility measure based on the respective second representations of the documents in that pair; and displaying a scatter plot in an area bounded by first and second non-parallel axes where each selected pair is represented by a point having a first coordinate along the first axis equal to the first utility measure and a second coordinate along the second axis equal to the second utility measure. | 4. A method of analyzing and displaying information regarding a plurality of documents, the method comprising the steps of: generating first and second different representations of each document; for selected pairs of documents, determining (a) a first utility measure based on the respective first representations of the documents in that pair, and (b) a second utility measure based on the respective second representations of the documents in that pair; and displaying a scatter plot in an area bounded by first and second non-parallel axes where each selected pair is represented by a point having a first coordinate along the first axis equal to the first utility measure and a second coordinate along the second axis equal to the second utility measure. 9. The method of claim 4 wherein the documents are publications. | 0.969524 |
10,055,584 | 1 | 4 | 1. A method for obtaining at least one virus signature, the method comprising: obtaining at least one text string of characters sequence contained in program code lines of virus samples of a virus sample set; selecting a virus signatures candidate from the at least one text string of characters sequence according to a first frequency at which each of the at least one text string of characters sequence occurs in program code lines of non-virus samples of a non-virus sample set, and a second frequency at which each of the at least one text string of characters sequence occurs in the program code lines of virus samples of the virus sample set; calculating an information entropy of the virus signatures candidate, the information entropy consisting of a value calculated according to: a number of virus samples among the virus sample set containing the virus signatures candidate, a number of virus samples among the virus sample set not containing the virus signatures candidate, a number of non-virus samples among the non-virus sample set containing the virus signatures candidate, and a number of non-virus samples among the non-virus sample set not containing the virus signatures candidate; and determining whether the virus signatures candidate qualifies as a virus signature according to the calculated information entropy. | 1. A method for obtaining at least one virus signature, the method comprising: obtaining at least one text string of characters sequence contained in program code lines of virus samples of a virus sample set; selecting a virus signatures candidate from the at least one text string of characters sequence according to a first frequency at which each of the at least one text string of characters sequence occurs in program code lines of non-virus samples of a non-virus sample set, and a second frequency at which each of the at least one text string of characters sequence occurs in the program code lines of virus samples of the virus sample set; calculating an information entropy of the virus signatures candidate, the information entropy consisting of a value calculated according to: a number of virus samples among the virus sample set containing the virus signatures candidate, a number of virus samples among the virus sample set not containing the virus signatures candidate, a number of non-virus samples among the non-virus sample set containing the virus signatures candidate, and a number of non-virus samples among the non-virus sample set not containing the virus signatures candidate; and determining whether the virus signatures candidate qualifies as a virus signature according to the calculated information entropy. 4. The method according to claim 1 , wherein the second frequency at which each of the at least one text string of characters sequence occurs in the virus sample set is determined by: obtaining a number of virus samples of the virus sample set containing each of the at least one text string of characters sequence; and calculating the second frequency at which each of the at least one text string of characters sequence occurs in the virus sample set according to the number of virus samples containing each of the at least one text string of characters sequence. | 0.804498 |
7,685,566 | 12 | 14 | 12. The computer of claim 10 , wherein the instruction comprises send, and the message comprises one of null, atom, collection, and element. | 12. The computer of claim 10 , wherein the instruction comprises send, and the message comprises one of null, atom, collection, and element. 14. The computer of claim 12 , wherein the collection comprises one an unordered collection and an ordered collection. | 0.95156 |
8,626,804 | 1 | 3 | 1. A method of connecting to a virtual community based on any web resource in the Internet being accessed by at least one user, the method comprising: providing a browser plugin or helper object operable to: integrate with the at least one user's web browser; detect the at least one user's browsing activities; automatically create a virtual community for users to interact and to store meta information for said web resource corresponding to any accessed web resource if said user is a first user to access said web resource and said virtual community does not yet exist, otherwise, join to an existing virtual community corresponding to said accessed web resource; start a connection between the at least one user's web browser and the virtual community based on the presently accessed web resource; and retrieve information related to the virtual community; and allow community members to communicate with users outside said virtual community using said connections. | 1. A method of connecting to a virtual community based on any web resource in the Internet being accessed by at least one user, the method comprising: providing a browser plugin or helper object operable to: integrate with the at least one user's web browser; detect the at least one user's browsing activities; automatically create a virtual community for users to interact and to store meta information for said web resource corresponding to any accessed web resource if said user is a first user to access said web resource and said virtual community does not yet exist, otherwise, join to an existing virtual community corresponding to said accessed web resource; start a connection between the at least one user's web browser and the virtual community based on the presently accessed web resource; and retrieve information related to the virtual community; and allow community members to communicate with users outside said virtual community using said connections. 3. The method of claim 1 , wherein the browser plugin or helper object is provided either manually or automatically without the at least one user's intervention. | 0.729866 |
8,377,067 | 8 | 10 | 8. The combination according to claim 7 wherein the receiver has two upstanding arms forming a channel therebetween for receiving a rod and the tool has a pair of spaced legs with each of the legs engaging a respective arm, when joined. | 8. The combination according to claim 7 wherein the receiver has two upstanding arms forming a channel therebetween for receiving a rod and the tool has a pair of spaced legs with each of the legs engaging a respective arm, when joined. 10. The combination according to claim 8 wherein lower ends of the legs extend so as to be aligned with a rod in the channel when the tool and receiver are joined and wherein each leg includes a lower cutout that is sized, shaped and aligned to straddle the rod when the tool is rotated relative to the receiver to remove the tool from the receiver by disengaging the projection from the groove. | 0.830034 |
9,582,610 | 1 | 7 | 1. A computer-implemented method, comprising: receiving a user search topic; concurrently presenting, on a display of a computing device, a collage template and search results for the user search topic, wherein the collage template comprises a grid of rectangles comprising a collage; automatically populating a first user-selected search result in a portion of the rectangles of the grid, a number and a relative positioning of the rectangles of the portion being based at least in part on a first aspect ratio of the first user-selected search result; subsequent to the automatically populating the first user-selected search result, automatically populating a second user-selected search result in the grid by repositioning the first user-selected search result based at least on a second aspect ratio of the second user-selected search result; and, automatically populating additional user-selected search results into unpopulated rectangles of the grid. | 1. A computer-implemented method, comprising: receiving a user search topic; concurrently presenting, on a display of a computing device, a collage template and search results for the user search topic, wherein the collage template comprises a grid of rectangles comprising a collage; automatically populating a first user-selected search result in a portion of the rectangles of the grid, a number and a relative positioning of the rectangles of the portion being based at least in part on a first aspect ratio of the first user-selected search result; subsequent to the automatically populating the first user-selected search result, automatically populating a second user-selected search result in the grid by repositioning the first user-selected search result based at least on a second aspect ratio of the second user-selected search result; and, automatically populating additional user-selected search results into unpopulated rectangles of the grid. 7. The computer-implemented method of claim 1 , wherein the automatically populating additional user-selected search results is performed left to right on the collage template or top to bottom on the collage template. | 0.787255 |
8,192,469 | 1 | 2 | 1. A dynamic spine stabilization system comprising: a first horizontal rod having a first end and a second end; a mount extending from the first horizontal rod midway between the first end and the second end; a first bone anchor connectable to the first end of the first horizontal rod and configured to engage a first pedicle of a first vertebra, and a second bone anchor connectable to the second end of the second horizontal rod and configured to engage a second pedicle of the first vertebra; a second horizontal rod having a third end and a fourth end; a third bone anchor connectable to the third end of the second horizontal rod and configured to engage a third pedicle of a second vertebra, and a fourth bone anchor connectable to the fourth end of the second horizontal rod and configured to engage a fourth pedicle of the second vertebra; a deflection rod connected to the mount of the first horizontal rod, the deflection rod having a fifth end extending away from the mount substantially parallel to the first horizontal rod; and a vertical rod connected between the fifth end of the deflection rod and the second horizontal rod, and a pivotable joint located where the vertical rod is connected to the fifth end of the deflection rod; such that, when secured between the first vertebra and second vertebra, the vertical rod transmits load from the second vertebra to the deflection rod; the deflection rod transmits load to the mount; the mount transmits load to the first horizontal rod; and the first horizontal rod distributes said load to the first pedicle and the second pedicle of the first vertebra via the first bone anchor and the second bone anchor. | 1. A dynamic spine stabilization system comprising: a first horizontal rod having a first end and a second end; a mount extending from the first horizontal rod midway between the first end and the second end; a first bone anchor connectable to the first end of the first horizontal rod and configured to engage a first pedicle of a first vertebra, and a second bone anchor connectable to the second end of the second horizontal rod and configured to engage a second pedicle of the first vertebra; a second horizontal rod having a third end and a fourth end; a third bone anchor connectable to the third end of the second horizontal rod and configured to engage a third pedicle of a second vertebra, and a fourth bone anchor connectable to the fourth end of the second horizontal rod and configured to engage a fourth pedicle of the second vertebra; a deflection rod connected to the mount of the first horizontal rod, the deflection rod having a fifth end extending away from the mount substantially parallel to the first horizontal rod; and a vertical rod connected between the fifth end of the deflection rod and the second horizontal rod, and a pivotable joint located where the vertical rod is connected to the fifth end of the deflection rod; such that, when secured between the first vertebra and second vertebra, the vertical rod transmits load from the second vertebra to the deflection rod; the deflection rod transmits load to the mount; the mount transmits load to the first horizontal rod; and the first horizontal rod distributes said load to the first pedicle and the second pedicle of the first vertebra via the first bone anchor and the second bone anchor. 2. The system of claim 1 wherein: said deflection rod is made of a superelastic material. | 0.919238 |
9,087,033 | 9 | 10 | 9. A computer implemented method comprising: rendering an interface for a resource application of a client device that includes a display area configured to present a resource; presenting the resource in the display area; exposing an annotation portion in the interface that is configured to enable input of annotations for the presented resource in accordance with a location setting of the client device associated with a user profile, the presented resource unmodified by the annotations, wherein the user profile is one of at least two user profiles associated with a user of the client device, and wherein each of the at least two user profiles is associated with a different location of the client device; receiving an annotation input via the annotation portion; and communicating with an annotation server to store the annotation for the presented resource at predetermined times in response to the receiving the annotation. | 9. A computer implemented method comprising: rendering an interface for a resource application of a client device that includes a display area configured to present a resource; presenting the resource in the display area; exposing an annotation portion in the interface that is configured to enable input of annotations for the presented resource in accordance with a location setting of the client device associated with a user profile, the presented resource unmodified by the annotations, wherein the user profile is one of at least two user profiles associated with a user of the client device, and wherein each of the at least two user profiles is associated with a different location of the client device; receiving an annotation input via the annotation portion; and communicating with an annotation server to store the annotation for the presented resource at predetermined times in response to the receiving the annotation. 10. The computer implemented method of claim 9 , wherein the communicating comprises communicating according to a scheduled interval. | 0.910858 |
6,073,127 | 1 | 5 | 1. A method for creating a business simulation utilizing a rule-based expert system with a spreadsheet object component that includes data and calculations required for the business simulation and communication of information to provide a dynamic, goal based educational learning experience, comprising the steps of: (a) accessing the information in the spreadsheet object component of the rule-based expert system to retrieve information indicative of a goal and presenting the goal on a display; (b) utilizing the information in the spreadsheet object component of the rule-based expert system to integrate goal-based remediation learning information feedback in a structured, dynamic business simulation designed by a profiling component to motivate accomplishment of the goal; (c) monitoring answers to questions posed to evaluate progress toward the goal utilizing the spreadsheet object component of the rule-based expert system and providing dynamic, goal-based, remediation learning information feedback from a remediation object component including a knowledge system and a software tutor comprising an artificial intelligence engine which generates individualized coaching messages that further motivates accomplishment of the goal; and (d) analyzing the answers from the student utilizing system tools to compare the answers with a standard for achieving the goal. | 1. A method for creating a business simulation utilizing a rule-based expert system with a spreadsheet object component that includes data and calculations required for the business simulation and communication of information to provide a dynamic, goal based educational learning experience, comprising the steps of: (a) accessing the information in the spreadsheet object component of the rule-based expert system to retrieve information indicative of a goal and presenting the goal on a display; (b) utilizing the information in the spreadsheet object component of the rule-based expert system to integrate goal-based remediation learning information feedback in a structured, dynamic business simulation designed by a profiling component to motivate accomplishment of the goal; (c) monitoring answers to questions posed to evaluate progress toward the goal utilizing the spreadsheet object component of the rule-based expert system and providing dynamic, goal-based, remediation learning information feedback from a remediation object component including a knowledge system and a software tutor comprising an artificial intelligence engine which generates individualized coaching messages that further motivates accomplishment of the goal; and (d) analyzing the answers from the student utilizing system tools to compare the answers with a standard for achieving the goal. 5. A method for creating a business simulation utilizing a rule-based expert system with a spreadsheet object component to provide a goal based educational learning experience as recited in claim 1, wherein the dynamic information includes tie-synchronized multimedia information. | 0.501779 |
7,529,744 | 1 | 18 | 1. A method executed on a computer system comprising: Receiving one or more initial search terms describing one or more objects in a server management system; Automatically determining one or more suggested search terms in response to the receiving the one or more initial search terms; Displaying the one or more suggested search terms to the user; Receiving a user selection of a subset of the one or more suggested search terms; Searching for object definitions which match the one or more search terms; Determining one or more matching objects corresponding to the object definitions which match the one or more search terms; and Reporting the one or more matching objects, wherein reporting the one or more matching objects comprises reporting that a first matching object is defined in at least a first management context and a second management context, wherein the first management context relates to management of a first category of resources, and wherein the second management context relates to management of a second category of resources. | 1. A method executed on a computer system comprising: Receiving one or more initial search terms describing one or more objects in a server management system; Automatically determining one or more suggested search terms in response to the receiving the one or more initial search terms; Displaying the one or more suggested search terms to the user; Receiving a user selection of a subset of the one or more suggested search terms; Searching for object definitions which match the one or more search terms; Determining one or more matching objects corresponding to the object definitions which match the one or more search terms; and Reporting the one or more matching objects, wherein reporting the one or more matching objects comprises reporting that a first matching object is defined in at least a first management context and a second management context, wherein the first management context relates to management of a first category of resources, and wherein the second management context relates to management of a second category of resources. 18. The method of claim 1 , wherein the first management context comprises a server management context; wherein the first category of resources comprises a plurality of objects usable for server management; wherein the second management context comprises a storage management context; and wherein the second category of resources comprises a plurality of objects usable for storage management. | 0.777966 |
10,102,203 | 14 | 16 | 14. The non-transitory computer-readable medium of claim 13 , further comprising: ranking each grapheme representation in the second language to produce a rank list, wherein the ranking is based on a likelihood that a grapheme representation in the second language sounds similar to a pronunciation sound of the string of characters in the second language; and filtering the ranked list to produce a subset of graphene representations in the second language. | 14. The non-transitory computer-readable medium of claim 13 , further comprising: ranking each grapheme representation in the second language to produce a rank list, wherein the ranking is based on a likelihood that a grapheme representation in the second language sounds similar to a pronunciation sound of the string of characters in the second language; and filtering the ranked list to produce a subset of graphene representations in the second language. 16. The non-transitory computer-readable medium of claim 14 , further comprising determining a second composite weight for the one or more grapheme representations based on the second data structure. | 0.956398 |
8,713,025 | 11 | 18 | 11. A method, comprising: using a computer and a mobile access device to complete processing comprising: obtaining a subject entity definition of a subject entity, a node depth criteria and an impact cutoff criteria; aggregating and preparing a plurality of data items that include data related to the subject entity for processing, wherein the data comprises at least one entity function, one or more entity function measures and a creation date for each of the plurality of data items; storing the aggregated plurality of data items in one or more context layers by a component of context; developing a subject entity situation summary by analyzing the subject entity related data, wherein the summary comprises a linear or nonlinear regression model of each of the one or more entity function measures, a relevance for each of the measures and one or more of the context layers; using the subject entity situation summary, the node depth criteria and the impact cutoff criteria to identify components of context to include in a composite index; creating a composite index for the data associated with the identified components of context, wherein the composite index comprises a column for the creation dates of the plurality of data items, a column for each of the identified components of context and a ranking for each of the plurality of data items of the composite index; receiving a search request; and providing a plurality of search results in response to the search request, wherein the plurality of search results are prioritized using a weight comprised of a mathematical combination of an index position ranking and a ranking provided by a relevance measure, wherein the subject entity physically exists, and wherein the subject entity situation summary supports a graphical display of a relative contribution of one or more drivers to the one or more entity function measures. | 11. A method, comprising: using a computer and a mobile access device to complete processing comprising: obtaining a subject entity definition of a subject entity, a node depth criteria and an impact cutoff criteria; aggregating and preparing a plurality of data items that include data related to the subject entity for processing, wherein the data comprises at least one entity function, one or more entity function measures and a creation date for each of the plurality of data items; storing the aggregated plurality of data items in one or more context layers by a component of context; developing a subject entity situation summary by analyzing the subject entity related data, wherein the summary comprises a linear or nonlinear regression model of each of the one or more entity function measures, a relevance for each of the measures and one or more of the context layers; using the subject entity situation summary, the node depth criteria and the impact cutoff criteria to identify components of context to include in a composite index; creating a composite index for the data associated with the identified components of context, wherein the composite index comprises a column for the creation dates of the plurality of data items, a column for each of the identified components of context and a ranking for each of the plurality of data items of the composite index; receiving a search request; and providing a plurality of search results in response to the search request, wherein the plurality of search results are prioritized using a weight comprised of a mathematical combination of an index position ranking and a ranking provided by a relevance measure, wherein the subject entity physically exists, and wherein the subject entity situation summary supports a graphical display of a relative contribution of one or more drivers to the one or more entity function measures. 18. The method of claim 11 , wherein the one or more context layers are stored in a database that automatically captures and incorporates any changes in a performance situation of the subject entity. | 0.893583 |
9,858,921 | 2 | 3 | 2. The computer-implemented method of claim 1 , wherein the geographic location is identified further based on search results that are associated with the one or more search queries in the search history. | 2. The computer-implemented method of claim 1 , wherein the geographic location is identified further based on search results that are associated with the one or more search queries in the search history. 3. The computer-implemented method of claim 2 , wherein the search results for the search queries are aggregated across a collection of search results that were provided by the one or more search services to a plurality of users. | 0.956248 |
7,860,715 | 14 | 15 | 14. The method of claim 11 , wherein said plurality of synchronization keywords are stored in a storage location for later use. | 14. The method of claim 11 , wherein said plurality of synchronization keywords are stored in a storage location for later use. 15. The method of claim 14 , wherein said plurality of synchronization keywords allow continuously synchronizing or re-synchronizing of word calibration during identifying the locations of the words and later when used to calibrate word locations. | 0.849206 |
7,917,351 | 1 | 10 | 1. A system comprising: a computer connected to a computer readable memory, a non-transitory computer readable storage medium, and to the Internet; first program instructions for receiving a search term; second program instructions for receiving a designation of a character in the search term as a set character; third program instructions for automatically designating, responsive to receiving the designation, all other characters in the search term as a plurality of companion characters so that the set character will be considered only for a context that the set character provides to the plurality of companion characters and will not itself be translated; fourth program instructions for searching a translation dictionary for a plurality of translation results in accordance with the context that the set character provides to the plurality of companion characters; and fifth program instructions for displaying the plurality of translation results in a display connected to the computer; wherein the first through the fifth program instructions are stored in the non-transitory computer readable storage medium for running via the computer readable memory. | 1. A system comprising: a computer connected to a computer readable memory, a non-transitory computer readable storage medium, and to the Internet; first program instructions for receiving a search term; second program instructions for receiving a designation of a character in the search term as a set character; third program instructions for automatically designating, responsive to receiving the designation, all other characters in the search term as a plurality of companion characters so that the set character will be considered only for a context that the set character provides to the plurality of companion characters and will not itself be translated; fourth program instructions for searching a translation dictionary for a plurality of translation results in accordance with the context that the set character provides to the plurality of companion characters; and fifth program instructions for displaying the plurality of translation results in a display connected to the computer; wherein the first through the fifth program instructions are stored in the non-transitory computer readable storage medium for running via the computer readable memory. 10. The system of claim 1 wherein the first through the eighth program instructions apply a weight to a selected text on a web page. | 0.885417 |
9,495,955 | 6 | 11 | 6. A computer-implemented method, comprising: under control of one or more computing devices configured with specific computer-executable instructions, receiving an identification of a desired training utterance having a first portion and a second portion, wherein the desired training utterance is not included in a corpus; selecting, from the corpus, a first utterance comprising at least a first portion of the desired training utterance; extracting, from the first utterance, a portion of the first utterance comprising the first portion of the desired training utterance, wherein the first portion of the desired training utterance and at least the portion of the first utterance are associated with a first desired characteristic; selecting, from the corpus, a second utterance comprising at least a second portion of the desired training utterance; extracting, from the second utterance, a portion of the second utterance comprising the second portion of the desired training utterance, wherein the second portion of the desired training utterance and at least the portion of the second utterance are associated with a second desired characteristic; concatenating at least the portion of the first utterance and the portion of the second utterance to generate the desired training utterance; and training an acoustic model using the desired training utterance that is generated. | 6. A computer-implemented method, comprising: under control of one or more computing devices configured with specific computer-executable instructions, receiving an identification of a desired training utterance having a first portion and a second portion, wherein the desired training utterance is not included in a corpus; selecting, from the corpus, a first utterance comprising at least a first portion of the desired training utterance; extracting, from the first utterance, a portion of the first utterance comprising the first portion of the desired training utterance, wherein the first portion of the desired training utterance and at least the portion of the first utterance are associated with a first desired characteristic; selecting, from the corpus, a second utterance comprising at least a second portion of the desired training utterance; extracting, from the second utterance, a portion of the second utterance comprising the second portion of the desired training utterance, wherein the second portion of the desired training utterance and at least the portion of the second utterance are associated with a second desired characteristic; concatenating at least the portion of the first utterance and the portion of the second utterance to generate the desired training utterance; and training an acoustic model using the desired training utterance that is generated. 11. The computer-implemented method of claim 6 , wherein selecting the first utterance comprising the first portion corresponding to the first desired characteristic from the corpus comprises identifying data from the corpus having the first desired characteristic by analyzing the corpus data. | 0.847034 |
7,788,184 | 1 | 4 | 1. A method of preventing identity theft, comprising the steps of: assigning document identification information and a personal control document number to a document; transmitting the document identification information and the personal control document number over an electronic network to a database controlled by a service provider; presenting the document and the personal document control number at a point of encashment; and contacting the service provider to verify that the personal document control number and the document identification number presented match the transmitted information in the service provider database. | 1. A method of preventing identity theft, comprising the steps of: assigning document identification information and a personal control document number to a document; transmitting the document identification information and the personal control document number over an electronic network to a database controlled by a service provider; presenting the document and the personal document control number at a point of encashment; and contacting the service provider to verify that the personal document control number and the document identification number presented match the transmitted information in the service provider database. 4. The method of claim 1 further comprising the step of printing an indicium on the document. | 0.667857 |
8,990,235 | 13 | 14 | 13. A system comprising: a text analysis component, including one or more processors, that receives text and selects a portion of the received text absent user interaction with the portion of the received text; and a query generation component, including one or more processors, that interacts with the text analysis component and executes instructions that cause the query generation component to perform operations comprising: forming a query based at least in part upon the selected portion of the received text, wherein the query includes a first portion that is associated with the selected portion of the text; and selecting, from among multiple different indexes, at least one index to search based on the query; a communications and routing component that interacts with the query generation component and executes instructions that cause the query generation component to perform operations comprising: transmitting the query to at least one of one or more second computing devices based at least in part on the selected index; and receiving information relevant to the query from at least one of the one or more second computing devices; and a user interface that interacts with the communications and routing component and displays the relevant information. | 13. A system comprising: a text analysis component, including one or more processors, that receives text and selects a portion of the received text absent user interaction with the portion of the received text; and a query generation component, including one or more processors, that interacts with the text analysis component and executes instructions that cause the query generation component to perform operations comprising: forming a query based at least in part upon the selected portion of the received text, wherein the query includes a first portion that is associated with the selected portion of the text; and selecting, from among multiple different indexes, at least one index to search based on the query; a communications and routing component that interacts with the query generation component and executes instructions that cause the query generation component to perform operations comprising: transmitting the query to at least one of one or more second computing devices based at least in part on the selected index; and receiving information relevant to the query from at least one of the one or more second computing devices; and a user interface that interacts with the communications and routing component and displays the relevant information. 14. The system of claim 13 , wherein: selecting a portion of the text comprises optically capturing text printed on a rendered document; and forming the query comprises: identifying the rendered document from the captured text; and forming the query based at least in part on the identified rendered document. | 0.501613 |
8,280,877 | 16 | 17 | 16. The one or more computer-readable storage devices of claim 13 , wherein the filtering comprises: evaluating a dissimilarity score between at least a pair of phrases in the documents; sifting phrases based at least on a basis of the dissimilarity score. | 16. The one or more computer-readable storage devices of claim 13 , wherein the filtering comprises: evaluating a dissimilarity score between at least a pair of phrases in the documents; sifting phrases based at least on a basis of the dissimilarity score. 17. The one or more computer-readable storage devices of claim 16 , wherein the dissimilarity score indicates an extent of dissimilarity between dissimilar phrases. | 0.932566 |
8,589,150 | 1 | 12 | 1. A computer program product, comprising a non-transitory computer usable medium having a computer readable program code embodied therein, the computer readable program code adapted to be executed to implement a method for dynamically correcting grammar associated with text, the method comprising: receiving a request from a user to change text within an application; changing all instances of the text within the application, according to the request; and dynamically correcting grammar associated with the changed text when the changed text is displayed to the user, including dynamically correcting the display of additional text associated with the changed text, according to one or more rules associated with a language of the changed text. | 1. A computer program product, comprising a non-transitory computer usable medium having a computer readable program code embodied therein, the computer readable program code adapted to be executed to implement a method for dynamically correcting grammar associated with text, the method comprising: receiving a request from a user to change text within an application; changing all instances of the text within the application, according to the request; and dynamically correcting grammar associated with the changed text when the changed text is displayed to the user, including dynamically correcting the display of additional text associated with the changed text, according to one or more rules associated with a language of the changed text. 12. The computer program product of claim 1 , wherein the computer program product is operable such that the grammar is dynamically corrected utilizing a grammar engine. | 0.774667 |
7,707,160 | 21 | 22 | 21. The computer system of claim 20 wherein the web browser is operable to display a summary information screen providing general information on a named object using a portion of the factual knowledge retrieved from the knowledge base. | 21. The computer system of claim 20 wherein the web browser is operable to display a summary information screen providing general information on a named object using a portion of the factual knowledge retrieved from the knowledge base. 22. The computer system of claim 21 wherein the summary information screen includes a link corresponding to each named object which generate further summary information screens when the link is activated. | 0.925872 |
7,747,552 | 27 | 28 | 27. The method of claim 26 where creating the probability table for each intermediate node comprises: completing the probability table with data reflecting quantitative observations of a natural system associated with the intermediate node. | 27. The method of claim 26 where creating the probability table for each intermediate node comprises: completing the probability table with data reflecting quantitative observations of a natural system associated with the intermediate node. 28. The method of claim 27 further comprising: modifying the probability table based on quantitative observations of the natural system associated with the intermediate node. | 0.895181 |
10,073,828 | 11 | 14 | 11. A method in a computing system of assisting in refining a language model used by a language recognition system to predict words in a language, the method comprising: receiving a selection of a word in the language by a user of the computing system; causing display of an interface on the computing system for the user to associate at least one category with the selected word; receiving, via the interface, user input associating a category with the selected word; storing the received category association information in a language model on the computing system; transmitting the recorded category association information to a remote computer; receiving from the remote computer updates to the language model on the computing system based on additional information associating one or more words in the language with one or more categories by other users of the language; and determining by the language recognition system whether to predict a word in the language in response to user input, based on whether the word is associated with a category in the updated language model including the additional information from other users of the language. | 11. A method in a computing system of assisting in refining a language model used by a language recognition system to predict words in a language, the method comprising: receiving a selection of a word in the language by a user of the computing system; causing display of an interface on the computing system for the user to associate at least one category with the selected word; receiving, via the interface, user input associating a category with the selected word; storing the received category association information in a language model on the computing system; transmitting the recorded category association information to a remote computer; receiving from the remote computer updates to the language model on the computing system based on additional information associating one or more words in the language with one or more categories by other users of the language; and determining by the language recognition system whether to predict a word in the language in response to user input, based on whether the word is associated with a category in the updated language model including the additional information from other users of the language. 14. The method of claim 11 wherein receiving a selection of a word includes receiving input to delete the word from the language model or add the word to the language model. | 0.889103 |
7,966,554 | 1 | 55 | 1. An apparatus for providing security disclosure data in at least two aligned formats, the apparatus comprising: a storage medium comprising security disclosure data in an audio format and a visual format comprising video data; a processor for receiving the audio security disclosure data at a first time and for inserting a first marker therein; said processor for creating, without human input, a text adapted to be visually displayed directly from the audio security disclosure data at a second time subsequent to the first time and for inserting a second marker in the text in a position corresponding to a location of the first marker in the audio security disclosure data; said processor for inserting a third marker in said visual data in a position corresponding to at least one of the first marker location in the audio data and the second marker location in the text; and said processor for creating, without human input, a summary text corresponding to the text adapted to be visually displayed, wherein the summary text is created directly from the audio security disclosure data, and wherein the summary text is shorter than the text adapted to be visually displayed and for inserting a fourth marker in said summary text in a position corresponding to at least one of the first marker location in the audio data and the second marker location in the text. | 1. An apparatus for providing security disclosure data in at least two aligned formats, the apparatus comprising: a storage medium comprising security disclosure data in an audio format and a visual format comprising video data; a processor for receiving the audio security disclosure data at a first time and for inserting a first marker therein; said processor for creating, without human input, a text adapted to be visually displayed directly from the audio security disclosure data at a second time subsequent to the first time and for inserting a second marker in the text in a position corresponding to a location of the first marker in the audio security disclosure data; said processor for inserting a third marker in said visual data in a position corresponding to at least one of the first marker location in the audio data and the second marker location in the text; and said processor for creating, without human input, a summary text corresponding to the text adapted to be visually displayed, wherein the summary text is created directly from the audio security disclosure data, and wherein the summary text is shorter than the text adapted to be visually displayed and for inserting a fourth marker in said summary text in a position corresponding to at least one of the first marker location in the audio data and the second marker location in the text. 55. The apparatus of claim 1 wherein the insertion of said first marker in the audio data is based on patterns. | 0.786538 |
8,776,009 | 8 | 15 | 8. A system for task modeling interactive sequential applications for one or more mobile devices, comprising: a) a central processing unit (CPU) having a software tool for defining a generic meta-model of the target applications, wherein said generic meta-model consists of a static model of application components, and a dynamic model of identifiers of application screens and connections that are based on an inheritance mechanism whereby model entities having a parent-child relationship are reusable in different models; b) a passive Task Model database, being in data communication with said CPU, for storing said generic meta-model for future reuse, which further comprises static instances of the generic meta-model specifically generated for a variety of mobile devices; c) a tracker module in said processing unit for: c1) real-time tracking and monitoring user's actions during user-system interactions and creating a screen unique identifier for each application's screen visited by the user of said mobile device by choosing an identifier that matches a signature of each application's screen, wherein created identifiers are used for generating active models of the user's actual usage; and c2) generating a unique identifier for each captured screen that is presented to said user; d) an active Task Model database, being in data communication with said processing unit, for storing said active model, wherein data transferring and storing is minimized to screen unique identifier and; e) an analyzer for comparing said active Task Model to said passive Task Model and for generating usage patterns for said user. | 8. A system for task modeling interactive sequential applications for one or more mobile devices, comprising: a) a central processing unit (CPU) having a software tool for defining a generic meta-model of the target applications, wherein said generic meta-model consists of a static model of application components, and a dynamic model of identifiers of application screens and connections that are based on an inheritance mechanism whereby model entities having a parent-child relationship are reusable in different models; b) a passive Task Model database, being in data communication with said CPU, for storing said generic meta-model for future reuse, which further comprises static instances of the generic meta-model specifically generated for a variety of mobile devices; c) a tracker module in said processing unit for: c1) real-time tracking and monitoring user's actions during user-system interactions and creating a screen unique identifier for each application's screen visited by the user of said mobile device by choosing an identifier that matches a signature of each application's screen, wherein created identifiers are used for generating active models of the user's actual usage; and c2) generating a unique identifier for each captured screen that is presented to said user; d) an active Task Model database, being in data communication with said processing unit, for storing said active model, wherein data transferring and storing is minimized to screen unique identifier and; e) an analyzer for comparing said active Task Model to said passive Task Model and for generating usage patterns for said user. 15. The system according to claim 8 , wherein each of the model entities is associated with a unique primary identifier and with a base identifier, said base identifier being derivable from a parent entity when said parent entity is reused by a given model entity and being identical to said primary identifier when said given model entity is a parent entity. | 0.60636 |
8,977,603 | 1 | 5 | 1. A method comprising: receiving a textual description of a collection of entries representing products, the collection being requested for creation within a network-based commerce system, the textual description of the collection of entries representing products being submitted by a user of the network-based commerce system and received from a client device of the user by a server system within the network-based commerce system, the collection, after creation, includes one or more entries that correspond to products to be listed for sale via the network-based commerce system; generating a structured description of the collection based on the textual description of the collection requested for creation, the generating of the structured description including parsing the textual description based on a delimiter included in the textual description requested for creation, the structured description of the collection including a name-value pair derived from the textual description submitted by the user, the generating of the structured description being performed by a module executed by a processor of a machine; and creating the collection requested for creation within the network-based commerce system by storing the structured description of the collection in a database of the network-based commerce system. | 1. A method comprising: receiving a textual description of a collection of entries representing products, the collection being requested for creation within a network-based commerce system, the textual description of the collection of entries representing products being submitted by a user of the network-based commerce system and received from a client device of the user by a server system within the network-based commerce system, the collection, after creation, includes one or more entries that correspond to products to be listed for sale via the network-based commerce system; generating a structured description of the collection based on the textual description of the collection requested for creation, the generating of the structured description including parsing the textual description based on a delimiter included in the textual description requested for creation, the structured description of the collection including a name-value pair derived from the textual description submitted by the user, the generating of the structured description being performed by a module executed by a processor of a machine; and creating the collection requested for creation within the network-based commerce system by storing the structured description of the collection in a database of the network-based commerce system. 5. The method of claim 1 , further comprising: providing a user interface to the client device of the user, the user interface being configured to edit the structured description of the collection. | 0.775626 |
9,122,950 | 18 | 19 | 18. An auto-segmentation apparatus comprising: a processor configured to: perform atlas-based auto-segmentation on a plurality of points in a subject image using atlas images to generate first data representative of at least one structure in the subject image, wherein the processor is further configured to perform the atlas-based auto-segmentation by registering the subject image with a plurality of the atlas images to map point of the subject images to points of the atlas images, apply a plurality of points in the subject image to a trained classifier to generate second data representative of the a least one structure in the subject image, combine the first data with the second data to generate third data representative of the at least one structure in the subject image, and determine based on the data structure classification associated with the subject image. | 18. An auto-segmentation apparatus comprising: a processor configured to: perform atlas-based auto-segmentation on a plurality of points in a subject image using atlas images to generate first data representative of at least one structure in the subject image, wherein the processor is further configured to perform the atlas-based auto-segmentation by registering the subject image with a plurality of the atlas images to map point of the subject images to points of the atlas images, apply a plurality of points in the subject image to a trained classifier to generate second data representative of the a least one structure in the subject image, combine the first data with the second data to generate third data representative of the at least one structure in the subject image, and determine based on the data structure classification associated with the subject image. 19. The apparatus of claim 18 , wherein the processor is further configured to select a subset of the points in the subject image, and limit the points of the subject image that are applied to the trained classifier to the selected subset. | 0.896894 |
7,552,127 | 8 | 10 | 8. A method for providing in a platform-independent system for providing at least one content feed from at least one content application to a user via a standard feed reader supporting the XML language (“XML”) and the Atom format, the method comprising the steps of: a. receiving, at a content management system (“CMS”), from the feed reader, a URL from the feed reader b. receiving, at a linkbase, the URL, from the CMS; c. determining whether the URL comprises a query; d. if so, a. receiving, at an XQuery parameter provider, the URL and converting URL parameters in the URL and passing the corresponding XQuery parameters to the linkbase, and, from the linkbase, delivering an XQuery document associated with the URL to the CMS, the CMS passing the XQuery document to the content repository to retrieve the requested content; b. from the content respository, delivering to the CMS, an XML document having the requested content associated with the received URL; and c. from the CMS, delivering to the feed reader, the XML document in Atom format; and e. if not, from the CMS, delivering to the feed reader, an XML document associated with the received URL. | 8. A method for providing in a platform-independent system for providing at least one content feed from at least one content application to a user via a standard feed reader supporting the XML language (“XML”) and the Atom format, the method comprising the steps of: a. receiving, at a content management system (“CMS”), from the feed reader, a URL from the feed reader b. receiving, at a linkbase, the URL, from the CMS; c. determining whether the URL comprises a query; d. if so, a. receiving, at an XQuery parameter provider, the URL and converting URL parameters in the URL and passing the corresponding XQuery parameters to the linkbase, and, from the linkbase, delivering an XQuery document associated with the URL to the CMS, the CMS passing the XQuery document to the content repository to retrieve the requested content; b. from the content respository, delivering to the CMS, an XML document having the requested content associated with the received URL; and c. from the CMS, delivering to the feed reader, the XML document in Atom format; and e. if not, from the CMS, delivering to the feed reader, an XML document associated with the received URL. 10. The method of claim 8 wherein the content feeds have content elements having characteristics, the method further having the steps of, at the CMS, receiving, from the user, user desired characteristics for the content elements, and, at the CMS, transforming, the characteristics of the content elements to the user desired characteristics using XPath functions prior to delivering the content feeds to the user. | 0.681538 |
7,752,159 | 1 | 2 | 1. A method of classifying text on a computer for electronic communication management in a contact center, comprising steps of: analyzing, in the computer, text from an electronic communication received from a customer to determine the customer's intent by identifying concepts in the text and building a concept model containing the concepts; providing, in the computer, a knowledge base having a plurality of nodes including a set of learning nodes, each of the learning nodes being provided with statistical information for determining a relevance of the text to a category associated with the node; calculating, in the computer, a set of match scores for the concept model by using the knowledge base, each match score of the set of match scores indicating the relevance of the text to a category associated with a node of the knowledge base, the category including at least one suggested action to be performed in response to the electronic communication, wherein the suggested action is representative of the relevance of the text to the category, and the suggested action includes generating an automatic response to the customer or routing the electronic communication to an agent to generate an assisted response to the customer; and performing, in the computer, the suggested action in response to the electronic communication based on the calculated set of match scores, in order to improve the response of the contact center to the electronic communications received from customers by the contact center. | 1. A method of classifying text on a computer for electronic communication management in a contact center, comprising steps of: analyzing, in the computer, text from an electronic communication received from a customer to determine the customer's intent by identifying concepts in the text and building a concept model containing the concepts; providing, in the computer, a knowledge base having a plurality of nodes including a set of learning nodes, each of the learning nodes being provided with statistical information for determining a relevance of the text to a category associated with the node; calculating, in the computer, a set of match scores for the concept model by using the knowledge base, each match score of the set of match scores indicating the relevance of the text to a category associated with a node of the knowledge base, the category including at least one suggested action to be performed in response to the electronic communication, wherein the suggested action is representative of the relevance of the text to the category, and the suggested action includes generating an automatic response to the customer or routing the electronic communication to an agent to generate an assisted response to the customer; and performing, in the computer, the suggested action in response to the electronic communication based on the calculated set of match scores, in order to improve the response of the contact center to the electronic communications received from customers by the contact center. 2. The method of claim 1 , wherein the text includes a plurality of fields, a first subset of the plurality of fields consisting of unstructured data and a second subset of the plurality of fields consisting of structured data. | 0.718362 |
8,966,465 | 1 | 12 | 1. A method for customizing a software application, the method comprising: retrieving a first metadata document via a software component configured to enable creation and/or update of XML documents, wherein: the first metadata document is based at least in part on Extensible Markup Language (XML); content of the first metadata document at least partially defines one or more characteristics of at least a portion of a software application; and at least one of the one or more characteristics corresponds to one or more of content, behavior, and/or appearance; in response to retrieving the first metadata document, creating in memory, a metadata object to represent the first metadata document; receiving, from the software component, one or more modifications to the metadata object, wherein the one or more modifications: are expressed as method calls performed on the metadata object; and comprise a modification to a source element in the first metadata document; translating the one or more method calls into one or more customization instructions, wherein the one or more customization instructions, when executed, cause at least the portion of the software application to change at least one of the one or more characteristics, the translating comprising: checking whether each of a plurality of elements is associated with a respective unique identifier, the plurality of elements comprising a sibling element, a parent element, and the source element; selecting a unique identifier based on a predetermined order comprising determining whether the source element is associated with a globally unique identifier and, if the source element is not associated with the globally unique identifier, determining whether the source element is associated with a locally unique identifier; and generating at least one customization instruction of the one or more customization instructions to reference the modification to the source element based at least in part on the checking and the selecting; and storing in a second metadata document the one or more customization instructions as a first customization for the first metadata document, wherein the first customization is stored separately from the first metadata document. | 1. A method for customizing a software application, the method comprising: retrieving a first metadata document via a software component configured to enable creation and/or update of XML documents, wherein: the first metadata document is based at least in part on Extensible Markup Language (XML); content of the first metadata document at least partially defines one or more characteristics of at least a portion of a software application; and at least one of the one or more characteristics corresponds to one or more of content, behavior, and/or appearance; in response to retrieving the first metadata document, creating in memory, a metadata object to represent the first metadata document; receiving, from the software component, one or more modifications to the metadata object, wherein the one or more modifications: are expressed as method calls performed on the metadata object; and comprise a modification to a source element in the first metadata document; translating the one or more method calls into one or more customization instructions, wherein the one or more customization instructions, when executed, cause at least the portion of the software application to change at least one of the one or more characteristics, the translating comprising: checking whether each of a plurality of elements is associated with a respective unique identifier, the plurality of elements comprising a sibling element, a parent element, and the source element; selecting a unique identifier based on a predetermined order comprising determining whether the source element is associated with a globally unique identifier and, if the source element is not associated with the globally unique identifier, determining whether the source element is associated with a locally unique identifier; and generating at least one customization instruction of the one or more customization instructions to reference the modification to the source element based at least in part on the checking and the selecting; and storing in a second metadata document the one or more customization instructions as a first customization for the first metadata document, wherein the first customization is stored separately from the first metadata document. 12. The method of claim 1 , wherein the one or more customization instructions are optimized prior to being stored. | 0.84748 |
8,812,602 | 7 | 8 | 7. The method of claim 6 , wherein at least one of the plurality of subject-matter searches is refined by the at least one response. | 7. The method of claim 6 , wherein at least one of the plurality of subject-matter searches is refined by the at least one response. 8. The method of claim 7 , wherein at least one of the plurality of subject-matter searches uses a keyword search application programming interface to access conversations in the social network system. | 0.951426 |
8,503,797 | 3 | 8 | 3. The method of claim 2 , wherein extracting the physical attributes of the scanned document comprises cropping and/or rotating the scanned document as needed to create a processed scanned document for feature extraction. | 3. The method of claim 2 , wherein extracting the physical attributes of the scanned document comprises cropping and/or rotating the scanned document as needed to create a processed scanned document for feature extraction. 8. The method of claim 3 , wherein the extracting of physical attributes of the scanned document comprises detecting whether the image is an inverse image of the scanned document. | 0.953555 |
9,348,757 | 15 | 16 | 15. The computer system of claim 12 , wherein the method further comprises sharing memory by the first partition and the second partition, wherein the memory is shared by the first partition and the second partition which use structurally different address translation architectures. | 15. The computer system of claim 12 , wherein the method further comprises sharing memory by the first partition and the second partition, wherein the memory is shared by the first partition and the second partition which use structurally different address translation architectures. 16. The computer system of claim 15 , wherein the method further comprises managing by a hypervisor supporting the first partition and the second partition the memory that is shared, wherein the managing includes at least one of: removing a page from the memory, storing a page of the memory in another form of memory, paging out a page of the memory, or compressing a page of the memory. | 0.88411 |
9,430,141 | 6 | 7 | 6. A method comprising: under control of one or more computer systems configured with executable instructions, receiving a first stroke associated with a touch input; determining, based on the first stroke, a predetermined type of annotation associated with the touch input; determining the predetermined type of annotation is a free form annotation; associating the free form annotation with a word of content presented on a display of a device; receiving a additional strokes associated with the touch input; associating the free form annotation with the word based at least in part on a location of the word within the content; and rendering the content to be presented on the display, the rendering including rendering the content presented on the display around the annotation to cause the annotation to appear adjacent to the word and at least partially surrounded by the content. | 6. A method comprising: under control of one or more computer systems configured with executable instructions, receiving a first stroke associated with a touch input; determining, based on the first stroke, a predetermined type of annotation associated with the touch input; determining the predetermined type of annotation is a free form annotation; associating the free form annotation with a word of content presented on a display of a device; receiving a additional strokes associated with the touch input; associating the free form annotation with the word based at least in part on a location of the word within the content; and rendering the content to be presented on the display, the rendering including rendering the content presented on the display around the annotation to cause the annotation to appear adjacent to the word and at least partially surrounded by the content. 7. The method of claim 6 , further comprising: selecting a corner of the first stroke based at least in part on a language associated with the content presented on the display; and determining a word nearest the corner as the word associated with the annotation. | 0.91499 |
9,871,925 | 1 | 3 | 1. A computer-implemented method, comprising: identifying a plurality of users participating in a multi-user communication, wherein each user participates using a communication device that communicates with the communication devices of other users over a network; determining a topic of the multi-user communication between the communication devices of the plurality of users; obtaining a topical expertise level relative to the topic for each of the identified users; ranking each user participating in the multi-user communication according to the topical expertise level for each user; and assigning the user with the highest topical expertise rank as the moderator, wherein the communication device of the moderator is provided an ability selected from an ability to mute input from the communication device of any of the other users and an ability to delete a post from the communication device of any of the other users. | 1. A computer-implemented method, comprising: identifying a plurality of users participating in a multi-user communication, wherein each user participates using a communication device that communicates with the communication devices of other users over a network; determining a topic of the multi-user communication between the communication devices of the plurality of users; obtaining a topical expertise level relative to the topic for each of the identified users; ranking each user participating in the multi-user communication according to the topical expertise level for each user; and assigning the user with the highest topical expertise rank as the moderator, wherein the communication device of the moderator is provided an ability selected from an ability to mute input from the communication device of any of the other users and an ability to delete a post from the communication device of any of the other users. 3. The method of claim 1 , wherein determining a topic of a multi-user communication includes identifying the use of keywords within the multi-user communication and determining a topic most closely associated with those keywords. | 0.8 |
9,398,460 | 1 | 11 | 1. A mobile phone-based system for providing on-demand security to a requester primarily via non-voice communication, the system comprising: a. a database having i. requester data, ii. security escort data, iii. engagement data, iv. review data, and v. at least one request factor; b. at least one requester mobile phone having i. at least one non-voice communication channel, ii. at least one voice communication channel, iii. an interface adapted to— A. request security escorts for at least one time period in at least one location, B. select at least one request factor and send a request to an engagement engine, C. receive a response from the engagement engine, D. enable the requester to meet and identify an escort, E. declare an emergency, F. terminate security escort for one time period in one location, and G. close an engagement; c. a screening facility adapted to— i. qualify at least one selected from security escort, requester, and ii. review qualifications of at least are selected from escort and requestor; d. at least one security escort mobile phone having— i. at least one non-voice communication channel, ii. at least one voice communication channel, iii. an interface adapted to— A. receive a proposed security engagement, B. respond to the proposed engagement, C. receive security escort details, D. enable an escort to meet and identify a requester, E. declare an emergency, and F. close an engagement; e. an engagement engine having— i. a query generator interactively facilitating each request and generating a query most closely related to the requester's needs in view of each applicable request factor, and ii. a response generator receiving the query and applying request factors to generate a response including confirmation of request, expected cost, and escort identification; f. a meeting engine adapted to— i. transmit location and identification data to the requester and escort, ii. facilitate a meeting between the requester and the escort, iii. receive verification of an agreeable meeting, iv. close each engagement upon notification from at least one selected from requester and escort database, and v. pay the escorts whereby the security escorts required for a particular engagement are determined based on requester-provided data as a function of a requester requirements, security escort provider abilities, and application of request factors. | 1. A mobile phone-based system for providing on-demand security to a requester primarily via non-voice communication, the system comprising: a. a database having i. requester data, ii. security escort data, iii. engagement data, iv. review data, and v. at least one request factor; b. at least one requester mobile phone having i. at least one non-voice communication channel, ii. at least one voice communication channel, iii. an interface adapted to— A. request security escorts for at least one time period in at least one location, B. select at least one request factor and send a request to an engagement engine, C. receive a response from the engagement engine, D. enable the requester to meet and identify an escort, E. declare an emergency, F. terminate security escort for one time period in one location, and G. close an engagement; c. a screening facility adapted to— i. qualify at least one selected from security escort, requester, and ii. review qualifications of at least are selected from escort and requestor; d. at least one security escort mobile phone having— i. at least one non-voice communication channel, ii. at least one voice communication channel, iii. an interface adapted to— A. receive a proposed security engagement, B. respond to the proposed engagement, C. receive security escort details, D. enable an escort to meet and identify a requester, E. declare an emergency, and F. close an engagement; e. an engagement engine having— i. a query generator interactively facilitating each request and generating a query most closely related to the requester's needs in view of each applicable request factor, and ii. a response generator receiving the query and applying request factors to generate a response including confirmation of request, expected cost, and escort identification; f. a meeting engine adapted to— i. transmit location and identification data to the requester and escort, ii. facilitate a meeting between the requester and the escort, iii. receive verification of an agreeable meeting, iv. close each engagement upon notification from at least one selected from requester and escort database, and v. pay the escorts whereby the security escorts required for a particular engagement are determined based on requester-provided data as a function of a requester requirements, security escort provider abilities, and application of request factors. 11. The system of claim 1 , where a requester photograph is uploaded with the current view of the requester. | 0.790698 |
7,779,009 | 1 | 16 | 1. A method, performed at least partially on a computer, for enabling satisfaction of a search responsive to a query based on classification of the query, the method comprising: receiving, from user input, a query phrase; parsing the received query phrase into at least a first constituent part and a second constituent part; determining definitional information of the first constituent part; determining a first category associated with the received query phrase by performing a first classification process that uses the determined definitional information of the first constituent part and the second constituent part, the first classification process including: accessing, from classification information stored in a computer storage medium that includes patterns, a pattern that is associated with at least one category, the pattern including a first part and a second part; comparing the determined definitional information of the first constituent part with the first part included in the accessed pattern and comparing the second constituent part with the second part included in the accessed pattern; based on the comparison results, determining whether the second constituent part and the determined definitional information of the first constituent part correspond to at least a subportion of the accessed pattern; based on a determination that the second constituent part and the determined definitional information of the first constituent part correspond to at least a subportion of the accessed pattern, identifying the category that is associated with the pattern as the first category associated with the received query phrase; determining a second category associated with the received query phrase by performing a second classification process that uses the determined definitional information of the first constituent part and the second constituent part, the second classification process being different than the first classification process; determining whether the first category determined by the first classification process matches the second category determined by the second classification process; in response to a determination that the first category matches the second category, associating the received query phrase with a category that corresponds to the first category and the second category; in response to a determination that the first category does not match the second category: selecting, from among the first category and the second category, a single category; and associating the received query phrase with the single category selected; identifying at least one search resource for satisfying the received query phrase based on the associated category; and routing the received query phrase to the at least one identified search resource. | 1. A method, performed at least partially on a computer, for enabling satisfaction of a search responsive to a query based on classification of the query, the method comprising: receiving, from user input, a query phrase; parsing the received query phrase into at least a first constituent part and a second constituent part; determining definitional information of the first constituent part; determining a first category associated with the received query phrase by performing a first classification process that uses the determined definitional information of the first constituent part and the second constituent part, the first classification process including: accessing, from classification information stored in a computer storage medium that includes patterns, a pattern that is associated with at least one category, the pattern including a first part and a second part; comparing the determined definitional information of the first constituent part with the first part included in the accessed pattern and comparing the second constituent part with the second part included in the accessed pattern; based on the comparison results, determining whether the second constituent part and the determined definitional information of the first constituent part correspond to at least a subportion of the accessed pattern; based on a determination that the second constituent part and the determined definitional information of the first constituent part correspond to at least a subportion of the accessed pattern, identifying the category that is associated with the pattern as the first category associated with the received query phrase; determining a second category associated with the received query phrase by performing a second classification process that uses the determined definitional information of the first constituent part and the second constituent part, the second classification process being different than the first classification process; determining whether the first category determined by the first classification process matches the second category determined by the second classification process; in response to a determination that the first category matches the second category, associating the received query phrase with a category that corresponds to the first category and the second category; in response to a determination that the first category does not match the second category: selecting, from among the first category and the second category, a single category; and associating the received query phrase with the single category selected; identifying at least one search resource for satisfying the received query phrase based on the associated category; and routing the received query phrase to the at least one identified search resource. 16. The method of claim 1 wherein: determining definitional information of the first constituent part comprises determining a type of the first constituent part; the first part of the accessed pattern comprises a type; and comparing the determined definitional information of the first constituent part with the first part of the accessed pattern comprises comparing the determined type of the first constituent part with the type included in the accessed pattern. | 0.859988 |
9,128,933 | 1 | 3 | 1. A method implemented in a device, the method comprising: receiving a named entity input; identifying a target sense for which the named entity input is to be extracted from a set of documents; and generating, based at least in part on both the named entity input and the set of documents, an extraction complexity feature that indicates how difficult it is deemed to be to identify the named entity input for the target sense in the set of documents, the generating including building an undirected graph based on the named entity input and the set of documents and looking for contexts in the undirected graph that are related to the target sense, the undirected graph including multiple vertices and multiple edges. | 1. A method implemented in a device, the method comprising: receiving a named entity input; identifying a target sense for which the named entity input is to be extracted from a set of documents; and generating, based at least in part on both the named entity input and the set of documents, an extraction complexity feature that indicates how difficult it is deemed to be to identify the named entity input for the target sense in the set of documents, the generating including building an undirected graph based on the named entity input and the set of documents and looking for contexts in the undirected graph that are related to the target sense, the undirected graph including multiple vertices and multiple edges. 3. A method as recited in claim 1 , wherein generating the extraction complexity feature comprises generating the extraction complexity feature by performing a graph-based spreading activation technique to generate a language model, and performing a clustering technique to refine the language model. | 0.782609 |
7,937,657 | 8 | 14 | 8. A computer comprising a memory device, a processor configured to access the memory device and configured to execute an operation for providing user-specific error analysis to identify as problem words any correctly spelled words of a document that are improperly used, the operation comprising: recording each word contained in a first document as pre-edited contents; receiving user edits replacing each problem word contained in the first document with a respective replacement word; after receiving the user edits, recording each word contained in the edited first document as post-edited contents; comparing the pre-edited contents to the post-edited contents to identify the problem words and the respective replacement words; storing the user-replaced problem words and respective replacement words to a first data structure, wherein each user-replaced problem word is associated with the respective replacement word in an individual record of the first data structure and wherein each individual record includes a field indicating a number of times a respective user-replaced problem word has been replaced by its associated replacement word; assigning a formatting definition to each problem word for use in identifying problem words on a display device, wherein the formatting definition is reflective, on a display device displaying the respective problem word, of the number of times the respective problem word has been replaced by its associated replacement word; determining whether one or more problem words are present in a second document utilizing the first data structure; and indicating each problem word present in the second document with its respective formatting definition, wherein respective problems words are displayed in respective visually distinguishable formats. | 8. A computer comprising a memory device, a processor configured to access the memory device and configured to execute an operation for providing user-specific error analysis to identify as problem words any correctly spelled words of a document that are improperly used, the operation comprising: recording each word contained in a first document as pre-edited contents; receiving user edits replacing each problem word contained in the first document with a respective replacement word; after receiving the user edits, recording each word contained in the edited first document as post-edited contents; comparing the pre-edited contents to the post-edited contents to identify the problem words and the respective replacement words; storing the user-replaced problem words and respective replacement words to a first data structure, wherein each user-replaced problem word is associated with the respective replacement word in an individual record of the first data structure and wherein each individual record includes a field indicating a number of times a respective user-replaced problem word has been replaced by its associated replacement word; assigning a formatting definition to each problem word for use in identifying problem words on a display device, wherein the formatting definition is reflective, on a display device displaying the respective problem word, of the number of times the respective problem word has been replaced by its associated replacement word; determining whether one or more problem words are present in a second document utilizing the first data structure; and indicating each problem word present in the second document with its respective formatting definition, wherein respective problems words are displayed in respective visually distinguishable formats. 14. The computer of claim 8 , wherein the operation further comprises: receiving a user identification; and storing the user identification in association with the first data structure. | 0.8258 |
9,846,786 | 8 | 11 | 8. A system, comprising: a hardware processor; and a memory device, the memory device storing instructions, the instructions when executed causing the hardware processor to perform operations, the operations comprising: storing electronic loan documents associated with a borrower of a loan; generating an anonymous shadow copy of the electronic loan documents, the anonymous shadow copy having personally identifying information removed therefrom; storing the anonymous shadow copy as a record in a row of an electronic database; associating the anonymous shadow copy to an access code; storing the access code as another record in the row of the electronic database; storing a database association between the personally identifying information and the access code in a different loan record within in the electronic database; sending the access code to a device associated with the borrower of the loan; receiving a first request sent from a requesting device, the first request requesting the anonymous shadow copy of the electronic loan documents; retrieving the anonymous shadow copy from the row of the electronic database; sending the anonymous shadow copy to the requesting device in response to the first request; receiving a second request sent from the requesting device, the second request requesting the personally identifying information and specifying the access code; querying the electronic database for the access code specified by the second request; retrieving the personally identifying information from the different loan record of the electronic database, the personally identifying information associated with the access code; and sending the personally identifying information to the requesting device in response to the second request; wherein the personally identifying information is separately stored from the row of the electronic database containing the anonymous shadow copy. | 8. A system, comprising: a hardware processor; and a memory device, the memory device storing instructions, the instructions when executed causing the hardware processor to perform operations, the operations comprising: storing electronic loan documents associated with a borrower of a loan; generating an anonymous shadow copy of the electronic loan documents, the anonymous shadow copy having personally identifying information removed therefrom; storing the anonymous shadow copy as a record in a row of an electronic database; associating the anonymous shadow copy to an access code; storing the access code as another record in the row of the electronic database; storing a database association between the personally identifying information and the access code in a different loan record within in the electronic database; sending the access code to a device associated with the borrower of the loan; receiving a first request sent from a requesting device, the first request requesting the anonymous shadow copy of the electronic loan documents; retrieving the anonymous shadow copy from the row of the electronic database; sending the anonymous shadow copy to the requesting device in response to the first request; receiving a second request sent from the requesting device, the second request requesting the personally identifying information and specifying the access code; querying the electronic database for the access code specified by the second request; retrieving the personally identifying information from the different loan record of the electronic database, the personally identifying information associated with the access code; and sending the personally identifying information to the requesting device in response to the second request; wherein the personally identifying information is separately stored from the row of the electronic database containing the anonymous shadow copy. 11. The system of claim 8 , wherein the operations further comprise electronically publishing the anonymous shadow copy of the electronic loan documents. | 0.503247 |
9,977,801 | 18 | 29 | 18. One or more non-transitory computer-readable media having stored thereon computer-executable instructions for causing a database system comprising one or more processors and memory, when programmed thereby, to perform operations comprising: receiving a request for an entry of a dictionary having multiple dictionary blocks, wherein the dictionary stores string values associated with corresponding value identifiers (IDs) for dictionary compression, and wherein each of the multiple dictionary blocks comprises: a variable dictionary block header comprising information that indicates a number of value blocks in the dictionary block; one or more value blocks, each value block comprising a value ID and a plurality of string values, wherein a string value in a given value block of the one or more value blocks is represent using segments that comprise: when the string value does not start the given value block, a first segment specifying a prefix length of a string; a second segment specifying a remainder length of the string, a length of the segments of the given value block, or a total length of the string; and a third segment comprising a remainder string of the string; and offset values for accessing the one or more value blocks in the dictionary block; using a value ID or string value associated with the request, selecting a dictionary block of the multiple dictionary blocks as responsive to the request; selectively loading the selected dictionary block into memory; and searching the selected dictionary block that has been loaded into memory. | 18. One or more non-transitory computer-readable media having stored thereon computer-executable instructions for causing a database system comprising one or more processors and memory, when programmed thereby, to perform operations comprising: receiving a request for an entry of a dictionary having multiple dictionary blocks, wherein the dictionary stores string values associated with corresponding value identifiers (IDs) for dictionary compression, and wherein each of the multiple dictionary blocks comprises: a variable dictionary block header comprising information that indicates a number of value blocks in the dictionary block; one or more value blocks, each value block comprising a value ID and a plurality of string values, wherein a string value in a given value block of the one or more value blocks is represent using segments that comprise: when the string value does not start the given value block, a first segment specifying a prefix length of a string; a second segment specifying a remainder length of the string, a length of the segments of the given value block, or a total length of the string; and a third segment comprising a remainder string of the string; and offset values for accessing the one or more value blocks in the dictionary block; using a value ID or string value associated with the request, selecting a dictionary block of the multiple dictionary blocks as responsive to the request; selectively loading the selected dictionary block into memory; and searching the selected dictionary block that has been loaded into memory. 29. The one or more non-transitory computer-readable media of claim 18 , wherein the second segment specifies a remainder length of the string and the segments further comprise a fourth segment specifying a length of the segments of the given value block. | 0.858333 |
7,677,967 | 1 | 7 | 1. A method for presenting and testing educational materials within a computer game environment in which multiple human participants play the role of assigned virtual game characters that engage in battle sequences within the game environment and wherein the success of battle attacks and defensive actions involving the assigned characters during the battle sequences within the game environment are determined by a combination of assigned strengths, weaknesses and attributes of the assigned virtual game characters, as well as types of questions asked and the answers given by the multiple human participants that reflect personal mastery of the educational materials, the method comprising: identifying a plurality of virtual game characters, corresponding to a virtual game environment, that are stored on a computing system and that each comprise a corresponding and unique set of game attributes that include at least an attack attribute and a defense attribute for participating in a battle sequence involving at least two virtual game characters within the virtual game environment; assigning a first virtual game character to a first human participant from a pool of available virtual game characters; assigning a second virtual game character to a second human participant from the pool of available virtual game characters; presenting the virtual game environment on the computing system with the first virtual game character in a storyline and that includes game actions that the first virtual game character participates in, and wherein the game actions include at least one of modifying the unique set of attributes that correspond to the first virtual game character, obtaining possessions for the first virtual game character, and/or using the first virtual game character to interact with a second virtual game character that is assigned to a second human participant; identifying rules that define battle between the first and second virtual game characters, wherein said rules define types of questions that can be asked by the first and second human participants to initiate an attack with one or more virtual weapons wielded by the first and second virtual game characters during the battle within the virtual game environment and a potential for inflicting battle damage during the attack with the one or more virtual weapons, wherein battle damage comprises a reduction of one or more character attributes, and wherein the types of questions that can be asked and the potential for damage is based at least in part on the defined attack and defense attributes of the first and second virtual game characters; presenting questions to the first human participant through the virtual game environment when the first virtual game character participates in particular game actions within the virtual game environment, wherein at least some of the presented questions are educational questions, which correspond to educational materials, and that are provided at least in part by the second human participant submitting one or more particular questions, wherein the one or more particular questions that can be submitted by the second human participant are limited to the attack attribute of the second virtual game character and are at least restricted to less than all questions that are available to be asked during battle by all of the available virtual game characters, and wherein said educational questions also correspond to one or more virtual battle attacks that are preformed with a virtual weapon and that are directed to the first virtual game character within the virtual game environment and that originate from the second virtual game character assigned to the second human participant, and wherein the first human participant defends the first virtual game character from the one or more attacks by answering said educational questions correctly; rewarding the first virtual game character with a positive outcome to the particular game action within the virtual game environment for correct answers received from the first human participant in a response to the presented questions, including at least successfully defending the first virtual game character from suffering battle damage resulting from the one or more attacks by the virtual weapon within the virtual game environment, and wherein the battle damage comprises a reduction of at least one character attribute of at least the first or second character in the virtual game environment; and assessing mastery of the educational materials by the first human participant, wherein assessing mastery of the educational materials is based on an evaluation of rewards received by the first virtual game character within the virtual game environment and by evaluating progress of the first virtual game character within the game, which includes an evaluation of whether the one or more attacks are successfully defended. | 1. A method for presenting and testing educational materials within a computer game environment in which multiple human participants play the role of assigned virtual game characters that engage in battle sequences within the game environment and wherein the success of battle attacks and defensive actions involving the assigned characters during the battle sequences within the game environment are determined by a combination of assigned strengths, weaknesses and attributes of the assigned virtual game characters, as well as types of questions asked and the answers given by the multiple human participants that reflect personal mastery of the educational materials, the method comprising: identifying a plurality of virtual game characters, corresponding to a virtual game environment, that are stored on a computing system and that each comprise a corresponding and unique set of game attributes that include at least an attack attribute and a defense attribute for participating in a battle sequence involving at least two virtual game characters within the virtual game environment; assigning a first virtual game character to a first human participant from a pool of available virtual game characters; assigning a second virtual game character to a second human participant from the pool of available virtual game characters; presenting the virtual game environment on the computing system with the first virtual game character in a storyline and that includes game actions that the first virtual game character participates in, and wherein the game actions include at least one of modifying the unique set of attributes that correspond to the first virtual game character, obtaining possessions for the first virtual game character, and/or using the first virtual game character to interact with a second virtual game character that is assigned to a second human participant; identifying rules that define battle between the first and second virtual game characters, wherein said rules define types of questions that can be asked by the first and second human participants to initiate an attack with one or more virtual weapons wielded by the first and second virtual game characters during the battle within the virtual game environment and a potential for inflicting battle damage during the attack with the one or more virtual weapons, wherein battle damage comprises a reduction of one or more character attributes, and wherein the types of questions that can be asked and the potential for damage is based at least in part on the defined attack and defense attributes of the first and second virtual game characters; presenting questions to the first human participant through the virtual game environment when the first virtual game character participates in particular game actions within the virtual game environment, wherein at least some of the presented questions are educational questions, which correspond to educational materials, and that are provided at least in part by the second human participant submitting one or more particular questions, wherein the one or more particular questions that can be submitted by the second human participant are limited to the attack attribute of the second virtual game character and are at least restricted to less than all questions that are available to be asked during battle by all of the available virtual game characters, and wherein said educational questions also correspond to one or more virtual battle attacks that are preformed with a virtual weapon and that are directed to the first virtual game character within the virtual game environment and that originate from the second virtual game character assigned to the second human participant, and wherein the first human participant defends the first virtual game character from the one or more attacks by answering said educational questions correctly; rewarding the first virtual game character with a positive outcome to the particular game action within the virtual game environment for correct answers received from the first human participant in a response to the presented questions, including at least successfully defending the first virtual game character from suffering battle damage resulting from the one or more attacks by the virtual weapon within the virtual game environment, and wherein the battle damage comprises a reduction of at least one character attribute of at least the first or second character in the virtual game environment; and assessing mastery of the educational materials by the first human participant, wherein assessing mastery of the educational materials is based on an evaluation of rewards received by the first virtual game character within the virtual game environment and by evaluating progress of the first virtual game character within the game, which includes an evaluation of whether the one or more attacks are successfully defended. 7. A method as recited in claim 1 , wherein the game action includes the first virtual game character participating in a battle with at least one other virtual game character, by attacking said other virtual game character through the presentation of a question asked by the first human participant to another human participant associated with said other virtual game character and that corresponds to the educational materials, and wherein potential damage of the attack is based on attributes of the first virtual game character, attributes of said other virtual game character and a type of question asked by the first human participant about the educational materials. | 0.500743 |
7,996,416 | 1 | 2 | 1. A computer implemented method, comprising: receiving, at an object-relational mapping (ORM) unit communicatively coupled to a relational database, a first structured query language (SQL) query statement for accessing the relational database, the first SQL query statement being received from a client application programmed in an object-oriented programming language, wherein the first SQL query statement is represented by a data object associated with the object-oriented programming language which is incompatible with a format of the relational database, and wherein the first SQL query statement includes a wildcard parameter that is not recognizable by the relational database; generating, by a query analyzer of the ORM unit, a syntax tree representing semantic information of the first SQL query statement; predicting, by a data type predictor of the ORM unit, a data type of the wildcard parameter based on the semantic information obtained from the syntax tree in view of a structure representing the syntax tree; generating, by the object-relational mapping (ORM) unit, a second SQL query statement that is tailored to the format of the relational database, the second SQL query statement including a parameter representing the wildcard parameter of the first SQL query statement, wherein a data type of the parameter of the second SQL query statement is specified using the predicted data type; and transmitting the second SQL query statement from the ORM unit to the relational database to access the relational database. | 1. A computer implemented method, comprising: receiving, at an object-relational mapping (ORM) unit communicatively coupled to a relational database, a first structured query language (SQL) query statement for accessing the relational database, the first SQL query statement being received from a client application programmed in an object-oriented programming language, wherein the first SQL query statement is represented by a data object associated with the object-oriented programming language which is incompatible with a format of the relational database, and wherein the first SQL query statement includes a wildcard parameter that is not recognizable by the relational database; generating, by a query analyzer of the ORM unit, a syntax tree representing semantic information of the first SQL query statement; predicting, by a data type predictor of the ORM unit, a data type of the wildcard parameter based on the semantic information obtained from the syntax tree in view of a structure representing the syntax tree; generating, by the object-relational mapping (ORM) unit, a second SQL query statement that is tailored to the format of the relational database, the second SQL query statement including a parameter representing the wildcard parameter of the first SQL query statement, wherein a data type of the parameter of the second SQL query statement is specified using the predicted data type; and transmitting the second SQL query statement from the ORM unit to the relational database to access the relational database. 2. The method of claim 1 , further comprising mapping the first SQL query statement with the predicted data type of the wildcard parameter to a corresponding data entry of the relational database based on metadata that defines a set of rules for mapping a query statement to one compatible with the format of the relational database. | 0.665663 |
7,603,272 | 1 | 18 | 1. A system for generating a block diagonal matrix from a lattice, the system comprising: (1) a processor; (2) a module configured to control the processor to compute posterior probability of all transitions T in a graph, if a lattice having transitions T is weighted; (3) a module configured to control the processor to extract a pivot baseline path from the lattice; and (4) a module configured to control the processor to align the transitions T in the lattice with the transitions in the pivot baseline path. | 1. A system for generating a block diagonal matrix from a lattice, the system comprising: (1) a processor; (2) a module configured to control the processor to compute posterior probability of all transitions T in a graph, if a lattice having transitions T is weighted; (3) a module configured to control the processor to extract a pivot baseline path from the lattice; and (4) a module configured to control the processor to align the transitions T in the lattice with the transitions in the pivot baseline path. 18. The system of claim 1 , wherein the block diagonal matrix is smaller in size than the lattice. | 0.946272 |
9,998,552 | 16 | 17 | 16. The non-transitory computer-readable medium according to claim 15 comprising instructions that, when executed, cause the at least one processor to notify one or more acquaintances of the user about a modification of the medium. | 16. The non-transitory computer-readable medium according to claim 15 comprising instructions that, when executed, cause the at least one processor to notify one or more acquaintances of the user about a modification of the medium. 17. The non-transitory computer-readable medium according to claim 16 comprising instructions that, when executed, cause the processor to modify one or more parameters of the at least one automatic content behavior based on responses from at least one of the one or more acquaintances. | 0.925079 |
9,892,201 | 8 | 9 | 8. The apparatus of claim 4 , the candidate document feature block further comprising: a document classifier block configured to calculate a candidate document score corresponding to the candidate document; a container classifier block configured to calculate a candidate container score corresponding to a container to which the candidate document belongs; a domain classifier block configured to calculate a candidate domain score corresponding to a domain to which the candidate document belongs; and a classifier aggregation block configured to aggregate the candidate document, candidate container, and candidate domain scores; the classifier block further comprising: an adult status classification block configured to process the aggregated scores and the hub distance score using a classification algorithm to derive an adult status of the candidate document. | 8. The apparatus of claim 4 , the candidate document feature block further comprising: a document classifier block configured to calculate a candidate document score corresponding to the candidate document; a container classifier block configured to calculate a candidate container score corresponding to a container to which the candidate document belongs; a domain classifier block configured to calculate a candidate domain score corresponding to a domain to which the candidate document belongs; and a classifier aggregation block configured to aggregate the candidate document, candidate container, and candidate domain scores; the classifier block further comprising: an adult status classification block configured to process the aggregated scores and the hub distance score using a classification algorithm to derive an adult status of the candidate document. 9. The apparatus of claim 8 , wherein the classification algorithm is derived using machine learning techniques prior to receiving a user search request by the search engine. | 0.937545 |
10,095,405 | 4 | 6 | 4. The method of claim 1 , further comprising: determining, by the computing device, based at least in part on the indication of the gesture, a spatial model probability associated with one or more keys from the plurality of keys; and adjusting, by the computing device, based on at least one characteristic of the gesture, the spatial model probability associated with the one or more keys from the plurality of keys, wherein: the character string is further determined based on the adjusted spatial model probability associated with the one or more keys from the plurality of keys; and the character string is output if the category of text input associated with the character string is not the particular category of text input and if the adjusted spatial model probability associated with the one or more keys from the plurality of keys exceeds a probability threshold. | 4. The method of claim 1 , further comprising: determining, by the computing device, based at least in part on the indication of the gesture, a spatial model probability associated with one or more keys from the plurality of keys; and adjusting, by the computing device, based on at least one characteristic of the gesture, the spatial model probability associated with the one or more keys from the plurality of keys, wherein: the character string is further determined based on the adjusted spatial model probability associated with the one or more keys from the plurality of keys; and the character string is output if the category of text input associated with the character string is not the particular category of text input and if the adjusted spatial model probability associated with the one or more keys from the plurality of keys exceeds a probability threshold. 6. The method of claim 4 , wherein the at least one characteristic of the gesture includes at least one of a speed of a portion of the gesture, a density of the portion of the gesture, or a curvature of the portion of the gesture. | 0.906656 |
8,296,309 | 1 | 3 | 1. A computer-implemented method comprising: generating, by a processing device, a filter for identifying a relevant document based on an initial relevance rule related to a set of documents; applying, by the processing device, the filter to the set of documents thereby identifying a subset of relevant documents; receiving, by the processing device from an assessor, the subset of relevant documents comprising an identification of key information; generating, by the processing device, an updated relevance rule based on the key information and the initial relevance rule, wherein the generating comprises identifying, by the computer, a conflict between the key information and the initial relevance rule, wherein one of the key information and the initial relevance rule identifies at least one document within the set of documents to be relevant and the other of the key information and the initial relevance rule identifies the at least one document within the set of documents to be non-relevant; generating, by the processing device, a query based on the updated relevance rule for identifying the relevant documents within the set of documents; and outputting, by the processing device, the set of documents within which the relevant documents have been identified. | 1. A computer-implemented method comprising: generating, by a processing device, a filter for identifying a relevant document based on an initial relevance rule related to a set of documents; applying, by the processing device, the filter to the set of documents thereby identifying a subset of relevant documents; receiving, by the processing device from an assessor, the subset of relevant documents comprising an identification of key information; generating, by the processing device, an updated relevance rule based on the key information and the initial relevance rule, wherein the generating comprises identifying, by the computer, a conflict between the key information and the initial relevance rule, wherein one of the key information and the initial relevance rule identifies at least one document within the set of documents to be relevant and the other of the key information and the initial relevance rule identifies the at least one document within the set of documents to be non-relevant; generating, by the processing device, a query based on the updated relevance rule for identifying the relevant documents within the set of documents; and outputting, by the processing device, the set of documents within which the relevant documents have been identified. 3. The computer-implemented method of claim 1 , wherein applying the filter to the set of documents to identify the subset of relevant documents comprises: grouping the set of documents into a plurality of subsets, wherein each subset corresponds to a topic, and identifying the subset of relevant documents, wherein the topic corresponding to the subset of relevant documents matches a relevant word included in the filter. | 0.598485 |
9,122,758 | 5 | 8 | 5. A computer-implemented method under control of one or more computing devices configured with specific computer-executable instructions: associating an indicator of a first browsing activity of a user with a shared electronic session between a target user and the user, wherein the first browsing activity of the user is independent of a second browsing activity of the target user; transmit, to the target user, the indicator, the indicator further representing a first item available for purchase via an electronic commerce website; determining one or more other items associated with the first browsing activity of the user; and generating a recommendation for the target user that includes at least one item of the one or more other items based at least in part on the first browsing activity. | 5. A computer-implemented method under control of one or more computing devices configured with specific computer-executable instructions: associating an indicator of a first browsing activity of a user with a shared electronic session between a target user and the user, wherein the first browsing activity of the user is independent of a second browsing activity of the target user; transmit, to the target user, the indicator, the indicator further representing a first item available for purchase via an electronic commerce website; determining one or more other items associated with the first browsing activity of the user; and generating a recommendation for the target user that includes at least one item of the one or more other items based at least in part on the first browsing activity. 8. The computer-implemented method of claim 5 , further comprising performing sentiment analysis on a chat activity of the user or target user to determine a sentiment of the user with respect to the one or more items; and wherein generating the recommendation is based at least in part on the first browsing activity, the chat activity, and the sentiment of the user. | 0.735252 |
9,280,340 | 19 | 20 | 19. The computer program product as described in claim 15 wherein the first element is identified using a visual editor. | 19. The computer program product as described in claim 15 wherein the first element is identified using a visual editor. 20. The computer program product as described in claim 19 wherein the second element is associated with the first element using the visual editor. | 0.943629 |
9,311,490 | 7 | 10 | 7. A first device, comprising: a memory configured to store data and computer-executable instructions; and a processor operatively coupled to the memory, wherein the processor and memory are configured to: send, to a second device, first communication data; receive, from the second device, second communication data; in response to determining that a data privacy attribute of the second portable communication device is equivalent to a predetermined data privacy attribute, protect the second communication data by at least: converting the first communication data to a first set of text; converting the second communication data to a second set of text; and applying a privacy filter to the first set of text to generate a filtered set of text by removing from the first set of text any text that is repeated in the second set of text; determine a first keyword from the filtered set of text; send, to a third computing device, the first keyword; and receive, from the third computing device, contextual data associated with the first keyword. | 7. A first device, comprising: a memory configured to store data and computer-executable instructions; and a processor operatively coupled to the memory, wherein the processor and memory are configured to: send, to a second device, first communication data; receive, from the second device, second communication data; in response to determining that a data privacy attribute of the second portable communication device is equivalent to a predetermined data privacy attribute, protect the second communication data by at least: converting the first communication data to a first set of text; converting the second communication data to a second set of text; and applying a privacy filter to the first set of text to generate a filtered set of text by removing from the first set of text any text that is repeated in the second set of text; determine a first keyword from the filtered set of text; send, to a third computing device, the first keyword; and receive, from the third computing device, contextual data associated with the first keyword. 10. The first device of claim 7 , wherein each of the first communication data and the second communication data is text data. | 0.886894 |
9,633,002 | 17 | 18 | 17. A system, comprising: one or more processors; and a memory device operatively coupled to the one or more processors and storing instructions which, when executed by the one or more processors, cause the system to perform functions that include: ingesting text data from a plurality of documents, the text data comprising a plurality of mentions corresponding to entities; determining a plurality of data features, comprising semantic features and syntactic features, for comparing a particular pair of mentions from the plurality of mentions; selectively activating a subset of features from the plurality of data features based on semantic and syntactic context of the particular pair of mentions within the text data; and determining, using weights associated with the activated subset of features and at least one computer implemented machine learning function, whether a first mention of the pair of mentions and second mention of the pair of mentions refer to the same real-world entity; responsive to determining that the first mention and second mention refer to the same real-world entity, resolving the first mention and second mention to the real-world entity; and outputting an indication that identifies the first mention and second mention as being resolved to the real-world entity. | 17. A system, comprising: one or more processors; and a memory device operatively coupled to the one or more processors and storing instructions which, when executed by the one or more processors, cause the system to perform functions that include: ingesting text data from a plurality of documents, the text data comprising a plurality of mentions corresponding to entities; determining a plurality of data features, comprising semantic features and syntactic features, for comparing a particular pair of mentions from the plurality of mentions; selectively activating a subset of features from the plurality of data features based on semantic and syntactic context of the particular pair of mentions within the text data; and determining, using weights associated with the activated subset of features and at least one computer implemented machine learning function, whether a first mention of the pair of mentions and second mention of the pair of mentions refer to the same real-world entity; responsive to determining that the first mention and second mention refer to the same real-world entity, resolving the first mention and second mention to the real-world entity; and outputting an indication that identifies the first mention and second mention as being resolved to the real-world entity. 18. The system of claim 17 , wherein the indication identifies the first mention, second mention, and real-world entity. | 0.704433 |
10,108,812 | 2 | 3 | 2. The computer system of claim 1 , wherein: a third one of the plurality of digital cryptographic data structures is associated with at least one editor user that edits documents to be released, the processing system is further configured to: when a blockchain transaction for the digital document is associated with the digital cryptographic data structure of the editor user, receive, from a computer system associated with the editor user, edits of the document; generate a fourth blockchain transaction based on the edits and/or an edited version of the document; and submit the fourth blockchain transaction to the blockchain for incorporation into the blockchain, wherein the fourth blockchain transaction is linked to, directly or indirectly, the first, second, and third blockchain transactions. | 2. The computer system of claim 1 , wherein: a third one of the plurality of digital cryptographic data structures is associated with at least one editor user that edits documents to be released, the processing system is further configured to: when a blockchain transaction for the digital document is associated with the digital cryptographic data structure of the editor user, receive, from a computer system associated with the editor user, edits of the document; generate a fourth blockchain transaction based on the edits and/or an edited version of the document; and submit the fourth blockchain transaction to the blockchain for incorporation into the blockchain, wherein the fourth blockchain transaction is linked to, directly or indirectly, the first, second, and third blockchain transactions. 3. The computer system of claim 2 , wherein the fourth blockchain transaction is assigned to a blockchain identifier associated with the digital cryptographic data structure of a second editor user, wherein the processing system is further configured to generate a fifth blockchain transaction based on edits to the document received from the second editor user and submit the fifth blockchain transaction to the blockchain, wherein the fifth blockchain transaction is linked to, directly or indirectly, the first, second, third, and fourth blockchain transactions. | 0.884929 |
7,707,245 | 1 | 6 | 1. A process executing on a hardware device comprising a metasearch engine for metasearching on a distributed network activated by a request executed on a client device to request the metasearch engine to send a plurality of search queries comprising at least two keyword phrases to a plurality of server devices, each search query of the plurality of search queries comprising a keyword phrase of the at least two keyword phrases, each of the at least two keyword phrases comprising at least one keyword, comprising the steps of: (a) receiving, at the metasearch engine, the request from the client device for the metasearch engine to send the plurality of search queries comprising the at least two keyword phrases to the plurality of server devices; (b) sending, by the metasearch engine, the plurality of search queries comprising the at least two keyword phrases to the plurality of server devices; (c) receiving, at the metasearch engine, search results from the plurality of server devices in response to the plurality of search queries comprising the at least two keyword phrases sent to the plurality of server devices; (d) incorporating, by the metasearch engine, the received search results into at least two different order books corresponding to the at least two keyword phrases; (e) incorporating, by the metasearch engine, the at least two different order books of received search results into a response for communicating to the client device; (f) communicating, by the metasearch engine, the response from the metasearch engine to the client device. | 1. A process executing on a hardware device comprising a metasearch engine for metasearching on a distributed network activated by a request executed on a client device to request the metasearch engine to send a plurality of search queries comprising at least two keyword phrases to a plurality of server devices, each search query of the plurality of search queries comprising a keyword phrase of the at least two keyword phrases, each of the at least two keyword phrases comprising at least one keyword, comprising the steps of: (a) receiving, at the metasearch engine, the request from the client device for the metasearch engine to send the plurality of search queries comprising the at least two keyword phrases to the plurality of server devices; (b) sending, by the metasearch engine, the plurality of search queries comprising the at least two keyword phrases to the plurality of server devices; (c) receiving, at the metasearch engine, search results from the plurality of server devices in response to the plurality of search queries comprising the at least two keyword phrases sent to the plurality of server devices; (d) incorporating, by the metasearch engine, the received search results into at least two different order books corresponding to the at least two keyword phrases; (e) incorporating, by the metasearch engine, the at least two different order books of received search results into a response for communicating to the client device; (f) communicating, by the metasearch engine, the response from the metasearch engine to the client device. 6. The process executing on the hardware device of claim 1 , wherein each of the at least two different order books comprises bid data and offer data, step (d) further comprises: sorting, by the metasearch engine, the bid data within the each of the at least two different order books; sorting, by the metasearch engine, the offer data within the each of the at least two different order books. | 0.959943 |
8,943,094 | 18 | 20 | 18. A system, comprising: one or more processors; and memory, communicatively coupled to the one or more processors, storing one or more modules configured to: electronically receive a natural language input phrase from an interface device; attribute a concept to the natural language input phrase, wherein the concept is a breakdown of one or more ideas in the input phrase and the attributing is based at least in part on a pattern among terms in the natural language input phrase; associate a word in the natural language input phrase with the concept; search a database of a set of documents to identify one or more documents associated with the attributed concept to be included in a response to the natural language input phrase; maintain the concept during an interactive session between the natural language processor and the interface device; receive an ambiguous natural language input phrase during the interactive session; and determine that the ambiguous natural language input phrase has a same meaning as the word that is associated with the concept. | 18. A system, comprising: one or more processors; and memory, communicatively coupled to the one or more processors, storing one or more modules configured to: electronically receive a natural language input phrase from an interface device; attribute a concept to the natural language input phrase, wherein the concept is a breakdown of one or more ideas in the input phrase and the attributing is based at least in part on a pattern among terms in the natural language input phrase; associate a word in the natural language input phrase with the concept; search a database of a set of documents to identify one or more documents associated with the attributed concept to be included in a response to the natural language input phrase; maintain the concept during an interactive session between the natural language processor and the interface device; receive an ambiguous natural language input phrase during the interactive session; and determine that the ambiguous natural language input phrase has a same meaning as the word that is associated with the concept. 20. The system of claim 18 , wherein the one or more modules are further configured to: identify a goal associated with the natural language input phrase; and initiate an interactive dialog between the interface device and the natural language processor to acquire information associated with the goal. | 0.814268 |
6,101,512 | 10 | 11 | 10. The computer program product of claim 1, wherein the computer program logic further defines: for selected elements, a record for storing the element identifier of the element and the element identifier of a next element in the digital document which is not contained within the element. | 10. The computer program product of claim 1, wherein the computer program logic further defines: for selected elements, a record for storing the element identifier of the element and the element identifier of a next element in the digital document which is not contained within the element. 11. The computer program product of claim 10, wherein the record for an element includes an indication of the type name of the element. | 0.95364 |
8,396,735 | 1 | 12 | 1. A non-transitory machine-readable medium having stored thereon a set of instructions, which when executed on a computing device causes the device to perform a method, the method comprising: providing to a user a visual display advertisement on a media channel on behalf of an advisor, wherein the visual display advertisement includes at least a user selectable reference to establish a real-time communication connection with the advisor, an indication of whether the advisor is currently available to communicate via real time communication at a time when the user is viewing the visual display advertisement, and a display of an item associated with the advisor selected from a group consisting of a compensation rate for the advisor and a quality score for the advisor, wherein the visual display advertisement advertises the advisor to the user at least partially based on an order relative to other advisors, the order at least partially based on one or both of the compensation rate and the quality score; while the advisor is currently available, receiving a user selection of the user selectable reference corresponding to the advisor, and a central controller using the user selection of the user selectable reference to establish a real-time communication connection between the advisor and the user prior to the user submitting a question for the advisor including the central controller using the user selection to establish a real-time communication connection with the advisor and with the user prior to the user submitting a question for the advisor, wherein the establishing the real-time communication connection comprises the central controller originating a first communication connection to the advisor and a second communication connection to the user; and charging an amount for the real-time communication connection established between the advisor and the user based at least in part on the compensation rate. | 1. A non-transitory machine-readable medium having stored thereon a set of instructions, which when executed on a computing device causes the device to perform a method, the method comprising: providing to a user a visual display advertisement on a media channel on behalf of an advisor, wherein the visual display advertisement includes at least a user selectable reference to establish a real-time communication connection with the advisor, an indication of whether the advisor is currently available to communicate via real time communication at a time when the user is viewing the visual display advertisement, and a display of an item associated with the advisor selected from a group consisting of a compensation rate for the advisor and a quality score for the advisor, wherein the visual display advertisement advertises the advisor to the user at least partially based on an order relative to other advisors, the order at least partially based on one or both of the compensation rate and the quality score; while the advisor is currently available, receiving a user selection of the user selectable reference corresponding to the advisor, and a central controller using the user selection of the user selectable reference to establish a real-time communication connection between the advisor and the user prior to the user submitting a question for the advisor including the central controller using the user selection to establish a real-time communication connection with the advisor and with the user prior to the user submitting a question for the advisor, wherein the establishing the real-time communication connection comprises the central controller originating a first communication connection to the advisor and a second communication connection to the user; and charging an amount for the real-time communication connection established between the advisor and the user based at least in part on the compensation rate. 12. The medium of claim 1 , wherein the charging of the amount comprises charging the user. | 0.887654 |
9,002,958 | 1 | 2 | 1. A method, performed by a computer, for processing an email message to provide feedback related to a particular person in to a group of persons associated with an enterprise, wherein the email message includes a comment on workplace performance of the particular person in the group, the method comprising: displaying, by the computer system, contents of a received email message or an email message to be sent on a user interface display, displayed on a display screen, of an email client, where the user interface display includes a feedback control and a tag control; selectively designating, by the computer system and in response to input signals to the feedback control, selected text included in displayed contents of the email message as performance feedback information relating to the particular person; tagging, by the computer system and in response to input signals to the tag control, the performance feedback information as competency feedback information or teamwork feedback information; and associating, by the computer system and in response to user input, tagged selected text of the email message designated as performance feedback information with a performance management document associated with the particular person. | 1. A method, performed by a computer, for processing an email message to provide feedback related to a particular person in to a group of persons associated with an enterprise, wherein the email message includes a comment on workplace performance of the particular person in the group, the method comprising: displaying, by the computer system, contents of a received email message or an email message to be sent on a user interface display, displayed on a display screen, of an email client, where the user interface display includes a feedback control and a tag control; selectively designating, by the computer system and in response to input signals to the feedback control, selected text included in displayed contents of the email message as performance feedback information relating to the particular person; tagging, by the computer system and in response to input signals to the tag control, the performance feedback information as competency feedback information or teamwork feedback information; and associating, by the computer system and in response to user input, tagged selected text of the email message designated as performance feedback information with a performance management document associated with the particular person. 2. The method of claim 1 further including providing a user option to assign multiple designations to the selected text, wherein the multiple designations include a designation as feedback. | 0.502632 |
9,699,472 | 7 | 8 | 7. A method for encoding video data, the method comprising: partitioning a coding unit (CU) in a B slice into one or more prediction units (PUs); and for at least one of the PUs of the CU: determining, based on a size characteristic of the PU, that the PU is restricted to uni-directional inter prediction; and signaling, in a bitstream, an inter prediction mode indicator for the PU, wherein when the PU is restricted to uni-directional inter prediction, the inter prediction mode indicator is able to indicate that the PU is either uni-directionally inter predicted based on a list 0 or uni-directionally inter predicted based on a list 1 , wherein when the PU is not restricted to uni-directional inter prediction, the inter prediction mode indicator is able to indicate the PU is either uni-directionally inter predicted based on the list 0 , uni-directionally inter predicted based on the list 1 , or bi-directionally predicted. | 7. A method for encoding video data, the method comprising: partitioning a coding unit (CU) in a B slice into one or more prediction units (PUs); and for at least one of the PUs of the CU: determining, based on a size characteristic of the PU, that the PU is restricted to uni-directional inter prediction; and signaling, in a bitstream, an inter prediction mode indicator for the PU, wherein when the PU is restricted to uni-directional inter prediction, the inter prediction mode indicator is able to indicate that the PU is either uni-directionally inter predicted based on a list 0 or uni-directionally inter predicted based on a list 1 , wherein when the PU is not restricted to uni-directional inter prediction, the inter prediction mode indicator is able to indicate the PU is either uni-directionally inter predicted based on the list 0 , uni-directionally inter predicted based on the list 1 , or bi-directionally predicted. 8. The method of claim 7 , wherein: when the PU is restricted to uni-directional inter prediction, the inter prediction mode indicator is represented using only a single bit, and when the PU is not restricted to uni-directional inter prediction, the inter prediction mode indicator is represented using two bits. | 0.662338 |
9,229,922 | 4 | 5 | 4. The computer program product recited in claim 1 , wherein the argument comprises a function argument and wherein the user interface object comprises an argument user interface object. | 4. The computer program product recited in claim 1 , wherein the argument comprises a function argument and wherein the user interface object comprises an argument user interface object. 5. The computer program product recited in claim 4 , wherein the argument user interface object comprises a placeholder user interface object that represents a position of the argument in an argument list of the function and indicates a type of data expected for the argument. | 0.927559 |
8,948,789 | 11 | 15 | 11. A system for inferring a high-level context associated with a mobile device, the system comprising: memory; a processor coupled to the memory; a context aggregator configured to: access, via the processor, low-level context information for each of a plurality of other devices, wherein location information associated with each of the other devices indicates a proximity to a location of the mobile device, and wherein the low-level context information for each of the other devices is based on data collected by a sensor of the respective other device; aggregate the low-level context information across the plurality of other devices; a high-level template comparison engine configured to: compare, via the processor, the aggregated low-level context information to a plurality of templates, each template being associated with a high-level context and including one or more histograms of context data; determine match scores between the aggregated low-level context information and each of the one or more histograms of context data; and a transceiver configured to transmit, to the mobile device, a multi-device statistical summary comprising the aggregated low-level context information and the match scores; and the mobile device inferring a context based on the multi-device statistical summary and additional data not included in the multi-device statistical summary. | 11. A system for inferring a high-level context associated with a mobile device, the system comprising: memory; a processor coupled to the memory; a context aggregator configured to: access, via the processor, low-level context information for each of a plurality of other devices, wherein location information associated with each of the other devices indicates a proximity to a location of the mobile device, and wherein the low-level context information for each of the other devices is based on data collected by a sensor of the respective other device; aggregate the low-level context information across the plurality of other devices; a high-level template comparison engine configured to: compare, via the processor, the aggregated low-level context information to a plurality of templates, each template being associated with a high-level context and including one or more histograms of context data; determine match scores between the aggregated low-level context information and each of the one or more histograms of context data; and a transceiver configured to transmit, to the mobile device, a multi-device statistical summary comprising the aggregated low-level context information and the match scores; and the mobile device inferring a context based on the multi-device statistical summary and additional data not included in the multi-device statistical summary. 15. The system of claim 11 , wherein comparing the aggregated low-level context information to a plurality of templates comprises generating a score associated with each template of the plurality of templates. | 0.687126 |
9,684,641 | 27 | 29 | 27. A system comprising: one or more processors; one or more computer readable media maintaining one or more modules executable by the one or more processors to perform operations comprising: receiving a first version and a second version of a content item, wherein the first version is composed of a different language than the second version; determining first location information for a first word within content of the first version of the content item, the first location information including a first numerical offset corresponding to a first start location and a second numerical offset corresponding to a first end location of the first word within the content of the first version of the content item; determining second location information for a second word within content of the second version of the content item, the second location information including a third numerical offset corresponding to a second start location and a fourth numerical offset corresponding to a second end location of the second word within the content of the second version of the content item; generating mapping information that includes the first location information and the second location information, wherein the mapping information associates the first location information of the first word within the content of the first version of the content item with the second location information of the second word within the content of the second version of the content; and sending the mapping information to a device that has access to the first version and the second version of the content item. | 27. A system comprising: one or more processors; one or more computer readable media maintaining one or more modules executable by the one or more processors to perform operations comprising: receiving a first version and a second version of a content item, wherein the first version is composed of a different language than the second version; determining first location information for a first word within content of the first version of the content item, the first location information including a first numerical offset corresponding to a first start location and a second numerical offset corresponding to a first end location of the first word within the content of the first version of the content item; determining second location information for a second word within content of the second version of the content item, the second location information including a third numerical offset corresponding to a second start location and a fourth numerical offset corresponding to a second end location of the second word within the content of the second version of the content item; generating mapping information that includes the first location information and the second location information, wherein the mapping information associates the first location information of the first word within the content of the first version of the content item with the second location information of the second word within the content of the second version of the content; and sending the mapping information to a device that has access to the first version and the second version of the content item. 29. The system as recited in claim 27 , wherein generating the mapping information further comprises: receiving the first word from the first version translated into a language of the second version; comparing the first word from the first version translated into the language of the second version with the second word of the second version to find at least one of a word correlation or a phrase correlation; and mapping the first location information of the first word from the first version to the second location information of the second word of the second version. | 0.76979 |
8,386,511 | 7 | 12 | 7. A non-transitory computer readable storage medium having instructions stored thereon that, when executed by a processing system, cause the processing system to perform a method comprising: creating, by a similarity model generator of a computing device, a similarity model of a reference document stored in a database in a storage device, the similarity model of the reference document based on an adaptive entropy coding compressor; computing, by a similarity comparator of the computing device for each of the reference document and a compared document, a number of compression bit needed to compress each of the reference document and the compared document using the similarity model of the reference document; normalizing each of the computed number of compression bits for the reference document and the compared document, wherein the normalizing comprising dividing the computed number of compression bits by a number of tokens in the document being normalized; assigning each of the normalized computed number of compression bits as a similarity score for the respective reference document and the compared document; and computing, by the similarity comparator, a similarity measure between the compared document and the reference document, the similarity measure being a function of each of the similarity scores of the compared document and the reference document. | 7. A non-transitory computer readable storage medium having instructions stored thereon that, when executed by a processing system, cause the processing system to perform a method comprising: creating, by a similarity model generator of a computing device, a similarity model of a reference document stored in a database in a storage device, the similarity model of the reference document based on an adaptive entropy coding compressor; computing, by a similarity comparator of the computing device for each of the reference document and a compared document, a number of compression bit needed to compress each of the reference document and the compared document using the similarity model of the reference document; normalizing each of the computed number of compression bits for the reference document and the compared document, wherein the normalizing comprising dividing the computed number of compression bits by a number of tokens in the document being normalized; assigning each of the normalized computed number of compression bits as a similarity score for the respective reference document and the compared document; and computing, by the similarity comparator, a similarity measure between the compared document and the reference document, the similarity measure being a function of each of the similarity scores of the compared document and the reference document. 12. The non-transitory computer readable storage medium of claim 7 , wherein the method further comprises: preprocessing the compared and reference documents to enhance the statistical features of the compared and reference documents. | 0.637771 |
6,105,043 | 15 | 18 | 15. The method of claim 3 above, further comprising the steps of displaying a user interface on the monitor and accepting user input via the displayed user interface to specify a type of search to be performed by the dynamic SQL query. | 15. The method of claim 3 above, further comprising the steps of displaying a user interface on the monitor and accepting user input via the displayed user interface to specify a type of search to be performed by the dynamic SQL query. 18. The method of claim 15 above, wherein the type of search comprises "ORed" input fields of the HTML input form. | 0.972004 |
9,870,345 | 1 | 2 | 1. A computer-implemented method, comprising: receiving, at a computing device executing a communication application, a received textual message from a sender user, the received textual message including text content; determining, at the computing device, an insertion point for the received textual message based on the text content, the insertion point corresponding to a particular location of a plurality of possible locations in a graphical user interface of the communication application, each of the plurality of possible locations corresponding to a position in the graphical user interface subsequent to a preceding textual message; and displaying, at the computing device, the received textual message in the graphical user interface of the communication application at the determined insertion point, wherein: the received textual message is received by the computing device at a first time; and when (i) the computing device is displaying the graphical user interface at the first time, and (ii) the determined insertion point corresponds to a re-ordered position other than a most recent textual message position, the displaying the received textual message in the graphical user interface at the determined insertion point comprises providing an active indication of the received textual message being inserted at the insertion point. | 1. A computer-implemented method, comprising: receiving, at a computing device executing a communication application, a received textual message from a sender user, the received textual message including text content; determining, at the computing device, an insertion point for the received textual message based on the text content, the insertion point corresponding to a particular location of a plurality of possible locations in a graphical user interface of the communication application, each of the plurality of possible locations corresponding to a position in the graphical user interface subsequent to a preceding textual message; and displaying, at the computing device, the received textual message in the graphical user interface of the communication application at the determined insertion point, wherein: the received textual message is received by the computing device at a first time; and when (i) the computing device is displaying the graphical user interface at the first time, and (ii) the determined insertion point corresponds to a re-ordered position other than a most recent textual message position, the displaying the received textual message in the graphical user interface at the determined insertion point comprises providing an active indication of the received textual message being inserted at the insertion point. 2. The computer-implemented method of claim 1 wherein when at least one of: (i) the computing device is not displaying the graphical user interface at the first time, and (ii) the determined insertion point does not correspond to the re-ordered position: the displaying the received textual message in the graphical user interface at the determined insertion point comprises not providing the active indication. | 0.768841 |
9,026,509 | 20 | 21 | 20. The method of claim 7 , comprising modifying the received query by adding at least one of the said stored related terms to said received query to create a modified query. | 20. The method of claim 7 , comprising modifying the received query by adding at least one of the said stored related terms to said received query to create a modified query. 21. The method of claim 20 , comprising performing a search for documents with said modified query. | 0.923963 |
8,442,309 | 4 | 5 | 4. The method of claim 2 , wherein clustering the convoluted images comprises clustering the convoluted images using a hierarchical k-means clustering method. | 4. The method of claim 2 , wherein clustering the convoluted images comprises clustering the convoluted images using a hierarchical k-means clustering method. 5. The method of claim 4 , wherein each of the seventeen-degree vectors of a convoluted image is represented by an identification of the cluster to which the vector belongs. | 0.950992 |
8,433,123 | 7 | 8 | 7. A method of detecting suspect documents, wherein a financial institution system performs the acts comprising: receiving a plurality of electronic records, each of the electronic records including identifying information and image data that is reproducible as a visually readable image of at least a portion of a document; in response to the receiving, comparing the identifying information included in each one of the plurality of electronic records with suspect information to determine if any of the electronic records is associated with a suspect document; determining that one of the electronic records is associated with a suspect document based on the act of comparing; and in response to the determination that one of the electronic records is associated with a suspect document automatically transmitting a suspect notice. | 7. A method of detecting suspect documents, wherein a financial institution system performs the acts comprising: receiving a plurality of electronic records, each of the electronic records including identifying information and image data that is reproducible as a visually readable image of at least a portion of a document; in response to the receiving, comparing the identifying information included in each one of the plurality of electronic records with suspect information to determine if any of the electronic records is associated with a suspect document; determining that one of the electronic records is associated with a suspect document based on the act of comparing; and in response to the determination that one of the electronic records is associated with a suspect document automatically transmitting a suspect notice. 8. The method of claim 7 , wherein each electronic record is associated with a respective currency bill, a respective check, or a respective deposit slip. | 0.93578 |
9,335,826 | 7 | 8 | 7. A gesture-based input and interpretation system, comprising: a surface within reach of a hand of the user; a gesture-capturing device associated with the surface and configured to sense a plurality of locations on the surface that are touched by the user; and a gesture recognition device communicatively coupled to the gesture-capturing device and configured to: collect information associated with a plurality of hand region localized modules corresponding to skin on the hand of the user and a background corresponding to the surface; generate a first score corresponding to a likelihood that a portion of the collected information corresponds to the skin on the hand of the user using a first lower level statistical model; generate a second score corresponding to a likelihood that a portion of the collected information corresponds to the background using a second lower level statistical model; generate a combined score based on the first score and the second score using a higher level statistical model; and determine the alphanumeric character using combined scores from the first and second lower level statistical models and the higher level statistical model. | 7. A gesture-based input and interpretation system, comprising: a surface within reach of a hand of the user; a gesture-capturing device associated with the surface and configured to sense a plurality of locations on the surface that are touched by the user; and a gesture recognition device communicatively coupled to the gesture-capturing device and configured to: collect information associated with a plurality of hand region localized modules corresponding to skin on the hand of the user and a background corresponding to the surface; generate a first score corresponding to a likelihood that a portion of the collected information corresponds to the skin on the hand of the user using a first lower level statistical model; generate a second score corresponding to a likelihood that a portion of the collected information corresponds to the background using a second lower level statistical model; generate a combined score based on the first score and the second score using a higher level statistical model; and determine the alphanumeric character using combined scores from the first and second lower level statistical models and the higher level statistical model. 8. The system of claim 7 wherein the first and second lower level statistical models include a Gaussian Mixture Model a Support Vector Machine. | 0.85757 |
9,665,550 | 15 | 16 | 15. The system of claim 14 , further comprising storing the menu items in a relationship association with the portion of the text in the associated database. | 15. The system of claim 14 , further comprising storing the menu items in a relationship association with the portion of the text in the associated database. 16. The system of claim 15 , where the networked computing device is further configured to match the menu items from the associated database with a second electronic written work based on the relationship association. | 0.942985 |
7,860,817 | 25 | 26 | 25. The computer of claim 19 , wherein the at least one hardware processor executes the processor executable instructions to identify at least one facet attribute in each of at least some of the pairs of concepts by: identifying a plurality of keywords in the at least some of the pairs of concepts; and identifying the plurality of facet attributes in the plurality of keywords. | 25. The computer of claim 19 , wherein the at least one hardware processor executes the processor executable instructions to identify at least one facet attribute in each of at least some of the pairs of concepts by: identifying a plurality of keywords in the at least some of the pairs of concepts; and identifying the plurality of facet attributes in the plurality of keywords. 26. The computer of claim 25 , wherein the at least one hardware processor executes the processor executable instructions to identify the plurality of facet attributes in the plurality of keywords by: defining at least one pattern for use as criteria for identifying facet attribute candidates; applying the at least one pattern against the plurality of keywords; and based on the application of the at least one pattern, identifying a candidate set of facet attributes. | 0.781395 |
7,882,124 | 16 | 17 | 16. The non-transitory computer-readable storage medium of claim 15 , wherein the instructions for determining whether the at least one query term is associated with one or more other query terms through visual content further comprises instructions for: identifying association scores between a linguistic word that is equivalent to the at least one query term and one or more other linguistic words in the set of linguistic words; comparing the association scores between the linguistic word that is equivalent to the at least one query term and one or more other linguistic words in the set of linguistic words with a preset threshold to determine which of the one or more other linguistic words have association scores higher than the preset threshold; wherein the instructions for determining, based on the association score, that the at least one query term is associated with the one or more other query terms through visual content comprise instructions for: determining that the at least one query term is associated with query terms which are equivalent to linguistic words which have association scores higher than the preset threshold. | 16. The non-transitory computer-readable storage medium of claim 15 , wherein the instructions for determining whether the at least one query term is associated with one or more other query terms through visual content further comprises instructions for: identifying association scores between a linguistic word that is equivalent to the at least one query term and one or more other linguistic words in the set of linguistic words; comparing the association scores between the linguistic word that is equivalent to the at least one query term and one or more other linguistic words in the set of linguistic words with a preset threshold to determine which of the one or more other linguistic words have association scores higher than the preset threshold; wherein the instructions for determining, based on the association score, that the at least one query term is associated with the one or more other query terms through visual content comprise instructions for: determining that the at least one query term is associated with query terms which are equivalent to linguistic words which have association scores higher than the preset threshold. 17. The non-transitory computer-readable storage medium of claim 16 , wherein the preset threshold is zero. | 0.960806 |
7,606,428 | 37 | 38 | 37. The computer readable medium of claim 36 , wherein the AFXConfig template outputs decSpecificInfo AFXConfig { to the mux file when AFXConfig is found by the parsing, calls an Octreel mageDecoderSpecific template when OctreeImageDecoderSpecific is found by the parsing, calls a PointTextureCompDecoderSpecific template when PointTextureCompDecoderSpecific is found by the parsing, and outputs } to the mux file. | 37. The computer readable medium of claim 36 , wherein the AFXConfig template outputs decSpecificInfo AFXConfig { to the mux file when AFXConfig is found by the parsing, calls an Octreel mageDecoderSpecific template when OctreeImageDecoderSpecific is found by the parsing, calls a PointTextureCompDecoderSpecific template when PointTextureCompDecoderSpecific is found by the parsing, and outputs } to the mux file. 38. The computer readable medium of claim 37 , wherein the OctreeImageDecoderSpecific template outputs OctreeImageDecoderSpecific { }to the mux file when OctreeImageDecoderSpecific is found by the parsing. | 0.924577 |
7,542,980 | 8 | 13 | 8. A method of comparing configurations of a business application, comprising: generating a first object-oriented model representing a first configuration of the business application stored in a control database; generating a second object-oriented model representing a second configuration of the business application that is currently deployed; generating a third object-oriented model representing a third configuration of the business application that has been modified from the currently deployed configuration; comparing objects of the first object-oriented model, the second object-oriented model, and the third object-oriented model to identify a difference between the first object-oriented model, the second object-oriented model, and the third object-oriented model; analyzing the identified difference to determine which object-oriented model represents a desired configuration of the business application; and designating the object-oriented model representing the desired configuration of the business application, based on the analysis of the identified difference. | 8. A method of comparing configurations of a business application, comprising: generating a first object-oriented model representing a first configuration of the business application stored in a control database; generating a second object-oriented model representing a second configuration of the business application that is currently deployed; generating a third object-oriented model representing a third configuration of the business application that has been modified from the currently deployed configuration; comparing objects of the first object-oriented model, the second object-oriented model, and the third object-oriented model to identify a difference between the first object-oriented model, the second object-oriented model, and the third object-oriented model; analyzing the identified difference to determine which object-oriented model represents a desired configuration of the business application; and designating the object-oriented model representing the desired configuration of the business application, based on the analysis of the identified difference. 13. The method of claim 8 , further comprising: receiving a modification to the currently deployed configuration of the business application from a user via a user interface; and enabling the user to request comparison of configurations of the business application by selecting a button on the user interface. | 0.706831 |
8,024,733 | 7 | 8 | 7. The computer-implemented method of claim 1 , wherein the set of deployment descriptors includes descriptors for identifying business function components, symbolic references resolved at deployment time, for conditioning a checkpoint interval and enumerating resource dependencies identify resources that are needed for the batch job. | 7. The computer-implemented method of claim 1 , wherein the set of deployment descriptors includes descriptors for identifying business function components, symbolic references resolved at deployment time, for conditioning a checkpoint interval and enumerating resource dependencies identify resources that are needed for the batch job. 8. The computer-implemented method of claim 7 , wherein managing operation of the batch component includes allocating, by the batch container, at least a portion of the resources for at least a portion of the batch job. | 0.951613 |
9,138,591 | 21 | 23 | 21. The device of claim 18 , further comprising: a database structured to store the prompts in each of a plurality of supported languages, and in which the language selector is structured to determine whether the selected language is one of the plurality of supported languages. | 21. The device of claim 18 , further comprising: a database structured to store the prompts in each of a plurality of supported languages, and in which the language selector is structured to determine whether the selected language is one of the plurality of supported languages. 23. The device of claim 21 , further comprising: a communication module within the housing to establish a wireless connection to provide access to the database, and in which the database is at a location that is remote from the device. | 0.837931 |
7,818,333 | 2 | 3 | 2. The method of claim 1 further comprising the step of assigning penalties when disfavored matches occur in applying the input address to the one or more branches of the parsing tree. | 2. The method of claim 1 further comprising the step of assigning penalties when disfavored matches occur in applying the input address to the one or more branches of the parsing tree. 3. The method of claim 2 further comprising ranking the one or more parsing tree branches that include matches based on the assigned penalties. | 0.950244 |
7,869,997 | 15 | 19 | 15. A computing device for recognizing a received phoneme, the computing device comprising: a module configured to generate an expanded received-signal vector from a received signal vector associated with a received phoneme; a module configured to transform the expanded received-signal vector into an orthogonal form associated with a hypersphere having a center and a radius; a module configured to determine a first distance associated with the orthogonal form of the expanded received-signal vector and a second distance associated with each orthogonal form of expanded stored phoneme vectors; and a module configured to recognize the received phoneme according to a comparison of the first distance with the second distance. | 15. A computing device for recognizing a received phoneme, the computing device comprising: a module configured to generate an expanded received-signal vector from a received signal vector associated with a received phoneme; a module configured to transform the expanded received-signal vector into an orthogonal form associated with a hypersphere having a center and a radius; a module configured to determine a first distance associated with the orthogonal form of the expanded received-signal vector and a second distance associated with each orthogonal form of expanded stored phoneme vectors; and a module configured to recognize the received phoneme according to a comparison of the first distance with the second distance. 19. The computing device of claim 15 , wherein the module configured to determine a distance associated with the orthogonal form of the expanded received-signal vector and each orthogonal form of the expanded stored-phoneme vectors further: compares a distance from the center of the hypersphere of the orthogonal form of the expanded received-signal vector with a distance from the center of the hypersphere for each orthogonal form of the expanded stored-phoneme vector. | 0.735129 |
8,640,088 | 15 | 17 | 15. A computer system for reuse of a software code, the computer system comprising: a processor; a computer readable storage device; a computer readable memory; first program instructions to obfuscate the software code from an original state of the software code; second program instructions to present the obfuscated software code to a first participant and a second participant; third program instructions to collect communications between the first participant and the second participant, wherein the communications comprise questions about the obfuscated software code posed by the first participant and the second participant, answers provided by the second participant to the questions, and guesses by the first participant of a functionality of the obfuscated software code; fourth program instructions to generate associations between the collected communications and respective portions of the software code; fifth program instructions to store the generated associations in a database of the computer system; sixth program instructions to, after the generated associations are stored, determine that the second participant has not indicated that the first participant understands the obfuscated software code, and in response, to partially reverse the obfuscated software code to transform the obfuscated software code to a partially obfuscated software code that is closer to the original state of the software code than the obfuscated code generated by first program instructions, and to process, by the second, third, fourth, and fifth program instructions, the partially obfuscated software code instead of the obfuscated software code generated by the first program instructions; and seventh program instructions to, after the obfuscated software code is partially reversed, determine if the second participant has indicated that the first participant understands the partially reversed obfuscated software code, and if not, to further reverse the partially obfuscated software code to transform the partially obfuscated software code to the original state of the software code or closer to the original state of the software code than the partially obfuscated software code generated by the sixth program instructions, and to process, by the second, third, fourth, and fifth program instructions, the further reversed partially obfuscated software code instead of the partially obfuscated software code generated by the sixth program instructions, wherein the first program instructions, the second program instructions, the third program instructions, the fourth program instructions, the fifth program instructions, the sixth program instructions, and the seventh program instructions are stored on the computer readable storage device for execution by the processor via the memory. | 15. A computer system for reuse of a software code, the computer system comprising: a processor; a computer readable storage device; a computer readable memory; first program instructions to obfuscate the software code from an original state of the software code; second program instructions to present the obfuscated software code to a first participant and a second participant; third program instructions to collect communications between the first participant and the second participant, wherein the communications comprise questions about the obfuscated software code posed by the first participant and the second participant, answers provided by the second participant to the questions, and guesses by the first participant of a functionality of the obfuscated software code; fourth program instructions to generate associations between the collected communications and respective portions of the software code; fifth program instructions to store the generated associations in a database of the computer system; sixth program instructions to, after the generated associations are stored, determine that the second participant has not indicated that the first participant understands the obfuscated software code, and in response, to partially reverse the obfuscated software code to transform the obfuscated software code to a partially obfuscated software code that is closer to the original state of the software code than the obfuscated code generated by first program instructions, and to process, by the second, third, fourth, and fifth program instructions, the partially obfuscated software code instead of the obfuscated software code generated by the first program instructions; and seventh program instructions to, after the obfuscated software code is partially reversed, determine if the second participant has indicated that the first participant understands the partially reversed obfuscated software code, and if not, to further reverse the partially obfuscated software code to transform the partially obfuscated software code to the original state of the software code or closer to the original state of the software code than the partially obfuscated software code generated by the sixth program instructions, and to process, by the second, third, fourth, and fifth program instructions, the further reversed partially obfuscated software code instead of the partially obfuscated software code generated by the sixth program instructions, wherein the first program instructions, the second program instructions, the third program instructions, the fourth program instructions, the fifth program instructions, the sixth program instructions, and the seventh program instructions are stored on the computer readable storage device for execution by the processor via the memory. 17. The computer system of claim 15 , wherein the first program instructions to obfuscate the software code comprises program instructions to obfuscate attributes of the software code into non-informative forms, and wherein the obfuscated attributes of the software code include variable, class, method name, or combinations thereof. | 0.655992 |
4,797,930 | 11 | 12 | 11. A speech producing apparatus as claimed in claim 10, wherein: said control means further includes a delta pitch assignment means for assigning an initial delta pitch to each syllable, said delta pitch which is assigned generally falling except for primary accent syllables which have a delta pitch of an increased frequency in falling mode and of a decreased frequency in rising mode, and said delta pitch which is assigned being restricted to differing predetermined limits for (1) any syllables prior to the first secondary accent syllable, (2) any syllables between the first secondary accent syllable and the primary accent syllable and (3) any syllables following said primary accent syllable. | 11. A speech producing apparatus as claimed in claim 10, wherein: said control means further includes a delta pitch assignment means for assigning an initial delta pitch to each syllable, said delta pitch which is assigned generally falling except for primary accent syllables which have a delta pitch of an increased frequency in falling mode and of a decreased frequency in rising mode, and said delta pitch which is assigned being restricted to differing predetermined limits for (1) any syllables prior to the first secondary accent syllable, (2) any syllables between the first secondary accent syllable and the primary accent syllable and (3) any syllables following said primary accent syllable. 12. A speech producing apparatus as claimed in claim 11, wherein: said input means further includes means for receiving a phrase delta pitch for limiting the expressiveness of a phrase; and said delta pitch assignment means limiting the delta pitch assigned to any syllable to be within the range of said phrase delta pitch from said base pitch. | 0.883367 |
8,655,861 | 1 | 6 | 1. A method, comprising: receiving, with a data access service, an input query from an enterprise software application, wherein the data access service is positioned between the enterprise software application and a multidimensional data source; parsing the input query into a parse tree; generating an abstract syntax tree based on the parse tree, the abstract syntax tree comprising input query elements and multidimensional expression query elements based on the input query; performing an evaluation of metadata comprised in the multidimensional expression query elements of the abstract syntax tree; restructuring the abstract syntax tree based on the evaluation of the metadata; executing a query based on the restructured abstract syntax tree on the multidimensional data source; and retrieving a query result set from the multidimensional data source comprising results that are responsive to the restructured abstract syntax tree. | 1. A method, comprising: receiving, with a data access service, an input query from an enterprise software application, wherein the data access service is positioned between the enterprise software application and a multidimensional data source; parsing the input query into a parse tree; generating an abstract syntax tree based on the parse tree, the abstract syntax tree comprising input query elements and multidimensional expression query elements based on the input query; performing an evaluation of metadata comprised in the multidimensional expression query elements of the abstract syntax tree; restructuring the abstract syntax tree based on the evaluation of the metadata; executing a query based on the restructured abstract syntax tree on the multidimensional data source; and retrieving a query result set from the multidimensional data source comprising results that are responsive to the restructured abstract syntax tree. 6. The method of claim 1 , wherein performing the evaluation of metadata comprised in the multidimensional expression query elements of the abstract syntax tree comprises evaluating an order of solve order equations that provide context to value expressions in the abstract syntax tree. | 0.658711 |
8,686,992 | 4 | 5 | 4. A computer based system for 3D shape matching and retrieval, comprising: one or more processors; a 3D model repository configured to store a plurality of 3D models; a model processing engine configured to generate representations of a query 3D model and 3D models in the 3D model repository; and a shape retrieval engine configured to retrieve the matching 3D models from the 3D model repository using at least the representation of the query 3D model and representations of the 3D models in the 3D model repository, the shape retrieval engine comprising: a comparator configured to: calculate a first correlation by combining first coefficients associated with the representation of the query 3D model and second coefficients associated with representations of 3D models in the repository to obtain a first output and calculating an inverse rotational Fourier transform of the first output to obtain the first correlation, wherein a number of the first and second coefficients depends on a specified first bandwidth associated with the transform; calculate a first similarity score based on the first correlation; rank one or more 3D models based on the first similarity score; calculating a second correlation by combining third coefficients associated with the representation of the query 3D model and fourth coefficients associated with representations of 3D models in the repository to obtain a second output and calculating an inverse rotational Fourier transform of the second output to obtain the second correlation, wherein a number of the third and fourth coefficients depends on a specified second bandwidth associated with the transform, the second bandwidth being higher than the first bandwidth; calculating, by the one or more processing devices, a second similarity score based on the second correlation; ranking, by the one or more processing devices, the 3D models used in the second correlation based on the second similarity score. | 4. A computer based system for 3D shape matching and retrieval, comprising: one or more processors; a 3D model repository configured to store a plurality of 3D models; a model processing engine configured to generate representations of a query 3D model and 3D models in the 3D model repository; and a shape retrieval engine configured to retrieve the matching 3D models from the 3D model repository using at least the representation of the query 3D model and representations of the 3D models in the 3D model repository, the shape retrieval engine comprising: a comparator configured to: calculate a first correlation by combining first coefficients associated with the representation of the query 3D model and second coefficients associated with representations of 3D models in the repository to obtain a first output and calculating an inverse rotational Fourier transform of the first output to obtain the first correlation, wherein a number of the first and second coefficients depends on a specified first bandwidth associated with the transform; calculate a first similarity score based on the first correlation; rank one or more 3D models based on the first similarity score; calculating a second correlation by combining third coefficients associated with the representation of the query 3D model and fourth coefficients associated with representations of 3D models in the repository to obtain a second output and calculating an inverse rotational Fourier transform of the second output to obtain the second correlation, wherein a number of the third and fourth coefficients depends on a specified second bandwidth associated with the transform, the second bandwidth being higher than the first bandwidth; calculating, by the one or more processing devices, a second similarity score based on the second correlation; ranking, by the one or more processing devices, the 3D models used in the second correlation based on the second similarity score. 5. The system of claim 4 , wherein the 3D model repository comprises a plurality of user generated models. | 0.878719 |
8,566,717 | 8 | 9 | 8. The computer-readable memory device of claim 1 , wherein the one more teaching animations comprises a video of a model hand properly executing the manual gesture on nondescript text. | 8. The computer-readable memory device of claim 1 , wherein the one more teaching animations comprises a video of a model hand properly executing the manual gesture on nondescript text. 9. The computer-readable memory device of claim 8 , the method further comprising: looping the play of the teaching animation for a predefined number of cycles; detecting the manual gesture applied to a portion of the display area in which the one or more launched teaching animations are playing; and incident to detecting the manual gesture, interrupting the looping of the teaching animation and hiding the display area. | 0.892585 |
7,533,172 | 52 | 56 | 52. A method, comprising: generating a peer advertisement for a peer in a peer-to-peer network, wherein the peer advertisement comprises an identifier for the peer and a communication address for the peer; wherein said peer advertisement further comprises an indication of a service or a content provided by the peer corresponding to that peer advertisement; generating a service advertisement for each of one or more of services provided by the peer, wherein each service advertisement comprises an identifier for the corresponding service and an indication of how to access the corresponding service; generating a content advertisement for each of one or more of contents provided by the peer, wherein each content advertisement comprises an identifier for the corresponding content and an indication of how to access the corresponding content; and publishing the peer advertisement and one or more of said service advertisements or said content advertisements in the peer-to-peer network to be discoverable by other peers, wherein the peer advertisement includes an indication of a service or a content provided by the peer. | 52. A method, comprising: generating a peer advertisement for a peer in a peer-to-peer network, wherein the peer advertisement comprises an identifier for the peer and a communication address for the peer; wherein said peer advertisement further comprises an indication of a service or a content provided by the peer corresponding to that peer advertisement; generating a service advertisement for each of one or more of services provided by the peer, wherein each service advertisement comprises an identifier for the corresponding service and an indication of how to access the corresponding service; generating a content advertisement for each of one or more of contents provided by the peer, wherein each content advertisement comprises an identifier for the corresponding content and an indication of how to access the corresponding content; and publishing the peer advertisement and one or more of said service advertisements or said content advertisements in the peer-to-peer network to be discoverable by other peers, wherein the peer advertisement includes an indication of a service or a content provided by the peer. 56. The method as recited in claim 52 , wherein the peer advertisement further comprises an endpoint advertisement, wherein said endpoint advertisement includes said communication address for the peer and a transport protocol for the peer. | 0.881566 |
9,509,722 | 1 | 2 | 1. A computer-implemented method for producing at least one Security Descriptor Definition Language (SDDL) rule from an attribute-based access control (ABAC) policy (P), said method comprising: providing, on a non-transitory computer readable media, a ABAC policy (P) that, when implemented by a processor, is configured to control access to one or more resources in a computer network; feeding the ABAC policy (P) to a transformation engine, the transformation engine including software that, when executed by a processor, creates the at least one SDDL rule; producing a reverse query indicating a given decision (d), which is one of permit access and deny access, and a set (R) of admissible access requests; translating, by the transformation engine based on the reverse query, the ABAC policy (P) and the given decision (d) into a satisfiable logic proposition in Boolean variables (v i , i=1, 2, . . . ); deriving, by the transformation engine, variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 , . . . ], j=1, 2, . . . ) satisfying the logic proposition; creating, by the transformation engine, the at least one SDDL rule based on said variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 , . . . ], j=1, 2, . . . ) satisfying the logic proposition, wherein the at least one SDDL rule, when implemented by a processor, is configured to control access to the one or more resources in a computer network; loading the at least one SDDL rule onto a non-transitory computer readable media of an SDDL system; and controlling access to the one or more resources in the computer network using the at least one SDDL rule. | 1. A computer-implemented method for producing at least one Security Descriptor Definition Language (SDDL) rule from an attribute-based access control (ABAC) policy (P), said method comprising: providing, on a non-transitory computer readable media, a ABAC policy (P) that, when implemented by a processor, is configured to control access to one or more resources in a computer network; feeding the ABAC policy (P) to a transformation engine, the transformation engine including software that, when executed by a processor, creates the at least one SDDL rule; producing a reverse query indicating a given decision (d), which is one of permit access and deny access, and a set (R) of admissible access requests; translating, by the transformation engine based on the reverse query, the ABAC policy (P) and the given decision (d) into a satisfiable logic proposition in Boolean variables (v i , i=1, 2, . . . ); deriving, by the transformation engine, variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 , . . . ], j=1, 2, . . . ) satisfying the logic proposition; creating, by the transformation engine, the at least one SDDL rule based on said variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 , . . . ], j=1, 2, . . . ) satisfying the logic proposition, wherein the at least one SDDL rule, when implemented by a processor, is configured to control access to the one or more resources in a computer network; loading the at least one SDDL rule onto a non-transitory computer readable media of an SDDL system; and controlling access to the one or more resources in the computer network using the at least one SDDL rule. 2. The method of claim 1 further comprising: translating said logic proposition into an Binary Decision Diagram, BDD, or an Reduced-Order Binary Decision Diagram, ROBDD, wherein the deriving is based on said BDD or on said ROBDD. | 0.840307 |
8,060,535 | 5 | 6 | 5. An apparatus comprising: a display device; an input device; and a processor configured to: index a plurality of documents distributed among a plurality of geographical locations according to respective associated geographical locations, cause the display device to display a map of user associated locations, each of the user associated locations representing one of the geographical locations, cause the display device to display contact information for the user associated locations after a selection of a respective one of the user associated locations, the contact information comprising at least one party name and a respective telephone number for each of the at least one party name, the contact information being displayable via at least one clickable indicia displayed after the respective one of the user associated locations is selected, and allow access to the documents at the selected one of the user associated locations, access to the documents permitted via at least one clickable indicia displayed after the respective one of the user associated locations is selected; and the at least one clickable indicia for the contact information being displayed at a same time the at least one clickable indicia for access to the documents is displayed, the at least one clickable indicia for the contact information being different or separate from the at least one clickable indicia for access to the documents. | 5. An apparatus comprising: a display device; an input device; and a processor configured to: index a plurality of documents distributed among a plurality of geographical locations according to respective associated geographical locations, cause the display device to display a map of user associated locations, each of the user associated locations representing one of the geographical locations, cause the display device to display contact information for the user associated locations after a selection of a respective one of the user associated locations, the contact information comprising at least one party name and a respective telephone number for each of the at least one party name, the contact information being displayable via at least one clickable indicia displayed after the respective one of the user associated locations is selected, and allow access to the documents at the selected one of the user associated locations, access to the documents permitted via at least one clickable indicia displayed after the respective one of the user associated locations is selected; and the at least one clickable indicia for the contact information being displayed at a same time the at least one clickable indicia for access to the documents is displayed, the at least one clickable indicia for the contact information being different or separate from the at least one clickable indicia for access to the documents. 6. An apparatus in accordance with claim 5 , wherein the geographical locations are locations where the plurality of documents are stored. | 0.875899 |
8,346,791 | 25 | 27 | 25. A computer-implemented method, comprising: receiving a query from a user device as input for a search operation that uses the received query to identify search results responsive to the received query; determining a transformation cost score for each of a plurality of candidate augmentation queries for the received query, the transformation cost score being based on a transformation cost value for each of one or more terms of the received query, the transformation cost value for a term of the received query being proportional to a term weight that measures an importance of the term in the received query; comparing each term of the received query to a set of non-transformable terms, each non-transformable term of the set of non-transformable terms being a term for which a matching term in the received query should not be transformed to another term; identifying a proper subset of candidate augmentation queries from among the candidate augmentation queries, each candidate augmentation query identified for the proper subset being identified in response to a determination that the candidate augmentation query includes each term of the received query that matches a non-transformable term; ranking the proper subset of candidate augmentation queries according to the transformation cost score of each candidate augmentation query of the proper subset; selecting one or more candidate augmentation queries from among the proper subset of candidate augmentation queries based on the ranking of the proper subset of the candidate augmentation queries; and performing an augmented search operation that uses the one or more candidate augmentation queries as input and that augments the search operation. | 25. A computer-implemented method, comprising: receiving a query from a user device as input for a search operation that uses the received query to identify search results responsive to the received query; determining a transformation cost score for each of a plurality of candidate augmentation queries for the received query, the transformation cost score being based on a transformation cost value for each of one or more terms of the received query, the transformation cost value for a term of the received query being proportional to a term weight that measures an importance of the term in the received query; comparing each term of the received query to a set of non-transformable terms, each non-transformable term of the set of non-transformable terms being a term for which a matching term in the received query should not be transformed to another term; identifying a proper subset of candidate augmentation queries from among the candidate augmentation queries, each candidate augmentation query identified for the proper subset being identified in response to a determination that the candidate augmentation query includes each term of the received query that matches a non-transformable term; ranking the proper subset of candidate augmentation queries according to the transformation cost score of each candidate augmentation query of the proper subset; selecting one or more candidate augmentation queries from among the proper subset of candidate augmentation queries based on the ranking of the proper subset of the candidate augmentation queries; and performing an augmented search operation that uses the one or more candidate augmentation queries as input and that augments the search operation. 27. The method of claim 25 , wherein performing an augmented search operation comprises providing to the user device the one or more candidate augmentation queries as suggested queries in response to the received query. | 0.903524 |
9,858,051 | 44 | 45 | 44. The security appliance of claim 42 wherein the processor is further configured to: determine whether there are unmarked DFA states within the number of DFA states; select one of the unmarked DFA states to produce an unmarked DFA state; mark the unmarked DFA state to produce a DFA marked state; and determine the transitions of the one or more NFA states of the NFA graph mapped to the marked DFA state to other NFA states for the character of the alphabet recognized by the NFA graph. | 44. The security appliance of claim 42 wherein the processor is further configured to: determine whether there are unmarked DFA states within the number of DFA states; select one of the unmarked DFA states to produce an unmarked DFA state; mark the unmarked DFA state to produce a DFA marked state; and determine the transitions of the one or more NFA states of the NFA graph mapped to the marked DFA state to other NFA states for the character of the alphabet recognized by the NFA graph. 45. The security appliance of claim 44 wherein the processor is configured to determine the transitions by determining the transition DFA state from the marked DFA state for the character of the alphabet recognized by the NFA graph. | 0.923684 |
4,205,922 | 6 | 7 | 6. A system according to claim 5 wherein said means for performing a column advance operation includes means for performing a column advance operation when no printout is to occur for said next one of said portions. | 6. A system according to claim 5 wherein said means for performing a column advance operation includes means for performing a column advance operation when no printout is to occur for said next one of said portions. 7. A system according to claim 6 wherein said means for scanning includes means for scanning said font identification and text codes to detect any font identification codes from the point no printout is to occur to the beginning of printout of a subsequent portion. | 0.914017 |
8,306,840 | 11 | 20 | 11. A computing system configured to act as an intermediary to facilitate performance by task performers of tasks submitted by task requesters, comprising: one or more processors; and a task fulfillment facilitator system configured to, when executed by at least one of the one or more processors, facilitate performance of multiple tasks by, for each of the tasks: receiving information from an executing program of a task requester about the task available to be performed, the information received via a defined programmatic application program interface and indicating one or more criteria for satisfactory performance of the task; providing information about the task to one or more human task performers who are qualified to satisfactorily perform the task based on the indicated criteria; and after receiving results based on performance of the available task by one or more of the human task performers to whom the information about the task was provided, supplying the received results via the defined programmatic interface to a program of the task requester. | 11. A computing system configured to act as an intermediary to facilitate performance by task performers of tasks submitted by task requesters, comprising: one or more processors; and a task fulfillment facilitator system configured to, when executed by at least one of the one or more processors, facilitate performance of multiple tasks by, for each of the tasks: receiving information from an executing program of a task requester about the task available to be performed, the information received via a defined programmatic application program interface and indicating one or more criteria for satisfactory performance of the task; providing information about the task to one or more human task performers who are qualified to satisfactorily perform the task based on the indicated criteria; and after receiving results based on performance of the available task by one or more of the human task performers to whom the information about the task was provided, supplying the received results via the defined programmatic interface to a program of the task requester. 20. The computing system of claim 11 wherein the task fulfillment facilitator system includes software instructions for execution by the at least one processors. | 0.909449 |
9,336,310 | 1 | 7 | 1. A computer-implemented method for identifying on-line comments as being legitimate or illegitimate, the method comprising: receiving from a user of a computing service a comment directed to a first piece of on-line content; identifying results of reviews of one or more comments by the user directed to other pieces of on-line content; identifying a measure of trust associated with the user that is determined based at least on the results of the reviews of the one or more comments by the user directed to the other pieces of on-line content; determining whether to provide for review of the first piece of on-line content by using a random selection that randomly selects particular pieces of on-line content, from among a plurality of pieces of on-line content, to provide for review, wherein the determining comprises: selecting a number at random; adjusting the selected number up or down using the measure of trust associated with the user, and determining, based on the adjusted number, whether to provide the first piece of on-line content for review to determine whether the on-line content is legitimate or not, wherein a likelihood that the first piece of on-line content is provided for review is influenced based at least on the measure of trust associated with the user; taking action on changing a status of the first piece of on-line content based on the determination of whether to provide for review of the first piece of on-line content; iteratively providing, in a plurality of rounds that each correspond to a submission of a comment from the user, for review of a series of comments by the user and further adjusting the adjusted number up or down based on whether the reviews indicate that the comments are accurate or inaccurate; and determining, for each round of review, a bias level for a decision to trust the comment and a bias level for a decision to review the comment, and determining whether to make active the decision to trust the comment or the decision to review the comment, where making active defines which of the decisions will be used to control review of a comment. | 1. A computer-implemented method for identifying on-line comments as being legitimate or illegitimate, the method comprising: receiving from a user of a computing service a comment directed to a first piece of on-line content; identifying results of reviews of one or more comments by the user directed to other pieces of on-line content; identifying a measure of trust associated with the user that is determined based at least on the results of the reviews of the one or more comments by the user directed to the other pieces of on-line content; determining whether to provide for review of the first piece of on-line content by using a random selection that randomly selects particular pieces of on-line content, from among a plurality of pieces of on-line content, to provide for review, wherein the determining comprises: selecting a number at random; adjusting the selected number up or down using the measure of trust associated with the user, and determining, based on the adjusted number, whether to provide the first piece of on-line content for review to determine whether the on-line content is legitimate or not, wherein a likelihood that the first piece of on-line content is provided for review is influenced based at least on the measure of trust associated with the user; taking action on changing a status of the first piece of on-line content based on the determination of whether to provide for review of the first piece of on-line content; iteratively providing, in a plurality of rounds that each correspond to a submission of a comment from the user, for review of a series of comments by the user and further adjusting the adjusted number up or down based on whether the reviews indicate that the comments are accurate or inaccurate; and determining, for each round of review, a bias level for a decision to trust the comment and a bias level for a decision to review the comment, and determining whether to make active the decision to trust the comment or the decision to review the comment, where making active defines which of the decisions will be used to control review of a comment. 7. The method of claim 1 , wherein determining whether to provide for review of the first piece of on-line content comprises analyzing the first piece of on-line content and generating a reviewability rating for the first piece of on-line content that indicates a likelihood that the first piece of on-line content is legitimate or illegitimate. | 0.747067 |
8,645,390 | 25 | 26 | 25. The system of claim 14 , wherein identifying the predicted performance function includes performing machine learning on a correlation between the scoring primitives and other user activities on the results of the previously executed search queries in addition to actual user selections of results of the previously executed search queries. | 25. The system of claim 14 , wherein identifying the predicted performance function includes performing machine learning on a correlation between the scoring primitives and other user activities on the results of the previously executed search queries in addition to actual user selections of results of the previously executed search queries. 26. The system of claim 25 , wherein the other user activities on the results of the previously executed search queries are interactions selected from the set consisting of: a dwell time corresponding to an amount of time between the user opening a respective document corresponding to a respective search result of a respective previously executed search query and the user exiting from the respective document; hovering over a respective search result of a respective previously executed search query; and bookmarking a resource location corresponding to a respective search result of a respective previously executed search query. | 0.808414 |
9,386,950 | 10 | 11 | 10. A computer-readable medium comprising a plurality of software instructions that, when executed by at least one network-connected computer-based system, perform a method of determining a user's risk of dyslexia, the instructions comprising: instructions for identifying, based on an input received from an input device of the computer-based system, an age category associated with the user; instructions for generating a plurality of query pages, each query page being generated from data received by the computer-based system from a remote server over a data communications channel and stored in a memory device of the computer-based system, and each query page comprising a plurality of non-verbal answers that are determined based on the identified age category and are selectable by the user; instructions for generating a plurality of auditory queries to be rendered via a speaker of the computer-based system, each auditory query being producible as audible sounds and generated from a sound data file corresponding to a non-verbal query, each auditory query being associated with one or more of the plurality of query pages; instructions for identifying, via the input device of the computer-based system, a plurality of electronic input selections from the user, each electronic input selection identifying a non-verbal answer from a query page; instructions for identifying, via a timer of the computer-based system, timing data associated with the plurality of electronic input selections, the timing data indicating time intervals between the rendering of each of the plurality of auditory queries and the detection of electronic input selections from the user corresponding to each of the auditory queries; instructions for assigning weighted scores to each of the electronic input selections from the user, the weighted scores being determined based on the identified age category and the time intervals, wherein time intervals above a first threshold receive a first weighting factor and time intervals below the first threshold receive a second weighting factor; and instructions for rendering, on the display screen of the computer-based system, an assessment in a graphical user interface, the assessment identifying a risk of dyslexia for the user based on whether the weighted scores exceed a predefined threshold associated with the plurality of query pages. | 10. A computer-readable medium comprising a plurality of software instructions that, when executed by at least one network-connected computer-based system, perform a method of determining a user's risk of dyslexia, the instructions comprising: instructions for identifying, based on an input received from an input device of the computer-based system, an age category associated with the user; instructions for generating a plurality of query pages, each query page being generated from data received by the computer-based system from a remote server over a data communications channel and stored in a memory device of the computer-based system, and each query page comprising a plurality of non-verbal answers that are determined based on the identified age category and are selectable by the user; instructions for generating a plurality of auditory queries to be rendered via a speaker of the computer-based system, each auditory query being producible as audible sounds and generated from a sound data file corresponding to a non-verbal query, each auditory query being associated with one or more of the plurality of query pages; instructions for identifying, via the input device of the computer-based system, a plurality of electronic input selections from the user, each electronic input selection identifying a non-verbal answer from a query page; instructions for identifying, via a timer of the computer-based system, timing data associated with the plurality of electronic input selections, the timing data indicating time intervals between the rendering of each of the plurality of auditory queries and the detection of electronic input selections from the user corresponding to each of the auditory queries; instructions for assigning weighted scores to each of the electronic input selections from the user, the weighted scores being determined based on the identified age category and the time intervals, wherein time intervals above a first threshold receive a first weighting factor and time intervals below the first threshold receive a second weighting factor; and instructions for rendering, on the display screen of the computer-based system, an assessment in a graphical user interface, the assessment identifying a risk of dyslexia for the user based on whether the weighted scores exceed a predefined threshold associated with the plurality of query pages. 11. The computer-readable medium of claim 10 , further comprising: instructions for determining a difficulty level based on the identified age category associated with the user; and instructions for selecting the plurality of query pages, the first and second weighting factors, and the plurality of auditory queries based on the determined difficulty level. | 0.501393 |
8,131,731 | 8 | 13 | 8. One or more computer-readable storage media comprising computer-readable instructions which, when executed, implement a method comprising: maintaining metadata associated with browser-accessible items, wherein the metadata includes one or more of: a title associated with an item, a URL associated with an item, a last date an item was visited by a user, frequency with which an item has been visited by a user, or whether or not an item was selected from a list; assigning numerical weights to the metadata to represent how important a particular piece of metadata is in respect to total relevance of maintained metadata; processing weighted metadata using a relevancy algorithm; receiving a user action associated with accessing one or more items; and responsive to receiving the user action, presenting suggestions based upon the user action and an output of the relevancy algorithm, wherein the suggestions are grouped in accordance with different types, wherein at least one of the suggestions utilizes different parameters for the relevancy algorithm than another of the one or more suggestions based, at least in part, on the type of suggestion. | 8. One or more computer-readable storage media comprising computer-readable instructions which, when executed, implement a method comprising: maintaining metadata associated with browser-accessible items, wherein the metadata includes one or more of: a title associated with an item, a URL associated with an item, a last date an item was visited by a user, frequency with which an item has been visited by a user, or whether or not an item was selected from a list; assigning numerical weights to the metadata to represent how important a particular piece of metadata is in respect to total relevance of maintained metadata; processing weighted metadata using a relevancy algorithm; receiving a user action associated with accessing one or more items; and responsive to receiving the user action, presenting suggestions based upon the user action and an output of the relevancy algorithm, wherein the suggestions are grouped in accordance with different types, wherein at least one of the suggestions utilizes different parameters for the relevancy algorithm than another of the one or more suggestions based, at least in part, on the type of suggestion. 13. The one or more computer-readable media of claim 8 , wherein types comprise an URL type, a history type, a favorites type, and an RSS type. | 0.846567 |
7,853,936 | 18 | 21 | 18. A computer software product for parsing a document that includes data structures conforming to a document specification, the product comprising a computer-readable medium in which program instructions are stored, which instructions, when read by a computer, cause the computer to accept a set of rules defining valid data structures in terms of a regular expression comprising one or more nested references to respective referenced regular expressions, to replace the nested references in the regular expression with the respective referenced regular expressions, so as to provide a modified regular expression that does not contain a reference to another regular expression and so as to provide a modified set of rules comprising the modified regular expression, and to parse the document using the modified regular expression that does not contain a reference to another regular expression and accordingly to the modified set of rules. | 18. A computer software product for parsing a document that includes data structures conforming to a document specification, the product comprising a computer-readable medium in which program instructions are stored, which instructions, when read by a computer, cause the computer to accept a set of rules defining valid data structures in terms of a regular expression comprising one or more nested references to respective referenced regular expressions, to replace the nested references in the regular expression with the respective referenced regular expressions, so as to provide a modified regular expression that does not contain a reference to another regular expression and so as to provide a modified set of rules comprising the modified regular expression, and to parse the document using the modified regular expression that does not contain a reference to another regular expression and accordingly to the modified set of rules. 21. The product according to claim 18 , wherein the instructions that cause the computer to parse the document are written in a script language. | 0.538462 |
9,466,021 | 4 | 5 | 4. The method of claim 1 wherein the activity logs comprise sequences of records, each record identifying a given one of the local resources, a corresponding resource access timestamp and a corresponding type of resource access. | 4. The method of claim 1 wherein the activity logs comprise sequences of records, each record identifying a given one of the local resources, a corresponding resource access timestamp and a corresponding type of resource access. 5. The method of claim 4 wherein the type of resource access comprises one of opening the given local resource and closing the given local resource. | 0.967714 |
9,564,057 | 4 | 5 | 4. The method of claim 1 , further comprising collecting information from the subject person and providing a real-time communication indicating whether the one or more science inquiry skills of the subject person as assessed within the at least one of the simulation and the microworld match the collected information of the subject person, when the subject person performs at least one of: generating hypotheses; collecting data to test the hypotheses; interpreting the collected data; warranting claims with data; and communicating respective findings. | 4. The method of claim 1 , further comprising collecting information from the subject person and providing a real-time communication indicating whether the one or more science inquiry skills of the subject person as assessed within the at least one of the simulation and the microworld match the collected information of the subject person, when the subject person performs at least one of: generating hypotheses; collecting data to test the hypotheses; interpreting the collected data; warranting claims with data; and communicating respective findings. 5. The method of claim 4 , further comprising providing the real-time communication to another person, the real-time communication including at least one of: an alert associated with the one or more science inquiry skills of the subject person; and an assessment of the one or more science inquiry skills of the subject person. | 0.836826 |
7,739,294 | 1 | 6 | 1. A method for creating an ordered reading list of pre-determined length of relevant topics from a hyperlinked database source of information website based on a user's input, the method comprising: determining at least one topic of interest; choosing a topic ordering algorithm from a plurality of topic ordering algorithms including a top-down schematic algorithm, a bottom-up schematic algorithm, and a horizontal schematic algorithm, said top-down schematic algorithm comprises a page rank calculation performed by iterating until a convergence, said bottom-up schematic algorithm comprises a ratio of a combined weight from a plurality of source topics to a plurality of sink topics of an article, said bottom-up schematic algorithm linearly parameterizes an ordering from said source topics to said sink topics of an article k, wherein a ratio is Π i v source(i) → k /Π j v source(j) → k of a rank of said source topics to a rank of said sink topics, wherein a point where relevance of said topics is cutoff is calculated by multiplying Π i v source(i) → k by Π j v sink(j) → k , wherein a comparison is found by graphing a distance from said seed topics, ordered by a difference of distances, calculated by [Σ ij |(d source(i) → k )−(d sink(j) → k )|], and is cutoff by a sum of distances calculated by Σ i d source(i) → k +Σ j d sink(j) → k , and said horizontal schematic algorithm comprises an order parameterization by absolute differences of a log of a plurality of ranks and an absolute difference of a plurality of distances with analogous cutoff methods, wherein said sink topic is where said reading list terminates and said source topic is where said reading list begins; calculating one of a plurality of topics ordering algorithms based on said topic of interest and a user; updating said hyperlinked database source of information; forming a reading list and ranking said reading list based on said topic ordering algorithm; and outputting said ranking and said reading list to an interface depending on an outcome of said topic ordering algorithm. | 1. A method for creating an ordered reading list of pre-determined length of relevant topics from a hyperlinked database source of information website based on a user's input, the method comprising: determining at least one topic of interest; choosing a topic ordering algorithm from a plurality of topic ordering algorithms including a top-down schematic algorithm, a bottom-up schematic algorithm, and a horizontal schematic algorithm, said top-down schematic algorithm comprises a page rank calculation performed by iterating until a convergence, said bottom-up schematic algorithm comprises a ratio of a combined weight from a plurality of source topics to a plurality of sink topics of an article, said bottom-up schematic algorithm linearly parameterizes an ordering from said source topics to said sink topics of an article k, wherein a ratio is Π i v source(i) → k /Π j v source(j) → k of a rank of said source topics to a rank of said sink topics, wherein a point where relevance of said topics is cutoff is calculated by multiplying Π i v source(i) → k by Π j v sink(j) → k , wherein a comparison is found by graphing a distance from said seed topics, ordered by a difference of distances, calculated by [Σ ij |(d source(i) → k )−(d sink(j) → k )|], and is cutoff by a sum of distances calculated by Σ i d source(i) → k +Σ j d sink(j) → k , and said horizontal schematic algorithm comprises an order parameterization by absolute differences of a log of a plurality of ranks and an absolute difference of a plurality of distances with analogous cutoff methods, wherein said sink topic is where said reading list terminates and said source topic is where said reading list begins; calculating one of a plurality of topics ordering algorithms based on said topic of interest and a user; updating said hyperlinked database source of information; forming a reading list and ranking said reading list based on said topic ordering algorithm; and outputting said ranking and said reading list to an interface depending on an outcome of said topic ordering algorithm. 6. The method of claim 1 further comprising refining a search using a web-based link corresponding to a topic in a previously generated said reading list. | 0.931919 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.