patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
8,972,411 | 11 | 14 | 11. A computer system comprising: memory; and a data processing apparatus coupled to the memory, wherein the data processing apparatus comprises: a matching engine having an input that receives data representing a plurality of query terms arranged in a plurality of sets of query terms, and configured to access an electronic database including computer readable storage that stores data representing items of sponsored content, wherein each item of sponsored content has associated a plurality of item terms, and the computer readable storage further stores data representing the plurality of item terms associated with the sponsored content, and having an output that provides information identifying for each of the items of sponsored content a set of matched query terms using a matching operation between the plurality of query terms and the plurality of item terms associated with the item of sponsored content, wherein each of the plurality of sets of query terms comprises at least one query term that matches at least one item term of the plurality of item terms associated with the item of sponsored content; a condition detector having an input that receives information describing for each of the items of sponsored content the identified set of matched query terms, and having an output that provides a number of one or more unique terms that are included in (i) the identified set of matched query terms and (ii) more than one set of the plurality of sets of query terms; and a score calculator having an input that receives the information describing for each of the items of sponsored content the determined number of the one or more unique query terms, and having an output that provides a score for each of the items of sponsored content according to the set of matched query terms, wherein a value for each of the matched query terms is determined based on a number of sets of the plurality of sets of query terms in which the each of the matched query terms resides, weighted based on a set in which the each of the matched query terms resides, and the score of the item is determined by combining values for all the matched query terms, wherein the score for each of the items of sponsored content is adjusted as a function of the determined number of the one or more unique query terms, and the adjusted score is assigned to the item of sponsored content. | 11. A computer system comprising: memory; and a data processing apparatus coupled to the memory, wherein the data processing apparatus comprises: a matching engine having an input that receives data representing a plurality of query terms arranged in a plurality of sets of query terms, and configured to access an electronic database including computer readable storage that stores data representing items of sponsored content, wherein each item of sponsored content has associated a plurality of item terms, and the computer readable storage further stores data representing the plurality of item terms associated with the sponsored content, and having an output that provides information identifying for each of the items of sponsored content a set of matched query terms using a matching operation between the plurality of query terms and the plurality of item terms associated with the item of sponsored content, wherein each of the plurality of sets of query terms comprises at least one query term that matches at least one item term of the plurality of item terms associated with the item of sponsored content; a condition detector having an input that receives information describing for each of the items of sponsored content the identified set of matched query terms, and having an output that provides a number of one or more unique terms that are included in (i) the identified set of matched query terms and (ii) more than one set of the plurality of sets of query terms; and a score calculator having an input that receives the information describing for each of the items of sponsored content the determined number of the one or more unique query terms, and having an output that provides a score for each of the items of sponsored content according to the set of matched query terms, wherein a value for each of the matched query terms is determined based on a number of sets of the plurality of sets of query terms in which the each of the matched query terms resides, weighted based on a set in which the each of the matched query terms resides, and the score of the item is determined by combining values for all the matched query terms, wherein the score for each of the items of sponsored content is adjusted as a function of the determined number of the one or more unique query terms, and the adjusted score is assigned to the item of sponsored content. 14. The computer system of claim 11 , further comprising a server for serving, for display on a device to a user, an item of sponsored content selected based on the item of sponsored content's score. | 0.5 |
8,560,005 | 1 | 8 | 1. A mobile communication terminal capable of text-to-speech synthesis, the terminal comprising: a display unit for displaying at least one object on a screen; a controller for identifying a characteristic of an activated object on the screen and finding a speech data mapped to the identified characteristic; a speech synthesizer for converting textual contents of the activated object into audio data using the speech data; and an audio processor for outputting the audio data in speech sounds. | 1. A mobile communication terminal capable of text-to-speech synthesis, the terminal comprising: a display unit for displaying at least one object on a screen; a controller for identifying a characteristic of an activated object on the screen and finding a speech data mapped to the identified characteristic; a speech synthesizer for converting textual contents of the activated object into audio data using the speech data; and an audio processor for outputting the audio data in speech sounds. 8. The mobile communication terminal of claim 1 , wherein the controller controls, in response to a request for state information input through an input unit, output of an audible signal corresponding to current state information of the mobile communication terminal using a preset speech data. | 0.669663 |
8,661,094 | 13 | 16 | 13. A method of WWW page retrieval for enabling a user using a computer having a web browser with a browser window having a URL entry field running on the computer and a connection to the Internet to retrieve a desired webpage to the browser, comprising: (a) enabling a translator input window to be overlaid on a portion of the browser window for allowing a user to enter an input of a non-URL-address text string therein; (b) enabling a translator entity which is operatively coupled to the browser and to said translator input window overlaid on the browser window and having functionality for receiving input text string information of one or more words that is not a URL address entered by a user through the translator input window overlaid on a portion of the browser window, wherein said translator entity receives said information from a domain name server to enable return to the user's web browser of a URL address for a desired webpage in response to the information; (c) said translator entity being operative to determine a URL address for a web page which is most likely to be a desired webpage associated with the input text string information received from the user, based on statistical data of web pages in web search results for said information; and (d) said translator entity being operative for sending the URL address to the web browser of the user's computer to enable retrieval of the web page responsive to said URL address to be directly displayed on the user's browser, without any additional user intervention beyond the entry of said input text string information. | 13. A method of WWW page retrieval for enabling a user using a computer having a web browser with a browser window having a URL entry field running on the computer and a connection to the Internet to retrieve a desired webpage to the browser, comprising: (a) enabling a translator input window to be overlaid on a portion of the browser window for allowing a user to enter an input of a non-URL-address text string therein; (b) enabling a translator entity which is operatively coupled to the browser and to said translator input window overlaid on the browser window and having functionality for receiving input text string information of one or more words that is not a URL address entered by a user through the translator input window overlaid on a portion of the browser window, wherein said translator entity receives said information from a domain name server to enable return to the user's web browser of a URL address for a desired webpage in response to the information; (c) said translator entity being operative to determine a URL address for a web page which is most likely to be a desired webpage associated with the input text string information received from the user, based on statistical data of web pages in web search results for said information; and (d) said translator entity being operative for sending the URL address to the web browser of the user's computer to enable retrieval of the web page responsive to said URL address to be directly displayed on the user's browser, without any additional user intervention beyond the entry of said input text string information. 16. A method according to claim 13 , wherein the statistical data is based on number of visits to web pages by users previously. | 0.718062 |
9,251,185 | 10 | 13 | 10. A system comprising one or more processors that performs a method comprising: providing a set of search results returned in response to a search query composed and issued by a user; determining a ranking of the set of returned search results against each other as a function of relevance to the issued search query; selecting for evaluation one or more search results from the returned set of search results based on the ranking; determining a level of quality, that is independent of the terms of the search query, for each of the one or more selected search results from the returned set of search results by employing a classification process, wherein the classification process comprises: targeting features demonstrated by the one or more selected search results to be evaluated; evaluating the targeted features to generate a level-of-quality score for each of the one or more selected search results, wherein the level-of-quality score is evaluated using a cross-result entropy that quantifies a level of similarity between a plurality of the search results, and wherein the search engine is configured to decrease the level-of-quality score based on determining that the cross-result entropy is sufficiently high; comparing the level-of-quality score against a predefined threshold value; and based on the comparison, assigning each of the one or more selected search results an absolute measurement, wherein the absolute measurement indicates good quality when the level-of-quality score is greater than the threshold value, and wherein the absolute measurement indicates poor quality when the level-of-quality score is less than the threshold value; calculating a level of confidence that a rewritten search query will provide new search results that improve the set of search results; automatically rewriting the search query by the search engine to generate the rewritten search query, wherein each key word of the rewritten search query is automatically selected for inclusion in the rewritten search query; and based on the calculated level of confidence indicating that the rewritten search query will provide the new search results that improve the set of search results, and based on identifying that the absolute measurement assigned to at least one of the one or more selected search results indicates the poor quality, automatically conducting a search with the rewritten search query. | 10. A system comprising one or more processors that performs a method comprising: providing a set of search results returned in response to a search query composed and issued by a user; determining a ranking of the set of returned search results against each other as a function of relevance to the issued search query; selecting for evaluation one or more search results from the returned set of search results based on the ranking; determining a level of quality, that is independent of the terms of the search query, for each of the one or more selected search results from the returned set of search results by employing a classification process, wherein the classification process comprises: targeting features demonstrated by the one or more selected search results to be evaluated; evaluating the targeted features to generate a level-of-quality score for each of the one or more selected search results, wherein the level-of-quality score is evaluated using a cross-result entropy that quantifies a level of similarity between a plurality of the search results, and wherein the search engine is configured to decrease the level-of-quality score based on determining that the cross-result entropy is sufficiently high; comparing the level-of-quality score against a predefined threshold value; and based on the comparison, assigning each of the one or more selected search results an absolute measurement, wherein the absolute measurement indicates good quality when the level-of-quality score is greater than the threshold value, and wherein the absolute measurement indicates poor quality when the level-of-quality score is less than the threshold value; calculating a level of confidence that a rewritten search query will provide new search results that improve the set of search results; automatically rewriting the search query by the search engine to generate the rewritten search query, wherein each key word of the rewritten search query is automatically selected for inclusion in the rewritten search query; and based on the calculated level of confidence indicating that the rewritten search query will provide the new search results that improve the set of search results, and based on identifying that the absolute measurement assigned to at least one of the one or more selected search results indicates the poor quality, automatically conducting a search with the rewritten search query. 13. The system of claim 10 , wherein the method comprises assigning a classification to the or more selected search results in an absolute sense, such that the classification is either the good quality or the poor quality. | 0.685552 |
9,633,650 | 8 | 10 | 8. The method of claim 7 , further comprising: comparing the at least one contusion network to at least one model used in the large vocabulary speech recognition system to determine a conformity between the at least one confusion network and the at least one model; and calculating a transcription quality score for each of the audio files from the determined conformity. | 8. The method of claim 7 , further comprising: comparing the at least one contusion network to at least one model used in the large vocabulary speech recognition system to determine a conformity between the at least one confusion network and the at least one model; and calculating a transcription quality score for each of the audio files from the determined conformity. 10. The method of claim 8 , further comprising diarizing at least one transcription of each audio file from the plurality of transcription alternatives of each audio file to identify at least a first speaker and a second speaker in the at least one transcription, wherein the statistics are calculated from the diarized at least one transcription for the first speaker and the second speaker. | 0.5 |
7,689,033 | 2 | 3 | 2. The method as recited in claim 1 , further comprising dividing a digital image into a plurality of portions. | 2. The method as recited in claim 1 , further comprising dividing a digital image into a plurality of portions. 3. The method recited in claim 2 , wherein at least one of the plurality of portions has a shape selected from a group of shapes comprising, mangle and a square. | 0.664583 |
8,024,175 | 1 | 3 | 1. A non-transitory computer-readable medium storing a program for searching a translation memory and displaying retrieved translations, the program causing a computer to function as: a parallel text memory storing a plurality of parallel texts each being a text in a source language together with a translation thereof in a target language, the parallel texts including: (a) sentence-class parallel texts each being a source sentence together with a translation thereof, and (b) segment-class parallel texts each being a source segment together with a translation thereof, the source segment being a part of the source sentence; a relation link memory storing relation links representing containment relationships between the source sentences and source segments, wherein a containing text and a contained text are located respectively at an upper level and a lower level in a containment hierarchy; an input text receiver that receives an input text as an object to be analyzed and translated; a search processor that searches the parallel text memory using the input text as a search key to retrieve parallel texts whose source sentences or source segments are relevant to the input text; a match rate calculator that calculates a match rate of each parallel text retrieved by the search processor, the match rate representing the number of common characters found in both the input text and the source sentence or source segment of each parallel text; a link adder that adds a downward link to each retrieved sentence-class parallel text by consulting the relation link memory so as to link that sentence-class parallel text to a segment-class parallel text, as well as adding an upward link to each retrieved segment-class parallel text by consulting the relation link memory so as to link that segment-class parallel text to a sentence-class parallel text; a result screen generator that produces a search result screen showing a segment-class parallel text with a highest match rate, which is selected out of all the retrieved segment-class parallel texts; and a view range selector that replaces the currently displayed segment-class parallel text with a sentence-class parallel text pointed at by the upward link added to the currently displayed segment-class parallel text, in response to an expand command. | 1. A non-transitory computer-readable medium storing a program for searching a translation memory and displaying retrieved translations, the program causing a computer to function as: a parallel text memory storing a plurality of parallel texts each being a text in a source language together with a translation thereof in a target language, the parallel texts including: (a) sentence-class parallel texts each being a source sentence together with a translation thereof, and (b) segment-class parallel texts each being a source segment together with a translation thereof, the source segment being a part of the source sentence; a relation link memory storing relation links representing containment relationships between the source sentences and source segments, wherein a containing text and a contained text are located respectively at an upper level and a lower level in a containment hierarchy; an input text receiver that receives an input text as an object to be analyzed and translated; a search processor that searches the parallel text memory using the input text as a search key to retrieve parallel texts whose source sentences or source segments are relevant to the input text; a match rate calculator that calculates a match rate of each parallel text retrieved by the search processor, the match rate representing the number of common characters found in both the input text and the source sentence or source segment of each parallel text; a link adder that adds a downward link to each retrieved sentence-class parallel text by consulting the relation link memory so as to link that sentence-class parallel text to a segment-class parallel text, as well as adding an upward link to each retrieved segment-class parallel text by consulting the relation link memory so as to link that segment-class parallel text to a sentence-class parallel text; a result screen generator that produces a search result screen showing a segment-class parallel text with a highest match rate, which is selected out of all the retrieved segment-class parallel texts; and a view range selector that replaces the currently displayed segment-class parallel text with a sentence-class parallel text pointed at by the upward link added to the currently displayed segment-class parallel text, in response to an expand command. 3. The non-transitory computer-readable medium according to claim 1 , the program further causing the computer to function as a sorter that sorts the retrieved parallel texts into groups each deriving from one source sentence and source segments thereof, then extracts a best matching parallel text from each group, and sorts the extracted parallel texts in descending order of the best match rate of each group, wherein the result screen generator produces a search result screen showing the extracted parallel texts in the sorted order. | 0.66417 |
9,633,365 | 17 | 22 | 17. A computer-readable storage medium encoded with a computer program comprising instructions that, when executed, operate to cause a computer to perform operations comprising: receiving data indicating that a first user performed a conversion action in response to a first ad, wherein the received data includes an ad ID for the first ad and a first limited ID cookie that only identifies an encrypted user ID for the first user; decrypting the first limited ID cookie to obtain the user ID of the first user; creating a conversion record that includes the user ID for the first user an entity ID for an entity associated with the first ad, and the conversion action performed by the first user; receiving an ad request over a network from a client device of a second user, the ad request including a second limited ID cookie that only identifies an encrypted user ID for the second user; decrypting the second limited ID cookie to obtain the user ID of the second user; determining that the second user is a social contact of the first user in a social network based on the user ID of the second user and the user ID of the first user; in response to receiving the ad request, selecting a second ad with an ad ID; determining, based on the ad ID of the second ad, that the second ad is associated with a same entity as the first ad that is associated with the conversion action performed by the first user; retrieving conversion records containing the entity ID for the same entity, wherein the retrieved conversion records include at least the created conversion record; constructing a detailed annotation for display in the second ad based on the created conversion record that contains the user ID for the first user, wherein the detailed annotation identifies (i) the user ID of the first user, (ii) the conversion action performed by the first user, and (iii) the same entity; and sending the detailed annotation over the network to the client device in a format suitable for presentation on a display of the client device in conjunction with the selected ad. | 17. A computer-readable storage medium encoded with a computer program comprising instructions that, when executed, operate to cause a computer to perform operations comprising: receiving data indicating that a first user performed a conversion action in response to a first ad, wherein the received data includes an ad ID for the first ad and a first limited ID cookie that only identifies an encrypted user ID for the first user; decrypting the first limited ID cookie to obtain the user ID of the first user; creating a conversion record that includes the user ID for the first user an entity ID for an entity associated with the first ad, and the conversion action performed by the first user; receiving an ad request over a network from a client device of a second user, the ad request including a second limited ID cookie that only identifies an encrypted user ID for the second user; decrypting the second limited ID cookie to obtain the user ID of the second user; determining that the second user is a social contact of the first user in a social network based on the user ID of the second user and the user ID of the first user; in response to receiving the ad request, selecting a second ad with an ad ID; determining, based on the ad ID of the second ad, that the second ad is associated with a same entity as the first ad that is associated with the conversion action performed by the first user; retrieving conversion records containing the entity ID for the same entity, wherein the retrieved conversion records include at least the created conversion record; constructing a detailed annotation for display in the second ad based on the created conversion record that contains the user ID for the first user, wherein the detailed annotation identifies (i) the user ID of the first user, (ii) the conversion action performed by the first user, and (iii) the same entity; and sending the detailed annotation over the network to the client device in a format suitable for presentation on a display of the client device in conjunction with the selected ad. 22. The computer-readable storage medium of claim 17 , the computer program further comprising instructions that, when executed, operate to cause the computer to perform further operations comprising: boosting an ad score of the ad for which the first user performed the conversion action. | 0.660798 |
8,595,175 | 16 | 17 | 16. A developer process for managing object persistence, comprising the steps of: writing in a piece of software a portion of code for obtaining an ORM session from an object-relational mapper; writing in the software another portion of code which contains an API Pattern that includes calls to a fluent interface for manipulating a mapped persistence ignorant object; causing execution of the codes by a computer system utilizing a memory in operable communication with a least one processor; and ascertaining a result of the execution by inspecting the object. | 16. A developer process for managing object persistence, comprising the steps of: writing in a piece of software a portion of code for obtaining an ORM session from an object-relational mapper; writing in the software another portion of code which contains an API Pattern that includes calls to a fluent interface for manipulating a mapped persistence ignorant object; causing execution of the codes by a computer system utilizing a memory in operable communication with a least one processor; and ascertaining a result of the execution by inspecting the object. 17. The process of claim 16 , wherein writing code which contains an API Pattern comprises writing code which contains fluent interface calls in at least three of the following: a find-delete-save API Pattern; a current-value-original-value API Pattern; a nested-property API Pattern; an incremental-graph-load API Pattern; an incremental-graph-filtered-load API Pattern; a property-modification API Pattern; a dictionary API Pattern. | 0.5 |
8,402,427 | 6 | 7 | 6. The method of claim 1 , further comprising providing the input file to a web application generator that is configured to perform the parsing, identifying, and using. | 6. The method of claim 1 , further comprising providing the input file to a web application generator that is configured to perform the parsing, identifying, and using. 7. The method of claim 6 , further comprising employing the web application generator to read the input file and create an object representation of the input file for subsequent manipulation responsive to the reading. | 0.5 |
8,466,879 | 16 | 17 | 16. A computing device according to claim 12 , further comprising a windowing system, wherein the low-level inputs comprise window messages passed to the application by the windowing system. | 16. A computing device according to claim 12 , further comprising a windowing system, wherein the low-level inputs comprise window messages passed to the application by the windowing system. 17. A computing device according to claim 16 , wherein the window messages include messages that correspond to new touches of the multi-touch input device, movements of touches of the multi-touch input device, and endings of touches of the multi-touch input device. | 0.5 |
8,769,454 | 1 | 12 | 1. A method for register-transfer level (RTL) design checking for exploring simulation mismatches, synthesis mismatches, or ambiguous language semantics associated with generating a derived design from RTL design code, the method comprising: providing the RTL design code, to at least one processor, to generate an internal representation for verification of an electronic circuit design; comparing, by a design match engine, the RTL design code with design violation patterns contained in a design violation pattern database, wherein the design violation patterns identify violations relating to the simulation mismatches, synthesis mismatches, or ambiguous language semantics associated with generating the derived design that are otherwise undetected during equivalence checking between the derived design and the RTL design code; assigning a rule object to a design pattern in the RTL design code, by the at least one processor, when the design match engine determines that the design pattern in the RTL design code matches one of the design violation patterns in the design violation pattern database; and generating, with the at least one processor, a violation report comprising the rule objects and their corresponding design violation patterns. | 1. A method for register-transfer level (RTL) design checking for exploring simulation mismatches, synthesis mismatches, or ambiguous language semantics associated with generating a derived design from RTL design code, the method comprising: providing the RTL design code, to at least one processor, to generate an internal representation for verification of an electronic circuit design; comparing, by a design match engine, the RTL design code with design violation patterns contained in a design violation pattern database, wherein the design violation patterns identify violations relating to the simulation mismatches, synthesis mismatches, or ambiguous language semantics associated with generating the derived design that are otherwise undetected during equivalence checking between the derived design and the RTL design code; assigning a rule object to a design pattern in the RTL design code, by the at least one processor, when the design match engine determines that the design pattern in the RTL design code matches one of the design violation patterns in the design violation pattern database; and generating, with the at least one processor, a violation report comprising the rule objects and their corresponding design violation patterns. 12. The method of claim 1 , wherein the method further comprises categorizing the design violation patterns into at least one design violation pattern category. | 0.855072 |
7,577,651 | 44 | 45 | 44. The method of claim 43 wherein predicting the average precision comprises using a combination of temporal features comprising: (a) divergence; (b) autocorrelation; (c) statistics of the rank order; or (d) burst model. | 44. The method of claim 43 wherein predicting the average precision comprises using a combination of temporal features comprising: (a) divergence; (b) autocorrelation; (c) statistics of the rank order; or (d) burst model. 45. The method of claim 44 wherein predicting the average precision comprises using a combination of temporal features comprising: (a) Kullback-Leibler divergence; (b) autocorrelation; (c) kurtosis; (d) Kleinberg's burst model. | 0.5 |
8,767,256 | 1 | 4 | 1. A method implemented in a print shop management system for customizing a print job of a document containing color and black and white pages, comprising the steps of: (a) extracting meta-data of the print job to identify color pages of the document that are originally set to be printed in color; (b) providing a user interface for editing the meta-data by allowing input of individual page numbers designating which color pages of the document will indeed be printed in color; (c) detecting whether there is a constraint of color page and black and white page printing mismatch in a duplex or N-up printing of any pages of the document; and (d) when no constraint is detected in step (c), printing the document according to the edited meta-data by printing color pages of the document in color if they are also designated to be printed in color, and printing color pages of the document in black and white if they are not designated to be printed in color. | 1. A method implemented in a print shop management system for customizing a print job of a document containing color and black and white pages, comprising the steps of: (a) extracting meta-data of the print job to identify color pages of the document that are originally set to be printed in color; (b) providing a user interface for editing the meta-data by allowing input of individual page numbers designating which color pages of the document will indeed be printed in color; (c) detecting whether there is a constraint of color page and black and white page printing mismatch in a duplex or N-up printing of any pages of the document; and (d) when no constraint is detected in step (c), printing the document according to the edited meta-data by printing color pages of the document in color if they are also designated to be printed in color, and printing color pages of the document in black and white if they are not designated to be printed in color. 4. The method of claim 1 , further comprising the steps of restoring the original meta-data after editing, and using the original meta-data for printing the document. | 0.632743 |
9,858,265 | 11 | 19 | 11. A system for determining a type of conversation continuity in a natural language conversation comprising a first query and a second query to refine search results in response to the first query and the second query based on the type of conversation continuity, the system comprising: a memory storing at least one of a database and a knowledge graph; a user input device in communication with control circuitry; the control circuitry configured to: receive, via the user input device, the first query from a user; retrieve, from the database, a first search result for the first query; generate for display the first search result; receive, via the user input device, the second query from the user; determine a first token in the first query; determine a second token in the second query; identify first entity data for the first token, wherein the first entity data includes: a first entity type for the first token, a first probability that the first entity type corresponds to the first token, a second entity type for the first token, and a second probability that the second entity type corresponds to the first token; identify second entity data for the second token, wherein the second entity data includes: a third entity type for the second token, a third probability that the third entity type corresponds to the second token, a fourth entity type for the second token, and a fourth probability that the fourth entity type corresponds to the second token; transmit a request including an indication of the first entity data and the second entity data for connections between the first entity data and the second entity data; in response to the transmitted request, receive one or more graph connections between the first entity data and the second entity data obtained by a search of a knowledge graph, the search based on the indication of the first entity data and the second entity data; apply the first token, the second token, the first entity data, the second entity data, and the one or more graph connections as inputs to an artificial neural network; determine an output from the artificial neural network that indicates the type of conversation continuity between the first query and the second query; update the second query based on the type of conversation continuity; retrieve, from the database, a second search result for the updated second query; and generate for display the second search result. | 11. A system for determining a type of conversation continuity in a natural language conversation comprising a first query and a second query to refine search results in response to the first query and the second query based on the type of conversation continuity, the system comprising: a memory storing at least one of a database and a knowledge graph; a user input device in communication with control circuitry; the control circuitry configured to: receive, via the user input device, the first query from a user; retrieve, from the database, a first search result for the first query; generate for display the first search result; receive, via the user input device, the second query from the user; determine a first token in the first query; determine a second token in the second query; identify first entity data for the first token, wherein the first entity data includes: a first entity type for the first token, a first probability that the first entity type corresponds to the first token, a second entity type for the first token, and a second probability that the second entity type corresponds to the first token; identify second entity data for the second token, wherein the second entity data includes: a third entity type for the second token, a third probability that the third entity type corresponds to the second token, a fourth entity type for the second token, and a fourth probability that the fourth entity type corresponds to the second token; transmit a request including an indication of the first entity data and the second entity data for connections between the first entity data and the second entity data; in response to the transmitted request, receive one or more graph connections between the first entity data and the second entity data obtained by a search of a knowledge graph, the search based on the indication of the first entity data and the second entity data; apply the first token, the second token, the first entity data, the second entity data, and the one or more graph connections as inputs to an artificial neural network; determine an output from the artificial neural network that indicates the type of conversation continuity between the first query and the second query; update the second query based on the type of conversation continuity; retrieve, from the database, a second search result for the updated second query; and generate for display the second search result. 19. The system of claim 11 , wherein the control circuitry configured to update the second query based on the type of conversation continuity comprises the control circuitry configured to: identify the type of conversation continuity to be a no continuity type; and based on identifying the type of conversation continuity to be the no continuity type, assign the second query to be the updated second query. | 0.781818 |
9,253,338 | 1 | 4 | 1. A computer program product for routing a facsimile, the computer program product comprising a non-transitory computer readable medium having program code embodied therewith, the program code readable/executable by the processor to cause the processor to: receive a facsimile in a computer readable format; locate one or more keywords in the facsimile, wherein at least two of the keywords are not adjacent in the facsimile; analyze the facsimile to determine at least one of a meaning of the facsimile and a context of the facsimile; attempt to initiate a business process based at least in part on analysis; detect a problem with the attempt to initiate the business process; generate a notification of the problem; and route at least a portion of the facsimile comprising text to one or more destinations based at least in part on the analysis. | 1. A computer program product for routing a facsimile, the computer program product comprising a non-transitory computer readable medium having program code embodied therewith, the program code readable/executable by the processor to cause the processor to: receive a facsimile in a computer readable format; locate one or more keywords in the facsimile, wherein at least two of the keywords are not adjacent in the facsimile; analyze the facsimile to determine at least one of a meaning of the facsimile and a context of the facsimile; attempt to initiate a business process based at least in part on analysis; detect a problem with the attempt to initiate the business process; generate a notification of the problem; and route at least a portion of the facsimile comprising text to one or more destinations based at least in part on the analysis. 4. The computer program product as recited in claim 1 , further comprising logic configured to cause the processor to notify one or more entities of the detected problem. | 0.755747 |
7,880,738 | 14 | 21 | 14. A computer implemented system for viewing and interacting with structured document, the computer implemented system comprising: (a) a computational platform with a processor, memory and a storage medium; (b) a viewer made up of a graphical user interface; and (c) the structured document stored in a computer readable medium comprising non graphical information and graphical information with the vector and coordinate description of a representation of at least one three dimensional object and a user configured viewing component comprising data representing the three dimensional structured object component's view, wherein the structured document is comprised of a single multi view file; and wherein at least one of the three dimensional objects is a three dimensional representation of a biological or chemical molecule; and wherein the at least one attribute in said structured document is a view other than an initial view of an animation that can be interactively manipulated by the user via a browser graphical user interface; and wherein the structured document is a binary file viewable on at least one computing platform with a different order of Endians having a structured document viewer without any modification of the structured document prior to being viewed on the structured document viewer, and wherein the vector and coordinate description are stored jointly with the one or more view attributes or features in the single multi view file, and wherein the viewer displays the graphic and non graphic information contained in the structured document allowing the user to interact with said information. | 14. A computer implemented system for viewing and interacting with structured document, the computer implemented system comprising: (a) a computational platform with a processor, memory and a storage medium; (b) a viewer made up of a graphical user interface; and (c) the structured document stored in a computer readable medium comprising non graphical information and graphical information with the vector and coordinate description of a representation of at least one three dimensional object and a user configured viewing component comprising data representing the three dimensional structured object component's view, wherein the structured document is comprised of a single multi view file; and wherein at least one of the three dimensional objects is a three dimensional representation of a biological or chemical molecule; and wherein the at least one attribute in said structured document is a view other than an initial view of an animation that can be interactively manipulated by the user via a browser graphical user interface; and wherein the structured document is a binary file viewable on at least one computing platform with a different order of Endians having a structured document viewer without any modification of the structured document prior to being viewed on the structured document viewer, and wherein the vector and coordinate description are stored jointly with the one or more view attributes or features in the single multi view file, and wherein the viewer displays the graphic and non graphic information contained in the structured document allowing the user to interact with said information. 21. The computer implemented system of claim 14 wherein the vector and coordinate description of a representation of at least one three dimensional object is the vector and coordinate description of a representation of at least one three dimensional molecule comprised of connectivity and Cartesian coordinates. | 0.751597 |
8,165,277 | 26 | 27 | 26. A system for the creation of user-requested telephony features, comprising: a service creation environment comprising an application operable to: receive a plurality of instructions defining a graphical representation of an implementation of one or more telephony features for an endpoint, the graphical representation comprising a plurality of graphical elements, each graphical element representing at least a portion of a state process of the one or more telephony features; generate the graphical representation in accordance with the plurality of instructions; convert a first graphical element into a first text command; convert a second graphical element into a second text command, the first and second text commands specifying a plurality of actions of the state process; determine customized feature logic comprising the first and second text commands, the first and second text commands operable to provide the one or more telephony features for the endpoint; and the endpoint in communication with the service creation environment, the endpoint comprising an integrated service framework operable to store the feature logic to create the one or more telephony features. | 26. A system for the creation of user-requested telephony features, comprising: a service creation environment comprising an application operable to: receive a plurality of instructions defining a graphical representation of an implementation of one or more telephony features for an endpoint, the graphical representation comprising a plurality of graphical elements, each graphical element representing at least a portion of a state process of the one or more telephony features; generate the graphical representation in accordance with the plurality of instructions; convert a first graphical element into a first text command; convert a second graphical element into a second text command, the first and second text commands specifying a plurality of actions of the state process; determine customized feature logic comprising the first and second text commands, the first and second text commands operable to provide the one or more telephony features for the endpoint; and the endpoint in communication with the service creation environment, the endpoint comprising an integrated service framework operable to store the feature logic to create the one or more telephony features. 27. The system of claim 26 , wherein when receiving the plurality of instructions the application is further operable to direct the creation of the one or more telephony features. | 0.685965 |
8,094,948 | 1 | 5 | 1. A method for classifying digital images, comprising: hierarchically clustering the digital images into a set of meaningful clusters based on at least two levels of clustering optical parameters, including: clustering the digital images based on determined light content of the digital images and clustering the digital images based on depth of field associated with the digital images; associating the set of meaningful clusters to a set of associated classes used by a user; and classifying the digital images according to the set of associated classes. | 1. A method for classifying digital images, comprising: hierarchically clustering the digital images into a set of meaningful clusters based on at least two levels of clustering optical parameters, including: clustering the digital images based on determined light content of the digital images and clustering the digital images based on depth of field associated with the digital images; associating the set of meaningful clusters to a set of associated classes used by a user; and classifying the digital images according to the set of associated classes. 5. The method for classifying digital images of claim 1 , further comprising: determining an associated classification for each of the digital images based on the probability that a block vocabulary and a word vocabulary apply. | 0.5 |
9,582,575 | 15 | 18 | 15. A non-transitory computer-readable medium for linking items into a matter that stores a program that, when executed by a computing device, causes the computing device to perform at least the following: retrieve an electronic document from a source; determine whether the electronic document is associated with a predetermined first matter; in response to determining that the electronic document is associated with the predetermined first matter, link the electronic document to the predetermined first matter, such that accessing the electronic document will provide access to other documents linked to the predetermined first matter; in response to determining that the electronic document is not associated with the predetermined first matter, create a second matter and linking the electronic document to the second matter, such that accessing the electronic document will provide other documents linked to the second matter; receive a request for the electronic document; and in response to receiving the request for the electronic document, provide a user option to provide access to the other documents linked to the predetermined first matter. | 15. A non-transitory computer-readable medium for linking items into a matter that stores a program that, when executed by a computing device, causes the computing device to perform at least the following: retrieve an electronic document from a source; determine whether the electronic document is associated with a predetermined first matter; in response to determining that the electronic document is associated with the predetermined first matter, link the electronic document to the predetermined first matter, such that accessing the electronic document will provide access to other documents linked to the predetermined first matter; in response to determining that the electronic document is not associated with the predetermined first matter, create a second matter and linking the electronic document to the second matter, such that accessing the electronic document will provide other documents linked to the second matter; receive a request for the electronic document; and in response to receiving the request for the electronic document, provide a user option to provide access to the other documents linked to the predetermined first matter. 18. The non-transitory computer-readable medium of claim 15 , wherein the program further causes the computing device to provide the electronic document in a user interface. | 0.759053 |
9,043,195 | 16 | 17 | 16. The system of claim 1 , wherein each set of display pieces comprises a set of game pieces comprising a plurality of individual game pieces. | 16. The system of claim 1 , wherein each set of display pieces comprises a set of game pieces comprising a plurality of individual game pieces. 17. The system of claim 16 , wherein each individual game piece comprises a playing card. | 0.5 |
9,990,108 | 9 | 10 | 9. The system according to claim 8 , wherein the graphic representation extends around the chat room icon of the first chat room panel as a function of how many chat room members of the first chat room have read the first message posted in the first chat room. | 9. The system according to claim 8 , wherein the graphic representation extends around the chat room icon of the first chat room panel as a function of how many chat room members of the first chat room have read the first message posted in the first chat room. 10. The system according to claim 9 , wherein the graphic representation extends as an arc around the chat room icon, an angular size of the arc being a function of how many chat room members of the first chat room have read the first message posted in the first chat room, the arc forming an annular ring when 100% of the chat room members of the first chat room have read the first message posted in the first chat room. | 0.5 |
8,387,021 | 13 | 15 | 13. A system for compiling a quantified formula into a non-deterministic program and controlling execution of a resulting non-deterministic program, the system comprising: a processor; a non-deterministic program compiler that is configured to provide a quantifier input parameter, set the quantifier input parameter to true, and find at least one quantifier instantiation of the non-deterministic program by performing a method, the method comprising: making a quantified assumption for the quantifier input parameter, wherein the quantified assumption has at least one pattern; partially evaluating the at least one pattern in the quantified assumption by using run-time values of non-bound parameters; applying a maximal partial evaluation on the pattern to create a maximally partially evaluated pattern such that folding is applied to all sub-terms that do not contain any quantified variables; and at run-time, building a symbolic state of the non-deterministic program based on a symbolic representation of the current state of the program; labeling each node in the symbolic state with a corresponding concrete run-time value; and enumerating at least one sub-term that appears in the symbolic state; and an abstract matching machine in electronic communication with the non-deterministic program compiler, wherein the abstract matching machine is configured to match the maximally partially evaluated pattern in the non-deterministic program against the at least one enumerated sub-term of the symbolic state of the quantified formula. | 13. A system for compiling a quantified formula into a non-deterministic program and controlling execution of a resulting non-deterministic program, the system comprising: a processor; a non-deterministic program compiler that is configured to provide a quantifier input parameter, set the quantifier input parameter to true, and find at least one quantifier instantiation of the non-deterministic program by performing a method, the method comprising: making a quantified assumption for the quantifier input parameter, wherein the quantified assumption has at least one pattern; partially evaluating the at least one pattern in the quantified assumption by using run-time values of non-bound parameters; applying a maximal partial evaluation on the pattern to create a maximally partially evaluated pattern such that folding is applied to all sub-terms that do not contain any quantified variables; and at run-time, building a symbolic state of the non-deterministic program based on a symbolic representation of the current state of the program; labeling each node in the symbolic state with a corresponding concrete run-time value; and enumerating at least one sub-term that appears in the symbolic state; and an abstract matching machine in electronic communication with the non-deterministic program compiler, wherein the abstract matching machine is configured to match the maximally partially evaluated pattern in the non-deterministic program against the at least one enumerated sub-term of the symbolic state of the quantified formula. 15. The system of claim 13 wherein a quantified predicate of the quantified formula is weakened to find at least one additional quantifier instantiation. | 0.744147 |
9,934,433 | 1 | 18 | 1. A computer program product, comprising a non-transitory computer readable storage medium having stored/encoded thereon computer readable program instructions configured to cause a processor, upon execution thereof, to: perform optical character recognition (OCR) on an image of a document; extract an identifier of the document from the image based at least in part on the OCR; compare at least portions of the identifier with content from one or more reference data sources; and determine whether the identifier is valid based at least in part on the comparison; wherein the content from the one or more reference data sources comprises global address information; wherein the content from the one or more reference data sources is derived from geographic information organized in one or more of a proprietary address database and an open source address database; and wherein deriving the content from the geographic information comprises: obtaining the geographic information from one or more of the proprietary address database and an open source address database; and parsing the geographic information according to a set of predefined heuristic rules, wherein the set of predefined heuristic rules are configured to normalize the global address information obtained from the one or more sources according to a single convention for representing address information. | 1. A computer program product, comprising a non-transitory computer readable storage medium having stored/encoded thereon computer readable program instructions configured to cause a processor, upon execution thereof, to: perform optical character recognition (OCR) on an image of a document; extract an identifier of the document from the image based at least in part on the OCR; compare at least portions of the identifier with content from one or more reference data sources; and determine whether the identifier is valid based at least in part on the comparison; wherein the content from the one or more reference data sources comprises global address information; wherein the content from the one or more reference data sources is derived from geographic information organized in one or more of a proprietary address database and an open source address database; and wherein deriving the content from the geographic information comprises: obtaining the geographic information from one or more of the proprietary address database and an open source address database; and parsing the geographic information according to a set of predefined heuristic rules, wherein the set of predefined heuristic rules are configured to normalize the global address information obtained from the one or more sources according to a single convention for representing address information. 18. The computer program product as recited in claim 1 , wherein the identifier is encoded in non-textual information depicted on the document. | 0.935989 |
4,769,846 | 1 | 5 | 1. An immediate, word-by-word speaking translator for speech handicapped persons and those speech handicapped having no sight, comprising a circuit having a pair of inputs, each feeding a separate code-data channel and code register,. said code-data channels utilizing a simplified machine language T=N.sup.X -1 WHERE X equals number of data channels; N=steps per channel; and T equals total number of words, said machine language being injected through code input impulses from said handicapped persons fed into a filter system, an automatic control channel and a voice synthesizer; whereby said code input pulses and automatic control channel adapt easily to physical disabilities of said handicapped persons. | 1. An immediate, word-by-word speaking translator for speech handicapped persons and those speech handicapped having no sight, comprising a circuit having a pair of inputs, each feeding a separate code-data channel and code register,. said code-data channels utilizing a simplified machine language T=N.sup.X -1 WHERE X equals number of data channels; N=steps per channel; and T equals total number of words, said machine language being injected through code input impulses from said handicapped persons fed into a filter system, an automatic control channel and a voice synthesizer; whereby said code input pulses and automatic control channel adapt easily to physical disabilities of said handicapped persons. 5. A translator as recited in claim 1 wherein said input comprises pulses in the voice-sound, mode, wherein said filter system selects two narrow frequency ranges for two different frequency sounds increasing the number of total words. | 0.713415 |
7,945,557 | 1 | 8 | 1. A method for executing a query, comprising: with a computer including a processor: receiving the query that references one or more relational database tables; creating an outlier materialized query table storing exception data that represents a set of algebraic rules applicable to the query, wherein each of the algebraic rules represents a relationship between two columns in at least one of the one or more relational database tables; identifying a source column by searching the query for a source predicate, wherein the source predicate is a range predicate; identifying one or more candidate target columns by searching the set of algebraic rules represented by the outlier materialized query table, wherein each of the candidate target columns occurs on one side of a binding expression and the source column occurs on the other side of the binding expression, wherein the binding expression is a subtraction expression; and for each of the one or more candidate target columns, using the outlier materialized query table to determine one or more ranges each having a lower bound and an upper bound for a new range predicate that is applied to one of the relational database tables by: selecting qualified outliers from the outlier materialized query table; for each of the selected outliers, determining a range having the lower bound and the upper bound; in response to determining that there is an overlapping between ranges, merging the ranges and using the merged ranges for the new range predicate; and in response to determining that there is no overlapping between ranges, using the ranges for the new range predicate; introducing the new range predicate into the query by merging the bounds subquery into a portion of the query and adding the new range predicate to the query; and executing the portion of the query against the one or more relational database tables to retrieve data from one or more data stores. | 1. A method for executing a query, comprising: with a computer including a processor: receiving the query that references one or more relational database tables; creating an outlier materialized query table storing exception data that represents a set of algebraic rules applicable to the query, wherein each of the algebraic rules represents a relationship between two columns in at least one of the one or more relational database tables; identifying a source column by searching the query for a source predicate, wherein the source predicate is a range predicate; identifying one or more candidate target columns by searching the set of algebraic rules represented by the outlier materialized query table, wherein each of the candidate target columns occurs on one side of a binding expression and the source column occurs on the other side of the binding expression, wherein the binding expression is a subtraction expression; and for each of the one or more candidate target columns, using the outlier materialized query table to determine one or more ranges each having a lower bound and an upper bound for a new range predicate that is applied to one of the relational database tables by: selecting qualified outliers from the outlier materialized query table; for each of the selected outliers, determining a range having the lower bound and the upper bound; in response to determining that there is an overlapping between ranges, merging the ranges and using the merged ranges for the new range predicate; and in response to determining that there is no overlapping between ranges, using the ranges for the new range predicate; introducing the new range predicate into the query by merging the bounds subquery into a portion of the query and adding the new range predicate to the query; and executing the portion of the query against the one or more relational database tables to retrieve data from one or more data stores. 8. The method of claim 1 , wherein the candidate target column is from a relational database table other than a relational database table in which the source column resides. | 0.743323 |
10,042,842 | 12 | 13 | 12. The computer program product according to claim 11 , wherein the generating the candidate lexical graph dictionary further includes generating test lexical graphs from the learning set of social media data streams. | 12. The computer program product according to claim 11 , wherein the generating the candidate lexical graph dictionary further includes generating test lexical graphs from the learning set of social media data streams. 13. The computer program product according to claim 12 , wherein the generating the candidate lexical graph dictionary further includes selecting relevant ones of the test lexical graphs as the candidate lexical graphs. | 0.5 |
7,757,191 | 1 | 17 | 1. A computer-implemented method for race logic analysis on an integrated circuit (IC) design, to aid IC chip designers to detect and correct errors in their circuits and hence produce reliable IC products, the race logic analysis method comprising—using a processor to perform one or more of the following steps (a) detecting concurrent invocation of HDL-defined system functions/tasks that may cause one or more static or global signals/registers in the IC to be concurrently assigned or concurrently assigned and referenced, and render indeterminate values for those signals/registers; (b) detecting concurrently execution of “un-related” process blocks in the IC design that may cause one or more signals/registers to be concurrently assigned with different values, and hence render indeterminate values for those signals/registers; (c) detecting concurrently execution of “un-related” process blocks in the IC design that may cause one or more signals/registers to be concurrently assigned and being referenced by different process blocks, and render indeterminate values being read by driven process blocks; (d) detecting, dynamically via an event-driven logic simulation, circular functions/tasks invocation that may cause operation of the IC design to hang (deadlock); (e) detecting user-defined functions/tasks that invoke themselves recursively without termination, and hence render the IC design operation to hang (deadlock); (f) detecting concurrent invocation of HDL-defined functions/tasks that are built-in to HDL-defined inter-process communication (IPC) objects by “un-related” processes, that may render execution order of said “un-related” processes indeterminate, and/or that may process data that are of indeterminate values. | 1. A computer-implemented method for race logic analysis on an integrated circuit (IC) design, to aid IC chip designers to detect and correct errors in their circuits and hence produce reliable IC products, the race logic analysis method comprising—using a processor to perform one or more of the following steps (a) detecting concurrent invocation of HDL-defined system functions/tasks that may cause one or more static or global signals/registers in the IC to be concurrently assigned or concurrently assigned and referenced, and render indeterminate values for those signals/registers; (b) detecting concurrently execution of “un-related” process blocks in the IC design that may cause one or more signals/registers to be concurrently assigned with different values, and hence render indeterminate values for those signals/registers; (c) detecting concurrently execution of “un-related” process blocks in the IC design that may cause one or more signals/registers to be concurrently assigned and being referenced by different process blocks, and render indeterminate values being read by driven process blocks; (d) detecting, dynamically via an event-driven logic simulation, circular functions/tasks invocation that may cause operation of the IC design to hang (deadlock); (e) detecting user-defined functions/tasks that invoke themselves recursively without termination, and hence render the IC design operation to hang (deadlock); (f) detecting concurrent invocation of HDL-defined functions/tasks that are built-in to HDL-defined inter-process communication (IPC) objects by “un-related” processes, that may render execution order of said “un-related” processes indeterminate, and/or that may process data that are of indeterminate values. 17. The method of claim 1 , wherein step (f), further comprises: recording, during a dynamic race logic analysis, each time a FIFO object's function/task is invoked by a process, a simulation time, an IPC FIFO object ID, a FIFO built-in function/task name and a calling process's ID; flagging, if a FIFO object has two or more built-in functions/tasks invoked by “un-related” processes at the same simulation time except for execution of the FIFO read-only functions/tasks, those processes that are involved in a race logic with respect to the FIFO object, as data are being written into and/or read from the object by those processes in indeterminate order. | 0.679024 |
9,672,475 | 1 | 8 | 1. A computer-implemented method for predicting an opinion, the computer-implemented method comprising: building a corpus which includes a first collection of documents attributable to a first person and a second collection of documents not attributable to the first person, wherein the second collection of documents is identified from content in the first collection of documents, wherein each of the second collection of documents is available from a respective secondary source; evaluating the corpus to build a model representing opinions of the first person relative to topics, concepts, or subjects discussed in the first and second collections of documents, including determining, for each secondary source, a source weight factor characterizing a presumed opinion of the secondary source held by the first person; receiving a request to predict an opinion of the first person regarding a topic specified in the request; generating a predicted opinion of the first person regarding the topic from the model, by operation of one or more computer processors and based on: (i) the opinions of the first person relative to topics, concepts, or subjects discussed in the first and second collections of documents and (ii) each source weight factor characterizing the presumed opinion of the respective secondary source held by the first person; and returning the predicted opinion responsive to the request. | 1. A computer-implemented method for predicting an opinion, the computer-implemented method comprising: building a corpus which includes a first collection of documents attributable to a first person and a second collection of documents not attributable to the first person, wherein the second collection of documents is identified from content in the first collection of documents, wherein each of the second collection of documents is available from a respective secondary source; evaluating the corpus to build a model representing opinions of the first person relative to topics, concepts, or subjects discussed in the first and second collections of documents, including determining, for each secondary source, a source weight factor characterizing a presumed opinion of the secondary source held by the first person; receiving a request to predict an opinion of the first person regarding a topic specified in the request; generating a predicted opinion of the first person regarding the topic from the model, by operation of one or more computer processors and based on: (i) the opinions of the first person relative to topics, concepts, or subjects discussed in the first and second collections of documents and (ii) each source weight factor characterizing the presumed opinion of the respective secondary source held by the first person; and returning the predicted opinion responsive to the request. 8. The computer-implemented method of claim 1 , wherein the predicted opinion is generated by an application comprising a plurality of components including a question classifier component, a partial and parallel pipeline execution component, and an evidence parsing component. | 0.640625 |
9,195,632 | 3 | 4 | 3. The computer-implemented method of claim 2 , wherein at least one keyword of the one or more keywords associated with a content item comprises targeting criteria defining one or more characteristics of a user of the social networking system eligible to be presented with the content item. | 3. The computer-implemented method of claim 2 , wherein at least one keyword of the one or more keywords associated with a content item comprises targeting criteria defining one or more characteristics of a user of the social networking system eligible to be presented with the content item. 4. The computer-implemented method of claim 3 , wherein the targeting criteria are selected from a group consisting of: an interest, a location, an event, a type of connection, an additional user, an action, an employer, an educational institution, an affinity, or any combination thereof. | 0.5 |
8,379,027 | 1 | 9 | 1. A method comprising: supplying a character code to a text rendering engine being tested to cause the text rendering engine to render a character corresponding to the character code, identifying a graphical reference image for the character, wherein the graphical reference image was produced by a source known to produce correct images; presenting the graphical reference image and the rendered character on a bitmapped display screen of a computer system to facilitate a visual comparison between a visual representation of the graphical reference image produced by the source known to produce correct images and a visual representation of the rendered character produced by the text rendering engine to be tested; receiving, by the computer system, user input indicating user evaluation of the graphical reference image and the rendered character, the user evaluation being based on the comparison between the visual representation of the graphical reference image and the visual representation of the rendered character, the user evaluation identifying one or more differences between the graphical reference image produced by the source known to produce correct images and the rendered character produced by the text rendering engine to be tested; and storing, by the computer system, the user evaluation in a database for subsequent debugging of the text rendering engine. | 1. A method comprising: supplying a character code to a text rendering engine being tested to cause the text rendering engine to render a character corresponding to the character code, identifying a graphical reference image for the character, wherein the graphical reference image was produced by a source known to produce correct images; presenting the graphical reference image and the rendered character on a bitmapped display screen of a computer system to facilitate a visual comparison between a visual representation of the graphical reference image produced by the source known to produce correct images and a visual representation of the rendered character produced by the text rendering engine to be tested; receiving, by the computer system, user input indicating user evaluation of the graphical reference image and the rendered character, the user evaluation being based on the comparison between the visual representation of the graphical reference image and the visual representation of the rendered character, the user evaluation identifying one or more differences between the graphical reference image produced by the source known to produce correct images and the rendered character produced by the text rendering engine to be tested; and storing, by the computer system, the user evaluation in a database for subsequent debugging of the text rendering engine. 9. The method of claim 1 wherein presenting the graphical reference image comprises issuing a request to a Hypertext Transfer Protocol (“HTTP”) server to obtain the reference image. | 0.751374 |
9,465,898 | 8 | 11 | 8. An apparatus comprising at least one computer-readable memory device storing instructions configured to cause one or more processing devices to perform operations comprising: detecting a presence of a combinational loop in an expression netlist representation of a circuit design by identifying a portion of the expression netlist having at least one characteristic associated with the combinational loop, translating the identified portion of the expression netlist into a bit-level circuit representation, and utilizing the bit-level circuit representation to determine the identified portion of the expression netlist includes the combinational loop; and modifying the expression netlist corresponding to the detected presence of the combinational loop. | 8. An apparatus comprising at least one computer-readable memory device storing instructions configured to cause one or more processing devices to perform operations comprising: detecting a presence of a combinational loop in an expression netlist representation of a circuit design by identifying a portion of the expression netlist having at least one characteristic associated with the combinational loop, translating the identified portion of the expression netlist into a bit-level circuit representation, and utilizing the bit-level circuit representation to determine the identified portion of the expression netlist includes the combinational loop; and modifying the expression netlist corresponding to the detected presence of the combinational loop. 11. The apparatus of claim 8 , wherein identifying the portion of the expression netlist having the at least one characteristic associated with the combinational loop further comprises computing a strongly connected component in the expression netlist, the strongly connected component corresponding to the identified portion of the expression netlist having the at least one characteristic associated with the combinational loop. | 0.550209 |
8,051,061 | 11 | 12 | 11. The method as recited in claim 1 , wherein the providing the plurality of candidate queries in target language comprises: mining candidate queries in the target language on the Web, the each candidate query being a translation of the input query in source language or semantically related to the input query in source language. | 11. The method as recited in claim 1 , wherein the providing the plurality of candidate queries in target language comprises: mining candidate queries in the target language on the Web, the each candidate query being a translation of the input query in source language or semantically related to the input query in source language. 12. The method as recited in claim 11 , further comprising: ranking the candidate queries using a co-occurrence double-check measure; selecting a set of top candidate queries based on ranking result. | 0.5 |
8,874,433 | 1 | 2 | 1. A computer-implemented process for augmenting a machine translation phrase table with additional phrase pairs each pair of which associates a phrase in a source language with a phrase in a target language, comprising: using a computer to perform the following process actions: inputting one or more syntactic transfer patterns, each of said patterns defining the syntax of a translation to the target language of a different phrase structure in the source language, wherein each source language phrase type represents a phase having a particular syntactic structure that is different from the other source language phrase types; for each inputted syntactic transfer pattern, synthesizing phrases in the source language of the type associated with the pattern under consideration using a lexicon of the source language, eliminating synthesized phrases not found in a monolingual corpus of the source language, for each remaining synthesized phrase, translating the synthesized phrase into the target language using the syntactic transfer pattern under consideration, a bilingual source-to-target language dictionary, and a morphological synthesizer to properly inflect the words of each translated phrase, and for each translated phrase, adding a phrase pair comprising the translated phrase and its corresponding source language phrase to the current version of the phrase table to produce an augmented version of the phrase table. | 1. A computer-implemented process for augmenting a machine translation phrase table with additional phrase pairs each pair of which associates a phrase in a source language with a phrase in a target language, comprising: using a computer to perform the following process actions: inputting one or more syntactic transfer patterns, each of said patterns defining the syntax of a translation to the target language of a different phrase structure in the source language, wherein each source language phrase type represents a phase having a particular syntactic structure that is different from the other source language phrase types; for each inputted syntactic transfer pattern, synthesizing phrases in the source language of the type associated with the pattern under consideration using a lexicon of the source language, eliminating synthesized phrases not found in a monolingual corpus of the source language, for each remaining synthesized phrase, translating the synthesized phrase into the target language using the syntactic transfer pattern under consideration, a bilingual source-to-target language dictionary, and a morphological synthesizer to properly inflect the words of each translated phrase, and for each translated phrase, adding a phrase pair comprising the translated phrase and its corresponding source language phrase to the current version of the phrase table to produce an augmented version of the phrase table. 2. The process of claim 1 , further comprising a process action of eliminating phrase pairs that are already found in a current version of the phrase table, prior to performing the action of adding phrase pairs to the phrase table. | 0.746711 |
8,884,885 | 3 | 4 | 3. The touch pad according to claim 2 , wherein the processing unit further comprises: a second processing unit configured to determine whether the touch pad can be used as an input device by determining whether the trace graph is matched with the graphical password on the basis of the second comparison value. | 3. The touch pad according to claim 2 , wherein the processing unit further comprises: a second processing unit configured to determine whether the touch pad can be used as an input device by determining whether the trace graph is matched with the graphical password on the basis of the second comparison value. 4. The touch pad according to claim 3 , wherein the first comparing unit and the second comparing unit are the same or different comparing units, and/or the first processing unit and the second processing unit are the same or different processing units. | 0.5 |
4,773,099 | 1 | 21 | 1. A method for processing reference feature vectors comprising the steps of: obtaining reference feature vectors defining a plurality of references; assigning said references to a plurality of classes, each of said classes containing a plurality of references; and forming a plurality of sets of clusters, each said set of clusters being uniquely associated with an associated class, such that each said set has associated therewith all of said reference feature vectors for its associated class, wherein the number of said clusters is significantly less than the number of said reference feature vectors, and wherein each cluster of said set of clusters has associated therewith any number of regions selected from the group of regions consisting of: a possibility region, such that all said reference feature vectors of said associated class of a selected set of clusters are contained in at least one of said possibility region contains relatively few reference feature vectors not belonging to said associated class; and a certainty region in which is contained a plurality of said reference feature vectors which all belong to said associated class of said cluster and which do not contain reference feature vectors which are not of said selected class. | 1. A method for processing reference feature vectors comprising the steps of: obtaining reference feature vectors defining a plurality of references; assigning said references to a plurality of classes, each of said classes containing a plurality of references; and forming a plurality of sets of clusters, each said set of clusters being uniquely associated with an associated class, such that each said set has associated therewith all of said reference feature vectors for its associated class, wherein the number of said clusters is significantly less than the number of said reference feature vectors, and wherein each cluster of said set of clusters has associated therewith any number of regions selected from the group of regions consisting of: a possibility region, such that all said reference feature vectors of said associated class of a selected set of clusters are contained in at least one of said possibility region contains relatively few reference feature vectors not belonging to said associated class; and a certainty region in which is contained a plurality of said reference feature vectors which all belong to said associated class of said cluster and which do not contain reference feature vectors which are not of said selected class. 21. The method of claim 1 wherein said step of forming a plurality of sets of clusters includes the step of forming one or more sets of possibility regions for a selected one of said classes comprising the steps of: for each of said plurality of sets of possibility regions, forming a number of possibility regions associated with said selected class such that each reference feature vector of said selected class is contained in one or more possibility regions of each of said plurality of sets of possibility regions. | 0.593897 |
8,319,648 | 2 | 5 | 2. The system of claim 1 , wherein the disease status detector is configured to detect a heart failure decompensation status. | 2. The system of claim 1 , wherein the disease status detector is configured to detect a heart failure decompensation status. 5. The system of claim 2 , comprising a user input coupled to the processor, the user input configured to receive at least some of the physiologic information from a user in response to a query including whether the patient has experienced at least one of a shortness of breath, an abnormal fatigue, an abnormal pain, an abnormal swelling, a chronic cough, a decreased appetite, or a need for an extra pillow when sleeping. | 0.5 |
8,436,753 | 4 | 5 | 4. The method as in claim 1 wherein the first audio data is stored within the first audio file in a plurality of fixed-size access units and wherein generating the universal representation comprises packing the fixed-size access units into a plurality of fixed-size audio data structures, the fixed-size audio data structures of the universal representation being larger than or equal to the fixed-size access units of the first audio file. | 4. The method as in claim 1 wherein the first audio data is stored within the first audio file in a plurality of fixed-size access units and wherein generating the universal representation comprises packing the fixed-size access units into a plurality of fixed-size audio data structures, the fixed-size audio data structures of the universal representation being larger than or equal to the fixed-size access units of the first audio file. 5. The method as in claim 4 wherein the fixed-size access units of the universal representation are an integer multiple of the fixed-size access units of the first audio file. | 0.513889 |
8,972,258 | 11 | 18 | 11. The computer system of claim 10 , wherein: using the maximum a posteriori probability process includes restricting estimation of statistical changes such that an amount of acoustic parameters from the baseline acoustic speech model that have an estimated statistical change is less than a total number of acoustic parameters included in the baseline acoustic speech model, further comprising storing the changes as acoustic parameter adaptation data linked to the first speaker. | 11. The computer system of claim 10 , wherein: using the maximum a posteriori probability process includes restricting estimation of statistical changes such that an amount of acoustic parameters from the baseline acoustic speech model that have an estimated statistical change is less than a total number of acoustic parameters included in the baseline acoustic speech model, further comprising storing the changes as acoustic parameter adaptation data linked to the first speaker. 18. The computer system of claim 11 , wherein storing changes to the set of acoustic parameters includes storing changes to less than ten percent of the plurality of acoustic parameters from the baseline acoustic speech model. | 0.79304 |
8,200,704 | 28 | 30 | 28. A system, comprising: one or more computers programmed to perform operations comprising: identifying a plurality of structured documents and distinct metadata for each structured document, the structured documents having a same structured data format, wherein the structured documents are received from one or more data sources and the distinct metadata for each structured document is received from one or more data sources different from the one or more data sources from which the structured document was received; wherein the same structured data format is a format for geographic data, wherein the plurality of structured documents contain location names, descriptive text, and geographic references; parsing each structured document in the plurality of structured documents and extracting a plurality of data sets from each structured document; merging the distinct metadata from the one or more data sources, including removing duplicate distinct metadata; associating the distinct metadata for each structured document with each data set extracted from the structured document; adding a plurality of record items to a searchable database, wherein a structure of the record items corresponds to the same structured data format of the structured documents, wherein each record item corresponds to one of the extracted data sets, and wherein each record item is associated with the distinct metadata associated with the corresponding data set; receiving a search query; using the distinct metadata associated with each of one or more of the record items to identify at least one record item in the searchable database; and returning the identified at least one record item in response to the search query. | 28. A system, comprising: one or more computers programmed to perform operations comprising: identifying a plurality of structured documents and distinct metadata for each structured document, the structured documents having a same structured data format, wherein the structured documents are received from one or more data sources and the distinct metadata for each structured document is received from one or more data sources different from the one or more data sources from which the structured document was received; wherein the same structured data format is a format for geographic data, wherein the plurality of structured documents contain location names, descriptive text, and geographic references; parsing each structured document in the plurality of structured documents and extracting a plurality of data sets from each structured document; merging the distinct metadata from the one or more data sources, including removing duplicate distinct metadata; associating the distinct metadata for each structured document with each data set extracted from the structured document; adding a plurality of record items to a searchable database, wherein a structure of the record items corresponds to the same structured data format of the structured documents, wherein each record item corresponds to one of the extracted data sets, and wherein each record item is associated with the distinct metadata associated with the corresponding data set; receiving a search query; using the distinct metadata associated with each of one or more of the record items to identify at least one record item in the searchable database; and returning the identified at least one record item in response to the search query. 30. The system of claim 28 , further programmed to perform operations comprising: crawling the web to identify the structured documents and generate an output file including a plurality of records, each record including data from one of the structured documents; wherein parsing the structured documents and extracting the plurality of data sets comprises parsing the records in the output file and extracting the plurality of data sets from each record. | 0.5 |
9,002,772 | 10 | 13 | 10. A computer program product for scalable, rule-based processing, the computer program product comprising: a non-transitory computer-readable storage medium; and computer-readable program code embodied in the computer-readable storage medium, where the computer-readable program code is configured to construct a plurality of automatons corresponding to a plurality of trigger rules and a plurality of word lists that are employed by the trigger rules, evaluate any of the plurality of trigger rules with respect to an input document by: selecting any of the automatons to evaluate a given one of the plurality of trigger rules, parsing the input document using the selected automatons, determining whether conditions of the given trigger rule are met, identifying any actions that are associated with the given trigger rule, and display in a rule tracing any of the plurality of trigger rules that are evaluated, together with indicia for different portions of the displayed trigger rules indicating an evaluation result of each of the different portions. | 10. A computer program product for scalable, rule-based processing, the computer program product comprising: a non-transitory computer-readable storage medium; and computer-readable program code embodied in the computer-readable storage medium, where the computer-readable program code is configured to construct a plurality of automatons corresponding to a plurality of trigger rules and a plurality of word lists that are employed by the trigger rules, evaluate any of the plurality of trigger rules with respect to an input document by: selecting any of the automatons to evaluate a given one of the plurality of trigger rules, parsing the input document using the selected automatons, determining whether conditions of the given trigger rule are met, identifying any actions that are associated with the given trigger rule, and display in a rule tracing any of the plurality of trigger rules that are evaluated, together with indicia for different portions of the displayed trigger rules indicating an evaluation result of each of the different portions. 13. The computer program product of claim 10 where the computer-readable program code is configured to identify text patterns that appear in the trigger rules and extract their ranges, convert the ranges into sets, analyze the sets to define non-overlapping sets, allocate a unique set-ID to each of the non-overlapping sets, revise the text patterns in accordance with the non-overlapping sets, construct an automaton for each pattern, where the set-IDs are used for transition from state to state, merge the pattern automatons into a single master automaton, convert the master automaton into a deterministic, minimal state FSM, and create a two-stage table that maps Unicode characters to their set-IDs. | 0.5 |
8,977,614 | 23 | 24 | 23. The method of claim 1 , wherein producing the at least one modified search result based on at least the search refinement input comprises producing at least one modified search result based on the search refinement input and the search argument. | 23. The method of claim 1 , wherein producing the at least one modified search result based on at least the search refinement input comprises producing at least one modified search result based on the search refinement input and the search argument. 24. The method of claim 23 , wherein producing the at least one modified search result based on at least the search refinement input comprises producing at least one modified search result based on the search refinement input, the search argument and the user profile. | 0.5 |
8,938,466 | 7 | 9 | 7. A system for ranking documents, comprising: a processor for executing program instructions; and a non-transitory computer-readable medium storing the program instructions, the program instructions, when executed by the processor, performing a method to: receive a first query from a user, the first query being related to a search topic; compare the first query to a plurality of documents stored in a database to identify a first set of candidate documents, each of the first set of candidate documents matching the first query; provide an interface to the user, the interface including references to the first set of candidate documents as well as a first query icon representing the first query; receive a second query form the user, the second query being related to the search topic; compare the second query to a plurality of documents stored in a database to identify a second set of candidate documents, each of the second set of candidate documents matching the second query; compare the first and second set of candidate documents from the first query and the second query to identify an updated set of candidate documents, each of the updated set of candidate documents matching one or more of the first and second queries; determine, for the updated set of candidate documents, a count of matching queries; rank the updated set of candidate documents for relevance the search topic based at least on the count of matching queries for each respective candidate document; and provide an updated interface to the user, the updated interface including references to one or more of the ranked candidate documents and the count of matching queries for each respective one or more of the ranked candidate documents as well as a second query icon representing the second query; update a graphical user interface element comprising a progress bar which indicates whether a user has performed sufficient queries to complete the search; provide a reset icon for the user to reset a search session; and reset the count of matching queries for the candidate documents to zero when the user selects the reset icon. | 7. A system for ranking documents, comprising: a processor for executing program instructions; and a non-transitory computer-readable medium storing the program instructions, the program instructions, when executed by the processor, performing a method to: receive a first query from a user, the first query being related to a search topic; compare the first query to a plurality of documents stored in a database to identify a first set of candidate documents, each of the first set of candidate documents matching the first query; provide an interface to the user, the interface including references to the first set of candidate documents as well as a first query icon representing the first query; receive a second query form the user, the second query being related to the search topic; compare the second query to a plurality of documents stored in a database to identify a second set of candidate documents, each of the second set of candidate documents matching the second query; compare the first and second set of candidate documents from the first query and the second query to identify an updated set of candidate documents, each of the updated set of candidate documents matching one or more of the first and second queries; determine, for the updated set of candidate documents, a count of matching queries; rank the updated set of candidate documents for relevance the search topic based at least on the count of matching queries for each respective candidate document; and provide an updated interface to the user, the updated interface including references to one or more of the ranked candidate documents and the count of matching queries for each respective one or more of the ranked candidate documents as well as a second query icon representing the second query; update a graphical user interface element comprising a progress bar which indicates whether a user has performed sufficient queries to complete the search; provide a reset icon for the user to reset a search session; and reset the count of matching queries for the candidate documents to zero when the user selects the reset icon. 9. The system according to claim 7 , wherein the program instructions further perform the method to: receive a request for one of the ranked candidate documents; and transmit the requested candidate document in response to the request. | 0.707711 |
8,494,852 | 8 | 13 | 8. A computer program product, encoded on a non-transitory computer-readable medium, operable to cause one or more processors to perform operations for correcting words in transcribed text, the operations comprising: providing a plurality of transcribed words from a word lattice for display on a computing device; in response to receiving an indication that a particular transcribed word has been selected, providing for display on the computing device a particular alternate phrase from the word lattice, wherein the particular alternate phrase includes alternate words that correspond to (i) the particular transcribed word and (ii) at least one transcribed word preceding the particular transcribed word; and in response to receiving an indication that the particular alternate phrase has been selected, replacing, with the particular transcribed phrase, (i) the particular transcribed word and (ii) the at least one transcribed word preceding the particular transcribed word. | 8. A computer program product, encoded on a non-transitory computer-readable medium, operable to cause one or more processors to perform operations for correcting words in transcribed text, the operations comprising: providing a plurality of transcribed words from a word lattice for display on a computing device; in response to receiving an indication that a particular transcribed word has been selected, providing for display on the computing device a particular alternate phrase from the word lattice, wherein the particular alternate phrase includes alternate words that correspond to (i) the particular transcribed word and (ii) at least one transcribed word preceding the particular transcribed word; and in response to receiving an indication that the particular alternate phrase has been selected, replacing, with the particular transcribed phrase, (i) the particular transcribed word and (ii) the at least one transcribed word preceding the particular transcribed word. 13. The computer program product of claim 8 , wherein receiving the indication that the particular transcribed word has been selected and receiving the indication that the particular alternate phrase has been selected comprise receiving the indication that the particular transcribed word has been selected and receiving the indication that the particular alternate phrase has been selected through a touchscreen interface of the computing device by a user of the computing device. | 0.5 |
7,499,913 | 1 | 3 | 1. A method being executable in a computer for processing anchor text, comprising: forming a set of anchors that point to a target document, wherein each anchor is a path from a source document to the target document; grouping together anchors with same anchor text, wherein each anchor is associated with anchor text; computing a relevance score for each group, wherein computing the relevance score includes computing a linguistic score for each group; and generating context information for the target document based on the computed relevance score, wherein a title is composed from text of a group with a highest relevance score and a summary of the target document is composed from anchor texts of a number of groups with highest relevance scores. | 1. A method being executable in a computer for processing anchor text, comprising: forming a set of anchors that point to a target document, wherein each anchor is a path from a source document to the target document; grouping together anchors with same anchor text, wherein each anchor is associated with anchor text; computing a relevance score for each group, wherein computing the relevance score includes computing a linguistic score for each group; and generating context information for the target document based on the computed relevance score, wherein a title is composed from text of a group with a highest relevance score and a summary of the target document is composed from anchor texts of a number of groups with highest relevance scores. 3. The method of claim 1 , further comprising: determining a predominant language in the set of anchors; and pruning anchors from the set that are not in the predominant language. | 0.75 |
8,239,399 | 5 | 6 | 5. The media of claim 4 , wherein the targeted material is retrieved from the webpage corresponding to the target result page and stored in the database. | 5. The media of claim 4 , wherein the targeted material is retrieved from the webpage corresponding to the target result page and stored in the database. 6. The media of claim 5 , wherein the targeted material includes one or more of a phone number, location information, images, videos, coupons, or news stories. | 0.5 |
8,713,049 | 4 | 5 | 4. The method of providing parameterized queries in CEP as in claim 1 , wherein the providing of the sets of parameters corresponding to the one or more bind variables is performed either statically or dynamically. | 4. The method of providing parameterized queries in CEP as in claim 1 , wherein the providing of the sets of parameters corresponding to the one or more bind variables is performed either statically or dynamically. 5. The method of providing parameterized queries in CEP as in claim 4 , wherein the providing of the sets of parameters corresponding to the one or more bind variables is performed statically by using a config file at deployment time of the query template. | 0.5 |
8,787,660 | 10 | 11 | 10. The computer readable medium of claim 1 , wherein the act (e) includes an act of: determining whether each object of the sequence of objects satisfies a plurality of string criteria. | 10. The computer readable medium of claim 1 , wherein the act (e) includes an act of: determining whether each object of the sequence of objects satisfies a plurality of string criteria. 11. The computer readable medium of claim 10 , wherein the plurality of string criteria includes an alignment criterion that identifies a degree to which objects of the sequence of objects are aligned and at least one of: a spacing criterion that identifies a degree to which pairs of objects of the sequence of objects are spaced apart; a contrast criterion that identifies a degree to which each object of the sequence of objects corresponds to a median contrast of the sequence of objects; and a non-encompassment criterion that identifies whether a first object of the sequence of objects encompasses a next object of the sequence of objects. | 0.5 |
7,877,366 | 23 | 25 | 23. The computer-readable storage medium of claim 14 , additionally comprising instructions which, when executed by the one or more processors, causes the one or more processors to perform: compiling registered XPaths into a tree that represents a structural hierarchy for the registered XPaths. | 23. The computer-readable storage medium of claim 14 , additionally comprising instructions which, when executed by the one or more processors, causes the one or more processors to perform: compiling registered XPaths into a tree that represents a structural hierarchy for the registered XPaths. 25. The computer-readable storage medium of claim 23 , additionally comprising instructions which, when executed by the one or more processors, causes the one or more processors to perform: receiving a DTD or XML schema associated with the registered XPaths; wherein the tree that represents a structural hierarchy is a metadata tree representing the received DTD or schema, wherein nodes of said metadata tree matching registered XPaths are annotated with information about the associated registered XPath. | 0.5 |
8,160,877 | 10 | 11 | 10. The non-transitory computer readable medium of claim 9 , wherein each of the plurality of partitions of the plurality of speakers comprises one of a plurality of speaker gender clusters hierarchy, wherein each of the plurality of second level partitions of the pre-determined speaker cluster comprises one of a plurality of speaker age clusters, the instructions further comprising functionality for: further identifying, in response to identifying the speaker as belonging to the second level pre-determined speaker cluster, the speaker as belonging to a third level pre-determined speaker cluster that is one of a plurality of third level partitions of the second level pre-determined speaker cluster and corresponds to a third level subset of the second level subset of the subset of the plurality of biometric signatures, wherein identifying the speaker as belonging to the third level pre-determined speaker cluster is based on comparing the coarse feature of the speaker to a third level speaker independent parameter representing the third level subset of the second level subset of the subset of the plurality of biometric signatures, wherein each of the plurality of third level partitions of the second level pre-determined speaker cluster comprises one of a plurality of speaker native language clusters, and wherein comparing the biometric signature of the speaker to the second level subset of the subset of the plurality of biometric signatures is limited to comparing to the third level subset of the second level subset of the subset of the plurality of biometric signatures. | 10. The non-transitory computer readable medium of claim 9 , wherein each of the plurality of partitions of the plurality of speakers comprises one of a plurality of speaker gender clusters hierarchy, wherein each of the plurality of second level partitions of the pre-determined speaker cluster comprises one of a plurality of speaker age clusters, the instructions further comprising functionality for: further identifying, in response to identifying the speaker as belonging to the second level pre-determined speaker cluster, the speaker as belonging to a third level pre-determined speaker cluster that is one of a plurality of third level partitions of the second level pre-determined speaker cluster and corresponds to a third level subset of the second level subset of the subset of the plurality of biometric signatures, wherein identifying the speaker as belonging to the third level pre-determined speaker cluster is based on comparing the coarse feature of the speaker to a third level speaker independent parameter representing the third level subset of the second level subset of the subset of the plurality of biometric signatures, wherein each of the plurality of third level partitions of the second level pre-determined speaker cluster comprises one of a plurality of speaker native language clusters, and wherein comparing the biometric signature of the speaker to the second level subset of the subset of the plurality of biometric signatures is limited to comparing to the third level subset of the second level subset of the subset of the plurality of biometric signatures. 11. The non-transitory computer readable medium of claim 10 , wherein the plurality of hierarchical speaker clusters comprises more than 500 clusters and the one of the plurality of biometric signature libraries comprises over 1000 biometric signatures. | 0.5 |
8,229,948 | 20 | 22 | 20. The computer-readable storage device of claim 17 , wherein the operations further comprise displaying a first document indication associated with the first document neuron, in response to being excited, wherein the first document indication is positioned relative to the plurality of word indications based on weight of each of the plurality of connections to the first document neuron. | 20. The computer-readable storage device of claim 17 , wherein the operations further comprise displaying a first document indication associated with the first document neuron, in response to being excited, wherein the first document indication is positioned relative to the plurality of word indications based on weight of each of the plurality of connections to the first document neuron. 22. The computer-readable storage device of claim 20 , wherein the operations further comprise displaying the plurality of word indications and the first document indication as at least one of a two-dimensional map, or a three-dimensional map. | 0.5 |
9,715,623 | 2 | 3 | 2. The apparatus of claim 1 , wherein the reference character is preexisting font character of a user-specific font set associated with a user of the apparatus, and wherein mapping the handwritten character to a font character of a user-specific font set comprises the processor: determining whether the deviation between the stroke data stroke data corresponding to the handwritten character is within a threshold amount of deviation; selecting the reference character, in response to the stroke data being within the threshold amount of deviation; and generating a new font character for the user-specific font set based on the stroke data, in response to the stroke data not being within the threshold amount of deviation. | 2. The apparatus of claim 1 , wherein the reference character is preexisting font character of a user-specific font set associated with a user of the apparatus, and wherein mapping the handwritten character to a font character of a user-specific font set comprises the processor: determining whether the deviation between the stroke data stroke data corresponding to the handwritten character is within a threshold amount of deviation; selecting the reference character, in response to the stroke data being within the threshold amount of deviation; and generating a new font character for the user-specific font set based on the stroke data, in response to the stroke data not being within the threshold amount of deviation. 3. The apparatus of claim 2 , wherein the user-specific font set comprises a plurality of variants of a text character corresponding to the handwritten character, wherein selecting a matching font character comprises selecting a best fitting variant based on the stroke data. | 0.5 |
8,179,563 | 2 | 10 | 2. The handheld optical scanner of claim 1 , further comprising an output indicator. | 2. The handheld optical scanner of claim 1 , further comprising an output indicator. 10. The handheld optical scanner of claim 2 wherein the output indicator comprises a visual indicator. | 0.825342 |
8,959,021 | 18 | 25 | 18. A system comprising: a computing device comprising one or more processors, the one or more processors programmed by specific executable instructions to at least: receive a first request to generate a first audio representation of a first text; determine, based at least on a first characteristic of the computing device, to use a local text-to-speech module to generate the first audio representation; generate the first audio representation using the local text-to-speech module; receive a second request to generate a second audio representation of a second text; determine, based at least on a second characteristic of the computing device, to use a remote text-to-speech system to generate the second audio representation; send request data based at least in part on the second text to the remote text-to-speech system; and receive the second audio representation from the remote text-to-speech system. | 18. A system comprising: a computing device comprising one or more processors, the one or more processors programmed by specific executable instructions to at least: receive a first request to generate a first audio representation of a first text; determine, based at least on a first characteristic of the computing device, to use a local text-to-speech module to generate the first audio representation; generate the first audio representation using the local text-to-speech module; receive a second request to generate a second audio representation of a second text; determine, based at least on a second characteristic of the computing device, to use a remote text-to-speech system to generate the second audio representation; send request data based at least in part on the second text to the remote text-to-speech system; and receive the second audio representation from the remote text-to-speech system. 25. The system of claim 18 , wherein the first request comprises an indication of a preferred voice, wherein the preferred voice is not available on the computing device, and wherein generating the first audio representation comprises using a voice that is not the preferred voice. | 0.627321 |
8,082,241 | 6 | 12 | 6. A computer-based system for processing one or more citations within a document, the system comprising: citation editor software to identify an unformatted citation within a document; and a citation application to receive the unformatted citation, identify a citation that matches the unformatted citation in a citation library storing multiple citations, and pass information based on the matching citation to the citation editor software for enabling the citation editor software to insert a formatted citation into the document. | 6. A computer-based system for processing one or more citations within a document, the system comprising: citation editor software to identify an unformatted citation within a document; and a citation application to receive the unformatted citation, identify a citation that matches the unformatted citation in a citation library storing multiple citations, and pass information based on the matching citation to the citation editor software for enabling the citation editor software to insert a formatted citation into the document. 12. The system of claim 6 wherein links are inserted into the document linking to citation data that forms the formatted citation. | 0.80826 |
8,380,490 | 7 | 8 | 7. A reusable automatic text translation control for translating text from a source language to a target language, comprising: means for initializing parameters to identify a plurality of variables comprising at least the source and the target language; means for identifying when translation should be invoked for text in a field of the control; means for encapsulating said steps of initializing and identifying in order to make a reusable data object; and wherein said text is inputted into the field. | 7. A reusable automatic text translation control for translating text from a source language to a target language, comprising: means for initializing parameters to identify a plurality of variables comprising at least the source and the target language; means for identifying when translation should be invoked for text in a field of the control; means for encapsulating said steps of initializing and identifying in order to make a reusable data object; and wherein said text is inputted into the field. 8. The reusable automatic text translation control of claim 7 , wherein said means for initializing further comprises means for initializing a subject area. | 0.5 |
9,507,932 | 13 | 15 | 13. The apparatus of claim 1 , wherein the processor is configured to: assign a label to one of the topology elements selected for inclusion in the abstracted topology information. | 13. The apparatus of claim 1 , wherein the processor is configured to: assign a label to one of the topology elements selected for inclusion in the abstracted topology information. 15. The apparatus of claim 13 , wherein the processor is configured to: derive an identifier for the one of the topology elements, based on the label, for use in the abstract representation of the topology. | 0.556034 |
7,567,915 | 6 | 7 | 6. An information system as recited in claim 5 , wherein the constraint satisfaction engine executes at least one of the constraints received from the interaction flow engine and at least one of the constraints obtained from the constraint model, the constraint satisfaction engine being configured to produce a set of solutions. | 6. An information system as recited in claim 5 , wherein the constraint satisfaction engine executes at least one of the constraints received from the interaction flow engine and at least one of the constraints obtained from the constraint model, the constraint satisfaction engine being configured to produce a set of solutions. 7. An information system as recited in claim 6 , wherein the optimization engine is configured to receive the set of solutions from the interaction flow engine and optimization model data to generate an optimized solution, the optimized solution being communicated to the distributed information service. | 0.5 |
8,670,986 | 1 | 4 | 1. An apparatus, comprising: a microphone configured to detect a voice of a human; a speaker configured to output a masking language, the masking language including phonemes resembling human speech, the phonemes having at least one of a pitch, a volume, a theme, or a phonetic content substantially matching a pitch, a volume, a theme, or a phonetic content of the voice; a soundboard located between the microphone and the speaker, the soundboard configured to at least partially acoustically isolate the output of the speaker from the microphone; and a moveable mounting pole coupled to the soundboard such that the apparatus can be moved from a first location to a second location. | 1. An apparatus, comprising: a microphone configured to detect a voice of a human; a speaker configured to output a masking language, the masking language including phonemes resembling human speech, the phonemes having at least one of a pitch, a volume, a theme, or a phonetic content substantially matching a pitch, a volume, a theme, or a phonetic content of the voice; a soundboard located between the microphone and the speaker, the soundboard configured to at least partially acoustically isolate the output of the speaker from the microphone; and a moveable mounting pole coupled to the soundboard such that the apparatus can be moved from a first location to a second location. 4. The apparatus of claim 1 , wherein a surface of the soundboard has a concave shape. | 0.906725 |
8,150,866 | 1 | 4 | 1. A process for creating re-usable queries over complex data, the process comprising: defining a re-usable object-oriented query language with object-oriented classes treated as logical properties, wherein each logical property is defined by one or more specified classes of at least one complex data item; relating inheritance, used to form new class with the specified classes, to the logical properties along with a plurality of virtual method calls that execute all applicable method implementations in at least one of the specified classes; and dispatching on the logical properties to choose at least one most specific implementation of an operation, wherein a most specific implementation is in a class where no subclasses define a same method, wherein the dispatching on the logical properties further includes: defining a named predicate p as predicate p(T 1 x 1 , . . . , T n x n ) {formula} for each one of the applicable method implementations, wherein the named predicate p has variables x 1 , . . . , x n so as to restrict a range of a relation, which contains tuples (x 1 , . . . , x n ) where each x i has a type T i ; and testing a receiver against each relevant type and choosing the applicable method implementations, wherein testing a type of the receiver is achieved by invoking a named constructor for each class defining a method of a relevant signature, regardless of static types; implementing queries by translating actual or possibly recursive object-oriented queries to pure Datalog using for each method and constructor of each class, a first special variable that holds a value that is a member of the class, and for each method that is not a predicate, a second special variable that holds a result of a method; and at least one of: mapping each constructor to a named characteristic predicate of its class, which tests whether a value belongs to the class, by taking a logical conjunction of characteristic predicates of all superclasses and a property specified in the constructor; mapping instance of tests and cast expressions to calls of such characteristic predicates; and mapping expressions including nested method calls to a conjunction of predicate calls, with a new named variable denoting an intermediate result of each method call. | 1. A process for creating re-usable queries over complex data, the process comprising: defining a re-usable object-oriented query language with object-oriented classes treated as logical properties, wherein each logical property is defined by one or more specified classes of at least one complex data item; relating inheritance, used to form new class with the specified classes, to the logical properties along with a plurality of virtual method calls that execute all applicable method implementations in at least one of the specified classes; and dispatching on the logical properties to choose at least one most specific implementation of an operation, wherein a most specific implementation is in a class where no subclasses define a same method, wherein the dispatching on the logical properties further includes: defining a named predicate p as predicate p(T 1 x 1 , . . . , T n x n ) {formula} for each one of the applicable method implementations, wherein the named predicate p has variables x 1 , . . . , x n so as to restrict a range of a relation, which contains tuples (x 1 , . . . , x n ) where each x i has a type T i ; and testing a receiver against each relevant type and choosing the applicable method implementations, wherein testing a type of the receiver is achieved by invoking a named constructor for each class defining a method of a relevant signature, regardless of static types; implementing queries by translating actual or possibly recursive object-oriented queries to pure Datalog using for each method and constructor of each class, a first special variable that holds a value that is a member of the class, and for each method that is not a predicate, a second special variable that holds a result of a method; and at least one of: mapping each constructor to a named characteristic predicate of its class, which tests whether a value belongs to the class, by taking a logical conjunction of characteristic predicates of all superclasses and a property specified in the constructor; mapping instance of tests and cast expressions to calls of such characteristic predicates; and mapping expressions including nested method calls to a conjunction of predicate calls, with a new named variable denoting an intermediate result of each method call. 4. The process as set forth in claim 1 , wherein complex data is stored in a standard relational database, and column types are used to build a hierarchy of object-oriented classes on top of an existing relational database, by annotating an existing relational schema. | 0.663317 |
4,495,566 | 1 | 11 | 1. A method using digital data processing means and stored textual block identifiers in a table for locating in a stored data base having a plurality of textual blocks, those textual blocks having the best match with a query, the textual blocks in the data base having words grouped into such textual blocks, the textual block identifiers being grouped and each group of textual block identifiers corresponding to one of the blocks in the stored data base, each of the textual block identifiers providing an indication of one of the textual blocks in the stored data base which contains the word corresponding to the group of textual block identifiers in which the textual block identifier is located, the method comprising the steps of: (a) receiving a query having representations of a plurality of query words to be located in the textual blocks contained in the stored data base; (b) determining, for each one of a plurality of the query words, at least one corresponding set of equivalent words which are contained in the stored data base, each of the equivalent words in such set being equivalent to the corresponding query word and corresponding to one of the groups of textual block identifiers; (c) processing the textual block identifiers contained in the groups of textual block identifiers which correspond to the words in the determined sets of equivalent words to thereby form a representation of a score for at least a first of the textual blocks which is represented by said textual block identifiers, the representation of a score representing the total number of said sets of equivalent words which have at least one of said equivalent words in said at least a first of the textual blocks; and (d) utilizing said representation of a score to provide output data pertaining to at least one textual block, for which a representation of a score has been formed. | 1. A method using digital data processing means and stored textual block identifiers in a table for locating in a stored data base having a plurality of textual blocks, those textual blocks having the best match with a query, the textual blocks in the data base having words grouped into such textual blocks, the textual block identifiers being grouped and each group of textual block identifiers corresponding to one of the blocks in the stored data base, each of the textual block identifiers providing an indication of one of the textual blocks in the stored data base which contains the word corresponding to the group of textual block identifiers in which the textual block identifier is located, the method comprising the steps of: (a) receiving a query having representations of a plurality of query words to be located in the textual blocks contained in the stored data base; (b) determining, for each one of a plurality of the query words, at least one corresponding set of equivalent words which are contained in the stored data base, each of the equivalent words in such set being equivalent to the corresponding query word and corresponding to one of the groups of textual block identifiers; (c) processing the textual block identifiers contained in the groups of textual block identifiers which correspond to the words in the determined sets of equivalent words to thereby form a representation of a score for at least a first of the textual blocks which is represented by said textual block identifiers, the representation of a score representing the total number of said sets of equivalent words which have at least one of said equivalent words in said at least a first of the textual blocks; and (d) utilizing said representation of a score to provide output data pertaining to at least one textual block, for which a representation of a score has been formed. 11. A method according to claim 1 wherein the step of determining a corresponding set of equivalent words for a given one of the query words comprises the step of selecting words in the data base which are acceptable misspellings and acceptable inflections of the query word. | 0.754464 |
7,707,544 | 1 | 2 | 1. A method of generating and reusing software application code with source definition files, comprising the steps of: receiving one or more source definition files, each of which includes annotations therein defining one or a plurality of software objects to be generated, wherein the annotations optionally include variables and values associated therewith for further defining the software object; parsing the one or more source definition files, including comparing the annotations with an annotation library that specifies required and optional parameters for each annotation, to validate the annotations, and comparing any provided variables and values with a variables library that specifies permissible values for each variable; and generating classes for the one or a plurality of software objects in accordance with the validated annotations and provided variables and values, including generating a remote class, a home class, and at least one deployment descriptor based on the description of the one or a plurality of software objects, such that a change to the source definition file is propagated to the remote class, home class and deployment descriptor; subsequently receiving software application code as input files which include modified class definitions for the one or a plurality of software objects; examining information in the input files to identify which annotations from the annotation library and the variables library adequately describe the software objects, including selecting annotations from the annotation library that adequately match the class structure, class relationships and deployment, and determining optional variables and values from the variables library that adequately match the class structure, class relationships and deployment; and generating a new source definition file which includes the annotations and the optional variables defining the input files. | 1. A method of generating and reusing software application code with source definition files, comprising the steps of: receiving one or more source definition files, each of which includes annotations therein defining one or a plurality of software objects to be generated, wherein the annotations optionally include variables and values associated therewith for further defining the software object; parsing the one or more source definition files, including comparing the annotations with an annotation library that specifies required and optional parameters for each annotation, to validate the annotations, and comparing any provided variables and values with a variables library that specifies permissible values for each variable; and generating classes for the one or a plurality of software objects in accordance with the validated annotations and provided variables and values, including generating a remote class, a home class, and at least one deployment descriptor based on the description of the one or a plurality of software objects, such that a change to the source definition file is propagated to the remote class, home class and deployment descriptor; subsequently receiving software application code as input files which include modified class definitions for the one or a plurality of software objects; examining information in the input files to identify which annotations from the annotation library and the variables library adequately describe the software objects, including selecting annotations from the annotation library that adequately match the class structure, class relationships and deployment, and determining optional variables and values from the variables library that adequately match the class structure, class relationships and deployment; and generating a new source definition file which includes the annotations and the optional variables defining the input files. 2. The method of claim 1 wherein the source definition file is used to generate a single ENTERPRISE JAVA BEAN (EJB) file with multiple classes. | 0.623684 |
9,167,014 | 1 | 4 | 1. A computer-implemented method comprising: accessing a social networking system question associated with a social networking system questioning user, the question associated with a plurality of answers provided by one or more social networking system answering users, the plurality of answers associated with a pre-determined order received from the questioning user; presenting the accessed question to a social networking system viewing user different than the questioning user; selecting a subset of the plurality of answers to present to the viewing user, the selected subset of answers comprising a threshold number of answers that have received a highest number of votes by social networking system answering users that have answered the question and that have established a connection with the viewing user, the threshold number selected based on a client device used by the viewing user to display the answer display; generating, by a processor, an answer display comprising the selected subset of answers, the selected subset of answers ordered within the answer display according to the pre-determined order received from the questioning user; and sending the answer display for display to the viewing user. | 1. A computer-implemented method comprising: accessing a social networking system question associated with a social networking system questioning user, the question associated with a plurality of answers provided by one or more social networking system answering users, the plurality of answers associated with a pre-determined order received from the questioning user; presenting the accessed question to a social networking system viewing user different than the questioning user; selecting a subset of the plurality of answers to present to the viewing user, the selected subset of answers comprising a threshold number of answers that have received a highest number of votes by social networking system answering users that have answered the question and that have established a connection with the viewing user, the threshold number selected based on a client device used by the viewing user to display the answer display; generating, by a processor, an answer display comprising the selected subset of answers, the selected subset of answers ordered within the answer display according to the pre-determined order received from the questioning user; and sending the answer display for display to the viewing user. 4. The computer-implemented method of claim 1 , further comprising: providing a selectable interface within the answer display configured to, when the answer display is displayed, display additional answers within the answer display when selected. | 0.709412 |
8,452,760 | 1 | 4 | 1. A relevancy presentation apparatus, comprising a computer programmed to cause: a first storage to store a plurality of topic networks obtained by clustering first keywords related to topics based on a co-occurrence relation between the first keywords; a second storage to store at least one ontology indicating a network which hierarchically represents conceptual connections between second keywords and upper layers of which correspond to broader concepts, the second keywords indicating first nodes in the network; an extraction unit to extract, from one or more documents, one or more subject keywords each indicating a topic of a first content item, the documents each comprising at least one first content item, the subject keywords being included in the topic networks; a first expansion unit to acquire one or more first relevant words from the topic networks, the first relevant words indicating third keywords other than the subject keywords; a second expansion unit to search the ontology for the subject keywords, and, if the subject keywords are thereby found, to acquire in turn from successively higher layers, beginning with a first layer comprising the subject keywords, second nodes in each layer until the number of acquired second nodes has exceeded or reached a first threshold; a first determination unit to extract common relevant words indicating that the first relevant words and the acquired second nodes are common, and to determine whether or not frequencies of appearances of second relevant words are stationary, the second relevant words indicating fourth keywords which fail to be included in the acquired second nodes among the first keywords of the topic networks including the common relevant words; and a generation unit to generate search queries based on whether or not the frequencies of appearances are stationary, and to generate search results of second content items and a reason for a relevancy of the second content items. | 1. A relevancy presentation apparatus, comprising a computer programmed to cause: a first storage to store a plurality of topic networks obtained by clustering first keywords related to topics based on a co-occurrence relation between the first keywords; a second storage to store at least one ontology indicating a network which hierarchically represents conceptual connections between second keywords and upper layers of which correspond to broader concepts, the second keywords indicating first nodes in the network; an extraction unit to extract, from one or more documents, one or more subject keywords each indicating a topic of a first content item, the documents each comprising at least one first content item, the subject keywords being included in the topic networks; a first expansion unit to acquire one or more first relevant words from the topic networks, the first relevant words indicating third keywords other than the subject keywords; a second expansion unit to search the ontology for the subject keywords, and, if the subject keywords are thereby found, to acquire in turn from successively higher layers, beginning with a first layer comprising the subject keywords, second nodes in each layer until the number of acquired second nodes has exceeded or reached a first threshold; a first determination unit to extract common relevant words indicating that the first relevant words and the acquired second nodes are common, and to determine whether or not frequencies of appearances of second relevant words are stationary, the second relevant words indicating fourth keywords which fail to be included in the acquired second nodes among the first keywords of the topic networks including the common relevant words; and a generation unit to generate search queries based on whether or not the frequencies of appearances are stationary, and to generate search results of second content items and a reason for a relevancy of the second content items. 4. The apparatus according to claim 1 , wherein the extraction unit extracts the subject keywords from one or more texts included in a plurality of first content items every time a user browses the plurality of first content items. | 0.850968 |
9,818,399 | 13 | 17 | 13. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: receiving, at a computing device, a request including a speech data representation of an utterance or feature data extracted from the speech data representation of the utterance; obtaining, by the computing device, a transcription of the utterance by applying a speech recognition model to the speech data representation of the utterance or the feature data extracted from the speech data representation of the utterance; identifying, by the computing device, a keyword that occurs in the transcription of the utterance; and initiating, by the computing device, a voice dialing operation between communication devices based at least on identifying the keyword. | 13. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: receiving, at a computing device, a request including a speech data representation of an utterance or feature data extracted from the speech data representation of the utterance; obtaining, by the computing device, a transcription of the utterance by applying a speech recognition model to the speech data representation of the utterance or the feature data extracted from the speech data representation of the utterance; identifying, by the computing device, a keyword that occurs in the transcription of the utterance; and initiating, by the computing device, a voice dialing operation between communication devices based at least on identifying the keyword. 17. The medium of claim 13 , wherein the keyword comprises a name of a contact. | 0.869637 |
8,751,145 | 1 | 2 | 1. A method for voice recognition, comprising: providing a database including information for a plurality of streets, the streets being characterized by respective street names and street types; performing a location-based grammar reduction by eliminating streets remote from a current location of a vehicle; providing a voice input including a street name information and a street type information; recognizing, with a voice recognition system, a given street type selected from a given number of different street types by processing the voice input, wherein the step of recognizing a given street type is performed prior to the step of recognizing a street name; selecting, with the voice recognition system, streets from the database that have the given street type and that have not been eliminated by the location-based grammar reduction as streets remote from the current location of the vehicle, wherein the step of selecting streets having the given street type is performed prior to the step of recognizing a street name; and subsequently recognizing, with the voice recognition system, a street name of at least one of the streets selected from the database as having the given street type by processing the voice input. | 1. A method for voice recognition, comprising: providing a database including information for a plurality of streets, the streets being characterized by respective street names and street types; performing a location-based grammar reduction by eliminating streets remote from a current location of a vehicle; providing a voice input including a street name information and a street type information; recognizing, with a voice recognition system, a given street type selected from a given number of different street types by processing the voice input, wherein the step of recognizing a given street type is performed prior to the step of recognizing a street name; selecting, with the voice recognition system, streets from the database that have the given street type and that have not been eliminated by the location-based grammar reduction as streets remote from the current location of the vehicle, wherein the step of selecting streets having the given street type is performed prior to the step of recognizing a street name; and subsequently recognizing, with the voice recognition system, a street name of at least one of the streets selected from the database as having the given street type by processing the voice input. 2. The method according to claim 1 , which comprises: calculating a current location of a vehicle; selecting streets within a given distance from the vehicle; and recognizing a street type and a street name of only the streets within the given distance from the vehicle. | 0.663342 |
9,053,579 | 1 | 6 | 1. A system for generating a graph lattice from exemplary images, said system comprising: at least one processor programmed to: receive exemplary data graphs of the exemplary images, wherein nodes of the exemplary data graphs are formed from primitives; generate graph lattice nodes of size one from the primitives; until a termination condition is met, repeatedly: generate candidate graph lattice nodes from accepted graph lattice nodes, including the graph lattice nodes of size one and promoted graph lattice nodes, and the exemplary data graphs; select one or more candidate graph lattice nodes, the selected candidate graph lattice nodes preferentially discriminating exemplary data graphs which are less discriminable than other exemplary data graphs using the accepted graph lattice nodes, wherein the selection of the one or more candidate graph lattice nodes includes a scoring operation where a high score indicates that a particular exemplary data graph is mapped to by many subgraphs of accepted graph lattice nodes that are not mapped to many other exemplary data graphs, indicating there are many discriminating subgraph features for the particular exemplary data graph, and a low score indicates the particular exemplary data graph is not mapped to by unique or highly discriminative features, and is more confusable with other exemplary data graphs, wherein each graph lattice node, including the accepted graph lattice nodes and the candidate graph lattice nodes, includes a subgraph, a vote weight, and at least one mapping of the subgraph to the exemplary data graphs, and wherein the scoring operation includes: scoring each candidate graph lattice node according to a scoring function, the scoring function including a ratio, wherein a numerator of the ratio is based on the vote weight of the candidate graph lattice node, and wherein a denominator of the ratio is a summation of vote weights of accepted graph lattice nodes mapping to exemplary data graphs the candidate graph lattice node maps to; and, the selection of the one or more candidate graph lattice nodes further includes selecting most highly scored candidate graph lattice nodes according to selection criteria; and, promote the selected graph lattice nodes to accepted status; wherein the graph lattice is formed from the accepted graph lattice nodes and relations between the accepted graph lattice nodes. | 1. A system for generating a graph lattice from exemplary images, said system comprising: at least one processor programmed to: receive exemplary data graphs of the exemplary images, wherein nodes of the exemplary data graphs are formed from primitives; generate graph lattice nodes of size one from the primitives; until a termination condition is met, repeatedly: generate candidate graph lattice nodes from accepted graph lattice nodes, including the graph lattice nodes of size one and promoted graph lattice nodes, and the exemplary data graphs; select one or more candidate graph lattice nodes, the selected candidate graph lattice nodes preferentially discriminating exemplary data graphs which are less discriminable than other exemplary data graphs using the accepted graph lattice nodes, wherein the selection of the one or more candidate graph lattice nodes includes a scoring operation where a high score indicates that a particular exemplary data graph is mapped to by many subgraphs of accepted graph lattice nodes that are not mapped to many other exemplary data graphs, indicating there are many discriminating subgraph features for the particular exemplary data graph, and a low score indicates the particular exemplary data graph is not mapped to by unique or highly discriminative features, and is more confusable with other exemplary data graphs, wherein each graph lattice node, including the accepted graph lattice nodes and the candidate graph lattice nodes, includes a subgraph, a vote weight, and at least one mapping of the subgraph to the exemplary data graphs, and wherein the scoring operation includes: scoring each candidate graph lattice node according to a scoring function, the scoring function including a ratio, wherein a numerator of the ratio is based on the vote weight of the candidate graph lattice node, and wherein a denominator of the ratio is a summation of vote weights of accepted graph lattice nodes mapping to exemplary data graphs the candidate graph lattice node maps to; and, the selection of the one or more candidate graph lattice nodes further includes selecting most highly scored candidate graph lattice nodes according to selection criteria; and, promote the selected graph lattice nodes to accepted status; wherein the graph lattice is formed from the accepted graph lattice nodes and relations between the accepted graph lattice nodes. 6. The system according to claim 1 , wherein the vote weight is 1/M, wherein M is the number of exemplary data graphs the subgraph maps to. | 0.922606 |
7,574,053 | 12 | 14 | 12. A system for generating an application that analyzes digital image data, comprising: a computer readable storage medium; and a computer program stored on the storage medium comprising: a set of algorithms, wherein each algorithm of the set of algorithms represents an operation performable by the application; a plurality of neighborhood descriptions, wherein each of the plurality of neighborhood descriptions represents a subset of a data object network, and wherein the data object network is generated by segmenting the digital image data; and means for generating a processing object network, wherein the processing object network includes a parent process and a plurality of child processes, wherein the parent process comprises one of the plurality of neighborhood descriptions and one algorithm of the set of algorithms, and wherein the algorithm performs the operation on the subset of the data object network represented by the data domain. | 12. A system for generating an application that analyzes digital image data, comprising: a computer readable storage medium; and a computer program stored on the storage medium comprising: a set of algorithms, wherein each algorithm of the set of algorithms represents an operation performable by the application; a plurality of neighborhood descriptions, wherein each of the plurality of neighborhood descriptions represents a subset of a data object network, and wherein the data object network is generated by segmenting the digital image data; and means for generating a processing object network, wherein the processing object network includes a parent process and a plurality of child processes, wherein the parent process comprises one of the plurality of neighborhood descriptions and one algorithm of the set of algorithms, and wherein the algorithm performs the operation on the subset of the data object network represented by the data domain. 14. The system of claim 12 , wherein the parent process extracts a subset of data objects from the data object network and applies the one algorithm of the set of algorithms to each data object in the subset of data objects. | 0.5 |
7,598,942 | 78 | 80 | 78. The method of claim 3 , comprising specifying the gesture at a plurality of levels. | 78. The method of claim 3 , comprising specifying the gesture at a plurality of levels. 80. The method of claim 78 , wherein the plurality of levels include a first level comprising a pose of a first appendage of the body. | 0.760714 |
5,559,693 | 1 | 14 | 1. A computer implemented method for performing morphological analysis in a computer system by describing inflectional operations on a natural language, the computer system comprising an input device, a memory and a computer processor capable of manipulating a data structure, the natural language comprising sequences of surface strings encoding grammatical properties, the computer implemented method comprising the steps of: a. providing a language syntax that defines statement forms for statements that describe the inflectional morphology of the natural language; b. accepting as input at the input device, which is coupled to the computer processor, a set of language statements that follow said language syntax to describe the inflectional morphology of the natural language, said input comprising rule statements: i. defining a set of morpho-syntactic features corresponding to grammatical distinctions within the parts of speech categories in the natural language; ii. defining a set of inflectional morphological paradigms, said inflectional morphological paradigms comprising form rule statements to describe the construction of word forms and associate with each construction pre-selected ones of said morpho-syntactic features, said form rule statements comprising stem and affix components that describe the inflectional morphology corresponding to grammatical construction rules commonly known in the natural language; iii. defining a lexicon, said lexicon containing a set of word entries containing representative forms of each word of a language that are associated to a pre-selected one of said inflectional morphological paradigms; c. creating a computer-manipulatable data structure from the set of language statements; and d. performing a morphological analysis utilizing said computer-manipulatable data structure. | 1. A computer implemented method for performing morphological analysis in a computer system by describing inflectional operations on a natural language, the computer system comprising an input device, a memory and a computer processor capable of manipulating a data structure, the natural language comprising sequences of surface strings encoding grammatical properties, the computer implemented method comprising the steps of: a. providing a language syntax that defines statement forms for statements that describe the inflectional morphology of the natural language; b. accepting as input at the input device, which is coupled to the computer processor, a set of language statements that follow said language syntax to describe the inflectional morphology of the natural language, said input comprising rule statements: i. defining a set of morpho-syntactic features corresponding to grammatical distinctions within the parts of speech categories in the natural language; ii. defining a set of inflectional morphological paradigms, said inflectional morphological paradigms comprising form rule statements to describe the construction of word forms and associate with each construction pre-selected ones of said morpho-syntactic features, said form rule statements comprising stem and affix components that describe the inflectional morphology corresponding to grammatical construction rules commonly known in the natural language; iii. defining a lexicon, said lexicon containing a set of word entries containing representative forms of each word of a language that are associated to a pre-selected one of said inflectional morphological paradigms; c. creating a computer-manipulatable data structure from the set of language statements; and d. performing a morphological analysis utilizing said computer-manipulatable data structure. 14. The computer implemented method of claim 1 comprising the following additional steps: a. accepting as input to the computer processor a plurality of form rule declarations; b. providing in the language syntax a statement form to provide that a set of form rules identify a variable; and c. accepting as input to the computer processor a declaration of a form rule wherein the stem of the form rule is an identifier for a form set. | 0.743195 |
9,607,048 | 1 | 10 | 1. A method for deriving and utilizing a context object to generate a synthetic context-based object, the method comprising: deriving, by one or more processors, a context object for a non-contextual data object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, wherein the context object provides a context that identifies a specific subject-matter, from multiple subject-matters, of the non-contextual data object, wherein the context object is derived by contextually searching and analyzing a document to derive the context object; and wherein the context object is selected according to a profile for a particular user; establishing a minimum validity threshold for the context object, wherein the minimum validity threshold defines a probability that a derived context object accurately describes the context of the non-contextual data object; expanding a range of a search area of the document until the minimum validity threshold is reached; associating, by one or more processors, the non-contextual data object with the context object to define a synthetic context-based object; associating, by one or more processors, the synthetic context-based object with at least one specific data store, wherein said at least one specific data store comprises data that is associated with data contained in the non-contextual data object and the context object; constructing, by one or more processors, a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, wherein synthetic context-based objects within a same dimension of the dimensionally constrained hierarchical synthetic context-based object library share data from a same non-contextual data object, and wherein synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library contain disparate data from different context objects; receiving a request from the particular user for at least one data store that is associated with synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library; and returning, to the particular user, said at least one specific data store that is associated with synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library. | 1. A method for deriving and utilizing a context object to generate a synthetic context-based object, the method comprising: deriving, by one or more processors, a context object for a non-contextual data object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, wherein the context object provides a context that identifies a specific subject-matter, from multiple subject-matters, of the non-contextual data object, wherein the context object is derived by contextually searching and analyzing a document to derive the context object; and wherein the context object is selected according to a profile for a particular user; establishing a minimum validity threshold for the context object, wherein the minimum validity threshold defines a probability that a derived context object accurately describes the context of the non-contextual data object; expanding a range of a search area of the document until the minimum validity threshold is reached; associating, by one or more processors, the non-contextual data object with the context object to define a synthetic context-based object; associating, by one or more processors, the synthetic context-based object with at least one specific data store, wherein said at least one specific data store comprises data that is associated with data contained in the non-contextual data object and the context object; constructing, by one or more processors, a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, wherein synthetic context-based objects within a same dimension of the dimensionally constrained hierarchical synthetic context-based object library share data from a same non-contextual data object, and wherein synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library contain disparate data from different context objects; receiving a request from the particular user for at least one data store that is associated with synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library; and returning, to the particular user, said at least one specific data store that is associated with synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library. 10. The method of claim 1 , wherein the data store includes a text document, and wherein the method further comprises: searching, by one or more processors, the text document for text data that is part of the synthetic context-based object; and associating, by one or more processors, the text document that contains said text data with the synthetic context-based object. | 0.8391 |
10,104,221 | 1 | 6 | 1. A first device comprising: at least one computer memory that is not a transitory signal and that comprises instructions executable by at least one processor to: responsive to wireless text communication between the first device and a second device, the first and second devices being associated with respective first and second users with a history of past wireless text communication with each other, establish a first language setting for the first device responsive to the first language setting being a language setting of the first device in a most recent past communication between the first and second users; responsive to wireless text communication between the first device and a third device of the respective first user and a third user with no history of past wireless text communication with each other, and responsive to an indication that the first and third users have no language in common with each other, establish a first language setting on the first device according to a first user-indicated language preference; responsive to wireless text communication between the first and third devices of the respective first and third users with no history of past wireless text communication with each other, and responsive to an indication that the first and third users have one and only one language in common with each other, establish language settings on the first device according to the one and only one language; responsive to wireless text communication between the first and third devices of the respective first and third users with no history of past wireless text communication with each other, and responsive to an indication that the first and third users have at least first and second languages in common with each other, establish language settings on the first device according to which of the first and second languages is used more frequently than the other on the first device. | 1. A first device comprising: at least one computer memory that is not a transitory signal and that comprises instructions executable by at least one processor to: responsive to wireless text communication between the first device and a second device, the first and second devices being associated with respective first and second users with a history of past wireless text communication with each other, establish a first language setting for the first device responsive to the first language setting being a language setting of the first device in a most recent past communication between the first and second users; responsive to wireless text communication between the first device and a third device of the respective first user and a third user with no history of past wireless text communication with each other, and responsive to an indication that the first and third users have no language in common with each other, establish a first language setting on the first device according to a first user-indicated language preference; responsive to wireless text communication between the first and third devices of the respective first and third users with no history of past wireless text communication with each other, and responsive to an indication that the first and third users have one and only one language in common with each other, establish language settings on the first device according to the one and only one language; responsive to wireless text communication between the first and third devices of the respective first and third users with no history of past wireless text communication with each other, and responsive to an indication that the first and third users have at least first and second languages in common with each other, establish language settings on the first device according to which of the first and second languages is used more frequently than the other on the first device. 6. The first device of claim 1 , wherein the first language setting includes a language in which a person's name is presented. | 0.818966 |
7,711,573 | 103 | 104 | 103. The method of claim 102 , wherein the content data further includes a nested element comprising a nested start tag, nested content data, and a nested end tag, wherein the nested start tag and the nested end tag include a nested term of experience, and wherein the nested content data includes each said at least one skill or experience-related phrase having the nested term of experience. | 103. The method of claim 102 , wherein the content data further includes a nested element comprising a nested start tag, nested content data, and a nested end tag, wherein the nested start tag and the nested end tag include a nested term of experience, and wherein the nested content data includes each said at least one skill or experience-related phrase having the nested term of experience. 104. The method of claim 103 , wherein the nested term of experience is greater than the identical term of experience. | 0.5 |
7,676,787 | 10 | 13 | 10. An application development architecture embodied on a computer readable storage medium, comprising: a design tool that identifies a designer associated with a user interface component and populates itself with the designer associated with the user interface component upon the receipt of a request for the user interface component so that changes to at least one of the user interface component or the designer can be made independent of the design tool; and a designer host interface, created at design time, that creates an instance of the user interface component in response to a request for the user interface component from the developer, discerns whether the user interface component has an associated designer, creates an instance of the designer associated with the user interface component, initializes the designer, gives control of the user interface component to the designer, and coordinates servicing of the user interface component and the designer. | 10. An application development architecture embodied on a computer readable storage medium, comprising: a design tool that identifies a designer associated with a user interface component and populates itself with the designer associated with the user interface component upon the receipt of a request for the user interface component so that changes to at least one of the user interface component or the designer can be made independent of the design tool; and a designer host interface, created at design time, that creates an instance of the user interface component in response to a request for the user interface component from the developer, discerns whether the user interface component has an associated designer, creates an instance of the designer associated with the user interface component, initializes the designer, gives control of the user interface component to the designer, and coordinates servicing of the user interface component and the designer. 13. The architecture of claim 10 , wherein the designer and the user interface component are provided separately from each other, wherein the user interface component provides an association to identify the designer and the designer implements design time functionality for the user interface component so that changes in the design time implementation of the user interface component are reflected in the designer associated with the user interface component, and changes to the designer or the user interface component can be made independent of the design tool. | 0.5 |
8,484,192 | 13 | 16 | 13. A computer-implemented system, comprising one or more computing devices including: an interface programmed to receive search requests and to parse the search requests and to (i) identify one or more media-related terms in the search requests that indicate that the search requests are media-related, (ii) determine that the search request matches a first media-related category, (iii) identify a second media-related category that is different from the first media-related category and is based on the first media-related category, and (iv) determine, based on the second media-related category, one or more additional media-related terms, and (v) generate code for formatting a display for the one or more media-related search results, the display comprising a list area that is adjacent to an electronic program guide grid, wherein the list area displays (a) one or more icons that indicate that one or more search results is related to a television media program, (b) a media program identifier that identifies a name of a media program associated with one or more search results responsive to the submitted query, and (c) upcoming viewing times for one or more media programs associated with one or more search results responsive to the submitted query and the electronic program guide grid displays at least one of the media-related search results; a search engine having access to one or more media-related search result indices; and a query formatter to receive the parsed requests from the interface and, in response to parsed requests being identified as media-related, to add one or more additional media-related terms to the parsed requests to generate queries that are broader than the search requests, wherein the one or more media-related terms added to the parsed requests are related to the first and second media-related categories and were not included in the received search requests or selected by users that submitted the search requests. | 13. A computer-implemented system, comprising one or more computing devices including: an interface programmed to receive search requests and to parse the search requests and to (i) identify one or more media-related terms in the search requests that indicate that the search requests are media-related, (ii) determine that the search request matches a first media-related category, (iii) identify a second media-related category that is different from the first media-related category and is based on the first media-related category, and (iv) determine, based on the second media-related category, one or more additional media-related terms, and (v) generate code for formatting a display for the one or more media-related search results, the display comprising a list area that is adjacent to an electronic program guide grid, wherein the list area displays (a) one or more icons that indicate that one or more search results is related to a television media program, (b) a media program identifier that identifies a name of a media program associated with one or more search results responsive to the submitted query, and (c) upcoming viewing times for one or more media programs associated with one or more search results responsive to the submitted query and the electronic program guide grid displays at least one of the media-related search results; a search engine having access to one or more media-related search result indices; and a query formatter to receive the parsed requests from the interface and, in response to parsed requests being identified as media-related, to add one or more additional media-related terms to the parsed requests to generate queries that are broader than the search requests, wherein the one or more media-related terms added to the parsed requests are related to the first and second media-related categories and were not included in the received search requests or selected by users that submitted the search requests. 16. The method of claim 13 , wherein the search request is received from a general, non-media-specific, search engine page. | 0.747951 |
8,874,606 | 14 | 19 | 14. The system of claim 13 , further comprising instructions that, when executed by the at least one processor, cause the system to: upon providing the additional web page, provide another selectable option corresponding to another candidate search term; detect a user selection of the another selectable option corresponding to the another candidate search term; generate a third search query comprising the second search query and the another candidate search term; and obtain a third search result associated with the third search query. | 14. The system of claim 13 , further comprising instructions that, when executed by the at least one processor, cause the system to: upon providing the additional web page, provide another selectable option corresponding to another candidate search term; detect a user selection of the another selectable option corresponding to the another candidate search term; generate a third search query comprising the second search query and the another candidate search term; and obtain a third search result associated with the third search query. 19. The system of claim 14 , further comprising instructions that, when executed by the at least one processor, cause the system to: provide a portion of the additional web page to the user in conjunction with the third search result; and enable the user to specify a modification to the third search query, in response to the displayed portion of the additional web page. | 0.5 |
7,702,691 | 21 | 28 | 21. A machine readable storage medium having instructions stored thereon that when executed cause a system to: define the following properties for a software object finder via a deployment descriptor: different query languages used by the software object finder; and selection information of the different query languages; and perform the following operations via the software object finder: querying a plurality of databases using a plurality of queries in different query languages, wherein at least one database in the plurality of databases is associated with a different query language from another database in the plurality of databases; mapping a matched data entity from the plurality of databases to one or more instances of the software object; performing relationship caching of one or more additional software objects from the plurality of databases into a cache using queries in different query languages, wherein the one or more additional software objects are related to the software object by one or more redefined relationships, wherein the relationship caching allows the one or more additional software objects to be loaded into the cache in a join query prior to the main step, and wherein both the software object and the one or more additional software objects are created and managed by a container and run as part of an application server to support software applications, wherein the software object and the related software objects use one or more deployment descriptors at deploy time, wherein the one or more deployment descriptors allow an editing of structural information about the software object and the one or more additional software objects; and storing the one or more instances of the software object in a result set. | 21. A machine readable storage medium having instructions stored thereon that when executed cause a system to: define the following properties for a software object finder via a deployment descriptor: different query languages used by the software object finder; and selection information of the different query languages; and perform the following operations via the software object finder: querying a plurality of databases using a plurality of queries in different query languages, wherein at least one database in the plurality of databases is associated with a different query language from another database in the plurality of databases; mapping a matched data entity from the plurality of databases to one or more instances of the software object; performing relationship caching of one or more additional software objects from the plurality of databases into a cache using queries in different query languages, wherein the one or more additional software objects are related to the software object by one or more redefined relationships, wherein the relationship caching allows the one or more additional software objects to be loaded into the cache in a join query prior to the main step, and wherein both the software object and the one or more additional software objects are created and managed by a container and run as part of an application server to support software applications, wherein the software object and the related software objects use one or more deployment descriptors at deploy time, wherein the one or more deployment descriptors allow an editing of structural information about the software object and the one or more additional software objects; and storing the one or more instances of the software object in a result set. 28. The machine readable storage medium of claim 21 , further comprising instructions that when executed cause the system to: define one or more features in the deployment descriptor in XML format or an object-oriented programming language annotation. | 0.675711 |
8,112,705 | 6 | 9 | 6. A computer program product comprising: a computer readable device storing computer usable program code for magnifying a portion of a document in a browser, the computer program product comprising: computer usable program code for presenting a first document in a first display area in the browser, wherein the first document is displayed with an original font size; computer usable program code for receiving a selection of a portion of the first document for magnified display; computer usable program code for generating a magnified display of the portion of the first document to form a magnified portion, wherein the magnified display of the portion comprises text in a second font size that is larger than the original font size, wherein generating the magnified display further comprises: presenting the magnified portion in a magnifier window in a second display area within the first display area, wherein the second display area is presented on top of at least a portion of the first display area and obstructs from view the portion of the first display area; analyzing a document object model for the first document; and identifying a portion of the document object model that corresponds to the portion of the first document, wherein the magnified display of the portion of the first document is generated based on the portion of the document object model; computer usable program code for receiving a request for an action, wherein the action is to be applied within the magnified display in the magnifier window; and computer usable program code for performing the action with respect to the magnified display, wherein the magnified portion presents the portion of the document object model and retains full browser functionality within the magnifier window. | 6. A computer program product comprising: a computer readable device storing computer usable program code for magnifying a portion of a document in a browser, the computer program product comprising: computer usable program code for presenting a first document in a first display area in the browser, wherein the first document is displayed with an original font size; computer usable program code for receiving a selection of a portion of the first document for magnified display; computer usable program code for generating a magnified display of the portion of the first document to form a magnified portion, wherein the magnified display of the portion comprises text in a second font size that is larger than the original font size, wherein generating the magnified display further comprises: presenting the magnified portion in a magnifier window in a second display area within the first display area, wherein the second display area is presented on top of at least a portion of the first display area and obstructs from view the portion of the first display area; analyzing a document object model for the first document; and identifying a portion of the document object model that corresponds to the portion of the first document, wherein the magnified display of the portion of the first document is generated based on the portion of the document object model; computer usable program code for receiving a request for an action, wherein the action is to be applied within the magnified display in the magnifier window; and computer usable program code for performing the action with respect to the magnified display, wherein the magnified portion presents the portion of the document object model and retains full browser functionality within the magnifier window. 9. The computer program product of claim 6 , wherein the action comprises a selection of a portion of text within the portion of the magnified display to be copied and pasted into a different application and the step of performing the action comprises copying the portion of the text selected within the portion of the magnified display and pasting the portion of the text into a second document corresponding to the different application. | 0.5 |
7,996,351 | 18 | 20 | 18. The method of claim 17 further comprising receiving, at the client computing device, a plurality of rules for estimating the country, wherein at least one rule in the plurality of rules comprises an antecedent and an inference, wherein the inference is determined if the antecedent is determined to be true, wherein the country estimation programming comprises a rule engine that processes the plurality of rules to estimate the country. | 18. The method of claim 17 further comprising receiving, at the client computing device, a plurality of rules for estimating the country, wherein at least one rule in the plurality of rules comprises an antecedent and an inference, wherein the inference is determined if the antecedent is determined to be true, wherein the country estimation programming comprises a rule engine that processes the plurality of rules to estimate the country. 20. The method of claim 18 , wherein at least one inference identifies the country. | 0.775676 |
8,280,959 | 7 | 8 | 7. The method of claim 1 , wherein requesting information from the social networking system comprises providing to the social networking system one or more parameters for selecting the requested information, and wherein the requested information received from the social networking system is selected based on the one or more parameters and on the one or more actions performed by one or more other users with which the user has established a connection in the social networking system. | 7. The method of claim 1 , wherein requesting information from the social networking system comprises providing to the social networking system one or more parameters for selecting the requested information, and wherein the requested information received from the social networking system is selected based on the one or more parameters and on the one or more actions performed by one or more other users with which the user has established a connection in the social networking system. 8. The method of claim 7 , wherein the one or more parameters comprise at least one domain. | 0.5 |
8,667,117 | 1 | 5 | 1. A method comprising: providing a multi-layer model that comprises: an advertiser layer associated with advertisers that compensate syndicators to display advertisements; a syndicator layer associated with the syndicators that buy click traffic from aggregators for the advertisements; an aggregation layer associated with the aggregators that buy the click traffic from spammers to insulate the syndicators and the advertisers from being associated with spam content; a redirection layer associated with redirection domains used by the spammers to fetch the spam content after a doorway web page is clicked; and a doorway layer associated with doorway web pages that the spammers promote to top search result positions to attract the click traffic; identifying, based on an analysis of the multi-layer model, the aggregation layer as a bottleneck layer that uses at least one Internet Protocol (IP) block to funnel the advertisements and to associate the advertisements with the spam content; and performing, by one or more processors configured with executable instructions, one or more corrective actions that act on the bottleneck layer to protect web browsers from search spam. | 1. A method comprising: providing a multi-layer model that comprises: an advertiser layer associated with advertisers that compensate syndicators to display advertisements; a syndicator layer associated with the syndicators that buy click traffic from aggregators for the advertisements; an aggregation layer associated with the aggregators that buy the click traffic from spammers to insulate the syndicators and the advertisers from being associated with spam content; a redirection layer associated with redirection domains used by the spammers to fetch the spam content after a doorway web page is clicked; and a doorway layer associated with doorway web pages that the spammers promote to top search result positions to attract the click traffic; identifying, based on an analysis of the multi-layer model, the aggregation layer as a bottleneck layer that uses at least one Internet Protocol (IP) block to funnel the advertisements and to associate the advertisements with the spam content; and performing, by one or more processors configured with executable instructions, one or more corrective actions that act on the bottleneck layer to protect web browsers from search spam. 5. The method of claim 1 , wherein the identifying the aggregation layer comprises using search keywords. | 0.619565 |
10,061,867 | 20 | 21 | 20. The system of claim 17 , wherein the plurality of interactions correspond to a first time period, and wherein the memory further stores instructions that, when executed by the processor, cause the processor to: extract a second plurality of fragments from a second plurality of interactions, the second plurality of interactions corresponding to a second time period, the second time period being different from the first time period; initialize a second collection of tracked topics to the empty collection; compute a similarity between each fragment of the second fragments and each of the known topics; and add a known topic of the known topics to the second tracked topics in response to the similarity between a fragment and the known topic exceeding the threshold value. | 20. The system of claim 17 , wherein the plurality of interactions correspond to a first time period, and wherein the memory further stores instructions that, when executed by the processor, cause the processor to: extract a second plurality of fragments from a second plurality of interactions, the second plurality of interactions corresponding to a second time period, the second time period being different from the first time period; initialize a second collection of tracked topics to the empty collection; compute a similarity between each fragment of the second fragments and each of the known topics; and add a known topic of the known topics to the second tracked topics in response to the similarity between a fragment and the known topic exceeding the threshold value. 21. The system of claim 20 , wherein the first time period has a length different from a length of the second time period. | 0.530769 |
8,719,021 | 1 | 8 | 1. A speech recognition dictionary compilation assisting system, comprising: a computer processing apparatus; and a computer-readable storage medium having data stored thereon that includes a dictionary, a language model, an acoustic model, and a speech recognition dictionary compilation assisting program that is executable by the computer processing apparatus to cause the computer processing apparatus to operate as: a text analysis section that applies morphological analysis to input text data to produce analyzed text data comprising words of the input text data and pronunciation information for each word; a virtual speech recognition processing section that performs a speech recognition process on said analyzed text data received from the text analysis section by applying the dictionary and the language model to said analyzed text data thereby to generate virtual text data, and that compares a pronunciation information of the virtual text data with the pronunciation information of the analyzed text data to extract and output different points of the analyzed text data and the virtual text data, each different point comprising an element of the analyzed text data and a corresponding element of the virtual text data; and an update processing section that corrects at least one of the dictionary and the language model in accordance with the different points identified by the virtual speech recognition processing section, wherein for each different point, the pronunciation information corresponding to a word of the analyzed text data differs from a corresponding pronunciation information of the virtual text data. | 1. A speech recognition dictionary compilation assisting system, comprising: a computer processing apparatus; and a computer-readable storage medium having data stored thereon that includes a dictionary, a language model, an acoustic model, and a speech recognition dictionary compilation assisting program that is executable by the computer processing apparatus to cause the computer processing apparatus to operate as: a text analysis section that applies morphological analysis to input text data to produce analyzed text data comprising words of the input text data and pronunciation information for each word; a virtual speech recognition processing section that performs a speech recognition process on said analyzed text data received from the text analysis section by applying the dictionary and the language model to said analyzed text data thereby to generate virtual text data, and that compares a pronunciation information of the virtual text data with the pronunciation information of the analyzed text data to extract and output different points of the analyzed text data and the virtual text data, each different point comprising an element of the analyzed text data and a corresponding element of the virtual text data; and an update processing section that corrects at least one of the dictionary and the language model in accordance with the different points identified by the virtual speech recognition processing section, wherein for each different point, the pronunciation information corresponding to a word of the analyzed text data differs from a corresponding pronunciation information of the virtual text data. 8. The speech recognition dictionary compilation assisting system according to claim 1 , wherein said update processing section corrects the language model such that a priority of a word or word string that has appeared in the virtual text data resulted from speech recognition becomes lower in accordance to the different points between the analyzed text data and the virtual text data. | 0.644301 |
8,352,478 | 13 | 15 | 13. A computer-implemented method, comprising: receiving information describing a business object type; and in response to user input, creating a definition of the business object type, the definition being in accordance with a data model usable to define business object types, the data model being a standard data model used in an enterprise system, the definition of the business object type including an object key, the creating of the definition of the business object type including creating the object key in accordance with an object key of the data model. | 13. A computer-implemented method, comprising: receiving information describing a business object type; and in response to user input, creating a definition of the business object type, the definition being in accordance with a data model usable to define business object types, the data model being a standard data model used in an enterprise system, the definition of the business object type including an object key, the creating of the definition of the business object type including creating the object key in accordance with an object key of the data model. 15. The method of claim 13 , the enterprise system comprising a technology stack, the method further comprising: in response to a request from a calling application from the technology stack, using the definition to create an instance of the business object type, the enterprise system further comprising a service executable, without further customization, on the instance. | 0.5 |
8,189,746 | 4 | 5 | 4. A method of rendering an email message as speech, wherein the email message comprises email body content and a privacy notice, the method comprising: a voice command platform processing the email message to identify the privacy notice in the email message; and the voice command platform rendering the email body content as speech but avoiding rendering the identified privacy notice as speech. | 4. A method of rendering an email message as speech, wherein the email message comprises email body content and a privacy notice, the method comprising: a voice command platform processing the email message to identify the privacy notice in the email message; and the voice command platform rendering the email body content as speech but avoiding rendering the identified privacy notice as speech. 5. The method of claim 4 , wherein processing the email message to identify the privacy notice comprises detecting a tag indicating a start of the privacy notice and detecting a tag indicating a stop of the privacy notice. | 0.5 |
9,390,137 | 3 | 4 | 3. A method of claim 2 , wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following: a determination of an accuracy, a precision, a resolution, or a combination thereof of the one or more object contextual attributes; and a display of one or more representations of the accuracy, the precision, the resolution, or a combination thereof. | 3. A method of claim 2 , wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following: a determination of an accuracy, a precision, a resolution, or a combination thereof of the one or more object contextual attributes; and a display of one or more representations of the accuracy, the precision, the resolution, or a combination thereof. 4. A method of claim 3 , wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following: a determination of the accuracy, the precision, the resolution, or a combination thereof based, at least in part, on sensor information, survey information, user update information, or a combination thereof. | 0.5 |
10,097,617 | 1 | 5 | 1. A method for conforming text posted on a social networking Web site for posting on another social networking Web site, the method comprising: receiving, by a processing device, text input by a user for posting on a first social networking Web site; analyzing the text, by the processing device, to identify topical and semantic attributes of the text, wherein the semantic attributes comprise writing style, tone and use of idioms; extracting, by the processing device, topical and semantic attributes from exiting posts on a second social networking Web site with natural language processing and semantic analysis; creating and saving a plurality of profiles, by the processing device, according to historical semantic communication style of the existing posts, wherein each profile comprises topic, semantic attributes, social networking Web site identification, and intended recipients; comparing the text with the plurality of profiles; creating a new profile and prioritizing the new profile in response to the topical and semantic attributes of the text not matching a saved profile of the plurality of profiles; prioritizing an existing profile of the plurality of profiles as a key profile of common features for the user in response to the topical and semantic attributes of the text matching the existing profile; and converting the text, by the processing device, to have topical and semantic attributes appropriate for posting on the second social networking Web site, wherein converting the text comprises using a particular profile of the plurality of profiles that best matches the second social networking Web site and the intended recipient to which the text is sent. | 1. A method for conforming text posted on a social networking Web site for posting on another social networking Web site, the method comprising: receiving, by a processing device, text input by a user for posting on a first social networking Web site; analyzing the text, by the processing device, to identify topical and semantic attributes of the text, wherein the semantic attributes comprise writing style, tone and use of idioms; extracting, by the processing device, topical and semantic attributes from exiting posts on a second social networking Web site with natural language processing and semantic analysis; creating and saving a plurality of profiles, by the processing device, according to historical semantic communication style of the existing posts, wherein each profile comprises topic, semantic attributes, social networking Web site identification, and intended recipients; comparing the text with the plurality of profiles; creating a new profile and prioritizing the new profile in response to the topical and semantic attributes of the text not matching a saved profile of the plurality of profiles; prioritizing an existing profile of the plurality of profiles as a key profile of common features for the user in response to the topical and semantic attributes of the text matching the existing profile; and converting the text, by the processing device, to have topical and semantic attributes appropriate for posting on the second social networking Web site, wherein converting the text comprises using a particular profile of the plurality of profiles that best matches the second social networking Web site and the intended recipient to which the text is sent. 5. The method of claim 1 , wherein a user or administrator may select certain topical and semantic attributes for omission from profiling. | 0.784375 |
10,055,470 | 14 | 15 | 14. A computer-implemented method to retrieve data from one or more datasets, comprising: receiving a query to retrieve data and configuration of one or more datasets, wherein the query is in a first query language, and wherein the query includes a list of key performance indicators related to a performance of an entity; retrieving configuration information from a configuration database, wherein the configuration information includes at least key performance indicator configurations; validating the list of key performance indicators in the query based on the retrieved configuration information; splitting the at least one query in the first query language into a plurality of sub-queries; transforming the plurality of sub-queries into one or more second query languages, wherein the one or more second query languages correspond to the one or more datasets; configuring one or more data models in the one or more datasets based on the one or more sub-queries; processing the one or more transformed queries to retrieve one or more query results from the one or more datasets; and processing the one or more query results to generate a data presentation, wherein the processing the one or more query results to generate the data presentation further comprises: processing the one or more query results based on at least one exchange rate parameter; factoring the one or more processed query results based on at least one factoring parameter, wherein the at least one factoring parameter is based on at least one of a therapeutic benefit of a dosage of a medicine and a market share of a medicine for a disease; and generating one or more calculated values based on the one or more factored query results. | 14. A computer-implemented method to retrieve data from one or more datasets, comprising: receiving a query to retrieve data and configuration of one or more datasets, wherein the query is in a first query language, and wherein the query includes a list of key performance indicators related to a performance of an entity; retrieving configuration information from a configuration database, wherein the configuration information includes at least key performance indicator configurations; validating the list of key performance indicators in the query based on the retrieved configuration information; splitting the at least one query in the first query language into a plurality of sub-queries; transforming the plurality of sub-queries into one or more second query languages, wherein the one or more second query languages correspond to the one or more datasets; configuring one or more data models in the one or more datasets based on the one or more sub-queries; processing the one or more transformed queries to retrieve one or more query results from the one or more datasets; and processing the one or more query results to generate a data presentation, wherein the processing the one or more query results to generate the data presentation further comprises: processing the one or more query results based on at least one exchange rate parameter; factoring the one or more processed query results based on at least one factoring parameter, wherein the at least one factoring parameter is based on at least one of a therapeutic benefit of a dosage of a medicine and a market share of a medicine for a disease; and generating one or more calculated values based on the one or more factored query results. 15. The method of claim 14 , further comprising: merging the one or more of query results associated with the plurality of sub-queries. | 0.697309 |
8,880,503 | 8 | 14 | 8. A memory device storing computer program instructions that, when executed by a processor of a computer, cause the computer to perform a computer-implemented method comprising: receiving a query including: a selected record, an outer join that provides a joined table having NULLab 1 e records, and an Order By clause that provides a sort order for ordering records in the joined table based on one or more fields of the joined table; and generating, by the server, a separate query configured to fetch from the joined table a current row that corresponds to the selected record and either subsequent rows or previous rows relative to the current row, wherein generating the separate query comprises: determining whether a paging direction of the separate query is forward paging or backward paging, determining whether the sort order for the Order By clause is ascending or descending, determining an original inequality operator based on the sort order for the Order By clause and the paging direction of the separate query, determining whether the current row returns a NULL value, and generating a WHERE condition for the separate query configured to either change the original inequality operator or ignore the original inequality operator depending on whether the paging direction of the separate query is forward paging or backward paging, whether the sort order for the Order By clause is ascending or descending, and whether the current row returns a NULL value. | 8. A memory device storing computer program instructions that, when executed by a processor of a computer, cause the computer to perform a computer-implemented method comprising: receiving a query including: a selected record, an outer join that provides a joined table having NULLab 1 e records, and an Order By clause that provides a sort order for ordering records in the joined table based on one or more fields of the joined table; and generating, by the server, a separate query configured to fetch from the joined table a current row that corresponds to the selected record and either subsequent rows or previous rows relative to the current row, wherein generating the separate query comprises: determining whether a paging direction of the separate query is forward paging or backward paging, determining whether the sort order for the Order By clause is ascending or descending, determining an original inequality operator based on the sort order for the Order By clause and the paging direction of the separate query, determining whether the current row returns a NULL value, and generating a WHERE condition for the separate query configured to either change the original inequality operator or ignore the original inequality operator depending on whether the paging direction of the separate query is forward paging or backward paging, whether the sort order for the Order By clause is ascending or descending, and whether the current row returns a NULL value. 14. The memory device of claim 8 , wherein: the original inequality operator is changed to IS NOT NULL when the paging direction of the separate query is backward paging, the sort order for the Order By clause is descending, and the current row returns a NULL value. | 0.555184 |
9,369,478 | 16 | 17 | 16. The computer system of claim 13 , wherein a respective record in the log data indicates a client event or a server event. | 16. The computer system of claim 13 , wherein a respective record in the log data indicates a client event or a server event. 17. The computer system of claim 16 , wherein a server event corresponds to a server process being started to listen on a server socket. | 0.692308 |
4,498,148 | 3 | 5 | 3. In a text processing system including a mini-processor, a memory for storing instructions for controlling said mini-processor, and a dictionary memory for storing a representation for each text word of a dictionary of correctly spelled text words, apparatus for generating representations of input text words for comparison to said dictionary of correctly spelled words comprising: a source of input text words; decode means connected to said mini-processor for converting each character of an input text word into a numerical representation; a magnitude table storage means addressably connected to said decode means for storing a magnitude value corresponding to each numerical representation output by said decode means; a first adder means connected to said magnitude table storage means and said mini-processor for accumulating a magnitude sum of the magnitude values output by said magnitude table storage means and outputting said magnitude sum to said mini-processor for use as an address to said dictionary memory; a second adder means connected to said decode means for accumulating partial sums of said numerical representations output by said decode means; binary table storage means for storing a plurality of binary numbers and addressable to output said binary numbers; register means connected to said mini-processor for receiving from said mini-processor and storing a value representing the size of said binary table storage means; compare means connected to said second adder means and said register means for comparing each accumulated partial sum to the binary table storage means size value; gate means connected to said binary table storage means and said second adder means and operable by said compare means for accessing said binary table storage means at the address equal to said accumulated partial sum for a binary number when the accumulated partial sum is less than said binary table storage means size value; third adder means connected to said binary table storage means for accumulating a modulo-2 sum of the binary numbers output by said binary table storage means; binary to decimal decode means connected to said third adder means, and said mini-processor for converting the modulo-2 sum output of said third adder means from a binary number to a decimal angle value and outputting the result to said mini-processor; means for comparing said decimal angle value to the contents of said dictionary memory at the accessed address; means for indicating said input word is correctly spelled when said compare is equal; and means for indicating said input word is not correctly spelled when said compare is unequal. | 3. In a text processing system including a mini-processor, a memory for storing instructions for controlling said mini-processor, and a dictionary memory for storing a representation for each text word of a dictionary of correctly spelled text words, apparatus for generating representations of input text words for comparison to said dictionary of correctly spelled words comprising: a source of input text words; decode means connected to said mini-processor for converting each character of an input text word into a numerical representation; a magnitude table storage means addressably connected to said decode means for storing a magnitude value corresponding to each numerical representation output by said decode means; a first adder means connected to said magnitude table storage means and said mini-processor for accumulating a magnitude sum of the magnitude values output by said magnitude table storage means and outputting said magnitude sum to said mini-processor for use as an address to said dictionary memory; a second adder means connected to said decode means for accumulating partial sums of said numerical representations output by said decode means; binary table storage means for storing a plurality of binary numbers and addressable to output said binary numbers; register means connected to said mini-processor for receiving from said mini-processor and storing a value representing the size of said binary table storage means; compare means connected to said second adder means and said register means for comparing each accumulated partial sum to the binary table storage means size value; gate means connected to said binary table storage means and said second adder means and operable by said compare means for accessing said binary table storage means at the address equal to said accumulated partial sum for a binary number when the accumulated partial sum is less than said binary table storage means size value; third adder means connected to said binary table storage means for accumulating a modulo-2 sum of the binary numbers output by said binary table storage means; binary to decimal decode means connected to said third adder means, and said mini-processor for converting the modulo-2 sum output of said third adder means from a binary number to a decimal angle value and outputting the result to said mini-processor; means for comparing said decimal angle value to the contents of said dictionary memory at the accessed address; means for indicating said input word is correctly spelled when said compare is equal; and means for indicating said input word is not correctly spelled when said compare is unequal. 5. The apparatus of claim 3 further including means connected to said second adder means and said register means and responsive to said compare means for subtracting said binary table storage means size value from said accumulated partial sum when said accumulated partial sum exceeds said binary table storage means size value to produce wrap-around of the address for accessing said binary table storage means. | 0.5 |
8,078,634 | 19 | 20 | 19. A system of aggregating and presenting data, said system comprising: a user interface configured to have a set of user-defined instructions and a user query including data attributes input therein; a computer database system, located at a remote location and maintained in contact with said user interface via a local network connection, configured to be mined for data relevant to said user query; a data set comprising said data relevant to said user query; a logic component configured to aggregate data in said data set using domain metrics selected based on any of predefined and configurable rules and past user usage, wherein said logic component configured to aggregate said data comprises: a first processing unit configured to tag all data attributes in said data set based on database metadata and inputs from a user, wherein said data attributes comprise any of data identifications (IDs), data grouping attributes, and data measure attributes, wherein said first processing unit is adapted to receive said user query, said database metadata for said data attributes in said user query, and attributes specifications being input therein; and a second processing unit adapted to reduce the number of the tagged data attributes in said data set by logically eliminating data attributes; a presentation report generator configured to select at least one presentation report for compiling the aggregated data, wherein the selection is based on any of predefined and configurable rules and past user usage; and a display unit configured to (i) display said at least one presentation report received from said computer system via said local network to said user, and (ii) graphically arrange said at least one presentation report based on an available viewing area of a device accessing said at least one presentation report; wherein for each of said data attributes in said user query, said first processing unit is configured to tag the data attribute as an ID when said attribute is to be treated as an ID based on inputs to any of said computer database system and said database metadata, wherein for each of said data attributes in said user query, said first processing unit is configured to apply default statistics when user specified statistics are unavailable and tag the data attribute as a measure when said data attribute is to be treated as a measure based on inputs to any of said computer database system and said database metadata, wherein for each of said data attributes in said user query, said first processing unit is configured to tag the data attribute as a grouping attribute when said data attribute is to be treated as a grouping attribute based on inputs to any of said computer database system and said database metadata, wherein when said data attribute comprises a grouping attribute and has a number of unique values less than the maximum number of unique values allowed to select a database attribute as a grouping attribute, said first processing unit being configured to tag said data attribute as a grouping attribute, wherein said first processing unit is configured to apply user defined ranges as grouping ranges and tag said data attribute as a grouping attribute when said user defined ranges are available for said data attribute, and wherein said first processing unit is configured to determine appropriate grouping ranges based on a distribution of said data attribute. | 19. A system of aggregating and presenting data, said system comprising: a user interface configured to have a set of user-defined instructions and a user query including data attributes input therein; a computer database system, located at a remote location and maintained in contact with said user interface via a local network connection, configured to be mined for data relevant to said user query; a data set comprising said data relevant to said user query; a logic component configured to aggregate data in said data set using domain metrics selected based on any of predefined and configurable rules and past user usage, wherein said logic component configured to aggregate said data comprises: a first processing unit configured to tag all data attributes in said data set based on database metadata and inputs from a user, wherein said data attributes comprise any of data identifications (IDs), data grouping attributes, and data measure attributes, wherein said first processing unit is adapted to receive said user query, said database metadata for said data attributes in said user query, and attributes specifications being input therein; and a second processing unit adapted to reduce the number of the tagged data attributes in said data set by logically eliminating data attributes; a presentation report generator configured to select at least one presentation report for compiling the aggregated data, wherein the selection is based on any of predefined and configurable rules and past user usage; and a display unit configured to (i) display said at least one presentation report received from said computer system via said local network to said user, and (ii) graphically arrange said at least one presentation report based on an available viewing area of a device accessing said at least one presentation report; wherein for each of said data attributes in said user query, said first processing unit is configured to tag the data attribute as an ID when said attribute is to be treated as an ID based on inputs to any of said computer database system and said database metadata, wherein for each of said data attributes in said user query, said first processing unit is configured to apply default statistics when user specified statistics are unavailable and tag the data attribute as a measure when said data attribute is to be treated as a measure based on inputs to any of said computer database system and said database metadata, wherein for each of said data attributes in said user query, said first processing unit is configured to tag the data attribute as a grouping attribute when said data attribute is to be treated as a grouping attribute based on inputs to any of said computer database system and said database metadata, wherein when said data attribute comprises a grouping attribute and has a number of unique values less than the maximum number of unique values allowed to select a database attribute as a grouping attribute, said first processing unit being configured to tag said data attribute as a grouping attribute, wherein said first processing unit is configured to apply user defined ranges as grouping ranges and tag said data attribute as a grouping attribute when said user defined ranges are available for said data attribute, and wherein said first processing unit is configured to determine appropriate grouping ranges based on a distribution of said data attribute. 20. The system of claim 19 , all the limitations of which are incorporated herein by reference, wherein said set of user-defined instructions comprise: a structured query language (SQL) data format for processing said set of user-defined instructions; database metadata associated with said data attributes of said computer database system; and user input instructions identifying instructions of how an attribute is to be grouped and presented, wherein said domain metrics are represented as any of database columns and column attributes, wherein said logic component is configured to categorize each said data relevant to said user query in said data set into non-overlapping data regions, and wherein said logic component is configured to calculate a number of unique values in said data set associated with a given attribute. | 0.646934 |
8,423,366 | 2 | 5 | 2. The method of claim 1 , further comprising: modifying, by the system, the speech synthesis voice associated with the user based at least in part on the modification. | 2. The method of claim 1 , further comprising: modifying, by the system, the speech synthesis voice associated with the user based at least in part on the modification. 5. The method of claim 2 , wherein the voicemail is a first voicemail associated with a first user, the method further comprising: receiving, by the system, a second voicemail associated with a second user; identifying, by the system, an identifier of the second user, selecting, by the system, a second speech synthesis voice, wherein the second speech synthesis voice is associated with the identifier of the second user; and modifying, by the system, the second speech synthesis voice associated with the identifier of the second user based at least in part on the association. | 0.674157 |
9,137,296 | 1 | 4 | 1. A method for providing hypertext data through a hypertext server on a portable data carrier for a terminal locally connected to the portable data carrier, comprising the following steps in the portable data carrier: receiving a hypertext query of the terminal by the hypertext server on the locally connected portable data carrier; providing hypertext data relating to the hypertext query through the hypertext server; and sending the provided hypertext data as a hypertext response to the terminal; wherein, upon the providing of the hypertext data, at least one hyperlink contained in the hypertext data is checked and the checked hyperlink is contained in the hypertext response, wherein the hyperlink points to further hypertext data on a background server that are retrievable by the terminal. | 1. A method for providing hypertext data through a hypertext server on a portable data carrier for a terminal locally connected to the portable data carrier, comprising the following steps in the portable data carrier: receiving a hypertext query of the terminal by the hypertext server on the locally connected portable data carrier; providing hypertext data relating to the hypertext query through the hypertext server; and sending the provided hypertext data as a hypertext response to the terminal; wherein, upon the providing of the hypertext data, at least one hyperlink contained in the hypertext data is checked and the checked hyperlink is contained in the hypertext response, wherein the hyperlink points to further hypertext data on a background server that are retrievable by the terminal. 4. The method according to claim 1 , wherein, upon the checking of the hyperlink, the availability of the further hypertext data to which the hyperlink points is checked. | 0.749263 |
5,560,010 | 9 | 10 | 9. The method of claim 1, further comprising the steps of: determining whether an external declaration is a struct, union, or enum declaration; when a struct, union, or enum declaration is identified, determining if the object declarator includes a tag; and generating a warning message when no tag is present. | 9. The method of claim 1, further comprising the steps of: determining whether an external declaration is a struct, union, or enum declaration; when a struct, union, or enum declaration is identified, determining if the object declarator includes a tag; and generating a warning message when no tag is present. 10. The method of claim 9, wherein the step of determining whether an external declaration is a struct, union, or enum declaration comprises determining whether the data-type identifiers of the external declaration include a STRUCT, UNION, or ENUM type-specifier. | 0.5 |
7,617,222 | 4 | 5 | 4. The method of claim 1 , wherein the data structure of the first computer is different than the corresponding data structure in the second computer, the metadata representing the differences in the data structures. | 4. The method of claim 1 , wherein the data structure of the first computer is different than the corresponding data structure in the second computer, the metadata representing the differences in the data structures. 5. The method of claim 4 , wherein the first computer has a hierarchical file structure, and the second computer has a hierarchical file structure. | 0.519608 |
8,898,583 | 1 | 3 | 1. A method for providing contextual information regarding semantic entities included in a page of content, the method comprising: displaying, on a display device, to a user a web page of content including one or more semantic entities and having an interface behavior; identifying, by a processor, a first word and a second word included in the web page of content as comprising a semantic entity based on the search frequency of a first word and a second word in combination, wherein the identifying further includes one of (1) determining a local context to determine the boundary of the semantic entity, or (2) determining an evaluation of the capitalization of words in the web page of content; receiving input from the user indicating a desire to receive contextual information regarding the identified one or more semantic entity; entering a contextual mode and automatically suspending the interface behavior of the web page of content; receiving contextual information associated with the identified semantic entity; and displaying to the user the received contextual information. | 1. A method for providing contextual information regarding semantic entities included in a page of content, the method comprising: displaying, on a display device, to a user a web page of content including one or more semantic entities and having an interface behavior; identifying, by a processor, a first word and a second word included in the web page of content as comprising a semantic entity based on the search frequency of a first word and a second word in combination, wherein the identifying further includes one of (1) determining a local context to determine the boundary of the semantic entity, or (2) determining an evaluation of the capitalization of words in the web page of content; receiving input from the user indicating a desire to receive contextual information regarding the identified one or more semantic entity; entering a contextual mode and automatically suspending the interface behavior of the web page of content; receiving contextual information associated with the identified semantic entity; and displaying to the user the received contextual information. 3. The method of claim 1 , wherein the received user input is received in the form of touch-screen input. | 0.772727 |
8,484,730 | 1 | 3 | 1. A computer-implemented method for reporting online behavior, at least a portion of the method being performed by a computing device comprising at least one processor, the method comprising: identifying a user account subject to parental monitoring; identifying a plurality of online resources accessed by the user account over a period of time; maintaining a reputation database by collecting, aggregating, and analyzing information about each of the plurality of online resources from user devices within a community; determining a reputation for each of the plurality of online resources, wherein: the reputation indicates a level of security threat; determining the reputation comprises providing information identifying each online resource to an online resource reputation system that maintains reputation information for online resources and receiving, from the online resource reputation system, a reputation score for each online resource; generating an online behavior score for the user account based on the reputation score for each online resource in the plurality of online resources, the online behavior score indicating an overall level of security threat posed by online activity on the user account; reporting the online behavior score to a predetermined contact associated with the user account. | 1. A computer-implemented method for reporting online behavior, at least a portion of the method being performed by a computing device comprising at least one processor, the method comprising: identifying a user account subject to parental monitoring; identifying a plurality of online resources accessed by the user account over a period of time; maintaining a reputation database by collecting, aggregating, and analyzing information about each of the plurality of online resources from user devices within a community; determining a reputation for each of the plurality of online resources, wherein: the reputation indicates a level of security threat; determining the reputation comprises providing information identifying each online resource to an online resource reputation system that maintains reputation information for online resources and receiving, from the online resource reputation system, a reputation score for each online resource; generating an online behavior score for the user account based on the reputation score for each online resource in the plurality of online resources, the online behavior score indicating an overall level of security threat posed by online activity on the user account; reporting the online behavior score to a predetermined contact associated with the user account. 3. The method according to claim 1 , wherein generating the online behavior score for the user account based on the reputation score for each online resource in the plurality of online resources comprises: identifying a reputation threshold; determining whether any reputation included within the reputations for each of the plurality of online resources achieves the reputation threshold. | 0.573465 |
9,256,406 | 9 | 14 | 9. A non-transitory computer-readable medium storing instructions, the instructions comprising: one or more instructions that, when executed by one or more processors of a computing device, cause the one or more processors to: select an identifier included in program code, the identifier being a portion of the program code, the program code being embedded in a graphical model, the program code including a C-function; determine an association between the identifier and an entity that the identifier references, the association being a binding between the identifier and the entity, the association being valid for a particular lexicographical scope, the particular lexicographical scope being portions of the program code for which the association is valid and portions of the graphical model for which the association is valid, the entity being referenceable at a program code location of the identifier, where the one or more processors, when determining the association between the identifier and the entity, are further to: determine one or more entities of the C-function that are referenceable at the program code location of the identifier, determine a lexical scope within the C-function for the one or more entities of the C-function, and select, as the entity, one of the one or more entities of the C-function that are referenceable at the program code location of the identifier based on the lexical scope of the one or more entities of the C-function; and utilize the entity that the identifier references based on determining the association between the identifier and the entity. | 9. A non-transitory computer-readable medium storing instructions, the instructions comprising: one or more instructions that, when executed by one or more processors of a computing device, cause the one or more processors to: select an identifier included in program code, the identifier being a portion of the program code, the program code being embedded in a graphical model, the program code including a C-function; determine an association between the identifier and an entity that the identifier references, the association being a binding between the identifier and the entity, the association being valid for a particular lexicographical scope, the particular lexicographical scope being portions of the program code for which the association is valid and portions of the graphical model for which the association is valid, the entity being referenceable at a program code location of the identifier, where the one or more processors, when determining the association between the identifier and the entity, are further to: determine one or more entities of the C-function that are referenceable at the program code location of the identifier, determine a lexical scope within the C-function for the one or more entities of the C-function, and select, as the entity, one of the one or more entities of the C-function that are referenceable at the program code location of the identifier based on the lexical scope of the one or more entities of the C-function; and utilize the entity that the identifier references based on determining the association between the identifier and the entity. 14. The non-transitory computer-readable medium of claim 9 , where the one or more instructions, that cause the one or more processors to determine the association between the identifier and the entity, further cause the one or more processors to: identify a set of entities for the graphical model and the program code; determine a set of lexicographical scopes for the set of entities; remove, from the set of entities, one or more entities for which a corresponding lexicographical scope of the set of lexicographical scopes does not include the identifier, a remaining set of entities of the set of entities being one or more entities for which the corresponding lexicographical scope does include the identifier; determine that a particular entity, of the remaining set of entities, is identified by the identifier; and select the particular entity as the entity. | 0.615589 |
8,688,514 | 19 | 25 | 19. A computer storage medium 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: deriving image keywords from images associated with a user; receiving a request for an ad to be presented to the user; for a collection of ads, identifying one or more candidate ads for presentation to the user, wherein identifying the one or more candidate ads includes scoring each candidate ad based at least in part on a degree of match between the respective ad and the image keywords; selecting an ad responsive to the ad request from the candidate ads based on the scores; and sending the selected ad for presentation to the user. | 19. A computer storage medium 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: deriving image keywords from images associated with a user; receiving a request for an ad to be presented to the user; for a collection of ads, identifying one or more candidate ads for presentation to the user, wherein identifying the one or more candidate ads includes scoring each candidate ad based at least in part on a degree of match between the respective ad and the image keywords; selecting an ad responsive to the ad request from the candidate ads based on the scores; and sending the selected ad for presentation to the user. 25. The computer storage medium of claim 19 , where each image keyword is associated with a scoring weight for scoring the respective image keywords relative to the ads in the collection of ads and where the weight decreases according to age of the image keyword. | 0.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.