sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
1. An Integrated Development Environment (IDE), executing computer instructions in a computer-readable storage medium of a computer system, suitable for use in developing a Virtual User Interface (VUI) application, the IDE running on the computer system and comprising: a development window for graphically constructing a visual layout of a User Inteface (UI) to correspond to a virtual layout of a Virtual User Interface (VUI) generated by an ultrasonic sensing unit externally coupled to the computer system and with its own targeted processor and memory for receiving executable program code compiled from the IDE specific to instructions of the targeted processor; and at least one descriptor that identifies a response of a user interface component in the UI to touchless sensory events applied to a corresponding virtual component in the VUI generated by the ultrasonic sensing unit, a compiler for compiling a source code of the VUI application into at least one code object using imported target processor and memory configurations from the ultrasonic sensing unit; a linker for converting said code object into relocatable code based on the targeted processor and memory of the ultrasonic sensing unit; a code builder for building said relocatable code into an executable code object; and a flashing module for managing a down loading of the executable program code object over a connection into a flash memory of the externally coupled ultrasonic sensing unit associated with the target processor and memory, where the computer system is communicatively coupled to the ultrasonic sensing unit by a wired or wireless connection for developing the VUI on the computer and down loading the executable code object into the ultrasonic sensing unit. | 1. An Integrated Development Environment (IDE), executing computer instructions in a computer-readable storage medium of a computer system, suitable for use in developing a Virtual User Interface (VUI) application, the IDE running on the computer system and comprising: a development window for graphically constructing a visual layout of a User Inteface (UI) to correspond to a virtual layout of a Virtual User Interface (VUI) generated by an ultrasonic sensing unit externally coupled to the computer system and with its own targeted processor and memory for receiving executable program code compiled from the IDE specific to instructions of the targeted processor; and at least one descriptor that identifies a response of a user interface component in the UI to touchless sensory events applied to a corresponding virtual component in the VUI generated by the ultrasonic sensing unit, a compiler for compiling a source code of the VUI application into at least one code object using imported target processor and memory configurations from the ultrasonic sensing unit; a linker for converting said code object into relocatable code based on the targeted processor and memory of the ultrasonic sensing unit; a code builder for building said relocatable code into an executable code object; and a flashing module for managing a down loading of the executable program code object over a connection into a flash memory of the externally coupled ultrasonic sensing unit associated with the target processor and memory, where the computer system is communicatively coupled to the ultrasonic sensing unit by a wired or wireless connection for developing the VUI on the computer and down loading the executable code object into the ultrasonic sensing unit. 3. The IDE of claim 1 , further comprising a dialog window that presents at least one modifiable touchless sensory attribute of a touchless sensory event associated with a virtual component. | 0.577836 |
1. A method of controlling the robustness level of a query optimizer to facilitate compliance with service level goals and performance predictability in a database system, comprising: receiving, by the database system, a query to be executed; receiving a service level goal associated with the query that specifies a desired processing performance characteristic to be achieved by execution of the query; assigning a confidence threshold parameter having a first value that specifies an optimizer confidence level that execution of a generated query plan for the query will incur a processing cost that will not exceed an estimated processing cost; generating a first query plan in accordance with the confidence threshold parameter; calculating an estimated processing cost of the first query plan that specifies an estimated processing performance characteristic for execution of the first query plan; determining whether the estimated processing cost is less than or equal to the service level goal; lowering the confidence threshold parameter to a second value when the determining determines that the estimated processing cost is not less than or equal to the service level goal; determining whether the second value of the confidence threshold parameter is less than a threshold boundary value; and generating a second query plan in accordance with the second value of the confidence threshold parameter when the determining determines that the second value is not less than the threshold boundary value. | 1. A method of controlling the robustness level of a query optimizer to facilitate compliance with service level goals and performance predictability in a database system, comprising: receiving, by the database system, a query to be executed; receiving a service level goal associated with the query that specifies a desired processing performance characteristic to be achieved by execution of the query; assigning a confidence threshold parameter having a first value that specifies an optimizer confidence level that execution of a generated query plan for the query will incur a processing cost that will not exceed an estimated processing cost; generating a first query plan in accordance with the confidence threshold parameter; calculating an estimated processing cost of the first query plan that specifies an estimated processing performance characteristic for execution of the first query plan; determining whether the estimated processing cost is less than or equal to the service level goal; lowering the confidence threshold parameter to a second value when the determining determines that the estimated processing cost is not less than or equal to the service level goal; determining whether the second value of the confidence threshold parameter is less than a threshold boundary value; and generating a second query plan in accordance with the second value of the confidence threshold parameter when the determining determines that the second value is not less than the threshold boundary value. 4. The method of claim 1 , wherein the service level goal specifies a desired maximum processing duration of the query. | 0.845374 |
4. The method of claim 1 , further comprising, after the processing of the text of the training request by the dialogue module and before the forming of the response to the training request by the dialogue module: forming, by the dialogue module, a clarification request; sending the clarification request to the user; providing the clarification request, wherein the providing the clarification request includes one or more of the following: displaying the clarification request and reproducing the clarification request; receiving a response to the clarification request, the response to the clarification request being entered by the user; converting the response to the clarification request into the text by the user input sub system; sending the text of the response to the clarification request obtained as a result of the converting to the dialogue module; processing, by the dialogue module, the text of the response to the clarification request. | 4. The method of claim 1 , further comprising, after the processing of the text of the training request by the dialogue module and before the forming of the response to the training request by the dialogue module: forming, by the dialogue module, a clarification request; sending the clarification request to the user; providing the clarification request, wherein the providing the clarification request includes one or more of the following: displaying the clarification request and reproducing the clarification request; receiving a response to the clarification request, the response to the clarification request being entered by the user; converting the response to the clarification request into the text by the user input sub system; sending the text of the response to the clarification request obtained as a result of the converting to the dialogue module; processing, by the dialogue module, the text of the response to the clarification request. 9. The method of claim 4 , wherein the response to the training request and the clarification request include additional metadata. | 0.8989 |
1. A system for providing television advertisements based on a telephone conversation between two or more persons comprising: a speech recognition system for a telephone service configured to monitor a telephone conversation between two or more persons and to recognize key words and phrases spoken by one or more of the persons during the conversation; a database having one or more advertisements indexed by words and phrases; a search engine for querying the database based on key words and phrases recognized during the conversation; a television broadcast for a television service configured to integrate at least one advertisement from the database into the video feed to the television of at least one of the persons based on key words and phrases recognized during the conversation, wherein the television broadcast including the at least one advertisement is received during the telephone conversation. | 1. A system for providing television advertisements based on a telephone conversation between two or more persons comprising: a speech recognition system for a telephone service configured to monitor a telephone conversation between two or more persons and to recognize key words and phrases spoken by one or more of the persons during the conversation; a database having one or more advertisements indexed by words and phrases; a search engine for querying the database based on key words and phrases recognized during the conversation; a television broadcast for a television service configured to integrate at least one advertisement from the database into the video feed to the television of at least one of the persons based on key words and phrases recognized during the conversation, wherein the television broadcast including the at least one advertisement is received during the telephone conversation. 12. The system according to claim 1 , wherein the at least one advertisement is displayed on the television sets of a group of subscribers, the group having at least one service provider different from the service provider used by at least one of the two or more persons. | 0.52785 |
1. A method, performed at least in part by a computer, for identifying a reason that a search topic is popular, the method comprising: receiving an indication of a search topic that is popular, the search topic that is popular being related to a particular entity; in response to receiving the indication of the search topic that is popular, identifying a content feed from an electronic source of published information that includes content published less than a threshold period of time prior to the search topic becoming popular, the content of the content feed including metadata; determining whether the content, of the identified content feed, published less than the threshold period of time prior to the search topic becoming popular is relevant to the search topic; in response to a determination that the content, of the identified content feed, published less than the threshold period of time prior to the search topic becoming popular is relevant to the search topic: analyzing the content, of the identified content feed, published less than the threshold period of time prior to the search topic becoming popular, analyzing the content comprising determining that the content and metadata of the content feed are related to the same particular entity as the search topic; determining a reason that the search topic is popular based on the analysis, determining the reason comprising, when the content identifies the search topic, providing at least some of the content as the reason that the search topic is popular; and presenting to a user the search topic that is popular and the determined reason that the search topic is popular; and summarizing content of more than one content feed when the content of more than one content feed relates to the same particular entity as the search topic. | 1. A method, performed at least in part by a computer, for identifying a reason that a search topic is popular, the method comprising: receiving an indication of a search topic that is popular, the search topic that is popular being related to a particular entity; in response to receiving the indication of the search topic that is popular, identifying a content feed from an electronic source of published information that includes content published less than a threshold period of time prior to the search topic becoming popular, the content of the content feed including metadata; determining whether the content, of the identified content feed, published less than the threshold period of time prior to the search topic becoming popular is relevant to the search topic; in response to a determination that the content, of the identified content feed, published less than the threshold period of time prior to the search topic becoming popular is relevant to the search topic: analyzing the content, of the identified content feed, published less than the threshold period of time prior to the search topic becoming popular, analyzing the content comprising determining that the content and metadata of the content feed are related to the same particular entity as the search topic; determining a reason that the search topic is popular based on the analysis, determining the reason comprising, when the content identifies the search topic, providing at least some of the content as the reason that the search topic is popular; and presenting to a user the search topic that is popular and the determined reason that the search topic is popular; and summarizing content of more than one content feed when the content of more than one content feed relates to the same particular entity as the search topic. 10. The method of claim 1 wherein identifying a content feed from an electronic source of published information that includes content published less than a threshold period of time prior to the search topic becoming popular comprises identifying a content feed from an electronic source of published information that includes content published less than a threshold number of days prior to the search topic becoming popular. | 0.655302 |
1. A non-transitory computer readable storage medium having a program stored therein, the program, when executed, causing a computer of an information processing apparatus including storage for storing an option character string database that registers one or more combinations of at least one character and at least one option character string corresponding to the at least one character, to perform operations for outputting only fixed character strings, the operations comprising: receiving an input of one or more characters; displaying, as one or more unfixed characters, the received one or more characters; obtaining, from the option character string database, at least one option character string that corresponds to the one or more unfixed characters and displaying the obtained at least one option character string, wherein the displayed at least one option character string includes only option character strings registered in the option character string database; receiving an input for selecting one of the displayed option character strings, whereby the selected option character string becomes a fixed character string; and outputting the fixed character string, wherein only an option character string selected from the displayed option character strings can be fixed, and only a fixed character string can be output, whereby output of character strings not registered in the option character string database can be prevented. | 1. A non-transitory computer readable storage medium having a program stored therein, the program, when executed, causing a computer of an information processing apparatus including storage for storing an option character string database that registers one or more combinations of at least one character and at least one option character string corresponding to the at least one character, to perform operations for outputting only fixed character strings, the operations comprising: receiving an input of one or more characters; displaying, as one or more unfixed characters, the received one or more characters; obtaining, from the option character string database, at least one option character string that corresponds to the one or more unfixed characters and displaying the obtained at least one option character string, wherein the displayed at least one option character string includes only option character strings registered in the option character string database; receiving an input for selecting one of the displayed option character strings, whereby the selected option character string becomes a fixed character string; and outputting the fixed character string, wherein only an option character string selected from the displayed option character strings can be fixed, and only a fixed character string can be output, whereby output of character strings not registered in the option character string database can be prevented. 12. The computer readable storage medium according to claim 1 , wherein the program causes the computer to perform further operations comprising: further obtaining at least one second option character string corresponding to the fixed character string from the option character string database, and receiving an input for selecting an option character string from the at least one second option character string. | 0.60509 |
13. A user interface system of an imaging system for modification of a document having a natural language control system, comprising: a user display comprising a first view area having an image displayed therein for the image modification which is selected by a user and configured to present the image modification in real time to the user in the image within the view of the display at portions of the photo image having the color; and a textual interface comprising text-based categories in a second view with text-based selections comprising color selections, magnitude selections, and resultant image modification selections respectively for the image modification in the document; a window of the second view for displaying one or more human readable sentences comprising portions within each sentence respectively representing a color selection, a magnitude selection, and a resultant image modification; and a sorting engine configured to sort the one or more human readable sentences that respectively correspond to image modifications, the sorting based on a specified priority inputted by the user to the engine of the one or more complete human readable sentences for the respective image modifications, wherein sentences with a higher user specified priority in the specified priority generate the respective image modifications in the image first thereby affecting the image modification of sentences with subsequent lower priority and wherein the priority is dynamically changed by the user through a user interface. | 13. A user interface system of an imaging system for modification of a document having a natural language control system, comprising: a user display comprising a first view area having an image displayed therein for the image modification which is selected by a user and configured to present the image modification in real time to the user in the image within the view of the display at portions of the photo image having the color; and a textual interface comprising text-based categories in a second view with text-based selections comprising color selections, magnitude selections, and resultant image modification selections respectively for the image modification in the document; a window of the second view for displaying one or more human readable sentences comprising portions within each sentence respectively representing a color selection, a magnitude selection, and a resultant image modification; and a sorting engine configured to sort the one or more human readable sentences that respectively correspond to image modifications, the sorting based on a specified priority inputted by the user to the engine of the one or more complete human readable sentences for the respective image modifications, wherein sentences with a higher user specified priority in the specified priority generate the respective image modifications in the image first thereby affecting the image modification of sentences with subsequent lower priority and wherein the priority is dynamically changed by the user through a user interface. 14. The system of claim 13 , wherein the text-based categories comprise a first text-based category having a first portion of a complete human readable sentence, the second text-based category having a second portion of the complete human readable sentence, and the third text-based category having a third portion of the complete human readable sentence. | 0.666344 |
16. The system of claim 12 , wherein similarity across references and reference vectors is configurable. | 16. The system of claim 12 , wherein similarity across references and reference vectors is configurable. 17. The system of claim 16 , wherein characteristics of the at least one reference are taken into account, the characteristics comprising: font; font size; or style; or any combination thereof. | 0.964286 |
19. A method, according to claim 16, further comprising creating data objects representing the data categories. | 19. A method, according to claim 16, further comprising creating data objects representing the data categories. 20. A method, according to claim 19, wherein the data objects contain rule objects that describe the relationships between the data categories. | 0.942675 |
1. A method for providing geo-targeted messages with a search result, the method comprising: providing a toolbar plug-in for an electronic document for allowing a user to enter a search query term for querying the search query term on at least one Internet search platform; customizing the toolbar plug-in with at least one geographical setting; providing exclusive leasing rights to use a leased term associated with a message, wherein the leased term exclusively corresponds to at least one selected geo-targeted area; saving the leased term; receiving a search query term, via the toolbar plug-in, for performing a search request for the search query term on said search platform(s); displaying the search result for the search query term in a second electronic document; and displaying at least one geo-targeted message corresponding to the leased term in response to the search request in a first electronic document, upon determining that the search query term matches the leased term, wherein the method simultaneously provides for displaying the geo-targeted messages in the first electronic document, and displaying said search result in the second electronic document, wherein the first electronic document and the second electronic document are independent, and wherein providing exclusive leasing rights to use the leased term comprises removing the search query term from the terms available for lease in the at least one selected geo-targeted area. | 1. A method for providing geo-targeted messages with a search result, the method comprising: providing a toolbar plug-in for an electronic document for allowing a user to enter a search query term for querying the search query term on at least one Internet search platform; customizing the toolbar plug-in with at least one geographical setting; providing exclusive leasing rights to use a leased term associated with a message, wherein the leased term exclusively corresponds to at least one selected geo-targeted area; saving the leased term; receiving a search query term, via the toolbar plug-in, for performing a search request for the search query term on said search platform(s); displaying the search result for the search query term in a second electronic document; and displaying at least one geo-targeted message corresponding to the leased term in response to the search request in a first electronic document, upon determining that the search query term matches the leased term, wherein the method simultaneously provides for displaying the geo-targeted messages in the first electronic document, and displaying said search result in the second electronic document, wherein the first electronic document and the second electronic document are independent, and wherein providing exclusive leasing rights to use the leased term comprises removing the search query term from the terms available for lease in the at least one selected geo-targeted area. 15. The method of claim 1 , wherein when the selected geo-targeted area is at least one of national, regional and state, then presenting platform(s) selection options for at least one of a search engine package and electronic commerce package. | 0.691975 |
14. The apparatus of claim 12 , wherein the apparatus is further configured to perform the at least one action associated with the real-time textual conversation. | 14. The apparatus of claim 12 , wherein the apparatus is further configured to perform the at least one action associated with the real-time textual conversation. 15. The apparatus of claim 14 , further comprising: a user interface module; wherein the at least one processor is further configured to cause the user interface module to display a visual representation of the one or more mood metrics determined in each of the two or more chat stages for tracking the changes in the one or mood metrics. | 0.948605 |
1. A computer-implemented method of automatically determining a name of a person appearing in an image, comprising: receiving a collection of web pages containing a plurality of images; for each of the images, identifying a set of names associated with the image based on a text analysis of at least one of the web pages; performing face detection and clustering on the plurality of images to generate a plurality of face clusters, wherein each of the face clusters is associated with one person and includes a set of at least one image from the plurality of images in which a face of the one person was detected; for each of the face clusters, identifying a label for the face cluster based on the set of names associated with each image in the face cluster; determining a name of a first person appearing in at least one of the images based on the identified label for one of the face clusters associated with the first person; and wherein the receiving, identifying a set of names, performing face detection and clustering, identifying a label, and determining a name are performed by at least one processor. | 1. A computer-implemented method of automatically determining a name of a person appearing in an image, comprising: receiving a collection of web pages containing a plurality of images; for each of the images, identifying a set of names associated with the image based on a text analysis of at least one of the web pages; performing face detection and clustering on the plurality of images to generate a plurality of face clusters, wherein each of the face clusters is associated with one person and includes a set of at least one image from the plurality of images in which a face of the one person was detected; for each of the face clusters, identifying a label for the face cluster based on the set of names associated with each image in the face cluster; determining a name of a first person appearing in at least one of the images based on the identified label for one of the face clusters associated with the first person; and wherein the receiving, identifying a set of names, performing face detection and clustering, identifying a label, and determining a name are performed by at least one processor. 2. The computer-implemented method of claim 1 , and further comprising: for each of the face clusters, comparing the set of names associated with each image in the face cluster to determine an intersection set of names. | 0.565996 |
1. A computer-implemented system for application protocol field extraction, comprising: an extraction specification that specifies data elements to be extracted from data packets and is expressed in terms of a context-free grammar, where the grammar defines grammatical structures of data packets transmitted in accordance with an application protocol and is defined as a tuple having nonterminals, terminals, counters, production rules and a start nonterminal, such that the counters are variables with an integer value used to chronicle parsing history of the production rules, and at least one of the production rules includes an action association with a terminal or nonterminal comprising body of the production rule and the action is an expression for updating a value of a counter defined by the grammar; an automata generator configured to receive the extraction specification and generate a counting automaton; and a field extractor configured to receive a data flow comprised of a plurality of data packets traversing through a network and extract data elements from the data packets in accordance with the counting automaton, where the field extractor is implemented by an integrated circuit. | 1. A computer-implemented system for application protocol field extraction, comprising: an extraction specification that specifies data elements to be extracted from data packets and is expressed in terms of a context-free grammar, where the grammar defines grammatical structures of data packets transmitted in accordance with an application protocol and is defined as a tuple having nonterminals, terminals, counters, production rules and a start nonterminal, such that the counters are variables with an integer value used to chronicle parsing history of the production rules, and at least one of the production rules includes an action association with a terminal or nonterminal comprising body of the production rule and the action is an expression for updating a value of a counter defined by the grammar; an automata generator configured to receive the extraction specification and generate a counting automaton; and a field extractor configured to receive a data flow comprised of a plurality of data packets traversing through a network and extract data elements from the data packets in accordance with the counting automaton, where the field extractor is implemented by an integrated circuit. 3. The system of claim 1 further comprises a grammar optimizer configured to receive the extraction specification which is incomplete in relation to the context-free grammar and operable to translate the extraction specification to a complete extraction specification using the context-free grammar. | 0.632254 |
1. A method of deploying a package of objects in a learning management system, the method comprising: transmitting a Shareable Content Object Reference Model (SCORM) package to a SCORM Learning Management System (LMS), wherein the SCORM package includes a manifest listing of resources needed to deploy the SCORM package from the LMS; parsing out the manifest listing from the SCORM package; iterating through the manifest listing to create an inventory of the resources in the SCORM package, wherein the inventory of the resources includes an attribute file; comparing names of all resources in the manifest listing with named resources in the attribute file in the inventory of resources available to the LMS; in response to a name in the manifest listing not completely matching any named resources in the attribute file in the inventory of resources available to the LMS, updating a character casing of the name to match a character casing of a corresponding name of a named resource in the attribute file in the inventory of resources available to the LMS, wherein the character casing of the corresponding name of the named resource includes one or more upper case letters and one or more lower case letters; and deploying the SCORM package by launching the SCORM package with a corrected list of resources matching the attribute file in the inventory of resource available to the LMS. | 1. A method of deploying a package of objects in a learning management system, the method comprising: transmitting a Shareable Content Object Reference Model (SCORM) package to a SCORM Learning Management System (LMS), wherein the SCORM package includes a manifest listing of resources needed to deploy the SCORM package from the LMS; parsing out the manifest listing from the SCORM package; iterating through the manifest listing to create an inventory of the resources in the SCORM package, wherein the inventory of the resources includes an attribute file; comparing names of all resources in the manifest listing with named resources in the attribute file in the inventory of resources available to the LMS; in response to a name in the manifest listing not completely matching any named resources in the attribute file in the inventory of resources available to the LMS, updating a character casing of the name to match a character casing of a corresponding name of a named resource in the attribute file in the inventory of resources available to the LMS, wherein the character casing of the corresponding name of the named resource includes one or more upper case letters and one or more lower case letters; and deploying the SCORM package by launching the SCORM package with a corrected list of resources matching the attribute file in the inventory of resource available to the LMS. 4. The method of claim 1 , wherein one of the resources needed to deploy the SCORM package is a Javascript file. | 0.848525 |
6. A method according to claim 3 , further comprising detecting a reversal in the direction of drag of the paragraph selection handle and terminating the paragraph selection mode. | 6. A method according to claim 3 , further comprising detecting a reversal in the direction of drag of the paragraph selection handle and terminating the paragraph selection mode. 7. A method according to claim 6 , further comprising placing the device in a row selection mode after termination of the paragraph selection mode. | 0.950336 |
23. An information processing apparatus that generates, in performing processing for recognizing whether a predetermined action is included in an input moving image, information indicating features of the action used in the processing, the information processing apparatus comprising: acquiring means for acquiring a model moving image; feature-point extracting means for extracting model feature points, which are feature points for recognizing models for recognizing the action in the model moving image at the time when the model moving image is set as three dimensions including an image plane and time; feature-quantity extracting means for extracting model feature quantities, which are feature quantities at the model feature points extracted by the feature-point extracting means; and dividing means for dividing the model moving image acquired by the acquiring means into an area corresponding to the models and an area corresponding to a background, wherein the feature-point extracting means extracts the model feature points from the area corresponding to the models in the model moving image divided by the dividing means, and the dividing means applies morphological contraction processing to an area as a candidate of the area corresponding to the models after applying expansion processing thereto and determines the area corresponding to the models. | 23. An information processing apparatus that generates, in performing processing for recognizing whether a predetermined action is included in an input moving image, information indicating features of the action used in the processing, the information processing apparatus comprising: acquiring means for acquiring a model moving image; feature-point extracting means for extracting model feature points, which are feature points for recognizing models for recognizing the action in the model moving image at the time when the model moving image is set as three dimensions including an image plane and time; feature-quantity extracting means for extracting model feature quantities, which are feature quantities at the model feature points extracted by the feature-point extracting means; and dividing means for dividing the model moving image acquired by the acquiring means into an area corresponding to the models and an area corresponding to a background, wherein the feature-point extracting means extracts the model feature points from the area corresponding to the models in the model moving image divided by the dividing means, and the dividing means applies morphological contraction processing to an area as a candidate of the area corresponding to the models after applying expansion processing thereto and determines the area corresponding to the models. 24. An information processing apparatus according to claim 23 , wherein the feature-point extracting means extracts, as the model feature point in the input moving image, a three-dimensional coordinate that gives a maximum and a minimum of a Harris function H extended to three dimensions including an image plane and time. | 0.68735 |
1. A computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to at least perform the following steps: determining to accept search criteria from a user, the search criteria including a domain identifier identifying a domain and a query; in response to accepting said search criteria from the user, receiving a set of tuples for a corpus of documents, at least one tuple (a) identifying a corresponding document in the corpus of documents satisfying the search criteria and (b) identifying location-related information referenced within that corresponding document and satisfying the domain identifier; determining to request and receiving a result from an additional query based at least in part on the domain identifier, the result not including any of the set of tuples; and determining to display a representation of at least a subset of the set of tuples and a representation of the result of the additional query; and wherein the additional query includes a query to a database. | 1. A computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to at least perform the following steps: determining to accept search criteria from a user, the search criteria including a domain identifier identifying a domain and a query; in response to accepting said search criteria from the user, receiving a set of tuples for a corpus of documents, at least one tuple (a) identifying a corresponding document in the corpus of documents satisfying the search criteria and (b) identifying location-related information referenced within that corresponding document and satisfying the domain identifier; determining to request and receiving a result from an additional query based at least in part on the domain identifier, the result not including any of the set of tuples; and determining to display a representation of at least a subset of the set of tuples and a representation of the result of the additional query; and wherein the additional query includes a query to a database. 2. A computer-readable storage medium of claim 1 , wherein the representation of the at least a subset of the tuples comprises a plurality of indicators on a map image. | 0.580877 |
7. A computer-implemented method performed by at least one processor, the method comprising: receiving, by the at least one processor, at least one image of a document; determining, by the at least one processor, based on the at least one image, data associated with the document; generating, by the at least one processor, a seal that encodes the data associated with the document, the seal being applicable to a tangible version of the document; based on a scan of the seal applied to the tangible version of the document, determining, by the at least one processor, the data that is encoded in the seal; employing, by the at least one processor, the data to verify at least one characteristic of the tangible version of the document; employing, by the at least one processor, the data to determine an address on a blockchain network; and accessing, by the at least one processor, funds associated with the address. | 7. A computer-implemented method performed by at least one processor, the method comprising: receiving, by the at least one processor, at least one image of a document; determining, by the at least one processor, based on the at least one image, data associated with the document; generating, by the at least one processor, a seal that encodes the data associated with the document, the seal being applicable to a tangible version of the document; based on a scan of the seal applied to the tangible version of the document, determining, by the at least one processor, the data that is encoded in the seal; employing, by the at least one processor, the data to verify at least one characteristic of the tangible version of the document; employing, by the at least one processor, the data to determine an address on a blockchain network; and accessing, by the at least one processor, funds associated with the address. 14. The method of claim 7 , wherein: the data includes information indicating a source of the tangible version of the document; and the data is employed to verify the source. | 0.522472 |
1. A method for preparing a multi-lingual personal identification card, comprising: receiving, by a computer processor, a multi-lingual text comprising Latin-based characters in a Latin-based language and non-Latin-based characters in a non-Latin-based language, wherein the multi-lingual text comprises a name of a holder of the personal identification card in the Latin-based language and the non-Latin-based language; converting, by the computer processor, the non-Latin-based characters in the multi-lingual text to index values to produce a pseudo text, wherein each of the non-Latin-based characters has a Unicode value two byte in length, wherein the index values are a single byte in length, wherein the conversion is based on a predefined mapping that converts the Unicode values of the non-Latin-based characters to index values having fewer digits than the corresponding Unicode values of the non-Latin-based characters, wherein the predefined mapping allocates at least 55 consecutive digital numbers for the index values, wherein the pseudo text includes the index values in co-existence with the Latin-based characters in a Latin-based language; receiving vector data for a personal image which includes a facial image, a finger print, or a combination of both of the holder of the personal identification card; and encoding the pseudo text and the vector data in a matrix-code symbol. | 1. A method for preparing a multi-lingual personal identification card, comprising: receiving, by a computer processor, a multi-lingual text comprising Latin-based characters in a Latin-based language and non-Latin-based characters in a non-Latin-based language, wherein the multi-lingual text comprises a name of a holder of the personal identification card in the Latin-based language and the non-Latin-based language; converting, by the computer processor, the non-Latin-based characters in the multi-lingual text to index values to produce a pseudo text, wherein each of the non-Latin-based characters has a Unicode value two byte in length, wherein the index values are a single byte in length, wherein the conversion is based on a predefined mapping that converts the Unicode values of the non-Latin-based characters to index values having fewer digits than the corresponding Unicode values of the non-Latin-based characters, wherein the predefined mapping allocates at least 55 consecutive digital numbers for the index values, wherein the pseudo text includes the index values in co-existence with the Latin-based characters in a Latin-based language; receiving vector data for a personal image which includes a facial image, a finger print, or a combination of both of the holder of the personal identification card; and encoding the pseudo text and the vector data in a matrix-code symbol. 7. The method of claim 1 , wherein the step of encoding comprises: encoding the index values in the matrix-code symbol; and converting the Latin-based characters in the pseudo text to Unicode values and ASCII values, which are encoded in the matrix-code symbol. | 0.553699 |
14. The computer system of claim 13 , wherein the instructions further comprise instructions for displaying path expressions which are associated with the determined paths, wherein a path expression is an alternating sequence of entity names and relationship names. | 14. The computer system of claim 13 , wherein the instructions further comprise instructions for displaying path expressions which are associated with the determined paths, wherein a path expression is an alternating sequence of entity names and relationship names. 16. The computer system of claim 14 , wherein the entities in the data model are associated with tables in a relational database, and wherein the instructions further comprise instructions for using the displayed path expressions to determine a join statement in the relational database. | 0.917034 |
1. A method, comprising: storing instructions in a memory; configuring a computing device to execute the instructions to: obtain at least one Exclude zero-suppressed binary decision diagram (ZDD) rule component from a ZDD rule model representing a rule; identify covers within the Exclude ZDD rule component; remove identified covers to produce an abridged Exclude ZDD rule component by: expanding nodes in the Exclude ZDD rule component to include all attributes specified in the rule; identifying covers within the expanded nodes in the Exclude ZDD rule component; marking nodes associated with the identified covers in the Exclude ZDD rule component; and removing identified covers and marked nodes from the Exclude ZDD rule component to produce the abridged Exclude ZDD rule component; determine satisfiability of the ZDD rule model based on the abridged Exclude ZDD rule component; and generate one or more signals that provide graphical conflict advice to a user based on the satisfiability of the ZDD rule model to guide the user to achieve satisfiability of the rule. | 1. A method, comprising: storing instructions in a memory; configuring a computing device to execute the instructions to: obtain at least one Exclude zero-suppressed binary decision diagram (ZDD) rule component from a ZDD rule model representing a rule; identify covers within the Exclude ZDD rule component; remove identified covers to produce an abridged Exclude ZDD rule component by: expanding nodes in the Exclude ZDD rule component to include all attributes specified in the rule; identifying covers within the expanded nodes in the Exclude ZDD rule component; marking nodes associated with the identified covers in the Exclude ZDD rule component; and removing identified covers and marked nodes from the Exclude ZDD rule component to produce the abridged Exclude ZDD rule component; determine satisfiability of the ZDD rule model based on the abridged Exclude ZDD rule component; and generate one or more signals that provide graphical conflict advice to a user based on the satisfiability of the ZDD rule model to guide the user to achieve satisfiability of the rule. 2. The method of claim 1 , further comprising configuring the computing device to execute the instructions to generate the one or more signals that provide the graphical conflict advice to the user based on the abridged Exclude ZDD rule component. | 0.577296 |
17. A non-transitory computer-readable storage medium encoded with instructions that, when executed, causes at least one processor of a computing device to perform operations comprising: outputting, for display, a graphical keyboard comprising a plurality of keys; receiving an indication of a continuous gesture comprising a first path in a first direction from a first key of the plurality of keys to a second key of the plurality of keys; determining that the continuous gesture comprises a second path from the second key that ends at the first key and retraces at least a portion of the first path from the first key to the second key, wherein the second path is in a second direction that is substantially reverse to the first direction; and responsive to determining that the second path ends at the first key and retraces at least the portion of the first path from the first key back to the second key in the second direction that is substantially reverse to the first direction, and that the continuous gesture further comprises a third path to a third key, outputting, for display, a character string a third character subsequent to the first character and without the second character output between the first character and third character. | 17. A non-transitory computer-readable storage medium encoded with instructions that, when executed, causes at least one processor of a computing device to perform operations comprising: outputting, for display, a graphical keyboard comprising a plurality of keys; receiving an indication of a continuous gesture comprising a first path in a first direction from a first key of the plurality of keys to a second key of the plurality of keys; determining that the continuous gesture comprises a second path from the second key that ends at the first key and retraces at least a portion of the first path from the first key to the second key, wherein the second path is in a second direction that is substantially reverse to the first direction; and responsive to determining that the second path ends at the first key and retraces at least the portion of the first path from the first key back to the second key in the second direction that is substantially reverse to the first direction, and that the continuous gesture further comprises a third path to a third key, outputting, for display, a character string a third character subsequent to the first character and without the second character output between the first character and third character. 19. The non-transitory computer-readable storage medium of claim 17 , encoded with instructions that, when executed, causes the at least one processor of the computing device to perform operations comprising: comparing at least the first character and the second character to a language model. | 0.550485 |
9. The method of claim 1 , wherein the searching includes determining a score for each of the one or more identified documents. | 9. The method of claim 1 , wherein the searching includes determining a score for each of the one or more identified documents. 11. The method of claim 9 , wherein the providing includes providing one geographical location if a best score for a corresponding document is greater than a pre-determined multiple of a next best score for a next document in a top-N ranking of the one or more documents. | 0.914304 |
3. The method of claim 1 , wherein the plurality of profile data includes a user's personal information. | 3. The method of claim 1 , wherein the plurality of profile data includes a user's personal information. 4. The method of claim 3 , wherein the user's personal information includes user aspect information. | 0.978983 |
1. A method of processing a voice communication and enabling a first user to share information with other users, comprising: receiving, at an application software program installed on a mobile device associated with the first user, a voice communication including a plurality of spoken words from the first user; converting some or all of the voice communication received at the application program installed on the mobile device associated with the first user to text using at least in part a speech-to-text recognizer; identifying and selecting a voice communication gist from the translated text so as to be sufficiently concise to be transmittable via a single Short Message Service (SMS) message based at least in part on: an identification of one or more words in the translated text that correspond to respective one or more words in a vocabulary of uncommon words that are uncommon in voice communications, and a permitted length of the single SMS message; and automatically posting, by a processing system, the voice communication gist on a social networking web page, wherein the social networking web page is configured to share first user information posted on the social networking web page with others. | 1. A method of processing a voice communication and enabling a first user to share information with other users, comprising: receiving, at an application software program installed on a mobile device associated with the first user, a voice communication including a plurality of spoken words from the first user; converting some or all of the voice communication received at the application program installed on the mobile device associated with the first user to text using at least in part a speech-to-text recognizer; identifying and selecting a voice communication gist from the translated text so as to be sufficiently concise to be transmittable via a single Short Message Service (SMS) message based at least in part on: an identification of one or more words in the translated text that correspond to respective one or more words in a vocabulary of uncommon words that are uncommon in voice communications, and a permitted length of the single SMS message; and automatically posting, by a processing system, the voice communication gist on a social networking web page, wherein the social networking web page is configured to share first user information posted on the social networking web page with others. 10. The method as defined in claim 1 , further comprising providing a user interface configured to receive an indication from the first user regarding the quality of the conversion of the voice communication to text. | 0.727557 |
4. The method of claim 1 , further comprising: updating, by one or more processors, the status information of each copy of each database table in the distributed database system. | 4. The method of claim 1 , further comprising: updating, by one or more processors, the status information of each copy of each database table in the distributed database system. 5. The method of claim 4 , further comprising: requesting, by one or more processors, status information of each copy, of said each database table in the distributed database system, from the database device which stores said each copy; receiving, by one or more processors, a latest status information of a copy of the database table that is sent by the database device in response to the received request; and updating, by one or more processors, current status information of a copy of the database table with received latest status information of the copy of the database table. | 0.924716 |
2. The method of claim 1 , wherein at least some of the linguistic elements together form a core alphabet, the language objects stored in the first data source each consisting of a number of the linguistic elements of the core alphabet, and further comprising searching the first data source as the one of the first data source and the second data source. | 2. The method of claim 1 , wherein at least some of the linguistic elements together form a core alphabet, the language objects stored in the first data source each consisting of a number of the linguistic elements of the core alphabet, and further comprising searching the first data source as the one of the first data source and the second data source. 3. The method of claim 2 , wherein at least a first linguistic element not in the core alphabet is stored on the handheld electronic device, at least a first language object comprising the at least first linguistic element being stored in the second data source, and further comprising, for at least one of the compound language solutions, identifying as the language object corresponding with the initial portion the at least first language object, and outputting as the representation of the at least one of the compound language solutions a representation of the at least first language object including the at least first linguistic element and a representation of at least a portion of the another language object. | 0.744681 |
1. A method for preserving an original appearance of stylized information and breaking the stylized information at an element boundary, the method comprising: acquiring an image including stylized information, wherein the stylized information includes a plurality of elements, and the plurality of elements includes one or more words that are arranged in an arced line; distinguishing each of the elements of stylized information in the image from one another; identifying at least one element boundary for each of the elements of stylized information, wherein an element boundary indicates a division between successive elements of the stylized information; displaying a representation of each of the elements of stylized information in the image on a display by placing the elements of stylized information, one element after another element, by breaking the stylized information at an element boundary; and rotating a first word in the arced line relative to a second word in the arced line to display the first word and the second word in one or more non-arced lines, wherein: the displayed elements comprise bordering elements, the bordering elements are elements sharing a boundary, and the displaying comprises smoothing representations of boundaries between bordering elements. | 1. A method for preserving an original appearance of stylized information and breaking the stylized information at an element boundary, the method comprising: acquiring an image including stylized information, wherein the stylized information includes a plurality of elements, and the plurality of elements includes one or more words that are arranged in an arced line; distinguishing each of the elements of stylized information in the image from one another; identifying at least one element boundary for each of the elements of stylized information, wherein an element boundary indicates a division between successive elements of the stylized information; displaying a representation of each of the elements of stylized information in the image on a display by placing the elements of stylized information, one element after another element, by breaking the stylized information at an element boundary; and rotating a first word in the arced line relative to a second word in the arced line to display the first word and the second word in one or more non-arced lines, wherein: the displayed elements comprise bordering elements, the bordering elements are elements sharing a boundary, and the displaying comprises smoothing representations of boundaries between bordering elements. 7. The method of claim 1 , wherein a size of at least one of the elements of the stylized information is scaled according to an aspect of a display device. | 0.598078 |
1. A machine-implemented method, comprising: determining that a first user of a first mobile communication device is engaged in a call over a communications network; providing an adaptive speech recognition model comprising a speaker-dependent speech recognition model; after providing the adaptive speech recognition model, analyzing an outbound audio channel of a baseband unit of the first mobile communication device to obtain a call audio signal corresponding to audio input from one or more microphones of the first mobile communication device; and updating the adaptive speech recognition model with training data derived from the call audio signal. | 1. A machine-implemented method, comprising: determining that a first user of a first mobile communication device is engaged in a call over a communications network; providing an adaptive speech recognition model comprising a speaker-dependent speech recognition model; after providing the adaptive speech recognition model, analyzing an outbound audio channel of a baseband unit of the first mobile communication device to obtain a call audio signal corresponding to audio input from one or more microphones of the first mobile communication device; and updating the adaptive speech recognition model with training data derived from the call audio signal. 2. The method of claim 1 , wherein the method is performed by said first mobile communication device having said one or more microphones. | 0.75 |
1. A method for generating a password for a user during an enrollment phase, comprising: presenting said user with a plurality of topics; receiving a user selection of at least one topic; receiving one or more personal details from said user associated with said at least one selected topic as a proposed password; performing an Internet search using a query containing one or more keywords derived from said personal details of said proposed password, wherein said Internet search searches contents of the Internet across a plurality of web sites using a search engine tool; evaluating results of said search relative to one or more predefined thresholds applicable to said at least one selected topic; rejecting said proposed password when said user is correlated with said proposed password if one or more of said predefined thresholds are exceeded by said results; and recording said one or more personal details as a password for said user if said proposed password is not rejected. | 1. A method for generating a password for a user during an enrollment phase, comprising: presenting said user with a plurality of topics; receiving a user selection of at least one topic; receiving one or more personal details from said user associated with said at least one selected topic as a proposed password; performing an Internet search using a query containing one or more keywords derived from said personal details of said proposed password, wherein said Internet search searches contents of the Internet across a plurality of web sites using a search engine tool; evaluating results of said search relative to one or more predefined thresholds applicable to said at least one selected topic; rejecting said proposed password when said user is correlated with said proposed password if one or more of said predefined thresholds are exceeded by said results; and recording said one or more personal details as a password for said user if said proposed password is not rejected. 8. The method of claim 1 , wherein said one or more personal details are related to an experience of said user in connection with a public event. | 0.73741 |
15. A computer-implemented method comprising: identify, by a computing device, one or more servers executing an application associated with a received query statement from a plurality of servers, identify event tracing modules associated with the received query statement, group the event tracing modules to generate one or more module groups, formulate one or more custom queries for individual module groups of the one or more module groups based on the received query statement after determining that the query statement does not correlate to a standard query scheduled for execution on the plurality of servers to return one or more standard results associated with one or more server resources, schedule the one or more custom queries, and distribute the custom queries to one or more query response modules in an applications and data space that comprises the plurality of servers. | 15. A computer-implemented method comprising: identify, by a computing device, one or more servers executing an application associated with a received query statement from a plurality of servers, identify event tracing modules associated with the received query statement, group the event tracing modules to generate one or more module groups, formulate one or more custom queries for individual module groups of the one or more module groups based on the received query statement after determining that the query statement does not correlate to a standard query scheduled for execution on the plurality of servers to return one or more standard results associated with one or more server resources, schedule the one or more custom queries, and distribute the custom queries to one or more query response modules in an applications and data space that comprises the plurality of servers. 17. The computer-implemented method of claim 15 , wherein the applications and data space comprises a server farm. | 0.874179 |
9. A method implemented by a computer comprising at least one processor for creating classes for classifying digitized documents comprising: generating a plurality of word pairs, each word pair comprising a word from a first digitized document, and a corresponding word from a second digitized document; computing for each word pair first location information for the word that indicates a location of the word in the first digitized document relative to other words in the first digitized document; computing for each word pair second location information for the corresponding word that indicates a location of the corresponding word in the second digitized document relative to other words in the second digitized document; comparing the first and second location information; and creating one or more classes responsive to the comparison to classify digitized documents similar to the first digitized document, and to classify digitized documents similar to the second digitized document. | 9. A method implemented by a computer comprising at least one processor for creating classes for classifying digitized documents comprising: generating a plurality of word pairs, each word pair comprising a word from a first digitized document, and a corresponding word from a second digitized document; computing for each word pair first location information for the word that indicates a location of the word in the first digitized document relative to other words in the first digitized document; computing for each word pair second location information for the corresponding word that indicates a location of the corresponding word in the second digitized document relative to other words in the second digitized document; comparing the first and second location information; and creating one or more classes responsive to the comparison to classify digitized documents similar to the first digitized document, and to classify digitized documents similar to the second digitized document. 11. The method of claim 9 comprising: if the comparison indicates the locations of words in the first digitized document are different from the locations of the corresponding words in the second digitized document, determining that the first and second digitized documents should be in different classes; and upon the determination that the first and second digitized documents should be in different classes, creating a first class to classify digitized documents similar to the first digitized document, and creating a second class, different from the first class, to classify digitized documents similar to the second digitized document. | 0.598371 |
12. A system for editing an electronic presentation, comprising: a processor; a memory storing computer executable instructions, which when executed by the processor cause the processor to provide an electronic presentation editing interface for editing an electronic presentation, wherein the interface comprises: a digital canvas comprising a plurality of canvas objects in a plurality of canvas layers; a digital timeline comprising a plurality of timeline objects, a time axis, and a graphical indicia on the time axis that represents a pause in the electronic presentation, wherein: each canvas object in the plurality of canvas objects is linked to a respective timeline object; a position of a timeline object on the digital timeline is indicative of a time and a canvas layer that a linked canvas object is displayed on the digital canvas; the position of the timeline object includes a first time coordinate on the time axis indicative of when the linked canvas object appears in the digital canvas, a second time coordinate on the time axis indicative of when the linked canvas object disappears from the digital canvas, and a layer coordinate indicative of a canvas layer in which the linked canvas object appears in the digital canvas; the graphical indicia extends over all layer coordinates that are displayed in the digital timeline; and the digital timeline further comprises a marker on the digital timeline, wherein a position of the marker is indicative of a time corresponding to a current view of the digital canvas, and wherein when the position of the marker coincides with the graphical indicia on the time axis, each canvas obiect linked to a timeline object that coincides with the position of the marker is paused. | 12. A system for editing an electronic presentation, comprising: a processor; a memory storing computer executable instructions, which when executed by the processor cause the processor to provide an electronic presentation editing interface for editing an electronic presentation, wherein the interface comprises: a digital canvas comprising a plurality of canvas objects in a plurality of canvas layers; a digital timeline comprising a plurality of timeline objects, a time axis, and a graphical indicia on the time axis that represents a pause in the electronic presentation, wherein: each canvas object in the plurality of canvas objects is linked to a respective timeline object; a position of a timeline object on the digital timeline is indicative of a time and a canvas layer that a linked canvas object is displayed on the digital canvas; the position of the timeline object includes a first time coordinate on the time axis indicative of when the linked canvas object appears in the digital canvas, a second time coordinate on the time axis indicative of when the linked canvas object disappears from the digital canvas, and a layer coordinate indicative of a canvas layer in which the linked canvas object appears in the digital canvas; the graphical indicia extends over all layer coordinates that are displayed in the digital timeline; and the digital timeline further comprises a marker on the digital timeline, wherein a position of the marker is indicative of a time corresponding to a current view of the digital canvas, and wherein when the position of the marker coincides with the graphical indicia on the time axis, each canvas obiect linked to a timeline object that coincides with the position of the marker is paused. 15. The system of claim 12 , wherein: the digital timeline further comprises a layer axis; and the positions of at least two timeline objects in the plurality of timeline objects have different first and second time coordinates along the time axis and a same layer coordinate along the layer axis, such that the two canvas objects linked to the two timeline objects appear in the digital canvas at different times and in the same canvas layer, and wherein the layer axis corresponds to a front to back ordering of the plurality of canvas layers in the digital canvas. | 0.517966 |
15. A method comprising: receiving streams of physiological data associated with a patient having an unknown medical condition, into a computerized device, said physiological data comprising numerical data and medical symptoms reported by said patient; converting time series data from said streams of physiological data into words based on natural language generation, using said computerized device; formulating textual queries from said words and said medical symptoms reported by said patient, using said computerized device, at least one query being generated for each feature extracted from said streams of physiological data; outputting said textual queries to external sources of data, using said computerized device, said external sources of data comprising structured and unstructured data; obtaining results of said textual queries from said external sources, using said computerized device, said results indicating a possible medical condition of said patient based on said streams of physiological data and said medical symptoms reported by said patient; ranking said results based on importance scores retrieved with said results, using said computerized device; formulating hypotheses related to said possible medical condition of said patient to generate analytical patterns in said time series data, using said computerized device; and identifying relationships among said physiological data based on said analytical patterns, using said computerized device. | 15. A method comprising: receiving streams of physiological data associated with a patient having an unknown medical condition, into a computerized device, said physiological data comprising numerical data and medical symptoms reported by said patient; converting time series data from said streams of physiological data into words based on natural language generation, using said computerized device; formulating textual queries from said words and said medical symptoms reported by said patient, using said computerized device, at least one query being generated for each feature extracted from said streams of physiological data; outputting said textual queries to external sources of data, using said computerized device, said external sources of data comprising structured and unstructured data; obtaining results of said textual queries from said external sources, using said computerized device, said results indicating a possible medical condition of said patient based on said streams of physiological data and said medical symptoms reported by said patient; ranking said results based on importance scores retrieved with said results, using said computerized device; formulating hypotheses related to said possible medical condition of said patient to generate analytical patterns in said time series data, using said computerized device; and identifying relationships among said physiological data based on said analytical patterns, using said computerized device. 16. The method according to claim 15 , further comprising: inputting said textual queries to an information retrieval system, using said computerized device; searching a corpus of data with said information retrieval system to retrieve answers to said textual queries, using said computerized device, said corpus of data comprising structured and unstructured data; and receiving at least one answer to said textual queries from said information retrieval system, using said computerized device. | 0.627084 |
1. A method comprising: receiving an image captured from a mobile device display for a first mobile application; determining a window that includes a chronological set of images, the images each representing a respective screen captured from a display of a mobile device and having an associated timestamp; identifying entities appearing in images in a first portion of the window using text for images in a remaining portion of the window as context to disambiguate ambiguous entity references; and providing the identified entities to the mobile device for customizing a second mobile application executing on the mobile device. | 1. A method comprising: receiving an image captured from a mobile device display for a first mobile application; determining a window that includes a chronological set of images, the images each representing a respective screen captured from a display of a mobile device and having an associated timestamp; identifying entities appearing in images in a first portion of the window using text for images in a remaining portion of the window as context to disambiguate ambiguous entity references; and providing the identified entities to the mobile device for customizing a second mobile application executing on the mobile device. 15. The method of claim 1 , wherein the first mobile application and the second mobile application are the same mobile application. | 0.764829 |
1. A method for searching an electronic document for passages relating to a concept being searched for, where the concept is expressed as a word or plurality of words, the method comprising: deconstructing by a computer processor training electronic texts stored on a computer readable into a stream of features; storing the stream of features in a data store; wherein the features include the text of complete sentences, tokens used by the text in each sentence, the sequence of sentences, layout of text and typography of text; executing by a computer processor a conditional random field algorithm to label sentences in the electronic document as either being relevant to the concept being searched for (“State A”) or as background information (“State B”) based on the stream of features; executing by the computer processor a search algorithm which returns those sentences labelled as State A; wherein the conditional random field algorithm generates a probability of a sentence being relevant to State A; wherein the probability includes a tolerance for words or portions of words which cannot be resolved into computer-readable text; wherein, given a document containing multiple sentences S:={s 1 , s 2 , . . . , s m } and the corresponding concept label for each sentence Concept:={concept 1 , concept 2 , . . . , concept m }, the conditional random field function defining the probability of the Concept applied to S, Pr(Concept|S), is expressed as: Pr ( Concept ❘ S ) = 1 Z s exp ( ∑ j = 1 K × L F j ( Concept , S ) ) = 1 Z s exp ( ∑ i = 1 , k = 1 m , K λ k f k ( y i - 1 , y i , S ) + ∑ i = 1 , l = 1 m , L μ l g l ( y i , S ) ) where Z s is a normalization constant, ƒ k (y i-1 ,y i ,S) is an arbitrary feature function over the group of sentences in a document and positions i and i−1, g l (y i ,S) is a feature function of the state at position i and the document S. | 1. A method for searching an electronic document for passages relating to a concept being searched for, where the concept is expressed as a word or plurality of words, the method comprising: deconstructing by a computer processor training electronic texts stored on a computer readable into a stream of features; storing the stream of features in a data store; wherein the features include the text of complete sentences, tokens used by the text in each sentence, the sequence of sentences, layout of text and typography of text; executing by a computer processor a conditional random field algorithm to label sentences in the electronic document as either being relevant to the concept being searched for (“State A”) or as background information (“State B”) based on the stream of features; executing by the computer processor a search algorithm which returns those sentences labelled as State A; wherein the conditional random field algorithm generates a probability of a sentence being relevant to State A; wherein the probability includes a tolerance for words or portions of words which cannot be resolved into computer-readable text; wherein, given a document containing multiple sentences S:={s 1 , s 2 , . . . , s m } and the corresponding concept label for each sentence Concept:={concept 1 , concept 2 , . . . , concept m }, the conditional random field function defining the probability of the Concept applied to S, Pr(Concept|S), is expressed as: Pr ( Concept ❘ S ) = 1 Z s exp ( ∑ j = 1 K × L F j ( Concept , S ) ) = 1 Z s exp ( ∑ i = 1 , k = 1 m , K λ k f k ( y i - 1 , y i , S ) + ∑ i = 1 , l = 1 m , L μ l g l ( y i , S ) ) where Z s is a normalization constant, ƒ k (y i-1 ,y i ,S) is an arbitrary feature function over the group of sentences in a document and positions i and i−1, g l (y i ,S) is a feature function of the state at position i and the document S. 2. The method according to claim 1 , wherein said words which cannot be resolved into computer-readable text have properties selected from the group consisting of being spelled incorrectly, being of poor optical character recognition quality, and being in a foreign language. | 0.50208 |
4. A hardware computer readable storage medium storing instructions, which, when executed by a computer, perform a method comprising: displaying a first domain tuned search interface that is embedded on a first site and obtains search results using a first search definition that identifies a topical area of interest for the first site; receiving a first search input from a user, that is separate from the first search definition, at the first domain tuned search interface embedded on the first site; obtaining a first set of non-domain specific search results, using a first search engine that searches a network of sites, based on the first search input; generating domain specific search results by ranking the search results in the first set based on how similar in terms of subject matter content the search results are to the first search definition; displaying a second site selected from the first set of search results, the second site being different than the first site and having a second domain tuned search interface that is embedded on the second site and obtains search results using a second search definition that identifies a topical area of interest for the second site, that is different than the topical area of interest for the first site; receiving a second search input from the user, that is separate from the second search definition, at the second domain tuned search interface embedded on the second site; obtaining a second set of non-domain specific search results, using a second search engine that searches the network of sites, based on the second search input; and generating domain specific search results by ranking the search results in the second set based on how similar in terms of subject matter content the search results are to the second search definition. | 4. A hardware computer readable storage medium storing instructions, which, when executed by a computer, perform a method comprising: displaying a first domain tuned search interface that is embedded on a first site and obtains search results using a first search definition that identifies a topical area of interest for the first site; receiving a first search input from a user, that is separate from the first search definition, at the first domain tuned search interface embedded on the first site; obtaining a first set of non-domain specific search results, using a first search engine that searches a network of sites, based on the first search input; generating domain specific search results by ranking the search results in the first set based on how similar in terms of subject matter content the search results are to the first search definition; displaying a second site selected from the first set of search results, the second site being different than the first site and having a second domain tuned search interface that is embedded on the second site and obtains search results using a second search definition that identifies a topical area of interest for the second site, that is different than the topical area of interest for the first site; receiving a second search input from the user, that is separate from the second search definition, at the second domain tuned search interface embedded on the second site; obtaining a second set of non-domain specific search results, using a second search engine that searches the network of sites, based on the second search input; and generating domain specific search results by ranking the search results in the second set based on how similar in terms of subject matter content the search results are to the second search definition. 12. The hardware computer readable storage medium of claim 4 , wherein the first search definition and the second search definition are obtained by accessing a definition data store that stores a plurality of different search definitions. | 0.575121 |
2. The speech recognition system according to claim 1 , wherein the reliability judgment part performs the reliability judgment for judging the reliability of the speech recognition based on a comparison result between a likelihood difference judgment threshold and a likelihood difference that is a difference in the likelihood among a plurality of the registered words obtained as a result of the speech recognition, and the judgment reference change processing part changes the likelihood difference judgment threshold to be used for the reliability judgment to have a greater value, as the utterance speed becomes slower. | 2. The speech recognition system according to claim 1 , wherein the reliability judgment part performs the reliability judgment for judging the reliability of the speech recognition based on a comparison result between a likelihood difference judgment threshold and a likelihood difference that is a difference in the likelihood among a plurality of the registered words obtained as a result of the speech recognition, and the judgment reference change processing part changes the likelihood difference judgment threshold to be used for the reliability judgment to have a greater value, as the utterance speed becomes slower. 3. The speech recognition system according to claim 2 , wherein the likelihood difference judgment threshold is set corresponding to an acoustic model of each of the registered words, and the reliability judgment part use the likelihood difference judgment threshold set corresponding to an acoustic model of a first registered word whose likelihood obtained as a result of the speech recognition is at the first rank, thereby judging the reliability of the speech data being the first registered word. | 0.534155 |
1. In a computing environment comprising a messaging system and one or more data sources, an apparatus for associating messages with data comprising: an association manager capable of interfacing with an electronic mail messaging system and one or more data sources, said association manager configured to obtain an electronic mail message and to create an association between one or more elements of said electronic mail message with one or more elements of data from said data sources, said association manager further configured to analyze said electronic message to determine one or more external data sources from which said one or more elements of data are to be retrieved, wherein said one or more elements of data comprise workflow data associated with an order in which activities associated with a given task are completed, and wherein said association manager is configured to facilitate workflow management by providing a context for said one or more elements of said electronic mail message and said one or more elements of data; and a user interface enabling a user to create one or more sensory cues indicative of said association of one or more elements of said electronic mail message with said one or more elements of data from said data sources. | 1. In a computing environment comprising a messaging system and one or more data sources, an apparatus for associating messages with data comprising: an association manager capable of interfacing with an electronic mail messaging system and one or more data sources, said association manager configured to obtain an electronic mail message and to create an association between one or more elements of said electronic mail message with one or more elements of data from said data sources, said association manager further configured to analyze said electronic message to determine one or more external data sources from which said one or more elements of data are to be retrieved, wherein said one or more elements of data comprise workflow data associated with an order in which activities associated with a given task are completed, and wherein said association manager is configured to facilitate workflow management by providing a context for said one or more elements of said electronic mail message and said one or more elements of data; and a user interface enabling a user to create one or more sensory cues indicative of said association of one or more elements of said electronic mail message with said one or more elements of data from said data sources. 11. The apparatus of claim 1 , wherein said association manager is configured to obtain one or more data values describing an association between said one or more elements of said electronic mail message and said one or more elements of data. | 0.559562 |
8. One or more computer-readable storage media storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform prior to or at a first particular time, generating an initial set of search results, said generating comprising performing an initial set of one or more searches on a first set of data, said initial set of one or more searches being based on a first set of search queries; wherein the first set of search queries includes a first query for which the set of initial search results contains an initial search result; at the first particular time, transmitting the initial search result to a first user associated with the first query; between the first particular time and a second particular time, the second particular time occurring after the first particular time, receiving a second set of search queries and a second set of data; wherein the second set of search queries is different from the first set of search queries; wherein the second set of search queries includes a second query that is different than the first query; after the second particular time, generating a first set of search results that is different than the initial set of search results; wherein generating the first set of search results comprises performing a first set of one or more searches on the second set of data, but not the first set of data, based on the first set of search queries; wherein the first set of search results includes a first search result associated with the first search query; and after the second particular time, generating a second set of search results that is different than both the initial set of search results and the first set of search results; wherein generating the second set of search results comprises performing a second set of one or more searches on the first set of data, based on the second set of search queries; wherein the second set of search results includes a second search result associated with the second search query; transmitting the first search result to the first user associated with the first query; and transmitting the second search result to a second user associated with the second query; wherein performing the first set of one or more searches comprises: identifying sets of one or more similar search queries from at least the first set of search queries; for each of the sets of one or more similar search queries, determining a unique search query; and generating a set of unique search results by, for each unique search query, executing the unique search query against the second set of data, but not the first set of data: wherein generating the first set of search results further comprises associating each search query that is both in the first set of search queries and in one of the sets of one or more similar search queries with a corresponding unique search result from the set of unique search results; wherein identifying the sets of one or more similar search queries further comprises identifying at least one or more of the sets of one or more similar search queries from the first set of search queries and the second set of search queries; wherein one of the sets of similar search queries comprises both the first search query and the second search query; and wherein generating the second set of search results further comprises: for each search query that is both in the second set of search queries and in one of the sets of one or more similar search queries: associating the search query with a corresponding unique search result from the set of unique search results; and combining the corresponding unique search result with a search result generated during the second set of one or more searches for the search query; wherein the method is performed by one or more computing devices. | 8. One or more computer-readable storage media storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform prior to or at a first particular time, generating an initial set of search results, said generating comprising performing an initial set of one or more searches on a first set of data, said initial set of one or more searches being based on a first set of search queries; wherein the first set of search queries includes a first query for which the set of initial search results contains an initial search result; at the first particular time, transmitting the initial search result to a first user associated with the first query; between the first particular time and a second particular time, the second particular time occurring after the first particular time, receiving a second set of search queries and a second set of data; wherein the second set of search queries is different from the first set of search queries; wherein the second set of search queries includes a second query that is different than the first query; after the second particular time, generating a first set of search results that is different than the initial set of search results; wherein generating the first set of search results comprises performing a first set of one or more searches on the second set of data, but not the first set of data, based on the first set of search queries; wherein the first set of search results includes a first search result associated with the first search query; and after the second particular time, generating a second set of search results that is different than both the initial set of search results and the first set of search results; wherein generating the second set of search results comprises performing a second set of one or more searches on the first set of data, based on the second set of search queries; wherein the second set of search results includes a second search result associated with the second search query; transmitting the first search result to the first user associated with the first query; and transmitting the second search result to a second user associated with the second query; wherein performing the first set of one or more searches comprises: identifying sets of one or more similar search queries from at least the first set of search queries; for each of the sets of one or more similar search queries, determining a unique search query; and generating a set of unique search results by, for each unique search query, executing the unique search query against the second set of data, but not the first set of data: wherein generating the first set of search results further comprises associating each search query that is both in the first set of search queries and in one of the sets of one or more similar search queries with a corresponding unique search result from the set of unique search results; wherein identifying the sets of one or more similar search queries further comprises identifying at least one or more of the sets of one or more similar search queries from the first set of search queries and the second set of search queries; wherein one of the sets of similar search queries comprises both the first search query and the second search query; and wherein generating the second set of search results further comprises: for each search query that is both in the second set of search queries and in one of the sets of one or more similar search queries: associating the search query with a corresponding unique search result from the set of unique search results; and combining the corresponding unique search result with a search result generated during the second set of one or more searches for the search query; wherein the method is performed by one or more computing devices. 14. The one or more computer-readable storage media of claim 8 , wherein performing the second set of one or more searches comprises performing a third set of one or more searches on both the first set of data and the second set of data, based on a set of search queries that belong to the second set of search queries but not one of the sets of one or more similar search queries. | 0.504503 |
1. A method of operating on database queries, comprising: identifying a parameterized input query in a first database query language, wherein the parameterized input query includes one or more parameter placeholders, each parameter placeholder defining a parameter name and a declared parameter type; generating, for each parameter placeholder in the parameterized input query in the first database query language, a random value of the declared parameter type; constructing a concrete instance of the parameterized input query in the first database query language, where the concrete instance of the parameterized input query replaces each parameter placeholder with the corresponding generated random value of the declared parameter type; generating, from the concrete instance of the parameterized input query in the first database query language, a translated output query in a second database query language different from the first query language, the translated output query including the generated random value of the declared parameter type; and replacing the generated random values within the translated output query in the second database query language with a placeholder value associated with the second database query language. | 1. A method of operating on database queries, comprising: identifying a parameterized input query in a first database query language, wherein the parameterized input query includes one or more parameter placeholders, each parameter placeholder defining a parameter name and a declared parameter type; generating, for each parameter placeholder in the parameterized input query in the first database query language, a random value of the declared parameter type; constructing a concrete instance of the parameterized input query in the first database query language, where the concrete instance of the parameterized input query replaces each parameter placeholder with the corresponding generated random value of the declared parameter type; generating, from the concrete instance of the parameterized input query in the first database query language, a translated output query in a second database query language different from the first query language, the translated output query including the generated random value of the declared parameter type; and replacing the generated random values within the translated output query in the second database query language with a placeholder value associated with the second database query language. 4. The method of claim 1 , wherein the second database query language is a Structured Query Language (SQL) and wherein generating the random value of the declared parameter type for each parameter placeholder in the parameterized input query in the first database query language includes: generating a first random value for a first parameter placeholder in the parameterized input query; generating a SQL representation of the generated first random value; confirming the SQL representation of the generated first random value is not a substring of the translated output query, not a substring of any of the other generated SQL representations of random values associated with the other parameter placeholders, and does not contain as a substring any of the other generated SQL representations of random values associated with the other parameter placeholders; storing an association between the parameter placeholder and the generated first random value; and storing an association between the parameter placeholder and the SQL representation of the generated first random value. | 0.534535 |
1. A method of providing database connectivity within an integrated development environment (IDE) tool, the method comprising: displaying a portion of source code in an editing pane of the IDE tool, wherein the portion of the source code includes at least a text string representing a database statement; determining a database to be accessed using the database statement; establishing a database connection between the IDE tool and the database; retrieving a data model associated with the database; upon determining the database statement includes one or more host variables passing data to the database, prompting for a value for each host variable; evaluating, based on the data model, the database statement to identify any errors in the database statement, wherein evaluating the database statement includes executing the database statement and providing an option to commit or rollback one or more database changes made as a result of executing the database statement; providing programming assistance based on the database statement and the data model, including providing an indication of any errors identified by the evaluation; and storing, by the IDE tool, the value provided for each host variable to allow the database statement to be re-executed from within the IDE tool without again prompting for values for the host variables. | 1. A method of providing database connectivity within an integrated development environment (IDE) tool, the method comprising: displaying a portion of source code in an editing pane of the IDE tool, wherein the portion of the source code includes at least a text string representing a database statement; determining a database to be accessed using the database statement; establishing a database connection between the IDE tool and the database; retrieving a data model associated with the database; upon determining the database statement includes one or more host variables passing data to the database, prompting for a value for each host variable; evaluating, based on the data model, the database statement to identify any errors in the database statement, wherein evaluating the database statement includes executing the database statement and providing an option to commit or rollback one or more database changes made as a result of executing the database statement; providing programming assistance based on the database statement and the data model, including providing an indication of any errors identified by the evaluation; and storing, by the IDE tool, the value provided for each host variable to allow the database statement to be re-executed from within the IDE tool without again prompting for values for the host variables. 22. The method of claim 1 , further comprising: upon identifying an error in the database statement, halting a project build process. | 0.62016 |
1. A method of subtitling, comprising the steps of: obtaining an audio file of dialogue in a first language; obtaining a file of script text corresponding to the dialogue in the audio file in the same first language; determining, by one or more processors of a computing device, a timing correspondence between dialogue in the audio file and words in the script text; detecting at least a first pause during performance of the dialogue in the audio file; defining, by the one or more processors, a respective breakable point in the script text corresponding to the or each detected pause; dividing, by the one or more processors, the script text out into a sequence of subtitle lines of text responsive to the location of one or more of the defined breakable points; obtaining a file of script text corresponding to the dialogue in the audio file in a different second language; obtaining the sequence of subtitle lines of text divided out of the script text of the first language, the sequence comprising a characteristic number of lines; detecting, by the one or more processors corresponding features of the text between both languages; dividing, by the one or more processors, the script text in the second language into a sequence of subtitle lines of text having the same characteristic number of lines, the points of division being responsive to the correspondence of features of the text between both languages; and outputting the sequence of subtitle lines of text for presentation on a display device. | 1. A method of subtitling, comprising the steps of: obtaining an audio file of dialogue in a first language; obtaining a file of script text corresponding to the dialogue in the audio file in the same first language; determining, by one or more processors of a computing device, a timing correspondence between dialogue in the audio file and words in the script text; detecting at least a first pause during performance of the dialogue in the audio file; defining, by the one or more processors, a respective breakable point in the script text corresponding to the or each detected pause; dividing, by the one or more processors, the script text out into a sequence of subtitle lines of text responsive to the location of one or more of the defined breakable points; obtaining a file of script text corresponding to the dialogue in the audio file in a different second language; obtaining the sequence of subtitle lines of text divided out of the script text of the first language, the sequence comprising a characteristic number of lines; detecting, by the one or more processors corresponding features of the text between both languages; dividing, by the one or more processors, the script text in the second language into a sequence of subtitle lines of text having the same characteristic number of lines, the points of division being responsive to the correspondence of features of the text between both languages; and outputting the sequence of subtitle lines of text for presentation on a display device. 3. A method of subtitling according to claim 1 , in which the step of detecting at least a first pause comprises the step of: classifying the pause as a short pause or a long pause according to whether the pause exceeds a predetermined threshold duration. | 0.552133 |
10. A method for processing Component Business Model (CBM) related data, the process comprising the following steps: providing CBM related data comprising a heat map; at a first converting step, automatically converting the CBM related data to a Unified Modeling Language (UML) representation; and subsequent to the first converting step, at a second converting step, converting the UML representation of the CBM related data to a Services Oriented Architecture (SOA) service model; wherein the first converting step comprises the steps of: (i) retrieving a plurality of CBM elements; (ii) processing the plurality of CBM elements; (iii) identifying a plurality of UML elements that respectively correspond to the plurality of CBM elements; and (iv) forming the plurality of UML elements into the UML representation of the CBM related data. | 10. A method for processing Component Business Model (CBM) related data, the process comprising the following steps: providing CBM related data comprising a heat map; at a first converting step, automatically converting the CBM related data to a Unified Modeling Language (UML) representation; and subsequent to the first converting step, at a second converting step, converting the UML representation of the CBM related data to a Services Oriented Architecture (SOA) service model; wherein the first converting step comprises the steps of: (i) retrieving a plurality of CBM elements; (ii) processing the plurality of CBM elements; (iii) identifying a plurality of UML elements that respectively correspond to the plurality of CBM elements; and (iv) forming the plurality of UML elements into the UML representation of the CBM related data. 11. The method of claim 10 wherein the SOA service model is a domain based SOA service model. | 0.668115 |
2. The method of claim 1 , wherein the at least one of the event attributes determined based on the at least one of the electronic messages includes one or more additional users associated with the event; and wherein the association of the event location identifier with the at least one of the event attributes includes an association of the event location identifier with the one or more additional users associated with the event. | 2. The method of claim 1 , wherein the at least one of the event attributes determined based on the at least one of the electronic messages includes one or more additional users associated with the event; and wherein the association of the event location identifier with the at least one of the event attributes includes an association of the event location identifier with the one or more additional users associated with the event. 3. The method of claim 2 , wherein determining that the at least one of the terms matches the at least one of the event attributes having the stored association with the event location identifier includes: determining that the at least one of the terms matches at least one of the additional users of the one or more additional users associated with the event. | 0.844685 |
1. Audio medium for educational use, having plural channels from which prerecorded sounds may be reproduced, comprising a multiplicity of sets or prerecorded sounds on said medium, each said set having a dichotic presentation and a diotic presentation, each said dichotic presentation having a stimulus on one of said channels and a first response, corresponding to said stimulus, on a second of said channels, and each said diotic presentation having a second response on both said one and said second channels, said second response of each said set corresponding to the said stimulus of that set. | 1. Audio medium for educational use, having plural channels from which prerecorded sounds may be reproduced, comprising a multiplicity of sets or prerecorded sounds on said medium, each said set having a dichotic presentation and a diotic presentation, each said dichotic presentation having a stimulus on one of said channels and a first response, corresponding to said stimulus, on a second of said channels, and each said diotic presentation having a second response on both said one and said second channels, said second response of each said set corresponding to the said stimulus of that set. 9. Audio medium as in claim 1, further comprising a silent interval between said dichotic and diotic presentations. | 0.752888 |
11. The computer readable medium of claim 10 further comprising the step of providing the message mapping information of the data source to the data model using a backend connector coupled to the data source. | 11. The computer readable medium of claim 10 further comprising the step of providing the message mapping information of the data source to the data model using a backend connector coupled to the data source. 12. The computer readable medium of claim 11 , wherein features of the backend connector are selected from the group comprising: connecting to a selected one from a plurality of the backend data sources; providing an interface for accessing the description of the backend data source; and providing for the identification of notification services configured for pushing notifications over the network to the device. | 0.851741 |
1. A method for implementation by one or more data processors and comprising: receiving, by at least one data processor, a set of data records the data records comprising one or more names of one or more entities in a source language from a source document; generating, by at least one data processor, candidate translations for the names of the data records, the candidate translations being strings of characters in a target language that has a different character set than a character set of the source language; querying, by at least one data processor, a data repository for records matching the candidate translations; and selecting, by at least one data processor, a translation of at least one of the names from the candidate translations based on a comparison of the candidate translations and properties of the source document with the result of the querying the data repository, the properties comprising of co-occurrence of terms in the source document, date of publication of the source document, a first frequency of the names of the data records in the source document, and a second frequency of the names of the data records in documents published since a particular date. | 1. A method for implementation by one or more data processors and comprising: receiving, by at least one data processor, a set of data records the data records comprising one or more names of one or more entities in a source language from a source document; generating, by at least one data processor, candidate translations for the names of the data records, the candidate translations being strings of characters in a target language that has a different character set than a character set of the source language; querying, by at least one data processor, a data repository for records matching the candidate translations; and selecting, by at least one data processor, a translation of at least one of the names from the candidate translations based on a comparison of the candidate translations and properties of the source document with the result of the querying the data repository, the properties comprising of co-occurrence of terms in the source document, date of publication of the source document, a first frequency of the names of the data records in the source document, and a second frequency of the names of the data records in documents published since a particular date. 16. The method of claim 1 , wherein the entities comprise a person, a location, and an organization. | 0.569531 |
9. The method according to claim 8 , wherein the first medical terminology comprises an International Classification of Diseases terminology. | 9. The method according to claim 8 , wherein the first medical terminology comprises an International Classification of Diseases terminology. 10. The method according to claim 9 , wherein the second medical terminology comprises a Systemized Nomenclature of Medicine terminology. | 0.941432 |
21. The method of claim 20 , wherein the performing step includes a noise-minimizing frequency-wise gain adjustment step comprising adjusting the current candidate frequency-wise gain to compensate for a noise spectrum associated with the communications path, specifically, such that adjustment of the gain of the intelligibility enhancing device in accord with that candidate frequency-wise gain would bring that spectrum to audiogram thresholds. | 21. The method of claim 20 , wherein the performing step includes a noise-minimizing frequency-wise gain adjustment step comprising adjusting the current candidate frequency-wise gain to compensate for a noise spectrum associated with the communications path, specifically, such that adjustment of the gain of the intelligibility enhancing device in accord with that candidate frequency-wise gain would bring that spectrum to audiogram thresholds. 22. The method of claim 21 , wherein the performing step includes re-adjusting the current candidate frequency-wise gain to remove at least some of the adjustments made in noise-minimizing frequency-wise gain adjustment step. | 0.839418 |
9. The system of claim 1 , wherein the upload module is further adapted to: determine a value signifying that the first profile is correctly associated with the electronic document based on values being identified for one or more attributes of the first set of one or more attributes defined for the first profile; and in response to the value exceeding a predetermined threshold, automatically upload the electronic document to the memory. | 9. The system of claim 1 , wherein the upload module is further adapted to: determine a value signifying that the first profile is correctly associated with the electronic document based on values being identified for one or more attributes of the first set of one or more attributes defined for the first profile; and in response to the value exceeding a predetermined threshold, automatically upload the electronic document to the memory. 10. The system of claim 9 , wherein the upload module is further adapted to select the first profile from a set of one or more profiles based on the values being identified for one or more attributes of the first set of one or more attributes defined for the first profile. | 0.965827 |
1. A method comprising: receiving, by a computing device, an indication of user-inputted text; storing, by the computing device, a lexicon that includes a set of in-lexicon candidate strings and does not include a set of out-of-lexicon candidate strings, wherein each of the in-lexicon candidate strings and each of the out-of-lexicon candidate strings is a respective word in a particular language; for each respective in-lexicon candidate string of the set of in-lexicon candidate strings, determining, by the computing device, a respective score for the respective in-lexicon candidate string, wherein: the respective score is based at least in part on a probability of the respective in-lexicon candidate string as a whole being entered, and the probability of the respective in-lexicon candidate string being entered is affected by a word-level context of the respective in-lexicon candidate string that includes one or more character strings that precede the respective in-lexicon candidate string in the user-inputted text; for each respective out-of-lexicon candidate string of the set of out-of-lexicon candidate strings, determining, by the computing device, a respective score for the respective out-of-lexicon candidate string, wherein the respective score for the respective out-of-lexicon candidate string is based at least in part on respective probabilities of individual characters in the respective out-of-lexicon candidate string being entered and is not based on word-level probabilities; determining, by the computing device and based at least in part on the scores for the in-lexicon candidate strings and the scores for the out-of-lexicon candidate strings, a combined set of candidate strings from the set of in-lexicon candidate strings and the set of out-of-lexicon candidate strings, the combined set of candidate strings including at least one in-lexicon candidate string from the set of in-lexicon candidate strings and at least one out-of-lexicon candidate string from the set of out-of-lexicon candidate strings; outputting, by the computing device, at least a portion of the combined set of candidate strings for display; and responsive to an indication of a selection of a candidate string from the combined set of candidate strings, outputting, by the computing device, for display in place of the user-inputted text, the selected candidate string. | 1. A method comprising: receiving, by a computing device, an indication of user-inputted text; storing, by the computing device, a lexicon that includes a set of in-lexicon candidate strings and does not include a set of out-of-lexicon candidate strings, wherein each of the in-lexicon candidate strings and each of the out-of-lexicon candidate strings is a respective word in a particular language; for each respective in-lexicon candidate string of the set of in-lexicon candidate strings, determining, by the computing device, a respective score for the respective in-lexicon candidate string, wherein: the respective score is based at least in part on a probability of the respective in-lexicon candidate string as a whole being entered, and the probability of the respective in-lexicon candidate string being entered is affected by a word-level context of the respective in-lexicon candidate string that includes one or more character strings that precede the respective in-lexicon candidate string in the user-inputted text; for each respective out-of-lexicon candidate string of the set of out-of-lexicon candidate strings, determining, by the computing device, a respective score for the respective out-of-lexicon candidate string, wherein the respective score for the respective out-of-lexicon candidate string is based at least in part on respective probabilities of individual characters in the respective out-of-lexicon candidate string being entered and is not based on word-level probabilities; determining, by the computing device and based at least in part on the scores for the in-lexicon candidate strings and the scores for the out-of-lexicon candidate strings, a combined set of candidate strings from the set of in-lexicon candidate strings and the set of out-of-lexicon candidate strings, the combined set of candidate strings including at least one in-lexicon candidate string from the set of in-lexicon candidate strings and at least one out-of-lexicon candidate string from the set of out-of-lexicon candidate strings; outputting, by the computing device, at least a portion of the combined set of candidate strings for display; and responsive to an indication of a selection of a candidate string from the combined set of candidate strings, outputting, by the computing device, for display in place of the user-inputted text, the selected candidate string. 13. The method of claim 1 , wherein outputting at least a portion of the combined set of candidate strings comprises outputting, by the computing device and for display, a selected candidate string in place of another already-displayed character string. | 0.651239 |
1. A method to provide a capacitance to a design an integrated circuit comprising: receiving using a processor a layout of the integrated circuit; applying canonical hierarchical models to the layout, wherein the canonical hierarchical models include a first type canonical model representing a device having a plurality of first conductors to capture a first capacitance and a second type canonical model representing at least a portion of the device and one or more second conductors of the integrated circuit outside the device to capture a second capacitance; and determining a capacitance for the layout based on the applying. | 1. A method to provide a capacitance to a design an integrated circuit comprising: receiving using a processor a layout of the integrated circuit; applying canonical hierarchical models to the layout, wherein the canonical hierarchical models include a first type canonical model representing a device having a plurality of first conductors to capture a first capacitance and a second type canonical model representing at least a portion of the device and one or more second conductors of the integrated circuit outside the device to capture a second capacitance; and determining a capacitance for the layout based on the applying. 2. The method of claim 1 , further comprising determining one or more third conductors of a first domain of the layout; selecting the first type canonical model for the first domain based on the one or more third conductors; determining one or more fourth conductors of a second domain of the layout; selecting the second type canonical model for the second domain based on the one or more fourth conductors. | 0.707857 |
15. A system comprising a memory and at least one processor, the at least one processor configured to: receive a subject name; select a first set of facial images in a facial image database, wherein facial images in the first set are assigned the subject name; and find digital images from the collection of digital images, wherein one or more similarity groups including the digital images were previously associated with a similarity group including the first set of facial images, wherein the one or more similarity groups do not have an associated subject name, and wherein facial recognition templates of the one or more similarity groups substantially match a facial recognition template of the first set. | 15. A system comprising a memory and at least one processor, the at least one processor configured to: receive a subject name; select a first set of facial images in a facial image database, wherein facial images in the first set are assigned the subject name; and find digital images from the collection of digital images, wherein one or more similarity groups including the digital images were previously associated with a similarity group including the first set of facial images, wherein the one or more similarity groups do not have an associated subject name, and wherein facial recognition templates of the one or more similarity groups substantially match a facial recognition template of the first set. 17. The system of claim 15 , wherein the at least one processor is further configured to: authenticate a user to access facial images assigned the subject name; and allow the user to access images in the digital image collection that were previously associated with the first set. | 0.689179 |
44. The system of claim 40 , wherein: each segment translation server comprises a segment translation server cache operable to store language model data obtained from the plurality of language model servers and the replica language model servers for translating a segment. | 44. The system of claim 40 , wherein: each segment translation server comprises a segment translation server cache operable to store language model data obtained from the plurality of language model servers and the replica language model servers for translating a segment. 47. The system of claim 44 , wherein: each segment translation server is further operable to process translation of a segment before all of the requests in the request queue are served, and each segment translation server is further operable to finalize translation of the segment using the language model data obtained by the requests. | 0.93497 |
1. A computer-implemented user interface method of presenting results of a search customized using content preferences learned about a user, the method comprising: receiving a user input action for interacting with an application on a user device; in response to receiving the user input action, sending query information to a search engine, the query information including user information, the user information including (i) context information describing an environment in which the user input action was received, the context information adapted into a syntax understandable by the search engine, and (ii) a user signature representing content preferences learned about the user; generating customized search results by receiving a set of search results and auxiliary information from the search engine in response to sending the query information, the auxiliary information including information describing attributes of each search result of the set of search results that led to each search result being chosen by the search engine; ordering the set of search results based at least in part on the auxiliary information; and presenting, to the user, the ordered set of search results customized using the content preferences learned about the user. | 1. A computer-implemented user interface method of presenting results of a search customized using content preferences learned about a user, the method comprising: receiving a user input action for interacting with an application on a user device; in response to receiving the user input action, sending query information to a search engine, the query information including user information, the user information including (i) context information describing an environment in which the user input action was received, the context information adapted into a syntax understandable by the search engine, and (ii) a user signature representing content preferences learned about the user; generating customized search results by receiving a set of search results and auxiliary information from the search engine in response to sending the query information, the auxiliary information including information describing attributes of each search result of the set of search results that led to each search result being chosen by the search engine; ordering the set of search results based at least in part on the auxiliary information; and presenting, to the user, the ordered set of search results customized using the content preferences learned about the user. 2. The method of claim 1 , wherein the auxiliary information includes at least one of: an identification of a dataspace associated with each search result, an identification of the search engine that provided each search result, a relevance list, wherein a relevance list element represents a set of an attribute of each search result and a value indicating a relevance of the attribute to at least one of the query and the user information, a textual location list, wherein a textual location list element represents a location of search terms from the query information in fields provided by each search result, a disjunction indicator list, wherein a disjunction indicator list element represents whether a corresponding search term from the query information matched each search result, a spelling correction list, wherein a spelling correction list element represents whether a corresponding search term from the query information exactly matched a substring of fields from each search result, and wherein the spelling correction list element represents a value indicating a distance between each search term and the matched substring, if a match was based on an applied spelling correction, a complete word match list, wherein a complete word match list element represents whether a corresponding search term from the query information exactly matched a full word of fields from each search result based on an applied spelling correction, a field match list, wherein a field match list element represents whether the search query information matched all words of a field of each search result, a location proximity indicator representing a value for a distance from each search result to a specified location, and a location query-place indicator representing whether a part of the search query information matched an entity recognized to be a place having a location. | 0.514405 |
15. A method of determining an order in which to read a plurality of documents, the method comprising: using a processor to perform acts comprising: displaying a first document in a document space; calculating dissimilarity between a representative point in said document space and documents in said document space, wherein, at a time of said calculating, a plurality of documents in said document space, including said first document, have been displayed; identifying, using a chooser, a second document in said document space as satisfying a condition as to said second document's level of dissimilarity to said representative point, said condition comprising that said second document has a sufficient level of dissimilarity from said representative point; receiving a selection of said second document; displaying said second document after said first document based on said second document having been found to have said sufficient level of dissimilarity from said representative point, and based on said second document's having been identified by said chooser: and finding a centroid based on said plurality of documents, said representative point being said centroid. | 15. A method of determining an order in which to read a plurality of documents, the method comprising: using a processor to perform acts comprising: displaying a first document in a document space; calculating dissimilarity between a representative point in said document space and documents in said document space, wherein, at a time of said calculating, a plurality of documents in said document space, including said first document, have been displayed; identifying, using a chooser, a second document in said document space as satisfying a condition as to said second document's level of dissimilarity to said representative point, said condition comprising that said second document has a sufficient level of dissimilarity from said representative point; receiving a selection of said second document; displaying said second document after said first document based on said second document having been found to have said sufficient level of dissimilarity from said representative point, and based on said second document's having been identified by said chooser: and finding a centroid based on said plurality of documents, said representative point being said centroid. 16. The method of claim 15 , wherein said representative point is said first document. | 0.616679 |
1. A method for building and applying fuzzy term partitions, the method comprising: receiving a fuzzy term input; building a fuzzy category taxonomy based on the received input; implementing the built fuzzy category taxonomy into a fuzzy category classifier; building a fuzzy term extractor based on the implemented fuzzy category classifier; building a fuzzy term association map based on the built fuzzy term extractor; processing a plurality of words stored on a database; extracting a fuzzy term from the processed plurality of words; associating the extracted fuzzy term with a plurality of context data; producing a context data partition for the extracted fuzzy term based on the associated plurality of context data; and applying a weight to the extracted fuzzy term. | 1. A method for building and applying fuzzy term partitions, the method comprising: receiving a fuzzy term input; building a fuzzy category taxonomy based on the received input; implementing the built fuzzy category taxonomy into a fuzzy category classifier; building a fuzzy term extractor based on the implemented fuzzy category classifier; building a fuzzy term association map based on the built fuzzy term extractor; processing a plurality of words stored on a database; extracting a fuzzy term from the processed plurality of words; associating the extracted fuzzy term with a plurality of context data; producing a context data partition for the extracted fuzzy term based on the associated plurality of context data; and applying a weight to the extracted fuzzy term. 4. The method of claim 1 , wherein the context data partition is created for each fuzzy term. | 0.72026 |
5. A method comprising: rendering, by a computer system comprising one or more processors, a first glyph associated with a font in a first font size; increasing a first contrast of the first glyph in the first font size by adjusting a first grayscale value associated with the first glyph in the first font size to generate an adjusted first grayscale value; storing the adjusted first grayscale value in a grayscale mapping table associated with the font, the grayscale mapping table comprising a default grayscale value for the first glyph in a second font size; and generating a font file comprising the first glyph and the grayscale mapping table, wherein the grayscale mapping table comprises a first glyph identifier of the first glyph associated with a default grayscale table identifier that includes the first grayscale value, and wherein the grayscale mapping table comprises the first glyph identifier associated with an adjusted grayscale value table identifier that includes the adjusted first grayscale value. | 5. A method comprising: rendering, by a computer system comprising one or more processors, a first glyph associated with a font in a first font size; increasing a first contrast of the first glyph in the first font size by adjusting a first grayscale value associated with the first glyph in the first font size to generate an adjusted first grayscale value; storing the adjusted first grayscale value in a grayscale mapping table associated with the font, the grayscale mapping table comprising a default grayscale value for the first glyph in a second font size; and generating a font file comprising the first glyph and the grayscale mapping table, wherein the grayscale mapping table comprises a first glyph identifier of the first glyph associated with a default grayscale table identifier that includes the first grayscale value, and wherein the grayscale mapping table comprises the first glyph identifier associated with an adjusted grayscale value table identifier that includes the adjusted first grayscale value. 13. The method of claim 5 , further comprising: determining that the first glyph comprises a curved line portion; and increasing the first contrast by adjusting the first grayscale value by a first incremental amount, wherein the first incremental amount is greater than a second incremental amount for contrast adjustments to glyphs with straight line portions. | 0.804205 |
1. A computerized method of automatically identifying keywords relevant to a document invisible to search engines comprising: analyzing at a computer the document invisible to search engine crawlers to obtain a keyword starter set from the document, the keyword starter set obtained by: (1) applying at said computer an automated parser to the document to obtain keywords; and (2) applying a frequency prominence analysis to the keywords to select one or more frequently occurring keywords to add to the keyword starter set; expanding at the computer the keyword starter set by applying a computerized taxonomy to the keyword starter set to form a keyword super set; applying at the computer a keyword stop list to keywords in the keyword super set to remove keywords included in the keyword stop list; refining at the computer the keyword super set to form a keyword final set by applying keyword demand data to the keyword super set to remove one or more additional keywords from the keyword super set, wherein the demand data reflects the frequency of use of the keywords as search terms in internet search engines; adding at the computer the keyword final set to a web page for accessing the document; storing the document invisible to search engines for retrieval via the web page for accessing the document; adding the web page with the keyword final set to a web site to facilitate location by internet search engines of the web page for accessing the document according to the keywords added to the web page; and providing internet users with access via the web page to the document invisible to search engines. | 1. A computerized method of automatically identifying keywords relevant to a document invisible to search engines comprising: analyzing at a computer the document invisible to search engine crawlers to obtain a keyword starter set from the document, the keyword starter set obtained by: (1) applying at said computer an automated parser to the document to obtain keywords; and (2) applying a frequency prominence analysis to the keywords to select one or more frequently occurring keywords to add to the keyword starter set; expanding at the computer the keyword starter set by applying a computerized taxonomy to the keyword starter set to form a keyword super set; applying at the computer a keyword stop list to keywords in the keyword super set to remove keywords included in the keyword stop list; refining at the computer the keyword super set to form a keyword final set by applying keyword demand data to the keyword super set to remove one or more additional keywords from the keyword super set, wherein the demand data reflects the frequency of use of the keywords as search terms in internet search engines; adding at the computer the keyword final set to a web page for accessing the document; storing the document invisible to search engines for retrieval via the web page for accessing the document; adding the web page with the keyword final set to a web site to facilitate location by internet search engines of the web page for accessing the document according to the keywords added to the web page; and providing internet users with access via the web page to the document invisible to search engines. 3. The method of claim 1 , wherein the keyword starter set comprises a plurality of keywords in a section title of the document. | 0.734561 |
1. A method for determining related search terms for a landing page on a domain, using one or more computers, the method comprising: receiving, by the one or more computers, a request for related search terms for a domain; determining, using the one or more computers, an initial pool of related search terms for the domain; obtaining click data on the domain, using the one or more computers, for the initial pool of related search terms determined for the domain; obtaining revenue generation data for each of a plurality of the initial pool of related search terms, using the one or more computers, wherein revenue generation data comprises data indicating that a user has clicked on a given one of the initial related search terms present on the domain and further clicked on an advertisement displayed in response to clicking the initial related search term; determining, using the one or more computers, a first set of search terms from the initial pool of related search terms, the first set comprising search terms with higher revenue or click generation as compared to other search terms of the initial pool of related search terms, based at least in part on the obtained revenue generation data or obtained click data; generating a second set of at least two new related search terms, using the one or more computers, comprising: obtaining keywords, using the one or more computers, that are semantically relevant to the first set of search terms based at least in part on one or more match scores; obtaining for each of multiple of the keywords, using the one or more computers, how many advertisements are targeted to the respective keyword; obtaining for each of multiple of the respective keywords, using the one or more computers, an amount that advertisers have paid over a period of time for use of the respective keyword by the advertisement server to bring up their respective advertisement when a direct search is made using the respective keyword; selecting respective keywords for the second set of new related search terms based at least in part on how many advertisements are targeted to the respective keyword and based at least in part on how much advertisers have paid over a period of time for use of the respective keyword; and listing, using the one or more computers, on an updated landing page returned for the domain, the first set of initial related search terms with higher revenue generation and the second set of new related search terms. | 1. A method for determining related search terms for a landing page on a domain, using one or more computers, the method comprising: receiving, by the one or more computers, a request for related search terms for a domain; determining, using the one or more computers, an initial pool of related search terms for the domain; obtaining click data on the domain, using the one or more computers, for the initial pool of related search terms determined for the domain; obtaining revenue generation data for each of a plurality of the initial pool of related search terms, using the one or more computers, wherein revenue generation data comprises data indicating that a user has clicked on a given one of the initial related search terms present on the domain and further clicked on an advertisement displayed in response to clicking the initial related search term; determining, using the one or more computers, a first set of search terms from the initial pool of related search terms, the first set comprising search terms with higher revenue or click generation as compared to other search terms of the initial pool of related search terms, based at least in part on the obtained revenue generation data or obtained click data; generating a second set of at least two new related search terms, using the one or more computers, comprising: obtaining keywords, using the one or more computers, that are semantically relevant to the first set of search terms based at least in part on one or more match scores; obtaining for each of multiple of the keywords, using the one or more computers, how many advertisements are targeted to the respective keyword; obtaining for each of multiple of the respective keywords, using the one or more computers, an amount that advertisers have paid over a period of time for use of the respective keyword by the advertisement server to bring up their respective advertisement when a direct search is made using the respective keyword; selecting respective keywords for the second set of new related search terms based at least in part on how many advertisements are targeted to the respective keyword and based at least in part on how much advertisers have paid over a period of time for use of the respective keyword; and listing, using the one or more computers, on an updated landing page returned for the domain, the first set of initial related search terms with higher revenue generation and the second set of new related search terms. 8. The method as defined in claim 1 , further comprising including additional terms in the second set of new related search terms based on commercial searches on a search engine using terms that are related to the initial related search terms. | 0.547816 |
1. A computer-implemented method comprising: receiving, from a client, at a server system operated by a first party, a first client request for hotel data that satisfies one or more criteria, wherein the first client request includes a first plurality of hotel identifiers, each of which uniquely identifies a different hotel from a plurality of hotels; identifying a mapping that maps a first set of identifiers to a second set of identifiers that were established by one or more other parties, each of which is different than the first party and stores specific hotel information in association with an identifier in the second set of identifiers; using the mapping to identify a second plurality of hotel identifiers based on the first plurality of hotel identifiers, wherein each hotel identifier in the second plurality of hotel identifiers (a) uniquely identifies a different hotel from the plurality of hotels; (b) was established by a second party that is different than the first party; and (c) is different than the corresponding hotel identifier in the first plurality of hotel identifiers; in response to receiving the first client request, generating a plurality of requests, each of which includes a different subset of the second plurality of hotel identifiers and requests a different set of data from a first source that is (1) remote relative to the server system and (2) operated by the second party that is different than the first party that operates the server system; sending the plurality of requests over a network from the server system to the first source of the second party; after sending the plurality of requests to the first source, receiving, at the server system, a plurality of responses from the first source; sending, from the server system, to the client, data from the plurality of responses; wherein the method is performed by one or more computing devices. | 1. A computer-implemented method comprising: receiving, from a client, at a server system operated by a first party, a first client request for hotel data that satisfies one or more criteria, wherein the first client request includes a first plurality of hotel identifiers, each of which uniquely identifies a different hotel from a plurality of hotels; identifying a mapping that maps a first set of identifiers to a second set of identifiers that were established by one or more other parties, each of which is different than the first party and stores specific hotel information in association with an identifier in the second set of identifiers; using the mapping to identify a second plurality of hotel identifiers based on the first plurality of hotel identifiers, wherein each hotel identifier in the second plurality of hotel identifiers (a) uniquely identifies a different hotel from the plurality of hotels; (b) was established by a second party that is different than the first party; and (c) is different than the corresponding hotel identifier in the first plurality of hotel identifiers; in response to receiving the first client request, generating a plurality of requests, each of which includes a different subset of the second plurality of hotel identifiers and requests a different set of data from a first source that is (1) remote relative to the server system and (2) operated by the second party that is different than the first party that operates the server system; sending the plurality of requests over a network from the server system to the first source of the second party; after sending the plurality of requests to the first source, receiving, at the server system, a plurality of responses from the first source; sending, from the server system, to the client, data from the plurality of responses; wherein the method is performed by one or more computing devices. 7. The method of claim 1 , wherein the hotel data includes data that indicates availability for the plurality of hotels and that indicates a price for the plurality of hotels. | 0.561874 |
20. The method as recited in claim 19 , further comprising: generating a report using at least a portion of data from at least a portion of the plurality of document data structures. | 20. The method as recited in claim 19 , further comprising: generating a report using at least a portion of data from at least a portion of the plurality of document data structures. 22. The method as recited in claim 20 , wherein the plurality of electronic statements are associated with a plurality of customers, wherein the at least a portion of the plurality of document data structures are associated with two or more of the plurality of customers. | 0.906527 |
16. The method according to claim 15 , further comprising, before the step of presenting, retrieving as the best interpretation, from a database comprising allographs, a best allograph that is associated with the best handwriting symbol pattern of the best template. | 16. The method according to claim 15 , further comprising, before the step of presenting, retrieving as the best interpretation, from a database comprising allographs, a best allograph that is associated with the best handwriting symbol pattern of the best template. 18. The method according to claim 16 , wherein the step of presenting comprises presenting the best allograph represented by a number of arcs depicting the way of hand writing symbols of the best template. | 0.894948 |
13. A computer-implemented system, comprising: a relational model that includes a plurality of atoms and a plurality of relationships between atoms; and a modifier component receives an identity of a user and automatically modifies the relational model based at least in part upon an identity of a user to generate a modified relational model. | 13. A computer-implemented system, comprising: a relational model that includes a plurality of atoms and a plurality of relationships between atoms; and a modifier component receives an identity of a user and automatically modifies the relational model based at least in part upon an identity of a user to generate a modified relational model. 14. The system of claim 13 , wherein the relational model is a Markov Logic Network. | 0.903595 |
1. A computer-implemented method of downloading Hidden Web pages comprising: a) selecting a query term; b) issuing a query to a site-specific search interface containing Hidden Web pages; c) acquiring a results index; d) downloading the Hidden Web pages from the results index; e) identifying a plurality of potential query terms from the downloaded Hidden Web pages; f) estimating the efficiency of each potential query term based on a ratio of the number of new pages returned for a particular query to the cost of issuing the particular query wherein the cost of issuing the particular query is equal to c q +c r P(q i )+c d P new (q i ) where P(q i ) represents the fraction of pages returned for a particular query (q i ) and P new (q i ) represents the fraction of new pages returned for a particular query (q i ), and where c q represents the cost of submitting the particular query, c r represents the cost of retrieving a results index page, and c d represents the cost for downloading a matching document; g) selecting a next query term from the plurality of potential query terms, wherein the next selected query term has the greatest efficiency; and h) issuing a next query to the site-specific search interface using the next query term. | 1. A computer-implemented method of downloading Hidden Web pages comprising: a) selecting a query term; b) issuing a query to a site-specific search interface containing Hidden Web pages; c) acquiring a results index; d) downloading the Hidden Web pages from the results index; e) identifying a plurality of potential query terms from the downloaded Hidden Web pages; f) estimating the efficiency of each potential query term based on a ratio of the number of new pages returned for a particular query to the cost of issuing the particular query wherein the cost of issuing the particular query is equal to c q +c r P(q i )+c d P new (q i ) where P(q i ) represents the fraction of pages returned for a particular query (q i ) and P new (q i ) represents the fraction of new pages returned for a particular query (q i ), and where c q represents the cost of submitting the particular query, c r represents the cost of retrieving a results index page, and c d represents the cost for downloading a matching document; g) selecting a next query term from the plurality of potential query terms, wherein the next selected query term has the greatest efficiency; and h) issuing a next query to the site-specific search interface using the next query term. 3. The method of claim 1 , wherein steps (c) through (h) are repeated a plurality of times until all the Hidden Web pages are downloaded. | 0.62332 |
32. A computer program embodied on a non-transitory computer readable medium for automatically generating one or more keywords from an electronic document comprising: a code segment for identifying candidate entries for the keywords by extracting all n-grams up to a specified length that do not cross sentence boundaries, reducing a size of a data set consisting of the extracted n-grams by applying one or more filters and balancing a distribution of positive and negative examples whenever the data set is derived from a training data set; a code segment for constructing a feature vector for each candidate entry, wherein the feature vector comprises at least one feature selected from the group consisting of one or more discourse comprehension features, one or more part-of-speech pattern features, and one or more encyclopedic annotation features; a code segment for assigning a numeric score to each candidate entry based on the feature vector for that candidate entry; and a code segment for selecting a specified number of entries to be retained as the keywords. | 32. A computer program embodied on a non-transitory computer readable medium for automatically generating one or more keywords from an electronic document comprising: a code segment for identifying candidate entries for the keywords by extracting all n-grams up to a specified length that do not cross sentence boundaries, reducing a size of a data set consisting of the extracted n-grams by applying one or more filters and balancing a distribution of positive and negative examples whenever the data set is derived from a training data set; a code segment for constructing a feature vector for each candidate entry, wherein the feature vector comprises at least one feature selected from the group consisting of one or more discourse comprehension features, one or more part-of-speech pattern features, and one or more encyclopedic annotation features; a code segment for assigning a numeric score to each candidate entry based on the feature vector for that candidate entry; and a code segment for selecting a specified number of entries to be retained as the keywords. 55. The computer program as recited in claim 32 , wherein the code segment for selecting further comprises: a code segment for determining criteria for a size for a keyword collection; a code segment whenever the criteria specify using a cutoff score, retaining all candidate entries having a score higher than the cutoff score; and a code segment whenever the criteria specify using a size for the keyword collection that is a predetermined ratio of the size of the electronic document, retaining a fraction of the candidate entries wherein the retained fraction of entries comprises those candidate entries having the highest numeric scores and results in the specified size for the keyword collection. | 0.690259 |
7. At least one processing device, each of the at least one processing device comprising: at least one processor; a memory; and a communication bus connecting the at least one processor with the memory, wherein the memory has stored therein instructions, which when executed by the at least one processor cause the at least one processing device to perform a method comprising: selecting each text file from a collection of text files, wherein the collection of text files have an intensity with respect to negative sentiment toward a common issue; and performing for each text file, at least one profile algorithm, each calculating a corresponding profile score for that text file; combining at least one corresponding profile score of the text files of the collection to produce a signature for the collection of text files including an aggregated profile score for each of the at least one profile algorithm; storing the aggregated profile score of each of the at least one profile algorithm for the collection; performing the at least one profile algorithm with respect to a desired text file to calculate a signature for the desired text file, the signature including a corresponding profile score for each of the at least one profile algorithm performed with respect to the desired text file; and performing a user-configured action when the signature of the collection is within a threshold distance of the signature of the desired text file, the user-configured action being a contacting action. | 7. At least one processing device, each of the at least one processing device comprising: at least one processor; a memory; and a communication bus connecting the at least one processor with the memory, wherein the memory has stored therein instructions, which when executed by the at least one processor cause the at least one processing device to perform a method comprising: selecting each text file from a collection of text files, wherein the collection of text files have an intensity with respect to negative sentiment toward a common issue; and performing for each text file, at least one profile algorithm, each calculating a corresponding profile score for that text file; combining at least one corresponding profile score of the text files of the collection to produce a signature for the collection of text files including an aggregated profile score for each of the at least one profile algorithm; storing the aggregated profile score of each of the at least one profile algorithm for the collection; performing the at least one profile algorithm with respect to a desired text file to calculate a signature for the desired text file, the signature including a corresponding profile score for each of the at least one profile algorithm performed with respect to the desired text file; and performing a user-configured action when the signature of the collection is within a threshold distance of the signature of the desired text file, the user-configured action being a contacting action. 8. The at least one processing device of claim 7 , wherein at least one of the at least one profile algorithm includes a first algorithm that calculates a profile score based on use and frequency of use of specific keywords in a text file. | 0.515341 |
11. The method of claim 1 , further comprising ranking the one or more aggregated search results. | 11. The method of claim 1 , further comprising ranking the one or more aggregated search results. 36. The method of claim 11 , wherein the ranking of each search result is based at least in part on a number of objects liked by the first user that are associated with the search result. | 0.96835 |
1. A method for providing a user interface that evolves based on learned idiosyncrasies and collected data of a user, the method comprising: storing learned idiosyncrasies and collected data of the user in a knowledge base; executing instructions stored in memory to obtain information from the surrounding environment of the user during learning of idiosyncrasies or collection of data; executing instructions stored in memory to generate thought-based statements based at least in part on the knowledge base and the information from the environment surrounding the user during learning of idiosyncrasies or collection of data, the thought-based statements serving to invoke or respond to subsequent actions of the user; executing instructions stored in memory to present the user interface and to allow for interaction with the user based at least in part on the thought-based statements; and executing instructions stored in memory to develop personality nuances of the user interface that affect the interaction between the user and the user interface, wherein executing instructions to develop the personality nuances includes analyzing past verbal input by the user, wherein the generated thought-based statements are further based on the analysis of the past verbal input. | 1. A method for providing a user interface that evolves based on learned idiosyncrasies and collected data of a user, the method comprising: storing learned idiosyncrasies and collected data of the user in a knowledge base; executing instructions stored in memory to obtain information from the surrounding environment of the user during learning of idiosyncrasies or collection of data; executing instructions stored in memory to generate thought-based statements based at least in part on the knowledge base and the information from the environment surrounding the user during learning of idiosyncrasies or collection of data, the thought-based statements serving to invoke or respond to subsequent actions of the user; executing instructions stored in memory to present the user interface and to allow for interaction with the user based at least in part on the thought-based statements; and executing instructions stored in memory to develop personality nuances of the user interface that affect the interaction between the user and the user interface, wherein executing instructions to develop the personality nuances includes analyzing past verbal input by the user, wherein the generated thought-based statements are further based on the analysis of the past verbal input. 9. The method of claim 1 , wherein the user interface includes an avatar. | 0.571429 |
2. The method of claim 1 , further comprising the steps of: f. receiving a second plurality of text messages over a second period of time in a subsequent message session related to the particular topic; g. storing each of the received second plurality of text messages in the database; h. analyzing the database to update the thesaurus with one or more of the second plurality of text messages stored in the database; and i. transmitting the updated thesaurus to the communication device; whereby the previously transmitted thesaurus is replaced by the updated thesaurus. | 2. The method of claim 1 , further comprising the steps of: f. receiving a second plurality of text messages over a second period of time in a subsequent message session related to the particular topic; g. storing each of the received second plurality of text messages in the database; h. analyzing the database to update the thesaurus with one or more of the second plurality of text messages stored in the database; and i. transmitting the updated thesaurus to the communication device; whereby the previously transmitted thesaurus is replaced by the updated thesaurus. 3. The method of claim 2 , wherein the step of preparing a thesaurus comprises creating a thesaurus based at least in part for each topic in the database. | 0.783007 |
12. The computer system of claim 6 further comprising: means for performing version control of the atomic expression bodies. | 12. The computer system of claim 6 further comprising: means for performing version control of the atomic expression bodies. 13. The computer system of claim 12 wherein the means for performing version control of the atomic expression bodies automatically creates a new version of an atomic expression body upon determination that an atomic expression body has been modified and is syntactically correct and has no unresolved external references. | 0.881965 |
1. A method for detecting hidden information embedded in a document comprising characters, wherein, a document for detection is formed by embedding hidden information in an original document by performing layout transformation on characters in the original document according to a predetermined embedding rule, and the method comprises: determining layout transformation for each character in the document for detection compared with the original document; obtaining a code sequence embedded in the document for detection based on the layout transformation of each character in the document for detection and the predetermined embedding rule; decoding the code sequence to get the hidden information embedded in the document for detection; wherein, the predetermined embedding rule comprises: acquiring a code sequence for each class of layout transformation by coding the hidden information to be embedded in the class of layout transformation; wherein, each class of layout transformation is considered as a channel to embed the hidden information; selecting the characters to be subjected to the layout transformation for each class of the layout transformation from the document respectively, length of the characters to be subjected to the layout transformation being larger than or equal to length of the code sequence corresponding to each class of the layout transformation; performing the layout transformation on the selected characters according to the acquired code sequence for each class of the layout transformation in a cyclic application, each value in the code sequence for each class of the layout transformation corresponding to a transformation number of each class of the layout transformation. | 1. A method for detecting hidden information embedded in a document comprising characters, wherein, a document for detection is formed by embedding hidden information in an original document by performing layout transformation on characters in the original document according to a predetermined embedding rule, and the method comprises: determining layout transformation for each character in the document for detection compared with the original document; obtaining a code sequence embedded in the document for detection based on the layout transformation of each character in the document for detection and the predetermined embedding rule; decoding the code sequence to get the hidden information embedded in the document for detection; wherein, the predetermined embedding rule comprises: acquiring a code sequence for each class of layout transformation by coding the hidden information to be embedded in the class of layout transformation; wherein, each class of layout transformation is considered as a channel to embed the hidden information; selecting the characters to be subjected to the layout transformation for each class of the layout transformation from the document respectively, length of the characters to be subjected to the layout transformation being larger than or equal to length of the code sequence corresponding to each class of the layout transformation; performing the layout transformation on the selected characters according to the acquired code sequence for each class of the layout transformation in a cyclic application, each value in the code sequence for each class of the layout transformation corresponding to a transformation number of each class of the layout transformation. 10. The method of claim 1 , wherein, the class of layout transformation comprises: changes to the character size, character position in the page layout or the character font. | 0.577338 |
1. A computer-implemented method comprising: hosting, using one or more computing devices, a social network comprising a plurality of communities associated with a plurality of users; identifying, from the plurality of communities, a set of communities that a first user belongs to; determining, using the one or more computing devices, a list of classifications for the first user based upon the set of communities; determining a degree of personalization based on an amount that the first user has participated in each community of the set of communities; determining, using the one or more computing devices, personalization information from the list of classifications associated with the first user and the degree of personalization; generating, using the one or more computing devices, a personalized search query based upon the personalization information; and searching, using the one or more computing devices, a content index using the personalized search query to produce a search result set comprising documents relevant to the personalized search query. | 1. A computer-implemented method comprising: hosting, using one or more computing devices, a social network comprising a plurality of communities associated with a plurality of users; identifying, from the plurality of communities, a set of communities that a first user belongs to; determining, using the one or more computing devices, a list of classifications for the first user based upon the set of communities; determining a degree of personalization based on an amount that the first user has participated in each community of the set of communities; determining, using the one or more computing devices, personalization information from the list of classifications associated with the first user and the degree of personalization; generating, using the one or more computing devices, a personalized search query based upon the personalization information; and searching, using the one or more computing devices, a content index using the personalized search query to produce a search result set comprising documents relevant to the personalized search query. 2. The computer-implemented method of claim 1 , wherein determining the personalization information further comprises receiving a suggested search term from a member of the set of communities, wherein the personalized search query, generated based upon the personalization information, includes the suggested search term, and wherein searching the content index to produce the search result set is based upon the personalized search query including the suggested search term. | 0.5 |
1. A method comprising: proxying an Open Database Connectivity (ODBC) call from an application to one or more query engines of a plurality of query engines, the proxying comprising: replacing an ODBC interface of a processor with an ODBC proxy as a drop-in replacement for the ODBC interface, wherein the ODBC interface is configured to perform one or more functions including at least one of: accept the ODBC call from the application, forward a query of the ODBC call to a query engine of the plurality of query engines, and return at least one result of the forwarded query to the application in a format usable by the application, and wherein based on the replacing, the ODBC proxy performs the one or more functions of the ODBC interface; receiving, from the application at the ODBC proxy, the ODBC call; determining by the ODBC proxy which one or more query engines of the plurality of query engines should be used to satisfy the query, the determining being based on one or more characteristics of the query and on one or more capabilities of the plurality of query engines to compute query results; routing the query to one or more selected query engines based on the determining; receiving by the ODBC proxy results from the one or more selected query engines; and returning the results received from the one or more selected query engines to the application. | 1. A method comprising: proxying an Open Database Connectivity (ODBC) call from an application to one or more query engines of a plurality of query engines, the proxying comprising: replacing an ODBC interface of a processor with an ODBC proxy as a drop-in replacement for the ODBC interface, wherein the ODBC interface is configured to perform one or more functions including at least one of: accept the ODBC call from the application, forward a query of the ODBC call to a query engine of the plurality of query engines, and return at least one result of the forwarded query to the application in a format usable by the application, and wherein based on the replacing, the ODBC proxy performs the one or more functions of the ODBC interface; receiving, from the application at the ODBC proxy, the ODBC call; determining by the ODBC proxy which one or more query engines of the plurality of query engines should be used to satisfy the query, the determining being based on one or more characteristics of the query and on one or more capabilities of the plurality of query engines to compute query results; routing the query to one or more selected query engines based on the determining; receiving by the ODBC proxy results from the one or more selected query engines; and returning the results received from the one or more selected query engines to the application. 3. The method of claim 1 , wherein the plurality of query engines comprises at least one of one or more database servers or one or more query application engines. | 0.662178 |
12. A computer system comprising: at least one processor; and memory comprising instructions stored thereon that when executed by at least one processor cause at least one processor to perform acts comprising: receiving a query; inferring a query reading level representation from one or more user input actions associated with the query, the query reading level representation comprising a reading level distribution over multiple distribution reading levels, with the reading level distribution over multiple distribution reading levels comprising, for each of the multiple distribution reading levels, an indication of a probability that an item at that distribution reading level will be understood; in response to the query, ranking search result items, the ranking being based at least in part on the query reading level representation for the query and reading difficulty level representations for the search result items; and in response to the query, returning the search result items and one or more indications of the ranking. | 12. A computer system comprising: at least one processor; and memory comprising instructions stored thereon that when executed by at least one processor cause at least one processor to perform acts comprising: receiving a query; inferring a query reading level representation from one or more user input actions associated with the query, the query reading level representation comprising a reading level distribution over multiple distribution reading levels, with the reading level distribution over multiple distribution reading levels comprising, for each of the multiple distribution reading levels, an indication of a probability that an item at that distribution reading level will be understood; in response to the query, ranking search result items, the ranking being based at least in part on the query reading level representation for the query and reading difficulty level representations for the search result items; and in response to the query, returning the search result items and one or more indications of the ranking. 13. The computer system of claim 12 , wherein ranking comprises receiving an initial ranking of the search result items and re-ranking the search result items, the re-ranking being based at least in part on a query reading level representation for the query and reading difficulty level representations for the search result items. | 0.642808 |
21. The system of claim 13 , wherein the entity is a person. | 21. The system of claim 13 , wherein the entity is a person. 22. The system of claim 21 , wherein the entity attribute is a name. | 0.987011 |
30. A bone anchor assembly for securing an elongate rod to a bone, the bone anchor assembly comprising: a receiver having a vertical axis, a lower body defining an internal cavity communicating with a bottom surface of the receiver through a bottom opening, and a first pair of upright arms extending upwardly from the lower body to define a first channel opening onto a top thereof for receiving the elongate rod, the first channel having a transverse axis perpendicular to the vertical axis and communicating with the internal cavity to define a through bore centered around the vertical axis, the upright arms having interior surfaces with a discontinuous guide and advancement structure formed therein, the receiver having opposed recesses with downwardly-facing top surfaces located entirely below the discontinuous guide and advancement structure; a bone attachment structure having a body and an upper head portion with a substantially spherical surface above a hemisphere thereof, the body extending through the receiver bottom opening and pivotal with respect to the receiver; and an insert having a body with a second pair of upright arms centered around a vertically-extending midsection of the body and forming a second channel therebetween, the second channel being alignable with the receiver transverse axis to receive the elongate rod, the insert upright arms having uppermost portions protruding laterally at the vertically-extending midsection of the insert body and terminating at uppermost top surfaces, the insert body further including a central through-and-through tool receiving opening and oppositely-directed opposed radial extensions in the direction of the receiver transverse axis to inhibit rotation between the receiver and the insert, wherein top surfaces of the insert opposed radial extensions extend radially outward so as to be underneath a most bottom surface of the elongate rod, and wherein the uppermost top surfaces of the upright arms are snapped under and engaging the downwardly-facing top surfaces of the receiver opposed recesses to prevent upward movement of the insert when the insert is fully disposed within the receiver first channel, so as to prevent the insert from moving back up within the receiver prior to the insert being further pushed down within the receiver into a locked orientation by a closure. | 30. A bone anchor assembly for securing an elongate rod to a bone, the bone anchor assembly comprising: a receiver having a vertical axis, a lower body defining an internal cavity communicating with a bottom surface of the receiver through a bottom opening, and a first pair of upright arms extending upwardly from the lower body to define a first channel opening onto a top thereof for receiving the elongate rod, the first channel having a transverse axis perpendicular to the vertical axis and communicating with the internal cavity to define a through bore centered around the vertical axis, the upright arms having interior surfaces with a discontinuous guide and advancement structure formed therein, the receiver having opposed recesses with downwardly-facing top surfaces located entirely below the discontinuous guide and advancement structure; a bone attachment structure having a body and an upper head portion with a substantially spherical surface above a hemisphere thereof, the body extending through the receiver bottom opening and pivotal with respect to the receiver; and an insert having a body with a second pair of upright arms centered around a vertically-extending midsection of the body and forming a second channel therebetween, the second channel being alignable with the receiver transverse axis to receive the elongate rod, the insert upright arms having uppermost portions protruding laterally at the vertically-extending midsection of the insert body and terminating at uppermost top surfaces, the insert body further including a central through-and-through tool receiving opening and oppositely-directed opposed radial extensions in the direction of the receiver transverse axis to inhibit rotation between the receiver and the insert, wherein top surfaces of the insert opposed radial extensions extend radially outward so as to be underneath a most bottom surface of the elongate rod, and wherein the uppermost top surfaces of the upright arms are snapped under and engaging the downwardly-facing top surfaces of the receiver opposed recesses to prevent upward movement of the insert when the insert is fully disposed within the receiver first channel, so as to prevent the insert from moving back up within the receiver prior to the insert being further pushed down within the receiver into a locked orientation by a closure. 49. The bone anchor assembly of claim 30 , wherein the insert upright arm uppermost portions flair radially outward and vertically upward, with the top surfaces of the uppermost portions defining the uppermost top surfaces of the insert. | 0.548059 |
97. The computer-accessible memory medium as recited in claim 69 , wherein each of the plurality of nodes is configured to propagate searchable data service information to others of the plurality of nodes in accordance with a gossip protocol. | 97. The computer-accessible memory medium as recited in claim 69 , wherein each of the plurality of nodes is configured to propagate searchable data service information to others of the plurality of nodes in accordance with a gossip protocol. 100. The computer-accessible memory medium as recited in claim 97 , wherein the plurality of nodes is configured to organize into groups of nodes each including a subset of the plurality of nodes, and wherein each group of nodes is configured to propagate searchable data service information within the group in accordance with the gossip protocol. | 0.922386 |
19. A apparatus for recognizing a gesture, the apparatus comprising: means for determining a first set of metrics to differentiate gestures from among only a first subset of gestures of a plurality of gestures, the first subset of gestures recognizable as valid input in a particular context of a user interface environment; means for receiving user input that causes a gesture classification context to be applied from a plurality of gesture classification contexts that are available for a means for gesture analysis, wherein the gesture classification context indicates the first subset of gestures; means for applying the gesture classification context to the means for gesture analysis; means for receiving data indicative of the gesture performed by a user after applying the gesture classification context; and means for, based on the first set of metrics, identifying using the means for gesture analysis, the gesture in accordance with the applied gesture classification context, wherein identifying includes identifying the gesture from only the first subset of gestures of the plurality of gestures indicated by the applied gesture classification context while the gesture classification context is applied; means for receiving an indication of a second subset of gestures from the plurality of gestures, wherein each gesture of the second subset of gestures is valid in a second gesture classification context; means for calculating a second set of metrics for the second subset of gestures to differentiate gestures from among only the second subset of gestures, wherein: only the second subset of gestures are eligible to be identified when the second gesture classification context is applied, and at least one gesture of the second subset of gestures is not in the first subset of gestures; means for receiving user input that causes the second gesture classification context to be applied to the means for gesture analysis; means for receiving data indicative of a second gesture performed by the user after applying the second gesture classification context; and means for identifying, based on the second set of metrics, the second gesture in accordance with the applied second gesture classification context, wherein identifying includes identifying the second gesture from only the second subset of gestures indicated by the applied second gesture classification context. | 19. A apparatus for recognizing a gesture, the apparatus comprising: means for determining a first set of metrics to differentiate gestures from among only a first subset of gestures of a plurality of gestures, the first subset of gestures recognizable as valid input in a particular context of a user interface environment; means for receiving user input that causes a gesture classification context to be applied from a plurality of gesture classification contexts that are available for a means for gesture analysis, wherein the gesture classification context indicates the first subset of gestures; means for applying the gesture classification context to the means for gesture analysis; means for receiving data indicative of the gesture performed by a user after applying the gesture classification context; and means for, based on the first set of metrics, identifying using the means for gesture analysis, the gesture in accordance with the applied gesture classification context, wherein identifying includes identifying the gesture from only the first subset of gestures of the plurality of gestures indicated by the applied gesture classification context while the gesture classification context is applied; means for receiving an indication of a second subset of gestures from the plurality of gestures, wherein each gesture of the second subset of gestures is valid in a second gesture classification context; means for calculating a second set of metrics for the second subset of gestures to differentiate gestures from among only the second subset of gestures, wherein: only the second subset of gestures are eligible to be identified when the second gesture classification context is applied, and at least one gesture of the second subset of gestures is not in the first subset of gestures; means for receiving user input that causes the second gesture classification context to be applied to the means for gesture analysis; means for receiving data indicative of a second gesture performed by the user after applying the second gesture classification context; and means for identifying, based on the second set of metrics, the second gesture in accordance with the applied second gesture classification context, wherein identifying includes identifying the second gesture from only the second subset of gestures indicated by the applied second gesture classification context. 24. The apparatus for recognizing the gesture of claim 19 , wherein: the determining the second subset of gestures from the plurality of gestures and the determining the second set of metrics for the second subset of gestures to differentiate gestures from among only the second subset of gestures occur during creation of a gesture subset database, wherein the gesture subset database comprises gesture classification contexts for multiple subsets of the plurality of gestures. | 0.515464 |
1. A computer-implemented method comprising: receiving a sequence of symbols that have been optically captured from a rendered document; determining that the sequence of symbols includes a particular symbol, word, or phrase that has been mapped to one or more actions; selecting an action from the one or more actions; and transmitting an instruction to a document management system to perform the selected action. | 1. A computer-implemented method comprising: receiving a sequence of symbols that have been optically captured from a rendered document; determining that the sequence of symbols includes a particular symbol, word, or phrase that has been mapped to one or more actions; selecting an action from the one or more actions; and transmitting an instruction to a document management system to perform the selected action. 8. The computer-implemented method of claim 1 , further comprising: receiving information associated with a location of a capture device used to optically capture the sequence of symbols from the rendered document; wherein selecting the action from the one or more actions is based at least in part on the location of the capture device. | 0.662937 |
1. A method for embedding covert data in a text document, the method comprising: providing the document with multiple characters that include a first character that occurs in first and second occurrences; analyzing a frequency of the multiple characters; selecting the first character from the multiple characters in response to the first character occurring most frequently in the multiple characters; selecting the first occurrence of the first character as a reference character and the second occurrence of the first character as a rotatable character; altering a rotational orientation of the rotatable character to produce an altered character with a predetermined rotation with respect to the reference character, wherein the rotation represents the embedded covert data; and formatting the document to produce a formatted document based on the altered character. | 1. A method for embedding covert data in a text document, the method comprising: providing the document with multiple characters that include a first character that occurs in first and second occurrences; analyzing a frequency of the multiple characters; selecting the first character from the multiple characters in response to the first character occurring most frequently in the multiple characters; selecting the first occurrence of the first character as a reference character and the second occurrence of the first character as a rotatable character; altering a rotational orientation of the rotatable character to produce an altered character with a predetermined rotation with respect to the reference character, wherein the rotation represents the embedded covert data; and formatting the document to produce a formatted document based on the altered character. 15. A method as claimed in claim 1 , wherein the rotation of the altered character represents a binary sequence. | 0.729061 |
1. A non-transitory computer readable medium with an executable program stored thereon, wherein the program instructs a microprocessor to perform the following steps to use speech commands to produce a formatted report of a predetermined type, comprising: identifying a set of phrases frequently used to complete discrete sections of the report; parsing the phrases, where parsing comprises: constructing the phrases using variables; assigning each set of variables an identifier; identifying unique, comfortable-to-say, short identifiers for each phrase including words that accurately bring the phrase to mind; labeling each phrase as a logical “and” or “or”; grouping identifiers into logical, comfortable, spoken sets, wherein one or more groupings are identified, appropriate for different user experience levels and coordinated so it is easy for the user to move to the next level; labeling each set as a logical “and” or “or”; and identifying punctuation locations; comparing identifier words throughout the report to eliminate ambiguities; and constructing text macros that follow the parsed text, enabling the user to speak the identifiers to indicate full, formatted text for inclusion in the report. | 1. A non-transitory computer readable medium with an executable program stored thereon, wherein the program instructs a microprocessor to perform the following steps to use speech commands to produce a formatted report of a predetermined type, comprising: identifying a set of phrases frequently used to complete discrete sections of the report; parsing the phrases, where parsing comprises: constructing the phrases using variables; assigning each set of variables an identifier; identifying unique, comfortable-to-say, short identifiers for each phrase including words that accurately bring the phrase to mind; labeling each phrase as a logical “and” or “or”; grouping identifiers into logical, comfortable, spoken sets, wherein one or more groupings are identified, appropriate for different user experience levels and coordinated so it is easy for the user to move to the next level; labeling each set as a logical “and” or “or”; and identifying punctuation locations; comparing identifier words throughout the report to eliminate ambiguities; and constructing text macros that follow the parsed text, enabling the user to speak the identifiers to indicate full, formatted text for inclusion in the report. 10. The non-transitory computer readable medium of claim 1 , wherein the executable program is adapted to operate within an application for an electronic medical record or an electronic health record. | 0.511197 |
1. A server that communicates with a remote device in a machine to machine wireless communication network, the server comprising: an input/output interface; a processor; and a memory storing a context-aware dictionary manager executable by the processor, a contextual correlations database having a plurality of correlations, each correlation of the plurality of correlations including an entry and a context associated with the entry, the context-aware dictionary manager being configured to establish a current context associated with the remote device; search the contextual correlations database using the current context; identify a correlation match with the current context and one of the plurality of correlations; and communicate, via the input/output interface, the entry associated with the correlation match to the remote device for adding to a dictionary at the remote device, wherein each entry of the plurality of correlations includes a respective identifier and a respective definition, and wherein the context-aware dictionary manager is configured to communicate the entry by communicating, via the input/output interface, an identifier and a definition associated with the correlation match to the remote device for adding to the dictionary at the remote device. | 1. A server that communicates with a remote device in a machine to machine wireless communication network, the server comprising: an input/output interface; a processor; and a memory storing a context-aware dictionary manager executable by the processor, a contextual correlations database having a plurality of correlations, each correlation of the plurality of correlations including an entry and a context associated with the entry, the context-aware dictionary manager being configured to establish a current context associated with the remote device; search the contextual correlations database using the current context; identify a correlation match with the current context and one of the plurality of correlations; and communicate, via the input/output interface, the entry associated with the correlation match to the remote device for adding to a dictionary at the remote device, wherein each entry of the plurality of correlations includes a respective identifier and a respective definition, and wherein the context-aware dictionary manager is configured to communicate the entry by communicating, via the input/output interface, an identifier and a definition associated with the correlation match to the remote device for adding to the dictionary at the remote device. 3. The server of claim 1 , wherein the current context includes one or more selected from the group consisting of a type of sensor attached to the remote device, environmental information related to a sensor, a type of actuator connected to the remote device, environmental information related to an actuator, time information related to a sensor acquiring a sensed parameter, time information related to an actuator providing an output, a model of sensor, a model of actuator, a number of sensors connected to a remote device, a number of actuators connected to a remote device, a role of a sensor, a role of an actuator, a location of a sensor, and a location of an actuator. | 0.5 |
15. A system comprising at least one computer processor configured to: analyze an audio communication between a first party and a second party to develop a transcript of the audio communication; analyze words spoken during the audio communication to develop a set of keywords, in which the set of keywords comprises a subset of the words spoken during the audio communication; provide a graphical user interface (“GUI”) to display on a computer monitor, the GUI comprising a timeline representing the audio communication; display a plurality of sets of icons on the GUI in conjunction with the timeline, wherein each set of icons comprises a text-based icon and an audio-based icon representing an occurrence of a keyword in the audio communication, the keyword being from the set of keywords and the text-based icon and the audio-based icon being displayed on the GUI at one or more locations with respect to the timeline proximate to a time of the occurrence of the keyword in the audio communication; receive an input from a user as a result of the user selecting a particular text-based icon or a particular audio-based icon representing a particular occurrence of a particular keyword in the audio communication; and after receiving the input: display a portion of the transcript containing the particular occurrence of the particular keyword if the user selected the particular text-based icon representing the particular occurrence of the particular keyword; and play a portion of the audio communication containing the particular occurrence of the particular keyword if the user selected the particular audio-based icon representing the particular occurrence of the particular keyword. | 15. A system comprising at least one computer processor configured to: analyze an audio communication between a first party and a second party to develop a transcript of the audio communication; analyze words spoken during the audio communication to develop a set of keywords, in which the set of keywords comprises a subset of the words spoken during the audio communication; provide a graphical user interface (“GUI”) to display on a computer monitor, the GUI comprising a timeline representing the audio communication; display a plurality of sets of icons on the GUI in conjunction with the timeline, wherein each set of icons comprises a text-based icon and an audio-based icon representing an occurrence of a keyword in the audio communication, the keyword being from the set of keywords and the text-based icon and the audio-based icon being displayed on the GUI at one or more locations with respect to the timeline proximate to a time of the occurrence of the keyword in the audio communication; receive an input from a user as a result of the user selecting a particular text-based icon or a particular audio-based icon representing a particular occurrence of a particular keyword in the audio communication; and after receiving the input: display a portion of the transcript containing the particular occurrence of the particular keyword if the user selected the particular text-based icon representing the particular occurrence of the particular keyword; and play a portion of the audio communication containing the particular occurrence of the particular keyword if the user selected the particular audio-based icon representing the particular occurrence of the particular keyword. 19. The system of claim 15 , wherein the at least one computer processor is further configured to: receive an annotation from the user, wherein the annotation corresponds to a particular time associated with the audio communication; and display an annotation icon representing the annotation on the GUI at a location with respect to the timeline proximate to the particular time associated with the audio communication. | 0.637931 |
6. A non-transitory computer-readable storage medium bearing instructions that, when executed by a computer, cause the computer to perform the following steps: obtaining a command phrase specifying an operation, a protocol, and an object, wherein the command phrase is in a natural language based syntax; obtaining one or more parameters associated with the command phrase; determining that one or more additional parameters are associated with the command phrase; obtaining the one or more additional parameters from a database translating the command phrase, the one or more parameters, and the one or more additional parameters into an XML command; transmitting the XML command to the registry; obtaining a response from the registry; and determining that the response corresponds to an anticipated response; wherein the one or mere parameters comprise a variable. | 6. A non-transitory computer-readable storage medium bearing instructions that, when executed by a computer, cause the computer to perform the following steps: obtaining a command phrase specifying an operation, a protocol, and an object, wherein the command phrase is in a natural language based syntax; obtaining one or more parameters associated with the command phrase; determining that one or more additional parameters are associated with the command phrase; obtaining the one or more additional parameters from a database translating the command phrase, the one or more parameters, and the one or more additional parameters into an XML command; transmitting the XML command to the registry; obtaining a response from the registry; and determining that the response corresponds to an anticipated response; wherein the one or mere parameters comprise a variable. 10. The non-transitory storage medium of claim 6 , wherein the registry comprises a top-level domain registry. | 0.571823 |
1. A command and control (C2) system comprising: a domain-independent architecture comprising an ontology model comprising: a resource aspect configured to receive entities specific to a domain; a responsibility aspect configured to receive actions specific to the domain and performed by the entities; a rule aspect configured to receive rules specific to the domain and associated with the actions; and a result aspect configured to receive effects specific to the domain and associated with the actions. | 1. A command and control (C2) system comprising: a domain-independent architecture comprising an ontology model comprising: a resource aspect configured to receive entities specific to a domain; a responsibility aspect configured to receive actions specific to the domain and performed by the entities; a rule aspect configured to receive rules specific to the domain and associated with the actions; and a result aspect configured to receive effects specific to the domain and associated with the actions. 10. The C2 system of claim 1 wherein the domain is from a group of domains consisting of a military domain, a disaster preparedness domain, a disaster response domain and a corporate business domain. | 0.812339 |
86. A tangible computer readable storage medium having stored thereon a program that when executed performs a method of searching electronic material stored in a computing environment, said method comprising: providing a plurality of documents; determining an undirected, weighted link between at least two of said plurality of documents, based on similarity; determining a directed, weighted link between at least two of said plurality of documents; adding said determined undirected, weighted links to said determined directed, weighted links to create a hybrid web having links; and performing a link analysis algorithm taking the links of said hybrid web as its input, said algorithm including at least one of forward link analysis and backward link analysis, wherein the output of said algorithm is a set of link analysis scores. | 86. A tangible computer readable storage medium having stored thereon a program that when executed performs a method of searching electronic material stored in a computing environment, said method comprising: providing a plurality of documents; determining an undirected, weighted link between at least two of said plurality of documents, based on similarity; determining a directed, weighted link between at least two of said plurality of documents; adding said determined undirected, weighted links to said determined directed, weighted links to create a hybrid web having links; and performing a link analysis algorithm taking the links of said hybrid web as its input, said algorithm including at least one of forward link analysis and backward link analysis, wherein the output of said algorithm is a set of link analysis scores. 90. The tangible computer readable storage medium of claim 86 , further comprising instructions for: scoring each of said at least two documents via at least one of text relevancy analysis and file quality analysis. | 0.668145 |
17. A processor readable non-transitory storage media that includes instructions for managing data, wherein execution of the instructions by one or more hardware processors performs actions, comprising: providing a principal data set and another data set, wherein the principal data set includes a plurality of principal objects and the other data set includes a plurality of other objects; instantiating a first engine to perform actions including: associating each of the plurality of principal objects with one or more other objects that are selected from the plurality of other objects, wherein the one or more other objects are selected as potential matches to one or more of the principal objects; selecting one or more principal objects of the plurality of principal objects based on one or more heuristics and the one or more selected principal objects association with selected other objects; and labeling one or more of the selected other objects as either a match or a non-match of their associated principal object; and instantiating a second engine to perform actions, including: training a ranker to identify a selected other object that is top-ranked in similarity to its association with the one or more principal objects based on the labeling of the one or more selected other objects; and employing the trained ranker to indicate a match among the plurality of principal objects and the plurality of other objects; and instantiating a third engine to selectively filter the plurality of other objects to rank each matched other object higher than other objects associated with a same principal object, wherein geolocation information from a GPS device is employed to localize a display of the ranked other objects including one or more of time zone or language, and wherein a hardware security module is used to provide tamper resistant safeguarding of cryptographic information. | 17. A processor readable non-transitory storage media that includes instructions for managing data, wherein execution of the instructions by one or more hardware processors performs actions, comprising: providing a principal data set and another data set, wherein the principal data set includes a plurality of principal objects and the other data set includes a plurality of other objects; instantiating a first engine to perform actions including: associating each of the plurality of principal objects with one or more other objects that are selected from the plurality of other objects, wherein the one or more other objects are selected as potential matches to one or more of the principal objects; selecting one or more principal objects of the plurality of principal objects based on one or more heuristics and the one or more selected principal objects association with selected other objects; and labeling one or more of the selected other objects as either a match or a non-match of their associated principal object; and instantiating a second engine to perform actions, including: training a ranker to identify a selected other object that is top-ranked in similarity to its association with the one or more principal objects based on the labeling of the one or more selected other objects; and employing the trained ranker to indicate a match among the plurality of principal objects and the plurality of other objects; and instantiating a third engine to selectively filter the plurality of other objects to rank each matched other object higher than other objects associated with a same principal object, wherein geolocation information from a GPS device is employed to localize a display of the ranked other objects including one or more of time zone or language, and wherein a hardware security module is used to provide tamper resistant safeguarding of cryptographic information. 22. The media of claim 17 , wherein providing the one or more principal objects further comprises, selecting the principal model objects at random from a portion of the plurality of principal model objects, wherein the portion of principal model objects are associated with two or more selected other objects and one or more of the two or more selected other objects have a similarity score that exceeds a threshold value. | 0.856025 |
9. A computer program product for providing contextual hints in an electronic message, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions when executed by a processor direct the processor to perform a method comprising: receiving a command to create a reply message to an original electronic message, the original electronic message comprising original text; determining one or more topics in the original text, the one or more topics summarizing one or more contexts in the original text; displaying the reply message with the one or more topics as contextual hints for the original text displayed as temporary text in a body of the reply message; receiving response text into the body of the reply message, corresponding to the one or more topics displayed as temporary text in the body of the reply message, from a user using the contextual hints while composing the reply message; receiving a command to send the reply message; removing the one or more topics displayed as temporary text from the body of the reply message; and sending the reply message with only the response text in the body of the reply message. | 9. A computer program product for providing contextual hints in an electronic message, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions when executed by a processor direct the processor to perform a method comprising: receiving a command to create a reply message to an original electronic message, the original electronic message comprising original text; determining one or more topics in the original text, the one or more topics summarizing one or more contexts in the original text; displaying the reply message with the one or more topics as contextual hints for the original text displayed as temporary text in a body of the reply message; receiving response text into the body of the reply message, corresponding to the one or more topics displayed as temporary text in the body of the reply message, from a user using the contextual hints while composing the reply message; receiving a command to send the reply message; removing the one or more topics displayed as temporary text from the body of the reply message; and sending the reply message with only the response text in the body of the reply message. 12. The computer program product of claim 9 , wherein the determining of the one or more topics in the original text comprises: receiving the one or more topics in metadata of the original electronic message. | 0.742588 |
9. The method of claim 1 wherein the step (a) comprises: (d) associating a neighborhood with a pixel of the sample image; and (e) constructing a quotient manifold of the neighborhood. | 9. The method of claim 1 wherein the step (a) comprises: (d) associating a neighborhood with a pixel of the sample image; and (e) constructing a quotient manifold of the neighborhood. 14. The method of claim 9 further comprising: (f) mapping the sample image to a set of quotient manifolds, wherein said set of quotient manifolds approximates the quotient appearance manifold mapping. | 0.825991 |
46. The method for structuring message content and transmitting the structured message content over a computer network in a real time chat environment, the method comprising: providing a system administration computing system having a system management program with a real time chat interface for enabling a plurality of users to communicate with one another in a plurality of different real time chat channels over the computer network; providing a channel manager configured to allow at least one of the plurality of users to manage the plurality of different real time chat channels, wherein the channel manager configured to allow the at least one plurality of end users to manage the plurality of different real time chat channels comprises the channel manager being configured to allow the at least one of the plurality of end users to: review the plurality of real time chat channels, create additional real time chat channels, and create a filtered channel, wherein the filtered channel comprises an aggregation of selected real time chat channels, the selected real time chat channels being selected by the end user according to at least one of the following: content associated with the plurality of real time chat channels, at least one user name associated with the plurality of real time chat channels, and previously stored criteria comprising at least one of the following: a specified content and at least one specified user name, wherein the previously stored criteria is used to monitor the plurality of real time chat channels and provide information associated with the stored criteria; providing the message content to the computer network, wherein the message content comprises text and other content entered by one of the plurality of users; structuring the message content within a message in a specific format based on fields associated with the message content; establishing the real time chat interface with the system administration computing system; and transmitting the structured message to the system management program. | 46. The method for structuring message content and transmitting the structured message content over a computer network in a real time chat environment, the method comprising: providing a system administration computing system having a system management program with a real time chat interface for enabling a plurality of users to communicate with one another in a plurality of different real time chat channels over the computer network; providing a channel manager configured to allow at least one of the plurality of users to manage the plurality of different real time chat channels, wherein the channel manager configured to allow the at least one plurality of end users to manage the plurality of different real time chat channels comprises the channel manager being configured to allow the at least one of the plurality of end users to: review the plurality of real time chat channels, create additional real time chat channels, and create a filtered channel, wherein the filtered channel comprises an aggregation of selected real time chat channels, the selected real time chat channels being selected by the end user according to at least one of the following: content associated with the plurality of real time chat channels, at least one user name associated with the plurality of real time chat channels, and previously stored criteria comprising at least one of the following: a specified content and at least one specified user name, wherein the previously stored criteria is used to monitor the plurality of real time chat channels and provide information associated with the stored criteria; providing the message content to the computer network, wherein the message content comprises text and other content entered by one of the plurality of users; structuring the message content within a message in a specific format based on fields associated with the message content; establishing the real time chat interface with the system administration computing system; and transmitting the structured message to the system management program. 47. The message content structuring and transmission method of claim 46 , further comprising generating a structured message content input panel having message content fields for acceptance of message content. | 0.541593 |
1. Programmed computer apparatus for extracting a list of candidate multi-word technical terms from an input text file, a multi-word technical term being a string of at least two words having a particular meaning in some technical field, said apparatus comprising: means for storing a stoplist of tokens which are assumed to not occur in multi-word technical terms, a token being a word, character or string of characters delimited by blanks and/or punctuation; means for storing a maximum length parameter specifying a maximum number of tokens in any candidate multi-word technical term to be extracted; means responsive to the stored stoplist for extracting text fragments from an input text file by identifying delimiting tokens in the input text file, including means for identifying as a delimiting token each token in the input text file which is the same as a token in the stored stoplist, the identified delimiting tokens defining text fragments therebetween; means for deriving from the extracted text fragments all possible subsequences of tokens having a length of at least two tokens and not more than a maximum number of tokens specified by the stored maximum length parameter; means for testing each of the derived subsequences against at least one filtering condition; and means for creating a sublist of the derived subsequences which pass the at least one filtering condition, the created sublist being the list of candidate multi-word technical terms. | 1. Programmed computer apparatus for extracting a list of candidate multi-word technical terms from an input text file, a multi-word technical term being a string of at least two words having a particular meaning in some technical field, said apparatus comprising: means for storing a stoplist of tokens which are assumed to not occur in multi-word technical terms, a token being a word, character or string of characters delimited by blanks and/or punctuation; means for storing a maximum length parameter specifying a maximum number of tokens in any candidate multi-word technical term to be extracted; means responsive to the stored stoplist for extracting text fragments from an input text file by identifying delimiting tokens in the input text file, including means for identifying as a delimiting token each token in the input text file which is the same as a token in the stored stoplist, the identified delimiting tokens defining text fragments therebetween; means for deriving from the extracted text fragments all possible subsequences of tokens having a length of at least two tokens and not more than a maximum number of tokens specified by the stored maximum length parameter; means for testing each of the derived subsequences against at least one filtering condition; and means for creating a sublist of the derived subsequences which pass the at least one filtering condition, the created sublist being the list of candidate multi-word technical terms. 8. Programmed computer apparatus as defined in claim 1 wherein a filtering condition against which each of the derived subsequences is tested by said testing means is a grammatical constraint. | 0.573913 |
18. A computer-readable storage medium encoded with executable computer program code for generating multiple implicit search queries, the program code comprising: program code for identifying a plurality of events responsive to monitoring real-time user interactions with a client device; program code for identifying a plurality of user-context attributes based at least in part on the plurality of events, wherein the plurality of user-context attributes indicate aspects of the real-time user interactions with the client device; program code for generating a plurality of implicit search queries comprising terms, wherein the terms are based at least in part on the plurality of user-context attributes; program code for receiving a plurality of search results generated responsive to the plurality of implicit search queries; and program code for updating a display of search results responsive to receiving the plurality of search results. | 18. A computer-readable storage medium encoded with executable computer program code for generating multiple implicit search queries, the program code comprising: program code for identifying a plurality of events responsive to monitoring real-time user interactions with a client device; program code for identifying a plurality of user-context attributes based at least in part on the plurality of events, wherein the plurality of user-context attributes indicate aspects of the real-time user interactions with the client device; program code for generating a plurality of implicit search queries comprising terms, wherein the terms are based at least in part on the plurality of user-context attributes; program code for receiving a plurality of search results generated responsive to the plurality of implicit search queries; and program code for updating a display of search results responsive to receiving the plurality of search results. 24. The computer-readable storage medium of claim 18 , wherein the program code for generating the plurality of implicit search queries comprising terms further comprises: program code for identifying for a user, a user profile comprised of a plurality of user attributes; program code for identifying a search term based at least in part on the plurality of user attributes; and program code for generating an implicit search query based at least in part on the search term. | 0.553383 |
17. The method of claim 15 in which said step for applying a recursive reduction procedure includes the step of applying a collapse ANDs reduction procedure wherein: a determination is made as to whether the rule R of said acquired grammar element and the subrules thereof are AND rules and that there are no repetitions of said AND subrules; and each subrule of said AND subrule is made to be said AND subrule. | 17. The method of claim 15 in which said step for applying a recursive reduction procedure includes the step of applying a collapse ANDs reduction procedure wherein: a determination is made as to whether the rule R of said acquired grammar element and the subrules thereof are AND rules and that there are no repetitions of said AND subrules; and each subrule of said AND subrule is made to be said AND subrule. 18. The method of claim 17 in which said collapse ANDs reduction procedure is carried out subsequent to the execution of a single and empty reduction procedure effecting the removal of element rules combined as subrules with said acquired grammar element rule, R. | 0.929547 |
20. A video system comprising: means for receiving a video presentation from a remote server; means for receiving a first selection from a viewer, the first selection corresponding to an option to receive a supplementary data stream corresponding to and synchronized for automatic presentation with the video presentation based on what portion of the video presentation is to be presented, the supplementary data stream comprising information related to on-screen comments; means for presenting the video presentation; means for receiving the supplementary data stream responsive to receiving a first choice associated with the first selection, the first choice corresponding to selecting to receive the supplementary data stream, wherein the supplementary data stream is received for presentation at a plurality of respective active times corresponding to respective portions of the video presentation, and a screen position relative to the video presentation, wherein the active time intervals are determined based on an internal clock and a timer located on the DHCT; means for receiving a second input from the viewer; and means for providing a video screen in response to the second input, wherein the video screen comprises a first reduced video area for the video presentation, a second reduced area for displaying information related to the video presentation, and a third reduced area for displaying control options for the video presentation, the control options comprising an option to stop the receipt of sequential data supplements. | 20. A video system comprising: means for receiving a video presentation from a remote server; means for receiving a first selection from a viewer, the first selection corresponding to an option to receive a supplementary data stream corresponding to and synchronized for automatic presentation with the video presentation based on what portion of the video presentation is to be presented, the supplementary data stream comprising information related to on-screen comments; means for presenting the video presentation; means for receiving the supplementary data stream responsive to receiving a first choice associated with the first selection, the first choice corresponding to selecting to receive the supplementary data stream, wherein the supplementary data stream is received for presentation at a plurality of respective active times corresponding to respective portions of the video presentation, and a screen position relative to the video presentation, wherein the active time intervals are determined based on an internal clock and a timer located on the DHCT; means for receiving a second input from the viewer; and means for providing a video screen in response to the second input, wherein the video screen comprises a first reduced video area for the video presentation, a second reduced area for displaying information related to the video presentation, and a third reduced area for displaying control options for the video presentation, the control options comprising an option to stop the receipt of sequential data supplements. 27. The video system of claim 20 , wherein: the video presentation comprises an audio stream and video stream; the audio stream, video stream, and supplementary data stream are encrypted; and the means for receiving the video presentation is further configured to receive the encrypted audio stream, video stream, and supplementary data stream over the same transmission frequency channel. | 0.581628 |
1. A method of recognizing an identifier entered by a user, the identifier including a first plurality of predetermined characters, the method comprising the steps of: a) providing a recognized identifier based on the entered identifier, the recognized identifier comprising a second plurality of predetermined characters; b) providing a plurality of reference identifiers, each one of the plurality of reference identifiers comprising a different plurality of predetermined characters; c) obtaining from a stored data structure, for each character position in at least one of the reference identifiers and each character position in the recognized identifier, a previously determined probability that a character in the at least one reference identifier is recognized as a character found in the corresponding character position in the recognized identifier, each probability in the stored data structure representing a quantification of a tendency of one predetermined character to be recognized as one of the predetermined character and another predetermined character, wherein the obtained probabilities are arranged as at least one confusion matrix, and wherein the step of obtaining includes the step of selecting among the at least one confusion matrix; d) determining an identifier recognition probability based on the obtained probabilities; e) repeating steps c) and d) for every reference identifier in the plurality of reference identifiers, each one of the plurality of reference identifiers being associated with a corresponding identifier recognition probability; and f) selecting the reference identifier most likely matching the entered identifier based on the plurality of obtained recognition probabilities. | 1. A method of recognizing an identifier entered by a user, the identifier including a first plurality of predetermined characters, the method comprising the steps of: a) providing a recognized identifier based on the entered identifier, the recognized identifier comprising a second plurality of predetermined characters; b) providing a plurality of reference identifiers, each one of the plurality of reference identifiers comprising a different plurality of predetermined characters; c) obtaining from a stored data structure, for each character position in at least one of the reference identifiers and each character position in the recognized identifier, a previously determined probability that a character in the at least one reference identifier is recognized as a character found in the corresponding character position in the recognized identifier, each probability in the stored data structure representing a quantification of a tendency of one predetermined character to be recognized as one of the predetermined character and another predetermined character, wherein the obtained probabilities are arranged as at least one confusion matrix, and wherein the step of obtaining includes the step of selecting among the at least one confusion matrix; d) determining an identifier recognition probability based on the obtained probabilities; e) repeating steps c) and d) for every reference identifier in the plurality of reference identifiers, each one of the plurality of reference identifiers being associated with a corresponding identifier recognition probability; and f) selecting the reference identifier most likely matching the entered identifier based on the plurality of obtained recognition probabilities. 18. The method of claim 1, wherein the obtained probabilities are obtained from a memory device. | 0.869584 |
1. An implant adapted to be implanted in a spine of a patient comprising: a shield with a shield cavity; a deflection rod that is mounted in said shield cavity; said deflection rod able to be deflected in said shield cavity and the motion of said deflection rod is limited by the shield cavity; a connector located at an end of said deflection rod; a rod connected to said connector; and a mount extending from said shield. | 1. An implant adapted to be implanted in a spine of a patient comprising: a shield with a shield cavity; a deflection rod that is mounted in said shield cavity; said deflection rod able to be deflected in said shield cavity and the motion of said deflection rod is limited by the shield cavity; a connector located at an end of said deflection rod; a rod connected to said connector; and a mount extending from said shield. 13. The implant of claim 1 including a second shield and a second shield cavity with a second deflection rod mounted in said second shield cavity; and wherein said second shield is connected to said mount. | 0.804608 |
15. A system for creating annotations from a plurality of documents, comprising: a processor; and a memory component that stores logic that, when executed by the processor, causes the system to perform at least the following: search a first electronic document to determine a first reference to a second electronic document, wherein the system previously identified a plurality of classifications of the first electronic document based on technical subject matter, wherein the plurality of classifications identify respective portions of the first electronic document; identify a portion of the first electronic document that includes the first reference to the second electronic document; determine from the plurality of classifications, a technical classification of the first reference to the second electronic document and an interpretive note, wherein the technical classification is determined via an indicator provided in the first electronic document; copy the portion of the first electronic document for inclusion as a first annotation to the second electronic document; compile the portion of the first electronic document into the first annotation to the second electronic document; search a third electronic document to determine a second reference to the second electronic document; identify a portion of the third electronic document that includes the second reference to the second electronic document; copy the portion of the third electronic document for inclusion as a second annotation to the second electronic document; compile the portion of the third electronic document into the second annotation to the second electronic document; and provide a user interface that includes at least a portion of the second electronic document, the first annotation, the second annotation, the technical classification, and a filtering option for filtering the first annotation and the second annotation, wherein the user interface further provides a user annotation option to view additional, less relevant annotations to the second electronic document. | 15. A system for creating annotations from a plurality of documents, comprising: a processor; and a memory component that stores logic that, when executed by the processor, causes the system to perform at least the following: search a first electronic document to determine a first reference to a second electronic document, wherein the system previously identified a plurality of classifications of the first electronic document based on technical subject matter, wherein the plurality of classifications identify respective portions of the first electronic document; identify a portion of the first electronic document that includes the first reference to the second electronic document; determine from the plurality of classifications, a technical classification of the first reference to the second electronic document and an interpretive note, wherein the technical classification is determined via an indicator provided in the first electronic document; copy the portion of the first electronic document for inclusion as a first annotation to the second electronic document; compile the portion of the first electronic document into the first annotation to the second electronic document; search a third electronic document to determine a second reference to the second electronic document; identify a portion of the third electronic document that includes the second reference to the second electronic document; copy the portion of the third electronic document for inclusion as a second annotation to the second electronic document; compile the portion of the third electronic document into the second annotation to the second electronic document; and provide a user interface that includes at least a portion of the second electronic document, the first annotation, the second annotation, the technical classification, and a filtering option for filtering the first annotation and the second annotation, wherein the user interface further provides a user annotation option to view additional, less relevant annotations to the second electronic document. 19. The system of claim 15 , wherein the logic further causes the system to remove the portion of the third electronic document from the annotation in response to determining that the portion of the third electronic document is duplicative with a portion of the first electronic document. | 0.617679 |
15. A process performed by a computer system including at least one audio input device, at least one computer storage medium, and at least one processor, wherein the at least one audio input device and the at least one computer storage medium are configured to receive and store live audio data in the at least one computer storage medium for processing, the process comprising: accessing data in the at least one computer storage medium defining computer operating context of the computer system; detecting starting conditions by processing the computer operating context from the computer storage medium; after detecting starting conditions, processing the live audio data to extract at least text and store the text in the at least one computer storage medium; processing the extracted text to generate information in the at least one computer storage medium identifying salient patterns in the extracted text; providing the extracted text and the information identifying salient patterns to a notetaking application running on the computer system, wherein the notetaking application is configured to receive user input to edit an electronic document in the at least one computer storage medium incorporating at least a portion of the extracted text and the information identifying salient patterns. | 15. A process performed by a computer system including at least one audio input device, at least one computer storage medium, and at least one processor, wherein the at least one audio input device and the at least one computer storage medium are configured to receive and store live audio data in the at least one computer storage medium for processing, the process comprising: accessing data in the at least one computer storage medium defining computer operating context of the computer system; detecting starting conditions by processing the computer operating context from the computer storage medium; after detecting starting conditions, processing the live audio data to extract at least text and store the text in the at least one computer storage medium; processing the extracted text to generate information in the at least one computer storage medium identifying salient patterns in the extracted text; providing the extracted text and the information identifying salient patterns to a notetaking application running on the computer system, wherein the notetaking application is configured to receive user input to edit an electronic document in the at least one computer storage medium incorporating at least a portion of the extracted text and the information identifying salient patterns. 20. The process of claim 15 , wherein to automatically process the extracted text to identify salient patterns, the computer system is configured to apply one or more filters to the extracted text, each of the one or more filters defining a pattern of text corresponding to an action. | 0.602285 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.