patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
1
|
|---|---|---|---|---|---|
8,930,337 | 32 | 34 | 32. A computer-readable storage device storing a computer program for presenting visual feedback in an interface, the computer program including instructions for causing a computer to carry out operations including: receiving one or more mapped relationships between a given output and one or more inputs represented by input variables, at least one of the mapped relationships including a transformational expression executable on a data processing system, the transformational expression defining an output of a mapped relationship based on at least one input variable mapped to an element of an input dataset; receiving identification of elements of an output dataset mapped to outputs of respective mapped relationships; generating output data from the data processing system according to the transformational expression based on input data from the input dataset associated with the element of the input dataset mapped to the input variable, including applying the transformational expressions to input values in respective fields of input records of the input dataset and storing output values in respective fields of output records of the output dataset, including executing a dataflow graph including nodes representing data processing components, links representing data flows between the data processing components, a node representing the input dataset providing a data flow of the input records, and a node representing the output dataset receiving a data flow of the output records; determining validation information in response to the generated output data based on validation criteria defining one or more characteristics of valid values associated with one or more of the identified elements of the output dataset; and presenting in the interface visual feedback based on the determined validation information. | 32. A computer-readable storage device storing a computer program for presenting visual feedback in an interface, the computer program including instructions for causing a computer to carry out operations including: receiving one or more mapped relationships between a given output and one or more inputs represented by input variables, at least one of the mapped relationships including a transformational expression executable on a data processing system, the transformational expression defining an output of a mapped relationship based on at least one input variable mapped to an element of an input dataset; receiving identification of elements of an output dataset mapped to outputs of respective mapped relationships; generating output data from the data processing system according to the transformational expression based on input data from the input dataset associated with the element of the input dataset mapped to the input variable, including applying the transformational expressions to input values in respective fields of input records of the input dataset and storing output values in respective fields of output records of the output dataset, including executing a dataflow graph including nodes representing data processing components, links representing data flows between the data processing components, a node representing the input dataset providing a data flow of the input records, and a node representing the output dataset receiving a data flow of the output records; determining validation information in response to the generated output data based on validation criteria defining one or more characteristics of valid values associated with one or more of the identified elements of the output dataset; and presenting in the interface visual feedback based on the determined validation information. 34. The computer readable storage device of claim 32 , wherein determining the validation information includes retrieving a stored specification of the validation criteria. | 0.854975 |
9,852,769 | 9 | 10 | 9. A method for media editing, the method comprising: building, on a video editor, a media query including a query parameter selected by a user of the video editor; associating, on the video editor, the media query with a dynamic content slot of a media program; transmitting, to a cloud analytics service, the media query with a request for the cloud analytics service to push the query parameter and an acceptance policy of the video editor to multiple mobile computing devices; receiving, on the video editor, query results from the cloud analytics service in response to the media query, the query results identifying a media clip produced by one or more of the mobile computing devices; presenting a user interface including the query results for selection by the user; and generating, on the video editor and contemporaneously with receiving the query results, a video output based on the media program, by replacing the dynamic content slot with the media clip identified in the query results as the video output is transmitted to a video device of a video consumer. | 9. A method for media editing, the method comprising: building, on a video editor, a media query including a query parameter selected by a user of the video editor; associating, on the video editor, the media query with a dynamic content slot of a media program; transmitting, to a cloud analytics service, the media query with a request for the cloud analytics service to push the query parameter and an acceptance policy of the video editor to multiple mobile computing devices; receiving, on the video editor, query results from the cloud analytics service in response to the media query, the query results identifying a media clip produced by one or more of the mobile computing devices; presenting a user interface including the query results for selection by the user; and generating, on the video editor and contemporaneously with receiving the query results, a video output based on the media program, by replacing the dynamic content slot with the media clip identified in the query results as the video output is transmitted to a video device of a video consumer. 10. The method of claim 9 , wherein generating the video output comprises receiving a user selection of a selected media clip identified in the query results and generating the video output including the selected media clip inserted in the dynamic content slot. | 0.750954 |
10,002,159 | 14 | 18 | 14. A non-transitory computer readable medium having stored thereon instructions for translating user keywords into semantic queries the instructions comprising executable code which, when executed by at least one processor, causes the processor to: receive keywords; search the conceptual model to identify one or more concepts relevant to the keywords; transform at least a portion of the conceptual model into a connected graph; generate at least one path through the connected graph, the at least one path connecting the one or more concepts; identify and rank facets that support incremental user navigation from nodes of convergence in the at least one path, wherein the facets are generated at least in part by indexing a number of distinct values for attributes of the one or more concepts; generate at least one structured semantic query from the at least one path with the identified and ranked facets; and execute the at least one structure semantic query on a semantic repository. | 14. A non-transitory computer readable medium having stored thereon instructions for translating user keywords into semantic queries the instructions comprising executable code which, when executed by at least one processor, causes the processor to: receive keywords; search the conceptual model to identify one or more concepts relevant to the keywords; transform at least a portion of the conceptual model into a connected graph; generate at least one path through the connected graph, the at least one path connecting the one or more concepts; identify and rank facets that support incremental user navigation from nodes of convergence in the at least one path, wherein the facets are generated at least in part by indexing a number of distinct values for attributes of the one or more concepts; generate at least one structured semantic query from the at least one path with the identified and ranked facets; and execute the at least one structure semantic query on a semantic repository. 18. The non-transitory computer readable medium of claim 14 , wherein each of the at least one paths is ranked based on a number of hops or edges in the path. | 0.908353 |
8,015,016 | 1 | 5 | 1. An automatic speech translation system, the system comprising: a speech recognizer configured to extract speech features from an input speech signal in a first language and to form an input language table, the input language table including an input sentence template selected by the speech recognizer from a set of sentence templates, a word class of the input sentence template, and tags showing whether each sentence element of the input sentence template is identified in the extracted speech features, the input sentence template being one of the set of sentence templates that is most closely corresponding to the input speech signal and composed of sentence elements having corresponding sentence elements in a second language; a language translator configured to receive the input language table from the speech recognizer, and to generate a translated language table corresponding to the input language table, wherein the translated language table includes a translated sentence template corresponding to the input sentence template and a translated word corresponding to a word in the word class, and the translated sentence template is composed of the corresponding sentence elements in the second language and; a speech synthesizer configured to synthesize an output speech signal based on prosody data corresponding to the translated sentence template. | 1. An automatic speech translation system, the system comprising: a speech recognizer configured to extract speech features from an input speech signal in a first language and to form an input language table, the input language table including an input sentence template selected by the speech recognizer from a set of sentence templates, a word class of the input sentence template, and tags showing whether each sentence element of the input sentence template is identified in the extracted speech features, the input sentence template being one of the set of sentence templates that is most closely corresponding to the input speech signal and composed of sentence elements having corresponding sentence elements in a second language; a language translator configured to receive the input language table from the speech recognizer, and to generate a translated language table corresponding to the input language table, wherein the translated language table includes a translated sentence template corresponding to the input sentence template and a translated word corresponding to a word in the word class, and the translated sentence template is composed of the corresponding sentence elements in the second language and; a speech synthesizer configured to synthesize an output speech signal based on prosody data corresponding to the translated sentence template. 5. The system according to claim 1 , wherein the speech synthesizer comprises: a sentence template prosody data extracting part arranged for extracting the prosody data with respect to the translated sentence template from a sentence template prosody data dictionary, the sentence template prosody data dictionary including the prosody data corresponding to the translated sentence template; and a speech signal synthesizing part arranged for synthesizing the output speech signal based on the prosody data and a synthetic speech database. | 0.576923 |
8,910,137 | 9 | 10 | 9. The computer program product of claim 6 , said creating comprising: said processor concluding the composed source code with the call invoking the original library call. | 9. The computer program product of claim 6 , said creating comprising: said processor concluding the composed source code with the call invoking the original library call. 10. The computer program product of claim 9 , wherein the sentence S of said at least one basic idiom is selected from a group consisting of {S1, S1 ‘
’ S2, c? S1:S2}, wherein S1 is a first instance of S, wherein S2 is a second instance of S, wherein both S1 and S2 is selected from a group consisting of {l1, l2, l3, l4, l5, l6}, wherein ‘
’ is a line feed character, wherein “c? S1:S2” represents a conditional statement of “if c then S1 else S2”, wherein c results in a Boolean truth value selected from {True, False}, wherein a first literal l1 of said at least one basic idiom is defined as “W void* size pos argno”, wherein a second literal l2 of said at least one basic idiom is defined as “R void* size pos argno”, wherein a third literal l3 of said at least one basic idiom is defined as “RW FILE* argno”, wherein a fourth literal l4 of said at least one basic idiom is defined as “R Scalar argno”, wherein a fifth literal l5 of said at least one basic idiom is defined as “W scalar argno”, wherein a sixth literal l6 of said at least one basic idiom is defined as “RW int* argno”. | 0.735822 |
8,560,974 | 1 | 2 | 1. A method, comprising: displaying, at a touch-sensitive display, a plurality of characters, each of the characters being a character in a language script; receiving, at the touch-sensitive display, a touch selection for a first character from the plurality of characters, the touch selection being received at a location on the touch-sensitive display at which the first character is displayed; and in response to receiving the touch selection: during a gesture input associated with the touch selection for the first character, precluding a touch selection for each other character from the plurality of characters displayed in the touch-sensitive display; detecting at least a portion of the gesture input at a second, different location on the touch sensitive display, and wherein a portion of the gesture input overlaps a location of the touch-sensitive display at which the first character is displayed during the gesture input; accessing data associating gesture inputs with respective diacritic markers; selecting a diacritic marker based at least in part on the association of gesture inputs with respective diacritic markers, wherein the respective diacritic markers are not displayed during the gesture input and the selected diacritic marker is the diacritic marker associated with the gesture input for which a portion is detected at the second, different location; and displaying, at the touch-sensitive display, an updated representation of the first character based at least in part on the selected diacritic marker. | 1. A method, comprising: displaying, at a touch-sensitive display, a plurality of characters, each of the characters being a character in a language script; receiving, at the touch-sensitive display, a touch selection for a first character from the plurality of characters, the touch selection being received at a location on the touch-sensitive display at which the first character is displayed; and in response to receiving the touch selection: during a gesture input associated with the touch selection for the first character, precluding a touch selection for each other character from the plurality of characters displayed in the touch-sensitive display; detecting at least a portion of the gesture input at a second, different location on the touch sensitive display, and wherein a portion of the gesture input overlaps a location of the touch-sensitive display at which the first character is displayed during the gesture input; accessing data associating gesture inputs with respective diacritic markers; selecting a diacritic marker based at least in part on the association of gesture inputs with respective diacritic markers, wherein the respective diacritic markers are not displayed during the gesture input and the selected diacritic marker is the diacritic marker associated with the gesture input for which a portion is detected at the second, different location; and displaying, at the touch-sensitive display, an updated representation of the first character based at least in part on the selected diacritic marker. 2. The method of claim 1 , further comprising determining that the gesture input is associated with the touch selection for the first character while the touch selection is maintained during the gesture input. | 0.897549 |
7,831,437 | 37 | 41 | 37. The system of claim 30 , wherein each categorization entry in the plurality of categorization entries in the outline library further includes a hierarchical framework of information groupings. | 37. The system of claim 30 , wherein each categorization entry in the plurality of categorization entries in the outline library further includes a hierarchical framework of information groupings. 41. The system of claim 37 , wherein, for a categorization entry corresponding to an area of law, one information grouping comprises a case law grouping, the case law grouping including a pointer structure corresponding to stored burdens of proof relating to the area of law. | 0.854497 |
6,064,817 | 16 | 17 | 16. An article of manufacture comprising a computer program carrier readable by a computer and embodying one or more instructions executable by the computer to perform method steps of programming a computer, the method comprising the steps of: providing a data declaration extension syntax, wherein the syntax comprises use of DATE-FORMAT to identify the data declaration extension to a compiler and provides keywords for identifying one of a plurality of windowing techniques and provides fields for specifying ranges of years; receiving a series of programming language statements comprising a source program into a memory of the computer, wherein at least one of the received statements comprises a data declaration extension requesting a Year 2000 solution selected from a plurality of windowing techniques, and wherein the data declaration extension is in a format of the provided data declaration extension syntax; and compiling the source program into an object program in the memory of the computer, wherein the object program includes instructions for processing and/or invoking the Year 2000 solution requested in the data declaration. | 16. An article of manufacture comprising a computer program carrier readable by a computer and embodying one or more instructions executable by the computer to perform method steps of programming a computer, the method comprising the steps of: providing a data declaration extension syntax, wherein the syntax comprises use of DATE-FORMAT to identify the data declaration extension to a compiler and provides keywords for identifying one of a plurality of windowing techniques and provides fields for specifying ranges of years; receiving a series of programming language statements comprising a source program into a memory of the computer, wherein at least one of the received statements comprises a data declaration extension requesting a Year 2000 solution selected from a plurality of windowing techniques, and wherein the data declaration extension is in a format of the provided data declaration extension syntax; and compiling the source program into an object program in the memory of the computer, wherein the object program includes instructions for processing and/or invoking the Year 2000 solution requested in the data declaration. 17. An article as recited in claim 16, further comprising the steps of: (a) identifying data declaration statements relating to year values in date fields of the source program; and (b) modifying at least one identified data declaration statement to add an extension requesting a Year 2000 solution to be applied to the year value associated with the statement; and wherein said step of receiving comprises storing the modified data declaration statement in the memory of the computer. | 0.644428 |
9,509,528 | 3 | 4 | 3. The method of claim 2 , further comprising disabling a determination of one of the social collaborative criterion. | 3. The method of claim 2 , further comprising disabling a determination of one of the social collaborative criterion. 4. The method of claim 3 , wherein a determination of a pre-determined set of the social collaborative criterion is disabled, and the set being associated with an organizational position of the recipient of the message. | 0.891153 |
9,467,718 | 3 | 9 | 3. The method of claim 2 , further comprising: generating a conversation video from the member dialogue video and the other received member dialogue videos, wherein the conversation video serially presents the plurality of member dialogue videos in an order based on an order of the associated anchor points in the modified thematic content event so that the conversation video emulates a conversation about the thematic content event between community members. | 3. The method of claim 2 , further comprising: generating a conversation video from the member dialogue video and the other received member dialogue videos, wherein the conversation video serially presents the plurality of member dialogue videos in an order based on an order of the associated anchor points in the modified thematic content event so that the conversation video emulates a conversation about the thematic content event between community members. 9. The method of claim 3 , further comprising: selecting a video portion of the thematic content event that is associated with the anchor point; and adding the video portion of the thematic content event into the conversation video, wherein the selected video portion of the thematic content event resides in the conversation video in proximity to the member dialogue video that is associated with the anchor point, and wherein the video portion of the thematic content event is presented concurrently with the member dialogue video. | 0.90892 |
6,122,658 | 13 | 14 | 13. In a client computer having a processor, memory and a display device, a method of providing customized information to be displayed on said display device for an end user, the method comprising: receiving customized information produced in a server that comprises an integrated combination of global content and local content retrieved by the server, the local content associated with the end user; and displaying the customized information on the display device for the end user. | 13. In a client computer having a processor, memory and a display device, a method of providing customized information to be displayed on said display device for an end user, the method comprising: receiving customized information produced in a server that comprises an integrated combination of global content and local content retrieved by the server, the local content associated with the end user; and displaying the customized information on the display device for the end user. 14. The method of claim 13 wherein the global content is retrieved from a global server over the computer network, and local content is retrieved from a local database associated with a local server, and wherein the global server, the local server and the client computer coupled to a computer network. | 0.575843 |
8,924,214 | 13 | 14 | 13. A speech detection and recognition system, comprising: one or more radar sensors supporting a plurality of simultaneous diverse wavelengths configured to remotely detect body motions from a speaker during vocalization and to extract Doppler signals correlated with the speaker vocalization, wherein the body motions comprise small vibrational displacements and articulator motions; one or more radar digital signal processors, connected to the radar sensors, and configured to develop feature vectors utilizing the vocalization Doppler signals; and one or more radar word classifiers configured to recognize words associated with the feature vectors. | 13. A speech detection and recognition system, comprising: one or more radar sensors supporting a plurality of simultaneous diverse wavelengths configured to remotely detect body motions from a speaker during vocalization and to extract Doppler signals correlated with the speaker vocalization, wherein the body motions comprise small vibrational displacements and articulator motions; one or more radar digital signal processors, connected to the radar sensors, and configured to develop feature vectors utilizing the vocalization Doppler signals; and one or more radar word classifiers configured to recognize words associated with the feature vectors. 14. The system of claim 13 , wherein the radar sensors further comprise: a transmit aperture connected to the radar sensor configured to transmit one or more waveforms towards a speaker during vocalization, each of the waveforms having a distinct wavelength; and a receiver aperture connected to the radar sensor configured to receive scattered radio frequency energy generated by the body motions from the speaker. | 0.701009 |
9,454,706 | 14 | 15 | 14. The system of claim 9 , wherein the fuzzy models are generated based on directional features obtained from training samples of handwritten Arabic like alphanumeric characters. | 14. The system of claim 9 , wherein the fuzzy models are generated based on directional features obtained from training samples of handwritten Arabic like alphanumeric characters. 15. The system of claim 14 , wherein the training samples are obtained from a plurality of different users. | 0.963924 |
7,788,099 | 1 | 3 | 1. A computer implemented method for multimodal cross-vocabulary mapping, the computer implemented method comprising: annotating a corpus of multimodal content simultaneously using annotations from a plurality of vocabularies to form a set of common annotations; identifying relationships between a first vocabulary associated with a first modality and a second vocabulary associated with a second modality using the set of common annotations to form a multimodal vocabulary mapping; and mapping with a computing device items in the first vocabulary associated with the first modality to items in the second vocabulary associated with the second modality using the multimodal vocabulary mapping. | 1. A computer implemented method for multimodal cross-vocabulary mapping, the computer implemented method comprising: annotating a corpus of multimodal content simultaneously using annotations from a plurality of vocabularies to form a set of common annotations; identifying relationships between a first vocabulary associated with a first modality and a second vocabulary associated with a second modality using the set of common annotations to form a multimodal vocabulary mapping; and mapping with a computing device items in the first vocabulary associated with the first modality to items in the second vocabulary associated with the second modality using the multimodal vocabulary mapping. 3. The computer implemented method of claim 1 wherein each vocabulary in the plurality of vocabularies is associated with a different modality in the corpus of multimodal content, and wherein two or more different modalities are associated with the corpus of multimodal content. | 0.828395 |
7,958,103 | 19 | 21 | 19. A computer system, comprising: a processor configured to receive one or more search criteria and an indication that a search result based content associated with the search criteria is to be included in a web page; and generate automatically for the web page a computer script or code configured to enable the search result based content to be retrieved in accordance with the search criteria; wherein the search result based content includes content from pages that: 1) satisfy the search criteria, 2) are associated with a natural language with which the web page is associated, and 3) match a life cycle state of the web page, wherein the life cycle state describes a stage in a content management system approval process; wherein the natural language comprises a primary natural language associated with the web page; wherein to generate automatically includes inserting in the search result based content a specific content from a specific page that satisfies: 1) the search criteria and 2) is associated with a secondary or default natural language associated with the web page, in the event a corresponding page associated with the primary natural language is not found; and a storage configured to store one or more of the search criteria and the computer script or code. | 19. A computer system, comprising: a processor configured to receive one or more search criteria and an indication that a search result based content associated with the search criteria is to be included in a web page; and generate automatically for the web page a computer script or code configured to enable the search result based content to be retrieved in accordance with the search criteria; wherein the search result based content includes content from pages that: 1) satisfy the search criteria, 2) are associated with a natural language with which the web page is associated, and 3) match a life cycle state of the web page, wherein the life cycle state describes a stage in a content management system approval process; wherein the natural language comprises a primary natural language associated with the web page; wherein to generate automatically includes inserting in the search result based content a specific content from a specific page that satisfies: 1) the search criteria and 2) is associated with a secondary or default natural language associated with the web page, in the event a corresponding page associated with the primary natural language is not found; and a storage configured to store one or more of the search criteria and the computer script or code. 21. A computer system as recited in claim 19 , wherein the processor is further configured to display in a web page design interface during design of the web page a current version of the search result based content determined by using the search criteria to perform a search. | 0.577982 |
8,396,885 | 1 | 5 | 1. A computer-implemented method, comprising: identifying one or more unique tokens and bi-grams within a clustered set of search queries, the unique tokens having corresponding lengths that exceed a first threshold value; computing, using at least one processor, edit distances for a subset of the identified tokens and bi-grams, the subset comprising tokens or bi-grams within unit length of each other token or bi-gram in the subset; and determining, using the at least one processor, that a least-frequent token or bi-gram in the subset is misspelled, when the edit distance for the least-frequent token or bi-gram falls below a second threshold value. | 1. A computer-implemented method, comprising: identifying one or more unique tokens and bi-grams within a clustered set of search queries, the unique tokens having corresponding lengths that exceed a first threshold value; computing, using at least one processor, edit distances for a subset of the identified tokens and bi-grams, the subset comprising tokens or bi-grams within unit length of each other token or bi-gram in the subset; and determining, using the at least one processor, that a least-frequent token or bi-gram in the subset is misspelled, when the edit distance for the least-frequent token or bi-gram falls below a second threshold value. 5. The method of claim 1 , further comprising: processing a log of a search engine to obtain records related to previous search queries and click data; grouping the records to generate one or more sets of suggested search queries; and identifying the clustered set of search queries based on at least one of a frequency, a click count, or a sponsored click count associated with the sets of suggested search queries. | 0.636364 |
9,661,365 | 5 | 6 | 5. The system of claim 1 , wherein the computer program code is further designed to cause the one or more processors to: communicate an advertisement to a user with the media content. | 5. The system of claim 1 , wherein the computer program code is further designed to cause the one or more processors to: communicate an advertisement to a user with the media content. 6. The system of claim 5 , wherein the computer program code is further designed to cause the one or more processors to: select the advertisement based at least in part upon the respective profile of the user. | 0.9372 |
8,984,051 | 11 | 12 | 11. One or more computing devices for communicating feed information to one or more recipients, the one or more computing devices comprising: at least one storage medium storing instructions; at least one processor capable of executing the instructions to cause the one or more computing devices to: receive, via a user interface for accessing a social networking system, an identification of one or more first recipients to whom to communicate an information update configured to be published to an information feed of the social networking system, the information feed capable of being displayed on a display device; receive, via the user interface, a first indicator in addition to the identification of the one or more first recipients; identify the first indicator as a request to communicate the information update to one or more recipients in addition to the one or more first recipients; automatically cause identification of one or more second recipients responsive to identifying the first indicator, the identification of the one or more second recipients based on the one or more first recipients, the identification of the one or more second recipients comprising: determining that an entity satisfies a relevance measure associated with the first indicator, the determination based on performance of one or more operations and application of weighting information in relation to the one or more operations to indicate a degree of relevance between the entity and a first recipient, and selecting the entity to be included in the one or more second recipients; identify a second indicator as a request to not communicate the information update to one or more potential recipients; automatically cause identification of one or more potential third recipients based on the second indicator, the one or more potential third recipients being excluded from having access to the information update; and provide the information update for access by the one or more second recipients. | 11. One or more computing devices for communicating feed information to one or more recipients, the one or more computing devices comprising: at least one storage medium storing instructions; at least one processor capable of executing the instructions to cause the one or more computing devices to: receive, via a user interface for accessing a social networking system, an identification of one or more first recipients to whom to communicate an information update configured to be published to an information feed of the social networking system, the information feed capable of being displayed on a display device; receive, via the user interface, a first indicator in addition to the identification of the one or more first recipients; identify the first indicator as a request to communicate the information update to one or more recipients in addition to the one or more first recipients; automatically cause identification of one or more second recipients responsive to identifying the first indicator, the identification of the one or more second recipients based on the one or more first recipients, the identification of the one or more second recipients comprising: determining that an entity satisfies a relevance measure associated with the first indicator, the determination based on performance of one or more operations and application of weighting information in relation to the one or more operations to indicate a degree of relevance between the entity and a first recipient, and selecting the entity to be included in the one or more second recipients; identify a second indicator as a request to not communicate the information update to one or more potential recipients; automatically cause identification of one or more potential third recipients based on the second indicator, the one or more potential third recipients being excluded from having access to the information update; and provide the information update for access by the one or more second recipients. 12. The one or more computing devices of claim 11 , wherein the operations include: determine whether the one or more first recipients follows the entity, determine whether the entity follows the one or more first recipients, determine whether the entity and the one or more first recipients are included in a group, determine a relationship between the one or more first recipients and the entity in an organization, determine whether profile information of the one or more first recipients includes information associated with the entity, and determine whether historical information of the one or more first recipients is associated with the entity. | 0.500766 |
8,799,265 | 54 | 55 | 54. A method of providing combined search engine results, the method comprising: enabling a user to enter user-defined search query parameters through a first search engine system and interface; executing a search against the contents of a first content database using the user-defined search query parameters, to return a first results set; passing the user-defined search query parameters from the first search engine system to at least one additional separate search engine system and executing searches against the content databases of said additional separate search engine systems to return at least one additional results set, based on a user selection of one or more of a plurality of pre-determined semantic definitions stored in association with the search query parameters and iteratively presented to the user; returning the additional results sets to the first search engine system, the additional results sets including one of a plurality of electronic documents; combining the first results set and the additional results sets for display to the user as a single end search result; and updating or creating content association records, based on the user selection of the one or more pre-determined semantic definitions, which associate the selected one or more of the pre-determined semantic definitions for the user-defined search query parameters and selected one of the plurality of electronic documents; updating or creating term association records, based on the use of search engine system by enabling the user to select pre-determined semantic definitions for association with the user-defined search query parameters; and wherein the content association records created or updated are subsequently searched using user-defined search query parameters to locate at least one electronic document previously catalogued as containing the one or more user-defined search query parameters in association with the selected pre-determined semantic definitions to deliver a subsequent results set. | 54. A method of providing combined search engine results, the method comprising: enabling a user to enter user-defined search query parameters through a first search engine system and interface; executing a search against the contents of a first content database using the user-defined search query parameters, to return a first results set; passing the user-defined search query parameters from the first search engine system to at least one additional separate search engine system and executing searches against the content databases of said additional separate search engine systems to return at least one additional results set, based on a user selection of one or more of a plurality of pre-determined semantic definitions stored in association with the search query parameters and iteratively presented to the user; returning the additional results sets to the first search engine system, the additional results sets including one of a plurality of electronic documents; combining the first results set and the additional results sets for display to the user as a single end search result; and updating or creating content association records, based on the user selection of the one or more pre-determined semantic definitions, which associate the selected one or more of the pre-determined semantic definitions for the user-defined search query parameters and selected one of the plurality of electronic documents; updating or creating term association records, based on the use of search engine system by enabling the user to select pre-determined semantic definitions for association with the user-defined search query parameters; and wherein the content association records created or updated are subsequently searched using user-defined search query parameters to locate at least one electronic document previously catalogued as containing the one or more user-defined search query parameters in association with the selected pre-determined semantic definitions to deliver a subsequent results set. 55. The method of claim 54 further comprising reordering the single end search result before display to the user. | 0.946948 |
7,895,144 | 14 | 19 | 14. A computing system comprising a processor coupled to a computer-readable memory unit, said memory unit comprising instructions that when executed by the processor implement a risk assessment method, said method comprising: receiving, by an inference engine within said computing system, first sensor cohort data associated with a first cohort, said first cohort located within a pre/post security area within an airport; receiving, by said inference engine, first group technology inferences associated with said first cohort; generating, by said inference engine, first risk cohort inferences, said generating said first risk cohort inferences based on said first group technology inferences and said first sensor cohort data; receiving, by said inference engine, first inference data generated by said inference engine, said first inference data comprising a first plurality of inferences associated with said first cohort and a security perimeter surrounding said airport; receiving, by said inference engine, second inference data generated by said inference engine, said second inference data comprising a second of plurality of inferences associated with said first cohort and said pre/post security area within said airport; generating, by said inference engine, third inference data, said third inference data comprising a third plurality of inferences associated with said first cohort and said pre/post security area within said airport, wherein said generating said third inference data is based on said first risk cohort inferences, said first inference data, and said second inference data; generating, by said inference engine based on said third inference data, a first associated risk level score for said first cohort; and storing, by said computing system, said third inference data and said first associated risk level score. | 14. A computing system comprising a processor coupled to a computer-readable memory unit, said memory unit comprising instructions that when executed by the processor implement a risk assessment method, said method comprising: receiving, by an inference engine within said computing system, first sensor cohort data associated with a first cohort, said first cohort located within a pre/post security area within an airport; receiving, by said inference engine, first group technology inferences associated with said first cohort; generating, by said inference engine, first risk cohort inferences, said generating said first risk cohort inferences based on said first group technology inferences and said first sensor cohort data; receiving, by said inference engine, first inference data generated by said inference engine, said first inference data comprising a first plurality of inferences associated with said first cohort and a security perimeter surrounding said airport; receiving, by said inference engine, second inference data generated by said inference engine, said second inference data comprising a second of plurality of inferences associated with said first cohort and said pre/post security area within said airport; generating, by said inference engine, third inference data, said third inference data comprising a third plurality of inferences associated with said first cohort and said pre/post security area within said airport, wherein said generating said third inference data is based on said first risk cohort inferences, said first inference data, and said second inference data; generating, by said inference engine based on said third inference data, a first associated risk level score for said first cohort; and storing, by said computing system, said third inference data and said first associated risk level score. 19. The computing system of claim 14 , wherein said method further comprises: presenting, by said computing system, said third inference data and said first associated risk level score. | 0.932135 |
7,881,924 | 1 | 32 | 1. A method of computer analysis of at least one communication originated from a person comprising: receiving with a computer the at least one communication with each communication being comprised of a group of words originated by the person; processing a text of the received group of words in each of the received at least one communication with a computer to determine a psychological state of the person represented by the text of the group of words in each of the at least one communication; and in response to the determined psychological state, generating with a computer an output communication providing an assessment of risk posed by the determined psychological state of the person represented by the text of the group of words in each of the at least one communication. | 1. A method of computer analysis of at least one communication originated from a person comprising: receiving with a computer the at least one communication with each communication being comprised of a group of words originated by the person; processing a text of the received group of words in each of the received at least one communication with a computer to determine a psychological state of the person represented by the text of the group of words in each of the at least one communication; and in response to the determined psychological state, generating with a computer an output communication providing an assessment of risk posed by the determined psychological state of the person represented by the text of the group of words in each of the at least one communication. 32. A method in accordance with claim 1 wherein: processing the text with the computer comprises identifying categories of information therein; and further comprising quantifying information in each of the categories and determining the psychological state of the person from the quantified information. | 0.52057 |
8,266,514 | 14 | 15 | 14. A system as described in claim 13 , wherein the particular said linguistic service is configured to recognize linguistic property information associated with the text. | 14. A system as described in claim 13 , wherein the particular said linguistic service is configured to recognize linguistic property information associated with the text. 15. A system as described in claim 14 , wherein the platform receives linguistic property information from the particular said linguistic service and forms a communication that includes the linguistic property information for communication to the application. | 0.87279 |
10,032,071 | 3 | 4 | 3. The method of claim 2 , further comprising filtering the list comprising at least one candidate word prior to the providing. | 3. The method of claim 2 , further comprising filtering the list comprising at least one candidate word prior to the providing. 4. The method of claim 3 , wherein the filtering comprises selecting words included in two or more lists comprising at least one candidate word. | 0.931494 |
8,606,739 | 3 | 4 | 3. The method of claim 1 further comprising steps for, prior to presenting the set of ranked search results on a display device, evaluating the ranked search results corresponding to reformulated query to determine a user satisfaction level from one or more historical user metrics relative to a predetermined threshold, and if the user satisfaction level is below the threshold, performing steps for: evaluating the reformulated query to identify one or more subqueries, each subquery comprised of one or more of the search terms of the reformulated query; evaluating each subquery to select one or more structured data sets from among a plurality of structured data sets from which to retrieve a partial answer corresponding each subquery; for each partial answer retrieved from a selected structured data set, reformulating the previously reformulated query to construct a new reformulated query by replacing the corresponding subquery of the previously reformulated query with the corresponding partial answer; and retrieving a set of ranked search results corresponding to the new reformulated query. | 3. The method of claim 1 further comprising steps for, prior to presenting the set of ranked search results on a display device, evaluating the ranked search results corresponding to reformulated query to determine a user satisfaction level from one or more historical user metrics relative to a predetermined threshold, and if the user satisfaction level is below the threshold, performing steps for: evaluating the reformulated query to identify one or more subqueries, each subquery comprised of one or more of the search terms of the reformulated query; evaluating each subquery to select one or more structured data sets from among a plurality of structured data sets from which to retrieve a partial answer corresponding each subquery; for each partial answer retrieved from a selected structured data set, reformulating the previously reformulated query to construct a new reformulated query by replacing the corresponding subquery of the previously reformulated query with the corresponding partial answer; and retrieving a set of ranked search results corresponding to the new reformulated query. 4. The method of claim 3 wherein the evaluating the ranked search results corresponding to current query to determine the user satisfaction level further comprises evaluating user click through rates (CTR) from historical search logs having entries corresponding to the ranked results to determine the user satisfaction level. | 0.869286 |
8,280,823 | 74 | 76 | 74. The method of claim 69 , wherein the required term of experience is rounded up to a unit of time. | 74. The method of claim 69 , wherein the required term of experience is rounded up to a unit of time. 76. The method of claim 74 , wherein the unit of time is an integer. | 0.984545 |
7,949,941 | 1 | 2 | 1. A method comprising: receiving a request to transform a set of one or more XML documents based at least in part on an XSLT stylesheet that includes calls to one or more transformation templates, wherein each transformation template specifies how to transform one or more nodes, wherein the one or more nodes include a first node and a descendant node of the first node, wherein the calls to the one or more transformation templates, if evaluated based on the XSLT stylesheet, would use an XSLT template matching process to associate the descendant node in the set of one or more XML documents with a transformation template; determining, based at least in part on a structural description that constrains the set of one or more XML documents to a hierarchy of nodes that may be present in the set of one or more XML documents, which one or more transformation templates to use to transform the set of one or more XML documents, wherein the hierarchy of nodes includes the first node and the descendant node; and converting the calls in the XSLT stylesheet that would use the one or more transformation templates into calls to one or more XQuery user-defined functions, and including the calls to the one or more XQuery user-defined functions in a set of one or more XQuery language expressions; wherein the calls to the one or more XQuery user-defined functions do not use the XSLT template matching process; wherein the method is performed by one or more computing devices. | 1. A method comprising: receiving a request to transform a set of one or more XML documents based at least in part on an XSLT stylesheet that includes calls to one or more transformation templates, wherein each transformation template specifies how to transform one or more nodes, wherein the one or more nodes include a first node and a descendant node of the first node, wherein the calls to the one or more transformation templates, if evaluated based on the XSLT stylesheet, would use an XSLT template matching process to associate the descendant node in the set of one or more XML documents with a transformation template; determining, based at least in part on a structural description that constrains the set of one or more XML documents to a hierarchy of nodes that may be present in the set of one or more XML documents, which one or more transformation templates to use to transform the set of one or more XML documents, wherein the hierarchy of nodes includes the first node and the descendant node; and converting the calls in the XSLT stylesheet that would use the one or more transformation templates into calls to one or more XQuery user-defined functions, and including the calls to the one or more XQuery user-defined functions in a set of one or more XQuery language expressions; wherein the calls to the one or more XQuery user-defined functions do not use the XSLT template matching process; wherein the method is performed by one or more computing devices. 2. The method of claim 1 , further comprising: translating the one or more XQuery language expressions into one or more corresponding SQL database statements; and submitting the one or more database statements to a database server for execution of the one or more database statements. | 0.856566 |
4,028,538 | 1 | 3 | 1. An electronic calculator comprising: keyboard input means including a plurality of keys for entering lines of one or more alphameric statements each into the calculator; buffer storage means, coupled to said keyboard input means, for storing each line of one or more alphameric statements as it is entered into the calculator from said keyboard input means; memory means, coupled to said buffer storage means, for storing lines of one or more alphameric statements each entered into the calculator; processing means, coupled to said keyboard input means, buffer storage means, and memory means, for selectively processing either a line of one or more alphameric statements entered into the calculator and stored in said buffer storage means or lines of one or more alphameric statements stored in said memory means to perform selected functions; and output means, coupled to said buffer storage means and said processing means, for providing an output indication of selected functions performed by the calculator; said keyboard input means including an execute control key for initiating execution of a line of one or more alphameric statements by said processing means, and a store control key for initiating storage of a line of one or more alphameric statements in said memory means; and said processing means being responsive to actuation of said execute control key, following entry of a line of one or more alphameric statements into said buffer storage means, for executing that line of one or more alphameric statements, and being responsive to actuation of said store control key, following entry of a line of one or more alphameric statements into said buffer storage means, for storing that line of one or more alphameric statements in said memory means. | 1. An electronic calculator comprising: keyboard input means including a plurality of keys for entering lines of one or more alphameric statements each into the calculator; buffer storage means, coupled to said keyboard input means, for storing each line of one or more alphameric statements as it is entered into the calculator from said keyboard input means; memory means, coupled to said buffer storage means, for storing lines of one or more alphameric statements each entered into the calculator; processing means, coupled to said keyboard input means, buffer storage means, and memory means, for selectively processing either a line of one or more alphameric statements entered into the calculator and stored in said buffer storage means or lines of one or more alphameric statements stored in said memory means to perform selected functions; and output means, coupled to said buffer storage means and said processing means, for providing an output indication of selected functions performed by the calculator; said keyboard input means including an execute control key for initiating execution of a line of one or more alphameric statements by said processing means, and a store control key for initiating storage of a line of one or more alphameric statements in said memory means; and said processing means being responsive to actuation of said execute control key, following entry of a line of one or more alphameric statements into said buffer storage means, for executing that line of one or more alphameric statements, and being responsive to actuation of said store control key, following entry of a line of one or more alphameric statements into said buffer storage means, for storing that line of one or more alphameric statements in said memory means. 3. An electronic calculator as in claim 1 wherein said output means is operable for visually displaying a line of one or more alphameric statements stored in said buffer storage means. | 0.912961 |
7,734,556 | 1 | 6 | 1. A method for discovering knowledge from a set of text documents using a processor, the method comprising: extracting semi-structured meta-data from the set of text documents using a meta-data extractor, the semi-structured meta-data comprising a plurality of concepts and a plurality of relations between the concepts; filtering the semi-structured meta-data to identify a set of key concepts and a corresponding set of key relations between the key concepts, the set of key concepts corresponding to the plurality of concepts; deriving at least one set of sub-concepts corresponding to the set of key concepts based upon data within a domain knowledge base, using a meta-data transformer; formulating a plurality of training samples, each training sample including a vector representing a sub-concept and a vector representing a key concept; and analyzing the plurality of training samples using an associative discoverer to derive a set of associations between a set of vectors representing a sub-concept and at least one vector representing a key concept, wherein neither the set of text documents nor the semi-structured meta-data mention the set of associations, and wherein the set of associations corresponds to discovered knowledge that is extractable by a knowledge interpreter. | 1. A method for discovering knowledge from a set of text documents using a processor, the method comprising: extracting semi-structured meta-data from the set of text documents using a meta-data extractor, the semi-structured meta-data comprising a plurality of concepts and a plurality of relations between the concepts; filtering the semi-structured meta-data to identify a set of key concepts and a corresponding set of key relations between the key concepts, the set of key concepts corresponding to the plurality of concepts; deriving at least one set of sub-concepts corresponding to the set of key concepts based upon data within a domain knowledge base, using a meta-data transformer; formulating a plurality of training samples, each training sample including a vector representing a sub-concept and a vector representing a key concept; and analyzing the plurality of training samples using an associative discoverer to derive a set of associations between a set of vectors representing a sub-concept and at least one vector representing a key concept, wherein neither the set of text documents nor the semi-structured meta-data mention the set of associations, and wherein the set of associations corresponds to discovered knowledge that is extractable by a knowledge interpreter. 6. The method as in claim 1 , wherein formulating the plurality of training samples comprises formulating concatenated vector representations of the set of sub-concepts and the set of key concepts relating to the corresponding set of key relations. | 0.823864 |
8,818,717 | 1 | 2 | 1. A method for increasing route accuracies, the method comprising: recording a waypoint while moving along a route; recording a positional-accuracy measurement for the recorded waypoint; calculating a position accuracy prediction (PAP) parameter for the recorded waypoint based on the recorded positional-accuracy measurement wherein the PAP parameter comprises a first weight value, a first confidence value, and an-a first error distance; and comparing, with a computer processor, the recorded waypoint and the calculated PAP parameter to a corpus waypoint and an associated corpus PAP parameter stored on a computer-based system, wherein the corpus PAP parameter comprises a second weight value, a second confidence value, and a second error distance, and wherein the comparing step comprises: calculating a weight average based on the first and second weight values; computationally extending the first error distance from the PAP parameter of the recorded waypoint to provide a first probability distribution circle; computationally extending the second error distance from the PAP parameter of the corpus waypoint to provide a second probability distribution circle; and computationally generating a vector line between the recorded waypoint and the corpus waypoint; and determining, with the computer processor, an updated waypoint along the vector line between the recorded waypoint and the corpus waypoint and within an overlapping area of the first and second probability distribution circles based on the calculated weight average. | 1. A method for increasing route accuracies, the method comprising: recording a waypoint while moving along a route; recording a positional-accuracy measurement for the recorded waypoint; calculating a position accuracy prediction (PAP) parameter for the recorded waypoint based on the recorded positional-accuracy measurement wherein the PAP parameter comprises a first weight value, a first confidence value, and an-a first error distance; and comparing, with a computer processor, the recorded waypoint and the calculated PAP parameter to a corpus waypoint and an associated corpus PAP parameter stored on a computer-based system, wherein the corpus PAP parameter comprises a second weight value, a second confidence value, and a second error distance, and wherein the comparing step comprises: calculating a weight average based on the first and second weight values; computationally extending the first error distance from the PAP parameter of the recorded waypoint to provide a first probability distribution circle; computationally extending the second error distance from the PAP parameter of the corpus waypoint to provide a second probability distribution circle; and computationally generating a vector line between the recorded waypoint and the corpus waypoint; and determining, with the computer processor, an updated waypoint along the vector line between the recorded waypoint and the corpus waypoint and within an overlapping area of the first and second probability distribution circles based on the calculated weight average. 2. The method of claim 1 , wherein the recorded waypoint comprises GPS waypoint, and wherein recording the GPS waypoint while moving along the route comprises reading GPS signals with a GPS receiver, and storing data of the GPS waypoint on a portable electronic device that communicates with the GPS receiver. | 0.78951 |
7,987,169 | 42 | 44 | 42. A machine implemented method comprising: receiving by a search engine, from a content searching or consuming application, a search expression having a plurality of recursively embedded sub-expressions, the search engine and the content searching or consuming application being operated on one or more different or same computing devices; receiving a content page nominally associated with the search expression, or access information of the content page, by the search engine; generating in response, by the search engine, one or more scores indicative of relative relevance of a content page or one or more portions of the content page to the search expression, wherein the generating by the search engine comprising recursively generating one or more scores for one or more structures indicative of relative relevance of the content page or one or more portions of the content page to each of the recursively embedded sub-expressions, wherein a structure includes substructures, wherein at least one of the recursively generating is based at least in part on a distance function, and a scoring function, wherein the distance function measures distances between sub-structures within the structure being scored to facilitate determining of mutual relevance of occurrence positions, and wherein the scoring function is positionally sensitive, yielding different scores for at least some different occurrence positions of a search sub-expression in substructures of the structure being scored, irrespective of substructure category memberships; and conditionally providing or not providing the content page or one or more portions of the content page, or access information of the content page or one or more portions of the content page, to the content searching or consuming application, by the search engine, based at least in part on the generated one or more scores. | 42. A machine implemented method comprising: receiving by a search engine, from a content searching or consuming application, a search expression having a plurality of recursively embedded sub-expressions, the search engine and the content searching or consuming application being operated on one or more different or same computing devices; receiving a content page nominally associated with the search expression, or access information of the content page, by the search engine; generating in response, by the search engine, one or more scores indicative of relative relevance of a content page or one or more portions of the content page to the search expression, wherein the generating by the search engine comprising recursively generating one or more scores for one or more structures indicative of relative relevance of the content page or one or more portions of the content page to each of the recursively embedded sub-expressions, wherein a structure includes substructures, wherein at least one of the recursively generating is based at least in part on a distance function, and a scoring function, wherein the distance function measures distances between sub-structures within the structure being scored to facilitate determining of mutual relevance of occurrence positions, and wherein the scoring function is positionally sensitive, yielding different scores for at least some different occurrence positions of a search sub-expression in substructures of the structure being scored, irrespective of substructure category memberships; and conditionally providing or not providing the content page or one or more portions of the content page, or access information of the content page or one or more portions of the content page, to the content searching or consuming application, by the search engine, based at least in part on the generated one or more scores. 44. The method of claim 42 , wherein the plurality of recursively embedded sub-expressions comprise a first sub-expression specifying a matching criterion for a content category and a second sub-expression specifying a matching criterion for a content page of a matching content category. | 0.823745 |
7,773,527 | 8 | 10 | 8. A non transitory computer-readable medium having stored thereon a set of computer-readable instructions which, when executed by a processor, cause the processor to: receive a document from a managed service container for transmission to a connection offering platform, wherein the document is based on an offering, wherein the offering is provided by the connection offering platform for an asset managed by the managed service container; retrieve, from a remote registry, a quality of service policy defined for the offering, wherein the remote registry is located on the connection offering platform; enqueue the document in a queue corresponding to a quality of service defined in the quality of service policy; dequeue the document according to the quality of service; and transmit the document via a network to the connection offering platform, wherein the quality of service policy is described in an extensible markup language (XML) document. | 8. A non transitory computer-readable medium having stored thereon a set of computer-readable instructions which, when executed by a processor, cause the processor to: receive a document from a managed service container for transmission to a connection offering platform, wherein the document is based on an offering, wherein the offering is provided by the connection offering platform for an asset managed by the managed service container; retrieve, from a remote registry, a quality of service policy defined for the offering, wherein the remote registry is located on the connection offering platform; enqueue the document in a queue corresponding to a quality of service defined in the quality of service policy; dequeue the document according to the quality of service; and transmit the document via a network to the connection offering platform, wherein the quality of service policy is described in an extensible markup language (XML) document. 10. The computer-readable medium of claim 8 , wherein the quality of service is no quality of service for delivery of the document. | 0.880037 |
7,630,552 | 1 | 2 | 1. A method of assessing a document using a computer system, comprising: providing a document to the computer system, wherein the document comprises at least one information field; and for at least one non-signature information field of the document, comparing, using the computer system, handwriting in the non-signature information field to at least two handwriting profile representations from at least one non-signature information field of at least one other document, wherein writing in at least one of the information fields of the document comprises at least two examples of a type of handwritten information, and further comprising comparing at least two of the examples to assess whether two or more of the examples approximately match. | 1. A method of assessing a document using a computer system, comprising: providing a document to the computer system, wherein the document comprises at least one information field; and for at least one non-signature information field of the document, comparing, using the computer system, handwriting in the non-signature information field to at least two handwriting profile representations from at least one non-signature information field of at least one other document, wherein writing in at least one of the information fields of the document comprises at least two examples of a type of handwritten information, and further comprising comparing at least two of the examples to assess whether two or more of the examples approximately match. 2. The method of claim 1 , wherein providing the document to the computer system comprises providing images of the document to the computer system. | 0.889552 |
8,527,671 | 16 | 22 | 16. A circuit comprising: a central processing unit; an interface for accessing a slave device, the interface comprising a transmit buffer for transmitting to the slave device, a first-in-first-out receive buffer for receiving from the slave device, and an underflow mechanism associated with the first-in-first out receive buffer; a data transfer engine coupled between the interface and the central processing unit; and a memory, coupled to the central processing unit, storing code arranged to be executed on the central processing unit to set up the data transfer engine to access the slave device by: based on said set-up, operating the data transfer engine to supply a read request word to a slot of the transmit buffer of the interface for transmission to the slave device, said slave device generating a corresponding response word related to said read request word and, after return of said corresponding response word to the first-in-first-out receive buffer of the interface, to free said slot of said transmit buffer to disable said first-in-first-out receive buffer from receiving any further data such that the last word therein is assured to be said response word; and use the underflow mechanism of said first-in-first-out receive buffer to determine the last word therein and hence determine said response word. | 16. A circuit comprising: a central processing unit; an interface for accessing a slave device, the interface comprising a transmit buffer for transmitting to the slave device, a first-in-first-out receive buffer for receiving from the slave device, and an underflow mechanism associated with the first-in-first out receive buffer; a data transfer engine coupled between the interface and the central processing unit; and a memory, coupled to the central processing unit, storing code arranged to be executed on the central processing unit to set up the data transfer engine to access the slave device by: based on said set-up, operating the data transfer engine to supply a read request word to a slot of the transmit buffer of the interface for transmission to the slave device, said slave device generating a corresponding response word related to said read request word and, after return of said corresponding response word to the first-in-first-out receive buffer of the interface, to free said slot of said transmit buffer to disable said first-in-first-out receive buffer from receiving any further data such that the last word therein is assured to be said response word; and use the underflow mechanism of said first-in-first-out receive buffer to determine the last word therein and hence determine said response word. 22. The circuit of claim 16 , wherein said underflow mechanism comprises a stall mechanism whereby a stall is generated when the first-in-first-out receive buffer contains fewer words than a lower stall threshold, and the determination of said last word comprises executing code on said central processing unit to read from the first-in-first-out receive buffer until empty, the central processing unit determining when the first-in-first-out receive buffer is empty by reference to said stall of the first-in-first-out receive buffer. | 0.805171 |
7,519,616 | 27 | 30 | 27. A multimedia device comprising: a processor; and instructions stored in a memory and executable on the processor configured to associate a first document with a second document that is separate from the first document through referencing at least a portion of a first set of elements in the first document in at least a portion of a second set of elements in the second document wherein the first set of elements reference multimedia objects and the second set of elements are arranged to provide a rendition timing for the multimedia objects; and wherein the instructions are further configured to: receive an input to initiate an event affecting an element in the first set of one or more elements in the first document provide a proxy element in the second set of elements in the second document that is configured to reference application of the event; and render the multimedia objects based on the arranging of the second set of one or more elements. | 27. A multimedia device comprising: a processor; and instructions stored in a memory and executable on the processor configured to associate a first document with a second document that is separate from the first document through referencing at least a portion of a first set of elements in the first document in at least a portion of a second set of elements in the second document wherein the first set of elements reference multimedia objects and the second set of elements are arranged to provide a rendition timing for the multimedia objects; and wherein the instructions are further configured to: receive an input to initiate an event affecting an element in the first set of one or more elements in the first document provide a proxy element in the second set of elements in the second document that is configured to reference application of the event; and render the multimedia objects based on the arranging of the second set of one or more elements. 30. The multimedia device of claim 27 wherein the instructions are further configured to associate a third set of elements in a third document with the second set of elements in the second document. | 0.608696 |
9,547,712 | 1 | 3 | 1. A computer readable medium having instructions encoded thereon that, when executed by one or more processors, cause a digital content classification process to be carried out, the process comprising: defining an initial association that exists between (a) one or more tags that represent a first digital content segment and (b) an initial subject matter categorization; providing, to a first user, the first digital content segment and the initial subject matter categorization; receiving, from the first user, a modified subject matter categorization; modifying the initial association to produce a modified association that exists between (a) the one or more tags and (b) the modified subject matter categorization; receiving, from a second user, a second digital content segment that is also represented by the one or more tags; and providing, to the second user, the modified subject matter categorization without providing the initial subject matter categorization to the second user. | 1. A computer readable medium having instructions encoded thereon that, when executed by one or more processors, cause a digital content classification process to be carried out, the process comprising: defining an initial association that exists between (a) one or more tags that represent a first digital content segment and (b) an initial subject matter categorization; providing, to a first user, the first digital content segment and the initial subject matter categorization; receiving, from the first user, a modified subject matter categorization; modifying the initial association to produce a modified association that exists between (a) the one or more tags and (b) the modified subject matter categorization; receiving, from a second user, a second digital content segment that is also represented by the one or more tags; and providing, to the second user, the modified subject matter categorization without providing the initial subject matter categorization to the second user. 3. The computer readable medium of claim 1 , wherein the initial subject matter categorization comprises a first plurality of subject matter categories, and the modified subject matter categorization comprises a second plurality of subject matter categories, wherein the second plurality of subject matter categories includes every subject matter category in the first plurality, as well as a new subject matter category. | 0.677642 |
9,336,300 | 9 | 10 | 9. The method of claim 1 , wherein the receiving, by the mobile client system, from the first user the unstructured text query comprises receiving one or more characters of a character string as the user enters the character string into a graphical user interface. | 9. The method of claim 1 , wherein the receiving, by the mobile client system, from the first user the unstructured text query comprises receiving one or more characters of a character string as the user enters the character string into a graphical user interface. 10. The method of claim 9 , further comprising updating, by the mobile client system, one or more of the structured queries by matching a unstructured text query that is modified as the user enters one or more subsequent characters into the graphical user interface. | 0.938935 |
7,996,341 | 1 | 15 | 1. A method, comprising: identifying, at a computer, at least one color attribute for a tag based on at least one association of the tag with a first color theme in a collection of color themes, the at least one color attribute being defined as present or absent for the first color theme; determining, via the computer, a weight for the at least one color attribute based on the at least one association of the tag with the first color theme, the weight representing a significance of the at least one color attribute to the tag; and estimating, via the computer, a descriptiveness value of the tag for a second color theme in the collection of color themes using the at least one color attribute and the weight. | 1. A method, comprising: identifying, at a computer, at least one color attribute for a tag based on at least one association of the tag with a first color theme in a collection of color themes, the at least one color attribute being defined as present or absent for the first color theme; determining, via the computer, a weight for the at least one color attribute based on the at least one association of the tag with the first color theme, the weight representing a significance of the at least one color attribute to the tag; and estimating, via the computer, a descriptiveness value of the tag for a second color theme in the collection of color themes using the at least one color attribute and the weight. 15. The method of claim 1 wherein the weight for each at least one color attribute is determined using a data set comprising: positive examples of color themes in the collection of color themes associated with the tag; and negative examples of color themes in the collection of color themes not associated with the tag. | 0.669087 |
8,554,281 | 19 | 20 | 19. A method for managing a handheld communication device, the method comprising: storing contact information in the communication device enabling the identification of individuals and for each of at least some of the individuals a preferred language for communication; receiving a request to communicate with a particular individual; determining from the stored contact information whether the particular individual has a preferred language for communication; and based on the determination, reconfiguring the communication device as necessary to enable communication with the particular individual, wherein the reconfiguring comprises: if it is determined that the particular individual has a preferred language for communication: determining whether said preferred language is different than a default input language of said handheld communication device; if it is determined that the preferred language is different than the default input language, switching a current input language of said handheld communication device to said preferred language; and if it is determined that the communication is complete and the particular preferred input language is different than the default input language, switching the current input language of said handheld electronic device back to the default input language. | 19. A method for managing a handheld communication device, the method comprising: storing contact information in the communication device enabling the identification of individuals and for each of at least some of the individuals a preferred language for communication; receiving a request to communicate with a particular individual; determining from the stored contact information whether the particular individual has a preferred language for communication; and based on the determination, reconfiguring the communication device as necessary to enable communication with the particular individual, wherein the reconfiguring comprises: if it is determined that the particular individual has a preferred language for communication: determining whether said preferred language is different than a default input language of said handheld communication device; if it is determined that the preferred language is different than the default input language, switching a current input language of said handheld communication device to said preferred language; and if it is determined that the communication is complete and the particular preferred input language is different than the default input language, switching the current input language of said handheld electronic device back to the default input language. 20. The method of claim 19 , wherein the reconfiguring further comprises: if it is determined that the particular individual does not have a preferred language for communication, retaining language input settings for character input operations of the device in accordance with the default language. | 0.671082 |
9,336,207 | 2 | 4 | 2. The method of claim 1 wherein the plurality of suggested translations correspond to a plurality of child class sets, the method further comprising: computing a child class set linguistic noise value for each of the plurality of child class sets using a corresponding child class leverage value and a child class factor value, resulting in a plurality of child class set linguistic noise values; combining the plurality of child class set linguistic noise values, resulting in a translation supply chain linguistic noise value; and utilizing the translation supply chain linguistic noise value during the performance efficiency determination of the language translation supply chain. | 2. The method of claim 1 wherein the plurality of suggested translations correspond to a plurality of child class sets, the method further comprising: computing a child class set linguistic noise value for each of the plurality of child class sets using a corresponding child class leverage value and a child class factor value, resulting in a plurality of child class set linguistic noise values; combining the plurality of child class set linguistic noise values, resulting in a translation supply chain linguistic noise value; and utilizing the translation supply chain linguistic noise value during the performance efficiency determination of the language translation supply chain. 4. The method of claim 2 wherein each of the plurality of suggested translations corresponds to one of a plurality of original segments written in a first language and one of a plurality of corresponding translation segments written in a second language, the method further comprising: designating a set of the plurality of original segments as a set of placebo segments, wherein the translation supply chain prevents generation of a suggested translation for each of the segments included in the set of placebo segments; computing a placebo baseline productivity value based upon the set of placebo segments that do not correspond to one of the plurality of suggested translations; selecting one of the plurality of child class sets; computing a child class match productivity value of the selected child class based upon the set of accepted translations that each correspond to the selected child class set; and computing the child class factor value of the selected child class set using the placebo baseline productivity value and the child class match productivity value. | 0.557929 |
9,342,583 | 2 | 3 | 2. The computer-implemented method of claim 1 , wherein identifying image features in the images comprises identifying localized image features at particular locations in the images. | 2. The computer-implemented method of claim 1 , wherein identifying image features in the images comprises identifying localized image features at particular locations in the images. 3. The computer-implemented method of claim 2 , wherein identifying the localized image features comprises identifying, in a particular region of an image, a color, an edge, an edge direction, or an intensity. | 0.920713 |
8,635,180 | 23 | 24 | 23. A dual hash method for use with a pattern search engine said method comprising: using said pattern search engine comprising a programmable state machine comprising a balanced routing table search (BaRT)-based finite state machine (BFSM), said BFSM being implemented in hardware, or a combination of hardware and software; an initial rule bank, a default rule bank and a transition rule bank, each said rule having a test portion to determine if there is a match to a current rule, and a result portion which defines the next state targeted by said rule; storing default rules and dual hash rules that apply to a pattern context search in a default; rule bank that is indexed independently; storing transition rules that apply to said pattern context search in a transition rule bank; utilizing a rule entry in said default rule bank as an extension of a transition rule hash, said rule entry comprising a dual hash rule applicable to said pattern context search; and utilizing said dual hash rule when the default rule lookup is not required for a state; said transition rules having a higher priority than the rules on said default side, which is used for said dual hash; and when there is no match on either one of said default rules or said transition rules, said search engine reverts to said initial state; said dual hash being used (1) for any state for which input values covered by said transition rules are a super-set of said input values covered by said default rules; (2) wherein previous coverage can also be enforced by adding the missing uncovered input values of one or more default rules to a given state; and (3) wherein dual hash can always be used for anchored matching after a first character. | 23. A dual hash method for use with a pattern search engine said method comprising: using said pattern search engine comprising a programmable state machine comprising a balanced routing table search (BaRT)-based finite state machine (BFSM), said BFSM being implemented in hardware, or a combination of hardware and software; an initial rule bank, a default rule bank and a transition rule bank, each said rule having a test portion to determine if there is a match to a current rule, and a result portion which defines the next state targeted by said rule; storing default rules and dual hash rules that apply to a pattern context search in a default; rule bank that is indexed independently; storing transition rules that apply to said pattern context search in a transition rule bank; utilizing a rule entry in said default rule bank as an extension of a transition rule hash, said rule entry comprising a dual hash rule applicable to said pattern context search; and utilizing said dual hash rule when the default rule lookup is not required for a state; said transition rules having a higher priority than the rules on said default side, which is used for said dual hash; and when there is no match on either one of said default rules or said transition rules, said search engine reverts to said initial state; said dual hash being used (1) for any state for which input values covered by said transition rules are a super-set of said input values covered by said default rules; (2) wherein previous coverage can also be enforced by adding the missing uncovered input values of one or more default rules to a given state; and (3) wherein dual hash can always be used for anchored matching after a first character. 24. The method according to claim 23 wherein said dual hash lookup is utilized for any state for which input values covered by transition rules are a super set of input values covered by default rules. | 0.956037 |
7,562,016 | 6 | 9 | 6. A machine-readable storage having stored thereon, a computer program having a plurality of code sections, said code sections executable by a machine for causing the machine to perform the steps of: determining at least two possible meanings for a language input; for each possible meaning, determining a probability that said possible meaning is a correct interpretation of said language input; computing at least one relative delta computation based at least in part upon said probabilities, wherein each value of a relative delta computation uniquely corresponds to a type of irregularity within said language input such that values of relative delta computations vary depending on the corresponding type of irregularity; detecting at least one irregularity within said language input and determining the corresponding type of the at least one irregularity based upon said relative delta computation; and performing at least one programmatic action responsive to detecting said irregularity. | 6. A machine-readable storage having stored thereon, a computer program having a plurality of code sections, said code sections executable by a machine for causing the machine to perform the steps of: determining at least two possible meanings for a language input; for each possible meaning, determining a probability that said possible meaning is a correct interpretation of said language input; computing at least one relative delta computation based at least in part upon said probabilities, wherein each value of a relative delta computation uniquely corresponds to a type of irregularity within said language input such that values of relative delta computations vary depending on the corresponding type of irregularity; detecting at least one irregularity within said language input and determining the corresponding type of the at least one irregularity based upon said relative delta computation; and performing at least one programmatic action responsive to detecting said irregularity. 9. The machine-readable storage of claim 6 , wherein said irregularity comprises compound input. | 0.928144 |
7,574,362 | 26 | 31 | 26. A method for automatically planning a sentence in a task classification system, comprising: recognizing symbols in a user's input communication; determining whether the user's single input communication can be understood, wherein if the user's communication can be understood, understanding data is generated; generating a plurality of communicative goals based on the recognized symbols and understanding data, the generated plurality of communicative goals being related to information needed to be obtained from the user; in response to information from the user's single input communication: generating a plurality of sentence plans based on the communicative goals and information related to a set of interactions between the user and the automated dialog system, each sentence plan in the plurality of sentence plans being a realization comprising elementary speech acts each corresponding to a respective communicative goal and combined into at least one complete sentence that accomplishes the plurality of communicative goals, and wherein each sentence plan of the plurality of sentence plans is a viable and potentially usable prompt in response to the user's single input communication; ranking the generated sentence plans using a set of learned rules and independent of the user; selecting the highest ranked sentence plan; realizing the selected sentence plan by applying a set of linguistic rules; converting the realized sentence plan from text to speech; and outputting the converted sentence plan to the user as an immediate and single a response to the user's single input communication such that a dialog turn occurs starting with the user's single input communication and ending with the outputted sentence plan. | 26. A method for automatically planning a sentence in a task classification system, comprising: recognizing symbols in a user's input communication; determining whether the user's single input communication can be understood, wherein if the user's communication can be understood, understanding data is generated; generating a plurality of communicative goals based on the recognized symbols and understanding data, the generated plurality of communicative goals being related to information needed to be obtained from the user; in response to information from the user's single input communication: generating a plurality of sentence plans based on the communicative goals and information related to a set of interactions between the user and the automated dialog system, each sentence plan in the plurality of sentence plans being a realization comprising elementary speech acts each corresponding to a respective communicative goal and combined into at least one complete sentence that accomplishes the plurality of communicative goals, and wherein each sentence plan of the plurality of sentence plans is a viable and potentially usable prompt in response to the user's single input communication; ranking the generated sentence plans using a set of learned rules and independent of the user; selecting the highest ranked sentence plan; realizing the selected sentence plan by applying a set of linguistic rules; converting the realized sentence plan from text to speech; and outputting the converted sentence plan to the user as an immediate and single a response to the user's single input communication such that a dialog turn occurs starting with the user's single input communication and ending with the outputted sentence plan. 31. The method of claim 26 , further comprising: determining whether all of the communicative goals have been met; and processing any tasks associated with the information obtained from the system's interactions with the user if the determining step determines that all of the communicative goals have been met. | 0.501603 |
8,291,006 | 9 | 15 | 9. A computer program product comprising a tangible computer readable recordable storage medium having computer readable program code for generating a distributed stream processing application, said computer program product including: computer readable program code for obtaining a declarative description of one or more data stream processing tasks from a graph of operators, wherein the declarative description expresses at least one stream processing task; computer readable program code for generating one or more execution units from the declarative description of one or more data stream processing tasks, wherein the one or more execution units are deployable across one or more distributed computing nodes, and comprise a distributed data stream processing application binary; computer readable program code for generating one or more coarse granularity containers that encompass one or more fine granularity stream processing operators; computer readable program code for using the one or more coarse granularity containers to generate a distributed stream processing application; computer readable program code for generating one or more containers that encompass a combination of one or more stream processing operators, wherein said generating comprises: coalescing a combination of one or more operators into one or more containers, wherein said coalescing comprises: using an optimizer to automatically decide which of the one or more operators are to be coalesced into which of the one or more containers; and using user input to manually group the one or more operators into the one or more containers; and computer readable program code for fusing an outflow of an operator into an inflow of a downstream operator within a same container. | 9. A computer program product comprising a tangible computer readable recordable storage medium having computer readable program code for generating a distributed stream processing application, said computer program product including: computer readable program code for obtaining a declarative description of one or more data stream processing tasks from a graph of operators, wherein the declarative description expresses at least one stream processing task; computer readable program code for generating one or more execution units from the declarative description of one or more data stream processing tasks, wherein the one or more execution units are deployable across one or more distributed computing nodes, and comprise a distributed data stream processing application binary; computer readable program code for generating one or more coarse granularity containers that encompass one or more fine granularity stream processing operators; computer readable program code for using the one or more coarse granularity containers to generate a distributed stream processing application; computer readable program code for generating one or more containers that encompass a combination of one or more stream processing operators, wherein said generating comprises: coalescing a combination of one or more operators into one or more containers, wherein said coalescing comprises: using an optimizer to automatically decide which of the one or more operators are to be coalesced into which of the one or more containers; and using user input to manually group the one or more operators into the one or more containers; and computer readable program code for fusing an outflow of an operator into an inflow of a downstream operator within a same container. 15. The computer program product of claim 9 , wherein the computer readable program code for generating one or more execution units from the declarative description of one or more data stream processing tasks comprises computer readable program code for using a compiler. | 0.501838 |
10,013,414 | 21 | 25 | 21. A management entity comprising: a memory comprising instructions; and a processor in communication with the memory wherein the processor executes the instructions to: parse a request to collect data about a communications system for an entity in the communications system, the parsing to produce a parsed request and dependency information, generate sets of model elements in accordance with context tokens and content tokens derived from the parsed request, the content tokens including extrinsic metadata and intrinsic metadata of the parsed request, wherein the processor executing the instructions to generate the sets of model elements comprises the processor executing the instructions to: evaluate content of the request to collect the data to produce links between context tokens and the content tokens, and map the links into a model element graph, analyze context metadata tokens and content metadata tokens in accordance with the dependency information, analyze the model element graph in accordance with the dependency information, modify the model element graph for each dependency and dependency type in the dependency information, generate a platform-neutral description of results of the request from the model element graph derived from the sets of model elements, the platform-neutral description being independent of a protocol used by the management entity to collect the data about the communications system, and execute the request to collect the data as requested in accordance with the platform-neutral description; and store the data as collected in the memory. | 21. A management entity comprising: a memory comprising instructions; and a processor in communication with the memory wherein the processor executes the instructions to: parse a request to collect data about a communications system for an entity in the communications system, the parsing to produce a parsed request and dependency information, generate sets of model elements in accordance with context tokens and content tokens derived from the parsed request, the content tokens including extrinsic metadata and intrinsic metadata of the parsed request, wherein the processor executing the instructions to generate the sets of model elements comprises the processor executing the instructions to: evaluate content of the request to collect the data to produce links between context tokens and the content tokens, and map the links into a model element graph, analyze context metadata tokens and content metadata tokens in accordance with the dependency information, analyze the model element graph in accordance with the dependency information, modify the model element graph for each dependency and dependency type in the dependency information, generate a platform-neutral description of results of the request from the model element graph derived from the sets of model elements, the platform-neutral description being independent of a protocol used by the management entity to collect the data about the communications system, and execute the request to collect the data as requested in accordance with the platform-neutral description; and store the data as collected in the memory. 25. The management entity of claim 21 , wherein the processor executes the instructions to extract the context tokens from the parsed request, to map the context tokens to a first set of model elements, to extract the content tokens from the parsed request, and to map the content tokens to a second set of model elements. | 0.649237 |
7,523,423 | 39 | 41 | 39. The method of claim 1 , further comprising: traversing the input representation and assigning priorities to the input representation that effect an ordering of the set of active execution paths. | 39. The method of claim 1 , further comprising: traversing the input representation and assigning priorities to the input representation that effect an ordering of the set of active execution paths. 41. The method of claim 39 , further comprising: traversing a plurality of nodes of the input representation and assigning a priority to a first plurality of nodes, within a first cycle, that is higher than a priority of an exit node, wherein the exit node is outside any cycle and can be traversed-to from a node of the first cycle. | 0.797937 |
9,720,937 | 15 | 16 | 15. The system according to claim 14 , wherein the one or more processors are configured to update the feature matrix of the search query by changing a column of the feature matrix based on the feature vector of the segment of the candidate image, wherein a column is updated based on an overlap of the segment with parts of the images that are represented with separated feature vectors, and wherein a degree of the update depends on an amount of the overlap. | 15. The system according to claim 14 , wherein the one or more processors are configured to update the feature matrix of the search query by changing a column of the feature matrix based on the feature vector of the segment of the candidate image, wherein a column is updated based on an overlap of the segment with parts of the images that are represented with separated feature vectors, and wherein a degree of the update depends on an amount of the overlap. 16. The system according to claim 15 , wherein the one or more processors are configured to use the updated feature matrix to identify the improved candidate image, wherein the improved candidate image is different from the candidate image in response to another image having a feature matrix that is more similar to the updated feature matrix than the candidate image, and is the same as the candidate image in response to the candidate image having the feature matrix that is most similar to the updated feature matrix. | 0.848722 |
9,369,695 | 1 | 3 | 1. A three-dimensional measurement apparatus comprising: a first imaging unit for imaging an object; a second imaging unit disposed at a predetermined baseline length from the first imaging unit, the second imaging unit imaging at least a part of the object imaged with the first imaging unit; a feature point detector for detecting a plurality of feature points in at least one of two images of the object taken from a first image capture position with the first and second imaging units; a corresponding point detector for detecting corresponding points in at least one of two images of the object taken from a second image capture position with the first and second imaging units, the second image capture position being different from the first image capture position, the corresponding points corresponding to the feature points; a rotation matrix calculator for calculating a rotation matrix representing angle and direction of rotation of the first or second imaging unit at the second image capture position relative to the first or second imaging unit at the first image capture position; a translation matrix calculator for calculating a translation matrix representing a translation direction of the first or second imaging unit at the second image capture position relative to the first or second imaging unit at the first image capture position; an epipolar line calculator for calculating an epipolar line based on a relative positional relationship between each of the imaging units at the first and second image capture positions, the relative positional relationship being determined by a first rotation matrix, a first translation matrix, and a first virtual translation distance, the first rotation matrix being calculated by the rotation matrix calculator based on the feature points and the corresponding points, the first translation matrix being calculated by the translation matrix calculator based on the feature points and the corresponding points, the first virtual translation distance being an arbitrarily assumed distance between each of the imaging unit taking the image in which the feature points are detected and the imaging unit taking the image in which the corresponding points are detected, the epipolar line being a projection of a direction of line of sight from the imaging unit at the first image capture position to the specific feature point onto the image taken from the second image capture position; an evaluator for evaluating whether each of the epipolar lines passes through the corresponding point corresponding to the feature point, the epipolar lines being calculated with the different first virtual translation distances; and a three-dimensional data calculator for calculating three-dimensional data of the object with the use of the first virtual translation distance assumed for calculating the epipolar line passing through the specific feature point. | 1. A three-dimensional measurement apparatus comprising: a first imaging unit for imaging an object; a second imaging unit disposed at a predetermined baseline length from the first imaging unit, the second imaging unit imaging at least a part of the object imaged with the first imaging unit; a feature point detector for detecting a plurality of feature points in at least one of two images of the object taken from a first image capture position with the first and second imaging units; a corresponding point detector for detecting corresponding points in at least one of two images of the object taken from a second image capture position with the first and second imaging units, the second image capture position being different from the first image capture position, the corresponding points corresponding to the feature points; a rotation matrix calculator for calculating a rotation matrix representing angle and direction of rotation of the first or second imaging unit at the second image capture position relative to the first or second imaging unit at the first image capture position; a translation matrix calculator for calculating a translation matrix representing a translation direction of the first or second imaging unit at the second image capture position relative to the first or second imaging unit at the first image capture position; an epipolar line calculator for calculating an epipolar line based on a relative positional relationship between each of the imaging units at the first and second image capture positions, the relative positional relationship being determined by a first rotation matrix, a first translation matrix, and a first virtual translation distance, the first rotation matrix being calculated by the rotation matrix calculator based on the feature points and the corresponding points, the first translation matrix being calculated by the translation matrix calculator based on the feature points and the corresponding points, the first virtual translation distance being an arbitrarily assumed distance between each of the imaging unit taking the image in which the feature points are detected and the imaging unit taking the image in which the corresponding points are detected, the epipolar line being a projection of a direction of line of sight from the imaging unit at the first image capture position to the specific feature point onto the image taken from the second image capture position; an evaluator for evaluating whether each of the epipolar lines passes through the corresponding point corresponding to the feature point, the epipolar lines being calculated with the different first virtual translation distances; and a three-dimensional data calculator for calculating three-dimensional data of the object with the use of the first virtual translation distance assumed for calculating the epipolar line passing through the specific feature point. 3. The three-dimensional measurement apparatus according to claim 1 , wherein the evaluator calculates the coincidence with the feature point along the epipolar lines and evaluates, based on the coincidence, whether the epipolar line passes through the corresponding point corresponding to the feature point. | 0.797635 |
8,255,383 | 6 | 7 | 6. The method according to claim 1 , comprising: maintaining usage information of the plurality of categories based on previous searches including by the human search assistant. | 6. The method according to claim 1 , comprising: maintaining usage information of the plurality of categories based on previous searches including by the human search assistant. 7. The method according to claim 6 , wherein the ranking of the category of the keyword is determined based on the usage information. | 0.930147 |
7,663,603 | 7 | 8 | 7. A device according to claim 1 configured for composing and sending text messages. | 7. A device according to claim 1 configured for composing and sending text messages. 8. A device according to claim 7 configured for composing and sending an SMS message or an MMS message. | 0.969472 |
9,773,166 | 17 | 18 | 17. One or more non-transitory computer-readable storage media encoded with instructions that, when executed by one or more computers, cause the one or more computers to perform operations comprising: obtaining a collection of training documents, the training documents including a group of positive documents and a group of negative documents, wherein the positive documents are training documents identified as being longform documents and the negative documents are training documents identified as not being longform documents; extracting a plurality of features from the training documents, wherein the plurality of features are associated with a plurality of different feature types that represent lexical or textual content of the training documents that are indicative of a document's writing style; generating a longform document classifier trained using feature instances extracted from the training documents, wherein the generated longform document classifier is trained such that input documents are classified as being longform documents or classified as not being longform documents; applying the longform document classifier to a corpus of documents; annotating an information retrieval index with an output classification for each document of the corpus of documents; and using the annotated index to provide search results identifying longform documents in response to a search query. | 17. One or more non-transitory computer-readable storage media encoded with instructions that, when executed by one or more computers, cause the one or more computers to perform operations comprising: obtaining a collection of training documents, the training documents including a group of positive documents and a group of negative documents, wherein the positive documents are training documents identified as being longform documents and the negative documents are training documents identified as not being longform documents; extracting a plurality of features from the training documents, wherein the plurality of features are associated with a plurality of different feature types that represent lexical or textual content of the training documents that are indicative of a document's writing style; generating a longform document classifier trained using feature instances extracted from the training documents, wherein the generated longform document classifier is trained such that input documents are classified as being longform documents or classified as not being longform documents; applying the longform document classifier to a corpus of documents; annotating an information retrieval index with an output classification for each document of the corpus of documents; and using the annotated index to provide search results identifying longform documents in response to a search query. 18. The one or more non-transitory computer readable media of claim 17 , wherein the one or more features include a parse n-gram feature that indicates common sentence structures in the documents based on dependency parse trees. | 0.552941 |
8,935,681 | 10 | 12 | 10. A computer tool, stored in a non-transitory medium, for a user to access an original plain text file which has been protected by being encrypted in a protected file, the computer tool being adapted to decrypt the protected file once authorized by a user license issued by an authority responsible for the protected file to produce an image of the original plain text file whilst protecting the image of the original plain text file from being copied to any file, other than a further protected file, wherein the image of the original plain text file cannot be found by other programs on the computer, and an editor program that (i) edits the image of the original plain text file to create an edited image of the original plaint text file and then (ii) saves changes made to the image of the original plain text file in an encrypted form, separate from the original plain text file, wherein the computer tool creates the edited image of the original plain text file from the protected file and a difference file using the editor program and user license, wherein, before allowing to produce the image of the original plain text file or to edit the image of the original plain text file, the computer tool checks its own validity by checking a digital signature to ensure the computer tool has not been modified, and wherein parts of the original plain text file are marked as non-editable, and the editor program prevents such parts being edited so that they will always be present in any image created from the original plain text file and any difference file or files. | 10. A computer tool, stored in a non-transitory medium, for a user to access an original plain text file which has been protected by being encrypted in a protected file, the computer tool being adapted to decrypt the protected file once authorized by a user license issued by an authority responsible for the protected file to produce an image of the original plain text file whilst protecting the image of the original plain text file from being copied to any file, other than a further protected file, wherein the image of the original plain text file cannot be found by other programs on the computer, and an editor program that (i) edits the image of the original plain text file to create an edited image of the original plaint text file and then (ii) saves changes made to the image of the original plain text file in an encrypted form, separate from the original plain text file, wherein the computer tool creates the edited image of the original plain text file from the protected file and a difference file using the editor program and user license, wherein, before allowing to produce the image of the original plain text file or to edit the image of the original plain text file, the computer tool checks its own validity by checking a digital signature to ensure the computer tool has not been modified, and wherein parts of the original plain text file are marked as non-editable, and the editor program prevents such parts being edited so that they will always be present in any image created from the original plain text file and any difference file or files. 12. The computer tool as claimed in claim 10 which encrypts said changes using said user license or a different license key. | 0.830137 |
7,526,424 | 19 | 20 | 19. The system of claim 8 wherein the flesh-out component assigns a probability of realization to logical subjects and logical objects in the ALR. | 19. The system of claim 8 wherein the flesh-out component assigns a probability of realization to logical subjects and logical objects in the ALR. 20. The system of claim 19 wherein the basic tree conversion component is configured to remove logical subjects and logical objects having a probability of realization that is less than a threshold value. | 0.924668 |
8,225,356 | 1 | 5 | 1. A method of operating a media control system comprising: detecting a first numeric user input from a remote control, wherein the first numeric user input is defined by an amount of time that the first numeric user input is pressed; determining that the first numeric user input corresponds to a first numeral when the amount of pressed time of the first numeric user input is less than a predetermined amount of time; determining that the first numeric user input corresponds to a first set of alphabetic letters when the amount of pressed time of the first numeric user input is at least equal to the predetermined amount of time, and wherein in response to determining that the first numeric user input corresponds to the first set of alphabetic letters, the method further comprises: processing the first numeric user input to identify the first set of alphabetic letters; selecting a first plurality of media channel names based on the identified first set of alphabetic letters, wherein each of the first plurality of media channel names begins with a first alphabetic letter corresponding to one of the alphabetic letters of the identified first set of alphabetic letters; and generating a first signal configured to drive a display, wherein the display presents the first plurality of media channel names on the display; the method further comprising: detecting a second numeric user input from the remote control after detecting the first numeric user input, where in response to the determining the first numeric user input corresponding to the first set of alphabetic letters, determining that the second numeric user input corresponds to a second set of alphabetic letters and does not correspond to a second numeral associated with the second set of alphabetic letters; processing the second numeric user input to identify the second set of alphabetic letters associated with the second numeric user input; selecting a second plurality of media channel names from the first plurality of media channel names, wherein the selecting the second plurality of media channel names is based on a second alphabetic letter of each of the first plurality of media channel names, and wherein each of the second plurality of media channel names has the first alphabetic letter corresponding to one of the alphabetic letters of the identified first set of alphabetic letters followed by a second alphabetic letter corresponding to one of the alphabetic letters of the second set of alphabetic letters; and generating a second signal configured to drive a second display, wherein the second display presents the second plurality of media channel names. | 1. A method of operating a media control system comprising: detecting a first numeric user input from a remote control, wherein the first numeric user input is defined by an amount of time that the first numeric user input is pressed; determining that the first numeric user input corresponds to a first numeral when the amount of pressed time of the first numeric user input is less than a predetermined amount of time; determining that the first numeric user input corresponds to a first set of alphabetic letters when the amount of pressed time of the first numeric user input is at least equal to the predetermined amount of time, and wherein in response to determining that the first numeric user input corresponds to the first set of alphabetic letters, the method further comprises: processing the first numeric user input to identify the first set of alphabetic letters; selecting a first plurality of media channel names based on the identified first set of alphabetic letters, wherein each of the first plurality of media channel names begins with a first alphabetic letter corresponding to one of the alphabetic letters of the identified first set of alphabetic letters; and generating a first signal configured to drive a display, wherein the display presents the first plurality of media channel names on the display; the method further comprising: detecting a second numeric user input from the remote control after detecting the first numeric user input, where in response to the determining the first numeric user input corresponding to the first set of alphabetic letters, determining that the second numeric user input corresponds to a second set of alphabetic letters and does not correspond to a second numeral associated with the second set of alphabetic letters; processing the second numeric user input to identify the second set of alphabetic letters associated with the second numeric user input; selecting a second plurality of media channel names from the first plurality of media channel names, wherein the selecting the second plurality of media channel names is based on a second alphabetic letter of each of the first plurality of media channel names, and wherein each of the second plurality of media channel names has the first alphabetic letter corresponding to one of the alphabetic letters of the identified first set of alphabetic letters followed by a second alphabetic letter corresponding to one of the alphabetic letters of the second set of alphabetic letters; and generating a second signal configured to drive a second display, wherein the second display presents the second plurality of media channel names. 5. The method of claim 1 , wherein the second display comprises a video program guide for the second plurality of media channel names. | 0.877737 |
7,536,368 | 1 | 6 | 1. A system for obtaining solution suggestions for problems, the system comprising: at least one processor and at least one storage medium including an electronic model of a system or process, wherein the electronic model includes components of the system or process and relationships between the components; a problem analysis tool that analyzes the components and the relationships between the components of the electronic model to identify a problem to be solved, generates a problem statement representing the problem, and generates a machine representation of a problem statement; a query formatter that reformulates the machine representation into a natural language query or Boolean query and automatically submits the query to at least one knowledge base; and the at least one knowledge base comprising at least one database comprising problem solutions and returning a set of solution suggestions responsive to the query. | 1. A system for obtaining solution suggestions for problems, the system comprising: at least one processor and at least one storage medium including an electronic model of a system or process, wherein the electronic model includes components of the system or process and relationships between the components; a problem analysis tool that analyzes the components and the relationships between the components of the electronic model to identify a problem to be solved, generates a problem statement representing the problem, and generates a machine representation of a problem statement; a query formatter that reformulates the machine representation into a natural language query or Boolean query and automatically submits the query to at least one knowledge base; and the at least one knowledge base comprising at least one database comprising problem solutions and returning a set of solution suggestions responsive to the query. 6. The system of claim 1 , wherein the at least one knowledge base is resident on a corporate server. | 0.875 |
8,626,797 | 1 | 8 | 1. An information processing apparatus comprising: a memory storing instructions; and one or more processors configured to execute the instructions to: configure a sensor information acquisition section to acquire sensor information outputted from a sensor for detecting a user motion and sensor information outputted from a sensor for obtaining a user current location; configure an action pattern detection block to analyze sensor information from said sensor for detecting a user motion acquired by said sensor information acquisition section to detect an action pattern corresponding to the acquired sensor information from a plurality of action patterns obtained by classifying user's actions that are executed in a comparatively short time of several seconds to several minutes; configure a keyword conversion block to convert, on the basis of said sensor information indicative of a current location acquired by said sensor information acquisition section, said information indicative of a current location into at least one keyword associated with current information associated with said current location by use of databases and network search engines; configure a positional information analysis block to generate information associated with a place of user's frequent visit and a place of user's probable visit next to the current location by use of information indicative of the current location acquired by said sensor information acquisition section and a log of said information indicative of a current location, wherein said place of user's frequent visit is determined by computing the frequency of the user's visits from the log of said information and calculating a score on the basis of the computed frequency, wherein said place of user's probable visit next to the current location is determined by computing a conditional probability of the user's moving from the current position to each of the places written to the log of said information and calculating a score on the basis of the obtained conditional probability, and wherein the one or more processors further configure said keyword conversion block to convert said information associated with a place of user's frequent visit and a place of user's probable visit next to the current location into a keyword; and configure a text extraction block to extract a text for user presentation from a plurality of texts on the basis of said action pattern detected by said action pattern detection block and said at least one keyword generated by said keyword conversion block. | 1. An information processing apparatus comprising: a memory storing instructions; and one or more processors configured to execute the instructions to: configure a sensor information acquisition section to acquire sensor information outputted from a sensor for detecting a user motion and sensor information outputted from a sensor for obtaining a user current location; configure an action pattern detection block to analyze sensor information from said sensor for detecting a user motion acquired by said sensor information acquisition section to detect an action pattern corresponding to the acquired sensor information from a plurality of action patterns obtained by classifying user's actions that are executed in a comparatively short time of several seconds to several minutes; configure a keyword conversion block to convert, on the basis of said sensor information indicative of a current location acquired by said sensor information acquisition section, said information indicative of a current location into at least one keyword associated with current information associated with said current location by use of databases and network search engines; configure a positional information analysis block to generate information associated with a place of user's frequent visit and a place of user's probable visit next to the current location by use of information indicative of the current location acquired by said sensor information acquisition section and a log of said information indicative of a current location, wherein said place of user's frequent visit is determined by computing the frequency of the user's visits from the log of said information and calculating a score on the basis of the computed frequency, wherein said place of user's probable visit next to the current location is determined by computing a conditional probability of the user's moving from the current position to each of the places written to the log of said information and calculating a score on the basis of the obtained conditional probability, and wherein the one or more processors further configure said keyword conversion block to convert said information associated with a place of user's frequent visit and a place of user's probable visit next to the current location into a keyword; and configure a text extraction block to extract a text for user presentation from a plurality of texts on the basis of said action pattern detected by said action pattern detection block and said at least one keyword generated by said keyword conversion block. 8. The information processing apparatus of claim 1 , wherein the apparatus is capable of assisting a user in learning a foreign language. | 0.915848 |
9,613,098 | 5 | 11 | 5. The method as set forth in claim 1 wherein the accessing of a first cluster model further comprises: receiving by a processor meta-data modeling the first work of literature, the meta-data comprising one or more literary element categories, one or more instances within each literary element categories, and an index value and significance value for each instance, wherein the index value corresponds to a position for an instance between a beginning and an ending of the work of literature, and wherein the significance value corresponds to a significance, weight or strength of an instance relative to other instances in the meta-data; for each literary element category and for each instance within each literary element category of the first work of literature, invoking by a processor a cluster finding process using a first control parameter limiting the range of index value variation and a second control parameter limiting the range of significance value variation in a found cluster; receiving by a processor from the cluster finding process one or more clusters found around one or more instances of one or more literary element categories; and storing by the processor the one or more clusters into the first cluster model for the first work of literature. | 5. The method as set forth in claim 1 wherein the accessing of a first cluster model further comprises: receiving by a processor meta-data modeling the first work of literature, the meta-data comprising one or more literary element categories, one or more instances within each literary element categories, and an index value and significance value for each instance, wherein the index value corresponds to a position for an instance between a beginning and an ending of the work of literature, and wherein the significance value corresponds to a significance, weight or strength of an instance relative to other instances in the meta-data; for each literary element category and for each instance within each literary element category of the first work of literature, invoking by a processor a cluster finding process using a first control parameter limiting the range of index value variation and a second control parameter limiting the range of significance value variation in a found cluster; receiving by a processor from the cluster finding process one or more clusters found around one or more instances of one or more literary element categories; and storing by the processor the one or more clusters into the first cluster model for the first work of literature. 11. The method as set forth in claim 5 wherein the receiving of meta-data comprises converting manually-created review information into machine-generated meta-data modeling the work of literature. | 0.883472 |
9,606,984 | 13 | 18 | 13. A computer program product encoded in a non-transitory computer-readable medium for automatic unsupervised clustering of dialog data from a natural language dialog application, the product comprising: program code for automatically generalizing structured dialog data extracted from application logs using different independent generalization methods to produce generalization identifier vectors aggregating the results of the methods used, the structured dialog data including a transcription of a dialog between a user and the natural language dialog application, the transcription being generated by the natural language dialog application, the generalization identifier vectors indicating descriptive categories of the different independent generalization methods that correspond to statements by the user and statements by the natural language dialog application included in the extracted dialog data; and program code for automatically clustering the dialog data based on the generalization identifier vectors using an unsupervised density-based clustering algorithm without a predefined number of clusters and without a predefined distance threshold. | 13. A computer program product encoded in a non-transitory computer-readable medium for automatic unsupervised clustering of dialog data from a natural language dialog application, the product comprising: program code for automatically generalizing structured dialog data extracted from application logs using different independent generalization methods to produce generalization identifier vectors aggregating the results of the methods used, the structured dialog data including a transcription of a dialog between a user and the natural language dialog application, the transcription being generated by the natural language dialog application, the generalization identifier vectors indicating descriptive categories of the different independent generalization methods that correspond to statements by the user and statements by the natural language dialog application included in the extracted dialog data; and program code for automatically clustering the dialog data based on the generalization identifier vectors using an unsupervised density-based clustering algorithm without a predefined number of clusters and without a predefined distance threshold. 18. The product according to claim 13 , wherein clustering algorithm is an iterative clustering algorithm. | 0.844575 |
8,407,231 | 15 | 19 | 15. A non-transitory computer-readable storage medium having computer-readable instructions stored thereon, the computer-readable instructions comprising: one or more instructions to receive history data for a document, the history data comprising an appearance date for each of a plurality of links to document; one or more instructions to determine, from the history data, that there has been a decrease in a rate or quantity of appearances of new links that point to the document over time, and then classify the document as stale, the one or more instructions to determine that there has been a decrease in the rate or quantity of appearances of new links that point to the document over time, including: one or more instructions to compare an oldest appearance date, of the appearance dates of the links to the document, to an oldest appearance date of the appearance dates of a group of newest links to the document, each link in the group of newest links to the document having an appearance date that is within a percentage of most recent appearance dates of the links to the document; one or more instructions to decrease, based on classifying the document as stale, an initial score for the document, resulting in an altered score; and one or more instructions to rank the document with regard to at least one other document based on the altered score. | 15. A non-transitory computer-readable storage medium having computer-readable instructions stored thereon, the computer-readable instructions comprising: one or more instructions to receive history data for a document, the history data comprising an appearance date for each of a plurality of links to document; one or more instructions to determine, from the history data, that there has been a decrease in a rate or quantity of appearances of new links that point to the document over time, and then classify the document as stale, the one or more instructions to determine that there has been a decrease in the rate or quantity of appearances of new links that point to the document over time, including: one or more instructions to compare an oldest appearance date, of the appearance dates of the links to the document, to an oldest appearance date of the appearance dates of a group of newest links to the document, each link in the group of newest links to the document having an appearance date that is within a percentage of most recent appearance dates of the links to the document; one or more instructions to decrease, based on classifying the document as stale, an initial score for the document, resulting in an altered score; and one or more instructions to rank the document with regard to at least one other document based on the altered score. 19. The non-transitory computer-readable storage medium of claim 15 , where the history data is first history data, and where the document is a first document, where the computer-readable instructions further comprise: one or more instructions to receive second history data for a second document, the second history data comprising an appearance date for each of a plurality of links to the second document; one or more instructions to determine, from the second history data, that there has been an increase in a rate or quantity of appearances of new links that point to the second document over time; one or more instructions to classify the second document as fresh based on determining that there has been an increase in the rate or quantity of appearances of new links that point to the second document over time; and one or more instructions to increase an initial score for the second document based on classifying the second document as fresh. | 0.501569 |
8,918,309 | 9 | 10 | 9. A physical, non-transitory computer storage medium having stored thereon a sequence of instructions which when executed by a computer system cause said computer system to perform a method for identifying word combinations in a source language and corresponding likely translations in a target language, the instructions comprising: acquiring, by one or more processors, a text in the source language and a text in the target language, wherein the text in the source language is a translation of the text in the target language; performing, by one or more processors, semantic analysis on the acquired text in the source language to build deep semantic structures of one or more sentences of the acquired text in the source language, where the deep semantic structures comprise language-independent semantic classes and deep slots; performing, by one or more processors, semantic analysis on the acquired text in the target language to build deep semantic structures of one or more sentences of the acquired text in the target language, where the deep semantic structures comprise language-independent semantic classes and deep slots; matching, by one or more processors, the deep semantic structures of the sentences in the text in the source language to the deep semantic structures of the sentences in the text in the target language; determining, by one or more processors, a correspondence between deep structure elements for sentences with essentially matching deep structures; and identifying, by one or more processors, word combinations in the source and the target languages that substantially often match into each other through corresponding deep structure elements as likely translations. | 9. A physical, non-transitory computer storage medium having stored thereon a sequence of instructions which when executed by a computer system cause said computer system to perform a method for identifying word combinations in a source language and corresponding likely translations in a target language, the instructions comprising: acquiring, by one or more processors, a text in the source language and a text in the target language, wherein the text in the source language is a translation of the text in the target language; performing, by one or more processors, semantic analysis on the acquired text in the source language to build deep semantic structures of one or more sentences of the acquired text in the source language, where the deep semantic structures comprise language-independent semantic classes and deep slots; performing, by one or more processors, semantic analysis on the acquired text in the target language to build deep semantic structures of one or more sentences of the acquired text in the target language, where the deep semantic structures comprise language-independent semantic classes and deep slots; matching, by one or more processors, the deep semantic structures of the sentences in the text in the source language to the deep semantic structures of the sentences in the text in the target language; determining, by one or more processors, a correspondence between deep structure elements for sentences with essentially matching deep structures; and identifying, by one or more processors, word combinations in the source and the target languages that substantially often match into each other through corresponding deep structure elements as likely translations. 10. The physical, non-transitory computer storage medium of claim 9 further comprising using the likely translations to generate additional translation rules. | 0.868771 |
8,751,422 | 3 | 5 | 3. The system of claim 1 , wherein the dynamic string analysis handler further comprises: a plurality of selection rules that define adjustments to the dynamic selection of the string analysis algorithm by the dynamic string analysis handler; a heuristic selection processor configured to employ the heuristic strategy of the dynamic string analysis handler to select the string analysis algorithm, wherein the selection of the string analysis algorithm by the heuristic selection processor utilizes the plurality of contextual metadata associated with the string query and the plurality of selection rules. | 3. The system of claim 1 , wherein the dynamic string analysis handler further comprises: a plurality of selection rules that define adjustments to the dynamic selection of the string analysis algorithm by the dynamic string analysis handler; a heuristic selection processor configured to employ the heuristic strategy of the dynamic string analysis handler to select the string analysis algorithm, wherein the selection of the string analysis algorithm by the heuristic selection processor utilizes the plurality of contextual metadata associated with the string query and the plurality of selection rules. 5. The system of claim 3 , wherein at least one of the plurality of selection rules is user-configurable, wherein said user-configuration represents a preference for using the plurality of string analysis algorithms in different contexts. | 0.97196 |
7,507,902 | 9 | 10 | 9. The instrument according to claim 1 , wherein said multi-channel processing system includes a signal processor, wherein said signal processor generates an outgoing control signal in response to transducer signals generated by at least one of said plurality of vibration-sensing transducers. | 9. The instrument according to claim 1 , wherein said multi-channel processing system includes a signal processor, wherein said signal processor generates an outgoing control signal in response to transducer signals generated by at least one of said plurality of vibration-sensing transducers. 10. The instrument according to claim 9 , wherein said outgoing control signal comprises signals of MIDI format. | 0.954839 |
7,930,309 | 1 | 11 | 1. A method of operating an apparatus, including instructions, the method comprising: (a) receiving a document which includes: (i) an internal structure including: (A) a first element having a first active value; and (B) a second element having a second active value; and (ii) first characteristic information; (b) causing a processor to execute the instructions to diffuse the first active value and the second active value; (c) causing the processor to execute the instructions to, using the diffused first active value and the diffused second active value, extract the first characteristic information having post-diffusion active values larger than pre-set threshold values; (d) causing the processor to execute the instructions to operate with an input device to enable a user to form a plurality of classification items which have second characteristic information; (e) causing the processor to execute the instructions to, using the formed plurality of classification items, prepare a classification model; (f) causing the processor to execute the instructions to determine a degree of interrelation between the extracted first characteristic information and the second characteristic information; (g) causing the processor to execute the instructions to determine whether the determined degree exceeds a threshold value; (h) in response to the determined degree exceeding the threshold value, causing the processor to execute the instructions to, using the prepared classification model, automatically classify the document into one of the formed plurality of classification items; (i) in response to the document being automatically classified, causing the processor to execute the instructions to update the classification model based on the classification of the document, wherein a weight is imparted to each element based on the internal structure of said document; and (j) causing the processor to execute the instructions to extract an element having the weight larger than a pre-set value. | 1. A method of operating an apparatus, including instructions, the method comprising: (a) receiving a document which includes: (i) an internal structure including: (A) a first element having a first active value; and (B) a second element having a second active value; and (ii) first characteristic information; (b) causing a processor to execute the instructions to diffuse the first active value and the second active value; (c) causing the processor to execute the instructions to, using the diffused first active value and the diffused second active value, extract the first characteristic information having post-diffusion active values larger than pre-set threshold values; (d) causing the processor to execute the instructions to operate with an input device to enable a user to form a plurality of classification items which have second characteristic information; (e) causing the processor to execute the instructions to, using the formed plurality of classification items, prepare a classification model; (f) causing the processor to execute the instructions to determine a degree of interrelation between the extracted first characteristic information and the second characteristic information; (g) causing the processor to execute the instructions to determine whether the determined degree exceeds a threshold value; (h) in response to the determined degree exceeding the threshold value, causing the processor to execute the instructions to, using the prepared classification model, automatically classify the document into one of the formed plurality of classification items; (i) in response to the document being automatically classified, causing the processor to execute the instructions to update the classification model based on the classification of the document, wherein a weight is imparted to each element based on the internal structure of said document; and (j) causing the processor to execute the instructions to extract an element having the weight larger than a pre-set value. 11. The method of claim 1 , which includes causing the processor to execute the instructions to operate with the input device to enable the user to add, change, and delete the classification items. | 0.74349 |
9,892,189 | 6 | 7 | 6. The method of claim 1 , wherein calculating the final probability for each category comprises averaging the token probabilities corresponding to the category. | 6. The method of claim 1 , wherein calculating the final probability for each category comprises averaging the token probabilities corresponding to the category. 7. The method of claim 6 , wherein calculating the final probability for each category further comprises determining, from a supplemental data model, a coefficient for each token; and modifying the token probability for each token by the token's coefficient before averaging the token probabilities. | 0.905738 |
9,582,591 | 1 | 4 | 1. A method executed by a processor of a computing device, the method comprising: generating a graphical summary of a research document for presentment on a display of a computing device in response to receipt of user input that identifies the research document, the research document having a publication date assigned thereto that indicates a date upon which the research document was published, the graphical summary of the research document is based upon content from other research documents, the other research documents include citations to the research document, the other research documents having publication dates that are subsequent to the publication date of the research document, the graphical summary of the research document comprises: a node that is representative of the research document; and portions of sentences in the other research documents that include the citations to the research document; and presenting the graphical summary of the research document on the display of the computing device. | 1. A method executed by a processor of a computing device, the method comprising: generating a graphical summary of a research document for presentment on a display of a computing device in response to receipt of user input that identifies the research document, the research document having a publication date assigned thereto that indicates a date upon which the research document was published, the graphical summary of the research document is based upon content from other research documents, the other research documents include citations to the research document, the other research documents having publication dates that are subsequent to the publication date of the research document, the graphical summary of the research document comprises: a node that is representative of the research document; and portions of sentences in the other research documents that include the citations to the research document; and presenting the graphical summary of the research document on the display of the computing device. 4. The method of claim 1 , wherein the graphical summary of the research document further comprises: a second node that represents a citation to the research document in a second research document, the second research document included in the other research documents; and an edge that couples the node to the second node in the graphical summary of the research document. | 0.643678 |
7,983,478 | 1 | 3 | 1. A method for handwritten character generation, implemented at least in part by a computing device, the method comprising: receiving a character; and generating a corresponding handwritten character using Hidden Markov Models trained to generate handwritten characters, the generating including using a Multi-Space Probability Distribution technique that includes a probability for determining whether a stroke is real or imaginary. | 1. A method for handwritten character generation, implemented at least in part by a computing device, the method comprising: receiving a character; and generating a corresponding handwritten character using Hidden Markov Models trained to generate handwritten characters, the generating including using a Multi-Space Probability Distribution technique that includes a probability for determining whether a stroke is real or imaginary. 3. The method of claim 1 , wherein the Hidden Markov Models comprise Hidden Markov Models trained using slope, curvature and imaginary stroke features. | 0.857815 |
5,429,513 | 5 | 6 | 5. The teaching apparatus of claim 4 wherein said colors further comprise a second color corresponding to said graphemes characterized by voiced sound production, a third color corresponding to said graphemes characterized by unvoiced sound production, a fourth color corresponding to said graphemes characterized by nasal sound production, and a fifth color corresponding to said graphemes characterized by a mixture of characteristics of sound production. | 5. The teaching apparatus of claim 4 wherein said colors further comprise a second color corresponding to said graphemes characterized by voiced sound production, a third color corresponding to said graphemes characterized by unvoiced sound production, a fourth color corresponding to said graphemes characterized by nasal sound production, and a fifth color corresponding to said graphemes characterized by a mixture of characteristics of sound production. 6. The teaching apparatus of claim 5 wherein said first color is red, said second color is pink, said third color is yellow, said fourth color is green, and said fifth color is blue. | 0.952505 |
8,972,872 | 1 | 3 | 1. An apparatus providing a plurality of computing sources of functionality, each computing source of functionality presenting a service and existing in a computing environment of the apparatus, in a computing environment in network communication with the apparatus, or in any combinations thereof, the apparatus comprising: a computer processor; and a non-transitory computer readable storage medium which stores instructions, which when executed by the computer processor, cause the computer processor to execute: dynamically discover one or more semantic service descriptions (SSDs) as known services through a plurality of discovery mechanisms discovering the SSDs, an SSD including a semantic description of the service and a semantic description of a parameter of the service, according to a computer interpretable language, and as a service grounding, mapping information between the computer interpretable language expressing the SSD and an interface, including an interface parameter, of the service; support dynamic composition of a task composed of a plurality of the discovered known services based upon a task composer selection of a plurality of the discovered known services; and dynamically output a specification of association of user interface (UI) objects, user interface (UI) events and user interface (UI) display screens to a selected composed tasks responsive to selection of a UI object and association of the selected UI object with a selected UI event to a selected UI display screen from selectable lists of one or more UI objects, UI events and UI display screens and selection of a composed task from among composed task candidates identified based upon input/output of a composed task and input/output of the selected UI object associated with the UI event to the UI display screen, thereby the selected composed task is executable upon displaying of the selected UI display screen and upon action on the selected UI event associated with the selected UI object displayed in the displayed selected UI display screen, wherein a UI object corresponds to an SSD as a discovered known service included in the selected composed task, wherein the specification of association of the UI objects, the UI events and the UI display screens to the selected composed tasks comprises generating a matrix of the selected UI object, the selected UI display screen for the selected UI object, the selected UI event for the selected UI object and the selected composed task. | 1. An apparatus providing a plurality of computing sources of functionality, each computing source of functionality presenting a service and existing in a computing environment of the apparatus, in a computing environment in network communication with the apparatus, or in any combinations thereof, the apparatus comprising: a computer processor; and a non-transitory computer readable storage medium which stores instructions, which when executed by the computer processor, cause the computer processor to execute: dynamically discover one or more semantic service descriptions (SSDs) as known services through a plurality of discovery mechanisms discovering the SSDs, an SSD including a semantic description of the service and a semantic description of a parameter of the service, according to a computer interpretable language, and as a service grounding, mapping information between the computer interpretable language expressing the SSD and an interface, including an interface parameter, of the service; support dynamic composition of a task composed of a plurality of the discovered known services based upon a task composer selection of a plurality of the discovered known services; and dynamically output a specification of association of user interface (UI) objects, user interface (UI) events and user interface (UI) display screens to a selected composed tasks responsive to selection of a UI object and association of the selected UI object with a selected UI event to a selected UI display screen from selectable lists of one or more UI objects, UI events and UI display screens and selection of a composed task from among composed task candidates identified based upon input/output of a composed task and input/output of the selected UI object associated with the UI event to the UI display screen, thereby the selected composed task is executable upon displaying of the selected UI display screen and upon action on the selected UI event associated with the selected UI object displayed in the displayed selected UI display screen, wherein a UI object corresponds to an SSD as a discovered known service included in the selected composed task, wherein the specification of association of the UI objects, the UI events and the UI display screens to the selected composed tasks comprises generating a matrix of the selected UI object, the selected UI display screen for the selected UI object, the selected UI event for the selected UI object and the selected composed task. 3. The apparatus according to claim 1 , wherein the association of the selected UI object with the selected UI event to the selected UI display screen comprises: associating metadata with a UI object, presenting to the task composer selectable UI objects based upon the metadata, upon selection of one of the UI objects, presenting to the task composer the list of selectable UI display screens in which the selected UI object appears, upon selection of one of the UI display screens presenting to the task composer selectable UI events for the selected UI object in the selected UI display screen, and upon selection of one of the UI events, presenting to the task composer selectable tasks for associating with the selected UI event, based upon inputs and/or outputs of tasks and inputs and/or outputs of the selected UI event. | 0.500602 |
8,799,257 | 1 | 8 | 1. A method comprising: receiving, by one or more computer devices, a search query from a client, the search query including a plurality of terms entered by a user of the client, the plurality of terms including: a first term related to a topic of a web page, a second term related to a first keyword of a plurality of keywords, a third term related to a second keyword of the plurality of keywords, the plurality of keywords corresponding to a plurality of visual features, the plurality of visual features including: a color of a background of the web page, a feature relating to an image in the web page, and at least one of: a color or a size of text in the web page, or a feature relating to a video in the web page, the first keyword relating to a first visual feature of the plurality of visual features, the second keyword relating to a second visual feature of the plurality of visual features, one of the first visual feature or the second visual feature including the color of the background of the web page, and a fourth term to be searched in relation to the one of the first visual feature or the second visual feature, an index associating the plurality of keywords with information identifying the web page; converting, by the one or more computer devices, a format of the second term to a format of the first keyword in the index when the format of the second term does not match the format of the first keyword; identifying, by the one or more computer devices, documents based on the search query and using the index, the identified documents including the web page; and providing, by the one or more computer devices, a search results document to the client, the search results document identifying one or more of the identified documents. | 1. A method comprising: receiving, by one or more computer devices, a search query from a client, the search query including a plurality of terms entered by a user of the client, the plurality of terms including: a first term related to a topic of a web page, a second term related to a first keyword of a plurality of keywords, a third term related to a second keyword of the plurality of keywords, the plurality of keywords corresponding to a plurality of visual features, the plurality of visual features including: a color of a background of the web page, a feature relating to an image in the web page, and at least one of: a color or a size of text in the web page, or a feature relating to a video in the web page, the first keyword relating to a first visual feature of the plurality of visual features, the second keyword relating to a second visual feature of the plurality of visual features, one of the first visual feature or the second visual feature including the color of the background of the web page, and a fourth term to be searched in relation to the one of the first visual feature or the second visual feature, an index associating the plurality of keywords with information identifying the web page; converting, by the one or more computer devices, a format of the second term to a format of the first keyword in the index when the format of the second term does not match the format of the first keyword; identifying, by the one or more computer devices, documents based on the search query and using the index, the identified documents including the web page; and providing, by the one or more computer devices, a search results document to the client, the search results document identifying one or more of the identified documents. 8. The method of claim 1 , further comprising: generating the plurality of keywords based on the plurality of visual features, where generating the plurality of keywords includes: extracting information from hypertext markup language code associated with the web page, and generating one or more of the plurality of keywords further based on the extracted information. | 0.77724 |
7,962,331 | 13 | 18 | 13. The method of claim 1 , further comprising determining, based at least in part on the transcript and the information associated with the decode, a modification of the speech recognizer to improve its performance. | 13. The method of claim 1 , further comprising determining, based at least in part on the transcript and the information associated with the decode, a modification of the speech recognizer to improve its performance. 18. The method of claim 13 , further comprising making a modification to the speech recognizer. | 0.937335 |
9,507,826 | 4 | 7 | 4. The method of claim 2 , wherein determining that the first search query is a search query for which real-time search results should be returned comprises: receiving data for the first search query; generating one or more scores from the data; and determining that each of the one or more scores satisfies a respective threshold. | 4. The method of claim 2 , wherein determining that the first search query is a search query for which real-time search results should be returned comprises: receiving data for the first search query; generating one or more scores from the data; and determining that each of the one or more scores satisfies a respective threshold. 7. The method of claim 4 , wherein the data includes trend data on how often the first search query is submitted by users. | 0.948653 |
6,106,574 | 3 | 4 | 3. The process as in claim 2 where there is no root source table further including the step of constructing a coarse table and making it said root source table. | 3. The process as in claim 2 where there is no root source table further including the step of constructing a coarse table and making it said root source table. 4. The process as in claim 3 further including the steps of: a. determining if there is available space for said source range in said source table, and if not; b. constructing a coarse table containing said root source table; c. making said coarse table constructed in the preceding step said root source table; and, d. inserting said source range into said source table. | 0.916328 |
9,135,653 | 77 | 78 | 77. The method of claim 57 wherein the receiving first activity information for a sender of a first link to at least one recipient comprises: sending of an e-mail including the first link by the sender via a mobile device. | 77. The method of claim 57 wherein the receiving first activity information for a sender of a first link to at least one recipient comprises: sending of an e-mail including the first link by the sender via a mobile device. 78. The method of claim 77 wherein the receiving second activity information when a recipient accesses the first link sent by the sender comprises: receiving of the e-mail including the first link by the recipient via a mobile device. | 0.943478 |
8,380,705 | 16 | 17 | 16. The system of claim 15 , wherein the operations further comprise, for a particular related search query from the one or more related search queries, normalizing the weighted click data for the document and the particular related search query by dividing the weighted click data for the document and the particular related search query by a number of times the related search query was received over the period of time; wherein combining the weighted click data comprises combining normalized weighted click data for the document and the one or more related search queries. | 16. The system of claim 15 , wherein the operations further comprise, for a particular related search query from the one or more related search queries, normalizing the weighted click data for the document and the particular related search query by dividing the weighted click data for the document and the particular related search query by a number of times the related search query was received over the period of time; wherein combining the weighted click data comprises combining normalized weighted click data for the document and the one or more related search queries. 17. The system of claim 16 , wherein combining the normalized weighted click data comprises summing the normalized weighted click data for the one or more related search queries. | 0.918944 |
7,552,864 | 9 | 10 | 9. The method according to claim 7 , wherein the documents divided into the third sorting class are transferred to a testing device and subjected there to further authenticity testing, in particular using further authenticity criteria. | 9. The method according to claim 7 , wherein the documents divided into the third sorting class are transferred to a testing device and subjected there to further authenticity testing, in particular using further authenticity criteria. 10. The method according to claim 9 , wherein those of the documents tested in the central testing device that are fit or ATM-fit and meet the authenticity criteria of authenticity testing in the central testing unit are provided for a further use. | 0.918152 |
9,135,240 | 8 | 9 | 8. The method as claimed in claim 5 , wherein said vector propagating comprises: for a known LSA concept vector c i , applying a formula against data of said undirected graph, said formula comprising: c -> i ′ = c -> i + ∑ c i ∈ N ( c ) c -> i w ( c , c i ) d ( c i ) _ _ where c is a neighbor vector concept, {right arrow over (c)} i , is the concept vector propagated against the graph, {right arrow over (c)}′ i is a new concept vector, w(c, c i ) is the number of semantic relations involving concepts c and c i , and d(c) is an average vector. | 8. The method as claimed in claim 5 , wherein said vector propagating comprises: for a known LSA concept vector c i , applying a formula against data of said undirected graph, said formula comprising: c -> i ′ = c -> i + ∑ c i ∈ N ( c ) c -> i w ( c , c i ) d ( c i ) _ _ where c is a neighbor vector concept, {right arrow over (c)} i , is the concept vector propagated against the graph, {right arrow over (c)}′ i is a new concept vector, w(c, c i ) is the number of semantic relations involving concepts c and c i , and d(c) is an average vector. 9. The method as claimed in claim 8 , wherein the applying said vector propagation formula comprises: given a concept vector “c”, identifying the vectors for the concept in graph; computing an average of those identified vectors, and replacing the original concept vector c with new vector average. | 0.631188 |
9,514,746 | 1 | 14 | 1. A speech recognition and control system for controlling a medical device in an operating room, comprising: a medical device; a microphone receiving an audio input including one or more speech commands; an event detector analyzing the audio input and identifying at least one event of the audio input; a database including a plurality of rules, a first one of the plurality of rules immediately stopping a system or device activity as soon as it detects that the one or more speech commands is begun within a predetermined period of time after the activity was commenced, and a second one of the plurality of rules alerting if a disconnection with the microphone is detected; and a controller adapted to determine a system status including actions currently being performed by devices; the controller further adapted to determine whether or not hazard mitigation is necessary based on a comparison of the at least one event, at least one rule and the system status; if having determined that hazard mitigation is necessary, the controller sending a control command to the medical device instructing it to perform an action. | 1. A speech recognition and control system for controlling a medical device in an operating room, comprising: a medical device; a microphone receiving an audio input including one or more speech commands; an event detector analyzing the audio input and identifying at least one event of the audio input; a database including a plurality of rules, a first one of the plurality of rules immediately stopping a system or device activity as soon as it detects that the one or more speech commands is begun within a predetermined period of time after the activity was commenced, and a second one of the plurality of rules alerting if a disconnection with the microphone is detected; and a controller adapted to determine a system status including actions currently being performed by devices; the controller further adapted to determine whether or not hazard mitigation is necessary based on a comparison of the at least one event, at least one rule and the system status; if having determined that hazard mitigation is necessary, the controller sending a control command to the medical device instructing it to perform an action. 14. The system of claim 1 , wherein a third one of the plurality of rules alerts if implementing the one or more speech commands would result in an unsafe condition. | 0.867788 |
7,930,166 | 11 | 15 | 11. A translation supporting method for supporting a process of a computer translating an original sentence, the translation supporting method comprising: setting a first character string contained in the original sentence in a first language as a first original sentence partial expression; setting, as a first original sentence dummy head in the first language, a second character string that is in the first language, that is shorter than the first original sentence partial expression, and that semantically or syntactically represents the first original sentence partial expression; generating a first original skeleton sentence by replacing the first original sentence partial expression in the original sentence with the first original sentence dummy head; obtaining a first translated skeleton sentence which is a translation of the first original skeleton sentence translated from the first language into a second language; obtaining a first translated partial expression which is a translation of the first original sentence partial expression translated from the first language into the second language; generating a translation in the second language of the original sentence by replacing a first translation dummy head which is a translation in the second language of the first original sentence dummy head and which is contained in the first translated skeleton sentence with the first translated partial expression; outputting the generated translation in the second language of the original sentence to a translated sentence storage unit; and controlling an output device to enable the original sentence partial expression to be output to a first window different from a second window in which the original sentence is displayed. | 11. A translation supporting method for supporting a process of a computer translating an original sentence, the translation supporting method comprising: setting a first character string contained in the original sentence in a first language as a first original sentence partial expression; setting, as a first original sentence dummy head in the first language, a second character string that is in the first language, that is shorter than the first original sentence partial expression, and that semantically or syntactically represents the first original sentence partial expression; generating a first original skeleton sentence by replacing the first original sentence partial expression in the original sentence with the first original sentence dummy head; obtaining a first translated skeleton sentence which is a translation of the first original skeleton sentence translated from the first language into a second language; obtaining a first translated partial expression which is a translation of the first original sentence partial expression translated from the first language into the second language; generating a translation in the second language of the original sentence by replacing a first translation dummy head which is a translation in the second language of the first original sentence dummy head and which is contained in the first translated skeleton sentence with the first translated partial expression; outputting the generated translation in the second language of the original sentence to a translated sentence storage unit; and controlling an output device to enable the original sentence partial expression to be output to a first window different from a second window in which the original sentence is displayed. 15. The translation supporting method according to claim 11 , further comprising generating translation-with-original information by associating an original sentence partial expression with a translated partial expression of the original sentence partial expression; accumulating and storing the translation-with-original information in a translation-with-original storage unit; and retrieving translation-with-original information including an original sentence partial expression matching at least a part of a third original sentence partial expression from the translation-with-original storage unit, wherein the retrieved translation-with-original information is used when a third translated partial expression corresponding to the third original sentence partial expression is obtained. | 0.722066 |
10,091,318 | 7 | 8 | 7. One or more computer-readable non-transitory storage media embodying software that is operable when executed to: rank a plurality of users of a social-networking system based on one or more criteria associated with a spotlight content item, wherein the spotlight content item is associated with a node in a social graph associated with the social-networking system, and wherein at least one of the criteria is based on social-networking information for each of the users; verify the ranked users, wherein the verifying comprises confirming one or more of the ranked users based on recent interactions by the ranked users with social-networking information corresponding to the node associated with the spotlight content item; and send a notification about the spotlight content item to each of the confirmed users in accordance with a batching protocol, wherein the batching protocol is determined based at least in part on rankings for each of the confirmed users, and wherein the software operable when executed to send a notification about the spotlight content item comprises software that is operable when executed to: sort the confirmed users into a plurality of batches based on the batching protocol; and distribute the notification to each of the batches of the confirmed users in a parallel manner using a clustered computing system. | 7. One or more computer-readable non-transitory storage media embodying software that is operable when executed to: rank a plurality of users of a social-networking system based on one or more criteria associated with a spotlight content item, wherein the spotlight content item is associated with a node in a social graph associated with the social-networking system, and wherein at least one of the criteria is based on social-networking information for each of the users; verify the ranked users, wherein the verifying comprises confirming one or more of the ranked users based on recent interactions by the ranked users with social-networking information corresponding to the node associated with the spotlight content item; and send a notification about the spotlight content item to each of the confirmed users in accordance with a batching protocol, wherein the batching protocol is determined based at least in part on rankings for each of the confirmed users, and wherein the software operable when executed to send a notification about the spotlight content item comprises software that is operable when executed to: sort the confirmed users into a plurality of batches based on the batching protocol; and distribute the notification to each of the batches of the confirmed users in a parallel manner using a clustered computing system. 8. The media of claim 7 , wherein the criteria associated with the spotlight content item comprise: a type of relationship between a node representing each user and the node associated with the spotlight content item; an interaction history between each user and the node associated with the spotlight content item; or an interaction history between each user and one or more content items determined to be similar to the spotlight content item. | 0.679395 |
10,061,773 | 2 | 5 | 2. The computer-implemented method of claim 1 wherein determining whether the first parser is able to parse the nested document comprises determining whether the first field comprising the nested document is of a data type that is associated with the first content type and different than the second content type. | 2. The computer-implemented method of claim 1 wherein determining whether the first parser is able to parse the nested document comprises determining whether the first field comprising the nested document is of a data type that is associated with the first content type and different than the second content type. 5. The computer-implemented method of claim 2 further comprising: selecting the second parser based on the second content type of the nested document if the data type of the first field comprising the nested document is not associated with the first content type; and parsing the nested document using the second parser. | 0.91356 |
4,658,370 | 1 | 6 | 1. A knowledge engineering tool comprising a computer having a stored program and memory for storing a knowledge base, said knowledge base including factual knowledge and judgmental knowledge, said judgmental knowledge including judgmental rules having premises for limiting the conditions in which the rules are applicable and conclusions for indicating the actions to perform when the rules are successfully applied, said factual knowledge including definitions of attributes that can take on values, said judgmental rules including rules having premises referring to attributes and rules concluding values for attributes, means for executing a built-in control procedure including means for interpreting the knowledge base, means for invoking and chaining said rules, and means for terminating the knowledge base search for a value, said knowledge base also including control knowledge supplied by a knowledge engineer to modify the built-in control procedure, and a language interpreter for executing the control knowledge to modify the built-in control procedure, whereby the control knowledge can be separated from the factual knowledge and judgmental knowledge and stored as a distinct portion of the knowledge base. | 1. A knowledge engineering tool comprising a computer having a stored program and memory for storing a knowledge base, said knowledge base including factual knowledge and judgmental knowledge, said judgmental knowledge including judgmental rules having premises for limiting the conditions in which the rules are applicable and conclusions for indicating the actions to perform when the rules are successfully applied, said factual knowledge including definitions of attributes that can take on values, said judgmental rules including rules having premises referring to attributes and rules concluding values for attributes, means for executing a built-in control procedure including means for interpreting the knowledge base, means for invoking and chaining said rules, and means for terminating the knowledge base search for a value, said knowledge base also including control knowledge supplied by a knowledge engineer to modify the built-in control procedure, and a language interpreter for executing the control knowledge to modify the built-in control procedure, whereby the control knowledge can be separated from the factual knowledge and judgmental knowledge and stored as a distinct portion of the knowledge base. 6. A knowledge engineering tool as set forth in claim 1 which includes means for declaring classes of objects, means for declaring a vector of said classes for each of said attributes, and means for creating instances of said classes. | 0.957377 |
7,886,223 | 3 | 4 | 3. The method according to claim 2 , wherein if said located node is determined not to be a predefined type, a respective type tree corresponding to the type of said located node is retrieved and merged with said located node. | 3. The method according to claim 2 , wherein if said located node is determined not to be a predefined type, a respective type tree corresponding to the type of said located node is retrieved and merged with said located node. 4. The method according to claim 3 , further comprising designating said located node merged with said retrieved type tree as said root node. | 0.931686 |
7,945,600 | 20 | 21 | 20. The system of claim 13 wherein the processor is configured to: for at least one folder in the hierarchical collection of folders, organize electronic documents grouped in the at least one folder into an organized list of electronic documents such that related electronic documents occur next to each other in the organized list. | 20. The system of claim 13 wherein the processor is configured to: for at least one folder in the hierarchical collection of folders, organize electronic documents grouped in the at least one folder into an organized list of electronic documents such that related electronic documents occur next to each other in the organized list. 21. The system of claim 20 wherein the processor is configured to: assign a document number to each electronic document grouped in the at least one folder based upon the set of rules pertaining to document similarity, such that when the electronic documents grouped in the at least one folder are sorted based upon the assigned numbers to generate the organized list of electronic documents, related electronic documents occur consecutively in the organized list of electronic documents. | 0.891633 |
8,117,208 | 9 | 10 | 9. The method of claim 8 , wherein the Boolean pattern analysis is at least partly based on evaluation of the documents against a matching pattern associated with one or more of the entity types, the matching pattern specifying how entities having the entity types and the one or more keywords associated therewith are to appear in relation to each other within one of the documents in order to qualify as an instance of the entity tuple comprised of entities of each of the entity types during the searching step. | 9. The method of claim 8 , wherein the Boolean pattern analysis is at least partly based on evaluation of the documents against a matching pattern associated with one or more of the entity types, the matching pattern specifying how entities having the entity types and the one or more keywords associated therewith are to appear in relation to each other within one of the documents in order to qualify as an instance of the entity tuple comprised of entities of each of the entity types during the searching step. 10. The method of claim 9 , wherein the matching pattern specifies at least one textual relationship. | 0.961626 |
9,620,028 | 31 | 38 | 31. A method for grouping participants in a social network utilizing computers having nodes and storage comprising the steps of: in a social network having linked computers, gathering information for at least two participants on the social network via at least one of the computers, and assigning each participant to a computer node; identifying an original state for each computer node via at least another of the computers; identifying similarly-situated participants by identifying similarly-situated computer nodes in the social network via the at least another of the computers; for each of the computer nodes having a new state at some point in time that is a change in state from the original state, identifying the new state for each of the computer nodes having the new state via at least another of the computers wherein the new state is different than the original state and indicates a state change; identifying the change to the computer node's new state from the original state of each computer node that was assigned to each of the similarly-situated participants via the at least another of the computers after the state change; storing on the storage, information about the identified state change; and grouping similarly-situated participants assigned to computer nodes into a group based at least in part on the state change. | 31. A method for grouping participants in a social network utilizing computers having nodes and storage comprising the steps of: in a social network having linked computers, gathering information for at least two participants on the social network via at least one of the computers, and assigning each participant to a computer node; identifying an original state for each computer node via at least another of the computers; identifying similarly-situated participants by identifying similarly-situated computer nodes in the social network via the at least another of the computers; for each of the computer nodes having a new state at some point in time that is a change in state from the original state, identifying the new state for each of the computer nodes having the new state via at least another of the computers wherein the new state is different than the original state and indicates a state change; identifying the change to the computer node's new state from the original state of each computer node that was assigned to each of the similarly-situated participants via the at least another of the computers after the state change; storing on the storage, information about the identified state change; and grouping similarly-situated participants assigned to computer nodes into a group based at least in part on the state change. 38. The method of claim 31 further providing tailoring a set of content to each participant based on the stored information. | 0.831978 |
9,671,817 | 18 | 19 | 18. The method of claim 17 , further comprising adding the phase offset value to an output of a phase accumulator located on the DDS device. | 18. The method of claim 17 , further comprising adding the phase offset value to an output of a phase accumulator located on the DDS device. 19. The method of claim 18 , further comprising: providing a sum of the phase offset value and the output of the phase accumulator to a phase-to-amplitude converter; and providing an output of the phase-to-amplitude converter to a digital analog converter (DAC) that outputs a waveform having a frequency and phase specified by the new frequency tuning word. | 0.798423 |
9,582,591 | 12 | 14 | 12. A system, comprising: at least one processor; and memory that stores instructions that, when executed by the at least one processor, cause the at least one processor to perform acts comprising: receiving user input that is indicative of a first research document, the first research document is authored by an author and has a publication date, the publication date indicative of a date upon which the first research document was published, wherein a second research document comprises a sentence that includes a citation to the first research document, the second research document has a publication date that is subsequent to the publication date of the first research document; and in response to receipt of the user input, generating a graphical summary of the first research document, the graphical summary comprising portions of sentences included in research documents having publication dates that are subsequent to the publication date of the first research document, the portions of the sentences comprising a portion of the sentence in the second research document that includes the citation to the first research document. | 12. A system, comprising: at least one processor; and memory that stores instructions that, when executed by the at least one processor, cause the at least one processor to perform acts comprising: receiving user input that is indicative of a first research document, the first research document is authored by an author and has a publication date, the publication date indicative of a date upon which the first research document was published, wherein a second research document comprises a sentence that includes a citation to the first research document, the second research document has a publication date that is subsequent to the publication date of the first research document; and in response to receipt of the user input, generating a graphical summary of the first research document, the graphical summary comprising portions of sentences included in research documents having publication dates that are subsequent to the publication date of the first research document, the portions of the sentences comprising a portion of the sentence in the second research document that includes the citation to the first research document. 14. The system of claim 12 , the acts further comprising locating the sentence in the second research document that includes the citation to the first research document. | 0.791358 |
9,619,812 | 9 | 12 | 9. A method of engaging an audience in a conversational advertisement, wherein the method is performed by a computing system having a processor and a memory, the method comprising: identifying, at a server computer, a conversational advertisement to present to an audience via a client device in response to a received indication to present an advertisement, wherein the conversational advertisement is selected from multiple conversational advertisements and wherein the identified conversational advertisement provides a verbal interface such that the identified conversational advertisement provides responses, to verbal input provided to the verbal interface, that are based on an identified meaning of the verbal input to the verbal interface; orchestrating, through a first webpage, at least two initial interactions between the audience and the conversational advertisement, wherein one of the at least two initial interactions comprises: conveying, at the server computer, a first message of the conversational advertisement to the client device to be presented to the audience; and receiving, at the server computer, audio data from the client device representing a verbal response by the audience to the first message of the conversational advertisement, wherein the audio data is received through the member of the audience interacting with the first webpage; identifying, at the server computer, based on the spoken words from the audio data representing the verbal response of the audience to the first message, a particular point in a conversation with the member of the audience; and processing, at the server computer, the spoken words from the audio data representing the verbal response of the audience to the first message; determining, at the server computer, a response to convey to the audience via the client device, wherein the response to convey to the audience is determined based at least in part on the spoken words from the audio data representing the verbal response by the audience to the first message, and converting, at the server computer, the response to convey to the audience to response audio data to be played to the audience; wherein the response to convey to the member of the audience is presented on a second webpage different from the first webpage such that the response to convey to the member of the audience continues the conversational advertisement on the second webpage, picking up from the identified particular point in the conversation with the member of the audience such that the conversation with the member of the audience continues where the member of the audience left off from the at least two initial interactions with the conversational advertisement orchestrated through the first webpage. | 9. A method of engaging an audience in a conversational advertisement, wherein the method is performed by a computing system having a processor and a memory, the method comprising: identifying, at a server computer, a conversational advertisement to present to an audience via a client device in response to a received indication to present an advertisement, wherein the conversational advertisement is selected from multiple conversational advertisements and wherein the identified conversational advertisement provides a verbal interface such that the identified conversational advertisement provides responses, to verbal input provided to the verbal interface, that are based on an identified meaning of the verbal input to the verbal interface; orchestrating, through a first webpage, at least two initial interactions between the audience and the conversational advertisement, wherein one of the at least two initial interactions comprises: conveying, at the server computer, a first message of the conversational advertisement to the client device to be presented to the audience; and receiving, at the server computer, audio data from the client device representing a verbal response by the audience to the first message of the conversational advertisement, wherein the audio data is received through the member of the audience interacting with the first webpage; identifying, at the server computer, based on the spoken words from the audio data representing the verbal response of the audience to the first message, a particular point in a conversation with the member of the audience; and processing, at the server computer, the spoken words from the audio data representing the verbal response of the audience to the first message; determining, at the server computer, a response to convey to the audience via the client device, wherein the response to convey to the audience is determined based at least in part on the spoken words from the audio data representing the verbal response by the audience to the first message, and converting, at the server computer, the response to convey to the audience to response audio data to be played to the audience; wherein the response to convey to the member of the audience is presented on a second webpage different from the first webpage such that the response to convey to the member of the audience continues the conversational advertisement on the second webpage, picking up from the identified particular point in the conversation with the member of the audience such that the conversation with the member of the audience continues where the member of the audience left off from the at least two initial interactions with the conversational advertisement orchestrated through the first webpage. 12. The method of claim 9 , wherein identifying, at the server computer, a conversational advertisement to present to the audience includes identifying, at the server computer, a conversational advertisement associated with an input of the audience on the client device. | 0.8219 |
9,444,793 | 42 | 47 | 42. The system of claim 32 , wherein said processed text comprises a string of characters selected from a processed text character set, said processed text character set comprising at least one contiguous subset of the Unicode character set. | 42. The system of claim 32 , wherein said processed text comprises a string of characters selected from a processed text character set, said processed text character set comprising at least one contiguous subset of the Unicode character set. 47. The system of claim 42 , wherein said controller is configured to transform said input text deterministically by: normalizing at least one portion of said input text to obtain at least one normalized input portion by applying at least one normalization rule to said input text; deterministically transforming said at least one normalized input portion to obtain at least one transformed normalized input portions; and including said at least one transformed normalized input portion in said processed text. | 0.806672 |
8,572,511 | 22 | 24 | 22. A non-transitory computer readable medium including sequence of instructions stored thereon for causing a computer to execute a method, comprising: generating a hierarchical tree area operable to display data elements in a multi-level hierarchical tree structure, wherein the data elements are representative of searchable data in a database; and generating an information area, separate from the hierarchical tree area, operable to display information associated with a matter and operable to allow a user to enter additional information to associated with the matter and to store with the searchable data in the database in response to the user's selection of one or more data elements from the hierarchical tree area, wherein the hierarchical tree area and the information area are displayed together in a single window on a graphical user interface. | 22. A non-transitory computer readable medium including sequence of instructions stored thereon for causing a computer to execute a method, comprising: generating a hierarchical tree area operable to display data elements in a multi-level hierarchical tree structure, wherein the data elements are representative of searchable data in a database; and generating an information area, separate from the hierarchical tree area, operable to display information associated with a matter and operable to allow a user to enter additional information to associated with the matter and to store with the searchable data in the database in response to the user's selection of one or more data elements from the hierarchical tree area, wherein the hierarchical tree area and the information area are displayed together in a single window on a graphical user interface. 24. The non-transitory computer readable medium of claim 22 , wherein the multi-level hierarchical tree structure is operable to organize data into a plurality of levels, wherein each sub-level provides a more specific description of the data than a level above. | 0.848204 |
7,519,568 | 1 | 4 | 1. A computer-implemented method comprising: selecting at least one rule included in an operational knowledge associated with an application being monitored; associating, one or more playbook-based tasks, playbook-based views, or playbook-based links with the at least one rule, the playbook-based tasks, playbook-based views, and playbook-based links being for one or more of diagnosing, resolving, and verifying a problem associated with the application; and generating an integrated management pack responsive to the selecting and the associating, the integrated management pack enabling sharing of information between the operational knowledge and the one or more playbook-based tasks, the playbook-based views, or the playbook-based links. | 1. A computer-implemented method comprising: selecting at least one rule included in an operational knowledge associated with an application being monitored; associating, one or more playbook-based tasks, playbook-based views, or playbook-based links with the at least one rule, the playbook-based tasks, playbook-based views, and playbook-based links being for one or more of diagnosing, resolving, and verifying a problem associated with the application; and generating an integrated management pack responsive to the selecting and the associating, the integrated management pack enabling sharing of information between the operational knowledge and the one or more playbook-based tasks, the playbook-based views, or the playbook-based links. 4. A method as recited in claim 1 , wherein the selecting and associating specify information and resources for presentation in an operator or administrator management console user interface. | 0.846709 |
9,886,519 | 10 | 14 | 10. A system for adjusting webpage layout, comprising one or more processors, memory, and one or more program units stored in the memory and to be executed by the one or more processors, the one or more program units comprising: a calculation unit configured to calculate a width for displaying an image on a webpage; a first determination unit configured to determine whether the image is inserted in a segment of text of the webpage by checking whether a parent node of the image includes a label representing a paragraph of text; a size adjustment unit configured to adjust a size of the image display based on a mobile terminal's screen width and the width for displaying the image, if the image is inserted in the segment of text of the webpage, wherein the size adjustment unit includes: a width adjustment module configured to set a width of the image display to the mobile terminal's screen width subtracting a fixed number of pixels; and a height adjustment module configured to set a height of the image display based on the width of the image display; and a label addition unit configured to add a label to the image display to force the image display to be left justified, while ignoring label attributes including at least one of text-align, indent, and margin. | 10. A system for adjusting webpage layout, comprising one or more processors, memory, and one or more program units stored in the memory and to be executed by the one or more processors, the one or more program units comprising: a calculation unit configured to calculate a width for displaying an image on a webpage; a first determination unit configured to determine whether the image is inserted in a segment of text of the webpage by checking whether a parent node of the image includes a label representing a paragraph of text; a size adjustment unit configured to adjust a size of the image display based on a mobile terminal's screen width and the width for displaying the image, if the image is inserted in the segment of text of the webpage, wherein the size adjustment unit includes: a width adjustment module configured to set a width of the image display to the mobile terminal's screen width subtracting a fixed number of pixels; and a height adjustment module configured to set a height of the image display based on the width of the image display; and a label addition unit configured to add a label to the image display to force the image display to be left justified, while ignoring label attributes including at least one of text-align, indent, and margin. 14. The system according to claim 10 , the one or more program units further comprising: a second determination unit configured to determine whether a width of the image display is in a pre-determined range, and based on the pre-determined range, to filter out small images and images with large website logos or advertisements. | 0.603865 |
5,563,626 | 2 | 3 | 2. A text display system as claimed in claim 1 wherein the maximum widths of the updated or original texts correspond to the maximum number of pixels constituting a single line of a display area. | 2. A text display system as claimed in claim 1 wherein the maximum widths of the updated or original texts correspond to the maximum number of pixels constituting a single line of a display area. 3. A text display system as claimed in claim 2 wherein a display area corresponds to a window. | 0.973758 |
9,390,174 | 21 | 25 | 21. A non-transitory computer-readable medium for providing search results, the computer-readable medium storing instructions that perform a method when executed by at least one processor, the method comprising: parsing a search query to identify one or more words; determining, using one or more processors, an entity reference from the search query based on the one or more identified words; analyzing the entity reference to determine a type of entity reference; identifying, using one or more processors, a list of properties associated with the determined type of the entity reference from a knowledge graph; ranking, using one or more processors, the list of properties associated with the determined type of the entity reference; identifying, using one or more processors, a property for generating a presentation of search results from the ranked list of properties, based at least in part on the search query and on the type of the entity reference; determining, using one or more processors, a presentation technique associated with the property for generating a presentation; and causing to be presented, using one or more processors, search results based on presentation technique. | 21. A non-transitory computer-readable medium for providing search results, the computer-readable medium storing instructions that perform a method when executed by at least one processor, the method comprising: parsing a search query to identify one or more words; determining, using one or more processors, an entity reference from the search query based on the one or more identified words; analyzing the entity reference to determine a type of entity reference; identifying, using one or more processors, a list of properties associated with the determined type of the entity reference from a knowledge graph; ranking, using one or more processors, the list of properties associated with the determined type of the entity reference; identifying, using one or more processors, a property for generating a presentation of search results from the ranked list of properties, based at least in part on the search query and on the type of the entity reference; determining, using one or more processors, a presentation technique associated with the property for generating a presentation; and causing to be presented, using one or more processors, search results based on presentation technique. 25. The non-transitory computer-readable medium of claim 21 , wherein determining an entity reference from a search query comprises determining an associated node in the knowledge graph. | 0.626506 |
7,702,499 | 11 | 12 | 11. The method of claim 10 , wherein the software assembly code module is compiled using a compiler adapted to create code that will execute on a first machine architecture. | 11. The method of claim 10 , wherein the software assembly code module is compiled using a compiler adapted to create code that will execute on a first machine architecture. 12. The method of claim 11 , wherein the performance information is associated with the first machine architecture. | 0.97206 |
8,554,053 | 16 | 17 | 16. An apparatus for reproducing text subtitle streams, the apparatus comprising: a decoder configured to decode at least one text subtitle stream, each text subtitle stream including a style segment defining at least one region style and a plurality of presentation segments to which the style segment applies, each presentation segment containing at least one region subtitle and presentation time information, each region subtitle being linked to one of the region styles and including region information associated with the corresponding region subtitle, the presentation time information defining a presentation time of the corresponding presentation segment, the presentation time information including first information for indicating a presentation start time of the corresponding presentation segment and second information for indicating a presentation end time of the corresponding presentation segment, wherein the region information includes data type information and data, the data being defined as inline style information or text string information according to the data type information, the data type information including an end-of-inline-style field for representing that each of the inline style information is applied until an end of the inline style information is detected; and a controller operably connected with the decoder and configured to control the decoder to decode the at least one text subtitle stream based on the style segment and the region information. | 16. An apparatus for reproducing text subtitle streams, the apparatus comprising: a decoder configured to decode at least one text subtitle stream, each text subtitle stream including a style segment defining at least one region style and a plurality of presentation segments to which the style segment applies, each presentation segment containing at least one region subtitle and presentation time information, each region subtitle being linked to one of the region styles and including region information associated with the corresponding region subtitle, the presentation time information defining a presentation time of the corresponding presentation segment, the presentation time information including first information for indicating a presentation start time of the corresponding presentation segment and second information for indicating a presentation end time of the corresponding presentation segment, wherein the region information includes data type information and data, the data being defined as inline style information or text string information according to the data type information, the data type information including an end-of-inline-style field for representing that each of the inline style information is applied until an end of the inline style information is detected; and a controller operably connected with the decoder and configured to control the decoder to decode the at least one text subtitle stream based on the style segment and the region information. 17. The apparatus of claim 16 , wherein the data type information further includes a type of line-break indicating that the text string is drawn in a new line. | 0.814685 |
8,726,169 | 1 | 17 | 1. A method for enabling structured communication among a social network including a computer, the method comprising: receiving, by the computer, input pertaining to a question; formulating by the computer the question based upon the input; generating by the computer an answer pattern including potential responses to the question based upon a form of the question; translating and transmitting by the computer a message including the question and the answer pattern having the potential responses to the question to a plurality of users over a corresponding plurality of preferred messaging platforms from among a plurality of different messaging platforms for eliciting responses to the question from two or more of the users using the answer pattern; collecting and aggregating by the computer the responses to the question from a corresponding two or more of the plurality of preferred messaging platforms; and presenting by the computer the responses in a summary format, wherein the plurality of preferred messaging platforms comprises, for each user of the plurality of users, a corresponding preferred messaging platform for that user from among the plurality of preferred messaging platforms. | 1. A method for enabling structured communication among a social network including a computer, the method comprising: receiving, by the computer, input pertaining to a question; formulating by the computer the question based upon the input; generating by the computer an answer pattern including potential responses to the question based upon a form of the question; translating and transmitting by the computer a message including the question and the answer pattern having the potential responses to the question to a plurality of users over a corresponding plurality of preferred messaging platforms from among a plurality of different messaging platforms for eliciting responses to the question from two or more of the users using the answer pattern; collecting and aggregating by the computer the responses to the question from a corresponding two or more of the plurality of preferred messaging platforms; and presenting by the computer the responses in a summary format, wherein the plurality of preferred messaging platforms comprises, for each user of the plurality of users, a corresponding preferred messaging platform for that user from among the plurality of preferred messaging platforms. 17. The method of claim 1 , further comprising enabling a user to specify the plurality of users without specifying individual addresses of the users. | 0.921218 |
7,480,783 | 1 | 5 | 1. A method of loading a sequence of unaligned words starting from a first unaligned word address in a memory, said unaligned words comprising a plurality of indexed portions crossing a plurality of word boundaries, the method comprising: loading a first aligned word by executing a load instruction, said first aligned word commencing at a first aligned word address rounded from said first unaligned word address; identifying an index representing the location of the first unaligned word address relative to the first aligned word address; loading a second aligned word commencing at a second aligned word address rounded from a second unaligned word address; combining indexed portions of the first and second aligned words using the identified index to construct a first unaligned word; loading at least one subsequent third aligned word commencing at a third aligned word address from a subsequent third unaligned word address plus a second offset; and combining indexed portions of the subsequent third aligned word and the second aligned word to construct a subsequent second unaligned word. | 1. A method of loading a sequence of unaligned words starting from a first unaligned word address in a memory, said unaligned words comprising a plurality of indexed portions crossing a plurality of word boundaries, the method comprising: loading a first aligned word by executing a load instruction, said first aligned word commencing at a first aligned word address rounded from said first unaligned word address; identifying an index representing the location of the first unaligned word address relative to the first aligned word address; loading a second aligned word commencing at a second aligned word address rounded from a second unaligned word address; combining indexed portions of the first and second aligned words using the identified index to construct a first unaligned word; loading at least one subsequent third aligned word commencing at a third aligned word address from a subsequent third unaligned word address plus a second offset; and combining indexed portions of the subsequent third aligned word and the second aligned word to construct a subsequent second unaligned word. 5. A method according to claim 1 , wherein the index is a multibit index. | 0.865809 |
9,547,647 | 1 | 19 | 1. A method for searching for media items using a voice-based digital assistant, comprising: at an electronic device with a processor and memory storing instructions for execution by the processor: providing multiple media items wherein at least some of the media items are each associated with a respective tag comprising at least one of a time tag, a date tag, or a geo-code tag; providing a natural language text string corresponding to a search query for one or more media items, wherein the search query includes one or more query terms; searching at least one information source to identify at least one parameter associated with at least one of the one or more query terms, wherein the at least one parameter comprises at least one of a time parameter, a date parameter, or a geo-code parameter, wherein the at least one information source comprises user-specific descriptive information, and wherein the at least one parameter is not provided in the search query; comparing the respective tags to the at least one parameter to identify at least one media item whose tag matches the identified parameter; and facilitating the presentation of the at least one media item to a user. | 1. A method for searching for media items using a voice-based digital assistant, comprising: at an electronic device with a processor and memory storing instructions for execution by the processor: providing multiple media items wherein at least some of the media items are each associated with a respective tag comprising at least one of a time tag, a date tag, or a geo-code tag; providing a natural language text string corresponding to a search query for one or more media items, wherein the search query includes one or more query terms; searching at least one information source to identify at least one parameter associated with at least one of the one or more query terms, wherein the at least one parameter comprises at least one of a time parameter, a date parameter, or a geo-code parameter, wherein the at least one information source comprises user-specific descriptive information, and wherein the at least one parameter is not provided in the search query; comparing the respective tags to the at least one parameter to identify at least one media item whose tag matches the identified parameter; and facilitating the presentation of the at least one media item to a user. 19. The method of claim 1 , wherein one of the at least one parameter corresponds to a location, and wherein comparing the respective tags to the at least one parameter further comprises determining whether the geo-code tags correspond to the location. | 0.691176 |
9,014,436 | 10 | 14 | 10. A system for identifying an individual, comprising: an operating interface via which a user requests identification of an individual via the system; a biometric identification information imager that images at least one first input biometric identifier for the individual in support of the identification request; a biometric information converter that converts the at least one first input biometric identifier for the individual to an individual identification text string; a data storage device that stores (1) a plurality of previously-stored text strings representing biometric identification information for a population of identifiable individuals, and (2) an established threshold criteria for comparing the individual identification text string to the plurality of previously-stored text strings; a text-based search engine that compares the individual identification text string to the plurality of previously-stored text strings representing the biometric identification information for members of the population of identifiable individuals; and an output device that executes an action based on results of the comparing when the comparing identifies whether the individual is a member of the population of identifiable individuals, the output device displaying results of the comparing that meet the established threshold criteria presented as a rank-ordered list derived from the population of identifiable individuals based on text strings from the plurality of stored text strings being determined to be substantially equivalent to the individual identification text string according to the established threshold criteria. | 10. A system for identifying an individual, comprising: an operating interface via which a user requests identification of an individual via the system; a biometric identification information imager that images at least one first input biometric identifier for the individual in support of the identification request; a biometric information converter that converts the at least one first input biometric identifier for the individual to an individual identification text string; a data storage device that stores (1) a plurality of previously-stored text strings representing biometric identification information for a population of identifiable individuals, and (2) an established threshold criteria for comparing the individual identification text string to the plurality of previously-stored text strings; a text-based search engine that compares the individual identification text string to the plurality of previously-stored text strings representing the biometric identification information for members of the population of identifiable individuals; and an output device that executes an action based on results of the comparing when the comparing identifies whether the individual is a member of the population of identifiable individuals, the output device displaying results of the comparing that meet the established threshold criteria presented as a rank-ordered list derived from the population of identifiable individuals based on text strings from the plurality of stored text strings being determined to be substantially equivalent to the individual identification text string according to the established threshold criteria. 14. The system of claim 10 , the biometric identification information imager comprising at least one of a finger print scanner, a thumb print scanner, an iris scanner, a retina scanner, a voice recorder, facial feature scanner, a body mass composition scanner, a bodily fluid analyzer, a camera or a video recorder. | 0.818966 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.