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
|
|---|---|---|---|---|---|
10,152,319 | 18 | 19 | 18. A system comprising: one or more computer systems comprising one or more hardware processors programmed with computer program instructions that, when executed, cause the one or more computer systems to: cause an executable program associated with an ontology to be run, wherein the ontology comprises information indicating attributes for a set of applications; obtain an instance of the ontology, wherein the ontology instance comprises information indicating attributes for an application of the set of applications; extract axiom information from the ontology; use the axiom information to generate a set of logic rules; use the ontology instance to generate supplemental information for the running executable program, wherein at least part of the supplemental information is generated using the set of logic rules, and wherein the supplemental information defines one or more functionalities of the application; and provide the supplemental information as input to the running executable program, wherein the supplemental information, at least in part, causes the one or more functionalities of the application to be made available via the running executable program without recompiling all of the executable program. | 18. A system comprising: one or more computer systems comprising one or more hardware processors programmed with computer program instructions that, when executed, cause the one or more computer systems to: cause an executable program associated with an ontology to be run, wherein the ontology comprises information indicating attributes for a set of applications; obtain an instance of the ontology, wherein the ontology instance comprises information indicating attributes for an application of the set of applications; extract axiom information from the ontology; use the axiom information to generate a set of logic rules; use the ontology instance to generate supplemental information for the running executable program, wherein at least part of the supplemental information is generated using the set of logic rules, and wherein the supplemental information defines one or more functionalities of the application; and provide the supplemental information as input to the running executable program, wherein the supplemental information, at least in part, causes the one or more functionalities of the application to be made available via the running executable program without recompiling all of the executable program. 19. The system of claim 18 , wherein the running executable program includes a set of runtime rules that control the execution of the running executable program, and wherein the one or more computer systems are caused to: augment the set of logic rules with the set of runtime rules to enable the one or more functionalities of the application to be available via the running executable program. | 0.5 |
9,251,225 | 31 | 35 | 31. The computing system of claim 30 , wherein a first collection of nodes associated with the first mapping rule includes: a first node representing a first relational expression including a relational algebra operation that references the first source entity and the second source entity, a second node linked to the first node representing a relational expression including the first source entity, and a third node linked to the first node representing a relational expression including the second source entity. | 31. The computing system of claim 30 , wherein a first collection of nodes associated with the first mapping rule includes: a first node representing a first relational expression including a relational algebra operation that references the first source entity and the second source entity, a second node linked to the first node representing a relational expression including the first source entity, and a third node linked to the first node representing a relational expression including the second source entity. 35. The computing system of claim 31 , wherein the relational algebra operation is an aggregation operation. | 0.761062 |
7,885,916 | 10 | 16 | 10. A method for providing real-time validation of text input fields in a Web page comprising: receiving a user-entered character in a text field displayed in a Web page; immediately validating the user-entered character against a validation expression contained within a validation-enhanced text input element associated with the text field, wherein the validation expression defines a set of acceptable characters and character positions for the text field; and when the user-entered character is determined invalid, visually highlighting the user-entered character. | 10. A method for providing real-time validation of text input fields in a Web page comprising: receiving a user-entered character in a text field displayed in a Web page; immediately validating the user-entered character against a validation expression contained within a validation-enhanced text input element associated with the text field, wherein the validation expression defines a set of acceptable characters and character positions for the text field; and when the user-entered character is determined invalid, visually highlighting the user-entered character. 16. The method of claim 10 , wherein the validation expression is written using a set of symbols and syntactic elements used to match patterns of text. | 0.755663 |
9,063,927 | 13 | 19 | 13. A classifier device, comprising: memory storing aggregate user data and a classifier application, where the aggregate user data includes a set of messages; and a processor, where the classifier application directs the processor to: determines keyword feature information using aggregate user data; classify the determined feature information, wherein the classifier comprises a set of verified user data utilized to classify feature information and the verified user data is generated by: obtaining a set of training data comprising aggregated short message data; obtaining determined feature data for the set of training data, wherein the determined feature data comprises identified features of the set of training data describing the age of the users providing the aggregated short message data in the set of training data; determining training age data using the classifier by comparing the determined feature data to a set of pre-classified example data, wherein the pre-classified example data comprises a set of example short message data and a corresponding set of known age classification data, wherein each piece of example short message data has a known age described in the set of known age classification data; and verifying the training age data based on the pre-classified example data; and determining statistically relevant features in the verified training age data; wherein the statistically relevant features comprises features of interests within a piece of feature information being classified using the classifier; estimate user age data the aggregate user data based on the classified feature information using the classifier application; and provides the estimated user age data in response to a request for the user age data. | 13. A classifier device, comprising: memory storing aggregate user data and a classifier application, where the aggregate user data includes a set of messages; and a processor, where the classifier application directs the processor to: determines keyword feature information using aggregate user data; classify the determined feature information, wherein the classifier comprises a set of verified user data utilized to classify feature information and the verified user data is generated by: obtaining a set of training data comprising aggregated short message data; obtaining determined feature data for the set of training data, wherein the determined feature data comprises identified features of the set of training data describing the age of the users providing the aggregated short message data in the set of training data; determining training age data using the classifier by comparing the determined feature data to a set of pre-classified example data, wherein the pre-classified example data comprises a set of example short message data and a corresponding set of known age classification data, wherein each piece of example short message data has a known age described in the set of known age classification data; and verifying the training age data based on the pre-classified example data; and determining statistically relevant features in the verified training age data; wherein the statistically relevant features comprises features of interests within a piece of feature information being classified using the classifier; estimate user age data the aggregate user data based on the classified feature information using the classifier application; and provides the estimated user age data in response to a request for the user age data. 19. The classifier of claim 13 , wherein the determined keyword feature information includes feature information selected from the group consisting of: vowel/consonant ratio, capitalization, number of emoticons, punctuation, usage of texting slang, and keyword frequency. | 0.5 |
7,783,971 | 19 | 20 | 19. The tangible medium of claim 18 the instructions further comprising storing the first, second and third documents in a markup language. | 19. The tangible medium of claim 18 the instructions further comprising storing the first, second and third documents in a markup language. 20. The tangible medium of claim 19 wherein the markup language is XML. | 0.5 |
9,128,203 | 10 | 12 | 10. A data processing system for modeling a reservoir property of subsurface reservoir structure by support vector machine processing in the computer of input data available from the reservoir to form measures of the reservoir property at regions of interest in the subsurface reservoir by regression analysis of the available input data, the data processing system comprising: (a) a processor for performing the steps of: (1) receiving training input data about subsurface attributes from seismic survey data obtained from seismic surveys of the reservoir; (2) receiving training target data about formation rock characteristics from data obtained from wells in the reservoir; (3) partitioning the subsurface attributes training data and the formation rock characteristics training target data into a plurality of subsets; (4) selecting formation attribute parameters for support vector machine modeling by cross-correlation of the training input data with the training target data by: (i) cross-validating the subsets of subsurface attributes training data each with the other subsets of the plurality of subsets for a radial based kernel function pair comprising a kernel parameter value and a penalty parameter pair value; (ii) forming an error function for each of the cross-validated subsets; (iii) repeating the steps of cross-validating the subsets of subsurface attributes training data and forming an error function for a plurality of different radial based kernel function pairs; (5) optimizing the selected formation attribute parameters; by determining a minimum error function of the formed error functions for the plurality of different radial based kernel function pairs; (6) providing the training target data, the selected formation attribute parameters, the cross-validated subsets of subsurface attributes training data, and the error functions for the plurality of radial based function kernel pairs as training inputs for support vector machine modeling; (7) performing support vector machine modeling by regression analysis to determine a minimum error function of the error functions of the provided training inputs; (8) predicting the reservoir property based on the support vector modeling of the training inputs; and (b) a display for performing the step of: forming an output display of the predicted reservoir property. | 10. A data processing system for modeling a reservoir property of subsurface reservoir structure by support vector machine processing in the computer of input data available from the reservoir to form measures of the reservoir property at regions of interest in the subsurface reservoir by regression analysis of the available input data, the data processing system comprising: (a) a processor for performing the steps of: (1) receiving training input data about subsurface attributes from seismic survey data obtained from seismic surveys of the reservoir; (2) receiving training target data about formation rock characteristics from data obtained from wells in the reservoir; (3) partitioning the subsurface attributes training data and the formation rock characteristics training target data into a plurality of subsets; (4) selecting formation attribute parameters for support vector machine modeling by cross-correlation of the training input data with the training target data by: (i) cross-validating the subsets of subsurface attributes training data each with the other subsets of the plurality of subsets for a radial based kernel function pair comprising a kernel parameter value and a penalty parameter pair value; (ii) forming an error function for each of the cross-validated subsets; (iii) repeating the steps of cross-validating the subsets of subsurface attributes training data and forming an error function for a plurality of different radial based kernel function pairs; (5) optimizing the selected formation attribute parameters; by determining a minimum error function of the formed error functions for the plurality of different radial based kernel function pairs; (6) providing the training target data, the selected formation attribute parameters, the cross-validated subsets of subsurface attributes training data, and the error functions for the plurality of radial based function kernel pairs as training inputs for support vector machine modeling; (7) performing support vector machine modeling by regression analysis to determine a minimum error function of the error functions of the provided training inputs; (8) predicting the reservoir property based on the support vector modeling of the training inputs; and (b) a display for performing the step of: forming an output display of the predicted reservoir property. 12. The data processing system of claim 10 , wherein the reservoir property comprises porosity of a region of interest in the reservoir. | 0.744361 |
5,579,466 | 10 | 15 | 10. A method in a computer system for formatting data in an edit field, the computer system having windows for inputting and displaying data and having an application program that supports editing, the application program providing a rich text edit control for implementing the behavior of the edit field, the method comprising the computer-implemented steps of: displaying the edit field in an open dialog window; displaying data in the edit field according to a first format; and without closing the dialog window, altering the content of the displayed data; determining a second format for displaying the data in the edit field; and using the rich text edit control, re-displaying the data in the edit field according to the determined second format. | 10. A method in a computer system for formatting data in an edit field, the computer system having windows for inputting and displaying data and having an application program that supports editing, the application program providing a rich text edit control for implementing the behavior of the edit field, the method comprising the computer-implemented steps of: displaying the edit field in an open dialog window; displaying data in the edit field according to a first format; and without closing the dialog window, altering the content of the displayed data; determining a second format for displaying the data in the edit field; and using the rich text edit control, re-displaying the data in the edit field according to the determined second format. 15. The method of claim 10 wherein the step of altering the content of the displayed data in the edit field further comprises the steps of: determining a data selection, the data selection being located in a window other than the dialog window; and incorporating the data selection into the edit field. | 0.603675 |
9,886,172 | 8 | 13 | 8. A non-transitory computer readable storage medium having embodied thereon a program executable by a processor for performing a method for a providing a document electronically to one or more readers for review, the method comprising: receiving one or more reader settings set by an author over a user interface displayed at a computing device, wherein at least one of the reader settings specifies that at least a portion of an uploaded electronic book is to be encrypted; encrypting the specified portion of the uploaded electronic book in accordance with an encryption key; transmitting the encrypted portion of the electronic book over a network interface at the computing device to at least one reader device, wherein decryption of the encrypted portion by the reader device requires a decryption key corresponding to the encryption key; receiving eye tracking data collected by at least one sensor at the reader device after the decrypted portion is displayed at the reader device; identifying that the received eye tracking data indicates a plurality of focal points directed at a subset of content within the display of the transmitted portion at the reader device; receiving feedback data from the reader device in association with the subset of content; and generating a display of the electronic book at the computing device, wherein the generated display further includes the feedback data and indicates the focal points in association with the subset of content. | 8. A non-transitory computer readable storage medium having embodied thereon a program executable by a processor for performing a method for a providing a document electronically to one or more readers for review, the method comprising: receiving one or more reader settings set by an author over a user interface displayed at a computing device, wherein at least one of the reader settings specifies that at least a portion of an uploaded electronic book is to be encrypted; encrypting the specified portion of the uploaded electronic book in accordance with an encryption key; transmitting the encrypted portion of the electronic book over a network interface at the computing device to at least one reader device, wherein decryption of the encrypted portion by the reader device requires a decryption key corresponding to the encryption key; receiving eye tracking data collected by at least one sensor at the reader device after the decrypted portion is displayed at the reader device; identifying that the received eye tracking data indicates a plurality of focal points directed at a subset of content within the display of the transmitted portion at the reader device; receiving feedback data from the reader device in association with the subset of content; and generating a display of the electronic book at the computing device, wherein the generated display further includes the feedback data and indicates the focal points in association with the subset of content. 13. The non-transitory computer readable storage medium of claim 8 , wherein the program further comprises instructions executable to: receive modifications to the portion of the electronic book over the user interface at the computing device; and transmit at least the received modifications to the portion of the electronic book over the network interface at the computing device. | 0.507732 |
9,799,046 | 11 | 16 | 11. A server system for enabling clickless purchasing, the server system comprising: one or more processors; and memory storing one or more programs to be executed by the one or more processors, the one or more programs comprising instructions for: detecting a commercial intent from a user registered with a computer system by: recording online actions of the user, the online actions of the user comprising at least one electronic message posted by the user on a social networking site, wherein the at least one electronic message, includes the commercial intent of the user; and analyzing the at least one electronic message by parsing natural language of the at least one electronic; in response to detecting the commercial intent, determining a product relevant to the detected commercial intent of the user; sending an electronic recommendation message to a client system associated with the user, wherein the electronic recommendation message comprises an option to purchase the product; receiving an electronic response message from the client system associated with the user, the electronic response message comprising an authorization from the user to purchase the product; in response to receiving the electronic response message comprising the authorization from the user to purchase the product, purchasing the product on behalf of the user; and arranging for delivery of the product to the user after purchasing the product. | 11. A server system for enabling clickless purchasing, the server system comprising: one or more processors; and memory storing one or more programs to be executed by the one or more processors, the one or more programs comprising instructions for: detecting a commercial intent from a user registered with a computer system by: recording online actions of the user, the online actions of the user comprising at least one electronic message posted by the user on a social networking site, wherein the at least one electronic message, includes the commercial intent of the user; and analyzing the at least one electronic message by parsing natural language of the at least one electronic; in response to detecting the commercial intent, determining a product relevant to the detected commercial intent of the user; sending an electronic recommendation message to a client system associated with the user, wherein the electronic recommendation message comprises an option to purchase the product; receiving an electronic response message from the client system associated with the user, the electronic response message comprising an authorization from the user to purchase the product; in response to receiving the electronic response message comprising the authorization from the user to purchase the product, purchasing the product on behalf of the user; and arranging for delivery of the product to the user after purchasing the product. 16. The server system of claim 11 , wherein the one or more programs further comprise instructions for: receiving an indication of a purchase intent from the user prior to sending the electronic recommendation message to the client system associated with the user. | 0.886207 |
8,250,079 | 1 | 3 | 1. A method for identifying near and exact-duplicate documents in a document collection, the method comprising: for each document in the collection performing by a computer the steps of: reading textual content from the document; filtering the textual content based on user settings; determining N most frequent words from the filtered textual content of the document to generate a first most frequent, word- 1 , to an Nth most frequent word, word-N, sorted from highest to lowest frequency; performing a quorum search using the N most frequent words from the filtered textual content in the document with a threshold M, wherein the threshold M is used to retrieve documents from the document collection having a number M of the N most frequent words; sorting results from the quorum search based on relevancy, whereby based on the values of N and M near and exact-duplicate documents are identified in the document collection; and determining the relevancy by taking a number of hits for the quorum search in the document and dividing the number of hits by a size of the document in kilobytes of text in the document or a size in kilobytes for the entire document. | 1. A method for identifying near and exact-duplicate documents in a document collection, the method comprising: for each document in the collection performing by a computer the steps of: reading textual content from the document; filtering the textual content based on user settings; determining N most frequent words from the filtered textual content of the document to generate a first most frequent, word- 1 , to an Nth most frequent word, word-N, sorted from highest to lowest frequency; performing a quorum search using the N most frequent words from the filtered textual content in the document with a threshold M, wherein the threshold M is used to retrieve documents from the document collection having a number M of the N most frequent words; sorting results from the quorum search based on relevancy, whereby based on the values of N and M near and exact-duplicate documents are identified in the document collection; and determining the relevancy by taking a number of hits for the quorum search in the document and dividing the number of hits by a size of the document in kilobytes of text in the document or a size in kilobytes for the entire document. 3. The method of claim 1 , further comprising reading user preferences for the values of N and M, and including content filtering settings for the filtering of the textual content, wherein the content filtering settings include filtering of numbers, keyfields, noise words, and optical character recognition errors. | 0.667019 |
7,917,839 | 1 | 5 | 1. An interactivity creation and customization computer system including a hardware processor comprising: an interactivity builder including: an Interaction Model Library comprising a plurality of Interaction Models that respectively define a plurality of interactivities, each Interaction Model having: (1) a data XML component including (a) a parameter section comprised of one or more parameters, wherein at least one of said parameters contains attribute data, and (b) a description section containing story text with hyperlink references to parameters corresponding to words that act as hyperlinks, (2) an executable component receiving (a) a data path for locating the data XML component, (b) a media path for locating media assets, and (c) a mode value indicative of a play mode, a select mode or an edit mode, said executable component including a play-mode user interface programmed to a desired interactivity functionality, a select-mode user interface programmed to capture mouse pointer clicks on parts of the interactivity, an edit-mode user interface programmed to allow a user to perform customization operations, and an input processor for locating the data XML component using the data path, reading contents of the data XML component, and parsing contents of the data XML component, and (3) media assets; an interaction model selector that allows a user to select an Interaction Model from the Interaction Model Library, thereby creating an interactivity for accessing available Interaction Models; an interactivity editor for modifying the interactivity of the selected Interaction Model according to user inputs to create a modified interactivity, said interactivity editor allowing a user to select a parameter of the interactivity for modification; and an output generator for generating an output file for the modified interactivity, said output file having a format appropriate for use in an authoring application. | 1. An interactivity creation and customization computer system including a hardware processor comprising: an interactivity builder including: an Interaction Model Library comprising a plurality of Interaction Models that respectively define a plurality of interactivities, each Interaction Model having: (1) a data XML component including (a) a parameter section comprised of one or more parameters, wherein at least one of said parameters contains attribute data, and (b) a description section containing story text with hyperlink references to parameters corresponding to words that act as hyperlinks, (2) an executable component receiving (a) a data path for locating the data XML component, (b) a media path for locating media assets, and (c) a mode value indicative of a play mode, a select mode or an edit mode, said executable component including a play-mode user interface programmed to a desired interactivity functionality, a select-mode user interface programmed to capture mouse pointer clicks on parts of the interactivity, an edit-mode user interface programmed to allow a user to perform customization operations, and an input processor for locating the data XML component using the data path, reading contents of the data XML component, and parsing contents of the data XML component, and (3) media assets; an interaction model selector that allows a user to select an Interaction Model from the Interaction Model Library, thereby creating an interactivity for accessing available Interaction Models; an interactivity editor for modifying the interactivity of the selected Interaction Model according to user inputs to create a modified interactivity, said interactivity editor allowing a user to select a parameter of the interactivity for modification; and an output generator for generating an output file for the modified interactivity, said output file having a format appropriate for use in an authoring application. 5. An interactivity creation and customization computer system as claimed in claim 1 , wherein the media assets are a comprised of media files that include sound, video, graphics and other multimedia contents. | 0.610075 |
6,055,515 | 17 | 19 | 17. A computer program product, for use with a graphics display device, of a recording medium on which is recorded a program for building and maintaining of a multi-taxonomy of product categories, organize categories into hierarchies, create product and attribute descriptions and adding to said attributes comprising the steps of: providing a computer user interface display that presents said hierarchies of data in a tree presentation form of lattice structures, navigating through said tree presentation form by means of an integrated multi-navigation path browsing system, building and maintaining a multi-inheritance taxonomy by the means of said integrated multi-navigation path browsing system, and employing at least one indicator means for allowing a user to find information in said multi-taxonomy, without requiring expansion of said tree, said indicator means indicating categories beyond the immediate window wherein said products would be located. | 17. A computer program product, for use with a graphics display device, of a recording medium on which is recorded a program for building and maintaining of a multi-taxonomy of product categories, organize categories into hierarchies, create product and attribute descriptions and adding to said attributes comprising the steps of: providing a computer user interface display that presents said hierarchies of data in a tree presentation form of lattice structures, navigating through said tree presentation form by means of an integrated multi-navigation path browsing system, building and maintaining a multi-inheritance taxonomy by the means of said integrated multi-navigation path browsing system, and employing at least one indicator means for allowing a user to find information in said multi-taxonomy, without requiring expansion of said tree, said indicator means indicating categories beyond the immediate window wherein said products would be located. 19. A computer program product of claim 17 wherein, said indicator means is a square to indicate an immediate super node and the parents of the product below and an arrow to indicate that said product is also under another category. | 0.629393 |
8,271,864 | 1 | 23 | 1. A computer-readable storage medium storing a program for causing a computer to perform a method for creating an electronic representation of a position-coded product, the method comprising: accessing an electronic document file comprising layout specifications for a set of document pages; adding to the electronic document file an indication of a number of copies of the set of document pages; adding to the electronic document file at least one pattern license file including addresses corresponding to a set of pattern pages, the at least one pattern license file further including a starting page address and a license parameter identifying at least one property of the at least one pattern license file, each of the addresses in the at least one pattern license file identifying at least one pattern page included in the set of pattern pages, each of the pattern pages being a unique part of a position-coding pattern, wherein the at least one pattern license file associates the set of pattern pages with the position-coding pattern before and independent of an action of printing copies of the position-coded product; and adding to the electronic document file metadata that indicates an ordering of the pattern pages identified by the at least one pattern license file, wherein the document pages are implicitly associated, copy for copy, with the pattern pages according to the ordering. | 1. A computer-readable storage medium storing a program for causing a computer to perform a method for creating an electronic representation of a position-coded product, the method comprising: accessing an electronic document file comprising layout specifications for a set of document pages; adding to the electronic document file an indication of a number of copies of the set of document pages; adding to the electronic document file at least one pattern license file including addresses corresponding to a set of pattern pages, the at least one pattern license file further including a starting page address and a license parameter identifying at least one property of the at least one pattern license file, each of the addresses in the at least one pattern license file identifying at least one pattern page included in the set of pattern pages, each of the pattern pages being a unique part of a position-coding pattern, wherein the at least one pattern license file associates the set of pattern pages with the position-coding pattern before and independent of an action of printing copies of the position-coded product; and adding to the electronic document file metadata that indicates an ordering of the pattern pages identified by the at least one pattern license file, wherein the document pages are implicitly associated, copy for copy, with the pattern pages according to the ordering. 23. The computer-readable storage medium of claim 1 , wherein the electronic document file further comprises a parameter indicating whether a specific document page is to be associated with a pattern page. | 0.69494 |
8,509,826 | 4 | 12 | 4. In a mobile device having a graphical user interface (GUI) comprising a display and a selection device, a method comprising: rendering a user-generated text-message component on a GUI, wherein the text-message component is drafted with a text-messaging application of the mobile device by a user of a mobile device, and wherein the text-message component comprises a term in the memory of the mobile device that is used to automatically correlate the text-message component with a biosensor-data type; automatically rendering a biosensor-data icon on the GUI; automatically determining the biosensor-data type relationally linked with the user-generated text-message component, wherein the use of the biosensor-data type is automatically determined by the text-message component; retrieving a biosensor-data measurement associated with the text-message component, wherein the biosensor-data measurement is comprised of the biosensor-data type relationally linked with the user-generated text-message component, wherein the biosensor-data provides information of an attribute of an environment of a mobile device, and wherein the biosensor-data measurement is retrieved from the memory of the mobile device; and transforming the biosensor-data icon according to the biosensor data measurement. | 4. In a mobile device having a graphical user interface (GUI) comprising a display and a selection device, a method comprising: rendering a user-generated text-message component on a GUI, wherein the text-message component is drafted with a text-messaging application of the mobile device by a user of a mobile device, and wherein the text-message component comprises a term in the memory of the mobile device that is used to automatically correlate the text-message component with a biosensor-data type; automatically rendering a biosensor-data icon on the GUI; automatically determining the biosensor-data type relationally linked with the user-generated text-message component, wherein the use of the biosensor-data type is automatically determined by the text-message component; retrieving a biosensor-data measurement associated with the text-message component, wherein the biosensor-data measurement is comprised of the biosensor-data type relationally linked with the user-generated text-message component, wherein the biosensor-data provides information of an attribute of an environment of a mobile device, and wherein the biosensor-data measurement is retrieved from the memory of the mobile device; and transforming the biosensor-data icon according to the biosensor data measurement. 12. The method of claim 4 further comprising: providing a GUI widget to enable selection of a biosensor-data icon graphic. | 0.601307 |
9,274,646 | 1 | 10 | 1. An apparatus, comprising least one processor and at least one memory including computer program code, the memory and the computer program code configured to, working with the processor, cause the apparatus to perform at least the following: receive a multiple touch input comprising a first touch input having a first text position within a first word such that the first text position is a text position between a first character of the first word and a last letter of the first word, and a second touch input having a second text position such that the second text position is a text position between a first character of a second word and a last letter of the second word; determine a first text selection point positioned outside of the first word based at least in part on the first text position being within the first word, such that the first text selection point is at least one of a text position preceding a first character of the first word, or a text position following a last letter of the first word; determine a second text selection point positioned outside of the second word based at least in part on the second text position, such that the second text selection point is at least one of a text position preceding a first character of the second word, or a text position following a last letter of the second word; and select text information between the first text selection point and the second text selection point. | 1. An apparatus, comprising least one processor and at least one memory including computer program code, the memory and the computer program code configured to, working with the processor, cause the apparatus to perform at least the following: receive a multiple touch input comprising a first touch input having a first text position within a first word such that the first text position is a text position between a first character of the first word and a last letter of the first word, and a second touch input having a second text position such that the second text position is a text position between a first character of a second word and a last letter of the second word; determine a first text selection point positioned outside of the first word based at least in part on the first text position being within the first word, such that the first text selection point is at least one of a text position preceding a first character of the first word, or a text position following a last letter of the first word; determine a second text selection point positioned outside of the second word based at least in part on the second text position, such that the second text selection point is at least one of a text position preceding a first character of the second word, or a text position following a last letter of the second word; and select text information between the first text selection point and the second text selection point. 10. The apparatus of claim 1 , wherein the first text selection point is a text position associated with a beginning of a word following the first word. | 0.903797 |
9,753,945 | 9 | 10 | 9. The non-transitory tangible computer-readable storage medium of claim 8 , the code further comprising a set of instructions that causes the one or more processors to perform the following: selecting, by one or more processors, one of the plurality of interpretation candidates; obtaining, by one or more processors, search results for the geographic search query based on the selected interpretation candidate. | 9. The non-transitory tangible computer-readable storage medium of claim 8 , the code further comprising a set of instructions that causes the one or more processors to perform the following: selecting, by one or more processors, one of the plurality of interpretation candidates; obtaining, by one or more processors, search results for the geographic search query based on the selected interpretation candidate. 10. The non-transitory tangible computer-readable storage medium of claim 9 , the code further comprising a set of instructions that causes the one or more processors to perform the following: providing over a network, by one or more processors, the search results to the client computer. | 0.5 |
7,685,100 | 2 | 5 | 2. The method of claim 1 wherein the determining of whether the query is time-dependent or time-independent includes analyzing the frequency of the query at the past intervals to determine a periodicity of the query. | 2. The method of claim 1 wherein the determining of whether the query is time-dependent or time-independent includes analyzing the frequency of the query at the past intervals to determine a periodicity of the query. 5. The method of claim 2 wherein the periodicity of the query is determined using a cosine signal hidden periodicity model. | 0.5 |
8,457,610 | 11 | 18 | 11. The system of claim 10 , is further configured to obtain and store GPS coordinates, the GPS coordinates being stored at least within the draft blog entry; and generate a blogging tour map based on the GPS coordinates within the draft blog entry, the blogging tour map comprising a plurality of nodes, each node representing an automatically generated blog entry, and where each node is situated on at a location on the blogging tour mapbased on the GPS coordinates. | 11. The system of claim 10 , is further configured to obtain and store GPS coordinates, the GPS coordinates being stored at least within the draft blog entry; and generate a blogging tour map based on the GPS coordinates within the draft blog entry, the blogging tour map comprising a plurality of nodes, each node representing an automatically generated blog entry, and where each node is situated on at a location on the blogging tour mapbased on the GPS coordinates. 18. The system of claim 11 , further comprising automatically generating text for insertion into the draft blog entry in the predetermined format, and wherein some of the text is generated in dependence upon data relating to the triggering event. | 0.57732 |
8,824,799 | 1 | 11 | 1. A method of encoding an image comprising: analyzing, by a computer having one or more processors, colors and spatial features of pixels of the image to identify a text region of the image that is separate from a picture region of the image; generating, by the computer, for a portion of the text region, a mask dividing the portion into background pixels and a plurality of text pixels, wherein the background pixels are identified as pixels with a constant color, the plurality of text pixels are identified as pixels contrasting the constant color, and the plurality of text pixels comprise a plurality of colors; analyzing chrominance values of the plurality of colors to determine a text chrominance; generating, for each text pixel of the plurality of text pixels, a text pixel value to generate a plurality of text pixel values, wherein each text pixel value is based on a luminance of a text pixel for which it was generated; and transmitting an encoding of the portion comprising an encoding of each of the constant color, the mask, the text chrominance and the plurality of text pixel values. | 1. A method of encoding an image comprising: analyzing, by a computer having one or more processors, colors and spatial features of pixels of the image to identify a text region of the image that is separate from a picture region of the image; generating, by the computer, for a portion of the text region, a mask dividing the portion into background pixels and a plurality of text pixels, wherein the background pixels are identified as pixels with a constant color, the plurality of text pixels are identified as pixels contrasting the constant color, and the plurality of text pixels comprise a plurality of colors; analyzing chrominance values of the plurality of colors to determine a text chrominance; generating, for each text pixel of the plurality of text pixels, a text pixel value to generate a plurality of text pixel values, wherein each text pixel value is based on a luminance of a text pixel for which it was generated; and transmitting an encoding of the portion comprising an encoding of each of the constant color, the mask, the text chrominance and the plurality of text pixel values. 11. The method of claim 1 , further comprising converting the plurality of text pixels from a red, green and blue color space to a chrominance and luminance color space. | 0.802108 |
9,304,786 | 6 | 7 | 6. The information processing apparatus according to claim 5 , further comprising a Web browser that sends a request to access a Web page specified by a URL assigned to the shortcut button and that receives a response to the sent request, wherein the storage unit stores a title of the Web page contained in the response received by the Web browser, as a name of the shortcut button. | 6. The information processing apparatus according to claim 5 , further comprising a Web browser that sends a request to access a Web page specified by a URL assigned to the shortcut button and that receives a response to the sent request, wherein the storage unit stores a title of the Web page contained in the response received by the Web browser, as a name of the shortcut button. 7. The information processing apparatus according to claim 6 , wherein the Web browser sends language information indicating a language-type to be displayed together with the request, and receives a response containing a title of a Web page corresponding to the language information. | 0.5 |
7,996,753 | 59 | 60 | 59. A computer-implemented method for generating a graphical advertisement, the method comprising: receiving from an advertiser text and a request to generate a graphical advertisement associated with the text; suggesting, by a server, graphics and words for inclusion in the graphical advertisement based on the text including providing the suggestions to the advertiser; receiving from the advertiser and at the server a selection of at least one of the suggested graphics and words; receiving, at the server, a presentation layout indication; suggesting to the advertiser and by the server one or more keywords to associate with the graphical advertisement; receiving from the advertiser and at the server a selected keyword; associating the graphical advertisement with the selected keyword; and automatically generating by the server the graphical advertisement using the selected graphics and words and the presentation layout indication. | 59. A computer-implemented method for generating a graphical advertisement, the method comprising: receiving from an advertiser text and a request to generate a graphical advertisement associated with the text; suggesting, by a server, graphics and words for inclusion in the graphical advertisement based on the text including providing the suggestions to the advertiser; receiving from the advertiser and at the server a selection of at least one of the suggested graphics and words; receiving, at the server, a presentation layout indication; suggesting to the advertiser and by the server one or more keywords to associate with the graphical advertisement; receiving from the advertiser and at the server a selected keyword; associating the graphical advertisement with the selected keyword; and automatically generating by the server the graphical advertisement using the selected graphics and words and the presentation layout indication. 60. The method of claim 59 , wherein: the received text is received from an advertiser; the suggested graphics, words, and keyword are suggested to the advertiser; and the selected suggested graphics, words, and keyword are received from the advertiser. | 0.5 |
9,189,180 | 1 | 6 | 1. A method for using a converter peripheral to convert an electronic document for output by a multifunction peripheral comprising: receiving the electronic document in a page description language unsupported by the multifunction peripheral; determining that conversion of the electronic document by the converter peripheral is unlicensed; generating a single-use license for the converter peripheral enabling the converter peripheral to output only the electronic document; outputting, via the multifunction peripheral, a physical document including configuration data for the converter peripheral, thus consuming the single-use license; accessing configuration data in order to determine at least one page description language supported by the multifunction peripheral; accessing local license data to confirm authorization to perform a conversion; converting the electronic document into a page description language supported by the multifunction peripheral; transmitting the converted electronic document to the multifunction peripheral for output. | 1. A method for using a converter peripheral to convert an electronic document for output by a multifunction peripheral comprising: receiving the electronic document in a page description language unsupported by the multifunction peripheral; determining that conversion of the electronic document by the converter peripheral is unlicensed; generating a single-use license for the converter peripheral enabling the converter peripheral to output only the electronic document; outputting, via the multifunction peripheral, a physical document including configuration data for the converter peripheral, thus consuming the single-use license; accessing configuration data in order to determine at least one page description language supported by the multifunction peripheral; accessing local license data to confirm authorization to perform a conversion; converting the electronic document into a page description language supported by the multifunction peripheral; transmitting the converted electronic document to the multifunction peripheral for output. 6. The method of claim 1 wherein the electronic document is in a format other than printer command language XL (PCL XL) format and the converted electronic document is in printer command language XL (PCL XL) format. | 0.691977 |
9,477,771 | 7 | 14 | 7. A computer implemented method comprising: defining a plurality of token indicators, wherein each token indicator is associated with a token indicator type and comprises a special text character and/or a graphics image; for at least one of the plurality of token indicators, defining a plurality of templates, wherein each template is associated with the token indicator type and a token type; identifying an input token indicator; identifying an input token in conjunction with the input token indicator; selecting a template corresponding to the input token indicator, wherein selecting the template corresponding to the input token indicator comprises: determining a token indicator type associated with the input token indicator and a token type associated with the input token and selecting, from one of the plurality of templates, a template whose associated token type matches that of the token type of the input token; and executing a process enabled according to the input token and the selected template. | 7. A computer implemented method comprising: defining a plurality of token indicators, wherein each token indicator is associated with a token indicator type and comprises a special text character and/or a graphics image; for at least one of the plurality of token indicators, defining a plurality of templates, wherein each template is associated with the token indicator type and a token type; identifying an input token indicator; identifying an input token in conjunction with the input token indicator; selecting a template corresponding to the input token indicator, wherein selecting the template corresponding to the input token indicator comprises: determining a token indicator type associated with the input token indicator and a token type associated with the input token and selecting, from one of the plurality of templates, a template whose associated token type matches that of the token type of the input token; and executing a process enabled according to the input token and the selected template. 14. The method of claim 7 , wherein executing a process enabled according to the input token and the selected template further comprises: displaying information from a destination website of a uniform resource locator (URL) generated from the input token and the selected template. | 0.607542 |
7,908,161 | 1 | 5 | 1. A computer implemented method for a business process transformation wizard to assess by computer analysis business processes and to identify by computer analysis transformation options, comprising the steps of: on-screen prompting on a display by a business process transformation wizard running on at least one computer, of a business analyst to specify business objectives of process transformation, said business process transformation wizard displays a menu of key performance indicators (KPIs) which can be selected by the business analyst, selected KPIs affecting selection by the business process transformation wizard running on said computer of a minimal set of input parameters required to build the business process model that is amenable for analysis to predict the process KPIs; adding required parameters to a business process model by the business process transformation wizard running on said computer until the business process model is completed; determining transformation patterns based on information contained in a knowledge database storage unit accessible by the computer, wherein the information includes different business process patterns and effectiveness of different transformation patterns for different business process patterns; selecting, by said business analyst using said transformation wizard, transformation patterns for optimizing process parameters from a first set of transformation patterns, said first set of transformation patterns including “Optimizing Resource Capabilities”, “Optimizing Resource Scheduling Policies”, “Combining Roles”, Change Branching Probability”, and “Introducing IT Systems”, optimizing, by the business process transformation wizard running on said computer, process parameters using an optimization technique and said selected transformation patterns for optimizing process parameters; and selecting, by said business analyst using said transformation wizard, transformation patterns for optimizing topology of the business process from a second set of transformation patterns, said second set of transformation patterns including “Parallelize Business Process sub system”, “Permute Order of Tasks”, and “Remove Activity” and, for each selected transformation pattern from said second set of transformation patterns; optimizing, by the business process transformation wizard running on said computer, topology for the business process using a transformation technique and said selected transformation patterns for optimizing topology. | 1. A computer implemented method for a business process transformation wizard to assess by computer analysis business processes and to identify by computer analysis transformation options, comprising the steps of: on-screen prompting on a display by a business process transformation wizard running on at least one computer, of a business analyst to specify business objectives of process transformation, said business process transformation wizard displays a menu of key performance indicators (KPIs) which can be selected by the business analyst, selected KPIs affecting selection by the business process transformation wizard running on said computer of a minimal set of input parameters required to build the business process model that is amenable for analysis to predict the process KPIs; adding required parameters to a business process model by the business process transformation wizard running on said computer until the business process model is completed; determining transformation patterns based on information contained in a knowledge database storage unit accessible by the computer, wherein the information includes different business process patterns and effectiveness of different transformation patterns for different business process patterns; selecting, by said business analyst using said transformation wizard, transformation patterns for optimizing process parameters from a first set of transformation patterns, said first set of transformation patterns including “Optimizing Resource Capabilities”, “Optimizing Resource Scheduling Policies”, “Combining Roles”, Change Branching Probability”, and “Introducing IT Systems”, optimizing, by the business process transformation wizard running on said computer, process parameters using an optimization technique and said selected transformation patterns for optimizing process parameters; and selecting, by said business analyst using said transformation wizard, transformation patterns for optimizing topology of the business process from a second set of transformation patterns, said second set of transformation patterns including “Parallelize Business Process sub system”, “Permute Order of Tasks”, and “Remove Activity” and, for each selected transformation pattern from said second set of transformation patterns; optimizing, by the business process transformation wizard running on said computer, topology for the business process using a transformation technique and said selected transformation patterns for optimizing topology. 5. The computer implemented method for a business transformation wizard as recited in claim 1 further comprising the steps of: on-screen prompting on the display, by the business process transformation wizard running on said computer, of the business analyst to provide business model validation criteria; and executing a process analysis by the business process transformation wizard running on said computer to check whether results of the analysis validate the model according to criteria specified by the business analyst. | 0.554237 |
8,566,331 | 1 | 3 | 1. A computer-implemented method comprising: identifying a plurality of image search results that are responsive to a search query; determining that a relevance score for a particular image search result from the plurality of image search results meets a specified relevance score threshold, wherein the relevance score is determined independent of visual similarity between a particular image referenced by the particular image search result and other images that are referenced by the plurality of image search results; determining that image similarity data for the particular image indicates that the particular image meets a threshold level of visual similarity to at least a threshold number of the other images that are referenced by the plurality of image search results; determining that the particular image search result is a co-relevant image search result for the search query, the determination being performed in response to determining that both the relevance score meets the specified relevance score threshold, and the image similarity data for the particular image indicates that the particular image meets the threshold level of visual similarity to at least the threshold number of the other images; and generating an image rank score for the particular image search result based on the relevance score and an amplification factor for image search results that are determined to be co-relevant, wherein the amplification factor is used to increase or decrease the image rank score. | 1. A computer-implemented method comprising: identifying a plurality of image search results that are responsive to a search query; determining that a relevance score for a particular image search result from the plurality of image search results meets a specified relevance score threshold, wherein the relevance score is determined independent of visual similarity between a particular image referenced by the particular image search result and other images that are referenced by the plurality of image search results; determining that image similarity data for the particular image indicates that the particular image meets a threshold level of visual similarity to at least a threshold number of the other images that are referenced by the plurality of image search results; determining that the particular image search result is a co-relevant image search result for the search query, the determination being performed in response to determining that both the relevance score meets the specified relevance score threshold, and the image similarity data for the particular image indicates that the particular image meets the threshold level of visual similarity to at least the threshold number of the other images; and generating an image rank score for the particular image search result based on the relevance score and an amplification factor for image search results that are determined to be co-relevant, wherein the amplification factor is used to increase or decrease the image rank score. 3. The method of claim 1 , wherein the relevance score threshold is a minimum relevance score required for a search result to be eligible to be determined a co-relevant search result, and the threshold level of visual similarity is a minimum level of visual similarity required for a search result to be eligible to be determined a co-relevant search result. | 0.786905 |
7,656,861 | 9 | 16 | 9. A network processing device, comprising: a processor configured to: convert media signaling into Internet Protocol (IP) media packets; receive text signaling comprising different analog audio tones representing different alpha-numeric characters; identify the alpha-numeric characters represented by the analog audio tones and generate digital values that represent the same identified alpha-numeric characters; formatting the digital values into IP text packets absent analog signaling characteristics describing the audio tones; and sending the IP media packets and the IP text packets in interleaved manner over an IP network using the same real-time IP transport session. | 9. A network processing device, comprising: a processor configured to: convert media signaling into Internet Protocol (IP) media packets; receive text signaling comprising different analog audio tones representing different alpha-numeric characters; identify the alpha-numeric characters represented by the analog audio tones and generate digital values that represent the same identified alpha-numeric characters; formatting the digital values into IP text packets absent analog signaling characteristics describing the audio tones; and sending the IP media packets and the IP text packets in interleaved manner over an IP network using the same real-time IP transport session. 16. The network processing device according to claim 9 wherein the network processing device is a Public Switched Telephone Network (PSTN) to Internet Protocol (IP) network gateway. | 0.746499 |
8,170,195 | 7 | 8 | 7. The computer readable medium of claim 1 , further comprising: a code segment for classifying the telephonic communication occurring during a time period into at least one of a plurality of predetermined call types; a code segment for comparing computer application data associated with the time period to the at least one of the plurality of predetermined call types; a code segment for generating output data indicative of a correlation of the computer application data associated with the time period to the at least one of the plurality of predetermined call types, the output data indicating one of either a correct correlation and an incorrect correlation; and a code segment for transmitting the generated output data. | 7. The computer readable medium of claim 1 , further comprising: a code segment for classifying the telephonic communication occurring during a time period into at least one of a plurality of predetermined call types; a code segment for comparing computer application data associated with the time period to the at least one of the plurality of predetermined call types; a code segment for generating output data indicative of a correlation of the computer application data associated with the time period to the at least one of the plurality of predetermined call types, the output data indicating one of either a correct correlation and an incorrect correlation; and a code segment for transmitting the generated output data. 8. The computer readable medium of claim 7 , further comprising a code segment for storing the generated output data. | 0.5 |
7,984,071 | 7 | 12 | 7. A computer program product stored in a computer usable medium including computer usable program code when executed by a processor for applying a templated business graph to a business object, the computer program product comprising: computer usable program code for loading a selected set of hierarchical business objects based on user input, wherein the set of hierarchical business objects is created by a user using a hierarchical business object design tool; computer usable program code for presenting a plurality of templated business graphs that are unified modeling language models for a business graph to the user; computer usable program code for receiving a selection of a templated business graph that most suitably defines the set of hierarchical business objects from the plurality of templated business graphs; computer usable program code for wrapping the set of hierarchical business objects with the templated business graph such that the set of hierarchical business objects is combined with the templated business graph to define and enhance the set of hierarchical business objects with value added services to the user to form a templated business object, wherein a set of header objects in the templated business graph provide the value added services, and wherein the set of header objects is added to a top level of the set of hierarchical business objects; and computer usable program code for saving the templated business object as an Extensible Markup Language schema. | 7. A computer program product stored in a computer usable medium including computer usable program code when executed by a processor for applying a templated business graph to a business object, the computer program product comprising: computer usable program code for loading a selected set of hierarchical business objects based on user input, wherein the set of hierarchical business objects is created by a user using a hierarchical business object design tool; computer usable program code for presenting a plurality of templated business graphs that are unified modeling language models for a business graph to the user; computer usable program code for receiving a selection of a templated business graph that most suitably defines the set of hierarchical business objects from the plurality of templated business graphs; computer usable program code for wrapping the set of hierarchical business objects with the templated business graph such that the set of hierarchical business objects is combined with the templated business graph to define and enhance the set of hierarchical business objects with value added services to the user to form a templated business object, wherein a set of header objects in the templated business graph provide the value added services, and wherein the set of header objects is added to a top level of the set of hierarchical business objects; and computer usable program code for saving the templated business object as an Extensible Markup Language schema. 12. The computer program product of claim 7 , wherein the set of business objects is retrieved from storage. | 0.571429 |
6,138,086 | 1 | 9 | 1. A computer-based method of encoding language, country and character set attributes of a file, said method comprising: (a) receiving a first code indicating required attributes of language; (b) receiving a second code indicating required attributes of country; (c) receiving a third code indicating a coded graphic character set identifier; (d) mapping said first, second and third codes into a unique two-byte hexadecimal code for use in association with said file; (e) outputting said unique two-byte hexadecimal code in association with said file; and (f) thereafter, in response to receipt of said unique two-byte hexadecimal code and said file, converting said file in accordance with said unique two-byte hexadecimal code such that at least one of said required attributes of languaqe, required attributes of country, and said graphic character set is altered. | 1. A computer-based method of encoding language, country and character set attributes of a file, said method comprising: (a) receiving a first code indicating required attributes of language; (b) receiving a second code indicating required attributes of country; (c) receiving a third code indicating a coded graphic character set identifier; (d) mapping said first, second and third codes into a unique two-byte hexadecimal code for use in association with said file; (e) outputting said unique two-byte hexadecimal code in association with said file; and (f) thereafter, in response to receipt of said unique two-byte hexadecimal code and said file, converting said file in accordance with said unique two-byte hexadecimal code such that at least one of said required attributes of languaqe, required attributes of country, and said graphic character set is altered. 9. The method as set forth in claim 1, wherein one of the codes represents a territory identifier. | 0.851515 |
7,724,956 | 20 | 25 | 20. A method for identifying search terms in a document written in a source language, comprising: a processor configured to perform the following: establishing a source language lexicon, the source language lexicon including source language search terms; creating an image of each of the characters contained in the foreign source language lexicon using an image graph constructor; reducing the image of the characters to a skeleton image comprising a plurality of nodes and a plurality of connections; ordering the plurality of nodes in a first order; reordering the plurality of nodes in a second order, wherein the second order is the same for all characters having the same number of nodes connected by the same number of connections between nodes; representing the skeleton images of the characters using a Connectivity Key that is unique for a given plurality of nodes and connections between the given plurality of nodes, the unique Connectivity Key corresponding to the second order of the plurality of nodes; providing an imaged document in the source language; generating search term image graphs representing the source language search terms using the character images and generating a collection of image graphs representing the imaged document; searching the imaged document by comparing the collection of image graphs to inputted search term image graphs; and flagging imaged documents when an image graph from the collection of image graphs matches one of the selected search term image graphs. | 20. A method for identifying search terms in a document written in a source language, comprising: a processor configured to perform the following: establishing a source language lexicon, the source language lexicon including source language search terms; creating an image of each of the characters contained in the foreign source language lexicon using an image graph constructor; reducing the image of the characters to a skeleton image comprising a plurality of nodes and a plurality of connections; ordering the plurality of nodes in a first order; reordering the plurality of nodes in a second order, wherein the second order is the same for all characters having the same number of nodes connected by the same number of connections between nodes; representing the skeleton images of the characters using a Connectivity Key that is unique for a given plurality of nodes and connections between the given plurality of nodes, the unique Connectivity Key corresponding to the second order of the plurality of nodes; providing an imaged document in the source language; generating search term image graphs representing the source language search terms using the character images and generating a collection of image graphs representing the imaged document; searching the imaged document by comparing the collection of image graphs to inputted search term image graphs; and flagging imaged documents when an image graph from the collection of image graphs matches one of the selected search term image graphs. 25. The method of claim 20 , wherein the imaged document is an electronic version of a physical source language document. | 0.785461 |
9,947,039 | 1 | 9 | 1. A non-transitory computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to recognize an order item, the recognizing comprising: defining a generic order item specification comprising a dynamic parameter property; receiving an order comprising a plurality of order items, a first of the order items comprising a key and one or more arbitrary parameters, each arbitrary parameter comprising a parameter value; extracting the key from the first order item; identifying a conceptual model based on the extracted key; recognizing one or more structured parameters that correspond to the one or more arbitrary parameters of the first order item based on the conceptual model; and generating a dynamic data structure comprising the recognized one or more structured parameters by dynamically binding the one or more parameter values from the arbitrary parameters to the dynamic parameter property. | 1. A non-transitory computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to recognize an order item, the recognizing comprising: defining a generic order item specification comprising a dynamic parameter property; receiving an order comprising a plurality of order items, a first of the order items comprising a key and one or more arbitrary parameters, each arbitrary parameter comprising a parameter value; extracting the key from the first order item; identifying a conceptual model based on the extracted key; recognizing one or more structured parameters that correspond to the one or more arbitrary parameters of the first order item based on the conceptual model; and generating a dynamic data structure comprising the recognized one or more structured parameters by dynamically binding the one or more parameter values from the arbitrary parameters to the dynamic parameter property. 9. The computer-readable medium of claim 1 , wherein the arbitrary parameters comprise at least one of: one or more unstructured parameters; or one or more structured parameters. | 0.784504 |
8,775,156 | 5 | 6 | 5. The method of claim 1 , further comprising: receiving language options on the mobile device; and outputting one or more selections from among the language options; wherein at least one of the initial language and the target language are based on the one or more selections. | 5. The method of claim 1 , further comprising: receiving language options on the mobile device; and outputting one or more selections from among the language options; wherein at least one of the initial language and the target language are based on the one or more selections. 6. The method of claim 5 , wherein outputting is performed via a voice command. | 0.5 |
7,657,432 | 2 | 3 | 2. The method according to claim 1 , wherein, for each frame and each level of phonetic detail, the likelihood value is a maximum likelihood value. | 2. The method according to claim 1 , wherein, for each frame and each level of phonetic detail, the likelihood value is a maximum likelihood value. 3. The method according to claim 2 , wherein said resolving the at least one likelihood value comprises averaging the at least one likelihood value. | 0.5 |
7,921,416 | 1 | 7 | 1. A method, comprising: accepting as input a program written in a formal language, wherein the input program comprises a plurality of operators that enable a declarative co-grouping of one or more tables, each with an alignment function, and a specification of zero or more procedural operations to be performed on each resulting co-group; co-grouping one or more tables referenced in the program into one or more co-groups according to one or more operators of the formal language used in the program; determining zero or more user-specified operations to be performed on each co-group according to the one or more operators of the formal language used in the program; and a translator corresponding to the formal language program translating the program into one or more jobs according to the one or more operators of the formal language used in the program and based on the one or more co-groups and the zero or more operations to be performed on each co-group, wherein each job comprises one or more structured calls to an application programming interface for encoded logic that is operable to generate a plurality of tasks for the parallel processing of the job on one or more data processing devices in a distributed system. | 1. A method, comprising: accepting as input a program written in a formal language, wherein the input program comprises a plurality of operators that enable a declarative co-grouping of one or more tables, each with an alignment function, and a specification of zero or more procedural operations to be performed on each resulting co-group; co-grouping one or more tables referenced in the program into one or more co-groups according to one or more operators of the formal language used in the program; determining zero or more user-specified operations to be performed on each co-group according to the one or more operators of the formal language used in the program; and a translator corresponding to the formal language program translating the program into one or more jobs according to the one or more operators of the formal language used in the program and based on the one or more co-groups and the zero or more operations to be performed on each co-group, wherein each job comprises one or more structured calls to an application programming interface for encoded logic that is operable to generate a plurality of tasks for the parallel processing of the job on one or more data processing devices in a distributed system. 7. The method of claim 1 , wherein the number of structured calls is minimized through query optimization. | 0.737624 |
9,721,551 | 1 | 4 | 1. An automated music composition and generation system for automatically composing and generating digital pieces of music using an automated music composition and generation engine controlled by emotion/style-indexed music-theoretic system operating parameters (SOP) produced for each digital piece of music being composed and generated in response to a set of emotion-type and style-type musical experience descriptors and time and/or space parameters supplied by a system user during an automated music composition and generation process, said automated music composition and generation system comprising: a system user interface for enabling system users to (i) create a project for a digital piece of music to be composed and generated, and (ii) review and select one or more emotion-type musical experience descriptors, one or more style-type musical experience descriptors, as well as time and/or space parameters; and an automated music composition and generation engine, operably connected to said system user interface, for receiving said emotion-type and style-type musical experience descriptors and time and/or space parameters selected by the system user at said system user interface; wherein said automated music composition and generation engine includes a plurality of function-specific subsystems cooperating together to automatically compose and generate one or more digital pieces of music in response to said emotion-type and style-type musical experience descriptors and time and/or space parameters selected by the system user at said system user interface; wherein each said digital piece of music to be composed and generated has a rhythmic landscape and a pitch landscape and contains a set of musical notes arranged and performed using an orchestration of one or more musical instruments selected for the digital piece of music; wherein said digital piece of music has musical elements including (i) structure, form and phrase, (ii) tempo, meter and length, and (iii) key and tonality; wherein said plurality of function-specific subsystems include a rhythmic landscape subsystem, a pitch landscape subsystem, and a controller code creation subsystem; wherein each said function-specific subsystem supports and employs emotion/style-indexed music-theoretic system operating parameter tables for performing specific music theoretic operations during said automated music composition and generation process; a parameter transformation subsystem for receiving said emotion-type and style-type musical experience descriptors and time and/or space parameters from said system user interface, and processing and transforming said emotion-type and style-type musical experience descriptors and time and/or space parameters and producing emotion/style-indexed music-theoretic system operating parameters for use by said function-specific subsystems employing emotion/style-indexed music-theoretic system operating parameter tables during said automated music composition and generation process; a parameter storage subsystem for persistent storage and archiving of system user accounts and music composition projects, and all emotion/style-indexed music-theoretic system operating parameters generated by said parameter transformation subsystem for said music composition projects created by system users; a parameter handling and processing subsystem operably connected to said parameter storage subsystem and said parameter transformation subsystem for (i) receiving emotion/style-specific music-theoretic system operating parameters produced by said parameter transformation subsystem, and (ii) loading said emotion/style-indexed music-theoretic system operating parameters within said function-specific subsystems employing said emotion/style-indexed musical-theoretic system operating parameter tables; wherein said rhythmic landscape subsystem is configured to generate and manage the rhythmic landscape of the digital piece of music being composed, including the arrangement in time of all events in the digital piece of music being composed, and organizable at a high level by the tempo, meter, and length of the digital piece of music, at a middle level by the structure, form, and phrase of the digital piece of music, and at a low level by a specific organization of events of each musical instrument and/or other components of the digital piece of music being composed; wherein said pitch landscape subsystem is configured to generate and manage the pitch landscape of the digital piece of music being composed, including the arrangement in space of all events in the digital piece of music being composed, and organizable at a high level by the key and tonality of the digital piece of the music, at a middle level by the structure, form, and phrase of the digital piece of music, and at a low level by a specific organization of events of each musical instrument and/or other components of the digital piece of music being composed; wherein said controller code creation subsystem is configured to create controller code to control the expression of the musical notes, rhythms, and musical instruments orchestrated in said digital piece of music being composed; a digital piece creation subsystem for creating the digital piece of music, employing one or more automated virtual-instrument music synthesis techniques; wherein during said automated music composition and generation process, said function-specific subsystems are controlled by the emotion/style-indexed music-theoretic system operating parameters loaded within said emotion/style-indexed music-theoretic system operating parameters (SOP) tables supported within said function-specific subsystems, while the digital piece of music composed and generated has the emotional and stylistic characteristics expressed throughout the rhythmic and pitch landscapes of the digital piece of music as represented by said set of emotion-type and style-type musical experience descriptors and time and/or space parameters supplied by said system user; and a music editability subsystem, interfaced with said system user interface, allowing system users to edit and modify generated digital pieces of music by (i) using said system user interface to edit the set of emotion-type and style-type musical experience descriptors and time and/or space parameters stored in said parameter storage subsystem, (ii) using said parameter transformation subsystem to transform said edited set of emotion-type and style-type musical experience descriptors and time and/or space parameters into a new set of emotion/style-indexed music-theoretic system operating parameters (SOP) for storage in said parameter storage subsystem and loading within said function-specific subsystems by said parameter handling and processing subsystem, and (iii) using said automated music composition and generation engine to generate a new digital piece of music using said new set of emotion/style-indexed music-theoretic system operating parameters. | 1. An automated music composition and generation system for automatically composing and generating digital pieces of music using an automated music composition and generation engine controlled by emotion/style-indexed music-theoretic system operating parameters (SOP) produced for each digital piece of music being composed and generated in response to a set of emotion-type and style-type musical experience descriptors and time and/or space parameters supplied by a system user during an automated music composition and generation process, said automated music composition and generation system comprising: a system user interface for enabling system users to (i) create a project for a digital piece of music to be composed and generated, and (ii) review and select one or more emotion-type musical experience descriptors, one or more style-type musical experience descriptors, as well as time and/or space parameters; and an automated music composition and generation engine, operably connected to said system user interface, for receiving said emotion-type and style-type musical experience descriptors and time and/or space parameters selected by the system user at said system user interface; wherein said automated music composition and generation engine includes a plurality of function-specific subsystems cooperating together to automatically compose and generate one or more digital pieces of music in response to said emotion-type and style-type musical experience descriptors and time and/or space parameters selected by the system user at said system user interface; wherein each said digital piece of music to be composed and generated has a rhythmic landscape and a pitch landscape and contains a set of musical notes arranged and performed using an orchestration of one or more musical instruments selected for the digital piece of music; wherein said digital piece of music has musical elements including (i) structure, form and phrase, (ii) tempo, meter and length, and (iii) key and tonality; wherein said plurality of function-specific subsystems include a rhythmic landscape subsystem, a pitch landscape subsystem, and a controller code creation subsystem; wherein each said function-specific subsystem supports and employs emotion/style-indexed music-theoretic system operating parameter tables for performing specific music theoretic operations during said automated music composition and generation process; a parameter transformation subsystem for receiving said emotion-type and style-type musical experience descriptors and time and/or space parameters from said system user interface, and processing and transforming said emotion-type and style-type musical experience descriptors and time and/or space parameters and producing emotion/style-indexed music-theoretic system operating parameters for use by said function-specific subsystems employing emotion/style-indexed music-theoretic system operating parameter tables during said automated music composition and generation process; a parameter storage subsystem for persistent storage and archiving of system user accounts and music composition projects, and all emotion/style-indexed music-theoretic system operating parameters generated by said parameter transformation subsystem for said music composition projects created by system users; a parameter handling and processing subsystem operably connected to said parameter storage subsystem and said parameter transformation subsystem for (i) receiving emotion/style-specific music-theoretic system operating parameters produced by said parameter transformation subsystem, and (ii) loading said emotion/style-indexed music-theoretic system operating parameters within said function-specific subsystems employing said emotion/style-indexed musical-theoretic system operating parameter tables; wherein said rhythmic landscape subsystem is configured to generate and manage the rhythmic landscape of the digital piece of music being composed, including the arrangement in time of all events in the digital piece of music being composed, and organizable at a high level by the tempo, meter, and length of the digital piece of music, at a middle level by the structure, form, and phrase of the digital piece of music, and at a low level by a specific organization of events of each musical instrument and/or other components of the digital piece of music being composed; wherein said pitch landscape subsystem is configured to generate and manage the pitch landscape of the digital piece of music being composed, including the arrangement in space of all events in the digital piece of music being composed, and organizable at a high level by the key and tonality of the digital piece of the music, at a middle level by the structure, form, and phrase of the digital piece of music, and at a low level by a specific organization of events of each musical instrument and/or other components of the digital piece of music being composed; wherein said controller code creation subsystem is configured to create controller code to control the expression of the musical notes, rhythms, and musical instruments orchestrated in said digital piece of music being composed; a digital piece creation subsystem for creating the digital piece of music, employing one or more automated virtual-instrument music synthesis techniques; wherein during said automated music composition and generation process, said function-specific subsystems are controlled by the emotion/style-indexed music-theoretic system operating parameters loaded within said emotion/style-indexed music-theoretic system operating parameters (SOP) tables supported within said function-specific subsystems, while the digital piece of music composed and generated has the emotional and stylistic characteristics expressed throughout the rhythmic and pitch landscapes of the digital piece of music as represented by said set of emotion-type and style-type musical experience descriptors and time and/or space parameters supplied by said system user; and a music editability subsystem, interfaced with said system user interface, allowing system users to edit and modify generated digital pieces of music by (i) using said system user interface to edit the set of emotion-type and style-type musical experience descriptors and time and/or space parameters stored in said parameter storage subsystem, (ii) using said parameter transformation subsystem to transform said edited set of emotion-type and style-type musical experience descriptors and time and/or space parameters into a new set of emotion/style-indexed music-theoretic system operating parameters (SOP) for storage in said parameter storage subsystem and loading within said function-specific subsystems by said parameter handling and processing subsystem, and (iii) using said automated music composition and generation engine to generate a new digital piece of music using said new set of emotion/style-indexed music-theoretic system operating parameters. 4. The automated music composition and generation system of claim 1 , wherein said rhythmic landscape subsystem comprises a general rhythm generation subsystem for generating a general rhythm for the piece of music being composed, and a melody rhythm generation subsystem for generating a melody rhythm for the piece of music being composed; and wherein said pitch landscape subsystem comprises a general pitch generation subsystem for generating chords for the piece of music being composed, and a melody pitch generation subsystem for generating a melody pitch for the piece of music being composed. | 0.60093 |
7,487,095 | 85 | 86 | 85. The method of claim 84 in which the selected responses are delivered to the users while preventing the users from knowing that the responses were selected by the human agent. | 85. The method of claim 84 in which the selected responses are delivered to the users while preventing the users from knowing that the responses were selected by the human agent. 86. The method of claim 85 also including enabling an administrator to review the inferred information prior to including it in the body of state-transition-state or stimulus-response information. | 0.5 |
7,552,046 | 1 | 3 | 1. A computer-implemented method for determining whether to apply a given paraphrase alternation pattern to an input string, the method comprising: generating a context model based on a data set from which the given paraphrase alternation pattern was derived, the data set being database of news articles; utilizing a computer processor that is a functional component of the computer to apply the context model to determine whether the given paraphrase alternation pattern can be applied to the input string so as to preserve meaning; if it is determined that the given paraphrase alternation pattern can be applied so as to preserve meaning, then applying the given paraphrase alternation pattern to the input string, wherein the given paraphrase alternation pattern indicates a pattern of transformation from a first set of words to a second set of words, and wherein applying the given paraphrase alternation pattern comprises transitioning the input string from the first set of words to the second set of words, and wherein applying the given paraphrase alternation pattern further comprises applying the given paraphrase alternation pattern to the input string in a plurality of different ways to produce a plurality of different textual variations, and then applying the language model to the plurality of different textual variations to determine a probable sequence of words. | 1. A computer-implemented method for determining whether to apply a given paraphrase alternation pattern to an input string, the method comprising: generating a context model based on a data set from which the given paraphrase alternation pattern was derived, the data set being database of news articles; utilizing a computer processor that is a functional component of the computer to apply the context model to determine whether the given paraphrase alternation pattern can be applied to the input string so as to preserve meaning; if it is determined that the given paraphrase alternation pattern can be applied so as to preserve meaning, then applying the given paraphrase alternation pattern to the input string, wherein the given paraphrase alternation pattern indicates a pattern of transformation from a first set of words to a second set of words, and wherein applying the given paraphrase alternation pattern comprises transitioning the input string from the first set of words to the second set of words, and wherein applying the given paraphrase alternation pattern further comprises applying the given paraphrase alternation pattern to the input string in a plurality of different ways to produce a plurality of different textual variations, and then applying the language model to the plurality of different textual variations to determine a probable sequence of words. 3. The method of claim 1 , wherein generating a context model based on a data set from which the given paraphrase alternation pattern was derived comprises generating a context model based on data including aligned sets of phrases containing at least one meaning-preserving alternation. | 0.5 |
8,799,210 | 20 | 34 | 20. A method suitable for use in transition of one or more applications of an organization, the one or more applications being transitioned from a first set of users to a second set of users, the method comprising: a. generating one or more transition plans for the one or more applications, the one or more transition plans being generated based on information corresponding to the one or more applications, the one or more transition plans comprising one or more transition activities; b. capturing a plurality of knowledge elements corresponding to the one or more applications and the one or more transition activities, wherein the plurality of knowledge elements are captured using one or more knowledge capturing tools and one or more predefined knowledge reference components, and wherein the plurality of knowledge elements comprise a set of source code, a use case, and an incident resolution; c. associating each of the plurality of knowledge elements corresponding to a particular application with one or more other elements corresponding to said application, wherein the association between the plurality of knowledge elements is established by the first set of users and the second set of users; d. enabling the first set of users to assess and validate the knowledge of the plurality of knowledge elements and the association between the plurality of knowledge elements, wherein the validation is performed based on a predefined set of rules; and e. providing collaboration between the first set of users and the second set of users, wherein the collaboration enables communication between the first set of users and the second set of users during the transition of the one or more applications. | 20. A method suitable for use in transition of one or more applications of an organization, the one or more applications being transitioned from a first set of users to a second set of users, the method comprising: a. generating one or more transition plans for the one or more applications, the one or more transition plans being generated based on information corresponding to the one or more applications, the one or more transition plans comprising one or more transition activities; b. capturing a plurality of knowledge elements corresponding to the one or more applications and the one or more transition activities, wherein the plurality of knowledge elements are captured using one or more knowledge capturing tools and one or more predefined knowledge reference components, and wherein the plurality of knowledge elements comprise a set of source code, a use case, and an incident resolution; c. associating each of the plurality of knowledge elements corresponding to a particular application with one or more other elements corresponding to said application, wherein the association between the plurality of knowledge elements is established by the first set of users and the second set of users; d. enabling the first set of users to assess and validate the knowledge of the plurality of knowledge elements and the association between the plurality of knowledge elements, wherein the validation is performed based on a predefined set of rules; and e. providing collaboration between the first set of users and the second set of users, wherein the collaboration enables communication between the first set of users and the second set of users during the transition of the one or more applications. 34. The method of claim 20 further comprising determining: i) a support effectiveness metric representing a capability measurement of at least one individual within the second set of users to be entirely responsible for support and maintenance of an application being transitioned; and ii) a knowledge quotient metric representing a measurement of collective knowledge of the second set of users with respect to all aspects of the application being transitioned. | 0.511628 |
9,811,765 | 6 | 7 | 6. The method of claim 1 , wherein supplying the collection of keywords comprises providing keywords to a recurrent neural network (RNN) designed to implement language modeling and sentence construction techniques for generating a caption for the target image. | 6. The method of claim 1 , wherein supplying the collection of keywords comprises providing keywords to a recurrent neural network (RNN) designed to implement language modeling and sentence construction techniques for generating a caption for the target image. 7. The method of claim 6 , wherein the RNN iteratively predicts a sequence of words to combine as the caption for the target image based upon probability distributions computed in accordance with weight factors in multiple iterations. | 0.5 |
8,458,208 | 1 | 3 | 1. A method, comprising: receiving a database query comprising a logical database table identifier, a data element, and at least one data source assurance indicator at a distributed database device within a distributed network of databases, where the at least one data source assurance indicator comprises a request to encrypt the data element received in the received query for authentication of distributed database devices that process the database query; encrypting the data element received in the received query based upon the at least one data source assurance indicator; forming a data portion of a local query response to the database query comprising data retrieved from a local physical database table mapped by a local logical database table that matches the received logical database table identifier; adding a distributed database device node identifier and the encrypted data element as an authentication portion of the local query response to authenticate the data portion of the local query response; and responding to the database query with at least the authenticated local query response. | 1. A method, comprising: receiving a database query comprising a logical database table identifier, a data element, and at least one data source assurance indicator at a distributed database device within a distributed network of databases, where the at least one data source assurance indicator comprises a request to encrypt the data element received in the received query for authentication of distributed database devices that process the database query; encrypting the data element received in the received query based upon the at least one data source assurance indicator; forming a data portion of a local query response to the database query comprising data retrieved from a local physical database table mapped by a local logical database table that matches the received logical database table identifier; adding a distributed database device node identifier and the encrypted data element as an authentication portion of the local query response to authenticate the data portion of the local query response; and responding to the database query with at least the authenticated local query response. 3. The method of claim 1 , where the at least one data source assurance indicator comprises an instruction to encrypt a selected data column of the data portion of the authenticated local query response. | 0.878005 |
8,145,632 | 2 | 12 | 2. A computer-implemented method, comprising: at a computer having memory, a display, and a processor, identifying multiple resource identifiers in accordance with a first set of predefined criteria for selecting a respective document that satisfies user-specified search keywords, each resource identifier corresponding to a document at a respective data source; and for at least one of the resource identifiers, retrieving the corresponding document from the respective document source; identifying within the retrieved document a chunk by applying a second set of predefined criteria to the retrieved document; and displaying the identified chunk and a link to the identified chunk within the document to the user, wherein the first set of predefined criteria requires that all the search keywords be found within an identified respective document, and the second set of predefined criteria requires that all the search keywords be found within an identified chunk. | 2. A computer-implemented method, comprising: at a computer having memory, a display, and a processor, identifying multiple resource identifiers in accordance with a first set of predefined criteria for selecting a respective document that satisfies user-specified search keywords, each resource identifier corresponding to a document at a respective data source; and for at least one of the resource identifiers, retrieving the corresponding document from the respective document source; identifying within the retrieved document a chunk by applying a second set of predefined criteria to the retrieved document; and displaying the identified chunk and a link to the identified chunk within the document to the user, wherein the first set of predefined criteria requires that all the search keywords be found within an identified respective document, and the second set of predefined criteria requires that all the search keywords be found within an identified chunk. 12. The method of claim 2 , further comprising: for at least one of the resource identifiers, retrieving the corresponding document from the respective document source; identifying within the retrieved document no chunk that satisfies each of the search keywords; and displaying a link to search for chunks that satisfy any of the search keywords within the document. | 0.6409 |
9,691,169 | 4 | 5 | 4. The computing device implemented method of claim 1 , wherein in response to the operations being executed to present the glyph on the display, identifying points of an outline of the glyph from data stored with the glyph in the font. | 4. The computing device implemented method of claim 1 , wherein in response to the operations being executed to present the glyph on the display, identifying points of an outline of the glyph from data stored with the glyph in the font. 5. The computing device implemented method of claim 4 , wherein in response to the operations being executed to present the glyph on the display, identifying one or more adjustments to the identified points of the outline of the glyph. | 0.5 |
8,315,874 | 7 | 9 | 7. The method of claim 1 , wherein the providing a plurality of nodes comprises providing at least one action node defining an action to be performed. | 7. The method of claim 1 , wherein the providing a plurality of nodes comprises providing at least one action node defining an action to be performed. 9. The method of claim 7 , wherein the action node comprises a node associated with a transaction. | 0.542056 |
9,917,751 | 16 | 17 | 16. The system of claim 13 , further configured to use predetermined command parameters to create process rules that identify host-specific processes. | 16. The system of claim 13 , further configured to use predetermined command parameters to create process rules that identify host-specific processes. 17. The system of claim 16 , wherein the predetermined command parameters include at least one of: interpreter; script name; program name; service port; and options. | 0.5 |
8,347,205 | 13 | 16 | 13. A non-transitory computer readable storage medium comprising software encoded in one or more tangible media for execution by the one or more processors and when executed operable to: generate a template for one or more pages, the template including one or more address sable blocks; receive base content, wherein the base content is content that remains the same for different versions of the publication; generate at least one structured document for the publication, each structured document including one or more entry fields corresponding to the one or more addressable blocks, wherein each structured document includes or refers to version information in the one or more entry fields, and wherein the version information is content that is different for different versions of the publication; receive a structured document from each of two or more entities; generate a design application version of the structured document from each of the two or more entities, the design application version compatible with a design application; automatically generate a plurality of versions of the publication using the design application, wherein the generating of the plurality of versions of the publication is performed after the merging the plurality of structured documents into from the two or more entities a master structured document, wherein each version of the publication is generated using the template, the base content, and version information included in or referred to in at least one structured document received from the two more of the entities, the version information inserted based on the one or more addressable blocks in a page of the version based on the one or more codes associated with the one or more entry fields; display the plurality of versions of the publication on one page, wherein the page includes a plurality of sections, wherein the sections include the same base content, wherein each section is associated with a different version, wherein each version is associated with a different entity of the two or more entities, and wherein each section includes different version information that corresponds to a different entity, and wherein after all pages of the publication have been generated, the pages are changeable if needed; and after generating a structured document that includes a first page of the publication with multiple versions: determine if a second page of the publication is to include one or more versions; generate a template for the second page; and add version information for the template for the second page to one of a structured document that is already created or a new structured document that is generated for the template for the second page. | 13. A non-transitory computer readable storage medium comprising software encoded in one or more tangible media for execution by the one or more processors and when executed operable to: generate a template for one or more pages, the template including one or more address sable blocks; receive base content, wherein the base content is content that remains the same for different versions of the publication; generate at least one structured document for the publication, each structured document including one or more entry fields corresponding to the one or more addressable blocks, wherein each structured document includes or refers to version information in the one or more entry fields, and wherein the version information is content that is different for different versions of the publication; receive a structured document from each of two or more entities; generate a design application version of the structured document from each of the two or more entities, the design application version compatible with a design application; automatically generate a plurality of versions of the publication using the design application, wherein the generating of the plurality of versions of the publication is performed after the merging the plurality of structured documents into from the two or more entities a master structured document, wherein each version of the publication is generated using the template, the base content, and version information included in or referred to in at least one structured document received from the two more of the entities, the version information inserted based on the one or more addressable blocks in a page of the version based on the one or more codes associated with the one or more entry fields; display the plurality of versions of the publication on one page, wherein the page includes a plurality of sections, wherein the sections include the same base content, wherein each section is associated with a different version, wherein each version is associated with a different entity of the two or more entities, and wherein each section includes different version information that corresponds to a different entity, and wherein after all pages of the publication have been generated, the pages are changeable if needed; and after generating a structured document that includes a first page of the publication with multiple versions: determine if a second page of the publication is to include one or more versions; generate a template for the second page; and add version information for the template for the second page to one of a structured document that is already created or a new structured document that is generated for the template for the second page. 16. The computer readable storage medium of claim 13 , wherein a plurality of pages are created for a plurality of versions using the template and different structured documents. | 0.789598 |
8,738,470 | 18 | 22 | 18. A configured computer system comprising: one or more processors; a categorizer component that is configured to, when executed by at least one of the one or more processors, determine one or more first categories for a user-defined group of multiple items, the user-defined group being defined by a user that is one of multiple customers of an item ordering service that makes the multiple items available to the multiple customers, at least one of the multiple items being associated with one or more second categories that are not included in the one or more determined first categories; a viewer component that is configured to, when executed by at least one of the one or more processors, provide information for display to the user identifying the user-defined group of multiple items as a single item to be ordered, wherein the information, when displayed, indicates an action that is to be performed to order the user-defined group of multiple items from the item ordering service as the single item; and an item ordering component that is configured to, when executed by at least one of the one or more processors, and after performance by the user of the indicated action, initiate an order for the user-defined group of multiple items for the user. | 18. A configured computer system comprising: one or more processors; a categorizer component that is configured to, when executed by at least one of the one or more processors, determine one or more first categories for a user-defined group of multiple items, the user-defined group being defined by a user that is one of multiple customers of an item ordering service that makes the multiple items available to the multiple customers, at least one of the multiple items being associated with one or more second categories that are not included in the one or more determined first categories; a viewer component that is configured to, when executed by at least one of the one or more processors, provide information for display to the user identifying the user-defined group of multiple items as a single item to be ordered, wherein the information, when displayed, indicates an action that is to be performed to order the user-defined group of multiple items from the item ordering service as the single item; and an item ordering component that is configured to, when executed by at least one of the one or more processors, and after performance by the user of the indicated action, initiate an order for the user-defined group of multiple items for the user. 22. The computer system of claim 18 wherein the user-defined group includes an item representing a product to be supplied and an item representing a service to be provided, and includes items that are different types of products. | 0.804608 |
8,943,016 | 1 | 7 | 1. A computer-implemented method for generating at least one concept tree comprising a plurality of concepts and concept relationships, said method comprising: obtaining, either directly or indirectly via a network, on one or more processors executing software code, input information from a cognitive agent providing a basis for an active concept; applying, based on the received input information, a semantic processing protocol to a domain of information comprising a data source from which at least one of the plurality of concepts derivable; generating, from the application of the semantic protocol, from an extraction of concepts from documents, and/or from some combination thereof, the at least one concept tree that includes the plurality of concepts and concept relationships; wherein at least one of the plurality of concepts has been analyzed for a level of coherence with the active concept; wherein the cognitive agent includes at least one of a human user, a computer program receiving an input directly or indirectly from a human user, and/or some combination thereof; and wherein the semantic protocol comprises at least one of concept analysis, data analysis, faceted classification synthesis, semantic reasoners, and/or some combination thereof. | 1. A computer-implemented method for generating at least one concept tree comprising a plurality of concepts and concept relationships, said method comprising: obtaining, either directly or indirectly via a network, on one or more processors executing software code, input information from a cognitive agent providing a basis for an active concept; applying, based on the received input information, a semantic processing protocol to a domain of information comprising a data source from which at least one of the plurality of concepts derivable; generating, from the application of the semantic protocol, from an extraction of concepts from documents, and/or from some combination thereof, the at least one concept tree that includes the plurality of concepts and concept relationships; wherein at least one of the plurality of concepts has been analyzed for a level of coherence with the active concept; wherein the cognitive agent includes at least one of a human user, a computer program receiving an input directly or indirectly from a human user, and/or some combination thereof; and wherein the semantic protocol comprises at least one of concept analysis, data analysis, faceted classification synthesis, semantic reasoners, and/or some combination thereof. 7. The method of claim 1 , wherein the data source included in the domain of information is a natural language data source. | 0.725446 |
9,767,504 | 7 | 8 | 7. The method of claim 1 , further comprising providing a price for the suggested product. | 7. The method of claim 1 , further comprising providing a price for the suggested product. 8. The method of claim 7 in which user selection of the suggested product initiates a process in which a user purchases the suggested product. | 0.668224 |
8,788,926 | 1 | 6 | 1. A computer-implemented method for processing a document for printing, the method comprising: receiving a representation of the document, the representation of the document specifying at least a first visual content item and a second visual content item of the document; selecting a portion of the representation of the document, the selected portion specifying, at least in part, the first visual content item; determining, by a processor, a characteristic of the selected portion; assigning a score to the selected portion, based on the determined characteristic; receiving user input selecting one of a plurality of ranges of score values, each of the plurality of ranges of score values corresponding to an amount of content from the document to be printed; determining whether the score is within the selected range of score values; when the score is within the selected range, generating by the processor a filtered version of the document that includes the first visual content item, the filtered version of the document omitting the second visual content item; and sending the filtered version of the document to a printer for printing; wherein the first visual content item and the second visual content item include one or more of text or graphics. | 1. A computer-implemented method for processing a document for printing, the method comprising: receiving a representation of the document, the representation of the document specifying at least a first visual content item and a second visual content item of the document; selecting a portion of the representation of the document, the selected portion specifying, at least in part, the first visual content item; determining, by a processor, a characteristic of the selected portion; assigning a score to the selected portion, based on the determined characteristic; receiving user input selecting one of a plurality of ranges of score values, each of the plurality of ranges of score values corresponding to an amount of content from the document to be printed; determining whether the score is within the selected range of score values; when the score is within the selected range, generating by the processor a filtered version of the document that includes the first visual content item, the filtered version of the document omitting the second visual content item; and sending the filtered version of the document to a printer for printing; wherein the first visual content item and the second visual content item include one or more of text or graphics. 6. The computer-implemented method of claim 1 , wherein the score is assigned based on a value of a markup language attribute that is part of the selected portion of the representation of the document. | 0.718487 |
8,458,193 | 7 | 8 | 7. The method of claim 1 , further comprising: repeating the steps of receiving topic information and receiving user activity information for a plurality of documents; receiving identification of a selection of a subset of the plurality of documents; generating and storing topic intensity for the subset of documents; monitoring the topic intensity over time; and generating an alert based on the topic intensity. | 7. The method of claim 1 , further comprising: repeating the steps of receiving topic information and receiving user activity information for a plurality of documents; receiving identification of a selection of a subset of the plurality of documents; generating and storing topic intensity for the subset of documents; monitoring the topic intensity over time; and generating an alert based on the topic intensity. 8. The method of claim 7 , wherein the selection of the subset of documents is generated in response to user input. | 0.839833 |
9,824,082 | 8 | 9 | 8. A computer program product comprising a non-transitory computer-readable medium storing computer-readable program code to be executed by one or more processors when retrieved from the non-transitory computer-readable medium, the program code including instructions configurable to cause: processing a request from a first user of a social networking system to share a file with at least a first one of a plurality of groups of users of the social networking system, selection of the first group being controllable by the first user; sharing, responsive to processing the request, the file with the first group, the sharing of the file causing the file to be editable by one or more of the users who are members of the first group; displaying, in a user interface on a display of a device of a second user of the social network system, a first feed, the second user being a member of the first group, the first feed comprising a presentation of: a plurality of messages, and the file, the file being displayed in an editable format, the user interface capable of receiving user commentary from users regarding the file, the user commentary being shareable in the first feed as a message; processing an edit to the file to provide an edited version of the file, the edit submitted by the second user; updating, responsive to processing the edit, the first feed to include the edited version of the file. | 8. A computer program product comprising a non-transitory computer-readable medium storing computer-readable program code to be executed by one or more processors when retrieved from the non-transitory computer-readable medium, the program code including instructions configurable to cause: processing a request from a first user of a social networking system to share a file with at least a first one of a plurality of groups of users of the social networking system, selection of the first group being controllable by the first user; sharing, responsive to processing the request, the file with the first group, the sharing of the file causing the file to be editable by one or more of the users who are members of the first group; displaying, in a user interface on a display of a device of a second user of the social network system, a first feed, the second user being a member of the first group, the first feed comprising a presentation of: a plurality of messages, and the file, the file being displayed in an editable format, the user interface capable of receiving user commentary from users regarding the file, the user commentary being shareable in the first feed as a message; processing an edit to the file to provide an edited version of the file, the edit submitted by the second user; updating, responsive to processing the edit, the first feed to include the edited version of the file. 9. The computer program product of claim 8 , the instructions further configurable to cause: providing a selection in association with the file, the selection allowing users of the social networking system to discuss the file. | 0.734118 |
9,122,680 | 10 | 12 | 10. The information processing apparatus according to claim 1 , wherein the word is a first word, the word score is a first word score, and the processor: extracts a second word from the document; calculates a second word score for the second word on the basis of an appearance frequency of the second word in the first category; and calculates the sentence score for the sentence on the basis of the first word score and the second word score. | 10. The information processing apparatus according to claim 1 , wherein the word is a first word, the word score is a first word score, and the processor: extracts a second word from the document; calculates a second word score for the second word on the basis of an appearance frequency of the second word in the first category; and calculates the sentence score for the sentence on the basis of the first word score and the second word score. 12. The information processing apparatus according to claim 10 , wherein the processor calculates the sentence score as an average of the first word score and the second word score. | 0.584862 |
8,533,664 | 4 | 5 | 4. The method of claim 1 , wherein generating query candidates based on the applicable rule set comprises: retrieving defined templates from each rule in the applicable rule set; generating an object-addressing query for the target GUI object using a respective template; executing the object-addressing query to identify a result GUI object in the application under test; and adding the object-addressing query to the set of query candidates if the result GUI object matches the target GUI object. | 4. The method of claim 1 , wherein generating query candidates based on the applicable rule set comprises: retrieving defined templates from each rule in the applicable rule set; generating an object-addressing query for the target GUI object using a respective template; executing the object-addressing query to identify a result GUI object in the application under test; and adding the object-addressing query to the set of query candidates if the result GUI object matches the target GUI object. 5. The method of claim 4 , wherein within a respective rule the object-addressing queries are generated using the templates. | 0.5 |
7,860,872 | 1 | 3 | 1. A web-based media analysis computer system for analyzing at least one media content that includes text, comprising: i. a memory comprising at least one database being accessible to the computer system; ii. the computer system implementing an uploader that uploads said at least one media content from at least one content provider over a communication network; iii. the computer system implementing a parser that converts each of said at least one media content into serialized data, filters out unessential data from said serialized data according to a predefined list of unessential data, rationalizes nouns, pronouns and names in said each of said at least one media content, and extracts attributes and categories of said each of said at least one media content, one or more quotes, and attributes of said one or more quotes from said serialized and filtered data of said each of said at least one media content using regular expressions and predefined parsing rules, relationally stores and cross-references said serialized and filtered data, said extracted attributes and said categories of said each of said at least one media content, said one or more quotes, and said attributes of said one or more quotes into a plurality of tables in said at least one database, wherein said attributes of said one or more quotes comprise the name of the quoted person or organization; and iv. the computer system implementing an analysis module that retrieves data from said plurality of said tables in said at least one database and wherein said analysis module further comprises a toning engine that determines a tone level of said each of said at least one media, said toning engine is provided with tone level probabilities of meaningful minimum sections, tone level probabilities for attributes, and tone level probabilities for categories in said at least one database, said tone engine: a. parses each of said at least one media content and splitting into serialized meaningful minimum sections; b. retrieves, from said at least one database, said tone level probabilities for each of said serialized meaningful minimum sections that cause said each of said at least one media content to be toned at, and determines most probable tone levels of said each of said at least one media content based on said tone level probabilities of said serialized meaningful minimum sections; c. retrieves, from said at least one database, said extracted attributes of said each of said at least one media content and said tone level probabilities for each of said attributes of said each of said at least one media content, and determines most probable tone levels of said each of said at least one media content based on said tone level probabilities of said attributes; d. retrieves, from said at least one database, said extracted categories of said each of said at least one media content and said tone level probabilities for each of said categories of said each of said at least one media content, and determines most probable tone levels of said each of said at least one media content based on said tone level probabilities of said categories; and establishes said most probable tone level of said each of said at least one media content by weighing and ranking said most probable tone levels of said each of said at least one media content based on said tone level probabilities of said each of said serialized meaningful minimum sections, said most probable tone levels of said each of said at least one media content based on said tone level probabilities of said attributes, and said most probable tone levels of said each of said at least one media content based on said tone level probabilities of said categories; and e. generates a report in response to a request from a client browser. | 1. A web-based media analysis computer system for analyzing at least one media content that includes text, comprising: i. a memory comprising at least one database being accessible to the computer system; ii. the computer system implementing an uploader that uploads said at least one media content from at least one content provider over a communication network; iii. the computer system implementing a parser that converts each of said at least one media content into serialized data, filters out unessential data from said serialized data according to a predefined list of unessential data, rationalizes nouns, pronouns and names in said each of said at least one media content, and extracts attributes and categories of said each of said at least one media content, one or more quotes, and attributes of said one or more quotes from said serialized and filtered data of said each of said at least one media content using regular expressions and predefined parsing rules, relationally stores and cross-references said serialized and filtered data, said extracted attributes and said categories of said each of said at least one media content, said one or more quotes, and said attributes of said one or more quotes into a plurality of tables in said at least one database, wherein said attributes of said one or more quotes comprise the name of the quoted person or organization; and iv. the computer system implementing an analysis module that retrieves data from said plurality of said tables in said at least one database and wherein said analysis module further comprises a toning engine that determines a tone level of said each of said at least one media, said toning engine is provided with tone level probabilities of meaningful minimum sections, tone level probabilities for attributes, and tone level probabilities for categories in said at least one database, said tone engine: a. parses each of said at least one media content and splitting into serialized meaningful minimum sections; b. retrieves, from said at least one database, said tone level probabilities for each of said serialized meaningful minimum sections that cause said each of said at least one media content to be toned at, and determines most probable tone levels of said each of said at least one media content based on said tone level probabilities of said serialized meaningful minimum sections; c. retrieves, from said at least one database, said extracted attributes of said each of said at least one media content and said tone level probabilities for each of said attributes of said each of said at least one media content, and determines most probable tone levels of said each of said at least one media content based on said tone level probabilities of said attributes; d. retrieves, from said at least one database, said extracted categories of said each of said at least one media content and said tone level probabilities for each of said categories of said each of said at least one media content, and determines most probable tone levels of said each of said at least one media content based on said tone level probabilities of said categories; and establishes said most probable tone level of said each of said at least one media content by weighing and ranking said most probable tone levels of said each of said at least one media content based on said tone level probabilities of said each of said serialized meaningful minimum sections, said most probable tone levels of said each of said at least one media content based on said tone level probabilities of said attributes, and said most probable tone levels of said each of said at least one media content based on said tone level probabilities of said categories; and e. generates a report in response to a request from a client browser. 3. The web-based media analysis system recited in claim 1 , wherein said toning engine further weighs tones of authors of said at least one media content for establishing said most probable tone level of said each of said at least one media content, wherein said tones of said authors of said at least one media content are established by retrieving, from said at least one database, tone level probabilities for the author of said each of said at least one media content, and determining most probable tone levels of said each of said at least one media content based on said tone level probabilities of said authors. | 0.5 |
8,122,026 | 1 | 5 | 1. A method for identifying documents referring to an entity, the entity being associated with a first set of features, the method comprising: identifying a first set of documents based on a first model and the first set of features, wherein the first model includes a first set of rules specifying at least one combination of features from the first set of features that are sufficient for identifying a document referring to the entity, each document of the first set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the first model; determining a second model based on the features of the first set of documents, wherein the second model includes a second set of rules specifying at least one combination of features from the first set of documents that are sufficient for identifying a document referring to the entity; identifying a second set of documents based on the second model and the first set of features, each document of the second set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the second model; identifying a second set of features based on the second set of documents; determining if the second set of features are associated with the entity; and responsive to determining that the second set of features are associated with the entity, identifying a third set of documents based on a third model and the second set of features, the third set of documents each comprising a sufficient number of features in common with the second set of features to identify a document referring to the entity according to the third model. | 1. A method for identifying documents referring to an entity, the entity being associated with a first set of features, the method comprising: identifying a first set of documents based on a first model and the first set of features, wherein the first model includes a first set of rules specifying at least one combination of features from the first set of features that are sufficient for identifying a document referring to the entity, each document of the first set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the first model; determining a second model based on the features of the first set of documents, wherein the second model includes a second set of rules specifying at least one combination of features from the first set of documents that are sufficient for identifying a document referring to the entity; identifying a second set of documents based on the second model and the first set of features, each document of the second set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the second model; identifying a second set of features based on the second set of documents; determining if the second set of features are associated with the entity; and responsive to determining that the second set of features are associated with the entity, identifying a third set of documents based on a third model and the second set of features, the third set of documents each comprising a sufficient number of features in common with the second set of features to identify a document referring to the entity according to the third model. 5. The method of claim 1 , wherein the second set of features includes at least one feature not included in the first set of features. | 0.741313 |
7,631,343 | 14 | 16 | 14. A method for transcription of spoken words to a textual format comprising: communicatively coupling a computer aided transcription system to a remote system; transcribing by the computer aided transcription system representations of spoken words to text; communicating by the computer aided transcription system the text to the remote system; communicatively coupling a terminal to the remote system; communicating by the remote system at least a portion of the text to the terminal; ceasing communications by the remote system to the terminal after a predetermined amount of transcription has been reached; and generating a bill based on the amount of transcription. | 14. A method for transcription of spoken words to a textual format comprising: communicatively coupling a computer aided transcription system to a remote system; transcribing by the computer aided transcription system representations of spoken words to text; communicating by the computer aided transcription system the text to the remote system; communicatively coupling a terminal to the remote system; communicating by the remote system at least a portion of the text to the terminal; ceasing communications by the remote system to the terminal after a predetermined amount of transcription has been reached; and generating a bill based on the amount of transcription. 16. The method of claim 14 further comprising storing by the remote system in memory the text communicated from the computer aided transcription system. | 0.786517 |
9,515,994 | 1 | 3 | 1. A multi-user searchable encryption system, the system comprising: a key generation server configured to generate system parameters, a primary key, and a secondary key; a user terminal configured to receive the primary key, encrypt data to obtain cypher text, encrypt symmetric key to obtain encrypted symmetric key, encrypt keyword to obtain encrypted keyword, generate trapdoor using the primary key for a search keyword inputted by user, and generate a decryption parameter using the primary key; a proxy server configured to receive the cypher text, the encrypted keyword, and the encrypted symmetric key from the user terminal, and the secondary key from the key generation server, encrypt trapdoor received from the user terminal using the secondary key, perform a lookup for search results corresponding to the search keyword; and a database server configured to store the cypher text at a location address and return the location address of the cypher text to the proxy server; wherein the proxy server is further configured to maintain a table of secondary keys, re-encrypt the encrypted symmetric key and encrypted keyword using the secondary key, and maintain a table of re-encrypted symmetric keys. | 1. A multi-user searchable encryption system, the system comprising: a key generation server configured to generate system parameters, a primary key, and a secondary key; a user terminal configured to receive the primary key, encrypt data to obtain cypher text, encrypt symmetric key to obtain encrypted symmetric key, encrypt keyword to obtain encrypted keyword, generate trapdoor using the primary key for a search keyword inputted by user, and generate a decryption parameter using the primary key; a proxy server configured to receive the cypher text, the encrypted keyword, and the encrypted symmetric key from the user terminal, and the secondary key from the key generation server, encrypt trapdoor received from the user terminal using the secondary key, perform a lookup for search results corresponding to the search keyword; and a database server configured to store the cypher text at a location address and return the location address of the cypher text to the proxy server; wherein the proxy server is further configured to maintain a table of secondary keys, re-encrypt the encrypted symmetric key and encrypted keyword using the secondary key, and maintain a table of re-encrypted symmetric keys. 3. The system of claim 1 , wherein symmetric key is encrypted using primary key to obtain encrypted symmetric key. | 0.776471 |
8,838,587 | 12 | 15 | 12. A computer program product encoded on a non-transitory computer-readable medium, operable to cause a data processing apparatus to perform operations comprising: receiving a request to determine whether to assign a classification to a first query; selecting a plurality of search entities that are associated with the first query based on respective user behavior data for the first query associated with each of the search entities; determining a first measure of how many of the plurality of search entities have been assigned the classification; determining that the first measure of how many of the plurality of search entities have been assigned the classification satisfies a classification threshold; in response to determining that the first measure of how many of the plurality of search entities have been assigned the classification satisfies the classification threshold, determining a second measure of how many of a top group of search entities from the plurality of search entities have been assigned the classification, each search entity in the top group of search entities being in a subset of the plurality of search entities having highest respective measures of relevance to the query based on the user behavior data; determining that the first measure of how many of the plurality of search entities have been assigned the classification is consistent with the second measure of how many of the top group of search entities have been assigned the classification; and in response to determining that the first measure of how many of the plurality of search entities have been assigned the classification is consistent with the second measure of how many of the top group of search entities have been assigned the classification, assigning the classification to the first query. | 12. A computer program product encoded on a non-transitory computer-readable medium, operable to cause a data processing apparatus to perform operations comprising: receiving a request to determine whether to assign a classification to a first query; selecting a plurality of search entities that are associated with the first query based on respective user behavior data for the first query associated with each of the search entities; determining a first measure of how many of the plurality of search entities have been assigned the classification; determining that the first measure of how many of the plurality of search entities have been assigned the classification satisfies a classification threshold; in response to determining that the first measure of how many of the plurality of search entities have been assigned the classification satisfies the classification threshold, determining a second measure of how many of a top group of search entities from the plurality of search entities have been assigned the classification, each search entity in the top group of search entities being in a subset of the plurality of search entities having highest respective measures of relevance to the query based on the user behavior data; determining that the first measure of how many of the plurality of search entities have been assigned the classification is consistent with the second measure of how many of the top group of search entities have been assigned the classification; and in response to determining that the first measure of how many of the plurality of search entities have been assigned the classification is consistent with the second measure of how many of the top group of search entities have been assigned the classification, assigning the classification to the first query. 15. The computer program product of claim 12 , wherein the plurality of identified search entities comprises a plurality of web domains, and wherein the respective user behavior data associated with each web domain of the plurality of web domains represents user behavior relative to one or more documents in the web domain when the one or more documents were provided as search results for the first query. | 0.575157 |
8,199,150 | 1 | 12 | 1. A method for animating a display of a computer-modeled character, the method comprising: accepting one or more first signals from a content provider computer at a first location to allow a human user to specify an action for the computer-modeled character, wherein the action is specified by one or more commands in a control script, and wherein at least a portion of the commands are stored in a macro at the content provider computer, and further wherein the computer-modeled character is displayed at a second location remote from the first location; storing the macro at the second location; animating a display of the computer-modeled character according to one or more default character actions to achieve the command-specified action, wherein the default character actions are stored in a first rendering engine at the second location; accepting one or more second signals from the content provider computer to modify one or more of the default character actions; animating a display of the computer-modeled character at the second location according to the one or more modified default character actions; transmitting the macro to a third location remote from the first location and the second location; and animating a display of a second computer-modeled character according to one or more default character actions stored in a second rendering engine at the third location and based, at least in part, upon the macro. | 1. A method for animating a display of a computer-modeled character, the method comprising: accepting one or more first signals from a content provider computer at a first location to allow a human user to specify an action for the computer-modeled character, wherein the action is specified by one or more commands in a control script, and wherein at least a portion of the commands are stored in a macro at the content provider computer, and further wherein the computer-modeled character is displayed at a second location remote from the first location; storing the macro at the second location; animating a display of the computer-modeled character according to one or more default character actions to achieve the command-specified action, wherein the default character actions are stored in a first rendering engine at the second location; accepting one or more second signals from the content provider computer to modify one or more of the default character actions; animating a display of the computer-modeled character at the second location according to the one or more modified default character actions; transmitting the macro to a third location remote from the first location and the second location; and animating a display of a second computer-modeled character according to one or more default character actions stored in a second rendering engine at the third location and based, at least in part, upon the macro. 12. The method of claim 1 , further comprising animating a display of the computer-modeled character at one or more fourth locations remote from the first, second, and third locations simultaneous with or at least approximately simultaneous with animating the display of the computer-modeled character at the second and third locations. | 0.505882 |
8,145,654 | 1 | 3 | 1. A computer-implemented method for keyword searching, the method comprising: generating, by a server, tokens for a plurality of keywords in a document collection, wherein the generating further comprises determining a keyword position of a keyword in a document of the document collection, and determining a number of noisy keywords preceding the keyword in the document; merging the tokens to create an index; receiving a search query, wherein the search query includes at least one search phrase; receiving, for the at least one search phrase, an indication from a user specifying to perform one of a noisy phrase search or a noiseless phrase search; searching the index for the at least one search phrase based on the indication received from the user; and when the indication from the user specifies a noiseless phrase search, performing the noiseless phrase search at least in part by subtracting a value of the keyword position by the number of noisy keywords preceding the keyword. | 1. A computer-implemented method for keyword searching, the method comprising: generating, by a server, tokens for a plurality of keywords in a document collection, wherein the generating further comprises determining a keyword position of a keyword in a document of the document collection, and determining a number of noisy keywords preceding the keyword in the document; merging the tokens to create an index; receiving a search query, wherein the search query includes at least one search phrase; receiving, for the at least one search phrase, an indication from a user specifying to perform one of a noisy phrase search or a noiseless phrase search; searching the index for the at least one search phrase based on the indication received from the user; and when the indication from the user specifies a noiseless phrase search, performing the noiseless phrase search at least in part by subtracting a value of the keyword position by the number of noisy keywords preceding the keyword. 3. The computer-implemented method of claim 1 , wherein the noisy phrase search includes the noisy keywords in the search query and the noiseless phrase search ignores the noisy keywords in the search query. | 0.794643 |
8,180,778 | 5 | 6 | 5. The method of claim 1 , wherein calculating semantic similarities between the content items comprises calculating the semantic similarities between content items of different segments. | 5. The method of claim 1 , wherein calculating semantic similarities between the content items comprises calculating the semantic similarities between content items of different segments. 6. The method of claim 5 , comprising calculating the topical coherence value of the segment, wherein calculating the topical coherence value of the segment comprises calculating an average coherence of the segment, including averaging semantic similarities of pairs of the content items associated with the user actions clustered into the segment. | 0.5 |
9,122,760 | 4 | 5 | 4. The system of claim 1 , wherein when the third user requests suggestions relative to a specific product or service category, providing suggestions for items shown on multiple websites based on preferences of users who had similar preferences to each other for items offered on multiple websites and who also had a specified level of preference for said specific product or service category; and wherein the third user need provide no preference information beyond requesting suggestions relative to the specific product or service category in order to receive the suggestions. | 4. The system of claim 1 , wherein when the third user requests suggestions relative to a specific product or service category, providing suggestions for items shown on multiple websites based on preferences of users who had similar preferences to each other for items offered on multiple websites and who also had a specified level of preference for said specific product or service category; and wherein the third user need provide no preference information beyond requesting suggestions relative to the specific product or service category in order to receive the suggestions. 5. The system of claim 4 further including a widget or plugin operating on a user's computer that responds to a selection action of a user respective of a particular item and whereby the selection action causes the user to receive said suggestions for items shown on multiple websites. | 0.5 |
8,738,630 | 1 | 5 | 1. A method of image search, the method comprising: receiving a request from a client; providing a web page to the client in response to the request, the web page configured to allow an image to be uploaded and annotation content to be submitted for the image, wherein the image includes auxiliary information; receiving the image and user submitted annotation content for the image from the client, wherein the user submitted annotation content includes a link to another web page of a merchant that provides merchandise corresponding to the image, the another web page having merchandise information pertaining to the image; utilizing a link parsing unit of a first server to parse, via the link, remote from the client, the merchandise information from the another web page; writing, remote from the client, the parsed merchandise information into the auxiliary information of the image; storing, remote from the client, the image and the annotation content for the image, wherein the auxiliary information is stored in the image, wherein the storing, remote from the client, the annotation content for the image comprises one of: storing the annotation content in a database, associating the annotation content with the image and storing the annotation content in the auxiliary information of the image, wherein the storing the annotation content in the database and associating the annotation content with the image comprises: storing in the database the annotation content having a highest score; and associating the annotation content with the highest score with the image, and wherein the storing the annotation content in the auxiliary information of the image and storing the image by the server comprises: storing the annotation content with the highest score in the auxiliary information of the image; and storing the image, wherein the client is a first client and the merchant is a first merchant; providing the image and annotation content to a second client, wherein the annotation content includes an icon for instantiating an instant messaging session with a second merchant that provides merchandise corresponding to the image, wherein the instant messaging session is opened in a web page; providing the annotation content for the image as a search index to an image search engine; and organizing in advance a format of question and answer and a scoring rule for the submitted annotation content. | 1. A method of image search, the method comprising: receiving a request from a client; providing a web page to the client in response to the request, the web page configured to allow an image to be uploaded and annotation content to be submitted for the image, wherein the image includes auxiliary information; receiving the image and user submitted annotation content for the image from the client, wherein the user submitted annotation content includes a link to another web page of a merchant that provides merchandise corresponding to the image, the another web page having merchandise information pertaining to the image; utilizing a link parsing unit of a first server to parse, via the link, remote from the client, the merchandise information from the another web page; writing, remote from the client, the parsed merchandise information into the auxiliary information of the image; storing, remote from the client, the image and the annotation content for the image, wherein the auxiliary information is stored in the image, wherein the storing, remote from the client, the annotation content for the image comprises one of: storing the annotation content in a database, associating the annotation content with the image and storing the annotation content in the auxiliary information of the image, wherein the storing the annotation content in the database and associating the annotation content with the image comprises: storing in the database the annotation content having a highest score; and associating the annotation content with the highest score with the image, and wherein the storing the annotation content in the auxiliary information of the image and storing the image by the server comprises: storing the annotation content with the highest score in the auxiliary information of the image; and storing the image, wherein the client is a first client and the merchant is a first merchant; providing the image and annotation content to a second client, wherein the annotation content includes an icon for instantiating an instant messaging session with a second merchant that provides merchandise corresponding to the image, wherein the instant messaging session is opened in a web page; providing the annotation content for the image as a search index to an image search engine; and organizing in advance a format of question and answer and a scoring rule for the submitted annotation content. 5. The method of claim 1 , wherein the annotation content comprises a combination of one or more of information regarding texture of merchandise in the image, material of the merchandise in the image, specification of the merchandise in the image, place of production of the merchandise in the image, unit price of the merchandise in the image, use of the merchandise in the image, a Uniform Resource Locator (URL) address of the seller of the merchandise in the image, or a contact method of the seller. | 0.5 |
8,386,232 | 13 | 29 | 13. The method of claim 1 wherein at least one of the predicted results is that an item in the input data set is associated with a named entity. | 13. The method of claim 1 wherein at least one of the predicted results is that an item in the input data set is associated with a named entity. 29. One or more non-transitory computer readable storage media storing instructions which, when executed by one or more computing devices, cause performance of the method recited in claim 13 . | 0.5 |
9,355,093 | 1 | 2 | 1. A natural language generation method for generating a referring noun phrase for an intended referent found in one or more messages within a document plan, the method comprising: arranging, using a processor, one or more messages in a document plan, wherein messages represent a phrase or a simple sentence and are created in an instance in which an input data stream comprises data that satisfies one or more message requirements, and wherein at least a portion of the input data stream comprises non-linguistic data; identifying an intended referent in a message of the one or more messages to be referred to in a textual output; determining a lowest common ancestor for the intended referent and a previously referred-to entity within a part-of hierarchy; determining a salient ancestor of the intended referent within the part-of hierarchy; generating a referring noun phrase for the intended referent to be included in a textual output by traversing the part-of hierarchy from the salient ancestor to the lowest common ancestor such that a default descriptor is added to a queue for at least a portion of entities traversed in the part-of-hierarchy, wherein the reference noun phrase comprises a default descriptor of the intended referent and one or more default descriptors of one or more parts of the part-of hierarchy that are traversed; generating the textual output comprising the referring noun phrase such that it is displayable on a user interface, wherein the textual output linguistically describes at least a portion of the input data stream; and displaying the textual output via a display device. | 1. A natural language generation method for generating a referring noun phrase for an intended referent found in one or more messages within a document plan, the method comprising: arranging, using a processor, one or more messages in a document plan, wherein messages represent a phrase or a simple sentence and are created in an instance in which an input data stream comprises data that satisfies one or more message requirements, and wherein at least a portion of the input data stream comprises non-linguistic data; identifying an intended referent in a message of the one or more messages to be referred to in a textual output; determining a lowest common ancestor for the intended referent and a previously referred-to entity within a part-of hierarchy; determining a salient ancestor of the intended referent within the part-of hierarchy; generating a referring noun phrase for the intended referent to be included in a textual output by traversing the part-of hierarchy from the salient ancestor to the lowest common ancestor such that a default descriptor is added to a queue for at least a portion of entities traversed in the part-of-hierarchy, wherein the reference noun phrase comprises a default descriptor of the intended referent and one or more default descriptors of one or more parts of the part-of hierarchy that are traversed; generating the textual output comprising the referring noun phrase such that it is displayable on a user interface, wherein the textual output linguistically describes at least a portion of the input data stream; and displaying the textual output via a display device. 2. A method according to claim 1 , wherein the one or more parts of the part-of hierarchy that are traversed based on one or more salient ancestor links. | 0.773669 |
6,024,289 | 6 | 10 | 6. A method of encoding a data string into an optical symbol, the encoding method comprising the steps of: receiving the data string comprising a plurality of double byte character codes, the double byte character codes corresponding to data characters from a double byte character set, a number of the data characters from the double byte character set also belonging to a single byte character set, the optical symbol comprising a number of symbol characters; parsing the data string to separate the double byte character codes of data characters in the single byte character set from the data string; converting each of the double byte character codes parsed from the data string into one symbol value; converting each of the double byte character codes in the parsed data string into a combination of symbol values; and outputting the symbol values. | 6. A method of encoding a data string into an optical symbol, the encoding method comprising the steps of: receiving the data string comprising a plurality of double byte character codes, the double byte character codes corresponding to data characters from a double byte character set, a number of the data characters from the double byte character set also belonging to a single byte character set, the optical symbol comprising a number of symbol characters; parsing the data string to separate the double byte character codes of data characters in the single byte character set from the data string; converting each of the double byte character codes parsed from the data string into one symbol value; converting each of the double byte character codes in the parsed data string into a combination of symbol values; and outputting the symbol values. 10. The method of claim 6, wherein the double byte character set is GB and the is single byte character set is ASCII and wherein the step of parsing comprises the step of examining the character codes for a string equal to Hexadecimal 2A. | 0.745182 |
7,596,578 | 15 | 16 | 15. The method in accordance with claim 14 , wherein the at least one expert is presented simultaneously as an expert in at least the first forum and the second forum. | 15. The method in accordance with claim 14 , wherein the at least one expert is presented simultaneously as an expert in at least the first forum and the second forum. 16. The method in accordance with claim 15 , wherein the question requests a second opinion in regard to a medical treatment being received by the user, and the at least one expert is a peer reviewer applying review criteria selected by the third party sponsor for providing the second opinion. | 0.527331 |
8,510,650 | 1 | 15 | 1. A computerized method for constructing, analyzing, displaying, and editing a mathematical formula entered by a user for use in a software application, said computerized method comprising the acts of: responsive to receiving a mathematical formula entered into said software application by said user, said computerized method providing, to a display device viewable by said user, an application-preferred view of said mathematical formula, said application-preferred view suitable for use in said software application utilizing said mathematical formula; responsive to receiving a mathematical formula entered into said software application by said user, said computerized method providing, to said display device viewable by said user, one or more additional views of said mathematical formula, said one or more additional views different from said application-preferred view, wherein at least one of said one or more additional views of said mathematical formula displays a hierarchical diagram graphically clarifying the structure of said mathematical formula; and responsive to providing said one or more additional views of said mathematical formula, providing one or more computerized means configured for synchronizing the display of said application-preferred and said one or more additional views of said mathematical formula. | 1. A computerized method for constructing, analyzing, displaying, and editing a mathematical formula entered by a user for use in a software application, said computerized method comprising the acts of: responsive to receiving a mathematical formula entered into said software application by said user, said computerized method providing, to a display device viewable by said user, an application-preferred view of said mathematical formula, said application-preferred view suitable for use in said software application utilizing said mathematical formula; responsive to receiving a mathematical formula entered into said software application by said user, said computerized method providing, to said display device viewable by said user, one or more additional views of said mathematical formula, said one or more additional views different from said application-preferred view, wherein at least one of said one or more additional views of said mathematical formula displays a hierarchical diagram graphically clarifying the structure of said mathematical formula; and responsive to providing said one or more additional views of said mathematical formula, providing one or more computerized means configured for synchronizing the display of said application-preferred and said one or more additional views of said mathematical formula. 15. The method of claim 1 , wherein said one or more additional views of said mathematical formula displays a list of references contained in said mathematical formula. | 0.848375 |
9,659,012 | 21 | 22 | 21. The system of claim 17 , wherein during execution of the data integration code in debugging mode, the debugger client is configured to: replace a portion of the data integration code with a new portion of code; execute the new portion of code in the debugging mode; and update source code corresponding to the data integration code based on the new portion of code. | 21. The system of claim 17 , wherein during execution of the data integration code in debugging mode, the debugger client is configured to: replace a portion of the data integration code with a new portion of code; execute the new portion of code in the debugging mode; and update source code corresponding to the data integration code based on the new portion of code. 22. The system of claim 21 wherein the debugger client is further configured to recompile the source code after it has been updated to reflect the new portion of code. | 0.5 |
9,576,048 | 7 | 8 | 7. The computer program product of claim 6 , wherein: said clustering comprises service influence based probabilistic clustering based on a uniform neighborhood random walk distance measure; and said co-ranking comprises service influence based ranking. | 7. The computer program product of claim 6 , wherein: said clustering comprises service influence based probabilistic clustering based on a uniform neighborhood random walk distance measure; and said co-ranking comprises service influence based ranking. 8. The computer program product of claim 7 , wherein said service influence based probabilistic clustering is implemented by analogy to heat diffusion. | 0.5 |
8,105,356 | 2 | 3 | 2. The anchor assembly of claim 1 wherein said saddle mounting element is a sphere having a bore that is received over said shaft. | 2. The anchor assembly of claim 1 wherein said saddle mounting element is a sphere having a bore that is received over said shaft. 3. The anchor assembly of claim 2 wherein said saddle mounting element has one or more slots. | 0.5 |
9,123,024 | 14 | 15 | 14. The method of claim 12 , wherein the database comprises data imported from an external database. | 14. The method of claim 12 , wherein the database comprises data imported from an external database. 15. The method of claim 14 , wherein the database further comprises security requirements corresponding to internal business practices corresponding to the business offering, wherein the internal security requirements are integrated with leading practice and regulatory compliance requirements data. | 0.5 |
8,352,247 | 15 | 20 | 15. A system, comprising: a processor; and a computer-readable storage device storing instructions that, when executed by the processor, cause the processor to perform operations comprising: obtaining a plurality of canonical suffix-rewriting rules, each rule associated with one or more words to which the rule applies, wherein each canonical suffix-rewriting rule specifies a suffix replacement; generating a suffix tree from the words associated with the canonical suffix-rewriting rules, the suffix tree comprising a plurality of nodes and a plurality of leaves arranged in a hierarchical structure, wherein each node has one or more children below the node in the tree and each child is either a node or a leaf, and wherein each leaf corresponds to a distinct one of the words associated with the canonical suffix-rewriting rules and each node corresponds to a suffix of its children in the tree; selecting a minimum colored subset of the nodes and leaves in the suffix tree, wherein each node and leaf in the minimum colored subset is associated with a respective optimal canonical suffix-rewriting rule, wherein the minimum colored subset and optimal canonical suffix-rewriting rules are selected such that a derived canonical suffix-rewriting rule for each leaf matches the canonical suffix-rewriting rule associated with the word corresponding to the leaf, wherein the derived canonical suffix-rewriting rule for each leaf is the optimal canonical suffix-rewriting rule for a first colored ancestor of the leaf in the tree, and wherein the first colored ancestor for a leaf is the leaf, if the leaf is included in the minimum colored subset, and otherwise is a first node above the leaf in the tree that is in the minimum colored subset; and generating a plurality of final suffix-rewriting rules, each rule mapping a suffix of a node in the minimum colored subset to the suffix of the node with the suffix replacement specified by the canonical rule for the node. | 15. A system, comprising: a processor; and a computer-readable storage device storing instructions that, when executed by the processor, cause the processor to perform operations comprising: obtaining a plurality of canonical suffix-rewriting rules, each rule associated with one or more words to which the rule applies, wherein each canonical suffix-rewriting rule specifies a suffix replacement; generating a suffix tree from the words associated with the canonical suffix-rewriting rules, the suffix tree comprising a plurality of nodes and a plurality of leaves arranged in a hierarchical structure, wherein each node has one or more children below the node in the tree and each child is either a node or a leaf, and wherein each leaf corresponds to a distinct one of the words associated with the canonical suffix-rewriting rules and each node corresponds to a suffix of its children in the tree; selecting a minimum colored subset of the nodes and leaves in the suffix tree, wherein each node and leaf in the minimum colored subset is associated with a respective optimal canonical suffix-rewriting rule, wherein the minimum colored subset and optimal canonical suffix-rewriting rules are selected such that a derived canonical suffix-rewriting rule for each leaf matches the canonical suffix-rewriting rule associated with the word corresponding to the leaf, wherein the derived canonical suffix-rewriting rule for each leaf is the optimal canonical suffix-rewriting rule for a first colored ancestor of the leaf in the tree, and wherein the first colored ancestor for a leaf is the leaf, if the leaf is included in the minimum colored subset, and otherwise is a first node above the leaf in the tree that is in the minimum colored subset; and generating a plurality of final suffix-rewriting rules, each rule mapping a suffix of a node in the minimum colored subset to the suffix of the node with the suffix replacement specified by the canonical rule for the node. 20. The system of claim 15 , further operable to perform operations comprising generating a normalized form of a word using one of the plurality of final suffix-rewriting rules. | 0.825099 |
9,881,090 | 1 | 3 | 1. A method for providing information about a current hotspot event, the method being implemented by a server computer of a search engine in communication with a client computer, comprising: determining a first keyword that reflects one or more features of the current hotspot event; receiving, from the client computer, a search term inputted in an input box on a user interface of the search engine displayed on the client computer; determining that the search term is correlated with the first keyword; determining a second keyword matched with the first keyword in a first database, the second keyword reflecting one or more features of an advertisement, the second and the first keywords being matched by including a same person name, a same geographic location, a same product functionality, or a combination thereof; determining current information materials of the advertisement; generating hotspot information materials according to the current information materials and the first keyword; acquiring at least one of a sensitivity screening threshold and an online mode; making the hotspot information materials available online according to the at least one of the sensitivity screening threshold and the online mode; and sending the hotspot information materials to the client computer, wherein the client computer displays search results associated with the search term on the user interface, and wherein the search results include the hotspot information materials. | 1. A method for providing information about a current hotspot event, the method being implemented by a server computer of a search engine in communication with a client computer, comprising: determining a first keyword that reflects one or more features of the current hotspot event; receiving, from the client computer, a search term inputted in an input box on a user interface of the search engine displayed on the client computer; determining that the search term is correlated with the first keyword; determining a second keyword matched with the first keyword in a first database, the second keyword reflecting one or more features of an advertisement, the second and the first keywords being matched by including a same person name, a same geographic location, a same product functionality, or a combination thereof; determining current information materials of the advertisement; generating hotspot information materials according to the current information materials and the first keyword; acquiring at least one of a sensitivity screening threshold and an online mode; making the hotspot information materials available online according to the at least one of the sensitivity screening threshold and the online mode; and sending the hotspot information materials to the client computer, wherein the client computer displays search results associated with the search term on the user interface, and wherein the search results include the hotspot information materials. 3. The method of claim 1 , wherein said acquiring occurs before said making the hotspot information materials available online. | 0.844363 |
7,616,137 | 20 | 29 | 20. A decompression unit of executable code by a microprocessor, saved in a program memory zone in compressed form, the decompression unit being connected to the microprocessor, the decompression unit comprising: means for receiving from the microprocessor instruction requests of executable code comprising an instruction address to be executed, means for determining a reading address of an addressing table as a function of the instruction address to be executed, the addressing table localizing in the program memory certain saved compressed words, means for reading to the reading address in the addressing table addressing information of compressed words corresponding to the instruction to be executed, means for determining as a function of the read addressing information a reading address of the program memory, means for reading compressed words in the program memory to the reading address, means for decompressing the read compressed words to produce an executable instruction, and means for transmitting to the microprocessor the executable instruction, wherein each word of the executable code is compressed in the form of a part of predefined fixed length and a part of variable length, whereof the length is defined by the part of fixed length, all the parts of fixed length and all the parts of variable length of the words of executable code being combined into a program memory zone respectively in a block of parts of fixed length and in a block of parts of variable length, at least certain parts of variable length being localized in the block of parts of variable length by means of an addressing table, the decompression unit further comprising: means for determining a reading address in the block of parts of fixed length as a function of the address of the instruction to be executed, means for reading the block of parts of fixed length to the determined reading address, and means for decompressing the parts of fixed and variable length read to produce an executable instruction. | 20. A decompression unit of executable code by a microprocessor, saved in a program memory zone in compressed form, the decompression unit being connected to the microprocessor, the decompression unit comprising: means for receiving from the microprocessor instruction requests of executable code comprising an instruction address to be executed, means for determining a reading address of an addressing table as a function of the instruction address to be executed, the addressing table localizing in the program memory certain saved compressed words, means for reading to the reading address in the addressing table addressing information of compressed words corresponding to the instruction to be executed, means for determining as a function of the read addressing information a reading address of the program memory, means for reading compressed words in the program memory to the reading address, means for decompressing the read compressed words to produce an executable instruction, and means for transmitting to the microprocessor the executable instruction, wherein each word of the executable code is compressed in the form of a part of predefined fixed length and a part of variable length, whereof the length is defined by the part of fixed length, all the parts of fixed length and all the parts of variable length of the words of executable code being combined into a program memory zone respectively in a block of parts of fixed length and in a block of parts of variable length, at least certain parts of variable length being localized in the block of parts of variable length by means of an addressing table, the decompression unit further comprising: means for determining a reading address in the block of parts of fixed length as a function of the address of the instruction to be executed, means for reading the block of parts of fixed length to the determined reading address, and means for decompressing the parts of fixed and variable length read to produce an executable instruction. 29. The decompression unit as claimed in claim 20 , in which each of the words of decompressed executable code corresponds to an instruction. | 0.903425 |
9,275,017 | 7 | 8 | 7. A system for guiding user reading on a screen, the system comprising: a hardware processor that is programmed to: determine a reading speed of a user; receive a selection of a document having text; set a presenting speed for the document based at least in part on the determined reading speed of the user; determine an amount of characters that a reader can read during a single eye fixation; determine a plurality of blocks of text in the document that each have no incomplete words, and that each include no more than the determined amount of characters that the reader can read during a single eye fixation; format the text of the document, such that each of the blocks is on a single line in the text of the document; and present guidance to the user within the formatted document, wherein the guidance is moving along the text of the formatted document from one of the blocks to its successive block at the set presenting speed. | 7. A system for guiding user reading on a screen, the system comprising: a hardware processor that is programmed to: determine a reading speed of a user; receive a selection of a document having text; set a presenting speed for the document based at least in part on the determined reading speed of the user; determine an amount of characters that a reader can read during a single eye fixation; determine a plurality of blocks of text in the document that each have no incomplete words, and that each include no more than the determined amount of characters that the reader can read during a single eye fixation; format the text of the document, such that each of the blocks is on a single line in the text of the document; and present guidance to the user within the formatted document, wherein the guidance is moving along the text of the formatted document from one of the blocks to its successive block at the set presenting speed. 8. The system of claim 7 , wherein the hardware processor is further programmed to change a location of the guidance information within the original document in response to receiving a user input. | 0.5 |
10,114,814 | 11 | 12 | 11. A method according for processing and actionizing patient experience data, the method comprising: receiving at a server a plurality of communications, each of the plurality of communications comprises comment data collected from publicly available data of an Internet web site or from one or more surveys, wherein the comment data comprises structured or unstructured patient experience data; transforming the comment data of each of the plurality of communications to structured patient experience data; storing the comment data of each of the plurality of communications at a relational database in a response table that includes one or more records, wherein each record corresponds to the comment data from a communication, and wherein each record comprises the corresponding comment data and a timestamp; parsing the comment data for individual phrases to generate a plurality of phrases; selecting one or more phrases from the plurality of phrases based on a predetermined parameter; predicting at a NLP engine one or more annotations for the one or more phrases based upon a machine learning score wherein the one or more annotations comprise a sentiment, a theme, or any named entity of the one or more phrases; determining whether the machine learning score is less than a predetermined threshold score; predicting the one or more annotations for the one or more phrases based upon a reference score in response to determining that the machine learning score is less than the predetermined threshold score; storing the one or more annotations at the relational database in an annotation table that includes one or more records in response to predicting the one or more annotations, wherein each record corresponds to an annotation, and wherein each record includes the sentiment, the named entity, a primary tag indicative of a subject matter, or a secondary tag indicative of the theme; and generating at the server a dashboard web page for a user that includes the one or more annotations in response to predicting the one or more annotations. | 11. A method according for processing and actionizing patient experience data, the method comprising: receiving at a server a plurality of communications, each of the plurality of communications comprises comment data collected from publicly available data of an Internet web site or from one or more surveys, wherein the comment data comprises structured or unstructured patient experience data; transforming the comment data of each of the plurality of communications to structured patient experience data; storing the comment data of each of the plurality of communications at a relational database in a response table that includes one or more records, wherein each record corresponds to the comment data from a communication, and wherein each record comprises the corresponding comment data and a timestamp; parsing the comment data for individual phrases to generate a plurality of phrases; selecting one or more phrases from the plurality of phrases based on a predetermined parameter; predicting at a NLP engine one or more annotations for the one or more phrases based upon a machine learning score wherein the one or more annotations comprise a sentiment, a theme, or any named entity of the one or more phrases; determining whether the machine learning score is less than a predetermined threshold score; predicting the one or more annotations for the one or more phrases based upon a reference score in response to determining that the machine learning score is less than the predetermined threshold score; storing the one or more annotations at the relational database in an annotation table that includes one or more records in response to predicting the one or more annotations, wherein each record corresponds to an annotation, and wherein each record includes the sentiment, the named entity, a primary tag indicative of a subject matter, or a secondary tag indicative of the theme; and generating at the server a dashboard web page for a user that includes the one or more annotations in response to predicting the one or more annotations. 12. The method according to claim 11 further comprising: extracting the comment data of each of the plurality of communications at the server; transforming the comment data to a format compatible with a target; and loading the transformed comment data into the response table of the relational database. | 0.701183 |
9,031,950 | 13 | 20 | 13. A non-transitory computer readable storage medium having a computer program stored thereon, the computer program causing a computer to perform the steps of: defining a set of possible answers in response to a user query; ordering the set of possible answers according to one or more attributes related to an ability to answer the user query, each of the ordered answers making up a grouping; determining only whether a first of the groupings of individual answers is different from the next of the groupings of individual answers in accordance with a coefficient of variation between the first of the groupings and the next of the groupings in accordance with the one or more attributes related to the ability to answer the user query; and defining the first of the groupings of the individual answers as a set of good enough answers if it is determined to be distinctly different from the next of the groupings in accordance with whether the coefficient of variance is greater than a predetermined threshold. | 13. A non-transitory computer readable storage medium having a computer program stored thereon, the computer program causing a computer to perform the steps of: defining a set of possible answers in response to a user query; ordering the set of possible answers according to one or more attributes related to an ability to answer the user query, each of the ordered answers making up a grouping; determining only whether a first of the groupings of individual answers is different from the next of the groupings of individual answers in accordance with a coefficient of variation between the first of the groupings and the next of the groupings in accordance with the one or more attributes related to the ability to answer the user query; and defining the first of the groupings of the individual answers as a set of good enough answers if it is determined to be distinctly different from the next of the groupings in accordance with whether the coefficient of variance is greater than a predetermined threshold. 20. The non-transitory computer readable storage medium of claim 13 , wherein the actual individual answers may take on any arbitrary values. | 0.727799 |
9,846,686 | 5 | 7 | 5. A non-transitory computer readable medium having stored thereon instructions for extending a document transformation server to utilize web application instances to efficiently transform multiple web documents from multiple websites to have customized display formats comprising machine executable code which when executed by a processor, causes the processor to: obtain a web document to process based on at least a Uniform Resource Locator (URL) of the web document in a received HyperText Transfer Protocol (HTTP) request from one of client computing devices, the web document in a first display format; identify a data structure having an identifier matching a first portion of the URL and retrieve a plurality of associations from the data structure, the plurality of associations comprising a mapping of a plurality of processors to one or more parts of one or more fields in the URL, wherein the first portion of the URL comprises one or more of a domain, a path, or one or more parameters of the URL; select one of the processors associated with a longest string matching the first portion of the URL or a second portion of the URL, wherein the string associated with the one of the processors comprises more characters matching the first or second portion of the URL than another string associated with each other of the processors; transform the web document with the selected one of the processors into a second display format, at least one of the first or second display formats capable of being rendered by a web browser; and provide the transformed web document in an HTTP response to the one of the client computing devices. | 5. A non-transitory computer readable medium having stored thereon instructions for extending a document transformation server to utilize web application instances to efficiently transform multiple web documents from multiple websites to have customized display formats comprising machine executable code which when executed by a processor, causes the processor to: obtain a web document to process based on at least a Uniform Resource Locator (URL) of the web document in a received HyperText Transfer Protocol (HTTP) request from one of client computing devices, the web document in a first display format; identify a data structure having an identifier matching a first portion of the URL and retrieve a plurality of associations from the data structure, the plurality of associations comprising a mapping of a plurality of processors to one or more parts of one or more fields in the URL, wherein the first portion of the URL comprises one or more of a domain, a path, or one or more parameters of the URL; select one of the processors associated with a longest string matching the first portion of the URL or a second portion of the URL, wherein the string associated with the one of the processors comprises more characters matching the first or second portion of the URL than another string associated with each other of the processors; transform the web document with the selected one of the processors into a second display format, at least one of the first or second display formats capable of being rendered by a web browser; and provide the transformed web document in an HTTP response to the one of the client computing devices. 7. The medium as set forth in claim 5 wherein the machine executable code, when executed by the processor, further causes the processor to decode the obtained URL of the web document prior to obtaining the web document. | 0.65674 |
9,411,781 | 16 | 18 | 16. A non-transitory computer-readable storage media having instructions stored thereon, the instructions operable to cause a data processing apparatus to: receive a first style, the first style being a record-based style defined as a sequence of two or more contiguous style fields and based on one or more rules, each style field being so as to apply to a specified number of occurrences of a respective content unit structure, each rule being based on formatting values or content values or structure values that are associated with a respective content unit structure of at least one of the style fields of the first style; receive a second style, the second style being a record-based style defined as a sequence of two or more contiguous style fields and based on one or more rules, each style field being so as to apply to a specified number of occurrences of a respective content unit structure, each rule being based on formatting values or content values or structure values that are associated with a respective content unit structure of at least one of the style fields of the second style; apply the first style to formatted text content, the formatted text content including a result set of multiple logical records, the logical records being non-overlapping, each logical record having a number of content fields that matches the specified number of occurrences of each style field's respective content unit structure in the first style, and each logical record matching formatting values or content values or structure values according to the rules for the first style; and apply the second style to the logical records of the result set within the formatted text content that match the first style. | 16. A non-transitory computer-readable storage media having instructions stored thereon, the instructions operable to cause a data processing apparatus to: receive a first style, the first style being a record-based style defined as a sequence of two or more contiguous style fields and based on one or more rules, each style field being so as to apply to a specified number of occurrences of a respective content unit structure, each rule being based on formatting values or content values or structure values that are associated with a respective content unit structure of at least one of the style fields of the first style; receive a second style, the second style being a record-based style defined as a sequence of two or more contiguous style fields and based on one or more rules, each style field being so as to apply to a specified number of occurrences of a respective content unit structure, each rule being based on formatting values or content values or structure values that are associated with a respective content unit structure of at least one of the style fields of the second style; apply the first style to formatted text content, the formatted text content including a result set of multiple logical records, the logical records being non-overlapping, each logical record having a number of content fields that matches the specified number of occurrences of each style field's respective content unit structure in the first style, and each logical record matching formatting values or content values or structure values according to the rules for the first style; and apply the second style to the logical records of the result set within the formatted text content that match the first style. 18. The non-transitory computer-readable storage media of claim 16 , wherein instructions to apply the second style comprise instructions to modify content in accordance with the second style. | 0.698113 |
8,190,684 | 1 | 18 | 1. A method of intelligently distributing, in a networked environment, an object that represents an offering, the method comprising: receiving a request from a user initiated at a computing device to create the object to represent the offering; creating the object to represent the offering to be made available for access in the networked environment, the object being created to include metadata specifying criteria of target recipients of the offering; wherein, the criteria of target recipients are received in the networked environment from the user that requested creation of the object, matching the criteria specified in the metadata of the object to users in the networked environment, to find recipients who satisfy the criteria; automatically sending the offering represented by the object to the recipients who satisfy the criteria specified in the metadata; automatically generating multiple versions of the object to represent the offering based on an example object specified by the user; test-posting the multiple versions to compute price-performance attributes of each of the multiple versions. | 1. A method of intelligently distributing, in a networked environment, an object that represents an offering, the method comprising: receiving a request from a user initiated at a computing device to create the object to represent the offering; creating the object to represent the offering to be made available for access in the networked environment, the object being created to include metadata specifying criteria of target recipients of the offering; wherein, the criteria of target recipients are received in the networked environment from the user that requested creation of the object, matching the criteria specified in the metadata of the object to users in the networked environment, to find recipients who satisfy the criteria; automatically sending the offering represented by the object to the recipients who satisfy the criteria specified in the metadata; automatically generating multiple versions of the object to represent the offering based on an example object specified by the user; test-posting the multiple versions to compute price-performance attributes of each of the multiple versions. 18. The method of claim 1 , further comprising, allowing the user to create multiple objects to represent the offering with different criteria for specifying target recipients to test the efficacy of the different criteria for finding matching users in the networked environment. | 0.5 |
10,120,916 | 10 | 11 | 10. The system of claim 7 , wherein determining the second context further comprises: accessing the metadata values describing the second data value; and determining the second context with the metadata values. | 10. The system of claim 7 , wherein determining the second context further comprises: accessing the metadata values describing the second data value; and determining the second context with the metadata values. 11. The system of claim 10 , further comprising: updating a non-standard value with a standardized value. | 0.5 |
6,148,104 | 13 | 15 | 13. The apparatus of claim 10, wherein said window further includes a region for the display of commands. | 13. The apparatus of claim 10, wherein said window further includes a region for the display of commands. 15. The apparatus of claim 13, wherein said second region for displaying said at least one candidate character lies along the edge of said window. | 0.609626 |
7,711,735 | 17 | 19 | 17. At least one computer-readable medium having computer executable instructions, which when executed perform steps, comprising: receiving a URL visit log and an input set of users, the URL visit log indicating URLs visited by the users in the input set of users, each URL in the visit log having a domain; building a table of cells comprised of the domains of the visit log crossed with the set of users; for each cell, computing a count of visits to the domain corresponding to the cell by the user corresponding to the cell, where the count in a cell comprises a count of the URLs in the visit log that belong to the domain corresponding to the cell and that were visited by the user corresponding to the cell; and suggesting domains by using the counts of the cells to compute similarity between pairs of domains and using the similarities to suggest domains in the table. | 17. At least one computer-readable medium having computer executable instructions, which when executed perform steps, comprising: receiving a URL visit log and an input set of users, the URL visit log indicating URLs visited by the users in the input set of users, each URL in the visit log having a domain; building a table of cells comprised of the domains of the visit log crossed with the set of users; for each cell, computing a count of visits to the domain corresponding to the cell by the user corresponding to the cell, where the count in a cell comprises a count of the URLs in the visit log that belong to the domain corresponding to the cell and that were visited by the user corresponding to the cell; and suggesting domains by using the counts of the cells to compute similarity between pairs of domains and using the similarities to suggest domains in the table. 19. The computer-readable medium of claim 17 wherein the suggesting the domains takes place offline with respect to an online behavioral targeting system, and having further computer-executable instructions comprising, outputting the similarity computed for a domain with each other domain in decreasing order of similarity. | 0.5 |
8,266,158 | 1 | 11 | 1. A method for generating a just-in-time reputation score, the method comprising: receiving a user generated content item from a user; calculating an initial content score for the user generated content item, wherein the initial content score is an average of a score for each of a plurality of prior user generated content items received from the user; retrieving one or more content submission rules based on at least one of: historical trends in a plurality of prior generated content items received from a plurality of members of a community or rules defined by the community; analyzing said user generated content item against said one or more content submission rules; determining a just-in-time reputation score of the user generated content item based on the initial content score adjusted accordingly to said analysis; displaying said just-in-time reputation score, said user generated content item to the user, and a message informing the user that said user generated content item violates the one or more rules; and receiving a modified user generated content item modified in response to displaying said just-in-time reputation score, said user generated content item, and the message informing the user that said user generated content item violates the one or more rules. | 1. A method for generating a just-in-time reputation score, the method comprising: receiving a user generated content item from a user; calculating an initial content score for the user generated content item, wherein the initial content score is an average of a score for each of a plurality of prior user generated content items received from the user; retrieving one or more content submission rules based on at least one of: historical trends in a plurality of prior generated content items received from a plurality of members of a community or rules defined by the community; analyzing said user generated content item against said one or more content submission rules; determining a just-in-time reputation score of the user generated content item based on the initial content score adjusted accordingly to said analysis; displaying said just-in-time reputation score, said user generated content item to the user, and a message informing the user that said user generated content item violates the one or more rules; and receiving a modified user generated content item modified in response to displaying said just-in-time reputation score, said user generated content item, and the message informing the user that said user generated content item violates the one or more rules. 11. The method of claim 1 wherein determining a just-in-time reputation score comprises decreasing said initial content score if said user generated content item is in violation of said rules. | 0.555556 |
8,701,087 | 1 | 2 | 1. A computer-implemented method of annotating software objects, comprising: providing a software object, wherein the software object is an instance of a class in an object-oriented computing environment, and wherein the software object is generated by a software component executed by an application server; determining a plurality of rules based on the class, wherein the plurality of rules define how to annotate the software object; processing, by an annotation engine component executed by the application server, the software object according to the plurality of rules; generating, by the annotation engine component, an annotation document based on the software object having been processed according to the plurality of rules; and generating, by an application programming interface component executed by the application server, an annotated software object based on the software object and the annotation document, wherein the annotated software object corresponds to the software object as annotated by the annotation document; wherein the annotation engine component is configured to process the software object in a non-intrusive manner with regard to the software component such that the software component is not modified; and wherein the plurality of rules define how to create the annotation document, wherein the plurality of rules includes a plurality of categories and a plurality of relations, and wherein the plurality of categories and the plurality of relations relate to a domain ontology. | 1. A computer-implemented method of annotating software objects, comprising: providing a software object, wherein the software object is an instance of a class in an object-oriented computing environment, and wherein the software object is generated by a software component executed by an application server; determining a plurality of rules based on the class, wherein the plurality of rules define how to annotate the software object; processing, by an annotation engine component executed by the application server, the software object according to the plurality of rules; generating, by the annotation engine component, an annotation document based on the software object having been processed according to the plurality of rules; and generating, by an application programming interface component executed by the application server, an annotated software object based on the software object and the annotation document, wherein the annotated software object corresponds to the software object as annotated by the annotation document; wherein the annotation engine component is configured to process the software object in a non-intrusive manner with regard to the software component such that the software component is not modified; and wherein the plurality of rules define how to create the annotation document, wherein the plurality of rules includes a plurality of categories and a plurality of relations, and wherein the plurality of categories and the plurality of relations relate to a domain ontology. 2. The method of claim 1 , wherein the software component is configured to generate the software object such that the software object lacks annotation. | 0.793716 |
9,756,149 | 12 | 13 | 12. A computing device, comprising: one or more processors; a storage device storing code for a program that is to be executed on the computing device; a plurality of sandboxing components that are each configured to execute the program on the computing device using respective software-based fault isolation techniques that are different from each other; and an application environment selector configured to select, from among the plurality of sandboxing components and based on a set of selection criteria, a first sandboxing component with which to execute the program. | 12. A computing device, comprising: one or more processors; a storage device storing code for a program that is to be executed on the computing device; a plurality of sandboxing components that are each configured to execute the program on the computing device using respective software-based fault isolation techniques that are different from each other; and an application environment selector configured to select, from among the plurality of sandboxing components and based on a set of selection criteria, a first sandboxing component with which to execute the program. 13. The computing device of claim 12 , further comprising: a web browser that includes the plurality of sandboxing components and the application environment selector. | 0.845941 |
8,489,538 | 1 | 3 | 1. A method for analyzing a plurality of documents, comprising: receiving the plurality of documents via a computing device; filtering the plurality of documents to produce a subset of the plurality of documents; executing instructions stored in memory, wherein execution of the instructions by a processor generates an initial control set based on random sampling of the subset of the plurality of documents; receiving user input from the computing device, the user input based on an identified subject or category; and executing instructions stored in memory, wherein execution of the instructions by a processor: reviews the initial control set to determine at least one seed set parameter associated with the identified subject or category, automatically codes a first portion of the plurality of documents, based on the initial control set and the at least one seed set parameter associated with the identified subject or category, automatically codes a second portion of the plurality of documents resulting from an application of user analysis and an adaptive identification cycle, and adds the coded second portion of the plurality of documents to the initial control set. | 1. A method for analyzing a plurality of documents, comprising: receiving the plurality of documents via a computing device; filtering the plurality of documents to produce a subset of the plurality of documents; executing instructions stored in memory, wherein execution of the instructions by a processor generates an initial control set based on random sampling of the subset of the plurality of documents; receiving user input from the computing device, the user input based on an identified subject or category; and executing instructions stored in memory, wherein execution of the instructions by a processor: reviews the initial control set to determine at least one seed set parameter associated with the identified subject or category, automatically codes a first portion of the plurality of documents, based on the initial control set and the at least one seed set parameter associated with the identified subject or category, automatically codes a second portion of the plurality of documents resulting from an application of user analysis and an adaptive identification cycle, and adds the coded second portion of the plurality of documents to the initial control set. 3. The method of claim 1 , wherein the random sampling is on a static basis, and wherein generating the initial control set is further based on random sampling of the subset of the plurality of documents on a rolling load basis. | 0.734884 |
7,987,172 | 1 | 30 | 1. A method for scheduling documents to be crawled by a search engine in an appropriate order to reduce visibility of stale content in web searching, comprising: on a computer system having one or more processors and memory storing one or more programs for execution by the one or more processors: associating with each of a plurality of documents a respective initial web crawl interval, wherein the initial web crawl interval is determined based at least in part on a document's importance metric; retrieving each of the plurality of documents from a respective host at one or more times associated with each document's respective initial web crawl interval; associating a revised web crawl interval with a respective document of the plurality of documents based on the document's respective initial web crawl interval and any changes to content of the document; partitioning the plurality of documents into multiple tiers according to their respective web crawl intervals, each tier having a distinct associated range of web crawl intervals, including storing data for each tier identifying documents in the plurality of documents assigned to that tier in accordance with the documents' respective web crawl intervals; for each tier of the multiple tiers, determining a web crawl order for the documents assigned to the tier in accordance with their respective revised web crawl interval; and moving a respective document between tiers of the multiple tiers when the respective revised web crawl interval of the respective document is associated with a different tier of the multiple tiers than a previous web crawl interval of the respective document. | 1. A method for scheduling documents to be crawled by a search engine in an appropriate order to reduce visibility of stale content in web searching, comprising: on a computer system having one or more processors and memory storing one or more programs for execution by the one or more processors: associating with each of a plurality of documents a respective initial web crawl interval, wherein the initial web crawl interval is determined based at least in part on a document's importance metric; retrieving each of the plurality of documents from a respective host at one or more times associated with each document's respective initial web crawl interval; associating a revised web crawl interval with a respective document of the plurality of documents based on the document's respective initial web crawl interval and any changes to content of the document; partitioning the plurality of documents into multiple tiers according to their respective web crawl intervals, each tier having a distinct associated range of web crawl intervals, including storing data for each tier identifying documents in the plurality of documents assigned to that tier in accordance with the documents' respective web crawl intervals; for each tier of the multiple tiers, determining a web crawl order for the documents assigned to the tier in accordance with their respective revised web crawl interval; and moving a respective document between tiers of the multiple tiers when the respective revised web crawl interval of the respective document is associated with a different tier of the multiple tiers than a previous web crawl interval of the respective document. 30. The method of claim 1 , wherein the changes to the content of a document comprise critical content changes and non-critical content changes, and the computer system considers the critical content changes to the document and ignores the non-critical content changes to the document when associating a revised web crawl interval with the document. | 0.754225 |
9,208,439 | 13 | 16 | 13. A computing system comprising: one or more processors, a non-transitory computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: receiving, from a mobile device, event data derived from contextual data collected using detectors that detect a physical context surrounding the mobile device; modifying a context graph that stores facts and assertions about a user's behavior and interests using the event data; in response to determining that there exists a registration for notification of changes that matches the modification to the context graph, sending a notification of context graph change to a recommender. | 13. A computing system comprising: one or more processors, a non-transitory computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: receiving, from a mobile device, event data derived from contextual data collected using detectors that detect a physical context surrounding the mobile device; modifying a context graph that stores facts and assertions about a user's behavior and interests using the event data; in response to determining that there exists a registration for notification of changes that matches the modification to the context graph, sending a notification of context graph change to a recommender. 16. The computer-readable storage medium of claim 13 , wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising: receiving a query for context graph data from the recommender; and sending the context graph data to the recommender. | 0.706619 |
7,730,094 | 1 | 5 | 1. A method for determining access rights to a range of objects by a range of users through scope information, the method performed by a computer system including system memory and one or more processors, the method comprising: receiving, from a first user, a request to access a first resource; determining that a scope of a first access control metadata element encompasses the first resource, wherein the first access control metadata element includes: a first set of one or more XML statements that define the scope of the first access control metadata element by selecting a plurality of resources, the scope of the first access control metadata element encompassing the first resource and at least one other resource; a second set of one or more XML statements that define access rights for the plurality of resources within the scope of the first access control metadata element; and a third set of one or more XML statements that define a plurality of users to which the first access control metadata element applies; determining that a scope of a second access control metadata element encompasses the first resource, wherein the second access control metadata element includes: a first set of one or more XML access control-related statements that define the scope of the second access control metadata element by selecting one or more resources, the scope of the second access control metadata element encompassing the first resource; a second set of one or more XML statements that define access rights for the plurality of resources within the scope of the second access control metadata element; and a third set of one or more XML statements that define a plurality of users to which the second access control metadata element applies; determining that the first user is among the plurality of users to which the first access control metadata element applies as defined by the third set of one or more XML statements of the first access control metadata element; determining that the first user is among the plurality of users to which the second access control metadata element applies as defined by the third set of one or more XML statements of the second access control metadata element; determining that a first access right defined in the first access control metadata element conflicts with a second access right defined in the second access control metadata element; in response to determining that the first access right conflicts with the second access right, determining whether the first access right supersedes the second access right; and in response to determining that the first access right supersedes the second access right, applying the first access right to the access request from the first user. | 1. A method for determining access rights to a range of objects by a range of users through scope information, the method performed by a computer system including system memory and one or more processors, the method comprising: receiving, from a first user, a request to access a first resource; determining that a scope of a first access control metadata element encompasses the first resource, wherein the first access control metadata element includes: a first set of one or more XML statements that define the scope of the first access control metadata element by selecting a plurality of resources, the scope of the first access control metadata element encompassing the first resource and at least one other resource; a second set of one or more XML statements that define access rights for the plurality of resources within the scope of the first access control metadata element; and a third set of one or more XML statements that define a plurality of users to which the first access control metadata element applies; determining that a scope of a second access control metadata element encompasses the first resource, wherein the second access control metadata element includes: a first set of one or more XML access control-related statements that define the scope of the second access control metadata element by selecting one or more resources, the scope of the second access control metadata element encompassing the first resource; a second set of one or more XML statements that define access rights for the plurality of resources within the scope of the second access control metadata element; and a third set of one or more XML statements that define a plurality of users to which the second access control metadata element applies; determining that the first user is among the plurality of users to which the first access control metadata element applies as defined by the third set of one or more XML statements of the first access control metadata element; determining that the first user is among the plurality of users to which the second access control metadata element applies as defined by the third set of one or more XML statements of the second access control metadata element; determining that a first access right defined in the first access control metadata element conflicts with a second access right defined in the second access control metadata element; in response to determining that the first access right conflicts with the second access right, determining whether the first access right supersedes the second access right; and in response to determining that the first access right supersedes the second access right, applying the first access right to the access request from the first user. 5. The method of claim 1 , wherein the first resource comprises a web service. | 0.825893 |
8,706,491 | 9 | 10 | 9. An information extraction system comprising: a semantic schema comprising a multilevel template with a root level and a leaf level, the root level having a frame label identifying an action to be performed, the leaf level having slots identifying attributes of the action; and a computer processor that is a component of a computing device that receives a natural language input and generates a candidate parse by parsing the natural language input with a structured language model that generates hypothesis parses of a portion of the natural language input by applying the multilevel template and accepting only those hypothesis parses that completely match the structure of the multilevel template, wherein the structured language model is trained by generating a set of syntactic parses for a given word string that all match semantic constituent boundaries, by determining whether unlabeled constituents that define a semantic parse is included in a set of constituents that define the syntactic parse, wherein parses that do not match the semantic constituent boundaries are discarded, and replacing syntactic labels in a parse tree with joint syntactic and semantic labels based on the generated parses excluding the discarded parses, and retraining the structured language model by generating parses that are constrained to identically match the semantic constituent labels of the joint syntactic and semantic labels and constrained to match all of the semantic constituent boundaries. | 9. An information extraction system comprising: a semantic schema comprising a multilevel template with a root level and a leaf level, the root level having a frame label identifying an action to be performed, the leaf level having slots identifying attributes of the action; and a computer processor that is a component of a computing device that receives a natural language input and generates a candidate parse by parsing the natural language input with a structured language model that generates hypothesis parses of a portion of the natural language input by applying the multilevel template and accepting only those hypothesis parses that completely match the structure of the multilevel template, wherein the structured language model is trained by generating a set of syntactic parses for a given word string that all match semantic constituent boundaries, by determining whether unlabeled constituents that define a semantic parse is included in a set of constituents that define the syntactic parse, wherein parses that do not match the semantic constituent boundaries are discarded, and replacing syntactic labels in a parse tree with joint syntactic and semantic labels based on the generated parses excluding the discarded parses, and retraining the structured language model by generating parses that are constrained to identically match the semantic constituent labels of the joint syntactic and semantic labels and constrained to match all of the semantic constituent boundaries. 10. The system of claim 9 , wherein the computer processor adds part-of-speech tags to words in the parse, and maps the parse to the multilevel template based at least in part on the part-of-speech tags. | 0.601961 |
8,392,446 | 2 | 3 | 2. The method of claim 1 , wherein combining comprises providing the vector terms in a separate vector component on said result page. | 2. The method of claim 1 , wherein combining comprises providing the vector terms in a separate vector component on said result page. 3. The method of claim 2 , wherein providing comprises presenting at least one control. | 0.5 |
9,819,692 | 1 | 25 | 1. A computer-implemented method for detecting a network activity of interest, the method comprising: obtaining, by one or more processors, a plurality of network packets from a network, wherein the obtained plurality of network packets includes the network activity of interest; creating, by the one or more processors, a plurality of combined packets from the plurality of network packets, wherein the plurality of combined packets includes: a first combined packet, and a second combined packet different from the first combined packet; creating, by the one or more processors, a first sequence by converting content of at least a portion of the first combined packet into a first plurality of integers, wherein the first sequence includes the first plurality of integers; creating, by the one or more processors, a second sequence by converting content of at least a portion of the second combined packet into a second plurality of integers, wherein the second sequence includes the second plurality of integers; determining, by the one or more processors, a similarity metric between the first sequence and the second sequence based on a distance function; creating, by the one or more processors, a third sequence based on the similarity metric, wherein the third sequence comprises a third plurality of integers common to the first sequence and the second sequence, in a first order, wherein the third sequence is a meta-expression that corresponds to the presence of the network activity of interest in the network traffic; and storing the meta-expression, wherein the stored meta-expression is used to detect the presence of the network activity of interest. | 1. A computer-implemented method for detecting a network activity of interest, the method comprising: obtaining, by one or more processors, a plurality of network packets from a network, wherein the obtained plurality of network packets includes the network activity of interest; creating, by the one or more processors, a plurality of combined packets from the plurality of network packets, wherein the plurality of combined packets includes: a first combined packet, and a second combined packet different from the first combined packet; creating, by the one or more processors, a first sequence by converting content of at least a portion of the first combined packet into a first plurality of integers, wherein the first sequence includes the first plurality of integers; creating, by the one or more processors, a second sequence by converting content of at least a portion of the second combined packet into a second plurality of integers, wherein the second sequence includes the second plurality of integers; determining, by the one or more processors, a similarity metric between the first sequence and the second sequence based on a distance function; creating, by the one or more processors, a third sequence based on the similarity metric, wherein the third sequence comprises a third plurality of integers common to the first sequence and the second sequence, in a first order, wherein the third sequence is a meta-expression that corresponds to the presence of the network activity of interest in the network traffic; and storing the meta-expression, wherein the stored meta-expression is used to detect the presence of the network activity of interest. 25. The computer-implemented method of claim 1 , wherein the one or more processors are processors of a first computing device, wherein the stored meta-expression is stored on the first computing device, and the method further comprises: detecting, by the one or more processors of the first computing device, the network activity of interest using the stored meta-expression. | 0.707621 |
9,177,074 | 5 | 6 | 5. The computer-implemented method of claim 1 , wherein the authorship identifier includes a byline for a purported author of or contributor to the first document as the byline appears in documents hosted at the first domain. | 5. The computer-implemented method of claim 1 , wherein the authorship identifier includes a byline for a purported author of or contributor to the first document as the byline appears in documents hosted at the first domain. 6. The computer-implemented method of claim 5 , wherein prior to conditionally confirming the authorship of the first document, the method includes requesting that the entity confirm that the byline associated with the profile for the entity is the byline that the entity includes in documents authored by the entity hosted at the first domain. | 0.5 |
10,097,617 | 1 | 7 | 1. A method for conforming text posted on a social networking Web site for posting on another social networking Web site, the method comprising: receiving, by a processing device, text input by a user for posting on a first social networking Web site; analyzing the text, by the processing device, to identify topical and semantic attributes of the text, wherein the semantic attributes comprise writing style, tone and use of idioms; extracting, by the processing device, topical and semantic attributes from exiting posts on a second social networking Web site with natural language processing and semantic analysis; creating and saving a plurality of profiles, by the processing device, according to historical semantic communication style of the existing posts, wherein each profile comprises topic, semantic attributes, social networking Web site identification, and intended recipients; comparing the text with the plurality of profiles; creating a new profile and prioritizing the new profile in response to the topical and semantic attributes of the text not matching a saved profile of the plurality of profiles; prioritizing an existing profile of the plurality of profiles as a key profile of common features for the user in response to the topical and semantic attributes of the text matching the existing profile; and converting the text, by the processing device, to have topical and semantic attributes appropriate for posting on the second social networking Web site, wherein converting the text comprises using a particular profile of the plurality of profiles that best matches the second social networking Web site and the intended recipient to which the text is sent. | 1. A method for conforming text posted on a social networking Web site for posting on another social networking Web site, the method comprising: receiving, by a processing device, text input by a user for posting on a first social networking Web site; analyzing the text, by the processing device, to identify topical and semantic attributes of the text, wherein the semantic attributes comprise writing style, tone and use of idioms; extracting, by the processing device, topical and semantic attributes from exiting posts on a second social networking Web site with natural language processing and semantic analysis; creating and saving a plurality of profiles, by the processing device, according to historical semantic communication style of the existing posts, wherein each profile comprises topic, semantic attributes, social networking Web site identification, and intended recipients; comparing the text with the plurality of profiles; creating a new profile and prioritizing the new profile in response to the topical and semantic attributes of the text not matching a saved profile of the plurality of profiles; prioritizing an existing profile of the plurality of profiles as a key profile of common features for the user in response to the topical and semantic attributes of the text matching the existing profile; and converting the text, by the processing device, to have topical and semantic attributes appropriate for posting on the second social networking Web site, wherein converting the text comprises using a particular profile of the plurality of profiles that best matches the second social networking Web site and the intended recipient to which the text is sent. 7. The method of claim 1 , wherein a user or administrator may select certain topical and semantic attributes for omission from matching. | 0.785938 |
6,067,282 | 6 | 8 | 6. An information reproducing apparatus for reproducing information from an information recording medium having a management information area and recording information area, the recording information area including a plurality of record information pieces constituting a hierarchical structure comprising a plurality of hierarchical layers; the management information area including: a layer information piece for specifying one of the plurality of hierarchical layers; a kind information piece for indicating a kind of information relating to one of the record information pieces; a text group including a plurality of text information comprising a plurality of layer related texts and a plurality of record information related texts, at least one of the plurality of layer related texts describing information related to the layer specified by the layer information piece, and at least one of the plurality of record information related texts describing information related to the kind of information indicated by the kind information piece; a text arrangement piece, arranged in pair with one of the layer information piece and the kind information piece, indicating a position of a text information corresponding to the paired one of the layer information piece and the kind information piece, said apparatus comprising: reading means for reading the information recording medium thereby obtaining a read signal; demodulating means for demodulating the read signal thereby obtaining a demodulated signal; detecting means for detecting, from the demodulated signal, the text group; and displaying means for displaying information corresponding to at least a portion of the text information within the text group. | 6. An information reproducing apparatus for reproducing information from an information recording medium having a management information area and recording information area, the recording information area including a plurality of record information pieces constituting a hierarchical structure comprising a plurality of hierarchical layers; the management information area including: a layer information piece for specifying one of the plurality of hierarchical layers; a kind information piece for indicating a kind of information relating to one of the record information pieces; a text group including a plurality of text information comprising a plurality of layer related texts and a plurality of record information related texts, at least one of the plurality of layer related texts describing information related to the layer specified by the layer information piece, and at least one of the plurality of record information related texts describing information related to the kind of information indicated by the kind information piece; a text arrangement piece, arranged in pair with one of the layer information piece and the kind information piece, indicating a position of a text information corresponding to the paired one of the layer information piece and the kind information piece, said apparatus comprising: reading means for reading the information recording medium thereby obtaining a read signal; demodulating means for demodulating the read signal thereby obtaining a demodulated signal; detecting means for detecting, from the demodulated signal, the text group; and displaying means for displaying information corresponding to at least a portion of the text information within the text group. 8. The apparatus according to claim 6, wherein the record information piece comprises video information, audio information and sub-picture information recorded in a multiplexed manner, the apparatus further comprising: a video decoder for decoding the video information; an audio decoder for decoding the audio information; and a sub-picture decoder for decoding the sub-picture information. | 0.5 |
6,101,532 | 12 | 15 | 12. A system according to claim 10, wherein when the message is posted, said server adds an identification code to a quotation sentence which cites said posted message, posts the message into said database, and specifies a duplicated portion of the message from said series of messages by using said identification code. | 12. A system according to claim 10, wherein when the message is posted, said server adds an identification code to a quotation sentence which cites said posted message, posts the message into said database, and specifies a duplicated portion of the message from said series of messages by using said identification code. 15. A system according to claim 12, wherein when the message transmitted from said client is posted into said database, said server posts the message into a message list and stores information for related subject with the other messages into said message list, and wherein said client has display means, said display means displays a message tree based on said message list, and when responding to the message displayed in said message tree by an instruction from the user, said display means adds said identification code to said quotation sentence from the message posted in said database and displays. | 0.5 |
7,676,358 | 1 | 10 | 1. A method to process a document, comprising: partitioning, with a tokenizer operating on at least one computer, document text separated by spaces into a plurality of tokens based on the spaces; identifying, with a token processing unit operating on at least one computer, tokens to be ignored and not considered; determining, with the token processing unit, that a first token considered of the plurality of tokens comprises a chemical name fragment, wherein determining comprises: examining syntax of the first token, examining context of the first token with respect to at least one adjacent token of the plurality of tokens, and taking into account the syntax and the context, applying to the first token a plurality of regular expressions, rules, and a plurality of dictionaries comprised of a prefix dictionary, and a suffix dictionary to recognize the chemical name fragments; adding, with the token processing unit, the recognized chemical name fragment to a vector of chemical name fragments, where the chemical name fragment is identified by a vector index variable; combining, with the token processing unit, the recognized chemical name fragment with at least one of the adjacent tokens that are determined to be a chemical name fragment into a complete chemical name, where combining comprises: initializing the chemical name fragment vector index variable, incrementing the chemical name fragment vector index variable, where the incrementing continues at least until no chemical name fragments remain; setting a string combination to include the chemical name fragments identified by the initialized and incremented chemical name fragment vector index variables, and adding the string combination to a vector c as the complete chemical name; assigning, with a sentence parser unit operating on at least one computer, the complete chemical name with one part of speech; and storing in a memory the complete chemical name assigned with the one part of speech. | 1. A method to process a document, comprising: partitioning, with a tokenizer operating on at least one computer, document text separated by spaces into a plurality of tokens based on the spaces; identifying, with a token processing unit operating on at least one computer, tokens to be ignored and not considered; determining, with the token processing unit, that a first token considered of the plurality of tokens comprises a chemical name fragment, wherein determining comprises: examining syntax of the first token, examining context of the first token with respect to at least one adjacent token of the plurality of tokens, and taking into account the syntax and the context, applying to the first token a plurality of regular expressions, rules, and a plurality of dictionaries comprised of a prefix dictionary, and a suffix dictionary to recognize the chemical name fragments; adding, with the token processing unit, the recognized chemical name fragment to a vector of chemical name fragments, where the chemical name fragment is identified by a vector index variable; combining, with the token processing unit, the recognized chemical name fragment with at least one of the adjacent tokens that are determined to be a chemical name fragment into a complete chemical name, where combining comprises: initializing the chemical name fragment vector index variable, incrementing the chemical name fragment vector index variable, where the incrementing continues at least until no chemical name fragments remain; setting a string combination to include the chemical name fragments identified by the initialized and incremented chemical name fragment vector index variables, and adding the string combination to a vector c as the complete chemical name; assigning, with a sentence parser unit operating on at least one computer, the complete chemical name with one part of speech; and storing in a memory the complete chemical name assigned with the one part of speech. 10. A method as in claim 1 , comprising an initial step of tokenizing the document to provide a sequence of tokens. | 0.781369 |
9,208,140 | 1 | 8 | 1. A method for modifying word annotations in an annotated text base, comprising: creating, by a processor, an index of word annotations by: creating an annotation array that indexes annotations assigned to terms in the annotated text base, the annotation array comprising annotations and references for each annotation from the annotated text base; and creating an index that indexes the annotated terms in the annotated text base, the index comprising a list of all words in the annotated text base and for each word, the assigned annotation and a list of references; modifying a select annotation to an updated annotation; modifying all annotation occurrences in the index that match the select annotation, to the updated annotation; and updating the annotation array with a reference to the modified occurrences of the select annotation in the annotated text base. | 1. A method for modifying word annotations in an annotated text base, comprising: creating, by a processor, an index of word annotations by: creating an annotation array that indexes annotations assigned to terms in the annotated text base, the annotation array comprising annotations and references for each annotation from the annotated text base; and creating an index that indexes the annotated terms in the annotated text base, the index comprising a list of all words in the annotated text base and for each word, the assigned annotation and a list of references; modifying a select annotation to an updated annotation; modifying all annotation occurrences in the index that match the select annotation, to the updated annotation; and updating the annotation array with a reference to the modified occurrences of the select annotation in the annotated text base. 8. The method of claim 1 further comprising checking in the index to determine if there is already stored a reference to a word in the annotated text based. | 0.785124 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.