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
|
|---|---|---|---|---|---|
7,822,696 | 14 | 15 | 14. A method for constructing a set of weak classifiers of a combination classifier, comprising using a computing device to: receive a set of positive examples of instances in a set of training data and a set of negative examples of instances in the set of training data; weighting each positive and negative example; selecting a unique filter for each of a predetermined number of weak classifiers; applying each of the unique filters to the sets of weighted positive and negative examples, and constructing a unique histogram of the filtered weighted positive and negative examples for each of the unique filters; transforming each histogram into a histogram having a variable number of variably sized bins; and outputting each transformed histogram as a unique weak classifier to form a set of weak classifiers. | 14. A method for constructing a set of weak classifiers of a combination classifier, comprising using a computing device to: receive a set of positive examples of instances in a set of training data and a set of negative examples of instances in the set of training data; weighting each positive and negative example; selecting a unique filter for each of a predetermined number of weak classifiers; applying each of the unique filters to the sets of weighted positive and negative examples, and constructing a unique histogram of the filtered weighted positive and negative examples for each of the unique filters; transforming each histogram into a histogram having a variable number of variably sized bins; and outputting each transformed histogram as a unique weak classifier to form a set of weak classifiers. 15. The method of claim 14 further comprising constructing a combination classifier from the set of weak classifiers. | 0.74115 |
9,754,212 | 7 | 12 | 7. The method of claim 1 further comprising fact checking the target information by comparing the target information with source information to generate the fact check result, wherein comparing includes at least one of: i. searching for an exact match of the target information in the source information and returning the result of the exact match search if the exact match is found; ii. utilizing pattern matching for fact checking and returning the result of the pattern matching fact check if a pattern matching result confidence score is above a pattern matching result confidence threshold; and iii. utilizing a natural language search for fact checking and returning the result of the natural language fact check if a natural language result confidence score is above a natural language result confidence threshold, and the status of the target information is based on the format of the target information and the comparison of the target information with the source information. | 7. The method of claim 1 further comprising fact checking the target information by comparing the target information with source information to generate the fact check result, wherein comparing includes at least one of: i. searching for an exact match of the target information in the source information and returning the result of the exact match search if the exact match is found; ii. utilizing pattern matching for fact checking and returning the result of the pattern matching fact check if a pattern matching result confidence score is above a pattern matching result confidence threshold; and iii. utilizing a natural language search for fact checking and returning the result of the natural language fact check if a natural language result confidence score is above a natural language result confidence threshold, and the status of the target information is based on the format of the target information and the comparison of the target information with the source information. 12. The method of claim 7 further comprising analyzing the validity rating of an entity providing the target information, wherein if the validity rating of the entity is below an entity validity threshold, then source information is limited to sources with a rating above a reliability threshold. | 0.869604 |
9,960,932 | 10 | 11 | 10. A method, according to claim 1 , further comprising: a second one of the authors, different from the first one of the authors, performing additional modifications to the document; and propagating the additional modifications by the second one of the authors to other ones of the authors by sending supplemented change information to the other one of the authors, wherein the supplemented change information appends to the change information an indication of the modifications and an identification of the second one of the authors. | 10. A method, according to claim 1 , further comprising: a second one of the authors, different from the first one of the authors, performing additional modifications to the document; and propagating the additional modifications by the second one of the authors to other ones of the authors by sending supplemented change information to the other one of the authors, wherein the supplemented change information appends to the change information an indication of the modifications and an identification of the second one of the authors. 11. A method, according to claim 10 , wherein the change information includes an indication of particular modifications made by each of the authors. | 0.5 |
8,990,192 | 10 | 11 | 10. The computer system of claim 9 , wherein the operations further comprise: marking the find keyword as high priority in the index. | 10. The computer system of claim 9 , wherein the operations further comprise: marking the find keyword as high priority in the index. 11. The computer system of claim 10 , wherein the page is ranked higher in a list of pages when the find keyword is marked as high priority in the index. | 0.5 |
10,157,240 | 1 | 4 | 1. A system comprising: hardware processing circuitry; a hardware memory storing instructions that configure the hardware processing circuitry to perform operations, the operations comprising: determining, from a query log stored in a database, trending queries that are each indicated as being received at least a threshold number of instances, the trending queries being performed by users of a network publication system; identifying item pages that correspond to the trending queries, each of the item pages having a corresponding item; and identifying aspects of the items corresponding to the identified item pages, the aspects being stored as data within the database, each aspect identifying a feature of its corresponding item; and generating a graph to include query nodes for each of the trending queries generating a leaf node in the graph for each of the aspects from the item pages; generating connections between the leaf nodes and the query nodes for each of the trending queries; generating a destination page indicating at least one of the identified aspects based on the generated graph; and cause display of the destination page on a client device. | 1. A system comprising: hardware processing circuitry; a hardware memory storing instructions that configure the hardware processing circuitry to perform operations, the operations comprising: determining, from a query log stored in a database, trending queries that are each indicated as being received at least a threshold number of instances, the trending queries being performed by users of a network publication system; identifying item pages that correspond to the trending queries, each of the item pages having a corresponding item; and identifying aspects of the items corresponding to the identified item pages, the aspects being stored as data within the database, each aspect identifying a feature of its corresponding item; and generating a graph to include query nodes for each of the trending queries generating a leaf node in the graph for each of the aspects from the item pages; generating connections between the leaf nodes and the query nodes for each of the trending queries; generating a destination page indicating at least one of the identified aspects based on the generated graph; and cause display of the destination page on a client device. 4. The system of claim 1 , the operations further comprising: identifying categories that correspond to items from the item pages; and generating leaf nodes for each of the identified categories that correspond to the items from the item pages. | 0.7109 |
9,208,509 | 1 | 10 | 1. A computer program embodied on a non-transitory computer readable medium, comprising computer code for: identifying by a social network text from content that is one of consumed and output by a user; determining by the social network a native language of the user indicated within a profile of the user within the social network; identifying by a vocabulary analysis module a total number of words within the identified text; measuring a size of a working vocabulary of the user by the vocabulary analysis module using the text upon determining that the identified text is in the determined native language of the user and upon determining that the total number of words within the identified text is greater than a predetermined number, where measuring the size of the working vocabulary includes: identifying a total number of distinct words within the identified text, and calculating the size of the working vocabulary as a ratio of the total number of distinct words to the total number of words within the identified text; storing by an advertisement database a plurality of advertisements, where for each of the plurality of advertisements, the advertisement is stored by the advertisement database in association with one of a plurality of vocabulary thresholds upon determining by the advertisement database that the advertisement has been previously selected by a threshold number of other users each having the working vocabulary matching the vocabulary threshold; and selecting by the advertisement database one of the plurality of advertisements for presentation to the user, where the advertisement is selected based on a determination that the advertisement is stored in association with a vocabulary threshold matching the size of the working vocabulary of the user. | 1. A computer program embodied on a non-transitory computer readable medium, comprising computer code for: identifying by a social network text from content that is one of consumed and output by a user; determining by the social network a native language of the user indicated within a profile of the user within the social network; identifying by a vocabulary analysis module a total number of words within the identified text; measuring a size of a working vocabulary of the user by the vocabulary analysis module using the text upon determining that the identified text is in the determined native language of the user and upon determining that the total number of words within the identified text is greater than a predetermined number, where measuring the size of the working vocabulary includes: identifying a total number of distinct words within the identified text, and calculating the size of the working vocabulary as a ratio of the total number of distinct words to the total number of words within the identified text; storing by an advertisement database a plurality of advertisements, where for each of the plurality of advertisements, the advertisement is stored by the advertisement database in association with one of a plurality of vocabulary thresholds upon determining by the advertisement database that the advertisement has been previously selected by a threshold number of other users each having the working vocabulary matching the vocabulary threshold; and selecting by the advertisement database one of the plurality of advertisements for presentation to the user, where the advertisement is selected based on a determination that the advertisement is stored in association with a vocabulary threshold matching the size of the working vocabulary of the user. 10. The computer program of claim 1 , wherein the size of the working vocabulary of the user is predetermined to be associated with at least one characteristic. | 0.673469 |
7,574,659 | 18 | 21 | 18. A search engine method, comprising: storing records relating to a content of a plurality of information resources at a first database; storing records relating to commercial messages at a second database; persistently storing an identifier; receiving a search query and automatically defining in dependence thereon a query of the first database to retrieve hyperlinked identifiers of records of the first database corresponding to the search query, and a selection of records from the second database to define hyperlinked identifiers of records of the second database relating to commercial messages associated with at least one of the search query and the persistent identifier; automatically organizing the identifiers of records from the first database together with the identifiers of records from the second database in a common output, in further dependence on the stored identifier; wherein the step of automatically organizing comprises: defining a hierarchy from the hyperlinked identifiers of records of said first database corresponding to said search query according to content of or linkage among the hyperlinked identifiers of records of said first database and inserting the hyperlinked identifiers of records of said second database relating to commercial messages associated with at least one of said search query and said persistent identifier into the hierarchy according to content of or linkage between the hyperlinked identifiers of records of said second database and the hyperlinked identifiers of records of said first database; and automatically recording accounting information for at least one of a presentation and a selection of an identifier of a record from the second database with respect to an account maintained by an entity relating to a corresponding commercial message. | 18. A search engine method, comprising: storing records relating to a content of a plurality of information resources at a first database; storing records relating to commercial messages at a second database; persistently storing an identifier; receiving a search query and automatically defining in dependence thereon a query of the first database to retrieve hyperlinked identifiers of records of the first database corresponding to the search query, and a selection of records from the second database to define hyperlinked identifiers of records of the second database relating to commercial messages associated with at least one of the search query and the persistent identifier; automatically organizing the identifiers of records from the first database together with the identifiers of records from the second database in a common output, in further dependence on the stored identifier; wherein the step of automatically organizing comprises: defining a hierarchy from the hyperlinked identifiers of records of said first database corresponding to said search query according to content of or linkage among the hyperlinked identifiers of records of said first database and inserting the hyperlinked identifiers of records of said second database relating to commercial messages associated with at least one of said search query and said persistent identifier into the hierarchy according to content of or linkage between the hyperlinked identifiers of records of said second database and the hyperlinked identifiers of records of said first database; and automatically recording accounting information for at least one of a presentation and a selection of an identifier of a record from the second database with respect to an account maintained by an entity relating to a corresponding commercial message. 21. The method according to claim 18 , wherein at least two distinct predetermined hierarchical organizations of information resources are provided, each having at least three hierarchal levels, further comprising the steps of: defining a relevant hierarchy from among the at least two distinct predetermined hierarchical organizations of information resources; displaying hyperlinks to the set of information resources according to the relevant hierarchy; and storing at least a subset of the presented hyperlinks within the relevant hierarchy as a state independent object. | 0.5 |
8,027,867 | 1 | 13 | 1. A system for providing reader-supplied evaluation of a sample of an authored literary work for potential publication of the work comprising: a host computer comprising a processor and a storage device; a first interface module operably connected to the Internet, for receiving only a portion of the literary work from an author to be reviewed via the Internet; the storage device stores portion of the literary work along with other portions of other literary works for review; a second interface module that receives a request from a reader to review the portion of the literary work; a work presenter that presents the portion of literary work to the reader based on the reader's request; a security mechanism that limits the ability of users to misappropriate credit for the portion of literary work when the literary work were to be resubmitted by another author including a timestamp associated with a time of first receipt of the portion of the literary work from the author for resolving disputes regarding original authorship; a review receiving module that receives evaluation of the portion of the literary work from the reader and placing the review in the storage device associated with portion of the literary work; a criteria determination module, executed by the processor, having multiple levels of review of the authored literary work, further comprising: a reader-satisfaction module, executed by the processor, for determining whether a predetermined reader-satisfaction criteria is met during a first level review, the first level review being one of multiple levels of review; and a demographic module for determining whether the literary work has been reviewed by a predetermined number of reviewers from a plurality of reviewer demographics; and a publishing determination module that decides to publish the literary work when the predetermined reader-satisfaction criteria is met and when the literary work has been reviewed by a predetermined number of reviewers from a plurality of reviewer demographics. | 1. A system for providing reader-supplied evaluation of a sample of an authored literary work for potential publication of the work comprising: a host computer comprising a processor and a storage device; a first interface module operably connected to the Internet, for receiving only a portion of the literary work from an author to be reviewed via the Internet; the storage device stores portion of the literary work along with other portions of other literary works for review; a second interface module that receives a request from a reader to review the portion of the literary work; a work presenter that presents the portion of literary work to the reader based on the reader's request; a security mechanism that limits the ability of users to misappropriate credit for the portion of literary work when the literary work were to be resubmitted by another author including a timestamp associated with a time of first receipt of the portion of the literary work from the author for resolving disputes regarding original authorship; a review receiving module that receives evaluation of the portion of the literary work from the reader and placing the review in the storage device associated with portion of the literary work; a criteria determination module, executed by the processor, having multiple levels of review of the authored literary work, further comprising: a reader-satisfaction module, executed by the processor, for determining whether a predetermined reader-satisfaction criteria is met during a first level review, the first level review being one of multiple levels of review; and a demographic module for determining whether the literary work has been reviewed by a predetermined number of reviewers from a plurality of reviewer demographics; and a publishing determination module that decides to publish the literary work when the predetermined reader-satisfaction criteria is met and when the literary work has been reviewed by a predetermined number of reviewers from a plurality of reviewer demographics. 13. The system of claim 1 wherein the work presenter selects a portion of the literary work from the storage device based on demographics of the reader and the number of readers from each demographic that the literary work needs to meet the demographic reader requirements. | 0.522727 |
9,275,064 | 1 | 6 | 1. A method comprising: computing, by a computer processor of a computing system, a term frequency-inverse document frequency (tf-idf) associated with n-grams of an n-gram model of a domain; determining, by said computer processor based on said tf-idf, a frequently occurring group of n-grams of said n-grams; generating, by said computer processor executing a deep parser component of said computing system with respect to said frequently occurring group of n-grams, a deep parse output comprising results of said executing said deep parser component with respect to said frequently occurring group of n-grams; storing, by said computer processor in a database cache, said deep parse output; indexing, by said computer processor executing said frequently occurring group of n-grams in said database cache, said deep parse output; and verifying, by said computer processor, if a pre-computed specified text word sequence of said deep parse output is available in said database cache, wherein said verifying comprises: retrieving from said deep parse output, a plurality of tokens of said deep parser output, wherein said plurality of tokens are associated with a portion of said pre-computed specified text word sequence, wherein said plurality of tokens comprise suffixes associated with structures of said deep parser output, and wherein said plurality of tokens comprise a version token; and determining based on said plurality of tokens, variations associated with said pre-computed specified text word sequence. | 1. A method comprising: computing, by a computer processor of a computing system, a term frequency-inverse document frequency (tf-idf) associated with n-grams of an n-gram model of a domain; determining, by said computer processor based on said tf-idf, a frequently occurring group of n-grams of said n-grams; generating, by said computer processor executing a deep parser component of said computing system with respect to said frequently occurring group of n-grams, a deep parse output comprising results of said executing said deep parser component with respect to said frequently occurring group of n-grams; storing, by said computer processor in a database cache, said deep parse output; indexing, by said computer processor executing said frequently occurring group of n-grams in said database cache, said deep parse output; and verifying, by said computer processor, if a pre-computed specified text word sequence of said deep parse output is available in said database cache, wherein said verifying comprises: retrieving from said deep parse output, a plurality of tokens of said deep parser output, wherein said plurality of tokens are associated with a portion of said pre-computed specified text word sequence, wherein said plurality of tokens comprise suffixes associated with structures of said deep parser output, and wherein said plurality of tokens comprise a version token; and determining based on said plurality of tokens, variations associated with said pre-computed specified text word sequence. 6. The method of claim 1 , further comprising: providing at least one support service for at least one of creating, integrating, hosting, maintaining, and deploying computer-readable code in the computing system, said code being executed by the computer processor to implement said computing, said determining, said generating, said storing, said indexing, and said verifying. | 0.506562 |
8,412,523 | 5 | 6 | 5. The dictation manager of claim 4 wherein the dictation server selector selects a dictation server based on a determination of the load balancer. | 5. The dictation manager of claim 4 wherein the dictation server selector selects a dictation server based on a determination of the load balancer. 6. The dictation manager of claim 5 wherein the determination is based on at least one of queue length, average time to process, process load, and memory. | 0.5 |
6,134,532 | 58 | 62 | 58. A method for adapting an entity vector on a computer including a data storage, comprising: converting an observed behavior of a user into a behavior vector; modifying a profile vector indicative of the user based on the behavior vector; and modifying an entity vector indicative of an item based on the profile vector or the behavior vector. | 58. A method for adapting an entity vector on a computer including a data storage, comprising: converting an observed behavior of a user into a behavior vector; modifying a profile vector indicative of the user based on the behavior vector; and modifying an entity vector indicative of an item based on the profile vector or the behavior vector. 62. The method as defined in claim 58, wherein the computer is connected to a network, the network selected from the group consisting of: an intranet, a local area network, and the Internet. | 0.856712 |
10,120,850 | 6 | 7 | 6. A method in accordance with claim 1 wherein an identification and specification of said annotated fields is customizable by an end user. | 6. A method in accordance with claim 1 wherein an identification and specification of said annotated fields is customizable by an end user. 7. A method in accordance with claim 6 wherein said one or more informational items are stored as meta-data associated with the digital image. | 0.5 |
9,400,956 | 1 | 5 | 1. A computer program product for generating a first answer relationship in a first answer sequence of a plurality of answer sequences, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising: receiving, from a user, a request for instructions to achieve a result; identifying, in response to the received request, the plurality of answer sequences, wherein each answer sequence of the plurality of answer sequences is a single, organized, complete answer that includes a plurality of answers to be used in combination to achieve the result; identifying the first answer sequence of the plurality of answer sequences, the first answer sequence including a first answer and a second answer; analyzing, using the first answer and the second answer, a corpus to identify a set of influence factors corresponding to both the first answer and the second answer, wherein each influence factor of the set of influence factors is a measure of compatibility between the first answer and the second answer when used in combination with each other; and generating, based on the set of influence factors, the first answer relationship between the first answer and the second answer. | 1. A computer program product for generating a first answer relationship in a first answer sequence of a plurality of answer sequences, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising: receiving, from a user, a request for instructions to achieve a result; identifying, in response to the received request, the plurality of answer sequences, wherein each answer sequence of the plurality of answer sequences is a single, organized, complete answer that includes a plurality of answers to be used in combination to achieve the result; identifying the first answer sequence of the plurality of answer sequences, the first answer sequence including a first answer and a second answer; analyzing, using the first answer and the second answer, a corpus to identify a set of influence factors corresponding to both the first answer and the second answer, wherein each influence factor of the set of influence factors is a measure of compatibility between the first answer and the second answer when used in combination with each other; and generating, based on the set of influence factors, the first answer relationship between the first answer and the second answer. 5. The computer program product of claim 1 , wherein the analyzing, using the first answer and the second answer, the corpus to identify the set of influence factors corresponding to both the first answer and the second answer includes: identifying a first characteristic relationship between the first answer and a characteristic; identifying a second characteristic relationship between the second answer and the characteristic; and identifying, based on comparing the first characteristic relationship and the second characteristic relationship, a first influence factor of the set of influence factors. | 0.716558 |
9,355,131 | 1 | 2 | 1. A method, comprising: retaining, in a data storage by a version analyzer embodied on a non-transitory computer readable medium, all or substantially all versions of a document created immediately following a creation time of the document; retaining, in the data storage by the version analyzer, all or substantially all versions of the document created at a given time and immediately preceding the given time; and selectively culling, from the data storage by the version analyzer based on one or more criteria, at least one non-retained version of the document created within a period of time between the creation time of the document and the given time, the one or more criteria including at least one policy, the selective culling including determining, by the version analyzer, if and how the at least one policy is to be applied, the determining resulting in the at least one non-retained version of the document being selected and culled from the data storage. | 1. A method, comprising: retaining, in a data storage by a version analyzer embodied on a non-transitory computer readable medium, all or substantially all versions of a document created immediately following a creation time of the document; retaining, in the data storage by the version analyzer, all or substantially all versions of the document created at a given time and immediately preceding the given time; and selectively culling, from the data storage by the version analyzer based on one or more criteria, at least one non-retained version of the document created within a period of time between the creation time of the document and the given time, the one or more criteria including at least one policy, the selective culling including determining, by the version analyzer, if and how the at least one policy is to be applied, the determining resulting in the at least one non-retained version of the document being selected and culled from the data storage. 2. The method according to claim 1 , further comprising: obtaining the least one policy from a configuration file or a database. | 0.853881 |
8,560,315 | 5 | 6 | 5. The conference support device according to claim 1 , wherein the processor is further configured to execute the computer-readable instructions to: select, as a second participant image, from among participant images that are stored in a storage portion, one of the participant images that is associated with information that specifies the second participant, the participant images being images of the conference participants and being associated with information that specifies the conference participants, respectively, wherein the creating the display image includes: associating the text data with the first portion of the captured image that corresponds to the first participant, and associating the selected second participant image, as the specified image, with the first portion of the captured image that corresponds to the first participant. | 5. The conference support device according to claim 1 , wherein the processor is further configured to execute the computer-readable instructions to: select, as a second participant image, from among participant images that are stored in a storage portion, one of the participant images that is associated with information that specifies the second participant, the participant images being images of the conference participants and being associated with information that specifies the conference participants, respectively, wherein the creating the display image includes: associating the text data with the first portion of the captured image that corresponds to the first participant, and associating the selected second participant image, as the specified image, with the first portion of the captured image that corresponds to the first participant. 6. The conference support device according to claim 5 , wherein the receiving the voice includes receiving, along with the voice that is generated by the first participant, information that specifies the first participant, and the creating the display image includes: specifying the first portion of the captured image that corresponds to the first participant, based on one of the participant images that is associated with the information that specifies the first participant, among the participant images that are stored in the storage portion, and associating the text data and the selected second participant image with the specified first portion of the captured image. | 0.5 |
8,676,821 | 7 | 8 | 7. A data processing system, comprising: a query engine; and a summary filter transformation system coupled to the query engine, wherein the summary filter transformation system is configured to: receive a query having a select list, a from element, and a summary filter having a filter condition; analyze the filter condition to determine a filter group of the filter condition, the filter group comprising a list of expressions over which the filter condition is computed; create a derived table for computing the filter condition, the derived table having a select list, creating the derived table comprising: adding the list of expressions of the filter group to the derived table as one or more columns of the derived table's select list; and adding the filter condition to the derived table as a one or more columns of the derived table's select list; transform the received query by combining the received query with the derived table, transforming the received query comprising: traverse the select list of the received query and transforming one or more aggregates of the select list to reference one or more of the columns of the derived table; transform the from element of the received query to reference the derived table; and add a WHERE clause to the transformed original query, the WHERE clause based on the filter condition and referencing one or more of the columns of the derived table. | 7. A data processing system, comprising: a query engine; and a summary filter transformation system coupled to the query engine, wherein the summary filter transformation system is configured to: receive a query having a select list, a from element, and a summary filter having a filter condition; analyze the filter condition to determine a filter group of the filter condition, the filter group comprising a list of expressions over which the filter condition is computed; create a derived table for computing the filter condition, the derived table having a select list, creating the derived table comprising: adding the list of expressions of the filter group to the derived table as one or more columns of the derived table's select list; and adding the filter condition to the derived table as a one or more columns of the derived table's select list; transform the received query by combining the received query with the derived table, transforming the received query comprising: traverse the select list of the received query and transforming one or more aggregates of the select list to reference one or more of the columns of the derived table; transform the from element of the received query to reference the derived table; and add a WHERE clause to the transformed original query, the WHERE clause based on the filter condition and referencing one or more of the columns of the derived table. 8. The data processing system as claimed in claim 7 , wherein the summary filter transformation system is configured to create the derived table further by: identifying aggregates in the select list of the received query having a PREFILTER clause; adding the identified PREFILTER aggregates from the select list of the received query to the select list of the derived table; and replacing the PREFILTER aggregates in the select list of the received query with a reference to the added PREFILTER aggregate in the derived table. | 0.594136 |
9,953,646 | 1 | 9 | 1. A computer-implemented method for dynamically presenting a prewritten text in a graphical user interface comprising a) receiving a text artifact, said text artifact containing a plurality of artifact words; b) storing, via a processor, said text artifact in a memory device of a computer; c) retrieving, via said processor, said text artifact; d) displaying said text artifact on the display screen of said computer; e) receiving a vocal input; f) generating, via said processor, a text file representing the words spoken in said vocal input, said text file containing a plurality of hypothesis words; g) comparing, via said processor, a predetermined number of said hypothesis words to a predetermined number of said artifact words; h) determining a match location in said text artifact where a specific number of said predetermined number of hypothesis words match a specific number of said predetermined number of artifact words; i) altering, via said processor, the display on said display screen to display said match location on said display screen of said computer; j) determining, via said processor, the font size of the text of said text artifact as displayed on said display screen; k) determining, via said processor, the orientation of the electronic screen displaying the text of the text artifact; l) altering, via said processor, said predetermined number of artifact words utilized for comparing to said predetermined number of hypothesis words. | 1. A computer-implemented method for dynamically presenting a prewritten text in a graphical user interface comprising a) receiving a text artifact, said text artifact containing a plurality of artifact words; b) storing, via a processor, said text artifact in a memory device of a computer; c) retrieving, via said processor, said text artifact; d) displaying said text artifact on the display screen of said computer; e) receiving a vocal input; f) generating, via said processor, a text file representing the words spoken in said vocal input, said text file containing a plurality of hypothesis words; g) comparing, via said processor, a predetermined number of said hypothesis words to a predetermined number of said artifact words; h) determining a match location in said text artifact where a specific number of said predetermined number of hypothesis words match a specific number of said predetermined number of artifact words; i) altering, via said processor, the display on said display screen to display said match location on said display screen of said computer; j) determining, via said processor, the font size of the text of said text artifact as displayed on said display screen; k) determining, via said processor, the orientation of the electronic screen displaying the text of the text artifact; l) altering, via said processor, said predetermined number of artifact words utilized for comparing to said predetermined number of hypothesis words. 9. The method as in claim 1 further comprising establishing a scroll rate for said text artifact on said display screen of said computer. | 0.807584 |
8,504,408 | 11 | 13 | 11. A system for building an integrated customer analytics solution for an enterprise comprising one or more data sources in a client-server architecture, wherein the system comprises one or more user devices and one or more servers for processing requests received from the one or more user devices, the system comprising: a data management module configured to: extract customer data from an operational data store, the operational data store storing the customer data in the form of data structures comprising one or more data fields gathered from the one or more data sources, wherein at least two data sources are disparate data sources which store data using different formats, and further wherein the extraction is performed to ascertain that the data structure corresponds to a predetermined data structure; transform the extracted customer data based on one or more predetermined formats; transform the existing one or more data fields of the operational data store into a first set of new data fields based on business specifications and requirement analysis of the enterprise; load the transformed customer data and the first set of new data fields into a data mart; and update the data mart with a second set of new data fields and new customer data corresponding to the second set of new data fields over a period of time of predetermined customer lifecycle stages, wherein the updating of the data mart is based on the business specifications and the requirement analysis of the enterprise; a statistical package module configured to: analyze the processed customer data stored in the data mart using one or more codes to generate one or more statistical techniques, the statistical techniques being at least one of descriptive statistics, cluster analysis, forecasting, survival analysis and logit model, wherein the one or more codes are developed using the statistical package module, and further wherein the generated one or more statistical techniques facilitate analyzing one or more predetermined attributes related to the customer; derive one or more statistical model outputs using the one or more generated statistical techniques, wherein the statistical model outputs represent one or more metrics corresponding to the analyzed attributes; generate one or more statistical models corresponding to the one or more statistical model outputs, the one or more statistical models being associated with one or more scores which are computed based on the statistical model outputs, wherein the one or more scores facilitate to predict likelihood of customer behavior towards products, services and other customer related aspects associated with the enterprise; and a reporting module configured to generate one or more reports based on the processed customer data stored in the data mart and the statistical model outputs, wherein one or more analytical modules are built for the predetermined customer lifecycle stages using the one or more reports and the one or more statistical models resulting in the integrated customer analytics solution. | 11. A system for building an integrated customer analytics solution for an enterprise comprising one or more data sources in a client-server architecture, wherein the system comprises one or more user devices and one or more servers for processing requests received from the one or more user devices, the system comprising: a data management module configured to: extract customer data from an operational data store, the operational data store storing the customer data in the form of data structures comprising one or more data fields gathered from the one or more data sources, wherein at least two data sources are disparate data sources which store data using different formats, and further wherein the extraction is performed to ascertain that the data structure corresponds to a predetermined data structure; transform the extracted customer data based on one or more predetermined formats; transform the existing one or more data fields of the operational data store into a first set of new data fields based on business specifications and requirement analysis of the enterprise; load the transformed customer data and the first set of new data fields into a data mart; and update the data mart with a second set of new data fields and new customer data corresponding to the second set of new data fields over a period of time of predetermined customer lifecycle stages, wherein the updating of the data mart is based on the business specifications and the requirement analysis of the enterprise; a statistical package module configured to: analyze the processed customer data stored in the data mart using one or more codes to generate one or more statistical techniques, the statistical techniques being at least one of descriptive statistics, cluster analysis, forecasting, survival analysis and logit model, wherein the one or more codes are developed using the statistical package module, and further wherein the generated one or more statistical techniques facilitate analyzing one or more predetermined attributes related to the customer; derive one or more statistical model outputs using the one or more generated statistical techniques, wherein the statistical model outputs represent one or more metrics corresponding to the analyzed attributes; generate one or more statistical models corresponding to the one or more statistical model outputs, the one or more statistical models being associated with one or more scores which are computed based on the statistical model outputs, wherein the one or more scores facilitate to predict likelihood of customer behavior towards products, services and other customer related aspects associated with the enterprise; and a reporting module configured to generate one or more reports based on the processed customer data stored in the data mart and the statistical model outputs, wherein one or more analytical modules are built for the predetermined customer lifecycle stages using the one or more reports and the one or more statistical models resulting in the integrated customer analytics solution. 13. The system of claim 11 , wherein the statistical package module comprises R-project. | 0.588785 |
6,151,576 | 27 | 28 | 27. Apparatus comprising a computer-readable storage medium tangibly embodying program instructions for presenting information in spoken form, the program instructions including instructions operable for causing a programmable processor to: read a mixed-media data stream comprising a text component and a digitized speech component, the text component comprising text segments identified in the mixed-media data stream as doubtful and the digitized speech component comprising digitized speech corresponding to the text segments identified as doubtful; convert the text not identified as doubtful to synthetic speech; and generate an audio waveform from the mixed-media data stream by combining the digitized speech and the synthetic speech. | 27. Apparatus comprising a computer-readable storage medium tangibly embodying program instructions for presenting information in spoken form, the program instructions including instructions operable for causing a programmable processor to: read a mixed-media data stream comprising a text component and a digitized speech component, the text component comprising text segments identified in the mixed-media data stream as doubtful and the digitized speech component comprising digitized speech corresponding to the text segments identified as doubtful; convert the text not identified as doubtful to synthetic speech; and generate an audio waveform from the mixed-media data stream by combining the digitized speech and the synthetic speech. 28. The apparatus of claim 27, wherein the program instructions further comprise instructions to: generate an audio waveform from the mixed-media data stream by combining the synthetic speech for the portions of the original speech where no digitized speech is present in the mixed-media data stream and speaking the digitized speech from the mixed-media data stream where it is present in the mixed-media data stream. | 0.5 |
9,740,635 | 1 | 3 | 1. A computing device comprising: a file cache; and a file cache manager coupled with the file cache, to implement a context-aware eviction policy to identify a candidate file for deletion from the file cache, from a plurality of individual files contained within the file cache, based at least in part on file-level context information associated with the individual files, wherein the file-level context information includes an indication of access recency and access frequency associated with the individual files, and wherein to identify the candidate file for deletion from the file cache is based, at least in part, on both the indication of access recency and the indication of access frequency of the individual files; wherein the file-level context information further includes an indication of application-level relationships between the individual files, including a file access pattern of an application under execution on the computing device; wherein the file cache manager is further to identify the candidate file for deletion from the file cache based at least in part on the indication of application-level relationships; and wherein to identify a candidate file for deletion from the file cache, based at least in part on the indication of application-level relationships, the file cache manager is further to eliminate for consideration those individual files that are indicated, by the file access pattern, as being accessed after an individual file that was recently accessed by the application. | 1. A computing device comprising: a file cache; and a file cache manager coupled with the file cache, to implement a context-aware eviction policy to identify a candidate file for deletion from the file cache, from a plurality of individual files contained within the file cache, based at least in part on file-level context information associated with the individual files, wherein the file-level context information includes an indication of access recency and access frequency associated with the individual files, and wherein to identify the candidate file for deletion from the file cache is based, at least in part, on both the indication of access recency and the indication of access frequency of the individual files; wherein the file-level context information further includes an indication of application-level relationships between the individual files, including a file access pattern of an application under execution on the computing device; wherein the file cache manager is further to identify the candidate file for deletion from the file cache based at least in part on the indication of application-level relationships; and wherein to identify a candidate file for deletion from the file cache, based at least in part on the indication of application-level relationships, the file cache manager is further to eliminate for consideration those individual files that are indicated, by the file access pattern, as being accessed after an individual file that was recently accessed by the application. 3. The computing device of device of claim 1 , wherein the file cache manager is further to observe file access patterns during execution of one or more applications; and generate the indication of application-level relationships between the individual files based at least in part on the observed file access patterns. | 0.766813 |
8,151,292 | 1 | 26 | 1. A system comprising: a processor coupled to a database, the database including a media instance and reaction data, the media instance comprising a plurality of media events, the reaction data received from a plurality of viewers viewing the media instance; a first module coupled to the processor, the first module generating aggregated reaction data by aggregating the reaction data from the plurality of viewers, the first module generating synchronized data by synchronizing the plurality of media events of the media instance with corresponding aggregated reaction data; and a second module coupled to the processor, the second module comprising a plurality of renderings and a user interface (UI) that provide controlled access to the synchronized data from a remote device, wherein the controlled access includes interactive control of analysis of the reaction data and the corresponding events of the media instance. | 1. A system comprising: a processor coupled to a database, the database including a media instance and reaction data, the media instance comprising a plurality of media events, the reaction data received from a plurality of viewers viewing the media instance; a first module coupled to the processor, the first module generating aggregated reaction data by aggregating the reaction data from the plurality of viewers, the first module generating synchronized data by synchronizing the plurality of media events of the media instance with corresponding aggregated reaction data; and a second module coupled to the processor, the second module comprising a plurality of renderings and a user interface (UI) that provide controlled access to the synchronized data from a remote device, wherein the controlled access includes interactive control of analysis of the reaction data and the corresponding events of the media instance. 26. The system of claim 1 , wherein the reaction data includes survey results. | 0.875399 |
8,176,098 | 11 | 12 | 11. A computer program product tangibly embodied in a computer-readable medium, the computer program product including instructions that, when executed, generate on a display device a graphical user interface for obtaining information from an object, the graphical user interface comprising: an object identification area for a user to enter an identification of a non-XML object, the non-XML object created using an object model that provides for: (1) organizing attributes under nodes in a hierarchy; and (2) creating, within the non-XML object, associations between the nodes, also to nodes in another non-XML object; an object portion selection area for presenting portions of the identified non-XML object such that any of them can be selected by the user; and a query editing area for the user to enter a query formulated using XQuery language without explicitly identifying any document in XML format; wherein an XML document is created to include any portion of the non-XML object selected by the user in the object portion selection area, and wherein the query entered by the user in the query editing area is performed on the created XML document. | 11. A computer program product tangibly embodied in a computer-readable medium, the computer program product including instructions that, when executed, generate on a display device a graphical user interface for obtaining information from an object, the graphical user interface comprising: an object identification area for a user to enter an identification of a non-XML object, the non-XML object created using an object model that provides for: (1) organizing attributes under nodes in a hierarchy; and (2) creating, within the non-XML object, associations between the nodes, also to nodes in another non-XML object; an object portion selection area for presenting portions of the identified non-XML object such that any of them can be selected by the user; and a query editing area for the user to enter a query formulated using XQuery language without explicitly identifying any document in XML format; wherein an XML document is created to include any portion of the non-XML object selected by the user in the object portion selection area, and wherein the query entered by the user in the query editing area is performed on the created XML document. 12. The computer program product of claim 11 , wherein the graphical user interface further comprises: a result presentation area presenting a result of performing the entered query on the created XML document. | 0.5 |
8,301,656 | 1 | 8 | 1. A method comprising: receiving, by one or more server devices, a first list of search results and a second list of search results, the first list being associated with a first category, the second list being associated with a second category that differs from the first category, the first category being higher ranked than the second category based on respective relevances of search results in the first list and search results in the second list to a search query; generating, by one or more processors of the one or more server devices, a document providing information associated with the first list and the second list, where the document includes a first area and a second area, the first area being more prominently presented, within the document, than the second area when the document is rendered, where the first area of the document is associated with the first list, where the first area presents information associated with at least one search result of the first list, the information presented in the first area including at least one snippet associated with, respectively, the at least one search result of the first list, and where the second area of the document is associated with the second list, where the second area presents information associated with at least one search result of the second list, and where the information presented in the second area does not include a textual snippet associated with any of the at least one search result of the second list; and outputting, by the one or more server devices, the document. | 1. A method comprising: receiving, by one or more server devices, a first list of search results and a second list of search results, the first list being associated with a first category, the second list being associated with a second category that differs from the first category, the first category being higher ranked than the second category based on respective relevances of search results in the first list and search results in the second list to a search query; generating, by one or more processors of the one or more server devices, a document providing information associated with the first list and the second list, where the document includes a first area and a second area, the first area being more prominently presented, within the document, than the second area when the document is rendered, where the first area of the document is associated with the first list, where the first area presents information associated with at least one search result of the first list, the information presented in the first area including at least one snippet associated with, respectively, the at least one search result of the first list, and where the second area of the document is associated with the second list, where the second area presents information associated with at least one search result of the second list, and where the information presented in the second area does not include a textual snippet associated with any of the at least one search result of the second list; and outputting, by the one or more server devices, the document. 8. The method of claim 1 , where the first area is larger than the second area when the document is rendered. | 0.766094 |
8,694,385 | 3 | 5 | 3. The computer-implemented method of claim 2 , wherein the type of selection action includes at least one of (i) causing display of additional information about the respective item, (ii) following a hyperlink within the additional information, (iii) adding the respective item to a tentative shopping list, and (iv) purchasing the respective item. | 3. The computer-implemented method of claim 2 , wherein the type of selection action includes at least one of (i) causing display of additional information about the respective item, (ii) following a hyperlink within the additional information, (iii) adding the respective item to a tentative shopping list, and (iv) purchasing the respective item. 5. The computer-implemented method of claim 3 , wherein each rating score further depends at least in part on a number of hyperlinks the previous user follows within the additional information. | 0.5 |
10,055,416 | 10 | 17 | 10. A hierarchical storage environment, comprising: at least two different storage tiers having different response times; and a content related tiering engine configured to: initiate a new document notification process in response to receipt of a new document for storage; evaluate enhanced metadata of the new document via a relationship analyzing process to produce a priority list defining a likelihood of possible access, wherein the enhanced metadata includes a set of keywords and/or references from said new document, wherein the enhanced metadata includes user file access history information and/or a user search history information, wherein the priority list is produced based on the access history information and/or a user search history in the enhanced metadata in combination with the set of keywords and/or references; and store the new document in a storage tier of the hierarchical storage environment according to the priority list. | 10. A hierarchical storage environment, comprising: at least two different storage tiers having different response times; and a content related tiering engine configured to: initiate a new document notification process in response to receipt of a new document for storage; evaluate enhanced metadata of the new document via a relationship analyzing process to produce a priority list defining a likelihood of possible access, wherein the enhanced metadata includes a set of keywords and/or references from said new document, wherein the enhanced metadata includes user file access history information and/or a user search history information, wherein the priority list is produced based on the access history information and/or a user search history in the enhanced metadata in combination with the set of keywords and/or references; and store the new document in a storage tier of the hierarchical storage environment according to the priority list. 17. The hierarchical storage environment according to claim 10 , wherein the content related tiering engine configured to: access the new document; trigger and/or implement a second document access notification process upon accessing the new document, the second document access notification process comprising: determining documents that are related to the new document based on the enhanced metadata and the priority list; placing the related documents in a highest level storage tier of the hierarchical storage environment; and updating the priority list. | 0.5 |
7,840,442 | 19 | 24 | 19. A computer readable storage medium tangibly storing computer readable instructions to perform a method comprising: gathering click information associated with a member of a search result set having a plurality of members, the search result set produced in response to a search; determining relative responsiveness of the member, compared with the other members of the search result set, based on the click information, and on a position of the member in an ordering for display of the search result set; generating a score for association with the member that reflects the relative responsiveness of the member to the search; and using the score to affect a response to a subsequent search. | 19. A computer readable storage medium tangibly storing computer readable instructions to perform a method comprising: gathering click information associated with a member of a search result set having a plurality of members, the search result set produced in response to a search; determining relative responsiveness of the member, compared with the other members of the search result set, based on the click information, and on a position of the member in an ordering for display of the search result set; generating a score for association with the member that reflects the relative responsiveness of the member to the search; and using the score to affect a response to a subsequent search. 24. The computer readable storage medium of claim 19 , the instructions further comprising adjusting said score to account for a specific knowledge of said member. | 0.657563 |
7,912,706 | 1 | 2 | 1. A method for entering information in an electronic equipment for composition of a message, the method comprising: receiving one or more symbols from an input device to create a message to be transmitted to and read by a recipient, wherein the symbols correspond to one or more alphanumeric characters; requesting local dictionary information related to the received one or more symbols from a local predictive text dictionary application resident in the electronic equipment; requesting remote dictionary information related to the received one or more symbols from a predictive text dictionary application stored on an associated remote server, wherein the request for remote dictionary information is transmitted automatically upon expiration of a predetermined period of time in response to the received one or more symbols from the input device; receiving the requested local dictionary information and the remote dictionary information, wherein the received local dictionary information and the remote dictionary information includes predictive text that begins with the symbols received from the input device; and outputting the predictive text in a user-sensible format, wherein the predictive text from the local dictionary information is output in priority before the predictive text received from the remote dictionary information. | 1. A method for entering information in an electronic equipment for composition of a message, the method comprising: receiving one or more symbols from an input device to create a message to be transmitted to and read by a recipient, wherein the symbols correspond to one or more alphanumeric characters; requesting local dictionary information related to the received one or more symbols from a local predictive text dictionary application resident in the electronic equipment; requesting remote dictionary information related to the received one or more symbols from a predictive text dictionary application stored on an associated remote server, wherein the request for remote dictionary information is transmitted automatically upon expiration of a predetermined period of time in response to the received one or more symbols from the input device; receiving the requested local dictionary information and the remote dictionary information, wherein the received local dictionary information and the remote dictionary information includes predictive text that begins with the symbols received from the input device; and outputting the predictive text in a user-sensible format, wherein the predictive text from the local dictionary information is output in priority before the predictive text received from the remote dictionary information. 2. The method according to claim 1 , wherein the received symbols are used to identify remote dictionary information including at least one of a word, phrase or expression stored in the remote predictive text dictionary application. | 0.5 |
9,870,203 | 1 | 5 | 1. A non-transitory computer-readable storage medium having stored thereon computer executable program code which, when executed on a computer system, causes the computer system to perform steps comprising: discover a Service Adaptation Definition Language (SADL) definition, the SADL definition representing a plurality of business entity types each associated with a model layer framework and each of the plurality of business entity types including at least one business entity; display, on a user interface, a representation of the SADL definition; receive an indication of a first selection of a first business entity type of the plurality of business entity types; receive an indication of a second selection of a second business entity type of the plurality of business entity types, the second business entity type being associated with a different model layer framework than the first business entity type; and define a new user interface using the first and second business entity types, wherein the new user interface works with the model layer framework of the first business entity type and with the different model layer framework of the second business entity type. | 1. A non-transitory computer-readable storage medium having stored thereon computer executable program code which, when executed on a computer system, causes the computer system to perform steps comprising: discover a Service Adaptation Definition Language (SADL) definition, the SADL definition representing a plurality of business entity types each associated with a model layer framework and each of the plurality of business entity types including at least one business entity; display, on a user interface, a representation of the SADL definition; receive an indication of a first selection of a first business entity type of the plurality of business entity types; receive an indication of a second selection of a second business entity type of the plurality of business entity types, the second business entity type being associated with a different model layer framework than the first business entity type; and define a new user interface using the first and second business entity types, wherein the new user interface works with the model layer framework of the first business entity type and with the different model layer framework of the second business entity type. 5. The non-transitory computer-readable storage medium of claim 1 , wherein when the user interface is being operated by an end user, the steps further comprise triggering at least one of query, create, read, update and delete operations associated with the business entity. | 0.670673 |
8,627,295 | 1 | 3 | 1. A computer implemented method for testing a user interface, comprising: extracting object data associated with user interface elements from a file associated with the user interface; storing an object definition for respective ones of the user interface elements in memory; referencing an automation rule with the object definition to obtain a testing sequence for the user interface elements, wherein the testing sequence obtained from the automation rule is based on a type of respective ones of the user interface elements, wherein extracting the object data from the file associated with the user interface comprises referencing a set of extraction rules configured to identify the types of the user interface elements; referencing a test definition with the object definition to obtain one or more attributes of the user interface elements to be tested, wherein the object data associated with the user interface elements includes the attributes of the corresponding user interface elements; and generating, via a processor, a test script for the user interface using the one or more attributes of the user interface elements and the testing sequence. | 1. A computer implemented method for testing a user interface, comprising: extracting object data associated with user interface elements from a file associated with the user interface; storing an object definition for respective ones of the user interface elements in memory; referencing an automation rule with the object definition to obtain a testing sequence for the user interface elements, wherein the testing sequence obtained from the automation rule is based on a type of respective ones of the user interface elements, wherein extracting the object data from the file associated with the user interface comprises referencing a set of extraction rules configured to identify the types of the user interface elements; referencing a test definition with the object definition to obtain one or more attributes of the user interface elements to be tested, wherein the object data associated with the user interface elements includes the attributes of the corresponding user interface elements; and generating, via a processor, a test script for the user interface using the one or more attributes of the user interface elements and the testing sequence. 3. The computer implemented method as defined in claim 1 , further comprising executing the test script to test the user interface. | 0.886482 |
8,285,537 | 2 | 24 | 2. A method as recited in claim 1 , wherein said predicting uses data available to an application other than the speech recognizer. | 2. A method as recited in claim 1 , wherein said predicting uses data available to an application other than the speech recognizer. 24. A method as recited in claim 2 , wherein said augmenting includes approximating the native pronunciation of the proper noun in the second language in text to which pronunciation rules of the first language will be applied by the speech recognizer. | 0.782118 |
7,849,416 | 1 | 5 | 1. A computer-implemented method for creating a prototype that includes motion control, machine vision, and Data Acquisition (DAQ) functionality, the method comprising: displaying a graphical user interface (GUI) that provides GUI access to a set of operations, wherein the set of operations includes one or more motion control operations, one or more machine vision operations, and one or more DAQ operations; creating a sequence of operations, wherein creating the sequence comprises including a plurality of operations in the sequence in response to user input selecting each operation in the plurality of operations from the GUI, wherein including the plurality of operations in the sequence in response to the user input selecting each operation in the plurality of operations from the GUI comprises including the plurality of operations in the sequence without receiving user input specifying program code for performing the plurality of operations; wherein the plurality of operations included in the sequence includes at least one motion control operation, at least one machine vision operation, and at least one DAQ operation, wherein at least one of the DAQ operations included in the sequence is operable to control a DAQ measurement device to acquire measurement data of a device under test; wherein the method further comprises storing information representing the sequence of operations in a data structure, wherein the sequence of operations comprises the prototype. | 1. A computer-implemented method for creating a prototype that includes motion control, machine vision, and Data Acquisition (DAQ) functionality, the method comprising: displaying a graphical user interface (GUI) that provides GUI access to a set of operations, wherein the set of operations includes one or more motion control operations, one or more machine vision operations, and one or more DAQ operations; creating a sequence of operations, wherein creating the sequence comprises including a plurality of operations in the sequence in response to user input selecting each operation in the plurality of operations from the GUI, wherein including the plurality of operations in the sequence in response to the user input selecting each operation in the plurality of operations from the GUI comprises including the plurality of operations in the sequence without receiving user input specifying program code for performing the plurality of operations; wherein the plurality of operations included in the sequence includes at least one motion control operation, at least one machine vision operation, and at least one DAQ operation, wherein at least one of the DAQ operations included in the sequence is operable to control a DAQ measurement device to acquire measurement data of a device under test; wherein the method further comprises storing information representing the sequence of operations in a data structure, wherein the sequence of operations comprises the prototype. 5. The method of claim 1 , wherein the machine vision operation(s) in the sequence are operable to perform one or more of: acquire one or more images of the device under test; and/or analyze one or more acquired images of the device under test. | 0.865342 |
7,756,897 | 6 | 9 | 6. A computer readable recording medium storing a topic net generating program that generates a data structure representing a topic net for generating dialog information, the data structure including a plurality of nodes associated with topics and a plurality of links connecting the nodes, by causing a computer to execute: reading one record from a data table including a plurality of records, each record including field data associated with a plurality of fields; storing topic classes, associations between the topic classes and the plurality of fields of the read record, and associations between each of the topic classes, respectively; storing templates having fields embeddable with field data and the template fields associated with the stored topic classes respectively; generating nodes with respect to the fields associated with the field data included in the read record, the fields associated with any one of the stored topic classes, by: specifying a plurality of nodes corresponding to one topic based upon the field data in the read record, and stopping generation of duplicate nodes by not generating a node having a topic same as a node specified in the specifying of the plurality of nodes; generating topics corresponding to said generated nodes and storing the generated topic classes; linking each of the nodes generated in accordance with the stored associations between each of the topic classes; and generating dialog information by completing the blank fields in a template with the field data in the read record, wherein the fields associated with the field data of the read record and the blank fields correspond to same topic classes respectively and the fields are associated with any one of the stored topic classes including the generated topic classes. | 6. A computer readable recording medium storing a topic net generating program that generates a data structure representing a topic net for generating dialog information, the data structure including a plurality of nodes associated with topics and a plurality of links connecting the nodes, by causing a computer to execute: reading one record from a data table including a plurality of records, each record including field data associated with a plurality of fields; storing topic classes, associations between the topic classes and the plurality of fields of the read record, and associations between each of the topic classes, respectively; storing templates having fields embeddable with field data and the template fields associated with the stored topic classes respectively; generating nodes with respect to the fields associated with the field data included in the read record, the fields associated with any one of the stored topic classes, by: specifying a plurality of nodes corresponding to one topic based upon the field data in the read record, and stopping generation of duplicate nodes by not generating a node having a topic same as a node specified in the specifying of the plurality of nodes; generating topics corresponding to said generated nodes and storing the generated topic classes; linking each of the nodes generated in accordance with the stored associations between each of the topic classes; and generating dialog information by completing the blank fields in a template with the field data in the read record, wherein the fields associated with the field data of the read record and the blank fields correspond to same topic classes respectively and the fields are associated with any one of the stored topic classes including the generated topic classes. 9. The computer readable recording medium according to claim 6 , wherein the reading of the record is from a data file storing filed data associated with a plurality of fields in a tree structure. | 0.5 |
8,370,869 | 1 | 18 | 1. A non-transitory computer readable media containing digital information with at least one description record representing video content embedded within corresponding video information, the at least one description record generated by the method comprising: generating one or more video object descriptions from said video information using video object extraction processing; generating one or more video object hierarchy descriptions from said generated video object descriptions using object hierarchy construction and extraction processing, each video object hierarchy description describing at least one relationship between at least two objects in the video information; and generating one or more entity relation graph descriptions from said generated video object descriptions using entity relation graph generation processing, wherein said one or more generated entity relation graph descriptions describes non-hierarchical relationships between said objects associated with said one or more generated video object descriptions. | 1. A non-transitory computer readable media containing digital information with at least one description record representing video content embedded within corresponding video information, the at least one description record generated by the method comprising: generating one or more video object descriptions from said video information using video object extraction processing; generating one or more video object hierarchy descriptions from said generated video object descriptions using object hierarchy construction and extraction processing, each video object hierarchy description describing at least one relationship between at least two objects in the video information; and generating one or more entity relation graph descriptions from said generated video object descriptions using entity relation graph generation processing, wherein said one or more generated entity relation graph descriptions describes non-hierarchical relationships between said objects associated with said one or more generated video object descriptions. 18. The computer readable media of claim 1 , wherein said video object descriptions are in the form of encoded description information. | 0.821429 |
9,507,822 | 1 | 6 | 1. A method at a host organization for optimizing database queries in a database system of the host organization, the database system having one or more processors coupled with memory and including both a relational data store and a non-relational data store therein, the method comprising: operating the database system within the host organization; receiving a request at the host organization, the request specifying data for retrieval from the database system; retrieving, based on the request received at the host organization, one or more locations of the data for retrieval; generating, at the host organization, a database query based on the request, wherein the database query specifies a plurality of data elements for retrieval, the plurality of data elements including one or more data elements residing within the non-relational data store and one or more other data elements residing within the relational data store; optimizing the database query to include at least a sub-query or a pre-query; executing the optimized database query against the database system to retrieve the data; wherein optimizing the database query comprises: (i) identifying via a first sub-query to a table within relational data store, the first portion of the data for retrieval, (ii) identifying via a second sub-query to the non-relational data store, the second portion of the data for retrieval, (iii) identifying a data delta between the first sub-query that identifies the first portion of the data retrieved within the relational data store and the second sub-query that identifies the second portion of the data retrieved within the non-relational data store, and (iv) executing a third sub-query replicating missing data from the relational data store to the non-relational data store according to the data delta; wherein the database query comprises a join operation performed by initiating non-relational database queries on the non-relational data store where one or more foreign key parents are stored in the relational data store; and wherein the join operation comprises a plurality of sub-queries which are generated based on query optimizations available via an optimizer agent of the host organization, the query optimizations selected from the group comprising: a specified ordering for the plurality of sub-queries; a target data store for execution of a corresponding sub-query; one or more pre-query assessments based on the data for retrieval; a replication order from the relational data store to the non-relational data store; and an in-memory join operation specifying at least one or more of the plurality of data elements for retrieval from each of the relational data store and the non-relational data store and placed into memory accessible to the optimizer agent and a corresponding sub-query to retrieve the at least one or more of the plurality of data elements from the memory accessible to the optimizer agent in fulfillment of the request. | 1. A method at a host organization for optimizing database queries in a database system of the host organization, the database system having one or more processors coupled with memory and including both a relational data store and a non-relational data store therein, the method comprising: operating the database system within the host organization; receiving a request at the host organization, the request specifying data for retrieval from the database system; retrieving, based on the request received at the host organization, one or more locations of the data for retrieval; generating, at the host organization, a database query based on the request, wherein the database query specifies a plurality of data elements for retrieval, the plurality of data elements including one or more data elements residing within the non-relational data store and one or more other data elements residing within the relational data store; optimizing the database query to include at least a sub-query or a pre-query; executing the optimized database query against the database system to retrieve the data; wherein optimizing the database query comprises: (i) identifying via a first sub-query to a table within relational data store, the first portion of the data for retrieval, (ii) identifying via a second sub-query to the non-relational data store, the second portion of the data for retrieval, (iii) identifying a data delta between the first sub-query that identifies the first portion of the data retrieved within the relational data store and the second sub-query that identifies the second portion of the data retrieved within the non-relational data store, and (iv) executing a third sub-query replicating missing data from the relational data store to the non-relational data store according to the data delta; wherein the database query comprises a join operation performed by initiating non-relational database queries on the non-relational data store where one or more foreign key parents are stored in the relational data store; and wherein the join operation comprises a plurality of sub-queries which are generated based on query optimizations available via an optimizer agent of the host organization, the query optimizations selected from the group comprising: a specified ordering for the plurality of sub-queries; a target data store for execution of a corresponding sub-query; one or more pre-query assessments based on the data for retrieval; a replication order from the relational data store to the non-relational data store; and an in-memory join operation specifying at least one or more of the plurality of data elements for retrieval from each of the relational data store and the non-relational data store and placed into memory accessible to the optimizer agent and a corresponding sub-query to retrieve the at least one or more of the plurality of data elements from the memory accessible to the optimizer agent in fulfillment of the request. 6. The method of claim 1 , wherein the join operation is selected from the group comprising: a join operation specifying two or more relation tables from the relational data store; a join operation specifying at least one relation table from the relational data store and at least one or more data structures residing within the non-relational data store; a join operation specifying two or more separate and distinct data structures residing within the non-relational data store, wherein each of the two or more separate and distinct data structures lack an overlapping shared key. | 0.769414 |
9,916,187 | 1 | 2 | 1. A method comprising: receiving, from a client device, at a graph database system, a graph analytic program that is written in a graph-specific programming language; in response to receiving the graph analytic program, compiling, at the graph database system, the graph analytic program to generate executable code; prior to or in response to receiving the graph analytic program, loading, from a graph database into volatile memory of the graph database system, graph data; executing the executable code to directly access the graph data, wherein the graph data in volatile memory is in a first format and the corresponding version of graph data in the graph database is in a second format; generating, at the graph database system, results of executing the executable code; sending the results from the graph database system to the client device; wherein the method is performed by one or more computing devices. | 1. A method comprising: receiving, from a client device, at a graph database system, a graph analytic program that is written in a graph-specific programming language; in response to receiving the graph analytic program, compiling, at the graph database system, the graph analytic program to generate executable code; prior to or in response to receiving the graph analytic program, loading, from a graph database into volatile memory of the graph database system, graph data; executing the executable code to directly access the graph data, wherein the graph data in volatile memory is in a first format and the corresponding version of graph data in the graph database is in a second format; generating, at the graph database system, results of executing the executable code; sending the results from the graph database system to the client device; wherein the method is performed by one or more computing devices. 2. The method of claim 1 , wherein executing the executable code comprises: creating variables in local private memory, of the volatile memory, wherein the variables are not accessed during execution of other executables in the graph database; after the executable code is done executing, deleting the variables. | 0.856881 |
8,886,619 | 14 | 15 | 14. The diabetes management module of claim 11 wherein the given structured collection procedure specifies a pair of collection events that fall within a window of time which encapsulate a given event, where a first collection event in the pair of collection events occurs before the given event and a second collection event in the pair of collection events occurs after the given event; and the membership module analyzes the data entry only in relation to other data entries in the logbook that fall within the window of time defined for the given structured collection procedure. | 14. The diabetes management module of claim 11 wherein the given structured collection procedure specifies a pair of collection events that fall within a window of time which encapsulate a given event, where a first collection event in the pair of collection events occurs before the given event and a second collection event in the pair of collection events occurs after the given event; and the membership module analyzes the data entry only in relation to other data entries in the logbook that fall within the window of time defined for the given structured collection procedure. 15. The diabetes management module of claim 14 wherein the membership rule set includes a first rule that prohibits pairs of collection events from overlapping in time with each other; and a second rule that prohibits pairs of collection events from being nested within each other. | 0.5 |
8,126,742 | 1 | 4 | 1. A method for assigning at least a portion of an insured loss to an insurance claim processing organization comprising: receiving, with a computer processor in communication with a memory, insurance claim data for an insurance claim, the insurance claim data including insurance claim data variables corresponding to the insurance claim; determining, with the computer processor, matches between the insurance claim data variables and a plurality of predetermined insurance claim business rules based upon expected insurance claim data types corresponding to each of the predetermined insurance claim business rules; segmenting, with the computer processor, the insurance claim data variables into a plurality of insurance claim data segments based upon the matches between the insurance claim data variables and the predetermined insurance claim business rules, a respective insurance claim data segment including an insurance claim pattern type, wherein the insurance claim pattern type includes at least one of a type of insurance claim pattern type and an insurance business condition pattern type, and the insurance claim pattern type including insurance claim characteristics; matching, with the computer processor, each of the insurance claim characteristics in the insurance claim pattern type to a respective insurance claim data variable in the respective insurance claim data segment, each of the insurance claim characteristics including an insurance claim attribute and a claim characteristic attribute; assigning, with the computer processor, a discrete value to the insurance claim attribute for each of the insurance claim characteristics, the assigned discrete value for a respective insurance claim characteristic based upon the matched insurance claim data variable and the claim characteristic attribute of the respective insurance claim characteristic, wherein the discrete value is descriptive of the matched insurance claim data variable; grouping, with the computer processor, the insurance claim characteristics of the insurance claim pattern type to form insurance claim patterns within the insurance claim pattern type; generating, with the computer processor, one or more insurance claim pattern outcomes for each of the one or more insurance claim patterns based upon the discrete value assigned to the insurance claim attribute of each of the one or more insurance claim characteristics; storing, in the memory, the one or more insurance claim pattern outcomes for each of the one or more insurance claim patterns; generating, with the computer processor, a first pattern result for the insurance claim pattern type based upon pattern analysis of a first selection of the one or more stored insurance claim pattern outcomes; generating, with the computer processor, a second pattern result for the insurance claim pattern type based upon pattern analysis of a second selection of the one or more stored insurance claim pattern outcomes; storing, in the memory, the first pattern result and the second pattern result in the memory as insurance claim pattern results; and assigning, with the computer processor, at least one target organizational entity to at least one portion of the insurance claim based upon a match between at least some of the insurance claim pattern results stored in the memory and an assignment template associated with the at least one target organization entity. | 1. A method for assigning at least a portion of an insured loss to an insurance claim processing organization comprising: receiving, with a computer processor in communication with a memory, insurance claim data for an insurance claim, the insurance claim data including insurance claim data variables corresponding to the insurance claim; determining, with the computer processor, matches between the insurance claim data variables and a plurality of predetermined insurance claim business rules based upon expected insurance claim data types corresponding to each of the predetermined insurance claim business rules; segmenting, with the computer processor, the insurance claim data variables into a plurality of insurance claim data segments based upon the matches between the insurance claim data variables and the predetermined insurance claim business rules, a respective insurance claim data segment including an insurance claim pattern type, wherein the insurance claim pattern type includes at least one of a type of insurance claim pattern type and an insurance business condition pattern type, and the insurance claim pattern type including insurance claim characteristics; matching, with the computer processor, each of the insurance claim characteristics in the insurance claim pattern type to a respective insurance claim data variable in the respective insurance claim data segment, each of the insurance claim characteristics including an insurance claim attribute and a claim characteristic attribute; assigning, with the computer processor, a discrete value to the insurance claim attribute for each of the insurance claim characteristics, the assigned discrete value for a respective insurance claim characteristic based upon the matched insurance claim data variable and the claim characteristic attribute of the respective insurance claim characteristic, wherein the discrete value is descriptive of the matched insurance claim data variable; grouping, with the computer processor, the insurance claim characteristics of the insurance claim pattern type to form insurance claim patterns within the insurance claim pattern type; generating, with the computer processor, one or more insurance claim pattern outcomes for each of the one or more insurance claim patterns based upon the discrete value assigned to the insurance claim attribute of each of the one or more insurance claim characteristics; storing, in the memory, the one or more insurance claim pattern outcomes for each of the one or more insurance claim patterns; generating, with the computer processor, a first pattern result for the insurance claim pattern type based upon pattern analysis of a first selection of the one or more stored insurance claim pattern outcomes; generating, with the computer processor, a second pattern result for the insurance claim pattern type based upon pattern analysis of a second selection of the one or more stored insurance claim pattern outcomes; storing, in the memory, the first pattern result and the second pattern result in the memory as insurance claim pattern results; and assigning, with the computer processor, at least one target organizational entity to at least one portion of the insurance claim based upon a match between at least some of the insurance claim pattern results stored in the memory and an assignment template associated with the at least one target organization entity. 4. The method of claim 1 , further comprising: detecting, with the computer processor, a failure to assign the at least one target organizational entity to the at least one portion of the insurance claim; in response to the detected failure to assign the at least one target organizational entity to the insurance claim, identifying, with the computer processor, at least one target exception organizational entity based on the at least some of the insurance claim pattern results stored in the memory and the insurance claim data; determining, with the computer processor, an assignability of the at least one target exception organizational entity to the at least one portion of the insurance claim; and assigning, with the computer processor, the at least one target exception organizational entity to the at least one portion of the insurance claim based on the determined assignability of the at least one target exception organizational entity. | 0.5 |
9,350,862 | 15 | 16 | 15. The computer-readable storage device of claim 13 , wherein the action corresponds to a word string of the text. | 15. The computer-readable storage device of claim 13 , wherein the action corresponds to a word string of the text. 16. The computer-readable storage device of claim 15 , wherein the word string comprises a verb. | 0.5 |
4,737,922 | 1 | 3 | 1. A character data output apparatus, comprising: input means for inputting sentence data, and for inputting certain groups of character data with associated special format data which format data enables the corresponding group of character data to be printed in a desired format; first memory means for storing the certain groups of character data and the associated special format data inputted by said input means; second memory means for storing the sentence data inputted by said input means excluding the special format data; processing means for discriminating if the sentence data stored in said second memory means includes character data groups coinciding with the certain groups of character data stored in said first memory means; and output means for automatically outputting, when said processing means discriminates that a character data group coinciding with the certain groups of character data stored in said first memory means is included in the sentence data, all the coinciding character data groups in the sentence data stored in said second memory means in accordance with the associated special format data as stored in said first memory means. | 1. A character data output apparatus, comprising: input means for inputting sentence data, and for inputting certain groups of character data with associated special format data which format data enables the corresponding group of character data to be printed in a desired format; first memory means for storing the certain groups of character data and the associated special format data inputted by said input means; second memory means for storing the sentence data inputted by said input means excluding the special format data; processing means for discriminating if the sentence data stored in said second memory means includes character data groups coinciding with the certain groups of character data stored in said first memory means; and output means for automatically outputting, when said processing means discriminates that a character data group coinciding with the certain groups of character data stored in said first memory means is included in the sentence data, all the coinciding character data groups in the sentence data stored in said second memory means in accordance with the associated special format data as stored in said first memory means. 3. An apparatus according to claim 1, wherein said first memory means comprises a plurality of storage areas, and each area stores character data for one registered word and attribute code data corresponding to the special format data associated with the registered word. | 0.5 |
9,471,567 | 13 | 14 | 13. A system, comprising: a digital display; a microphone integrated within or interfaced to the digital display; and memory having a language translator that processes as executable instructions on one or more processors of the digital display; wherein the language translator is configured to detect voice conversations in proximity to the microphone and resolve a spoken language for the voice conversations and in response thereto translating original written information presented on the digital display in an original language to a target language for the spoken language and presenting the written information and written communication in the target language on the digital display, wherein the voice conversations are obtained from one of: a single person conversing on a phone in proximity to the microphone and multiple people conversing with one another in proximity to the microphone, and wherein the language translator is further configured to modify an original image presented on the digital display with a new image that is appropriate for a cultural of the spoken language. | 13. A system, comprising: a digital display; a microphone integrated within or interfaced to the digital display; and memory having a language translator that processes as executable instructions on one or more processors of the digital display; wherein the language translator is configured to detect voice conversations in proximity to the microphone and resolve a spoken language for the voice conversations and in response thereto translating original written information presented on the digital display in an original language to a target language for the spoken language and presenting the written information and written communication in the target language on the digital display, wherein the voice conversations are obtained from one of: a single person conversing on a phone in proximity to the microphone and multiple people conversing with one another in proximity to the microphone, and wherein the language translator is further configured to modify an original image presented on the digital display with a new image that is appropriate for a cultural of the spoken language. 14. The system of claim 13 , wherein the system is a kiosk. | 0.910334 |
7,689,433 | 15 | 20 | 15. A machine-readable storage device encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: accessing one or more databases that store published quotes that are attributable to one or more business executives, information identifying the one or more business executives to whom the quotes are attributable, information identifying one or more topics of the quotes, and information identifying one or more companies employing the business executives to whom the quotes are attributable; receiving a user selection of a name or topic; selecting the stored quotes that relate to the user-selected name or topic; grouping the selected quotes according to the business executives to whom the quotes are attributable, the companies employing the business executives to whom the quotes are attributable, and the topics of the quotes; calculating a frequency in which the business executives and the companies are quoted among the grouped quotes; comparing the calculated frequency in which the business executives are quoted to a past frequency of quotes attributable to each business executive; predicting that an authority of a particular business executive has risen or fallen when the calculated frequency associated with the particular business executive is greater or less than the past frequency, respectively; and providing a user interface including separate regions for displaying subsets of the quotes grouped according to the business executives to whom the quotes are attributable, the companies employing the business executives to whom the quotes are attributable, and the topics of the quotes, and the user interface identifying the particular business executive and indicating that the authority of the particular business executive has risen or fallen. | 15. A machine-readable storage device encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: accessing one or more databases that store published quotes that are attributable to one or more business executives, information identifying the one or more business executives to whom the quotes are attributable, information identifying one or more topics of the quotes, and information identifying one or more companies employing the business executives to whom the quotes are attributable; receiving a user selection of a name or topic; selecting the stored quotes that relate to the user-selected name or topic; grouping the selected quotes according to the business executives to whom the quotes are attributable, the companies employing the business executives to whom the quotes are attributable, and the topics of the quotes; calculating a frequency in which the business executives and the companies are quoted among the grouped quotes; comparing the calculated frequency in which the business executives are quoted to a past frequency of quotes attributable to each business executive; predicting that an authority of a particular business executive has risen or fallen when the calculated frequency associated with the particular business executive is greater or less than the past frequency, respectively; and providing a user interface including separate regions for displaying subsets of the quotes grouped according to the business executives to whom the quotes are attributable, the companies employing the business executives to whom the quotes are attributable, and the topics of the quotes, and the user interface identifying the particular business executive and indicating that the authority of the particular business executive has risen or fallen. 20. The computer storage medium of claim 15 , wherein the user interface further comprises a company profile region for displaying information regarding a company's headquarters, links to a profile page of the company's competitors, and a listing of the company's business executives. | 0.744144 |
8,683,311 | 12 | 18 | 12. A system including a computer processor and comprising the following computer-executable components: a receiver component that receives a uniform resource identifier that corresponds to a web page, the uniform resource identifier included in a message to be displayed by way of a communications application; a selector component that selects an extractor definition from a plurality of extractor definitions, wherein the extractor definition is configured to indicate one or more entities that are desirably extracted from the web page, wherein the extractor definition comprises a plurality of properties for extracting a particular entity, wherein the properties have priorities corresponding thereto, and wherein the extractor component extracts the particular entity based at least in part upon the priorities corresponding to the properties; an extractor component that extracts the one or more entities from the web page as indicated in the extractor definition; a packager component that packages the one or more entities extracted from the web page in a structured data object; and a display component that displays a summary of the web page based at least in part upon the structured data object, the display component displaying the summary of the web page in the message in place of the uniform resource identifier. | 12. A system including a computer processor and comprising the following computer-executable components: a receiver component that receives a uniform resource identifier that corresponds to a web page, the uniform resource identifier included in a message to be displayed by way of a communications application; a selector component that selects an extractor definition from a plurality of extractor definitions, wherein the extractor definition is configured to indicate one or more entities that are desirably extracted from the web page, wherein the extractor definition comprises a plurality of properties for extracting a particular entity, wherein the properties have priorities corresponding thereto, and wherein the extractor component extracts the particular entity based at least in part upon the priorities corresponding to the properties; an extractor component that extracts the one or more entities from the web page as indicated in the extractor definition; a packager component that packages the one or more entities extracted from the web page in a structured data object; and a display component that displays a summary of the web page based at least in part upon the structured data object, the display component displaying the summary of the web page in the message in place of the uniform resource identifier. 18. The system of claim 12 , wherein the plurality of extractor definitions comprises a first extractor that is applicable to web pages of any domain, and wherein the plurality of extractor definitions comprises a second extractor definition that is applicable to a domain of the uniform resource identifier. | 0.5 |
6,035,273 | 11 | 13 | 11. A device for compressing and transmitting speech in a communications system, comprising: means for receiving speech from an individual; a speech profile defining the coefficients of speech for the individual in a mathematical model; means for detecting changes in the individual's speech, said changes being defined by at least one of said coefficients of speech; means for converting said speech to text which operates in response to means for detecting to add hypertext characters to said text indicative of said detected changes; means for transmitting said text over said transmission media; means for converting said text received from said transmission media to speech; and means for delivering speech to the individual. | 11. A device for compressing and transmitting speech in a communications system, comprising: means for receiving speech from an individual; a speech profile defining the coefficients of speech for the individual in a mathematical model; means for detecting changes in the individual's speech, said changes being defined by at least one of said coefficients of speech; means for converting said speech to text which operates in response to means for detecting to add hypertext characters to said text indicative of said detected changes; means for transmitting said text over said transmission media; means for converting said text received from said transmission media to speech; and means for delivering speech to the individual. 13. The device according to claim 11, wherein said transmission media includes a cellular network. | 0.753769 |
9,411,886 | 15 | 20 | 15. A system for selecting advertisements in response to an internet query, comprising: a search server that receives an internet query (Q), the internet query including query terms (q), wherein the search server includes a microprocessor; an ad server that retrieves and ranks a first set of ad materials (S) in response to the internet query using a query likelihood model, S including a plurality of ad materials (s); a translation server that receives the first set of ad materials and selects sampling words using pseudo-relevance feedback and translation models, the internet query, and the first set of ad materials, wherein the translation model is used to calculate a translation probability that w translates into q(t(q|w)), the probability t(q|w) being used by the pseudo-relevance feedback model, wherein the ad server retrieves and ranks a second set of ad materials using an expanded query, the expanded query including the internet query and the selected sampling words; and a display of the user for receiving advertisements based on the second set of ad materials. | 15. A system for selecting advertisements in response to an internet query, comprising: a search server that receives an internet query (Q), the internet query including query terms (q), wherein the search server includes a microprocessor; an ad server that retrieves and ranks a first set of ad materials (S) in response to the internet query using a query likelihood model, S including a plurality of ad materials (s); a translation server that receives the first set of ad materials and selects sampling words using pseudo-relevance feedback and translation models, the internet query, and the first set of ad materials, wherein the translation model is used to calculate a translation probability that w translates into q(t(q|w)), the probability t(q|w) being used by the pseudo-relevance feedback model, wherein the ad server retrieves and ranks a second set of ad materials using an expanded query, the expanded query including the internet query and the selected sampling words; and a display of the user for receiving advertisements based on the second set of ad materials. 20. The system as recited in claim 15 , wherein the second set of ad materials is selected from a group consisting of, a content match ad for the internet query, and a sponsored search ad for the internet query. | 0.67236 |
8,959,523 | 8 | 9 | 8. Apparatus, comprising: a processor; computer memory holding computer program instructions executed by the processor to place virtual machines, the computer program instructions comprising: program code to represent physical entities upon which the virtual machines are to be placed as a hierarchical tree of bins; program code to receive one or more virtual machine-to-physical entity constraints on a placement scheme for the virtual machines; and program code to use information derived from the hierarchical tree and the virtual machine-to-physical entity constraints to define, for each level of the hierarchical tree, a placement solution that associates given virtual machines to given physical entities by solving a bin packing problem, wherein the bin packing problem is solved at a given level of the hierarchical tree using a placement algorithm, together with a placement solution from a prior level. | 8. Apparatus, comprising: a processor; computer memory holding computer program instructions executed by the processor to place virtual machines, the computer program instructions comprising: program code to represent physical entities upon which the virtual machines are to be placed as a hierarchical tree of bins; program code to receive one or more virtual machine-to-physical entity constraints on a placement scheme for the virtual machines; and program code to use information derived from the hierarchical tree and the virtual machine-to-physical entity constraints to define, for each level of the hierarchical tree, a placement solution that associates given virtual machines to given physical entities by solving a bin packing problem, wherein the bin packing problem is solved at a given level of the hierarchical tree using a placement algorithm, together with a placement solution from a prior level. 9. The apparatus as described in claim 8 wherein the bin packing problem is solved at each level of the hierarchical tree using virtual machine-to-physical entity constraints associated with that level and the placement algorithm. | 0.830882 |
9,501,298 | 1 | 5 | 1. A non-transitory computer-readable medium for remotely executing operations of an application that is provided through a computing device, the non-transitory computer-readable medium carrying instructions, that when executed by one or more processors, cause performance of operations comprising: (a) accessing a schema that logically represents a nodal hierarchy relating to execution of an application on a processing device, the nodal hierarchy including multiple nodes, including one or more category nodes and one or more content nodes; (b) providing, with the schema, an executable script that is associated with at least one node of the hierarchy; (c) processing, using the schema, a user input from the computing device, the user input being selective of one or more nodes of the hierarchy, and providing user interface content to the computing device, the user interface content corresponding to one of (i) one or more nodes, or (ii) a script content, generated as an output of an executed script that is associated with a selected node; and (d) executing, using the schema, the application on the processing device. | 1. A non-transitory computer-readable medium for remotely executing operations of an application that is provided through a computing device, the non-transitory computer-readable medium carrying instructions, that when executed by one or more processors, cause performance of operations comprising: (a) accessing a schema that logically represents a nodal hierarchy relating to execution of an application on a processing device, the nodal hierarchy including multiple nodes, including one or more category nodes and one or more content nodes; (b) providing, with the schema, an executable script that is associated with at least one node of the hierarchy; (c) processing, using the schema, a user input from the computing device, the user input being selective of one or more nodes of the hierarchy, and providing user interface content to the computing device, the user interface content corresponding to one of (i) one or more nodes, or (ii) a script content, generated as an output of an executed script that is associated with a selected node; and (d) executing, using the schema, the application on the processing device. 5. The non-transitory computer-readable medium of claim 1 , wherein the schema is generated from input by an application developer. | 0.782392 |
9,836,579 | 1 | 18 | 1. A hybrid electronic medical record system comprising: a structured database providing a plurality of records associated with particular patients and providing clinically derived medical data separated in different identified data fields: a medical record system computer processor configured to execute instructions loaded from a fixed memory to implement a database management engine communicating with the structured database and responding to structured queries to provide predefined reports collecting and organizing information from different fields of selected records according to the query; a document generator generating newly created pseudo-documents, wherein each newly created pseudo-document is correlated to a predefined report generated in response to a structured query, wherein the dynamic text in the newly created pseudo-document in linked to the data field of the single record, wherein the each pseudo-document are identified by a short document summary using predefined abstract templates; an inverted index indexing the newly created pseudo-documents according to text terms in the newly created pseudo-documents, wherein the inverted index is up-to-date ensures that returned information is never stale and permits a rapid response to text queries by pre-performing searching process; and a text search engine communicating with the inverted index and responding to the text queries to identify multiple ranked newly created pseudo-documents based on the indexing of the inverted index, wherein selection of an identified newly created pseudo-document provides the structured query to the database management engine, wherein the text search engine include a query expander to add additional medical words corresponding to the query and creates a union of reports that have linking words in the query. | 1. A hybrid electronic medical record system comprising: a structured database providing a plurality of records associated with particular patients and providing clinically derived medical data separated in different identified data fields: a medical record system computer processor configured to execute instructions loaded from a fixed memory to implement a database management engine communicating with the structured database and responding to structured queries to provide predefined reports collecting and organizing information from different fields of selected records according to the query; a document generator generating newly created pseudo-documents, wherein each newly created pseudo-document is correlated to a predefined report generated in response to a structured query, wherein the dynamic text in the newly created pseudo-document in linked to the data field of the single record, wherein the each pseudo-document are identified by a short document summary using predefined abstract templates; an inverted index indexing the newly created pseudo-documents according to text terms in the newly created pseudo-documents, wherein the inverted index is up-to-date ensures that returned information is never stale and permits a rapid response to text queries by pre-performing searching process; and a text search engine communicating with the inverted index and responding to the text queries to identify multiple ranked newly created pseudo-documents based on the indexing of the inverted index, wherein selection of an identified newly created pseudo-document provides the structured query to the database management engine, wherein the text search engine include a query expander to add additional medical words corresponding to the query and creates a union of reports that have linking words in the query. 18. The hybrid electronic medical record system of claim 1 wherein the ranked documents are represented by abstracts of the ranked documents generated at a time of a text query using a predefined abstract report collecting predefined information from the structured database. | 0.614846 |
8,984,165 | 1 | 7 | 1. A method comprising: wrapping, by a processing device, text in a markup language file with directives of a web server type page; identifying, by the processing device, an internal link in the markup language file using regular expression pattern matching, the internal link comprising a markup language extension; converting, by the processing device, the internal link into a web server type page link by replacing the markup language extension with a web server type page extension. | 1. A method comprising: wrapping, by a processing device, text in a markup language file with directives of a web server type page; identifying, by the processing device, an internal link in the markup language file using regular expression pattern matching, the internal link comprising a markup language extension; converting, by the processing device, the internal link into a web server type page link by replacing the markup language extension with a web server type page extension. 7. The method of claim 1 , further comprising: compiling, by the processing device, the web server type page file to generate a servlet on a web server, the servlet operable to dynamically generate a webpage in response to a web client request and to render content of the file in the webpage. | 0.5 |
8,135,721 | 12 | 16 | 12. A system for discovering the intent of a query comprising: a processor; and a memory coupled to the processor, the memory comprising: query log data; instructions stored on the memory that, when executed, cause the processor to: analyze query log data relating to a user query submitted by a user to one or more search engines; identify at least one related query that is suggested to the user; analyze query log data relating to the at least one related query; construct a first frequency vector for the user query and a second frequency vector for each of the at least one related query based on the analyzing, wherein the first frequency vector comprises an array of first query frequency score entries, each first query frequency score entry corresponding a different search engine in a set of search engines, wherein each second frequency vector comprises an array of related query frequency score entries, each related query frequency score entry corresponding to a different search engine in the set of search engines, and wherein each array has a length equal to the number of search engines in a set of search engines; determine a query intent vector based on an aggregate of a weighted first frequency vector and a weighted second frequency vector, wherein the query intent vector comprises an array of scores, wherein the array has a length equal to the number of search engines in the seat of search engines, wherein each score is associated with a different search engine of the set of search engines, and wherein the intent of the user query is derived from the query intent vector; compare each entry of the query intent vector to a threshold; for each entry of the query intent vector that exceeds the threshold, identify the search engine of the set of search engines that corresponds to that entry; and provide search results to the user based on a search of the first query on the identified search engines. | 12. A system for discovering the intent of a query comprising: a processor; and a memory coupled to the processor, the memory comprising: query log data; instructions stored on the memory that, when executed, cause the processor to: analyze query log data relating to a user query submitted by a user to one or more search engines; identify at least one related query that is suggested to the user; analyze query log data relating to the at least one related query; construct a first frequency vector for the user query and a second frequency vector for each of the at least one related query based on the analyzing, wherein the first frequency vector comprises an array of first query frequency score entries, each first query frequency score entry corresponding a different search engine in a set of search engines, wherein each second frequency vector comprises an array of related query frequency score entries, each related query frequency score entry corresponding to a different search engine in the set of search engines, and wherein each array has a length equal to the number of search engines in a set of search engines; determine a query intent vector based on an aggregate of a weighted first frequency vector and a weighted second frequency vector, wherein the query intent vector comprises an array of scores, wherein the array has a length equal to the number of search engines in the seat of search engines, wherein each score is associated with a different search engine of the set of search engines, and wherein the intent of the user query is derived from the query intent vector; compare each entry of the query intent vector to a threshold; for each entry of the query intent vector that exceeds the threshold, identify the search engine of the set of search engines that corresponds to that entry; and provide search results to the user based on a search of the first query on the identified search engines. 16. The system of claim 12 , further comprising instructions stored on the memory that, when executed, further cause the processor to track a Click Through Rate (“CTR”) associated with the at least one related query and eliminate a related query having a low CTR. | 0.5 |
8,181,850 | 14 | 20 | 14. A method of modifying a first document including content and a barcode encoding data related to the first document, said barcode comprising barcode elements each having a predetermined form, said method comprising the steps of: detecting a plurality of the barcode elements of the barcode in a representation of the first document; determining a visual difference between each of the detected barcode elements and the predetermined form of the barcode element; and removing at least some of the degradation of the content of the first document based on the determined visual difference, in order to compensate for degradation of the first document, wherein at least the determining and removing steps are implemented using a processor. | 14. A method of modifying a first document including content and a barcode encoding data related to the first document, said barcode comprising barcode elements each having a predetermined form, said method comprising the steps of: detecting a plurality of the barcode elements of the barcode in a representation of the first document; determining a visual difference between each of the detected barcode elements and the predetermined form of the barcode element; and removing at least some of the degradation of the content of the first document based on the determined visual difference, in order to compensate for degradation of the first document, wherein at least the determining and removing steps are implemented using a processor. 20. The method of claim 14 , wherein the barcode elements are dots and the 2-D barcode consists of dots modulated spatially about nominal grid positions. | 0.883206 |
10,122,706 | 14 | 15 | 14. The computer-readable storage medium of claim 13 , wherein the updating comprises applying a machine learning algorithm to the current password and the one or more previous passwords associated with the user identifier. | 14. The computer-readable storage medium of claim 13 , wherein the updating comprises applying a machine learning algorithm to the current password and the one or more previous passwords associated with the user identifier. 15. The computer-readable storage medium of claim 14 , wherein, in the event that a number of the one or more previous passwords is less than a threshold, the password preference model associated with the user identifier is a default password preference model. | 0.5 |
9,959,098 | 1 | 21 | 1. A data processing system comprising: one or more repositories, each repository containing one or more spreadsheet module definitions, and each spreadsheet module definition comprising module definition software code specifying one or more spreadsheet objects; a computer software application or linked library used by a computing device having an operational memory, the computer software application or linked library acting as a module factory that executes module definition software code associated with the one or more spreadsheet module definitions to create a spreadsheet workbook and provides the created spreadsheet workbook in the operational memory of the computing device; and a spreadsheet engine used by the computing device into which the spreadsheet workbook is loaded after creation and which manages and executes the spreadsheet workbook; the data processing system thus providing a runtime dynamically generated spreadsheet workbook. | 1. A data processing system comprising: one or more repositories, each repository containing one or more spreadsheet module definitions, and each spreadsheet module definition comprising module definition software code specifying one or more spreadsheet objects; a computer software application or linked library used by a computing device having an operational memory, the computer software application or linked library acting as a module factory that executes module definition software code associated with the one or more spreadsheet module definitions to create a spreadsheet workbook and provides the created spreadsheet workbook in the operational memory of the computing device; and a spreadsheet engine used by the computing device into which the spreadsheet workbook is loaded after creation and which manages and executes the spreadsheet workbook; the data processing system thus providing a runtime dynamically generated spreadsheet workbook. 21. The data processing system of claim 1 that comprises a software code compiler. | 0.848708 |
9,262,465 | 13 | 16 | 13. A computer system for determining whether a mismatch is present between content and a description associated with a literary work, the system comprising: one or more processor; and one or more memory having processor-executable instructions that, in response to execution by the one or more processor, cause the computer system to: receive, from a user, a content and a description; identify one or more description stems associated with the received description, each description stem to correspond to one or more words included in the description; identify one or more content stems associated with the received content, each content stem to correspond to one or more words included in the content; calculate a matching score based at least in part on whether one or more description stems identified in the description match one or more contents stems identified in the content; and determine whether the received description and the received content correspond to a same literary work based at least in part on the calculated matching score. | 13. A computer system for determining whether a mismatch is present between content and a description associated with a literary work, the system comprising: one or more processor; and one or more memory having processor-executable instructions that, in response to execution by the one or more processor, cause the computer system to: receive, from a user, a content and a description; identify one or more description stems associated with the received description, each description stem to correspond to one or more words included in the description; identify one or more content stems associated with the received content, each content stem to correspond to one or more words included in the content; calculate a matching score based at least in part on whether one or more description stems identified in the description match one or more contents stems identified in the content; and determine whether the received description and the received content correspond to a same literary work based at least in part on the calculated matching score. 16. The computer system of claim 13 , wherein the instructions to determine whether the received description and the received content correspond to the same literary work based at least in part on the calculated matching score comprise instructions to: receive a title associated with the same literary work; determine whether the received description and the received content correspond to the same literary work where the title verbatim matches one or more words in the received content or the calculated matching score indicates that the received content and the received description correspond to the same literary work. | 0.533632 |
8,671,109 | 29 | 32 | 29. The method defined in claim 28 , further comprising: identifying those of the reference video streams for which the at least one characteristic of the best matching snippet's associated segment for the respective reference video stream meets pre-determined criteria; and outputting an indication that the query video stream is deemed to include at least a portion of the identified reference video stream or streams. | 29. The method defined in claim 28 , further comprising: identifying those of the reference video streams for which the at least one characteristic of the best matching snippet's associated segment for the respective reference video stream meets pre-determined criteria; and outputting an indication that the query video stream is deemed to include at least a portion of the identified reference video stream or streams. 32. The method defined in claim 29 , wherein the characteristic comprises a ratio of matches within the segment and wherein the pre-determined criteria comprises the ratio exceeding a pre-determined ratio. | 0.560086 |
8,990,246 | 1 | 11 | 1. A computer-implemented method comprising steps of: receiving an original question from a user; generating two or more queries based on the original question; submitting each of the two or more queries to a search engine; for each particular query of the two or more queries, receiving, from the search engine, a separate search engine result for that particular query, thereby receiving a plurality of search engine results; wherein the search engine result for each particular query corresponds to a separate document set; wherein the plurality of search engine results correspond to a plurality of document sets; generating a single concept set based on terms in documents from the plurality of search engine results; wherein the single concept set is generated by, for each search engine results in the plurality of search engine results, identifying terms in documents from the search engine results, and adding at least a subset of said terms to said single concept set; using the single concept set to determine how to respond to the original question by performing at least one of: generating a refined set of search results for the original question based on the single concept set, and returning the refined set of search results as a response to the original question; or using the single concept set to identify questions similar to the original question; wherein the steps are performed by one or more computing devices. | 1. A computer-implemented method comprising steps of: receiving an original question from a user; generating two or more queries based on the original question; submitting each of the two or more queries to a search engine; for each particular query of the two or more queries, receiving, from the search engine, a separate search engine result for that particular query, thereby receiving a plurality of search engine results; wherein the search engine result for each particular query corresponds to a separate document set; wherein the plurality of search engine results correspond to a plurality of document sets; generating a single concept set based on terms in documents from the plurality of search engine results; wherein the single concept set is generated by, for each search engine results in the plurality of search engine results, identifying terms in documents from the search engine results, and adding at least a subset of said terms to said single concept set; using the single concept set to determine how to respond to the original question by performing at least one of: generating a refined set of search results for the original question based on the single concept set, and returning the refined set of search results as a response to the original question; or using the single concept set to identify questions similar to the original question; wherein the steps are performed by one or more computing devices. 11. The method of claim 1 , wherein the step of identifying terms in documents from the search engine results comprises mapping particular terms in a particular document within the particular document set to Wikipedia entries that correspond to the particular terms; and wherein the step of adding said terms to said concept set comprises adding, to said concept set, particular terms that are primary topics of at least some of said Wikipedia entries. | 0.856325 |
8,484,210 | 1 | 4 | 1. A computer-implemented method for representing markup language document data in a searchable format, comprising: parsing a markup language document into a data stream, wherein the data stream includes: a plurality of fields in a predefined format having a symbol table for at least one of the fields, wherein offset values for fields of the data stream are calculated automatically and without requiring storage in the data stream, and optimized field sizes based on a maximum value of data within each field; and storing the data stream in data storage. | 1. A computer-implemented method for representing markup language document data in a searchable format, comprising: parsing a markup language document into a data stream, wherein the data stream includes: a plurality of fields in a predefined format having a symbol table for at least one of the fields, wherein offset values for fields of the data stream are calculated automatically and without requiring storage in the data stream, and optimized field sizes based on a maximum value of data within each field; and storing the data stream in data storage. 4. The computer-implemented method of claim 1 , wherein the data stream farther comprises a link index field that includes a fixed data portion and a variable data portion. | 0.669231 |
9,817,896 | 40 | 43 | 40. The search server of claim 38 , the popularity information comprising a relative popularity score. | 40. The search server of claim 38 , the popularity information comprising a relative popularity score. 43. The search server of claim 40 , the relative popularity score reflecting a difference in sales of the particular thing as measured over a first period of time compared to sales of the particular thing as measured over to a second period of time. | 0.585 |
8,077,974 | 14 | 15 | 14. A computer system comprising: a computer network, wherein the computer network has a plurality of network elements, and wherein the plurality of network elements has a plurality of network interfaces; a network interface; an input module coupled to the network interface that receives topology data via the network interface; a processing unit; and a memory coupled to the processor, the memory having stored therein code associated with syllable input, the code causes the processor to perform a method comprising: drawing a desired base syllabic character using a stylus in a writing area on a syllabic level user interface disposed on the handheld device; determining whether a modifier is needed to the drawn desired base syllabic character, wherein the modifier comprises at least one of a consonant modifier, half consonant modifier and vowel modifier; and if the modifier is needed to the drawn desired base syllabic character, inputting associate data of a desired one of modifiers along with the drawn desired syllabic character to a base syllabic character recognizer by tapping on the desired one of modifiers that are disposed substantially around the writing area of a modifier panel in natural positions with respect to the base syllabic character; clearing the writing area upon tapping on the desired one of the modifiers; producing a candidate syllabic character including the tapped desired one of the modifiers by the base syllabic character recognizer upon recognition of the associated data; and displaying the produced candidate syllabic character using a first contrasting color in a progressive display panel. | 14. A computer system comprising: a computer network, wherein the computer network has a plurality of network elements, and wherein the plurality of network elements has a plurality of network interfaces; a network interface; an input module coupled to the network interface that receives topology data via the network interface; a processing unit; and a memory coupled to the processor, the memory having stored therein code associated with syllable input, the code causes the processor to perform a method comprising: drawing a desired base syllabic character using a stylus in a writing area on a syllabic level user interface disposed on the handheld device; determining whether a modifier is needed to the drawn desired base syllabic character, wherein the modifier comprises at least one of a consonant modifier, half consonant modifier and vowel modifier; and if the modifier is needed to the drawn desired base syllabic character, inputting associate data of a desired one of modifiers along with the drawn desired syllabic character to a base syllabic character recognizer by tapping on the desired one of modifiers that are disposed substantially around the writing area of a modifier panel in natural positions with respect to the base syllabic character; clearing the writing area upon tapping on the desired one of the modifiers; producing a candidate syllabic character including the tapped desired one of the modifiers by the base syllabic character recognizer upon recognition of the associated data; and displaying the produced candidate syllabic character using a first contrasting color in a progressive display panel. 15. The system of claim 14 , further comprising: if the modifier is not needed to the drawn desired base syllabic character, producing a candidate syllabic character by the base syllabic character recognizer upon tapping a tapping area located in the writing area and inputting the associated data into the base syllabic character recognizer; clearing the writing area upon tapping the tapping area; and displaying the produced candidate syllabic character in the progressive display panel of the syllabic level user interface in the first contrasting color. | 0.761945 |
7,650,512 | 1 | 4 | 1. A computer-implemented method of searching unstructured data stored in a database, the method comprising: receiving, at a first set of one or more computer systems, information indicative of a set of one or more application events that, upon occurrence, cause the first set of one or more computer systems to intercept database transactions instantiated by database applications with a database management system of the database and to generate electronic records from data in underlying database tables associated with execution of operations by the database applications identified in the database transactions; storing, using the first set of one or more computer systems, a plurality of electronic records created based on mappings between underlying database tables associated with execution of operations by the database applications and the plurality of electronic records in response to occurrence of the set of one or more application events in a common repository of electronic records in the database that provides an audit trail that cannot be altered or disabled by users associated with the database, wherein each electronic record comprises unstructured data stored in a character large-object (CLOB) format in a column of a table of the database; forwarding, to a client computer, information configured for generating a first graphical user interface, the first graphical user interface configured to enable users of the first graphical user interface to identify one or more references to sections of unstructured data within the plurality of electronic records stored in the database as elements of security rules; receiving, at a second set of one or more computer systems, information from a user via the first graphical user interface identifying a reference to a section of unstructured data within an electronic record stored in the database as an element of one or more security rules; generating, using the second set of one or more computer systems, the one or more security rules in response to the information from the user identifying the reference to a section of unstructured data within the electronic record as an element of the one or more security rules; creating, using the second set of one or more computer systems, a security protocol that protects the plurality of electronic records stored in the database against unauthorized access based on the one or more security rules; receiving, at a third set of one or more computer systems, a query designed to identify a set of electronic records stored in the database that meet criteria designated in the query; prior to executing the query at the database management system, modifying the query using the third set of one or more computer systems in accordance with the security protocol to create a modified query that includes the reference to a section of unstructured data within the electronic document identified by the user as an element of the one or more security rules; and running, using the database management system, the modified query against the unstructured data of the plurality of electronic records stored in the database. | 1. A computer-implemented method of searching unstructured data stored in a database, the method comprising: receiving, at a first set of one or more computer systems, information indicative of a set of one or more application events that, upon occurrence, cause the first set of one or more computer systems to intercept database transactions instantiated by database applications with a database management system of the database and to generate electronic records from data in underlying database tables associated with execution of operations by the database applications identified in the database transactions; storing, using the first set of one or more computer systems, a plurality of electronic records created based on mappings between underlying database tables associated with execution of operations by the database applications and the plurality of electronic records in response to occurrence of the set of one or more application events in a common repository of electronic records in the database that provides an audit trail that cannot be altered or disabled by users associated with the database, wherein each electronic record comprises unstructured data stored in a character large-object (CLOB) format in a column of a table of the database; forwarding, to a client computer, information configured for generating a first graphical user interface, the first graphical user interface configured to enable users of the first graphical user interface to identify one or more references to sections of unstructured data within the plurality of electronic records stored in the database as elements of security rules; receiving, at a second set of one or more computer systems, information from a user via the first graphical user interface identifying a reference to a section of unstructured data within an electronic record stored in the database as an element of one or more security rules; generating, using the second set of one or more computer systems, the one or more security rules in response to the information from the user identifying the reference to a section of unstructured data within the electronic record as an element of the one or more security rules; creating, using the second set of one or more computer systems, a security protocol that protects the plurality of electronic records stored in the database against unauthorized access based on the one or more security rules; receiving, at a third set of one or more computer systems, a query designed to identify a set of electronic records stored in the database that meet criteria designated in the query; prior to executing the query at the database management system, modifying the query using the third set of one or more computer systems in accordance with the security protocol to create a modified query that includes the reference to a section of unstructured data within the electronic document identified by the user as an element of the one or more security rules; and running, using the database management system, the modified query against the unstructured data of the plurality of electronic records stored in the database. 4. The method of claim 1 wherein access to electronic records in the common repository is automatically denied unless the security protocol grants such access; and wherein the security protocol comprises a plurality of security rules that grant access to the electronic record within the database based on content of one or more sections of unstructured data within the electronic records whose corresponding references are identified as elements of the plurality of security rules. | 0.757789 |
7,974,912 | 1 | 11 | 1. A method that manages pay-per-click advertising, by determining an amount to be charged in response to a click of a hyperlink associated with a target keyword, comprising accessing with a computer processor, a particular amount a first advertiser is willing to be charged in response to a click of a hyperlink associated with said first advertiser, accessing with a computer processor, a statistic of relevance to said first advertiser and a statistic of relevance to a second advertiser, said statistics being related to one or more of rate of use by users, number of times a hyperlink was viewed, data that relates to an increase or decrease in the use of a keyword by users, demographics of users associated with a keyword, or demographics of advertisers associated with a keyword, and without human intervention, determining with a computer processor, an amount to be charged to said second advertiser in response to a click of a hyperlink associated with said target keyword and said second advertiser, wherein said amount to be charged to said second advertiser is determined using said particular amount, and is also determined using said statistic of relevance to said first advertiser and said statistic of relevance to said second advertiser. | 1. A method that manages pay-per-click advertising, by determining an amount to be charged in response to a click of a hyperlink associated with a target keyword, comprising accessing with a computer processor, a particular amount a first advertiser is willing to be charged in response to a click of a hyperlink associated with said first advertiser, accessing with a computer processor, a statistic of relevance to said first advertiser and a statistic of relevance to a second advertiser, said statistics being related to one or more of rate of use by users, number of times a hyperlink was viewed, data that relates to an increase or decrease in the use of a keyword by users, demographics of users associated with a keyword, or demographics of advertisers associated with a keyword, and without human intervention, determining with a computer processor, an amount to be charged to said second advertiser in response to a click of a hyperlink associated with said target keyword and said second advertiser, wherein said amount to be charged to said second advertiser is determined using said particular amount, and is also determined using said statistic of relevance to said first advertiser and said statistic of relevance to said second advertiser. 11. The method of claim 1 further comprising sending said amount to a computer responsible for making decisions on said second advertiser's use of pay-per-click marketing. | 0.684502 |
8,813,049 | 7 | 8 | 7. A method, comprising: a compiler receiving source code for a computer program; the compiler determining that the source code includes an assignment context associating a variable with a value, the assignment context having: a declaration expression introducing the variable, wherein the declaration expression specifies a part of a type for the variable and does not specify another part of the type for the variable, wherein: the type for the variable is a parameterized type; the part of the type specified in the declaration expression comprises a ground type; and the part of the type not specified in the declaration expression comprises one or more type arguments for the parameterized type; and an initialization expression whose evaluation will result in the value, wherein a type of the initialization expression is a parameterized type corresponding to a given ground type and one or more type arguments; the compiler inferring the type for the variable based at least on the specified part of the type in the parameterized type in the declaration expression and on the parameterized type of the initialization expression, wherein to infer the type for the variable, the compiler: identifies a generic type corresponding to the parameterized type of the initialization expression; identifies a generic supertype of the identified generic type, wherein the identified generic supertype has the same ground type as a ground type indicated by the part of the type for the variable introduced in the declaration expression; and infers a parameterized type for the variable by parameterizing the generic supertype with one or more type arguments of the parameterized type of the initialization expression; in response to said inferring, the compiler binding the variable to the inferred type; and the compiler compiling the source code into an executable version of the computer program, wherein the compiling is dependent on the binding of the variable to the inferred type. | 7. A method, comprising: a compiler receiving source code for a computer program; the compiler determining that the source code includes an assignment context associating a variable with a value, the assignment context having: a declaration expression introducing the variable, wherein the declaration expression specifies a part of a type for the variable and does not specify another part of the type for the variable, wherein: the type for the variable is a parameterized type; the part of the type specified in the declaration expression comprises a ground type; and the part of the type not specified in the declaration expression comprises one or more type arguments for the parameterized type; and an initialization expression whose evaluation will result in the value, wherein a type of the initialization expression is a parameterized type corresponding to a given ground type and one or more type arguments; the compiler inferring the type for the variable based at least on the specified part of the type in the parameterized type in the declaration expression and on the parameterized type of the initialization expression, wherein to infer the type for the variable, the compiler: identifies a generic type corresponding to the parameterized type of the initialization expression; identifies a generic supertype of the identified generic type, wherein the identified generic supertype has the same ground type as a ground type indicated by the part of the type for the variable introduced in the declaration expression; and infers a parameterized type for the variable by parameterizing the generic supertype with one or more type arguments of the parameterized type of the initialization expression; in response to said inferring, the compiler binding the variable to the inferred type; and the compiler compiling the source code into an executable version of the computer program, wherein the compiling is dependent on the binding of the variable to the inferred type. 8. The method of claim 7 , wherein the given ground type for the declaration expression is different than the given ground type for the initialization expression. | 0.758929 |
8,412,698 | 14 | 16 | 14. A volatile or non-volatile computer-readable non-transitory storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform: presenting, to a querier, a single interface that includes two mechanisms for specifying search terms for the same query in two different manners; wherein the first mechanism includes first controls for receiving a query string from the querier; wherein the second mechanism includes second controls for selecting one of a plurality of selectable items; wherein each selectable item of the plurality of selectable items corresponds to a filter record of a plurality of filter records; wherein said first controls allow the querier to enter one or more search terms that comprise the query string; wherein said second controls allow the querier to specify which filter record, of the plurality of filter records, to use to generate an amended query string based on said query string; receiving a request from the querier, wherein receiving said request includes receiving a first set of search terms from the querier through said first controls and receiving, through said second controls, a selection of a selectable item; based on the request indicating the selection of the selectable item, determining that a selected filter record should be used to process the request, wherein the selected filter record corresponds to the selectable item that was selected through said second controls and includes a set of filter elements that correspond to a second set of search terms; adding search terms that correspond to the filter elements associated with the selected filter record to the first set of search terms to generate said amended query string that includes both the first set of search terms and the second set of search terms; and performing a document-corpus search of a document-corpus by treating the second set of search terms as if they were a part of said first set of search terms submitted through said first controls, to identify a set of documents relevant to the both the first set of search terms and the second set of search terms; wherein performing the document-corpus search involves comparing both the first set of search terms and the second set of search terms to terms contained in documents that belong to the document-corpus. | 14. A volatile or non-volatile computer-readable non-transitory storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform: presenting, to a querier, a single interface that includes two mechanisms for specifying search terms for the same query in two different manners; wherein the first mechanism includes first controls for receiving a query string from the querier; wherein the second mechanism includes second controls for selecting one of a plurality of selectable items; wherein each selectable item of the plurality of selectable items corresponds to a filter record of a plurality of filter records; wherein said first controls allow the querier to enter one or more search terms that comprise the query string; wherein said second controls allow the querier to specify which filter record, of the plurality of filter records, to use to generate an amended query string based on said query string; receiving a request from the querier, wherein receiving said request includes receiving a first set of search terms from the querier through said first controls and receiving, through said second controls, a selection of a selectable item; based on the request indicating the selection of the selectable item, determining that a selected filter record should be used to process the request, wherein the selected filter record corresponds to the selectable item that was selected through said second controls and includes a set of filter elements that correspond to a second set of search terms; adding search terms that correspond to the filter elements associated with the selected filter record to the first set of search terms to generate said amended query string that includes both the first set of search terms and the second set of search terms; and performing a document-corpus search of a document-corpus by treating the second set of search terms as if they were a part of said first set of search terms submitted through said first controls, to identify a set of documents relevant to the both the first set of search terms and the second set of search terms; wherein performing the document-corpus search involves comparing both the first set of search terms and the second set of search terms to terms contained in documents that belong to the document-corpus. 16. The volatile or non-volatile computer-readable non-transitory storage medium of claim 14 , wherein the querier is a computer. | 0.893914 |
8,620,747 | 3 | 4 | 3. The method of claim 1 further comprising: generating, by the computer system, data for simultaneously displaying both the web document and the at least one advertisement. | 3. The method of claim 1 further comprising: generating, by the computer system, data for simultaneously displaying both the web document and the at least one advertisement. 4. The method of claim 3 wherein the generated data allows the web document to be displayed in a first display area, and the at least one advertisement to be displayed in a second display area adjacent to the first display area. | 0.5 |
8,315,484 | 29 | 46 | 29. A system for resolving contradicting output data from an Optical Character Recognition (OCR) system, wherein the output data comprises at least one word with at least one uncertainly recognized character, wherein the at least one uncertainly recognized character is reported in the output data together with probable alternatives for the at least one uncertainly recognized character, and the words wherein this at least one uncertainly recognized character has been encountered in an image of a text being processed by the OCR system, the system comprises: a system component using an Internet search engine with search arguments established according to a search strategy comprising: a) the system component provides initial search arguments by forming spelling alternatives for the words comprising the at least one uncertainly recognized character by substituting the at least one uncertainly recognized character with the reported probable alternatives for the at least one character, one by one, and in possible combinations in each encountered word, or by removing a character, thereby forming a plurality of spelling alternatives, and then measuring and recording number of hits for search results of each respective spelling alternative that has been formed in this manner, b) the system component compares the measured number of hits for each of the spelling alternatives with an upper predefined relative threshold level and a lower predefined relative threshold level, wherein each of the respective comparisons of the plurality of measurements falls into one of three possible outcomes: i) if the measurement of a spelling alternative is above the predefined relative upper threshold level, the corresponding spelling alternative for this measurement is the correct spelling alternative for the word, and terminate the Internet search, ii) if the measurement of a spelling alternative is below the lower predefined relative threshold level, the corresponding spelling alternative for this measurement is deemed non-existing, and the word with this spelling alternative is discarded from further investigations, and continue with other spelling alternatives that has been formed as search arguments for the Internet search engine, iii) if the measurement of a spelling alternative falls between the upper relative threshold level and the lower relative threshold level, exit the Internet search engine and modify the search strategy providing further search arguments as a combination of members of the remaining spelling alternatives and other words encountered in the document, other character alternatives for the at least one uncertainly recognized character, phrases, adapting the upper relative threshold level, adapting the lower relative threshold level, and/or other information related to the output data from the OCR system, before continuing using the search strategy providing further measurements and comparisons for resolving the contradicting output data, c) the system component is processing step b) a number of predefined times, or until there is only one spelling alternative left, whatever occurs first, providing an iteration amongst a plurality of different search arguments used in the search strategy before terminating step b), and using the remaining spelling alternative having the highest measurement above the upper relative threshold level as the correct spelling alternative. | 29. A system for resolving contradicting output data from an Optical Character Recognition (OCR) system, wherein the output data comprises at least one word with at least one uncertainly recognized character, wherein the at least one uncertainly recognized character is reported in the output data together with probable alternatives for the at least one uncertainly recognized character, and the words wherein this at least one uncertainly recognized character has been encountered in an image of a text being processed by the OCR system, the system comprises: a system component using an Internet search engine with search arguments established according to a search strategy comprising: a) the system component provides initial search arguments by forming spelling alternatives for the words comprising the at least one uncertainly recognized character by substituting the at least one uncertainly recognized character with the reported probable alternatives for the at least one character, one by one, and in possible combinations in each encountered word, or by removing a character, thereby forming a plurality of spelling alternatives, and then measuring and recording number of hits for search results of each respective spelling alternative that has been formed in this manner, b) the system component compares the measured number of hits for each of the spelling alternatives with an upper predefined relative threshold level and a lower predefined relative threshold level, wherein each of the respective comparisons of the plurality of measurements falls into one of three possible outcomes: i) if the measurement of a spelling alternative is above the predefined relative upper threshold level, the corresponding spelling alternative for this measurement is the correct spelling alternative for the word, and terminate the Internet search, ii) if the measurement of a spelling alternative is below the lower predefined relative threshold level, the corresponding spelling alternative for this measurement is deemed non-existing, and the word with this spelling alternative is discarded from further investigations, and continue with other spelling alternatives that has been formed as search arguments for the Internet search engine, iii) if the measurement of a spelling alternative falls between the upper relative threshold level and the lower relative threshold level, exit the Internet search engine and modify the search strategy providing further search arguments as a combination of members of the remaining spelling alternatives and other words encountered in the document, other character alternatives for the at least one uncertainly recognized character, phrases, adapting the upper relative threshold level, adapting the lower relative threshold level, and/or other information related to the output data from the OCR system, before continuing using the search strategy providing further measurements and comparisons for resolving the contradicting output data, c) the system component is processing step b) a number of predefined times, or until there is only one spelling alternative left, whatever occurs first, providing an iteration amongst a plurality of different search arguments used in the search strategy before terminating step b), and using the remaining spelling alternative having the highest measurement above the upper relative threshold level as the correct spelling alternative. 46. The system according to claim 29 , wherein the respective upper and lower threshold is changed incrementally upwards and downwards cooperatively. | 0.938174 |
8,527,369 | 6 | 7 | 6. A non-transitory computer-readable storage medium having computer-executable instructions stored thereon that, when executed by a computer, cause the computer to: maintain feed metadata comprising a first set of semantics describing a transformation of seller feed data to customer-facing data for listing of items in an item catalog and a second set of semantics defined for a feature of the item catalog, the second set of semantics describing a transformation of an attribute related to the feature of the item catalog; receive supplemental feed data from a seller comprising a value for the attribute related to the feature for an item listed in the item catalog, the supplemental feed data further indicating a target feature of the item catalog; validate the value for the attribute in the supplemental feed data based on the second set of semantics defined for the target feature of the item catalog; and transform the supplemental feed data to supplemental listings data for inclusion in the item catalog based on the second set of semantics defined for the target feature of the item catalog, wherein the value for the attribute of the item in the supplemental listings data is merged with listings data containing values for attributes for the item periodically loaded from seller feed data based on the first set of semantics in the feed metadata. | 6. A non-transitory computer-readable storage medium having computer-executable instructions stored thereon that, when executed by a computer, cause the computer to: maintain feed metadata comprising a first set of semantics describing a transformation of seller feed data to customer-facing data for listing of items in an item catalog and a second set of semantics defined for a feature of the item catalog, the second set of semantics describing a transformation of an attribute related to the feature of the item catalog; receive supplemental feed data from a seller comprising a value for the attribute related to the feature for an item listed in the item catalog, the supplemental feed data further indicating a target feature of the item catalog; validate the value for the attribute in the supplemental feed data based on the second set of semantics defined for the target feature of the item catalog; and transform the supplemental feed data to supplemental listings data for inclusion in the item catalog based on the second set of semantics defined for the target feature of the item catalog, wherein the value for the attribute of the item in the supplemental listings data is merged with listings data containing values for attributes for the item periodically loaded from seller feed data based on the first set of semantics in the feed metadata. 7. The computer-readable storage medium of claim 6 , wherein the value for the attribute in the supplemental listings data takes precedence over a value for the attribute in the item catalog loaded from the seller feed data. | 0.712082 |
9,331,973 | 11 | 13 | 11. An apparatus, comprising: one or more processors; memory; and a program module, wherein the program module is stored in the memory and, during operation of the apparatus, is executed by the one or more processors to aggregate topic content, the program module including: instructions for providing a user-interface for an online social network website to one or more user computers for installation on the one or more user computers; instructions for receiving, at a transmission server for the provider of the online social-network website, one or more skills of users in the social network, wherein the one or more skills of each of the users is indicated in the profile of the user, and wherein the transmission server comprises a processor and a memory; instructions for receiving, at the transmission server, annotations associated with content in the social network, wherein each annotation associated with content indicates a feedback provided by a user in the social network regarding the content; instructions for storing the received one or more skills of a user in association with the profile of the user in a partitioned user profile data section of the memory; instructions for storing the received annotations associated with content in a partitioned content annotations data section of the memory; instructions for determining, using the processor, a set of topics based on an overlap between the received skills and the received annotations; instructions for identifying, using the processor, experts knowledgeable about the set of topics among the users in the social network; instructions for transmitting, over a data channel, from the transmission server of the provider of the social network to the one or more user computers, one or more messages inviting the experts to aggregate and edit the topic content, wherein given topic content for a given topic in the set of topics includes a subset of the content; instructions for receiving over the data channel, at the transmission server from the one or more user computers, responses to the messages from at least a subset of the experts; instructions for providing over the data channel, from the transmission server to the one or more user computers, to the subset of the experts, documents with suggested topic content and presentation formats for the topics in the set of topics; instructions for receiving over the data channel, at the transmission server, from the one or more user computers, from the subset of the experts, modifications to the documents; instructions for revising the documents based on the modifications; instructions for storing the revised documents in the memory associated with the transmission server; and instructions for transmitting one or more of the stored documents over the data channel, from the transmission server to a user computer, wherein the user computer is associated with a member of the social network, and wherein the transmitted document is available for display on the user computer using the user-interface for the social network application. | 11. An apparatus, comprising: one or more processors; memory; and a program module, wherein the program module is stored in the memory and, during operation of the apparatus, is executed by the one or more processors to aggregate topic content, the program module including: instructions for providing a user-interface for an online social network website to one or more user computers for installation on the one or more user computers; instructions for receiving, at a transmission server for the provider of the online social-network website, one or more skills of users in the social network, wherein the one or more skills of each of the users is indicated in the profile of the user, and wherein the transmission server comprises a processor and a memory; instructions for receiving, at the transmission server, annotations associated with content in the social network, wherein each annotation associated with content indicates a feedback provided by a user in the social network regarding the content; instructions for storing the received one or more skills of a user in association with the profile of the user in a partitioned user profile data section of the memory; instructions for storing the received annotations associated with content in a partitioned content annotations data section of the memory; instructions for determining, using the processor, a set of topics based on an overlap between the received skills and the received annotations; instructions for identifying, using the processor, experts knowledgeable about the set of topics among the users in the social network; instructions for transmitting, over a data channel, from the transmission server of the provider of the social network to the one or more user computers, one or more messages inviting the experts to aggregate and edit the topic content, wherein given topic content for a given topic in the set of topics includes a subset of the content; instructions for receiving over the data channel, at the transmission server from the one or more user computers, responses to the messages from at least a subset of the experts; instructions for providing over the data channel, from the transmission server to the one or more user computers, to the subset of the experts, documents with suggested topic content and presentation formats for the topics in the set of topics; instructions for receiving over the data channel, at the transmission server, from the one or more user computers, from the subset of the experts, modifications to the documents; instructions for revising the documents based on the modifications; instructions for storing the revised documents in the memory associated with the transmission server; and instructions for transmitting one or more of the stored documents over the data channel, from the transmission server to a user computer, wherein the user computer is associated with a member of the social network, and wherein the transmitted document is available for display on the user computer using the user-interface for the social network application. 13. The apparatus of claim 11 , wherein the experts are identified based on reputation scores of the users in the social network. | 0.545775 |
9,465,793 | 20 | 21 | 20. The method of claim 17 , wherein a user of the second computing device previously entered the received text into the second computing device. | 20. The method of claim 17 , wherein a user of the second computing device previously entered the received text into the second computing device. 21. The method of claim 20 , wherein the user of the second computing device entered the received text through at least one of directly typing, uploading, and a copy-and-paste operation into an application on the second computing device. | 0.5 |
8,196,038 | 1 | 12 | 1. A computer-network system implemented by an online stationery/card service for a user to personalize and send non-electronic stationery/cards, the system comprising: a computer server configured to enable a graphical user interface for personalizing and sending non-electronic stationery/cards, the graphical user interface comprising: a reminder list comprised of a plurality of reminder entries, each of the reminder entries identifying an upcoming event including events generated based on a specified relationship between the user and one or more contacts stored in a contacts database of the user; a recommendation region comprising a plurality of stationery/card design recommendations, the recommendation region populated with stationery/card designs associated with a specified one or the one or more entries in the reminder list, including the events generated based on the specified relationship between the user and each of the contacts, wherein the reminder list is organized based on a specified prioritization scheme, with a highest priority event selected within the reminder list, wherein upon the user initially opening the GUI the recommendation region is automatically populated with stationery/card designs associated with the highest priority event in the reminder list; and a stationery/card personalization engine executed in response to the user selecting one of the stationery/card design recommendations from the recommendation region, the stationery personalization engine providing the end user with a set of personalization options related to the selected stationery/card design, and generating personalized stationery with the selected stationery/card design based on user input. | 1. A computer-network system implemented by an online stationery/card service for a user to personalize and send non-electronic stationery/cards, the system comprising: a computer server configured to enable a graphical user interface for personalizing and sending non-electronic stationery/cards, the graphical user interface comprising: a reminder list comprised of a plurality of reminder entries, each of the reminder entries identifying an upcoming event including events generated based on a specified relationship between the user and one or more contacts stored in a contacts database of the user; a recommendation region comprising a plurality of stationery/card design recommendations, the recommendation region populated with stationery/card designs associated with a specified one or the one or more entries in the reminder list, including the events generated based on the specified relationship between the user and each of the contacts, wherein the reminder list is organized based on a specified prioritization scheme, with a highest priority event selected within the reminder list, wherein upon the user initially opening the GUI the recommendation region is automatically populated with stationery/card designs associated with the highest priority event in the reminder list; and a stationery/card personalization engine executed in response to the user selecting one of the stationery/card design recommendations from the recommendation region, the stationery personalization engine providing the end user with a set of personalization options related to the selected stationery/card design, and generating personalized stationery with the selected stationery/card design based on user input. 12. The computer-network system as in claim 1 wherein the reminders are generated in the form of a list of upcoming events, and wherein the reminder service comprises prioritization logic for prioritizing the list based at least in part on the specified relationship data. | 0.78515 |
7,512,622 | 1 | 11 | 1. A method comprising: generating an interface at a site on a network for display on a user computer, a plurality of media files from a plurality of media file providers being made available to said user computer via said network using said interface; defining a set of metadata attributes relating to said plurality of media files, each of said metadata attributes in the set having a respective predetermined location in said interface, said respective predetermined location for a given metadata attribute being a same location in said interface regardless of media file or media file provider; compiling said plurality of media files for use with said interface, wherein said plurality of media files is compiled from a plurality of media file providers; associating metadata attributes from the set of metadata attributes with each of said plurality of media files; and mapping each of said associated metadata attributes to its respective predetermined location in said interface, so that in said interface for said user each of said associated metadata attributes appears at its respective predetermined same location in said interface for all of said media files and media file providers, wherein said interface comprises: a channel description portion to display a plurality of channel selections corresponding to the plurality of media files provided by the plurality of media file providers for selection by said user; a show description portion to display one or more show selections, and in response to user selection of one of the channel selections said show description portion displays only those show selections corresponding to the channel selection; an episode description portion to display one or more episode selections, and in response to user selection of one of the show selections said episode description portion displays only those episode selections corresponding to the show selection; and a viewer to view media file content at the user computer, the media file content corresponding to the channel, show and episode selections made by the user using the interface. | 1. A method comprising: generating an interface at a site on a network for display on a user computer, a plurality of media files from a plurality of media file providers being made available to said user computer via said network using said interface; defining a set of metadata attributes relating to said plurality of media files, each of said metadata attributes in the set having a respective predetermined location in said interface, said respective predetermined location for a given metadata attribute being a same location in said interface regardless of media file or media file provider; compiling said plurality of media files for use with said interface, wherein said plurality of media files is compiled from a plurality of media file providers; associating metadata attributes from the set of metadata attributes with each of said plurality of media files; and mapping each of said associated metadata attributes to its respective predetermined location in said interface, so that in said interface for said user each of said associated metadata attributes appears at its respective predetermined same location in said interface for all of said media files and media file providers, wherein said interface comprises: a channel description portion to display a plurality of channel selections corresponding to the plurality of media files provided by the plurality of media file providers for selection by said user; a show description portion to display one or more show selections, and in response to user selection of one of the channel selections said show description portion displays only those show selections corresponding to the channel selection; an episode description portion to display one or more episode selections, and in response to user selection of one of the show selections said episode description portion displays only those episode selections corresponding to the show selection; and a viewer to view media file content at the user computer, the media file content corresponding to the channel, show and episode selections made by the user using the interface. 11. The method of claim 1 wherein said interface is provided by an Internet provider and comprises one or more web pages to present media content corresponding to any of said plurality of media files such that said interface provides a consistent user experience with respect to the media content provided by said plurality of media files regardless of a plurality of network sources corresponding to said plurality of media files. | 0.5 |
8,612,445 | 1 | 8 | 1. A unified method of scoring partitions of a composition of ontological subjects comprising: obtaining at least one set of ontological subject of a first predefined order; partitioning the composition of ontological subjects into one or more pluralities of partitions; constructing one or more data arrays corresponding to at least one participation matrix representing participation pattern of at least some of said ontological subjects of the first predefined order into one or more of said partitions by having a non-zero value in the corresponding entries of the participation matrix, wherein each row of the participation matrix is representative of one of said ontological subjects and each column of the participation matrix is representative of one of said partitions or vice versa; assigning or calculating scores, according to one or more importance aspects of one or more predefined criteria of importance, to one or more of said ontological subjects of the first predefined order; scoring one or more of said partitions of the composition, by using the score of the ontological subjects of the first predefined order and data of one or more of said one or more data arrays corresponding to said at least one participation matrix; and processing said scoring data of partitions and/or storing said scoring data of partitions onto one or more non-transitory computer readable storage. | 1. A unified method of scoring partitions of a composition of ontological subjects comprising: obtaining at least one set of ontological subject of a first predefined order; partitioning the composition of ontological subjects into one or more pluralities of partitions; constructing one or more data arrays corresponding to at least one participation matrix representing participation pattern of at least some of said ontological subjects of the first predefined order into one or more of said partitions by having a non-zero value in the corresponding entries of the participation matrix, wherein each row of the participation matrix is representative of one of said ontological subjects and each column of the participation matrix is representative of one of said partitions or vice versa; assigning or calculating scores, according to one or more importance aspects of one or more predefined criteria of importance, to one or more of said ontological subjects of the first predefined order; scoring one or more of said partitions of the composition, by using the score of the ontological subjects of the first predefined order and data of one or more of said one or more data arrays corresponding to said at least one participation matrix; and processing said scoring data of partitions and/or storing said scoring data of partitions onto one or more non-transitory computer readable storage. 8. The method of claim 1 , wherein said composition is represented by electrical signals. | 0.929477 |
8,694,483 | 12 | 21 | 12. The method of claim 1 , wherein the ranking of query suggestions is based at least in part on a relationship between one of the query suggestions and the knowledge base, the ranking of each query suggestion optionally being based at least in part on scores of responsive instances in the knowledge base. | 12. The method of claim 1 , wherein the ranking of query suggestions is based at least in part on a relationship between one of the query suggestions and the knowledge base, the ranking of each query suggestion optionally being based at least in part on scores of responsive instances in the knowledge base. 21. The method of claim 12 , wherein the ranking of each query suggestion is based at least in part on scores of responsive instances in the knowledge base. | 0.5 |
8,880,519 | 15 | 19 | 15. A computer system comprising a processor, a memory coupled to the processor, and a computer readable storage device coupled to the processor, said storage device containing program code configured to be executed by the processor via the memory to implement a method for determining a service description that most closely matches a service name provided by a user, said method comprising: said processor determining that the service name provided by the user is not an exact match to a service name in a service registry that comprises service names and associated service descriptions; said processor generating a ranked service name list by use of a name parser, a dictionary, and a name composer, wherein the ranked service name list comprises at least one alternative service name and a respective rank of each alternative service name of the at least one alternative service name, and wherein the respective rank indicates how closely the alternative service name associated with the respective rank resembles the service name provided by the user; said processor ascertaining a service description associated with a service name in the service registry that either matches the highest ranked alternative service name in the service name list or if not, matches a second alternative service name which is the next highest ranked alternative service name in the service name list; and said processor communicating the ascertained service description to the user. | 15. A computer system comprising a processor, a memory coupled to the processor, and a computer readable storage device coupled to the processor, said storage device containing program code configured to be executed by the processor via the memory to implement a method for determining a service description that most closely matches a service name provided by a user, said method comprising: said processor determining that the service name provided by the user is not an exact match to a service name in a service registry that comprises service names and associated service descriptions; said processor generating a ranked service name list by use of a name parser, a dictionary, and a name composer, wherein the ranked service name list comprises at least one alternative service name and a respective rank of each alternative service name of the at least one alternative service name, and wherein the respective rank indicates how closely the alternative service name associated with the respective rank resembles the service name provided by the user; said processor ascertaining a service description associated with a service name in the service registry that either matches the highest ranked alternative service name in the service name list or if not, matches a second alternative service name which is the next highest ranked alternative service name in the service name list; and said processor communicating the ascertained service description to the user. 19. The computer system of claim 15 , said ascertaining comprising: searching a top rank by locating a greatest value among all ranks in the ranked service name list; and looking up the service registry for the service description with a first alternative service name associated with the top rank from said searching such that the service description is associated with the highest ranked alternative service name. | 0.507126 |
10,146,751 | 1 | 4 | 1. A computer-implemented method for detecting hidden information in an unstructured data source, and generating a new data object representing the detected information, comprising: defining a first attribute for identifying a target term in a text content, wherein the first attribute comprises a semantic or syntactic attribute, wherein the semantic attribute includes being or representing a name of an object or a property associated with an object; defining a target term as a term that is associated with the first attribute; identifying a second attribute as an additional attribute associated with the target term, wherein the second attribute comprises a semantic or syntactic attribute; receiving a text content comprising a plurality of terms each comprising a word or a phrase; identifying a first term in the text content; identifying a second term in the context of the first term, wherein the context includes a term having a syntactic or semantic relation with the first term; identifying whether the second term refers to or represents the second attribute; if the second term is identified as referring to or representing the second attribute, then determining that the first term is the target term; generating a first data object comprising a first label associated with the first term, wherein the first label is not an element extracted from the text content, wherein the first attribute and the second attribute are not explicitly indicated in the text content; associating the first term to a search engine or a database; and when the first term is associated to a search engine, using the first term as an automatically-generated query to perform a search and determine a relevance for a search result, and displaying the search result in a user interface, wherein the first term is displayed in the user interface for an enhanced user interface functionality of highlighting a key information item that is automatically discovered from an unstructured data source and used for determining the relevance of the search result, wherein the search engine comprises an enterprise search engine, a job-seeking search engine, a recruitment search engine, a text analytics tool, and a data mining search engine; when the first term is associated to a database, compiling a data source comprising the first term, wherein the data source indicates that the first term is associated with the first label representing the first attribute that is hidden in the raw unstructured data source. | 1. A computer-implemented method for detecting hidden information in an unstructured data source, and generating a new data object representing the detected information, comprising: defining a first attribute for identifying a target term in a text content, wherein the first attribute comprises a semantic or syntactic attribute, wherein the semantic attribute includes being or representing a name of an object or a property associated with an object; defining a target term as a term that is associated with the first attribute; identifying a second attribute as an additional attribute associated with the target term, wherein the second attribute comprises a semantic or syntactic attribute; receiving a text content comprising a plurality of terms each comprising a word or a phrase; identifying a first term in the text content; identifying a second term in the context of the first term, wherein the context includes a term having a syntactic or semantic relation with the first term; identifying whether the second term refers to or represents the second attribute; if the second term is identified as referring to or representing the second attribute, then determining that the first term is the target term; generating a first data object comprising a first label associated with the first term, wherein the first label is not an element extracted from the text content, wherein the first attribute and the second attribute are not explicitly indicated in the text content; associating the first term to a search engine or a database; and when the first term is associated to a search engine, using the first term as an automatically-generated query to perform a search and determine a relevance for a search result, and displaying the search result in a user interface, wherein the first term is displayed in the user interface for an enhanced user interface functionality of highlighting a key information item that is automatically discovered from an unstructured data source and used for determining the relevance of the search result, wherein the search engine comprises an enterprise search engine, a job-seeking search engine, a recruitment search engine, a text analytics tool, and a data mining search engine; when the first term is associated to a database, compiling a data source comprising the first term, wherein the data source indicates that the first term is associated with the first label representing the first attribute that is hidden in the raw unstructured data source. 4. The computer-implemented method of claim 1 , wherein the second term is identified as referring to or representing the second attribute, the method further comprising: assigning a term weight value to the first term based on the second attribute, wherein the function of the term weight value includes at least being a term importance value for document summarization, tagging and search result ranking. | 0.5 |
8,099,341 | 10 | 16 | 10. A method for producing a recreation of a tax document that was previously filed by a user, the method comprising: executing instructions stored in memory using a processor to process an order request for the recreation of the previously filed tax document, the order request from the user; executing instructions stored in memory using a processor to download tax information comprising raw data from a government agency with which the tax document had been previously filed; and executing instructions stored in memory using a processor to parse the raw data from the tax information into a tax document template to generate the recreation of the previously filed tax document, wherein the recreation of the previously filed tax document is visually identical to the tax document as originally filed, including the processor mathematically calculating one or more quantitative values for the tax document template using the raw data from the tax information, wherein parsing the raw tax data separates the fields into categories at which calculations are performed to determined values of certain required fields. | 10. A method for producing a recreation of a tax document that was previously filed by a user, the method comprising: executing instructions stored in memory using a processor to process an order request for the recreation of the previously filed tax document, the order request from the user; executing instructions stored in memory using a processor to download tax information comprising raw data from a government agency with which the tax document had been previously filed; and executing instructions stored in memory using a processor to parse the raw data from the tax information into a tax document template to generate the recreation of the previously filed tax document, wherein the recreation of the previously filed tax document is visually identical to the tax document as originally filed, including the processor mathematically calculating one or more quantitative values for the tax document template using the raw data from the tax information, wherein parsing the raw tax data separates the fields into categories at which calculations are performed to determined values of certain required fields. 16. The method of claim 10 , wherein the government agency is the Internal Revenue Service. | 0.765464 |
8,606,774 | 1 | 3 | 1. A computer implemented method for 3D shape retrieval comprising: determining, by one or more processors, a similarity between a query 3D model and one or more 3D models using a composite distance function based on a plurality of features of the query 3D model and corresponding features of the one or more 3D models, wherein a feature distance is computed between the query 3D model and the one or more 3D models for each feature, and the composite distance function is computed as an average of each feature distance or an aggregate of each feature distance according to a pre-determined weighting; retrieving, by the one or more processors, one or more similar 3D models based on the determining step; ranking, by the one or more processors, the one or more similar 3D models based on the similarity; computing a second feature distance between the query 3D model and the one or more 3D models for each feature, from a second set of features, associated with the query 3D model and the one or more 3D models; evaluating a second composite distance function using each second feature distance; and re-ranking the one or more query 3D models based on results of the evaluated second composite distance function. | 1. A computer implemented method for 3D shape retrieval comprising: determining, by one or more processors, a similarity between a query 3D model and one or more 3D models using a composite distance function based on a plurality of features of the query 3D model and corresponding features of the one or more 3D models, wherein a feature distance is computed between the query 3D model and the one or more 3D models for each feature, and the composite distance function is computed as an average of each feature distance or an aggregate of each feature distance according to a pre-determined weighting; retrieving, by the one or more processors, one or more similar 3D models based on the determining step; ranking, by the one or more processors, the one or more similar 3D models based on the similarity; computing a second feature distance between the query 3D model and the one or more 3D models for each feature, from a second set of features, associated with the query 3D model and the one or more 3D models; evaluating a second composite distance function using each second feature distance; and re-ranking the one or more query 3D models based on results of the evaluated second composite distance function. 3. The method of claim 1 , wherein the pre-determined weighting is computed using logistic regression techniques. | 0.807823 |
9,825,890 | 1 | 12 | 1. A method comprising: determining one or more events performed on a first data content object of a file, the one or more events being performed by a first user on a first client device using a data-content-object processing application, the file being stored in a data store, the first data content object being a defined portion less than all of the file; storing one or more event indications about the one or more events in a history buffer, each of the one or more event indications including event metadata indicating the one or more events performed by the first user on the first data content object; retrieving a notification threshold condition associated with a second user, wherein the notification threshold condition is based on a notification frequency determined by the second user, the notification threshold condition defining first criteria for determining which of the one or more event indications are relevant to the second user and second criteria for determining based on at least one of the one or more event indications being relevant to the second user whether to generate and send a notification to the second user, the first criteria defining that a particular event indication is relevant to the second user based on, at least in part, whether the second user has collaboratively worked with another user that has commented on the first data content object of the file, the second criteria defining whether to generate and send the notification to the second user based on, at least in part, second user preferences configurable by the second user and defining threshold quality of change to the first data content object before the generating and sending of the notification; using the first criteria to determine which of the one or more event indications are relevant to the second user; using the second criteria to determine whether the at least one of the one or more event indications being relevant to the second user satisfies the threshold quality of change to the first data content object; and if the second criteria is satisfied, generating and sending the notification for the second user. | 1. A method comprising: determining one or more events performed on a first data content object of a file, the one or more events being performed by a first user on a first client device using a data-content-object processing application, the file being stored in a data store, the first data content object being a defined portion less than all of the file; storing one or more event indications about the one or more events in a history buffer, each of the one or more event indications including event metadata indicating the one or more events performed by the first user on the first data content object; retrieving a notification threshold condition associated with a second user, wherein the notification threshold condition is based on a notification frequency determined by the second user, the notification threshold condition defining first criteria for determining which of the one or more event indications are relevant to the second user and second criteria for determining based on at least one of the one or more event indications being relevant to the second user whether to generate and send a notification to the second user, the first criteria defining that a particular event indication is relevant to the second user based on, at least in part, whether the second user has collaboratively worked with another user that has commented on the first data content object of the file, the second criteria defining whether to generate and send the notification to the second user based on, at least in part, second user preferences configurable by the second user and defining threshold quality of change to the first data content object before the generating and sending of the notification; using the first criteria to determine which of the one or more event indications are relevant to the second user; using the second criteria to determine whether the at least one of the one or more event indications being relevant to the second user satisfies the threshold quality of change to the first data content object; and if the second criteria is satisfied, generating and sending the notification for the second user. 12. The method of claim 1 , wherein the data-content-object processing application is a virtualized application instance executing in a virtual computing environment. | 0.558511 |
8,756,058 | 15 | 17 | 15. A non-transitory recording medium encoded with program code, when the program code is executed by a processor, performing: word speech recognition processing for converting input speech to a recognition result word sequence by using a predetermined word dictionary for recognition, the word dictionary including word entries arranged in a predetermined order; syllable recognition processing for converting the input speech to a recognition result syllable sequence; segment determination processing for determining a segment corresponding to an unknown word in the converted recognition result word sequence; and output processing for obtaining a partial syllable sequence corresponding to the determined segment from the recognition result syllable sequence, determining an ordered position of the partial syllable sequence in the word dictionary on the assumption that the partial syllable sequence exists in the word dictionary, and displaying on a display device one or more word entries in the vicinity of the ordered position in the word dictionary, together with the recognition result word sequence, wherein in the output processing, the recognition result word sequence is displayed after the recognition result word sequence is replaced with the partial syllable sequence with respect to the segment determined by the segment determination processing, and in the output processing, the segment corresponding to the unknown word is highlighted. | 15. A non-transitory recording medium encoded with program code, when the program code is executed by a processor, performing: word speech recognition processing for converting input speech to a recognition result word sequence by using a predetermined word dictionary for recognition, the word dictionary including word entries arranged in a predetermined order; syllable recognition processing for converting the input speech to a recognition result syllable sequence; segment determination processing for determining a segment corresponding to an unknown word in the converted recognition result word sequence; and output processing for obtaining a partial syllable sequence corresponding to the determined segment from the recognition result syllable sequence, determining an ordered position of the partial syllable sequence in the word dictionary on the assumption that the partial syllable sequence exists in the word dictionary, and displaying on a display device one or more word entries in the vicinity of the ordered position in the word dictionary, together with the recognition result word sequence, wherein in the output processing, the recognition result word sequence is displayed after the recognition result word sequence is replaced with the partial syllable sequence with respect to the segment determined by the segment determination processing, and in the output processing, the segment corresponding to the unknown word is highlighted. 17. The non-transitory recording medium according to claim 15 , wherein the predetermined order is the Japanese syllabary order. | 0.817143 |
8,903,862 | 15 | 17 | 15. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to at least perform the following: receiving a first triple including a subject, predicate and object, the object comprising a literal-type object; identifying a subtype of the object of the first triple; semantically marking the object with the identified subtype, including generating a second triple including the subject and predicate of the first triple as the subject and predicate thereof, and generating a third triple including the object of the first triple or a representation of the object of the first triple as the object thereof; and determining to store the second and third triples in a triple store. | 15. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to at least perform the following: receiving a first triple including a subject, predicate and object, the object comprising a literal-type object; identifying a subtype of the object of the first triple; semantically marking the object with the identified subtype, including generating a second triple including the subject and predicate of the first triple as the subject and predicate thereof, and generating a third triple including the object of the first triple or a representation of the object of the first triple as the object thereof; and determining to store the second and third triples in a triple store. 17. A non-transitory computer-readable storage medium according to claim 15 , wherein the processing the object of the first triple includes archiving the object at a location in storage external to the triple store, the representation of the object of the first triple comprising the storage location. | 0.724954 |
9,858,054 | 16 | 18 | 16. A system for optimizing a binary code in a language having access to a binary coded decimal (hereinafter referred to as BCD) variable by converting a BCD operation to a decimal floating point (hereinafter referred to as DFP) operation, the system comprising: a memory; a processor coupled to the memory; a module for optimizing a binary code communicatively coupled to the memory and the processor to carry out the steps of: generating a first compiler expression of the binary code; analyzing a use-definition chain and/or a definition-use chain for the first compiler expression; identifying logical BCD variables in the first compiler expression on the basis of a result of the analysis; generating a second compiler expression by assigning temporary variables to the identified logical BCD variables, wherein the second compiler expression includes packed decimal operations and the assigned temporary variables; and generating a third compiler expression by converting at least one of the packed decimal operations in the second compiler expression and at least one of the assigned temporary variables to the DFP operation if sign information and precision information are not lost by the conversion from the BCD operation to the DFP operation, wherein identifying logical BCD variables in the first compiler expression on the basis of a result of the analysis further includes: regarding an operand of definition (def) and an operand of use (use) as the same logical BCD variables in the use-definition and/or definition-use chains of operands in the first compiler expression, and wherein, regarding the operands as the same logical BCD variables, if, in the use-definition and/or definition-use chains of the operands in the first compiler expression, there is a use (use) dominated by a definition (def), there is not another definition (def) for the use (use) in any path between the definition (def) and the use (use), and the use (use) exists for the definition (def) as only one use, regarding operands of the use (use) and the definition (def) as the same logical BCD variables if: right-end addresses of the operands of the use (use) and the definition (def) are the same; the operands of the use (use) and the definition (def) are the same BCD type; a size of the operand of use (use) is larger than the size of the operand of definition (def); and zero is put in an area where the operand of use (use) and the operand of definition (def) do not overlap. | 16. A system for optimizing a binary code in a language having access to a binary coded decimal (hereinafter referred to as BCD) variable by converting a BCD operation to a decimal floating point (hereinafter referred to as DFP) operation, the system comprising: a memory; a processor coupled to the memory; a module for optimizing a binary code communicatively coupled to the memory and the processor to carry out the steps of: generating a first compiler expression of the binary code; analyzing a use-definition chain and/or a definition-use chain for the first compiler expression; identifying logical BCD variables in the first compiler expression on the basis of a result of the analysis; generating a second compiler expression by assigning temporary variables to the identified logical BCD variables, wherein the second compiler expression includes packed decimal operations and the assigned temporary variables; and generating a third compiler expression by converting at least one of the packed decimal operations in the second compiler expression and at least one of the assigned temporary variables to the DFP operation if sign information and precision information are not lost by the conversion from the BCD operation to the DFP operation, wherein identifying logical BCD variables in the first compiler expression on the basis of a result of the analysis further includes: regarding an operand of definition (def) and an operand of use (use) as the same logical BCD variables in the use-definition and/or definition-use chains of operands in the first compiler expression, and wherein, regarding the operands as the same logical BCD variables, if, in the use-definition and/or definition-use chains of the operands in the first compiler expression, there is a use (use) dominated by a definition (def), there is not another definition (def) for the use (use) in any path between the definition (def) and the use (use), and the use (use) exists for the definition (def) as only one use, regarding operands of the use (use) and the definition (def) as the same logical BCD variables if: right-end addresses of the operands of the use (use) and the definition (def) are the same; the operands of the use (use) and the definition (def) are the same BCD type; a size of the operand of use (use) is larger than the size of the operand of definition (def); and zero is put in an area where the operand of use (use) and the operand of definition (def) do not overlap. 18. The system according to claim 16 , wherein if, in the use-definition and/or definition-use chains of the operands in the first compiler expression, there is a use (use) dominated by a definition (def), there is not another definition (def) for the use (use) in any path between the definition (def) and the use (use), and the use (use) exists for the definition (def) as only one use, regarding operands of the use (use) and the definition (def) as the same logical BCD variables if: right-end addresses of the operands of the use (use) and the definition (def) are the same; the operands of the use (use) and the definition (def) are the same BCD type; a size of the operand of use (use) is smaller than the size of the operand of definition (def); and an instruction for digit adjustment is inserted into the first compiler expression in generation of the second compiler expression. | 0.5 |
8,538,915 | 19 | 20 | 19. The computer program product of claim 15 , the method further comprising: providing the answer to a user; determining, subsequent to providing the answer to the user and subsequent to the user taking the action, semantic reaction data based upon semantic analysis of the unstructured data sources that comprise unstructured data pertaining to behaviors of the public population to determine a reaction of the public population to the action; and updating, based on the semantic reaction data, at least one of the at least one mathematical model and a model used for semantic analysis of the unstructured data sources. | 19. The computer program product of claim 15 , the method further comprising: providing the answer to a user; determining, subsequent to providing the answer to the user and subsequent to the user taking the action, semantic reaction data based upon semantic analysis of the unstructured data sources that comprise unstructured data pertaining to behaviors of the public population to determine a reaction of the public population to the action; and updating, based on the semantic reaction data, at least one of the at least one mathematical model and a model used for semantic analysis of the unstructured data sources. 20. The computer program product of claim 19 , wherein the unstructured data sources comprise at least one of at least one blog, at least one letter, and at least one data stream describing behaviors of the public population. | 0.5 |
8,175,875 | 10 | 11 | 10. A system for processing documents, comprising: one or more processors; memory; and one or more modules, wherein the modules are stored within memory and configured to be executed by the one or more processors, the one or more modules including instructions to: group a set of documents into a plurality of clusters, the set of documents comprising a sequence of tokens, wherein each cluster includes one or more documents in the set of documents; generate a compressed representation of the set of documents from which respective documents in the set can be reconstructed, including instructions to generate, for the plurality of clusters, a compressed sequence of tokens by eliding duplicate sequences of tokens within respective clusters; and generate an index of the compressed sequence of tokens, including instructions to index each respective token in the compressed sequence of tokens based on a respective token position of the respective token in the compressed sequence. | 10. A system for processing documents, comprising: one or more processors; memory; and one or more modules, wherein the modules are stored within memory and configured to be executed by the one or more processors, the one or more modules including instructions to: group a set of documents into a plurality of clusters, the set of documents comprising a sequence of tokens, wherein each cluster includes one or more documents in the set of documents; generate a compressed representation of the set of documents from which respective documents in the set can be reconstructed, including instructions to generate, for the plurality of clusters, a compressed sequence of tokens by eliding duplicate sequences of tokens within respective clusters; and generate an index of the compressed sequence of tokens, including instructions to index each respective token in the compressed sequence of tokens based on a respective token position of the respective token in the compressed sequence. 11. The system of claim 10 , wherein the grouping comprises grouping a plurality of versions of a document of the set of document together into a cluster. | 0.877583 |
9,678,637 | 21 | 24 | 21. A computer-readable, non-transitory storage medium storing computer executable instructions that, when executed by one or more computing devices, configure the one or more computing devices to perform operations comprising: receiving context information associated with a current context of a user, wherein the context information includes at least one of a current location of the user or a current activity of the user; determining a context attribute associated with the current context of the user based at least in part on the context information; determining a content characteristic that is identified in stored context-to-characteristic association information as being associated with the context attribute, wherein the content characteristic is not the current location of the user and the content characteristic is not the current activity of the user; selecting a portion of a content item, selected from among a plurality of content items, to be consumed in the current context, wherein selecting the portion of the content item is based at least in part on a determination that content association information indicates that the content characteristic that is identified in the stored context-to-characteristic association information as being associated with the context attribute is also associated with the portion of the content item; and presenting information identifying the portion of the content item as a recommendation for the user. | 21. A computer-readable, non-transitory storage medium storing computer executable instructions that, when executed by one or more computing devices, configure the one or more computing devices to perform operations comprising: receiving context information associated with a current context of a user, wherein the context information includes at least one of a current location of the user or a current activity of the user; determining a context attribute associated with the current context of the user based at least in part on the context information; determining a content characteristic that is identified in stored context-to-characteristic association information as being associated with the context attribute, wherein the content characteristic is not the current location of the user and the content characteristic is not the current activity of the user; selecting a portion of a content item, selected from among a plurality of content items, to be consumed in the current context, wherein selecting the portion of the content item is based at least in part on a determination that content association information indicates that the content characteristic that is identified in the stored context-to-characteristic association information as being associated with the context attribute is also associated with the portion of the content item; and presenting information identifying the portion of the content item as a recommendation for the user. 24. The computer-readable, non-transitory storage medium of claim 21 , wherein the operations further comprise determining a start location and an end location of the portion based at least in part by identifying a change in at least one of a scene or a setting within the content item. | 0.5 |
9,406,048 | 1 | 7 | 1. A method, comprising: allowing a user to specify trigger words; allowing the user to prepare an email message including adding a trigger word to indicate confidential previously presented nature of information being sent through a message or an attachment; detecting initiation of sending of the email message by detecting activation of a send function; scanning, by an email server, the email message including at least one of a message body and an attachment of the email message to determine whether the email message includes one or more of the trigger words which are indicated in a trigger word table, the trigger word table indicating that a message may be sensitive where the message comprises a message body and a message attachment and being created by the user previous to the email message preparation; alerting the user with a sound and a pop-up display message when the scanning determines that the email message includes one or more of the trigger words, the pop-up display message includes: a border surrounding that blinks, a message that the user is about to send the one or more of the trigger words determined as comprising confidential, proprietary or sensitive material in the trigger word table and, an email address of a recipient of the email message and corresponding locations of the one or more of the trigger words in the email message; wherein the pop-up display message further contains execution icons which allow the user to approve sending of the email message or to disapprove sending of the email message, wherein the trigger words are selected to stop sending of the email message determined as comprising confidential, proprietary or sensitive material, wherein the user is alerted directly when one or more of the trigger words are first found, wherein the alerting is triggered by an exact match with one or more of the trigger words, wherein the corresponding locations of the one or more of the trigger words determined to be included in the at least one of the message body and the attachment of the email message respectively identify the one or more of the trigger words as being located in one or more of a subject line, the message body and the attachment. | 1. A method, comprising: allowing a user to specify trigger words; allowing the user to prepare an email message including adding a trigger word to indicate confidential previously presented nature of information being sent through a message or an attachment; detecting initiation of sending of the email message by detecting activation of a send function; scanning, by an email server, the email message including at least one of a message body and an attachment of the email message to determine whether the email message includes one or more of the trigger words which are indicated in a trigger word table, the trigger word table indicating that a message may be sensitive where the message comprises a message body and a message attachment and being created by the user previous to the email message preparation; alerting the user with a sound and a pop-up display message when the scanning determines that the email message includes one or more of the trigger words, the pop-up display message includes: a border surrounding that blinks, a message that the user is about to send the one or more of the trigger words determined as comprising confidential, proprietary or sensitive material in the trigger word table and, an email address of a recipient of the email message and corresponding locations of the one or more of the trigger words in the email message; wherein the pop-up display message further contains execution icons which allow the user to approve sending of the email message or to disapprove sending of the email message, wherein the trigger words are selected to stop sending of the email message determined as comprising confidential, proprietary or sensitive material, wherein the user is alerted directly when one or more of the trigger words are first found, wherein the alerting is triggered by an exact match with one or more of the trigger words, wherein the corresponding locations of the one or more of the trigger words determined to be included in the at least one of the message body and the attachment of the email message respectively identify the one or more of the trigger words as being located in one or more of a subject line, the message body and the attachment. 7. The method as recited in claim 1 , wherein the alerting occurs when the attachment containing a sensitive word is attached to the email message. | 0.55988 |
9,485,272 | 1 | 8 | 1. A computer-implemented method for estimating confidence scores of unverified signatures, at least a portion of the method being performed by a computing device comprising at least one processor, the method comprising: detecting a potentially malicious event that triggers a malware signature designed to detect malware, the malware signature having a confidence score that: represents a level of confidence in the accuracy or reliability of the malware signature; and is above a certain threshold such that the malware signature's confidence score indicates a threshold level of confidence in the accuracy or reliability of the malware signature; detecting another event that triggers another signature designed to detect malware, the other signature having a confidence score that: represents a level of confidence in the accuracy or reliability of the other signature; and is unknown such that the other signature's confidence score indicates an unknown level of confidence in the accuracy or reliability of the other signature; determining that the potentially malicious event and the other event occurred within a certain time period of one another; and assigning, to the other signature, a confidence score based at least in part on the potentially malicious event and the other event occurring within the certain time period of one another. | 1. A computer-implemented method for estimating confidence scores of unverified signatures, at least a portion of the method being performed by a computing device comprising at least one processor, the method comprising: detecting a potentially malicious event that triggers a malware signature designed to detect malware, the malware signature having a confidence score that: represents a level of confidence in the accuracy or reliability of the malware signature; and is above a certain threshold such that the malware signature's confidence score indicates a threshold level of confidence in the accuracy or reliability of the malware signature; detecting another event that triggers another signature designed to detect malware, the other signature having a confidence score that: represents a level of confidence in the accuracy or reliability of the other signature; and is unknown such that the other signature's confidence score indicates an unknown level of confidence in the accuracy or reliability of the other signature; determining that the potentially malicious event and the other event occurred within a certain time period of one another; and assigning, to the other signature, a confidence score based at least in part on the potentially malicious event and the other event occurring within the certain time period of one another. 8. The method of claim 1 , wherein: detecting the potentially malicious event that triggers the malware signature comprises detecting, on a single computing device, one or more potentially malicious events that trigger one or more malware signatures whose confidence scores are above a certain threshold and below another threshold; determining that the potentially malicious event and the other event occurred within the certain time period of one another comprises determining that the one or more potentially malicious events and the other event occurred within the certain time period of one another on the single computing device; and assigning the confidence score to the other signature comprises: calculating a confidence score for the other signature based at least in part on: the number of the one or more potentially malicious events detected on the single computing device; and the confidence scores of the one or more potentially malicious events detected on the single computing device; and assigning the calculated confidence score to the other signature. | 0.51626 |
8,244,610 | 1 | 7 | 1. A method for checking and creating a finalized invoice before billing a client, the method comprising: submitting a preliminary invoice to an automated rules engine running on a computer processor before a final invoice is sent to a client, the preliminary invoice including one or more entries associated with one of a task or an expense; automatically searching the preliminary invoice for one of an expense associated with a task listed in the preliminary invoice or a task associated with an expense listed in the preliminary invoice in a computer-implemented process; automatically querying a user to add one of the associated expense for the task or the associated task for the expense when the search of the preliminary invoice fails to locate the associated expense or associated task listed in the invoice in a computer-implemented process; automatically modifying the preliminary invoice based on a user input received in response to the query in a computer-implemented process, the preliminary invoice including a modified entry that includes the associated expense or the associated task; automatically searching the preliminary invoice for at least one of keywords, phrases, and task billing codes that define possible violation of a company's billing guidelines in a computer-implemented process; and automatically suggesting to the user alternative at least one of keywords, phrases, and task billing codes to be substituted for those that define possible violation of the company's billing guidelines in a computer-implemented process; automatically modifying the preliminary invoice based on a user input received in response to the suggestion in a computer-implemented process, the preliminary invoice including a modified entry that includes the suggested alternative at least one of keywords, phrases, and task billing codes; automatically searching the preliminary invoice for a related fee activity associated with each specific expense billed in the preliminary invoice in a computer-implemented process, wherein when the automated search of the preliminary invoice fails to find a related fee activity associated with a specific expense billed, the method further comprising automatically prompting the user to add the related fee activity not found in a computer-implemented process; automatically modifying the preliminary invoice when a related fee activity not found in the preceding step is added by the user in a computer-implemented process, the preliminary invoice including a modified entry that includes the related fee activity added by the user; and automatically generating a final invoice in a computer-implemented process based on the modified entries for sending to a client for payment. | 1. A method for checking and creating a finalized invoice before billing a client, the method comprising: submitting a preliminary invoice to an automated rules engine running on a computer processor before a final invoice is sent to a client, the preliminary invoice including one or more entries associated with one of a task or an expense; automatically searching the preliminary invoice for one of an expense associated with a task listed in the preliminary invoice or a task associated with an expense listed in the preliminary invoice in a computer-implemented process; automatically querying a user to add one of the associated expense for the task or the associated task for the expense when the search of the preliminary invoice fails to locate the associated expense or associated task listed in the invoice in a computer-implemented process; automatically modifying the preliminary invoice based on a user input received in response to the query in a computer-implemented process, the preliminary invoice including a modified entry that includes the associated expense or the associated task; automatically searching the preliminary invoice for at least one of keywords, phrases, and task billing codes that define possible violation of a company's billing guidelines in a computer-implemented process; and automatically suggesting to the user alternative at least one of keywords, phrases, and task billing codes to be substituted for those that define possible violation of the company's billing guidelines in a computer-implemented process; automatically modifying the preliminary invoice based on a user input received in response to the suggestion in a computer-implemented process, the preliminary invoice including a modified entry that includes the suggested alternative at least one of keywords, phrases, and task billing codes; automatically searching the preliminary invoice for a related fee activity associated with each specific expense billed in the preliminary invoice in a computer-implemented process, wherein when the automated search of the preliminary invoice fails to find a related fee activity associated with a specific expense billed, the method further comprising automatically prompting the user to add the related fee activity not found in a computer-implemented process; automatically modifying the preliminary invoice when a related fee activity not found in the preceding step is added by the user in a computer-implemented process, the preliminary invoice including a modified entry that includes the related fee activity added by the user; and automatically generating a final invoice in a computer-implemented process based on the modified entries for sending to a client for payment. 7. The method of claim 1 , further comprising: querying a user to define rules for an automated rules engine before submitting the preliminary invoice to the automated rules engine. | 0.663569 |
7,920,742 | 1 | 9 | 1. An image processing apparatus, comprising: a document input unit that inputs document data of a document; a first identifying unit that identifies a position of a string in the document; a second identifying unit that identifies a mark handwritten from a highlighter and is non-textual, the mark being separate from the string, in the document; and an orientation detection unit that detects an orientation of the mark, wherein the mark is defined by a range from a start position and an end position based on the detected orientation; and a character string extracting unit that extracts a new string, based on the position of the string identified by the first identifying unit, and the mark identified by the second identifying unit and defined based on the detected orientation. | 1. An image processing apparatus, comprising: a document input unit that inputs document data of a document; a first identifying unit that identifies a position of a string in the document; a second identifying unit that identifies a mark handwritten from a highlighter and is non-textual, the mark being separate from the string, in the document; and an orientation detection unit that detects an orientation of the mark, wherein the mark is defined by a range from a start position and an end position based on the detected orientation; and a character string extracting unit that extracts a new string, based on the position of the string identified by the first identifying unit, and the mark identified by the second identifying unit and defined based on the detected orientation. 9. The image processing apparatus of claim 1 , wherein the character string extracting unit extracts the string based on the position of the string identified by the first identifying unit and whether the string overlaps the mark identified by the second identifying unit. | 0.742424 |
8,037,068 | 11 | 12 | 11. A computer-readable storage device storing instructions that when executed by a computer cause the computer to perform a method for searching through content which is accessible through a web-based form, the method comprising: receiving a query containing keywords; analyzing the query to create a structured query, the analyzing comprising: predicting a class for the query based at least on the keywords in the query; mapping the keywords in the query to properties of the predicted class; and generating a structured query based on the mapping; performing a lookup based on the structured query in a database containing an entry for each of a plurality of web-based forms; ranking web-based forms returned by the lookup, wherein ranking the web-based forms comprises determining one or more scores for each web-based form based on properties of a web page in which the web-based form is located, wherein determining the one or more scores comprises determining a form score that reflects an ability of the web-based form to answer the query by: determining inputs and outputs for a first web-based form based on the predicted class for the query; determining inputs and outputs for a second web-based form in the database; and computing the form score for the first web-based form using the inputs and outputs for the first web-based form and the inputs and outputs for the second web-based form; and facilitating a search of content that is accessible through the web-based forms using the rankings. | 11. A computer-readable storage device storing instructions that when executed by a computer cause the computer to perform a method for searching through content which is accessible through a web-based form, the method comprising: receiving a query containing keywords; analyzing the query to create a structured query, the analyzing comprising: predicting a class for the query based at least on the keywords in the query; mapping the keywords in the query to properties of the predicted class; and generating a structured query based on the mapping; performing a lookup based on the structured query in a database containing an entry for each of a plurality of web-based forms; ranking web-based forms returned by the lookup, wherein ranking the web-based forms comprises determining one or more scores for each web-based form based on properties of a web page in which the web-based form is located, wherein determining the one or more scores comprises determining a form score that reflects an ability of the web-based form to answer the query by: determining inputs and outputs for a first web-based form based on the predicted class for the query; determining inputs and outputs for a second web-based form in the database; and computing the form score for the first web-based form using the inputs and outputs for the first web-based form and the inputs and outputs for the second web-based form; and facilitating a search of content that is accessible through the web-based forms using the rankings. 12. The computer-readable storage device of claim 11 , wherein facilitating the search of content that is accessible through the web-based forms using the rankings comprises searching one or more forms of interest, wherein the forms of interest are ranked in order according to a relevance of each web-based form to the query. | 0.768466 |
9,792,527 | 17 | 19 | 17. The computer program product of claim 16 , wherein the computer readable program code instructions for execution by the processor further cause the processor to generate the similarity confidence scores for each of the respective ones of the plurality of slides as the functions of the weighted averages of the text content confidence scores and the graphic element content confidence scores generated for the respective ones of the plurality of slides by: generating first weighted averages of the graphic element content confidence scores and the text content confidence scores for each of the plurality of slides of the each slides as functions of a first differential weighting of the graphic element content confidence scores relative to the text content confidence scores; comparing the graphic element content confidence scores of the plurality of slides to an image content confidence threshold value that indicates a strength of match of an attribute of the graphic content of the input slide to a corresponding attribute of the graphic content of the plurality of slides; for each of the plurality of slides having a compared graphic element content confidence score that meets the image content confidence threshold value, generating second weighted averages of the graphic element content confidence scores and the text content confidence scores as functions of a second differential weighting of the graphic element content confidence scores relative to the text content confidence scores, wherein the second differential weighting increases a weighting of the graphic element content confidence score relative to the text content confidence score more than the first differential weighting; and selecting higher value ones of the first weighted averages and the second weighted averages as the similarity confidence scores for each of the respective ones of the plurality of slides. | 17. The computer program product of claim 16 , wherein the computer readable program code instructions for execution by the processor further cause the processor to generate the similarity confidence scores for each of the respective ones of the plurality of slides as the functions of the weighted averages of the text content confidence scores and the graphic element content confidence scores generated for the respective ones of the plurality of slides by: generating first weighted averages of the graphic element content confidence scores and the text content confidence scores for each of the plurality of slides of the each slides as functions of a first differential weighting of the graphic element content confidence scores relative to the text content confidence scores; comparing the graphic element content confidence scores of the plurality of slides to an image content confidence threshold value that indicates a strength of match of an attribute of the graphic content of the input slide to a corresponding attribute of the graphic content of the plurality of slides; for each of the plurality of slides having a compared graphic element content confidence score that meets the image content confidence threshold value, generating second weighted averages of the graphic element content confidence scores and the text content confidence scores as functions of a second differential weighting of the graphic element content confidence scores relative to the text content confidence scores, wherein the second differential weighting increases a weighting of the graphic element content confidence score relative to the text content confidence score more than the first differential weighting; and selecting higher value ones of the first weighted averages and the second weighted averages as the similarity confidence scores for each of the respective ones of the plurality of slides. 19. The computer program product of claim 17 , wherein the computer readable program code instructions for execution by the processor further cause the processor to generate the graphic element content confidence scores to represent at least one of: amounts of similarity of an individual graphic element that is visible within the graphic content of the input slide to individual graphic elements that are visible within the graphic content of the respective ones of the plurality of slides, as a function of at least one of shape, scale, and color attributes; and amounts of similarity of an arrangement of multiple elements that are each visible within the graphic content of the input slide relative to each other to arrangements of multiple elements that are visible within the graphic content of respective ones of the plurality of slides, as a function of at least one of shape, scale, and color attributes. | 0.545726 |
5,530,794 | 13 | 21 | 13. A method for enabling a word processing system to properly identify and display paragraphs in a document that includes pasted text, said pasted text using a different type of paragraph delimiter than that used by the word processing system, comprising the steps of: (a) assigning each character in the document a coordinate in a piece table, said piece table comprising a character position array and an array of data records, said character position array including a plurality of pieces, each piece comprising at least one character, all characters in each piece having common formatting properties and being stored in a contiguous string within a common file, said array of data records including a separate record corresponding to one of the pieces in the array of character positions; (b) in each record of the array of data records, including a pointer to a file control block for the file in which all of the characters of the text in the piece are stored; (c) providing delimiter data bits in each of the file control blocks that indicate the type of paragraph delimiter used for the text stored in each file; (d) when a character of the document is selected by a user for display, determining a specific file control block for the file in which the character is stored, based upon the position of the character in the piece table; (e) identifying the paragraph delimiter that was used in the text, as a function of the delimiter data bits in the specific file control block determined in step (c); and (f) properly displaying the paragraph in which the character selected by the user is contained by translating any paragraph delimiters in the text displayed to the type of paragraph delimiter used by the word processing system. | 13. A method for enabling a word processing system to properly identify and display paragraphs in a document that includes pasted text, said pasted text using a different type of paragraph delimiter than that used by the word processing system, comprising the steps of: (a) assigning each character in the document a coordinate in a piece table, said piece table comprising a character position array and an array of data records, said character position array including a plurality of pieces, each piece comprising at least one character, all characters in each piece having common formatting properties and being stored in a contiguous string within a common file, said array of data records including a separate record corresponding to one of the pieces in the array of character positions; (b) in each record of the array of data records, including a pointer to a file control block for the file in which all of the characters of the text in the piece are stored; (c) providing delimiter data bits in each of the file control blocks that indicate the type of paragraph delimiter used for the text stored in each file; (d) when a character of the document is selected by a user for display, determining a specific file control block for the file in which the character is stored, based upon the position of the character in the piece table; (e) identifying the paragraph delimiter that was used in the text, as a function of the delimiter data bits in the specific file control block determined in step (c); and (f) properly displaying the paragraph in which the character selected by the user is contained by translating any paragraph delimiters in the text displayed to the type of paragraph delimiter used by the word processing system. 21. The method of claim 13, further comprising steps of loading a display buffer with text to be displayed; and if said text uses a type of paragraph delimiter that is different than the paragraph delimiter used by the word processing system, translating the type of paragraph delimiter used with said text into the type of paragraph delimiter used by the word processing system within the display buffer so that any paragraphs within said text are displayed as originally created. | 0.5 |
9,253,224 | 1 | 4 | 1. A non-transitory machine-readable medium carrying one or more sequences of instructions causing a computer to implement a method comprising: providing, to a user by a database service, tools for creating a community website including one or more community webpages to be made accessible to potential subscribers to the community website; receiving, at the database service from the user via the tools, information to configure the community website, the information including one or more potential subscribers to be invited to the community website; in response to receiving the information, sending, by the database service, an invitation to join the community website to each of the potential subscribers; in response to an acceptance of a corresponding invitation by a potential subscriber, creating, by the database service, an active subscriber account on the community website to enable access to the community website, wherein the access to the community website includes allowing the active subscriber account to: post content to the community website, comment on content posted to the community website, participate in discussions on the community website, search for keywords, members, and comments on the community website, send information related to the community website from the community website in an e-mail, and vote on each particular content posted to the community website via selection of a link associated with the particular content, wherein the visually represents a count of a total number of votes cast for the particular content; storing, by the database service for each active subscriber, at least one setting indicating a type of activity occurring on the community website that is of interest to the active subscriber; providing, by the database service to each of the active subscribers, alerts that are responsive to an activity occurring on the community website that is of a type indicated by the at least one setting; generating, by the database service, statistics on the community website that include a count of a number of the active subscribers to the community website; providing, to the user by the database service, tools for the user to create a friend webpage specific to friends of the user; receiving, at the database service from the user via the tools, information to configure a friend webpage specific to another user including information about the other user; configuring, by the database service on behalf of the user, the friend webpage specific to the other user, wherein the friend webpage is configured to include the information about the other user received from the user; and making, by the database service, the friend webpage having the information about the other user accessible only to the user and to additional users given permission by the user. | 1. A non-transitory machine-readable medium carrying one or more sequences of instructions causing a computer to implement a method comprising: providing, to a user by a database service, tools for creating a community website including one or more community webpages to be made accessible to potential subscribers to the community website; receiving, at the database service from the user via the tools, information to configure the community website, the information including one or more potential subscribers to be invited to the community website; in response to receiving the information, sending, by the database service, an invitation to join the community website to each of the potential subscribers; in response to an acceptance of a corresponding invitation by a potential subscriber, creating, by the database service, an active subscriber account on the community website to enable access to the community website, wherein the access to the community website includes allowing the active subscriber account to: post content to the community website, comment on content posted to the community website, participate in discussions on the community website, search for keywords, members, and comments on the community website, send information related to the community website from the community website in an e-mail, and vote on each particular content posted to the community website via selection of a link associated with the particular content, wherein the visually represents a count of a total number of votes cast for the particular content; storing, by the database service for each active subscriber, at least one setting indicating a type of activity occurring on the community website that is of interest to the active subscriber; providing, by the database service to each of the active subscribers, alerts that are responsive to an activity occurring on the community website that is of a type indicated by the at least one setting; generating, by the database service, statistics on the community website that include a count of a number of the active subscribers to the community website; providing, to the user by the database service, tools for the user to create a friend webpage specific to friends of the user; receiving, at the database service from the user via the tools, information to configure a friend webpage specific to another user including information about the other user; configuring, by the database service on behalf of the user, the friend webpage specific to the other user, wherein the friend webpage is configured to include the information about the other user received from the user; and making, by the database service, the friend webpage having the information about the other user accessible only to the user and to additional users given permission by the user. 4. The non-transitory machine-readable medium of claim 1 , the one or more community webpages having one or more Uniform Resource Locators (URLs) in a format appropriate for copying the one or more URLs. | 0.835227 |
9,330,085 | 10 | 11 | 10. The computer program product as recited in claim 8 further comprising the programming instructions for: receiving one or more identifiers to identify each of said at least one designated primary objects. | 10. The computer program product as recited in claim 8 further comprising the programming instructions for: receiving one or more identifiers to identify each of said at least one designated primary objects. 11. The computer program product as recited in claim 10 further comprising the programming instructions for: assigning said score for each of said at least one designated primary objects based on closeness in location of said each identified term to said one or more identifiers used to identify each of said at least one designated primary objects in said document. | 0.5 |
8,122,011 | 1 | 4 | 1. A computer-implemented method, comprising: identifying a first query and a second query in a query log; identifying a set of overlapping predicate queries for the first query and the second query, the set of overlapping predicate queries being a set of predicate queries for the first query that are also predicate queries for the second query; identifying, by one or more computers, an intersection set size associated with an intersection set of a first set of predicate queries comprising queries that have immediately preceded the first query in associated sessions and a second set of predicate queries comprising queries that have immediately preceded the second query in associated sessions, the intersection set thereby defining the set of overlapping predicate queries; identifying, by one or more computers, a union set size associated with a union set of the first set of predicate queries and the second set of predicate queries; and assigning, by one or more computers, a quotient of the intersection set size over the union set size as a query intersect frequency for the first query and the second query; determining a query map value for the first query and the second query, the query map value being determined from the set of overlapping predicate queries and comprising the query intersect frequency; determining that the query map value exceeds a threshold; and in response to determining that the query map value exceeds the threshold, identifying the first query as a query suggestion for the second query and the second query as a query suggestion for the first query. | 1. A computer-implemented method, comprising: identifying a first query and a second query in a query log; identifying a set of overlapping predicate queries for the first query and the second query, the set of overlapping predicate queries being a set of predicate queries for the first query that are also predicate queries for the second query; identifying, by one or more computers, an intersection set size associated with an intersection set of a first set of predicate queries comprising queries that have immediately preceded the first query in associated sessions and a second set of predicate queries comprising queries that have immediately preceded the second query in associated sessions, the intersection set thereby defining the set of overlapping predicate queries; identifying, by one or more computers, a union set size associated with a union set of the first set of predicate queries and the second set of predicate queries; and assigning, by one or more computers, a quotient of the intersection set size over the union set size as a query intersect frequency for the first query and the second query; determining a query map value for the first query and the second query, the query map value being determined from the set of overlapping predicate queries and comprising the query intersect frequency; determining that the query map value exceeds a threshold; and in response to determining that the query map value exceeds the threshold, identifying the first query as a query suggestion for the second query and the second query as a query suggestion for the first query. 4. The computer-implemented method of claim 1 , wherein: the query map value comprises: a query quantity identifying a count of a number of queries in the set of overlapping predicate queries; and a query intersect frequency indicative of a percentage of overlap, the percentage of overlap comprising a quotient of the number of queries in the set of overlapping predicate queries relative to the number of queries in a union of all predicate queries associated with the first and second queries; and the threshold comprises a quantity threshold and an intersect frequency threshold. | 0.590014 |
9,152,674 | 17 | 18 | 17. The server of claim 16 , wherein deriving the initial result set includes: determining a consideration set of application representations from the pre-consideration set of application representations based on one or more features of the identified group of application representations, the consideration set including the set of one or more application representations; and for each application representation in the consideration set of application representations: determining one or more query/result features, each query/result feature defining a feature of the application representation with respect to the search query; and augmenting features of the application representation with the one or more query/result features. | 17. The server of claim 16 , wherein deriving the initial result set includes: determining a consideration set of application representations from the pre-consideration set of application representations based on one or more features of the identified group of application representations, the consideration set including the set of one or more application representations; and for each application representation in the consideration set of application representations: determining one or more query/result features, each query/result feature defining a feature of the application representation with respect to the search query; and augmenting features of the application representation with the one or more query/result features. 18. The server of claim 17 , wherein determining the score of an application representation includes inputting the features of the application representation, the query/result features of the application representation, and the query features into the one or more scoring models. | 0.5 |
7,778,875 | 17 | 20 | 17. An apparatus serially providing a plurality of web pages comprising a workflow, the web pages including targeted advertisements recommended by users of the workflow, the apparatus comprising: a receiver in communication with, via a network, a user completing a workflow via a client, the receiver receiving from the client information corresponding to a first or second step in the workflow and an advertiser recommended by the user in connection with the first or second step in the workflow; an advertisement engine in communication with the receiver, the engine identifying an advertisement corresponding to the recommended advertiser; a markup language page generator in communication with the advertisement engine, the markup language page generator creating a page corresponding to the first or second step in the workflow and including the identified advertisement; and a transmitter in communication with the markup language page generator and, via the network, the client, the transmitter sending to the client the created page. | 17. An apparatus serially providing a plurality of web pages comprising a workflow, the web pages including targeted advertisements recommended by users of the workflow, the apparatus comprising: a receiver in communication with, via a network, a user completing a workflow via a client, the receiver receiving from the client information corresponding to a first or second step in the workflow and an advertiser recommended by the user in connection with the first or second step in the workflow; an advertisement engine in communication with the receiver, the engine identifying an advertisement corresponding to the recommended advertiser; a markup language page generator in communication with the advertisement engine, the markup language page generator creating a page corresponding to the first or second step in the workflow and including the identified advertisement; and a transmitter in communication with the markup language page generator and, via the network, the client, the transmitter sending to the client the created page. 20. The apparatus of claim 17 wherein the markup language page generator creates an HTML page. | 0.878866 |
4,531,184 | 2 | 10 | 2. A video conversational communication network in accordance with claim 1 wherein said one message switching interface means comprises at least one host computer network control means and a plurality of keystation terminal controller interface means operatively connected between said keystations and said one host computer network control means with at least one keystation being operatively connected to one keystation terminal controller interface means for each of said plurality of keystation terminal controller interface means, said host computer network control means comprising said message routing logic means and said storage means operatively connected thereto, each of said keystation terminal controller interface means comprising said display control logic means and said local video display storage means for locally storing video conversational textual data for providing a video display thereof to at least one of said keystations connected to said keystation terminal controller interface means, said keyboard means providing said unique calling signals to said keystation terminal controller interface means, said keystation terminal controller interface means comprising means for providing said calling signals to said one host computer network control means and for receiving said calling signals therefrom for completing a call to said one connected keystation. | 2. A video conversational communication network in accordance with claim 1 wherein said one message switching interface means comprises at least one host computer network control means and a plurality of keystation terminal controller interface means operatively connected between said keystations and said one host computer network control means with at least one keystation being operatively connected to one keystation terminal controller interface means for each of said plurality of keystation terminal controller interface means, said host computer network control means comprising said message routing logic means and said storage means operatively connected thereto, each of said keystation terminal controller interface means comprising said display control logic means and said local video display storage means for locally storing video conversational textual data for providing a video display thereof to at least one of said keystations connected to said keystation terminal controller interface means, said keyboard means providing said unique calling signals to said keystation terminal controller interface means, said keystation terminal controller interface means comprising means for providing said calling signals to said one host computer network control means and for receiving said calling signals therefrom for completing a call to said one connected keystation. 10. A video conversational communication network in accordance with claim 2 wherein said local storage means comprises means for retrievably storing a subscriber created page of textual data, said keyboard means comprising means for providing a unique contact list page calling signal to said message routing logic means corresponding to a designated retrievably stored contact list, said message routing logic means being responsive to said unique contact list page calling signal for simultaneously transmitting said subscriber created page to all of said keystations on said contact list, whereby a subscriber may simultaneously transmit a message to a plurality of predesignated subscribers in the network in single call. | 0.541139 |
10,152,966 | 6 | 11 | 6. A method comprising: receiving, at a device, an audio signal comprising a signal marker of a plurality of signal markers; processing the signal marker; and determining, based on the processing of the signal marker, not to cause execution of a voice command associated with the signal marker, wherein the plurality of signal markers comprises a first signal marker configured to cause the device not to cause execution of a voice command for a first time duration and a second signal marker configured to cause the device not to cause execution of a voice command for a second time duration. | 6. A method comprising: receiving, at a device, an audio signal comprising a signal marker of a plurality of signal markers; processing the signal marker; and determining, based on the processing of the signal marker, not to cause execution of a voice command associated with the signal marker, wherein the plurality of signal markers comprises a first signal marker configured to cause the device not to cause execution of a voice command for a first time duration and a second signal marker configured to cause the device not to cause execution of a voice command for a second time duration. 11. The method of claim 6 , further comprising: sampling the received audio signal at periodic intervals; and determining, based on the sampling of the received audio signal at periodic intervals, a location of a source that generated the audio signal. | 0.5 |
8,416,928 | 1 | 17 | 1. A method for determining a phone number from a voice mail message, the method comprising the steps of: a computer receiving a voice mail message comprising a plurality of words, wherein said received voice mail message is from a caller who used a calling device; the computer receiving from the calling device a voice-to-number dictionary associated with the voice mail message, the voice-to-number dictionary comprising a plurality of phone numbers and one or more words associated with each of the plurality of phone numbers; the computer analyzing the voice mail message by parsing the plurality of words of the voice mail message and by comparing the parsed plurality of words to the one or more words associated with each of the plurality of phone numbers of the voice-to-number dictionary; the computer determining a phone number of the plurality of phone numbers of the voice-to-number directory that is associated with the voice mail message, wherein the step of determining the phone number comprises the computer determining that one or more words associated with the phone number matches one of the parsed plurality of words; and the computer performing a programmatic action that utilizes the determined phone number as input, wherein the programmatic action comprises one or more of dialing the determined phone number, storing an indication of determined phone number, or deleting a previously stored phone number and replacing the previously stored phone number with the determined phone number. | 1. A method for determining a phone number from a voice mail message, the method comprising the steps of: a computer receiving a voice mail message comprising a plurality of words, wherein said received voice mail message is from a caller who used a calling device; the computer receiving from the calling device a voice-to-number dictionary associated with the voice mail message, the voice-to-number dictionary comprising a plurality of phone numbers and one or more words associated with each of the plurality of phone numbers; the computer analyzing the voice mail message by parsing the plurality of words of the voice mail message and by comparing the parsed plurality of words to the one or more words associated with each of the plurality of phone numbers of the voice-to-number dictionary; the computer determining a phone number of the plurality of phone numbers of the voice-to-number directory that is associated with the voice mail message, wherein the step of determining the phone number comprises the computer determining that one or more words associated with the phone number matches one of the parsed plurality of words; and the computer performing a programmatic action that utilizes the determined phone number as input, wherein the programmatic action comprises one or more of dialing the determined phone number, storing an indication of determined phone number, or deleting a previously stored phone number and replacing the previously stored phone number with the determined phone number. 17. The method of claim 1 , wherein the determined phone number is a number from the voice-to-number dictionary that was not spoken in the voice mail message. | 0.801008 |
9,007,405 | 1 | 7 | 1. A method comprising: determining for an image-based document, by at least one of one or more computing systems, a color value of each pixel of a plurality of pixels; associating, by at least one of the one or more computing systems, a dominant color value to content within the image-based document, the content comprising at least text having a text color value within a predetermined deviation of the dominant color value; identifying, by at least one of the one or more computing systems, an image within the image-based document, the image comprising a group of pixels having a color value within the predetermined deviation of the dominant color value; determining, a layout of the text by identifying bounds of columns in a multicolumn presentation of the text within the image-based document, the determining based at least in part on the dominant color value; determining, by at least one of the one or more computing systems, a flow of the text between the columns by performing character recognition on a portion of the text in the columns; ordering, by at least one of the one or more computing systems, the columns based at least in part on the determined flow of the text; receiving, by at least one of the one or more computing systems, a zoom-in command associated with a selected column; zooming-in, by at least one of the one or more computing systems, on the selected column to initiate a column-viewing mode to enlarge the selected column such that the bounds of the selected column are enlarged to approximately span a width of a display space; and presenting, by at least one of the one or more computing systems, another column in line with the selected column based at least in part on the ordering of the columns to enable continuous scrolling through the columns in the column-viewing mode. | 1. A method comprising: determining for an image-based document, by at least one of one or more computing systems, a color value of each pixel of a plurality of pixels; associating, by at least one of the one or more computing systems, a dominant color value to content within the image-based document, the content comprising at least text having a text color value within a predetermined deviation of the dominant color value; identifying, by at least one of the one or more computing systems, an image within the image-based document, the image comprising a group of pixels having a color value within the predetermined deviation of the dominant color value; determining, a layout of the text by identifying bounds of columns in a multicolumn presentation of the text within the image-based document, the determining based at least in part on the dominant color value; determining, by at least one of the one or more computing systems, a flow of the text between the columns by performing character recognition on a portion of the text in the columns; ordering, by at least one of the one or more computing systems, the columns based at least in part on the determined flow of the text; receiving, by at least one of the one or more computing systems, a zoom-in command associated with a selected column; zooming-in, by at least one of the one or more computing systems, on the selected column to initiate a column-viewing mode to enlarge the selected column such that the bounds of the selected column are enlarged to approximately span a width of a display space; and presenting, by at least one of the one or more computing systems, another column in line with the selected column based at least in part on the ordering of the columns to enable continuous scrolling through the columns in the column-viewing mode. 7. The method as recited in claim 1 , further comprising: in response to determining that the color value of a pixel is not within the predetermined deviation of the dominant color value; determining whether at least a predetermined percentage of other pixels adjacent to the pixel have different color values than the color value of the pixel; in response to determining that at least the predetermined percentage of the other pixels have different color values than the color value of the pixel, associating the pixel with an artifact of the image-based document; and removing the artifact from the image-based document. | 0.5 |
8,280,885 | 1 | 3 | 1. A computer-implemented method, using a processor, for generating an opinion summary from a document, said method comprising: using at least one of syntactic analysis, semantic analysis and discourse analysis to assist in automatically extracting a plurality of opinion expressions from the document using the processor, each opinion expression identified by a grammatical element and associated with an opinion source, opinion topic, opinion polarity and opinion strength, wherein for each opinion expression the opinion source is at least one person or entity to which such opinion expression is to be attributed and wherein the document includes opinion expressions from a plurality of opinion sources; identifying those opinion expressions that share a common opinion source and a common opinion topic using the processor; and combining the opinion polarities and opinion strengths of those opinion expressions that share a common opinion source to form an overall opinion summary with one aggregate opinion frame for each common opinion source-topic pairing. | 1. A computer-implemented method, using a processor, for generating an opinion summary from a document, said method comprising: using at least one of syntactic analysis, semantic analysis and discourse analysis to assist in automatically extracting a plurality of opinion expressions from the document using the processor, each opinion expression identified by a grammatical element and associated with an opinion source, opinion topic, opinion polarity and opinion strength, wherein for each opinion expression the opinion source is at least one person or entity to which such opinion expression is to be attributed and wherein the document includes opinion expressions from a plurality of opinion sources; identifying those opinion expressions that share a common opinion source and a common opinion topic using the processor; and combining the opinion polarities and opinion strengths of those opinion expressions that share a common opinion source to form an overall opinion summary with one aggregate opinion frame for each common opinion source-topic pairing. 3. The computer-implemented method of claim 1 , wherein identifying those opinion expressions that share a common opinion topic includes identifying those opinion expressions that have a common real-world opinion topic expressed in the document with different language. | 0.723819 |
5,473,728 | 1 | 2 | 1. A method for training a speech recognizer in a speech recognition system, said method comprising the steps of: providing a data base containing a plurality of acoustic speech units; generating a homoscedastic hidden Markov model (HMM) from said plurality of acoustic speech units in said data base; said generating step comprises forming a set of pooled training data from said plurality of acoustic speech units and estimating a single global covariance matrix using said pooled training data set, said single global covariance matrix representing a tied covariance matrix for every Gaussian probability density function (PDF) for every state of every hidden Markov model structure in said homoscedastic hidden Markov model; and loading said homoscedastic hidden Markov model into the speech recognizer. | 1. A method for training a speech recognizer in a speech recognition system, said method comprising the steps of: providing a data base containing a plurality of acoustic speech units; generating a homoscedastic hidden Markov model (HMM) from said plurality of acoustic speech units in said data base; said generating step comprises forming a set of pooled training data from said plurality of acoustic speech units and estimating a single global covariance matrix using said pooled training data set, said single global covariance matrix representing a tied covariance matrix for every Gaussian probability density function (PDF) for every state of every hidden Markov model structure in said homoscedastic hidden Markov model; and loading said homoscedastic hidden Markov model into the speech recognizer. 2. The method of claim 1 wherein the training data set forming step comprises: forming the training data set from all possible ones of said plurality of speech units in said data base, said training data set containing a number of observations for each of said speech units; and collecting the training data for said set so that each said observation retains a true speech unit label. | 0.5 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.