Datasets:

patent

/

AIPD_nlp_sentence_dataset

like 0

2. The method of claim 1 , wherein determining the training data comprises: determining inequalities between training faces, where the inequalities represent a similarity of a first set of two different training faces relative to a similarity of a second set of two different training faces; determining training features separated by objective differences in an objective feature space based on the training faces; optimizing, by at least one processor, a function over a matrix M that minimizes an amount of the objective differences and the inequalities; determining a mapping function between the object feature space and a psychological feature space based on the matrix M; and determining, based on the determined mapping function, similarity information that indicates human perception of facial similarity.

2. The method of claim 1 , wherein determining the training data comprises: determining inequalities between training faces, where the inequalities represent a similarity of a first set of two different training faces relative to a similarity of a second set of two different training faces; determining training features separated by objective differences in an objective feature space based on the training faces; optimizing, by at least one processor, a function over a matrix M that minimizes an amount of the objective differences and the inequalities; determining a mapping function between the object feature space and a psychological feature space based on the matrix M; and determining, based on the determined mapping function, similarity information that indicates human perception of facial similarity. 7. The method of claim 2 , wherein determining the similarity data based on the mapping function comprises: generating a query feature vector in the objective feature space based on the query face; accessing a set of search feature vectors in the objective feature space that are associated with a set of search faces; determining distances between the query feature vector and the search feature vectors; mapping the distances into the psychological feature space; selecting one or more search feature vectors that are within a selected distance of the query vector based on the mapped distances; and designating images including the search faces associated with the selected search feature vectors as the one or more search result images.

1. A method comprising: transcribing audio data comprising audio of one or more clinical personnel speaking while performing a surgical procedure, the audio data comprising audio of a first clinician speaking to one or more other clinical personnel while performing the surgical procedure; analyzing the transcribed audio data, including the transcribed audio of the first clinician speaking to the one or more other clinical personnel while performing the surgical procedure, at least in part by automatically extracting one or more clinical facts from the transcribed audio data using a fact extraction component implemented via at least one processor, to identify relevant information for documenting the surgical procedure, wherein analyzing the transcribed audio data comprises identifying within the transcribed audio data a present-tense narration by the first clinician stating to the other clinical personnel that the first clinician is currently performing a particular step of the surgical procedure; automatically generating a text report including the relevant information documenting the surgical procedure, wherein automatically generating the text report comprises automatically transforming the present-tense narration into a non-present-tense text portion in the report, stating that the particular step of the surgical procedure was performed; and outputting the automatically generated text report for review via a user interface on an audio and/or visual display device.

1. A method comprising: transcribing audio data comprising audio of one or more clinical personnel speaking while performing a surgical procedure, the audio data comprising audio of a first clinician speaking to one or more other clinical personnel while performing the surgical procedure; analyzing the transcribed audio data, including the transcribed audio of the first clinician speaking to the one or more other clinical personnel while performing the surgical procedure, at least in part by automatically extracting one or more clinical facts from the transcribed audio data using a fact extraction component implemented via at least one processor, to identify relevant information for documenting the surgical procedure, wherein analyzing the transcribed audio data comprises identifying within the transcribed audio data a present-tense narration by the first clinician stating to the other clinical personnel that the first clinician is currently performing a particular step of the surgical procedure; automatically generating a text report including the relevant information documenting the surgical procedure, wherein automatically generating the text report comprises automatically transforming the present-tense narration into a non-present-tense text portion in the report, stating that the particular step of the surgical procedure was performed; and outputting the automatically generated text report for review via a user interface on an audio and/or visual display device. 5. The method of claim 1 , wherein the surgical procedure is performed on a patient, and wherein the audio data comprises audio of the one or more clinical personnel orally identifying one or more observations of a condition of the patient during the surgical procedure.

13. A non-transitory computer-readable medium comprising instructions for execution by a computer, the instructions including a computer-implemented method for providing a mashup, the instructions for implementing: providing a mashup that performs an action on a resource included in the mashup; identifying an attribute of a user running the mashup to perform the action on the resource; and providing an access control, the mashup being associated to a permission artifact, the permission artifact specifying a principal and whether one of to permit and to prohibit the principal to take the action on the resource, wherein the access control is triggered only when the mashup attempts to perform the action on the resource, the access control (i) checks whether the attribute of the user running the mashup to perform the action is predefined as belonging to the principal specified in the permission artifact associated to the mashup, and then (ii) performs the one of to permit and to prohibit the action on the resource only when the attribute belongs to the principal, plural users that have a same single attribute belong to the principal when the same single attribute is defined as belonging to the principal, and the permission artifact further specifies: (i) the resource used by the mashup, and (ii) the action on the resource for which permission is needed.

13. A non-transitory computer-readable medium comprising instructions for execution by a computer, the instructions including a computer-implemented method for providing a mashup, the instructions for implementing: providing a mashup that performs an action on a resource included in the mashup; identifying an attribute of a user running the mashup to perform the action on the resource; and providing an access control, the mashup being associated to a permission artifact, the permission artifact specifying a principal and whether one of to permit and to prohibit the principal to take the action on the resource, wherein the access control is triggered only when the mashup attempts to perform the action on the resource, the access control (i) checks whether the attribute of the user running the mashup to perform the action is predefined as belonging to the principal specified in the permission artifact associated to the mashup, and then (ii) performs the one of to permit and to prohibit the action on the resource only when the attribute belongs to the principal, plural users that have a same single attribute belong to the principal when the same single attribute is defined as belonging to the principal, and the permission artifact further specifies: (i) the resource used by the mashup, and (ii) the action on the resource for which permission is needed. 14. The computer-readable medium of claim 13 , further comprising: changing whether the single attribute belongs to the principal, thereby changing whether one of to permit and to prohibit the action on the resource for all of the plural users that have the same single attribute.

5. The computerized method of claim 1 , wherein the querying includes requesting an inventory list from the first device.

5. The computerized method of claim 1 , wherein the querying includes requesting an inventory list from the first device. 6. The computerized method of claim 5 , further comprising searching the inventory list for a document of interest based on metadata associated with the first user document.

32. The method of tying a geospatial location to a PIDF-LO file according to claim 18 , further comprising: tagging descriptive information relating to said location aware XML content in a <presence . . . > section of said PIDF-LO file.

32. The method of tying a geospatial location to a PIDF-LO file according to claim 18 , further comprising: tagging descriptive information relating to said location aware XML content in a <presence . . . > section of said PIDF-LO file. 35. The method of tying a geospatial location to a PIDF-LO file according to claim 32 , wherein: said tagged descriptive information includes at least one of: “Time Reference”, “Weather Reference”, and “Descriptive Reference” tags.

8. A method for generating an execution plan for a query in a relational database system, comprising: generating one or more initial logical representations of the query, each initial logical representation including a plurality of operators; performing a bounded exploration process comprising: (a) adding the operators of the one or more initial logical representations to a data structure; (b) identifying zero or more patterns of operators within the data structure that are eligible for the application of a transformation rule, a pattern of operators being eligible for the application of a transformation rule if (i) the pattern of operators matches a pattern associated with the transformation rule and (ii) a search distance associated with one or more of the operators in the pattern of operators, and that is a numerical value, is less than a maximum allowable search distance that is a numerical value corresponding to an upper bound of the search distance associated with the one or more of the operators in the pattern of operators to enable bounding of the exploration process; (c) applying a transformation rule to each eligible pattern of operators identified in step (b) to generate a logically-equivalent pattern of operators within the data structure, thereby generating one or more additional logical representations of the query within the data structure; (d) assigning a search distance to each operator within each logically-equivalent pattern of operators generated during step (c), the assigned search distance being a function of a search distance of one or more operators within the eligible pattern of operators to which the logically-equivalent pattern of operators corresponds; and (e) repeatedly performing steps (b), (c) and (d) until no further patterns of operators that are eligible for the application of a transformation rule can be identified within the data structure; obtaining one or more physical implementation alternatives for each of the logical representations of the query included in the data structure; and selecting one of the physical implementation alternatives as the execution plan.

8. A method for generating an execution plan for a query in a relational database system, comprising: generating one or more initial logical representations of the query, each initial logical representation including a plurality of operators; performing a bounded exploration process comprising: (a) adding the operators of the one or more initial logical representations to a data structure; (b) identifying zero or more patterns of operators within the data structure that are eligible for the application of a transformation rule, a pattern of operators being eligible for the application of a transformation rule if (i) the pattern of operators matches a pattern associated with the transformation rule and (ii) a search distance associated with one or more of the operators in the pattern of operators, and that is a numerical value, is less than a maximum allowable search distance that is a numerical value corresponding to an upper bound of the search distance associated with the one or more of the operators in the pattern of operators to enable bounding of the exploration process; (c) applying a transformation rule to each eligible pattern of operators identified in step (b) to generate a logically-equivalent pattern of operators within the data structure, thereby generating one or more additional logical representations of the query within the data structure; (d) assigning a search distance to each operator within each logically-equivalent pattern of operators generated during step (c), the assigned search distance being a function of a search distance of one or more operators within the eligible pattern of operators to which the logically-equivalent pattern of operators corresponds; and (e) repeatedly performing steps (b), (c) and (d) until no further patterns of operators that are eligible for the application of a transformation rule can be identified within the data structure; obtaining one or more physical implementation alternatives for each of the logical representations of the query included in the data structure; and selecting one of the physical implementation alternatives as the execution plan. 17. The method of claim 8 , further comprising: in response to determining that a cost associated with the physical implementation alternative that was selected as the execution plan is not acceptable: increasing the maximum allowable search distance; and performing step (e) to generate one or more further logical representations of the query within the data structure.

1. In an Information Handling System (IHS), a method comprising: retrieving an encrypted file from a cloud storage provider (CSP); decrypting the encrypted file using a key identification stored in a file header; tokenizing the decrypted file; transmitting the tokenized file to a cloud editing provider (CEP); receiving a modified, tokenized file from the CEP; de-tokenizing the modified file; enabling rendering of the de-tokenized, modified file.

1. In an Information Handling System (IHS), a method comprising: retrieving an encrypted file from a cloud storage provider (CSP); decrypting the encrypted file using a key identification stored in a file header; tokenizing the decrypted file; transmitting the tokenized file to a cloud editing provider (CEP); receiving a modified, tokenized file from the CEP; de-tokenizing the modified file; enabling rendering of the de-tokenized, modified file. 2. The method of claim 1 , wherein the file includes an electronic document.

11. A computer readable storage medium storing a program to be executed by a computer, comprising: extraction means for causing the computer to extract information related to surfaces from the plan views; first generation means for causing the computer to generate candidate surfaces based on the information extracted by said extraction means; second generation means for causing the computer to generate candidate surfaces and candidate edge lines by obtaining intersecting lines among the candidate surfaces generated by said first generation means after the computer is caused to generate the candidate surfaces by said first generation means; third generation means for causing the computer to generate candidate solids by determining combinations of the candidate surfaces generated by said second generation means after the computer is caused to generate the candidate surfaces by said second generation means; and selection means for causing the computer to collate the candidate solids generated by said third generation means with the plan views and to select a matching candidate solid as a solid model after the computer is caused to generate the candidate solids by said third generation means.

11. A computer readable storage medium storing a program to be executed by a computer, comprising: extraction means for causing the computer to extract information related to surfaces from the plan views; first generation means for causing the computer to generate candidate surfaces based on the information extracted by said extraction means; second generation means for causing the computer to generate candidate surfaces and candidate edge lines by obtaining intersecting lines among the candidate surfaces generated by said first generation means after the computer is caused to generate the candidate surfaces by said first generation means; third generation means for causing the computer to generate candidate solids by determining combinations of the candidate surfaces generated by said second generation means after the computer is caused to generate the candidate surfaces by said second generation means; and selection means for causing the computer to collate the candidate solids generated by said third generation means with the plan views and to select a matching candidate solid as a solid model after the computer is caused to generate the candidate solids by said third generation means. 12. The computer readable storage medium as claimed in claim 11, which further comprises: deletion means for causing the computer to delete, out of the candidate surfaces and the candidate edge lines generated by said second generation means, at least one of a candidate surface and a candidate edge line which cannot possibly exist in a solid.

10. A method comprising: receiving an input; associating a cmdlet with the input, the cmdlet identifying at least one expected input parameter; for each expected input parameter that specifies obtaining data from the input, populating the expected input parameter with data from the input; and for each expected input parameter that specifies obtaining information from an input stream to the cmdlet, populating the expected input parameter based on the information, executing the cmdlet to generate an object stream based on the information and the data, and emitting the object stream, wherein the input stream comprises the object stream emitted by another cmdlet and wherein the object stream does not comprise a live object.

10. A method comprising: receiving an input; associating a cmdlet with the input, the cmdlet identifying at least one expected input parameter; for each expected input parameter that specifies obtaining data from the input, populating the expected input parameter with data from the input; and for each expected input parameter that specifies obtaining information from an input stream to the cmdlet, populating the expected input parameter based on the information, executing the cmdlet to generate an object stream based on the information and the data, and emitting the object stream, wherein the input stream comprises the object stream emitted by another cmdlet and wherein the object stream does not comprise a live object. 13. The method of claim 10 , wherein the cmdlet operates in a local process and the other cmdlet operates in a remote process.

16. A non-transitory computer-readable storage medium storing instructions that, when executed by a processor, cause the processor to: obtain an input image that includes at least one image defect; process the input image using a first processing technique to produce a first output image, the first output image including a plurality of bounding boxes, each bounding box at least partially enclosing a connected component; separately process the first output image using a second process to generate a binary chip of each bounding box to produce a second output image; recognize text in the first output image and in the binary chip of each bounding box; and compare the recognized text from the plurality of bounding boxes of the first output image to corresponding binary chips of the second output image to produce a consensus output for text in the input image.

16. A non-transitory computer-readable storage medium storing instructions that, when executed by a processor, cause the processor to: obtain an input image that includes at least one image defect; process the input image using a first processing technique to produce a first output image, the first output image including a plurality of bounding boxes, each bounding box at least partially enclosing a connected component; separately process the first output image using a second process to generate a binary chip of each bounding box to produce a second output image; recognize text in the first output image and in the binary chip of each bounding box; and compare the recognized text from the plurality of bounding boxes of the first output image to corresponding binary chips of the second output image to produce a consensus output for text in the input image. 19. The non-transitory computer-readable storage medium of claim 16 , wherein analyzing the recognized text from the first output image and the second output image comprises taking a logical OR of the first output image and second output image.

1. An apparatus comprising: a processor; and a memory storing instructions that, when executed by the processor, cause the apparatus at least to perform operations comprising: processing input specifying a plurality of athletic activities; processing input specifying a heart rate threshold for a particular one of the activities; generating an electronic training script including the heart rate threshold for the particular activity and defining a sequence in which to perform the plurality of activities; measuring a physiological characteristic of a user during the plurality of athletic activities; and prompting the user to perform a next activity in the sequence based on a measurement of the physiological characteristic indicating completion of a previous activity in the sequence.

1. An apparatus comprising: a processor; and a memory storing instructions that, when executed by the processor, cause the apparatus at least to perform operations comprising: processing input specifying a plurality of athletic activities; processing input specifying a heart rate threshold for a particular one of the activities; generating an electronic training script including the heart rate threshold for the particular activity and defining a sequence in which to perform the plurality of activities; measuring a physiological characteristic of a user during the plurality of athletic activities; and prompting the user to perform a next activity in the sequence based on a measurement of the physiological characteristic indicating completion of a previous activity in the sequence. 10. The apparatus recited in claim 1 , wherein the training script includes a plurality of steps, and wherein each of the steps has a defined performance data, and wherein the plurality of steps each automatically start a subsequent step when the defined performance data of the previous step has been measured.

13. A method of managing report web services, the method comprising the steps of: receiving from a client application a request for a web service definition for a report as a web service; converting definitions of one or more objects in a report definition in a report store that corresponds to the requested report into web service definitions; generating an object model based on the web service definitions to reflect a structure of the objects of the report; generating a Web Services Description Language (WSDL) definition for the web service based on the object model; and transporting the WSDL definition to the client application.

13. A method of managing report web services, the method comprising the steps of: receiving from a client application a request for a web service definition for a report as a web service; converting definitions of one or more objects in a report definition in a report store that corresponds to the requested report into web service definitions; generating an object model based on the web service definitions to reflect a structure of the objects of the report; generating a Web Services Description Language (WSDL) definition for the web service based on the object model; and transporting the WSDL definition to the client application. 17. The method as recited in claim 13 , wherein the converting step comprises the steps of: selecting a provider that corresponds to an associated report authoring tool by which a report is authored, and obtaining definitions of objects in the report through the selected provider; converting the definitions of objects in the report in to web service definitions using the selected provider; and generating an object model based on the web service definitions of the objects.

11. The system of claim 10 , wherein the user interface is configured for receiving a selection of at least one of the print option, the send option, and the save option from the user.

11. The system of claim 10 , wherein the user interface is configured for receiving a selection of at least one of the print option, the send option, and the save option from the user. 14. The system of claim 11 , wherein the multi-function device is further configured for sending the referred content information to at least one computing device via a network when the user selects the send option.

15. The computer-implemented method of claim 10 wherein the one or more preference elements specify one or more user preferences.

15. The computer-implemented method of claim 10 wherein the one or more preference elements specify one or more user preferences. 16. The computer-implemented method of claim 15 wherein the user preferences indicate values a user may provide for use by the content to generate user-specific data.

9. A method of providing audio to guests at an entertainment activity, comprising: making available multiple language files corresponding to an audio file played during an entertainment activity; queuing the language file chosen by each guest; synchronizing the delivery of the language file to the guest with the entertainment activity, wherein synchronizing the delivery occurs via a processor being configured to access the multiple language files; and communicating the language file to a cellular phone operated by the guest for review by the guest in real time coordination with the entertainment activity, by communicating with a private exchange, the private exchange being in communication with a cellular provider and a cellular phone operated by the guest.

9. A method of providing audio to guests at an entertainment activity, comprising: making available multiple language files corresponding to an audio file played during an entertainment activity; queuing the language file chosen by each guest; synchronizing the delivery of the language file to the guest with the entertainment activity, wherein synchronizing the delivery occurs via a processor being configured to access the multiple language files; and communicating the language file to a cellular phone operated by the guest for review by the guest in real time coordination with the entertainment activity, by communicating with a private exchange, the private exchange being in communication with a cellular provider and a cellular phone operated by the guest. 15. The method of claim 9 , wherein synchronizing delivery comprises inputting a command to a cellular phone or to a PDA to start the delivery of the language file.

9. A pre-computation based ternary content addressable memory (TCAM), comprising: a counter configured to generate a count of a number of ones or zeros in a search word; a primary TCAM configured to store a data word; and a secondary TCAM configured to store a pre-computation word representing a range inclusive of a lower and upper bound of a number of ones or zeros possible in a portion of the data word, wherein the secondary TCAM is configured to disable pre-charging of a match line associated with the data word if the count of the number of ones or zeroes in a portion of the search word does not fall within the range represented by the pre-computation word.

9. A pre-computation based ternary content addressable memory (TCAM), comprising: a counter configured to generate a count of a number of ones or zeros in a search word; a primary TCAM configured to store a data word; and a secondary TCAM configured to store a pre-computation word representing a range inclusive of a lower and upper bound of a number of ones or zeros possible in a portion of the data word, wherein the secondary TCAM is configured to disable pre-charging of a match line associated with the data word if the count of the number of ones or zeroes in a portion of the search word does not fall within the range represented by the pre-computation word. 10. The pre-computation based TCAM of claim 9 , wherein the range represented by the pre-computation word is not equal to a range defined by the lower and upper bound of the number of ones or zeros possible in the portion of the data word.

7. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising: receiving a first update to a data object; updating the data object in a first database based on the first update; receiving a second update to the data object; responsive to receiving the second update, detecting a concurrency conflict between a first value for a first property of the data object in the first database and a second value for the first property in the second update; updating the data object in the first database based on the second update only after the concurrency conflict is deconflicted; wherein the second update comprises one or more values for one or more other properties of the data object; and wherein the operation of updating the data object in the first database based on the second update only after the concurrency conflict is deconflicted comprises the operation of updating the data object in the first database based on the one or more values for the one or more other properties of the data object only after the concurrency conflict is deconflicted.

7. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising: receiving a first update to a data object; updating the data object in a first database based on the first update; receiving a second update to the data object; responsive to receiving the second update, detecting a concurrency conflict between a first value for a first property of the data object in the first database and a second value for the first property in the second update; updating the data object in the first database based on the second update only after the concurrency conflict is deconflicted; wherein the second update comprises one or more values for one or more other properties of the data object; and wherein the operation of updating the data object in the first database based on the second update only after the concurrency conflict is deconflicted comprises the operation of updating the data object in the first database based on the one or more values for the one or more other properties of the data object only after the concurrency conflict is deconflicted. 9. The one or more non-transitory computer-readable media of claim 7 , wherein the operations further comprise the operation of automatically deconflicting the concurrency conflict.

1. A method of supporting text entry on a personal computing device by allowing a user to automatically search for and select completion candidates displayed in a search list based on a partial text entry, the method comprising: (a) receiving a user input signal; (b) if the user input signal corresponds to declining all completion candidates displayed in the search list, terminating automated searching with the search list and displaying a digital keyboard while not displaying the search list with no consequence to the text entered into the personal computing device, and waiting for further user input from the digital keyboard; (c) if the user input signal corresponds to accepting a completion candidate from the search list to replace the partial text entry and to terminate automated searching, terminating the automated searching with the search list, modifying the partial text entry to become the accepted completion candidate, displaying the digital keyboard while not displaying the search list, and waiting for further user input from the digital keyboard; and (d) if the user input signal corresponds to selecting a completion candidate from the search list to initiate further searching, obtaining a new list of completion candidates based on the selected completion candidate and displaying the new list of completion candidates in the search list for further selection while not displaying the digital keyboard, and waiting for further user input from the search list.

1. A method of supporting text entry on a personal computing device by allowing a user to automatically search for and select completion candidates displayed in a search list based on a partial text entry, the method comprising: (a) receiving a user input signal; (b) if the user input signal corresponds to declining all completion candidates displayed in the search list, terminating automated searching with the search list and displaying a digital keyboard while not displaying the search list with no consequence to the text entered into the personal computing device, and waiting for further user input from the digital keyboard; (c) if the user input signal corresponds to accepting a completion candidate from the search list to replace the partial text entry and to terminate automated searching, terminating the automated searching with the search list, modifying the partial text entry to become the accepted completion candidate, displaying the digital keyboard while not displaying the search list, and waiting for further user input from the digital keyboard; and (d) if the user input signal corresponds to selecting a completion candidate from the search list to initiate further searching, obtaining a new list of completion candidates based on the selected completion candidate and displaying the new list of completion candidates in the search list for further selection while not displaying the digital keyboard, and waiting for further user input from the search list. 2. The method of claim 1 wherein a portion of each completion candidate listed in the new list of completion candidates, matches the selected completion candidate.

23. A system including memory and one or more processors operable to execute instructions, stored in the memory, to select suggested query completions for a partial query, including instructions to: determine a prefix and a suffix of a partial query having multiple terms, the prefix including one or more terms occurring at a beginning of the partial query, the suffix including one or more terms occurring at an end of the partial query, wherein a last term in the prefix precedes a first term in the suffix; calculate suffix similarity scores for unique queries having prefixes which do not include the prefix of the partial query as a substring, the suffix similarity score for a unique query based at least in part on similarity of terms in the suffix of the partial query and terms in a suffix of the unique query; select one or more of the unique queries as candidate queries for completing the partial query based at least in part on the suffix similarity scores for the unique queries; calculate completion scores for unique suffixes among the suffixes of the candidate queries, the completion scores representing an extent to which the unique suffixes are potential query completions for the partial query; and use the completion scores to select one or more terms of the unique suffixes as suggested query completions for the partial query.

23. A system including memory and one or more processors operable to execute instructions, stored in the memory, to select suggested query completions for a partial query, including instructions to: determine a prefix and a suffix of a partial query having multiple terms, the prefix including one or more terms occurring at a beginning of the partial query, the suffix including one or more terms occurring at an end of the partial query, wherein a last term in the prefix precedes a first term in the suffix; calculate suffix similarity scores for unique queries having prefixes which do not include the prefix of the partial query as a substring, the suffix similarity score for a unique query based at least in part on similarity of terms in the suffix of the partial query and terms in a suffix of the unique query; select one or more of the unique queries as candidate queries for completing the partial query based at least in part on the suffix similarity scores for the unique queries; calculate completion scores for unique suffixes among the suffixes of the candidate queries, the completion scores representing an extent to which the unique suffixes are potential query completions for the partial query; and use the completion scores to select one or more terms of the unique suffixes as suggested query completions for the partial query. 28. The system of claim 23 , wherein the instructions to select one more of the unique queries as candidate queries includes instructions to: identify a first set of candidate queries having suffixes including at least three terms in common with the suffix of the partial query; identify a second set of candidate queries having suffixes including at least two terms in common with the suffix of the partial query; and select the first set of candidate queries as the candidate queries for completing the partial query if the first set is not empty, and select the second set of candidate queries as the candidate queries for completing the partial query if the second set is empty.

9. A knowledge research and mapping system, comprising: at least one computer processor coupled to at least one non-transitory storage medium; a research knowledge map stored in the at least one non-transitory storage medium and generated by the at least one processor using an entity-relationship model comprising entity-relationship-entity triplets, such that topics determined from the one or more queries are represented as entities and relationships between entities are determined based on an informational taxonomy; a query input module that: receives a query related to a domain of research; stores the query in the research knowledge map; and submits the query to one or more knowledge bases; a results presenter that filters one or more responses to the query into response relationship subsets; and a research event recorder that links one or more responses from the response relationship subsets to the stored query in the research knowledge map, wherein the knowledge map provides interrelated information for one or more queries within the domain of research.

9. A knowledge research and mapping system, comprising: at least one computer processor coupled to at least one non-transitory storage medium; a research knowledge map stored in the at least one non-transitory storage medium and generated by the at least one processor using an entity-relationship model comprising entity-relationship-entity triplets, such that topics determined from the one or more queries are represented as entities and relationships between entities are determined based on an informational taxonomy; a query input module that: receives a query related to a domain of research; stores the query in the research knowledge map; and submits the query to one or more knowledge bases; a results presenter that filters one or more responses to the query into response relationship subsets; and a research event recorder that links one or more responses from the response relationship subsets to the stored query in the research knowledge map, wherein the knowledge map provides interrelated information for one or more queries within the domain of research. 16. The system of claim 9 , wherein the research event recorder records user interactions during a research session related to the query and stores machine representations of the user interactions in the research knowledge map.

21. The computing device of claim 18 , further comprising a commentary browser to output a link to at least one of the first context or second context defined by at least one of the first context definition or second context definition for the at least one of the first or second annotations.

21. The computing device of claim 18 , further comprising a commentary browser to output a link to at least one of the first context or second context defined by at least one of the first context definition or second context definition for the at least one of the first or second annotations. 22. The computing device of claim 21 , wherein the planning applications is configured to instruct the user interface the generate the sheet defined by the at least one of the first context or second context associated with the link when the link is selected.

1. A knowledge base system comprising: memory which stores a knowledge base and a knowledge base management system which includes instructions for at least one of adding relations to the knowledge base and querying the knowledge base, the knowledge base comprising: a relations table and a plurality of linked tables, a first of the linked tables comprising a predicate table, the relations table including slots which, for each of a plurality of rows of the relations table, respectively store a relation identifier, a predicate identifier, and first and second arguments of a respective relation; wherein each predicate identifier in the respective predicate identifier slot is composed of: a first part which encodes a key for a respective entry in the predicate table, a second part which encodes a first argument type for the first of the arguments stored in the respective row of the relations table, and a third part which encodes a second argument type for the second of the arguments stored in the respective row of the relations table; wherein the first and second argument types are selected from a predefined set of argument types, one of the argument types in the set being associated with a second of the linked tables, another of the argument types in the set being associated with a third of the linked tables or with the predicate table, one of the first and second arguments in a row of the relations table serving as a key to an entry in the second linked table when the respective part of the predicate identifier for that row encodes the associated argument type for the second linked table and serving as a key to an entry in the third linked table or the predicate table when the respective part of the predicate identifier for that row encodes the associated argument type for the third linked table or the predicate table; and a processor which executes the instructions.

1. A knowledge base system comprising: memory which stores a knowledge base and a knowledge base management system which includes instructions for at least one of adding relations to the knowledge base and querying the knowledge base, the knowledge base comprising: a relations table and a plurality of linked tables, a first of the linked tables comprising a predicate table, the relations table including slots which, for each of a plurality of rows of the relations table, respectively store a relation identifier, a predicate identifier, and first and second arguments of a respective relation; wherein each predicate identifier in the respective predicate identifier slot is composed of: a first part which encodes a key for a respective entry in the predicate table, a second part which encodes a first argument type for the first of the arguments stored in the respective row of the relations table, and a third part which encodes a second argument type for the second of the arguments stored in the respective row of the relations table; wherein the first and second argument types are selected from a predefined set of argument types, one of the argument types in the set being associated with a second of the linked tables, another of the argument types in the set being associated with a third of the linked tables or with the predicate table, one of the first and second arguments in a row of the relations table serving as a key to an entry in the second linked table when the respective part of the predicate identifier for that row encodes the associated argument type for the second linked table and serving as a key to an entry in the third linked table or the predicate table when the respective part of the predicate identifier for that row encodes the associated argument type for the third linked table or the predicate table; and a processor which executes the instructions. 16. The system of claim 1 , wherein the knowledge base management system includes instructions for querying the knowledge base, and the instructions are configured for: receiving a query comprising at least one of: a first argument corresponding to one of the entries in one of the linked tables, a second argument corresponding to one of the entries in one of the linked tables or to a value in one of the records, and a predicate corresponding to one of the predicates in the predicate table; where the query includes the predicate, retrieving the predicate identifier of the predicate, identifying the encoded argument types of the predicate, and using at least one of the identified argument types to access a respective one of the linked tables with an argument identifier stored in one of the records in the records table that is responsive to the query.

1. A method performed with a computing system for obtaining information from a set of related electronic documents, the method comprising: accessing the set of related electronic documents that are each hosted on one or more respective web servers that are accessible through a network, the accessing including retrieving data associated with the set of related electronic documents through the network; analyzing markup language of an electronic document of the set of related electronic documents to identify markup language tags of the electronic document; analyzing, using a page recognition module, the markup language tags to identify the electronic document as a product page, the page recognition model generated based on a first machine learning algorithm, and the product page comprising a plurality of terms; filtering the plurality of terms into a first set of terms and a second set of terms, the first set of terms and the second set of terms including different terms of the plurality of terms, each term in the first set of terms identified as potentially being associated with a product name, and each term in the second set of terms identified as not being associated with a product name; for each term of the first set of terms, identifying a noun phrase that includes the term and determining one or more features of each of the noun phrase and the term; for each feature of the one or more features: determining, for each term of the first of terms, a first feature value of the noun phrase and a second feature value of the term, and determining, for each term of the first set of terms, an overall feature value for the term based on the first feature value and the second feature value; identifying each term in the first set of terms as being associated with a product name or not being associated with a product name with a name recognition model, the name recognition model generated based on the overall feature value for each feature of the term; and providing for display on a graphical user interface, one or more of the first set of terms that are identified as being associated with a product name.

1. A method performed with a computing system for obtaining information from a set of related electronic documents, the method comprising: accessing the set of related electronic documents that are each hosted on one or more respective web servers that are accessible through a network, the accessing including retrieving data associated with the set of related electronic documents through the network; analyzing markup language of an electronic document of the set of related electronic documents to identify markup language tags of the electronic document; analyzing, using a page recognition module, the markup language tags to identify the electronic document as a product page, the page recognition model generated based on a first machine learning algorithm, and the product page comprising a plurality of terms; filtering the plurality of terms into a first set of terms and a second set of terms, the first set of terms and the second set of terms including different terms of the plurality of terms, each term in the first set of terms identified as potentially being associated with a product name, and each term in the second set of terms identified as not being associated with a product name; for each term of the first set of terms, identifying a noun phrase that includes the term and determining one or more features of each of the noun phrase and the term; for each feature of the one or more features: determining, for each term of the first of terms, a first feature value of the noun phrase and a second feature value of the term, and determining, for each term of the first set of terms, an overall feature value for the term based on the first feature value and the second feature value; identifying each term in the first set of terms as being associated with a product name or not being associated with a product name with a name recognition model, the name recognition model generated based on the overall feature value for each feature of the term; and providing for display on a graphical user interface, one or more of the first set of terms that are identified as being associated with a product name. 2. The method of claim 1 , wherein identifying a product page comprises generating the page recognition model by: accessing an electronic document; determining features associated with the electronic document; receiving input specifying a label for the electronic document; and generating the page recognition model using the labeled electronic document and the features as a training set.

15. Computer readable media comprising program code that when executed by a programmable processor causes the processor to execution a method for identification of term or phrase pairs that are associative matches, the computer readable media comprising: program code stored on physical computer readable media for selecting one or more candidate term pairs for the construction of an associative model; program code stored on physical computer readable media for labeling the one or more candidate term pairs by matching the one or more candidate terms on the basis of associative criteria, the associative criteria comprising a complementary product relationship, a task relationship, a cultural relationship and temporal relationships; program code stored on physical computer readable media for determining one or more features for the one or more candidate term pairs; program code stored on physical computer readable media for building a model on the basis of the one or more features; and program code stored on physical computer readable media for applying the model to an unlabeled candidate term pair to determine if the pair is an associative match.

15. Computer readable media comprising program code that when executed by a programmable processor causes the processor to execution a method for identification of term or phrase pairs that are associative matches, the computer readable media comprising: program code stored on physical computer readable media for selecting one or more candidate term pairs for the construction of an associative model; program code stored on physical computer readable media for labeling the one or more candidate term pairs by matching the one or more candidate terms on the basis of associative criteria, the associative criteria comprising a complementary product relationship, a task relationship, a cultural relationship and temporal relationships; program code stored on physical computer readable media for determining one or more features for the one or more candidate term pairs; program code stored on physical computer readable media for building a model on the basis of the one or more features; and program code stored on physical computer readable media for applying the model to an unlabeled candidate term pair to determine if the pair is an associative match. 19. The computer readable media of claim 15 wherein program code for determining a given feature comprises program code for determining co-bidedness, brand relationship and statistical features.

1. A method comprising: permitting a computer user to access one or more servers via a network; transferring a copy of software to a computer associated with the computer user, the software being configured to run on the computer to display advertising content and record computer usage information associated with utilization of the computer, wherein the computer usage information includes data regarding one or more programs run on the computer; determining a unique identifier associated with the computer, wherein the identifier uniquely identifies information sent from the computer to the one or more servers; determining that one or more keywords of a plurality of keywords are associated with a displayed webpage with the plurality of keywords being stored in a memory associated with the one or more servers; selecting an advertisement to be displayed on the computer, the selection based at least on the one or more keywords together with information associated with the unique identifier identifying the computer; receiving a request for an advertisement from the computer accessing the web page; and providing the selected advertisement for display on the computer in response to the received request.

1. A method comprising: permitting a computer user to access one or more servers via a network; transferring a copy of software to a computer associated with the computer user, the software being configured to run on the computer to display advertising content and record computer usage information associated with utilization of the computer, wherein the computer usage information includes data regarding one or more programs run on the computer; determining a unique identifier associated with the computer, wherein the identifier uniquely identifies information sent from the computer to the one or more servers; determining that one or more keywords of a plurality of keywords are associated with a displayed webpage with the plurality of keywords being stored in a memory associated with the one or more servers; selecting an advertisement to be displayed on the computer, the selection based at least on the one or more keywords together with information associated with the unique identifier identifying the computer; receiving a request for an advertisement from the computer accessing the web page; and providing the selected advertisement for display on the computer in response to the received request. 14. The method of claim 1 wherein the user is permitted to anonymous download access to the software and the one or more servers is provided demographically-relatable computer usage information.

18. The apparatus of claim 14 , wherein said trained PLSA model is parameterized by P(z|w) and the term addition logic comprises initialization logic configured to initialize a P(Z|W new ) parameter for each of said at least one new term, wherein the P(z|w new ) parameter is the probability of the latent class z given the new term w new .

18. The apparatus of claim 14 , wherein said trained PLSA model is parameterized by P(z|w) and the term addition logic comprises initialization logic configured to initialize a P(Z|W new ) parameter for each of said at least one new term, wherein the P(z|w new ) parameter is the probability of the latent class z given the new term w new . 21. apparatus of claim 18 , wherein the term addition logic comprises update logic configured to update at least one P(w) parameter.

1. A programming language type system comprising: a processor for executing: fixed-point rules that preserve integer-ness for one or more integer operations; integer rules in which integer types are distinct from fixed-point types and integer types can be automatically converted to fixed-point types; and a storage device for storing a result of at least one of executing the fixed-point rules and the integer rules.

1. A programming language type system comprising: a processor for executing: fixed-point rules that preserve integer-ness for one or more integer operations; integer rules in which integer types are distinct from fixed-point types and integer types can be automatically converted to fixed-point types; and a storage device for storing a result of at least one of executing the fixed-point rules and the integer rules. 5. The system of claim 1 in which the fixed-point rules preserve integer-ness for some integer operations via operator annotations.

1. A method of processing a search query comprising: processing a number of sample web pages to generate network data indicative of the interconnections between the sample web pages as identified by hyperlinks included in the sample web pages; utilizing the generated network data to generate for each of said web pages a plurality of network metrics indicative of the extent to which the interconnections associated with a web page correspond to defined patterns of interconnections; using the generated network metrics to generate a plurality of ranked indices of web pages; receiving a search query including an indication of an index to be utilized; and outputting a results list in response to receipt of the search query identifying a number of web pages wherein the results list is ordered on the basis of the index indicated in the search query.

1. A method of processing a search query comprising: processing a number of sample web pages to generate network data indicative of the interconnections between the sample web pages as identified by hyperlinks included in the sample web pages; utilizing the generated network data to generate for each of said web pages a plurality of network metrics indicative of the extent to which the interconnections associated with a web page correspond to defined patterns of interconnections; using the generated network metrics to generate a plurality of ranked indices of web pages; receiving a search query including an indication of an index to be utilized; and outputting a results list in response to receipt of the search query identifying a number of web pages wherein the results list is ordered on the basis of the index indicated in the search query. 6. The method of claim 1 wherein utilizing the generated network data to generate network metrics comprises: generating at least one network metric for said sample web pages indicative of the extent to which each sample web page is associated with hyperlinks connecting other web pages which are otherwise poorly connected to each other.

26. A method comprising: comparing one or more elements of at least a portion of an original document against the same types of elements in at least a portion each of a plurality of stored documents, wherein the portion of the original document is the portion that requires adjustment or re-layout; determining a particular stored document in the plurality of stored documents, with the portion which is the closest match to the portion of the original document based on the comparing; identifying a designated output device with one or more characteristics; obtaining one or more mutators from a list of stored mutators which were applied to mutate the portion of the determined particular stored document; and applying the obtained one or more mutators to the portion of the original document based on one or more characteristics of the designated output device and the applying further based on a stored priority order.

26. A method comprising: comparing one or more elements of at least a portion of an original document against the same types of elements in at least a portion each of a plurality of stored documents, wherein the portion of the original document is the portion that requires adjustment or re-layout; determining a particular stored document in the plurality of stored documents, with the portion which is the closest match to the portion of the original document based on the comparing; identifying a designated output device with one or more characteristics; obtaining one or more mutators from a list of stored mutators which were applied to mutate the portion of the determined particular stored document; and applying the obtained one or more mutators to the portion of the original document based on one or more characteristics of the designated output device and the applying further based on a stored priority order. 30. The method as set forth in claim 26 wherein the applying further comprises determining which of the one or more mutators which were used in the portion of the identified stored document to use in the applying.

1. A computer-implemented method comprising: accessing a software code file that comprises structural code and behavioral code; extracting from the software code file, at least a portion of the behavioral code into a separate file; generating binding code for referencing the extracted behavioral code to maintain run-time behavior of the software code file consistent with its run-time behavior before said extracting, wherein behavioral code extractor logic inserts into the software code file said binding code for referencing the extracted behavioral code; and wherein said extracting comprises enabling, by a user interface, selection of one or more of identified behavioral code that is to be extracted from the software code file into the separate file; and extracting the selected one or more of the identified behavioral code from the software code file into the separate file.

