patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
1
|
|---|---|---|---|---|---|
8,060,455 | 21 | 24 | 21. An apparatus, comprising: means for predicting one or more future hot terms according to a classification process, wherein said predicting is based, at least in part, on frequency change rates associated with an array of query terms; means for ranking the one or more predicted future hot terms based, at least in part, on probability values determined by the classification process; and means for creating one or more contextual shortcuts associated with the respective one or more predicted future hot terms based, at least in part, on the ranking of the one or more predicted future hot terms, wherein the one or more contextual shortcuts comprise one or more selectable links in an online document to additional online content related to the respective one or more predicted future hot terms. | 21. An apparatus, comprising: means for predicting one or more future hot terms according to a classification process, wherein said predicting is based, at least in part, on frequency change rates associated with an array of query terms; means for ranking the one or more predicted future hot terms based, at least in part, on probability values determined by the classification process; and means for creating one or more contextual shortcuts associated with the respective one or more predicted future hot terms based, at least in part, on the ranking of the one or more predicted future hot terms, wherein the one or more contextual shortcuts comprise one or more selectable links in an online document to additional online content related to the respective one or more predicted future hot terms. 24. The apparatus of claim 21 , wherein said predicting one or more future hot terms is further based on an array of news terms derived from daily news text. | 0.7443 |
8,473,404 | 12 | 13 | 12. The method of claim 1 , further comprising recording the portion of the market data and a time the portion of the market data was flagged. | 12. The method of claim 1 , further comprising recording the portion of the market data and a time the portion of the market data was flagged. 13. The method of claim 12 where the portion of the market data and the time the portion of the market data was flagged is recorded in response to a first user command. | 0.890909 |
9,066,285 | 21 | 22 | 21. A computer program product for operating a modem for use at a terminal, the modem having a processing apparatus, a first interface apparatus comprising a first wireless transceiver for connecting to a wireless cellular network of a single service provider, and a second interface apparatus for connecting to the terminal; wherein the computer program product comprises code embodied on a non-transitory computer-readable medium and configured so as when executed on the processing apparatus of said modem to perform operations of a wireless cellular modem so as to enable the terminal to access packet-based communications via the second interface apparatus, first interface apparatus and a plurality of access points of the wireless cellular network, each of the plurality of access points having a respective name and configured according to a different version of a packet communication protocol, said plurality of access points comprising at least a first access point configured according to a first version of the packet communication protocol and a second access point configured according to a second version of the packet communication protocol, including to perform operations of: receiving a modem command from the terminal via the second interface apparatus, the modem command comprising a field for specifying the name of one of said plurality of access points in the form of a text string, wherein said field comprises a plurality of names, wherein in each name corresponds to one of said plurality of access points of the wireless cellular network and one or more separator characters between each of the names in the field; extracting each of the names of said plurality of access points from said field based on the one or more separator characters; and establishing a first channel with the first access point based on a first of the names extracted from said field, and establishing a second channel with the second access point based on a second of the names extracted from said field. | 21. A computer program product for operating a modem for use at a terminal, the modem having a processing apparatus, a first interface apparatus comprising a first wireless transceiver for connecting to a wireless cellular network of a single service provider, and a second interface apparatus for connecting to the terminal; wherein the computer program product comprises code embodied on a non-transitory computer-readable medium and configured so as when executed on the processing apparatus of said modem to perform operations of a wireless cellular modem so as to enable the terminal to access packet-based communications via the second interface apparatus, first interface apparatus and a plurality of access points of the wireless cellular network, each of the plurality of access points having a respective name and configured according to a different version of a packet communication protocol, said plurality of access points comprising at least a first access point configured according to a first version of the packet communication protocol and a second access point configured according to a second version of the packet communication protocol, including to perform operations of: receiving a modem command from the terminal via the second interface apparatus, the modem command comprising a field for specifying the name of one of said plurality of access points in the form of a text string, wherein said field comprises a plurality of names, wherein in each name corresponds to one of said plurality of access points of the wireless cellular network and one or more separator characters between each of the names in the field; extracting each of the names of said plurality of access points from said field based on the one or more separator characters; and establishing a first channel with the first access point based on a first of the names extracted from said field, and establishing a second channel with the second access point based on a second of the names extracted from said field. 22. The computer program product of claim 21 , wherein the one or more separator characters comprise a character allowed by an operating system of said terminal for use in specifying names of the plurality of access points. | 0.502232 |
10,120,849 | 16 | 17 | 16. The non-transitory machine-readable storage medium of claim 15 , wherein the operations further comprise redirecting the subsequent request from the first document to the second document. | 16. The non-transitory machine-readable storage medium of claim 15 , wherein the operations further comprise redirecting the subsequent request from the first document to the second document. 17. The non-transitory machine-readable storage medium of claim 16 , wherein redirecting the subsequent request for provision further comprises: identifying a first locator for the first document within the subsequent request; substituting a second locator for the second document within the subsequent request; and transmitting the subsequent request to the second locator. | 0.826047 |
8,510,307 | 11 | 12 | 11. The computer implemented method of claim 8 , wherein the item information comprises at least one item attribute and a corresponding attribute value and the obtained categories are described by at least one category attribute and a corresponding category attribute value and wherein the one or more obtained categories are hierarchically organized with respect to one another. | 11. The computer implemented method of claim 8 , wherein the item information comprises at least one item attribute and a corresponding attribute value and the obtained categories are described by at least one category attribute and a corresponding category attribute value and wherein the one or more obtained categories are hierarchically organized with respect to one another. 12. The computer-implemented method of claim 11 , wherein determining one or more relevance values representing the similarity of the item information to each of the obtained categories comprises assessing the relevance of at least one of the item attributes and item attribute values of the item of interest to one or more of the category attributes and category attribute values of the obtained categories. | 0.903592 |
9,201,866 | 1 | 5 | 1. A computer-implemented method comprising: accessing, using one or more processors, a mood evaluation index from a first electronic data store, wherein the mood evaluation index maps text to mood categories, wherein text describes a state associated with at least one of the mood categories, and wherein a mood category is associated with a state; mapping text to a mood category using the mood evaluation index, wherein the mood evaluation index associates a state with the text; calculating a mood weight for the text, wherein mood weights are calculated using a mood evaluation index, and wherein mood weights represent an intensity of the state that the text describes; accessing a message from a second electronic data store, wherein the message includes text mapped by the mood evaluation index; using the mood evaluation index to identify text included in the message that is mapped to a mood category; determining whether a modifier is in proximity to identified text; adjusting the mood weight of the identified text that is in proximity to the modifier; summing the mood weights of the identified text, wherein summing includes determining a category score corresponding to the mood category; and outputting the category score corresponding to the mood category to a third electronic data store. | 1. A computer-implemented method comprising: accessing, using one or more processors, a mood evaluation index from a first electronic data store, wherein the mood evaluation index maps text to mood categories, wherein text describes a state associated with at least one of the mood categories, and wherein a mood category is associated with a state; mapping text to a mood category using the mood evaluation index, wherein the mood evaluation index associates a state with the text; calculating a mood weight for the text, wherein mood weights are calculated using a mood evaluation index, and wherein mood weights represent an intensity of the state that the text describes; accessing a message from a second electronic data store, wherein the message includes text mapped by the mood evaluation index; using the mood evaluation index to identify text included in the message that is mapped to a mood category; determining whether a modifier is in proximity to identified text; adjusting the mood weight of the identified text that is in proximity to the modifier; summing the mood weights of the identified text, wherein summing includes determining a category score corresponding to the mood category; and outputting the category score corresponding to the mood category to a third electronic data store. 5. The computer-implemented method of claim 1 , wherein the mood weight is alphanumeric. | 0.946144 |
9,135,914 | 6 | 10 | 6. A computing device, comprising: a display; a touch screen; at least one input device; a processor; and memory having one or more instructions that, upon execution by the processor, cause the computing device to perform functions, the functions comprising: displaying, on the display, a display for a voice user interface to an application, the display for the voice user interface comprising a command display of one or more voice accessible commands for the application, a display for a non-voice user interface to the application, and an action bar, wherein the action bar is configured to separate the display for the voice user interface and the display for the non-voice user interface; receiving an input utterance via the at least one input device; obtaining input text based upon speech recognition performed upon the input utterance; determining that the input text corresponds to a voice-accessible command displayed as part of the command display; executing the application to perform the command; receiving input associated with a motion on the touch screen that starts at a region of the touch screen that corresponds to the action bar displayed on the display; and in response to the input, switching between the voice user interface and the non-voice user interface. | 6. A computing device, comprising: a display; a touch screen; at least one input device; a processor; and memory having one or more instructions that, upon execution by the processor, cause the computing device to perform functions, the functions comprising: displaying, on the display, a display for a voice user interface to an application, the display for the voice user interface comprising a command display of one or more voice accessible commands for the application, a display for a non-voice user interface to the application, and an action bar, wherein the action bar is configured to separate the display for the voice user interface and the display for the non-voice user interface; receiving an input utterance via the at least one input device; obtaining input text based upon speech recognition performed upon the input utterance; determining that the input text corresponds to a voice-accessible command displayed as part of the command display; executing the application to perform the command; receiving input associated with a motion on the touch screen that starts at a region of the touch screen that corresponds to the action bar displayed on the display; and in response to the input, switching between the voice user interface and the non-voice user interface. 10. The computing device of claim 6 , wherein the application is configured to receive input using the non-voice user interface, wherein the motion on the touch screen that starts at a region of the touch screen that corresponds to the action bar displayed on the display comprises: a motion on the touch screen in a direction associated with the voice interface starting at the region of the touch screen that corresponds to the action bar; and wherein switching between the voice user interface and the non-voice user interface comprises: in response to the motion on the touch screen in the direction associated with the voice interface, switching to receive input using the voice user interface. | 0.607744 |
8,073,331 | 1 | 19 | 1. An optical system for communicating optical signals to and from a subscriber unit, comprises: a first set of selected wavelengths; a second set of selected wavelengths offset from the first set of selected wavelengths; a first subsystem configured to transmit to the subscriber unit, the optical signals of one or more wavelengths from the first set of selected wavelengths over an optical fiber; a second subsystem configured to transmit to the subscriber unit the optical signals of one wavelength selected from the second set of selected wavelengths in statistical time division multiplexing over the optical fiber; a third subsystem at the subscriber unit configured to receive the optical signals of the one or more wavelengths from the first set of selected wavelengths and the optical signals of one wavelength from the second set of selected wavelengths over the optical fiber; a fourth subsystem at a head-end configured to receive looped back optical signals of one wavelength from the second set of selected wavelengths from the subscriber unit to the head-end over the optical fiber; a cyclic arrayed waveguide grating router capable of routing more than one wavelength to the subscriber unit; and a phase modulator, an intensity modulator, an amplifier and a looped back configuration within the subscriber unit. | 1. An optical system for communicating optical signals to and from a subscriber unit, comprises: a first set of selected wavelengths; a second set of selected wavelengths offset from the first set of selected wavelengths; a first subsystem configured to transmit to the subscriber unit, the optical signals of one or more wavelengths from the first set of selected wavelengths over an optical fiber; a second subsystem configured to transmit to the subscriber unit the optical signals of one wavelength selected from the second set of selected wavelengths in statistical time division multiplexing over the optical fiber; a third subsystem at the subscriber unit configured to receive the optical signals of the one or more wavelengths from the first set of selected wavelengths and the optical signals of one wavelength from the second set of selected wavelengths over the optical fiber; a fourth subsystem at a head-end configured to receive looped back optical signals of one wavelength from the second set of selected wavelengths from the subscriber unit to the head-end over the optical fiber; a cyclic arrayed waveguide grating router capable of routing more than one wavelength to the subscriber unit; and a phase modulator, an intensity modulator, an amplifier and a looped back configuration within the subscriber unit. 19. An optical system as in claim 1 , wherein the subscriber unit further comprises a quantum dot-enabled semiconductor optical amplifier for amplifying phase modulated optical signals selected from one wavelength from the second set of wavelengths. | 0.54059 |
10,042,943 | 25 | 26 | 25. The information processing method according to claim 14 , wherein the first experience information indicates the future experience of the person as a current desire of the person. | 25. The information processing method according to claim 14 , wherein the first experience information indicates the future experience of the person as a current desire of the person. 26. The information processing method according to claim 25 , wherein the second experience information indicates the future experiences of the other people as current desires of the other people. | 0.926094 |
4,597,057 | 6 | 8 | 6. A machine implemented method of compressing and storing information in the form of successive characters received as ASCII coded 8-bit bytes, by converting the information to strings of coded 4-bit nibbles, comprising the steps of: decoding in a machine each byte in succession to determine if it is an alpha type character, a numeric type character, or a punctuation type character, storing in a memory successive characters of the same type as a separate group, encoding in said memory a group of numeric type characters as a string of 4-bit nibbles in which the first nibble is coded to indicate that the group of characters is a numerical type, the next nibble is coded to indicate the number of numeric characters in the group and each successive nibble is coded to indicate the value of each successive numeric character in the group, and storing in a memory the string of encoded 4-bit nibbles. | 6. A machine implemented method of compressing and storing information in the form of successive characters received as ASCII coded 8-bit bytes, by converting the information to strings of coded 4-bit nibbles, comprising the steps of: decoding in a machine each byte in succession to determine if it is an alpha type character, a numeric type character, or a punctuation type character, storing in a memory successive characters of the same type as a separate group, encoding in said memory a group of numeric type characters as a string of 4-bit nibbles in which the first nibble is coded to indicate that the group of characters is a numerical type, the next nibble is coded to indicate the number of numeric characters in the group and each successive nibble is coded to indicate the value of each successive numeric character in the group, and storing in a memory the string of encoded 4-bit nibbles. 8. The method of claim 6 further including the steps of: determining when a group of alpha characters is not found in the dictionary table, comparing the beginning characters of the group with a plurality of beginning character combinations stored in a prefix table, encoding the beginning characters as a plurality of 4-bit nibbles indicating the location of the corresponding prefix in the prefix table if present in the prefix table, comparing the ending characters of the group of alpha characters with a plurality of ending characters stored in a suffix table, encoding the ending characters as a plurality of 4-bit nibbles indicating the location of the ending characters as a plurality of 4-bit nibbles, comparing each of any remaining characters with a set of characters in a character table, and encoding the character as one or more 4-bit nibbles indicating the location of the character in the character table. | 0.755443 |
9,111,531 | 21 | 28 | 21. A non-transitory computer-readable medium comprising computer-readable instructions for causing a processor to: receive a portion of an audio signal at a first classifier in a digital audio device; classify, by the digital audio device, the portion of the audio signal at the first classifier as speech or as music; and process the portion of the audio signal, wherein processing the portion of the audio signal comprises: if the portion is classified by the first classifier as speech, then encode, by the digital audio device, the speech using a first coding mode; or if the portion is classified by the first classifier as music, then: provide the portion to a second classifier in the digital audio device; classify, by the digital audio device, the portion at the second classifier as speech or as music; and encode the portion of the audio signal, wherein encoding the portion of the audio signal comprises: if the portion is classified at the second classifier as speech, then encode, by the digital audio device, the portion using a second coding mode; or if the portion is classified at the second classifier as music, then encode, by the digital audio device, the portion using a third coding mode. | 21. A non-transitory computer-readable medium comprising computer-readable instructions for causing a processor to: receive a portion of an audio signal at a first classifier in a digital audio device; classify, by the digital audio device, the portion of the audio signal at the first classifier as speech or as music; and process the portion of the audio signal, wherein processing the portion of the audio signal comprises: if the portion is classified by the first classifier as speech, then encode, by the digital audio device, the speech using a first coding mode; or if the portion is classified by the first classifier as music, then: provide the portion to a second classifier in the digital audio device; classify, by the digital audio device, the portion at the second classifier as speech or as music; and encode the portion of the audio signal, wherein encoding the portion of the audio signal comprises: if the portion is classified at the second classifier as speech, then encode, by the digital audio device, the portion using a second coding mode; or if the portion is classified at the second classifier as music, then encode, by the digital audio device, the portion using a third coding mode. 28. The computer-readable medium of claim 21 , wherein classifying the portion at the second classifier as speech or as music comprises at least one of comparing the voicing of the portion to a first threshold, comparing the modified correlation to a second threshold, or comparing long term pitch gain to a third threshold. | 0.667351 |
8,868,670 | 14 | 15 | 14. The system of claim 12 , wherein the predefined word type comprises an information-bearing word type. | 14. The system of claim 12 , wherein the predefined word type comprises an information-bearing word type. 15. The system of claim 14 , wherein the information-bearing word type comprises one of verbs, nouns, adjectives, or adverbs. | 0.969763 |
8,918,317 | 1 | 4 | 1. A method performed by at least one computer processor executing computer program instructions stored on at least one non-transitory computer-readable medium, the method comprising: (A) using a language model to decode, by a speech decoder executed by the at least one computer processor, a first portion of an audio signal into a first word in a token stream; (B) after (A): (B)(1) select a punctuation mark based on the language model and the first word; and (B)(2) inserting, by the speech decoder, the punctuation mark into the token stream at a position after the first word, based on a lexical cue provided by the first word; and (C) after (B), using the language model, the punctuation mark, and the first word to decode, by the speech decoder, a second portion of the audio signal into a second word in the token stream at a position after the punctuation mark. | 1. A method performed by at least one computer processor executing computer program instructions stored on at least one non-transitory computer-readable medium, the method comprising: (A) using a language model to decode, by a speech decoder executed by the at least one computer processor, a first portion of an audio signal into a first word in a token stream; (B) after (A): (B)(1) select a punctuation mark based on the language model and the first word; and (B)(2) inserting, by the speech decoder, the punctuation mark into the token stream at a position after the first word, based on a lexical cue provided by the first word; and (C) after (B), using the language model, the punctuation mark, and the first word to decode, by the speech decoder, a second portion of the audio signal into a second word in the token stream at a position after the punctuation mark. 4. The method of claim 1 , wherein the first portion and second portion of the audio signal are contiguous within the audio signal. | 0.802115 |
8,140,562 | 9 | 10 | 9. The method according to claim 7 , wherein the exceptional queries are received and displayed by the mobile device within a time frame of less than or equal to one half of an hour of an occurrence of the queries prior to their selection as exceptional queries. | 9. The method according to claim 7 , wherein the exceptional queries are received and displayed by the mobile device within a time frame of less than or equal to one half of an hour of an occurrence of the queries prior to their selection as exceptional queries. 10. The method according to claim 9 , wherein the time frame comprises a time frame of less than or equal to one quarter of an hour. | 0.969613 |
5,546,575 | 45 | 46 | 45. A database encoding method, which comprises: selecting a field of a database; identifying a plurality of data items within the field selected from a group consisting of a data value, a data value combination, a word or a phrase; listing the different data items; sorting the list by frequency of occurrence of the data items within the field to provide a rank for each data item; associating a unique number with each listed data item to create a translation table, each unique number corresponding to the rank of the listed data item, where the smallest unique number corresponds to the most frequently occurring data item and the largest unique number corresponds to the least frequently occurring data item, the associated unique number being a numeric equivalent of the data item; specifying a code length having a fixed number of bits L; determining a first threshold as a function of the code length, said first threshold representing the maximum allowable numeric equivalents within the translation table; determining a second threshold representing an acceptable number of occurrences of individual data item entries within a range of the numeric equivalents wherein said range is a function of L; comparing the amount of numeric equivalents to the first threshold and the total number of individual data item entries within the range to the second threshold; encoding all the numeric equivalents with a single-length code of length L if the comparison step indicates that the first threshold is not exceeded; encoding the numeric equivalents with a combination code if the comparison step indicates that the first threshold is exceeded and the second threshold is exceeded, where the combination code is of length L for the numeric equivalents less than or equal to the maximum value of the range, and of length n*L for all other numeric equivalents, where n is the smallest positive integer necessary to represent a particular numeric equivalent as a binary number; encoding all the numeric equivalents with a variable-length code if the comparison step indicates that first threshold is exceeded and the second threshold is not exceeded, where the variable length code is of length n*L; and creating a plurality of compacted data values by replacing the data items with the encoded numeric equivalents. | 45. A database encoding method, which comprises: selecting a field of a database; identifying a plurality of data items within the field selected from a group consisting of a data value, a data value combination, a word or a phrase; listing the different data items; sorting the list by frequency of occurrence of the data items within the field to provide a rank for each data item; associating a unique number with each listed data item to create a translation table, each unique number corresponding to the rank of the listed data item, where the smallest unique number corresponds to the most frequently occurring data item and the largest unique number corresponds to the least frequently occurring data item, the associated unique number being a numeric equivalent of the data item; specifying a code length having a fixed number of bits L; determining a first threshold as a function of the code length, said first threshold representing the maximum allowable numeric equivalents within the translation table; determining a second threshold representing an acceptable number of occurrences of individual data item entries within a range of the numeric equivalents wherein said range is a function of L; comparing the amount of numeric equivalents to the first threshold and the total number of individual data item entries within the range to the second threshold; encoding all the numeric equivalents with a single-length code of length L if the comparison step indicates that the first threshold is not exceeded; encoding the numeric equivalents with a combination code if the comparison step indicates that the first threshold is exceeded and the second threshold is exceeded, where the combination code is of length L for the numeric equivalents less than or equal to the maximum value of the range, and of length n*L for all other numeric equivalents, where n is the smallest positive integer necessary to represent a particular numeric equivalent as a binary number; encoding all the numeric equivalents with a variable-length code if the comparison step indicates that first threshold is exceeded and the second threshold is not exceeded, where the variable length code is of length n*L; and creating a plurality of compacted data values by replacing the data items with the encoded numeric equivalents. 46. A database encoding method according to claim 45, wherein L equals 8 and the single-length code comprises each numeric equivalent modulo 256. | 0.854125 |
8,219,543 | 16 | 24 | 16. A computer-implemented system for use in generating a structured electronic document comprising a primary document, one or more supplemental content items and one or more references to the one or more supplemental content items, respectively, the system comprising: a processor; and a computer readable memory having embodied thereon: a candidate content item repository having one or more content items that can be included in a structured electronic document; a copy module for deriving a base supplemental content item from a selected one of the candidate content items and further configured to designate a unique identifier for the base supplemental content item and for deriving an annotated supplemental content item from the base supplemental content item wherein the annotated supplemental content item includes at least a subset of content from the base supplemental content item; a document editor for receiving the unique identifier and to insert the unique identifier into a reference to the base supplemental content in the primary document and to insert another reference including another unique identifier of the annotated supplemental content item into the primary document; and a structured electronic document manager configured to create the structured electronic document by assembling the primary document, the base supplemental content item and the annotated supplement content item. | 16. A computer-implemented system for use in generating a structured electronic document comprising a primary document, one or more supplemental content items and one or more references to the one or more supplemental content items, respectively, the system comprising: a processor; and a computer readable memory having embodied thereon: a candidate content item repository having one or more content items that can be included in a structured electronic document; a copy module for deriving a base supplemental content item from a selected one of the candidate content items and further configured to designate a unique identifier for the base supplemental content item and for deriving an annotated supplemental content item from the base supplemental content item wherein the annotated supplemental content item includes at least a subset of content from the base supplemental content item; a document editor for receiving the unique identifier and to insert the unique identifier into a reference to the base supplemental content in the primary document and to insert another reference including another unique identifier of the annotated supplemental content item into the primary document; and a structured electronic document manager configured to create the structured electronic document by assembling the primary document, the base supplemental content item and the annotated supplement content item. 24. The system as recited in claim 16 wherein the structured electronic document manager is further configured to store the structured electronic document on a portable memory medium. | 0.792517 |
9,369,433 | 12 | 20 | 12. The cloud based method of claim 1 , wherein the user must locally install an inline site agent prior to accessing the Web 2.0 sites, wherein the inline site agent operates cooperatively with the cloud node for the monitoring and logging all communication. | 12. The cloud based method of claim 1 , wherein the user must locally install an inline site agent prior to accessing the Web 2.0 sites, wherein the inline site agent operates cooperatively with the cloud node for the monitoring and logging all communication. 20. The cloud based method of claim 12 , wherein the inline site agent controls features and applications that may be installed or operated by the user, the inline site agent captures user activity and send periodic summaries to the cloud node, and the inline site agent continuously operates while the user is browsing content. | 0.936037 |
9,141,672 | 3 | 4 | 3. The method of claim 2 , comprising associating a first weight with the click count and a second weight with the skip count. | 3. The method of claim 2 , comprising associating a first weight with the click count and a second weight with the skip count. 4. The method of claim 3 , wherein the score assigned to the one or more query term optionalization rules that are specific to the particular query term satisfies: W 1 ( click count ) W 1 ( click count ) + W 2 ( skip count ) wherein W1 represents the weight associated with the click count and W2 represents the weight associated with the skip count. | 0.943199 |
9,582,270 | 2 | 3 | 2. The method of claim 1 , wherein said generating a code behavior model comprises: initiating a static code analysis upon a current subject feature-related code scope method to generate a control flow graph (CFG) information for that method; and integrating said CFG information generated for each method and a signature information of a method's callees in said code behavior model, said generated control flow information resulting in an increased fine-grained code behavior model. | 2. The method of claim 1 , wherein said generating a code behavior model comprises: initiating a static code analysis upon a current subject feature-related code scope method to generate a control flow graph (CFG) information for that method; and integrating said CFG information generated for each method and a signature information of a method's callees in said code behavior model, said generated control flow information resulting in an increased fine-grained code behavior model. 3. The method of claim 2 , wherein said generating a feature behavior model comprises extracting an internal behavior of the specified feature based on one of: Natural Language Processing techniques or writing rules of the feature specification. | 0.929517 |
9,270,749 | 1 | 6 | 1. A method comprising: extracting (i) user-generated information pertaining to multiple failure scenarios from at least one social media data source and (ii) one or more settings and one or more items of configuration information pertaining to each system associated with one or more of the multiple failure scenarios; determining one or more causality relationships between (i) a set of log entries associated with the multiple failure scenarios and (ii) (a) the extracted user-generated information and (b) the extracted one or more settings and one or more items of configuration information; identifying a similarity between the one or more determined causality relationships and information contained within a user query; and providing guidance to the user regarding resolving and/or obviating one or more failures associated with the user query based on said identified similarity, wherein said guidance comprises (i) multiple alerts associated with multiple failures and (ii) one or more resolutions related to the multiple alerts, (iii) a relevance score associated with each of the one or more resolutions, and wherein said providing further comprises: prioritizing said multiple alerts based on (i) a computed severity of each of the multiple failures based on (a) presence of one or more pre-determined words in the extracted user-generated information and (b) a level of expertise associated with the user that provided the extracted user-generated information, (ii) an expected lead time to failure associated with each of the multiple failures, and (iii) a computed confidence value associated with each of the one or more determined causality relationships; and computing the relevance score associated with each of one or more resolutions via Score relevance (R Di )=M relevance (Reliability Source (R Di ), Sim problem (P Di , P app ), Sim configuration (C Di , C app ), Quality(R Di )), wherein: Reliability Source (R Di ) represents reliability of the source of the respective resolution; Sim problem (P Di , P app ) represents similarity of the one or more failures associated with the user query and the failure addressed by the respective resolution; Sim configuration (C Di , C app ) represents similarity between the configuration of the system associated with the user query and the configuration of one or more systems associated with the respective resolution; and Quality(R Di ) represents a quality value associated with the respective resolution; wherein said extracting, said determining, said identifying and said providing are carried out by at least one server-side computing device. | 1. A method comprising: extracting (i) user-generated information pertaining to multiple failure scenarios from at least one social media data source and (ii) one or more settings and one or more items of configuration information pertaining to each system associated with one or more of the multiple failure scenarios; determining one or more causality relationships between (i) a set of log entries associated with the multiple failure scenarios and (ii) (a) the extracted user-generated information and (b) the extracted one or more settings and one or more items of configuration information; identifying a similarity between the one or more determined causality relationships and information contained within a user query; and providing guidance to the user regarding resolving and/or obviating one or more failures associated with the user query based on said identified similarity, wherein said guidance comprises (i) multiple alerts associated with multiple failures and (ii) one or more resolutions related to the multiple alerts, (iii) a relevance score associated with each of the one or more resolutions, and wherein said providing further comprises: prioritizing said multiple alerts based on (i) a computed severity of each of the multiple failures based on (a) presence of one or more pre-determined words in the extracted user-generated information and (b) a level of expertise associated with the user that provided the extracted user-generated information, (ii) an expected lead time to failure associated with each of the multiple failures, and (iii) a computed confidence value associated with each of the one or more determined causality relationships; and computing the relevance score associated with each of one or more resolutions via Score relevance (R Di )=M relevance (Reliability Source (R Di ), Sim problem (P Di , P app ), Sim configuration (C Di , C app ), Quality(R Di )), wherein: Reliability Source (R Di ) represents reliability of the source of the respective resolution; Sim problem (P Di , P app ) represents similarity of the one or more failures associated with the user query and the failure addressed by the respective resolution; Sim configuration (C Di , C app ) represents similarity between the configuration of the system associated with the user query and the configuration of one or more systems associated with the respective resolution; and Quality(R Di ) represents a quality value associated with the respective resolution; wherein said extracting, said determining, said identifying and said providing are carried out by at least one server-side computing device. 6. The method of claim 1 , wherein said extracting further comprises determining a severity level of one or more of the multiple failure scenarios. | 0.759804 |
10,021,167 | 8 | 9 | 8. A computer-implemented method for accessing documents, the method comprising: from a device, receiving a request for creating an analytical file corresponding to a document stored on a server; retrieving, from the device, a business intelligence archive resource (BIAR) file related to the document, wherein the BIAR file includes metadata related to the document and connection details of the server; connecting to the server to retrieve the document and at least one of: values corresponding to the metadata, one or more annotations, and one or more operations related to the document from the server; integrating the retrieved document, the retrieved BIAR file,and the retrieved at least one of the values of the corresponding metadata, the one or more annotations, and the one or more operations to create the analytical file corresponding to the document; and storing the created analytical file locally on the device to enable accessing the document and the at least one of the values of the corresponding metadata, the one or more annotations, and the one or more operations related to the document, without being connected to the server. | 8. A computer-implemented method for accessing documents, the method comprising: from a device, receiving a request for creating an analytical file corresponding to a document stored on a server; retrieving, from the device, a business intelligence archive resource (BIAR) file related to the document, wherein the BIAR file includes metadata related to the document and connection details of the server; connecting to the server to retrieve the document and at least one of: values corresponding to the metadata, one or more annotations, and one or more operations related to the document from the server; integrating the retrieved document, the retrieved BIAR file,and the retrieved at least one of the values of the corresponding metadata, the one or more annotations, and the one or more operations to create the analytical file corresponding to the document; and storing the created analytical file locally on the device to enable accessing the document and the at least one of the values of the corresponding metadata, the one or more annotations, and the one or more operations related to the document, without being connected to the server. 9. The computer-implemented method of claim 8 further comprising: from the device, receiving a request to connect to the server to retrieve information comprising at least one of the document, the values of the corresponding metadata related to the document, the one or more annotations, and the one or more operations related to the document; based upon the request, determining whether the device is a registered device; upon determining that the device is the registered device, providing an access to the server to retrieve the information; and upon determining that the device is not the registered device, restricting the access to the server and displaying an error message. | 0.624172 |
8,006,178 | 6 | 9 | 6. A system comprising: one or more processors; one or more memories; computer executable instructions stored on the one or more memories and executable by the one or more processors, the computer executable instructions comprising: a source document having hypertext markup language (HTML) content; an overlay document having extensible hypertext markup language (XHTML) content that specifies changes to be made to an HTML document, wherein the source document specifies an overlay document version with which the source document is compatible, wherein no special tags or other types of markers are required in the source document to enable the changes to be made as specified by the overlay document, wherein when the source document comprises a section of HTML content that specifies that the section is designated as immutable, modification of the section via the overlay document is prevented, the section designated as immutable selected from a group consisting of: attributes of an HTML element of the source document; content of an HTML element of the source document; and structure of an HTML element of the source document; a manifest document that defines a relationship between the source document and the overlay document such that the overlay document is usable for modifying the source document when an attribute condition in the manifest document related to the source document is fulfilled; a document used to upgrade the overlay document from one version to another version; and an interface to utilize the overlay document to modify the presentation of the source document when an associated version of the overlay document is compatible with the source document. | 6. A system comprising: one or more processors; one or more memories; computer executable instructions stored on the one or more memories and executable by the one or more processors, the computer executable instructions comprising: a source document having hypertext markup language (HTML) content; an overlay document having extensible hypertext markup language (XHTML) content that specifies changes to be made to an HTML document, wherein the source document specifies an overlay document version with which the source document is compatible, wherein no special tags or other types of markers are required in the source document to enable the changes to be made as specified by the overlay document, wherein when the source document comprises a section of HTML content that specifies that the section is designated as immutable, modification of the section via the overlay document is prevented, the section designated as immutable selected from a group consisting of: attributes of an HTML element of the source document; content of an HTML element of the source document; and structure of an HTML element of the source document; a manifest document that defines a relationship between the source document and the overlay document such that the overlay document is usable for modifying the source document when an attribute condition in the manifest document related to the source document is fulfilled; a document used to upgrade the overlay document from one version to another version; and an interface to utilize the overlay document to modify the presentation of the source document when an associated version of the overlay document is compatible with the source document. 9. The system as recited in claim 6 , wherein the overlay document, when applied to the source document, modifies a content of an element in the source document. | 0.969895 |
7,831,196 | 20 | 21 | 20. The computer program product of claim 13 , wherein the features include one or more prompt-specific content features. | 20. The computer program product of claim 13 , wherein the features include one or more prompt-specific content features. 21. The computer program product of claim 20 , wherein the content features are derived by comparing word usage of the essay to a batch of essays scored over the range of score categories. | 0.961396 |
7,761,461 | 25 | 26 | 25. The computer-readable medium of claim 19 , wherein the first physical representation is a hierarchical representation and the second physical representation is a relational representation. | 25. The computer-readable medium of claim 19 , wherein the first physical representation is a hierarchical representation and the second physical representation is a relational representation. 26. The computer-readable medium of claim 25 , wherein the hierarchical representation is the eXtended Markup Language (XML). | 0.956956 |
10,115,215 | 18 | 34 | 18. A system comprising: a computing device comprising: a memory configured to store instructions; and a processor to execute the instructions to perform operations comprising: attaining data representing features of a font capable of representing one or more glyphs; and determining a rating for pairing the font and at least one other font using a machine learning system and the data representing the features of the font, wherein at least one of the features or at least one category of a set of categories is identified to represent the font by the machine learning system using the features of the font, and wherein the machine learning system produces a vector of numerical values, each numerical value represents one of the features or one of the categories in the set of categories. | 18. A system comprising: a computing device comprising: a memory configured to store instructions; and a processor to execute the instructions to perform operations comprising: attaining data representing features of a font capable of representing one or more glyphs; and determining a rating for pairing the font and at least one other font using a machine learning system and the data representing the features of the font, wherein at least one of the features or at least one category of a set of categories is identified to represent the font by the machine learning system using the features of the font, and wherein the machine learning system produces a vector of numerical values, each numerical value represents one of the features or one of the categories in the set of categories. 34. The system of claim 18 , wherein one or the features of the font represents squareness of one or more characters of the font. | 0.73125 |
7,549,052 | 19 | 22 | 19. The system of claim 15 , wherein the hash value generator is to compute a hash word for each frame by: dividing each frame of the information signal into one of bands or blocks; calculating a property of the signal in each of said bands or blocks; comparing the properties in the bands or blocks with respective thresholds; and generating respective bits of the hash word based on the results of said comparisons. | 19. The system of claim 15 , wherein the hash value generator is to compute a hash word for each frame by: dividing each frame of the information signal into one of bands or blocks; calculating a property of the signal in each of said bands or blocks; comparing the properties in the bands or blocks with respective thresholds; and generating respective bits of the hash word based on the results of said comparisons. 22. The system as claimed in claim 19 , wherein the unidentified information signal is a video signal, the frames of which are divided into blocks, the mean luminance of a block constituting the property of said block. | 0.936332 |
9,681,016 | 1 | 19 | 1. A method for handling hand-written annotations related to one or more physical documents, the method comprising: receiving a physical document including a hand-written annotation, the hand-written annotation is made by a user corresponding to at least a portion of the physical document, wherein the hand-written annotation is one of a plurality of hand-written annotations corresponding to the portion of the physical document; capturing the hand-written annotation and corresponding first position information of the hand-written annotation, wherein capturing further includes capturing a second position information of the at least portion of the physical document; storing the captured hand-written annotation, first position information of the hand-written annotation and second position information of the at least portion of the physical document; associating the hand-written annotation to the at least portion of the physical document; upon cropping a camera view of the physical document, obtaining a third position information of the at least portion of the physical document; determining a relative position of the hand-written annotation based on a relative position of the at least portion of the physical document in the camera view, wherein the relative position of the at least portion of the physical document is based on the third position information being relative to the second position information of the at least portion of the physical document, and wherein the relative position of the hand-written annotation is based on a fourth position information of the hand-written annotation relative to the first position information of the hand-written annotation; determining that a quantity of the plurality of hand-written annotations corresponding to the portion of the physical document exceeds a pre-defined quantity; displaying, within the camera view, a marker indicating a presence of the plurality of hand-written annotations; and sharing the hand-written annotation with other users, wherein the method is performed by a processor. | 1. A method for handling hand-written annotations related to one or more physical documents, the method comprising: receiving a physical document including a hand-written annotation, the hand-written annotation is made by a user corresponding to at least a portion of the physical document, wherein the hand-written annotation is one of a plurality of hand-written annotations corresponding to the portion of the physical document; capturing the hand-written annotation and corresponding first position information of the hand-written annotation, wherein capturing further includes capturing a second position information of the at least portion of the physical document; storing the captured hand-written annotation, first position information of the hand-written annotation and second position information of the at least portion of the physical document; associating the hand-written annotation to the at least portion of the physical document; upon cropping a camera view of the physical document, obtaining a third position information of the at least portion of the physical document; determining a relative position of the hand-written annotation based on a relative position of the at least portion of the physical document in the camera view, wherein the relative position of the at least portion of the physical document is based on the third position information being relative to the second position information of the at least portion of the physical document, and wherein the relative position of the hand-written annotation is based on a fourth position information of the hand-written annotation relative to the first position information of the hand-written annotation; determining that a quantity of the plurality of hand-written annotations corresponding to the portion of the physical document exceeds a pre-defined quantity; displaying, within the camera view, a marker indicating a presence of the plurality of hand-written annotations; and sharing the hand-written annotation with other users, wherein the method is performed by a processor. 19. The method of claim 1 , wherein the hand-written annotation is shared with the other users, based on a preference of the user. | 0.704545 |
8,204,840 | 19 | 20 | 19. The computer system of claim 14 , further comprising: a first receiver to receive and store an alert parameter from a member of a network, the alert parameter indicating a threshold number of views of a page; a second receiver to receive an update from another member of the network, the update including at least page view data of the network of users; a retriever to retrieve the alert parameter, and comparing the alert parameter with the page view data included within the update; and a transmitter to transmit an alert if the page view data exceeds the alert parameter. | 19. The computer system of claim 14 , further comprising: a first receiver to receive and store an alert parameter from a member of a network, the alert parameter indicating a threshold number of views of a page; a second receiver to receive an update from another member of the network, the update including at least page view data of the network of users; a retriever to retrieve the alert parameter, and comparing the alert parameter with the page view data included within the update; and a transmitter to transmit an alert if the page view data exceeds the alert parameter. 20. The computer system of claim 19 , wherein the alert parameter indicates at least a click through threshold, and an account usage threshold. | 0.943299 |
8,702,486 | 1 | 8 | 1. A system for providing gameplay of word-based games puzzles comprising crossword puzzles or word search puzzles, the system comprising: one or more processors programmed with one or more computer program instructions to: receive a selection of a gameplay mode of operation from among a plurality of gameplay modes of operation; select at least a word-based puzzle from among a plurality of word-based puzzles obtained from one or more sources of word-based puzzles; cause the word-based puzzle to be communicated for gameplay based on the received selection of the gameplay mode of operation; impose during gameplay of the word-based puzzle a time limit that relates to an attempt to at least partially solve the word-based puzzle; determine one or more types and quantities of virtual assets to be awarded to a user based on gameplay of the word-based puzzle, wherein the one or more types and quantities of virtual assets is determined based on whether the user solved a word related to one or more input spaces that is associated with a bonus award; allocate the determined one or more types and quantities of virtual assets to the user based on gameplay of the word-based puzzle, wherein a virtual asset is exchangeable for one or more benefits related to gameplay depending on the type of virtual asset; and award the one or more types and quantities of virtual assets to the user. | 1. A system for providing gameplay of word-based games puzzles comprising crossword puzzles or word search puzzles, the system comprising: one or more processors programmed with one or more computer program instructions to: receive a selection of a gameplay mode of operation from among a plurality of gameplay modes of operation; select at least a word-based puzzle from among a plurality of word-based puzzles obtained from one or more sources of word-based puzzles; cause the word-based puzzle to be communicated for gameplay based on the received selection of the gameplay mode of operation; impose during gameplay of the word-based puzzle a time limit that relates to an attempt to at least partially solve the word-based puzzle; determine one or more types and quantities of virtual assets to be awarded to a user based on gameplay of the word-based puzzle, wherein the one or more types and quantities of virtual assets is determined based on whether the user solved a word related to one or more input spaces that is associated with a bonus award; allocate the determined one or more types and quantities of virtual assets to the user based on gameplay of the word-based puzzle, wherein a virtual asset is exchangeable for one or more benefits related to gameplay depending on the type of virtual asset; and award the one or more types and quantities of virtual assets to the user. 8. The system of claim 1 , wherein the one or more types and quantities of virtual assets is determined based on a performance during gameplay. | 0.851351 |
10,025,807 | 1 | 7 | 1. A dynamic data acquisition method, comprising: extracting a search term from a search request string that is received; looking up the search term in a threshold value dictionary to acquire a dynamic threshold score corresponding to the search term, wherein the dynamic threshold score varies based on characteristic factors, wherein the characteristic factors include a textual characteristic factor for the search term and a data analysis characteristic factor for the search term, the textual characteristic factor and the data analysis characteristic factor being stored in a log dictionary; and wherein the dynamic threshold score relates to a correlation of the search term and a product, wherein the dynamic threshold score is calculated by: performing a first fitting calculation based on the textual characteristic factor for the search term to obtain a first threshold score; performing a second fitting calculation based on the data analysis characteristic factor for the search term to obtain a second threshold score; and performing a third fitting calculation based on the first threshold score and the second threshold score to obtain the dynamic threshold score; detecting a change in the characteristic factors, comprising: updating the dynamic threshold score based on the changed characteristic factors; and storing the updated dynamic threshold score in the threshold value dictionary; using the search term as a query condition and the updated dynamic threshold score corresponding to the search term as a filter condition to acquire, in an index data table, one or more corresponding pieces of index information; acquiring data information corresponding to the search term based on the index information in the index data table; and sending the data information to be displayed in a page of a website. | 1. A dynamic data acquisition method, comprising: extracting a search term from a search request string that is received; looking up the search term in a threshold value dictionary to acquire a dynamic threshold score corresponding to the search term, wherein the dynamic threshold score varies based on characteristic factors, wherein the characteristic factors include a textual characteristic factor for the search term and a data analysis characteristic factor for the search term, the textual characteristic factor and the data analysis characteristic factor being stored in a log dictionary; and wherein the dynamic threshold score relates to a correlation of the search term and a product, wherein the dynamic threshold score is calculated by: performing a first fitting calculation based on the textual characteristic factor for the search term to obtain a first threshold score; performing a second fitting calculation based on the data analysis characteristic factor for the search term to obtain a second threshold score; and performing a third fitting calculation based on the first threshold score and the second threshold score to obtain the dynamic threshold score; detecting a change in the characteristic factors, comprising: updating the dynamic threshold score based on the changed characteristic factors; and storing the updated dynamic threshold score in the threshold value dictionary; using the search term as a query condition and the updated dynamic threshold score corresponding to the search term as a filter condition to acquire, in an index data table, one or more corresponding pieces of index information; acquiring data information corresponding to the search term based on the index information in the index data table; and sending the data information to be displayed in a page of a website. 7. The method as described in claim 1 , further comprising: establishing the index data table, comprising: acquiring a keyword and a textual characteristic factor of each piece of the data information bound to the keyword from a bid management server or a log dictionary; performing a threshold value calculation based on the textual characteristic factor to acquire one or more threshold scores corresponding to each keyword; saving the keywords and the one or more threshold scores corresponding to each keyword to a threshold value database; and creating the index data table based on keywords in the threshold value database and the corresponding one or more threshold scores, wherein the performing of the threshold value calculation based on the textual characteristic factor to acquire the one or more threshold scores corresponding to each keyword comprises: employing a linear regression model, Score′=F′(f 1 , f 2 , . . . ,fj), to perform a fitting calculation and to acquire a threshold score for the keyword, wherein fj is the textual characteristic factor corresponding to the keyword, j is an integer less than or equal to J, and J is a natural number. | 0.500428 |
7,865,533 | 1 | 5 | 1. A computer-implemented system that facilitates query comprehensions, comprising: a processor; and a memory communicatively coupled to the processor, the memory having stored therein computer-executable instructions configured to implement the query comprehension system including: a comprehension component that manages a scope of a control variable; and a transformation component that receives from a user a query that includes initialization data and a set of query clauses in a sequence characterized by a query expression, wherein the user can perform at least the following: input new control variables into the received user-inputted query, the control variables comprising unique local variables that are configured to represent a property or column of an individual data row in a collection as the user-inputted query evaluates, hide existing control variables in the user-inputted query that are determined to be out of scope when the hidden variables are no longer part of the user-inputted query, reveal hidden variables that are determined to be in scope when the previously hidden variables are now part of the user-inputted query and implement the existing control variables in a different syntactical order than that in which the new control variables were inputted in the user-inputted query, wherein the control variable of the user inputted query have no syntactical order restriction, and wherein: the initialization data includes a control variable and at least one of a collection or an expression; the transformation component resolves values of the control variable in scope for each query clause, and based upon a type of each query clause, respectively; the transformation component operates on each query clause in a manner that is independent of an ordering of the sequence; and the transformation component outputs the results of the transformation performed on the collection or expression based upon the query expression and based on the number of control variables in scope, wherein the format in which the results are output is variable depending on the number of control variables in scope. | 1. A computer-implemented system that facilitates query comprehensions, comprising: a processor; and a memory communicatively coupled to the processor, the memory having stored therein computer-executable instructions configured to implement the query comprehension system including: a comprehension component that manages a scope of a control variable; and a transformation component that receives from a user a query that includes initialization data and a set of query clauses in a sequence characterized by a query expression, wherein the user can perform at least the following: input new control variables into the received user-inputted query, the control variables comprising unique local variables that are configured to represent a property or column of an individual data row in a collection as the user-inputted query evaluates, hide existing control variables in the user-inputted query that are determined to be out of scope when the hidden variables are no longer part of the user-inputted query, reveal hidden variables that are determined to be in scope when the previously hidden variables are now part of the user-inputted query and implement the existing control variables in a different syntactical order than that in which the new control variables were inputted in the user-inputted query, wherein the control variable of the user inputted query have no syntactical order restriction, and wherein: the initialization data includes a control variable and at least one of a collection or an expression; the transformation component resolves values of the control variable in scope for each query clause, and based upon a type of each query clause, respectively; the transformation component operates on each query clause in a manner that is independent of an ordering of the sequence; and the transformation component outputs the results of the transformation performed on the collection or expression based upon the query expression and based on the number of control variables in scope, wherein the format in which the results are output is variable depending on the number of control variables in scope. 5. The system of claim 1 , the comprehension component takes all extant control variables out of scope based upon a type of query clause received. | 0.698347 |
10,127,316 | 19 | 26 | 19. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to: receive, from a client system of a user of the social-networking system, instructions for generating a post in a news feed associated with the user on the social-networking system, wherein the post comprises unstructured text from the user; determine whether the unstructured text of the post comprises a request for a recommendation from other users of the social-networking system; parse the unstructured text to identify one or more first entities and one or more first entity types referenced in the unstructured text; generate a structured query based upon the one or more first entities and the one or more first entity types referenced in the unstructured text of the post; generate a plurality of search results corresponding to a plurality of second entities matching the structured query, wherein each of the second entities has an entity type matching at least one of the first entity types; and send, to the client system of the user responsive to receiving the instructions for generating the post, instructions for presenting one or more of the plurality of search results, wherein the search results are presented in association with the post by the user in the news feed associated with the user. | 19. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to: receive, from a client system of a user of the social-networking system, instructions for generating a post in a news feed associated with the user on the social-networking system, wherein the post comprises unstructured text from the user; determine whether the unstructured text of the post comprises a request for a recommendation from other users of the social-networking system; parse the unstructured text to identify one or more first entities and one or more first entity types referenced in the unstructured text; generate a structured query based upon the one or more first entities and the one or more first entity types referenced in the unstructured text of the post; generate a plurality of search results corresponding to a plurality of second entities matching the structured query, wherein each of the second entities has an entity type matching at least one of the first entity types; and send, to the client system of the user responsive to receiving the instructions for generating the post, instructions for presenting one or more of the plurality of search results, wherein the search results are presented in association with the post by the user in the news feed associated with the user. 26. The system of claim 19 , wherein the instructions to generate the structured query comprises instructions to: combine the one or more first entities and the one or more first entity types to form a first query; submit the first query to a structured-query generator configured to generate the structured query based on the one or more first entities and the one or more first entity types; and receive one or more results from the structured-query generator, wherein the structured query is based upon the one or more results. | 0.533451 |
10,078,667 | 1 | 7 | 1. A computer-implemented method for normalizing non-numeric features of files, comprising: segmenting at least one pair of positive instances of a non-numeric feature of a file into a number of tokens, wherein the non-numeric feature of the file comprises a file storage path of a configuration file stored in a networked computer environment; comparing the tokens in the at least one pair of positive instances to obtain matching tokens by: calculating the maximum matching score between each token in a positive instance with the tokens in another positive instance; selecting the tokens of which the maximum matching scores are greater than a given threshold, to get the matching tokens; and for each of the matching tokens, calculating weights of their matching the file, and storing the tokens and their weights in a token base, wherein the matching tokens identify similar configuration files stored in different locations in the networked computer environment. | 1. A computer-implemented method for normalizing non-numeric features of files, comprising: segmenting at least one pair of positive instances of a non-numeric feature of a file into a number of tokens, wherein the non-numeric feature of the file comprises a file storage path of a configuration file stored in a networked computer environment; comparing the tokens in the at least one pair of positive instances to obtain matching tokens by: calculating the maximum matching score between each token in a positive instance with the tokens in another positive instance; selecting the tokens of which the maximum matching scores are greater than a given threshold, to get the matching tokens; and for each of the matching tokens, calculating weights of their matching the file, and storing the tokens and their weights in a token base, wherein the matching tokens identify similar configuration files stored in different locations in the networked computer environment. 7. The computer-implemented method of claim 1 , wherein segmenting the positive instance into a number of tokens is performed by using structural characteristics of the non-numeric feature. | 0.847334 |
9,529,522 | 1 | 3 | 1. A method for enabling gesture-based search, comprising: providing, at a client device during a conversation with a plurality of conversation participants in which a user of the client device is currently participating in real-time, a search interface comprising a concept interface, a content interface adjacent to the concept interface, and a participant interface adjacent to the concept interface and content interface and identifying each of the plurality of conversation participants, the concept interface comprising a plurality of selectable concept tabs displayed in a line within the concept interface and the content interface configured to present content associated with a selected content tab, each selectable concept tab representative of a topic of the conversation identified based on a portion of speech of the conversation and including a visual indicator identifying a conversation participant that spoke the portion of conversation speech based on which the topic of the conversation is identified, wherein the client device comprises a touch-screen display; receiving, at the concept interface, a gesture input associated with adding an additional concept tab, wherein the gesture input comprises a touch input on the touch-screen display dragged in a direction towards the line of concept tabs; presenting, in response to receiving the gesture input, a concept input mechanism configured to allow a user of the client device to enter a concept for the additional concept tab; and in response to receiving a concept for the additional concept tab via the concept input mechanism, displaying the additional concept tab within the concept interface; wherein the content interface displays content associated with the received concept in response to the additional concept tab being selected. | 1. A method for enabling gesture-based search, comprising: providing, at a client device during a conversation with a plurality of conversation participants in which a user of the client device is currently participating in real-time, a search interface comprising a concept interface, a content interface adjacent to the concept interface, and a participant interface adjacent to the concept interface and content interface and identifying each of the plurality of conversation participants, the concept interface comprising a plurality of selectable concept tabs displayed in a line within the concept interface and the content interface configured to present content associated with a selected content tab, each selectable concept tab representative of a topic of the conversation identified based on a portion of speech of the conversation and including a visual indicator identifying a conversation participant that spoke the portion of conversation speech based on which the topic of the conversation is identified, wherein the client device comprises a touch-screen display; receiving, at the concept interface, a gesture input associated with adding an additional concept tab, wherein the gesture input comprises a touch input on the touch-screen display dragged in a direction towards the line of concept tabs; presenting, in response to receiving the gesture input, a concept input mechanism configured to allow a user of the client device to enter a concept for the additional concept tab; and in response to receiving a concept for the additional concept tab via the concept input mechanism, displaying the additional concept tab within the concept interface; wherein the content interface displays content associated with the received concept in response to the additional concept tab being selected. 3. The method of claim 1 , wherein the concept input mechanism is presented in response to the touch input being dragged in a direction towards the line of concept tabs by a threshold distance. | 0.769139 |
7,493,603 | 1 | 2 | 1. A method for validating a markup language document against a markup language schema definition, the method comprising: loading the markup language document into a runtime validation engine, the runtime validation engine comprising a markup language schema validation parser; loading an annotated automaton encoding corresponding to the markup language schema definition into the markup language schema validation parser; and the markup language schema validation parser utilizing the annotated automaton encoding to validate the markup language document against the markup language schema definition including ensuring that the markup language document complies with a format specified by the markup language schema definition. | 1. A method for validating a markup language document against a markup language schema definition, the method comprising: loading the markup language document into a runtime validation engine, the runtime validation engine comprising a markup language schema validation parser; loading an annotated automaton encoding corresponding to the markup language schema definition into the markup language schema validation parser; and the markup language schema validation parser utilizing the annotated automaton encoding to validate the markup language document against the markup language schema definition including ensuring that the markup language document complies with a format specified by the markup language schema definition. 2. The method of claim 1 , wherein the markup language comprises an Extensible Markup Language (XML). | 0.929666 |
9,519,640 | 4 | 5 | 4. The method of claim 1 wherein the step of translating comprises providing supplemental knowledge for the input data on a subject matter identified in the input data. | 4. The method of claim 1 wherein the step of translating comprises providing supplemental knowledge for the input data on a subject matter identified in the input data. 5. The method of claim 4 wherein the supplemental knowledge includes a selectable link for the wearer to provide additional supplemental knowledge on the subject matter. | 0.964361 |
10,015,213 | 1 | 2 | 1. A method, comprising: creating a data-interactive application and providing said data-interactive application within a shared platform, said shared platform including one or more computing devices, by which data describing actions performed by a plurality of users is received over a network within said shared platform via said data-interactive application; configuring said shared platform to be accessible by said plurality of users via said data-interactive application, by one or more computing devices of said shared platform, the data-interactive application within said shared platform and accessible asynchronously by said plurality of users over said network, said data-interactive application installed on the shared platform to receive said data describing actions variously performed by said plurality of users, the shared platform containing a content-organization engine coupled to said data-interactive application to execute said data describing said actions variously performed by said plurality of users; receiving, by the one or more computing devices of said shared platform, via said data-interactive application within the shared platform, certain content created by said data describing actions performed by a particular user from the plurality of users, relating to particular text within electronic content stored within said shared platform and providing for display by the content-organization engine said electronic content in the form of a book, for viewing by another user over the network at a remote device, and embedding the certain content created by said one user within a page in the book; sharing automatically, by the one or more computing devices within said shared platform and the content-organization engine, the certain content created by the user with groups of other users as designated by a sharing engine coupled to the content-organization engine, wherein the certain content is provided for display to one or more groups of users on at least said remote device, if the one or more groups are designated for viewing said certain content added by said particular user and when the one or more groups review the electronic content stored within said shared platform; creating automatically by the content-organization engine, and by the one or more computing devices of shared platform, a master identification code for identifying all versions of the electronic content and providing the certain content created by the particular user by said data describing said actions performed by said particular user for display by a graphical user interface with multiple windows displaying all the versions of the electronic content stored within said shared platform; generating by the content-organization engine and providing for display by the graphical user interface and via said multiple windows, and by at least one of the one or more computing devices of said shared platform, multiple channels for multiple threads of discussion created for different groups based on restrictions designated and starting a new channel for a new thread of discussion for a private group without including previous discussions; generating, by the content-organization engine and by the one or more computing devices of said shared platform, a chapter map for the electronic content stored within the shared platform, by which the certain content created by the particular user and provided to others is selectively located in an appropriate version of the electronic content identified from all the versions of the electronic content and wherein if the certain content created by the particular user defines an assignment, answers from other users responding to the assignment are compiled for review by the particular user providing the assignment; and providing a content discovery system as part of the content-organization engine and configured to allow certain users to browse through lists of materials compiled by other users based on established relationships and discover content that may be of interest. | 1. A method, comprising: creating a data-interactive application and providing said data-interactive application within a shared platform, said shared platform including one or more computing devices, by which data describing actions performed by a plurality of users is received over a network within said shared platform via said data-interactive application; configuring said shared platform to be accessible by said plurality of users via said data-interactive application, by one or more computing devices of said shared platform, the data-interactive application within said shared platform and accessible asynchronously by said plurality of users over said network, said data-interactive application installed on the shared platform to receive said data describing actions variously performed by said plurality of users, the shared platform containing a content-organization engine coupled to said data-interactive application to execute said data describing said actions variously performed by said plurality of users; receiving, by the one or more computing devices of said shared platform, via said data-interactive application within the shared platform, certain content created by said data describing actions performed by a particular user from the plurality of users, relating to particular text within electronic content stored within said shared platform and providing for display by the content-organization engine said electronic content in the form of a book, for viewing by another user over the network at a remote device, and embedding the certain content created by said one user within a page in the book; sharing automatically, by the one or more computing devices within said shared platform and the content-organization engine, the certain content created by the user with groups of other users as designated by a sharing engine coupled to the content-organization engine, wherein the certain content is provided for display to one or more groups of users on at least said remote device, if the one or more groups are designated for viewing said certain content added by said particular user and when the one or more groups review the electronic content stored within said shared platform; creating automatically by the content-organization engine, and by the one or more computing devices of shared platform, a master identification code for identifying all versions of the electronic content and providing the certain content created by the particular user by said data describing said actions performed by said particular user for display by a graphical user interface with multiple windows displaying all the versions of the electronic content stored within said shared platform; generating by the content-organization engine and providing for display by the graphical user interface and via said multiple windows, and by at least one of the one or more computing devices of said shared platform, multiple channels for multiple threads of discussion created for different groups based on restrictions designated and starting a new channel for a new thread of discussion for a private group without including previous discussions; generating, by the content-organization engine and by the one or more computing devices of said shared platform, a chapter map for the electronic content stored within the shared platform, by which the certain content created by the particular user and provided to others is selectively located in an appropriate version of the electronic content identified from all the versions of the electronic content and wherein if the certain content created by the particular user defines an assignment, answers from other users responding to the assignment are compiled for review by the particular user providing the assignment; and providing a content discovery system as part of the content-organization engine and configured to allow certain users to browse through lists of materials compiled by other users based on established relationships and discover content that may be of interest. 2. The method of claim 1 , further comprising: generating, by the one or more computing devices of the shared platform, an identification of coordinates of where the electronic content is located in the appropriate version identified from all the versions of the electronic content stored on said shared platform. | 0.747987 |
9,348,499 | 31 | 32 | 31. One or more non-transitory computer-readable media storing instructions for sharing information from a first data system with a second data system, which instructions, when executed by one or more processors, cause performance of steps comprising: receiving, from a first server of the first data system, at a second server of the second data system (a) a document comprising one or more instructions configured to cause generation of one or more presented components of the document based on retrieving data belonging to a first object within a first repository of the first data system, and (b) evidence data describing one or more aspects of the first object; wherein the first object has a first name; wherein the evidence data is not identical to the first name; wherein the retrieved data that belongs to the first object is not included in the document or the evidence data; using the evidence data to identify a second object, stored within a second repository of the second data system, to be utilized as a substitute for the first object; and generating and storing a copy of the document, wherein the copy of the document comprises a reference to the second object instead of the first object, and further comprises one or more instructions configured to cause generation of the one or more presented components based on retrieving data that belongs to the second object. | 31. One or more non-transitory computer-readable media storing instructions for sharing information from a first data system with a second data system, which instructions, when executed by one or more processors, cause performance of steps comprising: receiving, from a first server of the first data system, at a second server of the second data system (a) a document comprising one or more instructions configured to cause generation of one or more presented components of the document based on retrieving data belonging to a first object within a first repository of the first data system, and (b) evidence data describing one or more aspects of the first object; wherein the first object has a first name; wherein the evidence data is not identical to the first name; wherein the retrieved data that belongs to the first object is not included in the document or the evidence data; using the evidence data to identify a second object, stored within a second repository of the second data system, to be utilized as a substitute for the first object; and generating and storing a copy of the document, wherein the copy of the document comprises a reference to the second object instead of the first object, and further comprises one or more instructions configured to cause generation of the one or more presented components based on retrieving data that belongs to the second object. 32. The one or more non-transitory computer-readable media of claim 31 , wherein: the document references the first object using the first name; generating the copy of the document comprises replacing references comprising the first name with references comprising a second name; the second name is a name by which the second data system identifies the second object; and the second name is different from the first name. | 0.501185 |
8,825,645 | 9 | 11 | 9. A system comprising: one or more processors to: identify a plurality of documents, a first document, of the identified plurality of documents, being linked to by a second document, of the identified plurality of documents, the second document and a third document, of the identified plurality of documents, being in a set of affiliated documents; calculate a first value for each document in the set of affiliated documents, calculating the first value for each document in the set of affiliated documents being based on: a ranking score of the document, and a number of outbound links from the document; determine that the first value calculated for the third document is a maximum of the first values calculated for each document in the set of affiliated documents; assign a ranking score to the first document based the first value calculated for the third document; and store the ranking score. | 9. A system comprising: one or more processors to: identify a plurality of documents, a first document, of the identified plurality of documents, being linked to by a second document, of the identified plurality of documents, the second document and a third document, of the identified plurality of documents, being in a set of affiliated documents; calculate a first value for each document in the set of affiliated documents, calculating the first value for each document in the set of affiliated documents being based on: a ranking score of the document, and a number of outbound links from the document; determine that the first value calculated for the third document is a maximum of the first values calculated for each document in the set of affiliated documents; assign a ranking score to the first document based the first value calculated for the third document; and store the ranking score. 11. The system of claim 9 , where the one or more processors are further to: identify affiliations among a plurality of documents in the affiliated set of documents based on at least one of: a link graph structure of the plurality of documents in the affiliated set of documents, traffic patterns associated with the plurality of documents in the affiliated set of documents, similarity of hostnames of the plurality of documents in the affiliated set of documents, or similarity of Internet Protocol (IP) addresses of the plurality of documents in the affiliated set of documents. | 0.663384 |
9,026,512 | 1 | 5 | 1. A method of searching data, comprising: using a searchable index to determine which, if any, data objects from current production data and a set of backup data are responsive to a search query, wherein a data object in the set of backup data corresponds to a version of the production data as the production data existed when a backup operation was performed; in the event that a plurality of data objects is responsive to the search query: determining from the plurality of data objects responsive to the search query a subset of related data objects that are related to each other; determining from the subset of related data objects a first data object that comprises a version of one or more other data objects included in the subset of related data objects; and generating for the search query a search result that includes data that indicates version relationships between the first data object and the one or more other data objects included in the subset of related data objects; in the event no data object is responsive to the search query, generating said search result to indicate that no data object is responsive to the search query; and presenting, via a display at an interface device, the search result. | 1. A method of searching data, comprising: using a searchable index to determine which, if any, data objects from current production data and a set of backup data are responsive to a search query, wherein a data object in the set of backup data corresponds to a version of the production data as the production data existed when a backup operation was performed; in the event that a plurality of data objects is responsive to the search query: determining from the plurality of data objects responsive to the search query a subset of related data objects that are related to each other; determining from the subset of related data objects a first data object that comprises a version of one or more other data objects included in the subset of related data objects; and generating for the search query a search result that includes data that indicates version relationships between the first data object and the one or more other data objects included in the subset of related data objects; in the event no data object is responsive to the search query, generating said search result to indicate that no data object is responsive to the search query; and presenting, via a display at an interface device, the search result. 5. The method as recited in claim 1 , wherein the set of backup data includes one or more of the following: versions of data objects backed up from a production data, data objects backed up on a periodic interval, data objects backed up on a prescribed instance, data objects backed up on a configured time, data objects backed up after at least one data change is made to a production storage, incremental backup data, differential backup data, or other backup data comprising data changes from a last completed full backup operation. | 0.566451 |
8,756,515 | 1 | 11 | 1. At a computer system that includes one or more processors and system memory, a method for providing a real-time incremental editor for enacting changes to user interface (UI) elements of an active UI, the method comprising: an act of the computer system presenting a first UI of an executing application program based on a UI model that includes declarative model data that drives the behavior of the first UI, the first UI including a plurality of UI elements, the UI model including particular declarative model data that declaratively defines a visual appearance of the plurality of UI elements of the first UI, each of the plurality of UI elements being an instance of the particular declarative model data; an-act of the computer system visually indicating a state of the first UI, including visually indicating within the first UI that a particular UI element of the plurality of UI elements has been selected by a user at the first UI; concurrent to presenting the first UI of the application program, and concurrent to visually indicating within the first UI that the particular UI element has been selected by a user: an act of the computer system presenting a second UI of a real-time incremental editor that is separate from the application program and that is configured to receive one or more editing inputs that are to be applied to the particular declarative model data of the UI model, to edit the first UI of the application program while the application program is executing; an act of the computer system receiving a first editing user input at the second UI of the real-time incremental editor, the first editing input selecting the particular declarative model data that declaratively defines the plurality of UI elements; based on selection of the particular declarative model data within the real-time incremental editor, visually distinguishing each of the plurality of UI elements, including the particular UI element, within the first UI as being selected at the second UI of the real-time incremental editor, while also visually indicating within the first UI that the particular UI element has been selected at the first UI; an act of the computer system receiving a second editing user input at the second UI of the real-time incremental editor, the second editing input indicating one or more desired edits that are to be made to the plurality of UI elements that affect the visual appearance of the plurality of UI elements within the first UI; an act of the computer system determining, based on the received editing input, one or more changes that are to be made to the particular declarative model data corresponding to the plurality of UI elements in order to enact the one or more desired edits to each of the plurality of UI elements; and an act of the computer system updating the first UI to reflect the one or more desired edits to the plurality of UI elements, including: preserving the state of the first UI to reflect the user selection of the particular UI element by continuing to visually indicate that the particular UI element has been selected by the user; and concurrent to continuing to visually indicate that the particular UI element has been selected by the user, altering the visual appearance of each of the plurality of UI elements, including the particular UI element, based on the one or more changes to the particular declarative model data corresponding to the plurality of UI elements. | 1. At a computer system that includes one or more processors and system memory, a method for providing a real-time incremental editor for enacting changes to user interface (UI) elements of an active UI, the method comprising: an act of the computer system presenting a first UI of an executing application program based on a UI model that includes declarative model data that drives the behavior of the first UI, the first UI including a plurality of UI elements, the UI model including particular declarative model data that declaratively defines a visual appearance of the plurality of UI elements of the first UI, each of the plurality of UI elements being an instance of the particular declarative model data; an-act of the computer system visually indicating a state of the first UI, including visually indicating within the first UI that a particular UI element of the plurality of UI elements has been selected by a user at the first UI; concurrent to presenting the first UI of the application program, and concurrent to visually indicating within the first UI that the particular UI element has been selected by a user: an act of the computer system presenting a second UI of a real-time incremental editor that is separate from the application program and that is configured to receive one or more editing inputs that are to be applied to the particular declarative model data of the UI model, to edit the first UI of the application program while the application program is executing; an act of the computer system receiving a first editing user input at the second UI of the real-time incremental editor, the first editing input selecting the particular declarative model data that declaratively defines the plurality of UI elements; based on selection of the particular declarative model data within the real-time incremental editor, visually distinguishing each of the plurality of UI elements, including the particular UI element, within the first UI as being selected at the second UI of the real-time incremental editor, while also visually indicating within the first UI that the particular UI element has been selected at the first UI; an act of the computer system receiving a second editing user input at the second UI of the real-time incremental editor, the second editing input indicating one or more desired edits that are to be made to the plurality of UI elements that affect the visual appearance of the plurality of UI elements within the first UI; an act of the computer system determining, based on the received editing input, one or more changes that are to be made to the particular declarative model data corresponding to the plurality of UI elements in order to enact the one or more desired edits to each of the plurality of UI elements; and an act of the computer system updating the first UI to reflect the one or more desired edits to the plurality of UI elements, including: preserving the state of the first UI to reflect the user selection of the particular UI element by continuing to visually indicate that the particular UI element has been selected by the user; and concurrent to continuing to visually indicate that the particular UI element has been selected by the user, altering the visual appearance of each of the plurality of UI elements, including the particular UI element, based on the one or more changes to the particular declarative model data corresponding to the plurality of UI elements. 11. The method of claim 1 , further comprising instantiating a data flow engine to support transformations of collections, records and atoms and track dependencies across declarative model data items. | 0.811676 |
8,806,333 | 10 | 11 | 10. A method of executing an application platform application on a computing device, comprising: creating a computing environment using a processor configured by an operating system on the computing device; and executing an application platform application within the computing environment to generate a runtime environment for cross-platform applications to execute non-natively on the computing device, the application platform application comprising: a rendering engine process configured to: render pages within the computing environment created by the operating system by interpreting instructions written in a rendering language; and implement a virtual machine configured to execute instructions written in a scripting language; and an integration process that enables instructions executing within the virtual machine to launch natively implemented applications within the computing environment, where the integration process enables instructions executing within the virtual machine to retrieve information from the computing environment of the computing device; scanning the computing device to retrieve information related to at least one specific native application installed on the computing device and at least one specific non-native application using the computing device; integrating at least one cross-platform application into the computing environment of the computing device by providing at least one launch point for the cross-platform application within the computing environment using the computing device; injecting at least a portion of the retrieved information into the instructions written in the rendering language from the pop up page file using the application platform application, where the retrieved information includes at least one launch point for a specific natively implemented application and at least one launch point for a specific non-natively implemented application; rendering instructions written in the rendering language contained within a pop up page file that is part of the application platform application to create a pop up page within the computing environment of the computing device using the rendering engine process, where the pop up page comprises the at least one of the non-native launch point and at least one of the native launch point; and launching a natively implemented application using the integration process in response to a user instruction received via interaction with the one or more launch points within the rendered pop up page. | 10. A method of executing an application platform application on a computing device, comprising: creating a computing environment using a processor configured by an operating system on the computing device; and executing an application platform application within the computing environment to generate a runtime environment for cross-platform applications to execute non-natively on the computing device, the application platform application comprising: a rendering engine process configured to: render pages within the computing environment created by the operating system by interpreting instructions written in a rendering language; and implement a virtual machine configured to execute instructions written in a scripting language; and an integration process that enables instructions executing within the virtual machine to launch natively implemented applications within the computing environment, where the integration process enables instructions executing within the virtual machine to retrieve information from the computing environment of the computing device; scanning the computing device to retrieve information related to at least one specific native application installed on the computing device and at least one specific non-native application using the computing device; integrating at least one cross-platform application into the computing environment of the computing device by providing at least one launch point for the cross-platform application within the computing environment using the computing device; injecting at least a portion of the retrieved information into the instructions written in the rendering language from the pop up page file using the application platform application, where the retrieved information includes at least one launch point for a specific natively implemented application and at least one launch point for a specific non-natively implemented application; rendering instructions written in the rendering language contained within a pop up page file that is part of the application platform application to create a pop up page within the computing environment of the computing device using the rendering engine process, where the pop up page comprises the at least one of the non-native launch point and at least one of the native launch point; and launching a natively implemented application using the integration process in response to a user instruction received via interaction with the one or more launch points within the rendered pop up page. 11. The method of claim 10 , wherein the method further comprises: retrieving information from the computing environment using the integration process in response to a user instruction received via interaction with the rendered pop up page. | 0.87976 |
7,630,962 | 1 | 2 | 1. A method of providing an electronic filing system which is searchable using a handwritten search query, the method including the steps of: obtaining the handwritten search query using interaction of an input device; obtaining a text search query including a text search term; performing a search of at least one database for instances of the text search term; performing a search of the at least one database for handwritten annotations that are a given physical distance from each of at least one of the instances of the text search term; comparing the handwritten search query and the handwritten annotations in order to determine matches between the handwritten search query and the handwritten annotations; and, providing results of the comparing step to a user and facilitating access to at least one page upon which the handwritten annotations appear. | 1. A method of providing an electronic filing system which is searchable using a handwritten search query, the method including the steps of: obtaining the handwritten search query using interaction of an input device; obtaining a text search query including a text search term; performing a search of at least one database for instances of the text search term; performing a search of the at least one database for handwritten annotations that are a given physical distance from each of at least one of the instances of the text search term; comparing the handwritten search query and the handwritten annotations in order to determine matches between the handwritten search query and the handwritten annotations; and, providing results of the comparing step to a user and facilitating access to at least one page upon which the handwritten annotations appear. 2. The method as claimed in claim 1 , wherein an interactive page identified in the results of the search is displayed to a user on a display device. | 0.609948 |
10,013,467 | 2 | 15 | 2. The method of claim 1 , further comprising the steps of: selecting a target node among the nodes within the virtual n-dimensional array; comparing, using a chemical feature (“CF”) module which comprises code executing in the processor, at least one CF corresponding to the coded form contained within a first node adjacent to the target node to at least one CF corresponding to the coded form contained in at least a second node adjacent to the target node, the first and second nodes sharing a border with the target node in the virtual n-dimensional array; identifying common CFs between the target and second nodes using a commonality module which comprises code executing in the processor; generating at least one new coded form based on combinations of the identified, common CFs which, when inserted into the virtual n-dimensional array, results in a placement within the target node, using a coded form generator module which comprises code executing in the processor; and outputting a chemical identifier corresponding to the new coded form. | 2. The method of claim 1 , further comprising the steps of: selecting a target node among the nodes within the virtual n-dimensional array; comparing, using a chemical feature (“CF”) module which comprises code executing in the processor, at least one CF corresponding to the coded form contained within a first node adjacent to the target node to at least one CF corresponding to the coded form contained in at least a second node adjacent to the target node, the first and second nodes sharing a border with the target node in the virtual n-dimensional array; identifying common CFs between the target and second nodes using a commonality module which comprises code executing in the processor; generating at least one new coded form based on combinations of the identified, common CFs which, when inserted into the virtual n-dimensional array, results in a placement within the target node, using a coded form generator module which comprises code executing in the processor; and outputting a chemical identifier corresponding to the new coded form. 15. The method of claim 2 , further comprising: generating, with a synthesis design module configured as code executing on the processor to generate, based on the chemical identifier corresponding to the new coded form, a synthesis strategy for synthesizing a compound described by the chemical identifier corresponding to the new coded form. | 0.940168 |
7,715,933 | 1 | 3 | 1. A method of recording text sub data, comprising: recording a main data on a recording medium; recording text data including a plurality of individual text sub data units to be presented with the main data on the recording medium, the text sub data units being separated from the main data; and recording a navigation information file including navigation information for accessing the main data and linking information that links the main data and the text sub data units, the navigation information file being separated from the text sub data units, wherein the navigation information file includes a language information field specifying a language code of the text sub data units, wherein the plurality of text sub data units is preloaded into a memory and one of the plurality of text sub data units is displayed with the main data, wherein the navigation information file includes an index number of the text sub data units, wherein the navigation information file includes coding information for the main data and affecting the text data, wherein the plurality of text sub data units is preloaded into the memory before starting presenting with the main data and processed based on attribute information which includes language information regarding a font of the text sub data units, and wherein the text data is processed based on the coding information. | 1. A method of recording text sub data, comprising: recording a main data on a recording medium; recording text data including a plurality of individual text sub data units to be presented with the main data on the recording medium, the text sub data units being separated from the main data; and recording a navigation information file including navigation information for accessing the main data and linking information that links the main data and the text sub data units, the navigation information file being separated from the text sub data units, wherein the navigation information file includes a language information field specifying a language code of the text sub data units, wherein the plurality of text sub data units is preloaded into a memory and one of the plurality of text sub data units is displayed with the main data, wherein the navigation information file includes an index number of the text sub data units, wherein the navigation information file includes coding information for the main data and affecting the text data, wherein the plurality of text sub data units is preloaded into the memory before starting presenting with the main data and processed based on attribute information which includes language information regarding a font of the text sub data units, and wherein the text data is processed based on the coding information. 3. The method of claim 1 , wherein the recording medium is an optical disc. | 0.94177 |
6,134,532 | 26 | 27 | 26. A system for generating a profile vector in a computer environment, comprising: a converter capable of converting a plurality of observed behaviors of a user into an associated plurality of behavior vectors; and a profile adapter capable of repeatedly modifying a profile vector indicative of the user based on the plurality of behavior vectors. | 26. A system for generating a profile vector in a computer environment, comprising: a converter capable of converting a plurality of observed behaviors of a user into an associated plurality of behavior vectors; and a profile adapter capable of repeatedly modifying a profile vector indicative of the user based on the plurality of behavior vectors. 27. The system as defined in claim 26, wherein at least one of the plurality of observed user behaviors is selected from the group consisting of: submitting a query to a web site, requesting a web page, purchasing a product, visiting a merchant, visiting a web site, inquiring about a product, watching a TV show, and watching a movie. | 0.853584 |
8,132,053 | 6 | 7 | 6. A system for testing computing devices, comprising: one or more computer processors; at least one computer memory accessible by at least one of the one or more computer processors; a client application component executed by at least one of the one or more computer processors for generating control instructions for a device under test, wherein the control instructions describe a first set of test cases for the device under test; and a test case generation component executed by at least one of the one or more computer processors for: obtaining the generated control instructions from the client application component, analyzing the control instructions to determine at least one attribute of the first set of test cases described by the control instructions for the device under test, modifying the control instructions based on the at least one attribute of the first set of test cases responsive to the determination of at least one attribute of the first set of test cases, the modified control instructions describing a second set of test cases with at least one different attribute than the first set of test cases, transmitting the second set of test cases to the device under test, and obtaining at least one output generated by the device under test, wherein the at least one output generated by the device under test is responsive to the second set of test cases described by the modified control instructions; wherein the control instructions are analyzed without generation of the first set of test cases. | 6. A system for testing computing devices, comprising: one or more computer processors; at least one computer memory accessible by at least one of the one or more computer processors; a client application component executed by at least one of the one or more computer processors for generating control instructions for a device under test, wherein the control instructions describe a first set of test cases for the device under test; and a test case generation component executed by at least one of the one or more computer processors for: obtaining the generated control instructions from the client application component, analyzing the control instructions to determine at least one attribute of the first set of test cases described by the control instructions for the device under test, modifying the control instructions based on the at least one attribute of the first set of test cases responsive to the determination of at least one attribute of the first set of test cases, the modified control instructions describing a second set of test cases with at least one different attribute than the first set of test cases, transmitting the second set of test cases to the device under test, and obtaining at least one output generated by the device under test, wherein the at least one output generated by the device under test is responsive to the second set of test cases described by the modified control instructions; wherein the control instructions are analyzed without generation of the first set of test cases. 7. The system as recited in claim 6 , wherein the control instructions correspond to a test grammar. | 0.798387 |
8,453,110 | 15 | 17 | 15. A non-transitory computer readable medium to store instructions executable in at least one computer, the instructions comprising: one or more instructions that, when executed by the at least one computer, cause the at least one computer to: determine a plurality of interface types, each of the plurality of interface types being associated with a respective subset of a plurality of parameters; identify one or more parameters associated with two components of a model, the one or more parameters including at least one of: a size parameter, a clock parameter, or a power parameter; identify an interface type, from the plurality of interface types, based on the one or more parameters, the respective subset of the plurality of parameters, associated with the identified interface type, corresponding to the one or more parameters, and the one or more instructions to identify the interface type further including: one or more instructions to apply a cost function to the one or more parameters of the model to produce cost results, and one or more instructions to identify the interface type based on the produced cost results; and generate code representative of an interface between the two components based on the identified interface type. | 15. A non-transitory computer readable medium to store instructions executable in at least one computer, the instructions comprising: one or more instructions that, when executed by the at least one computer, cause the at least one computer to: determine a plurality of interface types, each of the plurality of interface types being associated with a respective subset of a plurality of parameters; identify one or more parameters associated with two components of a model, the one or more parameters including at least one of: a size parameter, a clock parameter, or a power parameter; identify an interface type, from the plurality of interface types, based on the one or more parameters, the respective subset of the plurality of parameters, associated with the identified interface type, corresponding to the one or more parameters, and the one or more instructions to identify the interface type further including: one or more instructions to apply a cost function to the one or more parameters of the model to produce cost results, and one or more instructions to identify the interface type based on the produced cost results; and generate code representative of an interface between the two components based on the identified interface type. 17. The non-transitory computer readable medium of claim 15 , the instructions further comprising: one or more instructions that, when executed by the at least one computer, cause the at least one computer to: identify an interaction between the two components; and configure the interface based on the identified interaction. | 0.660417 |
8,793,593 | 1 | 16 | 1. A method comprising: storing at a social networking system a social graph comprising a plurality of graph objects interconnected by graph actions, the graph actions having graph action types defined by entities external to, and independent from, the social networking system, where each of the graph actions represent a relationship between two or more graph objects and each of the graph action types define the relationship between the two or more graph objects; receiving user interactions on one or more external systems, the user interactions including graph actions performed on a first set of graph objects by users of the social networking system; providing a social content product interface to a viewing user, the social content product interface including selectable links associated with the received user interactions on the one or more external systems, the social content product interface associated with a user profile object on the social networking system and provided for display to users of the social networking system; receiving a selection of a link of the selectable links from the viewing user to perform a graph action on a graph object on an external system associated with a particular user interaction of the received user interactions, the particular user interaction associated with a particular user; sending a request to the external system for the viewing user to perform the graph action on the graph object associated with the particular user interaction, the request including an instruction to the external system to execute user input associated with the graph action on a user device associated with the viewing user; and responsive to the request, receiving an indication from the external system that the user device associated with the viewing user executed the user input associated with the graph action performed on the graph object associated with the particular user interaction, and updating the social graph based on the graph action performed, where the graph action is of a graph action type that was defined by one of the entities external to the social networking system. | 1. A method comprising: storing at a social networking system a social graph comprising a plurality of graph objects interconnected by graph actions, the graph actions having graph action types defined by entities external to, and independent from, the social networking system, where each of the graph actions represent a relationship between two or more graph objects and each of the graph action types define the relationship between the two or more graph objects; receiving user interactions on one or more external systems, the user interactions including graph actions performed on a first set of graph objects by users of the social networking system; providing a social content product interface to a viewing user, the social content product interface including selectable links associated with the received user interactions on the one or more external systems, the social content product interface associated with a user profile object on the social networking system and provided for display to users of the social networking system; receiving a selection of a link of the selectable links from the viewing user to perform a graph action on a graph object on an external system associated with a particular user interaction of the received user interactions, the particular user interaction associated with a particular user; sending a request to the external system for the viewing user to perform the graph action on the graph object associated with the particular user interaction, the request including an instruction to the external system to execute user input associated with the graph action on a user device associated with the viewing user; and responsive to the request, receiving an indication from the external system that the user device associated with the viewing user executed the user input associated with the graph action performed on the graph object associated with the particular user interaction, and updating the social graph based on the graph action performed, where the graph action is of a graph action type that was defined by one of the entities external to the social networking system. 16. The method of claim 1 , further comprising: providing for display in the social content product interface recent user interactions from a user associated with the social content product interface. | 0.875156 |
9,260,122 | 11 | 12 | 11. A system, comprising: a processing unit; a computer readable memory in communication with the processing unit; and a computer-readable storage medium in communication with the processing unit; wherein the processing unit executes program instructions stored on the computer-readable storage medium via the computer readable memory and thereby; acquires video image data over time from a plurality of synchronized cameras having overlapping views of a plurality of objects moving past the cameras and through a scene image in a linear array and with a determined speed; generates for each camera a plurality of object detection states that each have different times of frames of the acquired video image data within a plurality of frames of the camera video stream data, wherein each of the object detection states are associated with a confidence score; selects ones of the plurality of object detection states for each of the different times that have a highest confidence score optimized by using a global energy function to find maximum unary potentials (ψ(s k t )) of the object detection states as a function of a cross-frame constraint that is defined by other confidence scores of other object detection states from the video data that am acquired by a same one of the cameras at different times from a time of the object detection state, and of a cross-view constraint (T(s k t , s l t )) that is defined by other confidence scores of other object detection states in the video data from another different one of the cameras that has an overlapping field-of-view with the same one camera and that are also acquired at the different times; defines an optimal state path for a detection of an object from an initial time to a final time of a duration period comprising the selected ones of the plurality of object detection states that have the highest optimized confidence scores; and determines the unary potentials ψ(s k t ) according to:
ψ( s k t )= f ( s k t )Π t≠k T ( s k t ,s l t ); where f(s k t ) is a confidence score of an object state {s k t }returned by an object detector at view {k}; and determines the cross-view spatial constraint as a function of the unary potential according to: T ( s k t , s l t ) = max ( N ( s k t - s l t ; θ kl ) , N ( s k t - s l t + ∈ ; θ kl ) ) ; wherein θ kl =[μ v (k,l), Σ v (k,l)] for views {k} and {l}; “μ v ” is a four-by-four matrix of mean values; Σv” is a four-by-four covariance matrix; and “ε” is a cross-object constraint that represents an object spacing constant defined by a sequential context of the linear array of the objects determined as a function of spatial attributes of the objects relative to the determined speed of the movement of the cameras relative to the objects. | 11. A system, comprising: a processing unit; a computer readable memory in communication with the processing unit; and a computer-readable storage medium in communication with the processing unit; wherein the processing unit executes program instructions stored on the computer-readable storage medium via the computer readable memory and thereby; acquires video image data over time from a plurality of synchronized cameras having overlapping views of a plurality of objects moving past the cameras and through a scene image in a linear array and with a determined speed; generates for each camera a plurality of object detection states that each have different times of frames of the acquired video image data within a plurality of frames of the camera video stream data, wherein each of the object detection states are associated with a confidence score; selects ones of the plurality of object detection states for each of the different times that have a highest confidence score optimized by using a global energy function to find maximum unary potentials (ψ(s k t )) of the object detection states as a function of a cross-frame constraint that is defined by other confidence scores of other object detection states from the video data that am acquired by a same one of the cameras at different times from a time of the object detection state, and of a cross-view constraint (T(s k t , s l t )) that is defined by other confidence scores of other object detection states in the video data from another different one of the cameras that has an overlapping field-of-view with the same one camera and that are also acquired at the different times; defines an optimal state path for a detection of an object from an initial time to a final time of a duration period comprising the selected ones of the plurality of object detection states that have the highest optimized confidence scores; and determines the unary potentials ψ(s k t ) according to:
ψ( s k t )= f ( s k t )Π t≠k T ( s k t ,s l t ); where f(s k t ) is a confidence score of an object state {s k t }returned by an object detector at view {k}; and determines the cross-view spatial constraint as a function of the unary potential according to: T ( s k t , s l t ) = max ( N ( s k t - s l t ; θ kl ) , N ( s k t - s l t + ∈ ; θ kl ) ) ; wherein θ kl =[μ v (k,l), Σ v (k,l)] for views {k} and {l}; “μ v ” is a four-by-four matrix of mean values; Σv” is a four-by-four covariance matrix; and “ε” is a cross-object constraint that represents an object spacing constant defined by a sequential context of the linear array of the objects determined as a function of spatial attributes of the objects relative to the determined speed of the movement of the cameras relative to the objects. 12. The system of claim 11 , wherein the processing unit executes the program instructions stored on the computer-readable storage medium via the computer readable memory, and thereby further: determines the cross-frame constraint (Φ(s k t , s l t+1 ) according to: Φ ( s k t , s l t + 1 ) = max ( ( F ( s k t - s l t + 1 ; λ ) , ( F ( s k t - s l t + 1 + ∈ ; λ ) ) ; wherein λ=[μ f , σ f , μ v , Σ v , τ], <μ f , σ f > and models a Gaussian distribution of an object state at a next frame given its state at the previous frame; “τ” is the determined speed of the movement of the cameras relative to the objects; and F( ) is a distance function that computes a matching score for each pair of object states (s k t , s l t+1 ), given an object state (s k t ) at frame (t), and (s l t+1 ) at frame (t+1), wherein (k) and (l) may be different views, and wherein (s k t ) and (s l t+1 ) may correspond to a same object or to two different, adjacent objects. | 0.501543 |
10,127,318 | 8 | 9 | 8. A computer program product for processing a request for a document that is unavailable on a network comprising: a computer readable storage medium having computer readable program code embodied therewith for execution on a processing system, the computer readable program code comprising computer readable program code configured to: process a request for a previously accessed document from a corresponding link by: sending the request to a location on the network of a source storing the previously accessed document; receiving a response from the source including one of: an error message, and content accessed by the source based on the request; analyzing the response and determining that the previously accessed document is unavailable on the network when one of: the response includes the error message, and the response includes the accessed content and a number of different words between the accessed content and stored content of the previously accessed document from a prior access exceeds a predetermined value; and in response to the previously accessed document being unavailable on the network, generating a query and identifying a plurality of alternative documents on the network with content pertaining to content of the previously accessed document and relating to a network group of users, wherein the network group of users is associated with a subject matter, and wherein the query includes first keywords from metadata associated with the previously accessed document and second keywords pertaining to one or more interests of the network group of users in the subject matter; present the identified alternative documents as a result of the request for the previously accessed document when the analyzing indicates that the previously accessed document is unavailable on the network; and replace the corresponding link, when the previously accessed document is unavailable on the network, with a link to a presented alternative document based on a degree of confidence in the presented alternative document, determined from a quantity of user selections for the presented alternative document, wherein the presented alternative document is a most frequently selected alternative document of the identified alternative documents. | 8. A computer program product for processing a request for a document that is unavailable on a network comprising: a computer readable storage medium having computer readable program code embodied therewith for execution on a processing system, the computer readable program code comprising computer readable program code configured to: process a request for a previously accessed document from a corresponding link by: sending the request to a location on the network of a source storing the previously accessed document; receiving a response from the source including one of: an error message, and content accessed by the source based on the request; analyzing the response and determining that the previously accessed document is unavailable on the network when one of: the response includes the error message, and the response includes the accessed content and a number of different words between the accessed content and stored content of the previously accessed document from a prior access exceeds a predetermined value; and in response to the previously accessed document being unavailable on the network, generating a query and identifying a plurality of alternative documents on the network with content pertaining to content of the previously accessed document and relating to a network group of users, wherein the network group of users is associated with a subject matter, and wherein the query includes first keywords from metadata associated with the previously accessed document and second keywords pertaining to one or more interests of the network group of users in the subject matter; present the identified alternative documents as a result of the request for the previously accessed document when the analyzing indicates that the previously accessed document is unavailable on the network; and replace the corresponding link, when the previously accessed document is unavailable on the network, with a link to a presented alternative document based on a degree of confidence in the presented alternative document, determined from a quantity of user selections for the presented alternative document, wherein the presented alternative document is a most frequently selected alternative document of the identified alternative documents. 9. The computer program product of claim 8 , wherein identifying the plurality of alternative documents includes: extracting document information from the previously accessed document in response to one of a prior access of that document and entering that document on a list indicating prior accessed documents. | 0.501603 |
8,145,678 | 1 | 2 | 1. A method of providing information to one or more users of an enterprise-based social networking computing environment comprising: generating an informational feed that includes enterprise-based system-generated events associated with one or more users of interest of the enterprise-based social networking computing environment based in part on an organizational context of an enterprise to generate the enterprise-based system-generated events; providing a comment to an enterprise-based system-generated event associated with a defined user of interest; updating the informational feed to delineate the comment interleaved with the enterprise-based system-generated events to display comment information as part of the informational feed; and, providing an updated informational feed including the comment information to a tracking user and automatically adding a commenting user associated with the comment to a tracking list of the tracking user without requiring mutual collaboration in order for the commenting user to be included in the tracking list of the tracking user. | 1. A method of providing information to one or more users of an enterprise-based social networking computing environment comprising: generating an informational feed that includes enterprise-based system-generated events associated with one or more users of interest of the enterprise-based social networking computing environment based in part on an organizational context of an enterprise to generate the enterprise-based system-generated events; providing a comment to an enterprise-based system-generated event associated with a defined user of interest; updating the informational feed to delineate the comment interleaved with the enterprise-based system-generated events to display comment information as part of the informational feed; and, providing an updated informational feed including the comment information to a tracking user and automatically adding a commenting user associated with the comment to a tracking list of the tracking user without requiring mutual collaboration in order for the commenting user to be included in the tracking list of the tracking user. 2. The method of claim 1 , further comprising expanding the enterprise-based social networking computing environment to include the commenting user who commented on the enterprise-based system-generated event and displaying the comment as an event in the informational feed of the tracking user including one or more of expanding the tracking user's social network when a user who is not presently defined as a user of interest comments on an event of a user who is defined as a user of interest and when a user who is presently defined as a user of interest comments on an event of a user who is not defined as a user of interest. | 0.500791 |
5,418,716 | 1 | 2 | 1. A natural language processing system for recognizing sentence patterns (VPs) and grammatical cases comprising: means for providing a slot table which contains all VPs available to a predicate in an input sentence arranged in plural rows, and which contains arguments of the VPs expressed as slot conditions in slots positioned in a finite number of positions; a grammatical case pattern table which contains columns corresponding to grammatical cases that are arranged in the objective word-order found among grammatical cases in declarative sentences, and which contains all grammatical case patterns expressed as binary representations of existing/non-existing ones of grammatical cases in the rows corresponding to the grammatical case patterns; means for converting position information for arguments of a VP to grammatical cases on the grammatical case pattern table, which includes means for adding up numerical values, representing existing/non-existing ones of grammatical cases for the grammatical case patterns corresponding to VPs, until the sum of the numerical values adds up to the number of the position information in a basic pattern, and which treats as grammatical cases of the arguments of the VP only those grammatical cases corresponding to columns that correspond to the last number among the numerical values that have been added up; and means for processing a plurality of VPs in parallel, which includes means for comparing features of a candidate for arguments of VPs in the input sentence with corresponding slot conditions of the slots which belong to a selected position on the slot table through all available VPs, which recognizes as matched VPs only VPs that have a slot where each of all compared slot conditions shares the same value with the corresponding feature of the candidate, and which recognizes as matched grammatical cases only grammatical cases that have been described in the slots of the matched VPs. | 1. A natural language processing system for recognizing sentence patterns (VPs) and grammatical cases comprising: means for providing a slot table which contains all VPs available to a predicate in an input sentence arranged in plural rows, and which contains arguments of the VPs expressed as slot conditions in slots positioned in a finite number of positions; a grammatical case pattern table which contains columns corresponding to grammatical cases that are arranged in the objective word-order found among grammatical cases in declarative sentences, and which contains all grammatical case patterns expressed as binary representations of existing/non-existing ones of grammatical cases in the rows corresponding to the grammatical case patterns; means for converting position information for arguments of a VP to grammatical cases on the grammatical case pattern table, which includes means for adding up numerical values, representing existing/non-existing ones of grammatical cases for the grammatical case patterns corresponding to VPs, until the sum of the numerical values adds up to the number of the position information in a basic pattern, and which treats as grammatical cases of the arguments of the VP only those grammatical cases corresponding to columns that correspond to the last number among the numerical values that have been added up; and means for processing a plurality of VPs in parallel, which includes means for comparing features of a candidate for arguments of VPs in the input sentence with corresponding slot conditions of the slots which belong to a selected position on the slot table through all available VPs, which recognizes as matched VPs only VPs that have a slot where each of all compared slot conditions shares the same value with the corresponding feature of the candidate, and which recognizes as matched grammatical cases only grammatical cases that have been described in the slots of the matched VPs. 2. A natural language processing system for recognizing sentence pattern (VPs) and grammatical cases as claimed in claim 1, wherein the positions on the slot table are set by the locations of arguments in relation to the predicate. | 0.722356 |
8,392,188 | 1 | 6 | 1. A method for building a phonotactic model for domain independent speech recognition, comprising: recognizing phones from a user's input communication using a current phonotactic model stored in a database; detecting morphemes from the recognized phones; creating, via a new processor, a new phonotactic model using the detected morphemes, the creating the new phonotactic model comprising transforming a prior probability distribution associated with a first domain to a prior probability distribution associated with a second domain; replacing the current phonotactic model with the new phonotactic model in the database; and outputting the detected morphemes for processing. | 1. A method for building a phonotactic model for domain independent speech recognition, comprising: recognizing phones from a user's input communication using a current phonotactic model stored in a database; detecting morphemes from the recognized phones; creating, via a new processor, a new phonotactic model using the detected morphemes, the creating the new phonotactic model comprising transforming a prior probability distribution associated with a first domain to a prior probability distribution associated with a second domain; replacing the current phonotactic model with the new phonotactic model in the database; and outputting the detected morphemes for processing. 6. The method of claim 1 , wherein the morphemes in the user's input communication are derived from actions of the user, including a focus of attention of the user. | 0.789203 |
9,772,828 | 1 | 9 | 1. A non-transitory, computer-readable storage medium storing program instructions that when executed on a computing device cause the computing device to perform: identifying, in a class file, a class name comprising a structural description describing a new class identified by the class name, wherein the structural description comprises information identifying a generator function and one or more parameters for the generator function; executing the generator function identified by the structural description, wherein said executing comprises providing the one or more parameters identified by the structural description as input to the generator function; generating the new class based, at least in part, on results from said executing the generator function, wherein the new class is not loadable prior to said generating; identifying another structural description, wherein the other structural description comprises information identifying another generator function and one or more other parameters for the other generator function; and determining whether the structural description and the other structural description represent two equivalent classes based, at least in part, on a comparison between the structural description and the other structural description and a comparison between the one or more parameters and the one or more other parameters. | 1. A non-transitory, computer-readable storage medium storing program instructions that when executed on a computing device cause the computing device to perform: identifying, in a class file, a class name comprising a structural description describing a new class identified by the class name, wherein the structural description comprises information identifying a generator function and one or more parameters for the generator function; executing the generator function identified by the structural description, wherein said executing comprises providing the one or more parameters identified by the structural description as input to the generator function; generating the new class based, at least in part, on results from said executing the generator function, wherein the new class is not loadable prior to said generating; identifying another structural description, wherein the other structural description comprises information identifying another generator function and one or more other parameters for the other generator function; and determining whether the structural description and the other structural description represent two equivalent classes based, at least in part, on a comparison between the structural description and the other structural description and a comparison between the one or more parameters and the one or more other parameters. 9. The non-transitory, computer-readable storage medium of claim 1 , wherein the program instructions further cause the computing device to perform: loading the new class; and instantiating an instance of the new class; wherein said loading and said instantiating are performed subsequent to said generating. | 0.864078 |
7,644,069 | 1 | 6 | 1. A computer-implemented search ranking method suitable for a file system, comprising: receiving a query via a computer; calculating final relevance scores of individual file items via said computer with respect to said query at least partially in accordance with energy scores of individual nodes on a current file system energy tree, and outputting a list of search results based on said final relevance scores; and updating said energy scores of said individual nodes on said file system energy tree via said computer in response to an operation on said file system performed by a user, wherein said file system energy tree has a tree structure corresponding to that of said file system, and said individual nodes thereof respectively correspond to the individual file items in said file system. | 1. A computer-implemented search ranking method suitable for a file system, comprising: receiving a query via a computer; calculating final relevance scores of individual file items via said computer with respect to said query at least partially in accordance with energy scores of individual nodes on a current file system energy tree, and outputting a list of search results based on said final relevance scores; and updating said energy scores of said individual nodes on said file system energy tree via said computer in response to an operation on said file system performed by a user, wherein said file system energy tree has a tree structure corresponding to that of said file system, and said individual nodes thereof respectively correspond to the individual file items in said file system. 6. The method according to claim 1 , wherein in response to an operation performed by a user that moves a file item from a first position to a second position, a corresponding node is deleted from the first position of said file system energy tree, a corresponding node is created in the second position of said file system energy tree, and the created node is assigned to have an energy score equal to that of its current father node. | 0.798237 |
8,521,723 | 25 | 31 | 25. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more computing devices, cause: receiving a first query; transforming the first query, comprising an outer query that includes a selection of a subquery that (a) returns at most one row and (b) includes a first predicate that references a database object that is from the outer query and outside the subquery, to a second query that includes: a second predicate that corresponds to the first predicate, wherein the second predicate references an outer join, wherein the second query does not select any subquery having the first predicate or the second predicate, and wherein the second query is semantically equivalent to the first query; generating an execution plan for executing the second query instead of the first query. | 25. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more computing devices, cause: receiving a first query; transforming the first query, comprising an outer query that includes a selection of a subquery that (a) returns at most one row and (b) includes a first predicate that references a database object that is from the outer query and outside the subquery, to a second query that includes: a second predicate that corresponds to the first predicate, wherein the second predicate references an outer join, wherein the second query does not select any subquery having the first predicate or the second predicate, and wherein the second query is semantically equivalent to the first query; generating an execution plan for executing the second query instead of the first query. 31. The one or more non-transitory computer-readable storage media of claim 25 , wherein the second query does not include any correlated predicates. | 0.826744 |
10,129,295 | 6 | 7 | 6. The system of claim 1 , wherein the one or more computer-readable storage devices further have stored thereon instructions that are executable by the one or more processors to configure the computer system to identify entities infected by the same means based on similarity. | 6. The system of claim 1 , wherein the one or more computer-readable storage devices further have stored thereon instructions that are executable by the one or more processors to configure the computer system to identify entities infected by the same means based on similarity. 7. The system of claim 6 , wherein the same means comprises the same malicious software. | 0.965162 |
6,055,498 | 30 | 32 | 30. In an automatic speech processing system, a method for grading the pronunciation of a student speech sample, the method comprising: accepting said student speech sample which comprises a sequence of words spoken by a student speaker; operating a set of trained speech models to compute at least one posterior probability from said speech sample, each of said posterior probabilities being a probability that a particular portion of said student speech sample corresponds to a particular known model given said particular portion of said speech sample; and computing an evaluation score, herein referred to as the posterior-based evaluation score, of pronunciation quality for said student speech sample from said posterior probabilities wherein: said trained speech models comprise a set of phone models; said student speech sample comprises phones; and the step of operating said speech models comprises computing a frame-based posterior probability for each frame yt within a phone i of a phone type qi: ##EQU14## wherein: p(yt.vertline.qi, . . . ) is the probability of the frame yt according to a model corresponding to phone type qi; the sum over q runs over all phone types; and P(qi) represents the prior probability of the phone type qi. | 30. In an automatic speech processing system, a method for grading the pronunciation of a student speech sample, the method comprising: accepting said student speech sample which comprises a sequence of words spoken by a student speaker; operating a set of trained speech models to compute at least one posterior probability from said speech sample, each of said posterior probabilities being a probability that a particular portion of said student speech sample corresponds to a particular known model given said particular portion of said speech sample; and computing an evaluation score, herein referred to as the posterior-based evaluation score, of pronunciation quality for said student speech sample from said posterior probabilities wherein: said trained speech models comprise a set of phone models; said student speech sample comprises phones; and the step of operating said speech models comprises computing a frame-based posterior probability for each frame yt within a phone i of a phone type qi: ##EQU14## wherein: p(yt.vertline.qi, . . . ) is the probability of the frame yt according to a model corresponding to phone type qi; the sum over q runs over all phone types; and P(qi) represents the prior probability of the phone type qi. 32. The method according to claim 30 wherein the step of computing said posterior-based evaluation score for said student speech sample comprises computing for a phone i an average of the logarithm of the frame-based posterior probabilities of all frames within said phone i, said average herein referred to as a phone score .rho..sub.i, which is expressible as: ##EQU15## wherein the sum runs over all d.sub.i frames of said phone i. | 0.501149 |
8,365,064 | 7 | 16 | 7. The method claim 6 , wherein: the one or more keywords are a plurality of keywords; the keyword is a first keyword of the plurality of keywords; for each keyword of the plurality of keywords other than the first keyword, the computer-implemented tool automatically performing the steps of: requesting the search engine to conduct a second search on said each keyword; obtaining information that identifies a plurality of third network resources identified by the search engine as a result of the second search conducted on said each keyword; and presenting the plurality of third network resources to the user; receiving, from the user, a selection of a third network resource of the plurality of third network resources; in response to receiving the selection, automatically inserting, into the first network resource, a hyperlink to the third network resource. | 7. The method claim 6 , wherein: the one or more keywords are a plurality of keywords; the keyword is a first keyword of the plurality of keywords; for each keyword of the plurality of keywords other than the first keyword, the computer-implemented tool automatically performing the steps of: requesting the search engine to conduct a second search on said each keyword; obtaining information that identifies a plurality of third network resources identified by the search engine as a result of the second search conducted on said each keyword; and presenting the plurality of third network resources to the user; receiving, from the user, a selection of a third network resource of the plurality of third network resources; in response to receiving the selection, automatically inserting, into the first network resource, a hyperlink to the third network resource. 16. One or more non-transitory storage media storing instructions which, when executed by one or more processors cause performance of the method recited in claim 7 . | 0.895172 |
8,521,528 | 11 | 17 | 11. A method for distributed speech recognition, comprising: obtaining audio data from a caller participating in a call with an agent; receiving on a main recognizer, a main grammar template and the audio data; receiving on each of a plurality of secondary recognizers, the audio data and a reference that identifies a secondary grammar, wherein each secondary grammar is a non-overlapping section of the main grammar template; performing speech recognition on each of the secondary recognizers, comprising: identifying speech recognition results by applying the secondary grammar to the audio data; and selecting an n number of most likely speech recognition results; constructing by the main recognizer, a new grammar using the speech recognition results from each of the secondary recognizers as a new vocabulary based on the main grammar template; and identifying further speech recognition results by applying the new grammar to the audio data. | 11. A method for distributed speech recognition, comprising: obtaining audio data from a caller participating in a call with an agent; receiving on a main recognizer, a main grammar template and the audio data; receiving on each of a plurality of secondary recognizers, the audio data and a reference that identifies a secondary grammar, wherein each secondary grammar is a non-overlapping section of the main grammar template; performing speech recognition on each of the secondary recognizers, comprising: identifying speech recognition results by applying the secondary grammar to the audio data; and selecting an n number of most likely speech recognition results; constructing by the main recognizer, a new grammar using the speech recognition results from each of the secondary recognizers as a new vocabulary based on the main grammar template; and identifying further speech recognition results by applying the new grammar to the audio data. 17. A method according to claim 11 , further comprising: receiving on one or more of the secondary recognizers, a secondary grammar template; receiving on each of a plurality of further grammar recognizers, further grammar references to further grammars, wherein each further grammar is a non-overlapping section of the secondary grammar template received on the secondary recognizer; performing speech recognition on each of the further grammars and identifying a further n number of most likely speech recognition results; and constructing on the secondary recognizer, a new secondary grammar using the further speech recognition results based on the secondary grammar templates. | 0.500733 |
8,676,583 | 9 | 10 | 9. The method of claim 8 , further comprising: determining a partially observable Markov decision process (POMDP) reward score based on the performed actions; and responsive to a determination that a policy threshold is satisfied based on the POMDP reward score, outputting the policy parameters. | 9. The method of claim 8 , further comprising: determining a partially observable Markov decision process (POMDP) reward score based on the performed actions; and responsive to a determination that a policy threshold is satisfied based on the POMDP reward score, outputting the policy parameters. 10. The method of claim 9 , further comprising: responsive to a determination that a policy threshold is not satisfied based on the POMDP reward score, modifying the policy parameters based on one or more of: the simulated belief state, the second simulated belief state, the performed action, the second performed action, and the POMDP reward score; creating a second simulated user input with a pre-determined goal; determining a third simulated belief state of user intent based on the second simulated user input; and performing a third action based on the third simulated belief state and the modified policy parameters. | 0.746964 |
4,618,985 | 9 | 10 | 9. The speech sound generating system of claim 1 wherein said means for simulating electrically the vibration of the vocal cords comprises a vocal tract simulation circuit having an amplification ratio, and wherein said means continuously responsive to operator input for controlling the location of said formants causes voltages to vary in response to said operator input, and said voltages are applied to control the amplification ratio of said vocal tract simulation circuit through multiplication or division of signal amplitudes in one or more circuit branches, thus controlling the frequency location of said resonant peaks or formants. | 9. The speech sound generating system of claim 1 wherein said means for simulating electrically the vibration of the vocal cords comprises a vocal tract simulation circuit having an amplification ratio, and wherein said means continuously responsive to operator input for controlling the location of said formants causes voltages to vary in response to said operator input, and said voltages are applied to control the amplification ratio of said vocal tract simulation circuit through multiplication or division of signal amplitudes in one or more circuit branches, thus controlling the frequency location of said resonant peaks or formants. 10. The speech sound generating system of claim 9 wherein said voltages are obtained in digitized form, and said multiplication or division of signal amplitudes is done digitally. | 0.958507 |
8,443,074 | 8 | 9 | 8. The method as recited in claim 6 , wherein the act of computing comprises: computing the dependencies based on the messages that are detected by the act of monitoring and responsive to a predefined dependency interval. | 8. The method as recited in claim 6 , wherein the act of computing comprises: computing the dependencies based on the messages that are detected by the act of monitoring and responsive to a predefined dependency interval. 9. The method as recited in claim 8 , wherein the act of computing further comprises: rejecting a potential dependency on a given service as a false positive based on an average interval of a repeated message exchange to a given endhost that corresponds to the given service and responsive to a length of the predefined dependency interval. | 0.867601 |
9,734,637 | 16 | 17 | 16. A computer program product comprising a computer-readable medium, which is not a signal, having instructions recorded thereon for enabling a processor-based system to generate a virtual rig to animate a virtual three-dimensional representation of a human head, the instructions comprising: first instructions for enabling the processor-based system to associate a plurality of semantic identifiers with a plurality of respective vertices of a mesh that provides a virtual three-dimensional representation of a human head, the plurality of vertices defining a plurality of polygons that define a virtual three-dimensional representation of a face of the human head, each semantic identifier specifying a respective feature of the human head; second instructions for enabling the processor-based system to generate a virtual rig that is capable of maneuvering the mesh to a plurality of configurations based at least in part on association of the plurality of semantic identifiers with the plurality of respective vertices to animate the virtual three-dimensional representation of the human head; third instructions for enabling the processor-based system to determine that first and second virtual eyeballs are to be combined with the mesh to represent corresponding first and second physical eyeballs of the human head based at least in part on respective first and second designated subsets of the plurality of semantic identifiers; and fourth instructions for enabling the processor-based system to generate the first and second virtual eyeballs based at least in part on respective first and second subsets of the plurality of vertices that are associated with the respective first and second designated subsets of the plurality of semantic identifiers; wherein at least one of a position, a size, or a shape of the first virtual eyeball and a respective at least one of a position, a size, or a shape of the second virtual eyeball are asymmetric with respect to the mesh to represent that at least one of a position, a size, or a shape of the first physical eyeball and a respective at least one of a position, a size, or a shape of the second physical eyeball are asymmetric with respect to the human face; and wherein the second instructions comprise: instructions for enabling the processor-based system to define respective first and second reference elements based at least in part on the respective first and second designated subsets of the plurality of semantic identifiers and further based at least in part on a thickness of a virtual layer that is coincident with an outer surface of the mesh to serve as references for maneuvering the respective first and second virtual eyeballs, wherein the virtual layer is a virtual representation of skin that is coincident with the surface of the human head. | 16. A computer program product comprising a computer-readable medium, which is not a signal, having instructions recorded thereon for enabling a processor-based system to generate a virtual rig to animate a virtual three-dimensional representation of a human head, the instructions comprising: first instructions for enabling the processor-based system to associate a plurality of semantic identifiers with a plurality of respective vertices of a mesh that provides a virtual three-dimensional representation of a human head, the plurality of vertices defining a plurality of polygons that define a virtual three-dimensional representation of a face of the human head, each semantic identifier specifying a respective feature of the human head; second instructions for enabling the processor-based system to generate a virtual rig that is capable of maneuvering the mesh to a plurality of configurations based at least in part on association of the plurality of semantic identifiers with the plurality of respective vertices to animate the virtual three-dimensional representation of the human head; third instructions for enabling the processor-based system to determine that first and second virtual eyeballs are to be combined with the mesh to represent corresponding first and second physical eyeballs of the human head based at least in part on respective first and second designated subsets of the plurality of semantic identifiers; and fourth instructions for enabling the processor-based system to generate the first and second virtual eyeballs based at least in part on respective first and second subsets of the plurality of vertices that are associated with the respective first and second designated subsets of the plurality of semantic identifiers; wherein at least one of a position, a size, or a shape of the first virtual eyeball and a respective at least one of a position, a size, or a shape of the second virtual eyeball are asymmetric with respect to the mesh to represent that at least one of a position, a size, or a shape of the first physical eyeball and a respective at least one of a position, a size, or a shape of the second physical eyeball are asymmetric with respect to the human face; and wherein the second instructions comprise: instructions for enabling the processor-based system to define respective first and second reference elements based at least in part on the respective first and second designated subsets of the plurality of semantic identifiers and further based at least in part on a thickness of a virtual layer that is coincident with an outer surface of the mesh to serve as references for maneuvering the respective first and second virtual eyeballs, wherein the virtual layer is a virtual representation of skin that is coincident with the surface of the human head. 17. The computer program product of claim 16 , wherein the plurality of vertices is associated with a plurality of respective vertex values; wherein the instructions further comprise: fifth instructions for enabling the processor-based system to change at least one vertex value of the plurality of vertex values to be at least one respective changed vertex value on which the virtual three-dimensional representation of the human head is based, based at least in part on an image of the human head, to increase accuracy of the virtual three-dimensional representation of the human head; and wherein the second instructions include instructions for enabling the processor-based system to generate the virtual rig based at least in part on the at least one changed vertex value. | 0.500643 |
8,645,418 | 1 | 3 | 1. A word mining and evaluating method, the method comprising: calculating a Document Frequency (DF) of a word in mass categorized data; evaluating the word in multiple single-aspects according to the DF of the word; and evaluating the word in a multiple-aspect according to the evaluations in the multiple single-aspects to obtain an importance weight of the word; wherein the evaluating the word in a multiple-aspect according to the evaluations in the multiple single-aspects to obtain the importance weight of the word comprises, classifying candidate words into levels according to DFs of the candidate words, wherein the levels comprises a SuperHigh level, a MidHigh level, a MidLow level and a SuperLow level; and for each candidate word in the SuperHigh level, the MidHigh level or the MidLow level, determining the importance weight of the candidate word according to, an absolute value of a difference between an average inverse document frequency (AVAIDF) and an inverse document frequency (IDF) of the candidate word, a linear combination of mutual information (MI), expect cross entropy (ECE) and entropy (ENT) of the candidate word, a combination of logarithmic normalized chi-square and information gain (IG) of the candidate word, and logarithmic normalized selective preference (SELPRE) of the candidate word; and for each candidate word in the SuperLow level, determining the importance weight of the candidate word according to, an absolute value of a difference between an average inverse document frequency (AVAIDF) and an inverse document frequency (IDF) of the candidate word, a linear combination of mutual information (MI), expect cross entropy (ECE) and entropy (ENT) of the candidate word, and a combination of logarithmic normalized chi-square and information gain (IG) of the candidate word. | 1. A word mining and evaluating method, the method comprising: calculating a Document Frequency (DF) of a word in mass categorized data; evaluating the word in multiple single-aspects according to the DF of the word; and evaluating the word in a multiple-aspect according to the evaluations in the multiple single-aspects to obtain an importance weight of the word; wherein the evaluating the word in a multiple-aspect according to the evaluations in the multiple single-aspects to obtain the importance weight of the word comprises, classifying candidate words into levels according to DFs of the candidate words, wherein the levels comprises a SuperHigh level, a MidHigh level, a MidLow level and a SuperLow level; and for each candidate word in the SuperHigh level, the MidHigh level or the MidLow level, determining the importance weight of the candidate word according to, an absolute value of a difference between an average inverse document frequency (AVAIDF) and an inverse document frequency (IDF) of the candidate word, a linear combination of mutual information (MI), expect cross entropy (ECE) and entropy (ENT) of the candidate word, a combination of logarithmic normalized chi-square and information gain (IG) of the candidate word, and logarithmic normalized selective preference (SELPRE) of the candidate word; and for each candidate word in the SuperLow level, determining the importance weight of the candidate word according to, an absolute value of a difference between an average inverse document frequency (AVAIDF) and an inverse document frequency (IDF) of the candidate word, a linear combination of mutual information (MI), expect cross entropy (ECE) and entropy (ENT) of the candidate word, and a combination of logarithmic normalized chi-square and information gain (IG) of the candidate word. 3. The method of claim 1 , wherein the single-aspect evaluation comprises one or more of: Inverse Document Frequency (IDF), Average IDF (AVAIDF), chi-square, Information Gain (IG), Mutual Information (MI), Expect Cross Entropy (ECE), Entropy (ENT) and selective preference (SELPRE). | 0.913124 |
8,249,906 | 19 | 23 | 19. The planning method according to claim 1 , wherein such step of selecting, on such at least one computational device, by such at least one human project planner, at least one time-dependent relationship between such at least two activities comprises the step of selecting, on such at least one computational device, such at least one time-dependent relationship between any first activity embedded node, intermediate of the start and finish nodes of such at least one first activity, and any of the following: a) at least one activity start node of at least one second activity; b) at least one activity finish node of such at least one second activity; c) at least one milestone deadline; and d) at least one second activity embedded node, intermediate of the start and finish nodes of such at least one second activity. | 19. The planning method according to claim 1 , wherein such step of selecting, on such at least one computational device, by such at least one human project planner, at least one time-dependent relationship between such at least two activities comprises the step of selecting, on such at least one computational device, such at least one time-dependent relationship between any first activity embedded node, intermediate of the start and finish nodes of such at least one first activity, and any of the following: a) at least one activity start node of at least one second activity; b) at least one activity finish node of such at least one second activity; c) at least one milestone deadline; and d) at least one second activity embedded node, intermediate of the start and finish nodes of such at least one second activity. 23. The planning method according to claim 19 , wherein such at least one time-dependent relationship comprises “from such at least one first activity embedded node to such at least one second activity finish node” relationship. | 0.936206 |
8,392,270 | 1 | 5 | 1. A method comprising: receiving a search request including at least one keyword, from a first user, to search for an item offered for sale in item listings from a network-based marketplace of a network-based social platform via an interface provided by a social networking website of the network-based social platform, the network-based social platform being a platform that allows the first user to communicatively couple with at least a second user with whom the first user has a pre-established relationship that is stored in a user profile of the first user at the network-based social platform; performing a search using the at least one keyword on the network-based marketplace of the social networking platform to retrieve a plurality of listings of items offered for sale on the network-based marketplace of the network-based social platform; providing a search result, based on the performing of the search, that indicates the plurality of listing of items offered for sale on the network-based marketplace of the network-based social platform to the interface associated with the first user for display; receiving a selection of one of the plurality of listings of items form the search result from the first user to share information concerning the item selected from the search result to at least the second user; and sharing, using at least one processor, the information concerning the item to at least the second user. | 1. A method comprising: receiving a search request including at least one keyword, from a first user, to search for an item offered for sale in item listings from a network-based marketplace of a network-based social platform via an interface provided by a social networking website of the network-based social platform, the network-based social platform being a platform that allows the first user to communicatively couple with at least a second user with whom the first user has a pre-established relationship that is stored in a user profile of the first user at the network-based social platform; performing a search using the at least one keyword on the network-based marketplace of the social networking platform to retrieve a plurality of listings of items offered for sale on the network-based marketplace of the network-based social platform; providing a search result, based on the performing of the search, that indicates the plurality of listing of items offered for sale on the network-based marketplace of the network-based social platform to the interface associated with the first user for display; receiving a selection of one of the plurality of listings of items form the search result from the first user to share information concerning the item selected from the search result to at least the second user; and sharing, using at least one processor, the information concerning the item to at least the second user. 5. The method of claim 1 , further comprising providing the second user access to a list of the first user. | 0.84887 |
9,213,686 | 28 | 29 | 28. The system of claim 25 , comprising at least one repository and wherein the plurality of questions of the pre-defined patient intake form is stored in the at least one repository. | 28. The system of claim 25 , comprising at least one repository and wherein the plurality of questions of the pre-defined patient intake form is stored in the at least one repository. 29. The system of claim 28 , comprising question tree rules for application by the processing engine, wherein the question tree rules comprise rules for presenting at least a portion of the plurality of questions of the pre-defined patient intake form individually at a user interface. | 0.933936 |
7,567,915 | 1 | 2 | 1. An information system executed on one or more particular machines, comprising: a user and application interface; a reasoning engine in communication with the user and application interface; a knowledge manager in communication with the user and application interface and interfaced with the reasoning engine; and a distributed information service in communication with the reasoning engine, the knowledge manager, and the user and application interface; wherein the reasoning engine is configured to work in conjunction with the knowledge manager so as to enable the reasoning engine to handle events by executing one or more specific tasks prescribed by the knowledge manager to handle the events most appropriately; and wherein the reasoning engine includes: an interaction flow engine; an inference engine; a constraint satisfaction engine; an optimization engine; a categorization engine; and a data mining engine; wherein the interaction flow engine is in communication with the categorization engine, the inference engine, the constraint satisfaction engine and the optimization engine, the interaction flow engine being configured to invoke one or more of the categorization engine, the inference engine, the constraint satisfaction engine and the optimization engine to generate recommendations based on a profile of a user, rules obtained from the knowledge manager, constraints obtained from the knowledge manager, and an ontology. | 1. An information system executed on one or more particular machines, comprising: a user and application interface; a reasoning engine in communication with the user and application interface; a knowledge manager in communication with the user and application interface and interfaced with the reasoning engine; and a distributed information service in communication with the reasoning engine, the knowledge manager, and the user and application interface; wherein the reasoning engine is configured to work in conjunction with the knowledge manager so as to enable the reasoning engine to handle events by executing one or more specific tasks prescribed by the knowledge manager to handle the events most appropriately; and wherein the reasoning engine includes: an interaction flow engine; an inference engine; a constraint satisfaction engine; an optimization engine; a categorization engine; and a data mining engine; wherein the interaction flow engine is in communication with the categorization engine, the inference engine, the constraint satisfaction engine and the optimization engine, the interaction flow engine being configured to invoke one or more of the categorization engine, the inference engine, the constraint satisfaction engine and the optimization engine to generate recommendations based on a profile of a user, rules obtained from the knowledge manager, constraints obtained from the knowledge manager, and an ontology. 2. An information system as recited in claim 1 , wherein the knowledge manager includes an interaction flow model that is a repository for abstract situations to handle the events received by the reasoning engine, the situations defining the one or more tasks that are to be executed by the reasoning engine. | 0.544379 |
8,204,897 | 7 | 8 | 7. The method of claim 1 , further comprising storing, for each of the search suggestion items, an indication of a frequency with which the user selects the search suggestion items and combining the indication with the rank value for each of the search suggestion items before multiplying the rank values and the relevance values. | 7. The method of claim 1 , further comprising storing, for each of the search suggestion items, an indication of a frequency with which the user selects the search suggestion items and combining the indication with the rank value for each of the search suggestion items before multiplying the rank values and the relevance values. 8. The method of claim 7 , further comprising resetting the frequency, for each of the search suggestion items, at a reset time interval. | 0.945721 |
4,829,423 | 45 | 46 | 45. The method of claim 44, wherein the grammar provided in step (a) is a syntactically constrained grammar. | 45. The method of claim 44, wherein the grammar provided in step (a) is a syntactically constrained grammar. 46. The method of claim 45, wherein the grammar is context free. | 0.979368 |
8,117,594 | 6 | 7 | 6. A computer program product for enabling incremental development of a graphical editor for editing objects of a domain model using a visual model, wherein the computer program product is embodied on one or more non-transitory computer-readable media and comprises computer-readable instructions for: executing an editor engine component that initially creates the graphical editor for editing the objects of the domain model using the visual model, further comprising: processing, by the editor engine component, a visual model structural file to obtain a definition specified therein of the visual model an identification of a visual model descriptor file referenced in the definition, and an identification of a domain model structural file referenced in the definition, the domain model structural file defining the objects of the domain model; and processing, by the editor engine component, the identified visual model descriptor file to obtain a definition specified therein of constraints on the visual model, thereby configuring behavior to be exhibited by the created graphical editor for editing the objects defined in the domain model structural file; and subsequently changing at least one of the identification of the visual model descriptor file referenced in the definition and the identification of the domain model structural file referenced in the definition, wherein the subsequent change thereby causes the created graphical editor to exhibit different behaviors for editing the objects defined in the domain model structural file or to edit objects defined in a different domain model structural file, respectively. | 6. A computer program product for enabling incremental development of a graphical editor for editing objects of a domain model using a visual model, wherein the computer program product is embodied on one or more non-transitory computer-readable media and comprises computer-readable instructions for: executing an editor engine component that initially creates the graphical editor for editing the objects of the domain model using the visual model, further comprising: processing, by the editor engine component, a visual model structural file to obtain a definition specified therein of the visual model an identification of a visual model descriptor file referenced in the definition, and an identification of a domain model structural file referenced in the definition, the domain model structural file defining the objects of the domain model; and processing, by the editor engine component, the identified visual model descriptor file to obtain a definition specified therein of constraints on the visual model, thereby configuring behavior to be exhibited by the created graphical editor for editing the objects defined in the domain model structural file; and subsequently changing at least one of the identification of the visual model descriptor file referenced in the definition and the identification of the domain model structural file referenced in the definition, wherein the subsequent change thereby causes the created graphical editor to exhibit different behaviors for editing the objects defined in the domain model structural file or to edit objects defined in a different domain model structural file, respectively. 7. The computer program product according to claim 6 , wherein the visual model descriptor file further specifies a definition of at least one property of at least one visual element that is renderable with the graphical editor, and wherein responsive to modifying the definition of a particular one of the at least one property of a selected one of the at least one visual element in the visual model descriptor file, the processing of the visual model descriptor file by the editor engine component causes the rendering of the selected visual element to change according to the particular modified property. | 0.50082 |
8,891,884 | 11 | 19 | 11. A computer-readable storage device comprising computer-executable instructions that, when executed by a processor, cause the processor to perform acts comprising: defining in processor-readable memory a factor graph including a factor graph model replicated for each variable node of a set of variable nodes, each variable node being informed by one or more factors in the factor graph model, each factor being implemented as a regression tree; and training structure and parameterization of regression trees of the factor graph using an objective function and training data having a plurality of datasets, each dataset having elements of at least one labeled property, wherein the training determines parameters of energy functions for leaf nodes of the regression trees. | 11. A computer-readable storage device comprising computer-executable instructions that, when executed by a processor, cause the processor to perform acts comprising: defining in processor-readable memory a factor graph including a factor graph model replicated for each variable node of a set of variable nodes, each variable node being informed by one or more factors in the factor graph model, each factor being implemented as a regression tree; and training structure and parameterization of regression trees of the factor graph using an objective function and training data having a plurality of datasets, each dataset having elements of at least one labeled property, wherein the training determines parameters of energy functions for leaf nodes of the regression trees. 19. The computer-readable storage device of claim 11 , wherein the computer-executable instructions, when executed by the processor, further cause the processor to perform acts comprising: storing the parameters of the energy functions for the leaf nodes of the regression trees in the processor-readable memory. | 0.56546 |
9,652,799 | 13 | 14 | 13. Apparatus comprising: at least one processor; and at least one storage medium storing processor-executable instructions that, when executed by the at least one processor, perform a method comprising: receiving, from a user, a text input expressing a question asking for recommendation of a product having a requested characteristic; generating, in response to the question, an answer that identifies a product having the requested characteristic for recommendation to the user; analyzing, using natural language analysis, a plurality of product reviews comprising natural language text evaluations of the product, including analyzing the natural language in at least one passage of text in at least one product review of the plurality of product reviews to determine whether the natural language in the at least one passage of text has a meaning indicating that the product has the requested characteristic, at least in part by converting the question to one or more hypotheses and determining whether the natural language in the at least one passage of text has a meaning that entails at least one of the one or more hypotheses; in response to determining via the natural language analysis that the natural language in the at least one passage of text has a meaning indicating that the product has the requested characteristic, identifying the at least one passage of text in the at least one product review as providing supporting evidence for the product in answer to the question; and presenting to the user, in response to the text input, the answer and the at least one passage in the at least one product review identified as providing supporting evidence for the answer. | 13. Apparatus comprising: at least one processor; and at least one storage medium storing processor-executable instructions that, when executed by the at least one processor, perform a method comprising: receiving, from a user, a text input expressing a question asking for recommendation of a product having a requested characteristic; generating, in response to the question, an answer that identifies a product having the requested characteristic for recommendation to the user; analyzing, using natural language analysis, a plurality of product reviews comprising natural language text evaluations of the product, including analyzing the natural language in at least one passage of text in at least one product review of the plurality of product reviews to determine whether the natural language in the at least one passage of text has a meaning indicating that the product has the requested characteristic, at least in part by converting the question to one or more hypotheses and determining whether the natural language in the at least one passage of text has a meaning that entails at least one of the one or more hypotheses; in response to determining via the natural language analysis that the natural language in the at least one passage of text has a meaning indicating that the product has the requested characteristic, identifying the at least one passage of text in the at least one product review as providing supporting evidence for the product in answer to the question; and presenting to the user, in response to the text input, the answer and the at least one passage in the at least one product review identified as providing supporting evidence for the answer. 14. The apparatus of claim 13 , wherein the at least one product review comprises an evaluation of the product made by a purchaser of the product. | 0.868705 |
8,793,264 | 17 | 18 | 17. The computer-usable storage medium of claim 15 , wherein the computer-readable program code embodied therein causes a computer system to perform the method, and wherein the determining of the subset of the documents further comprises: creating a forward-in-time graph based on the similarity measurements and the dates the documents were created. | 17. The computer-usable storage medium of claim 15 , wherein the computer-readable program code embodied therein causes a computer system to perform the method, and wherein the determining of the subset of the documents further comprises: creating a forward-in-time graph based on the similarity measurements and the dates the documents were created. 18. The computer-usable storage medium of claim 17 , wherein the computer-readable program code embodied therein causes a computer system to perform the method, and wherein the creating of the forward-in-time graph further comprises: creating the forward-in-time graph that has path lengths from the particular document to other documents that are less than or equal to a user specified maximum path length value; and creating a reverse-in-time graph based on the forward-in-time graph. | 0.70257 |
9,038,016 | 9 | 10 | 9. The medium of claim 8 , wherein the first child class of graphical objects and the second child class of graphical objects differ from each other such that the first child class of graphical objects and the second child class of graphical objects are variants of each other. | 9. The medium of claim 8 , wherein the first child class of graphical objects and the second child class of graphical objects differ from each other such that the first child class of graphical objects and the second child class of graphical objects are variants of each other. 10. The medium of claim 9 , wherein: the instance of the parent class of graphical objects is a variable graphical object that contains the first child class of graphical objects and the second child class of graphical objects, and the dynamically switching comprises switching the variable graphical object between the instance of the first child class of graphical objects and the instance of the second child class of graphical objects. | 0.872901 |
8,926,672 | 1 | 10 | 1. In a spinal fixation structure having a bone anchor and a closure, the anchor for holding a spinal fixation longitudinal connecting member, the anchor having an open receiver with spaced apart arms defining a longitudinal connecting member receiving channel therebetween and the closure sized for being received within the channel and adapted for rotation and advancement into the channel between the arms to capture a portion of the longitudinal connecting member in the channel, the improvement comprising: a) a closure guide and advancement flange form extending helically along the closure and about a central axis of the closure, the flange form having a pitch of between 0.045 and 0.055 inches, and a first portion located adjacent a root of the form and extending radially outwardly therefrom in a direction away from the central axis, the first portion having a first load flank, the flange form having a second portion extending radially outwardly from a termination of the load flank to a crest of the flange form, the second portion having a first splay control ramp and an elevated toe, the toe being spaced from the load flank both radially and extending axially, the first and second portion forming an angle at their junction defined by an intersection of a radius running from the central axis and perpendicular thereto with a tangent along a substantial portion of the splay control ramp, wherein the angle is oblique; b) a discontinuous receiver guide and advancement flange form extending helically about and along an inner surface of each receiver arm, the receiver flange form having a second load flank and a second splay control ramp respectively engaging the first load flank and the first splay control ramp during mating of the closure flange form with the receiver flange form, the receiver flange form having clearance surfaces disposed in close spaced relation to a remainder of the closure flange form; and wherein c) a distance defining a thickness of the closure flange form first portion measured radially from the root to the termination of the load flank ranges between about forty percent to about sixty percent of an entire thickness of the closure flange form measured radially from the root to the crest. | 1. In a spinal fixation structure having a bone anchor and a closure, the anchor for holding a spinal fixation longitudinal connecting member, the anchor having an open receiver with spaced apart arms defining a longitudinal connecting member receiving channel therebetween and the closure sized for being received within the channel and adapted for rotation and advancement into the channel between the arms to capture a portion of the longitudinal connecting member in the channel, the improvement comprising: a) a closure guide and advancement flange form extending helically along the closure and about a central axis of the closure, the flange form having a pitch of between 0.045 and 0.055 inches, and a first portion located adjacent a root of the form and extending radially outwardly therefrom in a direction away from the central axis, the first portion having a first load flank, the flange form having a second portion extending radially outwardly from a termination of the load flank to a crest of the flange form, the second portion having a first splay control ramp and an elevated toe, the toe being spaced from the load flank both radially and extending axially, the first and second portion forming an angle at their junction defined by an intersection of a radius running from the central axis and perpendicular thereto with a tangent along a substantial portion of the splay control ramp, wherein the angle is oblique; b) a discontinuous receiver guide and advancement flange form extending helically about and along an inner surface of each receiver arm, the receiver flange form having a second load flank and a second splay control ramp respectively engaging the first load flank and the first splay control ramp during mating of the closure flange form with the receiver flange form, the receiver flange form having clearance surfaces disposed in close spaced relation to a remainder of the closure flange form; and wherein c) a distance defining a thickness of the closure flange form first portion measured radially from the root to the termination of the load flank ranges between about forty percent to about sixty percent of an entire thickness of the closure flange form measured radially from the root to the crest. 10. The improvement of claim 1 wherein the angle defined by the intersection of the radius and the tangent along the splay control ramp ranges between about sixty and about eighty degrees. | 0.771845 |
5,579,416 | 2 | 3 | 2. A character processing apparatus according to claim 1, wherein arbitrary type parameters are registered into said parameter memory means by a user. | 2. A character processing apparatus according to claim 1, wherein arbitrary type parameters are registered into said parameter memory means by a user. 3. A character processing apparatus according to claim 2, wherein the corresponding replacement character patterns are formed on the basis of the arbitrary type parameters stored in said parameter memory means. | 0.935424 |
9,430,467 | 1 | 5 | 1. A computer translation system comprising A language input device that detects a first language signal and a device location; and An interpretation engine coupled with the language input device and configured to: obtain the first language signal and the device location; activate a language model, including a mobile interference model, based on the first language signal and at least in part based on the device location; update utterance probabilities of the language model based the device location; extract a conceptual interlingua result set from the first language signal according to the updated language model and by applying the mobile interference model; map the conceptual interlingua result set to a second language representation of a second language; and cause an output device to present an output interpretation according to the second language derived from the second language representation. | 1. A computer translation system comprising A language input device that detects a first language signal and a device location; and An interpretation engine coupled with the language input device and configured to: obtain the first language signal and the device location; activate a language model, including a mobile interference model, based on the first language signal and at least in part based on the device location; update utterance probabilities of the language model based the device location; extract a conceptual interlingua result set from the first language signal according to the updated language model and by applying the mobile interference model; map the conceptual interlingua result set to a second language representation of a second language; and cause an output device to present an output interpretation according to the second language derived from the second language representation. 5. The system of claim 1 , wherein the output device is the language input device. | 0.827731 |
9,183,256 | 13 | 14 | 13. An apparatus for sequence analysis comprising: memory configured to store relations in a relational database; and a processor configured to carry out a comparison of at least one query sequence and at least one subject sequence, each stored as relations in the relational database, as one or more Structured Query Language (SQL) queries formulated to include at least one join operation, wherein at least one SQL query is formulated with a controls table that specifies parameters of the comparison, and store a result of the comparison as a result relation in the relational database, wherein a number of tuples in the result relation is larger than a multiplicative product of a number of tuples in the at least one subject sequence times a number of tuples in the at least one query sequence, to accommodate multiple points of alignment between each combination of the at least one query sequence and the at least one subject sequence that are compared. | 13. An apparatus for sequence analysis comprising: memory configured to store relations in a relational database; and a processor configured to carry out a comparison of at least one query sequence and at least one subject sequence, each stored as relations in the relational database, as one or more Structured Query Language (SQL) queries formulated to include at least one join operation, wherein at least one SQL query is formulated with a controls table that specifies parameters of the comparison, and store a result of the comparison as a result relation in the relational database, wherein a number of tuples in the result relation is larger than a multiplicative product of a number of tuples in the at least one subject sequence times a number of tuples in the at least one query sequence, to accommodate multiple points of alignment between each combination of the at least one query sequence and the at least one subject sequence that are compared. 14. An apparatus as in claim 13 wherein each of the query sequences is compared against each of the subject sequences for each of the parameters of the controls table. | 0.713058 |
9,747,271 | 19 | 20 | 19. The computer-readable medium of claim 18 , wherein the operations further comprise: determining whether any of the plurality of application-specific message templates stored in the message template database are associated with the primary language; and when one of the plurality of application-specific message templates is associated with the primary language, identify the one application-specific message template associated with the primary language as the particular message template. | 19. The computer-readable medium of claim 18 , wherein the operations further comprise: determining whether any of the plurality of application-specific message templates stored in the message template database are associated with the primary language; and when one of the plurality of application-specific message templates is associated with the primary language, identify the one application-specific message template associated with the primary language as the particular message template. 20. The computer-readable medium of claim 19 , wherein the operations further comprise when none of the plurality of application-specific message templates are associated with the primary language: determining another language from the one or more languages understood by the recipient; determining whether any of the plurality of application-specific message templates stored in the message template database are associated with the other language; and when one of the plurality of message templates is associated with the other language, identify the one application-specific message template associated with the other language as the particular message template. | 0.850023 |
8,478,702 | 4 | 5 | 4. The method of claim 2 , wherein the information atoms comprise a first set of information atoms, the method comprising: predicting a second set of information atoms related to the descriptor, based on the differences and third set of relationships; and outputting an information atom from the second set of information atoms. | 4. The method of claim 2 , wherein the information atoms comprise a first set of information atoms, the method comprising: predicting a second set of information atoms related to the descriptor, based on the differences and third set of relationships; and outputting an information atom from the second set of information atoms. 5. The method of claim 4 , wherein the set of differences comprises a first set of differences, the method comprising: obtaining a third set of information atoms; computing a fourth set of relationships between the second and third sets of information atoms; predicting a second set of differences related to the descriptor, based on the third and fourth sets of relationships; and outputting a difference from the second set of differences. | 0.775 |
9,271,023 | 1 | 4 | 1. A system for presenting targeted search results to a mobile communication facility operated by a user, the system comprising one or more computers having computer readable media having stored thereon instructions which, when executed by one or more processors of the one or more computers, causes the system to perform the steps of: (a) receiving information relating to one or more user characteristics of the user, wherein the one or more user characteristics are derived from information obtained through a carrier and include a viewing history of television content corresponding to the user as recorded through use of a television operated by the user, wherein the user is paying for use of the mobile communication facility with the carrier, wherein the user is paying for a television service via a subscription with a television service provider, wherein the viewing history of television content includes a plurality of episodes from a series viewed by the user via the television, wherein the television service provider transmits the series to the user, wherein the carrier is the same as the television service provider; (b) receiving from the mobile communication facility a search request containing a word; (c) determining that the word is more contextually relevant to the series than search results unrelated to the series, wherein the determination is based on the received viewing history of television content; and (d) transmitting to the mobile communication facility information corresponding to a viewing source for one or more episodes of the series not yet viewed by the user, wherein display of the information corresponding to the viewing source is prioritized over display of the search results unrelated to the series. | 1. A system for presenting targeted search results to a mobile communication facility operated by a user, the system comprising one or more computers having computer readable media having stored thereon instructions which, when executed by one or more processors of the one or more computers, causes the system to perform the steps of: (a) receiving information relating to one or more user characteristics of the user, wherein the one or more user characteristics are derived from information obtained through a carrier and include a viewing history of television content corresponding to the user as recorded through use of a television operated by the user, wherein the user is paying for use of the mobile communication facility with the carrier, wherein the user is paying for a television service via a subscription with a television service provider, wherein the viewing history of television content includes a plurality of episodes from a series viewed by the user via the television, wherein the television service provider transmits the series to the user, wherein the carrier is the same as the television service provider; (b) receiving from the mobile communication facility a search request containing a word; (c) determining that the word is more contextually relevant to the series than search results unrelated to the series, wherein the determination is based on the received viewing history of television content; and (d) transmitting to the mobile communication facility information corresponding to a viewing source for one or more episodes of the series not yet viewed by the user, wherein display of the information corresponding to the viewing source is prioritized over display of the search results unrelated to the series. 4. The system of claim 1 , wherein the carrier provides the television content by DSL, cable, or Internet. | 0.504673 |
9,213,682 | 8 | 10 | 8. A method for auditing a business document comprising: providing a slide; providing: a set of universal presentation rules comprising one or more parameters, said universal presentation rules configured to override all other presentation rules, wherein said universal presentation rules are enforced, irrespective of a user's wishes, across substantially every one of a user's one or more slides, wherein the universal presentation rules comprise: page word count rules which limit the total word count on each slide of the user; bullet point word count rules which limit the total word count on each bullet point included on each slide of the user; line count rules which limit the total number of lines on each slide of the user; color rules which limit the palette of colors used on each slide of the user; and density rules which limit the amount of white space on each slide of the user; and a set of customized presentation rules comprising one or more parameters, said customized presentation rules customized by the user, wherein said customized presentation rules allow the user to enforce the customized presentation rules on a single slide, wherein the customized presentation rules are included on a displayable audit panel, wherein the displayable audit panel is viewable adjacent to the slide; comparing a parameter of an element of the slide to a first parameter of the universal presentation rules; and conforming, when the parameter of the element of the slide is a non-compliant parameter, the element of the slide to the first parameter of the universal presentation rules; and comparing the universal presentation rules to the customized presentation rules, said comparing comprising: when the universal presentation rules are in conflict with the customized presentation rules, causing the universal presentation rules to override the customized presentation rules; and when the universal presentation rules are not in conflict with the customized presentation rules, comparing the parameter of the element of the slide to a second parameter of the customized presentation rules, wherein, when the parameter of the element of the slide is a non-compliant parameter, presenting to the user an option to conform the element of the slide to the second parameter of the customized presentation rules. | 8. A method for auditing a business document comprising: providing a slide; providing: a set of universal presentation rules comprising one or more parameters, said universal presentation rules configured to override all other presentation rules, wherein said universal presentation rules are enforced, irrespective of a user's wishes, across substantially every one of a user's one or more slides, wherein the universal presentation rules comprise: page word count rules which limit the total word count on each slide of the user; bullet point word count rules which limit the total word count on each bullet point included on each slide of the user; line count rules which limit the total number of lines on each slide of the user; color rules which limit the palette of colors used on each slide of the user; and density rules which limit the amount of white space on each slide of the user; and a set of customized presentation rules comprising one or more parameters, said customized presentation rules customized by the user, wherein said customized presentation rules allow the user to enforce the customized presentation rules on a single slide, wherein the customized presentation rules are included on a displayable audit panel, wherein the displayable audit panel is viewable adjacent to the slide; comparing a parameter of an element of the slide to a first parameter of the universal presentation rules; and conforming, when the parameter of the element of the slide is a non-compliant parameter, the element of the slide to the first parameter of the universal presentation rules; and comparing the universal presentation rules to the customized presentation rules, said comparing comprising: when the universal presentation rules are in conflict with the customized presentation rules, causing the universal presentation rules to override the customized presentation rules; and when the universal presentation rules are not in conflict with the customized presentation rules, comparing the parameter of the element of the slide to a second parameter of the customized presentation rules, wherein, when the parameter of the element of the slide is a non-compliant parameter, presenting to the user an option to conform the element of the slide to the second parameter of the customized presentation rules. 10. The method of claim 8 further comprising, when the universal presentation rules are not in conflict with the customer presentation rules, receiving, from the user, an instruction not to conform the element of the slide to the second parameter of the customized presentation rules. | 0.864504 |
9,703,832 | 1 | 3 | 1. A computer-implemented method comprising: in response to a first user specifying an attribute set including at least one rule attribute, performing a first search in a rule category database to retrieve rule categories corresponding to the attribute set; performing a second search in a rule provision database to retrieve rule provisions corresponding to the attribute set; identifying rules related to the rule categories retrieved from the rule category database and the rule provisions retrieved from the rule provision database, wherein identifying rules relating to the rule categories and the rule provisions comprises executing a pre-data collection sub-process that filters each retrieved rule to remove rules that are not applicable and stores surviving rules; performing a third search using the identified rules to retrieve, for each identified rule, fares corresponding to the identified rule from a fares database, wherein the third search is performed as N search processes that are executed in parallel; building a list of eligible fares that are not invalidated by the attribute set using the fares retrieved from the fares database, wherein the list of eligible fares is a merged list obtained from a list output from each of the N search processes; creating a functional index including one or more entries, each entry associating one of the rule categories to one or more of the eligible fares based on the corresponding attribute defined by the entry; associating the functional index with the attribute set; and in response to a second user specifying the attribute set, retrieving the fares from the fares database using the functional index. | 1. A computer-implemented method comprising: in response to a first user specifying an attribute set including at least one rule attribute, performing a first search in a rule category database to retrieve rule categories corresponding to the attribute set; performing a second search in a rule provision database to retrieve rule provisions corresponding to the attribute set; identifying rules related to the rule categories retrieved from the rule category database and the rule provisions retrieved from the rule provision database, wherein identifying rules relating to the rule categories and the rule provisions comprises executing a pre-data collection sub-process that filters each retrieved rule to remove rules that are not applicable and stores surviving rules; performing a third search using the identified rules to retrieve, for each identified rule, fares corresponding to the identified rule from a fares database, wherein the third search is performed as N search processes that are executed in parallel; building a list of eligible fares that are not invalidated by the attribute set using the fares retrieved from the fares database, wherein the list of eligible fares is a merged list obtained from a list output from each of the N search processes; creating a functional index including one or more entries, each entry associating one of the rule categories to one or more of the eligible fares based on the corresponding attribute defined by the entry; associating the functional index with the attribute set; and in response to a second user specifying the attribute set, retrieving the fares from the fares database using the functional index. 3. The method of claim 1 , wherein performing the third search comprises: executing a data collection sub-process as a plurality of parallel data collection sub-processes to retrieve, for each identified rule, the eligible fares from the fares database and generate a plurality of fare lists. | 0.85975 |
8,677,377 | 27 | 30 | 27. A system for registering services for use in a domain, said system comprising: an execution environment comprising an active ontology modeling the domain, the active ontology comprising a logical arrangement of a plurality of active processing elements, wherein each active processing element is configured to receive at least one fact relating to the modeled domain and to perform at least one action responsive to at least one received fact; and a processor configured as a service broker for interfacing the at least one active ontology to a service-oriented architecture comprising a plurality of services; wherein a service registers with the at least one active ontology by specifying at least one of: one or more active processing elements that the service can accept; and one or more active processing elements that the service cannot accept and wherein the active ontology filters requests for services to the at least one of the plurality of services in accordance with the one or more active processing elements specified by the at least one of the plurality of services. | 27. A system for registering services for use in a domain, said system comprising: an execution environment comprising an active ontology modeling the domain, the active ontology comprising a logical arrangement of a plurality of active processing elements, wherein each active processing element is configured to receive at least one fact relating to the modeled domain and to perform at least one action responsive to at least one received fact; and a processor configured as a service broker for interfacing the at least one active ontology to a service-oriented architecture comprising a plurality of services; wherein a service registers with the at least one active ontology by specifying at least one of: one or more active processing elements that the service can accept; and one or more active processing elements that the service cannot accept and wherein the active ontology filters requests for services to the at least one of the plurality of services in accordance with the one or more active processing elements specified by the at least one of the plurality of services. 30. The system of claim 27 , wherein at least one received fact relates to at least one event collected from a user's environment. | 0.813218 |
9,424,528 | 17 | 19 | 17. A non-transitory computer-readable medium comprising a set of code instruction retained therein that, in response to execution, cause a computing system including at least one processor to perform operations, comprising: receiving a manufacturing recipe for an asset produced by a manufacturing tool; generating another manufacturing recipe by adjusting the manufacturing recipe based on a set of variables and a probability distribution function that determines a degree of change between a set of recipe parameters included in the manufacturing recipe and a set of other recipe parameters included in the other manufacturing recipe; and determining a function that predicts a set of output metrics for the asset based on the other manufacturing recipe, comprising relaxing a constraint for the set of output metrics to infer the function for the manufacturing tool. | 17. A non-transitory computer-readable medium comprising a set of code instruction retained therein that, in response to execution, cause a computing system including at least one processor to perform operations, comprising: receiving a manufacturing recipe for an asset produced by a manufacturing tool; generating another manufacturing recipe by adjusting the manufacturing recipe based on a set of variables and a probability distribution function that determines a degree of change between a set of recipe parameters included in the manufacturing recipe and a set of other recipe parameters included in the other manufacturing recipe; and determining a function that predicts a set of output metrics for the asset based on the other manufacturing recipe, comprising relaxing a constraint for the set of output metrics to infer the function for the manufacturing tool. 19. The non-transitory computer-readable medium of claim 17 , wherein the adjusting further comprises adjusting the manufacturing recipe based on a sequence in which to adjust the set of recipe parameters included in the manufacturing recipe. | 0.639881 |
8,972,933 | 1 | 9 | 1. A non-transitory computer-readable medium storing one or more computer-executable instructions that, when executed by a processor, cause the processor to: identify a portion of executable code, the portion of the executable code having semantics; receive a non-literal representation representing the semantics; configure an output format for the portion of the executable code, the output format to: specify whether the portion of the executable code is to be output as the non-literal representation or as the portion of the executable code; and output, based on the configuring, the portion of the executable code either as the portion of the executable code or as the non-literal representation, the outputting occurring without changing the portion of the executable code. | 1. A non-transitory computer-readable medium storing one or more computer-executable instructions that, when executed by a processor, cause the processor to: identify a portion of executable code, the portion of the executable code having semantics; receive a non-literal representation representing the semantics; configure an output format for the portion of the executable code, the output format to: specify whether the portion of the executable code is to be output as the non-literal representation or as the portion of the executable code; and output, based on the configuring, the portion of the executable code either as the portion of the executable code or as the non-literal representation, the outputting occurring without changing the portion of the executable code. 9. The medium of claim 1 , further storing one or more computer-executable instructions that, when executed by the processor, cause the processor to: reuse the non-literal representation from a first location in the executable code at a second location in the executable code without instantiating a new programming unit for the non-literal representation. | 0.721003 |
6,035,268 | 27 | 36 | 27. A programmable computer an apparatus for locating unidentified breaks between words in an input character string, comprising A) a computer memory element for storing the input character string, B) first memory means for storing a character-transition table including character segments of morphemes, C) second memory means for storing a dictionary, said dictionary including lexical entries, D) a statistical analysis module operably coupled with said first memory means storing character-transition table for reducing the number of unidentified word breaks by locating a first word break in a first segment of said input character string as a function of at least one statistical morpheme in said first segment, said first word break dividing said first segment into a first sub-segment and a second sub-segment, and E) a database analysis module operably coupled with said dictionary for locating substantially all of the remaining unidentified word breaks in said first and second sub-segments by comparing said first and second sub-segments with entries in said dictionary. | 27. A programmable computer an apparatus for locating unidentified breaks between words in an input character string, comprising A) a computer memory element for storing the input character string, B) first memory means for storing a character-transition table including character segments of morphemes, C) second memory means for storing a dictionary, said dictionary including lexical entries, D) a statistical analysis module operably coupled with said first memory means storing character-transition table for reducing the number of unidentified word breaks by locating a first word break in a first segment of said input character string as a function of at least one statistical morpheme in said first segment, said first word break dividing said first segment into a first sub-segment and a second sub-segment, and E) a database analysis module operably coupled with said dictionary for locating substantially all of the remaining unidentified word breaks in said first and second sub-segments by comparing said first and second sub-segments with entries in said dictionary. 36. The apparatus of claim 27, further comprising: a heuristic rule table including a set of heuristic rules, a heuristic rule module operably coupled with said heuristic rule table for identifying a character-transition in said first segment of said stored character string, such that the number of possible character combinations forming words in said stored character string are reduced. | 0.636194 |
8,214,217 | 1 | 2 | 1. A method comprising: extracting, via a processor, at a first time a plurality of phoneme sequences from a text corpus, where a phoneme sequence within the plurality of phoneme sequences occurs at least twice within the text corpus; identifying joins calculated to synthesize the phoneme sequence to yield identified joins; and storing the identified joins in a cache for use in speech synthesis at a second time that is later than the first time. | 1. A method comprising: extracting, via a processor, at a first time a plurality of phoneme sequences from a text corpus, where a phoneme sequence within the plurality of phoneme sequences occurs at least twice within the text corpus; identifying joins calculated to synthesize the phoneme sequence to yield identified joins; and storing the identified joins in a cache for use in speech synthesis at a second time that is later than the first time. 2. The method of claim 1 , further comprising: recording a frequency of occurrence for each of the plurality of phoneme sequences; and pruning the cache based on the frequency of occurrence. | 0.804527 |
8,725,760 | 11 | 13 | 11. A system for building a semantic network, the system comprising: a database for storing data related to an enterprise; a user input-output device coupled to the database; a processor responsive to inputs from the user input device and coupled to the database, the processor configured to: accessing a search request definition, based on a search request, within one of a plurality of knowledge domains, each of said knowledge domains representing a different subject matter category; retrieving data terms in the search request according to search request definition; accessing a data terms data structure within the knowledge domain; determining if data terms in the search request already exist in the knowledge domain data structure; based on a determination that data terms in the search request do not exist in the knowledge domain data structure: displaying a results object of related data terms in other knowledge domains, wherein the related terms are categorized by knowledge domain using current domain, terminology and terminology types to create terms for the data terms in the search request based on at least one related term in the other knowledge domains; generating associations from newly created terms to pre-existing terms in other knowledge domains that are related by terminology type so that the newly created terms and the pre-existing terms are displayed together in a subsequent results object; and verifying terminology definition based on the newly created term. | 11. A system for building a semantic network, the system comprising: a database for storing data related to an enterprise; a user input-output device coupled to the database; a processor responsive to inputs from the user input device and coupled to the database, the processor configured to: accessing a search request definition, based on a search request, within one of a plurality of knowledge domains, each of said knowledge domains representing a different subject matter category; retrieving data terms in the search request according to search request definition; accessing a data terms data structure within the knowledge domain; determining if data terms in the search request already exist in the knowledge domain data structure; based on a determination that data terms in the search request do not exist in the knowledge domain data structure: displaying a results object of related data terms in other knowledge domains, wherein the related terms are categorized by knowledge domain using current domain, terminology and terminology types to create terms for the data terms in the search request based on at least one related term in the other knowledge domains; generating associations from newly created terms to pre-existing terms in other knowledge domains that are related by terminology type so that the newly created terms and the pre-existing terms are displayed together in a subsequent results object; and verifying terminology definition based on the newly created term. 13. The system of claim 11 , wherein accessing a data terms data structure comprises: following a mapping of data transfer conditions between source data structures and the condition's destinations. | 0.502513 |
10,140,282 | 22 | 25 | 22. The computer-implemented method of claim 19 , wherein n is an integer having a lower bound and an upper bound that is based on a Unicode range of a first character of a domain name. | 22. The computer-implemented method of claim 19 , wherein n is an integer having a lower bound and an upper bound that is based on a Unicode range of a first character of a domain name. 25. The computer-implemented method of claim 22 , further comprising: extracting a prefix from each domain name in the domain name input stream, the prefix having a length of the lower bound −1; extracting a suffix from each domain name in the domain name input stream, the suffix having a length of the lower bound −1; and adding the prefix and the suffix to the plurality of domain string n-grams. | 0.884948 |
7,698,339 | 16 | 19 | 16. The computer-readable storage medium of claim 12 wherein the scoring techniques identify different keywords of a document and calculate significance of sentences based on the identified keywords. | 16. The computer-readable storage medium of claim 12 wherein the scoring techniques identify different keywords of a document and calculate significance of sentences based on the identified keywords. 19. The computer-readable storage medium of claim 16 wherein a scoring technique identifies a word of a document as a keyword based on the word being a named entity. | 0.947318 |
9,275,117 | 7 | 10 | 7. A non-transitory computer readable medium storing software for performing dependency mining, the software comprising: executable code that determines a block data source access sequence; executable code that splits the block data source access sequence into a plurality of subsequences that represent a sequence of block accesses; executable code that determines an access pattern for each of the plurality of subsequences; executable code that constructs at least one search tree based on the access pattern of each of the plurality of subsequences; executable code that performs a search task using the at least one search tree; executable code that determines dependent blocks using the at least one search tree and based on block dependency criteria, wherein each access pattern is an activity vector that identifies occurrences of a particular block in the plurality of subsequences; executable code that outputs a dependency mining search result based on the search task and the block dependency criteria; and executable code that uses the dependency mining search result in a storage management process in connection with at least one of the determined dependent blocks, wherein the block dependency criteria includes a second block being dependent on a first block in response to a confidence factor being greater than a predetermined threshold, the confidence factor corresponding to a number of occurrences where both the first block and second block are active divided by a number of occurrences where the first block is active, wherein subsets of the plurality of subsequences are grouped into a plurality of subset groups according to weighting characteristics of the block dependency criteria for each access pattern of the plurality of subsequences. | 7. A non-transitory computer readable medium storing software for performing dependency mining, the software comprising: executable code that determines a block data source access sequence; executable code that splits the block data source access sequence into a plurality of subsequences that represent a sequence of block accesses; executable code that determines an access pattern for each of the plurality of subsequences; executable code that constructs at least one search tree based on the access pattern of each of the plurality of subsequences; executable code that performs a search task using the at least one search tree; executable code that determines dependent blocks using the at least one search tree and based on block dependency criteria, wherein each access pattern is an activity vector that identifies occurrences of a particular block in the plurality of subsequences; executable code that outputs a dependency mining search result based on the search task and the block dependency criteria; and executable code that uses the dependency mining search result in a storage management process in connection with at least one of the determined dependent blocks, wherein the block dependency criteria includes a second block being dependent on a first block in response to a confidence factor being greater than a predetermined threshold, the confidence factor corresponding to a number of occurrences where both the first block and second block are active divided by a number of occurrences where the first block is active, wherein subsets of the plurality of subsequences are grouped into a plurality of subset groups according to weighting characteristics of the block dependency criteria for each access pattern of the plurality of subsequences. 10. The non-transitory computer readable medium according to claim 7 , wherein the block dependency criteria includes, for a block (a) and a block (b), the block (b) is depended from block (a) if:
d E ( a,b )≦(1−2 p threshold )·weight( a )+weight( b )
weight( a )≧ m where weight is a number of subsequences where identified block was active, m is a user defined threshold for the minimum number of subsequences where the identified block was active, p threshold is a user defined threshold from 0 to 1, and d E is a Euclidian distance in computational geometry. | 0.629096 |
9,224,038 | 1 | 4 | 1. A computer-implemented method comprising: receiving a sequence of strokes that represent a handwritten input; providing the sequence of strokes to both a delayed stroke handwriting recognizer and an overlapping handwriting recognizer, wherein a delayed stroke handwriting recognizer is a handwriting recognizer that orders strokes according to their respective horizontal spatial location before selecting one or more characters that correspond to the strokes, wherein an overlapping handwriting recognizer is a handwriting recognizer that does not reorder strokes according to their respective horizontal spatial location before selecting one or more characters that correspond to the strokes; receiving, from each of the delayed stroke handwriting recognizer and the overlapping handwriting recognizer, (i) a set of one or more candidate letters that the handwriting recognizer has selected as corresponding to the sequence of strokes, and (ii) a confidence score associated with the selection; and selecting, from among the set of candidate letters from the delayed stroke handwriting recognizer and the set of candidate letters from the overlapping handwriting recognizer, a particular set of candidate letters based on the confidence scores. | 1. A computer-implemented method comprising: receiving a sequence of strokes that represent a handwritten input; providing the sequence of strokes to both a delayed stroke handwriting recognizer and an overlapping handwriting recognizer, wherein a delayed stroke handwriting recognizer is a handwriting recognizer that orders strokes according to their respective horizontal spatial location before selecting one or more characters that correspond to the strokes, wherein an overlapping handwriting recognizer is a handwriting recognizer that does not reorder strokes according to their respective horizontal spatial location before selecting one or more characters that correspond to the strokes; receiving, from each of the delayed stroke handwriting recognizer and the overlapping handwriting recognizer, (i) a set of one or more candidate letters that the handwriting recognizer has selected as corresponding to the sequence of strokes, and (ii) a confidence score associated with the selection; and selecting, from among the set of candidate letters from the delayed stroke handwriting recognizer and the set of candidate letters from the overlapping handwriting recognizer, a particular set of candidate letters based on the confidence scores. 4. The method of claim 1 , wherein the sequence of strokes are received in an order opposite a conventional reading direction. | 0.883764 |
10,097,652 | 2 | 3 | 2. The non-transitory computer storage media of claim 1 , wherein the particular cookie-stitching rule is further selected based on a selected goal. | 2. The non-transitory computer storage media of claim 1 , wherein the particular cookie-stitching rule is further selected based on a selected goal. 3. The non-transitory computer storage media of claim 2 , wherein the selected goal is one of precision, recall, or F-beta measure, wherein: when the selected goal is precision, the selected rule has the highest precision; when the selected goal is recall, the selected rule has the highest recall; and when the selected goal is F-beta measure, the selected rule has the highest F-beta measure. | 0.890616 |
9,659,224 | 13 | 15 | 13. A method comprising: sending, from a device to one or more servers in communication with the device via a network, at least a portion of a first frame of image data including at least a first captured textual item within a first bounding box corresponding to a region of the first frame; receiving, from the one or more servers, first recognized text corresponding to the first captured textual item; sending, to the one or more servers, at least a portion of a second frame of image data including at least a second captured textual item within a second bounding box corresponding to a region of the second frame; receiving, from the one or more servers, second recognized text corresponding to the second captured textual item; comparing first characters of the first recognized text with second characters of the second recognized text, wherein comparing the first characters with the second characters includes: determining an edit distance between the first recognized text and the second recognized text, and determining that the edit distance satisfies an edit distance threshold, wherein the edit distance threshold depends on at least one of a type of the first recognized text or of the second recognized text; determining an overlap of the first bounding box relative with the second bounding box; determining that the first captured textual item matches the second captured textual item based at least in part on the comparison of characters of the first recognized text with characters of the second recognized text and on the overlap; generating merged text based at least in part on the first recognized text and the second recognized text; and displaying, on a display at the device, the merged text. | 13. A method comprising: sending, from a device to one or more servers in communication with the device via a network, at least a portion of a first frame of image data including at least a first captured textual item within a first bounding box corresponding to a region of the first frame; receiving, from the one or more servers, first recognized text corresponding to the first captured textual item; sending, to the one or more servers, at least a portion of a second frame of image data including at least a second captured textual item within a second bounding box corresponding to a region of the second frame; receiving, from the one or more servers, second recognized text corresponding to the second captured textual item; comparing first characters of the first recognized text with second characters of the second recognized text, wherein comparing the first characters with the second characters includes: determining an edit distance between the first recognized text and the second recognized text, and determining that the edit distance satisfies an edit distance threshold, wherein the edit distance threshold depends on at least one of a type of the first recognized text or of the second recognized text; determining an overlap of the first bounding box relative with the second bounding box; determining that the first captured textual item matches the second captured textual item based at least in part on the comparison of characters of the first recognized text with characters of the second recognized text and on the overlap; generating merged text based at least in part on the first recognized text and the second recognized text; and displaying, on a display at the device, the merged text. 15. The method of claim 13 , further comprising: performing a pre-processing operation on the first frame to determine that the first frame likely contains text. | 0.874219 |
8,880,406 | 4 | 10 | 4. The non-transitory computer-readable medium of claim 3 , wherein the application includes input controls for accessing a plurality of user interface windows and for entering information in a database. | 4. The non-transitory computer-readable medium of claim 3 , wherein the application includes input controls for accessing a plurality of user interface windows and for entering information in a database. 10. The non-transitory computer-readable medium of claim 4 , wherein the action includes changing a focus of a user interface window of the plurality of user interface windows presented in a display operably coupled with the computing device. | 0.938765 |
8,165,886 | 1 | 7 | 1. A speech processing method, comprising: receiving a speech input representing at least one of a command and a stream of data; analyzing the speech for characteristics of a command structure, and if so, entering a command mode; in a command mode, analyzing the speech input with respect to a set of at least one grammar representation, to determine an ambiguity and a completeness; based in the determined ambiguity and completeness, prompting the user in a contextually appropriate manner for further speech input, to at least one of reduce ambiguity and increase completeness; and if the speech input is sufficiently unambiguous and sufficiently complete, generating an output representing the command; and in an absence of a characteristic of a command structures: treating the speech input as one representative of data; and generating an output as a symbolic representation of the speech input, wherein the output generated representing the command is targeted to one of a plurality of respective applications while preserving a respective prior system state, wherein at least one of: after command execution, and in dependence on a result thereof, a system state is selectively restored or processing assumed by another application without restoring the prior system state; and a command restores one of a previously preserved system state. | 1. A speech processing method, comprising: receiving a speech input representing at least one of a command and a stream of data; analyzing the speech for characteristics of a command structure, and if so, entering a command mode; in a command mode, analyzing the speech input with respect to a set of at least one grammar representation, to determine an ambiguity and a completeness; based in the determined ambiguity and completeness, prompting the user in a contextually appropriate manner for further speech input, to at least one of reduce ambiguity and increase completeness; and if the speech input is sufficiently unambiguous and sufficiently complete, generating an output representing the command; and in an absence of a characteristic of a command structures: treating the speech input as one representative of data; and generating an output as a symbolic representation of the speech input, wherein the output generated representing the command is targeted to one of a plurality of respective applications while preserving a respective prior system state, wherein at least one of: after command execution, and in dependence on a result thereof, a system state is selectively restored or processing assumed by another application without restoring the prior system state; and a command restores one of a previously preserved system state. 7. The method according to claim 1 , wherein at least one of a non-linguistic implicit input is employed as a cue to determine at least one of a context, and a target software construct for analyzing said input; and at least one of a temporal analysis, natural language analysis, and syntactic analysis are used to determine a context of the speech input. | 0.86304 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.