patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
6,045,363 | 1 | 7 | 1. An educational aid for developing sight-word vocabulary in a student, comprising: a non-syllabified readable format text which is adapted to be or is already memorized verbatim by the student, said text having one or more words and each word having at least one syllable, and said text including a series of notations, each notation denoting at least one letter of said text, wherein portions of said words that require extended pronunciation are presented in a visually extended format so as to emphasize phonetic structure; and reinforcement means, separate from said text but adapted to be used together with said text, for reinforcing the student's sight recognition of words and syllables from said text; wherein said reinforcement means is operable to allow the student to note each successive notation in said text as the student recites said text from memory, and is further operable to allow the student to match specified words and syllables to corresponding words and syllables in said text by using sight recognition. | 1. An educational aid for developing sight-word vocabulary in a student, comprising: a non-syllabified readable format text which is adapted to be or is already memorized verbatim by the student, said text having one or more words and each word having at least one syllable, and said text including a series of notations, each notation denoting at least one letter of said text, wherein portions of said words that require extended pronunciation are presented in a visually extended format so as to emphasize phonetic structure; and reinforcement means, separate from said text but adapted to be used together with said text, for reinforcing the student's sight recognition of words and syllables from said text; wherein said reinforcement means is operable to allow the student to note each successive notation in said text as the student recites said text from memory, and is further operable to allow the student to match specified words and syllables to corresponding words and syllables in said text by using sight recognition. 7. The educational aid of claim 1, wherein said visual cues are gray-shaded squares placed below each word and said words are printed in a darker shade than that of said squares. | 0.722741 |
7,533,107 | 23 | 32 | 23. A computer program for integrating a plurality of different data sources, the computer program comprising computer executable instructions stored in a computer readable medium that when executed cause the computer to: obtain semantic information from each of the plurality of data sources; create a conceptual model for each of the plurality of data sources using said semantic information; access a secondary knowledge source having information relating the data sources to one another; and create an integrated semantic model using said conceptual models and said secondary knowledge source; wherein said semantic information comprises characterization of at least one of constraints that hold for subsets of data in the plurality of data sources and relationships that hold between the data; wherein said semantic information further comprises information expressing properties of the data that have not been explicitly encoded in an alphanumeric representation of the data or in a syntactic structure that holds together different data elements. | 23. A computer program for integrating a plurality of different data sources, the computer program comprising computer executable instructions stored in a computer readable medium that when executed cause the computer to: obtain semantic information from each of the plurality of data sources; create a conceptual model for each of the plurality of data sources using said semantic information; access a secondary knowledge source having information relating the data sources to one another; and create an integrated semantic model using said conceptual models and said secondary knowledge source; wherein said semantic information comprises characterization of at least one of constraints that hold for subsets of data in the plurality of data sources and relationships that hold between the data; wherein said semantic information further comprises information expressing properties of the data that have not been explicitly encoded in an alphanumeric representation of the data or in a syntactic structure that holds together different data elements. 32. A computer program as in claim 23 wherein each of the plurality of data sources has at least a class, and wherein said integrated semantic model comprises logic statements that express an instance, a subclass, and a method relation between at least one class from a first of the plurality of databases and one or more classes from others of the plurality of databases. | 0.557143 |
9,158,995 | 20 | 23 | 20. A system for object localization in images comprising: a patch representation generator which generates patch-based representations of a plurality of patches of an input image; a classifier component which classifies each of the patches with a trained classifier model based on the respective patch-based representation; a signature generator which generates a task-dependent representation of the input image based on the classifications of the patches; a retrieval component configured for retrieving at least one similar image from a set of images, based on a comparison measure between the task-dependent representation of the input image and task-dependent representations of images in the set of images, the task dependent representations having each been generated by classifying patch-based representations of a plurality of patches of a respective one of the images in the set of images with the trained classifier model and generating the task-dependent representation of the image based on the classifications of the patches; a segmentation component which segments the input image based on a location of an object in the at least one similar image and identifying a location of an object in the input image based on the segmentation; and a processor which implements the patch representation generator, classifier component, signature generator, and segmentation component. | 20. A system for object localization in images comprising: a patch representation generator which generates patch-based representations of a plurality of patches of an input image; a classifier component which classifies each of the patches with a trained classifier model based on the respective patch-based representation; a signature generator which generates a task-dependent representation of the input image based on the classifications of the patches; a retrieval component configured for retrieving at least one similar image from a set of images, based on a comparison measure between the task-dependent representation of the input image and task-dependent representations of images in the set of images, the task dependent representations having each been generated by classifying patch-based representations of a plurality of patches of a respective one of the images in the set of images with the trained classifier model and generating the task-dependent representation of the image based on the classifications of the patches; a segmentation component which segments the input image based on a location of an object in the at least one similar image and identifying a location of an object in the input image based on the segmentation; and a processor which implements the patch representation generator, classifier component, signature generator, and segmentation component. 23. The system of claim 20 , wherein the classifier component classifies patches of images in the set of images with the trained classifier model based on respective patch-based representations of the patches of the images in the set of images and the signature generator generates a task-dependent representation of each of the images in the set of images based on the classifications of the patches of the respective image. | 0.5 |
9,424,440 | 1 | 8 | 1. A computer-implemented document integrity verification method, executable by a processor, the method comprising: receiving a digital document in a word processing format into a non-transitory computer readable medium; generating a first baseline data sequence from the digital document, the first baseline data sequence having a first printable element and a second printable element following the first printable element of the first baseline data sequence; generating a first modified data sequence from the first baseline data sequence in accordance with a set of modification rules, the first modified data sequence having a first printable element and a second printable element following the first printable element of the first modified data sequence, wherein the first printable element of the first modified data sequence is identical to the first printable element of the first baseline data sequence, wherein the second printable element of the first modified data sequence is identical to the second element of the first baseline data sequence, wherein at least one unprintable element of the first baseline data sequence, between the first and final printable elements of the first baseline data sequence, is not in the first modified data sequence, so that the first modified data sequence is shorter than the first baseline data sequence, and wherein an integrity verification code (IVC) generated for the first modified data sequence will differ from an IVC generated for the first baseline data sequence; generating a first original IVC, wherein generating a first original IVC comprises performing a one-way operation on the first modified data sequence, and wherein the modification rules render tampering of the digital document undetectable for the at least one unprintable element within the first baseline data sequence; generating a second baseline data sequence from the digital document, the second baseline data sequence having a first printable element and a second printable element following the first printable element of the second baseline data sequence; wherein the second baseline data sequence is different than the first baseline data sequence, generating a second modified data sequence from the second baseline data sequence in accordance with the set of modification rules, the second modified data sequence having a first printable element and a second printable element following the first printable element of the second modified data sequence, wherein the first printable element of the second modified data sequence is identical to the first printable element of the second baseline data sequence, wherein the second printable element of the second modified data sequence is identical to the second element of the second baseline data sequence, wherein at least one unprintable element of the second baseline data sequence, between the first and final printable elements of the second baseline data sequence, is not in the second modified data sequence, so that the second modified data sequence is shorter than the second baseline data sequence, and wherein an IVC generated for the second modified data sequence will differ from an IVC generated for the second baseline data sequence; generating a second original IVC, wherein generating a second original IVC comprises performing a one-way operation on the second modified data sequence, and wherein the modification rules render tampering of the digital document undetectable for the at least one unprintable element within the second baseline data sequence; and publishing the digital document with at least a portion of the first original IVC and the second original IVC rendered on a face of the published document. | 1. A computer-implemented document integrity verification method, executable by a processor, the method comprising: receiving a digital document in a word processing format into a non-transitory computer readable medium; generating a first baseline data sequence from the digital document, the first baseline data sequence having a first printable element and a second printable element following the first printable element of the first baseline data sequence; generating a first modified data sequence from the first baseline data sequence in accordance with a set of modification rules, the first modified data sequence having a first printable element and a second printable element following the first printable element of the first modified data sequence, wherein the first printable element of the first modified data sequence is identical to the first printable element of the first baseline data sequence, wherein the second printable element of the first modified data sequence is identical to the second element of the first baseline data sequence, wherein at least one unprintable element of the first baseline data sequence, between the first and final printable elements of the first baseline data sequence, is not in the first modified data sequence, so that the first modified data sequence is shorter than the first baseline data sequence, and wherein an integrity verification code (IVC) generated for the first modified data sequence will differ from an IVC generated for the first baseline data sequence; generating a first original IVC, wherein generating a first original IVC comprises performing a one-way operation on the first modified data sequence, and wherein the modification rules render tampering of the digital document undetectable for the at least one unprintable element within the first baseline data sequence; generating a second baseline data sequence from the digital document, the second baseline data sequence having a first printable element and a second printable element following the first printable element of the second baseline data sequence; wherein the second baseline data sequence is different than the first baseline data sequence, generating a second modified data sequence from the second baseline data sequence in accordance with the set of modification rules, the second modified data sequence having a first printable element and a second printable element following the first printable element of the second modified data sequence, wherein the first printable element of the second modified data sequence is identical to the first printable element of the second baseline data sequence, wherein the second printable element of the second modified data sequence is identical to the second element of the second baseline data sequence, wherein at least one unprintable element of the second baseline data sequence, between the first and final printable elements of the second baseline data sequence, is not in the second modified data sequence, so that the second modified data sequence is shorter than the second baseline data sequence, and wherein an IVC generated for the second modified data sequence will differ from an IVC generated for the second baseline data sequence; generating a second original IVC, wherein generating a second original IVC comprises performing a one-way operation on the second modified data sequence, and wherein the modification rules render tampering of the digital document undetectable for the at least one unprintable element within the second baseline data sequence; and publishing the digital document with at least a portion of the first original IVC and the second original IVC rendered on a face of the published document. 8. The method of claim 1 further comprising generating a third baseline data sequence from the digital document, the third baseline data sequence having a first printable element and a second printable element following the first printable element of the third baseline data sequence; wherein the third baseline data sequence is different than the first baseline data sequence and the second baseline data sequence, generating a third modified data sequence from the third baseline data sequence in accordance with the set of modification rules, the third modified data sequence having a first printable element and a second printable element following the first printable element of the third modified data sequence, wherein the first printable element of the second modified data sequence is identical to the first printable element of the third baseline data sequence, wherein the second printable element of the third modified data sequence is identical to the second element of the third baseline data sequence, wherein at least one unprintable element of the third baseline data sequence, between the first and final printable elements of the third baseline data sequence, is not in the third modified data sequence, so that the third modified data sequence is shorter than the third baseline data sequence, and wherein an IVC generated for the third modified data sequence will differ from an IVC generated for the third baseline data sequence; generating a third original IVC, wherein generating a third original IVC comprises performing a one-way operation on the third modified data sequence, and wherein the modification rules render tampering of the digital document undetectable for the at least one unprintable element within the third baseline data sequence; wherein the third baseline data sequence is a different published page than the second baseline data sequence and both the third baseline data sequence and the second baseline data sequence are each a subset, less than all, of the first baseline data sequence; and publishing at least a portion of the third original IVC the face of the published document. | 0.5 |
9,015,580 | 1 | 12 | 1. A computer-network system implemented by an online stationery/card service for a user to personalize and send stationery/cards using a wireless device, the system comprising: a computer server configured to communicate with a wireless device and enable a user of the wireless device to personalize and send non-electronic stationery/cards, wherein the computer server is configured to enable a reminder list displayed on the wireless device, wherein the reminder list comprises a plurality of reminder entries each identifying an upcoming event associated with one or more contacts of the user stored in a contacts database, wherein the reminder list is organized based on a prioritization scheme with a highest priority event selected within the reminder list, wherein the computer server is configured to enable a recommendation region displayed on the wireless device, wherein the computer server is configured to automatically populate the recommendation region with one or more recommended stationery/card designs for the highest priority event in the reminder list; and a stationery/card personalization engine configured to receive user's selection of one of the one or more recommended stationery/card designs in the recommendation region using the wireless device, to provide the user with a set of personalization options related to the selected stationery/card design, and to generate a personalized stationery/card based on the selected stationery/card design and the user's input. | 1. A computer-network system implemented by an online stationery/card service for a user to personalize and send stationery/cards using a wireless device, the system comprising: a computer server configured to communicate with a wireless device and enable a user of the wireless device to personalize and send non-electronic stationery/cards, wherein the computer server is configured to enable a reminder list displayed on the wireless device, wherein the reminder list comprises a plurality of reminder entries each identifying an upcoming event associated with one or more contacts of the user stored in a contacts database, wherein the reminder list is organized based on a prioritization scheme with a highest priority event selected within the reminder list, wherein the computer server is configured to enable a recommendation region displayed on the wireless device, wherein the computer server is configured to automatically populate the recommendation region with one or more recommended stationery/card designs for the highest priority event in the reminder list; and a stationery/card personalization engine configured to receive user's selection of one of the one or more recommended stationery/card designs in the recommendation region using the wireless device, to provide the user with a set of personalization options related to the selected stationery/card design, and to generate a personalized stationery/card based on the selected stationery/card design and the user's input. 12. The computer-network system as in claim 1 , wherein the computer server is configured to enable a schedule calendar displayed on the wireless device to allow the user to schedule the delivery date for the personalized stationery/card. | 0.815217 |
7,954,115 | 1 | 4 | 1. A computer-implementable method, comprising: providing a network-based community portal having a mashup platform integrated therewith; designating at least one pre-negotiated bartering agreement, in response to a particular user input by at least one user of said network-based community portal; and associating a management module with a network-based community portal that permits said at least one user of said network-based community portal to describe to said mashup platform said at least one pre-negotiated bartering agreement in order to permit said network-based community portal to manage the utilization of mashup applications associated with said mashup platform and at least one widget contained by said mashup applications. | 1. A computer-implementable method, comprising: providing a network-based community portal having a mashup platform integrated therewith; designating at least one pre-negotiated bartering agreement, in response to a particular user input by at least one user of said network-based community portal; and associating a management module with a network-based community portal that permits said at least one user of said network-based community portal to describe to said mashup platform said at least one pre-negotiated bartering agreement in order to permit said network-based community portal to manage the utilization of mashup applications associated with said mashup platform and at least one widget contained by said mashup applications. 4. The computer-implementable method of claim 1 further comprising providing a server accessible by said management module for the management of said network-based community portal and said mashup platform. | 0.636042 |
8,935,347 | 19 | 26 | 19. A non-transitory computer readable storage medium storing one or more programs for execution by the one or more processors of a computer system, the one or more programs comprising instructions for: receiving message information from a server system, the message information representing a set of messages, and an importance score associated with each respective message in the set of messages, wherein the importance score is generated based at least in part on a global importance prediction model, and a user importance prediction model; in accordance with a determination that the set of messages include one or more unread priority messages, wherein priority messages comprise messages with which the associated importance score satisfy one or more predefined message importance criteria: presenting a new mail notification, wherein the global importance prediction model includes a social graph-related weight, the user importance prediction model is based on information associated with a single user, and the global importance prediction model is based on information associated with a plurality of users. | 19. A non-transitory computer readable storage medium storing one or more programs for execution by the one or more processors of a computer system, the one or more programs comprising instructions for: receiving message information from a server system, the message information representing a set of messages, and an importance score associated with each respective message in the set of messages, wherein the importance score is generated based at least in part on a global importance prediction model, and a user importance prediction model; in accordance with a determination that the set of messages include one or more unread priority messages, wherein priority messages comprise messages with which the associated importance score satisfy one or more predefined message importance criteria: presenting a new mail notification, wherein the global importance prediction model includes a social graph-related weight, the user importance prediction model is based on information associated with a single user, and the global importance prediction model is based on information associated with a plurality of users. 26. The non-transitory computer readable storage medium of claim 19 , wherein the importance score associated with a respective message is generated based also at least in part on a group importance prediction model. | 0.733333 |
5,386,556 | 7 | 8 | 7. A method as claimed in claim 6, wherein if an answer cannot directly be retrieved from-the data base tables in one single query statement, temporary tables are created and filed with data, said temporary tables being queried for a final answer. | 7. A method as claimed in claim 6, wherein if an answer cannot directly be retrieved from-the data base tables in one single query statement, temporary tables are created and filed with data, said temporary tables being queried for a final answer. 8. A method as claimed in claim 7, wherein the data is ordered by ascending or descending value; of the data. | 0.5 |
7,490,092 | 68 | 69 | 68. A method of indexing and searching timed media files, as recited in claim 65 , wherein a subset of the numerical relatedness values between information representations in segment A and information representations in segment B are chosen such that the subset does not include more than one numerical value for any one occurrence of a particular information representation. | 68. A method of indexing and searching timed media files, as recited in claim 65 , wherein a subset of the numerical relatedness values between information representations in segment A and information representations in segment B are chosen such that the subset does not include more than one numerical value for any one occurrence of a particular information representation. 69. A method of indexing and searching timed media files, as recited in claim 68 , wherein said pair-wise relatedness for two segments A and B includes the sum of the said subset of numerical relatedness values between information representations in segment A and information representations in segment B. | 0.5 |
8,751,217 | 4 | 5 | 4. The process of claim 1 , further comprising: providing a context indicator to the server such that the speech recognition system can select a language model from a plurality of language models based on the context indicator, where the context indicator specifies the context in which the user input is received. | 4. The process of claim 1 , further comprising: providing a context indicator to the server such that the speech recognition system can select a language model from a plurality of language models based on the context indicator, where the context indicator specifies the context in which the user input is received. 5. The process of claim 4 , wherein the context indicator specifies a webpage in which the user input is received. | 0.521008 |
8,170,969 | 1 | 2 | 1. A method for automatically providing an overall semantic similarity score value among named entities, comprising: calculating, for each pair in at least a selection of pairs of the named entities, a pair semantic similarity score value according to a classifier using at least one electronic information source; calculating, for each of the pairs in the selection of the pairs of the named entities, a further pair semantic similarity score value according to a further classifier using the at least one electronic information source; and calculating, for each of the pairs in the selection of the pairs of the named entities, an overall semantic similarity score value as a first function of the pair semantic similarity score value and the further pair semantic similarity score value corresponding thereto. | 1. A method for automatically providing an overall semantic similarity score value among named entities, comprising: calculating, for each pair in at least a selection of pairs of the named entities, a pair semantic similarity score value according to a classifier using at least one electronic information source; calculating, for each of the pairs in the selection of the pairs of the named entities, a further pair semantic similarity score value according to a further classifier using the at least one electronic information source; and calculating, for each of the pairs in the selection of the pairs of the named entities, an overall semantic similarity score value as a first function of the pair semantic similarity score value and the further pair semantic similarity score value corresponding thereto. 2. The method according to claim 1 , further comprising ordering the pairs of the named entities as a second function of the pair semantic similarity score value calculated for each pair to provide a rank list for each classifier. | 0.662757 |
8,375,041 | 1 | 8 | 1. A non-transitory computer readable storage medium, comprising executable instructions to: receive an abstract query specifying a set of objects, wherein at least a portion of the set of objects is stored in a first semantic domain associated with an Online Analytical Processing (OLAP) data source and at least a portion of the set of objects is stored in a second semantic domain associated with a relational data source, the set of objects is defined by a combined semantic abstraction having at least one level of combined semantic abstraction data with relational data and at least one nested level of semantic abstraction data with OLAP base data; analyze the abstract query to determine member and level dependencies for any calculations within the abstract query and to determine values that are required by the abstract query; generate query analysis results based on the analysis of the abstract query, the query analysis results comprising a summary of requirements and dependencies of the abstract query; construct, using the combined semantic abstraction, at least one first query of the OLAP data source based on the query analysis results by mapping required dimension members and measures from the query analysis results into the first semantic domain, building a query for the first semantic domain to retrieve its contributing values, and converting dimension member sets and measure references to corresponding dimension member sets and measure references in the first semantic domain; add required base measures to the at least one first query, wherein the base measures are grouped into compatible measure groups based on dimensionality and query-compatibility such that queries are built for each compatible measure group and a sequence for executing the queries is built, wherein each applicable dimension for the corresponding compatible measure group contributes columns corresponding to its data bindings to the corresponding query, wherein dimension usage adds filters to limit columns and rows returned; construct a member set expression for each dimension required by the at least one first query based on dimension usage information specified in the query analysis results; section any dimensions that do not have a corresponding member set expression to a default dimension in the at least one first query; add content to the at least one first query to push at least a portion of processing of a calculated dimension or calculated measure specified by the at least one first query to the OLAP data source; pass the at least one first query to the OLAP data source for execution; construct, using the combined semantic abstraction, at least one second query of the relational data source based on the abstract query; pass the at least one second query to the relational data source for execution; and receive and store results from the execution of the at least one first query and the at least one second query. | 1. A non-transitory computer readable storage medium, comprising executable instructions to: receive an abstract query specifying a set of objects, wherein at least a portion of the set of objects is stored in a first semantic domain associated with an Online Analytical Processing (OLAP) data source and at least a portion of the set of objects is stored in a second semantic domain associated with a relational data source, the set of objects is defined by a combined semantic abstraction having at least one level of combined semantic abstraction data with relational data and at least one nested level of semantic abstraction data with OLAP base data; analyze the abstract query to determine member and level dependencies for any calculations within the abstract query and to determine values that are required by the abstract query; generate query analysis results based on the analysis of the abstract query, the query analysis results comprising a summary of requirements and dependencies of the abstract query; construct, using the combined semantic abstraction, at least one first query of the OLAP data source based on the query analysis results by mapping required dimension members and measures from the query analysis results into the first semantic domain, building a query for the first semantic domain to retrieve its contributing values, and converting dimension member sets and measure references to corresponding dimension member sets and measure references in the first semantic domain; add required base measures to the at least one first query, wherein the base measures are grouped into compatible measure groups based on dimensionality and query-compatibility such that queries are built for each compatible measure group and a sequence for executing the queries is built, wherein each applicable dimension for the corresponding compatible measure group contributes columns corresponding to its data bindings to the corresponding query, wherein dimension usage adds filters to limit columns and rows returned; construct a member set expression for each dimension required by the at least one first query based on dimension usage information specified in the query analysis results; section any dimensions that do not have a corresponding member set expression to a default dimension in the at least one first query; add content to the at least one first query to push at least a portion of processing of a calculated dimension or calculated measure specified by the at least one first query to the OLAP data source; pass the at least one first query to the OLAP data source for execution; construct, using the combined semantic abstraction, at least one second query of the relational data source based on the abstract query; pass the at least one second query to the relational data source for execution; and receive and store results from the execution of the at least one first query and the at least one second query. 8. The computer readable storage medium of claim 1 wherein the dimension usage is based on references to dimension members in query expressions. | 0.68 |
7,639,257 | 43 | 44 | 43. The computer readable medium encoded with the computer program of claim 42 , wherein: the string includes a plurality of references comprising one or more in-band values defined in an encoding standard. | 43. The computer readable medium encoded with the computer program of claim 42 , wherein: the string includes a plurality of references comprising one or more in-band values defined in an encoding standard. 44. The computer readable medium encoded with the computer program of claim 43 , wherein: parsing the string to identify a reference includes interpreting a plurality of in-band values to define the identified reference. | 0.5 |
7,757,204 | 14 | 16 | 14. The computer program product of claim 11 wherein each pattern, before configuration, comprises first properties, and wherein each pattern, after configuration, comprises second properties in addition to the first properties, and wherein the second properties are specific to the end-user application. | 14. The computer program product of claim 11 wherein each pattern, before configuration, comprises first properties, and wherein each pattern, after configuration, comprises second properties in addition to the first properties, and wherein the second properties are specific to the end-user application. 16. The computer program product of claim 14 wherein the first properties include the location of a table in a first user interface, and wherein the second properties include specific columns to be included in the table when the table is rendered in the first user interface. | 0.831701 |
7,818,663 | 1 | 5 | 1. An editable information management method comprising: storing editable information as a master file and a plurality of segment files, each segment file being editable independently of other segment files; combining said master file and said segment files in a manner specified by said master file to create said editable information; displaying said editable information for editing using an application program, said application program comprising an add in configured to combine said segment objects; receiving edit instructions to edit part of the displayed editable information corresponding to a predetermined segment file; and updating said predetermined segment file in response to said editing. | 1. An editable information management method comprising: storing editable information as a master file and a plurality of segment files, each segment file being editable independently of other segment files; combining said master file and said segment files in a manner specified by said master file to create said editable information; displaying said editable information for editing using an application program, said application program comprising an add in configured to combine said segment objects; receiving edit instructions to edit part of the displayed editable information corresponding to a predetermined segment file; and updating said predetermined segment file in response to said editing. 5. A method according to claim 1 , wherein the master file comprises editable information. | 0.846416 |
8,180,800 | 1 | 3 | 1. A method, including: using a data processor to receive context data associated with a context and a user, the context data including information indicative of a category of offerings in a network-based marketplace, the context data identifying at least one category of products or services offered to purchasers in the network-based marketplace; automatically discovering context attributes associated with the context, the context attributes being automatically discovered by processing attribute data received from a plurality of other users, the attribute data being related to the at least one category of products or services; associating the context data and the context attributes with a user identifier corresponding to the user; and generating result data associated with the context, the result data being relevant to the user identified by the user identifier. | 1. A method, including: using a data processor to receive context data associated with a context and a user, the context data including information indicative of a category of offerings in a network-based marketplace, the context data identifying at least one category of products or services offered to purchasers in the network-based marketplace; automatically discovering context attributes associated with the context, the context attributes being automatically discovered by processing attribute data received from a plurality of other users, the attribute data being related to the at least one category of products or services; associating the context data and the context attributes with a user identifier corresponding to the user; and generating result data associated with the context, the result data being relevant to the user identified by the user identifier. 3. The method of claim 1 , wherein the context is from a group including a product and a service. | 0.80123 |
7,930,167 | 1 | 7 | 1. A computer readable storage medium with computer executable instructions for a localizable video game, said instructions comprising: instructions for a video game; instructions for a language interface pack library, comprising: instructions for receiving a language preference; instructions for providing to said video game paths to most recent versions of localized video game resources corresponding to said language preference, and paths to fallback video game resources; and instructions for integrating, by said video game, video game resources identified by provided paths into a video game display. | 1. A computer readable storage medium with computer executable instructions for a localizable video game, said instructions comprising: instructions for a video game; instructions for a language interface pack library, comprising: instructions for receiving a language preference; instructions for providing to said video game paths to most recent versions of localized video game resources corresponding to said language preference, and paths to fallback video game resources; and instructions for integrating, by said video game, video game resources identified by provided paths into a video game display. 7. The computer readable storage medium of claim 1 , wherein said fallback video game resources are determined using a runtime fallback list of languages for a device. | 0.743077 |
8,010,581 | 1 | 22 | 1. A method comprising: determining relationship types between at least some data items of a plurality of data items extracted from a plurality of data sources and integrated into a plurality of tables in a database, wherein the relationship types are based on respective data sources from which the data items have been extracted, the relationship types including at least two of the following: a first relationship type, a second relationship type, a third relationship type, and a fourth relationship type, wherein: the first relationship type is between first and second data items extracted from a first structured data source, the second relationship type is between data items extracted from different structured data sources, wherein the second relationship type is based on a plurality of respective first relationship types, the third relationship type is between a data item extracted from a second structured data source, and an entity table including, as entity table data items, attributes about a first unstructured data source, and wherein the data item extracted from the second structured data source is mentioned in the first unstructured data source, and the fourth relationship type is between two data items that: have been integrated from different structured data sources, and are both mentioned in a second unstructured data source; and displaying, on a user interface, relationship type indicia to indicate relationship types between displayed data items, the relationship type indicia including at least one of first indicia to indicate the first relationship type, second indicia to indicate the second relationship type, third indicia to indicate the third relationship type, and fourth indicia to indicate the fourth relationship type. | 1. A method comprising: determining relationship types between at least some data items of a plurality of data items extracted from a plurality of data sources and integrated into a plurality of tables in a database, wherein the relationship types are based on respective data sources from which the data items have been extracted, the relationship types including at least two of the following: a first relationship type, a second relationship type, a third relationship type, and a fourth relationship type, wherein: the first relationship type is between first and second data items extracted from a first structured data source, the second relationship type is between data items extracted from different structured data sources, wherein the second relationship type is based on a plurality of respective first relationship types, the third relationship type is between a data item extracted from a second structured data source, and an entity table including, as entity table data items, attributes about a first unstructured data source, and wherein the data item extracted from the second structured data source is mentioned in the first unstructured data source, and the fourth relationship type is between two data items that: have been integrated from different structured data sources, and are both mentioned in a second unstructured data source; and displaying, on a user interface, relationship type indicia to indicate relationship types between displayed data items, the relationship type indicia including at least one of first indicia to indicate the first relationship type, second indicia to indicate the second relationship type, third indicia to indicate the third relationship type, and fourth indicia to indicate the fourth relationship type. 22. The method of claim 1 wherein the relationship type indicia includes a plurality of colors, wherein each color corresponds to a respective relationship type. | 0.835041 |
8,825,627 | 10 | 14 | 10. The computer-implemented method of claim 9 , wherein utilizing the identified keywords to identify a product category comprises comparing the keywords associated with the requested page to keywords associated with the product categories to identify the product category. | 10. The computer-implemented method of claim 9 , wherein utilizing the identified keywords to identify a product category comprises comparing the keywords associated with the requested page to keywords associated with the product categories to identify the product category. 14. The computer-implemented method of claim 10 , wherein the requested page corresponds to a category of products, and wherein identifying one or more keywords associated with the requested page comprises identifying keywords associated with the category of products. | 0.578616 |
9,230,042 | 1 | 6 | 1. A method of presenting an organization structure, comprising the steps of: providing a database of names of individuals in an organization, each of said individual names having an associated manager name and a profile; presenting a view of the names of individuals on a display to a user; receiving, from the user, a selection of a first and a second individual from said organization; constructing automatically, in response to the selection, a view showing names of those in a manager chain of said first and second individuals, every name in the manager chain being a name of at least one of the first individual, the second individual or a manager of either of the first or second individual up to the point where there is a common manager, and then a single manager chain to at least one manager at a higher level than the common manager in said organization, wherein the single manager chain showing only manager names above the common manager, wherein the constructing is configured to construct the view from any first and second individual in said organization regardless of whether the first and second individual share a common immediate manager; appending a nesting control indicator to the names in said view; and displaying said view on the display to the user, wherein the view allows the user to: access said profile by selecting a name in said view, and expand said view by selecting said nesting control indicator, wherein the profile is displayed in proximity to the respective name in the view, and wherein the profile includes at least: a job title and a work location. | 1. A method of presenting an organization structure, comprising the steps of: providing a database of names of individuals in an organization, each of said individual names having an associated manager name and a profile; presenting a view of the names of individuals on a display to a user; receiving, from the user, a selection of a first and a second individual from said organization; constructing automatically, in response to the selection, a view showing names of those in a manager chain of said first and second individuals, every name in the manager chain being a name of at least one of the first individual, the second individual or a manager of either of the first or second individual up to the point where there is a common manager, and then a single manager chain to at least one manager at a higher level than the common manager in said organization, wherein the single manager chain showing only manager names above the common manager, wherein the constructing is configured to construct the view from any first and second individual in said organization regardless of whether the first and second individual share a common immediate manager; appending a nesting control indicator to the names in said view; and displaying said view on the display to the user, wherein the view allows the user to: access said profile by selecting a name in said view, and expand said view by selecting said nesting control indicator, wherein the profile is displayed in proximity to the respective name in the view, and wherein the profile includes at least: a job title and a work location. 6. The method of claim 1 , further comprising the step of expanding said view by selecting said nesting control indicator to show additional individuals reporting to the individual name selected. | 0.728412 |
9,239,824 | 83 | 84 | 83. The method of claim 81 , further comprising: controlling the display of a notification, indicating that the status of the previously inactive entry is now active. | 83. The method of claim 81 , further comprising: controlling the display of a notification, indicating that the status of the previously inactive entry is now active. 84. The method of claim 83 , further comprising: controlling the display of a corresponding sequence of symbols, useable to produce a corresponding at least one of a word, sentence, phoneme, message, letter, number, morpheme, command and phrase, of the previously inactive entry. | 0.5 |
7,684,894 | 1 | 15 | 1. An autonomously moving robot that drives while evading obstacles, comprising: a memory to memorize map information of a driving domain and various parameters for driving; an input instruction receiver to input a destination and a command for moving; a route determiner to form a driving route to the destination; an environmental information acquisitioner to acquire environmental information on the driving route including an object becoming an obstacle; a driver to drive the autonomously moving robot; a self-location recognition sensor to recognize a self-location on a basis of information provided by the environmental information acquisitioner and the map information; and a driving controller to control the driver to arrive at the destination while evading obstacles and recognizing the self-location, wherein the environmental information acquisitioner further comprises: an imaging apparatus that takes an environmental image on the driving route; an image recognition processor to extract an edge image from the taken environmental image, and to evaluate a degree of circularity of the edge image by arithmetically processing the shape of the edge image, and if the evaluated degree of circularity is larger than a predetermined threshold value, the image recognition processor extracts an area including the evaluated edge image from the environmental image as a candidate region including a human head; a ranging apparatus to detect an object existing in an environment on the driving route, and to measure a distance range and an orientation of the object; a range information analyzer to arithmetically process the measured distance range and the orientation of the object to obtain a width of the object related to an angle region where collected data of the measured distance range and the orientation is generally constant, wherein the object is recognized based on the obtained width being within predetermined values; and an environment recognizer to perform recognition processing by comparing information based on an orientation in actual space of the candidate region including the human head extracted by the image recognition processor with information based on an orientation of the object having the width that is within the predetermined values recognized by the range information analyzer, and wherein when the compared information is consistent with one another, the environment recognizer outputs the information of the distance range and the orientation of the object as an environmental information on a person on the driving route to the driving controller. | 1. An autonomously moving robot that drives while evading obstacles, comprising: a memory to memorize map information of a driving domain and various parameters for driving; an input instruction receiver to input a destination and a command for moving; a route determiner to form a driving route to the destination; an environmental information acquisitioner to acquire environmental information on the driving route including an object becoming an obstacle; a driver to drive the autonomously moving robot; a self-location recognition sensor to recognize a self-location on a basis of information provided by the environmental information acquisitioner and the map information; and a driving controller to control the driver to arrive at the destination while evading obstacles and recognizing the self-location, wherein the environmental information acquisitioner further comprises: an imaging apparatus that takes an environmental image on the driving route; an image recognition processor to extract an edge image from the taken environmental image, and to evaluate a degree of circularity of the edge image by arithmetically processing the shape of the edge image, and if the evaluated degree of circularity is larger than a predetermined threshold value, the image recognition processor extracts an area including the evaluated edge image from the environmental image as a candidate region including a human head; a ranging apparatus to detect an object existing in an environment on the driving route, and to measure a distance range and an orientation of the object; a range information analyzer to arithmetically process the measured distance range and the orientation of the object to obtain a width of the object related to an angle region where collected data of the measured distance range and the orientation is generally constant, wherein the object is recognized based on the obtained width being within predetermined values; and an environment recognizer to perform recognition processing by comparing information based on an orientation in actual space of the candidate region including the human head extracted by the image recognition processor with information based on an orientation of the object having the width that is within the predetermined values recognized by the range information analyzer, and wherein when the compared information is consistent with one another, the environment recognizer outputs the information of the distance range and the orientation of the object as an environmental information on a person on the driving route to the driving controller. 15. The autonomously moving robot described in claim 1 , wherein the image information acquisition means acquisitioner (SIC) photographs a person detected and memorizes its image in the memory. | 0.817925 |
8,527,258 | 1 | 12 | 1. A simultaneous interpretation system, comprising: a plurality of headsets for inputting and outputting voice speech signals; and a portable terminal configured for receiving output from the first headset of an original language voice speech signal to be interpreted/translated, and for outputting to the second headset an interpreted language voice speech signal in a first translated language based on the original language voice speech signal, wherein the portable terminal is configured to operate a short range wireless communication to communicate with headsets of a respective speaker and a listener of the plurality of headsets in which the portable terminal translates between a plurality of pre-designated languages, and wirelessly communicates with an interpretation server for translation between languages other than the plurality of pre-designated languages. | 1. A simultaneous interpretation system, comprising: a plurality of headsets for inputting and outputting voice speech signals; and a portable terminal configured for receiving output from the first headset of an original language voice speech signal to be interpreted/translated, and for outputting to the second headset an interpreted language voice speech signal in a first translated language based on the original language voice speech signal, wherein the portable terminal is configured to operate a short range wireless communication to communicate with headsets of a respective speaker and a listener of the plurality of headsets in which the portable terminal translates between a plurality of pre-designated languages, and wirelessly communicates with an interpretation server for translation between languages other than the plurality of pre-designated languages. 12. The simultaneous interpretation system of claim 1 , wherein, when outputting the interpreted voice speech signal to the second headset, the portable terminal re-sends the original voice speech signal to the headset for confirmation purposes prior to the interpretation being performed. | 0.697699 |
8,676,821 | 13 | 18 | 13. A computer program product comprising a non-transitory computer-readable medium further comprising: computer-readable code for receiving a query having a select list, a from element, and a summary filter having a filter condition; computer-readable code for analyzing the filter condition to determine a filter group of the filter condition, the filter group comprising a list of expressions over which the filter condition is computed; computer-readable code for creating a derived table for computing the filter condition, the derived table having a select list, creating the derived table comprising: adding the list of expressions of the filter group to the derived table as one or more columns of the derived table's select list; and adding the filter condition to the derived table as a one or more columns of the derived table's select list; computer-readable code for transforming the received query by combining the received query with the derived table, transforming the received query comprising: traversing the select list of the received query and transforming one or more aggregates of the select list to reference one or more of the columns of the derived table; transforming the from element of the received query to reference the derived table; and adding a WHERE clause to the transformed original query, the WHERE clause based on the filter condition and referencing one or more of the columns of the derived table. | 13. A computer program product comprising a non-transitory computer-readable medium further comprising: computer-readable code for receiving a query having a select list, a from element, and a summary filter having a filter condition; computer-readable code for analyzing the filter condition to determine a filter group of the filter condition, the filter group comprising a list of expressions over which the filter condition is computed; computer-readable code for creating a derived table for computing the filter condition, the derived table having a select list, creating the derived table comprising: adding the list of expressions of the filter group to the derived table as one or more columns of the derived table's select list; and adding the filter condition to the derived table as a one or more columns of the derived table's select list; computer-readable code for transforming the received query by combining the received query with the derived table, transforming the received query comprising: traversing the select list of the received query and transforming one or more aggregates of the select list to reference one or more of the columns of the derived table; transforming the from element of the received query to reference the derived table; and adding a WHERE clause to the transformed original query, the WHERE clause based on the filter condition and referencing one or more of the columns of the derived table. 18. The computer program product as claimed in claim 13 , further comprising computer-readable code for determining that the FILTER transformation can be performed, determining further comprising: determining an aggregate group for each aggregate of the filter condition; and determining that all of the determined aggregate groups are compatible, including: determining the aggregate group with the lowest level of granularity; and determining that each aggregate group is a subset of the aggregate group with the lowest level of granularity or that each aggregate group is identical to the aggregate group with the lowest level of granularity. | 0.5 |
5,486,686 | 1 | 4 | 1. In an electronic document processing system for transferring information back and forth between an electronic domain and a hardcopy domain; said system including computer means for operating upon and storing electronic document files in a machine readable format in said electronic domain, input scanner means coupled to said computer means for transforming information from hardcopy documents in said hardcopy domain to said electronic domain, and printer means coupled to said computer means for printing human readable renderings of selected ones of said files on hardcopy documents; the improvement comprising an interface means between said computer means and said printer means for encoding at least one attribute of each of said selected electronic document files in a machine readable code that said printer means prints on said hardcopy documents along with the human readable renderings of the respective files; said attribute of each file being content of said file that is defined in said electronic domain but not explicitly defined by the human readable rendering of said file that is printed by said printer means, whereby said attribute of each of said selected electronic document files is recoverable from the code printed on a corresponding hardcopy document when information carried by said corresponding hardcopy document is transformed from said hardcopy domain to said electronic domain, even when such an attribute is irrecoverable from the human readable rendering. | 1. In an electronic document processing system for transferring information back and forth between an electronic domain and a hardcopy domain; said system including computer means for operating upon and storing electronic document files in a machine readable format in said electronic domain, input scanner means coupled to said computer means for transforming information from hardcopy documents in said hardcopy domain to said electronic domain, and printer means coupled to said computer means for printing human readable renderings of selected ones of said files on hardcopy documents; the improvement comprising an interface means between said computer means and said printer means for encoding at least one attribute of each of said selected electronic document files in a machine readable code that said printer means prints on said hardcopy documents along with the human readable renderings of the respective files; said attribute of each file being content of said file that is defined in said electronic domain but not explicitly defined by the human readable rendering of said file that is printed by said printer means, whereby said attribute of each of said selected electronic document files is recoverable from the code printed on a corresponding hardcopy document when information carried by said corresponding hardcopy document is transformed from said hardcopy domain to said electronic domain, even when such an attribute is irrecoverable from the human readable rendering. 4. The improvement or claim 1 wherein the attributes encoded in said code include a machine readable electronic domain definition of at least a first attribute of said electronic document files that is incapable of being inferred reliably from said human readable renderings. | 0.5 |
8,719,192 | 1 | 7 | 1. A computer-readable storage medium storing computer-executable instructions that, when executed, cause one or more processors to perform acts comprising: preparing a new domain to receive classification knowledge from one or more source domains by populating the new domain with preliminary query patterns extracted from a search engine log; preparing the classification knowledge in at least one source domain for transfer to the new domain; and transferring the classification knowledge from one or more source domains to the new domain, the transferring comprising: computing similarity distances between a plurality of source domains and the new domain; discarding at least one of the plurality of source domains with a similarity distance that is greater than a predefined distance threshold to generate the one or more source domains; selecting one or more query patterns of the one or more source domains for the new domain based at least on consistency between the one or more query patterns and the preliminary query patterns; and transferring the one or more query patterns that are selected to the new domain. | 1. A computer-readable storage medium storing computer-executable instructions that, when executed, cause one or more processors to perform acts comprising: preparing a new domain to receive classification knowledge from one or more source domains by populating the new domain with preliminary query patterns extracted from a search engine log; preparing the classification knowledge in at least one source domain for transfer to the new domain; and transferring the classification knowledge from one or more source domains to the new domain, the transferring comprising: computing similarity distances between a plurality of source domains and the new domain; discarding at least one of the plurality of source domains with a similarity distance that is greater than a predefined distance threshold to generate the one or more source domains; selecting one or more query patterns of the one or more source domains for the new domain based at least on consistency between the one or more query patterns and the preliminary query patterns; and transferring the one or more query patterns that are selected to the new domain. 7. The computer-readable storage medium of claim 1 , further comprising discarding at least one query pattern with a task probability that is below a probability threshold. | 0.88579 |
9,268,455 | 22 | 23 | 22. A system for user-controlled multi-dimensional navigation in multimedia data, comprising: a topological navigation map comprising a multiplicity of selectable node elements, a node element comprising one or more search terms or weighting terms that can be logically combined; wherein distances within the navigation map are determined in dependence on relevance index parameters on the basis of one- or multi-dimensional distance factors, the absolute value of the corresponding distance factor becoming smaller with increasing relevance of two paired multimedia data elements with respect to one another; and a topological input device by which the topological navigation map is navigable for the user and at least one of the required multimedia data elements and node elements are accessible, wherein for navigation in the topological navigation map by the user, at least one of required node elements and multimedia data elements and produced clusters of node elements are selected by the input device and the topological navigation map is corrected in a perspective of at least three-dimensions on the basis of the selection and newly displayed, the topological navigation map displays a dynamic and moveable at least three-dimensional perspective for user navigation therethrough in order to respond in real-time by displaying changes in the distance factors of the relevance index parameters indicative of changes in said relevance of two paired multimedia data elements with respect to one another, the topological navigation map is navigable through use of an input device to permit user access to at least one of desired multimedia data elements and node elements. | 22. A system for user-controlled multi-dimensional navigation in multimedia data, comprising: a topological navigation map comprising a multiplicity of selectable node elements, a node element comprising one or more search terms or weighting terms that can be logically combined; wherein distances within the navigation map are determined in dependence on relevance index parameters on the basis of one- or multi-dimensional distance factors, the absolute value of the corresponding distance factor becoming smaller with increasing relevance of two paired multimedia data elements with respect to one another; and a topological input device by which the topological navigation map is navigable for the user and at least one of the required multimedia data elements and node elements are accessible, wherein for navigation in the topological navigation map by the user, at least one of required node elements and multimedia data elements and produced clusters of node elements are selected by the input device and the topological navigation map is corrected in a perspective of at least three-dimensions on the basis of the selection and newly displayed, the topological navigation map displays a dynamic and moveable at least three-dimensional perspective for user navigation therethrough in order to respond in real-time by displaying changes in the distance factors of the relevance index parameters indicative of changes in said relevance of two paired multimedia data elements with respect to one another, the topological navigation map is navigable through use of an input device to permit user access to at least one of desired multimedia data elements and node elements. 23. The system as claimed in claim 22 , wherein the navigation map is navigable by topographic input device having at least one graphical, two-dimensional input element for the user. | 0.595556 |
7,818,165 | 1 | 16 | 1. A system for language identification, comprising: at least one processor; at least one computer readable storage medium; a feature set of a plurality of character strings of varying length with associated information; the associated information including one or more significance scores for one of the character strings for one or more of a plurality of languages, wherein the significance scores include a basic significance score and an additional significance score, wherein the additional significance score is for application in response to detection of a characteristic in a syllable other than the character string within a word containing the character string, and wherein the characteristic comprises the syllable containing a letter matching a letter contained in a predetermined set of one or more letters; and program code executable on the at least one processor and stored on the at least one computer readable storage medium, for detecting the character string from the feature set within a token from an input text and for detecting the characteristic in a syllable other than the character string within a word containing the character string within the input text responsive to detecting the character string within the input text. | 1. A system for language identification, comprising: at least one processor; at least one computer readable storage medium; a feature set of a plurality of character strings of varying length with associated information; the associated information including one or more significance scores for one of the character strings for one or more of a plurality of languages, wherein the significance scores include a basic significance score and an additional significance score, wherein the additional significance score is for application in response to detection of a characteristic in a syllable other than the character string within a word containing the character string, and wherein the characteristic comprises the syllable containing a letter matching a letter contained in a predetermined set of one or more letters; and program code executable on the at least one processor and stored on the at least one computer readable storage medium, for detecting the character string from the feature set within a token from an input text and for detecting the characteristic in a syllable other than the character string within a word containing the character string within the input text responsive to detecting the character string within the input text. 16. The system of claim 1 , wherein the characteristic further comprises the syllable immediately preceding the character string, and the letter contained in the syllable comprising an initial character of the syllable. | 0.628814 |
9,649,552 | 26 | 28 | 26. A non-transitory computer-readable storage medium having stored thereon information indicative of a puzzle, the information indicative of a puzzle generated by a method comprising: receiving information indicative of a mathematical puzzle configuration; generating a puzzle layout conforming to the information indicative of the puzzle configuration, the puzzle layout first areas of the puzzle including a plurality of clue regions and second areas of the puzzle including a plurality of mystery number regions, wherein the first areas of the puzzle and the second areas of the puzzle are in separate locations, wherein the plurality of clue regions include either a pair clue region interposed between a pair of mystery number regions, a central clue region surrounded by three or more mystery number regions, or both the pair clue region and the central clue region, wherein each of the mystery number regions corresponds to a mystery number value with no limitation on an amount of times a single mystery number value between 1-R appears in the puzzle when the puzzle is solved except that a same pair of mystery number values corresponding to the pair of mystery number regions interposing any pair clue region can only appear once in the puzzle unless the pairs of mystery number regions interposing three or more pair clue regions also form the three or more mystery number regions surrounding a single central clue, in which case the same mystery number value is utilized for all mystery number regions among the pairs of mystery number regions, wherein R is a whole number within a range of whole number values, wherein the puzzle can only have one solution when each mystery number value associated with each mystery number region among the plurality of mystery numbers regions are solved, wherein the pair clue region corresponds to a pair plus clue representing an arithmetic sum of mystery number values of the mystery number regions interposing the pair clue region or a pair times clue representing an arithmetic product of mystery number values of the mystery number regions interposing the pair clue region, wherein the central clue region corresponds to a central plus clue representing an arithmetic sum of mystery number values of the mystery number regions surrounding the central clue region or a central times clue representing an arithmetic product of mystery number values of the mystery number regions surrounding the central clue region, and wherein the puzzle layout is initially devoid of pair plus clues, pair times clues, central plus clues, central times clues, and mystery number values; associating a mystery number value with each mystery number region in the puzzle layout; adding, while the puzzle has more than one possible solution, one or more pair plus clues or pair times clues to one or more selected pair clue regions to create the puzzle layout, the one or more pair plus clues or pair times clues conforming to the mystery number values associated with the mystery number regions in the puzzle layout; for each pair plus clue or pair times clues added to the puzzle layout, attempting to solve the puzzle to determine if the puzzle layout has only one solution; repeating adding and attempting to solve the puzzle until the puzzle layout has only one solution; and storing a representation of the puzzle layout having only one solution on the non-transitory computer-readable storage medium. | 26. A non-transitory computer-readable storage medium having stored thereon information indicative of a puzzle, the information indicative of a puzzle generated by a method comprising: receiving information indicative of a mathematical puzzle configuration; generating a puzzle layout conforming to the information indicative of the puzzle configuration, the puzzle layout first areas of the puzzle including a plurality of clue regions and second areas of the puzzle including a plurality of mystery number regions, wherein the first areas of the puzzle and the second areas of the puzzle are in separate locations, wherein the plurality of clue regions include either a pair clue region interposed between a pair of mystery number regions, a central clue region surrounded by three or more mystery number regions, or both the pair clue region and the central clue region, wherein each of the mystery number regions corresponds to a mystery number value with no limitation on an amount of times a single mystery number value between 1-R appears in the puzzle when the puzzle is solved except that a same pair of mystery number values corresponding to the pair of mystery number regions interposing any pair clue region can only appear once in the puzzle unless the pairs of mystery number regions interposing three or more pair clue regions also form the three or more mystery number regions surrounding a single central clue, in which case the same mystery number value is utilized for all mystery number regions among the pairs of mystery number regions, wherein R is a whole number within a range of whole number values, wherein the puzzle can only have one solution when each mystery number value associated with each mystery number region among the plurality of mystery numbers regions are solved, wherein the pair clue region corresponds to a pair plus clue representing an arithmetic sum of mystery number values of the mystery number regions interposing the pair clue region or a pair times clue representing an arithmetic product of mystery number values of the mystery number regions interposing the pair clue region, wherein the central clue region corresponds to a central plus clue representing an arithmetic sum of mystery number values of the mystery number regions surrounding the central clue region or a central times clue representing an arithmetic product of mystery number values of the mystery number regions surrounding the central clue region, and wherein the puzzle layout is initially devoid of pair plus clues, pair times clues, central plus clues, central times clues, and mystery number values; associating a mystery number value with each mystery number region in the puzzle layout; adding, while the puzzle has more than one possible solution, one or more pair plus clues or pair times clues to one or more selected pair clue regions to create the puzzle layout, the one or more pair plus clues or pair times clues conforming to the mystery number values associated with the mystery number regions in the puzzle layout; for each pair plus clue or pair times clues added to the puzzle layout, attempting to solve the puzzle to determine if the puzzle layout has only one solution; repeating adding and attempting to solve the puzzle until the puzzle layout has only one solution; and storing a representation of the puzzle layout having only one solution on the non-transitory computer-readable storage medium. 28. The non-transitory computer-readable storage medium of claim 26 , wherein the method further comprises: adding the pair plus clue or the pair times clue to the one or more selected pair clue regions is based at least in part on the pair plus clue region being farthest from pair plus clues or pair times clues already added to pair clue regions. | 0.75 |
9,792,282 | 15 | 16 | 15. The computer usable program product of claim 11 , wherein the portion comprises a user interface implementation in the software product, and wherein the user interface implementation comprises the string. | 15. The computer usable program product of claim 11 , wherein the portion comprises a user interface implementation in the software product, and wherein the user interface implementation comprises the string. 16. The computer usable program product of claim 15 , wherein the string is a part of static content in the user interface implementation. | 0.8125 |
9,336,184 | 7 | 10 | 7. At least one computer-readable storage medium having stored thereon information defining an interactive document, the at least one computer-readable storage medium being an article of manufacture, the interactive document comprising: a plurality of entities defined by one or more user inputs; a plurality of edges defined by one or more user inputs, each of the plurality of edges indicating a data flow between two of the plurality of entities; a transformation defined by one or more user inputs indicating a relationship between input data and output data of a first entity of the plurality of entities; and a visualization defined by one or more user inputs for visually representing input data of a second entity of the plurality of entities, wherein the visualization is represented by a third entity and a fourth entity, the third entity comprising an entity with an input and no output and the fourth entity comprising an entity with an output and no input, the third entity being separate and disconnected from the fourth entity. | 7. At least one computer-readable storage medium having stored thereon information defining an interactive document, the at least one computer-readable storage medium being an article of manufacture, the interactive document comprising: a plurality of entities defined by one or more user inputs; a plurality of edges defined by one or more user inputs, each of the plurality of edges indicating a data flow between two of the plurality of entities; a transformation defined by one or more user inputs indicating a relationship between input data and output data of a first entity of the plurality of entities; and a visualization defined by one or more user inputs for visually representing input data of a second entity of the plurality of entities, wherein the visualization is represented by a third entity and a fourth entity, the third entity comprising an entity with an input and no output and the fourth entity comprising an entity with an output and no input, the third entity being separate and disconnected from the fourth entity. 10. The computer-readable storage medium of claim 7 , wherein: one of the plurality of entities comprises computer executable instructions for receiving data in response to user interaction with a graphical object displayed on a graphical user interface. | 0.555944 |
7,991,609 | 2 | 12 | 2. The method of claim 1 , further comprising using one or more evaluation modules to evaluate whether the one or more strings of text include non-standard usage, and using the one or more evaluation modules to provide the one or more suggested alternative strings of text. | 2. The method of claim 1 , further comprising using one or more evaluation modules to evaluate whether the one or more strings of text include non-standard usage, and using the one or more evaluation modules to provide the one or more suggested alternative strings of text. 12. The method of claim 2 , wherein the one or more evaluation modules generate a plurality of suggested alternative strings of text, and wherein the method further comprises filtering out suggested alternative strings of text indicated to be unlikely, unhelpful, or duplicative. | 0.582335 |
9,372,930 | 1 | 2 | 1. A method comprising: by an access module that comprises one or more processors of a machine, accessing person profiles that each describe a different person but reference a common entity, a portion of the accessed person profiles each including a common token that describes a corresponding different person, the entity having an entity profile that lacks the common token; by a determination module that comprises one or more processors of the machine, generating a first probability that the common token occurs within the accessed person profiles; by the determination module that comprises one or more processors of the machine, accessing a second probability that the common token occurs within a superset of person profiles that includes the accessed person profiles; by the determination module that comprises one or more processors of the machine, determining that the common token is descriptive of the entity based on a statistical divergence between the first and second probabilities, the statistical divergence indicating that the common token is overrepresented among other tokens shared in common by the accessed person profiles; and by a generation module that comprises one or more processors of the machine, generating a supplemental profile for the entity, the supplemental profile including the overrepresented common token determined to be descriptive of the entity based on the statistical divergence between the first and second probabilities. | 1. A method comprising: by an access module that comprises one or more processors of a machine, accessing person profiles that each describe a different person but reference a common entity, a portion of the accessed person profiles each including a common token that describes a corresponding different person, the entity having an entity profile that lacks the common token; by a determination module that comprises one or more processors of the machine, generating a first probability that the common token occurs within the accessed person profiles; by the determination module that comprises one or more processors of the machine, accessing a second probability that the common token occurs within a superset of person profiles that includes the accessed person profiles; by the determination module that comprises one or more processors of the machine, determining that the common token is descriptive of the entity based on a statistical divergence between the first and second probabilities, the statistical divergence indicating that the common token is overrepresented among other tokens shared in common by the accessed person profiles; and by a generation module that comprises one or more processors of the machine, generating a supplemental profile for the entity, the supplemental profile including the overrepresented common token determined to be descriptive of the entity based on the statistical divergence between the first and second probabilities. 2. The method of claim 1 , wherein: the entity profile describes the entity as a business; and the accessed person profiles each describe each different person as a different employee of the business. | 0.68652 |
9,031,829 | 11 | 19 | 11. A system comprising: a computer readable medium having instructions stored thereon; and a data processing apparatus configured to execute the instructions to perform operations comprising: identifying a first language and a second language; receiving a chatspeak audible message in the first language from a first person at a first chat client system who communicates in the first language; converting the chatspeak audible message to a chatspeak text message in the first language; transforming the chatspeak text message to a plain speak text message in the first language; translating the plain speak text message to a corresponding plain speak text message in the second language; transforming the corresponding plain speak text message to a corresponding chatspeak text message in the second language; converting the corresponding chatspeak text message to a corresponding chatspeak audible message in the second language; sending the corresponding chatspeak audible message to a second person at a second chat client system who communicates in the second language; and receiving user feedback from a computing device of a user regarding an accuracy of at least one of the corresponding chatspeak text message and the corresponding chatspeak audible message. | 11. A system comprising: a computer readable medium having instructions stored thereon; and a data processing apparatus configured to execute the instructions to perform operations comprising: identifying a first language and a second language; receiving a chatspeak audible message in the first language from a first person at a first chat client system who communicates in the first language; converting the chatspeak audible message to a chatspeak text message in the first language; transforming the chatspeak text message to a plain speak text message in the first language; translating the plain speak text message to a corresponding plain speak text message in the second language; transforming the corresponding plain speak text message to a corresponding chatspeak text message in the second language; converting the corresponding chatspeak text message to a corresponding chatspeak audible message in the second language; sending the corresponding chatspeak audible message to a second person at a second chat client system who communicates in the second language; and receiving user feedback from a computing device of a user regarding an accuracy of at least one of the corresponding chatspeak text message and the corresponding chatspeak audible message. 19. The system of claim 11 , the operations further comprising processing the feedback to improve accuracy of at least one of a speech recognition system, a text-to-speech system, a text transformation system, and a text translation system. | 0.914102 |
9,626,368 | 1 | 6 | 1. A system for merging documents comprising: a computer system including at least one processor configured to: receive an update document and a target document, wherein the update document and target document are document instances of a common document schema; determine whether an item of information in the update document is associated with an eligible path of the document schema in a predefined update table; generate, responsive to affirming that the item of information is associated with the eligible path, a specification of an operation by which the item of information is merged into the target document in compliance with the document schema; and apply the specified operation to the target document to produce an updated document in compliance with the document schema. | 1. A system for merging documents comprising: a computer system including at least one processor configured to: receive an update document and a target document, wherein the update document and target document are document instances of a common document schema; determine whether an item of information in the update document is associated with an eligible path of the document schema in a predefined update table; generate, responsive to affirming that the item of information is associated with the eligible path, a specification of an operation by which the item of information is merged into the target document in compliance with the document schema; and apply the specified operation to the target document to produce an updated document in compliance with the document schema. 6. The system of claim 1 , wherein the at least one processor is further configured to: determine whether each of a plurality of items of information in the update document is associated with a corresponding eligible path of the document schema in the update table; generate, for the items of information associated with the eligible path in the update table, respective specifications of operations by which the items of information are merged into the target document in compliance with the document schema; and apply the plurality of specified operations to the target document to produce an updated document in compliance with the document schema. | 0.5 |
9,292,492 | 1 | 9 | 1. A method for scaling a language understanding system, comprising: receiving, by a computing device, an utterance using the language understanding system; detecting, by the computing device, a plurality of domains that are associated with the utterance; detecting, by the computing device, a plurality of actions from the utterance for each detected domain of the plurality of domains; associating, by the computing device, each action of the plurality of actions with one or more of the detected plurality of domains; detecting, by the computing device, a plurality of objects from the utterance for each detected action of the plurality of actions; training at least one model by applying a threshold hypothesis to at least one stage from a model manager, whereby training data is shared across different domains supported by the language understanding system; and performing, by the computing device, slot filling, wherein at least one slot is filled, the at least one slot further defining at least one of the plurality of domains or the plurality of objects. | 1. A method for scaling a language understanding system, comprising: receiving, by a computing device, an utterance using the language understanding system; detecting, by the computing device, a plurality of domains that are associated with the utterance; detecting, by the computing device, a plurality of actions from the utterance for each detected domain of the plurality of domains; associating, by the computing device, each action of the plurality of actions with one or more of the detected plurality of domains; detecting, by the computing device, a plurality of objects from the utterance for each detected action of the plurality of actions; training at least one model by applying a threshold hypothesis to at least one stage from a model manager, whereby training data is shared across different domains supported by the language understanding system; and performing, by the computing device, slot filling, wherein at least one slot is filled, the at least one slot further defining at least one of the plurality of domains or the plurality of objects. 9. The method of claim 1 , wherein an additional model is not added when a new domain is added to the language understanding system. | 0.741176 |
8,645,124 | 4 | 5 | 4. A computer-assisted language generation system according to claim 1 and wherein said simplified sentence group ranking functionality operates using at least some of the following criteria: A. the number of simplified sentences contained in a group; B. degree to which the word stems of the words in the group correspond to the word stems in an independent phrase and their alternatives; C. the extent to which the group includes words which do not correspond to the words in the independent phrase and their alternatives. | 4. A computer-assisted language generation system according to claim 1 and wherein said simplified sentence group ranking functionality operates using at least some of the following criteria: A. the number of simplified sentences contained in a group; B. degree to which the word stems of the words in the group correspond to the word stems in an independent phrase and their alternatives; C. the extent to which the group includes words which do not correspond to the words in the independent phrase and their alternatives. 5. A computer-assisted language generation system according to claim 4 and wherein said simplified sentence group ranking functionality operates using at least part of the following procedure: defining the weight of a word stem, to indicate the importance of the word in the language; calculating a Positive Match Rank corresponding to criterion B; calculating a Negative Match Rank corresponding to criterion C; calculating a Composite Rank based on: said number of simplified sentences contained in a group and corresponding to criterion A; said Positive Match Rank; and said Negative Match Rank. | 0.5 |
8,365,066 | 9 | 11 | 9. A non-transitory computer-readable medium that stores instructions that when executed by a processor perform a method for storing formatting information for at least one cell in a spreadsheet document described in a markup language, wherein the spreadsheet document includes a plurality of style objects, the method comprising: parsing the spreadsheet document to generate at least one display list of a cell format object for the at least one cell by: obtaining cell formatting information for the at least one cell from a master style object that stores master formatting information for the at least one cell; obtaining named style information for the at least one cell from a style name object that stores named styles for the at least one cell and references the cell master style object; obtaining cell specific formatting information for the at least one cell from a cell-specific style object that includes cell specific formatting information for the at least one cell and references the master style object, wherein the cell specific formatting information overrides master formatting information; generating combined cell formatting information for the at least one cell in the cell format object, wherein the combined cell formatting information in the cell format object comprises named styles for the at least one cell, cell-specific formatting information that has overridden formatting information in the master style object, and master formatting information that has not been overridden by the cell-specific formatting information, wherein the formatting information originally described in the master style object but overridden by the cell-specific information is not included in the combined cell formatting information for the cell format object; and storing the combined cell formatting information as the at least one display list of the cell format object; and rasterizing the at least one cell in a frame buffer using the stored at least one display list of the cell format object. | 9. A non-transitory computer-readable medium that stores instructions that when executed by a processor perform a method for storing formatting information for at least one cell in a spreadsheet document described in a markup language, wherein the spreadsheet document includes a plurality of style objects, the method comprising: parsing the spreadsheet document to generate at least one display list of a cell format object for the at least one cell by: obtaining cell formatting information for the at least one cell from a master style object that stores master formatting information for the at least one cell; obtaining named style information for the at least one cell from a style name object that stores named styles for the at least one cell and references the cell master style object; obtaining cell specific formatting information for the at least one cell from a cell-specific style object that includes cell specific formatting information for the at least one cell and references the master style object, wherein the cell specific formatting information overrides master formatting information; generating combined cell formatting information for the at least one cell in the cell format object, wherein the combined cell formatting information in the cell format object comprises named styles for the at least one cell, cell-specific formatting information that has overridden formatting information in the master style object, and master formatting information that has not been overridden by the cell-specific formatting information, wherein the formatting information originally described in the master style object but overridden by the cell-specific information is not included in the combined cell formatting information for the cell format object; and storing the combined cell formatting information as the at least one display list of the cell format object; and rasterizing the at least one cell in a frame buffer using the stored at least one display list of the cell format object. 11. The computer-readable medium of claim 9 , wherein the spreadsheet document is described in SML. | 0.83277 |
9,402,057 | 19 | 21 | 19. The portal service of claim 10 , avatars are based on at least one uploaded photograph, by detecting and calculating key facial features automatically. | 19. The portal service of claim 10 , avatars are based on at least one uploaded photograph, by detecting and calculating key facial features automatically. 21. The portal service of claim 19 , wherein said users assign virtual human-like functions to avatars. | 0.671975 |
5,542,024 | 51 | 53 | 51. A method of authoring an information processing system which enables a non-computer literate expert having knowledge (the developer) to develop a computer assisted expert system for a user, said method comprising: (a) generating a plurality of knowledge records; (b) displaying a blank record with a Graphical User Interface to enable the developers to interactively enter knowledge as segments of alphanumeric text and user options in each of said plurality of knowledge records; (c) linking a plurality of knowledge records to at least two other records to form a plurality of disjoin logic nodes such that the arrangement of knowledge segments and said user options form a decision network of disjoin logic nodes representative of the developer's knowledge; (d) sequentially displaying said interconnected knowledge records with a Graphical User Interface to form a plurality of simplified screen displays to enable the user to selectively choose an option at each disjoin logic node. | 51. A method of authoring an information processing system which enables a non-computer literate expert having knowledge (the developer) to develop a computer assisted expert system for a user, said method comprising: (a) generating a plurality of knowledge records; (b) displaying a blank record with a Graphical User Interface to enable the developers to interactively enter knowledge as segments of alphanumeric text and user options in each of said plurality of knowledge records; (c) linking a plurality of knowledge records to at least two other records to form a plurality of disjoin logic nodes such that the arrangement of knowledge segments and said user options form a decision network of disjoin logic nodes representative of the developer's knowledge; (d) sequentially displaying said interconnected knowledge records with a Graphical User Interface to form a plurality of simplified screen displays to enable the user to selectively choose an option at each disjoin logic node. 53. A method of authoring an information processing system as claimed in claim 51 which further includes the step of assigning predetermined colors to portions of said simplified screen displays. | 0.710682 |
8,234,561 | 84 | 85 | 84. A software product tangibly stored on a machine-readable medium, the software product comprising instructions operable to cause a programmable processor to perform operations comprising: observing values entered in form field objects; generating likelihood assessments for possible values to be entered in a current form field object based on the observed values, the likelihood assessments indicating relative probability of the possible values being entered in the current form field object; and predicting a value for the current form field object based on the generated likelihood assessments; wherein generating likelihood assessments comprises generating likelihood assessments for possible values to be entered in multiple current form field objects in a current form instance, wherein predicting a value comprises predicting multiple values for the multiple current form field objects in the current form instance, and wherein predicting multiple values comprises: displaying values selected from the possible values in the multiple current form field objects; and displaying a new value in place of one of the displayed values in one of the multiple current form field objects in response to user input, the new value being a predicted value based on generated likelihood assessments and the user input. | 84. A software product tangibly stored on a machine-readable medium, the software product comprising instructions operable to cause a programmable processor to perform operations comprising: observing values entered in form field objects; generating likelihood assessments for possible values to be entered in a current form field object based on the observed values, the likelihood assessments indicating relative probability of the possible values being entered in the current form field object; and predicting a value for the current form field object based on the generated likelihood assessments; wherein generating likelihood assessments comprises generating likelihood assessments for possible values to be entered in multiple current form field objects in a current form instance, wherein predicting a value comprises predicting multiple values for the multiple current form field objects in the current form instance, and wherein predicting multiple values comprises: displaying values selected from the possible values in the multiple current form field objects; and displaying a new value in place of one of the displayed values in one of the multiple current form field objects in response to user input, the new value being a predicted value based on generated likelihood assessments and the user input. 85. The software product of claim 84 , wherein generating likelihood assessments comprises: generating at least two likelihood assessments for each of the possible values; and aggregating the at least two likelihood assessments for each of the possible values. | 0.5 |
8,812,310 | 13 | 16 | 13. A computer system to enable environmental recognition of audio input comprising: a feature selection module ranking a plurality of audio descriptors and selecting a configurable number of audio descriptors from the ranked audio descriptors to obtain a feature set; a feature extraction module extracting the feature set obtained by the feature selection module and appending the feature set with a set of frequency scale information approximating sensitivity of the human ear; and a modeling module applying the combined feature set to at least one audio input to determine a background environment. | 13. A computer system to enable environmental recognition of audio input comprising: a feature selection module ranking a plurality of audio descriptors and selecting a configurable number of audio descriptors from the ranked audio descriptors to obtain a feature set; a feature extraction module extracting the feature set obtained by the feature selection module and appending the feature set with a set of frequency scale information approximating sensitivity of the human ear; and a modeling module applying the combined feature set to at least one audio input to determine a background environment. 16. The computer system of claim 13 , further comprising a zero-crossing rate module appending zero-crossing rate features to the combined feature set, to improve dimensionality of the modeling module. | 0.525943 |
8,805,622 | 3 | 4 | 3. The field-based similarity search system of claim 2 , wherein said processor further: assembles said aligned candidate molecule fragment pairs to construct a full aligned candidate molecule. | 3. The field-based similarity search system of claim 2 , wherein said processor further: assembles said aligned candidate molecule fragment pairs to construct a full aligned candidate molecule. 4. The field-based similarity search system of claim 3 , further comprising: a display device for displaying said full aligned candidate molecule. | 0.5 |
8,032,508 | 21 | 24 | 21. A non-transitory computer-readable storage medium for tangibly storing thereon computer-executable instructions for a method comprising: receiving a request over a network from a user for data related to a context, wherein the request is a URL comprising a context query, wherein the context query comprises at least one context criteria; parsing and translating, via the network, the at least one context criteria, whereby the at least one context criteria is parsed and translated to a standardized format; disambiguating, via the network, the at least one parsed and translated context criteria, whereby the at least one parsed and translated context criteria is resolved to canonical values; formulating a network data query based on the at least one disambiguated context criteria so as to search, via the network, for user profile data, social network data, spatial data, temporal data and topical data that is available via the network and relates to the context query so as to identify at least one data object that relates to the at least one disambiguated context criteria; checking permissions, via the network, relating to the at least one data object to determine if the user is permitted to access the at least one data object; if the user is permitted to access the at least one data object, transmitting, over the network, a reference to the at least one data object over the network to the user, wherein the reference to the at least one data object contains sufficient information to enable the user to access the at least one data object over the network. | 21. A non-transitory computer-readable storage medium for tangibly storing thereon computer-executable instructions for a method comprising: receiving a request over a network from a user for data related to a context, wherein the request is a URL comprising a context query, wherein the context query comprises at least one context criteria; parsing and translating, via the network, the at least one context criteria, whereby the at least one context criteria is parsed and translated to a standardized format; disambiguating, via the network, the at least one parsed and translated context criteria, whereby the at least one parsed and translated context criteria is resolved to canonical values; formulating a network data query based on the at least one disambiguated context criteria so as to search, via the network, for user profile data, social network data, spatial data, temporal data and topical data that is available via the network and relates to the context query so as to identify at least one data object that relates to the at least one disambiguated context criteria; checking permissions, via the network, relating to the at least one data object to determine if the user is permitted to access the at least one data object; if the user is permitted to access the at least one data object, transmitting, over the network, a reference to the at least one data object over the network to the user, wherein the reference to the at least one data object contains sufficient information to enable the user to access the at least one data object over the network. 24. The non-transitory computer-readable storage medium of claim 21 wherein the at least one context criteria is an identifier for a second context query stored on the network. | 0.755556 |
9,805,018 | 8 | 9 | 8. The method of claim 1 , further including using a widely distributed web data extraction program to extract who made the posting and their contact information. | 8. The method of claim 1 , further including using a widely distributed web data extraction program to extract who made the posting and their contact information. 9. The method of claim 8 , wherein the step of extracting author information includes accessing information stored in a metadata repository indicating what may have been learned about the posting author from past postings by the same author, and updating information stored in a metadata repository indicating what may have been learned about the posting author from the presently analyzed posting. | 0.5 |
9,390,176 | 2 | 6 | 2. A method for searching for data relevant to an inquiry, comprising using a computer to perform the steps of: a) providing a plurality of initial search targets based upon said inquiry of a plurality of seed sources; b) searching a first one of the plurality of initial search targets to obtain data and metadata relevant to the inquiry; c) repeating step (b) until all said data and metadata of the first one of the plurality of initial search targets have been collected and stored; d) searching a next one of the plurality of initial search targets to obtain additional data and metadata relevant to the inquiry; e) repeating step (d) until all said additional data and metadata of the next one of the plurality of initial search targets have been collected and stored; f) repeating steps (d) and (e) until all of the plurality of initial search targets have been searched and said additional data and metadata have been collected and stored; g) processing said data and metadata and said additional data and metadata stored in steps (c) and (e), respectively, thereby generating additional search targets; h) repeating steps (b) through (f) for said additional search targets; and i) repeating steps (g) and (h) until no said additional data and metadata are found; and validating given data by executing steps comprising: comparing the data from search targets that have been searched, and selecting as valid the data from a source considered to be most reliable and usable, based on a set of precedence and usage rules. | 2. A method for searching for data relevant to an inquiry, comprising using a computer to perform the steps of: a) providing a plurality of initial search targets based upon said inquiry of a plurality of seed sources; b) searching a first one of the plurality of initial search targets to obtain data and metadata relevant to the inquiry; c) repeating step (b) until all said data and metadata of the first one of the plurality of initial search targets have been collected and stored; d) searching a next one of the plurality of initial search targets to obtain additional data and metadata relevant to the inquiry; e) repeating step (d) until all said additional data and metadata of the next one of the plurality of initial search targets have been collected and stored; f) repeating steps (d) and (e) until all of the plurality of initial search targets have been searched and said additional data and metadata have been collected and stored; g) processing said data and metadata and said additional data and metadata stored in steps (c) and (e), respectively, thereby generating additional search targets; h) repeating steps (b) through (f) for said additional search targets; and i) repeating steps (g) and (h) until no said additional data and metadata are found; and validating given data by executing steps comprising: comparing the data from search targets that have been searched, and selecting as valid the data from a source considered to be most reliable and usable, based on a set of precedence and usage rules. 6. The method of claim 2 , further comprising curating, adjudicating, synthesizing, and clustering related data from different sources to form clustered data records. | 0.817582 |
8,732,630 | 24 | 32 | 24. A system for implementing pattern-based design enabled manufacturing of electronic circuit designs, comprising: at least one processor or at least one processor core that is at least to: detect an incompatible connection that interacts with a wire that is represented using digital signals in a digital modeling environment; represent a real-valued net of a built-in nettype in the digital modeling environment with 4-state logic signals in the digital modeling environment; correlate the real-valued net with a corresponding resolution function that is defined natively in the digital modeling environment; and coerce the incompatible connection to the wire in the digital modeling environment based at least in part upon the corresponding resolution function. | 24. A system for implementing pattern-based design enabled manufacturing of electronic circuit designs, comprising: at least one processor or at least one processor core that is at least to: detect an incompatible connection that interacts with a wire that is represented using digital signals in a digital modeling environment; represent a real-valued net of a built-in nettype in the digital modeling environment with 4-state logic signals in the digital modeling environment; correlate the real-valued net with a corresponding resolution function that is defined natively in the digital modeling environment; and coerce the incompatible connection to the wire in the digital modeling environment based at least in part upon the corresponding resolution function. 32. The system of claim 24 , wherein the digital modeling environment comprises a SystemVerilog modeling environment. | 0.912946 |
8,140,571 | 8 | 9 | 8. The computer-readable storage medium of claim 1 , wherein executing the analysis routine on the received input further comprises: identifying data values for all required inputs from the received input and the retrieved suitable data; and running the analysis routine on the identified data values. | 8. The computer-readable storage medium of claim 1 , wherein executing the analysis routine on the received input further comprises: identifying data values for all required inputs from the received input and the retrieved suitable data; and running the analysis routine on the identified data values. 9. The computer-readable storage medium of claim 8 , wherein running the analysis routine on the identified data values comprises: transforming each abstract rule of the at least one rule set which defines the analysis routine into a transformed rule; and executing, by the rules engine, each transformed rule on the identified data values. | 0.5 |
6,160,883 | 1 | 4 | 1. A method for placing a call over a communications network, the call being placed through a set of feature modules in the network, each feature module being independent and communicating with other feature modules through featureless internal calls through the communications network, the method comprising the steps of: receiving a request from a customer to place a call over the network; determining which features are associated with the customer's request and routing an internal call to a module representing a first feature; routing subsequent internal calls to additional feature modules representing features associated with the customer's request; and routing an internal call from a last feature module to a destination customer, wherein a path of internal calls from the requesting customer includes all features associated with the requesting customer's request. | 1. A method for placing a call over a communications network, the call being placed through a set of feature modules in the network, each feature module being independent and communicating with other feature modules through featureless internal calls through the communications network, the method comprising the steps of: receiving a request from a customer to place a call over the network; determining which features are associated with the customer's request and routing an internal call to a module representing a first feature; routing subsequent internal calls to additional feature modules representing features associated with the customer's request; and routing an internal call from a last feature module to a destination customer, wherein a path of internal calls from the requesting customer includes all features associated with the requesting customer's request. 4. The method of claim 1, wherein a routing module determines which features are associated with the requesting customer's request. | 0.754682 |
7,478,170 | 15 | 21 | 15. A server, comprising: a processor; a memory operable to store program instructions, wherein the program instructions are executable by the processor to: implement a framework configured to receive pluggable converter modules configured to convert documents in one or more office document formats to and from one or more small device document formats; plug one of the converter modules into the framework; and wherein the converter module is executable by the processor to generate a small device document in a particular one of the one or more small device formats from one of the documents in a particular one of the one or more office document formats; wherein the program instructions are farther executable by the processor to send the small device document to a small device coupled to the server; wherein the converter module is further executable by the processor to: receive a modified version of the small device document from the small device; and generate a modified version of the document in the particular office document format from the modified version of the small device document in the particular small device format. | 15. A server, comprising: a processor; a memory operable to store program instructions, wherein the program instructions are executable by the processor to: implement a framework configured to receive pluggable converter modules configured to convert documents in one or more office document formats to and from one or more small device document formats; plug one of the converter modules into the framework; and wherein the converter module is executable by the processor to generate a small device document in a particular one of the one or more small device formats from one of the documents in a particular one of the one or more office document formats; wherein the program instructions are farther executable by the processor to send the small device document to a small device coupled to the server; wherein the converter module is further executable by the processor to: receive a modified version of the small device document from the small device; and generate a modified version of the document in the particular office document format from the modified version of the small device document in the particular small device format. 21. The server as recited in claim 15 , wherein the framework is further configured to receive pluggable merger modules configured to merge modified versions of small device documents with corresponding documents in one of the office document formats to generate synchronized versions of the documents. | 0.87083 |
8,589,164 | 15 | 16 | 15. A device comprising: at least one processor; data storage; and program instructions in the data storage that, upon execution by the at least one processor, cause the device to: receive information indicative of a frequency of submission of a search query to a search engine in a given period of time, wherein the search query comprises a sequence of words; based on the information indicative of the frequency of submission of the search query to the search engine in the given period of time, determine, for the sequence of words of the search query, groupings of one or more words of the search query based on an order in which the one or more words occur in the sequence of words of the search query; and provide information indicating the groupings to a speech recognition system to update a corpus of given sequences of words, wherein the speech recognition system is configured to convert a given spoken utterance into a given sequence of words based on the corpus of given sequences of words. | 15. A device comprising: at least one processor; data storage; and program instructions in the data storage that, upon execution by the at least one processor, cause the device to: receive information indicative of a frequency of submission of a search query to a search engine in a given period of time, wherein the search query comprises a sequence of words; based on the information indicative of the frequency of submission of the search query to the search engine in the given period of time, determine, for the sequence of words of the search query, groupings of one or more words of the search query based on an order in which the one or more words occur in the sequence of words of the search query; and provide information indicating the groupings to a speech recognition system to update a corpus of given sequences of words, wherein the speech recognition system is configured to convert a given spoken utterance into a given sequence of words based on the corpus of given sequences of words. 16. The device of claim 15 , wherein the program instructions, upon execution by the at least one processor, further cause the device to: determine a metric based on the information indicative of the frequency of submission of the search query to the search engine in the given period of time, wherein the program instructions, upon execution by the at least one processor, cause the device to determine the groupings based on a comparison of the metric to a threshold. | 0.587148 |
9,317,468 | 7 | 9 | 7. A computer program product comprising a non-transitory computer-readable storage medium storing executable code for generating a personal content stream of videos, the code when executed by a computer processor causes the computer processor to perform steps including: generating a plurality of sets of stream topics using a plurality of topics in a user profile, each set of stream topics including a plurality of stream topics; providing the plurality of sets of stream topics to a client device of the user for display on the client device; receiving, from the client device, a selection of a provided set of stream topics as a basis for the personal content stream for a user associated with the user profile; selecting a plurality of videos for the personal content stream based on the selected set of stream topics; determining that a selected video from the selected plurality of videos has been previously played on the client device; refraining from including the previously played video in the personal content stream and selecting another video to include in the personal content stream that replaces the previously played video in the plurality of videos responsive to the determination; and providing the personal content stream including the plurality of videos as a series of videos to be played automatically on the client device, each of the plurality of videos associated with a stream topic included in the selected set of stream topics. | 7. A computer program product comprising a non-transitory computer-readable storage medium storing executable code for generating a personal content stream of videos, the code when executed by a computer processor causes the computer processor to perform steps including: generating a plurality of sets of stream topics using a plurality of topics in a user profile, each set of stream topics including a plurality of stream topics; providing the plurality of sets of stream topics to a client device of the user for display on the client device; receiving, from the client device, a selection of a provided set of stream topics as a basis for the personal content stream for a user associated with the user profile; selecting a plurality of videos for the personal content stream based on the selected set of stream topics; determining that a selected video from the selected plurality of videos has been previously played on the client device; refraining from including the previously played video in the personal content stream and selecting another video to include in the personal content stream that replaces the previously played video in the plurality of videos responsive to the determination; and providing the personal content stream including the plurality of videos as a series of videos to be played automatically on the client device, each of the plurality of videos associated with a stream topic included in the selected set of stream topics. 9. The computer program product of claim 7 , wherein selecting another video comprises: determining a stream topic associated with the previously played video; and selecting another video that is associated with the determined stream topic to replace the previously played video. | 0.673302 |
7,716,221 | 9 | 10 | 9. An apparatus comprising: a pre-processor configured to register a set of training documents, including creating metadata comprising at least document terms and phonemes counts; a computing device configured to: compute a terms-phonemes/document matrix from the metadata; normalize the terms-phonemes/document matrix; and compute a vector space from the normalized terms-phonemes/ document matrix; the pre-processor further configured to compute vectors for new documents and to add the vectors to the vector space without computing a new vector space in response to adding the vectors to the vector space; a query engine configured to search the vector space for vectors that are close to a vector computed for one or more query terms or phonemes; and an interface configured to provide a list of documents associated with vectors in the vector space that are closest to the vector computed for the one or more query terms or phonemes. | 9. An apparatus comprising: a pre-processor configured to register a set of training documents, including creating metadata comprising at least document terms and phonemes counts; a computing device configured to: compute a terms-phonemes/document matrix from the metadata; normalize the terms-phonemes/document matrix; and compute a vector space from the normalized terms-phonemes/ document matrix; the pre-processor further configured to compute vectors for new documents and to add the vectors to the vector space without computing a new vector space in response to adding the vectors to the vector space; a query engine configured to search the vector space for vectors that are close to a vector computed for one or more query terms or phonemes; and an interface configured to provide a list of documents associated with vectors in the vector space that are closest to the vector computed for the one or more query terms or phonemes. 10. The apparatus of claim 9 , wherein the training document metadata for each training document further comprises at least one of document type, creation date, or location. | 0.771164 |
9,710,786 | 1 | 9 | 1. A system for a knowledge management system comprising: a processor; and a memory that contains instructions that are readable by the processor and cause the processor to: receive a query that indicates at least one legal topic from a hierarchy of legal topics; provide a response to the query indicating each work-product document and each case law document that matches the at least one legal topic, wherein the processor is operable to, prior to providing the response: retrieve each work-product document that matches the at least one legal topic from a first database; and retrieve each case law document that matches the at least one legal topic from a second database; determine a validity status of at least one case cited within each work-product document, resulting in a validity indicator, the validity indicator for each work-product document indicating the validity status of the at least one case; indicate, in the response provided to the query, a reliability of each work-product document using the validity indicator and a rating indicator for each work-product document, the rating indicator for each work-product document indicating a user rating of each work-product document based on previous users of each work-product document; index each work-product document according to the hierarchy of legal topics based on at least one legal citation and a set of text; index each case law document according to the hierarchy of legal topics; receive a second query for a particular case law document; and provide a second response to the second query indicating each work-product document which includes at least one legal citation associated with the particular case law document according to a depth-of-treatment value, the depth-of-treatment value indicates a degree to which each work-product document evaluates the particular case law document. | 1. A system for a knowledge management system comprising: a processor; and a memory that contains instructions that are readable by the processor and cause the processor to: receive a query that indicates at least one legal topic from a hierarchy of legal topics; provide a response to the query indicating each work-product document and each case law document that matches the at least one legal topic, wherein the processor is operable to, prior to providing the response: retrieve each work-product document that matches the at least one legal topic from a first database; and retrieve each case law document that matches the at least one legal topic from a second database; determine a validity status of at least one case cited within each work-product document, resulting in a validity indicator, the validity indicator for each work-product document indicating the validity status of the at least one case; indicate, in the response provided to the query, a reliability of each work-product document using the validity indicator and a rating indicator for each work-product document, the rating indicator for each work-product document indicating a user rating of each work-product document based on previous users of each work-product document; index each work-product document according to the hierarchy of legal topics based on at least one legal citation and a set of text; index each case law document according to the hierarchy of legal topics; receive a second query for a particular case law document; and provide a second response to the second query indicating each work-product document which includes at least one legal citation associated with the particular case law document according to a depth-of-treatment value, the depth-of-treatment value indicates a degree to which each work-product document evaluates the particular case law document. 9. The system recited in claim 1 , wherein the processor is further operable to: provide the hierarchy of legal topics for display on a user-device; and indicate a number of work-product documents associated with each legal topic of the hierarchy of legal topics. | 0.622126 |
7,917,480 | 53 | 54 | 53. The computer-readable medium of claim 52 , wherein each second token identifier comprises an M bit integer value. | 53. The computer-readable medium of claim 52 , wherein each second token identifier comprises an M bit integer value. 54. The computer-readable medium of claim 53 , wherein each first token identifier comprises an N bit integer value, N and M are positive integers and M is greater than N. | 0.5 |
9,292,360 | 15 | 16 | 15. A computer, comprising: a processor; and a computer-readable storage medium in communication with the processor, the computer-readable storage medium having computer readable instructions stored thereupon that, when executed by the processor, cause the processor to execute a plurality of application programs configured to expose a set of programming language application programming interfaces for interacting with the plurality of application programs and for interacting with a file associated with at least one of the plurality of application programs, initialize, via the set application programming language interfaces, an extension object for supplementing functionality of the plurality of application programs by implementing an initialize delegate defined in a programming language file, the initialize delegate comprising a reason parameter for defining a context in which the extension object is initialized, access, via the set of application programming language interfaces, a section of the file the one of the plurality of application programs interacts with, identify the section of the file as a generic data type that is applicable to individual ones of the plurality of application programs, and perform an operation on the section by presenting a user interface for selecting a portion of the file, wherein the user interface is configured to allow a user to select the portion of the file and to return the selected portion of the file to the extension object for use as a binding. | 15. A computer, comprising: a processor; and a computer-readable storage medium in communication with the processor, the computer-readable storage medium having computer readable instructions stored thereupon that, when executed by the processor, cause the processor to execute a plurality of application programs configured to expose a set of programming language application programming interfaces for interacting with the plurality of application programs and for interacting with a file associated with at least one of the plurality of application programs, initialize, via the set application programming language interfaces, an extension object for supplementing functionality of the plurality of application programs by implementing an initialize delegate defined in a programming language file, the initialize delegate comprising a reason parameter for defining a context in which the extension object is initialized, access, via the set of application programming language interfaces, a section of the file the one of the plurality of application programs interacts with, identify the section of the file as a generic data type that is applicable to individual ones of the plurality of application programs, and perform an operation on the section by presenting a user interface for selecting a portion of the file, wherein the user interface is configured to allow a user to select the portion of the file and to return the selected portion of the file to the extension object for use as a binding. 16. The computer of claim 15 , wherein performing the operation comprises: determining if the portion of the file is selected; in response to determining that the portion of the file is selected, at least one of reading data from the selection, or writing data to the selection; and in response to determining that the portion of the file is not selected, inserting the data at an insertion point within the file. | 0.603647 |
8,996,532 | 3 | 4 | 3. The system of claim 1 , wherein correlating includes computing a correlation score that indicates a relative likelihood of the occurrence of the change as a cause of the incident. | 3. The system of claim 1 , wherein correlating includes computing a correlation score that indicates a relative likelihood of the occurrence of the change as a cause of the incident. 4. The system of claim 3 , further comprising identifying the one or more candidate causes with a highest correlation score as a cause for the incident. | 0.5 |
8,010,560 | 1 | 2 | 1. One or more computer-readable storage media comprising computer-executable instructions to perform a method of facilitating access to a resource, the method comprising: creating a first answer set that comprises a first assertion, a first variable, and a first constraint that have been chosen, said first answer set satisfying one or more conditions comprising: that a first set of assertions that comprises or is derived from said first answer set will, when presented to a guard that controls access to the resource, cause said guard to find that a query evaluates to true under a policy implemented by said guard; creating a second answer set that comprises a second assertion, a second variable, and a second constraint that have been chosen, said second answer set satisfying one or more conditions comprising: that a second set of assertions that comprises or is derived from said second answer set will, when presented to said guard, cause said guard to find that said query evaluates to true under said policy; determining that said first answer set is not subsumed by said second answer set; and providing a solution that comprises said first answer set. | 1. One or more computer-readable storage media comprising computer-executable instructions to perform a method of facilitating access to a resource, the method comprising: creating a first answer set that comprises a first assertion, a first variable, and a first constraint that have been chosen, said first answer set satisfying one or more conditions comprising: that a first set of assertions that comprises or is derived from said first answer set will, when presented to a guard that controls access to the resource, cause said guard to find that a query evaluates to true under a policy implemented by said guard; creating a second answer set that comprises a second assertion, a second variable, and a second constraint that have been chosen, said second answer set satisfying one or more conditions comprising: that a second set of assertions that comprises or is derived from said second answer set will, when presented to said guard, cause said guard to find that said query evaluates to true under said policy; determining that said first answer set is not subsumed by said second answer set; and providing a solution that comprises said first answer set. 2. The one or more computer-readable storage media of claim 1 , wherein said first answer set comprises a first set of assumptions abduced from information that comprises said query, wherein said second answer set comprises a second set of assumptions abduced from said information, and wherein said determining comprises: comparing a first cardinality of said first set of assumptions with a second cardinality of said second set of assumptions. | 0.733572 |
9,996,626 | 22 | 24 | 22. The non-transitory computer-readable medium of claim 21 wherein the search request includes one or more search terms, and wherein the method further comprises storing, by the computing system, a mapping of the one or more search terms to the determined product category. | 22. The non-transitory computer-readable medium of claim 21 wherein the search request includes one or more search terms, and wherein the method further comprises storing, by the computing system, a mapping of the one or more search terms to the determined product category. 24. The non-transitory computer-readable medium of claim 22 wherein the method further comprises, after the sending of the one or more electronic communications, receiving information about later online activities of the user related to at least one of the multiple products that is part of an additional product category separate from the determined product category, and updating the stored mapping to further associate the one or more search terms with the additional product category. | 0.617555 |
9,851,968 | 1 | 5 | 1. A method, comprising: receiving, at a computer, a request to build a new application developed using an application development framework; receiving, by the computer, a template application, the template application comprising one or more binary artifacts and declarative information, the template application being pre-compiled using a build toolkit; modifying, by the computer, the declarative information associated with the template application using metadata associated with the new application to generate modified declarative information, the metadata configuring one or more components included in the new application, and the modifying comprising replacing a first set of definition files associated with the template application with a second set of definition files associated with the new application; and building, by the computer, the new application to target a mobile device using the one or more binary artifacts of the template application and the modified declarative information, wherein modifying, by the computer, the declarative information associated with the template application using the metadata associated with the new application comprises modifying a reference to the declarative information to include a reference to declarative information associated with one or more portions of the new application. | 1. A method, comprising: receiving, at a computer, a request to build a new application developed using an application development framework; receiving, by the computer, a template application, the template application comprising one or more binary artifacts and declarative information, the template application being pre-compiled using a build toolkit; modifying, by the computer, the declarative information associated with the template application using metadata associated with the new application to generate modified declarative information, the metadata configuring one or more components included in the new application, and the modifying comprising replacing a first set of definition files associated with the template application with a second set of definition files associated with the new application; and building, by the computer, the new application to target a mobile device using the one or more binary artifacts of the template application and the modified declarative information, wherein modifying, by the computer, the declarative information associated with the template application using the metadata associated with the new application comprises modifying a reference to the declarative information to include a reference to declarative information associated with one or more portions of the new application. 5. The method of claim 1 , wherein building, by the computer, the new application to target the mobile device comprises packaging one or more binary artifacts representing the new application for an Android operating system. | 0.661631 |
8,244,721 | 1 | 7 | 1. A system for generating a personalized query result for a specific user, the system comprising: memory; a processor; an interface stored in the memory that receives at least one of a portion of a text query to be searched or a portion of personalized content related to a user that submits the portion of the text query; a personalization component stored in the memory and executed by the processor that compares the portion of personalized content related to the user with a portion of personalized content related to one or more disparate users to create a group of users having group personalized content, the group personalized content is compared with the portion of the text query to identify a relationship there between to generate the personalized query result based in part on the relationship; and a shared web task engine that provides a collaborative web search utilizing a smart splitting technique, the smart splitting technique receives the portion of the text query and distributes query results based on the text query to members of the group to enable parallel evaluation by the members of the group, the personalized query result being generated further based in part on the parallel evaluation. | 1. A system for generating a personalized query result for a specific user, the system comprising: memory; a processor; an interface stored in the memory that receives at least one of a portion of a text query to be searched or a portion of personalized content related to a user that submits the portion of the text query; a personalization component stored in the memory and executed by the processor that compares the portion of personalized content related to the user with a portion of personalized content related to one or more disparate users to create a group of users having group personalized content, the group personalized content is compared with the portion of the text query to identify a relationship there between to generate the personalized query result based in part on the relationship; and a shared web task engine that provides a collaborative web search utilizing a smart splitting technique, the smart splitting technique receives the portion of the text query and distributes query results based on the text query to members of the group to enable parallel evaluation by the members of the group, the personalized query result being generated further based in part on the parallel evaluation. 7. The system of claim 1 , the query results are distributed to each member as non-overlapping subsets in which the distribution is based on a personalized score for each member. | 0.853859 |
8,468,597 | 10 | 11 | 10. The method as recited in claim 8 , wherein said step of calculating a hash value comprises the step of calculating a hash value based upon methodologies selected from the group consisting of MD5, WHIRLPOOL, SHA-1, SHA-256, and RIPEMD-160. | 10. The method as recited in claim 8 , wherein said step of calculating a hash value comprises the step of calculating a hash value based upon methodologies selected from the group consisting of MD5, WHIRLPOOL, SHA-1, SHA-256, and RIPEMD-160. 11. The method as recited in claim 10 , further including the step of saving said suspect url in the database and using the one or more processor to assign a category value to said url in response to said method. | 0.581028 |
9,607,279 | 6 | 7 | 6. The method of claim 1 , further comprising: computing a compliance quality score based on a computation of a percentage match between the predetermined phrase and the audible input received. | 6. The method of claim 1 , further comprising: computing a compliance quality score based on a computation of a percentage match between the predetermined phrase and the audible input received. 7. The method of claim 6 , wherein the determining a compliance rating comprises: comparing the compliance quality score computed to a pre-determined threshold, if the compliance quality score computed exceeds the pre-determined threshold, outputting a positive compliance quality score, and if the compliance quality score computed fails to meet the pre-determined threshold, outputting a negative compliance quality score. | 0.5 |
9,235,863 | 1 | 9 | 1. A computer-implemented method comprising: maintaining in a data store social information associated with a plurality of users of a social networking system, a plurality of actions performed by the users, and a plurality of social networking system objects associated with one or more of the actions; receiving, from a device associated with a viewing user, a request for a page, the request identifying two or more users of the social networking system, the requested page comprising one or more social networking system objects upon which, for each object, an action was performed by each of the identified social networking system users; and responsive to receiving the request for the page: identifying one or more social networking system objects wherein, for each identified object, an action was performed by each of the identified users with respect to the social networking system object; determining an order for the identified social networking system objects; identifying a set of images, each image from the set of images associated with each of the identified users; selecting an image from the set of images based on a relevancy of the image to all of the identified users, wherein the relevancy of the image decreases when the image is associated with additional users other than the identified users; generating the requested page, the generated page including information associated with the identified social networking system objects, the actions performed on each of the social networking system objects by each of the identified users, the information ordered within the generated page based on the determined order for the identified social networking system objects, and the selected image; and sending the generated page to the device associated with the viewing user for display. | 1. A computer-implemented method comprising: maintaining in a data store social information associated with a plurality of users of a social networking system, a plurality of actions performed by the users, and a plurality of social networking system objects associated with one or more of the actions; receiving, from a device associated with a viewing user, a request for a page, the request identifying two or more users of the social networking system, the requested page comprising one or more social networking system objects upon which, for each object, an action was performed by each of the identified social networking system users; and responsive to receiving the request for the page: identifying one or more social networking system objects wherein, for each identified object, an action was performed by each of the identified users with respect to the social networking system object; determining an order for the identified social networking system objects; identifying a set of images, each image from the set of images associated with each of the identified users; selecting an image from the set of images based on a relevancy of the image to all of the identified users, wherein the relevancy of the image decreases when the image is associated with additional users other than the identified users; generating the requested page, the generated page including information associated with the identified social networking system objects, the actions performed on each of the social networking system objects by each of the identified users, the information ordered within the generated page based on the determined order for the identified social networking system objects, and the selected image; and sending the generated page to the device associated with the viewing user for display. 9. The computer-implemented method of claim 1 , wherein the page comprises a page viewable within a native application. | 0.804918 |
8,019,735 | 15 | 17 | 15. A method to provide query caching, comprising: deploying a query component in a container, running on the one or more microprocessors; issuing, via a cache management component running on the one or more microprocessors, a query to retrieve a query result from a database, wherein the query is associated with a transaction, and wherein the query result includes one or more instances of a class that is managed by the container, wherein the class represents one or more persisted data entries retrieved from the database and the one or more persisted data entries are associated with at least one row in a table in the database; storing, via the cache management component, the one or more instances of the class in a cache; maintaining, via a query registration component running on the one or more microprocessors, the query in a query registry with one or more queries; looking up, via the cache management component, the query in the query registry; retrieving, via the cache management component, the stored one or more instances of the class for the query in the cache when another query matches the query in the query registry; allowing the one or more instances of the class to be used concurrently by multiple users using an optimistic concurrency strategy, and wherein, under the optimistic concurrency strategy, the cache management component leaves the one or more instances of the class in the cached query result unlocked when the one or more instances of the class remain unchanged during the transaction; invalidating the one or more instances of the class in the cached query result that are used concurrently by multiple users during the transaction, when a row in the table in the database that is not used by the cached query result is updated or invalidated; and removing the query from the query registry and removing the cached query result with the one or more instances of the class from the cache. | 15. A method to provide query caching, comprising: deploying a query component in a container, running on the one or more microprocessors; issuing, via a cache management component running on the one or more microprocessors, a query to retrieve a query result from a database, wherein the query is associated with a transaction, and wherein the query result includes one or more instances of a class that is managed by the container, wherein the class represents one or more persisted data entries retrieved from the database and the one or more persisted data entries are associated with at least one row in a table in the database; storing, via the cache management component, the one or more instances of the class in a cache; maintaining, via a query registration component running on the one or more microprocessors, the query in a query registry with one or more queries; looking up, via the cache management component, the query in the query registry; retrieving, via the cache management component, the stored one or more instances of the class for the query in the cache when another query matches the query in the query registry; allowing the one or more instances of the class to be used concurrently by multiple users using an optimistic concurrency strategy, and wherein, under the optimistic concurrency strategy, the cache management component leaves the one or more instances of the class in the cached query result unlocked when the one or more instances of the class remain unchanged during the transaction; invalidating the one or more instances of the class in the cached query result that are used concurrently by multiple users during the transaction, when a row in the table in the database that is not used by the cached query result is updated or invalidated; and removing the query from the query registry and removing the cached query result with the one or more instances of the class from the cache. 17. The method according to claim 15 , wherein: the query is configured to use a primary key of a data entity in the database. | 0.754864 |
8,526,682 | 16 | 17 | 16. A method of authentication in accordance with claim 15 , further comprising calculating an equal error rate when the maximum genuine matching score is at least equal to the minimum imposter matching score. | 16. A method of authentication in accordance with claim 15 , further comprising calculating an equal error rate when the maximum genuine matching score is at least equal to the minimum imposter matching score. 17. A method of authentication in accordance with claim 16 , further comprising: comparing the equal error rate against an acceptable error rate; and confirming the identity of the individual when the equal error rate is less than or equal to the acceptable error rate. | 0.5 |
7,548,909 | 9 | 10 | 9. The system of claim 1 , wherein the user interface component further displays a research tab that displays information and tools relating to performing research on topics related to the search results. | 9. The system of claim 1 , wherein the user interface component further displays a research tab that displays information and tools relating to performing research on topics related to the search results. 10. The system of claim 9 , wherein the user interface component further displays a menu that provides for further refining search queries or results by selecting one or tabs or concepts associated with previous search results. | 0.5 |
5,561,421 | 21 | 24 | 21. A method of forming compression dictionaries in a computer system that includes data sets with corresponding data catalogs that contain information identifying the format of each data set and its location, the data sets containing records of uninterrupted byte strings that will be compressed by the computer system using the compression dictionaries, the method comprising the steps of: (a) providing a library of dictionary segments that are adapted for use by the computer system to compress the data sets; (b) scanning one or more records of a data set during an initial recordation of the data set records to one or more external storage devices and generating predetermined data characteristic statistics as a result of the scanning; (c) selecting dictionary segments from the library of dictionary segments according to the generated data characteristic statistics; and (d) combining the selected dictionary segments to form a system-built dictionary that is used by the computer system to compress the remaining data records of the data set as the data set is recorded to the one or more external storage devices, wherein the generated data characteristic statistics include a frequency distribution of characters found in the scanned record, a count of occurrences for each character in the scanned record, and an entropy value for the scanned record; and the step of scanning records comprises: completing a stabilization procedure comprising repeating the steps of selecting a current first block of the record for scanning and generating a first set of the data characteristic statistics, selecting a current second block of the record, different from the first block, for scanning and generating a second set of data characteristic statistics, comparing like statistics of the first set of data characteristic statistics and the second set of data characteristic statistics, and selecting a new first block and a new second block for scanning and generating new respective sets of data characteristic statistics until the step of comparing indicates that the statistical difference between the first and second sets of statistics is below a predetermined stabilization threshold value, or until the size of the second block equals a predetermined scanning limit value, whereupon the combination of the first block and second block is stored in an interrogation buffer if the entropy value of the second set of statistics is below a predetermined entropy threshold value. | 21. A method of forming compression dictionaries in a computer system that includes data sets with corresponding data catalogs that contain information identifying the format of each data set and its location, the data sets containing records of uninterrupted byte strings that will be compressed by the computer system using the compression dictionaries, the method comprising the steps of: (a) providing a library of dictionary segments that are adapted for use by the computer system to compress the data sets; (b) scanning one or more records of a data set during an initial recordation of the data set records to one or more external storage devices and generating predetermined data characteristic statistics as a result of the scanning; (c) selecting dictionary segments from the library of dictionary segments according to the generated data characteristic statistics; and (d) combining the selected dictionary segments to form a system-built dictionary that is used by the computer system to compress the remaining data records of the data set as the data set is recorded to the one or more external storage devices, wherein the generated data characteristic statistics include a frequency distribution of characters found in the scanned record, a count of occurrences for each character in the scanned record, and an entropy value for the scanned record; and the step of scanning records comprises: completing a stabilization procedure comprising repeating the steps of selecting a current first block of the record for scanning and generating a first set of the data characteristic statistics, selecting a current second block of the record, different from the first block, for scanning and generating a second set of data characteristic statistics, comparing like statistics of the first set of data characteristic statistics and the second set of data characteristic statistics, and selecting a new first block and a new second block for scanning and generating new respective sets of data characteristic statistics until the step of comparing indicates that the statistical difference between the first and second sets of statistics is below a predetermined stabilization threshold value, or until the size of the second block equals a predetermined scanning limit value, whereupon the combination of the first block and second block is stored in an interrogation buffer if the entropy value of the second set of statistics is below a predetermined entropy threshold value. 24. A method as defined in claim 21, wherein each second block comprises the combination of the current first block and the next block of the data set equal in size to the current first block. | 0.777262 |
8,838,459 | 11 | 14 | 11. The teleconferencing system of claim 10 , wherein the teleconference management processor is further configured to determine language preferences of each of the teleconference participants. | 11. The teleconferencing system of claim 10 , wherein the teleconference management processor is further configured to determine language preferences of each of the teleconference participants. 14. The teleconferencing system of claim 11 , wherein the virtual participant processor is further configured to: respond to the second request from the teleconference management processor to join the teleconference session by connecting to the teleconference session; and translate the speech data of teleconference participants into the language indicated by the language preferences of a requesting teleconference participant associated with the first request, wherein the translation functions are performed only for the requesting teleconference participant. | 0.5 |
7,895,068 | 1 | 3 | 1. A non-transitory computer-readable medium having computer-executable components that, when executed, are configured to cause a processor to perform a method comprising: a) receiving an inquiry from a seeking entity at an inquiry receiving component, the inquiry specifying a predetermined degree of separation, the predetermined degree of separation being dependent on an activity trust level of a relationship the seeking entity is seeking to establish with a sought entity; b) receiving a response, at a response receiving component, indicating an existing relationship between the sought entity and an intermediate entity, the response being indicative of a trust level of the sought entity by the intermediate entity regarding the existing relationship; c) confirming, at a confirming component based on the response, that the relationship may be established; d) determining, at a verification component, whether to share information between the seeking entity and the sought entity in accordance with rights management; and e) in response to determining to share the information, causing the information to be shared between the seeking entity and the sought entity in accordance with rights management. | 1. A non-transitory computer-readable medium having computer-executable components that, when executed, are configured to cause a processor to perform a method comprising: a) receiving an inquiry from a seeking entity at an inquiry receiving component, the inquiry specifying a predetermined degree of separation, the predetermined degree of separation being dependent on an activity trust level of a relationship the seeking entity is seeking to establish with a sought entity; b) receiving a response, at a response receiving component, indicating an existing relationship between the sought entity and an intermediate entity, the response being indicative of a trust level of the sought entity by the intermediate entity regarding the existing relationship; c) confirming, at a confirming component based on the response, that the relationship may be established; d) determining, at a verification component, whether to share information between the seeking entity and the sought entity in accordance with rights management; and e) in response to determining to share the information, causing the information to be shared between the seeking entity and the sought entity in accordance with rights management. 3. The computer-readable medium of claim 1 , wherein the predetermined degree of separation varies based on the trust level of the existing relationship. | 0.601563 |
7,672,543 | 15 | 17 | 15. The system of claim 1 wherein the action processing unit is coupled to the media storage and a server, and is adapted to purchase items using the identified mixed media document. | 15. The system of claim 1 wherein the action processing unit is coupled to the media storage and a server, and is adapted to purchase items using the identified mixed media document. 17. The system of claim 15 wherein: the action of the identified mixed media document is recognition to use the mixed media document to order merchandise and to automatically add an entry about an expected completion of that transaction into a user's calendar; and the action processing unit is adapted to recognize use of the mixed media to order merchandise, and add the entry about an expected completion of that transaction into the user's calendar, the action processing unit interfacing with a calendar application, and a server for receiving order information. | 0.612175 |
8,527,425 | 5 | 6 | 5. The method of claim 1 , further comprising: determining whether the legal text element includes a user consent requirement; and in response to determining that the legal text element includes the user consent requirement, prompting a user for consent. | 5. The method of claim 1 , further comprising: determining whether the legal text element includes a user consent requirement; and in response to determining that the legal text element includes the user consent requirement, prompting a user for consent. 6. The method of claim 5 , further comprising: determining whether the user consents to the legal text; and in response to determining that the user consents to the legal text, transmitting a purchase message to a content provider. | 0.5 |
9,043,474 | 9 | 10 | 9. The method of claim 7 , the communication session server configured to receive at least one text operation specified in a text format. | 9. The method of claim 7 , the communication session server configured to receive at least one text operation specified in a text format. 10. The method of claim 9 , the communication session server configured to receive the at least one text operation in at least one text communication protocol selected from a set of text communication protocols comprising: an email communication protocol; an instant message protocol; a short message service communication protocol; and a hypertext transport communication protocol. | 0.502604 |
7,643,027 | 17 | 19 | 17. The computer-aided design system of claim 16 , wherein instructions to configure the processor to replace the geometry further comprises instructions to: remove from the three-dimensional model the geometry giving rise to the implicit feature; and place the geometry produced by the explicit feature into the three-dimensional model in a region once occupied by the geometry giving rise to the implicit feature. | 17. The computer-aided design system of claim 16 , wherein instructions to configure the processor to replace the geometry further comprises instructions to: remove from the three-dimensional model the geometry giving rise to the implicit feature; and place the geometry produced by the explicit feature into the three-dimensional model in a region once occupied by the geometry giving rise to the implicit feature. 19. The computer-aided design system of claim 17 , wherein a six-sided body is applied to remove the geometry giving rise to the implicit feature. | 0.5 |
10,079,013 | 4 | 5 | 4. The method of claim 3 , further comprising creating a second shared intent different than the shared intent by selecting a second intent from the shared dialog context and combining a portion of the second selected intent with a different portion of the current intent than the portion of the current intent used to create the shared intent. | 4. The method of claim 3 , further comprising creating a second shared intent different than the shared intent by selecting a second intent from the shared dialog context and combining a portion of the second selected intent with a different portion of the current intent than the portion of the current intent used to create the shared intent. 5. The method of claim 4 , further comprising associating the second shared intent with one of the human participants in the dialog session, and creating an electronic action item for the one of the human participants, wherein the electronic action item includes semantic information extracted from the second shared intent. | 0.5 |
8,375,014 | 37 | 38 | 37. A computer-implemented method comprising: providing a graphical user interface displayed to a user on a display of a computer system, the interface being configured to allow the user to generate a graphical representation of a structured query for data of a database; providing in the graphical user interface a plurality of graphical dataset icons representing datasets of the data; receiving, via the graphical user interface, selections of dataset icons corresponding to respective datasets of the database, indications of graphical associations between two or more dataset icons that correspond to selected datasets, and an operation to perform on the selected datasets, wherein the operation is selected from a plurality of operations that are provided based on an indication of a graphical association between the two or more dataset icons, wherein the operations are provided in a natural language expression of the operations; generating, by at least one processor of the computer system, the graphical representation of the structured query in the graphical user interface based on the selections of the dataset icons and the operations to perform on the datasets, the graphical representation including the dataset icon and/or a representation of a selected operation; generating, by at least one processor of the computer system, the structured query based on the graphical representation wherein generating the structured query includes processing one or more of the datasets associated with the graphical query, and wherein the constructing further includes incorporating the SQL substatement into the machine-readable SQL query; executing the structured query against the database; and providing results of the execution of the structured query. | 37. A computer-implemented method comprising: providing a graphical user interface displayed to a user on a display of a computer system, the interface being configured to allow the user to generate a graphical representation of a structured query for data of a database; providing in the graphical user interface a plurality of graphical dataset icons representing datasets of the data; receiving, via the graphical user interface, selections of dataset icons corresponding to respective datasets of the database, indications of graphical associations between two or more dataset icons that correspond to selected datasets, and an operation to perform on the selected datasets, wherein the operation is selected from a plurality of operations that are provided based on an indication of a graphical association between the two or more dataset icons, wherein the operations are provided in a natural language expression of the operations; generating, by at least one processor of the computer system, the graphical representation of the structured query in the graphical user interface based on the selections of the dataset icons and the operations to perform on the datasets, the graphical representation including the dataset icon and/or a representation of a selected operation; generating, by at least one processor of the computer system, the structured query based on the graphical representation wherein generating the structured query includes processing one or more of the datasets associated with the graphical query, and wherein the constructing further includes incorporating the SQL substatement into the machine-readable SQL query; executing the structured query against the database; and providing results of the execution of the structured query. 38. The method of claim 37 wherein the receiving comprises determining, from amongst the selections, a target set of data from the database to be returned from the execution. | 0.634454 |
8,126,712 | 23 | 25 | 23. The information communication terminal according to claim 20 , wherein the keyword extraction module calculates, with regards to the respective extracted words, a difference between an average distance between words shown by the knowledge network data and an average distance of the shortest distance data to calculate a relation between words to extract, as the keyword, a word for which the difference is equal to or higher than a set value. | 23. The information communication terminal according to claim 20 , wherein the keyword extraction module calculates, with regards to the respective extracted words, a difference between an average distance between words shown by the knowledge network data and an average distance of the shortest distance data to calculate a relation between words to extract, as the keyword, a word for which the difference is equal to or higher than a set value. 25. The information communication terminal according to claim 23 , wherein the related word extraction module reads an upper limit value of an extraction quantity of the related word to extract the related words in a quantity corresponding to the upper limit value. | 0.5 |
7,571,162 | 8 | 11 | 8. A computer-implemented method for obtaining comparative web results from a computing device operatively connected to a network through a browser comprising the steps of: transmitting a first search query to obtain a first search result; transmitting a second search query that is related to the first search query to obtain a second search result; receiving at the computing results the plurality of comparative search result groups that each include a first element from the first search result and a second element from the second search result, the plurality of the comparative search result groups being generated based on the following equation:
f q1q2 ( p 1, p 2)=α· R ( p 1, q 1)+β· R ( p 2, q 2)+γ· S ( p 1 q 1, p 2 q 2), p 1∈ SR 1, p 2∈ SR 2 wherein SR 1 represents the first search results for the first search query q 1 , SR 2 represents the second search results for the second search query q 2 , p 1 represents an element from SR 1 , p 2 represents an element from SR 2 , R represents relevance of an element to a query, S represents similarity between two elements, p 1 q 1 represents text content of p 1 after removing terms of p 1 , p 2 q 2 represents text content of p 2 after removing terms of q 2 , and α, β, and γ represents constants wherein the elements are grouped based on relevance of the first element to the first search query and relevance of the second element to the second search query. | 8. A computer-implemented method for obtaining comparative web results from a computing device operatively connected to a network through a browser comprising the steps of: transmitting a first search query to obtain a first search result; transmitting a second search query that is related to the first search query to obtain a second search result; receiving at the computing results the plurality of comparative search result groups that each include a first element from the first search result and a second element from the second search result, the plurality of the comparative search result groups being generated based on the following equation:
f q1q2 ( p 1, p 2)=α· R ( p 1, q 1)+β· R ( p 2, q 2)+γ· S ( p 1 q 1, p 2 q 2), p 1∈ SR 1, p 2∈ SR 2 wherein SR 1 represents the first search results for the first search query q 1 , SR 2 represents the second search results for the second search query q 2 , p 1 represents an element from SR 1 , p 2 represents an element from SR 2 , R represents relevance of an element to a query, S represents similarity between two elements, p 1 q 1 represents text content of p 1 after removing terms of p 1 , p 2 q 2 represents text content of p 2 after removing terms of q 2 , and α, β, and γ represents constants wherein the elements are grouped based on relevance of the first element to the first search query and relevance of the second element to the second search query. 11. The computer-implemented method of claim 8 , further comprising the step of: displaying a cluster comprising a subset of the plurality of comparative search result groups that comprise similar information. | 0.5 |
10,089,383 | 22 | 23 | 22. A network computer for managing data, comprising: a transceiver that communicates over the network; a memory that stores at least instructions; and one or more processor devices that execute instructions that perform actions, including: instantiating an attributes engine to perform further actions, including: analyzing one or more characteristics of one or more model object features of a plurality of model objects; classifying the one or more model object features based on the one or more characteristics, wherein the one or more characteristics include a data type and one or more values of the one or more model object features; and associating one or more similarity tasks with the one or more model object features based on their classification; and instantiating a similarity engine to perform further actions, including: providing a similarity model that includes the one or more similarity tasks; employing the similarity model to provide one or more candidate similarity scores based on one or more exemplar model objects that are labeled as being similar, wherein the one or more exemplar model objects are provided by a similarity client application; modifying the similarity model based on the one or more exemplar model objects and the one or more candidate similarity scores; employing the modified similarity model to provide similarity scores for one or more model objects, wherein providing the similarity scores is based on execution of the one or more similarity tasks that are associated with the one or more model object features of the one or more model objects; and identifying two or more similar model objects based on the similarity scores for visual presentation in a display to a user, wherein one or more features of the visual presentation are modified based on geo-location information of the user provided by a global positioning system (GPS) device, and wherein the one or more modified features include one or more of a time zone, language, currency, or calendar format. | 22. A network computer for managing data, comprising: a transceiver that communicates over the network; a memory that stores at least instructions; and one or more processor devices that execute instructions that perform actions, including: instantiating an attributes engine to perform further actions, including: analyzing one or more characteristics of one or more model object features of a plurality of model objects; classifying the one or more model object features based on the one or more characteristics, wherein the one or more characteristics include a data type and one or more values of the one or more model object features; and associating one or more similarity tasks with the one or more model object features based on their classification; and instantiating a similarity engine to perform further actions, including: providing a similarity model that includes the one or more similarity tasks; employing the similarity model to provide one or more candidate similarity scores based on one or more exemplar model objects that are labeled as being similar, wherein the one or more exemplar model objects are provided by a similarity client application; modifying the similarity model based on the one or more exemplar model objects and the one or more candidate similarity scores; employing the modified similarity model to provide similarity scores for one or more model objects, wherein providing the similarity scores is based on execution of the one or more similarity tasks that are associated with the one or more model object features of the one or more model objects; and identifying two or more similar model objects based on the similarity scores for visual presentation in a display to a user, wherein one or more features of the visual presentation are modified based on geo-location information of the user provided by a global positioning system (GPS) device, and wherein the one or more modified features include one or more of a time zone, language, currency, or calendar format. 23. The network computer of claim 22 , wherein the attributes engine performs further actions, comprising: classifying one or more of the model object fields that include another model object by classifying the other model object's features; associating one or more additional similarity tasks with the other model object's features; and including the one or more additional similarity tasks in the similarity model. | 0.629893 |
8,478,737 | 1 | 7 | 1. A system for segmenting a session of queries comprising: a search log database operative to store search queries; and a segmenter coupled with the search log database, the segmenter further including: a receiver operative to receive a pair of queries from the search log database; a feature analyzer coupled with the receiver and operative to compare the pair of queries based on at least one feature; and an identifier coupled with the feature analyzer and operative to identify a goal boundary between the pair of queries when the at least one feature of the pair of queries indicates a change between the pair of queries; wherein the receiver is further operative to receive additional successive pairs of the stored search queries for identifying goal boundaries in the session of queries. | 1. A system for segmenting a session of queries comprising: a search log database operative to store search queries; and a segmenter coupled with the search log database, the segmenter further including: a receiver operative to receive a pair of queries from the search log database; a feature analyzer coupled with the receiver and operative to compare the pair of queries based on at least one feature; and an identifier coupled with the feature analyzer and operative to identify a goal boundary between the pair of queries when the at least one feature of the pair of queries indicates a change between the pair of queries; wherein the receiver is further operative to receive additional successive pairs of the stored search queries for identifying goal boundaries in the session of queries. 7. The system according to claim 1 wherein the change comprises a difference in the at least one feature between the successive pair. | 0.81 |
7,967,194 | 1 | 11 | 1. A system for transaction card customization including a centralized issuer hub providing a single point of website integration for applicants in different countries, the system comprising: a centralized issuer hub comprising a server that coordinates data exchange between at least two of a plurality of local issuer country websites and a card customization services for processing applicant requests for a customized transaction card, the card customization services allowing an applicant to customize an image to be added to a front surface of the customized transaction card; wherein a local issuer country website provides a browser-based user interface for the applicant; wherein the transaction card customization services includes a website that recognizes an issuer country of the applicant and launches a dedicated country-specific website for the applicant based upon on a country of origin of the local issuer country website; wherein the transaction card customization services further includes a syndication layer that adds country-specific content to a base website that serves up the dedicated country-specific website for the applicant, the base website including central features and functionality that make up the credit card customization software application without including any issuer-specific enhancements, branding, foreign language, colors, artwork and website links. | 1. A system for transaction card customization including a centralized issuer hub providing a single point of website integration for applicants in different countries, the system comprising: a centralized issuer hub comprising a server that coordinates data exchange between at least two of a plurality of local issuer country websites and a card customization services for processing applicant requests for a customized transaction card, the card customization services allowing an applicant to customize an image to be added to a front surface of the customized transaction card; wherein a local issuer country website provides a browser-based user interface for the applicant; wherein the transaction card customization services includes a website that recognizes an issuer country of the applicant and launches a dedicated country-specific website for the applicant based upon on a country of origin of the local issuer country website; wherein the transaction card customization services further includes a syndication layer that adds country-specific content to a base website that serves up the dedicated country-specific website for the applicant, the base website including central features and functionality that make up the credit card customization software application without including any issuer-specific enhancements, branding, foreign language, colors, artwork and website links. 11. The system of claim 1 , wherein the card customization services website mirrors the dedicated country-specific website, such that system interface branding elements and artwork appear on both websites. | 0.706304 |
9,940,384 | 11 | 12 | 11. The computer program product of claim 8 , wherein performing a follow-up question and answer conversation comprises generating one or more follow-up questions to be presented to the user to gather information required about the entity of interest and receiving responses to the one or more questions from the user. | 11. The computer program product of claim 8 , wherein performing a follow-up question and answer conversation comprises generating one or more follow-up questions to be presented to the user to gather information required about the entity of interest and receiving responses to the one or more questions from the user. 12. The computer program product of claim 11 , wherein performing a follow-up question and answer conversation further comprises parsing the responses to determine values for attributes that form the driving factors. | 0.5 |
8,073,741 | 9 | 15 | 9. A system for locating a relevant product, the system comprising: a client computer including at least one processor and at least one memory, the memory of the client computer including computer program instructions configured to be executed by the processor of the client computer to: receive a search topic from a user; receive one or more attributes associated with the topic; and assign a rating to at least one of the attributes; a server communicatively coupled to the client computer, the server including at least one processor and at least one memory, the memory of the server including computer program instructions configured to be executed by the processor of the server to: locate at one or more information locations at least two separate instances of the topic; and locate at least two information fields, each field related to one of the instances of the topic, wherein the computer program instructions of at least one of the client computer and the server include instructions to: associate content in each of at least two of the information fields with at least one of the attributes; compare the content in each of the at least two information fields associated with an attribute against each other; assign a score to the content of each compared instance of content based on the comparing; prioritize the attributes; and rank the located instances of the topic based on the prioritizing and the score of content associated with the topic. | 9. A system for locating a relevant product, the system comprising: a client computer including at least one processor and at least one memory, the memory of the client computer including computer program instructions configured to be executed by the processor of the client computer to: receive a search topic from a user; receive one or more attributes associated with the topic; and assign a rating to at least one of the attributes; a server communicatively coupled to the client computer, the server including at least one processor and at least one memory, the memory of the server including computer program instructions configured to be executed by the processor of the server to: locate at one or more information locations at least two separate instances of the topic; and locate at least two information fields, each field related to one of the instances of the topic, wherein the computer program instructions of at least one of the client computer and the server include instructions to: associate content in each of at least two of the information fields with at least one of the attributes; compare the content in each of the at least two information fields associated with an attribute against each other; assign a score to the content of each compared instance of content based on the comparing; prioritize the attributes; and rank the located instances of the topic based on the prioritizing and the score of content associated with the topic. 15. The system according to claim 9 , wherein the computer program instructions of the client computer include instructions to: receive a user rating of a product; and rank the plurality of results of the searching based at least in part on the user rating. | 0.648907 |
8,196,092 | 9 | 11 | 9. A system operable over a network, the system comprising: at least one database system for housing one or more Extensible Stylesheet Language (XSL) dialog modules (XDMs); at least one server computer in communication with the at least one database system through the network; a computer program product, responsive to a request by one or more user computers through the network, the computer program product comprising a computer readable medium having stored thereon computer readable code for generating XSL dialog modules (XDMs), the computer readable program code comprising: computer readable program code for configuring XDM logic; computer readable program code for specifying an Extensible Mark-up Language (XML) structure, wherein the XML structure comprises a predicate framework for forming an XML instance, and the XDM logic comprises processing routines and run-time event handling routines typical to a voiceportal application, the run-time event handling routines comprising: collecting caller information; responding to caller events; confirming the caller information; and returning the caller information collected to the voiceportal application; an interface, operable on the one or more user computers and at least one server computer, the interface comprising: receiving a request for generating XML code, the generated code being operable with the XDM; in response to the request, receiving prompts and conditions appropriate for an information providing state and an information gathering state, the appropriate prompts being executed based on run-time values; generating XML code in accordance with the received prompts and conditions; and returning the generated XML code to a voice portal application, wherein the XML code is operable with the generated XDM for inclusion in a voiceXML document. | 9. A system operable over a network, the system comprising: at least one database system for housing one or more Extensible Stylesheet Language (XSL) dialog modules (XDMs); at least one server computer in communication with the at least one database system through the network; a computer program product, responsive to a request by one or more user computers through the network, the computer program product comprising a computer readable medium having stored thereon computer readable code for generating XSL dialog modules (XDMs), the computer readable program code comprising: computer readable program code for configuring XDM logic; computer readable program code for specifying an Extensible Mark-up Language (XML) structure, wherein the XML structure comprises a predicate framework for forming an XML instance, and the XDM logic comprises processing routines and run-time event handling routines typical to a voiceportal application, the run-time event handling routines comprising: collecting caller information; responding to caller events; confirming the caller information; and returning the caller information collected to the voiceportal application; an interface, operable on the one or more user computers and at least one server computer, the interface comprising: receiving a request for generating XML code, the generated code being operable with the XDM; in response to the request, receiving prompts and conditions appropriate for an information providing state and an information gathering state, the appropriate prompts being executed based on run-time values; generating XML code in accordance with the received prompts and conditions; and returning the generated XML code to a voice portal application, wherein the XML code is operable with the generated XDM for inclusion in a voiceXML document. 11. The system of claim 9 , wherein each database system comprises a computer data structure stored in a memory of a computer configured to manipulate the data structure, the computer being responsive to interactions with the computer program product. | 0.5 |
7,750,911 | 2 | 3 | 2. The system of claim 1 wherein the curve model generation software is responsive to repetitive strokes made with the pen stylus when the first 2D curve is sketched to generate the first 2D vector curve when a settle command is received after the first 2D curve is sketched and before the second 2D curve is sketched, and is responsive to repetitive strokes made with the pen stylus when the second 2D curve is sketched to generate the second 2D vector curve when the settle command is received after the second 2D curve is sketched. | 2. The system of claim 1 wherein the curve model generation software is responsive to repetitive strokes made with the pen stylus when the first 2D curve is sketched to generate the first 2D vector curve when a settle command is received after the first 2D curve is sketched and before the second 2D curve is sketched, and is responsive to repetitive strokes made with the pen stylus when the second 2D curve is sketched to generate the second 2D vector curve when the settle command is received after the second 2D curve is sketched. 3. The system of claim 2 wherein the curve model generation software is responsive to the start of a distinct curve as the settle command. | 0.5 |
9,519,661 | 14 | 20 | 14. A system comprising: at least one computing device, each computing device comprising one or more processors and a storage medium for tangibly storing thereon program logic for execution by the one or more processors, the stored program logic comprising: receiving logic executed by the one or more processors for receiving a search query from a user; determining logic executed by the one or more processors for determining a search result set by performing a search using the search query, the search result set comprising one or more search results associated with one or more webpages for the search query; determining logic executed by the one or more processors for determining one or more images using at least one search result associated with at least one webpage from the search result set determined from the search performed using the search query from at least one of one or more webpages identified in the search result set and from an image web search; using logic executed by the one or more processors for using any of the one or more images determined from the at least one search result associated with the at least one webpage in an assemblage to create a background picture to be rendered as background in a web search results page; and communicating logic executed by the one or more processors for communicating the one or more search result in the web search results page comprising the background picture as background created from the one or more images determined from the at least one search result associated with the at least one webpage, wherein each of the one or more images in the background picture is user-selectable to access the at least one webpage associated with a search result used in determining the one or more images. | 14. A system comprising: at least one computing device, each computing device comprising one or more processors and a storage medium for tangibly storing thereon program logic for execution by the one or more processors, the stored program logic comprising: receiving logic executed by the one or more processors for receiving a search query from a user; determining logic executed by the one or more processors for determining a search result set by performing a search using the search query, the search result set comprising one or more search results associated with one or more webpages for the search query; determining logic executed by the one or more processors for determining one or more images using at least one search result associated with at least one webpage from the search result set determined from the search performed using the search query from at least one of one or more webpages identified in the search result set and from an image web search; using logic executed by the one or more processors for using any of the one or more images determined from the at least one search result associated with the at least one webpage in an assemblage to create a background picture to be rendered as background in a web search results page; and communicating logic executed by the one or more processors for communicating the one or more search result in the web search results page comprising the background picture as background created from the one or more images determined from the at least one search result associated with the at least one webpage, wherein each of the one or more images in the background picture is user-selectable to access the at least one webpage associated with a search result used in determining the one or more images. 20. The system as claimed in claim 14 , the assemblage further comprising at least one image relevant to the search query identified from an image web search. | 0.5 |
8,250,529 | 2 | 3 | 2. The method of claim 1 , wherein the procedural language code is ABAP language code and the operational system is an SAP R/3 system. | 2. The method of claim 1 , wherein the procedural language code is ABAP language code and the operational system is an SAP R/3 system. 3. The method of claim 2 , further comprising optimizing the declarative specification prior to generating the ABAP program code. | 0.5 |
6,032,116 | 18 | 22 | 18. A method of generating a robust distance measure in a speech recognition system comprising the steps of: generating P order line spectral pair frequencies for a speech input signal; determining a difference, for i=1 to N.sub.1, between the ith line spectral pair frequency and an ith line spectral frequency of a reference speech signal; shifting the difference, for i=1 to N.sub.1, by an ith frequency shifting factor to at least partially compensate for frequency shifting of the ith speech input signal line spectral pair frequency by acoustic noise; and utilizing the shifted difference to classify the speech input signal. | 18. A method of generating a robust distance measure in a speech recognition system comprising the steps of: generating P order line spectral pair frequencies for a speech input signal; determining a difference, for i=1 to N.sub.1, between the ith line spectral pair frequency and an ith line spectral frequency of a reference speech signal; shifting the difference, for i=1 to N.sub.1, by an ith frequency shifting factor to at least partially compensate for frequency shifting of the ith speech input signal line spectral pair frequency by acoustic noise; and utilizing the shifted difference to classify the speech input signal. 22. The method of claim 18 wherein the ith frequency shifting factor is proportional to a power spectrum of a linear prediction error at the ith line spectral pair frequency. | 0.759669 |
8,019,657 | 1 | 4 | 1. A system for searching products intelligently based on analysis of customer's purchasing behavior, the system comprising: a computer accessible search engine database embedded in a computer memory; a computer accessible product database configured in a computer memory to store a finite predetermined number of related keyword information for each individual product, the related keyword information including click data, order data and a first priority value for each individual related keyword; a computer accessible input unit configured to receive keywords, product selection or order information; a computer processor based search unit configured to perform a search of the search engine database based on natural language, synonym, and morpheme analysis of the received keyword which creates a second priority value and search of the product database based on an analysis of the related keyword information with the received keywords so as to get search results; an algorithm embedded in a computer processor for arranging the search results, comprising the steps of: tabulating the total number of clicks made on the website link to a product to compute the total clicks; multiplying the total clicks data by a weighting factor to compute a weighted total clicks; tabulating the total number of clicks made on the website link that resulted in a purchase to compute total purchase clicks; multiplying the total purchase clicks by another separate weighting factor to compute a weighted total purchased clicks; adding the weighted total clicks to the weighted total purchased clicks to update the first priority value; multiplying the updated first priority value by another separate weighting factor to compute a weighted first priority value; multiplying the second priority value by another separate weighting factor to compute a weighted second priority value; and adding the weighted first priority value to the weighted second priority value to calculate a summed value for arranging the search results by the summed value; and a computer operable output unit configured to output the arranged search results. | 1. A system for searching products intelligently based on analysis of customer's purchasing behavior, the system comprising: a computer accessible search engine database embedded in a computer memory; a computer accessible product database configured in a computer memory to store a finite predetermined number of related keyword information for each individual product, the related keyword information including click data, order data and a first priority value for each individual related keyword; a computer accessible input unit configured to receive keywords, product selection or order information; a computer processor based search unit configured to perform a search of the search engine database based on natural language, synonym, and morpheme analysis of the received keyword which creates a second priority value and search of the product database based on an analysis of the related keyword information with the received keywords so as to get search results; an algorithm embedded in a computer processor for arranging the search results, comprising the steps of: tabulating the total number of clicks made on the website link to a product to compute the total clicks; multiplying the total clicks data by a weighting factor to compute a weighted total clicks; tabulating the total number of clicks made on the website link that resulted in a purchase to compute total purchase clicks; multiplying the total purchase clicks by another separate weighting factor to compute a weighted total purchased clicks; adding the weighted total clicks to the weighted total purchased clicks to update the first priority value; multiplying the updated first priority value by another separate weighting factor to compute a weighted first priority value; multiplying the second priority value by another separate weighting factor to compute a weighted second priority value; and adding the weighted first priority value to the weighted second priority value to calculate a summed value for arranging the search results by the summed value; and a computer operable output unit configured to output the arranged search results. 4. The system according to claim 1 , wherein the algorithm further comprises adding new keywords that cannot be searched by using the related keyword information to the product database. | 0.5 |
9,619,481 | 13 | 14 | 13. The method of claim 12 , the method further comprising: calculating the test score for a test taking user based on a test taken for a particular topic; computing the confidence score for each annotation by distributing the test score among each annotation imported by the test taking user; and changing the rank of the expert student who authored each annotation based at least in part on the confidence score. | 13. The method of claim 12 , the method further comprising: calculating the test score for a test taking user based on a test taken for a particular topic; computing the confidence score for each annotation by distributing the test score among each annotation imported by the test taking user; and changing the rank of the expert student who authored each annotation based at least in part on the confidence score. 14. The method of claim 13 , wherein the confidence score for each annotation increases as users who import the annotation score higher on tests than previous users who imported the annotation. | 0.5 |
9,467,434 | 17 | 18 | 17. A non-transitory computer-readable storage medium storing instructions executable by one or more processors to cause operations to be performed including: receiving, by one or more first servers of a database system, a request to generate a platform-independent document based on a renderable web document, the request including markup language content for the renderable web document; providing, by the one or more first servers, the markup language content to a rendering engine of the one or more first servers, the rendering engine being configured to: parse the markup language content, generate one or more resource requests for resources identified in the parsed markup language content, and communicate the one or more resource requests; intercepting, by the one or more first servers, the one or more resource requests communicated from the rendering engine; communicating, by the one or more first servers, the one or more intercepted requests, or one or more requests based on the intercepted requests, to retrieve resources identified in the one or more intercepted requests; receiving, by the one or more first servers, resources retrieved based on the communicated one or more intercepted requests, or the communicated one or more requests based on the intercepted requests; and providing, by the one or more first servers, the received resources to the rendering engine, the rendering engine being further configured to generate the platform-independent document based on the markup language content and the provided resources; and providing, by the one or more first servers, the generated platform-independent document for communication to a remote computing device. | 17. A non-transitory computer-readable storage medium storing instructions executable by one or more processors to cause operations to be performed including: receiving, by one or more first servers of a database system, a request to generate a platform-independent document based on a renderable web document, the request including markup language content for the renderable web document; providing, by the one or more first servers, the markup language content to a rendering engine of the one or more first servers, the rendering engine being configured to: parse the markup language content, generate one or more resource requests for resources identified in the parsed markup language content, and communicate the one or more resource requests; intercepting, by the one or more first servers, the one or more resource requests communicated from the rendering engine; communicating, by the one or more first servers, the one or more intercepted requests, or one or more requests based on the intercepted requests, to retrieve resources identified in the one or more intercepted requests; receiving, by the one or more first servers, resources retrieved based on the communicated one or more intercepted requests, or the communicated one or more requests based on the intercepted requests; and providing, by the one or more first servers, the received resources to the rendering engine, the rendering engine being further configured to generate the platform-independent document based on the markup language content and the provided resources; and providing, by the one or more first servers, the generated platform-independent document for communication to a remote computing device. 18. The computer-readable storage medium of claim 17 , the operations further including: generating, by one or more second servers of the database system different than the one or more first servers, the renderable web document including the markup language content; communicating, by the one or more second servers, the request to generate the platform-independent document to the document-rendering service; receiving, by the one or more second servers, the communicated one or more intercepted requests, or the communicated one or more requests based on the intercepted requests; retrieving, by the one or more second servers, the resources identified in the communicated one or more intercepted requests, or the communicated one or more requests based on the intercepted requests; and communicating, by the one or more second servers, the retrieved resources to the one or more first servers. | 0.5 |
7,805,398 | 1 | 3 | 1. A tangible computer-readable storage medium storing computer-executable instructions for execution by a processor, the medium storing one or more instructions for: registering, with a modeling application, one or more rules related to an entity associated with a model; receiving input specifying a value of a first attribute associated with the entity; and applying the one or more registered rules to the value of the first attribute to: infer a value of a second attribute associated with the entity or another entity associated with the model, or validate the value of the first attribute or the value of the second attribute. | 1. A tangible computer-readable storage medium storing computer-executable instructions for execution by a processor, the medium storing one or more instructions for: registering, with a modeling application, one or more rules related to an entity associated with a model; receiving input specifying a value of a first attribute associated with the entity; and applying the one or more registered rules to the value of the first attribute to: infer a value of a second attribute associated with the entity or another entity associated with the model, or validate the value of the first attribute or the value of the second attribute. 3. The medium of claim 1 , wherein the entity is a parameter associated with a signal of the model. | 0.686709 |
7,954,084 | 3 | 10 | 3. The non-transitory computer-readable medium encoded with instructions according to claim 2 , wherein each of the two adapters produce said respective interfacing computer code for a respective object class among said two object classes. | 3. The non-transitory computer-readable medium encoded with instructions according to claim 2 , wherein each of the two adapters produce said respective interfacing computer code for a respective object class among said two object classes. 10. The non-transitory computer-readable medium encoded with instructions according to claim 3 , wherein said two adapters having to handle the dependency are chosen following assignment rules associating, for the orientation of the dependency of said two object classes, an adapter corresponding to each of the code generators translating said two object classes, said assignment rules being modifiable. | 0.5 |
7,721,270 | 14 | 18 | 14. A computer readable medium that stores code executable by a processor that causes a computer to: convert the non-structured information transformation specification to a structured information transformation specification; generate information transformation code responsive to the structured information transformation specification, alter the information transformation code, and associate a code alteration indication to the non-structured information transformation specification in response to the alteration of the information transformation code, the association further comprising performing a conversion of the information transformation code to a format compatible with the structured information transformation specification to generate an intermediate code alteration, and performing a conversion of the intermediate code alteration to a format compatible with the non-structured information transformation specification to generate the code alteration indication. | 14. A computer readable medium that stores code executable by a processor that causes a computer to: convert the non-structured information transformation specification to a structured information transformation specification; generate information transformation code responsive to the structured information transformation specification, alter the information transformation code, and associate a code alteration indication to the non-structured information transformation specification in response to the alteration of the information transformation code, the association further comprising performing a conversion of the information transformation code to a format compatible with the structured information transformation specification to generate an intermediate code alteration, and performing a conversion of the intermediate code alteration to a format compatible with the non-structured information transformation specification to generate the code alteration indication. 18. The computer readable medium according to claim 14 wherein the code further causes the computer to provide indications of recommended non-structured information transformation specification rules. | 0.700599 |
8,122,041 | 11 | 14 | 11. A computer-based method for allowing a searcher to share search history information with an abbreviated number of actions, the method comprising: receiving a search query; providing a plurality of document links responsive to the search query; receiving a selection of at least one provided document link; associating the at least one selected document link with the search query; storing the search query and associated at least one document link in an outside recipient data location; associating the stored search query and associated at least one document link with an identifier; identifying a predetermined potential recipient list subsequent to detection of access to the at least one document link; transmitting a shared history document link to a recipient from the predetermined potential recipient list based on an abbreviated number of received user actions subsequent to identifying the predetermined recipient list, the shared history document link corresponding to a document that includes the search query and associated at least one document link; and using the identifier to locate the stored search query and associated document links when the shared history document link is accessed. | 11. A computer-based method for allowing a searcher to share search history information with an abbreviated number of actions, the method comprising: receiving a search query; providing a plurality of document links responsive to the search query; receiving a selection of at least one provided document link; associating the at least one selected document link with the search query; storing the search query and associated at least one document link in an outside recipient data location; associating the stored search query and associated at least one document link with an identifier; identifying a predetermined potential recipient list subsequent to detection of access to the at least one document link; transmitting a shared history document link to a recipient from the predetermined potential recipient list based on an abbreviated number of received user actions subsequent to identifying the predetermined recipient list, the shared history document link corresponding to a document that includes the search query and associated at least one document link; and using the identifier to locate the stored search query and associated document links when the shared history document link is accessed. 14. The computer-based method of claim 11 , wherein the abbreviated number of received user actions consists essentially of: receiving a selection of the recipient from the predetermined potential recipient list; receiving a user action requesting storing of the search query and associated document links; and receiving a user action requesting transmittal of the search query and associated document links to the selected recipient. | 0.557143 |
7,801,901 | 1 | 4 | 1. A machine implemented system that effectuates queryline tracking, comprising: an analysis component that constructs and utilizes an evolving topic model to discover, within one or more documents delivered in a stream, one or more themes or storylines associated with a query, wherein the evolving topic model is incrementally constructed as the one or more documents having new data are delivered in the stream; a ranking component that utilizes the one or more documents and the one or more themes or storylines to provide a relative ordering of the one or more documents with respect to the theme, the ranking component employing a word-document co-occurrence matrix represented by a bipartite graph constructed by the analysis component to provide the relative ordering of the one or more documents; and a notification component that generates and propagates an alert based at least in part on the relative ordering and a novelty related to the one or more themes or storylines. | 1. A machine implemented system that effectuates queryline tracking, comprising: an analysis component that constructs and utilizes an evolving topic model to discover, within one or more documents delivered in a stream, one or more themes or storylines associated with a query, wherein the evolving topic model is incrementally constructed as the one or more documents having new data are delivered in the stream; a ranking component that utilizes the one or more documents and the one or more themes or storylines to provide a relative ordering of the one or more documents with respect to the theme, the ranking component employing a word-document co-occurrence matrix represented by a bipartite graph constructed by the analysis component to provide the relative ordering of the one or more documents; and a notification component that generates and propagates an alert based at least in part on the relative ordering and a novelty related to the one or more themes or storylines. 4. The system of claim 1 , further including a separation component that receives the query and the stream from an interface component and identifies the one or more documents in the stream that correspond with the query. | 0.517467 |
7,761,287 | 1 | 5 | 1. A computing device for determining an opinion expressed via target words, the device comprising an opinion data store that specifies sequences of parts of speech that may express an opinion, a probability that each sequence contains a word that may express an opinion, and a probability that each word expresses an opinion; and an infer opinion component that includes a component that calculates a probability that the target words contain sequences specified in the opinion data store; a component that retrieves from the opinion data store the probability that the sequences of the target words contain a word that may express an opinion; a component that retrieves from the opinion data store the probability that the words of the target words may express an opinion; and a component that selects an opinion for the target words based on a combination of the probabilities. | 1. A computing device for determining an opinion expressed via target words, the device comprising an opinion data store that specifies sequences of parts of speech that may express an opinion, a probability that each sequence contains a word that may express an opinion, and a probability that each word expresses an opinion; and an infer opinion component that includes a component that calculates a probability that the target words contain sequences specified in the opinion data store; a component that retrieves from the opinion data store the probability that the sequences of the target words contain a word that may express an opinion; a component that retrieves from the opinion data store the probability that the words of the target words may express an opinion; and a component that selects an opinion for the target words based on a combination of the probabilities. 5. The computing device of claim 1 including: a generate opinion data component that generates opinion data of the opinion data store including: an identify sequences component that identifies sequences of parts of speech that may express an opinion; a first calculate probability component that calculates a probability that each sequence contains a word that may express an opinion; and a second calculate probability component that calculates a probability that each word expresses an opinion. | 0.793333 |
8,117,225 | 15 | 95 | 15. A computer program product embodied on a non-transitory computer-readable medium, comprising: code for registering a global unique user login information capable of being used to access a plurality of different online applications associated with an online application system including a first online application that provides access to a first one or more files associated with the first online application, a second online application that provides access to a second one or more files associated with the second online application, a third online application that provides access to a third one or more files associated with the third online application, and a fourth online application that provides access to a fourth one or more files associated with the fourth online application; code for receiving the global unique user login information in connection with a login; code for receiving an indication to add access to the first online application, utilizing at least one first online application identifier associated with the first online application; code for receiving an indication to add access to the second online application, utilizing at least one second online application identifier associated with the second online application; code for receiving an indication to add access to the third online application, utilizing at least one third online application identifier associated with the third online application; code for receiving an indication to add access to the fourth online application, utilizing at least one fourth online application identifier associated with the fourth online application; code for allowing registration of the first online application; code for allowing registration of the second online application; code for allowing registration of the third online application; code for allowing registration of the fourth online application; code for displaying the at least one first online application identifier associated with the first online application for access purposes; code for displaying the at least one second online application identifier associated with the second online application for access purposes; code for displaying the at least one third online application identifier associated with the third online application for access purposes; code for displaying the at least one fourth online application identifier associated with the fourth online application for access purposes; code for receiving a selection of the at least one first online application identifier associated with the first online application for access purposes; code for receiving a selection of the at least one second online application identifier associated with the second online application for access purposes; code for receiving a selection of the at least one third online application identifier associated with the third online application for access purposes; code for receiving a selection of the at least one fourth online application identifier associated with the fourth online application for access purposes; code for, in response to the selection of the at least one first online application identifier associated with the first online application for access purposes, allowing access to the first online application; code for, in response to the selection of the at least one second online application identifier associated with the second online application for access purposes, allowing access to the second online application; code for, in response to the selection of the at least one third online application identifier associated with the third online application for access purposes, allowing access to the third online application; code for, in response to the selection of the at least one fourth online application identifier associated with the fourth online application for access purposes, allowing access to the fourth online application; code for identifying at least one profile, the at least one profile including: at least one user profile of an accessing user, the at least one user profile including: registration information determined when the accessing user registered, and automatically determined information that is determined automatically based on user selections of the accessing user; and at least one group profile; code for displaying a search interface in connection with the online application system, the search interface being displayed simultaneously with an advertisement that is selected based on the registration information and the automatically determined information of the at least one user profile, and the at least one group profile; code for performing a search in connection with the online application system utilizing the search interface; and code for displaying search results of the search, where the search results involve a plurality of the different online applications associated with the online application system. | 15. A computer program product embodied on a non-transitory computer-readable medium, comprising: code for registering a global unique user login information capable of being used to access a plurality of different online applications associated with an online application system including a first online application that provides access to a first one or more files associated with the first online application, a second online application that provides access to a second one or more files associated with the second online application, a third online application that provides access to a third one or more files associated with the third online application, and a fourth online application that provides access to a fourth one or more files associated with the fourth online application; code for receiving the global unique user login information in connection with a login; code for receiving an indication to add access to the first online application, utilizing at least one first online application identifier associated with the first online application; code for receiving an indication to add access to the second online application, utilizing at least one second online application identifier associated with the second online application; code for receiving an indication to add access to the third online application, utilizing at least one third online application identifier associated with the third online application; code for receiving an indication to add access to the fourth online application, utilizing at least one fourth online application identifier associated with the fourth online application; code for allowing registration of the first online application; code for allowing registration of the second online application; code for allowing registration of the third online application; code for allowing registration of the fourth online application; code for displaying the at least one first online application identifier associated with the first online application for access purposes; code for displaying the at least one second online application identifier associated with the second online application for access purposes; code for displaying the at least one third online application identifier associated with the third online application for access purposes; code for displaying the at least one fourth online application identifier associated with the fourth online application for access purposes; code for receiving a selection of the at least one first online application identifier associated with the first online application for access purposes; code for receiving a selection of the at least one second online application identifier associated with the second online application for access purposes; code for receiving a selection of the at least one third online application identifier associated with the third online application for access purposes; code for receiving a selection of the at least one fourth online application identifier associated with the fourth online application for access purposes; code for, in response to the selection of the at least one first online application identifier associated with the first online application for access purposes, allowing access to the first online application; code for, in response to the selection of the at least one second online application identifier associated with the second online application for access purposes, allowing access to the second online application; code for, in response to the selection of the at least one third online application identifier associated with the third online application for access purposes, allowing access to the third online application; code for, in response to the selection of the at least one fourth online application identifier associated with the fourth online application for access purposes, allowing access to the fourth online application; code for identifying at least one profile, the at least one profile including: at least one user profile of an accessing user, the at least one user profile including: registration information determined when the accessing user registered, and automatically determined information that is determined automatically based on user selections of the accessing user; and at least one group profile; code for displaying a search interface in connection with the online application system, the search interface being displayed simultaneously with an advertisement that is selected based on the registration information and the automatically determined information of the at least one user profile, and the at least one group profile; code for performing a search in connection with the online application system utilizing the search interface; and code for displaying search results of the search, where the search results involve a plurality of the different online applications associated with the online application system. 95. The computer program product of claim 15 , wherein the group profile includes profile of a user group associated with the file. | 0.914042 |
7,885,908 | 4 | 5 | 4. The method of claim 3 , further comprising: generating, by said inference engine, eleventh inference data, said, sad eleventh inference data comprising an eleventh plurality of inferences associated with said second cohort, said generating said eleventh inference data based on said fifth inference data and said ninth inference data; generating, by said inference engine based on said eleventh inference data, a third associated risk level score for said second cohort; and storing, by said computing system, said eleventh inference data and said third associated risk level score. | 4. The method of claim 3 , further comprising: generating, by said inference engine, eleventh inference data, said, sad eleventh inference data comprising an eleventh plurality of inferences associated with said second cohort, said generating said eleventh inference data based on said fifth inference data and said ninth inference data; generating, by said inference engine based on said eleventh inference data, a third associated risk level score for said second cohort; and storing, by said computing system, said eleventh inference data and said third associated risk level score. 5. The method of claim 4 , further comprising: receiving, by said inference engine, third sensor cohort data associated with a third cohort, said third cohort located within an area governed by said airport; receiving, by said inference engine, third group technology inferences associated with said third cohort; generating, by said inference engine, third risk cohort inferences, said generating said third risk cohort inferences based on said third group technology inferences and said third sensor cohort data; generating, by said inference engine, twelfth inference data, said twelfth inference data comprising a twelfth plurality of inferences associated with said third cohort, wherein said generating said twelfth inference data is based on said third risk cohort inferences and said eleventh inference data; generating, by said inference engine based on said twelfth inference data, a fourth associated risk level score for said third cohort; and storing, by said computing system, said twelfth inference data and said fourth associated risk level score. | 0.5 |
8,886,579 | 1 | 15 | 1. A computer-implemented method of training a neural network, comprising: training a first neural network of a self organizing map type with a first set of first text documents each containing one or more keywords in a semantic context to map each document to a point in the self organizing map by semantic clustering; performing a reverse indexing by determining, for each keyword occurring in the first set, all points in the self organizing map to which first documents containing said keyword are mapped, and storing said mapped points as a pattern for said keyword in a pattern dictionary; forming at least one sequence of keywords from a second set of second text documents each containing one or more keywords in a semantic context; translating said at least one sequence of keywords into at least one sequence of patterns by using said pattern dictionary; and training a second target neural network with said at least one sequence of patterns. | 1. A computer-implemented method of training a neural network, comprising: training a first neural network of a self organizing map type with a first set of first text documents each containing one or more keywords in a semantic context to map each document to a point in the self organizing map by semantic clustering; performing a reverse indexing by determining, for each keyword occurring in the first set, all points in the self organizing map to which first documents containing said keyword are mapped, and storing said mapped points as a pattern for said keyword in a pattern dictionary; forming at least one sequence of keywords from a second set of second text documents each containing one or more keywords in a semantic context; translating said at least one sequence of keywords into at least one sequence of patterns by using said pattern dictionary; and training a second target neural network with said at least one sequence of patterns. 15. A computer-implemented prediction machine, comprising a neural network of a hierarchical temporal memory type which has been trained as said second neural network with a method according to claim 1 . | 0.757757 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.