1. A computer-implemented method comprising: accessing a software code file that comprises structural code and behavioral code; extracting from the software code file, at least a portion of the behavioral code into a separate file; generating binding code for referencing the extracted behavioral code to maintain run-time behavior of the software code file consistent with its run-time behavior before said extracting, wherein behavioral code extractor logic inserts into the software code file said binding code for referencing the extracted behavioral code; and wherein said extracting comprises enabling, by a user interface, selection of one or more of identified behavioral code that is to be extracted from the software code file into the separate file; and extracting the selected one or more of the identified behavioral code from the software code file into the separate file. 10. The method of claim 1 wherein said extracting comprises: identifying the behavioral code contained in the software code file; and presenting the user interface that includes a list of the identified behavioral code contained in the software code file.

1. A computer-implemented method comprising: identifying third-party content objects associated with a user of the social networking system; establishing, by a computer, a maximum rate at which to provide notifications of third-party content objects to the user, where the maximum rate is a maximum number of notifications that can be sent to the user in a predetermined time period; providing a first set of notifications of third-party content objects to a user device of the user within the maximum rate; receiving a plurality of interactions with the first set of notifications made by the user; automatically identifying, from the plurality of interactions, a geographic location where the user had interactions with the first set of notifications; automatically determining that the user is at the geographic location where the user had the interactions with the first set of notifications; adjusting the maximum rate to provide the notifications of third-party content objects based on the user being at the geographic location; providing a second set of notifications of third-party content objects to the user device within the adjusted maximum rate while the user is at the geographic location.

1. A computer-implemented method comprising: identifying third-party content objects associated with a user of the social networking system; establishing, by a computer, a maximum rate at which to provide notifications of third-party content objects to the user, where the maximum rate is a maximum number of notifications that can be sent to the user in a predetermined time period; providing a first set of notifications of third-party content objects to a user device of the user within the maximum rate; receiving a plurality of interactions with the first set of notifications made by the user; automatically identifying, from the plurality of interactions, a geographic location where the user had interactions with the first set of notifications; automatically determining that the user is at the geographic location where the user had the interactions with the first set of notifications; adjusting the maximum rate to provide the notifications of third-party content objects based on the user being at the geographic location; providing a second set of notifications of third-party content objects to the user device within the adjusted maximum rate while the user is at the geographic location. 5. The computer-implemented method of claim 1 , wherein the third-party content objects comprise informational content objects describing at least one of movie show times, movie reviews, restaurant menus, restaurant reviews, product information, and product reviews of interest to the user.

9. At least one data processing system, comprising: a processor; and an accessible memory, the at least one data processing system configured to: receive metadata for a plurality of searchable objects, the metadata including at least one of an object type definition and object properties; define search filter rules based on user properties and data conditions; perform a search according to a rule-based configuration, the rule-based configuration including filters for object properties and filter ordering rules, the filter ordering rules specifying the order in which the filters are applied; and display search results according to the rule-based configuration.

9. At least one data processing system, comprising: a processor; and an accessible memory, the at least one data processing system configured to: receive metadata for a plurality of searchable objects, the metadata including at least one of an object type definition and object properties; define search filter rules based on user properties and data conditions; perform a search according to a rule-based configuration, the rule-based configuration including filters for object properties and filter ordering rules, the filter ordering rules specifying the order in which the filters are applied; and display search results according to the rule-based configuration. 12. The data processing system of claim 9 , wherein the search filter rules are also based on specific users, user roles, or user groups.

8. The computer readable medium of claim 7 , wherein the operation of providing the user interface displaying the first set of icons further comprises: receive a context indicator that defines a set of individuals having a common affiliation; ascertain the subset of the first superset of icons from the first superset of icons using the context indicator; and provide the user interface comprising the first set of icons.

8. The computer readable medium of claim 7 , wherein the operation of providing the user interface displaying the first set of icons further comprises: receive a context indicator that defines a set of individuals having a common affiliation; ascertain the subset of the first superset of icons from the first superset of icons using the context indicator; and provide the user interface comprising the first set of icons. 9. The computer readable medium of claim 8 , wherein providing on the user interface the second set of icons depends on the first superset of icons ascertained from the plurality of supersets of icons.

14. A non-transitory computer-readable medium having stored contents that configure a computing system to perform a method, the method comprising: analyzing, by the configured computing system, a plurality of textual comments being supplied by human users during a prior time period and being related to a plurality of topics that are each mentioned in contents of one or more of the plurality of textual comments and that are identified from the analyzing; generating, by the configured computing system, a plurality of comment groups based on the identified topics, each of the generated comment groups being associated with one of the identified topics and including one or more of the plurality of textual comments that have contents mentioning the associated identified topic; determining, by the configured computing system, multiple terms of interest that are distinct from the plurality of topics, and assigning each of the multiple terms to one of multiple graph axes; determining, by the configured computing system, and for each of at least some of the plurality of topics, a relevance of one of the generated comment groups associated with the topic to the multiple terms based at least in part on the textual comments included in the one generated comment group; providing, by the configured computing system, information to initiate display of a multi-dimensional graph that includes the multiple graph axes and that includes visual indicators for multiple of the at least some topics on the multi-dimensional graph, wherein a position of each of the multiple topics on the displayed multi-dimensional graph is based on the determined relevance of the one generated comment group associated with the topic to the multiple terms and is based on the assignment of the multiple terms to the multiple graph axes, to enable a visual determination from the displayed multi-dimensional graph of relative relevance of the multiple topics to the multiple terms; identifying, by the configured computing system, a subset of the plurality of textual comments that are associated with a specified content category based on contents of the textual comments of the identified subset, the textual comments of the identified subset being included in multiple of the generated comment groups; determining, by the configured computing system, a subset of the multiple generated comment groups that correspond to the specified content category for the prior time period; discovering, by the configured computing system, additional content categories that are related to the specified content category, wherein each of the additional content categories corresponds to the topic of at least one of the determined subset of comment groups; and providing, by the configured computing system, indications of the determined additional content categories that are related to the specified content category.

14. A non-transitory computer-readable medium having stored contents that configure a computing system to perform a method, the method comprising: analyzing, by the configured computing system, a plurality of textual comments being supplied by human users during a prior time period and being related to a plurality of topics that are each mentioned in contents of one or more of the plurality of textual comments and that are identified from the analyzing; generating, by the configured computing system, a plurality of comment groups based on the identified topics, each of the generated comment groups being associated with one of the identified topics and including one or more of the plurality of textual comments that have contents mentioning the associated identified topic; determining, by the configured computing system, multiple terms of interest that are distinct from the plurality of topics, and assigning each of the multiple terms to one of multiple graph axes; determining, by the configured computing system, and for each of at least some of the plurality of topics, a relevance of one of the generated comment groups associated with the topic to the multiple terms based at least in part on the textual comments included in the one generated comment group; providing, by the configured computing system, information to initiate display of a multi-dimensional graph that includes the multiple graph axes and that includes visual indicators for multiple of the at least some topics on the multi-dimensional graph, wherein a position of each of the multiple topics on the displayed multi-dimensional graph is based on the determined relevance of the one generated comment group associated with the topic to the multiple terms and is based on the assignment of the multiple terms to the multiple graph axes, to enable a visual determination from the displayed multi-dimensional graph of relative relevance of the multiple topics to the multiple terms; identifying, by the configured computing system, a subset of the plurality of textual comments that are associated with a specified content category based on contents of the textual comments of the identified subset, the textual comments of the identified subset being included in multiple of the generated comment groups; determining, by the configured computing system, a subset of the multiple generated comment groups that correspond to the specified content category for the prior time period; discovering, by the configured computing system, additional content categories that are related to the specified content category, wherein each of the additional content categories corresponds to the topic of at least one of the determined subset of comment groups; and providing, by the configured computing system, indications of the determined additional content categories that are related to the specified content category. 33. The non-transitory computer-readable medium of claim 14 wherein the method further comprises: analyzing, by the configured computing system and for one or more of the content categories, information about the textual comments included in the subset of multiple generated comment groups corresponding to the one content category to determine one or more relevant attributes for the one content category that are distinct from any definition terms for the one content category; and providing, by the configured computing system, information about the determined one or more relevant attributes for the one content category.

19. The apparatus of claim 18 , wherein the apparatus is further caused to, upon selection of the matching input mode, perform: analyze the speech application grammar associated with the interaction node; generate a plurality of utterances based on the speech application grammar corresponding to the interaction node, the plurality of utterances associated with respective weighted values; and choose the utterance to be provided as the response to the speech application based on the respective weighted values associated with the plurality of utterances.

19. The apparatus of claim 18 , wherein the apparatus is further caused to, upon selection of the matching input mode, perform: analyze the speech application grammar associated with the interaction node; generate a plurality of utterances based on the speech application grammar corresponding to the interaction node, the plurality of utterances associated with respective weighted values; and choose the utterance to be provided as the response to the speech application based on the respective weighted values associated with the plurality of utterances. 24. The apparatus of claim 19 , wherein the plurality of utterances comprises at least one human-supplied valid utterance.

1. A method performed by one or more server devices, the method comprising: receiving, at one or more processors of the one or more server devices, a query, from a client device, that includes one or more terms; determining, by one or more processors of the one or more server devices, whether the query is a commercial query by: determining whether the one or more terms of the query, in any particular order, matches a commercial query pattern in a list of commercial query patterns, where the list of commercial query patterns includes patterns associated with one or more host names or domain names that include more than a particular number of hyphens, and identifying the query as a commercial query when the one or more terms of the query, in any particular order, matches the commercial query pattern in the list of commercial query patterns; processing, by one or more processors of the one or more server devices, the query in a first processing manner when the query is not determined to be a commercial query, where processing the query in the first processing manner includes ranking documents in a first ranking manner; and processing, by one or more processors of the one or more server devices, the query in a second, different processing manner in response to determining that the query is a commercial query, where processing the query in the second processing manner includes ranking documents in a second, different ranking manner.

1. A method performed by one or more server devices, the method comprising: receiving, at one or more processors of the one or more server devices, a query, from a client device, that includes one or more terms; determining, by one or more processors of the one or more server devices, whether the query is a commercial query by: determining whether the one or more terms of the query, in any particular order, matches a commercial query pattern in a list of commercial query patterns, where the list of commercial query patterns includes patterns associated with one or more host names or domain names that include more than a particular number of hyphens, and identifying the query as a commercial query when the one or more terms of the query, in any particular order, matches the commercial query pattern in the list of commercial query patterns; processing, by one or more processors of the one or more server devices, the query in a first processing manner when the query is not determined to be a commercial query, where processing the query in the first processing manner includes ranking documents in a first ranking manner; and processing, by one or more processors of the one or more server devices, the query in a second, different processing manner in response to determining that the query is a commercial query, where processing the query in the second processing manner includes ranking documents in a second, different ranking manner. 2. The method of claim 1 where the determining whether the query is a commercial query further includes: determining, when the one or more terms of the query is not included in the list of commercial query patterns, whether the one or more terms of the query relates to at least one commercial query pattern in the list of commercial query patterns, identifying the query as a commercial query when the one or more terms of the query relates to at least one commercial query pattern in the list of commercial query patterns, and identifying the query as not being a commercial query when the one or more terms of the query is unrelated to the list of commercial query patterns.

7. A system, comprising: a memory, communicatively coupled to a processor, the memory storing the computer-executable components comprising: an editor component configured to: infer a first industrial programming language of a plurality of industrial programming languages to utilize for programming an industrial controller and infer a second industrial programming language of the plurality of industrial programming languages to utilize in combination with the first industrial programming language for programming the industrial controller to create a custom programming language that is optimal for programming the industrial controller based upon at least one criteria comprising a code function to be implemented in the industrial controller, wherein the at least one criteria further comprises user tendencies associated with respective industrial programming languages of the industrial programming languages; and combine at least a portion of the first industrial programming language with at least another portion of the second industrial programming language to create the custom programming language for programming the industrial controller, wherein the first industrial programming language, the industrial second programming language and the custom programming language are disparate.

7. A system, comprising: a memory, communicatively coupled to a processor, the memory storing the computer-executable components comprising: an editor component configured to: infer a first industrial programming language of a plurality of industrial programming languages to utilize for programming an industrial controller and infer a second industrial programming language of the plurality of industrial programming languages to utilize in combination with the first industrial programming language for programming the industrial controller to create a custom programming language that is optimal for programming the industrial controller based upon at least one criteria comprising a code function to be implemented in the industrial controller, wherein the at least one criteria further comprises user tendencies associated with respective industrial programming languages of the industrial programming languages; and combine at least a portion of the first industrial programming language with at least another portion of the second industrial programming language to create the custom programming language for programming the industrial controller, wherein the first industrial programming language, the industrial second programming language and the custom programming language are disparate. 13. The system of claim 7 , wherein the at least one criteria further comprises graphical properties of respective industrial programming languages of the industrial programming languages.

22. A speech processing method for processing speech including a succession of utterances spoken in any of continuous and discrete form comprising the steps of: A. storing a plurality of M cluster data sets, C.sub.1, . . . , C.sub.M, where M is an integer greater than 1, each of said cluster data sets including data representative of a plurality of word models; B. generating a succession of w frame data sets v.sub.t, v.sub.t+1, . . . v.sub.t+w-1, beginning at a frame start time t during said succession of utterances spoken in any of continuous and discrete form, where w is an integer greater than 1, each of said frame data sets being representative of successive acoustic segments of utterances spoken in any of continuous and discrete form for a frame period, each of said frame data sets including k values representative of different frame parameters where k.gtoreq.1; C. reducing w of said frame data sets to generate s reduced frame data sets, Y.sub.1, Y.sub.2, . . . , Y.sub.3 where s&lt;w, each of said reduced frame data sets being related to an associated plurality of said frame data sets and including j values related to the k values of said associated frame data sets, where j.ltoreq.k; D. evaluating said reduced frame data sets with a succession of said cluster data sets to generate a cluster score S.sub.Y for each of said cluster data sets; E. identifying each of said word models having a cluster score bearing a predetermined relation to at least one threshold score T, said identified word models defining a word list; F. determining said frame start times t, where successive start times t are identified at arbitrarily selected intervals; said frame start times being independent of identification of an initial anchor; and G. generating a signal representative of said candidate word list for selected ones of said frame start times determined in step F.

22. A speech processing method for processing speech including a succession of utterances spoken in any of continuous and discrete form comprising the steps of: A. storing a plurality of M cluster data sets, C.sub.1, . . . , C.sub.M, where M is an integer greater than 1, each of said cluster data sets including data representative of a plurality of word models; B. generating a succession of w frame data sets v.sub.t, v.sub.t+1, . . . v.sub.t+w-1, beginning at a frame start time t during said succession of utterances spoken in any of continuous and discrete form, where w is an integer greater than 1, each of said frame data sets being representative of successive acoustic segments of utterances spoken in any of continuous and discrete form for a frame period, each of said frame data sets including k values representative of different frame parameters where k.gtoreq.1; C. reducing w of said frame data sets to generate s reduced frame data sets, Y.sub.1, Y.sub.2, . . . , Y.sub.3 where s&lt;w, each of said reduced frame data sets being related to an associated plurality of said frame data sets and including j values related to the k values of said associated frame data sets, where j.ltoreq.k; D. evaluating said reduced frame data sets with a succession of said cluster data sets to generate a cluster score S.sub.Y for each of said cluster data sets; E. identifying each of said word models having a cluster score bearing a predetermined relation to at least one threshold score T, said identified word models defining a word list; F. determining said frame start times t, where successive start times t are identified at arbitrarily selected intervals; said frame start times being independent of identification of an initial anchor; and G. generating a signal representative of said candidate word list for selected ones of said frame start times determined in step F. 23. A method according to claim 22 wherein said reducing step C further Comprises the substep of smoothing said frame data sets.

17. An apparatus in accordance with claim 16, wherein said receiving means comprises means for receiving at least one handwritten new character in the handwriting capture widget.

17. An apparatus in accordance with claim 16, wherein said receiving means comprises means for receiving at least one handwritten new character in the handwriting capture widget. 24. An apparatus in accordance with claim 17, wherein said selecting means comprises means for overriding the sequentially ordered list of text entry widgets.

1. An electronic search system comprising: at least one processor; and at least one computer-readable storage medium encoded with executable instructions that, when executed by the at least one processor, causes the at least one processor to perform operations comprising: causing display of at least a portion of an interface that includes an input field configured to enable a user to enter one or more terms that define a search query and that includes a search control configured to, when selected based on user input, initiate a search using a search query entered in the input field at a time of selection of the search control; receiving user input selecting the search control included in the interface at a time when one or more terms have been entered in the input field included in the interface to define a first search query; in response to the selection of the search control included in the interface at the time when one or more terms have been entered in the input field included in the interface to define the first search query: accessing the first search query that was entered in the input field included in the interface at a time of selection of the search control; initiating a search using the first search query that was entered in the input field included in the interface at the time of selection of the search control to identify search results that are responsive to the first search query; based on the search using the first search query, accessing a first list of search results that are responsive to the first search query, the first list of search results including at least a first search result that is responsive to the first search query and that links to first electronic content; and causing display of the first list of search results accessed based on the search using the first search query, the display of the first list of search results having a representation of the first search result that includes description information that is descriptive of the first search result and a first link that links to the first electronic content; after causing display of the first list of search results identified based on performing the search using the first search query, detecting user input selecting the first link of the first search result included in the display of the first list of search results, the selection of the first link of the first search result causing display of the first electronic content linked to by the first link of the first search result; and in response to the detection of user input selecting the first link of the first search result included in the display of the first list of search results, automatically, by at least one processor and without additional user input after the user input selecting the first link of the first search result, including the first search result in a second list of search results that is different from the first list of search results, that, when displayed, includes a reformatted representation of the first search result that has reduced description information of the first search result as compared to the description information included in the representation of the first search result in the display of the first list of search results, and that, when displayed, includes at least one interface control that enables a user to add, to the first search result included in the second list of search results, a comment that is displayed in the second list of search results in association with the reformatted representation of the first search result.

1. An electronic search system comprising: at least one processor; and at least one computer-readable storage medium encoded with executable instructions that, when executed by the at least one processor, causes the at least one processor to perform operations comprising: causing display of at least a portion of an interface that includes an input field configured to enable a user to enter one or more terms that define a search query and that includes a search control configured to, when selected based on user input, initiate a search using a search query entered in the input field at a time of selection of the search control; receiving user input selecting the search control included in the interface at a time when one or more terms have been entered in the input field included in the interface to define a first search query; in response to the selection of the search control included in the interface at the time when one or more terms have been entered in the input field included in the interface to define the first search query: accessing the first search query that was entered in the input field included in the interface at a time of selection of the search control; initiating a search using the first search query that was entered in the input field included in the interface at the time of selection of the search control to identify search results that are responsive to the first search query; based on the search using the first search query, accessing a first list of search results that are responsive to the first search query, the first list of search results including at least a first search result that is responsive to the first search query and that links to first electronic content; and causing display of the first list of search results accessed based on the search using the first search query, the display of the first list of search results having a representation of the first search result that includes description information that is descriptive of the first search result and a first link that links to the first electronic content; after causing display of the first list of search results identified based on performing the search using the first search query, detecting user input selecting the first link of the first search result included in the display of the first list of search results, the selection of the first link of the first search result causing display of the first electronic content linked to by the first link of the first search result; and in response to the detection of user input selecting the first link of the first search result included in the display of the first list of search results, automatically, by at least one processor and without additional user input after the user input selecting the first link of the first search result, including the first search result in a second list of search results that is different from the first list of search results, that, when displayed, includes a reformatted representation of the first search result that has reduced description information of the first search result as compared to the description information included in the representation of the first search result in the display of the first list of search results, and that, when displayed, includes at least one interface control that enables a user to add, to the first search result included in the second list of search results, a comment that is displayed in the second list of search results in association with the reformatted representation of the first search result. 5. The electronic search system of claim 1 , wherein automatically including the first search result in the second list of search results comprises automatically, by at least one processor and without additional user input after the user input selecting the first link of the first search result, including the first search result in the second list of search results that is different from the first list of search results, that, when displayed, includes a reformatted representation of the first search result that has a reduced title of the first search result as compared to a title of the first search result included in the representation of the first search result in the display of the first list of search results, and that, when displayed, includes at least one interface control that enables a user to add, to the first search result included in the second list of search results, a comment that is displayed in the second list of search results in association with the reformatted representation of the first search result.

