patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
8,724,441 | 3 | 4 |
3. The encoding device according to claim 2 , wherein: in any one set of code words in which the number of symbols “1” is an even number in the first encoding table and a set of code words in which the number of symbols “1” is an odd number in the second encoding table, the code words are aligned in ascending order of code word Digital Sum Value when the code words are NRZ-converted so as to correspond to the data words, and, in the other of the sets, the code words are aligned in descending order of code word Digital Sum Value when the code words are NRZ-converted so as to correspond to the data words, and in any one set of code words in which the number of symbols “1” is an odd number in the first encoding table and a set of code words in which the number of symbols “1” is an even number in the second encoding table, the code words are aligned in ascending order of code word Digital Sum Value when the code words are NRZ-converted so as to correspond to the data words, and, in the other of the sets, the code words are aligned in descending order of code word Digital Sum Value when the code words are NRZ-converted so as to correspond to the data words.
|
3. The encoding device according to claim 2 , wherein: in any one set of code words in which the number of symbols “1” is an even number in the first encoding table and a set of code words in which the number of symbols “1” is an odd number in the second encoding table, the code words are aligned in ascending order of code word Digital Sum Value when the code words are NRZ-converted so as to correspond to the data words, and, in the other of the sets, the code words are aligned in descending order of code word Digital Sum Value when the code words are NRZ-converted so as to correspond to the data words, and in any one set of code words in which the number of symbols “1” is an odd number in the first encoding table and a set of code words in which the number of symbols “1” is an even number in the second encoding table, the code words are aligned in ascending order of code word Digital Sum Value when the code words are NRZ-converted so as to correspond to the data words, and, in the other of the sets, the code words are aligned in descending order of code word Digital Sum Value when the code words are NRZ-converted so as to correspond to the data words. 4. The encoding device according to claim 3 , wherein the encoding unit is configured to select the code words such that a run length limitation of a shortest 0 consecutive length d (d≠0) and a longest 0 consecutive length k (k>d) of a code string obtained from an encoding result is satisfied.
| 0.5 |
8,533,579 | 1 | 8 |
1. A computer-implemented method comprising: identifying, by a computer system, a keyword included in a data loss prevention (DLP) policy, the keyword comprising a plurality of characters; generating, by the computer system and in response to the identifying, a plurality of permutations of the characters of the keyword, wherein up to a specified maximum number of permutable characters in the keyword are permuted to generate the plurality of permutations; adding, by the computer system, the plurality of permutations to the DLP policy; and causing information content to be searched for the keyword and the plurality of permutations to detect a violation of the DLP policy in the information content.
|
1. A computer-implemented method comprising: identifying, by a computer system, a keyword included in a data loss prevention (DLP) policy, the keyword comprising a plurality of characters; generating, by the computer system and in response to the identifying, a plurality of permutations of the characters of the keyword, wherein up to a specified maximum number of permutable characters in the keyword are permuted to generate the plurality of permutations; adding, by the computer system, the plurality of permutations to the DLP policy; and causing information content to be searched for the keyword and the plurality of permutations to detect a violation of the DLP policy in the information content. 8. The method of claim 1 further comprising: providing a user interface allowing a user to specify one or more parameters for generating the plurality of permutations.
| 0.849005 |
8,311,946 | 22 | 35 |
22. A computer-implemented method for purchasing information from a server, comprising: delivering, by a document server, to a user of said client logic device user-requested pages of a specific document in a first user-viewable version; protecting, by a security server, said first user-viewable version to permit said user viewing the actual contents of said pages of said specific document and selecting by said user, but not printing, copying, or saving by the user; calculating, by a transaction server, a charge to permit a requested standard operation to be performed on a user-selected portion of said specific document; and delivering, by said document server, to said user a second version of the actual contents of said specific document, said second version consisting of the user-selected portion of said specific document, said delivering step being performed in coordination with said security server upon authorization of payment of the calculated charge, said second version comprising a version on which the standard operation is performed.
|
22. A computer-implemented method for purchasing information from a server, comprising: delivering, by a document server, to a user of said client logic device user-requested pages of a specific document in a first user-viewable version; protecting, by a security server, said first user-viewable version to permit said user viewing the actual contents of said pages of said specific document and selecting by said user, but not printing, copying, or saving by the user; calculating, by a transaction server, a charge to permit a requested standard operation to be performed on a user-selected portion of said specific document; and delivering, by said document server, to said user a second version of the actual contents of said specific document, said second version consisting of the user-selected portion of said specific document, said delivering step being performed in coordination with said security server upon authorization of payment of the calculated charge, said second version comprising a version on which the standard operation is performed. 35. The method claim 22 , wherein delivering user-requested pages of said specific document further comprises: delivering user-requested page images in the form of low resolution images suitable for viewing and selecting.
| 0.648089 |
9,749,270 | 15 | 18 |
15. A computer system for communicating via an avatar, the computer system comprising: one or more computer processors; a non-transitory computer-readable medium storing program instructions for execution by at least one of the one or more processors, the program instructions comprising: program instructions to send an email that includes an embedded avatar from a sender at a first computing device to a recipient at a second computing device; responsive to the recipient at the second computing device selecting the embedded avatar, program instructions to provide an interface through which said recipient interacts to submit a query via the avatar; program instructions to receive the query via a communication protocol; program instructions to parse and analyze the received query; program instructions to retrieve an answer corresponding to the parsed and analyzed query from a mailbox of the sender, wherein the mailbox of the sender includes emails associated with the parsed and analyzed query; program instructions to send the answer to the second computing device; and program instructions to initiate display of the answer via the avatar on the second computing device.
|
15. A computer system for communicating via an avatar, the computer system comprising: one or more computer processors; a non-transitory computer-readable medium storing program instructions for execution by at least one of the one or more processors, the program instructions comprising: program instructions to send an email that includes an embedded avatar from a sender at a first computing device to a recipient at a second computing device; responsive to the recipient at the second computing device selecting the embedded avatar, program instructions to provide an interface through which said recipient interacts to submit a query via the avatar; program instructions to receive the query via a communication protocol; program instructions to parse and analyze the received query; program instructions to retrieve an answer corresponding to the parsed and analyzed query from a mailbox of the sender, wherein the mailbox of the sender includes emails associated with the parsed and analyzed query; program instructions to send the answer to the second computing device; and program instructions to initiate display of the answer via the avatar on the second computing device. 18. The computer system of claim 15 , wherein the non-transitory computer-readable medium further stores program instructions to: send a notification indicating the query to the sender based on a rule.
| 0.742308 |
9,684,735 | 15 | 19 |
15. The system of claim 11 , wherein the plurality of predetermined correspondences are established by the one or more processors further configured to: obtain access information for a plurality of webpages corresponding to a plurality of products under the product category, wherein the access information includes one or more of: total page views, transaction record, and mean browsing time for each of the plurality of products; determine an access rank for each of the plurality of webpages based at least in part on the access information for each of the plurality of webpages; extract a primary font information from the webpage with a highest access rank; and establish a predetermined correspondence between the product category and the extracted primary font information.
|
15. The system of claim 11 , wherein the plurality of predetermined correspondences are established by the one or more processors further configured to: obtain access information for a plurality of webpages corresponding to a plurality of products under the product category, wherein the access information includes one or more of: total page views, transaction record, and mean browsing time for each of the plurality of products; determine an access rank for each of the plurality of webpages based at least in part on the access information for each of the plurality of webpages; extract a primary font information from the webpage with a highest access rank; and establish a predetermined correspondence between the product category and the extracted primary font information. 19. The system of claim 15 , wherein the one or more processors are further configured to generate, in the event that the font recommendation should be made, a replacement webpage based on the webpage that was originally configured by the user and the recommended font.
| 0.860042 |
8,370,361 | 8 | 11 |
8. The method of claim 1 , wherein the first and second unsupervised clustering includes agglomerative partitional clustering of said organization entities, said organization entities comprising constituent string tokens; wherein the threshold for the similarity of pairs of organization entities is a fixed value determined using edit distance; and wherein the threshold for similarity of constituent string tokens is a variable value determined using a local sequence alignment algorithm.
|
8. The method of claim 1 , wherein the first and second unsupervised clustering includes agglomerative partitional clustering of said organization entities, said organization entities comprising constituent string tokens; wherein the threshold for the similarity of pairs of organization entities is a fixed value determined using edit distance; and wherein the threshold for similarity of constituent string tokens is a variable value determined using a local sequence alignment algorithm. 11. The method of claim 8 , wherein the centroid of each cluster is assigned as the cluster member with the least sum of edit distances from the other organization entities.
| 0.54712 |
7,885,908 | 1 | 17 |
1. A risk assessment method comprising: receiving, by an inference engine within a computing system, first sensor cohort data associated with a first cohort, said first cohort located within an aircraft; receiving, by said inference engine, first group technology inferences associated with said first cohort; generating, by said inference engine, first risk cohort inferences, said generating said first risk cohort inferences based on said first group technology inferences and said first sensor cohort data; receiving, by said inference engine, first inference data generated by said inference engine, said first inference data comprising a first plurality of inferences associated with said first cohort and a security perimeter area surrounding an airport; receiving, by said inference engine, second inference data generated by said inference engine, said second inference data comprising a second of plurality of inferences associated with said first cohort and a pre/post security area within said airport; receiving, by said inference engine, third inference data generated by said inference engine, said third inference data comprising a third of plurality of inferences associated with said first cohort and a gate area within said airport; receiving, by said inference engine, fourth inference data generated by said inference engine, said fourth inference data comprising a fourth of plurality of inferences associated with said first cohort and said aircraft; generating, by said inference engine, fifth inference data, said fifth inference data comprising a fifth plurality of inferences associated with said first cohort and said aircraft, wherein said generating said fifth inference data is based on said first risk cohort inferences, said first inference data, said second inference data, said third inference data, and said fourth inference data; generating, by said inference engine based on said fifth inference data, a first associated risk level score for said first cohort; and storing, by said computing system, said fifth inference data and said first associated risk level score.
|
1. A risk assessment method comprising: receiving, by an inference engine within a computing system, first sensor cohort data associated with a first cohort, said first cohort located within an aircraft; receiving, by said inference engine, first group technology inferences associated with said first cohort; generating, by said inference engine, first risk cohort inferences, said generating said first risk cohort inferences based on said first group technology inferences and said first sensor cohort data; receiving, by said inference engine, first inference data generated by said inference engine, said first inference data comprising a first plurality of inferences associated with said first cohort and a security perimeter area surrounding an airport; receiving, by said inference engine, second inference data generated by said inference engine, said second inference data comprising a second of plurality of inferences associated with said first cohort and a pre/post security area within said airport; receiving, by said inference engine, third inference data generated by said inference engine, said third inference data comprising a third of plurality of inferences associated with said first cohort and a gate area within said airport; receiving, by said inference engine, fourth inference data generated by said inference engine, said fourth inference data comprising a fourth of plurality of inferences associated with said first cohort and said aircraft; generating, by said inference engine, fifth inference data, said fifth inference data comprising a fifth plurality of inferences associated with said first cohort and said aircraft, wherein said generating said fifth inference data is based on said first risk cohort inferences, said first inference data, said second inference data, said third inference data, and said fourth inference data; generating, by said inference engine based on said fifth inference data, a first associated risk level score for said first cohort; and storing, by said computing system, said fifth inference data and said first associated risk level score. 17. The method of claim 1 , further comprising: receiving, by said inference engine, additional inference data, said additional inference data comprising an additional plurality of inferences associated with said first cohort; generating, by said inference engine based on said additional inference data and said fifth inference data, a second associated risk level score for said first cohort; and storing, by said computing system, said second associated risk level score.
| 0.871892 |
9,253,226 | 12 | 13 |
12. The system of claim 11 , wherein the determination module is further configure to, responsive to determining that the member has not completed the profile edit task classified as the difficult task, identify another profile edit task classified as an easy task from the one or more candidate profile edit tasks, and wherein the prompt module is further configured to prompt the member to perform the another profile edit task.
|
12. The system of claim 11 , wherein the determination module is further configure to, responsive to determining that the member has not completed the profile edit task classified as the difficult task, identify another profile edit task classified as an easy task from the one or more candidate profile edit tasks, and wherein the prompt module is further configured to prompt the member to perform the another profile edit task. 13. The system of claim 12 , wherein it is determined that the member has not completed the profile edit task classified as the difficult task, based on determining that a predetermined number of prompts have been displayed to the member, the prompts inviting the member to perform the profile edit task classified as the difficult task.
| 0.5 |
8,155,963 | 2 | 3 |
2. The method according to claim 1 , wherein the list of phonemes includes at least one phoneme sequence comprising a plurality of phonemes in a prescribed order, and wherein automatically selecting a first plurality of words comprises selecting at least one word that, when uttered by the speaker, produces the at least one phoneme sequence.
|
2. The method according to claim 1 , wherein the list of phonemes includes at least one phoneme sequence comprising a plurality of phonemes in a prescribed order, and wherein automatically selecting a first plurality of words comprises selecting at least one word that, when uttered by the speaker, produces the at least one phoneme sequence. 3. The method according to claim 2 , wherein the at least one phoneme sequence comprises a diphone, a triphone, a quadphone, a syllable, and/or a bisyllable.
| 0.5 |
8,321,277 | 8 | 14 |
8. A non-transitory computer readable medium encoded with a plurality of instructions that, when executed by a computer, perform a method comprising: receiving, from a speech recognition component, one or more words corresponding to a voice input; searching a product information management (PIM) component to identify at least one matching item and/or category in a product catalog based, at least in part, on the one or more received words and at least one item attribute associated with at least one item and/or at least one category attribute associated with at least one category in the PIM component; and outputting coded results to a voice synthesis component in response to the search, wherein the coded results indicate whether the search resulted in the identification of at least one matching item and/or category in the PIM component.
|
8. A non-transitory computer readable medium encoded with a plurality of instructions that, when executed by a computer, perform a method comprising: receiving, from a speech recognition component, one or more words corresponding to a voice input; searching a product information management (PIM) component to identify at least one matching item and/or category in a product catalog based, at least in part, on the one or more received words and at least one item attribute associated with at least one item and/or at least one category attribute associated with at least one category in the PIM component; and outputting coded results to a voice synthesis component in response to the search, wherein the coded results indicate whether the search resulted in the identification of at least one matching item and/or category in the PIM component. 14. The computer-readable medium of claim 8 , wherein the coded results indicate multiple matching items were identified, wherein the method further comprises: determining if there are one or more matching categories corresponding to the matching items; instructing the voice synthesis component to generate a request for additional voice input from the user in response to determining there are no matching categories corresponding to the matching items; instructing the voice synthesis component to generate a request for subcategory and/or item attributes in response to determining that there is a single matching category corresponding to the matching items; and instructing the voice synthesis component to generate a request for confirmation of a suitable category in response to determining that there are multiple categories corresponding to the matching items.
| 0.5 |
8,862,532 | 5 | 6 |
5. A system for displaying information associated with an operation state of a building, comprising: a rule engine having a number of rule conditions for a building, wherein the rule conditions are based on an ontology definition associated with the building and the rule engine is configured to: determine that the one of the rule conditions has been triggered; and provide a notification to the computing device that the one of the rule conditions has been triggered; and a computing device configured to: generate, upon a triggering of one of the rule conditions and upon receiving the notification from the rule engine, analytic information associated with the triggered rule condition, wherein the analytic information is based on the ontology definition; and display, to a user of the computing device, the analytic information associated with the triggered rule condition as part of a display of an operational environment of the building provided to the user.
|
5. A system for displaying information associated with an operation state of a building, comprising: a rule engine having a number of rule conditions for a building, wherein the rule conditions are based on an ontology definition associated with the building and the rule engine is configured to: determine that the one of the rule conditions has been triggered; and provide a notification to the computing device that the one of the rule conditions has been triggered; and a computing device configured to: generate, upon a triggering of one of the rule conditions and upon receiving the notification from the rule engine, analytic information associated with the triggered rule condition, wherein the analytic information is based on the ontology definition; and display, to a user of the computing device, the analytic information associated with the triggered rule condition as part of a display of an operational environment of the building provided to the user. 6. The system of claim 5 , wherein the rule engine is configured to determine that the one of the rule conditions had been triggered by: interpreting raw data associated with the building into the ontology definition associated with the building; and matching the ontology definition against the one of the rule conditions.
| 0.598259 |
7,870,162 | 9 | 12 |
9. A method for generating properly formed expressions for validating selected records of a computer system database, said method comprising: displaying in a metadata user interface a plurality of selected records of a computer system database; displaying an expression-builder user interface coupled to said metadata user interface, said expression-builder user interface configured to construct at least one conditional validation expression, said expression-builder user interface comprising a token-based menu, said token-based menu automatically generated to comprise tokens representing and coupled to fields of said plurality of selected records; obtaining at least one branch value selection for at least one of a plurality of expressions comprising at least one tokenized branch value from said token-based menu; accepting user selections from said token-based menu; computing said plurality of expressions, each expression comprising a properly-formed expression for validating said plurality of selected records comprising said user selections from said token-based menu; grouping said plurality of said expressions into a validation group; performing said plurality of expressions in said validation group as a single operation against said plurality of selected records; displaying results of performing said plurality of expressions of said validation group, wherein displaying said results comprises displaying: a name of said plurality of expressions; a list of tables associated with said plurality of expressions; at least one branch value for branching at least one of said plurality of expressions; a description of said plurality of expressions; an indicator of validity of each of said plurality of selected records, said indicator of validity visually coupled to each of said plurality of selected records and further comprising a plurality of levels of execution for each of said plurality of selected records, said levels of execution selected from the group consisting of: none, warning and error, wherein said indicator of validity comprises an error message indicating any invalid field of said selected records; a callable flag; and a parse result indicating a parsing validity of said plurality of expressions; and applying said plurality of expressions as a search filter against said plurality of selected records.
|
9. A method for generating properly formed expressions for validating selected records of a computer system database, said method comprising: displaying in a metadata user interface a plurality of selected records of a computer system database; displaying an expression-builder user interface coupled to said metadata user interface, said expression-builder user interface configured to construct at least one conditional validation expression, said expression-builder user interface comprising a token-based menu, said token-based menu automatically generated to comprise tokens representing and coupled to fields of said plurality of selected records; obtaining at least one branch value selection for at least one of a plurality of expressions comprising at least one tokenized branch value from said token-based menu; accepting user selections from said token-based menu; computing said plurality of expressions, each expression comprising a properly-formed expression for validating said plurality of selected records comprising said user selections from said token-based menu; grouping said plurality of said expressions into a validation group; performing said plurality of expressions in said validation group as a single operation against said plurality of selected records; displaying results of performing said plurality of expressions of said validation group, wherein displaying said results comprises displaying: a name of said plurality of expressions; a list of tables associated with said plurality of expressions; at least one branch value for branching at least one of said plurality of expressions; a description of said plurality of expressions; an indicator of validity of each of said plurality of selected records, said indicator of validity visually coupled to each of said plurality of selected records and further comprising a plurality of levels of execution for each of said plurality of selected records, said levels of execution selected from the group consisting of: none, warning and error, wherein said indicator of validity comprises an error message indicating any invalid field of said selected records; a callable flag; and a parse result indicating a parsing validity of said plurality of expressions; and applying said plurality of expressions as a search filter against said plurality of selected records. 12. The method of claim 9 , wherein said at least one branch value selection comprises a category value.
| 0.86059 |
8,670,968 | 1 | 3 |
1. A method for training a ranking application to rank a plurality of help postings for display in a forum, comprising: ranking the plurality of help postings to create an initial ranking, wherein the plurality of help postings in the initial ranking are ranked by the ranking application using initial parameter values; displaying the plurality of help postings in the forum according to the initial ranking; storing user interactions with the plurality of help postings to obtain stored interactions; performing simulations using the stored interactions to generate revised parameter values for the ranking application, wherein performing the simulations comprises: calculating a plurality of relevance values from the stored interactions; creating a test posting; assigning, to the test posting, an initial score and a relevance value randomly selected from the plurality of relevance values to generate a test ranking; determining a probability that a user will view the plurality of help postings and the test posting in the test ranking; generating, based on the probability, simulated rankings of the plurality of help postings and the test posting; and analyzing the simulated rankings based on the relevance value to obtain revised parameter values; and ranking, by the ranking application using the revised parameter values, the plurality of help postings to generate a revised ranking; and displaying the plurality of help postings in the forum according to the revised ranking.
|
1. A method for training a ranking application to rank a plurality of help postings for display in a forum, comprising: ranking the plurality of help postings to create an initial ranking, wherein the plurality of help postings in the initial ranking are ranked by the ranking application using initial parameter values; displaying the plurality of help postings in the forum according to the initial ranking; storing user interactions with the plurality of help postings to obtain stored interactions; performing simulations using the stored interactions to generate revised parameter values for the ranking application, wherein performing the simulations comprises: calculating a plurality of relevance values from the stored interactions; creating a test posting; assigning, to the test posting, an initial score and a relevance value randomly selected from the plurality of relevance values to generate a test ranking; determining a probability that a user will view the plurality of help postings and the test posting in the test ranking; generating, based on the probability, simulated rankings of the plurality of help postings and the test posting; and analyzing the simulated rankings based on the relevance value to obtain revised parameter values; and ranking, by the ranking application using the revised parameter values, the plurality of help postings to generate a revised ranking; and displaying the plurality of help postings in the forum according to the revised ranking. 3. The method of claim 1 , wherein the determining the probability is performed according to a cascade click model.
| 0.819749 |
8,356,245 | 10 | 11 |
10. A computer implemented system of automatically mapping a given annotator to an aggregate of given annotators, comprising: a machine-readable storage medium including machine-readable program code which for a provided plurality of N annotators, denoted Annotator n , for n=1 to N; aggregates of the plurality of N annotators, denoted Aggregate i , for i=1-2, . . . 1-N, 2-1 . . . 2-N . . . K-L-M, wherein hyphenated values of the subscript i of Aggregate i represents all of the Annotator n aggregated to form the Aggregate i , and an original document corpus, includes instructions for applying a subject annotator to the original document corpus to generate a corpus of subject annotated documents; instructions for applying each Annotator n , for n=1 to N, and each Aggregate i , for i=1-2 . . . 1-N, 2-1 . . . 2-N . . . K-L-M, to the original document corpus to generate a corpus of pre-annotated documents; instructions for sorting the annotations contained in the pre-annotated documents those annotations meeting a criteria for correlation, in terms of occurrences, with the subject annotations to generate good candidate annotations; instructions for using the good candidate annotations to decompose the corpus of subject annotated documents into aggregates of the good candidate annotations; instructions for after decomposing the subject annotated documents, identifying a suitable expression of the subject annotation on a per document basis, wherein suitable expressions are those expressions that have the highest frequencies of occurrence on the given document corpus; and instructions for mapping an identified suitable expression to an aggregate of said plurality of N annotators.
|
10. A computer implemented system of automatically mapping a given annotator to an aggregate of given annotators, comprising: a machine-readable storage medium including machine-readable program code which for a provided plurality of N annotators, denoted Annotator n , for n=1 to N; aggregates of the plurality of N annotators, denoted Aggregate i , for i=1-2, . . . 1-N, 2-1 . . . 2-N . . . K-L-M, wherein hyphenated values of the subscript i of Aggregate i represents all of the Annotator n aggregated to form the Aggregate i , and an original document corpus, includes instructions for applying a subject annotator to the original document corpus to generate a corpus of subject annotated documents; instructions for applying each Annotator n , for n=1 to N, and each Aggregate i , for i=1-2 . . . 1-N, 2-1 . . . 2-N . . . K-L-M, to the original document corpus to generate a corpus of pre-annotated documents; instructions for sorting the annotations contained in the pre-annotated documents those annotations meeting a criteria for correlation, in terms of occurrences, with the subject annotations to generate good candidate annotations; instructions for using the good candidate annotations to decompose the corpus of subject annotated documents into aggregates of the good candidate annotations; instructions for after decomposing the subject annotated documents, identifying a suitable expression of the subject annotation on a per document basis, wherein suitable expressions are those expressions that have the highest frequencies of occurrence on the given document corpus; and instructions for mapping an identified suitable expression to an aggregate of said plurality of N annotators. 11. The system of claim 10 , wherein said machine-readable program code further includes: instructions for representing said at least one subject annotation in a sentence-document space indicating a sentence and a document within said annotated documents; and instructions for representing each of said at least one subject annotation as a mapping function from said sentence-document space into a space of tagged textual spans.
| 0.854915 |
8,495,050 | 1 | 6 |
1. A computer program product for identifying universal resource locator rewriting rules, the computer program product comprising: a non-transitory computer readable storage medium including computer executable program code stored thereon, the computer executable program code comprising: computer executable program code for receiving input of universal resource locators of an application, to form received universal resource locators; computer executable program code for representing the received universal resource locators in a graph; computer executable program code for applying analysis algorithms and heuristics to properties of the graph; computer executable program code for identifying universal resource locator rewriting patterns using the graph to form detected patterns, including if a switch has a complexity value greater than a predetermined value “Q”, grouping identified switches into Left Switches and Right Switches according to a connection set; and computer executable program code for generating rewrite rules corresponding to the detected patterns.
|
1. A computer program product for identifying universal resource locator rewriting rules, the computer program product comprising: a non-transitory computer readable storage medium including computer executable program code stored thereon, the computer executable program code comprising: computer executable program code for receiving input of universal resource locators of an application, to form received universal resource locators; computer executable program code for representing the received universal resource locators in a graph; computer executable program code for applying analysis algorithms and heuristics to properties of the graph; computer executable program code for identifying universal resource locator rewriting patterns using the graph to form detected patterns, including if a switch has a complexity value greater than a predetermined value “Q”, grouping identified switches into Left Switches and Right Switches according to a connection set; and computer executable program code for generating rewrite rules corresponding to the detected patterns. 6. The computer program product of claim 1 , wherein computer executable program code for generating rewrite rules corresponding to the detected patterns further comprises: computer executable program code for generating a regular expression string for each rewrite rule data structure in an optimized list of rewrite rules wherein generating the regular expression string uses a formula of S L D L ([^D 1 D 2 . . . D N ]+)D P1 ([^D 1 D 2 . . . D N ]+)D P2 ([^D 1 D 2 . . . D N ]+) . . . D PM ([^D 1 D 2 . . . D N ]+) where S L represents a left switch characteristic and D Pi are the delimiters that separate nodes of the rewrite rule connection path.
| 0.837569 |
7,548,899 | 20 | 23 |
20. A device comprising: a processor; a communication interface operably coupled to the processor; and a computer-readable medium including computer-readable instructions stored therein that, upon execution by the processor, cause the processor to send a first menu list of words or phrases associated with a plurality of concepts to a device; receive a first selection of at least one of the words or phrases in the first menu list from the device, the received first selection identifying a concept for a query to be formed; identify a second menu list of words or phrases based at least in part on the received first selection; send the identified second menu list to the device; receive a second selection of at least one of the words or phrases in the second menu list from the device, the second selection identifying a first segment of the query; form the query as a natural language query based at least in part on the received first selection and the received second selection, wherein the natural language query does not include the identified concept; and provide a response to the query to the device.
|
20. A device comprising: a processor; a communication interface operably coupled to the processor; and a computer-readable medium including computer-readable instructions stored therein that, upon execution by the processor, cause the processor to send a first menu list of words or phrases associated with a plurality of concepts to a device; receive a first selection of at least one of the words or phrases in the first menu list from the device, the received first selection identifying a concept for a query to be formed; identify a second menu list of words or phrases based at least in part on the received first selection; send the identified second menu list to the device; receive a second selection of at least one of the words or phrases in the second menu list from the device, the second selection identifying a first segment of the query; form the query as a natural language query based at least in part on the received first selection and the received second selection, wherein the natural language query does not include the identified concept; and provide a response to the query to the device. 23. The device of claim 20 , wherein the instructions further cause the processor to: send a request for the response to a third device; and receive the response from the third device.
| 0.5 |
7,636,662 | 11 | 16 |
11. A method for use in synthesizing audio-visual content in a video image processor, said method comprising the steps of: receiving audio-visual input signals that represent a speaker who is speaking; extracting (i) audio features of the speaker's speech and (ii) visual features of the speaker's face from the audio-input signals; creating audiovisual input vectors from (i) the extracted audio features and (ii) the extracted visual features, wherein each audiovisual input vector comprises a hybrid logical unit that exhibits properties of both (a) the phonemes and (b) the visemes; creating audiovisual configurations from the audiovisual input vectors, wherein the audiovisual configurations comprise speaking face movement components in an audiovisual space; and performing a semantic association procedure on the audiovisual input vectors to obtain an association between phonemes that represent the speaker's speech and visemes that represent the speaker's face for each audiovisual input vector.
|
11. A method for use in synthesizing audio-visual content in a video image processor, said method comprising the steps of: receiving audio-visual input signals that represent a speaker who is speaking; extracting (i) audio features of the speaker's speech and (ii) visual features of the speaker's face from the audio-input signals; creating audiovisual input vectors from (i) the extracted audio features and (ii) the extracted visual features, wherein each audiovisual input vector comprises a hybrid logical unit that exhibits properties of both (a) the phonemes and (b) the visemes; creating audiovisual configurations from the audiovisual input vectors, wherein the audiovisual configurations comprise speaking face movement components in an audiovisual space; and performing a semantic association procedure on the audiovisual input vectors to obtain an association between phonemes that represent the speaker's speech and visemes that represent the speaker's face for each audiovisual input vector. 16. The method as claimed in claim 11 , wherein the audio features extracted from the audio-visual input signals comprise one of: Mel Cepstral Frequency Coefficients, Linear Predictive Coding Coefficients, Delta Mel Cepstral Frequency Coefficients, Delta Linear Predictive Coding Coefficients, and Autocorrelation Mel Cepstral Frequency Coefficients.
| 0.591121 |
8,958,826 | 11 | 13 |
11. A mobility pattern mining method, comprising: collecting a user's historical data; obtaining stay points of the user from the historical data; obtaining a semantic tree for a certain topic and extracting topic related stay points from the stay points of the user by using the semantic tree for the certain topic; determining a candidate mobility pattern of the user based on the topic related stay points; and selecting a frequent mobility pattern which matches the candidate mobility pattern of the user best from a frequent mobility pattern database related to the certain topic; wherein the frequent mobility pattern database is set in advance based on historical data for a plurality of users.
|
11. A mobility pattern mining method, comprising: collecting a user's historical data; obtaining stay points of the user from the historical data; obtaining a semantic tree for a certain topic and extracting topic related stay points from the stay points of the user by using the semantic tree for the certain topic; determining a candidate mobility pattern of the user based on the topic related stay points; and selecting a frequent mobility pattern which matches the candidate mobility pattern of the user best from a frequent mobility pattern database related to the certain topic; wherein the frequent mobility pattern database is set in advance based on historical data for a plurality of users. 13. The mobility pattern mining method according to claim 11 , wherein the stay points of the user are matched with leaf nodes of the semantic tree for the certain topic and the matched stay points are selected as the topic related stay points.
| 0.752535 |
9,654,615 | 5 | 6 |
5. The method of claim 4 , wherein after sounding said received message, said user may choose a predefined reaction.
|
5. The method of claim 4 , wherein after sounding said received message, said user may choose a predefined reaction. 6. The method of claim 5 , wherein said predefined reactions are: a. stopping safe messaging; b. calling back to said message sender; c. sending a prewritten message to said sender; d. recording voice message and sending it to said sender; e. repeating said received message.
| 0.5 |
8,549,303 | 1 | 4 |
1. A method for electronically signing an electronic transcript, comprising: obtaining an electronic transcript representative of transcript data; generating a first representation by performing a first hash operation on the electronic transcript; appending data that is representative of a user to the first representation to form an appended first representation; generating a second representation by performing a second hash operation on the appended first representation; communicating the second representation to a digital notary service; receiving from the digital notary service a digital notary record based on the communicated second representation; and forming an electronically signed electronic transcript by bundling the digital notary record, the electronic transcript, and the data that is representative of the user.
|
1. A method for electronically signing an electronic transcript, comprising: obtaining an electronic transcript representative of transcript data; generating a first representation by performing a first hash operation on the electronic transcript; appending data that is representative of a user to the first representation to form an appended first representation; generating a second representation by performing a second hash operation on the appended first representation; communicating the second representation to a digital notary service; receiving from the digital notary service a digital notary record based on the communicated second representation; and forming an electronically signed electronic transcript by bundling the digital notary record, the electronic transcript, and the data that is representative of the user. 4. The method of claim 1 , wherein the digital notary record comprises a time stamp of the second representation.
| 0.711735 |
8,954,466 | 1 | 10 |
1. A method comprising: utilizing at least one processor to execute computer code configured to perform the steps of: accepting a first search query in a browsing session; deriving a first search result set comprising at least one search result from the first search query; predicting a second search query; deriving a second search result set comprising at least one search result from the second search query; yielding a final search result set via combining the first search result set and the second search result set; wherein said deriving of a first search result set comprises ascertaining a quantity k of at least one search result first occurring responsive to the first accepted search query; wherein said ascertaining comprises determining k based on a comparison of a first derivative of a cumulative confidence score of retrieved ranked documents to a predetermined threshold; the first derivative being determined as a function of the cumulative confidence score compared to a number of retrieved ranked documents; and wherein the retrieved ranked documents comprise documents retrieved from the first search result set and ranked on a basis of confidence scores from compared N-grams from within the documents comprising at least one of: compared bigrams, and compared trigrams.
|
1. A method comprising: utilizing at least one processor to execute computer code configured to perform the steps of: accepting a first search query in a browsing session; deriving a first search result set comprising at least one search result from the first search query; predicting a second search query; deriving a second search result set comprising at least one search result from the second search query; yielding a final search result set via combining the first search result set and the second search result set; wherein said deriving of a first search result set comprises ascertaining a quantity k of at least one search result first occurring responsive to the first accepted search query; wherein said ascertaining comprises determining k based on a comparison of a first derivative of a cumulative confidence score of retrieved ranked documents to a predetermined threshold; the first derivative being determined as a function of the cumulative confidence score compared to a number of retrieved ranked documents; and wherein the retrieved ranked documents comprise documents retrieved from the first search result set and ranked on a basis of confidence scores from compared N-grams from within the documents comprising at least one of: compared bigrams, and compared trigrams. 10. The method according to claim 1 , further comprising presenting the second search result set via presenting a recommendation.
| 0.83995 |
8,639,517 | 9 | 13 |
9. A system comprising: a processor; and a computer-readable storage medium storing instructions which, when executed on a processor, cause the processor to perform operations comprising: generating a set of features characterizing an association between a user input and a conversation context using prior user inputs; determining, by normalizing a length of the user input to a previous input in the prior user inputs and using a data-driven machine learning approach, whether the user input is associated with an existing topic related to a previous conversation context; and when the user input is associated with the existing topic, generating a response to the user input using information associated with the user input and content associated with any previous user input on the existing topic.
|
9. A system comprising: a processor; and a computer-readable storage medium storing instructions which, when executed on a processor, cause the processor to perform operations comprising: generating a set of features characterizing an association between a user input and a conversation context using prior user inputs; determining, by normalizing a length of the user input to a previous input in the prior user inputs and using a data-driven machine learning approach, whether the user input is associated with an existing topic related to a previous conversation context; and when the user input is associated with the existing topic, generating a response to the user input using information associated with the user input and content associated with any previous user input on the existing topic. 13. The system of claim 9 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising classifying the prior user inputs based on context space.
| 0.606742 |
6,134,529 | 1 | 4 |
1. A method for using a computer to teach language reading skills comprising: selecting a subset of stored internal speech patterns containing at least one correct internal speech pattern which corresponds to a correct response and at least one internal speech pattern corresponding to an incorrect response, from a set of stored internal speech patterns, using a computer program, wherein said correct internal speech pattern is readily differentiable from each of said internal speech patterns corresponding to an incorrect response by a comparison subprogram; presenting a visual image to a user that corresponds to said correct internal speech pattern, obtaining a speech response segment from the user; comparing, using the comparison subprogram, said speech response segment to the subset of stored internal speech patterns and determining the degree of matching to each internal speech pattern in the subset of internal speech patterns; and presenting to the user a response to the speech segment based on the results of the step of comparing.
|
1. A method for using a computer to teach language reading skills comprising: selecting a subset of stored internal speech patterns containing at least one correct internal speech pattern which corresponds to a correct response and at least one internal speech pattern corresponding to an incorrect response, from a set of stored internal speech patterns, using a computer program, wherein said correct internal speech pattern is readily differentiable from each of said internal speech patterns corresponding to an incorrect response by a comparison subprogram; presenting a visual image to a user that corresponds to said correct internal speech pattern, obtaining a speech response segment from the user; comparing, using the comparison subprogram, said speech response segment to the subset of stored internal speech patterns and determining the degree of matching to each internal speech pattern in the subset of internal speech patterns; and presenting to the user a response to the speech segment based on the results of the step of comparing. 4. The method of claim 1 wherein said subset of internal speech patterns includes at least one improperly pronounced variation of a response represents a speech response segment indicative of the user's native speech pattern.
| 0.537037 |
9,355,169 | 1 | 11 |
1. A computer implemented method of extracting a set of phrases from a plurality of documents, the method comprising: for each document: identifying a plurality of candidate phrases occurring within the document, wherein a candidate phrase includes two or more consecutive words that are determined to occur in the document, and scoring candidate phrases in the document to produce respective document phrase scores for the candidate phrases for the document, the document phrase score for a candidate phrase being based on attributes of individual occurrences of the candidate phrase in the document, with at least some candidate phrases appearing repeatedly having a higher document phrase score than candidate phrases appearing once; for a candidate phrase of the plurality of the candidate phrases: creating, via a processor, a combined score for the candidate phrase based on a plurality of different document phrase scores for the candidate phrase for respective different documents; and selecting the candidate phrase for inclusion in the extracted set based on the combined score for the candidate phrase and based on the document phrase scores for the candidate phrase.
|
1. A computer implemented method of extracting a set of phrases from a plurality of documents, the method comprising: for each document: identifying a plurality of candidate phrases occurring within the document, wherein a candidate phrase includes two or more consecutive words that are determined to occur in the document, and scoring candidate phrases in the document to produce respective document phrase scores for the candidate phrases for the document, the document phrase score for a candidate phrase being based on attributes of individual occurrences of the candidate phrase in the document, with at least some candidate phrases appearing repeatedly having a higher document phrase score than candidate phrases appearing once; for a candidate phrase of the plurality of the candidate phrases: creating, via a processor, a combined score for the candidate phrase based on a plurality of different document phrase scores for the candidate phrase for respective different documents; and selecting the candidate phrase for inclusion in the extracted set based on the combined score for the candidate phrase and based on the document phrase scores for the candidate phrase. 11. The method of claim 1 , wherein selecting the candidate phrase for inclusion in the extracted set based on the combined score and based on the document phrase scores includes: selecting the candidate phrase when a maximum value of the document phrase scores exceeds a first threshold, or when the combined score exceeds a second threshold, or when the number of documents for which the candidate phrase had at least a minimum document phrase score exceeds a third threshold.
| 0.648012 |
10,157,365 | 2 | 3 |
2. The method of claim 1 further comprising adding a first operation candidate to the first service candidate and a second operation candidate to the second service candidate.
|
2. The method of claim 1 further comprising adding a first operation candidate to the first service candidate and a second operation candidate to the second service candidate. 3. The method of claim 2 further comprising linking the first operation candidate with the second operation candidate.
| 0.5 |
9,367,522 | 1 | 6 |
1. A method for editing an electronic presentation, the method comprising: providing an electronic presentation editing interface for editing an electronic presentation, wherein the interface comprises: a digital canvas comprising a plurality of canvas objects in a plurality of canvas layers; a digital timeline comprising a plurality of timeline objects, a time axis, and a graphical indicia on the time axis that represents a pause in the electronic presentation, wherein: each canvas object in the plurality of canvas objects is linked to a respective timeline object; a position of a timeline object on the digital timeline is indicative of a time and a canvas layer that a linked canvas object is displayed on the digital canvas; the position of the timeline object includes a first time coordinate on the time axis indicative of when the linked canvas object appears in the digital canvas, a second time coordinate on the time axis indicative of when the linked canvas object disappears from the digital canvas, and a layer coordinate indicative of a canvas layer in which the linked canvas object appears in the digital canvas; the graphical indicia extends over all layer coordinates that are displayed in the digital timeline; and the digital timeline further comprises a marker on the digital timeline, wherein a position of the marker is indicative of a time corresponding to a current view of the digital canvas, and wherein when the position of the marker coincides with the graphical indicia on the time axis, each canvas object linked to a timeline object that coincides with the position of the marker is paused.
|
1. A method for editing an electronic presentation, the method comprising: providing an electronic presentation editing interface for editing an electronic presentation, wherein the interface comprises: a digital canvas comprising a plurality of canvas objects in a plurality of canvas layers; a digital timeline comprising a plurality of timeline objects, a time axis, and a graphical indicia on the time axis that represents a pause in the electronic presentation, wherein: each canvas object in the plurality of canvas objects is linked to a respective timeline object; a position of a timeline object on the digital timeline is indicative of a time and a canvas layer that a linked canvas object is displayed on the digital canvas; the position of the timeline object includes a first time coordinate on the time axis indicative of when the linked canvas object appears in the digital canvas, a second time coordinate on the time axis indicative of when the linked canvas object disappears from the digital canvas, and a layer coordinate indicative of a canvas layer in which the linked canvas object appears in the digital canvas; the graphical indicia extends over all layer coordinates that are displayed in the digital timeline; and the digital timeline further comprises a marker on the digital timeline, wherein a position of the marker is indicative of a time corresponding to a current view of the digital canvas, and wherein when the position of the marker coincides with the graphical indicia on the time axis, each canvas object linked to a timeline object that coincides with the position of the marker is paused. 6. The method of claim 1 , wherein the interface is provided by displaying a portion of the digital timeline concurrently with displaying a portion of the digital canvas corresponding to a time indicated on the timeline.
| 0.814189 |
10,134,297 | 1 | 7 |
1. A computer-implemented method of analyzing complexity of a document, comprising: receiving the document with a processing system, the document including a plurality of words; identifying, with the processing system, content words within the document based on parts of speech for the plurality of words; selecting, with the processing system, a plurality of pairs of the content words that appear in a same sentence or paragraph to form multiple groups of content words; determining, with the processing system, an association measure for each group of content words by determining how often the pair of content words in each group appears in a same sentence or paragraph in a corpus of documents; creating, with the processing system, a word association profile, wherein the word association profile comprises a distribution of association measures for the multiple groups of content words in the document; determining, with the processing system, a complexity for the document based on the word association profile, wherein the document is an essay and the complexity is used to assess a quality of the essay.
|
1. A computer-implemented method of analyzing complexity of a document, comprising: receiving the document with a processing system, the document including a plurality of words; identifying, with the processing system, content words within the document based on parts of speech for the plurality of words; selecting, with the processing system, a plurality of pairs of the content words that appear in a same sentence or paragraph to form multiple groups of content words; determining, with the processing system, an association measure for each group of content words by determining how often the pair of content words in each group appears in a same sentence or paragraph in a corpus of documents; creating, with the processing system, a word association profile, wherein the word association profile comprises a distribution of association measures for the multiple groups of content words in the document; determining, with the processing system, a complexity for the document based on the word association profile, wherein the document is an essay and the complexity is used to assess a quality of the essay. 7. The method of claim 1 , wherein each group of content words includes only words occurring in a sentence of the document.
| 0.627273 |
9,788,777 | 13 | 14 |
13. The tangible computer readable storage medium as described in claim 12 , wherein the instructions, when executed, cause the machine to at least: calculate a second combined feature score for a second feature-emotion pair associated with a second feature and the first emotion; and determine a first emotion score for the first emotion based on the first combined feature score and the second combined feature score.
|
13. The tangible computer readable storage medium as described in claim 12 , wherein the instructions, when executed, cause the machine to at least: calculate a second combined feature score for a second feature-emotion pair associated with a second feature and the first emotion; and determine a first emotion score for the first emotion based on the first combined feature score and the second combined feature score. 14. The tangible computer readable storage medium as described in claim 13 , wherein the instructions, when executed, cause the machine to at least: determine a second emotion score for a second emotion, the second emotion different from the first emotion; and select at least one of the first emotion or the second emotion as evoked by the first media based on the first emotion score and the second emotion score.
| 0.5 |
10,019,986 | 8 | 11 |
8. A voice search system including (i) an automated speech recognizer that uses an acoustic model to transcribe utterances, (ii) a search engine, (iii) an acoustic model trainer that periodically retrains the acoustic model using portions of audio data that correspond to manually specified terms of first transcriptions, (iv) a user interface component, and (v) a correction classifier, the voice search system comprising: a processor configured to execute computer program instructions; and a computer storage medium encoded with the computer program instructions that, when executed by the processor, cause the system to perform operations comprising: receiving first audio data corresponding to an utterance of a user; receiving, from a client device, first audio data corresponding to an utterance of a user; obtaining, by the automated speech recognizer, a first transcription of the first audio data; receiving, by the user interface component, data indicating (i) a selection of one or more terms of the first transcription and (ii) one or more of replacement terms that the user has manually specified as a replacement for the one or more terms; determining, by the correction classifier, a minimum edit distance between the one or more terms of the first transcription and the one or more replacement terms; determining, by the correction classifier of the voice search system and based at least on the minimum edit distance between the one or more terms of the first transcription and the one or more replacement terms that the user has manually specified as a replacement for the one or more terms, whether one or more of the replacement terms that the user has manually specified as a replacement for the one or more terms likely represent a correction of one or more of the one or more terms of the first transcription; in response to determining, based at least on the minimum edit distance between the one or more terms of the first transcription and the one or more replacement terms that the user has manually specified as a replacement for the one or more terms, whether the one or more of the replacement terms that the user has manually specified as a replacement for the one or more terms likely represents a correction of the one or more terms of the first transcription, selectively retraining, by the acoustic model trainer of the voice search system, the acoustic model, comprising (i) retraining the acoustic model of the automated speech recognizer using a first portion of the audio that is associated with the one or more terms of the first transcription when the correction classifier indicates that the replacement terms likely represent a correction, or (ii) bypassing retraining of the acoustic model of the automated speech recognizer using the first portion of the first audio data that is associated with the one or more terms of the first transcription when the correction classifier indicates that the replacement terms do not likely represent a correction; obtaining, by the automated speech recognizer and using the retrained acoustic model, a transcription of audio data corresponding to a subsequently received utterance; and providing, by the user interface component, a user interface that includes one or more search results that the search engine of the voice search system has identified in response to the transcription of the audio data corresponding to the subsequently received utterance.
|
8. A voice search system including (i) an automated speech recognizer that uses an acoustic model to transcribe utterances, (ii) a search engine, (iii) an acoustic model trainer that periodically retrains the acoustic model using portions of audio data that correspond to manually specified terms of first transcriptions, (iv) a user interface component, and (v) a correction classifier, the voice search system comprising: a processor configured to execute computer program instructions; and a computer storage medium encoded with the computer program instructions that, when executed by the processor, cause the system to perform operations comprising: receiving first audio data corresponding to an utterance of a user; receiving, from a client device, first audio data corresponding to an utterance of a user; obtaining, by the automated speech recognizer, a first transcription of the first audio data; receiving, by the user interface component, data indicating (i) a selection of one or more terms of the first transcription and (ii) one or more of replacement terms that the user has manually specified as a replacement for the one or more terms; determining, by the correction classifier, a minimum edit distance between the one or more terms of the first transcription and the one or more replacement terms; determining, by the correction classifier of the voice search system and based at least on the minimum edit distance between the one or more terms of the first transcription and the one or more replacement terms that the user has manually specified as a replacement for the one or more terms, whether one or more of the replacement terms that the user has manually specified as a replacement for the one or more terms likely represent a correction of one or more of the one or more terms of the first transcription; in response to determining, based at least on the minimum edit distance between the one or more terms of the first transcription and the one or more replacement terms that the user has manually specified as a replacement for the one or more terms, whether the one or more of the replacement terms that the user has manually specified as a replacement for the one or more terms likely represents a correction of the one or more terms of the first transcription, selectively retraining, by the acoustic model trainer of the voice search system, the acoustic model, comprising (i) retraining the acoustic model of the automated speech recognizer using a first portion of the audio that is associated with the one or more terms of the first transcription when the correction classifier indicates that the replacement terms likely represent a correction, or (ii) bypassing retraining of the acoustic model of the automated speech recognizer using the first portion of the first audio data that is associated with the one or more terms of the first transcription when the correction classifier indicates that the replacement terms do not likely represent a correction; obtaining, by the automated speech recognizer and using the retrained acoustic model, a transcription of audio data corresponding to a subsequently received utterance; and providing, by the user interface component, a user interface that includes one or more search results that the search engine of the voice search system has identified in response to the transcription of the audio data corresponding to the subsequently received utterance. 11. The system of claim 8 , wherein determining the minimum edit distance comprises determining one or more connections among the one or more of the terms of the first transcription.
| 0.758621 |
4,351,032 | 14 | 22 |
14. A frequency sensing circuit for sensing the presence of a frequency component F.sub.O in an applied analog signal comprising: means for limiting the applied analog signal to produce an amplitude limited signal; means for sampling the amplitude limited signal; means coupled to said means for sampling, for encoding each sample as a digital signal at an output thereof; an adder having a first input coupled to the output of said means for encoding and having a second input and an output; delay means having an input coupled to the output of said adder for delaying signals applied thereto by an amount that is an integral multiple of one-half the time period of the frequency to be sensed said delayed signals being provided at an output; a multiplier having an input coupled to the output of said delay means and having an output coupled to said second input of said adder; means for clocking said multiplier at a rate of two or more times the desired frequency to be sensed; and means coupled to said frequency sensing circuit for deriving an output signal therefrom having a magnitude indicative of the presence of the frequency to be sensed in said input signal.
|
14. A frequency sensing circuit for sensing the presence of a frequency component F.sub.O in an applied analog signal comprising: means for limiting the applied analog signal to produce an amplitude limited signal; means for sampling the amplitude limited signal; means coupled to said means for sampling, for encoding each sample as a digital signal at an output thereof; an adder having a first input coupled to the output of said means for encoding and having a second input and an output; delay means having an input coupled to the output of said adder for delaying signals applied thereto by an amount that is an integral multiple of one-half the time period of the frequency to be sensed said delayed signals being provided at an output; a multiplier having an input coupled to the output of said delay means and having an output coupled to said second input of said adder; means for clocking said multiplier at a rate of two or more times the desired frequency to be sensed; and means coupled to said frequency sensing circuit for deriving an output signal therefrom having a magnitude indicative of the presence of the frequency to be sensed in said input signal. 22. A frequency sensing circuit according to claim 14 wherein said output deriving means is coupled to said delay means.
| 0.732143 |
7,634,546 | 34 | 45 |
34. A method for enhancing communication within a community, the method comprising the steps of: (a) receiving in an application in an application platform a communication sent by a user from a first communication device, wherein said communication is associated with a user selected topic of a plurality of topics such that said user selected topic is selected by said user, and receiving a link to a resource associated with said communication; (b) determining an access right said user has to information stored in a database of said application in said application platform based upon an access status and wherein said access status is selected from the group consisting of an inclusive access in which access to each of said stored communications in said hierarchical structure is allowed except where excluded by an inherited parameter and an exclusive access in which access to each of said stored communications in said hierarchical structure is allowed only where explicitly assigned; (c) accessing a current database hierarchy, authorization parameters, and interaction control parameters for said application; (d) granting access to said user, according to said access right of said user, to a portion of said information stored in said database, wherein said portion of said information is stored in association with said user selected topic; (e) determining a dynamic interaction capability for said user with said portion of said information based on said database hierarchy, said authorization parameters, and said interaction control parameters; (f) prioritizing an order of said portion of said information, wherein an initial thread of said information is assigned a higher priority than a response to a thread of said information; (g) presenting said portion of said information that is ordered to said user for review, wherein said presentation is based on said prioritization; (h) accepting an initial input from said user according to said dynamic interaction capability from said first communication device for storage in said database, wherein said initial input comprises said communication and said link; and (i) outputting said initial input from said user to at least a second communication device.
|
34. A method for enhancing communication within a community, the method comprising the steps of: (a) receiving in an application in an application platform a communication sent by a user from a first communication device, wherein said communication is associated with a user selected topic of a plurality of topics such that said user selected topic is selected by said user, and receiving a link to a resource associated with said communication; (b) determining an access right said user has to information stored in a database of said application in said application platform based upon an access status and wherein said access status is selected from the group consisting of an inclusive access in which access to each of said stored communications in said hierarchical structure is allowed except where excluded by an inherited parameter and an exclusive access in which access to each of said stored communications in said hierarchical structure is allowed only where explicitly assigned; (c) accessing a current database hierarchy, authorization parameters, and interaction control parameters for said application; (d) granting access to said user, according to said access right of said user, to a portion of said information stored in said database, wherein said portion of said information is stored in association with said user selected topic; (e) determining a dynamic interaction capability for said user with said portion of said information based on said database hierarchy, said authorization parameters, and said interaction control parameters; (f) prioritizing an order of said portion of said information, wherein an initial thread of said information is assigned a higher priority than a response to a thread of said information; (g) presenting said portion of said information that is ordered to said user for review, wherein said presentation is based on said prioritization; (h) accepting an initial input from said user according to said dynamic interaction capability from said first communication device for storage in said database, wherein said initial input comprises said communication and said link; and (i) outputting said initial input from said user to at least a second communication device. 45. A method according to claim 34 wherein said outputting step further comprises: outputting said initial input as an alert to a select group of users, wherein said initial input is output to at least a one of a home page of said select group of users, an e-mail account of said select group of users, a voice mail box of said select group of users, and to some other type of communications device of said select group of users.
| 0.619005 |
10,120,850 | 1 | 2 |
1. A method for execution in a computing environment for providing access to one or more program functions for interacting with and manipulating a digital image, the method comprising: providing an overlay of one or more annotated fields superimposed on a display of the digital image, wherein said annotated fields correlate to one or more informational items; said one or more informational items comprising at least one of parameters and values relating to the display of the digital image; activating one or more of said annotated fields, wherein said activated fields are selectable to accept direct input by a user of a value for said correlating one or more informational items; wherein the movement of a cursor over any of said activated annotated fields results in a display of an indicia indicating to the user that said activated annotated field can receive said direct input of said value; allowing for the selection of said activated annotated field that is associated with said display of said indicia using said cursor; allowing for direct input of said value by said user in said selected activated annotated field; and utilizing said value to provide data to the one or more program functions to thereby interact with and manipulate the digital image.
|
1. A method for execution in a computing environment for providing access to one or more program functions for interacting with and manipulating a digital image, the method comprising: providing an overlay of one or more annotated fields superimposed on a display of the digital image, wherein said annotated fields correlate to one or more informational items; said one or more informational items comprising at least one of parameters and values relating to the display of the digital image; activating one or more of said annotated fields, wherein said activated fields are selectable to accept direct input by a user of a value for said correlating one or more informational items; wherein the movement of a cursor over any of said activated annotated fields results in a display of an indicia indicating to the user that said activated annotated field can receive said direct input of said value; allowing for the selection of said activated annotated field that is associated with said display of said indicia using said cursor; allowing for direct input of said value by said user in said selected activated annotated field; and utilizing said value to provide data to the one or more program functions to thereby interact with and manipulate the digital image. 2. A method in accordance with claim 1 wherein said value provided to the one or more program functions provides display of related digital images.
| 0.704819 |
8,065,313 | 31 | 34 |
31. A method for automatically annotating a video in a computer system, comprising: iteratively extracting video features from a received video on different spatial scales, wherein the video features comprise visual characteristics associated with the tiles of different sizes in an image within the video; matching the extracted video features to known video features; identifying other videos with similar video features to the extracted video features using one or more combinations of the matched image features; obtaining text associated with the other videos, wherein obtaining the text associated with the other videos comprises obtaining text that surrounds each video in a web page in which the video is located; identifying one or more intersecting keywords in the text associated with the other videos; and annotating the received video with the intersecting keywords using the computer system.
|
31. A method for automatically annotating a video in a computer system, comprising: iteratively extracting video features from a received video on different spatial scales, wherein the video features comprise visual characteristics associated with the tiles of different sizes in an image within the video; matching the extracted video features to known video features; identifying other videos with similar video features to the extracted video features using one or more combinations of the matched image features; obtaining text associated with the other videos, wherein obtaining the text associated with the other videos comprises obtaining text that surrounds each video in a web page in which the video is located; identifying one or more intersecting keywords in the text associated with the other videos; and annotating the received video with the intersecting keywords using the computer system. 34. The method of claim 31 , wherein the method further comprises combining the matched video features to form one or more video-feature combinations for the received video.
| 0.738671 |
8,868,560 | 2 | 3 |
2. The method of claim 1 , further comprising automatically identifying semantic tags from the semantic metadata via one or more of Natural Language Processing, entity extraction, and ontological classification.
|
2. The method of claim 1 , further comprising automatically identifying semantic tags from the semantic metadata via one or more of Natural Language Processing, entity extraction, and ontological classification. 3. The method of claim 2 , further comprising one or more of identifying semantic tags based on one or more of an identified topic of content of the plurality of objects and user specification and comparing the semantic tags with one or more knowledge databases.
| 0.5 |
9,476,718 | 1 | 4 |
1. A vehicle navigation system that generates an outgoing text message comprising: a vehicle interface that permits a user to provide input to and receive output from the vehicle navigation system, the vehicle interface including an input configured to (i) receive a speech signal from a vehicle mounted microphone, wherein the speech signal corresponds to the outgoing text message, and to (ii) receive data from an incoming text message to annunciate the data to a vehicle occupant; a speech recognizer in communication with the input and configured to analyze the speech signal and recognize text of the speech signal; a speech database in communication with the speech recognizer that provides the speech recognizer with samples of recognized digital speech for recognizing the text of the speech signal; a message generator in communication with the speech recognizer that generates the outgoing text message based on the text of the speech signal recognized by the speech recognizer; an output in communication with the message generator that presents the outgoing text message on a display for verification; a validation means that prompts a user to confirm the displayed outgoing text message; a transmitter in communication with the message generator and configured to transmit the outgoing text message over a network upon receipt of the verification; a receiver that receives the incoming text message and provides the incoming text message; where the vehicle interface permits the user to selectively provide the speech signal in complete sentences, word-by-word and letter-by-letter; where the speech database stores samples of spoken letters, words and phrases; where the speech recognizer comprises functionality for interpreting one or more system commands, editing commands and messages and can be activated with a spoken keyword; and further comprises at least one of the following algorithms: a utilization of probability estimates, an analysis of feature vectors and a concatenation of allophones that constitute a linguistic word; and where the transmitter comprises one or more telecommunication units that can selectively communicate the outgoing text message over a store and forward messaging service or as an electronic mail over at least one of the following paths (i) a local area network, (ii) a wireless fidelity network (Wi-Fi), (iii) a wide area network (WAN), (iv) the Internet, (v) a radio network, (vi) a wireless network and (vii) a telephone network.
|
1. A vehicle navigation system that generates an outgoing text message comprising: a vehicle interface that permits a user to provide input to and receive output from the vehicle navigation system, the vehicle interface including an input configured to (i) receive a speech signal from a vehicle mounted microphone, wherein the speech signal corresponds to the outgoing text message, and to (ii) receive data from an incoming text message to annunciate the data to a vehicle occupant; a speech recognizer in communication with the input and configured to analyze the speech signal and recognize text of the speech signal; a speech database in communication with the speech recognizer that provides the speech recognizer with samples of recognized digital speech for recognizing the text of the speech signal; a message generator in communication with the speech recognizer that generates the outgoing text message based on the text of the speech signal recognized by the speech recognizer; an output in communication with the message generator that presents the outgoing text message on a display for verification; a validation means that prompts a user to confirm the displayed outgoing text message; a transmitter in communication with the message generator and configured to transmit the outgoing text message over a network upon receipt of the verification; a receiver that receives the incoming text message and provides the incoming text message; where the vehicle interface permits the user to selectively provide the speech signal in complete sentences, word-by-word and letter-by-letter; where the speech database stores samples of spoken letters, words and phrases; where the speech recognizer comprises functionality for interpreting one or more system commands, editing commands and messages and can be activated with a spoken keyword; and further comprises at least one of the following algorithms: a utilization of probability estimates, an analysis of feature vectors and a concatenation of allophones that constitute a linguistic word; and where the transmitter comprises one or more telecommunication units that can selectively communicate the outgoing text message over a store and forward messaging service or as an electronic mail over at least one of the following paths (i) a local area network, (ii) a wireless fidelity network (Wi-Fi), (iii) a wide area network (WAN), (iv) the Internet, (v) a radio network, (vi) a wireless network and (vii) a telephone network. 4. The vehicle navigation system of claim 1 further comprising the receiver in communication with the network for receiving communications, where the communications are presented by the output.
| 0.828597 |
9,009,664 | 3 | 5 |
3. The method of claim 1 further comprising: receiving one or more selections of the code structure query results; wherein the indexing source code further comprises generating formatted source code; and sending formatted source code corresponding to the one or more selections of the code structure query results.
|
3. The method of claim 1 further comprising: receiving one or more selections of the code structure query results; wherein the indexing source code further comprises generating formatted source code; and sending formatted source code corresponding to the one or more selections of the code structure query results. 5. The method of claim 3 , wherein the formatted source code comprises an HTML source-code file that displays source code of the first code element corresponding to the one or more selections of the code structure query results, wherein the HTML source-code file includes links to referenced source code.
| 0.523511 |
4,122,444 | 7 | 16 |
7. An apparatus in accordance with claim 1, wherein said plurality of different sets of numeral characters comprises a first and second set thereof, and said display means comprises a first display means portion responsive to said first set of element select signals for displaying said numerical value information by said first set of numeral characters; and a second display means portion responsive to said second set of element select signals for displaying said numerical value information by said second set of numeral characters.
|
7. An apparatus in accordance with claim 1, wherein said plurality of different sets of numeral characters comprises a first and second set thereof, and said display means comprises a first display means portion responsive to said first set of element select signals for displaying said numerical value information by said first set of numeral characters; and a second display means portion responsive to said second set of element select signals for displaying said numerical value information by said second set of numeral characters. 16. An apparatus in accordance with claim 7, which further comprises means operatively associated with said converting means for selectively withdrawing one of said first and second kinds of element select signals for representing said coded numerical value information by a selected group of said first and second different kinds of groups of numeral characters, respectively, and wherein said display means is adapted to display said numerical value information by said selected group of said first and second different kinds of groups of numeral characters.
| 0.5 |
7,505,180 | 9 | 10 |
9. The method of claim 8 wherein proofing the digital text file further comprises: substituting the best alternative character for the suspect character having a highest probability of an error, to produce the digital text file; encoding the digital text file using the encoding algorithm to produce the encoded text; comparing the encoded text to the digital information; and uploading or transmitting the digital text file if the encoded text matches the digital information, or flagging the digital text file as misidentified if the encoded text does not match the digital information.
|
9. The method of claim 8 wherein proofing the digital text file further comprises: substituting the best alternative character for the suspect character having a highest probability of an error, to produce the digital text file; encoding the digital text file using the encoding algorithm to produce the encoded text; comparing the encoded text to the digital information; and uploading or transmitting the digital text file if the encoded text matches the digital information, or flagging the digital text file as misidentified if the encoded text does not match the digital information. 10. The method of claim 9 wherein if the digital text file is flagged as misidentified, proofing the digital text file further comprises: (A) substituting a next-best alternative character for the suspect character having the highest probability of an error to produce the digital text file; (B) encoding the digital text file using the encoding algorithm to produce the encoded text; (C) comparing the encoded text to the digital information; and uploading or transmitting the digital text file if the encoded text matches the digital information, or flagging the digital text file as misidentified if the encoded text does not match the digital information, and returning to (A) until all identified alternative characters have been substituted for the suspect character having the highest probability of an error.
| 0.5 |
9,386,152 | 9 | 10 |
9. An automated method for a contact center running on a processor coupled to a non-transitory storage device, the method comprising: running, by the processor, an interactive voice response (IVR) node for engaging in an interaction with a customer of the contact center by presenting set scripts to the customer and receiving corresponding responses from the customer; running, by the processor, an intelligent automated agent for communicating with the IVR node and storing customer profile data, built from previous interactions between the customer and the contact center, on the storage device, wherein the automated agent includes an artificial intelligence engine; running, by the processor, a routing server node configured to identify an appropriate live agent from a pool of live agents; running, by the processor, a call server node configured to communicate with the automated agent for routing a first portion of the interaction with corresponding responses to the automated agent at a request of the customer, the call server node being further configured to communicate with an agent device associated with the identified live agent for routing a second portion of the interaction with corresponding responses to the agent device; delivering, by an electronic switch coupled to the processor, the interaction to the automated agent and to the agent device; invoking, by the processor, the automated agent to retrieve a profile of the customer from the customer profile data during the first portion of the interaction and update the retrieved profile on the storage device to reflect the interaction; and invoking, by the processor, the artificial intelligence engine to learn knowledge from the first portion of the interaction and apply the learned knowledge to future interactions between the customer and the contact center.
|
9. An automated method for a contact center running on a processor coupled to a non-transitory storage device, the method comprising: running, by the processor, an interactive voice response (IVR) node for engaging in an interaction with a customer of the contact center by presenting set scripts to the customer and receiving corresponding responses from the customer; running, by the processor, an intelligent automated agent for communicating with the IVR node and storing customer profile data, built from previous interactions between the customer and the contact center, on the storage device, wherein the automated agent includes an artificial intelligence engine; running, by the processor, a routing server node configured to identify an appropriate live agent from a pool of live agents; running, by the processor, a call server node configured to communicate with the automated agent for routing a first portion of the interaction with corresponding responses to the automated agent at a request of the customer, the call server node being further configured to communicate with an agent device associated with the identified live agent for routing a second portion of the interaction with corresponding responses to the agent device; delivering, by an electronic switch coupled to the processor, the interaction to the automated agent and to the agent device; invoking, by the processor, the automated agent to retrieve a profile of the customer from the customer profile data during the first portion of the interaction and update the retrieved profile on the storage device to reflect the interaction; and invoking, by the processor, the artificial intelligence engine to learn knowledge from the first portion of the interaction and apply the learned knowledge to future interactions between the customer and the contact center. 10. The method of claim 9 , further comprising routing the interaction and the responses from the call server node to the automated agent when none of the live agents is available.
| 0.817814 |
8,738,596 | 6 | 9 |
6. A system comprising: one or more computers programmed to perform operations comprising: receiving data representative of a search query from a user located at a geographic location; determining a plurality of languages used at the geographic location; identifying a plurality of search results responsive to the search query, wherein each search refers to a respective document; obtaining, for each particular search result of the plurality of search results, a group of multiple click measures that are associated with the document referred to by the particular search result, wherein: each of the multiple click measures in the group corresponds to a different language from the plurality of languages; and each of the multiple click measures in the group is a ratio of (i) a count of times that users who use the language corresponding to the click measure have selected, from search results for the query, the document referred to by the particular search result and (ii) a count of times that users who use any of the plurality of languages have selected, from search results for the query, the document referred to by the particular search result; for each of a plurality of the search results, generating a combined click measure by combining the multiple click measures associated with the document referred to by the search result; and ranking the search results based upon, at least, the combined click measures.
|
6. A system comprising: one or more computers programmed to perform operations comprising: receiving data representative of a search query from a user located at a geographic location; determining a plurality of languages used at the geographic location; identifying a plurality of search results responsive to the search query, wherein each search refers to a respective document; obtaining, for each particular search result of the plurality of search results, a group of multiple click measures that are associated with the document referred to by the particular search result, wherein: each of the multiple click measures in the group corresponds to a different language from the plurality of languages; and each of the multiple click measures in the group is a ratio of (i) a count of times that users who use the language corresponding to the click measure have selected, from search results for the query, the document referred to by the particular search result and (ii) a count of times that users who use any of the plurality of languages have selected, from search results for the query, the document referred to by the particular search result; for each of a plurality of the search results, generating a combined click measure by combining the multiple click measures associated with the document referred to by the search result; and ranking the search results based upon, at least, the combined click measures. 9. The system of claim 6 wherein combining the multiple click measures comprises summing the multiple click measures.
| 0.690476 |
9,665,662 | 1 | 3 |
1. A system, comprising: a processor; and a memory operatively coupled to the processor, the memory storing processor-readable instructions executable by the processor to: receive a natural language based question relating to a user desired data analytics variable via a user interface; extract a plurality of key words including a first key word relating to the user desired data analytics variable and a second key word from the natural language based question; generate each of a language dependency graph and a data dependency graph in parallel, the data dependency graph being generated based on, and including, relationships between the plurality of key words and a plurality of search terms in a plurality of data sources, the language dependency graph being generated based on, and including, relationships between the plurality of key words and natural language sentence structure determined using a natural language typed-dependency graph that maps each key word node of a plurality of key word nodes included in the natural language typed-dependency graph to a portion of the remaining key word nodes of the plurality of key word nodes based on sentence structure rules; merge the language dependency graph and the data dependency graph to form an inter-dependency graph including a mapping between the plurality of key words and (1) a set of previously stored query terms and (2) a set of operational commands, based on the relationships included in the data dependency graph and the relationships included in the language dependency graph, the set of previously stored query terms being stored in a data table from a data source from the plurality of data sources; store the inter-dependency graph in an index file linked to the plurality of data sources; determine a previously stored query term for the second key word based on a mapping of the second key word and the previously stored query term that is included in the inter-dependency graph; determine a computational operation for the first key word based on a mapping of the first key word and the computational operation that is included in the inter-dependency graph; and translate the natural language based question into a formatted query string based on the index file, the computational operation, and the previously stored query term, the user desired data analytics variable being derived by applying the computational operation on a query result relating to the previously stored query term.
|
1. A system, comprising: a processor; and a memory operatively coupled to the processor, the memory storing processor-readable instructions executable by the processor to: receive a natural language based question relating to a user desired data analytics variable via a user interface; extract a plurality of key words including a first key word relating to the user desired data analytics variable and a second key word from the natural language based question; generate each of a language dependency graph and a data dependency graph in parallel, the data dependency graph being generated based on, and including, relationships between the plurality of key words and a plurality of search terms in a plurality of data sources, the language dependency graph being generated based on, and including, relationships between the plurality of key words and natural language sentence structure determined using a natural language typed-dependency graph that maps each key word node of a plurality of key word nodes included in the natural language typed-dependency graph to a portion of the remaining key word nodes of the plurality of key word nodes based on sentence structure rules; merge the language dependency graph and the data dependency graph to form an inter-dependency graph including a mapping between the plurality of key words and (1) a set of previously stored query terms and (2) a set of operational commands, based on the relationships included in the data dependency graph and the relationships included in the language dependency graph, the set of previously stored query terms being stored in a data table from a data source from the plurality of data sources; store the inter-dependency graph in an index file linked to the plurality of data sources; determine a previously stored query term for the second key word based on a mapping of the second key word and the previously stored query term that is included in the inter-dependency graph; determine a computational operation for the first key word based on a mapping of the first key word and the computational operation that is included in the inter-dependency graph; and translate the natural language based question into a formatted query string based on the index file, the computational operation, and the previously stored query term, the user desired data analytics variable being derived by applying the computational operation on a query result relating to the previously stored query term. 3. The system of claim 1 , wherein the plurality of key words are extracted by parsing the natural language based question into phrases and eliminating ancillary phrases based on heuristics.
| 0.62 |
9,728,182 | 2 | 4 |
2. The method of claim 1 wherein the extracted renormalized oscillator peaks for each sample analyzed are distributed into slots of a comparator stack to form a common coordinate system by which to directly compare the AFDV for each sample to AFDVs representing known speech sounds stored in a library for purposes of facilitating the identification of a closest match therebetween.
|
2. The method of claim 1 wherein the extracted renormalized oscillator peaks for each sample analyzed are distributed into slots of a comparator stack to form a common coordinate system by which to directly compare the AFDV for each sample to AFDVs representing known speech sounds stored in a library for purposes of facilitating the identification of a closest match therebetween. 4. The method of claim 2 wherein the AFDVs for each analyzed sample is representative of a voiced sound.
| 0.91875 |
9,721,573 | 10 | 12 |
10. The method of claim 1 , further comprising: (D) creating a data structure containing the first word at a first position and the second word at a second position that is after the first position in the data structure, wherein the punctuation mark is not between the first position and the second position in the data structure.
|
10. The method of claim 1 , further comprising: (D) creating a data structure containing the first word at a first position and the second word at a second position that is after the first position in the data structure, wherein the punctuation mark is not between the first position and the second position in the data structure. 12. The method of claim 10 , wherein (D) comprises: (D) (1) inserting the punctuation mark between the first position and the second position in the data structure; and (D) (2) removing the punctuation mark from the data structure.
| 0.522727 |
8,537,678 | 26 | 31 |
26. A Multimedia Messaging Service (MMS) decoding method, comprising the following steps of: A: parsing an original MMS data packet, acquiring all the non- Synchronized Multimedia Integration Language (SMIL) files in the original MMS data packet, and counting the number of all the non-SMIL files as a first non-SMIL file number; B: determining whether an SMIL file exists in the parsing result, when there exists an SMIL file, pre-parsing the SMIL file, obtaining the number of non-SMIL files described by the SMIL file, counting the number as a second non-SMIL file number, and executing step C; C: determining whether the first non-SMIL file number is equal to the second non-SMIL file number, when they are not equal, executing step D; D: constructing an SMIL file according to all the non-SMIL files obtained in step A and taking the constructed SMIL file as a formal SMIL file to be parsed; E: integrally parsing the formal SMIL file to be parsed, obtaining a data structure describing a playing layout of MMS, taking the obtained data structure and all the non-SMIL files obtained in step A as an MMS decoding result.
|
26. A Multimedia Messaging Service (MMS) decoding method, comprising the following steps of: A: parsing an original MMS data packet, acquiring all the non- Synchronized Multimedia Integration Language (SMIL) files in the original MMS data packet, and counting the number of all the non-SMIL files as a first non-SMIL file number; B: determining whether an SMIL file exists in the parsing result, when there exists an SMIL file, pre-parsing the SMIL file, obtaining the number of non-SMIL files described by the SMIL file, counting the number as a second non-SMIL file number, and executing step C; C: determining whether the first non-SMIL file number is equal to the second non-SMIL file number, when they are not equal, executing step D; D: constructing an SMIL file according to all the non-SMIL files obtained in step A and taking the constructed SMIL file as a formal SMIL file to be parsed; E: integrally parsing the formal SMIL file to be parsed, obtaining a data structure describing a playing layout of MMS, taking the obtained data structure and all the non-SMIL files obtained in step A as an MMS decoding result. 31. The method according to claim 26 , wherein the data structure describing a playing layout of MMS is a slide sequence structure.
| 0.868209 |
10,127,229 | 1 | 8 |
1. A computer-based method of reclassifying and clustering electronic documents of a document corpus to improve classification of the electronic documents so that correct documents are returned as a result of a computer-based search, the method comprising: comparing, by a computer, each individual electronic document in the document corpus with each other electronic document in the document corpus, thereby forming document pairs, wherein the electronic documents of the document pairs are compared by: calculating a similarity value with respect to the electronic documents of a document pair from a plurality of attributes of the electronic documents in the document corpus, the plurality of attributes comprising a citation attribute, a text-based attribute, and one or more of the following attributes: an author attribute expressed as s ( p , q ) = number of common authors number of distinct authors , a publication attribute, an institution attribute expressed as s ( p , q ) = number of common institutions number of distinct institutions , a downloads attribute expressed as s ( p , q ) = number of downloads of two documents in a same time period total number of downloads of two documents , and a clustering results attribute expressed as s ( p , q ) = number of common clusters total number of clusters , wherein the calculating comprises: calculating a similarity vector S (p,q) for each document pair in the document corpus, wherein the similarity vector S (p,q) is expressed by: S _ ( p , q ) = ( s ( p , q ) 1 ⋮ s ( p , q ) n ) , where s(p,q) is a similarity measure of a first electronic document p to a second electronic document q of the document pair with respect to an individual attribute of the plurality of attributes; and calculating the similarity value for each document pair comprises summing weighted individual similarity measures of the similarity vector S (p,q) such that the similarity value is expressed by: S ( p , q ) = ∑ i w i s ( p , q ) i where w i is a weighting factor for each attribute i of the plurality of attributes; and associating the similarity value with both electronic documents of the document pair; generating a plurality of hierarchical clusters by applying a clustering algorithm to the document corpus using the similarity values; organizing documents into the plurality of hierarchical clusters by saving metadata associated with each individual electronic document in the document corpus and each of the plurality of hierarchical clusters to which each individual electronic document in the document corpus has been assigned such that each individual electronic document is reclassified in a new classification according to the hierarchical cluster; and providing the documents in the plurality of hierarchical clusters such that, when the computer-based search is completed, the computer-based search searches the document corpus and the results are derived from the saved metadata and are graphically presented at a user computing device as a plurality of dots, each dot in the plurality of dots corresponding to each electronic document of the document corpus, the plurality of dots arranged according to the plurality of hierarchical clusters.
|
1. A computer-based method of reclassifying and clustering electronic documents of a document corpus to improve classification of the electronic documents so that correct documents are returned as a result of a computer-based search, the method comprising: comparing, by a computer, each individual electronic document in the document corpus with each other electronic document in the document corpus, thereby forming document pairs, wherein the electronic documents of the document pairs are compared by: calculating a similarity value with respect to the electronic documents of a document pair from a plurality of attributes of the electronic documents in the document corpus, the plurality of attributes comprising a citation attribute, a text-based attribute, and one or more of the following attributes: an author attribute expressed as s ( p , q ) = number of common authors number of distinct authors , a publication attribute, an institution attribute expressed as s ( p , q ) = number of common institutions number of distinct institutions , a downloads attribute expressed as s ( p , q ) = number of downloads of two documents in a same time period total number of downloads of two documents , and a clustering results attribute expressed as s ( p , q ) = number of common clusters total number of clusters , wherein the calculating comprises: calculating a similarity vector S (p,q) for each document pair in the document corpus, wherein the similarity vector S (p,q) is expressed by: S _ ( p , q ) = ( s ( p , q ) 1 ⋮ s ( p , q ) n ) , where s(p,q) is a similarity measure of a first electronic document p to a second electronic document q of the document pair with respect to an individual attribute of the plurality of attributes; and calculating the similarity value for each document pair comprises summing weighted individual similarity measures of the similarity vector S (p,q) such that the similarity value is expressed by: S ( p , q ) = ∑ i w i s ( p , q ) i where w i is a weighting factor for each attribute i of the plurality of attributes; and associating the similarity value with both electronic documents of the document pair; generating a plurality of hierarchical clusters by applying a clustering algorithm to the document corpus using the similarity values; organizing documents into the plurality of hierarchical clusters by saving metadata associated with each individual electronic document in the document corpus and each of the plurality of hierarchical clusters to which each individual electronic document in the document corpus has been assigned such that each individual electronic document is reclassified in a new classification according to the hierarchical cluster; and providing the documents in the plurality of hierarchical clusters such that, when the computer-based search is completed, the computer-based search searches the document corpus and the results are derived from the saved metadata and are graphically presented at a user computing device as a plurality of dots, each dot in the plurality of dots corresponding to each electronic document of the document corpus, the plurality of dots arranged according to the plurality of hierarchical clusters. 8. The computer-based method of claim 1 , further comprising extracting sample keywords from electronic documents within each cluster of the plurality of hierarchical clusters, and associating the sample keywords with each cluster.
| 0.686992 |
9,679,155 | 13 | 14 |
13. The system of claim 8 , wherein the network proxy server is further configured to determine the character type of the search term and to pad one or more trailing characters to the search term using the maximum possible value associated with the character type of the search term.
|
13. The system of claim 8 , wherein the network proxy server is further configured to determine the character type of the search term and to pad one or more trailing characters to the search term using the maximum possible value associated with the character type of the search term. 14. The system of claim 13 , wherein the network proxy server is further configured to pad one or more trailing characters to the search term using the maximum possible value associated with the character type of the search term based on the ASCII values assigned to the character type.
| 0.5 |
7,917,398 | 1 | 22 |
1. A method of illustrating where at least one ticket is located in an event venue, comprising: presenting, by a web browser of a client computing device, a filter module for allowing a user to perform a search of tickets listed for sale by a ticket service hosted by a web site; accepting, at the filter module, event criteria for at least one ticket and at least one event; accepting, at the filter module, price criteria for the at least one ticket and the at least one event; calling, by the filter module, an application programming interface of a mediator application executing in the web browser; constructing, by the mediator application, a request for filtering tickets by criteria based on the event criteria and the price criteria accepted at the filter module; sending the request for filtering tickets by criteria to the ticket service; receiving, at the mediator application, data representing a filtered ticket set meeting the event criteria and the price criteria from the ticket service; displaying, by the web browser, an interactive graphics-based event venue map illustrating a location of all sections at an event venue with at least one ticket meeting the event criteria and the price criteria, the interactive graphics-based event venue map being displayed at a size corresponding to a minimum zoom level; receiving, at the interactive graphics-based event venue map, input from the user to increase the size of the interactive graphics-based event venue map; presenting, by the interactive graphics-based event venue map, a dragger feature for allowing the user to move the interactive graphics-based event venue map if the size of the interactive graphics-based event venue map is increased from the minimum zoom level by at least a predetermined amount; accepting, at the interactive graphics-based event venue map, section selection criteria in response to the user selecting at least one section from the interactive graphics-based event venue map; calling, by the interactive graphics-based event venue map, the application programming interface of the mediator application executing in the web browser; constructing, by the mediator application, a request for retrieving tickets by section based on the section selection criteria accepted at the interactive graphics-based venue map; sending the request for retrieving tickets by section to the ticket service; receiving, from the ticket service at the mediator application, data representing tickets of the filtered ticket set that meet the section selection criteria; and displaying ticket information in a web browsing language comprising a ticket listing corresponding to the tickets of the filtered ticket set that meet the section selection criteria, the displayed ticket information in the web browsing language allowing the user to drill down to a specific ticket in the ticket listing, causing a location of the specific ticket to be displayed in the interactive graphics-based event venue map.
|
1. A method of illustrating where at least one ticket is located in an event venue, comprising: presenting, by a web browser of a client computing device, a filter module for allowing a user to perform a search of tickets listed for sale by a ticket service hosted by a web site; accepting, at the filter module, event criteria for at least one ticket and at least one event; accepting, at the filter module, price criteria for the at least one ticket and the at least one event; calling, by the filter module, an application programming interface of a mediator application executing in the web browser; constructing, by the mediator application, a request for filtering tickets by criteria based on the event criteria and the price criteria accepted at the filter module; sending the request for filtering tickets by criteria to the ticket service; receiving, at the mediator application, data representing a filtered ticket set meeting the event criteria and the price criteria from the ticket service; displaying, by the web browser, an interactive graphics-based event venue map illustrating a location of all sections at an event venue with at least one ticket meeting the event criteria and the price criteria, the interactive graphics-based event venue map being displayed at a size corresponding to a minimum zoom level; receiving, at the interactive graphics-based event venue map, input from the user to increase the size of the interactive graphics-based event venue map; presenting, by the interactive graphics-based event venue map, a dragger feature for allowing the user to move the interactive graphics-based event venue map if the size of the interactive graphics-based event venue map is increased from the minimum zoom level by at least a predetermined amount; accepting, at the interactive graphics-based event venue map, section selection criteria in response to the user selecting at least one section from the interactive graphics-based event venue map; calling, by the interactive graphics-based event venue map, the application programming interface of the mediator application executing in the web browser; constructing, by the mediator application, a request for retrieving tickets by section based on the section selection criteria accepted at the interactive graphics-based venue map; sending the request for retrieving tickets by section to the ticket service; receiving, from the ticket service at the mediator application, data representing tickets of the filtered ticket set that meet the section selection criteria; and displaying ticket information in a web browsing language comprising a ticket listing corresponding to the tickets of the filtered ticket set that meet the section selection criteria, the displayed ticket information in the web browsing language allowing the user to drill down to a specific ticket in the ticket listing, causing a location of the specific ticket to be displayed in the interactive graphics-based event venue map. 22. The method of claim 1 , wherein the interactive graphics-based event venue map is a FLASH-based event venue map.
| 0.880165 |
8,538,842 | 18 | 19 |
18. The system of claim 17 wherein the brand earnings determination module additionally calculates brand economic earnings by applying a charge to the branded profit for capital employed in creating, hosting and maintaining the domain name portfolio.
|
18. The system of claim 17 wherein the brand earnings determination module additionally calculates brand economic earnings by applying a charge to the branded profit for capital employed in creating, hosting and maintaining the domain name portfolio. 19. The system of claim 18 wherein the brand earnings determination module additionally calculates brand earnings, wherein by applying the first role of brand index to the brand economic earnings.
| 0.5 |
8,914,279 | 12 | 14 |
12. A computing device, comprising: at least one processor; and a non-transitory computer-readable storage medium storing executable computer program code, the at least one processor configured to execute the executable computer program code to perform operations including: receiving a sentence including one or more words; determining an index set of possible head-modifier dependencies for the sentence, the index set including inner arcs and outer arcs, the inners arcs representing possible head-modifier dependency between words in the sentence separated by a first distance less than or equal to a distance threshold and outer arcs representing possible head-modifier dependency between words in the sentence separated by a second distance greater than the distance threshold; pruning the index set based on an augmented vine parsing algorithm to obtain a first pruned index set, the first pruned index set including: (i) each specific inner arc when a likelihood that the specific inner arc is appropriate is greater than a first threshold, and (ii) the outer arcs when a likelihood that there exists any possible outer arc that is appropriate is greater than the first threshold; pruning the first pruned index set based on a second parsing algorithm to obtain a second pruned index set; determining a most-likely parse for the sentence from the second pruned index set; and outputting the most-likely parse.
|
12. A computing device, comprising: at least one processor; and a non-transitory computer-readable storage medium storing executable computer program code, the at least one processor configured to execute the executable computer program code to perform operations including: receiving a sentence including one or more words; determining an index set of possible head-modifier dependencies for the sentence, the index set including inner arcs and outer arcs, the inners arcs representing possible head-modifier dependency between words in the sentence separated by a first distance less than or equal to a distance threshold and outer arcs representing possible head-modifier dependency between words in the sentence separated by a second distance greater than the distance threshold; pruning the index set based on an augmented vine parsing algorithm to obtain a first pruned index set, the first pruned index set including: (i) each specific inner arc when a likelihood that the specific inner arc is appropriate is greater than a first threshold, and (ii) the outer arcs when a likelihood that there exists any possible outer arc that is appropriate is greater than the first threshold; pruning the first pruned index set based on a second parsing algorithm to obtain a second pruned index set; determining a most-likely parse for the sentence from the second pruned index set; and outputting the most-likely parse. 14. The computing device of claim 12 , wherein the operations further include pruning the outer arcs to exclude arcs representing possible head-modifier dependency between words in the sentence separated by a distance greater than a second distance threshold before pruning the index set based on the augmented vine parsing algorithm.
| 0.628889 |
9,430,583 | 10 | 14 |
10. A computer-readable storage medium having contents configured to cause a computing system to perform a method for extracting a portion of a selected hierarchical document, the selected hierarchical document comprised of nodes in an arrangement in which a node may be a descendent of another node, each node having a type, a node and all of its descendent nodes collectively constituting a subtree of the document hierarchy, the method comprising: generating a list of nodes in a rendered version of a subject web page, each node having a respective location score having a value identical to other location scores of each node in the list; determining a location of a pointer displayed in relation to the rendered version of the subject web page according to scrolling adjusted coordinates of the displayed pointer, the location indicating a first node of the list of nodes, the first node having a first location score reduced by a factor; for each node of the list of nodes, updating the respective location score, the updated respective location score for each node having an updated value based on a distance of the pointer from a corner associated with the node and a square root of an area of the node; selecting, based on a lowest updated value of the updated respective locations, one of the nodes of the document hierarchy as the root of a subtree of the document hierarchy that corresponds to the portion to be extracted; establishing a reset node comprising a stylesheet specifying a predetermined standardized set of formatting attribute values inheritable by descendents of the reset node; for each of one or more of the nodes of the subtree defined by the selected node of the document hierarchy: establishing a descendent of the reset node having the same type as the node of the subtree; for each of a plurality of formatting attributes, determining calculated values of the formatting attributes in both the descendent of the reset node and the node of the subtree, the determined calculated value of the formatting attribute in the descendant of the reset node being inherited from the predetermined standardized set of formatting attribute values; for one or more of the plurality of formatting attributes, determining that the calculated value of the formatting attribute in the descendent of the reset node does not match the calculated value of the formatting attribute in the node of the subtree; and for only those formatting attributes of the plurality of formatting attributes for which the determined calculated value of the formatting attribute in the descendent of the reset node does not match the determined calculated value of the formatting attribute in the node of the subtree, explicitly specifying for the formatting attribute in the descendent of the reset node the determined calculated value of the formatting attribute in the node of the subtree.
|
10. A computer-readable storage medium having contents configured to cause a computing system to perform a method for extracting a portion of a selected hierarchical document, the selected hierarchical document comprised of nodes in an arrangement in which a node may be a descendent of another node, each node having a type, a node and all of its descendent nodes collectively constituting a subtree of the document hierarchy, the method comprising: generating a list of nodes in a rendered version of a subject web page, each node having a respective location score having a value identical to other location scores of each node in the list; determining a location of a pointer displayed in relation to the rendered version of the subject web page according to scrolling adjusted coordinates of the displayed pointer, the location indicating a first node of the list of nodes, the first node having a first location score reduced by a factor; for each node of the list of nodes, updating the respective location score, the updated respective location score for each node having an updated value based on a distance of the pointer from a corner associated with the node and a square root of an area of the node; selecting, based on a lowest updated value of the updated respective locations, one of the nodes of the document hierarchy as the root of a subtree of the document hierarchy that corresponds to the portion to be extracted; establishing a reset node comprising a stylesheet specifying a predetermined standardized set of formatting attribute values inheritable by descendents of the reset node; for each of one or more of the nodes of the subtree defined by the selected node of the document hierarchy: establishing a descendent of the reset node having the same type as the node of the subtree; for each of a plurality of formatting attributes, determining calculated values of the formatting attributes in both the descendent of the reset node and the node of the subtree, the determined calculated value of the formatting attribute in the descendant of the reset node being inherited from the predetermined standardized set of formatting attribute values; for one or more of the plurality of formatting attributes, determining that the calculated value of the formatting attribute in the descendent of the reset node does not match the calculated value of the formatting attribute in the node of the subtree; and for only those formatting attributes of the plurality of formatting attributes for which the determined calculated value of the formatting attribute in the descendent of the reset node does not match the determined calculated value of the formatting attribute in the node of the subtree, explicitly specifying for the formatting attribute in the descendent of the reset node the determined calculated value of the formatting attribute in the node of the subtree. 14. The computer-readable storage medium of claim 10 wherein the reset node is established in the document hierarchy of a hierarchical document other than the selected hierarchical document.
| 0.586957 |
8,347,391 | 11 | 16 |
11. A networking device for detecting a network activity of interest, comprising: a network port for connecting to a network infrastructure, wherein the network port is adapted to obtain a plurality of network packets, wherein the obtained plurality of network packets comprises network packets categorized as Transmission Control Protocol (TCP) packets and Internet Protocol (IP) packets, wherein the obtained plurality of network packets include the network activity of interest; a processor connected to the network port, wherein the processor is adapted to: create a plurality of combined packets, from at least a subset of the plurality of TCP packets and IP packets, wherein: a first combined packet of the plurality of combined packets comprises a portion of at least one of the TCP packets and a portion of at least one of the IP packets, and a second combined packet of the plurality of combined packets comprises a portion of at least one of the TCP packets and a portion of at least one of the IP packets, wherein the second combined packet is different from the first combined packet; create a first sequence by converting bitwise content of at least a portion of the first combined packet into a first plurality of integers, wherein the first sequence includes the first plurality of integers; create a second sequence by converting bitwise content of at least a portion of the second combined packet into a second plurality of integers, wherein the second sequence includes the second plurality of integers; determine a similarity metric between the first sequence and the second sequence based on a distance function; create a third sequence based on the similarity metric, wherein the third sequence comprises a third plurality of integers common to the first sequence and the second sequence, in the first order; and create a fourth sequence, wherein the fourth sequence is a meta-expression that: comprises a subset of the third plurality of integers of the third list, in the first order, and corresponds to the presence of the network activity of interest in the network traffic; and a memory connected to the processor, wherein the memory is adapted to store the meta-expression, wherein the stored meta-expression is used to detect the presence of the network activity of interest.
|
11. A networking device for detecting a network activity of interest, comprising: a network port for connecting to a network infrastructure, wherein the network port is adapted to obtain a plurality of network packets, wherein the obtained plurality of network packets comprises network packets categorized as Transmission Control Protocol (TCP) packets and Internet Protocol (IP) packets, wherein the obtained plurality of network packets include the network activity of interest; a processor connected to the network port, wherein the processor is adapted to: create a plurality of combined packets, from at least a subset of the plurality of TCP packets and IP packets, wherein: a first combined packet of the plurality of combined packets comprises a portion of at least one of the TCP packets and a portion of at least one of the IP packets, and a second combined packet of the plurality of combined packets comprises a portion of at least one of the TCP packets and a portion of at least one of the IP packets, wherein the second combined packet is different from the first combined packet; create a first sequence by converting bitwise content of at least a portion of the first combined packet into a first plurality of integers, wherein the first sequence includes the first plurality of integers; create a second sequence by converting bitwise content of at least a portion of the second combined packet into a second plurality of integers, wherein the second sequence includes the second plurality of integers; determine a similarity metric between the first sequence and the second sequence based on a distance function; create a third sequence based on the similarity metric, wherein the third sequence comprises a third plurality of integers common to the first sequence and the second sequence, in the first order; and create a fourth sequence, wherein the fourth sequence is a meta-expression that: comprises a subset of the third plurality of integers of the third list, in the first order, and corresponds to the presence of the network activity of interest in the network traffic; and a memory connected to the processor, wherein the memory is adapted to store the meta-expression, wherein the stored meta-expression is used to detect the presence of the network activity of interest. 16. The networking device of claim 11 , wherein: the integers of the fourth sequence appear, in the first order, in at least a predetermined frequency among the plurality of combined packets, and wherein the frequency is between 80-90% percent, inclusive.
| 0.787145 |
10,146,672 | 6 | 9 |
6. A system ( 102 ) for automated User Interface (UI) testing through model driven techniques comprising a processor ( 202 ) and memory ( 206 ) coupled to said processor, the system comprising: a selection module ( 210 ) configured to select a UI model; a test case model creation module ( 212 ) configured to create a test case model for the selected UI model and populate the created test case model into a test case editor ( 222 ) wherein the test case model is created as a sequence of UI Actions based on a structure pattern of the selected UI model; a validation module ( 214 ) configured to validate the test case model for the selected UI model; a script generation module ( 216 ) configured to generate a test case script from the test case model for the selected UI model.
|
6. A system ( 102 ) for automated User Interface (UI) testing through model driven techniques comprising a processor ( 202 ) and memory ( 206 ) coupled to said processor, the system comprising: a selection module ( 210 ) configured to select a UI model; a test case model creation module ( 212 ) configured to create a test case model for the selected UI model and populate the created test case model into a test case editor ( 222 ) wherein the test case model is created as a sequence of UI Actions based on a structure pattern of the selected UI model; a validation module ( 214 ) configured to validate the test case model for the selected UI model; a script generation module ( 216 ) configured to generate a test case script from the test case model for the selected UI model. 9. The system of claim 6 wherein validation comprises assessing the test case model based on a rule engine ( 220 ) such that the rule engine comprises a set of predefined rules.
| 0.744957 |
8,594,384 | 1 | 4 |
1. A method that assesses character-rendering quality, the method comprising: transmitting a test-character set of test characters to a character-rendering device for rendering; intercepting digital pixel-based character maps for the test characters of the test-character set, used by the character-rendering device for rendering the test characters, to serve as an input-character set of input characters; capturing, with a computing system, the test characters rendered by the character-rendering device to serve as an output-character set of output characters; for each input character, generating with the computing system, from the intercepted input characters, one or more first metrics that reflect differences between the input character and at least two of the input characters; for each output character, generating with the computing system, from the intercepted input characters and the captured output characters, one or more second metrics that reflect differences between the output character and at least two of the input characters; and outputting one or more indications of character-rendering quality based on the first and second metrics.
|
1. A method that assesses character-rendering quality, the method comprising: transmitting a test-character set of test characters to a character-rendering device for rendering; intercepting digital pixel-based character maps for the test characters of the test-character set, used by the character-rendering device for rendering the test characters, to serve as an input-character set of input characters; capturing, with a computing system, the test characters rendered by the character-rendering device to serve as an output-character set of output characters; for each input character, generating with the computing system, from the intercepted input characters, one or more first metrics that reflect differences between the input character and at least two of the input characters; for each output character, generating with the computing system, from the intercepted input characters and the captured output characters, one or more second metrics that reflect differences between the output character and at least two of the input characters; and outputting one or more indications of character-rendering quality based on the first and second metrics. 4. The method of claim 1 wherein test characters include: graphical symbols; English-language text characters; punctuation symbols; foreign-language text characters; and pixel patterns.
| 0.849593 |
8,412,524 | 1 | 6 |
1. A computer-implemented method for use with a document tangibly stored in a first computer-readable medium, the method comprising: (A) accessing the first computer-readable medium to identify a first phrase within the document, the first phrase representing a first written form of a concept; (B) identifying a plurality of phrases tangibly stored in a second computer-readable medium, each of the plurality of phrases representing an alternative written form of the concept; (C) displaying at least some of the plurality of phrases to a user; and (D) receiving, from the user, an instruction to -replace the first phrase with one of the plurality of phrases in the document on the first computer-readable medium, wherein the instruction does not include the one of the plurality of phrases.
|
1. A computer-implemented method for use with a document tangibly stored in a first computer-readable medium, the method comprising: (A) accessing the first computer-readable medium to identify a first phrase within the document, the first phrase representing a first written form of a concept; (B) identifying a plurality of phrases tangibly stored in a second computer-readable medium, each of the plurality of phrases representing an alternative written form of the concept; (C) displaying at least some of the plurality of phrases to a user; and (D) receiving, from the user, an instruction to -replace the first phrase with one of the plurality of phrases in the document on the first computer-readable medium, wherein the instruction does not include the one of the plurality of phrases. 6. The method of claim 1 , wherein (C) comprises displaying a single of the plurality of phrases to the user.
| 0.793561 |
8,060,463 | 1 | 2 |
1. A computer-implemented method of matching users to other users, the method comprising: storing, in computer storage, event data comprising order data reflective of items ordered from an electronic catalog by each of a plurality of users; programmatically generating a score that reflects a degree to which item preferences of a first user of said plurality of users are similar to item preferences of a second user of said plurality of users, said score taking into consideration a first plurality of items ordered by the first user and a second plurality of items ordered by the second user, wherein generating the score comprises weighting a first item and a second item identified in both the first and second plurality of items, wherein the first and second items are different, wherein the first and second items are weighted differently based at least in part on a first inherent characteristic of the first item and a second inherent characteristic of the second item, wherein the first and second inherent characteristics are different, and wherein generating the score further comprises taking into consideration at least one additional type of event data reflective of user affinities for items represented in the electronic catalog; and based at least in part on the score, programmatically determining whether to recommend the second user to the first user.
|
1. A computer-implemented method of matching users to other users, the method comprising: storing, in computer storage, event data comprising order data reflective of items ordered from an electronic catalog by each of a plurality of users; programmatically generating a score that reflects a degree to which item preferences of a first user of said plurality of users are similar to item preferences of a second user of said plurality of users, said score taking into consideration a first plurality of items ordered by the first user and a second plurality of items ordered by the second user, wherein generating the score comprises weighting a first item and a second item identified in both the first and second plurality of items, wherein the first and second items are different, wherein the first and second items are weighted differently based at least in part on a first inherent characteristic of the first item and a second inherent characteristic of the second item, wherein the first and second inherent characteristics are different, and wherein generating the score further comprises taking into consideration at least one additional type of event data reflective of user affinities for items represented in the electronic catalog; and based at least in part on the score, programmatically determining whether to recommend the second user to the first user. 2. The method of claim 1 , wherein the score reflects a degree to which the first plurality of items and the second plurality of items are related.
| 0.914435 |
8,782,081 | 7 | 9 |
7. A system for generating a database query based on a query template comprising a plurality of query language keywords, a plurality of variables, and a plurality of template-tokens, the system comprising: means for receiving one or more values each associated with a respective one of the plurality of variables; and means for transforming the query template into the database query based on the one or more values, the plurality of variables, and the plurality of template-tokens, wherein the template-tokens include an optional-section token defining a query-template-section and associated with one or more of the plurality of variables, and the means for transforming the template query into the database query comprises: means for processing each of said plurality of template-tokens, said means for processing performing processing including determining whether the template-token being processed is an optional-section token; in response to a determination that the template-token being processed is not an optional-section-token, replacing the token with a portion of a database query; and in response to a determination that the template-token being processed is an optional-section token, determining whether all of said plurality of variables associated with the query-template section are associated with a null value; means for replacing the token with a portion of a database query based on a value of one or more variables from among said plurality of variables associated with the query-template section in response to determining that not all of said plurality of variables associated with the query-template section are associated with a null value; and means for omitting the query-template-section from the database query in response to determining that all of said plurality of variables associated with the query-template section are associated with a null value.
|
7. A system for generating a database query based on a query template comprising a plurality of query language keywords, a plurality of variables, and a plurality of template-tokens, the system comprising: means for receiving one or more values each associated with a respective one of the plurality of variables; and means for transforming the query template into the database query based on the one or more values, the plurality of variables, and the plurality of template-tokens, wherein the template-tokens include an optional-section token defining a query-template-section and associated with one or more of the plurality of variables, and the means for transforming the template query into the database query comprises: means for processing each of said plurality of template-tokens, said means for processing performing processing including determining whether the template-token being processed is an optional-section token; in response to a determination that the template-token being processed is not an optional-section-token, replacing the token with a portion of a database query; and in response to a determination that the template-token being processed is an optional-section token, determining whether all of said plurality of variables associated with the query-template section are associated with a null value; means for replacing the token with a portion of a database query based on a value of one or more variables from among said plurality of variables associated with the query-template section in response to determining that not all of said plurality of variables associated with the query-template section are associated with a null value; and means for omitting the query-template-section from the database query in response to determining that all of said plurality of variables associated with the query-template section are associated with a null value. 9. The system of claim 7 , wherein the template-tokens include a restriction-token having a default value and associated with a respective one of the plurality of variables, and the means for transforming the query template into the database query comprises: means for replacing the restriction-token with the default value in response to determining the respective one of the plurality of variables is not associated with a value.
| 0.5 |
7,586,654 | 16 | 18 |
16. A facsimile machine including a device for annotating a document on a scanner while generating an electronic representation of that document, said device comprising: means for generating an electronic representation of a hardcopy document; means for receiving material to be added to a scanned document from a user; means for adding said material to said electronic representation of the hardcopy document to produce an annotated electronic document; means for transmitting by facsimile said annotated electronic document; means for printing a hardcopy of said annotated electronic document; a single device housing for containing and supporting all of said means; means for displaying an image of the hardcopy document while said means for receiving material to be added are being operated; means for entering said material at any particular point on the displayed image of the hardcopy document; and means for adding said material to a corresponding location within said annotated electronic document.
|
16. A facsimile machine including a device for annotating a document on a scanner while generating an electronic representation of that document, said device comprising: means for generating an electronic representation of a hardcopy document; means for receiving material to be added to a scanned document from a user; means for adding said material to said electronic representation of the hardcopy document to produce an annotated electronic document; means for transmitting by facsimile said annotated electronic document; means for printing a hardcopy of said annotated electronic document; a single device housing for containing and supporting all of said means; means for displaying an image of the hardcopy document while said means for receiving material to be added are being operated; means for entering said material at any particular point on the displayed image of the hardcopy document; and means for adding said material to a corresponding location within said annotated electronic document. 18. The machine of claim 16 , wherein said means for receiving material to be added to the scanned document comprise a touch screen.
| 0.7 |
9,519,638 | 15 | 16 |
15. A system comprising: one or more processors; and a memory storing instructions that, when executed by at least one of the one or more processors, cause the system to: receive social feed data, the social feed data configured to cause a client device of a first user to display a social feed in a first language; determine a location of the client device displaying the social feed; receive a user identifier of the first user; parse the social feed data based on the user identifier to determine a social activity of the first user; parse the social feed data based on relationships of the first user to identify a first portion of the social feed that has been acted on by one or more users having a particular type of relationship with the first user; determine a second language based on the location and the social activity of the first user; translate the social feed data that is associated with the first portion of the social feed so that the translated social feed data causes the client device to display the first portion translated from the first language into the second language; and transmit the translated social feed data to the client device.
|
15. A system comprising: one or more processors; and a memory storing instructions that, when executed by at least one of the one or more processors, cause the system to: receive social feed data, the social feed data configured to cause a client device of a first user to display a social feed in a first language; determine a location of the client device displaying the social feed; receive a user identifier of the first user; parse the social feed data based on the user identifier to determine a social activity of the first user; parse the social feed data based on relationships of the first user to identify a first portion of the social feed that has been acted on by one or more users having a particular type of relationship with the first user; determine a second language based on the location and the social activity of the first user; translate the social feed data that is associated with the first portion of the social feed so that the translated social feed data causes the client device to display the first portion translated from the first language into the second language; and transmit the translated social feed data to the client device. 16. The system of claim 15 , wherein to parse the social feed data based on the relationships of the first user, the instructions further cause the system to determine a social context for translating the social feed data, the social context identifying the one or more users that acted on the first portion of the social feed and a second user that acted upon a second portion of the social feed, the one or more users and the second user having the relationships with the first user on a social graph.
| 0.5 |
8,721,339 | 1 | 14 |
1. A method for evaluating a point of originality in a single piece of writing through the identification of original content in the writing, the method comprising: (a) submitting the single piece of writing to a processing system; (b) inputting a first query term, wherein the first query terms is one of a single word or a compound phrase; (c) generating lexical terms from the first query terms; (d) constructing a first matrix of conceptual-semantic and lexical relationships based upon the lexical terms generated from the first query term; (e) searching the writing for terms which appear in the first matrix; and (f) computing an originality estimate value for each of the terms in the writing which match one or more terms in the first matrix, wherein the originality estimate value is based upon the lexical relationships between the terms in the writing and the terms in the first matrix; (g) computing a point of originality score; and (h) presenting the point of originality score on a timeline graph, wherein the timeline graph depicts the evolution of point of originality scores for a particular person over a period of time.
|
1. A method for evaluating a point of originality in a single piece of writing through the identification of original content in the writing, the method comprising: (a) submitting the single piece of writing to a processing system; (b) inputting a first query term, wherein the first query terms is one of a single word or a compound phrase; (c) generating lexical terms from the first query terms; (d) constructing a first matrix of conceptual-semantic and lexical relationships based upon the lexical terms generated from the first query term; (e) searching the writing for terms which appear in the first matrix; and (f) computing an originality estimate value for each of the terms in the writing which match one or more terms in the first matrix, wherein the originality estimate value is based upon the lexical relationships between the terms in the writing and the terms in the first matrix; (g) computing a point of originality score; and (h) presenting the point of originality score on a timeline graph, wherein the timeline graph depicts the evolution of point of originality scores for a particular person over a period of time. 14. The method of claim 1 wherein the first query term is substantially related to the concept being monitored in the writing.
| 0.848921 |
8,214,390 | 1 | 7 |
1. A computer-executed method comprising: detecting first activity, of a user associated with a particular entity, said first activity related to a first topic of a set of topics; in response to detecting the first activity, modifying a first subset of bits, of a first set of bits associated with the particular entity, to reflect the first activity related to the first topic; detecting second activity of the user, said second activity related to a second topic of the set of topics; in response to detecting the second activity, modifying a second subset of bits, of the first set of bits, to reflect the second activity related to the second topic; wherein the first subset of bits is distinct from the second subset of bits; wherein the position of each bit of the first subset of bits indicates which topic of the set of topics that the first subset of bits reflects; wherein the position of each bit of the second subset of bits indicates which topic of the set of topics that the second subset of bits reflects; wherein a quantity of the first subset of bits is different than a quantity of the second subset of bits; determining a value for the first topic based, at least in part, on the first subset of bits: dividing the value for the first topic by a range of values that can be represented by the first subset of bits, to produce a normalized value for the first topic; selecting a particular content item from a plurality of available content items based at least in part on the first set of bits; and wherein the step of selecting the particular content item from the plurality of available content items further comprises selecting the particular content item based, at least in part, on the normalized value for the first topic; displaying the particular content item; and wherein the method is performed by one or more computing devices.
|
1. A computer-executed method comprising: detecting first activity, of a user associated with a particular entity, said first activity related to a first topic of a set of topics; in response to detecting the first activity, modifying a first subset of bits, of a first set of bits associated with the particular entity, to reflect the first activity related to the first topic; detecting second activity of the user, said second activity related to a second topic of the set of topics; in response to detecting the second activity, modifying a second subset of bits, of the first set of bits, to reflect the second activity related to the second topic; wherein the first subset of bits is distinct from the second subset of bits; wherein the position of each bit of the first subset of bits indicates which topic of the set of topics that the first subset of bits reflects; wherein the position of each bit of the second subset of bits indicates which topic of the set of topics that the second subset of bits reflects; wherein a quantity of the first subset of bits is different than a quantity of the second subset of bits; determining a value for the first topic based, at least in part, on the first subset of bits: dividing the value for the first topic by a range of values that can be represented by the first subset of bits, to produce a normalized value for the first topic; selecting a particular content item from a plurality of available content items based at least in part on the first set of bits; and wherein the step of selecting the particular content item from the plurality of available content items further comprises selecting the particular content item based, at least in part, on the normalized value for the first topic; displaying the particular content item; and wherein the method is performed by one or more computing devices. 7. The computer-executed method of claim 1 , further comprising: determining a privacy setting for the particular entity; and based on the privacy setting, performing one of: discarding the first set of bits, and overwriting each bit of the first set of bits with zero.
| 0.818977 |
7,711,685 | 9 | 13 |
9. A system for providing an extensible macro language, comprising: a macro handler comprising a macro processor operable to maintain, in a repository, a predefined macro language comprising a plurality of keywords and a plurality of associated commands for execution; a parser operable to parse a macro language expression to identify a new keyword in the macro language expression that is not within the plurality of keywords in the predefined macro language; and a registry of keywords and associated executable codes, including one or more keywords and one or more executable codes that are not included in the predefined macro language, each keyword being associated with a respective one of the executable codes, each executable code corresponding to a procedure that is not performed by the execution of the predefined macro language alone, wherein the macro handler is further operable to receive the new keyword from the parser, retrieve, from the registry of keywords and associated executable codes, the executable code associated with the new keyword identified within the macro language expression, and execute the retrieved executable code to run the extended macro command associated with the new keyword without recompiling the macro language, the executable code associated with the new keyword not included in the predefined macro language and resulting in the performance of a procedure that is not performed by execution of the predefined macro language alone.
|
9. A system for providing an extensible macro language, comprising: a macro handler comprising a macro processor operable to maintain, in a repository, a predefined macro language comprising a plurality of keywords and a plurality of associated commands for execution; a parser operable to parse a macro language expression to identify a new keyword in the macro language expression that is not within the plurality of keywords in the predefined macro language; and a registry of keywords and associated executable codes, including one or more keywords and one or more executable codes that are not included in the predefined macro language, each keyword being associated with a respective one of the executable codes, each executable code corresponding to a procedure that is not performed by the execution of the predefined macro language alone, wherein the macro handler is further operable to receive the new keyword from the parser, retrieve, from the registry of keywords and associated executable codes, the executable code associated with the new keyword identified within the macro language expression, and execute the retrieved executable code to run the extended macro command associated with the new keyword without recompiling the macro language, the executable code associated with the new keyword not included in the predefined macro language and resulting in the performance of a procedure that is not performed by execution of the predefined macro language alone. 13. The system of claim 9 , wherein the registry of keywords comprises a table of keywords and associated macro commands.
| 0.846056 |
9,122,637 | 12 | 13 |
12. The system of claim 9 , wherein the enhancing module is programmed to enhance the result of the search query by: identifying a file identifier within the result of the search query; determining that the action performed by the user was performed on a file corresponding to the file identifier; and contextualizing the file identifier within the result of the search query with a representation of the action.
|
12. The system of claim 9 , wherein the enhancing module is programmed to enhance the result of the search query by: identifying a file identifier within the result of the search query; determining that the action performed by the user was performed on a file corresponding to the file identifier; and contextualizing the file identifier within the result of the search query with a representation of the action. 13. The system of claim 12 , wherein the enhancing module is further programmed to enhance the result of the search query by contextualizing the representation of the action within a sequence of actions performed by the user on the computing system.
| 0.599678 |
8,402,032 | 45 | 46 |
45. The computer storage medium of claim 39 , wherein: the operations further comprise determining a respective popularity score for each entity name in the plurality of name-context pairs; and the context-entity name data associates the entity names with the respective popularity scores.
|
45. The computer storage medium of claim 39 , wherein: the operations further comprise determining a respective popularity score for each entity name in the plurality of name-context pairs; and the context-entity name data associates the entity names with the respective popularity scores. 46. The computer storage medium of claim 45 , wherein the popularity score for an entity name is related to how often the entity name appears in the texts.
| 0.5 |
3,975,598 | 1 | 5 |
1. An apparatus for random access by an electron beam to analog data storage tracks, said apparatus comprising: target means having a recording of a plurality of spaced-apart storage tracks defining essentially permanent recordings of analog data; means developing an electron beam to scan along a storage track defined by said target means for producing an output electrical signal corresponding to the recordings of analog data; first control means to direct said electron beam onto only a selected one of said storage tracks defined by the target means; second control means to direct said electron beam along only the selected one of said storage tracks defined by the target means; means for oscillating said electron beam at a dither frequency having an amplitude corresponding essentially to the width of the selected one of said analog data storage tracks; and a digitally addressible control means coupled to said means for oscillating and said first and second control means to select and then scan along a storage track for producing an electrical signal corresponding to the recording of analog data, said digitally addressible control means enabling said first control means to direct said electron beam from track-to-track onto the selected one of said storage tracks, said digitally addressible control means further enabling said means for oscillating and said second control means to direct said electron beam along the storage track while the beam oscillates at the dither frequency and thereby scan the selected one of said storage tracks.
|
1. An apparatus for random access by an electron beam to analog data storage tracks, said apparatus comprising: target means having a recording of a plurality of spaced-apart storage tracks defining essentially permanent recordings of analog data; means developing an electron beam to scan along a storage track defined by said target means for producing an output electrical signal corresponding to the recordings of analog data; first control means to direct said electron beam onto only a selected one of said storage tracks defined by the target means; second control means to direct said electron beam along only the selected one of said storage tracks defined by the target means; means for oscillating said electron beam at a dither frequency having an amplitude corresponding essentially to the width of the selected one of said analog data storage tracks; and a digitally addressible control means coupled to said means for oscillating and said first and second control means to select and then scan along a storage track for producing an electrical signal corresponding to the recording of analog data, said digitally addressible control means enabling said first control means to direct said electron beam from track-to-track onto the selected one of said storage tracks, said digitally addressible control means further enabling said means for oscillating and said second control means to direct said electron beam along the storage track while the beam oscillates at the dither frequency and thereby scan the selected one of said storage tracks. 5. The apparatus according to claim 1 wherein said plurality of spaced-apart analog data storage tracks each comprise a variable width track lying below the surface of said target means and exposed to said electron beam.
| 0.73301 |
8,346,754 | 11 | 12 |
11. The method as recited in claim 8 , wherein the generation parameters for a given source further includes, a weight θ s associated with a relevance for the given source, the relevance indicating a quality of the given source to generate text instances that are related to the link URL, and a weight θ len associated with the length of the true title.
|
11. The method as recited in claim 8 , wherein the generation parameters for a given source further includes, a weight θ s associated with a relevance for the given source, the relevance indicating a quality of the given source to generate text instances that are related to the link URL, and a weight θ len associated with the length of the true title. 12. The method as recited in claim 11 , wherein computing a likelihood further includes, calculating the likelihood by multiplying the word probabilities for all the words in the source weighted by θ s and a length probability that the true title has the length of the candidate weighted by θ len .
| 0.5 |
9,870,715 | 16 | 17 |
16. A system for assessing cybersecurity training needs, comprising: a sensor that is configured to sense data corresponding to at least one action performed by a user with respect to a user computing device; a data storage device that stores a training needs model; a processor; and a computer-readable non-transitory memory containing programming instructions that are configured to cause the processor to: map the sensed data to the training needs model to determine whether the sensed data corresponds to a pattern associated with a threat scenario in the training needs model, in response to determining that the sensed data corresponds to a pattern associated with a threat scenario in the training needs model, identify a cybersecurity threat scenario for which the user is at risk, and use the training needs model to estimate susceptibility of the user to the cybersecurity threat scenario for which the user is at risk.
|
16. A system for assessing cybersecurity training needs, comprising: a sensor that is configured to sense data corresponding to at least one action performed by a user with respect to a user computing device; a data storage device that stores a training needs model; a processor; and a computer-readable non-transitory memory containing programming instructions that are configured to cause the processor to: map the sensed data to the training needs model to determine whether the sensed data corresponds to a pattern associated with a threat scenario in the training needs model, in response to determining that the sensed data corresponds to a pattern associated with a threat scenario in the training needs model, identify a cybersecurity threat scenario for which the user is at risk, and use the training needs model to estimate susceptibility of the user to the cybersecurity threat scenario for which the user is at risk. 17. The system of claim 16 further comprising: a memory containing a collection of available cybersecurity training actions; and additional programming instructions that are configured cause the processor to: access the collection of available cybersecurity training actions, based on the sensed data, the training needs model and the cybersecurity threat scenario, select a training action from the collection of available cybersecurity training actions, and cause the selected cybersecurity training action to be delivered to the user.
| 0.742322 |
8,364,631 | 1 | 3 |
1. A method of converting a first version of a database to a second version, including: determining the database version of the first version of the database based on a key obtained by taking a hash of the database schema of the database in the first version; determining available translation steps; using a processor to select a translation path from the first version of the database to the second version of the database, wherein the translation path includes a sequence of two or more translation steps that are a subset of the available translation steps, wherein the selected translation steps comprise a first selected translation step and a second selected translation step, each translation step being expressed in a markup language; and executing the selected translation steps in the translation path, wherein executing comprises: using the first selected translation step to convert the first version of the database to a third version of the database; and using the second selected translation step to convert the third version of the database to the second version of the database, wherein each of the first version of the database, the second version of the database, and the third version of the database is associated with a fully migrated version of the database, wherein the selecting of the translation path includes selecting one translation path from a plurality of translation paths based on either a shortest path or a first path, the third version of the database being different from each other for each of the translation paths.
|
1. A method of converting a first version of a database to a second version, including: determining the database version of the first version of the database based on a key obtained by taking a hash of the database schema of the database in the first version; determining available translation steps; using a processor to select a translation path from the first version of the database to the second version of the database, wherein the translation path includes a sequence of two or more translation steps that are a subset of the available translation steps, wherein the selected translation steps comprise a first selected translation step and a second selected translation step, each translation step being expressed in a markup language; and executing the selected translation steps in the translation path, wherein executing comprises: using the first selected translation step to convert the first version of the database to a third version of the database; and using the second selected translation step to convert the third version of the database to the second version of the database, wherein each of the first version of the database, the second version of the database, and the third version of the database is associated with a fully migrated version of the database, wherein the selecting of the translation path includes selecting one translation path from a plurality of translation paths based on either a shortest path or a first path, the third version of the database being different from each other for each of the translation paths. 3. A method as recited in claim 1 , wherein the second version is a new version of the database.
| 0.741935 |
9,348,902 | 33 | 34 |
33. The method of claim 32 , further comprising applying the set of validated contextual rules to a document of the plurality of documents in order to determine labels thereof.
|
33. The method of claim 32 , further comprising applying the set of validated contextual rules to a document of the plurality of documents in order to determine labels thereof. 34. The method of claim 33 , wherein the set of validated contextual rules (a) take as inputs a value and a value context and (b) output an attribute label for the value.
| 0.5 |
8,145,484 | 3 | 4 |
3. The system of claim 1 , further comprising a grammar generator configured to define the grammar, the grammar comprising a sub-set of symbols for use by the speech recognition processor.
|
3. The system of claim 1 , further comprising a grammar generator configured to define the grammar, the grammar comprising a sub-set of symbols for use by the speech recognition processor. 4. The system of claim 3 , wherein the grammar generator is configured to define the sub-set based upon the dataset of confirmed user entries.
| 0.5 |
9,308,446 | 1 | 7 |
1. A training program comprising a combination of games configured to systematically drive neurological changes to overcome social cognitive deficits, the training program comprising: one or more computerized social cue perception games, wherein one of the social cue perception games challenges the participant to observe gaze directions in facial images; one or more computerized emotion perception games; and one or more computerized theory of mind games; wherein each computerized game is configured to: present a plurality of target and/or distractor stimuli; prompt a game participant to respond to the target and/or distractor stimuli; receive the game participant's input through a game piece; provide an indication to the game participant of whether the game participant's input was accurate or apt; provide a signal indicative of the game participant's performance or game difficulty; and repeat the presenting through providing a signal steps over multiple repetitions while adapting one or more difficulty parameters to target maintenance of a success rate within a predetermined range.
|
1. A training program comprising a combination of games configured to systematically drive neurological changes to overcome social cognitive deficits, the training program comprising: one or more computerized social cue perception games, wherein one of the social cue perception games challenges the participant to observe gaze directions in facial images; one or more computerized emotion perception games; and one or more computerized theory of mind games; wherein each computerized game is configured to: present a plurality of target and/or distractor stimuli; prompt a game participant to respond to the target and/or distractor stimuli; receive the game participant's input through a game piece; provide an indication to the game participant of whether the game participant's input was accurate or apt; provide a signal indicative of the game participant's performance or game difficulty; and repeat the presenting through providing a signal steps over multiple repetitions while adapting one or more difficulty parameters to target maintenance of a success rate within a predetermined range. 7. The training program of claim 1 , wherein another one of the social cue perception games challenges the participant to repeatedly and rapidly identify which person in a plurality of target faces is smiling.
| 0.568182 |
8,310,179 | 13 | 15 |
13. A method comprising: receiving multisensory input from a plurality of input devices, the plurality of devices consisting of a hand-held keypad controller and a microphone; responsive to the receiving of multisensory input, filtering environment background noise from the multisensory input, yielding filtered multisensory input; responsive to the filtering environment background noise from the multisensory input, extracting a patient-lifting-device command from the filtered multisensory input; responsive to the extracting of the patient-lifting-device command from the filtered multisensory input, generating at least one electrical signal from the patient-lifting-device command; and responsive to the generating of the at least one the electrical signal, performing motion of a patient-lifting-device in accordance with the at least one electrical signal.
|
13. A method comprising: receiving multisensory input from a plurality of input devices, the plurality of devices consisting of a hand-held keypad controller and a microphone; responsive to the receiving of multisensory input, filtering environment background noise from the multisensory input, yielding filtered multisensory input; responsive to the filtering environment background noise from the multisensory input, extracting a patient-lifting-device command from the filtered multisensory input; responsive to the extracting of the patient-lifting-device command from the filtered multisensory input, generating at least one electrical signal from the patient-lifting-device command; and responsive to the generating of the at least one the electrical signal, performing motion of a patient-lifting-device in accordance with the at least one electrical signal. 15. The method of claim 13 wherein the plurality of input devices further comprises: a wireless connection to the receiver.
| 0.91074 |
9,513,941 | 1 | 14 |
1. A method for generating a plurality of application programming interfaces (APIs) in a codeless manner, the method comprising: receiving a request for a plurality of APIs based on a description of a database schema; upon identifying the database schema description, generating a set of data graphs that identifies relationships between a set of data objects included in the description; generating the plurality of APIs based on the set of data graphs and providing the generated APIs to a user for selecting a subset of the plurality of APIs; and upon selection of an API, generating a JavaScript object notation based model (JSON-based model) associated with the selected API, the JSON-based model comprising a JSON file and a JavaScript (JS) file for an application to use to exchange data with the database.
|
1. A method for generating a plurality of application programming interfaces (APIs) in a codeless manner, the method comprising: receiving a request for a plurality of APIs based on a description of a database schema; upon identifying the database schema description, generating a set of data graphs that identifies relationships between a set of data objects included in the description; generating the plurality of APIs based on the set of data graphs and providing the generated APIs to a user for selecting a subset of the plurality of APIs; and upon selection of an API, generating a JavaScript object notation based model (JSON-based model) associated with the selected API, the JSON-based model comprising a JSON file and a JavaScript (JS) file for an application to use to exchange data with the database. 14. The method of claim 1 , wherein the JS file comprises a set of behavioral descriptions of the JSON-based model and the JSON file comprises a set of property descriptions of the JSON-based model.
| 0.592593 |
8,510,323 | 2 | 3 |
2. The method of claim 1 , further comprising: for the identity records in the group, performing an individual query on attributes of the identity records against the entity records in a watch list to determine whether the identity records in the group match the entity records in the watch list; and generating an alert for the identity records in the group found to match one of the entity records in the watch list.
|
2. The method of claim 1 , further comprising: for the identity records in the group, performing an individual query on attributes of the identity records against the entity records in a watch list to determine whether the identity records in the group match the entity records in the watch list; and generating an alert for the identity records in the group found to match one of the entity records in the watch list. 3. The method of claim 2 , further comprising: adding to the candidate list for one of the identity records in the group the entity records in the watch list that are determined to match the identity record, wherein the resolution rules are applied to the candidate list including the entity records from the composite results from the entity database and the determined related entity records from the watch list.
| 0.707214 |
9,715,553 | 21 | 24 |
21. A computer-implemented method comprising: receiving a current location of a user's electronic device; retrieving data identifying a plurality of points of interest that are within a predetermined distance to the current location; calculating a score based on how often the user frequents the current location; in response to determining that the score exceeds a threshold value, ranking the points of interest based on the point of interests' proximity to the current location and on one or more updates associated with the points of interest, where an update for a point of interest comprises data about the point of interest input by an author other than the user into an online social network that includes the user; and providing one or more of the points of interest to the electronic device for presentation to the user on a display of the electronic device based on the ranking.
|
21. A computer-implemented method comprising: receiving a current location of a user's electronic device; retrieving data identifying a plurality of points of interest that are within a predetermined distance to the current location; calculating a score based on how often the user frequents the current location; in response to determining that the score exceeds a threshold value, ranking the points of interest based on the point of interests' proximity to the current location and on one or more updates associated with the points of interest, where an update for a point of interest comprises data about the point of interest input by an author other than the user into an online social network that includes the user; and providing one or more of the points of interest to the electronic device for presentation to the user on a display of the electronic device based on the ranking. 24. The method of claim 21 , further comprising: determining the predetermined distance based on a density of points of interest in an area including the current location.
| 0.715 |
9,251,206 | 13 | 14 |
13. The system of claim 9 , wherein the operations further comprise: receiving a current query and a plurality of suggested queries, each of the current and suggested queries including one or more terms; for each suggested query: calculating a transition cost between the suggested query and the current query based on a transition cost of a current term and a suggested term; and selecting a suggested query from the plurality of suggested queries based on the edit distance.
|
13. The system of claim 9 , wherein the operations further comprise: receiving a current query and a plurality of suggested queries, each of the current and suggested queries including one or more terms; for each suggested query: calculating a transition cost between the suggested query and the current query based on a transition cost of a current term and a suggested term; and selecting a suggested query from the plurality of suggested queries based on the edit distance. 14. The system of claim 13 , wherein the calculating the edit distance comprises: identifying a value in a cost matrix based on a substitution query pair including the current term and the suggested term.
| 0.6 |
8,521,664 | 1 | 9 |
1. A computer-implemented system comprising: one or more computers; one or more data storage devices coupled to the one or more computers, storing: a predictive model repository storing a plurality of trained predictive models, information that describes each of the trained predictive models, and instructions that, when executed by the one or more computers, cause the one or more computers to perform operations comprising: receiving a request from a client-subscriber computing system for access to a trained predictive model; determining one or more trained predictive models in the predictive model repository that match the request based on the request and the information that describes each of the trained predictive models; and providing access to at least one of the one or more models to the client-subscriber computing system; wherein the one or more models that match the request are models that were trained using training data provided by a computing system other than the client-subscriber computing system.
|
1. A computer-implemented system comprising: one or more computers; one or more data storage devices coupled to the one or more computers, storing: a predictive model repository storing a plurality of trained predictive models, information that describes each of the trained predictive models, and instructions that, when executed by the one or more computers, cause the one or more computers to perform operations comprising: receiving a request from a client-subscriber computing system for access to a trained predictive model; determining one or more trained predictive models in the predictive model repository that match the request based on the request and the information that describes each of the trained predictive models; and providing access to at least one of the one or more models to the client-subscriber computing system; wherein the one or more models that match the request are models that were trained using training data provided by a computing system other than the client-subscriber computing system. 9. The system of claim 1 , wherein: at least one input type determined from the request is included in a hierarchy of input types, wherein the input type can be represented by incrementally broader input types by incrementing to higher levels in the hierarchy; and determining a match based at least in part on a comparison of the input type determined from the request to input types included in the information that describes the trained predictive models includes incrementing to one or more higher levels in the hierarchy until an input type that describes a trained predictive model matches the at least one input type determined from the request as represented by incrementally broader input types.
| 0.5 |
7,590,613 | 8 | 11 |
8. A system for analyzing data, the system comprising: a processor; and a memory coupled to the processor, the memory configured to store a set of instructions which when executed by the processor cause the processor to: display a layout having a plurality of cells on a display device using a graphical user interface configured to enable users to manipulate arrangement of the plurality of cells within the graphical user interface, the layout specifying relationships between each cell in the plurality of cells and data in a database; receive input indicative of a selection made by a user on the displayed layout via the graphical user interface of a set of measured items in cells associated with the layout; receive input indicative of a selection made by a user on the displayed layout via the graphical user interface of a placement item in a cell associated with the layout; determine a partitioning associated with an analytic database function of the set of measured items selected by the user on the layout based on the placement item selected by the user on the layout; format the analytic database function associated with a cell in the plurality of cells of the layout based on the determined partitioning of the set of measured items, the analytic database function formatted by the processor to include the determined partitioning of the one or more measured items, one or more functions to be performed on the one or more measured items, and location of the cell within the layout to contain a resulting item for the one or more functions; modify the display of the layout on the display device using the graphical user interface with the resulting item; defining at least one partitioning of the one or more measured items relative to the placement item; a rule that enables the computer system to select the at least one partitioning for use when formatting the analytic database function; a set of aggregation levels for the analytic database function; and receiving a third user input at the computer system, the third user input indicative of a selection made by the user on the layout displayed on the display device of one of the set of aggregation levels.
|
8. A system for analyzing data, the system comprising: a processor; and a memory coupled to the processor, the memory configured to store a set of instructions which when executed by the processor cause the processor to: display a layout having a plurality of cells on a display device using a graphical user interface configured to enable users to manipulate arrangement of the plurality of cells within the graphical user interface, the layout specifying relationships between each cell in the plurality of cells and data in a database; receive input indicative of a selection made by a user on the displayed layout via the graphical user interface of a set of measured items in cells associated with the layout; receive input indicative of a selection made by a user on the displayed layout via the graphical user interface of a placement item in a cell associated with the layout; determine a partitioning associated with an analytic database function of the set of measured items selected by the user on the layout based on the placement item selected by the user on the layout; format the analytic database function associated with a cell in the plurality of cells of the layout based on the determined partitioning of the set of measured items, the analytic database function formatted by the processor to include the determined partitioning of the one or more measured items, one or more functions to be performed on the one or more measured items, and location of the cell within the layout to contain a resulting item for the one or more functions; modify the display of the layout on the display device using the graphical user interface with the resulting item; defining at least one partitioning of the one or more measured items relative to the placement item; a rule that enables the computer system to select the at least one partitioning for use when formatting the analytic database function; a set of aggregation levels for the analytic database function; and receiving a third user input at the computer system, the third user input indicative of a selection made by the user on the layout displayed on the display device of one of the set of aggregation levels. 11. The system of claim 8 , wherein the analytic database function includes a database query.
| 0.765152 |
10,027,804 | 1 | 7 |
1. A system for providing hiring recommendations of agents within a call center, comprising: a handset to collect a voice sample from a candidate agent; a spectrum analyzer device to determine within the voice sample voice characteristics comprising at least one of pitch, range of resonance frequencies of vowel, average resonance frequency of particular vowels, spectral tilt, breathiness, creakiness, nasality, speed of words, pause duration and intonation; and a speech recognition server comprising a central processing unit, memory, an input port that receives the voice sample from the handset, and an output port, wherein the central processing unit is configured to: compare the voice characteristics from the voice sample with at least one graph comprising voice characteristics for two or more populations of a trait, which are each represented by a curve; assign a score to the candidate agent by identifying at least a portion of the voice characteristics from the voice sample on the graph based on the comparison, assigning a numerical value to each identified voice characteristic from the voice sample based on the comparison, and summing the numerical values for the identified voice characteristics as the score; identify one of the populations to which the candidate agent belongs for that trait based on the assigned score; and provide a recommendation for hire for the candidate agent based on the assigned score and the identified population.
|
1. A system for providing hiring recommendations of agents within a call center, comprising: a handset to collect a voice sample from a candidate agent; a spectrum analyzer device to determine within the voice sample voice characteristics comprising at least one of pitch, range of resonance frequencies of vowel, average resonance frequency of particular vowels, spectral tilt, breathiness, creakiness, nasality, speed of words, pause duration and intonation; and a speech recognition server comprising a central processing unit, memory, an input port that receives the voice sample from the handset, and an output port, wherein the central processing unit is configured to: compare the voice characteristics from the voice sample with at least one graph comprising voice characteristics for two or more populations of a trait, which are each represented by a curve; assign a score to the candidate agent by identifying at least a portion of the voice characteristics from the voice sample on the graph based on the comparison, assigning a numerical value to each identified voice characteristic from the voice sample based on the comparison, and summing the numerical values for the identified voice characteristics as the score; identify one of the populations to which the candidate agent belongs for that trait based on the assigned score; and provide a recommendation for hire for the candidate agent based on the assigned score and the identified population. 7. A system according to claim 1 , further comprising: a scoring determination module to determine the score based on at least one of a sum of individual scores assigned to each identified voice characteristic and on one or more of a presence and absence of predetermined voice characteristics.
| 0.5 |
7,474,654 | 10 | 11 |
10. The apparatus of claim 9 , wherein the means for performing the first classification of the packet based on the structured part of the at least one packet classification rule comprises: means for splitting the header of the packet into a predetermined number of the plurality of fields; means for generating a set of equivalence classes for each of the predetermined number of fields; and means for determining a unique equivalence class matching the packet in each of the plurality of fields.
|
10. The apparatus of claim 9 , wherein the means for performing the first classification of the packet based on the structured part of the at least one packet classification rule comprises: means for splitting the header of the packet into a predetermined number of the plurality of fields; means for generating a set of equivalence classes for each of the predetermined number of fields; and means for determining a unique equivalence class matching the packet in each of the plurality of fields. 11. The apparatus of claim 10 , wherein the means for determining the unique equivalence class matching the packet comprises using an Access Control List (ACL) format.
| 0.5 |
8,706,470 | 1 | 2 |
1. The method of providing language usage guidance with respect to a passage of a document being edited by a user, comprising: generating a hash of the passage being edited; comparing the hash against entries in a database to determine likelihood that the passage is written as intended by the user; and providing alternative language suggestions to the user based in part upon entries in the database; and allowing the user to modify the document by accepting a selected one of the suggestions; a program when run on a local computer to compute a triplet of hashes, wherein each hash consists of a hash for each word in the document, a hash for the word and its preceding word, and a hash for the word and its following word.
|
1. The method of providing language usage guidance with respect to a passage of a document being edited by a user, comprising: generating a hash of the passage being edited; comparing the hash against entries in a database to determine likelihood that the passage is written as intended by the user; and providing alternative language suggestions to the user based in part upon entries in the database; and allowing the user to modify the document by accepting a selected one of the suggestions; a program when run on a local computer to compute a triplet of hashes, wherein each hash consists of a hash for each word in the document, a hash for the word and its preceding word, and a hash for the word and its following word. 2. The method of claim 1 , wherein the step of providing alternative suggestions comprises providing first, and second suggestions.
| 0.696759 |
5,537,526 | 20 | 36 |
20. A method for document processing for use in a computer system having a processor, storage and a display under control of the processor, the method comprising the steps of: (a) storing a plurality of model classes in the storage, each one of the plurality of model classes defining referencing data stored in the storage; (b) creating a container object to hold a plurality of objects instantiated from one or more of the plurality of model classes (c) creating logic for processing the data and objects held in the container object; (d) instantiating a root model object from one of the plurality of model classes, the root model object containing a reference to data of a first type; (e) instantiating a plurality of additional model objects from the plurality of model classes each one of the plurality of additional model objects containing a reference to data of a type different from the first type; (f) adding at least one of the additional model objects to a container in the root model object to provide a compound document from the root model object; and (g) processing the compound document by processing the root model object, which applies the processing to the at least one additional model object in the container in the root model object.
|
20. A method for document processing for use in a computer system having a processor, storage and a display under control of the processor, the method comprising the steps of: (a) storing a plurality of model classes in the storage, each one of the plurality of model classes defining referencing data stored in the storage; (b) creating a container object to hold a plurality of objects instantiated from one or more of the plurality of model classes (c) creating logic for processing the data and objects held in the container object; (d) instantiating a root model object from one of the plurality of model classes, the root model object containing a reference to data of a first type; (e) instantiating a plurality of additional model objects from the plurality of model classes each one of the plurality of additional model objects containing a reference to data of a type different from the first type; (f) adding at least one of the additional model objects to a container in the root model object to provide a compound document from the root model object; and (g) processing the compound document by processing the root model object, which applies the processing to the at least one additional model object in the container in the root model object. 36. The method of claim 20, including the step of providing address space independent references to real objects using object surrogate means.
| 0.526667 |
9,880,984 | 1 | 5 |
1. A system implemented in hardware, comprising: a computer operable to: receive, from a document owner via a social media network, a portion of a document and an identification of at least one social media network contact to be notified for reviewing the portion of the document; store the portion of the document and the identification of the at least one social media network contact, as a reviewer of the portion of the document, into a memory; assign, by the document owner, forwarding rights to the at least one reviewer with respect to the portion of the document, the forwarding rights configured to selectively enable and prevent the ability of the at least one reviewer to forward the portion of the document to other individuals through the social media network; generate a link referencing the portion of the document stored in the memory; publish the link to the reviewer for the reviewer to access the portion of the document for reviewing via the social media network; receive a proposed edit associated with the portion of the document from the reviewer, wherein the received proposed edit is accessible to the document owner; and receive, from the document owner, an indication of one of an acceptance of the proposed edit and a rejection of the proposed edit; determine reviewers whose proposed edits are more frequently accepted by the document owner; and indicate the determined reviewers to the document owner; wherein the acceptance causes the computer to automatically update the portion of the document to include the proposed edit, and the rejection causes the computer to maintain the portion of the document without the proposed edit; wherein receiving the identification of the at least one social media network contact includes receiving a user-selected, pre-defined category of social media network contacts, the computer further configured to: receive a level of confidentiality indicator from the document owner for assignment to the portion of the document; and apply a filter to the social media network contacts listed in the category based on the level of confidentiality indicator and a social media network profile for each of the social media network contacts in the category; wherein publishing the link to the reviewer comprises publishing the link for only those social media network contacts that meet criteria of the filter.
|
1. A system implemented in hardware, comprising: a computer operable to: receive, from a document owner via a social media network, a portion of a document and an identification of at least one social media network contact to be notified for reviewing the portion of the document; store the portion of the document and the identification of the at least one social media network contact, as a reviewer of the portion of the document, into a memory; assign, by the document owner, forwarding rights to the at least one reviewer with respect to the portion of the document, the forwarding rights configured to selectively enable and prevent the ability of the at least one reviewer to forward the portion of the document to other individuals through the social media network; generate a link referencing the portion of the document stored in the memory; publish the link to the reviewer for the reviewer to access the portion of the document for reviewing via the social media network; receive a proposed edit associated with the portion of the document from the reviewer, wherein the received proposed edit is accessible to the document owner; and receive, from the document owner, an indication of one of an acceptance of the proposed edit and a rejection of the proposed edit; determine reviewers whose proposed edits are more frequently accepted by the document owner; and indicate the determined reviewers to the document owner; wherein the acceptance causes the computer to automatically update the portion of the document to include the proposed edit, and the rejection causes the computer to maintain the portion of the document without the proposed edit; wherein receiving the identification of the at least one social media network contact includes receiving a user-selected, pre-defined category of social media network contacts, the computer further configured to: receive a level of confidentiality indicator from the document owner for assignment to the portion of the document; and apply a filter to the social media network contacts listed in the category based on the level of confidentiality indicator and a social media network profile for each of the social media network contacts in the category; wherein publishing the link to the reviewer comprises publishing the link for only those social media network contacts that meet criteria of the filter. 5. The system of claim 1 , wherein the computer is operable to assign a unique identification reference to the portion of the document and the at least one contact information of the reviewer.
| 0.76 |
9,086,953 | 3 | 5 |
3. A printer device for, comprising: a flash memory storing a plurality of records annotated by a markup language, each record being associated with a plurality of related reserved words stored in lower case letters, and each record containing a plurality of information pieces, each information piece in each record being associated with a respective reserved word; a reserved word determiner for determining whether or not a bit in a string of binary bits that represents a character in a character string defining a reserved word has been changed from 1 to 0; and a controller that excludes a record associated with said reserved word from said printing when said reserved word determiner determines that said bit in said reserved word has been changed from 1 to 0, wherein change from 1 to 0 of a bit in said reserved word changes the character in the character string from lower case to upper case and indicates that said record associated with said reserved word is inactive.
|
3. A printer device for, comprising: a flash memory storing a plurality of records annotated by a markup language, each record being associated with a plurality of related reserved words stored in lower case letters, and each record containing a plurality of information pieces, each information piece in each record being associated with a respective reserved word; a reserved word determiner for determining whether or not a bit in a string of binary bits that represents a character in a character string defining a reserved word has been changed from 1 to 0; and a controller that excludes a record associated with said reserved word from said printing when said reserved word determiner determines that said bit in said reserved word has been changed from 1 to 0, wherein change from 1 to 0 of a bit in said reserved word changes the character in the character string from lower case to upper case and indicates that said record associated with said reserved word is inactive. 5. The printer device according to claim 3 , wherein said markup language is XML.
| 0.781081 |
9,811,399 | 13 | 17 |
13. A computer system for filtering notifications to a user from a device based on an enhanced white list comprising a static white list set by the user and a temporary white list, the computer system comprising: at least one processor, one or more memories, and program instructions executable by the computer to perform a method comprising: monitoring, by the computer, applications and activities on the device which generate notifications to the user to create and maintain a temporary white list to be used with a static white list for notifications to the user; monitoring, by the computer, the applications and activities on the device which generate notifications and determining which of the monitored applications and activities on the device are not present on the static white list; searching for and analyzing, by the computer, activities of the device and user interaction with the device to extract at least keywords and context associated with the activities and user interaction of the device; determining, by the computer, whether the keywords and context extracted are associated with a dependency list between applications of the device and context; and if the keywords and context extracted are present on the dependency list, adding, by the computer, the application and activity on the device as an expiring entry on the temporary white list; receiving, by the computer, a notification from an application of the device for the user; and if the application is on the enhanced white list, allowing the notification from the application to audibly sound to the user through the device.
|
13. A computer system for filtering notifications to a user from a device based on an enhanced white list comprising a static white list set by the user and a temporary white list, the computer system comprising: at least one processor, one or more memories, and program instructions executable by the computer to perform a method comprising: monitoring, by the computer, applications and activities on the device which generate notifications to the user to create and maintain a temporary white list to be used with a static white list for notifications to the user; monitoring, by the computer, the applications and activities on the device which generate notifications and determining which of the monitored applications and activities on the device are not present on the static white list; searching for and analyzing, by the computer, activities of the device and user interaction with the device to extract at least keywords and context associated with the activities and user interaction of the device; determining, by the computer, whether the keywords and context extracted are associated with a dependency list between applications of the device and context; and if the keywords and context extracted are present on the dependency list, adding, by the computer, the application and activity on the device as an expiring entry on the temporary white list; receiving, by the computer, a notification from an application of the device for the user; and if the application is on the enhanced white list, allowing the notification from the application to audibly sound to the user through the device. 17. The computer system of claim 13 , wherein a topic is derived from the extracted keywords and the expiring entry on the temporary white list is based on the topic.
| 0.851521 |
9,904,675 | 14 | 18 |
14. A computer program product comprising a non-transitory computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed by a data processing system, causes the data processing system to: parse the input text using a minimal recursion semantics (MRS) generating grammar to obtain a minimal recursion semantics (MRS) representation of the input text; transform, by semantic role labelling, the input text into at least one semantic association of a verb and semantic arguments of the verb, the semantic arguments of the verb being fragments of the input text; receive a question type for at least one verb/semantic argument association; transform the MRS representation of the input text into a MRS representation of one or more questions based on the at least one semantic association of the verb and respective question types, wherein the computer readable program to transform the MRS representation of the input text into the MRS representation of the one or more questions further causes the data processing system to: identify a target phrase within the input text; remove predicates of the target phrase thereby obtaining a modified target phrase; and insert predicates of a corresponding question in the modified target phrase in order to obtain a question target phrase; and generate at least one question of the one or more questions based on the MRS representation of the at least one question using the MRS generating grammar.
|
14. A computer program product comprising a non-transitory computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed by a data processing system, causes the data processing system to: parse the input text using a minimal recursion semantics (MRS) generating grammar to obtain a minimal recursion semantics (MRS) representation of the input text; transform, by semantic role labelling, the input text into at least one semantic association of a verb and semantic arguments of the verb, the semantic arguments of the verb being fragments of the input text; receive a question type for at least one verb/semantic argument association; transform the MRS representation of the input text into a MRS representation of one or more questions based on the at least one semantic association of the verb and respective question types, wherein the computer readable program to transform the MRS representation of the input text into the MRS representation of the one or more questions further causes the data processing system to: identify a target phrase within the input text; remove predicates of the target phrase thereby obtaining a modified target phrase; and insert predicates of a corresponding question in the modified target phrase in order to obtain a question target phrase; and generate at least one question of the one or more questions based on the MRS representation of the at least one question using the MRS generating grammar. 18. The computer program product according to claim 14 , wherein the question type is determined based on a question type database.
| 0.770175 |
8,687,708 | 1 | 7 |
1. A method of optimising Rate Distortion Optimisation candidate assessment in hardware apparatus, comprising: determining which Rate Distortion Optimisation candidates out of a plurality of candidates are separately processable, wherein the candidates are partitions of a picture; determining a processing delay of critical portions of candidate assessment hardware, wherein the critical portions of candidate processing hardware include a Rate Distortion Optimization Best Candidate Decision Block; a Motion Vector Predictor Calculation Block; and a Sum and Langrangian Multiplication Block; determining a rule set governing how the separately processable candidates may be ordered for processing, wherein the rule set for ordering the separately processable candidates depends on the input video resolution; determining an optimised processing order for processing the separately processable candidate assessments, dependent on the processing delay of critical portions of the candidate assessment hardware and the determined rule set; spending enough clock cycles processing other candidates in between partitions of the same size, such that the best candidate for a given partition can be set in time to calculate a motion vector difference (MVD) bit cost (RMV) for the next partition; and processing the candidates according to the determined processing order.
|
1. A method of optimising Rate Distortion Optimisation candidate assessment in hardware apparatus, comprising: determining which Rate Distortion Optimisation candidates out of a plurality of candidates are separately processable, wherein the candidates are partitions of a picture; determining a processing delay of critical portions of candidate assessment hardware, wherein the critical portions of candidate processing hardware include a Rate Distortion Optimization Best Candidate Decision Block; a Motion Vector Predictor Calculation Block; and a Sum and Langrangian Multiplication Block; determining a rule set governing how the separately processable candidates may be ordered for processing, wherein the rule set for ordering the separately processable candidates depends on the input video resolution; determining an optimised processing order for processing the separately processable candidate assessments, dependent on the processing delay of critical portions of the candidate assessment hardware and the determined rule set; spending enough clock cycles processing other candidates in between partitions of the same size, such that the best candidate for a given partition can be set in time to calculate a motion vector difference (MVD) bit cost (RMV) for the next partition; and processing the candidates according to the determined processing order. 7. Apparatus for Rate Distortion Optimisation processing adapted to carry out the method of claim 1 .
| 0.942153 |
9,755,996 | 15 | 16 |
15. A computer system comprising: at least one processor; at least one computer readable storage medium that is not a transitory signal per se and program instructions stored on the at least one computer readable storage medium, the program instructions comprising instructions to: receive a message that is addressed to a user; determine a topic for, and a sender of, the message; determine, from information stored in a user profile, whether the topic and the sender are ignorable; determine, via one or more sensors, whether the user is currently operating a vehicle; automatically sending a message response in response to determining that the user is currently operating a vehicle and the topic and the sender are not ignorable; and on condition that the user is not currently operating a vehicle and the topic and the sender are not ignorable, conducting a user-directed response process comprising: conducting a text substitution process on the message to produce an abbreviated version of the message, presenting the abbreviated version of the message and a list of response options to the user, determining a response option that is selected by the user, sending a response to the message that corresponds to the response option that is selected by the user, and wherein the list of response options includes a plurality of message-dependent formulated responses.
|
15. A computer system comprising: at least one processor; at least one computer readable storage medium that is not a transitory signal per se and program instructions stored on the at least one computer readable storage medium, the program instructions comprising instructions to: receive a message that is addressed to a user; determine a topic for, and a sender of, the message; determine, from information stored in a user profile, whether the topic and the sender are ignorable; determine, via one or more sensors, whether the user is currently operating a vehicle; automatically sending a message response in response to determining that the user is currently operating a vehicle and the topic and the sender are not ignorable; and on condition that the user is not currently operating a vehicle and the topic and the sender are not ignorable, conducting a user-directed response process comprising: conducting a text substitution process on the message to produce an abbreviated version of the message, presenting the abbreviated version of the message and a list of response options to the user, determining a response option that is selected by the user, sending a response to the message that corresponds to the response option that is selected by the user, and wherein the list of response options includes a plurality of message-dependent formulated responses. 16. The computer system of claim 15 , wherein the program instructions comprise instructions to ignore the message in response to determining that the topic or the sender is ignorable.
| 0.5 |
9,286,386 | 12 | 13 |
12. The system of claim 8 , wherein the search results comprise a link to additional information related to the search results.
|
12. The system of claim 8 , wherein the search results comprise a link to additional information related to the search results. 13. The system of claim 12 , wherein the additional information is a video presentation from the videos available by mobile video-on-demand.
| 0.5 |
9,311,111 | 1 | 15 |
1. A non-transitory computer-readable medium storing computer executable instructions, the instructions comprising: one or more instructions that, when executed by a processor, cause the processor to: provide a handle base class; define one or more handle subclasses, where the one or more handle subclasses have a class hierarchy that includes the handle base class; construct handle objects from the one or more handle subclasses; use the handle objects, where the handle objects are used exclusively through references to the handle objects; define one or more non-handle base classes and one or more non-handle subclasses, where the one or more non-handle subclasses have a class hierarchy that includes at least one of the one or more non-handle base classes and does not include the handle base class; construct non-handle objects from the one or more non-handle subclasses; use the non-handle objects, where the non-handle objects are used exclusively by value; store the handle objects and the non-handle objects in a memory coupled to the processor; provide a first syntax for constructing both the handle objects and the non-handle objects; and provide a second syntax for using both the handle objects and the non-handle objects.
|
1. A non-transitory computer-readable medium storing computer executable instructions, the instructions comprising: one or more instructions that, when executed by a processor, cause the processor to: provide a handle base class; define one or more handle subclasses, where the one or more handle subclasses have a class hierarchy that includes the handle base class; construct handle objects from the one or more handle subclasses; use the handle objects, where the handle objects are used exclusively through references to the handle objects; define one or more non-handle base classes and one or more non-handle subclasses, where the one or more non-handle subclasses have a class hierarchy that includes at least one of the one or more non-handle base classes and does not include the handle base class; construct non-handle objects from the one or more non-handle subclasses; use the non-handle objects, where the non-handle objects are used exclusively by value; store the handle objects and the non-handle objects in a memory coupled to the processor; provide a first syntax for constructing both the handle objects and the non-handle objects; and provide a second syntax for using both the handle objects and the non-handle objects. 15. The medium of claim 1 , wherein the first syntax includes a word “classdef,” a name of a class being defined, a less-then sign, and a name of a base class from which the class being defined is a subclass.
| 0.742574 |
8,941,589 | 125 | 126 |
125. The system of claim 114 , wherein the at least one camera collects correspondence data between image coordinates of the projective image and the plurality of collinear markers.
|
125. The system of claim 114 , wherein the at least one camera collects correspondence data between image coordinates of the projective image and the plurality of collinear markers. 126. The system of claim 125 , comprising a camera calibration application, wherein intrinsic parameters of the at least one camera are modeled using the camera calibration application, wherein the intrinsic parameters include at least one of focal ratio, optical center, skewness, and lens distortion.
| 0.5 |
9,898,531 | 17 | 18 |
17. The system of claim 10 wherein the computer processor is operable to provide search results identifying CLIs in close proximity to the search request.
|
17. The system of claim 10 wherein the computer processor is operable to provide search results identifying CLIs in close proximity to the search request. 18. The system of claim 17 wherein the CLIs in close proximity to the search request are in close proximity by prerequisite or dependency relationship.
| 0.5 |
7,904,186 | 11 | 12 |
11. The BAS machine of claim 9 , further comprising: means for storing the static information in a database of the BAS machine; means for caching the dynamic information in a cache of the BAS machine; and means for periodically refreshing the cache by requesting new dynamic information.
|
11. The BAS machine of claim 9 , further comprising: means for storing the static information in a database of the BAS machine; means for caching the dynamic information in a cache of the BAS machine; and means for periodically refreshing the cache by requesting new dynamic information. 12. The BAS machine of claim 11 , wherein the means for selectively displaying the end device page further comprises: means for receiving a request to display the end device page; means for retrieving the static information stored in the database; means for retrieving the dynamic information from the cache; and means for loading the end device page with the static and dynamic information.
| 0.5 |
8,756,538 | 1 | 7 |
1. A method for processing a hardware design comprising: using a computer, receiving structured data that includes a representation of a basic hardware structure and a complex hardware structure that includes said basic hardware structure; parsing said structured data; and generating, based on a result of said parsing, commands of a hardware design environment.
|
1. A method for processing a hardware design comprising: using a computer, receiving structured data that includes a representation of a basic hardware structure and a complex hardware structure that includes said basic hardware structure; parsing said structured data; and generating, based on a result of said parsing, commands of a hardware design environment. 7. The method of claim 1 , wherein said structured data is XML data.
| 0.948171 |
9,110,957 | 16 | 18 |
16. A computing system comprising: a user interface displaying data of the business document in a tabular form comprising a plurality of cells displaying a plurality of data values or expressions disposed in a plurality of rows and columns, and further receiving a data mining assertion associated with a business intelligence document in at least two cells of the plurality of cells to identify relationships within the data, wherein each cell of the at least two cells displays at least one data value or expression specified by the business intelligence document, the business intelligence document specifying a directed acyclic graph connected of entities in a pipeline to produce a complex and arbitrary sequence of expressions designated for computation; a data mining engine varying the at least one data value or expression in each cell of the at least two cells subject to the data mining assertion associated with the business intelligence document, wherein the data mining assertion specifies a constraint on the at least one data value or the at least one expression specified by the business intelligence document; an expression engine varying the at least one data value or expression to identify individual data values that cause the data mining assertion to evaluate the data value and expressions variations available within the scope of the business intelligence document to iterate through the variations to determine the data and transformations that make the assertion true; a presentation tool presenting a solution reflecting the individual data values that cause the data mining assertion to evaluate to true, the solution being presented in association with the business intelligence document via the user interface; wherein the computing system offloads data computation to a remote system in a business intelligence environment, and receives a data mining assertion by invoking an assertion mode on a row using a toolbar button or a menu item of the user interface, wherein the assertion mode provides a control on each cell of the row; and one or more processors configured to execute at least the data mining engine.
|
16. A computing system comprising: a user interface displaying data of the business document in a tabular form comprising a plurality of cells displaying a plurality of data values or expressions disposed in a plurality of rows and columns, and further receiving a data mining assertion associated with a business intelligence document in at least two cells of the plurality of cells to identify relationships within the data, wherein each cell of the at least two cells displays at least one data value or expression specified by the business intelligence document, the business intelligence document specifying a directed acyclic graph connected of entities in a pipeline to produce a complex and arbitrary sequence of expressions designated for computation; a data mining engine varying the at least one data value or expression in each cell of the at least two cells subject to the data mining assertion associated with the business intelligence document, wherein the data mining assertion specifies a constraint on the at least one data value or the at least one expression specified by the business intelligence document; an expression engine varying the at least one data value or expression to identify individual data values that cause the data mining assertion to evaluate the data value and expressions variations available within the scope of the business intelligence document to iterate through the variations to determine the data and transformations that make the assertion true; a presentation tool presenting a solution reflecting the individual data values that cause the data mining assertion to evaluate to true, the solution being presented in association with the business intelligence document via the user interface; wherein the computing system offloads data computation to a remote system in a business intelligence environment, and receives a data mining assertion by invoking an assertion mode on a row using a toolbar button or a menu item of the user interface, wherein the assertion mode provides a control on each cell of the row; and one or more processors configured to execute at least the data mining engine. 18. The computing system of claim 16 wherein the expression engine restricts an extent to which the at least one data value or at least one expression is varied based on the constraint.
| 0.728739 |
9,286,548 | 1 | 6 |
1. A method for classifying search results by a search engine comprising an index of documents in a memory corresponding to a plurality of products offered by a plurality of online shopping sites and comprising text classifiers and image classifiers, a user interface enabling for enabling a user to browse products offerings organized according to the product taxonomy and receiving a search query from the user and providing the user with a set of search results, and a ranking engine for ranking the set of search results to enhance the user's experience, the method comprising: inferring a first distribution on a set of training data using a first classifier; inferring a second distribution on the set of training data using a second classifier; concatenating the first distribution and the second distribution; classifying each search result among a set of search results based on the concatenation; and ranking the search results based at least in part on the classification.
|
1. A method for classifying search results by a search engine comprising an index of documents in a memory corresponding to a plurality of products offered by a plurality of online shopping sites and comprising text classifiers and image classifiers, a user interface enabling for enabling a user to browse products offerings organized according to the product taxonomy and receiving a search query from the user and providing the user with a set of search results, and a ranking engine for ranking the set of search results to enhance the user's experience, the method comprising: inferring a first distribution on a set of training data using a first classifier; inferring a second distribution on the set of training data using a second classifier; concatenating the first distribution and the second distribution; classifying each search result among a set of search results based on the concatenation; and ranking the search results based at least in part on the classification. 6. The method of claim 1 , wherein the classification results in each search result having a score that is then used in the ranking.
| 0.789809 |
10,032,214 | 16 | 17 |
16. The system of claim 15 , wherein the network-based publication system is further configured to store the item specific information in the listing.
|
16. The system of claim 15 , wherein the network-based publication system is further configured to store the item specific information in the listing. 17. The system of claim 16 , wherein the structured text includes a name-value pair that describes a condition of the item and wherein the condition of the item is new.
| 0.5 |
8,306,826 | 13 | 14 |
13. The apparatus according to claim 12 , further comprising a user input device, wherein the string of codes comprises an input keyed by a user of the computer operating the input device.
|
13. The apparatus according to claim 12 , further comprising a user input device, wherein the string of codes comprises an input keyed by a user of the computer operating the input device. 14. The apparatus according to claim 13 , wherein the computer transmits the string of codes over a network.
| 0.5 |
7,861,301 | 11 | 13 |
11. A computer program product for electronically securing text transmitted over a computer network, the computer program product embodied on a storage medium not including a signal, the computer program comprising: computer code for scanning text generated by a parsing function at an OSI layer to produce scanned text, wherein the OSI layer is Layer 1 or Layer 3; computer code for determining if the scanned text contains sensitive data; and computer code for verifying the scanned text by notifying a user of the presence of the sensitive data in the scanned text and autostripping to automatically delete detected sensitive data.
|
11. A computer program product for electronically securing text transmitted over a computer network, the computer program product embodied on a storage medium not including a signal, the computer program comprising: computer code for scanning text generated by a parsing function at an OSI layer to produce scanned text, wherein the OSI layer is Layer 1 or Layer 3; computer code for determining if the scanned text contains sensitive data; and computer code for verifying the scanned text by notifying a user of the presence of the sensitive data in the scanned text and autostripping to automatically delete detected sensitive data. 13. The computer program product of claim 11 , wherein the computer code for determining further comprises computer code for employing a learning algorithm.
| 0.703422 |
9,152,616 | 1 | 8 |
1. A method for performing client-side page layout of web content using templates, the method comprising: receiving a source comprising a plurality of assets of different asset types; identifying a plurality of candidate templates from a template database, where each identified candidate template comprises a plurality of slots, and where each slot is configured to receive an asset of a particular asset type; for each particular slot of each of the identified candidate templates, calculating a slot subscore by: identifying an aspect ratio of an image asset included in the source, scaling the image asset to fill the particular slot when the particular slot is an image asset type slot, determining an area of the image asset to be cropped based on an area of the scaled image that extends beyond one or more boundaries of the particular slot, determining whether the determined area of the image asset to be cropped included a specified area of the image asset that should not be cropped, and calculating the slot subscore for the particular slot based at least in part on an amount of cropping to be performed inside the specified area and the determination of whether the determined area of the image asset to be cropped included the specified area; determining a score for each of the plurality of identified candidate templates, wherein the score for an identified candidate template is determined by: aggregating the calculated slot subscores for the plurality of slots included in the identified candidate template, and comparing a number and types of slots included in the identified candidate template with a number and types of assets included in the source; selecting a particular template from the scored plurality of identified candidate templates based on the scoring; and generating a readable article on a client device, the readable article comprising the assets of the source placed in the readable article according to the selected particular template.
|
1. A method for performing client-side page layout of web content using templates, the method comprising: receiving a source comprising a plurality of assets of different asset types; identifying a plurality of candidate templates from a template database, where each identified candidate template comprises a plurality of slots, and where each slot is configured to receive an asset of a particular asset type; for each particular slot of each of the identified candidate templates, calculating a slot subscore by: identifying an aspect ratio of an image asset included in the source, scaling the image asset to fill the particular slot when the particular slot is an image asset type slot, determining an area of the image asset to be cropped based on an area of the scaled image that extends beyond one or more boundaries of the particular slot, determining whether the determined area of the image asset to be cropped included a specified area of the image asset that should not be cropped, and calculating the slot subscore for the particular slot based at least in part on an amount of cropping to be performed inside the specified area and the determination of whether the determined area of the image asset to be cropped included the specified area; determining a score for each of the plurality of identified candidate templates, wherein the score for an identified candidate template is determined by: aggregating the calculated slot subscores for the plurality of slots included in the identified candidate template, and comparing a number and types of slots included in the identified candidate template with a number and types of assets included in the source; selecting a particular template from the scored plurality of identified candidate templates based on the scoring; and generating a readable article on a client device, the readable article comprising the assets of the source placed in the readable article according to the selected particular template. 8. The method of claim 1 , wherein determining a score for each of the identified candidate templates comprises scoring frames of the identified candidate templates based on avoiding typographical widows and orphans.
| 0.791103 |
8,775,932 | 1 | 12 |
1. A color management system comprising: a non-transitory computer readable memory which stores a guided natural language interface, the guided natural language interface comprising a set of issue description templates, each of the issue description templates being configured for guiding a user in formulating a problem statement, the user-formulated problem statement characterizing, in natural language, a perceived problem related to color identified in an input document and color of the input document when rendered on an associated printer; and a plurality of automated problem detectors which operate on an input document, each of the automated problem detectors being configured for automatically identifying a respective color-related problem when there is an expected difference in color between the input document and color of the input document when it is rendered using characteristics of a specific printer, each detector being configured to provide input to the guided natural language interface when the detector detects the color-related problem for the input document, the detector input specifying one of the set of issue description templates or being used for partially filling in one of the issue description templates based on the identified color-related problem; the guided natural language interface further comprising a natural language rendering engine, executed by a processor, which is configured for receiving information input by at least one of the user and at least one of the problem detectors, and which instantiates one of the issue description templates in response to receiving the information input by the at least one of the user and the at least one problem detector, the natural language rendering engine configured for presenting the problem statement and accepting user input to refine the problem statement in accordance with options provided from the instantiated template, and communicating information based on the refined problem statement to an associated color management problem corrector.
|
1. A color management system comprising: a non-transitory computer readable memory which stores a guided natural language interface, the guided natural language interface comprising a set of issue description templates, each of the issue description templates being configured for guiding a user in formulating a problem statement, the user-formulated problem statement characterizing, in natural language, a perceived problem related to color identified in an input document and color of the input document when rendered on an associated printer; and a plurality of automated problem detectors which operate on an input document, each of the automated problem detectors being configured for automatically identifying a respective color-related problem when there is an expected difference in color between the input document and color of the input document when it is rendered using characteristics of a specific printer, each detector being configured to provide input to the guided natural language interface when the detector detects the color-related problem for the input document, the detector input specifying one of the set of issue description templates or being used for partially filling in one of the issue description templates based on the identified color-related problem; the guided natural language interface further comprising a natural language rendering engine, executed by a processor, which is configured for receiving information input by at least one of the user and at least one of the problem detectors, and which instantiates one of the issue description templates in response to receiving the information input by the at least one of the user and the at least one problem detector, the natural language rendering engine configured for presenting the problem statement and accepting user input to refine the problem statement in accordance with options provided from the instantiated template, and communicating information based on the refined problem statement to an associated color management problem corrector. 12. The system of claim 1 , wherein the plurality of detectors includes a plurality of detectors selected from the group consisting of: a detector which automatically detects a mismatch in the rendering of a group of image objects which are of similar color in the image; a detector for automatically detects when a color profile is missing for an object; and a detector which automatically detects a difference between spot color definitions used for the image and corresponding spot color definitions used by a selected rendering device.
| 0.600148 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.