1. A method comprising: durably storing a plurality of domain correction records, wherein each domain correction record of the plurality of domain correction records comprises a misspelled domain name and one or more candidate domain name corrections; detecting that an unprocessed email address of an attempt to log in to an online user account is not contained in a plurality of known email addresses, wherein the unprocessed email address comprises a misspelled domain name, wherein each known email address of the plurality of known email addresses comprises a domain name; retrieving, based on the misspelled domain name of the unprocessed email address, from the plurality of domain correction records, a matching domain correction record having a same misspelled domain name as the unprocessed email address; causing the one or more candidate domain name corrections of the matching domain correction record to be displayed on a client device; wherein each of the one or more candidate domain name corrections of the matching domain correction record occurs within the plurality of known email addresses at a frequency that exceeds a threshold; wherein the method is performed by one or more computers.

1. A method comprising: durably storing a plurality of domain correction records, wherein each domain correction record of the plurality of domain correction records comprises a misspelled domain name and one or more candidate domain name corrections; detecting that an unprocessed email address of an attempt to log in to an online user account is not contained in a plurality of known email addresses, wherein the unprocessed email address comprises a misspelled domain name, wherein each known email address of the plurality of known email addresses comprises a domain name; retrieving, based on the misspelled domain name of the unprocessed email address, from the plurality of domain correction records, a matching domain correction record having a same misspelled domain name as the unprocessed email address; causing the one or more candidate domain name corrections of the matching domain correction record to be displayed on a client device; wherein each of the one or more candidate domain name corrections of the matching domain correction record occurs within the plurality of known email addresses at a frequency that exceeds a threshold; wherein the method is performed by one or more computers. 2. The method of claim 1 wherein each of the misspelled domain names of the plurality of domain correction records was previously observed with a frequency that exceeds a threshold.

8. The method of claim 1 , comprising: determining a LCS of query/URL pairs that is strictly decreasing in both the pre-existing and click relevance ranking; assigning the pre-existing relevance ranking labels associated with the LCS of query/URL pairs to the click relevance ranking; and relabeling a label associated with the query/URL pair not in the LCS with a new label interpolated from the click relevance ranking.

8. The method of claim 1 , comprising: determining a LCS of query/URL pairs that is strictly decreasing in both the pre-existing and click relevance ranking; assigning the pre-existing relevance ranking labels associated with the LCS of query/URL pairs to the click relevance ranking; and relabeling a label associated with the query/URL pair not in the LCS with a new label interpolated from the click relevance ranking. 9. The method of claim 8 , comprising: increasing a value of the label associated with a most relevant query/URL pair when the click rate exceeds a specified threshold.

19. A computer system comprising: one or more memories configured for storing executable instructions; and one or more processors configured for executing the instructions, wherein the instructions include instructions to: determine, for a document that contains a first phrase, an expected number of related phrases that are related to the first phrase and are expected to be present in the document; determine for the document, and for the first phrase in the document, an actual number of related phrases present in the document; and identify the document as a spam document by comparing the actual number of related phrases present in the document with the expected number of related phrases, wherein determining the expected number of related phrases includes: traversing an index of a plurality of documents; for each of the indexed documents, determining a set of phrases in the document, and for each phrase in the set, determining a number of related phrases also in the document; and determining the expected number of related phrases based on the determined number of related phrases across the traversed documents.

19. A computer system comprising: one or more memories configured for storing executable instructions; and one or more processors configured for executing the instructions, wherein the instructions include instructions to: determine, for a document that contains a first phrase, an expected number of related phrases that are related to the first phrase and are expected to be present in the document; determine for the document, and for the first phrase in the document, an actual number of related phrases present in the document; and identify the document as a spam document by comparing the actual number of related phrases present in the document with the expected number of related phrases, wherein determining the expected number of related phrases includes: traversing an index of a plurality of documents; for each of the indexed documents, determining a set of phrases in the document, and for each phrase in the set, determining a number of related phrases also in the document; and determining the expected number of related phrases based on the determined number of related phrases across the traversed documents. 24. The computer system of claim 19 , wherein the instructions to identify the document as a spam document include instructions to: determine, for a second phrase contained in the document, a number of the related phrases related to a second phrase expected to be present in the document; determine for the document, and for the second phrase in the document, an actual number of related phrases present in the document; determine, for a third phrase contained in the document, a number of the related phrases related to a third phrase expected to be present in the document; determine for the document, and for the third phrase in the document, an actual number of related phrases present in the document; identify the document as a spam document where, for each of the first phrase, the second phrase, and the third phrase, the actual number of related phrases present in the document exceeds the expected number of related phrases based on a threshold.

15. A system, comprising: a processing module comprising a non-transitory computer readable medium storing instructions that, when executed, cause the system to: receive a first query that is associated with a first type of database; translate, using primitives, the first query into an edge query that is associated with a graph database storing a graph, wherein: the first type of database has a different data model than the graph database; the graph comprises nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency; and the primitives include: a rule based on edges in the graph that expresses a relational schema in the first type of database, and information associated with a compound key that specifies a relationship between the nodes, the edges and the predicates in the graph corresponding to a table in the first type of database; execute the edge query against the graph database, wherein the edge query identifies an edge associated with a predicate that specifies one or more of the nodes in the graph; and receive a result in response to the edge query, wherein the result includes a subset of the graph.

15. A system, comprising: a processing module comprising a non-transitory computer readable medium storing instructions that, when executed, cause the system to: receive a first query that is associated with a first type of database; translate, using primitives, the first query into an edge query that is associated with a graph database storing a graph, wherein: the first type of database has a different data model than the graph database; the graph comprises nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency; and the primitives include: a rule based on edges in the graph that expresses a relational schema in the first type of database, and information associated with a compound key that specifies a relationship between the nodes, the edges and the predicates in the graph corresponding to a table in the first type of database; execute the edge query against the graph database, wherein the edge query identifies an edge associated with a predicate that specifies one or more of the nodes in the graph; and receive a result in response to the edge query, wherein the result includes a subset of the graph. 16. The system of claim 15 , wherein the first type of database includes one of: a relational database, and a hierarchical database.

5. A method executed by one or more computers for identifying free-text documents, the method comprising: maintaining a knowledge source storing a plurality of concepts formed based on one or more words in a predefined vocabulary set, the knowledge source maintaining a plurality of relationship links wherein each relationship link defines a relationship between a first semantic grouping of the concepts and a second semantic grouping of the concepts; generating under control of the one or more computers, indexing concepts for the free-text documents stored in a database, the indexing concepts being generated based on one or more words from the predefined vocabulary set, wherein the generating of the indexing concepts includes: maintaining a plurality of data structures mapping each of the plurality of concepts in the knowledge source to all words appearing in the concept; receiving a particular one of the free-text documents; identifying based on the plurality of data structures, one or more of the plurality of concepts in the knowledge source mapped to a set of words appearing in the particular one of the free-text documents; and returning the one or more identified concepts as candidate index concepts for the particular one of the free-text documents; receiving, under control of the one or more computers, an input query including an original query concept and at least one scenario identifier; automatically generating, under control of the one or more computers, an expanded input query including both the original query concept and one or more additional query concepts, the one or more additional query concepts being selected from one or more first particular semantic groupings of the concepts in the knowledge source that have a specific relationship link with a second particular semantic grouping of the concepts containing the original query concept, the specific relationship link being identified by the at least one scenario identifier, wherein the automatically generating of the expanded input query further includes: filtering candidate expansion concepts not included in the one or more first particular semantic groupings of the concepts in the knowledge source; and returning the one or more additional query concepts based on the filtering; accessing the database of free-text documents; comparing the expanded input query with the indexing concepts for the free-text documents; and returning one or more of the free-text documents that satisfy the expanded input query based on the comparison.

5. A method executed by one or more computers for identifying free-text documents, the method comprising: maintaining a knowledge source storing a plurality of concepts formed based on one or more words in a predefined vocabulary set, the knowledge source maintaining a plurality of relationship links wherein each relationship link defines a relationship between a first semantic grouping of the concepts and a second semantic grouping of the concepts; generating under control of the one or more computers, indexing concepts for the free-text documents stored in a database, the indexing concepts being generated based on one or more words from the predefined vocabulary set, wherein the generating of the indexing concepts includes: maintaining a plurality of data structures mapping each of the plurality of concepts in the knowledge source to all words appearing in the concept; receiving a particular one of the free-text documents; identifying based on the plurality of data structures, one or more of the plurality of concepts in the knowledge source mapped to a set of words appearing in the particular one of the free-text documents; and returning the one or more identified concepts as candidate index concepts for the particular one of the free-text documents; receiving, under control of the one or more computers, an input query including an original query concept and at least one scenario identifier; automatically generating, under control of the one or more computers, an expanded input query including both the original query concept and one or more additional query concepts, the one or more additional query concepts being selected from one or more first particular semantic groupings of the concepts in the knowledge source that have a specific relationship link with a second particular semantic grouping of the concepts containing the original query concept, the specific relationship link being identified by the at least one scenario identifier, wherein the automatically generating of the expanded input query further includes: filtering candidate expansion concepts not included in the one or more first particular semantic groupings of the concepts in the knowledge source; and returning the one or more additional query concepts based on the filtering; accessing the database of free-text documents; comparing the expanded input query with the indexing concepts for the free-text documents; and returning one or more of the free-text documents that satisfy the expanded input query based on the comparison. 6. The method of claim 5 wherein a sequence of appearance of the words in the particular one of the free-text documents is a free-permutation of the words in the set.

1. A method comprising: receiving a search query, wherein the search query is: formatted according to a standard language for containing and annotating interpretations of user input, the standard language being different than a language the search query was recorded in; and based on a natural language spoken query from a user; retrieving an N-best list of recognition results based on the search query; transmitting the N-best list of recognition results to a plurality of user devices comprising a first user device and a second user device; after presenting the N-best list on the plurality of user devices, receiving disambiguation input from the first user device, the disambiguation input comprising a vocal disambiguation input and a gesture disambiguation input, the disambiguation input indicating an entry in the N-best list; and transmitting to the second user device additional information associated with the entry based on the disambiguation input; wherein the additional information is a map indicating an address for the entry.

1. A method comprising: receiving a search query, wherein the search query is: formatted according to a standard language for containing and annotating interpretations of user input, the standard language being different than a language the search query was recorded in; and based on a natural language spoken query from a user; retrieving an N-best list of recognition results based on the search query; transmitting the N-best list of recognition results to a plurality of user devices comprising a first user device and a second user device; after presenting the N-best list on the plurality of user devices, receiving disambiguation input from the first user device, the disambiguation input comprising a vocal disambiguation input and a gesture disambiguation input, the disambiguation input indicating an entry in the N-best list; and transmitting to the second user device additional information associated with the entry based on the disambiguation input; wherein the additional information is a map indicating an address for the entry. 2. The method of claim 1 , wherein the additional information is a set of instructions to trigger the user device to perform certain steps.

1. A computer system, comprising: a computer readable medium including a firmware repository; and wherein the firmware repository stores at least one Extensible Markup Language (XML) description file employing an XML schema which identifies for a firmware associated with the firmware repository a firmware version, a device supported by the firmware, and a location of the firmware, and wherein the XML schema further identifies for the firmware associated with the firmware repository a version matrix comprising a matrix of version numbers of all the firmware for different components of said device and a set of interdependencies among the different components of said device, and wherein the firmware is contained in a firmware file separate and distinct from the XML description file; a utility program installed on a computer console to access the firmware repository, read the XML description file, and manage or download firmware files for a given device.

1. A computer system, comprising: a computer readable medium including a firmware repository; and wherein the firmware repository stores at least one Extensible Markup Language (XML) description file employing an XML schema which identifies for a firmware associated with the firmware repository a firmware version, a device supported by the firmware, and a location of the firmware, and wherein the XML schema further identifies for the firmware associated with the firmware repository a version matrix comprising a matrix of version numbers of all the firmware for different components of said device and a set of interdependencies among the different components of said device, and wherein the firmware is contained in a firmware file separate and distinct from the XML description file; a utility program installed on a computer console to access the firmware repository, read the XML description file, and manage or download firmware files for a given device. 7. The computer system of claim 1 , wherein said firmware location is a remote computer readable medium distinct from said computer readable medium on which said description file is stored.

16. The computer readable medium of claim 15 , wherein operations further comprise providing an in-depth article index, the in-depth article index storing data associated with each in-depth article in the plurality of in-depth articles.

16. The computer readable medium of claim 15 , wherein operations further comprise providing an in-depth article index, the in-depth article index storing data associated with each in-depth article in the plurality of in-depth articles. 17. The computer readable medium of claim 16 , wherein providing an in-depth article index comprises: providing a set of target websites based on a set of seed web sites; for one or more web pages of a target website in the set of target websites, determining an in-depth article score; and identifying content of the one or more web pages as an in-depth article based on the in-depth article score.

19. The computing system of claim 18 , wherein said method further comprises: receiving, by said inference engine, second sensor cohort data associated with a second cohort, said second cohort located within said first aircraft; receiving, by said inference engine, second group technology inferences associated with said second cohort; generating, by said inference engine, second risk cohort inferences, said generating said second risk cohort inferences based on said second group technology inferences and said second sensor cohort data; receiving, by said inference engine, seventh inference data generated by said inference engine, said seventh inference data comprising a seventh plurality of inferences associated with said second cohort and said security perimeter area surrounding said airport; receiving, by said inference engine, eighth inference data generated by said inference engine, said eighth inference data comprising an eighth plurality of inferences associated with said second cohort and said pre/post security area within said airport; receiving, by said inference engine, ninth inference data generated by said inference engine, said ninth inference data comprising a ninth plurality of inferences associated with said second cohort and said gate area within said airport; receiving, by said inference engine, tenth inference data generated by said inference engine, said tenth inference data comprising a tenth of plurality of inferences associated with said second cohort and said second aircraft; generating, by said inference engine, eleventh inference data, said eleventh inference data comprising an eleventh plurality of inferences associated with said second cohort, wherein said generating said eleventh inference data is based on second risk cohort inferences, said seventh inference data, said eighth inference data, said ninth inference data, and said tenth inference data; generating, by said inference engine based on said eleventh inference data, a second associated risk level score for said second cohort; and storing, by said computing system, said eleventh inference data and said second associated risk level score.

19. The computing system of claim 18 , wherein said method further comprises: receiving, by said inference engine, second sensor cohort data associated with a second cohort, said second cohort located within said first aircraft; receiving, by said inference engine, second group technology inferences associated with said second cohort; generating, by said inference engine, second risk cohort inferences, said generating said second risk cohort inferences based on said second group technology inferences and said second sensor cohort data; receiving, by said inference engine, seventh inference data generated by said inference engine, said seventh inference data comprising a seventh plurality of inferences associated with said second cohort and said security perimeter area surrounding said airport; receiving, by said inference engine, eighth inference data generated by said inference engine, said eighth inference data comprising an eighth plurality of inferences associated with said second cohort and said pre/post security area within said airport; receiving, by said inference engine, ninth inference data generated by said inference engine, said ninth inference data comprising a ninth plurality of inferences associated with said second cohort and said gate area within said airport; receiving, by said inference engine, tenth inference data generated by said inference engine, said tenth inference data comprising a tenth of plurality of inferences associated with said second cohort and said second aircraft; generating, by said inference engine, eleventh inference data, said eleventh inference data comprising an eleventh plurality of inferences associated with said second cohort, wherein said generating said eleventh inference data is based on second risk cohort inferences, said seventh inference data, said eighth inference data, said ninth inference data, and said tenth inference data; generating, by said inference engine based on said eleventh inference data, a second associated risk level score for said second cohort; and storing, by said computing system, said eleventh inference data and said second associated risk level score. 20. The computing system of claim 19 , wherein said method further comprises: receiving, by said inference engine, twelfth inference data generated by said inference engine, said twelfth inference data comprising a twelfth plurality of inferences associated with said second cohort and said aircraft, wherein said generating said eleventh inference data is further based on said twelfth inference data.

1. One or more computer storage media devices having stored thereon multiple instructions that, when executed by one or more processors of a device, cause the one or more processors to: display, in each of two display areas, different pages of a digital book using a book display model; display, in response to a request to semantically zoom out, the digital book in a broader context, the broader context using a context display model rather than the book display model; display, in response to a request to semantically zoom in, the digital book in the book display model rather than the context display model; receive a request to enter a scratchpad mode, and in response to the request: automatically combine the different pages of the digital book displayed in each of the two display areas for display in a first of the two display areas and clear at least a portion of a second of the two display areas; display, in the first of the two display areas, the combined different pages of the digital book that were previously displayed in both of the two display areas; and display, in the second of the two display areas, a collection of pages of the digital book that have been moved by a user of the device from the first of the two display areas to the second of the two display areas.

1. One or more computer storage media devices having stored thereon multiple instructions that, when executed by one or more processors of a device, cause the one or more processors to: display, in each of two display areas, different pages of a digital book using a book display model; display, in response to a request to semantically zoom out, the digital book in a broader context, the broader context using a context display model rather than the book display model; display, in response to a request to semantically zoom in, the digital book in the book display model rather than the context display model; receive a request to enter a scratchpad mode, and in response to the request: automatically combine the different pages of the digital book displayed in each of the two display areas for display in a first of the two display areas and clear at least a portion of a second of the two display areas; display, in the first of the two display areas, the combined different pages of the digital book that were previously displayed in both of the two display areas; and display, in the second of the two display areas, a collection of pages of the digital book that have been moved by a user of the device from the first of the two display areas to the second of the two display areas. 5. One or more computer storage media devices as recited in claim 1 , wherein to display the digital book in the broader context is to display the digital book in a first display area of the two display areas, and display multiple additional digital books in a second display area of the two display areas.

1. A system including instructions recorded on a non-transitory computer-readable medium, and executable by at least one processor, the system comprising: a query collector configured to cause the at least one processor to receive a plurality of queries received from a user and applied by a search engine to obtain corresponding search results, the query collector including a session manager configured to identify at least one search session of the user during which the plurality of queries were received in a sequence; a graph manager configured to cause the at least one processor to generate, based on the plurality of queries, an initial graph of nodes, each node corresponding to at least one query and connected by an edge to another node in an order corresponding to the sequence, wherein the order and the sequence include at least one conflict in which a first parent node is connected by a first edge to at least one child node that is itself a second parent node connected by a second edge to the first parent node, and further configured to cause the at least one processor to merge at least two of the nodes based on a similarity of corresponding queries thereof, to obtain a merged node, the graph manager further including a conflict resolver configured to detect the at least one conflict and resolve the at least one conflict including determining that the second parent node corresponds to a higher value of at least one search quality metric than the first parent node, and then removing the second edge, based on the determining, to thereby transform the initial graph into a directed graph, and a representative query generator configured to relate the merged node with a domain topic of an ontology base and generate at least one representative query representing the merged node, based on the ontology base; and a suggestion generator configured to cause the at least one processor to match a current query with a matching node of the nodes, follow the directed graph from the matching node until the merged node is reached within the directed graph, and provide the at least one representative query to the user as a suggested query for a future search to be conducted by the search engine.

1. A system including instructions recorded on a non-transitory computer-readable medium, and executable by at least one processor, the system comprising: a query collector configured to cause the at least one processor to receive a plurality of queries received from a user and applied by a search engine to obtain corresponding search results, the query collector including a session manager configured to identify at least one search session of the user during which the plurality of queries were received in a sequence; a graph manager configured to cause the at least one processor to generate, based on the plurality of queries, an initial graph of nodes, each node corresponding to at least one query and connected by an edge to another node in an order corresponding to the sequence, wherein the order and the sequence include at least one conflict in which a first parent node is connected by a first edge to at least one child node that is itself a second parent node connected by a second edge to the first parent node, and further configured to cause the at least one processor to merge at least two of the nodes based on a similarity of corresponding queries thereof, to obtain a merged node, the graph manager further including a conflict resolver configured to detect the at least one conflict and resolve the at least one conflict including determining that the second parent node corresponds to a higher value of at least one search quality metric than the first parent node, and then removing the second edge, based on the determining, to thereby transform the initial graph into a directed graph, and a representative query generator configured to relate the merged node with a domain topic of an ontology base and generate at least one representative query representing the merged node, based on the ontology base; and a suggestion generator configured to cause the at least one processor to match a current query with a matching node of the nodes, follow the directed graph from the matching node until the merged node is reached within the directed graph, and provide the at least one representative query to the user as a suggested query for a future search to be conducted by the search engine. 8. The system of claim 1 , wherein the graph manager is further configured to cause the at least one processor to form the merged node from the at least two of the nodes, based on a similarity of search results of the corresponding queries.

12. An interactive adaptive narrative presentation method, comprising: generating, by an adaptive narration presentation circuit, a narrative presentation output at a communicably coupled communications interface; receiving, by the adaptive narration presentation circuit, a signal containing data indicative of an object placed in a field-of-view of at least one optical sensor communicably coupled to the adaptive narrative presentation system; concurrent with the narrative presentation, optically identifying, by the adaptive narration presentation circuit, the object based at least in part on at least one intrinsic characteristic of the object; autonomously identifying, by the adaptive narration presentation circuit, at least one aspect of the narrative presentation associated with the identified object; and modifying, by the adaptive narration presentation circuit, the at least one aspect of the narrative presentation based at least in part on the identified object.

12. An interactive adaptive narrative presentation method, comprising: generating, by an adaptive narration presentation circuit, a narrative presentation output at a communicably coupled communications interface; receiving, by the adaptive narration presentation circuit, a signal containing data indicative of an object placed in a field-of-view of at least one optical sensor communicably coupled to the adaptive narrative presentation system; concurrent with the narrative presentation, optically identifying, by the adaptive narration presentation circuit, the object based at least in part on at least one intrinsic characteristic of the object; autonomously identifying, by the adaptive narration presentation circuit, at least one aspect of the narrative presentation associated with the identified object; and modifying, by the adaptive narration presentation circuit, the at least one aspect of the narrative presentation based at least in part on the identified object. 17. The method of claim 12 , further comprising: identifying, by the adaptive narrative presentation circuit, a number of permissible aspect changes in the narrative presentation upon identification of the object; and autonomously selecting, by the adaptive narrative presentation circuit, one of the number of permissible aspect changes in the narrative presentation based at least in part on the at least one aspect of the narrative presentation associated with the identified object.

1. A method for use with a multimodal computing device capable of displaying visual messages comprising the steps of: providing a multimodal interface that includes an audio interface and a visual interface; sampling for a background noise to produce a sampled noise level; comparing the sampled noise level with a first predetermined noise threshold; in response to determining that the sampled noise level is above the first predetermined noise threshold, enabling interaction with the user via the visual interface by providing at least one visual prompt for user input; comparing the sampled noise level with a second predetermined noise threshold; and in response to determining that the sampled noise level is below the second predetermined noise threshold: disabling interaction with the user via the audio interface; enabling interaction with the user via the visual interface; determining whether earphones are connected to the multimodal computing device; and when it is determined that earphones are connected to the multimodal computing device, re-enabling interaction with the user via the audio interface.

1. A method for use with a multimodal computing device capable of displaying visual messages comprising the steps of: providing a multimodal interface that includes an audio interface and a visual interface; sampling for a background noise to produce a sampled noise level; comparing the sampled noise level with a first predetermined noise threshold; in response to determining that the sampled noise level is above the first predetermined noise threshold, enabling interaction with the user via the visual interface by providing at least one visual prompt for user input; comparing the sampled noise level with a second predetermined noise threshold; and in response to determining that the sampled noise level is below the second predetermined noise threshold: disabling interaction with the user via the audio interface; enabling interaction with the user via the visual interface; determining whether earphones are connected to the multimodal computing device; and when it is determined that earphones are connected to the multimodal computing device, re-enabling interaction with the user via the audio interface. 4. The method of claim 1 , further comprising the steps of: ascertaining an acoustic characteristic of an environment in which said multimodal interface is presented; and, responsive to said ascertaining step, determining whether to audibly present at least one of said messages.

25. The computer-implemented method of claim 21 , comprising: employing the identity and version level of at least the database routine of the specified source device to retrieve indications of relative preference ratings for each language of the first set of languages from an instructions database; and determining a default selection of a language from among the first set of languages in which to generate the instructions to perform each subtask of a first set of subtasks based on the relative preference ratings.

25. The computer-implemented method of claim 21 , comprising: employing the identity and version level of at least the database routine of the specified source device to retrieve indications of relative preference ratings for each language of the first set of languages from an instructions database; and determining a default selection of a language from among the first set of languages in which to generate the instructions to perform each subtask of a first set of subtasks based on the relative preference ratings. 26. The computer-implemented method of claim 25 , comprising employing the identity and version level of an add-on routine that augments the first set of languages able to be interpreted by the database routine of the specified source device with a further language to retrieve an indication of a relative preference rating for the further language from the instructions database prior to determining the default selection of a language.

1. A database management system comprising: a relational data store configured to store fact data; a non-relational data store configured to store aggregated fact data; a communication interface operably connected between the relational data store and the non-relational data store for the communication of fact data from the relational data store to the non-relational data store and for the communication of aggregated fact data from the non-relational data store to the relational data store; and a computer system comprising computer hardware, the computer system programmed to implement: a query servicing mechanism configured to service one or more natural language queries from a user, the query servicing mechanism comprising: a query processing mechanism configured to process a given natural language query using operations to: determine whether servicing the given natural language query needs data stored in the relational data store or in the non-relational data store; upon determining that servicing the given natural language query needs data stored in the relational data store, automatically route the given natural language query to the relational data store, so that data is accessed from the relational data store and forwarded to the query processing mechanism for use in servicing the given natural language query, in a manner transparent to the user; and wherein upon determining that servicing the given natural language query needs data stored in the non-relational data store, automatically route the given natural language query to the non-relational data store, so that data can be accessed and forwarded to the query processing mechanism for use in servicing the given natural language query, in a manner transparent to the user.

1. A database management system comprising: a relational data store configured to store fact data; a non-relational data store configured to store aggregated fact data; a communication interface operably connected between the relational data store and the non-relational data store for the communication of fact data from the relational data store to the non-relational data store and for the communication of aggregated fact data from the non-relational data store to the relational data store; and a computer system comprising computer hardware, the computer system programmed to implement: a query servicing mechanism configured to service one or more natural language queries from a user, the query servicing mechanism comprising: a query processing mechanism configured to process a given natural language query using operations to: determine whether servicing the given natural language query needs data stored in the relational data store or in the non-relational data store; upon determining that servicing the given natural language query needs data stored in the relational data store, automatically route the given natural language query to the relational data store, so that data is accessed from the relational data store and forwarded to the query processing mechanism for use in servicing the given natural language query, in a manner transparent to the user; and wherein upon determining that servicing the given natural language query needs data stored in the non-relational data store, automatically route the given natural language query to the non-relational data store, so that data can be accessed and forwarded to the query processing mechanism for use in servicing the given natural language query, in a manner transparent to the user. 4. The database management system of claim 1 , wherein the non-relational data store comprises a multi-dimensional data store.

17. The method of claim 1 further comprising displaying with the at least one search result a completed status of the search and a total count of matches therefor.

17. The method of claim 1 further comprising displaying with the at least one search result a completed status of the search and a total count of matches therefor. 18. The method of claim 17 further comprising for each of the different applications of the search results screen, displaying a count of matches for a corresponding one of the different applications.

2. The method of claim 1 , wherein each semantic equivalence is associated with the identifier.

2. The method of claim 1 , wherein each semantic equivalence is associated with the identifier. 3. The method of claim 2 , wherein the identifier is associated with computer code parsing the information gathered by each heterogeneous information source.

1. A method executed by a semantic reasoner in a computer network, comprising: generating a fully populated semantics model of the computer network from network data according to a base network ontology of the computer network, wherein the semantics model comprises a representation of the computer network in a framework of semantically related terms comprising properties of network features of components of the computer network; automatically mapping the fully populated semantics model to a network knowledge base; feeding contents of the network knowledge base to a reasoning engine; and controlling and managing the network using the reasoning engine, wherein generating the fully populated semantics model of the network comprises: receiving the network data from the network; parsing the network data; loading the parsed network data into in-memory data structures; accessing a manifest specifying binding between a network data definition format and ontology components of the base network ontology; identifying ontology components associated with the network data based on the manifest; populating the identified ontology components with individuals and properties from the corresponding data structures, wherein the network data definition format comprises a selection from a group consisting of Structure of Management Information (SMI), YANG, and Extensible Markup Language ( XML); and wherein the manifest comprises: mapping of at least one of SMI managed object, YANG leaf and XML element to a Web Ontology Language Description Logics (OWL-DL) class to which an individual belongs; mapping of at least one of SMI object hierarchy, YANG leafref and XML element hierarchy to an OWL-DL object property asserted over a pair of individuals; mapping of a value of at least one of SMI object, YANG leaf and XML element to an OWL-DL individual of a corresponding class; and asserting a data property on an individual.

1. A method executed by a semantic reasoner in a computer network, comprising: generating a fully populated semantics model of the computer network from network data according to a base network ontology of the computer network, wherein the semantics model comprises a representation of the computer network in a framework of semantically related terms comprising properties of network features of components of the computer network; automatically mapping the fully populated semantics model to a network knowledge base; feeding contents of the network knowledge base to a reasoning engine; and controlling and managing the network using the reasoning engine, wherein generating the fully populated semantics model of the network comprises: receiving the network data from the network; parsing the network data; loading the parsed network data into in-memory data structures; accessing a manifest specifying binding between a network data definition format and ontology components of the base network ontology; identifying ontology components associated with the network data based on the manifest; populating the identified ontology components with individuals and properties from the corresponding data structures, wherein the network data definition format comprises a selection from a group consisting of Structure of Management Information (SMI), YANG, and Extensible Markup Language ( XML); and wherein the manifest comprises: mapping of at least one of SMI managed object, YANG leaf and XML element to a Web Ontology Language Description Logics (OWL-DL) class to which an individual belongs; mapping of at least one of SMI object hierarchy, YANG leafref and XML element hierarchy to an OWL-DL object property asserted over a pair of individuals; mapping of a value of at least one of SMI object, YANG leaf and XML element to an OWL-DL individual of a corresponding class; and asserting a data property on an individual. 6. The method of claim 1 , wherein controlling and managing the network comprises: detecting inconsistency in network data based on rules specified in the base network ontology, wherein an appropriate action is triggered upon detecting the inconsistency; inferring logical consequences based on a set of asserted facts, wherein another appropriate action is triggered when an error is inferred; and verifying satisfiability of a concept for service composition and resource identification, wherein a report on degree of deviation between a request and current network state is generated if the concept's satisfiability is not verified.

42. A graphical user interface to be rendered on a computing device, comprising: a first area to display an image that illustrates at least one item within an electronic catalog and having an associated page, wherein an area of the image that approximately frames the illustrated item is associated, by a user of the computing device, with a hyperlink to the associated page; and a second area to enable the user of the computing device to annotate the displayed image.

42. A graphical user interface to be rendered on a computing device, comprising: a first area to display an image that illustrates at least one item within an electronic catalog and having an associated page, wherein an area of the image that approximately frames the illustrated item is associated, by a user of the computing device, with a hyperlink to the associated page; and a second area to enable the user of the computing device to annotate the displayed image. 51. A graphical user interface as recited in claim 42 , further comprising a third area to display a pop-up box in response to a cursor hovering over the illustrated item, the pop-up box containing a comment on the item provided by the user or a user of another computing device.

1. A data process unit comprising: an acoustic space storing unit for storing an acoustic space composed of a plurality of first pattern models, which are generated from first speech data of a plurality of speakers, and each of which has first 4-dimensional or higher dimensional feature data; a speech data acquiring unit for acquiring second speech data of a target speaker; a position calculating unit for: converting the second speech data acquired by the speech data acquiring unit into second 4-dimensional or higher dimensional feature data; generating a second pattern model to correspond to the second speech data based on the second 4-dimensional or higher dimensional feature data; calculating a mathematical distance between the second pattern model and the first pattern models based on the second 4-dimensional or higher dimensional feature data and the first 4-dimensional or higher dimensional feature data; and calculating a position of the second speech data in the acoustic space based on the mathematical distance; a positional relationship information display unit for displaying information representing a positional relationship between the second speech data and the first pattern models in the acoustic space, on a two-dimensional plane or in a three-dimensional space with a relationship of the mathematical distance being maintained, based on the position of the second speech data; a speech data evaluating unit for evaluating a value of the second speech data as a higher value, as the number of first pattern models existing within a predetermined distance from the position of the second speech data unit becomes smaller; and an evaluation result display unit for displaying an evaluation result evaluated by the speech data evaluating unit.

1. A data process unit comprising: an acoustic space storing unit for storing an acoustic space composed of a plurality of first pattern models, which are generated from first speech data of a plurality of speakers, and each of which has first 4-dimensional or higher dimensional feature data; a speech data acquiring unit for acquiring second speech data of a target speaker; a position calculating unit for: converting the second speech data acquired by the speech data acquiring unit into second 4-dimensional or higher dimensional feature data; generating a second pattern model to correspond to the second speech data based on the second 4-dimensional or higher dimensional feature data; calculating a mathematical distance between the second pattern model and the first pattern models based on the second 4-dimensional or higher dimensional feature data and the first 4-dimensional or higher dimensional feature data; and calculating a position of the second speech data in the acoustic space based on the mathematical distance; a positional relationship information display unit for displaying information representing a positional relationship between the second speech data and the first pattern models in the acoustic space, on a two-dimensional plane or in a three-dimensional space with a relationship of the mathematical distance being maintained, based on the position of the second speech data; a speech data evaluating unit for evaluating a value of the second speech data as a higher value, as the number of first pattern models existing within a predetermined distance from the position of the second speech data unit becomes smaller; and an evaluation result display unit for displaying an evaluation result evaluated by the speech data evaluating unit. 10. The data process unit according to claim 1 , wherein the second pattern model and the first pattern models each have the first 4-dimensional or higher dimensional feature, and the mathematical distance is calculated based on the second 4-dimensional or higher dimensional feature and the first 4-dimensional or higher dimensional feature, wherein the second pattern model and the first pattern models are generated by using Hidden Markov Models (HMM), and wherein the mathematical distance is calculated according to Euclidean distance determined based on a mean vector normalized by a product of standard deviations of normal distributions between the second pattern model and the first pattern models.

19. A computer system method for matching an utterance of a user to a template, the computer system including a processor, an input device, a memory, a database and a program including instructions, wherein the program resides in the memory and the processor configured to execute the program including the instructions comprising: receiving an utterance by the input device; entering the utterance into the memory; accessing by the processor a set of template hierarchies from the database, wherein the set of template hierarchies includes at least one template; performing a matching algorithm instructing the processor to compare words of the utterance to terms of the template hierarchy to determine a match between the words and terms, the matching algorithm further instructing the processor to perform the steps of: calculating a score based on the match between the words of the utterance to terms of the template hierarchy; populating the at least one template with data elements of the database that correspond to the terms of the template hierarchy to obtain a populated template; computing a total score based on the match between all words of the utterance to the populated template; selecting the at least one template with a high total score; establishing there is no template with the high total score recording by the processor the utterance as a sequence of words; and communicating the sequence of words to the user.

19. A computer system method for matching an utterance of a user to a template, the computer system including a processor, an input device, a memory, a database and a program including instructions, wherein the program resides in the memory and the processor configured to execute the program including the instructions comprising: receiving an utterance by the input device; entering the utterance into the memory; accessing by the processor a set of template hierarchies from the database, wherein the set of template hierarchies includes at least one template; performing a matching algorithm instructing the processor to compare words of the utterance to terms of the template hierarchy to determine a match between the words and terms, the matching algorithm further instructing the processor to perform the steps of: calculating a score based on the match between the words of the utterance to terms of the template hierarchy; populating the at least one template with data elements of the database that correspond to the terms of the template hierarchy to obtain a populated template; computing a total score based on the match between all words of the utterance to the populated template; selecting the at least one template with a high total score; establishing there is no template with the high total score recording by the processor the utterance as a sequence of words; and communicating the sequence of words to the user. 20. The computer system method of claim 19 wherein said communicating step further comprises the step of presenting visually the sequence of words.

2. The method of claim 1 , wherein: the capturing a first audio signal includes capturing the first audio signal using a microphone; and the detecting that a first utterance has been spoken by the person is performed by a mobile device, the detecting that a first utterance has been spoken by the person includes applying speech recognition techniques to the captured first audio signal; and the displaying a sequence of images of the virtual object includes displaying the sequence of images using the mobile device.

2. The method of claim 1 , wherein: the capturing a first audio signal includes capturing the first audio signal using a microphone; and the detecting that a first utterance has been spoken by the person is performed by a mobile device, the detecting that a first utterance has been spoken by the person includes applying speech recognition techniques to the captured first audio signal; and the displaying a sequence of images of the virtual object includes displaying the sequence of images using the mobile device. 12. The method of claim 2 , wherein: the mobile device comprises a see-through head-mounted display device worn by a first person different from the person.

1. A method performed by one or more computers, the method comprising: receiving a first search query from a user device, wherein the first search query has been determined to relate to a first entity of a first entity type, and wherein one or more entities of a second entity type have a predetermined relationship with the first entity; receiving search results for the first search query provided by a search engine, wherein each of the search results identifies a respective resource; determining, from the search results, whether or not to include information identifying the one or more entities of the second entity type as part of a response to the first search query, comprising: determining that a count of search results identifying a resource containing a reference to the first entity satisfies a first threshold value, determining that a count of search results identifying a resource having the second entity type as a relevant entity type satisfies a second threshold value, and determining to include information identifying the one or more entities of the second entity type as part of the response to the first search query based on determining that the count of search results identifying the resource containing the reference to the first entity satisfies the first threshold value and determining that the count of search results identifying the resource having the second entity type as a relevant entity type satisfies the second threshold value; and transmitting information identifying the one or more entities of the second entity type to the user device as part of the response to the first search query.

1. A method performed by one or more computers, the method comprising: receiving a first search query from a user device, wherein the first search query has been determined to relate to a first entity of a first entity type, and wherein one or more entities of a second entity type have a predetermined relationship with the first entity; receiving search results for the first search query provided by a search engine, wherein each of the search results identifies a respective resource; determining, from the search results, whether or not to include information identifying the one or more entities of the second entity type as part of a response to the first search query, comprising: determining that a count of search results identifying a resource containing a reference to the first entity satisfies a first threshold value, determining that a count of search results identifying a resource having the second entity type as a relevant entity type satisfies a second threshold value, and determining to include information identifying the one or more entities of the second entity type as part of the response to the first search query based on determining that the count of search results identifying the resource containing the reference to the first entity satisfies the first threshold value and determining that the count of search results identifying the resource having the second entity type as a relevant entity type satisfies the second threshold value; and transmitting information identifying the one or more entities of the second entity type to the user device as part of the response to the first search query. 7. The method of claim 1 , wherein determining whether or not to include information identifying the one or more entities of the second entity type as part of a response to the first search query further comprises: obtaining data that classifies the search query as not being any of a query that is pornographic, a query that is navigational to a particular resource, a local query, or a query that is seeking a particular item of information; and determining to include information identifying the one or more entities of the second entity type as part of a response to the first search query in response to determining that the search query is classified as not being any of a query that is pornographic, a query that is navigational to a particular resource, a local query, or a query that is seeking a particular item of information.

9. The method of claim 8 , wherein each version of the piece of localized content can be retrieved to be displayed at a corresponding location of the web page in place of other localized content associated with the same location.

9. The method of claim 8 , wherein each version of the piece of localized content can be retrieved to be displayed at a corresponding location of the web page in place of other localized content associated with the same location. 10. The method of claim 9 , wherein a version selected is determined based on one of a round robin approach, random selection approach, and a specified selection algorithm designed in accordance with the needs of an application.

2. The method of claim 1 , further comprising: accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising: a first node corresponding to the first user; and a plurality of second nodes corresponding to a plurality of objects associated with the online social network, respectively.

2. The method of claim 1 , further comprising: accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising: a first node corresponding to the first user; and a plurality of second nodes corresponding to a plurality of objects associated with the online social network, respectively. 3. The method of claim 2 , wherein the structured query comprises references to one or more selected nodes from the plurality of nodes and one or more selected edges from the plurality of edges.

28. A non-transitory computer readable storage medium storing software that, upon execution by a processor, detects malware within a Portable Document Format (PDF) document, the non-transitory computer readable storage medium comprising: a parser that, when executed by the processor, examines one or more portions of the PDF document to determine if one or more suspicious characteristics indicative of malicious network content are included in the one or more examined portions of the PDF document, wherein the one or more examined portions of the PDF document comprise less than an entirety of the PDF document, and one or more virtual machines to receive the PDF document in response to the one or more examined portions of the PDF document being determined to include one or more suspicious characteristics indicative of malicious network content, the one or more virtual machines to process at least the one or more examined portions of the PDF document so as to determine whether the PDF document includes malicious network content.

28. A non-transitory computer readable storage medium storing software that, upon execution by a processor, detects malware within a Portable Document Format (PDF) document, the non-transitory computer readable storage medium comprising: a parser that, when executed by the processor, examines one or more portions of the PDF document to determine if one or more suspicious characteristics indicative of malicious network content are included in the one or more examined portions of the PDF document, wherein the one or more examined portions of the PDF document comprise less than an entirety of the PDF document, and one or more virtual machines to receive the PDF document in response to the one or more examined portions of the PDF document being determined to include one or more suspicious characteristics indicative of malicious network content, the one or more virtual machines to process at least the one or more examined portions of the PDF document so as to determine whether the PDF document includes malicious network content. 35. The non-transitory computer readable storage medium of claim 28 , wherein the medium further comprises a module that, when executed by the processor, prevents the delivery of the PDF document verified to include malicious network content to a web browser application from which the delivery was requested.

6. A computer readable storage medium containing a program which, when executed, performs an operation for searching a plurality of documents which include references to chemical compounds, wherein the references to chemical compounds express the chemical compounds using a plurality of different formats, comprising: receiving the plurality of documents; receiving criteria specifying desired chemical characteristics; generating at least one regular expression based on the received criteria; evaluating chemical compounds referenced in the plurality of documents against the at least one regular expression to identify one or more of the plurality of documents that reference a chemical compound satisfying the received criteria.

6. A computer readable storage medium containing a program which, when executed, performs an operation for searching a plurality of documents which include references to chemical compounds, wherein the references to chemical compounds express the chemical compounds using a plurality of different formats, comprising: receiving the plurality of documents; receiving criteria specifying desired chemical characteristics; generating at least one regular expression based on the received criteria; evaluating chemical compounds referenced in the plurality of documents against the at least one regular expression to identify one or more of the plurality of documents that reference a chemical compound satisfying the received criteria. 9. The computer readable storage medium of claim 6 , wherein the standard notation is the simplified molecular input line entry specification (SMILES) notation and wherein each of the plurality of documents is selected from at least a chemical patent, a chemical research paper, and a chemical lab experiment document, wherein the plurality of different formats includes a molecular formula, a structural formula, an empirical formula, an industrial name, a trade name, and a household name; wherein the references to chemical compounds include a first chemical compound expressed using the molecular formula, a second chemical compound expressed using the structural formula, a third chemical compound expressed using the empirical formula, a fourth chemical compound expressed in terms of the industrial name, a fifth chemical compound expressed in terms of the trade name, and a sixth chemical compound expressed in terms of the household name.

12. A computer-implemented method comprising: locating a digital image having filterable content; calculating an image index file for the digital image; indexing the image index file for subsequent generating similarity scores representative of a variable degree of non-matching of image files and forming plurality of clusters; and calculating a monosemantic descriptor for the digital image and indexing the monosemantic descriptor with the index image file, wherein calculating the monosemantic description comprises: dividing the digital image into a plurality of cells; calculating an image descriptor for each of the plurality of cells; and aligning the image descriptor for each of the plurality of cells to calculate the monosemantic descriptor.

12. A computer-implemented method comprising: locating a digital image having filterable content; calculating an image index file for the digital image; indexing the image index file for subsequent generating similarity scores representative of a variable degree of non-matching of image files and forming plurality of clusters; and calculating a monosemantic descriptor for the digital image and indexing the monosemantic descriptor with the index image file, wherein calculating the monosemantic description comprises: dividing the digital image into a plurality of cells; calculating an image descriptor for each of the plurality of cells; and aligning the image descriptor for each of the plurality of cells to calculate the monosemantic descriptor. 14. The computer-implemented method of claim 12 wherein locating the digital image having filterable content comprises analyzing the metadata of the digital image.

1. A social media content access system, comprising: a memory; a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions for: identifying a request from a server, to access user social media content; obtaining, at the server, from a user, user authorization credentials to access user social media content; sending an access request with the obtained user authorization credentials to a social media platform; receiving an indication of a user experienced media asset indicating the user has been exposed to the media asset; receiving social media content data from the social media platform; determining a data format type of the received social media content data; tagging the received social media content data based on the data format type according to a progressive taxonomy mechanism of hierarchical category tags; receiving a social media analytics request related to consumer impression for the user experienced media asset; selecting a set of key terms descriptive of characteristics of the user experienced media asset; querying the tagged social media content data based on the selected key terms related to the user experienced media asset; determining the queried tagged social media content data is related to the user experienced media asset; and determining a consumer impression level for the user experienced media asset based on the queried tagged social media content data from query results.

1. A social media content access system, comprising: a memory; a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions for: identifying a request from a server, to access user social media content; obtaining, at the server, from a user, user authorization credentials to access user social media content; sending an access request with the obtained user authorization credentials to a social media platform; receiving an indication of a user experienced media asset indicating the user has been exposed to the media asset; receiving social media content data from the social media platform; determining a data format type of the received social media content data; tagging the received social media content data based on the data format type according to a progressive taxonomy mechanism of hierarchical category tags; receiving a social media analytics request related to consumer impression for the user experienced media asset; selecting a set of key terms descriptive of characteristics of the user experienced media asset; querying the tagged social media content data based on the selected key terms related to the user experienced media asset; determining the queried tagged social media content data is related to the user experienced media asset; and determining a consumer impression level for the user experienced media asset based on the queried tagged social media content data from query results. 16. The system of claim 1 , wherein the processor further issues instructions for: querying the social media content based on a key term; and tagging the social media content with the key term when the query finds such key term.

1. A method programmed in a non-transitory memory of a first device, the method comprising: automatically monitoring broadcast information; automatically detecting a trigger within the broadcast information; converting at least a portion of the broadcast information related to the trigger into searchable information; in response to automatically detecting the trigger, automatically fact checking the broadcast information related to the trigger by comparing the searchable information with information from one or more sources; automatically causing an indication of a status of the broadcast information to be displayed on a second device, the indication based on a result of the comparison of the searchable information with the information from the one or more sources.

1. A method programmed in a non-transitory memory of a first device, the method comprising: automatically monitoring broadcast information; automatically detecting a trigger within the broadcast information; converting at least a portion of the broadcast information related to the trigger into searchable information; in response to automatically detecting the trigger, automatically fact checking the broadcast information related to the trigger by comparing the searchable information with information from one or more sources; automatically causing an indication of a status of the broadcast information to be displayed on a second device, the indication based on a result of the comparison of the searchable information with the information from the one or more sources. 6. The method of claim 1 wherein the trigger comprises a user-specified trigger.

20. A method for producing a unified semantic knowledge model from a plurality of data sources having individual data elements in disparate data formats, the method comprising using a computerized cell graph to: progressively building the unified semantic knowledge model from the plurality of data sources using the computerized cell graph comprising a plurality of importer cells, a plurality of data element repositories, and the plurality of processing cells arranged to perform the steps of: translating an individual data element retrieved from data sources of the plurality of data sources into a common semantic information representation by a plurality of computerized importer cells; storing translated individual data elements received from importer cells of the plurality of importer cells in the common semantic information representation in a plurality of data repositories; and enhancing an individual data element retrieved from data repositories of the plurality of data repositories in a plurality of computerized processing cells and storing the enhanced retrieved data in the common semantic information representation in a data repository of the plurality of data repositories.

20. A method for producing a unified semantic knowledge model from a plurality of data sources having individual data elements in disparate data formats, the method comprising using a computerized cell graph to: progressively building the unified semantic knowledge model from the plurality of data sources using the computerized cell graph comprising a plurality of importer cells, a plurality of data element repositories, and the plurality of processing cells arranged to perform the steps of: translating an individual data element retrieved from data sources of the plurality of data sources into a common semantic information representation by a plurality of computerized importer cells; storing translated individual data elements received from importer cells of the plurality of importer cells in the common semantic information representation in a plurality of data repositories; and enhancing an individual data element retrieved from data repositories of the plurality of data repositories in a plurality of computerized processing cells and storing the enhanced retrieved data in the common semantic information representation in a data repository of the plurality of data repositories. 23. The method of claim 20 wherein at least some of the plurality of processing cells are located on different computers, the method further comprising communicating among the plurality of processing cells.

1. An apparatus for differentiating between vowels and consonants in a spoken sound, the apparatus comprising: a microphone configured to receive the spoken sound and generate an output signal, the microphone including: a set of carbon nanotube bundles configured to receive the spoken sound, wherein the set of carbon nanotube bundles includes carbon nanotubes of varying lengths and thicknesses, wherein the carbon nanotube bundles in the set of carbon nanotube bundles are arranged parallel to each other and wherein the set of carbon nanotube bundles provide an output for differentiating the spoken sound as vowels and consonants; an electrode block configured to measure variation in a set of characteristic parameters of the set of carbon nanotube bundles caused by the received spoken sound and generate the output signal based on the measured variation in the set of characteristic parameters, wherein the electrode block includes a set of conducting plates and an electrode electrically connected to the set of conducting plates, and wherein the set of carbon nanotube bundles is located adjacent to the electrode block in a longitudinal direction.

1. An apparatus for differentiating between vowels and consonants in a spoken sound, the apparatus comprising: a microphone configured to receive the spoken sound and generate an output signal, the microphone including: a set of carbon nanotube bundles configured to receive the spoken sound, wherein the set of carbon nanotube bundles includes carbon nanotubes of varying lengths and thicknesses, wherein the carbon nanotube bundles in the set of carbon nanotube bundles are arranged parallel to each other and wherein the set of carbon nanotube bundles provide an output for differentiating the spoken sound as vowels and consonants; an electrode block configured to measure variation in a set of characteristic parameters of the set of carbon nanotube bundles caused by the received spoken sound and generate the output signal based on the measured variation in the set of characteristic parameters, wherein the electrode block includes a set of conducting plates and an electrode electrically connected to the set of conducting plates, and wherein the set of carbon nanotube bundles is located adjacent to the electrode block in a longitudinal direction. 5. The apparatus of claim 1 , wherein: the set of carbon nanotube bundles are reactive to a variation in a set of characteristics of the spoken sound; and the set of characteristics is selected from the group consisting of: (i) air molecule number density in the spoken sound; (ii) velocity of air molecules in the spoken sound; (iii) mass of air molecules in the spoken sound; and (iv) randomness in motion direction of air molecules in the spoken sound.

8. A system for editing graphical content, comprising: at least one processor; and at least one memory, communicatively coupled to the at least one processor and containing instructions that, when executed by the at least one processor, perform a method comprising: receiving content in a content entry area, wherein the content includes a plurality of portions of the content; receiving one or more formats to the content, wherein the one or more formats comprise at least one of: a carriage return, an indent, a tab, a bullet, a text formatting, and a line spacing; in response to receiving the one or more formats, determining relationships between the plurality of portions of the content based on the one or more formats; displaying the graphical content in a drawing canvas area, the displaying comprising: combining a first portion of content with a first graphical definition selected from a gallery area to display a first shape, the first shape at least substantially encapsulating the first portion of content; combining a second portion of content with the first graphical definition to display a second shape, the second shape at least substantially encapsulating the second portion of content; displaying a graphical line between the first shape and the second shape, the graphical line representing a relationship between the first portion of content and the second portion of content; receiving one or more changes to the graphical content in the drawing canvas area, wherein the one or more changes comprise modifying at least one of: the first shape and the second shape; creating corresponding modifications to at least one of: the first portion of content and the second portion of content in the content entry area; and displaying the at least one modified first shape or second shape of the graphical content in the drawing canvas area and the at least one correspondingly modified first portion of content or second portion of content in the content entry area.

8. A system for editing graphical content, comprising: at least one processor; and at least one memory, communicatively coupled to the at least one processor and containing instructions that, when executed by the at least one processor, perform a method comprising: receiving content in a content entry area, wherein the content includes a plurality of portions of the content; receiving one or more formats to the content, wherein the one or more formats comprise at least one of: a carriage return, an indent, a tab, a bullet, a text formatting, and a line spacing; in response to receiving the one or more formats, determining relationships between the plurality of portions of the content based on the one or more formats; displaying the graphical content in a drawing canvas area, the displaying comprising: combining a first portion of content with a first graphical definition selected from a gallery area to display a first shape, the first shape at least substantially encapsulating the first portion of content; combining a second portion of content with the first graphical definition to display a second shape, the second shape at least substantially encapsulating the second portion of content; displaying a graphical line between the first shape and the second shape, the graphical line representing a relationship between the first portion of content and the second portion of content; receiving one or more changes to the graphical content in the drawing canvas area, wherein the one or more changes comprise modifying at least one of: the first shape and the second shape; creating corresponding modifications to at least one of: the first portion of content and the second portion of content in the content entry area; and displaying the at least one modified first shape or second shape of the graphical content in the drawing canvas area and the at least one correspondingly modified first portion of content or second portion of content in the content entry area. 9. The system according to claim 8 , wherein the one or more changes are to the first portion of content or the second portion of content in the content entry area.

1. A method of dynamically resizing a text area in which text is displayed on a display device, comprising: responsive to detecting head movement by a user viewing the displayed text, determining a position where the user focused in the displayed text prior to detecting the head movement and dynamically resizing the text area to use the determined position as a new width for the text area, wherein: detecting the head movement further comprises: tracking positions of the user's head as the user views the displayed text; and comparing the tracked positions of the user's head to determine whether the user's head has moved; and determining the position where the user focused in the displayed text further comprises: tracking positions of the user's eye focus as the user views the displayed text, each tracked position of the user's eye focus associated with one of the tracked positions of the user's head; and responsive to determining that the user's head has moved, determining a particular one of the tracked positions of the user's head which immediately precedes the detected head movement and using, as the determined position where the user focused in the displayed text, the tracked position of the user's eye focus which is associated with the particular one of the tracked positions of the user's head.

1. A method of dynamically resizing a text area in which text is displayed on a display device, comprising: responsive to detecting head movement by a user viewing the displayed text, determining a position where the user focused in the displayed text prior to detecting the head movement and dynamically resizing the text area to use the determined position as a new width for the text area, wherein: detecting the head movement further comprises: tracking positions of the user's head as the user views the displayed text; and comparing the tracked positions of the user's head to determine whether the user's head has moved; and determining the position where the user focused in the displayed text further comprises: tracking positions of the user's eye focus as the user views the displayed text, each tracked position of the user's eye focus associated with one of the tracked positions of the user's head; and responsive to determining that the user's head has moved, determining a particular one of the tracked positions of the user's head which immediately precedes the detected head movement and using, as the determined position where the user focused in the displayed text, the tracked position of the user's eye focus which is associated with the particular one of the tracked positions of the user's head. 8. The method according to claim 1 , wherein dynamically resizing the text area to use the determined position as a new width for the text area comprises executing at least one script command to set the position as the new width.

36. The machine-readable medium of claim 32 , wherein the road attribute is road safety.

36. The machine-readable medium of claim 32 , wherein the road attribute is road safety. 37. The machine-readable medium of claim 36 , wherein at least one of the plurality of conditions is from a group consisting of a level of user hurriedness, an environmental condition, and a level of traffic.

1. An apparatus for at least one security zone said apparatus comprising: a plurality of optical input devices; at least one computer, said at least one computer being in communication with said plurality of optical input devices, said at least one computer compiling or said at least one computer being in communication with at least one second computer which compiles an evolving database, said evolving database comprising information representative of patterns of observed data for said at least one security zone; and comparison software in communication with said evolving database, wherein said comparison software compares observed data to the patterns of observed data; wherein said at least one computer or said at least one second computer is constructed and arranged to process information from said evolving database with said comparison software for issuance of at least one investigation signal.

1. An apparatus for at least one security zone said apparatus comprising: a plurality of optical input devices; at least one computer, said at least one computer being in communication with said plurality of optical input devices, said at least one computer compiling or said at least one computer being in communication with at least one second computer which compiles an evolving database, said evolving database comprising information representative of patterns of observed data for said at least one security zone; and comparison software in communication with said evolving database, wherein said comparison software compares observed data to the patterns of observed data; wherein said at least one computer or said at least one second computer is constructed and arranged to process information from said evolving database with said comparison software for issuance of at least one investigation signal. 2. The apparatus of claim 1 , further comprising sensitivity software in communication with said evolving database.

16. The system for duplicate text recognition of claim 15 further comprising: an assignment unit connected with the search engine and configured for assigning a unique content identification (ID) to the electronic text; and a storing module connected with the search engine and configured for determining a group identification (ID) for the string group corresponding to the electronic text and for storing the group ID along with the string group in the search engine; wherein: the storing module is configured for determining whether a comparison string group that shares the predefined similarity with the string group corresponding to the electronic text that reaches the first threshold exists in the search engine, and determining the group ID for the string group corresponding to the electronic text accordingly.

16. The system for duplicate text recognition of claim 15 further comprising: an assignment unit connected with the search engine and configured for assigning a unique content identification (ID) to the electronic text; and a storing module connected with the search engine and configured for determining a group identification (ID) for the string group corresponding to the electronic text and for storing the group ID along with the string group in the search engine; wherein: the storing module is configured for determining whether a comparison string group that shares the predefined similarity with the string group corresponding to the electronic text that reaches the first threshold exists in the search engine, and determining the group ID for the string group corresponding to the electronic text accordingly. 17. The system for duplicate text recognition of claim 16 , wherein the storing module comprises: a first storing unit connected with the search engine and configured for determining the group ID for the string group corresponding to the electronic text to be the content ID of the electronic text if the comparison string group does not exist in the search engine; and a second storing unit connected with the search engine and configured for determining the group ID for the string group corresponding to the electronic text to be the group ID of the string group in search engine that has the maximum similarity with the string group corresponding to the electronic text if the comparison string group exists in the search engine.

7. A method of providing a user interface executed by an electronic device, the method comprising: obtaining a message via a messaging program; identifying a first token including a first plurality of alphanumeric characters from the obtained message based at least on the first plurality of alphanumeric characters being in a defined set of alphanumeric characters; identifying and executing a target function program based at least on the first token; based at least on the identified target function program being a schedule management function program: determining a probability of a second plurality of alphanumeric characters from the obtained message being related to a location, determining whether the determined probability is larger than a reference probability, determining the second plurality of alphanumeric characters as being related to the location and identifying a second token including the second plurality of alphanumeric characters related to the location, based at least on the determined probability being larger than the reference probability, obtaining, based at least on the first token and descriptive data of the obtained message, first input data in a first format for specifying a date and a time, obtaining, based at least on the second token, second input data in a second format for specifying the location, and supplying the first input data and the second input data to the schedule management function program so that the first input data and the second input data are automatically presented in an execution screen of the schedule management function program; and based at least on the identified target function program being a contact management function program: presenting the first token and a name associated with a contact entry in an address book in an execution screen of the contact management program based on the first token corresponding to the contact entry in the address book, and presenting the first token in an execution screen of the contact management function program based on the first token being determined to be added to a new contact entry in the address book, wherein the message is communicated through a communication unit.

7. A method of providing a user interface executed by an electronic device, the method comprising: obtaining a message via a messaging program; identifying a first token including a first plurality of alphanumeric characters from the obtained message based at least on the first plurality of alphanumeric characters being in a defined set of alphanumeric characters; identifying and executing a target function program based at least on the first token; based at least on the identified target function program being a schedule management function program: determining a probability of a second plurality of alphanumeric characters from the obtained message being related to a location, determining whether the determined probability is larger than a reference probability, determining the second plurality of alphanumeric characters as being related to the location and identifying a second token including the second plurality of alphanumeric characters related to the location, based at least on the determined probability being larger than the reference probability, obtaining, based at least on the first token and descriptive data of the obtained message, first input data in a first format for specifying a date and a time, obtaining, based at least on the second token, second input data in a second format for specifying the location, and supplying the first input data and the second input data to the schedule management function program so that the first input data and the second input data are automatically presented in an execution screen of the schedule management function program; and based at least on the identified target function program being a contact management function program: presenting the first token and a name associated with a contact entry in an address book in an execution screen of the contact management program based on the first token corresponding to the contact entry in the address book, and presenting the first token in an execution screen of the contact management function program based on the first token being determined to be added to a new contact entry in the address book, wherein the message is communicated through a communication unit. 24. The method of claim 7 , wherein the obtained message is a message created at the electronic device using the messaging program.

3. The method according to claim 2 , wherein the recommended intervention action comprises a pharmacotherapy regime, the method further comprising: developing an initial list of effective medications on the basis of the condition situs in combination with a demographic/family history dimension; stratify the initial list of effective medications on the basis of sensitivity to causative mechanism; evaluate each medication for contraindications on the basis of co-existing disease, co-existing medications, co-existing allergies, and co-existing diagnostic test results; exclude any medications having said contraindications; and automatically developing a final, optimal list of effective medications.

3. The method according to claim 2 , wherein the recommended intervention action comprises a pharmacotherapy regime, the method further comprising: developing an initial list of effective medications on the basis of the condition situs in combination with a demographic/family history dimension; stratify the initial list of effective medications on the basis of sensitivity to causative mechanism; evaluate each medication for contraindications on the basis of co-existing disease, co-existing medications, co-existing allergies, and co-existing diagnostic test results; exclude any medications having said contraindications; and automatically developing a final, optimal list of effective medications. 4. The method according to claim 3 , wherein each of the clinical decision support dimensions are specific to a particular patient and maintained in a database associated to that patient.

34. The method of claim 20 , further including a personalize engine for performing filtering, composing, and updating functions and wherein the set of functions maintains user profile data structures in said database and matches information files against a user's profile to filter items based on relevance to a given interest.

34. The method of claim 20 , further including a personalize engine for performing filtering, composing, and updating functions and wherein the set of functions maintains user profile data structures in said database and matches information files against a user's profile to filter items based on relevance to a given interest. 35. The method of claim 34 , wherein the user profile is updated based on any of explicit actions by the user, assisted actions arising from analysis, and automatically through machine learning processes.

1. A method implemented in a computer having a processor and memory, the method comprising: identifying first data representing an object-oriented data model, which comprises a plurality of object-oriented data model constructs for modeling object-oriented classes; wherein identifying the first data comprises identifying the first data amongst data representing an object-oriented data model; translating the first data to second data, which represents one or more YANG data model statements, but which is not extensible markup language data and which does not comprise constructs for modeling the object-oriented classes; wherein the one or more YANG data model statements capture relationships between the object-oriented data model constructs; wherein each YANG statement of the one or more YANG data model statements represented by the second data comprises a YANG keyword, which is followed by zero or more arguments, which is followed by either a semicolon or a block of YANG sub-statements enclosed within braces; and storing the second data in one or more non-transitory computer-readable media; wherein storing the second data comprises storing the second data as part of data representing a YANG data model.

1. A method implemented in a computer having a processor and memory, the method comprising: identifying first data representing an object-oriented data model, which comprises a plurality of object-oriented data model constructs for modeling object-oriented classes; wherein identifying the first data comprises identifying the first data amongst data representing an object-oriented data model; translating the first data to second data, which represents one or more YANG data model statements, but which is not extensible markup language data and which does not comprise constructs for modeling the object-oriented classes; wherein the one or more YANG data model statements capture relationships between the object-oriented data model constructs; wherein each YANG statement of the one or more YANG data model statements represented by the second data comprises a YANG keyword, which is followed by zero or more arguments, which is followed by either a semicolon or a block of YANG sub-statements enclosed within braces; and storing the second data in one or more non-transitory computer-readable media; wherein storing the second data comprises storing the second data as part of data representing a YANG data model. 5. The method of claim 1 , wherein an object-oriented data model construct, from the plurality of object-oriented data model constructs, is a particular object-oriented package definition; wherein the one or more YANG data model statements includes a particular YANG module statement; and wherein translating the first data to the second data comprises translating the particular object-oriented package definition to the particular YANG module statement.

10. A system for collecting information about a group of documents, comprising: at least one processor; and memory including instructions that, when executed by the at least one processor, cause the system to: seed the group of documents with one or more seed documents; identify, in at least one seed document, at least one reference to at least one secondary document; if a first test is satisfied, add to the group of documents at least one secondary document obtainable using the identified at least one reference; identify, for at least a portion of the documents in the group of documents, two or more attribute values associated with at least one aspect of the document; and if a second test is satisfied, add at least a portion of the identified attribute values to a set of information associated with the group of documents, the set of information enabling documents in the group of documents to be located based at least in part upon any of the attribute values in the set of information.

10. A system for collecting information about a group of documents, comprising: at least one processor; and memory including instructions that, when executed by the at least one processor, cause the system to: seed the group of documents with one or more seed documents; identify, in at least one seed document, at least one reference to at least one secondary document; if a first test is satisfied, add to the group of documents at least one secondary document obtainable using the identified at least one reference; identify, for at least a portion of the documents in the group of documents, two or more attribute values associated with at least one aspect of the document; and if a second test is satisfied, add at least a portion of the identified attribute values to a set of information associated with the group of documents, the set of information enabling documents in the group of documents to be located based at least in part upon any of the attribute values in the set of information. 11. The system of claim 10 , wherein at least one reference comprises a hyperlink, and at least a portion of the secondary documents added to the group comprise web pages.

74. The computer program product of claim 29 , wherein the computer program product is operable such that the at least subset of the computer-readable rules is identified based on the at least portion of the computer-readable semantic tags of the at least one computer-readable XML-compliant data document.

74. The computer program product of claim 29 , wherein the computer program product is operable such that the at least subset of the computer-readable rules is identified based on the at least portion of the computer-readable semantic tags of the at least one computer-readable XML-compliant data document. 78. The computer program product of claim 74 , wherein the computer program product is configured such that at least a portion of the at least one computer-readable XML-compliant data document is capable of being caused to be displayed via a spreadsheet view.

9. A non-transitory computer-readable medium storing instructions, the instructions comprising: one or more instructions that, when executed by at least one processor, cause the at least one processor to: receive a request to create a function object based on one or more parameters; determine, based on the one or more parameters, a plurality of ordered and hierarchical operations that correspond to the function object; determine, based on the one or more parameters, descriptions corresponding to what is performed by at least one of the plurality of ordered and hierarchical operations; receive a request to describe the function object; and output, based on the request, documentation of the plurality of ordered and hierarchical operations included in the function object, the documentation including the descriptions arranged based on a determined order of the plurality of ordered and hierarchical operations.

9. A non-transitory computer-readable medium storing instructions, the instructions comprising: one or more instructions that, when executed by at least one processor, cause the at least one processor to: receive a request to create a function object based on one or more parameters; determine, based on the one or more parameters, a plurality of ordered and hierarchical operations that correspond to the function object; determine, based on the one or more parameters, descriptions corresponding to what is performed by at least one of the plurality of ordered and hierarchical operations; receive a request to describe the function object; and output, based on the request, documentation of the plurality of ordered and hierarchical operations included in the function object, the documentation including the descriptions arranged based on a determined order of the plurality of ordered and hierarchical operations. 14. The non-transitory computer-readable medium of claim 9 , where the function object relates to color computation.

9. A method of processing natural language in an apparatus, which comprises steps providing in memory associated with said apparatus an experience and knowledge data base which is comprised of directed graphs comprised of nodes with associated clause implying word sense numbers organized into paths of said nodes such that said nodes have access conditions which determine zero or more next said nodes on zero or more said paths that are accessible, utilizing a natural language processor to provide natural language with associated clause implying word sense numbers in memory associated with said apparatus, purpose relation path identification processing with said apparatus to find zero or more said paths from said nodes associated with said clause implying word sense numbers associated with said natural language with reference to said experience and knowledge data base such that said access conditions of said nodes on said found paths are met, providing criteria for selecting said found experience and knowledge paths in memory associated with said apparatus, utilizing said criteria to select one or more of said found paths with said apparatus.

9. A method of processing natural language in an apparatus, which comprises steps providing in memory associated with said apparatus an experience and knowledge data base which is comprised of directed graphs comprised of nodes with associated clause implying word sense numbers organized into paths of said nodes such that said nodes have access conditions which determine zero or more next said nodes on zero or more said paths that are accessible, utilizing a natural language processor to provide natural language with associated clause implying word sense numbers in memory associated with said apparatus, purpose relation path identification processing with said apparatus to find zero or more said paths from said nodes associated with said clause implying word sense numbers associated with said natural language with reference to said experience and knowledge data base such that said access conditions of said nodes on said found paths are met, providing criteria for selecting said found experience and knowledge paths in memory associated with said apparatus, utilizing said criteria to select one or more of said found paths with said apparatus. 10. A method of processing as defined in claim 9 , which comprises steps providing a context data base wherein said context data base contains a plurality of entries which are comprised of one or more of clause implying word sense numbers having associated state representation data including associated experience and knowledge paths, selecting experience and knowledge paths associated with said clause implying word sense numbers associated with said natural language such that said experience and knowledge paths associated with said clause implying word sense numbers associated with said natural language have accessable paths to said experience and knowledge paths associated with said clause implying word sense numbers from said context data base entries.

1. A call processing system comprising: at least one computer processor; and non-transitory memory, which is operably connected to the at least one computer processor, and embodied with a computer program comprising instructions that when executed by the at least one computer processor cause the call processing system to perform operations comprising: receiving a call over a network from a caller directed to a first user device of a user of the call processing system; converting at least a portion of a caller's voice communication associated with the call into a voice communication text; identifying a subset of words in the voice communication text; analyzing at least the content of the identified subset of words of the voice communication text; and promoting to the user of the call processing system, to whom the call was intended, one or more products, services, or products and services via a displayed user interface of an application on a second user device distinct from the first user device to which the received call was directed, based at least in part on the analysis of the content of the identified subset of words of the caller's voice communication text.

1. A call processing system comprising: at least one computer processor; and non-transitory memory, which is operably connected to the at least one computer processor, and embodied with a computer program comprising instructions that when executed by the at least one computer processor cause the call processing system to perform operations comprising: receiving a call over a network from a caller directed to a first user device of a user of the call processing system; converting at least a portion of a caller's voice communication associated with the call into a voice communication text; identifying a subset of words in the voice communication text; analyzing at least the content of the identified subset of words of the voice communication text; and promoting to the user of the call processing system, to whom the call was intended, one or more products, services, or products and services via a displayed user interface of an application on a second user device distinct from the first user device to which the received call was directed, based at least in part on the analysis of the content of the identified subset of words of the caller's voice communication text. 9. The call processing system as defined in claim 1 , the call processing system further configured to perform operations comprising: enhancing search performance at least in part by indexing the identified subset of words of voice communication text.

4. A method of creating a graphical user interface for search results, the method comprising: identifying search results for a received query from potential search results based on content data generated based on analyzing the potential search results, the identified search results including a first identified search result associated with a first link to first content and a second identified search result associated with a second link to second content; accessing characteristic data generated for the first and second identified search results based on analyzing the potential search results; determining, based on the accessed characteristic data corresponding to the first identified search result, a first characteristic of the first identified search result; determining, based on the accessed characteristic data corresponding to the second identified search result, a second characteristic of the second identified search result, the second characteristic of the second identified search result being different than the first characteristic of the first identified search result; determining display information for the identified search results based on the first characteristic of the first identified search result and the second characteristic of the second identified search result; creating a graphical user interface enabling display of the identified search results to the user based on the display information, each of the identified search results displayed with prose and an icon at an end thereof, the prose and icon of each identified search result indicating that the second content accessible through invocation of the second link associated with the second identified search result includes; and selecting an icon that reveals a description of (i) at least one characteristic of a search result, (ii) an explanation of the icon, and (iii) a detailed description of die characteristic and how a determination was made that content for which the icon is displayed has the at least one characteristic represented by the icon.

4. A method of creating a graphical user interface for search results, the method comprising: identifying search results for a received query from potential search results based on content data generated based on analyzing the potential search results, the identified search results including a first identified search result associated with a first link to first content and a second identified search result associated with a second link to second content; accessing characteristic data generated for the first and second identified search results based on analyzing the potential search results; determining, based on the accessed characteristic data corresponding to the first identified search result, a first characteristic of the first identified search result; determining, based on the accessed characteristic data corresponding to the second identified search result, a second characteristic of the second identified search result, the second characteristic of the second identified search result being different than the first characteristic of the first identified search result; determining display information for the identified search results based on the first characteristic of the first identified search result and the second characteristic of the second identified search result; creating a graphical user interface enabling display of the identified search results to the user based on the display information, each of the identified search results displayed with prose and an icon at an end thereof, the prose and icon of each identified search result indicating that the second content accessible through invocation of the second link associated with the second identified search result includes; and selecting an icon that reveals a description of (i) at least one characteristic of a search result, (ii) an explanation of the icon, and (iii) a detailed description of die characteristic and how a determination was made that content for which the icon is displayed has the at least one characteristic represented by the icon. 8. The method of claim 4 wherein: determining, based on the accessed characteristic data corresponding to the first identified search result, the first characteristic of the first identified search result comprises determining, based on the accessed characteristic data corresponding to the first identified search result, that the first content accessible through invocation of the first link associated with the first identified search result is appropriate for a first age group; determining, based on the accessed characteristic data corresponding to the second identified search result, the second characteristic of the second identified search result comprises determining, based on the accessed characteristic data corresponding to the second identified search result, that the second content accessible through invocation of the second link associated with the second identified search result is inappropriate for the first age group; creating the graphical user interface enabling display of the identified search results to the user based on the display information comprises creating a graphical user interface enabling display of the identified search results to the user based on the display information, the graphical user interface providing a perceivable indication, other than the second content, that the second content accessible through invocation of the second link associated with the second identified search result is inappropriate for the first age group, regardless of whether the received query includes user specified criteria concerning whether content is inappropriate, the user specified criteria defines the received query; and the perceivable indication is the prose and the icon.

6. A system for diacritizing a text, the system comprising: a memory for storing a Hidden Makov Model, a text, and at least one diacritical mark of a set of diacritical marks, the text comprising a plurality of characters associated with an Arabic language; a processor coupled to the memory, wherein the processor is configured to: analyze the text to determine whether the text requires at least one diacritical mark of the set of diacritical marks; convert each character to an ASCII code; feed each ASCII code in sequence to the Hidden Markov Model; apply an expectation-maximization process to each ASCII code starting at one end of the sequence; transition from one diacritical mark to another diacritical mark from the set of diacritical marks for each ASCII code; record a probability for each diacritical mark when associated with each current ASCII code; change a state of the Hidden Markov Model based on each probability over regularly spaced periods of time; wherein the Hidden Markov Model transitions from state q i at time t to a state q i at time t+1, where t=1, 2, 3, . . . M; and i, j=1, 2, . . . , N, and where M represents a number of the transitions and N represents a number of the states; wherein a transition probability a ij , representing a probability that diacritical mark q j appears directly after diacritical mark q i , equals an expected number of transitions from state q i to state q j divided by an expected number of transitions from state q i , finalize a diacritical mark having the highest probability for the current ASCII code; process each character in the sequence of the text, wherein the Hidden Markov Model bases the probability at least in part on the probability of a diacritical mark applied on one or more preceding characters of the sequence and on a context of the text for determining the probability of a diacritical mark on a given character; generate a sequence of the diacritical marks corresponding to the sequence of characters; match the sequence of diacritical marks with the text to obtain the diacritized text; and a display to present the diacritized text.

6. A system for diacritizing a text, the system comprising: a memory for storing a Hidden Makov Model, a text, and at least one diacritical mark of a set of diacritical marks, the text comprising a plurality of characters associated with an Arabic language; a processor coupled to the memory, wherein the processor is configured to: analyze the text to determine whether the text requires at least one diacritical mark of the set of diacritical marks; convert each character to an ASCII code; feed each ASCII code in sequence to the Hidden Markov Model; apply an expectation-maximization process to each ASCII code starting at one end of the sequence; transition from one diacritical mark to another diacritical mark from the set of diacritical marks for each ASCII code; record a probability for each diacritical mark when associated with each current ASCII code; change a state of the Hidden Markov Model based on each probability over regularly spaced periods of time; wherein the Hidden Markov Model transitions from state q i at time t to a state q i at time t+1, where t=1, 2, 3, . . . M; and i, j=1, 2, . . . , N, and where M represents a number of the transitions and N represents a number of the states; wherein a transition probability a ij , representing a probability that diacritical mark q j appears directly after diacritical mark q i , equals an expected number of transitions from state q i to state q j divided by an expected number of transitions from state q i , finalize a diacritical mark having the highest probability for the current ASCII code; process each character in the sequence of the text, wherein the Hidden Markov Model bases the probability at least in part on the probability of a diacritical mark applied on one or more preceding characters of the sequence and on a context of the text for determining the probability of a diacritical mark on a given character; generate a sequence of the diacritical marks corresponding to the sequence of characters; match the sequence of diacritical marks with the text to obtain the diacritized text; and a display to present the diacritized text. 10. The system of claim 6 , wherein the processor is further configured to scan the text to determine whether each character of the plurality of characters comprises at least one diacritical mark.

1. A computer-readable medium embodying code segments describing an audio source of an audio scene according to an audio language comprising: a first code segment for describing audio in the audio source of the audio scene and for dynamically evolving the audio scene; and a second code segment for determining a priority of execution of the audio source within the audio scene; wherein the second code segment comprises at least one of: a prioritization reserved variable for determining the priority of execution of the audio source within the audio scene, the prioritization reserved variable comprising one of a priority reserved variable, a level of loading reserved variable, a level of storing reserved variable, a level of quality reserved variable, and a position reserved variable; and a parameter for determining the priority of execution of the audio source within the audio scene, the parameter associated with embodying the code segments describing the audio source on the computer-readable medium; wherein the audio source is executed to produce audio determined from the first code segment according to the priority of execution determined from the second code segment.

1. A computer-readable medium embodying code segments describing an audio source of an audio scene according to an audio language comprising: a first code segment for describing audio in the audio source of the audio scene and for dynamically evolving the audio scene; and a second code segment for determining a priority of execution of the audio source within the audio scene; wherein the second code segment comprises at least one of: a prioritization reserved variable for determining the priority of execution of the audio source within the audio scene, the prioritization reserved variable comprising one of a priority reserved variable, a level of loading reserved variable, a level of storing reserved variable, a level of quality reserved variable, and a position reserved variable; and a parameter for determining the priority of execution of the audio source within the audio scene, the parameter associated with embodying the code segments describing the audio source on the computer-readable medium; wherein the audio source is executed to produce audio determined from the first code segment according to the priority of execution determined from the second code segment. 6. A computer-readable medium according to claim 1, wherein the first code segment comprises: a sample data structure for describing audio in the audio source of the audio scene, wherein the sample data structure comprises: a name for a first file containing audio samples; and at least one reserved variable having a default value and for sampling the audio samples.

10. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a data processing system, causes the data processing system to: receive an ontology comprising a plurality of information concept objects and one or more actual links between the information concept objects; receive an indication of at least a selected information concept object for which a hypothetical ontological link is to be evaluated, wherein the hypothetical ontological link is a potential link that is not already present as an actual link in the ontology; automatically generate one or more natural language questions for processing by a Question Answering (QA) system pipeline based on at least an identification of a type of the selected information concept object; process, by the QA system pipeline, the one or more natural language questions to generate answer results; calculate a score for the hypothetical ontological link based on the answer results; and output information associated with the hypothetical ontological link based on the score for the hypothetical ontological link, wherein the computer readable program further causes the data processing system to calculate a score for the hypothetical ontological link at least by: calculating a score for each answer result in the generated answer results; generating a weighted score for each of the answer results; and combining the weighted scores for each of the answer results to generate the score for the hypothetical ontological link.

10. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a data processing system, causes the data processing system to: receive an ontology comprising a plurality of information concept objects and one or more actual links between the information concept objects; receive an indication of at least a selected information concept object for which a hypothetical ontological link is to be evaluated, wherein the hypothetical ontological link is a potential link that is not already present as an actual link in the ontology; automatically generate one or more natural language questions for processing by a Question Answering (QA) system pipeline based on at least an identification of a type of the selected information concept object; process, by the QA system pipeline, the one or more natural language questions to generate answer results; calculate a score for the hypothetical ontological link based on the answer results; and output information associated with the hypothetical ontological link based on the score for the hypothetical ontological link, wherein the computer readable program further causes the data processing system to calculate a score for the hypothetical ontological link at least by: calculating a score for each answer result in the generated answer results; generating a weighted score for each of the answer results; and combining the weighted scores for each of the answer results to generate the score for the hypothetical ontological link. 11. The computer program product of claim 10 , wherein the computer readable program further causes the data processing system to receive an indication of at least a selected information concept object for which a hypothetical ontological link is to be evaluated at least by receiving a user selection of an information concept object from the ontology and an input of a hypothetical ontological link type associated with the selected information concept object.

1. A method for operating a digital data processor to obtain one or more valid signatures of an undesirable software entity, the digital data processor including a memory that is bidirectionally coupled to the digital data processor, the method comprising the steps of: storing in the memory a corpus of computer programs that are representative of computer programs that are likely to be infected by an undesirable software entity; inputting to the digital data processor at least one portion of the undesirable software entity, the at least one portion including a sequence of bytes of the undesirable software entity that are likely to remain substantially invariant from a first instance of the undesirable software entity to a second instance of the undesirable software entity; storing the at least one inputted portion in the memory; selecting at least one candidate signature of the undesirable software entity from the stored at least one portion of the undesirable software entity; constructing with the digital data processor a list of unique n-grams from the sequence of bytes, each of the unique n-grams being comprised of from one to a chosen maximal number of sequential bytes (B) of the sequence of bytes, the constructed list of unique n-grams being stored in the memory; for each of the unique n-grams of the stored list, estimating with the digital data processor a probability of an occurrence of the unique n-gram within sequences of bytes obtained from the stored corpus of computer programs; for each candidate signature that is comprised of one or more of the unique n-grams, estimating with the digital data processor a false-positive probability of an occurrence of the candidate signature within the sequences of bytes obtained from the corpus of computer programs; comparing the estimated false-positive probabilities of the candidate signatures with one another and with a set threshold probabilities, the threshold probabilities having values selected to reduce a likelihood of an occurrence of a false positive indication during the use of a signature; and outputting at least one signature for subsequent use in identifying an occurrence of the undesirable software entity or a modified version of the undesirable software entity, the outputted at least one signature being determined to exhibit a false alarm probability that is comparable to or less than a lowest false alarm probability of others of the candidate signatures.

1. A method for operating a digital data processor to obtain one or more valid signatures of an undesirable software entity, the digital data processor including a memory that is bidirectionally coupled to the digital data processor, the method comprising the steps of: storing in the memory a corpus of computer programs that are representative of computer programs that are likely to be infected by an undesirable software entity; inputting to the digital data processor at least one portion of the undesirable software entity, the at least one portion including a sequence of bytes of the undesirable software entity that are likely to remain substantially invariant from a first instance of the undesirable software entity to a second instance of the undesirable software entity; storing the at least one inputted portion in the memory; selecting at least one candidate signature of the undesirable software entity from the stored at least one portion of the undesirable software entity; constructing with the digital data processor a list of unique n-grams from the sequence of bytes, each of the unique n-grams being comprised of from one to a chosen maximal number of sequential bytes (B) of the sequence of bytes, the constructed list of unique n-grams being stored in the memory; for each of the unique n-grams of the stored list, estimating with the digital data processor a probability of an occurrence of the unique n-gram within sequences of bytes obtained from the stored corpus of computer programs; for each candidate signature that is comprised of one or more of the unique n-grams, estimating with the digital data processor a false-positive probability of an occurrence of the candidate signature within the sequences of bytes obtained from the corpus of computer programs; comparing the estimated false-positive probabilities of the candidate signatures with one another and with a set threshold probabilities, the threshold probabilities having values selected to reduce a likelihood of an occurrence of a false positive indication during the use of a signature; and outputting at least one signature for subsequent use in identifying an occurrence of the undesirable software entity or a modified version of the undesirable software entity, the outputted at least one signature being determined to exhibit a false alarm probability that is comparable to or less than a lowest false alarm probability of others of the candidate signatures. 12. A method as set forth in claim 1 wherein the step of estimating a false-positive probability of an occurrence of the candidate signature includes the step of estimating a probability of a partial match between the candidate signature and the sequences of bytes obtained from the corpus of computer programs.

14. A computer program product stored in a computer readable medium, comprising functional descriptive material that, when executed by an information handling system, causes the information handling system to perform actions that include: selecting an instant messaging message that includes one or more words in a text area, wherein the selected instant messaging message is a communication with a first instant messaging participant, wherein the first instant messaging participant is associated with a first instant messaging participant identifier; selecting an instant messaging group, wherein the selected instant messaging group comprises a plurality of group members, each group member associated with one of a plurality of instant messaging participant identifiers, and wherein the instant messaging group is associated with one or more keywords, and wherein the instant messaging participant identifiers and the keywords are stored in an instant messaging group data store in a nonvolatile data area; determining whether the first instant messaging participant is a member of the selected instant messaging group; in response to determining that the first instant messaging participant is not a member of the selected instant messaging group, performing the following: identifying a count of the one or more words included in the selected instant messaging message that match the one or more keywords that are associated with the selected instant messaging group; in response to the identifying, determining that the count exceeds a predetermined threshold; and in response to the determining, adding the first instant messaging participant to the selected instant messaging group, wherein the adding comprises adding the first instant messaging participant identifier to a list of instant messaging participant identifiers associated with the selected instant messaging group, the list stored in the instant messaging group data store.

14. A computer program product stored in a computer readable medium, comprising functional descriptive material that, when executed by an information handling system, causes the information handling system to perform actions that include: selecting an instant messaging message that includes one or more words in a text area, wherein the selected instant messaging message is a communication with a first instant messaging participant, wherein the first instant messaging participant is associated with a first instant messaging participant identifier; selecting an instant messaging group, wherein the selected instant messaging group comprises a plurality of group members, each group member associated with one of a plurality of instant messaging participant identifiers, and wherein the instant messaging group is associated with one or more keywords, and wherein the instant messaging participant identifiers and the keywords are stored in an instant messaging group data store in a nonvolatile data area; determining whether the first instant messaging participant is a member of the selected instant messaging group; in response to determining that the first instant messaging participant is not a member of the selected instant messaging group, performing the following: identifying a count of the one or more words included in the selected instant messaging message that match the one or more keywords that are associated with the selected instant messaging group; in response to the identifying, determining that the count exceeds a predetermined threshold; and in response to the determining, adding the first instant messaging participant to the selected instant messaging group, wherein the adding comprises adding the first instant messaging participant identifier to a list of instant messaging participant identifiers associated with the selected instant messaging group, the list stored in the instant messaging group data store. 15. The computer program product of claim 14 wherein the predetermined threshold is one.

8. The system of claim 7 , wherein the information includes one or more code snippets of a plurality of code snippets that are contextually related to the designated code; wherein the plurality of code snippets is associated with the plurality of users in the social networking environment in the social data graph; and wherein the recommendation logic is configured to recommend at least one code snippet of the one or more code snippets for inclusion in the designated code based on the at least one code snippet of the one or more code snippets being associated with the at least one user of the plurality of users who is included in the social network of the developer in the social data graph.

8. The system of claim 7 , wherein the information includes one or more code snippets of a plurality of code snippets that are contextually related to the designated code; wherein the plurality of code snippets is associated with the plurality of users in the social networking environment in the social data graph; and wherein the recommendation logic is configured to recommend at least one code snippet of the one or more code snippets for inclusion in the designated code based on the at least one code snippet of the one or more code snippets being associated with the at least one user of the plurality of users who is included in the social network of the developer in the social data graph. 11. The system of claim 8 , wherein the recommendation logic is configured to recommend a specified code snippet for inclusion in the designated code further based on a number of bugs that are discovered in the specified code snippet.

1. A machine-assisted method comprising: providing a graphical user interface (GUI) including an idea map window for displaying and editing a graphical representation of a hierarchical network of graphical nodes, the nodes graphically representing ideas, and graphical links between ones of the nodes, the links graphically representing relationships between the ideas, a particular node being capable of being associated with corresponding text and an associated image; providing a word processor document window for displaying textual and image information, associated with respective nodes of the hierarchical network, in a word processor document; automatically organizing the displayed textual information for the user into a textual sequence displayed in the word processor document window, wherein an image associated with the particular node is displayed in the word processor window together with text associated with the particular node; and obtaining the textual sequence by automatically hierarchically processing the graphical representation of the hierarchical network of graphical nodes displayed in the idea map window, including, beginning with a graphically displayed root node, automatically hierarchically processing for a particular graphically displayed node any graphically displayed linked children nodes according to an ordering convention that uses only one of a clockwise manner or an anticlockwise manner as the linked children nodes are graphically displayed about their respective graphically displayed parent nodes in the hierarchical network of graphical nodes displayed in the idea map window, then proceeding to similarly automatically hierarchically process any linked children nodes according to the same ordering convention; concurrently displaying the idea map window and the word processor document window; and automatically updating the word processing document window with information from any changes in the idea map window, including automatically updating the text and image in the word processing window live, in real time, as the corresponding graphical nodes in the idea map window are being manipulated by the user.

1. A machine-assisted method comprising: providing a graphical user interface (GUI) including an idea map window for displaying and editing a graphical representation of a hierarchical network of graphical nodes, the nodes graphically representing ideas, and graphical links between ones of the nodes, the links graphically representing relationships between the ideas, a particular node being capable of being associated with corresponding text and an associated image; providing a word processor document window for displaying textual and image information, associated with respective nodes of the hierarchical network, in a word processor document; automatically organizing the displayed textual information for the user into a textual sequence displayed in the word processor document window, wherein an image associated with the particular node is displayed in the word processor window together with text associated with the particular node; and obtaining the textual sequence by automatically hierarchically processing the graphical representation of the hierarchical network of graphical nodes displayed in the idea map window, including, beginning with a graphically displayed root node, automatically hierarchically processing for a particular graphically displayed node any graphically displayed linked children nodes according to an ordering convention that uses only one of a clockwise manner or an anticlockwise manner as the linked children nodes are graphically displayed about their respective graphically displayed parent nodes in the hierarchical network of graphical nodes displayed in the idea map window, then proceeding to similarly automatically hierarchically process any linked children nodes according to the same ordering convention; concurrently displaying the idea map window and the word processor document window; and automatically updating the word processing document window with information from any changes in the idea map window, including automatically updating the text and image in the word processing window live, in real time, as the corresponding graphical nodes in the idea map window are being manipulated by the user. 5. The method of claim 1 , further comprising automatically arranging the graphical representation of a hierarchical network of nodes, in which the automatically arranging comprises iteratively: determining, for each node, a first coordinate distance to each directly connected node; determining, for each node, a second coordinate distance to each node that is not directly connected; and determining, using the first and second coordinate distances, new positions for the nodes.

7. A scroll display control device including a non-transitory computer readable medium which stores a program for causing a computer to execute scroll-displaying, in synchronism with reproduction of series information correlated to text information, the corresponding text information on a text display screen, said scroll display control device comprising: scroll speed calculation means which calculates a scroll speed of a target text on the basis of at least a time length of a series information section presently under reproduction and a quantity of the target text belonging to a target text section corresponding to the series information section during reproduction and text display setting information; control means which scroll-displays the target text belonging to the target text section at a display reference position of said text display screen according to said scroll speed; and a user instruction input means for dynamically changing the text display setting information related to the display reference position of the text display screen and the scroll method comprising a method for starting a scroll after a lapse of a predetermined time from a starting time of the target text, wherein text of a preceding text section which precedes the target text section and text of a succeeding text section which succeeds the target text section are respectively displayed in two adjacent areas across the target text section displayed at the display reference position of the text display screen, wherein the scroll speed calculation means calculates said scroll speed of the target text on the basis of the display reference position changed by the user instruction input means.

7. A scroll display control device including a non-transitory computer readable medium which stores a program for causing a computer to execute scroll-displaying, in synchronism with reproduction of series information correlated to text information, the corresponding text information on a text display screen, said scroll display control device comprising: scroll speed calculation means which calculates a scroll speed of a target text on the basis of at least a time length of a series information section presently under reproduction and a quantity of the target text belonging to a target text section corresponding to the series information section during reproduction and text display setting information; control means which scroll-displays the target text belonging to the target text section at a display reference position of said text display screen according to said scroll speed; and a user instruction input means for dynamically changing the text display setting information related to the display reference position of the text display screen and the scroll method comprising a method for starting a scroll after a lapse of a predetermined time from a starting time of the target text, wherein text of a preceding text section which precedes the target text section and text of a succeeding text section which succeeds the target text section are respectively displayed in two adjacent areas across the target text section displayed at the display reference position of the text display screen, wherein the scroll speed calculation means calculates said scroll speed of the target text on the basis of the display reference position changed by the user instruction input means. 17. The scroll display control device according to claim 7 , wherein in response to there being a section that any text is not presented between the target text section and the preceding or succeeding text section, the target text section includes the section in question.

1. A method for authenticating a user in a heterogeneous computer environment, the method comprising: utilizing one or more computers to perform: a. defining a set of unique prefixes, each prefix identifying a type of user repository; b. defining a set of abstract repository names, each abstract repository name identifying an address of a user repository, wherein each abstract repository name is mapped to a user repository, and is used to retrieve required address information that must be used to communicate with the repository, wherein said defining comprises defining an Abstract Repository Name Catalogue, which maps references to abstract repository names and abstract repository names to physical addresses; and c. identifying the user in the heterogeneous computer environment by assigning a sequence comprising a unique prefix, a reference to an abstract repository name and a unique identifier for the user within the user repository indicated by the reference to the abstract repository name, wherein the user repository is indicated via the mapping by the Abstract Repository Name Catalogue of the reference to the abstract repository name, and of the abstract repository name to the physical address of the user repository, wherein the unique identifier for the user uniquely identifies the user based on one or more rules of the user repository, and wherein authenticating the user comprises verifying that the identified user is authenticated for the indicated user repository based on the one or more rules; wherein more than one physical address is provided for a single abstract repository name, if the respective repository can be accessed via more than one protocol, and wherein the Abstract Repository Name Catalogue selects the physical address to return to the requestor based on the protocol required by the requestor to access the repository.

1. A method for authenticating a user in a heterogeneous computer environment, the method comprising: utilizing one or more computers to perform: a. defining a set of unique prefixes, each prefix identifying a type of user repository; b. defining a set of abstract repository names, each abstract repository name identifying an address of a user repository, wherein each abstract repository name is mapped to a user repository, and is used to retrieve required address information that must be used to communicate with the repository, wherein said defining comprises defining an Abstract Repository Name Catalogue, which maps references to abstract repository names and abstract repository names to physical addresses; and c. identifying the user in the heterogeneous computer environment by assigning a sequence comprising a unique prefix, a reference to an abstract repository name and a unique identifier for the user within the user repository indicated by the reference to the abstract repository name, wherein the user repository is indicated via the mapping by the Abstract Repository Name Catalogue of the reference to the abstract repository name, and of the abstract repository name to the physical address of the user repository, wherein the unique identifier for the user uniquely identifies the user based on one or more rules of the user repository, and wherein authenticating the user comprises verifying that the identified user is authenticated for the indicated user repository based on the one or more rules; wherein more than one physical address is provided for a single abstract repository name, if the respective repository can be accessed via more than one protocol, and wherein the Abstract Repository Name Catalogue selects the physical address to return to the requestor based on the protocol required by the requestor to access the repository. 7. The method of claim 1 , wherein the abstract repository name in the sequence identifies a user repository, for authenticating the credentials of the user.

3. The method of claim 2 , wherein the second shape of the cursor is shaped like an eyedropper.

3. The method of claim 2 , wherein the second shape of the cursor is shaped like an eyedropper. 4. The method of claim 3 wherein the plurality of fields in the find dialog comprise a plurality of number fields, a plurality of alignment fields, a plurality of font fields, a plurality of border fields, a plurality of pattern fields and a plurality of protection fields.

1. A computer-implemented method of operating one or more computing devices, the method comprising: receiving a message type indicator identifying a message type from a first client device; setting a message preference of a user of the first client device based at least in part on the message type indicator received from the first client device; receiving audio data from the first client device; receiving a designation of a second client device from the first client device; transcribing the audio data to transcribed text; generating a message of the message type based at least in part on the message preference of the user of the first client device, the message comprising the transcribed text; identifying profile information in the transcribed text, wherein the profile information comprises at least one of an interest or a preference of the user of the first client device, and wherein the profile information is identified without input from the first client device; causing the profile information that is identified without input from the first client device to be stored to a profile account associated with the user of the first client device and associated with the message type indicator; causing the profile information, including the profile information that is identified without input from the first client device and that is stored in the profile account, to be made available for dissemination to a computing device of a contact authorized by the user; and transmitting the message to the second client device.

1. A computer-implemented method of operating one or more computing devices, the method comprising: receiving a message type indicator identifying a message type from a first client device; setting a message preference of a user of the first client device based at least in part on the message type indicator received from the first client device; receiving audio data from the first client device; receiving a designation of a second client device from the first client device; transcribing the audio data to transcribed text; generating a message of the message type based at least in part on the message preference of the user of the first client device, the message comprising the transcribed text; identifying profile information in the transcribed text, wherein the profile information comprises at least one of an interest or a preference of the user of the first client device, and wherein the profile information is identified without input from the first client device; causing the profile information that is identified without input from the first client device to be stored to a profile account associated with the user of the first client device and associated with the message type indicator; causing the profile information, including the profile information that is identified without input from the first client device and that is stored in the profile account, to be made available for dissemination to a computing device of a contact authorized by the user; and transmitting the message to the second client device. 5. The computer-implemented method of claim 1 , wherein the audio data comprises at least one of a voicemail or a dictated text message.

1. A computer-implemented method of assessing similarity between character strings comprising: calculating an initial similarity score for a first character string and a second character string based on an edit distance algorithm; identifying the first character string and the second character string as candidate similar character strings from a data collection based on the calculated initial similarity score being greater than or equal to a similarity threshold value; determining, when the first character string and the second character string are identified as similar character strings, a frequency of occurrence for at least one of the first character string and the second character string from a collection of character strings stored in the data collection, wherein the frequency of occurrence comprises a total number of times that at least one of the first character string and the second character string is present in the collection of character strings; and decreasing an occurrence of false designations of character strings as being similar, the decreasing further comprising: adjusting the initial similarity score to a greater value as a final similarity score when the determined frequency of occurrence is no greater than a low frequency threshold value, adjusting the initial similarity score to a lower value as the final similarity score when the frequency of occurrence is greater than a high frequency threshold value, and designating the first character string and the second character string as similar based on the final similarity score being greater than or equal to the similarity threshold value.

1. A computer-implemented method of assessing similarity between character strings comprising: calculating an initial similarity score for a first character string and a second character string based on an edit distance algorithm; identifying the first character string and the second character string as candidate similar character strings from a data collection based on the calculated initial similarity score being greater than or equal to a similarity threshold value; determining, when the first character string and the second character string are identified as similar character strings, a frequency of occurrence for at least one of the first character string and the second character string from a collection of character strings stored in the data collection, wherein the frequency of occurrence comprises a total number of times that at least one of the first character string and the second character string is present in the collection of character strings; and decreasing an occurrence of false designations of character strings as being similar, the decreasing further comprising: adjusting the initial similarity score to a greater value as a final similarity score when the determined frequency of occurrence is no greater than a low frequency threshold value, adjusting the initial similarity score to a lower value as the final similarity score when the frequency of occurrence is greater than a high frequency threshold value, and designating the first character string and the second character string as similar based on the final similarity score being greater than or equal to the similarity threshold value. 6. The computer-implemented method of claim 1 , wherein the data collection stores a collection of people names such that the first character string and the second character string represent names of people.

36. The computer readable medium of claim 35 further comprising: eliminating individuals in the original ontology, comprising inserting new individuals to simplify said original ontology.

36. The computer readable medium of claim 35 further comprising: eliminating individuals in the original ontology, comprising inserting new individuals to simplify said original ontology. 37. The computer readable medium of claim 36 further comprising: eliminating concepts in the original ontology, comprising inserting new concepts to simplify said original ontology.