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
|
|---|---|---|---|---|---|
8,495,059 | 4 | 7 | 4. The method of claim 1 further comprising: after initiating the conducting a search of the at least two components and before concluding the search, displaying at least one of the at least one search result. | 4. The method of claim 1 further comprising: after initiating the conducting a search of the at least two components and before concluding the search, displaying at least one of the at least one search result. 7. The method of claim 4 further comprising: after the concluding the search, displaying all of the search results. | 0.706633 |
7,729,904 | 8 | 9 | 8. The portable speech processing device of claim 7 , wherein the sentence is compared against the candidate set of potential sentences by examining noun phrases. | 8. The portable speech processing device of claim 7 , wherein the sentence is compared against the candidate set of potential sentences by examining noun phrases. 9. The portable speech processing device of claim 8 , wherein the candidate set of potential sentences are determined in part by a context dictionary loaded by the natural language engine in response to an operating environment presented by the system to a user. | 0.5 |
9,686,595 | 12 | 22 | 12. A system for providing audio-based guidance in a media guide, the system comprising control circuitry configured to: receive a plurality of listings, wherein each of the plurality of listings is associated with a respective media item of a plurality of media items, the plurality of media items including a first media item having audio-friendly characteristics that make media content desirable to users who have difficulties viewing or understanding a visual portion of the content, the plurality of media items including a second media item not having the audio-friendly characteristics; generate for display the plurality of listings; receive a first user command to navigate to a listing associated with the first media item; automatically determine that the first media item has the audio-friendly characteristics; and play an audio notification when the first media item is determined to have the audio-friendly characteristics. | 12. A system for providing audio-based guidance in a media guide, the system comprising control circuitry configured to: receive a plurality of listings, wherein each of the plurality of listings is associated with a respective media item of a plurality of media items, the plurality of media items including a first media item having audio-friendly characteristics that make media content desirable to users who have difficulties viewing or understanding a visual portion of the content, the plurality of media items including a second media item not having the audio-friendly characteristics; generate for display the plurality of listings; receive a first user command to navigate to a listing associated with the first media item; automatically determine that the first media item has the audio-friendly characteristics; and play an audio notification when the first media item is determined to have the audio-friendly characteristics. 22. The system of claim 12 , wherein the control circuitry is further configured to identify an audio-friendly characteristics tag from data associated with the first media item. | 0.692042 |
7,788,590 | 1 | 5 | 1. A method of providing information associated with a selected item in an electronic document, comprising: receiving a selection of one of a text item, a display item, and a selectable object that is contained in an electronic document displayed in a first user interface of an application for processing the electronic document; passing data representing the selected item to an information source; at the information source, parsing a data source for information associated with the selection; returning the information associated with the selection, wherein the information is commonly presented by another application; if the information associated with the selection is received from more than one information source, displaying the information in a second lightweight user interface in a plurality of sections, where information from a first information source is displayed in a first section, and where information from a second information source is displayed in a second section; prioritizing the plurality of sections of information according to a preferred display orientation, where a most preferred section is displayed in a first orientation and a least preferred section is displayed in a second orientation, wherein the first orientation has a size that is larger than the second orientation and the second orientation comprises: a full display orientation that displays all of the least preferred section when available display space in the second lightweight user interface allows for full display of both the most preferred section and the least preferred section; a truncated display orientation that truncates a portion of the least preferred section so that only a portion of the information that will fit in the available display space provided in the second lightweight user interface is displayed if all of the information associated with the selection will not fit in an available display space provided in the second lightweight user interface; and a collapsed orientation that prevents viewing of the least preferred section when available display space in the second lightweight user interface disallows for full display of both the most preferred section and the least preferred section, wherein selection of a selectable control of the collapsed section causes display of the least preferred information and simultaneously causes collapse of the presently displayed information to prevent viewing of the information of the most preferred section; displaying the second lightweight user interface over the first user interface in proximity to the selection; and displaying the information associated with the selection in the second lightweight user interface without activating a third user interface for the other application. | 1. A method of providing information associated with a selected item in an electronic document, comprising: receiving a selection of one of a text item, a display item, and a selectable object that is contained in an electronic document displayed in a first user interface of an application for processing the electronic document; passing data representing the selected item to an information source; at the information source, parsing a data source for information associated with the selection; returning the information associated with the selection, wherein the information is commonly presented by another application; if the information associated with the selection is received from more than one information source, displaying the information in a second lightweight user interface in a plurality of sections, where information from a first information source is displayed in a first section, and where information from a second information source is displayed in a second section; prioritizing the plurality of sections of information according to a preferred display orientation, where a most preferred section is displayed in a first orientation and a least preferred section is displayed in a second orientation, wherein the first orientation has a size that is larger than the second orientation and the second orientation comprises: a full display orientation that displays all of the least preferred section when available display space in the second lightweight user interface allows for full display of both the most preferred section and the least preferred section; a truncated display orientation that truncates a portion of the least preferred section so that only a portion of the information that will fit in the available display space provided in the second lightweight user interface is displayed if all of the information associated with the selection will not fit in an available display space provided in the second lightweight user interface; and a collapsed orientation that prevents viewing of the least preferred section when available display space in the second lightweight user interface disallows for full display of both the most preferred section and the least preferred section, wherein selection of a selectable control of the collapsed section causes display of the least preferred information and simultaneously causes collapse of the presently displayed information to prevent viewing of the information of the most preferred section; displaying the second lightweight user interface over the first user interface in proximity to the selection; and displaying the information associated with the selection in the second lightweight user interface without activating a third user interface for the other application. 5. The method of claim 1 , wherein passing data representing the selection to an information source includes passing the data representing the selection to a dictionary source for obtaining a definition of the selection. | 0.826498 |
8,682,728 | 1 | 13 | 1. A network advertising system, comprising: a primary advertiser database that stores a list of primary advertisers willing to pay a secondary advertiser to (i) embed advertising content into electronic media to which access by a potential customer is controlled by the secondary advertiser, and (ii) make the electronic media with the embedded advertising content viewable by the potential customer in a manner that allows the potential customer to be exposed to an advertisement; a tagging unit that allows a secondary advertiser to embed the advertising content by tagging an item within the electronic media by indicating an area on or near the item, the tagging causing either or both of (i) a visual indicator and (ii) a tag label to be displayed on the electronic media, the tag label being text generated by the secondary advertiser; a text block unit that receives a search query from the secondary advertiser, retrieves primary advertiser information from the primary advertiser database in response to the search query and displays the primary advertiser information to the secondary advertiser, receives the secondary advertiser's selection of the primary advertiser information, and, after the item has been tagged by the secondary advertiser, associates the tagged item with a link of the primary advertiser in response to the selection of the primary advertiser information, wherein no advertisement other than the tag label or visual indicator is displayed with the electronic media, and wherein the link directs the potential customer to a specific site selected by the secondary advertiser; a revenue-generating transaction database that records secondary advertising events for which the primary advertiser is willing to pay; and an accounting unit that tracks what is owed by the primary advertiser based on the events recorded by the revenue-generating transaction database. | 1. A network advertising system, comprising: a primary advertiser database that stores a list of primary advertisers willing to pay a secondary advertiser to (i) embed advertising content into electronic media to which access by a potential customer is controlled by the secondary advertiser, and (ii) make the electronic media with the embedded advertising content viewable by the potential customer in a manner that allows the potential customer to be exposed to an advertisement; a tagging unit that allows a secondary advertiser to embed the advertising content by tagging an item within the electronic media by indicating an area on or near the item, the tagging causing either or both of (i) a visual indicator and (ii) a tag label to be displayed on the electronic media, the tag label being text generated by the secondary advertiser; a text block unit that receives a search query from the secondary advertiser, retrieves primary advertiser information from the primary advertiser database in response to the search query and displays the primary advertiser information to the secondary advertiser, receives the secondary advertiser's selection of the primary advertiser information, and, after the item has been tagged by the secondary advertiser, associates the tagged item with a link of the primary advertiser in response to the selection of the primary advertiser information, wherein no advertisement other than the tag label or visual indicator is displayed with the electronic media, and wherein the link directs the potential customer to a specific site selected by the secondary advertiser; a revenue-generating transaction database that records secondary advertising events for which the primary advertiser is willing to pay; and an accounting unit that tracks what is owed by the primary advertiser based on the events recorded by the revenue-generating transaction database. 13. The network advertising system of claim 1 , wherein the secondary advertising events include one or more of the group consisting of (i) an indication that a potential customer has been exposed to the advertising content, (ii) an indication that the primary advertiser information has been displayed as a search result to the secondary advertiser, (iii) an indication that a potential customer has completed a purchase of a product based on the advertising content and (iv) an indication that the secondary advertiser has associated or maintained the association of an item with the advertising content. | 0.540909 |
8,539,359 | 77 | 78 | 77. A non-abstract machine system that includes a user-accessible presentation device and is structured to repeatedly automatically cause a flow through the user-accessible presentation device of a stream of presentable and with each of the automatic repeats, more up to date invitations and/or suggestions that have been automatically repeatedly generated in response to automatically repeated detections of recent attention focusing activities of a first user of the machine system on content presented and thus available to the first user, the automatically repeated detections of recent attention focusing activities being ones that are transparently detected by background operations of the machine system without need for diverted focusing of attention by the first user directed to aiding the background detecting of the automatically repeatedly detected recent attention focusing activities of the user, where the respective invitations and/or suggestions, if presented, are directly convertible by the first user into respective ones of immediately joined-with forums and/or immediately followed upon suggestions, each of the forums being one that has at least one other user co-invited to it or already participating in the forum, the machine system including: a presentation format controller that is configured to determine or control at least one of: whether or not a given, flowed-through invitation or suggestion is at all presented to the first user; when a given, flowed-through invitation or suggestion is presented to the first user; what order of presentation is used for multiple ones of presented invitations and/or suggestions of the caused flow; at what rate multiple ones of presented invitations and/or suggestions are automatically presented to the first user; and in what format a given one or more of presented ones of the invitations and/or suggestions are automatically presented to the first user; wherein at least a portion of the machine system includes a data processing machine; and wherein said recent attention focusing activities of the first user occurred no more than at least one of: 3 hours prior to said presentation to the first user of the respective invitations and/or suggestions, if presented; and a determined time duration prior to said presentation to the first user of the respective invitations and/or suggestions, if presented, the determined time duration being determined based on a currently active profile characterizing the first user. | 77. A non-abstract machine system that includes a user-accessible presentation device and is structured to repeatedly automatically cause a flow through the user-accessible presentation device of a stream of presentable and with each of the automatic repeats, more up to date invitations and/or suggestions that have been automatically repeatedly generated in response to automatically repeated detections of recent attention focusing activities of a first user of the machine system on content presented and thus available to the first user, the automatically repeated detections of recent attention focusing activities being ones that are transparently detected by background operations of the machine system without need for diverted focusing of attention by the first user directed to aiding the background detecting of the automatically repeatedly detected recent attention focusing activities of the user, where the respective invitations and/or suggestions, if presented, are directly convertible by the first user into respective ones of immediately joined-with forums and/or immediately followed upon suggestions, each of the forums being one that has at least one other user co-invited to it or already participating in the forum, the machine system including: a presentation format controller that is configured to determine or control at least one of: whether or not a given, flowed-through invitation or suggestion is at all presented to the first user; when a given, flowed-through invitation or suggestion is presented to the first user; what order of presentation is used for multiple ones of presented invitations and/or suggestions of the caused flow; at what rate multiple ones of presented invitations and/or suggestions are automatically presented to the first user; and in what format a given one or more of presented ones of the invitations and/or suggestions are automatically presented to the first user; wherein at least a portion of the machine system includes a data processing machine; and wherein said recent attention focusing activities of the first user occurred no more than at least one of: 3 hours prior to said presentation to the first user of the respective invitations and/or suggestions, if presented; and a determined time duration prior to said presentation to the first user of the respective invitations and/or suggestions, if presented, the determined time duration being determined based on a currently active profile characterizing the first user. 78. The machine system of claim 77 wherein, the presentation format controller is configured to cause display of a moving flow of icons respectively representing presented ones of the invitations and/or suggestions. | 0.898871 |
9,021,055 | 6 | 10 | 6. A computer program product residing on a non-transitory processor-readable medium and comprising processor-readable instructions configured to cause a processor to: receive, from a web service client computer system, a request for a conforming web service policy document, wherein: the conforming web service policy document is required to conform to the web service description language; the conforming web service policy document specifies security requirements between the web service computer and the web service client computer system; generate, dynamically in response to the request from the web service client computer system, the conforming web service policy document using a nonconforming web service policy document, wherein: the nonconforming web service policy document expressed in the web service description language and comprising at least one element conforming to web service description language and at least one element not conforming to the web service description language including at least a generating function unsupported by the web service description language that is used to generate a conforming document based on the request and the nonconforming web service policy document, the generating function comprising at least a silent element for identifying if another element should be included in the conforming document; the nonconforming web service policy document specifies security requirements between the web service computer and the web service client computer system; the nonconforming web service policy document is stored on the web service computer system; the content of the conforming web service policy document is generated from the nonconforming web service policy document at least partially based on a context of the web service client computer system; cause the conforming web service policy document to be transmitted to the web service client computer system; and enforce, with the web service client computer system, security requirements specified in the nonconforming web service policy document, wherein: the nonconforming web service policy document comprises an enforcing function unsupported by the web service description language that is used to affect how web service policies are processed by the web service, the enforcing function comprising at least one of: a sequence element for identifying an order in which assertions are to be evaluated, or a guard element for specifying which elements to enforce based on a context of the client; the enforcing function that is unsupported by the web service description language is utilized for enforcement of the conforming web service policy document by a web service computer system; and the conforming web service policy document comprises sufficient information for the web service client computer system to comply with the security requirements specified in nonconforming web service policy document. | 6. A computer program product residing on a non-transitory processor-readable medium and comprising processor-readable instructions configured to cause a processor to: receive, from a web service client computer system, a request for a conforming web service policy document, wherein: the conforming web service policy document is required to conform to the web service description language; the conforming web service policy document specifies security requirements between the web service computer and the web service client computer system; generate, dynamically in response to the request from the web service client computer system, the conforming web service policy document using a nonconforming web service policy document, wherein: the nonconforming web service policy document expressed in the web service description language and comprising at least one element conforming to web service description language and at least one element not conforming to the web service description language including at least a generating function unsupported by the web service description language that is used to generate a conforming document based on the request and the nonconforming web service policy document, the generating function comprising at least a silent element for identifying if another element should be included in the conforming document; the nonconforming web service policy document specifies security requirements between the web service computer and the web service client computer system; the nonconforming web service policy document is stored on the web service computer system; the content of the conforming web service policy document is generated from the nonconforming web service policy document at least partially based on a context of the web service client computer system; cause the conforming web service policy document to be transmitted to the web service client computer system; and enforce, with the web service client computer system, security requirements specified in the nonconforming web service policy document, wherein: the nonconforming web service policy document comprises an enforcing function unsupported by the web service description language that is used to affect how web service policies are processed by the web service, the enforcing function comprising at least one of: a sequence element for identifying an order in which assertions are to be evaluated, or a guard element for specifying which elements to enforce based on a context of the client; the enforcing function that is unsupported by the web service description language is utilized for enforcement of the conforming web service policy document by a web service computer system; and the conforming web service policy document comprises sufficient information for the web service client computer system to comply with the security requirements specified in nonconforming web service policy document. 10. The computer program product of claim 6 , wherein the enforcing function unsupported by the web service description language further included a category element that categorizes other elements in the nonconforming web service policy document. | 0.59 |
9,342,487 | 10 | 14 | 10. A speech bubble layout system comprising: a context module, executed with at least one processor, to: determine geometric constraints for speech bubbles within an image, the image including characters; determine features of the characters in the image; receive a list of speech content for the characters; and identify a conversation order of the characters based on an order of the list of speech content; and a layout module to: generate a layout of the speech bubbles that defines a location and size of each speech bubble, with respect to the image, based on the geometric constraints, the features of the characters, the speech content, and the conversation order. | 10. A speech bubble layout system comprising: a context module, executed with at least one processor, to: determine geometric constraints for speech bubbles within an image, the image including characters; determine features of the characters in the image; receive a list of speech content for the characters; and identify a conversation order of the characters based on an order of the list of speech content; and a layout module to: generate a layout of the speech bubbles that defines a location and size of each speech bubble, with respect to the image, based on the geometric constraints, the features of the characters, the speech content, and the conversation order. 14. The speech bubble layout system of claim 10 , wherein the layout module is configured to: receive input that modifies the speech content of the characters; and adjust the layout of the speech bubbles based on the modified speech content of the characters. | 0.777491 |
8,156,508 | 15 | 16 | 15. The non-transitory computer-accessible memory medium of claim 11 , wherein said executing comprises verifying whether the process ontology (PO) comprises a more specific applicable version of the task and, if so, executing the more specific applicable version of the task with the resolved parameter values. | 15. The non-transitory computer-accessible memory medium of claim 11 , wherein said executing comprises verifying whether the process ontology (PO) comprises a more specific applicable version of the task and, if so, executing the more specific applicable version of the task with the resolved parameter values. 16. The non-transitory computer-accessible memory medium of claim 15 , wherein there are more than one more specific tasks and wherein the verification step comprises, for each of the one or more specific tasks, examining one or more constraints for determining the applicability of the more specific task. | 0.5 |
8,671,353 | 34 | 36 | 34. A computer system having a computer that executes a computer program causing the computer system to perform a method comprising: causing a display of a hub corresponding to a primary item in a position on at least one computer display; identifying a predetermined number of secondary items associated with the primary item; causing a display of a plurality of primary nodes around the hub on the at least one computer display, each of the plurality of primary nodes corresponding to an individual secondary item; causing a display of a plurality of primary tethers, each of the plurality of primary tethers extending between the hub and one of the plurality of primary nodes; accepting a selection of at least one primary node; identifying a predetermined number of tertiary items associated with the secondary item corresponding to the selected primary node; repositioning the hub and at least one of the primary nodes on the at least one computer display, wherein the selected primary node is repositioned to the position; causing a display of a plurality of secondary nodes around the selected primary node, each of the plurality of secondary nodes corresponding to an individual tertiary item; causing a display of a plurality of secondary tethers, each of the plurality of secondary tethers extending between the selected primary node and one of the plurality of secondary nodes; accepting a selection of a location on the at least one computer display; and moving at least one of the hub, one of the primary nodes or one of the secondary nodes in a direction parallel to a line extending between the position and the location on the at least one computer display, and in a distance equal to the distance between the position and the location on the computer display. | 34. A computer system having a computer that executes a computer program causing the computer system to perform a method comprising: causing a display of a hub corresponding to a primary item in a position on at least one computer display; identifying a predetermined number of secondary items associated with the primary item; causing a display of a plurality of primary nodes around the hub on the at least one computer display, each of the plurality of primary nodes corresponding to an individual secondary item; causing a display of a plurality of primary tethers, each of the plurality of primary tethers extending between the hub and one of the plurality of primary nodes; accepting a selection of at least one primary node; identifying a predetermined number of tertiary items associated with the secondary item corresponding to the selected primary node; repositioning the hub and at least one of the primary nodes on the at least one computer display, wherein the selected primary node is repositioned to the position; causing a display of a plurality of secondary nodes around the selected primary node, each of the plurality of secondary nodes corresponding to an individual tertiary item; causing a display of a plurality of secondary tethers, each of the plurality of secondary tethers extending between the selected primary node and one of the plurality of secondary nodes; accepting a selection of a location on the at least one computer display; and moving at least one of the hub, one of the primary nodes or one of the secondary nodes in a direction parallel to a line extending between the position and the location on the at least one computer display, and in a distance equal to the distance between the position and the location on the computer display. 36. The computer system according to claim 34 , wherein the method further comprises: accepting an entry of a gesture on the at least one computer display, wherein the gesture includes at least one of a dimension or a direction; and moving at least one of the hub, one of the primary nodes or one of the secondary nodes at least one of by the dimension or in the direction. | 0.5 |
8,769,454 | 26 | 27 | 26. The system of claim 15 , wherein the at least one processor is further configured to categorize the design violation patterns into at least one design violation pattern category. | 26. The system of claim 15 , wherein the at least one processor is further configured to categorize the design violation patterns into at least one design violation pattern category. 27. The system of claim 26 , wherein the at least one design violation pattern category comprises at least one of a simulation and/or synthesis mismatches category and a design intent mismatch category. | 0.605469 |
9,928,231 | 1 | 8 | 1. A method for determining topics of short text messages, comprising: by a computer, obtaining distributed vector representations of words in a vocabulary identified in a corpus comprising a plurality of training short text messages, the distributed vector representations being obtained by processing windows of the corpus having a context window fixed length; by the computer, estimating a plurality of Gaussian components of a Gaussian mixture model of the corpus using the distributed vector representations and using bottleneck features obtained using neural networks, the Gaussian components representing corpus topics; by the computer, receiving a sample short text message comprising a subset of the words in the vocabulary; and by the computer, determining a topic of the sample short text message based on a posterior distribution over the corpus topics for the sample short text message, the posterior distribution obtained using the Gaussian mixture model. | 1. A method for determining topics of short text messages, comprising: by a computer, obtaining distributed vector representations of words in a vocabulary identified in a corpus comprising a plurality of training short text messages, the distributed vector representations being obtained by processing windows of the corpus having a context window fixed length; by the computer, estimating a plurality of Gaussian components of a Gaussian mixture model of the corpus using the distributed vector representations and using bottleneck features obtained using neural networks, the Gaussian components representing corpus topics; by the computer, receiving a sample short text message comprising a subset of the words in the vocabulary; and by the computer, determining a topic of the sample short text message based on a posterior distribution over the corpus topics for the sample short text message, the posterior distribution obtained using the Gaussian mixture model. 8. The method of claim 1 wherein the plurality of training short text messages has an average text length of between 12 and 16 words. | 0.862033 |
8,458,207 | 1 | 5 | 1. One or more computer-readable media, the one or more computer-readable media not consisting of a propagating signal, the one or more computer-readable media comprising computer-executable instructions for providing search results, the computer-executable instructions directed to steps comprising: receiving, by a search engine, a search string comprising search terms; identifying pages relevant to the search string; for each of the identified pages relevant to the search string: obtaining a snippet for the corresponding identified page, the snippet is an excerpt from the corresponding identified page, the snippet, generated by searching a database, illustrates relevance of the corresponding identified page to the search string; determining that the snippet does not contain search terms of the search string, obtaining reference information comprising first anchor text of a link to the corresponding identified page from a web page other than the corresponding identified page, the first anchor text is used by the web page other than the corresponding identified page to reference the corresponding identified page; and displaying links to each identified page with the snippet and the obtained reference information for the identified page, wherein the reference information further comprises a second anchor text used by another page to link to the at least one of the identified pages, wherein the second anchor text is different from the first anchor text, and wherein the second anchor text is relevant to the search string. | 1. One or more computer-readable media, the one or more computer-readable media not consisting of a propagating signal, the one or more computer-readable media comprising computer-executable instructions for providing search results, the computer-executable instructions directed to steps comprising: receiving, by a search engine, a search string comprising search terms; identifying pages relevant to the search string; for each of the identified pages relevant to the search string: obtaining a snippet for the corresponding identified page, the snippet is an excerpt from the corresponding identified page, the snippet, generated by searching a database, illustrates relevance of the corresponding identified page to the search string; determining that the snippet does not contain search terms of the search string, obtaining reference information comprising first anchor text of a link to the corresponding identified page from a web page other than the corresponding identified page, the first anchor text is used by the web page other than the corresponding identified page to reference the corresponding identified page; and displaying links to each identified page with the snippet and the obtained reference information for the identified page, wherein the reference information further comprises a second anchor text used by another page to link to the at least one of the identified pages, wherein the second anchor text is different from the first anchor text, and wherein the second anchor text is relevant to the search string. 5. The computer-readable media of claim 1 comprising further computer-executable instructions directed to selecting the first anchor text from among multiple anchor text wordings based in part on a static rank of one or more referencing pages, the one or more referencing pages using the first anchor text to link to the at least one of the identified pages. | 0.561275 |
8,504,507 | 14 | 19 | 14. A computer-implemented method for performing a sentiment analysis based on an estimated actual age, the method comprising: identifying, by a computer, a set of related members for a first member, wherein the first member and each member in the set of related members are members of a social networking website, and wherein each member in the set of related members is connected to the first member in the social network website; examining, by the computer, age information associated with one or more members in the set of related members in the set of related members; when a threshold number of members in the set of related members have an estimated actual age within a certain age range, estimating, by the computer, an actual age of the first member based on the estimated actual age of the members in the set of related members; and using, by the computer, the member's estimated actual age as an input to a sentiment analysis application for determining sentiments for a demographic that includes the member's age range. | 14. A computer-implemented method for performing a sentiment analysis based on an estimated actual age, the method comprising: identifying, by a computer, a set of related members for a first member, wherein the first member and each member in the set of related members are members of a social networking website, and wherein each member in the set of related members is connected to the first member in the social network website; examining, by the computer, age information associated with one or more members in the set of related members in the set of related members; when a threshold number of members in the set of related members have an estimated actual age within a certain age range, estimating, by the computer, an actual age of the first member based on the estimated actual age of the members in the set of related members; and using, by the computer, the member's estimated actual age as an input to a sentiment analysis application for determining sentiments for a demographic that includes the member's age range. 19. The method of claim 14 , wherein the threshold number includes one or more of: a minimum number of related members in the set of related members, and a minimum fraction of the related members in the set of related members. | 0.5 |
8,700,612 | 15 | 27 | 15. A non-transitory computer-readable storage medium storing instructions that, when executed, cause a processing device to perform a method comprising: receiving a search input; selecting a first cell within a matrix of cells in response to the search input, wherein each cell within the matrix of cells includes searchable data, the first cell is selected based upon the first cell including searchable data related to the search input, and the first cell further includes a first link assigned a causal context relationship and providing a navigation link from the first cell to a causal context cell corresponding to the first cell, a second link assigned an inclusion contextual relationship and providing a navigation link from the first cell to an inclusion context cell corresponding to the first cell, a third link assigned a temporal contextual relationship and providing a navigation link from the first cell to a temporal context cell corresponding to the first cell, and fourth link assigned a spatial contextual relationship and providing a navigation link from the first cell to a spatial context cell corresponding to the first cell; displaying, in response to the search input, a portion of the searchable data of the first cell and first, second, third, and fourth selectable objects, the first selectable object corresponding to the first link, the second selectable object corresponding to the second link, the third selectable object corresponding to the third link, and the fourth selectable object corresponding to the fourth link; receiving selection of the first, second, third, or fourth of the plurality of selectable objects; and utilizing the corresponding link to display a context cell corresponding to the first cell, wherein selection of a first of the plurality of selectable objects results in the computer utilizing the first link to select and display the causal context cell corresponding to the first cell, the display of the causal context cell including displaying a subject of the first cell as causing or influencing one or more subjects of other cells or as being caused or influenced by one or more subjects of other cells, wherein selection of a second of the plurality of selectable objects results in the computer utilizing the second link to select and display the inclusion context cell corresponding to the first cell, the display of the inclusion context cell including displaying the subject of the first cell within a category along with subjects of other cells included within the category, wherein selection of a third of the plurality of selectable objects results in the computer utilizing the third link to select and display the temporal context cell corresponding to the first cell, the display of the temporal context cell including displaying the subject of the first cell within a timeline along with subjects of other cells of relevance within the timeline, wherein selection of a fourth of the plurality of selectable objects results in the computer utilizing the fourth link to select and display the spatial context cell corresponding to the first cell, the display of the spatial context cell including displaying a location corresponding to the subject of the first cell within a map, and when the received selection is of the first of the plurality of selectable objects, the method further comprising receiving a command to alter the zoom of the display of the corresponding portion of the data of the first cell and the first set of other data and, in response to the zoom command, adding or removing subjects that served as a cause of or influence upon the subject of the first cell, or adding or removing subjects that were caused or influenced by the subject of the first cell. | 15. A non-transitory computer-readable storage medium storing instructions that, when executed, cause a processing device to perform a method comprising: receiving a search input; selecting a first cell within a matrix of cells in response to the search input, wherein each cell within the matrix of cells includes searchable data, the first cell is selected based upon the first cell including searchable data related to the search input, and the first cell further includes a first link assigned a causal context relationship and providing a navigation link from the first cell to a causal context cell corresponding to the first cell, a second link assigned an inclusion contextual relationship and providing a navigation link from the first cell to an inclusion context cell corresponding to the first cell, a third link assigned a temporal contextual relationship and providing a navigation link from the first cell to a temporal context cell corresponding to the first cell, and fourth link assigned a spatial contextual relationship and providing a navigation link from the first cell to a spatial context cell corresponding to the first cell; displaying, in response to the search input, a portion of the searchable data of the first cell and first, second, third, and fourth selectable objects, the first selectable object corresponding to the first link, the second selectable object corresponding to the second link, the third selectable object corresponding to the third link, and the fourth selectable object corresponding to the fourth link; receiving selection of the first, second, third, or fourth of the plurality of selectable objects; and utilizing the corresponding link to display a context cell corresponding to the first cell, wherein selection of a first of the plurality of selectable objects results in the computer utilizing the first link to select and display the causal context cell corresponding to the first cell, the display of the causal context cell including displaying a subject of the first cell as causing or influencing one or more subjects of other cells or as being caused or influenced by one or more subjects of other cells, wherein selection of a second of the plurality of selectable objects results in the computer utilizing the second link to select and display the inclusion context cell corresponding to the first cell, the display of the inclusion context cell including displaying the subject of the first cell within a category along with subjects of other cells included within the category, wherein selection of a third of the plurality of selectable objects results in the computer utilizing the third link to select and display the temporal context cell corresponding to the first cell, the display of the temporal context cell including displaying the subject of the first cell within a timeline along with subjects of other cells of relevance within the timeline, wherein selection of a fourth of the plurality of selectable objects results in the computer utilizing the fourth link to select and display the spatial context cell corresponding to the first cell, the display of the spatial context cell including displaying a location corresponding to the subject of the first cell within a map, and when the received selection is of the first of the plurality of selectable objects, the method further comprising receiving a command to alter the zoom of the display of the corresponding portion of the data of the first cell and the first set of other data and, in response to the zoom command, adding or removing subjects that served as a cause of or influence upon the subject of the first cell, or adding or removing subjects that were caused or influenced by the subject of the first cell. 27. The non-transitory computer-readable medium of claim 15 , wherein the instructions, when executed, cause the processing device to perform a method further comprising: maintaining counters for one or more of (a) access of a cell, (b) access of one cell from another cell, (c) access of a group of cells, and (d) use of a contextual relationship of a cell; and determining to include data from a cell within the corresponding context cell based upon one or more of the counters. | 0.5 |
8,321,199 | 51 | 53 | 51. The method of claim 33 , wherein the first data comprises first text. | 51. The method of claim 33 , wherein the first data comprises first text. 53. The method of claim 51 , wherein the document further includes second text not included in the first coding. | 0.703704 |
8,359,576 | 1 | 9 | 1. A method executed by at least one processor, comprising: accessing one or more global temporal requirements of an application specified using one or more requirement templates from a library of requirement templates, the application comprising business logic; accessing a model of the application, the model comprising the business logic of the application and one or more use cases for the application; generating one or more symbolic requirements from one or more variables in one or more of the global temporal requirements specified as symbolic variables; generating one or more symbolic expressions and one or more search path conditions for one or more variables in one or more of the global temporal requirements with values from symbolic inputs derived from one or more use cases for the application; searching a state space of the application model with a model checker, the search comprising constructing and analyzing a graph of the state space and creating and maintaining one or more symbolic expressions and one or more search paths during the search; monitoring the search of the state space for events in the state space encompassed by the symbolic requirements and modifying the construction of the graph of the state space to record potential occurrence of one or more events encompassed by the symbolic requirements; solving one or more symbolic expressions from one or more of the symbolic requirements at one or more ends of one or more search paths in the graph of the state space to determine whether one or more of the symbolic requirements are valid; and communicating whether one or more of the symbolic requirements are valid for presentation to a user. | 1. A method executed by at least one processor, comprising: accessing one or more global temporal requirements of an application specified using one or more requirement templates from a library of requirement templates, the application comprising business logic; accessing a model of the application, the model comprising the business logic of the application and one or more use cases for the application; generating one or more symbolic requirements from one or more variables in one or more of the global temporal requirements specified as symbolic variables; generating one or more symbolic expressions and one or more search path conditions for one or more variables in one or more of the global temporal requirements with values from symbolic inputs derived from one or more use cases for the application; searching a state space of the application model with a model checker, the search comprising constructing and analyzing a graph of the state space and creating and maintaining one or more symbolic expressions and one or more search paths during the search; monitoring the search of the state space for events in the state space encompassed by the symbolic requirements and modifying the construction of the graph of the state space to record potential occurrence of one or more events encompassed by the symbolic requirements; solving one or more symbolic expressions from one or more of the symbolic requirements at one or more ends of one or more search paths in the graph of the state space to determine whether one or more of the symbolic requirements are valid; and communicating whether one or more of the symbolic requirements are valid for presentation to a user. 9. The method of claim 1 , further comprising: accessing source code of the application; accessing the use cases for the application; copying the business logic of the application from the source code; generating one or more rudimentary models or empty stubs for one or more components of the application that are not business logic; combining the copied business logic with the rudimentary models or the empty stubs to generate the model of the application. | 0.778101 |
10,114,965 | 10 | 15 | 10. A method of managing information comprising: providing an organization having an information management system comprising one or more rules and policy abstractions stored at a policy server to manage information of the organization, wherein a rule comprises an expression having a policy abstraction; within the organization, providing a user logged onto a client device and a confidential document managed by the information management system, wherein the client device comprises an interceptor code component and a policy engine code component executing on the client device, the interceptor code component resides within an operating system layer of the client device and is designed to intercept file system library requests received by an operating system installed on the client device, and the policy engine code component installed outside of the operating system layer receives information on the intercepted file system library requests; receiving at the information management system a profile of the client device, wherein the profile is based on the user and the client device; at the information management system, determining a subset of the one or more rules of the policy server relevant to the profile, wherein a rule is relevant to the profile when the client device is capable of supporting a syntax format of the rule; determining a first rule of the subset of the one or more rules in a first syntax format is not supported by the client device; converting the first rule into a second syntax format, wherein the client device supports the second syntax format but not the first syntax format; storing the subset of the one or more rules of the policy server on the client device including the first translated rule, wherein when an application program on a client device attempts to access the confidential document, the document access operation is initiated by the application program and detected by the interceptor code component, and the interceptor code component transfers handling of the document access operation to the policy engine code component; and in response to the operation, evaluating, based on received information associated with the operation from the engine code component installed outside of the operating system layer and the one or more rules, to determine whether to store information regarding the operation in a storage location. | 10. A method of managing information comprising: providing an organization having an information management system comprising one or more rules and policy abstractions stored at a policy server to manage information of the organization, wherein a rule comprises an expression having a policy abstraction; within the organization, providing a user logged onto a client device and a confidential document managed by the information management system, wherein the client device comprises an interceptor code component and a policy engine code component executing on the client device, the interceptor code component resides within an operating system layer of the client device and is designed to intercept file system library requests received by an operating system installed on the client device, and the policy engine code component installed outside of the operating system layer receives information on the intercepted file system library requests; receiving at the information management system a profile of the client device, wherein the profile is based on the user and the client device; at the information management system, determining a subset of the one or more rules of the policy server relevant to the profile, wherein a rule is relevant to the profile when the client device is capable of supporting a syntax format of the rule; determining a first rule of the subset of the one or more rules in a first syntax format is not supported by the client device; converting the first rule into a second syntax format, wherein the client device supports the second syntax format but not the first syntax format; storing the subset of the one or more rules of the policy server on the client device including the first translated rule, wherein when an application program on a client device attempts to access the confidential document, the document access operation is initiated by the application program and detected by the interceptor code component, and the interceptor code component transfers handling of the document access operation to the policy engine code component; and in response to the operation, evaluating, based on received information associated with the operation from the engine code component installed outside of the operating system layer and the one or more rules, to determine whether to store information regarding the operation in a storage location. 15. The method of claim 10 comprising: when the user attempts to perform an operation on the confidential document, evaluating the one or more rules at the client device, without evaluating rules stored at the policy server, to determine whether to store information regarding the attempted operation in a storage location. | 0.5 |
9,367,536 | 9 | 12 | 9. The method of claim 1 , further comprising: identifying a first set of nodes matching the inverse constraint; identifying a second set of nodes matching the one or more second query constraints; and generating one or more search results based on the first and second sets, wherein each search result corresponds to a node of the plurality of nodes. | 9. The method of claim 1 , further comprising: identifying a first set of nodes matching the inverse constraint; identifying a second set of nodes matching the one or more second query constraints; and generating one or more search results based on the first and second sets, wherein each search result corresponds to a node of the plurality of nodes. 12. The method of claim 9 , wherein each search result corresponds to a node of the first set of nodes that is connected by one or more selected edges referenced in the structured query to one or more of the nodes of the second set of nodes. | 0.629231 |
7,942,674 | 1 | 2 | 1. A method teaching new vocabulary words comprising: (i) providing a learning bracelet having a display for displaying vocabulary words attached to a strap configured to secure said learning bracelet to a student's arm; (ii) securing said learning bracelet to a student's arm so that said bracelet remains positioned on said student's arm for the duration in which said learning bracelet is worn and said display is visible by said student wearing said learning bracelet; (iii) assigning a word to a student wearing said learning bracelet from a lesson plan and displaying said word on said display of said learning bracelet so that said vocabulary word is visible to said student wearing said learning bracelet; (iv) using the vocabulary word as part of said lesson plan and reviewing said vocabulary word with the student as it is displayed on the students arm in full view; (v) removing said vocabulary word from said display and replacing it with a different word form said lesson plan; and (vi) repeating step (v) as necessary. | 1. A method teaching new vocabulary words comprising: (i) providing a learning bracelet having a display for displaying vocabulary words attached to a strap configured to secure said learning bracelet to a student's arm; (ii) securing said learning bracelet to a student's arm so that said bracelet remains positioned on said student's arm for the duration in which said learning bracelet is worn and said display is visible by said student wearing said learning bracelet; (iii) assigning a word to a student wearing said learning bracelet from a lesson plan and displaying said word on said display of said learning bracelet so that said vocabulary word is visible to said student wearing said learning bracelet; (iv) using the vocabulary word as part of said lesson plan and reviewing said vocabulary word with the student as it is displayed on the students arm in full view; (v) removing said vocabulary word from said display and replacing it with a different word form said lesson plan; and (vi) repeating step (v) as necessary. 2. The method of claim 1 wherein a lesson plan is provided which has a plurality of new vocabulary words to be assigned to students in a class that are wearing said learning bracelet. | 0.5 |
4,471,459 | 1 | 6 | 1. A method using a digital data processing means for separating words with acceptable spellings from words with nonacceptable spellings wherein each word comprises characters assigned character positions, character position in each word being assigned increasing values from one end of the word to the other, characters at the same number of positions from one end of each word being assigned the same value, the two words to be compared being called a query word and a candidate word, the method comprising the steps of: (a) comparing representation of a character in a given character position of the query word with representations of characters in the next lower character position, the same character position, and the next higher character position in the candidate word, and forming a compare type indication representing a match or a mismatch between such query word character and each of such candidate word characters under comparison; (b) changing the given character position of the query word under comparison in the preceding step of comparing to the next higher valued character position of the query word and repeating the preceding step of comparing at least once to form another compare type indication; and (c) processing and utilizing said compare type indications to thereby form a spelling classification indication for one of the words under comparison representing an acceptable spelling or a nonacceptable spelling. | 1. A method using a digital data processing means for separating words with acceptable spellings from words with nonacceptable spellings wherein each word comprises characters assigned character positions, character position in each word being assigned increasing values from one end of the word to the other, characters at the same number of positions from one end of each word being assigned the same value, the two words to be compared being called a query word and a candidate word, the method comprising the steps of: (a) comparing representation of a character in a given character position of the query word with representations of characters in the next lower character position, the same character position, and the next higher character position in the candidate word, and forming a compare type indication representing a match or a mismatch between such query word character and each of such candidate word characters under comparison; (b) changing the given character position of the query word under comparison in the preceding step of comparing to the next higher valued character position of the query word and repeating the preceding step of comparing at least once to form another compare type indication; and (c) processing and utilizing said compare type indications to thereby form a spelling classification indication for one of the words under comparison representing an acceptable spelling or a nonacceptable spelling. 6. A method according to claim 1 wherein first and second compare type indications are formed using, respectively, a query character in a first character position and a second query character in a second higher valued character position of the query word, the steps of processing and utilizing comprising the steps of: utilizing at least the first compare type indication for forming a first tentative spelling classification indication; and utilizing at least the second compare type indication and the first tentative spelling classification indication for forming a second tentative spelling classification indication. | 0.655383 |
8,909,697 | 9 | 10 | 9. An apparatus according to claim 8 , wherein the Javascript in the HTTP response includes a function call to a first random number function that uses the first random number algorithm. | 9. An apparatus according to claim 8 , wherein the Javascript in the HTTP response includes a function call to a first random number function that uses the first random number algorithm. 10. An apparatus according to claim 9 , wherein the algorithm different from the first random number algorithm is selected such that a sequence of values output by the algorithm different from the first random number algorithm when executed by a first one of two different apparatuses matches in whole or in part with a sequence of values output by the algorithm different from the first random number algorithm when executed by a second one of the two different apparatuses. | 0.5 |
9,542,373 | 5 | 7 | 5. An apparatus for compressing webpage text, comprising one or more processors, memory, and one or more program units stored in the memory and to be executed by the one or more processors, the one or more program units comprising: a language-environment-determining unit configured to, according to a webpage-opening request of a mobile terminal browser, obtain a current language environment of a terminal; a character-container-initializing unit configured to, according to the language environment, initialize a character container corresponding to the language environment, wherein: the character container is a storage space for storing related webpage data, and is implemented by applying for a “type” in software code to store the webpage data, when the language environment belongs to Latin languages, the character container is initialized to store utf-8 encoded data, and when the language environment does not belong to Latin languages, the character container is initialized to store utf-16 encoded data; a data-transmitting unit configured to receive webpage data that are requested; and a data-parsing-storing unit configured to parse the received webpage data, and merge and store the webpage data by using the corresponding character container, wherein the data-parsing-storing unit comprises: a content-optimized-storage unit configured to merge a plurality of text objects in source code of the webpage data that are originally stored in multiple character containers, and storing the merged plurality of text objects in the initialized character container, wherein the merged plurality of text objects are connected end to end, and an adapting unit configured to add an adapting index for the initialized character container, such that each of the plurality of text object is able to be retrieved in the initialized character container according to a corresponding index value of the adapting index wherein each of the plurality of text object is able to be retrieved in the initialized character container according to a corresponding index value of the adapting index without using the utf-8 encoded data or the utf-16 encoded data. | 5. An apparatus for compressing webpage text, comprising one or more processors, memory, and one or more program units stored in the memory and to be executed by the one or more processors, the one or more program units comprising: a language-environment-determining unit configured to, according to a webpage-opening request of a mobile terminal browser, obtain a current language environment of a terminal; a character-container-initializing unit configured to, according to the language environment, initialize a character container corresponding to the language environment, wherein: the character container is a storage space for storing related webpage data, and is implemented by applying for a “type” in software code to store the webpage data, when the language environment belongs to Latin languages, the character container is initialized to store utf-8 encoded data, and when the language environment does not belong to Latin languages, the character container is initialized to store utf-16 encoded data; a data-transmitting unit configured to receive webpage data that are requested; and a data-parsing-storing unit configured to parse the received webpage data, and merge and store the webpage data by using the corresponding character container, wherein the data-parsing-storing unit comprises: a content-optimized-storage unit configured to merge a plurality of text objects in source code of the webpage data that are originally stored in multiple character containers, and storing the merged plurality of text objects in the initialized character container, wherein the merged plurality of text objects are connected end to end, and an adapting unit configured to add an adapting index for the initialized character container, such that each of the plurality of text object is able to be retrieved in the initialized character container according to a corresponding index value of the adapting index wherein each of the plurality of text object is able to be retrieved in the initialized character container according to a corresponding index value of the adapting index without using the utf-8 encoded data or the utf-16 encoded data. 7. The apparatus according to claim 5 , wherein the language environment belonging to Latin languages comprises English, German, or French. | 0.794379 |
8,291,475 | 5 | 6 | 5. A method for communicating between a website and at least one untrusted website to create a web mashup on the website, comprising: creating a mediator frame for each untrusted website; creating an untrusted frame inside each of the mediator frames; and setting a domain property of the mediator frame and a domain property of the untrusted frame to a same document domain to allow the mediator frame and the untrusted frame to communicate directly and pass data from the untrusted website to the website and create the web mashup on the website. | 5. A method for communicating between a website and at least one untrusted website to create a web mashup on the website, comprising: creating a mediator frame for each untrusted website; creating an untrusted frame inside each of the mediator frames; and setting a domain property of the mediator frame and a domain property of the untrusted frame to a same document domain to allow the mediator frame and the untrusted frame to communicate directly and pass data from the untrusted website to the website and create the web mashup on the website. 6. The method of claim 5 , further comprising: determining that a browser uses a restrictive domain frame access; setting a document domain variable of each of the mediator frames and each of the untrusted frames such that the mediator frames and the untrusted frames have the same document domain to allow the mediator frames and the untrusted frames to communicate directly; and passing arbitrary script data between a top frame and each of the untrusted frames. | 0.5 |
9,495,376 | 19 | 20 | 19. The non-transitory computer-readable medium of claim 18 , where the one or more instructions to extract from the profile information include one or more instructions that, when executed by the one or more processors, further cause the one or more processors to: parse the profile information for the file metadata information. | 19. The non-transitory computer-readable medium of claim 18 , where the one or more instructions to extract from the profile information include one or more instructions that, when executed by the one or more processors, further cause the one or more processors to: parse the profile information for the file metadata information. 20. The non-transitory computer-readable medium of claim 19 , where the one or more instructions to parse the profile information include one or more instructions that, when executed by the one or more processors, further cause the one or more processors to: utilize a profile engine to parse the profile information; and utilize one or more handlers to extract the file identification information from the source system. | 0.5 |
10,108,617 | 1 | 2 | 1. A method of object retrieval from visual data, the method comprising: annotating at least one portion of the visual data with a context keyword corresponding to an object, wherein the annotating is performed responsive to recognition of the context keyword by performing speech recognition in audio data corresponding to the at least one portion of the visual data; receiving a query to retrieve the object, wherein the query comprises a query keyword associated with both the object and the context keyword; identifying the at least one portion of the visual data based on the context keyword; and searching for the object in the at least one portion of the visual data using an appearance model corresponding to the query keyword. | 1. A method of object retrieval from visual data, the method comprising: annotating at least one portion of the visual data with a context keyword corresponding to an object, wherein the annotating is performed responsive to recognition of the context keyword by performing speech recognition in audio data corresponding to the at least one portion of the visual data; receiving a query to retrieve the object, wherein the query comprises a query keyword associated with both the object and the context keyword; identifying the at least one portion of the visual data based on the context keyword; and searching for the object in the at least one portion of the visual data using an appearance model corresponding to the query keyword. 2. The method of claim 1 , wherein the appearance model, the corresponding query keyword, and the context keyword are predetermined. | 0.5 |
8,767,825 | 19 | 21 | 19. The method of claim 16 , wherein training the rate-distortion model and the scaling model comprises: selecting a set of videos from among the plurality of different videos of the video corpus; encoding the selected set of videos in multiple video formats; obtaining a plurality of rate-distortion data from the encoded videos; and estimating the rate-distortion model based on the obtained plurality of rate-distortion data; and estimating the scaling model based on the obtained plurality of rate-distortion data. | 19. The method of claim 16 , wherein training the rate-distortion model and the scaling model comprises: selecting a set of videos from among the plurality of different videos of the video corpus; encoding the selected set of videos in multiple video formats; obtaining a plurality of rate-distortion data from the encoded videos; and estimating the rate-distortion model based on the obtained plurality of rate-distortion data; and estimating the scaling model based on the obtained plurality of rate-distortion data. 21. The method of claim 19 , wherein estimating the scaling model comprises scaling the rate-distortion measurement with at least one of a resolution ratio and a frame rate ratio. | 0.528947 |
8,250,103 | 11 | 15 | 11. A storage medium readable by a computer, the storage medium storing a program of instructions executable by the computer to perform a function for image log management, the function comprising the steps of: (a) storing correspondence relationship information between an identifier of an input document subject to image forming processing, an identifier of one or more output documents resulting from the image forming processing of the input document, and an identifier of image log data of the one or more output documents; (b) storing the image log data of the one or more output documents; (c) inputting document disposal information including an identifier of a disposal document that has been disposed of; (d) changing, based on the document disposal information, a status of a document corresponding to the disposal document to disposal-complete; and (e) selecting, based on the status of the document corresponding to the document disposal information and based on one or more identifiers of input or output documents stored in the correspondence relationship information, image log data requiring deletion and executing deletion processing thereon, wherein when all of the one or more output documents, processed by the image forming processing with the disposal document as the input document, have their respective status changed to disposal-complete, the image log data of the one or more output documents is deleted. | 11. A storage medium readable by a computer, the storage medium storing a program of instructions executable by the computer to perform a function for image log management, the function comprising the steps of: (a) storing correspondence relationship information between an identifier of an input document subject to image forming processing, an identifier of one or more output documents resulting from the image forming processing of the input document, and an identifier of image log data of the one or more output documents; (b) storing the image log data of the one or more output documents; (c) inputting document disposal information including an identifier of a disposal document that has been disposed of; (d) changing, based on the document disposal information, a status of a document corresponding to the disposal document to disposal-complete; and (e) selecting, based on the status of the document corresponding to the document disposal information and based on one or more identifiers of input or output documents stored in the correspondence relationship information, image log data requiring deletion and executing deletion processing thereon, wherein when all of the one or more output documents, processed by the image forming processing with the disposal document as the input document, have their respective status changed to disposal-complete, the image log data of the one or more output documents is deleted. 15. The storage medium of claim 11 , wherein deletion processing is executed each time the document disposal information is entered. | 0.870841 |
7,664,639 | 19 | 23 | 19. A speech recognition method comprising: determining a location associated with a cellular telephone from roaming indications provided by said cellular telephone; selecting associated search information as a function of said location; and utilizing said selected associated search information when recognizing at least one incoming speech signal, further comprising utilizing the associated search information as a hard constraint for recognizing a telephone number defined by the incoming speech signal, the associated search information identifying hard and soft constraints and the speech recognition unit employing the identified hard constraints for recognizing spoken telephone digits in the incoming speech signal, such that the speech recognition unit: determines, based on the determined location, an expected speech pattern indicative of grouping of digits and placement of pauses in the incoming speech signal; and derives the soft constraints limiting an expected entered telephone number defined by the spoken telephone digits. | 19. A speech recognition method comprising: determining a location associated with a cellular telephone from roaming indications provided by said cellular telephone; selecting associated search information as a function of said location; and utilizing said selected associated search information when recognizing at least one incoming speech signal, further comprising utilizing the associated search information as a hard constraint for recognizing a telephone number defined by the incoming speech signal, the associated search information identifying hard and soft constraints and the speech recognition unit employing the identified hard constraints for recognizing spoken telephone digits in the incoming speech signal, such that the speech recognition unit: determines, based on the determined location, an expected speech pattern indicative of grouping of digits and placement of pauses in the incoming speech signal; and derives the soft constraints limiting an expected entered telephone number defined by the spoken telephone digits. 23. The method according to claim 19 and also comprising selecting said associated search information as a function also of operator identification. | 0.631841 |
8,527,517 | 19 | 22 | 19. A method for generating a knowledge base system comprising: providing in memory a knowledge base comprising a relations table and a plurality of linked tables, a first of the linked tables comprising a predicate table, the relations table including slots which, for each of a plurality of rows of the relations table, store a relation identifier, a predicate identifier, and first and second arguments of a respective relation; with a processor, for each a plurality of candidate relations to be added to the knowledge base, the candidate relation comprising first and second arguments and a predicate which links the arguments: determining if the predicate in the relation exists in a predicate table and if so, retrieving a corresponding predicate identifier from the predicate table, determining if argument types of the first and second arguments in the candidate relation match respective argument types that are encoded in the predicate identifier, the argument types being selected from a finite set of argument types; if the argument types of the first and second arguments in the candidate relation match the argument types encoded in the predicate identifier, for at least one of the arguments in the candidate relation, determining if the argument exists in a respective linked table corresponding to the encoded argument type, and if so retrieving its identifier, and if the argument does not exist, adding the respective argument as a new entry in the entity table with a respective identifier; and where a record does not yet exist in the records table which includes the candidate relation, creating a new record in the records table which includes the argument identifier of the at least one argument and the retrieved predicate identifier. | 19. A method for generating a knowledge base system comprising: providing in memory a knowledge base comprising a relations table and a plurality of linked tables, a first of the linked tables comprising a predicate table, the relations table including slots which, for each of a plurality of rows of the relations table, store a relation identifier, a predicate identifier, and first and second arguments of a respective relation; with a processor, for each a plurality of candidate relations to be added to the knowledge base, the candidate relation comprising first and second arguments and a predicate which links the arguments: determining if the predicate in the relation exists in a predicate table and if so, retrieving a corresponding predicate identifier from the predicate table, determining if argument types of the first and second arguments in the candidate relation match respective argument types that are encoded in the predicate identifier, the argument types being selected from a finite set of argument types; if the argument types of the first and second arguments in the candidate relation match the argument types encoded in the predicate identifier, for at least one of the arguments in the candidate relation, determining if the argument exists in a respective linked table corresponding to the encoded argument type, and if so retrieving its identifier, and if the argument does not exist, adding the respective argument as a new entry in the entity table with a respective identifier; and where a record does not yet exist in the records table which includes the candidate relation, creating a new record in the records table which includes the argument identifier of the at least one argument and the retrieved predicate identifier. 22. The method of claim 19 , wherein when the predicate identifier encodes an argument type for integers, an integer value is included in the second argument slot. | 0.707885 |
9,286,270 | 11 | 12 | 11. A non-transitory machine-readable medium that provides instructions which, when executed by a machine, cause said machine to perform operations including: displaying a first document on a display screen; receiving a command to insert an enhancement point at an anchor point in the first document; displaying the enhancement point at the anchor point in the first document; receiving a command to create a first enhancement implementation at the enhancement point, the command to create the first enhancement implementation defining a second document to be inserted in its entirety into the first enhancement implementation and establishing a first hierarchical relationship between the first document and the second document; displaying the first enhancement implementation of the first document entirely within the first document at a location based on the location of the anchor point in the first document, while continuing to display the first document; receiving a command to create a second enhancement implementation at the anchor point, the command to create the second enhancement implementation defining a third document to be inserted in its entirety into the second enhancement implementation and establishing a second hierarchical relationship between the first document and the third document; displaying the second enhancement implementation of the first document, while continuing to display the first document and the first enhancement implementation, wherein the second document or the third document is displayed at the anchor point depending on whether the second document or the third document, respectively, is selected to be active; performing a first action on the first document that is independent of the second document; and performing a second action on the second document that is independent of the first document, wherein each of the first action and the second action comprises at least one of a save operation, an activate operation and return to prior version operation, wherein each of the first document, the second document and the third document has a separate state, the separate state comprising at least one of active, inactive, saved and unsaved. | 11. A non-transitory machine-readable medium that provides instructions which, when executed by a machine, cause said machine to perform operations including: displaying a first document on a display screen; receiving a command to insert an enhancement point at an anchor point in the first document; displaying the enhancement point at the anchor point in the first document; receiving a command to create a first enhancement implementation at the enhancement point, the command to create the first enhancement implementation defining a second document to be inserted in its entirety into the first enhancement implementation and establishing a first hierarchical relationship between the first document and the second document; displaying the first enhancement implementation of the first document entirely within the first document at a location based on the location of the anchor point in the first document, while continuing to display the first document; receiving a command to create a second enhancement implementation at the anchor point, the command to create the second enhancement implementation defining a third document to be inserted in its entirety into the second enhancement implementation and establishing a second hierarchical relationship between the first document and the third document; displaying the second enhancement implementation of the first document, while continuing to display the first document and the first enhancement implementation, wherein the second document or the third document is displayed at the anchor point depending on whether the second document or the third document, respectively, is selected to be active; performing a first action on the first document that is independent of the second document; and performing a second action on the second document that is independent of the first document, wherein each of the first action and the second action comprises at least one of a save operation, an activate operation and return to prior version operation, wherein each of the first document, the second document and the third document has a separate state, the separate state comprising at least one of active, inactive, saved and unsaved. 12. The machine-readable medium of claim 11 , wherein the operations comprise: receiving a command to insert a different enhancement point a a different anchor point in the second document; displaying the different enhancement point at the different anchor point in the second document; receiving a command to create a third enhancement implementation at the different enhancement point, the command defining a fourth document to be inserted into the third enhancement implementation; and displaying the third enhancement implementation, wherein the third enhancement implementation is indented and below the first document and the second document. | 0.5 |
9,740,368 | 18 | 19 | 18. The method of claim 17 , wherein animating movement comprises: animating movement according to an ease-in translation, an ease-out translation, or both. | 18. The method of claim 17 , wherein animating movement comprises: animating movement according to an ease-in translation, an ease-out translation, or both. 19. The method of claim 18 , wherein animating movement comprises: animating movement according to a cubic-Bezier translation. | 0.5 |
7,584,421 | 1 | 3 | 1. A method implemented by a client in a broadcasting system for managing metadata for multimedia program content scheduled for broadcast in the broadcasting system, the method comprising: receiving in the client from a provider in the broadcasting system an electronic document containing metadata related to the scheduled multimedia program content, wherein the electronic document has a hierarchical structure based on a prescribed syntax and the hierarchical structure includes an upper fragment located above a lower fragment which is identified by a fragment identification; requesting an update for the previously received lower fragment in the client; and in response to the request, receiving in the client an update document having a structure based on the prescribed syntax, the update document including the upper fragment and an invalid element, wherein the invalid element specifies that information in the previously received lower fragment is invalid. | 1. A method implemented by a client in a broadcasting system for managing metadata for multimedia program content scheduled for broadcast in the broadcasting system, the method comprising: receiving in the client from a provider in the broadcasting system an electronic document containing metadata related to the scheduled multimedia program content, wherein the electronic document has a hierarchical structure based on a prescribed syntax and the hierarchical structure includes an upper fragment located above a lower fragment which is identified by a fragment identification; requesting an update for the previously received lower fragment in the client; and in response to the request, receiving in the client an update document having a structure based on the prescribed syntax, the update document including the upper fragment and an invalid element, wherein the invalid element specifies that information in the previously received lower fragment is invalid. 3. The method of claim 1 , wherein the invalid element specifies the fragment identification. | 0.714724 |
8,185,589 | 1 | 4 | 1. At a computer system, a method for performing an electronic mail conversation operation, the method comprising: an act of receiving an indication from a user that an ignore operation is to be performed on both a received electronic mail message and a corresponding electronic mail conversation, such that the received message and any electronic mail messages determined to be part of the conversation are to be ignored; an act of identifying one or more electronic mail messages included in an electronic mail conversation item that represents the electronic mail conversation, the identifying including scanning each of the folders in a user's mailbox for electronic mail messages that are related by subject to the received electronic mail message, wherein scanning includes scanning for both previously sent messages in a sent items folder and scanning for previously received messages in at least one other mailbox folder, the electronic mail conversation item including a plurality of conversation attribute values that represent the attributes of the electronic mail conversation including an identification of each message associated with the conversation and corresponding one or more participants of each message and a recipient delta field identifying a list of entities that were added or removed from each message that has been identified as being associated with the conversation, and wherein the electronic mail conversation item is responsively updated whenever any electronic mail message corresponding to the electronic mail conversation is received, and by at least updating the conversation attribute values to ensure that every participant and received message corresponding to the electronic mail conversation is reflected in the electronic mail conversation item; an act of accessing the identified one or more electronic mail messages included in the electronic mail conversation; an act of performing the ignore operation on each of the identified one or more electronic mail messages, such that the received electronic mail message, any previously sent or received email messages and any subsequently sent or received electronic mail messages identified by the scan as part of the conversation are moved to an ignored conversations folder; and an act of displaying the electronic mail conversation including the conversation's corresponding messages, the displayed conversation including the following in a single application window: a topic header, at least a portion of each message contributed to the conversation including an indication of who sent the message, each message including a URL link to any additional message body text, a participant change indication proximally placed next to each message where a participant was added or removed from the conversation including an identification of the participant who was added or removed, a number of messages indicator indicating the number of messages in the conversation, a timespan indicator indicating how long the conversation has existed, an active participants indicator indicating the participants that have contributed to the conversation and a most active participant indicator indicating the conversation participant that has contributed the most number of messages to the conversation. | 1. At a computer system, a method for performing an electronic mail conversation operation, the method comprising: an act of receiving an indication from a user that an ignore operation is to be performed on both a received electronic mail message and a corresponding electronic mail conversation, such that the received message and any electronic mail messages determined to be part of the conversation are to be ignored; an act of identifying one or more electronic mail messages included in an electronic mail conversation item that represents the electronic mail conversation, the identifying including scanning each of the folders in a user's mailbox for electronic mail messages that are related by subject to the received electronic mail message, wherein scanning includes scanning for both previously sent messages in a sent items folder and scanning for previously received messages in at least one other mailbox folder, the electronic mail conversation item including a plurality of conversation attribute values that represent the attributes of the electronic mail conversation including an identification of each message associated with the conversation and corresponding one or more participants of each message and a recipient delta field identifying a list of entities that were added or removed from each message that has been identified as being associated with the conversation, and wherein the electronic mail conversation item is responsively updated whenever any electronic mail message corresponding to the electronic mail conversation is received, and by at least updating the conversation attribute values to ensure that every participant and received message corresponding to the electronic mail conversation is reflected in the electronic mail conversation item; an act of accessing the identified one or more electronic mail messages included in the electronic mail conversation; an act of performing the ignore operation on each of the identified one or more electronic mail messages, such that the received electronic mail message, any previously sent or received email messages and any subsequently sent or received electronic mail messages identified by the scan as part of the conversation are moved to an ignored conversations folder; and an act of displaying the electronic mail conversation including the conversation's corresponding messages, the displayed conversation including the following in a single application window: a topic header, at least a portion of each message contributed to the conversation including an indication of who sent the message, each message including a URL link to any additional message body text, a participant change indication proximally placed next to each message where a participant was added or removed from the conversation including an identification of the participant who was added or removed, a number of messages indicator indicating the number of messages in the conversation, a timespan indicator indicating how long the conversation has existed, an active participants indicator indicating the participants that have contributed to the conversation and a most active participant indicator indicating the conversation participant that has contributed the most number of messages to the conversation. 4. The method as recited in claim 1 , wherein the act of identifying one or more electronic mail messages included in the electronic mail conversation item comprises an act of scanning links from the conversation item representing the electronic mail conversation to the one or more electronic mail messages. | 0.5 |
8,170,972 | 13 | 16 | 13. An apparatus comprising: a computer system comprising a first subsystem and a second subsystem; said first subsystem comprising a protocol comprising at least one existing rule, said at least one existing rule comprises an input feature and a health care instruction; and said second subsystem configured to: compare terminology in a new rule with terminology in said at least one existing rule, wherein the terminology in said new rule is not identical to the terminology in said at least one existing rule; determine that said new rule is similar to said at least one existing rule as a function of the comparison, wherein determining further comprises passing sample input data through the new rule and the at least one existing rule to determine a respective output of each rule and comparing the output of each rule to determine a duplicate or conflicting output for the same input data; notify a user that said new rule and said at least one existing rule are similar; and prompt the user to resolve the similarity, wherein the user is given an option to cancel said new rule. | 13. An apparatus comprising: a computer system comprising a first subsystem and a second subsystem; said first subsystem comprising a protocol comprising at least one existing rule, said at least one existing rule comprises an input feature and a health care instruction; and said second subsystem configured to: compare terminology in a new rule with terminology in said at least one existing rule, wherein the terminology in said new rule is not identical to the terminology in said at least one existing rule; determine that said new rule is similar to said at least one existing rule as a function of the comparison, wherein determining further comprises passing sample input data through the new rule and the at least one existing rule to determine a respective output of each rule and comparing the output of each rule to determine a duplicate or conflicting output for the same input data; notify a user that said new rule and said at least one existing rule are similar; and prompt the user to resolve the similarity, wherein the user is given an option to cancel said new rule. 16. An apparatus in accordance with claim 13 wherein the user verifies that said new rule and said at least one existing rule treat the same medical condition. | 0.615942 |
7,480,858 | 13 | 16 | 13. A system comprising: memory; one or more processors coupled to the memory; one or more computer-readable storage media; computer-readable instructions on the one or more computer-readable storage media which, when executed by the one or more processors, cause the one or more processors to execute a method comprising: analyzing one or more functions associated with a webpage described in a first markup language; the analyzing being performed by generating one or more a first function-based object model and a second function-based object model that both represent objects comprising the webpage; forming a hierarchical structure of the web page based on the analyzing; the hierarchical structure being formed by clustering the objects according to similarity measurements and counting a frequency of patterns in the clustered objects; describing the webpage in a second markup language based on the hierarchical structure, wherein the objects comprise: one or more basic objects associated with the webpage, the one or more basic objects comprising a smallest functional information body that cannot be further divided and still retain a basic object function, the one or more basic objects being configured to perform one or more of the following functions: (1) providing semantic information, (2) navigating to other objects, (3) providing a visual effect on the webpage, and (4) enabling a user interaction; one or more composite objects associated with the webpage, the one or more composite objects comprising objects that contain other objects, the one or more composite objects having a clustering function; wherein the first function-based object model describes functional properties of the one or more basic objects and the one or more composite objects; the second function-based object model categorizes the one or more basic objects and the one or more composite objects; and the analyzing comprises combining the first function-based object model and the second function-based object model. | 13. A system comprising: memory; one or more processors coupled to the memory; one or more computer-readable storage media; computer-readable instructions on the one or more computer-readable storage media which, when executed by the one or more processors, cause the one or more processors to execute a method comprising: analyzing one or more functions associated with a webpage described in a first markup language; the analyzing being performed by generating one or more a first function-based object model and a second function-based object model that both represent objects comprising the webpage; forming a hierarchical structure of the web page based on the analyzing; the hierarchical structure being formed by clustering the objects according to similarity measurements and counting a frequency of patterns in the clustered objects; describing the webpage in a second markup language based on the hierarchical structure, wherein the objects comprise: one or more basic objects associated with the webpage, the one or more basic objects comprising a smallest functional information body that cannot be further divided and still retain a basic object function, the one or more basic objects being configured to perform one or more of the following functions: (1) providing semantic information, (2) navigating to other objects, (3) providing a visual effect on the webpage, and (4) enabling a user interaction; one or more composite objects associated with the webpage, the one or more composite objects comprising objects that contain other objects, the one or more composite objects having a clustering function; wherein the first function-based object model describes functional properties of the one or more basic objects and the one or more composite objects; the second function-based object model categorizes the one or more basic objects and the one or more composite objects; and the analyzing comprises combining the first function-based object model and the second function-based object model. 16. The system of claim 13 , wherein said generating of the one or more function-based object models comprises generating at least one function-based object model for a composite object, said at least one function-based object model being generated as a function of one or more of the following properties: (A) a clustering relationship property pertaining to a relationship among root children of the composite object, and (B) a presentation relationship property pertaining to a presentation order associated with the root children of the composite object. | 0.623989 |
8,903,174 | 5 | 8 | 5. The method of claim 1 wherein the optimal recognition position is identified as a character within a display element, referred to as an optimal recognition position character, and the optimal recognition position character is displayed at the fixed display location. | 5. The method of claim 1 wherein the optimal recognition position is identified as a character within a display element, referred to as an optimal recognition position character, and the optimal recognition position character is displayed at the fixed display location. 8. The method of claim 5 wherein if the total number of characters in the display element is ten, eleven, twelve, or thirteen, then the optimal recognition position character is the fourth character in the display element. | 0.5 |
4,658,370 | 34 | 35 | 34. A knowledge engineering tool as set forth in claim 1 wherein said control knowledge includes control blocks specifying methods for determining the values of prescribed attributes. | 34. A knowledge engineering tool as set forth in claim 1 wherein said control knowledge includes control blocks specifying methods for determining the values of prescribed attributes. 35. A knowledge engineering tool as set forth in claim 34 which includes means for interrupting the application of a rule in order to execute said control block to determine the value of an attribute in the premise of said rule. | 0.532787 |
8,458,171 | 6 | 7 | 6. A method comprising: receiving data identifying an entity; parsing the data to extract the entity; generating in a computer system a group of candidate aspects for the entity, the computer system comprising one or more computers; for each of one or more pairs of candidate aspects, calculating a similarity score based on identifying respective sets of search results corresponding to respective queries of candidate aspects in the pair of candidate aspects and comparing search results in the sets of search results; modifying in the computer system the group of candidate aspects to generate a group of modified candidate aspects based on the similarity score for the candidate aspects, modifying comprising combining similar candidate aspects and grouping candidate aspects using one or more aspect classes each associated with one or more candidate aspects; ranking in the computer system one or more modified candidate aspects in the group of modified candidate aspects based on a diversity score and a popularity score, the popularity score for each of the modified candidate aspects based on a frequency of appearance of the modified candidate aspect and the diversity score for each of the modified candidate aspects based on similarity of the modified candidate aspect to other of the modified candidate aspects; and storing an association of one or more of the highest ranked modified candidate aspects with the entity in a data storage device of the computer system for presentation of each of the modified candidate aspects in combination with one or more search results that are specific to the modified candidate aspect. | 6. A method comprising: receiving data identifying an entity; parsing the data to extract the entity; generating in a computer system a group of candidate aspects for the entity, the computer system comprising one or more computers; for each of one or more pairs of candidate aspects, calculating a similarity score based on identifying respective sets of search results corresponding to respective queries of candidate aspects in the pair of candidate aspects and comparing search results in the sets of search results; modifying in the computer system the group of candidate aspects to generate a group of modified candidate aspects based on the similarity score for the candidate aspects, modifying comprising combining similar candidate aspects and grouping candidate aspects using one or more aspect classes each associated with one or more candidate aspects; ranking in the computer system one or more modified candidate aspects in the group of modified candidate aspects based on a diversity score and a popularity score, the popularity score for each of the modified candidate aspects based on a frequency of appearance of the modified candidate aspect and the diversity score for each of the modified candidate aspects based on similarity of the modified candidate aspect to other of the modified candidate aspects; and storing an association of one or more of the highest ranked modified candidate aspects with the entity in a data storage device of the computer system for presentation of each of the modified candidate aspects in combination with one or more search results that are specific to the modified candidate aspect. 7. The method of claim 6 , further comprising: receiving a query including the entity; identifying one or more aspects associated with the entity; receiving search results responsive to the query; and presenting the search results based on the identified aspects. | 0.787903 |
8,635,222 | 8 | 9 | 8. The method of claim 1 , wherein the receiving the search query further comprises receiving the search query for published web services in the UDDI registry. | 8. The method of claim 1 , wherein the receiving the search query further comprises receiving the search query for published web services in the UDDI registry. 9. The method of claim 8 , wherein the transmitting is based upon the search query. | 0.642241 |
8,635,192 | 12 | 13 | 12. A handheld electronic device comprising: a location-determining subsystem for determining a current location of the handheld electronic device; a memory for storing data, the memory being operatively coupled to a processor that is configured to automatically generate a textual plain-language description of the current location comprising correlating the current location with a calendar entry stored in a calendar application and extracting descriptive language from the calendar entry of the calendar application, and to geotag the data with the textual plain-language description of the current location, wherein the processor is further configured to determine if a subsequent set of data that is to be geotagged was generated in spatial or temporal proximity to the data that was previously geotagged and to geotag the subsequent set of data by reusing at least a portion of the textual plain-language description. | 12. A handheld electronic device comprising: a location-determining subsystem for determining a current location of the handheld electronic device; a memory for storing data, the memory being operatively coupled to a processor that is configured to automatically generate a textual plain-language description of the current location comprising correlating the current location with a calendar entry stored in a calendar application and extracting descriptive language from the calendar entry of the calendar application, and to geotag the data with the textual plain-language description of the current location, wherein the processor is further configured to determine if a subsequent set of data that is to be geotagged was generated in spatial or temporal proximity to the data that was previously geotagged and to geotag the subsequent set of data by reusing at least a portion of the textual plain-language description. 13. The handheld electronic device as claimed in claim 12 wherein the location-determining subsystem is a Global Positioning System (GPS) receiver for generating GPS coordinates. | 0.800448 |
9,405,834 | 13 | 21 | 13. A system to identify related search queries, comprising: at least one processor; memory; and at least one program stored in the memory and executable by the at least one processor, the at least one program comprising instructions to: receive a search query from a user; identify a set of ranked search results satisfying the search query; identify, using historical search query data, at least one last related search query in at least one chain of related search queries that is related to the search query and that includes at least one search result that was selected by users who issued the search query, wherein the identifying includes querying a query database to identify the at least one last related search query in the at least one chain of related search queries that are related to the search query, wherein a respective chain of related search queries is a sequence of consecutive search queries that are issued by a respective user and that include an initial search query that is successively refined; the query database includes a plurality of records, wherein each respective record includes: a respective search query; a number of times the respective search query was issued; a respective search result that was selected by users who issued the respective search query and that corresponds to at least one respective related search query in at least one respective chain of related search queries that are related to the respective search query; the at least one respective related search query; and a number of times the respective search query led to a selection of the respective search result; and return the set of ranked search results and the at least one last related search query to the user. | 13. A system to identify related search queries, comprising: at least one processor; memory; and at least one program stored in the memory and executable by the at least one processor, the at least one program comprising instructions to: receive a search query from a user; identify a set of ranked search results satisfying the search query; identify, using historical search query data, at least one last related search query in at least one chain of related search queries that is related to the search query and that includes at least one search result that was selected by users who issued the search query, wherein the identifying includes querying a query database to identify the at least one last related search query in the at least one chain of related search queries that are related to the search query, wherein a respective chain of related search queries is a sequence of consecutive search queries that are issued by a respective user and that include an initial search query that is successively refined; the query database includes a plurality of records, wherein each respective record includes: a respective search query; a number of times the respective search query was issued; a respective search result that was selected by users who issued the respective search query and that corresponds to at least one respective related search query in at least one respective chain of related search queries that are related to the respective search query; the at least one respective related search query; and a number of times the respective search query led to a selection of the respective search result; and return the set of ranked search results and the at least one last related search query to the user. 21. The system of claim 13 , wherein a ratio of a number of times that the at least one search result was selected and a number of times that the search query was issued exceeds a predetermined threshold. | 0.773333 |
10,003,671 | 8 | 10 | 8. A method for replaying an application session comprising: monitoring an application session conducted on a computer; capturing client events for the application session; capturing image identifiers for images displayed during the application session, wherein the image identifiers are configured to identify image code from an application resource file associated with the images; and sending the client events and image identifiers to a replay system that generates an image generation file including the image code from the application resource file to generate one or more images from the application session. | 8. A method for replaying an application session comprising: monitoring an application session conducted on a computer; capturing client events for the application session; capturing image identifiers for images displayed during the application session, wherein the image identifiers are configured to identify image code from an application resource file associated with the images; and sending the client events and image identifiers to a replay system that generates an image generation file including the image code from the application resource file to generate one or more images from the application session. 10. The method of claim 8 , wherein: the image code from the application resource file is configured to render webpages; and the client events comprise user inputs entered into the webpages during the application session. | 0.755531 |
8,768,935 | 1 | 4 | 1. A computer-implemented method for generating a bigram database, the method comprising: receiving a plurality of domain names; tokenizing, by a processor, the plurality of domain names; generating, by the processor, a plurality of token bigrams from the tokenized domain names; filtering, by the processor, the plurality of token bigrams by token type, wherein the token type includes at least one of: (1) a forward bigram which replaces a token at the end of a tokenized domain name or (2) a backward bigram which replaces a token at the beginning of a tokenized domain name; ranking, by the processor, the plurality of token bigrams, wherein forward bigrams are ranked higher than other token bigrams of the plurality of token bigrams; and storing, in a memory, the filtered and ranked token bigrams in a bigram database. | 1. A computer-implemented method for generating a bigram database, the method comprising: receiving a plurality of domain names; tokenizing, by a processor, the plurality of domain names; generating, by the processor, a plurality of token bigrams from the tokenized domain names; filtering, by the processor, the plurality of token bigrams by token type, wherein the token type includes at least one of: (1) a forward bigram which replaces a token at the end of a tokenized domain name or (2) a backward bigram which replaces a token at the beginning of a tokenized domain name; ranking, by the processor, the plurality of token bigrams, wherein forward bigrams are ranked higher than other token bigrams of the plurality of token bigrams; and storing, in a memory, the filtered and ranked token bigrams in a bigram database. 4. The method according to claim 1 , wherein the tokenizing comprises: dividing each domain name of the plurality of domain names into tokens, the tokens being sets of consecutive strings of characters; limiting the tokens to character strings that form words. | 0.505703 |
7,495,662 | 9 | 10 | 9. A process for providing a history-free system for the design of parts or assemblies of parts, the process comprising the steps of: (a) providing a history-based design system having a storage format with primitives and operations, a part or assembly of parts being defined in the history-based design system by an ordered sequence of operations and primitives (b) providing at least two functional features, each of which is adapted to be instantiated by an end user by providing a set of specifications, an instantiated functional feature providing at least a contribution, a contribution being an ordered sequence of operations and primitives of the history-based design system, wherein an order of instantiation of the at least two functional features defines a creation order of contributions provided by the at least two functional features; p 1 (c) using a context-free grammar to define a seed structure, the seed structure being adapted to receive contributions from instantiated functional features, to order operations and primitives of received contributions and to provide an ordered sequence of operations and primitives to the history-based system, using the creation order of contributions, and (d) displaying the part or assembly of parts, independently of the order of instantiation of the functional features and using the history-based system. | 9. A process for providing a history-free system for the design of parts or assemblies of parts, the process comprising the steps of: (a) providing a history-based design system having a storage format with primitives and operations, a part or assembly of parts being defined in the history-based design system by an ordered sequence of operations and primitives (b) providing at least two functional features, each of which is adapted to be instantiated by an end user by providing a set of specifications, an instantiated functional feature providing at least a contribution, a contribution being an ordered sequence of operations and primitives of the history-based design system, wherein an order of instantiation of the at least two functional features defines a creation order of contributions provided by the at least two functional features; p 1 (c) using a context-free grammar to define a seed structure, the seed structure being adapted to receive contributions from instantiated functional features, to order operations and primitives of received contributions and to provide an ordered sequence of operations and primitives to the history-based system, using the creation order of contributions, and (d) displaying the part or assembly of parts, independently of the order of instantiation of the functional features and using the history-based system. 10. The process of claim 9 , wherein the operations comprise commutative operations and non-commutative operations, wherein the step of using comprises providing a seed structure having inputs adapted to receive contributions and wherein the seed structure is adapted to apply commutative operations to the contributions received on each input and to apply commutative or non-commutative operations to the results of the commutative operations applied to said contributions. | 0.5 |
10,140,263 | 11 | 14 | 11. A non-transitory data processing system-readable medium bearing code which, when executed by one or more processors of a data processing system, causes the data processing system to: receive an electronic version of a document comprising a plurality of content portions; identify a plurality of prescribed elements for the document, wherein at least some of the plurality of prescribed elements are identified based on a document type for the document; correlate at least some content portions in the editing copy of the document to corresponding prescribed elements of the plurality of prescribed elements; determine a state value for each prescribed element of the plurality of prescribed elements, the state value corresponding to one of present, missing, or incomplete; generate an editing copy of the document, the generating comprising embedding code in the editing copy of the document, the code identifying at least one task corresponding to at least one content portion of the document, the code defining at least one user interface element for presentation within the editing copy when the editing copy is rendered and presented; transmit, to a user system, the editing copy of the document including the embedded code and the state value for each prescribed element of the plurality of prescribed elements for rendering and presentation by the user system; receive, from the user system, an instruction to add a new content portion not included in the plurality of content portions to the editing copy of the document; store the new content portion at the data processing system; correlate the new content portion to a further prescribed element of the plurality of prescribed elements; update the state value for the further prescribed element; and transmit, to the user system, the updated state value. | 11. A non-transitory data processing system-readable medium bearing code which, when executed by one or more processors of a data processing system, causes the data processing system to: receive an electronic version of a document comprising a plurality of content portions; identify a plurality of prescribed elements for the document, wherein at least some of the plurality of prescribed elements are identified based on a document type for the document; correlate at least some content portions in the editing copy of the document to corresponding prescribed elements of the plurality of prescribed elements; determine a state value for each prescribed element of the plurality of prescribed elements, the state value corresponding to one of present, missing, or incomplete; generate an editing copy of the document, the generating comprising embedding code in the editing copy of the document, the code identifying at least one task corresponding to at least one content portion of the document, the code defining at least one user interface element for presentation within the editing copy when the editing copy is rendered and presented; transmit, to a user system, the editing copy of the document including the embedded code and the state value for each prescribed element of the plurality of prescribed elements for rendering and presentation by the user system; receive, from the user system, an instruction to add a new content portion not included in the plurality of content portions to the editing copy of the document; store the new content portion at the data processing system; correlate the new content portion to a further prescribed element of the plurality of prescribed elements; update the state value for the further prescribed element; and transmit, to the user system, the updated state value. 14. The non-transitory data processing system-readable medium of claim 11 , wherein embedding code in the editing copy of the document comprises embedding code identifying at least one task corresponding to content portions correlated to prescribed elements. | 0.913248 |
9,390,086 | 1 | 8 | 1. A method comprising: obtaining a document; determining, using a trained classifier, a candidate label for the document from a plurality of different labels; selecting two or more different linguistic structures from the document; displaying a user interface that presents data from the document, including at least a portion of the two or more linguistic structures, and the plurality of labels including the candidate label, and respective scores in association with each different label among the plurality of labels, wherein the portion of the two or more linguistic structures are displayed by the user interface, wherein the user interface includes two or more user interface controls which present a first option to accept the candidate label for the document and a second option to select a different label for the document, the two or more user interface controls further presenting an element for highlighting the two or more linguistic structures within the document; wherein one of the user interface controls is configured to allow selection from the plurality of different labels; receiving, via the two or more user interface controls, input representing selection of the first option or the second option, and further input comprising a highlighted section of the two or more linguistic structures that was important to the selection of the first option or the second option; associating the document with a verified label; changing, based on the further input, one or more weights assigned to the highlighted section relative to a non-highlighted section during retraining of the trained classifier; wherein the method is performed by one or more computing devices. | 1. A method comprising: obtaining a document; determining, using a trained classifier, a candidate label for the document from a plurality of different labels; selecting two or more different linguistic structures from the document; displaying a user interface that presents data from the document, including at least a portion of the two or more linguistic structures, and the plurality of labels including the candidate label, and respective scores in association with each different label among the plurality of labels, wherein the portion of the two or more linguistic structures are displayed by the user interface, wherein the user interface includes two or more user interface controls which present a first option to accept the candidate label for the document and a second option to select a different label for the document, the two or more user interface controls further presenting an element for highlighting the two or more linguistic structures within the document; wherein one of the user interface controls is configured to allow selection from the plurality of different labels; receiving, via the two or more user interface controls, input representing selection of the first option or the second option, and further input comprising a highlighted section of the two or more linguistic structures that was important to the selection of the first option or the second option; associating the document with a verified label; changing, based on the further input, one or more weights assigned to the highlighted section relative to a non-highlighted section during retraining of the trained classifier; wherein the method is performed by one or more computing devices. 8. The method of claim 1 , wherein each linguistic structure of the one or more linguistic structures is associated with at least one label of the plurality of labels, the two or more linguistic structures are displayed by the user interface in a visually distinguished manner compared to other two or more linguistic structures displayed by the user interface, and the user interface includes second two or more user interface controls associated with the plurality of labels and which, when selected, each cause toggling of the visually distinguished manner of one or more respective linguistic structures, of the portion of the two or more linguistic structures displayed by the user interface, that are associated with a respective label of the plurality of labels. | 0.5 |
8,930,808 | 17 | 22 | 17. A system for storing rich text data, comprising: a processor; a plain text component operable by the processor to identify plain text in the rich text data and store the plain text in a first legacy data record; a rich text attribute component operable by the processor to identify rich text attributes in the rich text data and generate a second legacy data record which comprises the rich text attributes, wherein the rich text attributes specify richness features of the plain text, and the second legacy data record is prefixed by a token which includes a unique string of characters recognizable by a user and by an application capable of applying the rich text attributes to the plain text to present the rich text data; a record compressing component operable by the processor to compress the second data record, and a record storing component operable by the processor to store the second legacy data record inline with the first legacy data record in a legacy data repository of a data storage system, wherein the first legacy data record is separate from the second legacy data record so that the plain text appears without rich text, the plain text appearing in one or more plain text lines and the rich text appearing in one or more rich text lines prefixed by the token. | 17. A system for storing rich text data, comprising: a processor; a plain text component operable by the processor to identify plain text in the rich text data and store the plain text in a first legacy data record; a rich text attribute component operable by the processor to identify rich text attributes in the rich text data and generate a second legacy data record which comprises the rich text attributes, wherein the rich text attributes specify richness features of the plain text, and the second legacy data record is prefixed by a token which includes a unique string of characters recognizable by a user and by an application capable of applying the rich text attributes to the plain text to present the rich text data; a record compressing component operable by the processor to compress the second data record, and a record storing component operable by the processor to store the second legacy data record inline with the first legacy data record in a legacy data repository of a data storage system, wherein the first legacy data record is separate from the second legacy data record so that the plain text appears without rich text, the plain text appearing in one or more plain text lines and the rich text appearing in one or more rich text lines prefixed by the token. 22. The system of claim 17 , further comprising: a plain text extractor and a rich text attribute extractor operable by the processor to extract the plain text and the rich text attributes from the rich text data. | 0.587209 |
8,838,016 | 1 | 5 | 1. A computer system for providing computer-aided learning with adaptive optimization, comprising: a storage module configured for storing learning data; a man-machine interface configured for providing the learning data to at least one learner; an information collection module configured for tracking and recording an interactive learning process, the interactive learning process representing a plurality of interactions between the at least one learner and the man-machine interface; a learning process analysis module configured for receiving the interactional learning process provided by the information collection module, the learning process analysis module further configured for analyzing the interactional learning process and forming a control signal, the control signal including an assessed learning efficacy specific to the at least one learner; and a learning strategy generation module configured for receiving the control signal from the learning process analysis module, the learning strategy generation module further configured for generating a learning strategy signal specifically for the at least one learner at least partially based on the learning efficacy of the at least one learner, the learning strategy signal indicating at least one of: a recommended daily learning duration for the at least one learner, a recommended time allocation for learning a new item, a recommended time allocation for reviewing an old item, a recommended number of new items to be learned in a day, a recommended number of review sessions, a recommended time interval between two review sessions, and a recommended number of old items to be reviewed in a day; wherein the man-machine interface is configured to provide the learning data to the at least one learner based on the learning strategy signal, wherein the learning efficacy specific to the at least one learner is determined by maximizing the learning efficacy for learning the recommended number of new items to be learned in a day, the learning efficacy being maximized by adjusting the recommended time interval between two review sessions, subject to: T i > 0 , ∑ i = 1 m T i ≤ T max , ∀ i ∈ [ 1 , m ] wherein m is the recommended number of review sessions, { T i } i = 1 m is the recommended time interval between two review sessions and T max is a predetermined upper bound. | 1. A computer system for providing computer-aided learning with adaptive optimization, comprising: a storage module configured for storing learning data; a man-machine interface configured for providing the learning data to at least one learner; an information collection module configured for tracking and recording an interactive learning process, the interactive learning process representing a plurality of interactions between the at least one learner and the man-machine interface; a learning process analysis module configured for receiving the interactional learning process provided by the information collection module, the learning process analysis module further configured for analyzing the interactional learning process and forming a control signal, the control signal including an assessed learning efficacy specific to the at least one learner; and a learning strategy generation module configured for receiving the control signal from the learning process analysis module, the learning strategy generation module further configured for generating a learning strategy signal specifically for the at least one learner at least partially based on the learning efficacy of the at least one learner, the learning strategy signal indicating at least one of: a recommended daily learning duration for the at least one learner, a recommended time allocation for learning a new item, a recommended time allocation for reviewing an old item, a recommended number of new items to be learned in a day, a recommended number of review sessions, a recommended time interval between two review sessions, and a recommended number of old items to be reviewed in a day; wherein the man-machine interface is configured to provide the learning data to the at least one learner based on the learning strategy signal, wherein the learning efficacy specific to the at least one learner is determined by maximizing the learning efficacy for learning the recommended number of new items to be learned in a day, the learning efficacy being maximized by adjusting the recommended time interval between two review sessions, subject to: T i > 0 , ∑ i = 1 m T i ≤ T max , ∀ i ∈ [ 1 , m ] wherein m is the recommended number of review sessions, { T i } i = 1 m is the recommended time interval between two review sessions and T max is a predetermined upper bound. 5. The computer system as claimed in claim 1 , wherein the learning strategy signal indicates: a recommended daily learning duration for the at least one learner, a recommended time allocation for learning a new item, a recommended time allocation for reviewing an old item, a recommended number of new items to be learned in a day, a recommended time interval between two review sessions, and a recommended number of old items to be reviewed in a day. | 0.5 |
7,483,891 | 13 | 15 | 13. The system of claim 1 , further comprising a property sever configured to provide a configuration file to the parsing module, and wherein the configuration file includes a set of parsing rules for parsing base content. | 13. The system of claim 1 , further comprising a property sever configured to provide a configuration file to the parsing module, and wherein the configuration file includes a set of parsing rules for parsing base content. 15. The system of claim 13 , wherein the parsing rules provide for parsing at least one of a title, metadata keywords, a metadata description, anchor text, body text, proper nouns, formatted text, or combinations thereof. | 0.5 |
9,129,039 | 1 | 3 | 1. A computer readable storage device storing a program of instructions executable by a machine to perform a method of integrating diverse sources of data and data streams, the method comprising: selecting a scenario for refinement based on a topic, the scenario comprising a text document that describes the topic to be examined, the scenario identifying one or more downstream data users and uses that drive said refinement of the scenario; creating a multi-relational directed graph based on the scenario; identifying and converting resources in accordance with the scenario and updating the multi-directed graph based on the converted resources; identifying data feeds in accordance with the scenario and updating the multi-directed graph based on the data feeds; creating detectors operable to continuously provide data related to the topic, the detectors receiving said data from said data feeds; identifying analytical routines that compare information in said data to the scenario and updating the multi-directed graph using the analytical routines, the analytical routines comprising sensors that subscribe to said detectors and responsive to receiving said data, perform at least one of: comparing, based on alignment, sequences in a data stream to sequences in entities of the multi-relational directed graph, and adding one or more statements to the multi-directed graph based on finding a match; performing analysis among the entities, literals associated with the scenario and represented as a node in the multi-directed graph and ontologies associated with the scenario and linked to the multi-directed graph, wherein one or more relationship statements are generated between two or more of an entity, a literal, and an ontology in the multi-directed graph; and linking the entities to samples corresponding to events; and identifying data outputs in accordance with the scenario at least based on one of the one or more statements and the one or more relationship statements and defining queries to produce the data outputs from the multi-directed graph, the method further comprising consuming one or more messages from one or more of the sensors indicating a match in said data, the consuming performed by a controller comprising a state machine, and the controller publishing an advisory responsive to finding that all conditions in the scenario are met based on said one or more consumed messages. | 1. A computer readable storage device storing a program of instructions executable by a machine to perform a method of integrating diverse sources of data and data streams, the method comprising: selecting a scenario for refinement based on a topic, the scenario comprising a text document that describes the topic to be examined, the scenario identifying one or more downstream data users and uses that drive said refinement of the scenario; creating a multi-relational directed graph based on the scenario; identifying and converting resources in accordance with the scenario and updating the multi-directed graph based on the converted resources; identifying data feeds in accordance with the scenario and updating the multi-directed graph based on the data feeds; creating detectors operable to continuously provide data related to the topic, the detectors receiving said data from said data feeds; identifying analytical routines that compare information in said data to the scenario and updating the multi-directed graph using the analytical routines, the analytical routines comprising sensors that subscribe to said detectors and responsive to receiving said data, perform at least one of: comparing, based on alignment, sequences in a data stream to sequences in entities of the multi-relational directed graph, and adding one or more statements to the multi-directed graph based on finding a match; performing analysis among the entities, literals associated with the scenario and represented as a node in the multi-directed graph and ontologies associated with the scenario and linked to the multi-directed graph, wherein one or more relationship statements are generated between two or more of an entity, a literal, and an ontology in the multi-directed graph; and linking the entities to samples corresponding to events; and identifying data outputs in accordance with the scenario at least based on one of the one or more statements and the one or more relationship statements and defining queries to produce the data outputs from the multi-directed graph, the method further comprising consuming one or more messages from one or more of the sensors indicating a match in said data, the consuming performed by a controller comprising a state machine, and the controller publishing an advisory responsive to finding that all conditions in the scenario are met based on said one or more consumed messages. 3. The computer readable storage device of claim 1 , the identifying and converting resources comprising: converting the resources into RDF format; and linking the converted resources into the multi-relational directed graph. | 0.605263 |
7,519,616 | 14 | 15 | 14. A method performed by a computer comprising: referencing one or more multimedia objects through a first set of one or more elements in a first document; associating the first set of one or more elements in the first document to a second set of one or more elements in a second document that is separate from the first document, the associating comprising referencing at least a portion of the first set of one or more elements to one or more elements in the second set of one or more elements; arranging the second set of one or more elements of the second document to indicate timing for the multimedia objects referenced by the first set of one or more elements in the first document; receiving an input to initiate an event affecting an element in the first set of one or more elements of the first document; providing a proxy element in the second document that is configured to reference initiation of the event; and rendering the multimedia objects based on the arranging of the second set of one or more elements. | 14. A method performed by a computer comprising: referencing one or more multimedia objects through a first set of one or more elements in a first document; associating the first set of one or more elements in the first document to a second set of one or more elements in a second document that is separate from the first document, the associating comprising referencing at least a portion of the first set of one or more elements to one or more elements in the second set of one or more elements; arranging the second set of one or more elements of the second document to indicate timing for the multimedia objects referenced by the first set of one or more elements in the first document; receiving an input to initiate an event affecting an element in the first set of one or more elements of the first document; providing a proxy element in the second document that is configured to reference initiation of the event; and rendering the multimedia objects based on the arranging of the second set of one or more elements. 15. The method of claim 14 wherein the referencing is performed by pointers in the first set of one or more elements in the first document that point to the one or more multimedia objects. | 0.5 |
7,689,033 | 39 | 51 | 39. A computer-readable medium having computer-implementable instructions for causing at least one processing unit to perform acts comprising: detecting possible human face image data within a digital image using a multiple stage face detection scheme that includes: a boosting filter stage to process a set of initial candidate portions of digital image data to produce a set of intermediate candidate portions using a plurality of boosting chain nodes and a boot strap function following each of the plurality of boosting chain nodes, the boot strap function to adjust a sample weight initialized for a current boosting classifier of a current boosting chain node based on a classification error rate of a previous boosting node; and a post-filtering stage configured to process the set of intermediate candidate portions to produce a set of final candidate portions, wherein the post-filter stage includes an image pre-processing process, a color-filtering process, and a support vector machine (SVM) filtering process, the SVM filtering process to perform wavelet transformation on the set of intermediate candidate portions. | 39. A computer-readable medium having computer-implementable instructions for causing at least one processing unit to perform acts comprising: detecting possible human face image data within a digital image using a multiple stage face detection scheme that includes: a boosting filter stage to process a set of initial candidate portions of digital image data to produce a set of intermediate candidate portions using a plurality of boosting chain nodes and a boot strap function following each of the plurality of boosting chain nodes, the boot strap function to adjust a sample weight initialized for a current boosting classifier of a current boosting chain node based on a classification error rate of a previous boosting node; and a post-filtering stage configured to process the set of intermediate candidate portions to produce a set of final candidate portions, wherein the post-filter stage includes an image pre-processing process, a color-filtering process, and a support vector machine (SVM) filtering process, the SVM filtering process to perform wavelet transformation on the set of intermediate candidate portions. 51. The computer-readable medium as recited in claim 39 , further comprising employing at least one feature-based algorithm that uses at least one feature selected from a group of features including at least one Haar-like feature, at least one extended feature, at least one mirror invariant feature, and at least one variance features. | 0.5 |
9,311,426 | 7 | 8 | 7. The method of claim 1 , wherein the structured document is received from a web server. | 7. The method of claim 1 , wherein the structured document is received from a web server. 8. The method of claim 7 , wherein the subset of said plurality of content elements includes only content elements with content served from the same web server. | 0.5 |
8,849,797 | 1 | 2 | 1. A computer-implemented method for governing access of a query to a database on a computer system, the method comprising the steps of: receiving an estimated query execution time for the query; calculating a factor for the query, wherein the factor is one or more factors chosen from: a user factor, a query factor, a job priority factor, or a resource factor; dynamically generating a tailored threshold that is unique to the query, where the tailored threshold is determined by applying the factor to a fixed threshold; governing the query's access to the database based on the tailored threshold; and wherein the method steps are implemented in a computer software program stored in computer memory and executed by a computer processor. | 1. A computer-implemented method for governing access of a query to a database on a computer system, the method comprising the steps of: receiving an estimated query execution time for the query; calculating a factor for the query, wherein the factor is one or more factors chosen from: a user factor, a query factor, a job priority factor, or a resource factor; dynamically generating a tailored threshold that is unique to the query, where the tailored threshold is determined by applying the factor to a fixed threshold; governing the query's access to the database based on the tailored threshold; and wherein the method steps are implemented in a computer software program stored in computer memory and executed by a computer processor. 2. The method of claim 1 further comprising the step of: intelligently creating a user score for each user accessing the database that is used to calculate the user factor to determine the tailored threshold. | 0.5 |
9,576,042 | 1 | 8 | 1. A computer-implemented method comprising: accessing a search history including one or more search terms for identifying search terms available for domain name registration, wherein the search history comprises prior user search terms; categorizing each of the one or more search terms based on a number of times the respective search term appears in the search history, wherein for each of the one or more search terms, the categorizing comprises: determining whether the search term is a restricted term; characterizing the search term as a term that is excluded from registration when the search term is a restricted term; and in a case where the number of times that the search term appears in the search history exceeds a first threshold value, identifying, from the search history, a search result of the search term; and categorizing the search term as a type that is provided for registration to a user with recognized association with the search term or a type that is excluded from registration, wherein the categorizing is based on a ratio of a number of times the search result was selected subsequent to receiving the search term to the number of times that the search term appears in the search history; receiving a user-selected search term from a client device associated with a user over a network connection to the client device, the user-selected search term corresponding to a type of categorization of one of the categorized one or more search terms; and sending a notification to the client device over the network connection, the notification indicating how to obtain registration of a domain name that includes the user-selected search term. | 1. A computer-implemented method comprising: accessing a search history including one or more search terms for identifying search terms available for domain name registration, wherein the search history comprises prior user search terms; categorizing each of the one or more search terms based on a number of times the respective search term appears in the search history, wherein for each of the one or more search terms, the categorizing comprises: determining whether the search term is a restricted term; characterizing the search term as a term that is excluded from registration when the search term is a restricted term; and in a case where the number of times that the search term appears in the search history exceeds a first threshold value, identifying, from the search history, a search result of the search term; and categorizing the search term as a type that is provided for registration to a user with recognized association with the search term or a type that is excluded from registration, wherein the categorizing is based on a ratio of a number of times the search result was selected subsequent to receiving the search term to the number of times that the search term appears in the search history; receiving a user-selected search term from a client device associated with a user over a network connection to the client device, the user-selected search term corresponding to a type of categorization of one of the categorized one or more search terms; and sending a notification to the client device over the network connection, the notification indicating how to obtain registration of a domain name that includes the user-selected search term. 8. The computer-implemented method of claim 1 , wherein one of the one or more restricted terms is a trademark. | 0.874434 |
9,799,046 | 1 | 7 | 1. A method for enabling clickless purchasing, the method comprising, at a computer system comprising one or more processors and memory storing one or more programs for execution by the one or more processors: detecting a commercial intent from a user registered with the 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 message; 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 determined to be relevant to the detected commercial intent of the user; 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 determined to be relevant to the detected commercial intent of the user; in response to receiving the electronic response message comprising the authorization from the user to purchase the product, purchasing the product determined to be relevant to the detected commercial intent of the user on behalf of the user; and arranging for delivery of the product to the user after purchasing the product. | 1. A method for enabling clickless purchasing, the method comprising, at a computer system comprising one or more processors and memory storing one or more programs for execution by the one or more processors: detecting a commercial intent from a user registered with the 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 message; 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 determined to be relevant to the detected commercial intent of the user; 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 determined to be relevant to the detected commercial intent of the user; in response to receiving the electronic response message comprising the authorization from the user to purchase the product, purchasing the product determined to be relevant to the detected commercial intent of the user on behalf of the user; and arranging for delivery of the product to the user after purchasing the product. 7. The method of claim 1 , wherein determining the product relevant to the detected commercial intent of the user comprises: based on the detected commercial intent, identifying one or more product categories of interest to the user of the computer system; and selecting the product from the one or more product categories of interest to the user of the computer system. | 0.855356 |
8,719,299 | 12 | 13 | 12. The system for generating data describing concepts from data describing schema of claim 8 , further comprising filtering the set of subgraphs resulting from the mining according to a relevancy metric calculated for each of the subgraphs of the set. | 12. The system for generating data describing concepts from data describing schema of claim 8 , further comprising filtering the set of subgraphs resulting from the mining according to a relevancy metric calculated for each of the subgraphs of the set. 13. The system for generating data describing concepts from data describing schema of claim 12 , wherein the relevancy metric comprises calculating the relevancy of each subgraph by a formula according to relevance=|p|α·|f|β, where |p| is a size of each subgraph, and |f| is a frequency of appearance of that subgraph in the set of graphs, where α and β are selected to determine a relative priority of frequency of appearance and size of subgraph. | 0.5 |
8,983,827 | 7 | 9 | 7. A method for linguistical analytic consolidation, the method comprising: displaying a user interface on a mobile device; receiving source text content to display in the user interface; scanning the source text content for a specific element; generating a mobility score for the source text content, wherein the mobility score describes a compatibility of the source text content for display on a device; and flagging the specific element of the source text content to be modified according to a set of linguistic rules, wherein modifying the specific element according to the set of linguistic rules results in a consolidated form of the source text content. | 7. A method for linguistical analytic consolidation, the method comprising: displaying a user interface on a mobile device; receiving source text content to display in the user interface; scanning the source text content for a specific element; generating a mobility score for the source text content, wherein the mobility score describes a compatibility of the source text content for display on a device; and flagging the specific element of the source text content to be modified according to a set of linguistic rules, wherein modifying the specific element according to the set of linguistic rules results in a consolidated form of the source text content. 9. The method of claim 7 , wherein the set of linguistic rules comprises a rule to modify the specific element by removing the specific element, wherein the specific element comprises at least one of: an identified redundancy; an identified intensifying element; and an identified unnecessary modifier. | 0.53681 |
8,442,496 | 1 | 6 | 1. A method, for operating a voicemail system, comprising: receiving a call for a called party at the voicemail system, the voicemail system comprising a stored language preference for the called party; prompting a calling party to leave a message; creating the message; providing a plurality of calling-party-selected language preferences; prompting the calling party to select, from the plurality of calling-party-selected language preferences, a calling-party-selected language preference for the message; in response to prompting the calling party to select, from the plurality of calling-party-selected language preferences, the calling-party-selected language preference for the message, receiving the calling-party-selected language preference for the message; overriding the stored language preference for the called party with the calling-party-selected language preference; determining whether the message is in the calling-party-selected language preference; and in response to overriding the stored language preference with the calling-party-selected language preference, and if the message is not in the calling-party-selected preferred language identified by the language preference, translating the message into a preferred language of the calling-party-selected preferred language preference, thereby creating a translated message. | 1. A method, for operating a voicemail system, comprising: receiving a call for a called party at the voicemail system, the voicemail system comprising a stored language preference for the called party; prompting a calling party to leave a message; creating the message; providing a plurality of calling-party-selected language preferences; prompting the calling party to select, from the plurality of calling-party-selected language preferences, a calling-party-selected language preference for the message; in response to prompting the calling party to select, from the plurality of calling-party-selected language preferences, the calling-party-selected language preference for the message, receiving the calling-party-selected language preference for the message; overriding the stored language preference for the called party with the calling-party-selected language preference; determining whether the message is in the calling-party-selected language preference; and in response to overriding the stored language preference with the calling-party-selected language preference, and if the message is not in the calling-party-selected preferred language identified by the language preference, translating the message into a preferred language of the calling-party-selected preferred language preference, thereby creating a translated message. 6. The method of claim 1 , wherein overriding the stored language preference for the called party with the calling-party-selected language preference comprises overriding the stored language preference for the called party with the calling-party-selected language preference in response to a trigger initiated by the calling party to perform the override. | 0.5 |
9,742,669 | 1 | 2 | 1. A method implemented in a computer system network for data object routing based on a named data object request in a named data network including a plurality of routers, the method comprising: receiving at a first one of the routers the named data object request; determining by the first router if the data object named by the named data object request is in a cache of the first router; if the data object named by the named data object request is in the cache of the first router, responding by the first router with the data object; if the data object named by the named data object request is not in the cache of the first router, determining by the first router if an alias copy of the data object named by an alias associated with the named data object is in the cache of the first router; if the data object named by the named data object request is not in the cache of the first router and if an alias copy of the data object named by an alias associated with the named data object is in a cache of the first router, responding by the first router with the alias copy; if the data object named by the named data object request is not in the cache of the first router and if an alias copy of the data object named by an alias associated with the named data object is not in the cache of the first router, determining by the first router if a location of an alias copy of the data object at a second one of the routers is known; and if the data object named by the named data object request is not in the cache of the first router and if an alias copy of the data object named by an alias associated with the named data object is not in the cache of the first router and if the location of the alias copy of the data object at the second one of the routers is known, routing by the first router the named data object request towards the location of the second router. | 1. A method implemented in a computer system network for data object routing based on a named data object request in a named data network including a plurality of routers, the method comprising: receiving at a first one of the routers the named data object request; determining by the first router if the data object named by the named data object request is in a cache of the first router; if the data object named by the named data object request is in the cache of the first router, responding by the first router with the data object; if the data object named by the named data object request is not in the cache of the first router, determining by the first router if an alias copy of the data object named by an alias associated with the named data object is in the cache of the first router; if the data object named by the named data object request is not in the cache of the first router and if an alias copy of the data object named by an alias associated with the named data object is in a cache of the first router, responding by the first router with the alias copy; if the data object named by the named data object request is not in the cache of the first router and if an alias copy of the data object named by an alias associated with the named data object is not in the cache of the first router, determining by the first router if a location of an alias copy of the data object at a second one of the routers is known; and if the data object named by the named data object request is not in the cache of the first router and if an alias copy of the data object named by an alias associated with the named data object is not in the cache of the first router and if the location of the alias copy of the data object at the second one of the routers is known, routing by the first router the named data object request towards the location of the second router. 2. The method of claim 1 , further comprising: if the data object named by the named data object request is not in the cache of the first router, determining by the first router if a location of the data object named by the named data object request at a third one of the routers is known; wherein, if the location of the data object named by the named data object request at the third one of the routers is known and if the location of the third router is closer to the first router than the location of the second router, then: routing by the first router the named data object request towards the location of the third router instead of the location of the second router. | 0.5 |
9,201,854 | 14 | 15 | 14. The non-transitory computer readable storage medium of claim 13 , wherein each print resource subcomponent comprises a print format subcomponent. | 14. The non-transitory computer readable storage medium of claim 13 , wherein each print resource subcomponent comprises a print format subcomponent. 15. The non-transitory computer readable storage medium of claim 14 , wherein the print format subcomponent comprises fonts, images, and overlays. | 0.5 |
8,832,615 | 15 | 20 | 15. The non-transitory computer-readable medium according to claim 14 further comprising: code for setting up a context in a debugger for debugging the anomaly. | 15. The non-transitory computer-readable medium according to claim 14 further comprising: code for setting up a context in a debugger for debugging the anomaly. 20. The non-transitory computer-readable medium according to claim 15 , wherein the power domain comprises a sub-circuit, and the at least one power sequence rule comprises a first power sequence rule of “no value change should occur on signals of the sub-circuit during a power-down period of the power domain”. | 0.54519 |
9,661,093 | 4 | 5 | 4. The non-transitory, computer-readable medium of claim 2 , wherein the instructions are configured to cause the processor to reset the configuration details of the receiving device corresponding to one or more of the plurality of flags in response to the reset configuration request. | 4. The non-transitory, computer-readable medium of claim 2 , wherein the instructions are configured to cause the processor to reset the configuration details of the receiving device corresponding to one or more of the plurality of flags in response to the reset configuration request. 5. The non-transitory, computer-readable medium of claim 4 , wherein the instructions are configured to cause the processor to transmit the status report to a requesting device prior to resetting the configuration details of the receiving device to reduce likelihood of loss of communication with the requesting device prior to sending the status report to the requesting device. | 0.5 |
8,301,356 | 1 | 10 | 1. Method for estimating NOx creation in a combustion process of a four-stroke internal combustion engine including a variable volume combustion chamber defined by a piston reciprocating within a cylinder between top-dead center and bottom-dead center points, intake and exhaust passages, and intake and exhaust valves controlled during repetitive, sequential exhaust, intake, compression and expansion strokes of said piston, comprising: monitoring engine sensor inputs comprising a cylinder pressure within the combustion chamber; modeling a mass fraction burn value for combustion within the combustion chamber based upon said engine sensor inputs, wherein said mass fraction burn value indexes a crank angle at which a selected percentage of injected fuel is burned in a combustion cycle; estimating a state of combustion within the combustion chamber based upon the mass fraction burn value, the state of combustion comprising a combustion phasing and a combustion strength; and estimating NOx creation within the combustion chamber with an artificial neural network based upon said state of combustion. | 1. Method for estimating NOx creation in a combustion process of a four-stroke internal combustion engine including a variable volume combustion chamber defined by a piston reciprocating within a cylinder between top-dead center and bottom-dead center points, intake and exhaust passages, and intake and exhaust valves controlled during repetitive, sequential exhaust, intake, compression and expansion strokes of said piston, comprising: monitoring engine sensor inputs comprising a cylinder pressure within the combustion chamber; modeling a mass fraction burn value for combustion within the combustion chamber based upon said engine sensor inputs, wherein said mass fraction burn value indexes a crank angle at which a selected percentage of injected fuel is burned in a combustion cycle; estimating a state of combustion within the combustion chamber based upon the mass fraction burn value, the state of combustion comprising a combustion phasing and a combustion strength; and estimating NOx creation within the combustion chamber with an artificial neural network based upon said state of combustion. 10. The method of claim 1 , wherein estimating said NOx creation is further based upon: an estimated average temperature within said combustion chamber; a crank angle wherein a predetermined percentage of a fractional pressure rise in said combustion chamber is achieved; a percentage of intake comprising exhaust gas recirculation flow; an air-fuel ratio; and a fuel rail pressure. | 0.545238 |
9,934,777 | 5 | 6 | 5. A computer-implemented method, comprising: identifying a first language model configured for speech processing corresponding to multiple devices; identifying a first table representing words corresponding to the first language model; identifying a plurality of word strings associated with a first user profile; creating a second language model configured for speech processing corresponding to the plurality of word strings, the second language model including a plurality of references to a second table; generating a second table representing words of the plurality of word strings, the second table including at least: a first entry including a first word in the plurality of word strings and a first index value corresponding to a third entry in the first table, the third entry corresponding to the first word, and a second entry including a second word in the plurality of word strings and a second index value corresponding to a fourth entry in the first table, the fourth entry corresponding to the second word; generating a second language model configured for speech processing corresponding to the first user profile, the second language model including a third index value corresponding to the first entry and a fourth index value corresponding to the second entry; and storing the second table and the second language model as associated with the first user profile. | 5. A computer-implemented method, comprising: identifying a first language model configured for speech processing corresponding to multiple devices; identifying a first table representing words corresponding to the first language model; identifying a plurality of word strings associated with a first user profile; creating a second language model configured for speech processing corresponding to the plurality of word strings, the second language model including a plurality of references to a second table; generating a second table representing words of the plurality of word strings, the second table including at least: a first entry including a first word in the plurality of word strings and a first index value corresponding to a third entry in the first table, the third entry corresponding to the first word, and a second entry including a second word in the plurality of word strings and a second index value corresponding to a fourth entry in the first table, the fourth entry corresponding to the second word; generating a second language model configured for speech processing corresponding to the first user profile, the second language model including a third index value corresponding to the first entry and a fourth index value corresponding to the second entry; and storing the second table and the second language model as associated with the first user profile. 6. The computer-implemented method of claim 5 , further comprising: determining that at least a portion of the first table has changed resulting in an updated first table including a fifth entry corresponding to the first word and a sixth entry corresponding to the second word; generating an updated second table, the updated second table including at least: an updated first entry including the first word and a fifth index value corresponding to the fifth entry, and an updated second entry including the second word and a second index value corresponding to the sixth entry, wherein, after creating the updated second table, the third index value points to the updated first entry and the fourth index value points to the updated second entry. | 0.658592 |
7,992,140 | 1 | 6 | 1. A computer-readable medium having computer-executable instructions that when executed by a processor perform compiling a source program written in a native programming language, the source program having a plurality of internal semantic objects written in the native programming language, according to acts comprising: determining, based on an implicit type conversion, whether an internal semantic object of the plurality of internal semantic objects within the source program written in the native programming language is used in a way signifying that an external semantic data object is to be created to represent the internal semantic object; and selectively processing the internal semantic object based on the implicit type conversion, by: when the implicit type conversion indicates that the internal semantic object is used in a way signifying that the external semantic data object is to be created, processing, according to a syntax of the native programming language, the internal semantic object of the plurality of internal semantic objects and creating the external semantic data object representing the instructions included in the internal semantic object; and when the implicit type conversion does not indicate that the internal semantic object is used in a way signifying that the external semantic data object is to be created, converting the internal semantic object into object code. | 1. A computer-readable medium having computer-executable instructions that when executed by a processor perform compiling a source program written in a native programming language, the source program having a plurality of internal semantic objects written in the native programming language, according to acts comprising: determining, based on an implicit type conversion, whether an internal semantic object of the plurality of internal semantic objects within the source program written in the native programming language is used in a way signifying that an external semantic data object is to be created to represent the internal semantic object; and selectively processing the internal semantic object based on the implicit type conversion, by: when the implicit type conversion indicates that the internal semantic object is used in a way signifying that the external semantic data object is to be created, processing, according to a syntax of the native programming language, the internal semantic object of the plurality of internal semantic objects and creating the external semantic data object representing the instructions included in the internal semantic object; and when the implicit type conversion does not indicate that the internal semantic object is used in a way signifying that the external semantic data object is to be created, converting the internal semantic object into object code. 6. The computer-readable medium of claim 1 , wherein the external semantic data object contains a reference to a second external semantic data object. | 0.908648 |
8,266,148 | 9 | 10 | 9. The machine-implemented method of claim 1 wherein using a data processing machine to automatically process the ingested data with the plurality of different intelligence metric modules further comprises: generating key performance indicator analytic data associated with the domain-relevant classified data index that differs for different types of documents including: video analytics for video document types based on events, objects, activities or motion, image analytics for image document types based on events, objects or activities, audio analytics for audio type documents based on text translation, phonetics or emotion extraction, text information extraction based on natural language processing, statistical processing, or event detection or, or any combination thereof for documents of single or multiple types. | 9. The machine-implemented method of claim 1 wherein using a data processing machine to automatically process the ingested data with the plurality of different intelligence metric modules further comprises: generating key performance indicator analytic data associated with the domain-relevant classified data index that differs for different types of documents including: video analytics for video document types based on events, objects, activities or motion, image analytics for image document types based on events, objects or activities, audio analytics for audio type documents based on text translation, phonetics or emotion extraction, text information extraction based on natural language processing, statistical processing, or event detection or, or any combination thereof for documents of single or multiple types. 10. The machine-implemented method of claim 9 wherein the plurality of different intelligence metric modules process the ingested data including the key performance indicator analytic data to generate a series of key performance indicator tables stored in a structured query language database. | 0.5 |
7,921,186 | 9 | 14 | 9. A method for communicating with an individual, the method comprising: generating physiological information regarding said individual and transmitting said physiological information to an apparatus; transmitting said physiological information from said apparatus to a server; generating programming information on said server, wherein said programming information comprises at least one of (i) a query, (ii) a message corresponding to said individual from a health care professional associated with said individual, (iii) a computer program customized on said server using personal data relating to said individual, and (iv) information specific to said individual; transmitting said programming information from said server to said apparatus over a communication network, wherein (i) said server assigns said programming information to said individual based upon input from said health care professional associated with said individual and (ii) said query, said message, or said information specific to said individual is presented to said individual via a display connected to said apparatus; receiving responses to said query, said message, or said information specific to said individual from said individual via a user interface connected to said apparatus; and storing said responses in a database where said database is in communication with said server; wherein (i) said responses are transmitted to said server through said communication network, (ii) said programming information is related to a health condition of said individual, (iii) said individual is remotely situated from said server, (v) said programming information is presented to said individual by executing said computer program on said apparatus and (vi) said computer program comprises a custom script program (a) designed specifically for said individual, (b) associated with said individual by a unique identification code, and (c) configured to control a monitoring device. | 9. A method for communicating with an individual, the method comprising: generating physiological information regarding said individual and transmitting said physiological information to an apparatus; transmitting said physiological information from said apparatus to a server; generating programming information on said server, wherein said programming information comprises at least one of (i) a query, (ii) a message corresponding to said individual from a health care professional associated with said individual, (iii) a computer program customized on said server using personal data relating to said individual, and (iv) information specific to said individual; transmitting said programming information from said server to said apparatus over a communication network, wherein (i) said server assigns said programming information to said individual based upon input from said health care professional associated with said individual and (ii) said query, said message, or said information specific to said individual is presented to said individual via a display connected to said apparatus; receiving responses to said query, said message, or said information specific to said individual from said individual via a user interface connected to said apparatus; and storing said responses in a database where said database is in communication with said server; wherein (i) said responses are transmitted to said server through said communication network, (ii) said programming information is related to a health condition of said individual, (iii) said individual is remotely situated from said server, (v) said programming information is presented to said individual by executing said computer program on said apparatus and (vi) said computer program comprises a custom script program (a) designed specifically for said individual, (b) associated with said individual by a unique identification code, and (c) configured to control a monitoring device. 14. The method according to claim 9 , wherein said programming information from said server is provided by said health care professional via a computer in communication with said server. | 0.704762 |
9,355,157 | 1 | 4 | 1. A method performed by a trusted system comprising a processor and a non-transitory computer-readable storage medium storing instructions that, when executed by the processor, cause the trusted system to perform the method, the method comprising: receiving, at an interface of the trusted system, from a device, personal information relating to a user of the device, the personal information being provided by a plurality of trusted components included in a plurality of applications executing on the device; generating, based on the personal information, a person ontology graph relating to the user, the personal ontology graph comprising first level interest information relating to the user derived from at least one or more inferences based on the personal information, wherein generating the personal ontology graph further comprises: accessing an interest taxonomy database; identifying one or more second level interests included in the interest taxonomy database associated with the first level interest information, and including the one or more second level interests in the personal ontology graph; receiving, by the interface, a plurality of content items; selecting, based at least in part on the first level interest information and the one or more second level interests included in the personal ontology graph, a content item of the plurality of content items; and transmitting, from the interface, the selected content item to the user device for rendering by the device. | 1. A method performed by a trusted system comprising a processor and a non-transitory computer-readable storage medium storing instructions that, when executed by the processor, cause the trusted system to perform the method, the method comprising: receiving, at an interface of the trusted system, from a device, personal information relating to a user of the device, the personal information being provided by a plurality of trusted components included in a plurality of applications executing on the device; generating, based on the personal information, a person ontology graph relating to the user, the personal ontology graph comprising first level interest information relating to the user derived from at least one or more inferences based on the personal information, wherein generating the personal ontology graph further comprises: accessing an interest taxonomy database; identifying one or more second level interests included in the interest taxonomy database associated with the first level interest information, and including the one or more second level interests in the personal ontology graph; receiving, by the interface, a plurality of content items; selecting, based at least in part on the first level interest information and the one or more second level interests included in the personal ontology graph, a content item of the plurality of content items; and transmitting, from the interface, the selected content item to the user device for rendering by the device. 4. The method of claim 1 , wherein the personal information comprises an indication of one or more applications executing on the device. | 0.549669 |
8,924,195 | 1 | 4 | 1. A machine-translation apparatus comprising: an example storage unit that stores target language examples in a target language and source language examples in a source language in correspondence with one another, each of the target language examples having a meaning equivalent to a meaning of a corresponding one of the source language examples; an input receiving unit that receives an input sentence in the source language; a searching unit that conducts a search in the example storage unit for one of the target language examples corresponding to one of the source language examples that either matches or is similar to the input sentence; a translating unit that generates, using a processor, a reverse-translated sentence by translating the one of the target language examples found in the search into the source language; a detecting unit that detects difference portions between the reverse-translated sentence and the input sentence; a generating unit that generates an output sentence by adding the difference portions to the input sentence; an output unit that outputs, to a user, the output sentence to which the difference portions are added; and a selection receiving unit that receives a selection of one of the output difference portions, wherein; the translating unit further generates a target language sentence by translating a combination of the input sentence and the selected one of the difference portions, and the output unit further outputs the target language sentence. | 1. A machine-translation apparatus comprising: an example storage unit that stores target language examples in a target language and source language examples in a source language in correspondence with one another, each of the target language examples having a meaning equivalent to a meaning of a corresponding one of the source language examples; an input receiving unit that receives an input sentence in the source language; a searching unit that conducts a search in the example storage unit for one of the target language examples corresponding to one of the source language examples that either matches or is similar to the input sentence; a translating unit that generates, using a processor, a reverse-translated sentence by translating the one of the target language examples found in the search into the source language; a detecting unit that detects difference portions between the reverse-translated sentence and the input sentence; a generating unit that generates an output sentence by adding the difference portions to the input sentence; an output unit that outputs, to a user, the output sentence to which the difference portions are added; and a selection receiving unit that receives a selection of one of the output difference portions, wherein; the translating unit further generates a target language sentence by translating a combination of the input sentence and the selected one of the difference portions, and the output unit further outputs the target language sentence. 4. The apparatus according to claim 1 , wherein the example storage unit stores the target language examples and the source language examples in correspondence with one another, one or more words contained in a corresponding one of the target language examples being omissible from each of the source language examples, and the detecting unit detects, as one of the difference portions, the one or more words omitted from the one of the source language examples that either matches or is similar to the input sentence. | 0.635211 |
9,508,341 | 7 | 8 | 7. The system of claim 1 , wherein the one or more physical computer processors are programmed by the executable instructions to route the candidate word by at least: obtaining manual annotation resource information identifying an annotation resource; and generating a manual annotation route for the candidate word to the annotation resource based on the manual annotation resource information. | 7. The system of claim 1 , wherein the one or more physical computer processors are programmed by the executable instructions to route the candidate word by at least: obtaining manual annotation resource information identifying an annotation resource; and generating a manual annotation route for the candidate word to the annotation resource based on the manual annotation resource information. 8. The system of claim 7 , wherein the one or more physical computer processors are further programmed by the executable instructions to at least: receive manually provided pronunciation information for the candidate word; and retrain the grapheme-to-phoneme model based on the generated manual pronunciation. | 0.5 |
8,325,974 | 12 | 13 | 12. One or more computer-readable storage media storing computer-executable instructions that, when executed, cause one or more processors to perform acts comprising: identifying textual strings within a written work, each textual string corresponding to one of the plurality of character identities; creating character identity references for each of the identified textual strings, each character identity reference including a textual string position within the written work; grouping the character identity references by character identity to create reference groups; for each of the reference groups: determining a significance value based on a quantity of the character identity references and the textual string positions within the written work; and associating the determined significance value with the reference group; arranging the reference groups based on the determined significance values to create an ordered list; associating the ordered list with the written work; identifying a motion picture corresponding to the written work; identifying a collection of motion picture character names associated with the identified motion picture; and associating each of the identified motion picture character names with at least one reference group. | 12. One or more computer-readable storage media storing computer-executable instructions that, when executed, cause one or more processors to perform acts comprising: identifying textual strings within a written work, each textual string corresponding to one of the plurality of character identities; creating character identity references for each of the identified textual strings, each character identity reference including a textual string position within the written work; grouping the character identity references by character identity to create reference groups; for each of the reference groups: determining a significance value based on a quantity of the character identity references and the textual string positions within the written work; and associating the determined significance value with the reference group; arranging the reference groups based on the determined significance values to create an ordered list; associating the ordered list with the written work; identifying a motion picture corresponding to the written work; identifying a collection of motion picture character names associated with the identified motion picture; and associating each of the identified motion picture character names with at least one reference group. 13. The one or more computer-readable storage media of claim 12 storing computer-executable instructions that, when executed, cause one or more processors to perform further acts comprising: for each reference group: comparing the textual strings in the reference group with the identified collection of motion picture character names; and selecting the motion picture character name from the identified collection of motion picture character names that most closely matches the textual strings in the reference group. | 0.5 |
8,933,962 | 1 | 12 | 1. A method comprising: receiving a text query entered on a cartoon canvas, a location of the text query indicating a location of a cartoon object to be presented on the cartoon canvas, the text query comprising one or more keywords indicating content of the cartoon object; searching a plurality of images based on the text query to identify one or more clipart images that include one or more black strokes and one or more regions with uniform color, the plurality of images located in a database or in one or more network accessible sites; displaying the one or more clipart images; receiving a selection of a clipart image from the one or more clipart images as the cartoon object for the text query; modifying a presentation of the selected clipart image by vectorization of the selected clipart image and scaling a size of the selected clipart image; and modifying a style of one or more selected cartoon objects or the cartoon canvas. | 1. A method comprising: receiving a text query entered on a cartoon canvas, a location of the text query indicating a location of a cartoon object to be presented on the cartoon canvas, the text query comprising one or more keywords indicating content of the cartoon object; searching a plurality of images based on the text query to identify one or more clipart images that include one or more black strokes and one or more regions with uniform color, the plurality of images located in a database or in one or more network accessible sites; displaying the one or more clipart images; receiving a selection of a clipart image from the one or more clipart images as the cartoon object for the text query; modifying a presentation of the selected clipart image by vectorization of the selected clipart image and scaling a size of the selected clipart image; and modifying a style of one or more selected cartoon objects or the cartoon canvas. 12. A method as recited in claim 1 , further comprising changing a style of the clipart image. | 0.880102 |
8,661,027 | 1 | 6 | 1. A method of query based on a vertical search, the method comprising: receiving a user query; obtaining a first category model from a category model warehouse based on the user query to generate a first query result, the first category model comprising one or more commodity categories that correspond to one or more keywords in the user query; obtaining one or more commodity categories corresponding to the user query from a commodity warehouse to generate a second query result; and generating a final query result by combining the first query result and the second query result, wherein generating the final query result comprises: obtaining a first combined result comprising commodity categories that are in both the first query result and the second query result, the first combined result further comprising weights corresponding to the commodity categories in the first combined result and being a combination of weights from the first query result and from the second query result; obtaining a second combined result comprising commodity categories and corresponding weights in the second query result; increasing the weights in the first combined result to render the weights corresponding to the commodity categories in the first combined result to be respectively higher than the weights corresponding to the commodity categories in the second combined result; and arranging the commodity categories in the first combined result according to the weights in the first combined result in a descending order to provide the first combined result to a user. | 1. A method of query based on a vertical search, the method comprising: receiving a user query; obtaining a first category model from a category model warehouse based on the user query to generate a first query result, the first category model comprising one or more commodity categories that correspond to one or more keywords in the user query; obtaining one or more commodity categories corresponding to the user query from a commodity warehouse to generate a second query result; and generating a final query result by combining the first query result and the second query result, wherein generating the final query result comprises: obtaining a first combined result comprising commodity categories that are in both the first query result and the second query result, the first combined result further comprising weights corresponding to the commodity categories in the first combined result and being a combination of weights from the first query result and from the second query result; obtaining a second combined result comprising commodity categories and corresponding weights in the second query result; increasing the weights in the first combined result to render the weights corresponding to the commodity categories in the first combined result to be respectively higher than the weights corresponding to the commodity categories in the second combined result; and arranging the commodity categories in the first combined result according to the weights in the first combined result in a descending order to provide the first combined result to a user. 6. A method as recited in claim 1 , wherein the first combined result further comprises associated attribute categories that are in both the first query result and the second query result, and weights corresponding to the associated attribute categories in the first combined result; the second combined result further comprises associated attribute categories in the second query result, and weights corresponding to the associated attribute categories in the second query result; rendering the weights corresponding to the attribute categories in the first combined result to be respectively higher than the weights corresponding to the attribute categories in the second combined result; and arranging the associated attribute categories in the first combined result according to the weights corresponding to the attribute categories in the first combined result in a descending order to provide the first combined result to the user. | 0.661244 |
9,092,673 | 1 | 3 | 1. In a computing environment, a method comprising: receiving input comprising a tagged image collection, including a plurality of images with one or more associated text labels; identifying a first set of homogeneous relationships within the plurality of images to provide an image-to-image data structure, wherein the first set of homogeneous relationships represent pair-wise similarities between one or more images based on features of each image; identifying a second set of homogeneous relationships within words of the one or more associated text labels to provide a word-to-word data structure, wherein the second set of homogeneous relationships represent pair-wise similarities between the words of the one or more associated text labels; identifying a third set of heterogeneous relationships between the plurality of images and the words of the one or more associated text labels to provide an image-to-word data structure, wherein the third set of heterogeneous relationships define one or more associations between each of the plurality of images and each of the words of the one or more associated text labels; and processing the image-to-image data structure, the word-to-word data structure, and the image-to-word data structure simultaneously to identify both visual and textual exemplars for the tagged image collection and output at least one of a visual summary of the input or a textual summary of the input using the visual and textual exemplars. | 1. In a computing environment, a method comprising: receiving input comprising a tagged image collection, including a plurality of images with one or more associated text labels; identifying a first set of homogeneous relationships within the plurality of images to provide an image-to-image data structure, wherein the first set of homogeneous relationships represent pair-wise similarities between one or more images based on features of each image; identifying a second set of homogeneous relationships within words of the one or more associated text labels to provide a word-to-word data structure, wherein the second set of homogeneous relationships represent pair-wise similarities between the words of the one or more associated text labels; identifying a third set of heterogeneous relationships between the plurality of images and the words of the one or more associated text labels to provide an image-to-word data structure, wherein the third set of heterogeneous relationships define one or more associations between each of the plurality of images and each of the words of the one or more associated text labels; and processing the image-to-image data structure, the word-to-word data structure, and the image-to-word data structure simultaneously to identify both visual and textual exemplars for the tagged image collection and output at least one of a visual summary of the input or a textual summary of the input using the visual and textual exemplars. 3. The method of claim 1 wherein finding the second set of relationships between words comprises selecting pairs of words, and determining a similarity for each selected pair. | 0.696181 |
9,830,319 | 2 | 3 | 2. The method of claim 1 , further comprising: in the event that the value associated with the key-value pair is a composite value: pushing the value of the key-value pair to a temporary data structure. | 2. The method of claim 1 , further comprising: in the event that the value associated with the key-value pair is a composite value: pushing the value of the key-value pair to a temporary data structure. 3. The method of claim 2 , further comprising: determining whether the composite value associated with a key-value pair pushed to the temporary data structure includes one or more sub-key-value pairs; determining whether the one or more sub-key-value pairs are a scalar value or a composite value for each of the one or more sub-key-value pairs; in the event that the value associated with the sub-key-value pair is a scalar value: extracting the key name of the sub-key-value pair, checking whether the sub-tabular structure has a column associated with the extracted key name of the sub-key-value pair, and if so, storing the value of the sub-key-value pair in a row of the sub-tabular structure and mapping the value of the sub-key-value pair to the column, or if not, generating a new column associated with the sub-tabular structure, storing the value of the sub-key-value pair in a row of the sub-tabular structure and mapping the value of the sub-key-value pair to the new column; in the event that the value associated with the sub-key-value pair is a composite value: extracting the key name of the sub-key-value pair; generating a new sub-tabular structure associated with the extracted key name of the sub-key-value pair; and pushing the value of the sub-key-value pair to the temporary data structure; in the event that no value associated with the sub-key-value pair is a composite value, removing the pushed key-value pair from the temporary data structure. | 0.5 |
9,639,751 | 1 | 4 | 1. A system comprising: one or more processors; one or more non-transitory computer-readable mediums operatively coupled to the one or more processors, and having instructions stored thereon, that when executed by the one or more processors cause a computing device to: receive a document image file of a property record comprising one or more images; recognize a document title in the document image file; determine a document type of the property record based on the document title; recognize other data strings in the document image file; identify from the other data strings validation candidate data strings for validation based on the determined document type and a set of rules; search a validation server for target data strings that were extracted from at least one property document that precedes the property record; compare the validation candidate data strings and the target data strings to determine a validation score for each of the validation candidate data strings, wherein each of the validation scores indicates a confidence that a respective validation candidate data string was correctly recognized. | 1. A system comprising: one or more processors; one or more non-transitory computer-readable mediums operatively coupled to the one or more processors, and having instructions stored thereon, that when executed by the one or more processors cause a computing device to: receive a document image file of a property record comprising one or more images; recognize a document title in the document image file; determine a document type of the property record based on the document title; recognize other data strings in the document image file; identify from the other data strings validation candidate data strings for validation based on the determined document type and a set of rules; search a validation server for target data strings that were extracted from at least one property document that precedes the property record; compare the validation candidate data strings and the target data strings to determine a validation score for each of the validation candidate data strings, wherein each of the validation scores indicates a confidence that a respective validation candidate data string was correctly recognized. 4. The system of claim 1 , wherein the first set of rules used to identify the validation candidate data strings for validation are applicable in a hierarchical fashion according to a state, a county, or a recording jurisdiction associated with the property record. | 0.720464 |
9,311,932 | 1 | 11 | 1. A method for adaptive pause detection in speech recognition, the method comprising: receiving a speech stream comprising audio signal of a speech; marking a first point in the speech stream with a beginning time stamp; detecting, after the first point, a pause in the speech stream, wherein the pause is of a duration at least equal to a pause duration threshold; marking a second point after the pause in the speech stream with an ending time stamp, a portion of the speech stream between the beginning and the ending time stamps forming a first speech segment; computing a speech rate of the first speech segment using a number of words in the first speech segment, the beginning time stamp, and the ending time stamp; and adjusting, using a processor and a memory, the pause duration according to the speech rate of the first speech segment. | 1. A method for adaptive pause detection in speech recognition, the method comprising: receiving a speech stream comprising audio signal of a speech; marking a first point in the speech stream with a beginning time stamp; detecting, after the first point, a pause in the speech stream, wherein the pause is of a duration at least equal to a pause duration threshold; marking a second point after the pause in the speech stream with an ending time stamp, a portion of the speech stream between the beginning and the ending time stamps forming a first speech segment; computing a speech rate of the first speech segment using a number of words in the first speech segment, the beginning time stamp, and the ending time stamp; and adjusting, using a processor and a memory, the pause duration according to the speech rate of the first speech segment. 11. The method of claim 1 , wherein the pause duration threshold is a value that is determined and stored during a speech recognition of a previous speech segment of the speech stream. | 0.679443 |
9,514,361 | 1 | 9 | 1. A method for classifying range profiles, comprising: gathering non-sensor based sources of information giving structural details of objects of interest; selecting, from the non-sensor based sources of information, features of the objects of interest that are configured to appear most prominent as peaks of backscatter in a sensor based observation of the objects of interest; generating, for each of the objects of interest, a probabilistic model representing, for one or more different orientations of the respective object of interest, possible sequences of distances between the features of the respective object of interest selected from the non-sensor based sources of information that are configured to appear as distinct peaks of backscatter in sensor based range data for the object, wherein the possible sequences of distances are derived from a first probabilistic representation of each of the features of the respective object of interest; classifying a given sensor based range profile by deriving an observed sequence of distances from the spacing of distinct peaks of backscatter in the given sensor based range profile and by calculating, for each of the probabilistic models, a probability that the respective probabilistic model represents the observed sequence of distances, wherein the object of interest represented by the probabilistic model that represents the observed sequence of distances with the greatest probability is associated with the given sensor based range profile; and generating classification results for at least one of the probabilistic models so as to predict the potential performance of a classifier. | 1. A method for classifying range profiles, comprising: gathering non-sensor based sources of information giving structural details of objects of interest; selecting, from the non-sensor based sources of information, features of the objects of interest that are configured to appear most prominent as peaks of backscatter in a sensor based observation of the objects of interest; generating, for each of the objects of interest, a probabilistic model representing, for one or more different orientations of the respective object of interest, possible sequences of distances between the features of the respective object of interest selected from the non-sensor based sources of information that are configured to appear as distinct peaks of backscatter in sensor based range data for the object, wherein the possible sequences of distances are derived from a first probabilistic representation of each of the features of the respective object of interest; classifying a given sensor based range profile by deriving an observed sequence of distances from the spacing of distinct peaks of backscatter in the given sensor based range profile and by calculating, for each of the probabilistic models, a probability that the respective probabilistic model represents the observed sequence of distances, wherein the object of interest represented by the probabilistic model that represents the observed sequence of distances with the greatest probability is associated with the given sensor based range profile; and generating classification results for at least one of the probabilistic models so as to predict the potential performance of a classifier. 9. The method according to claim 1 , further comprising determining locations of observable features as linear distances from a reference point to the respective observable features, wherein the distances between observable features of the object are based at least in part of the locations of the observable features. | 0.828664 |
8,004,728 | 1 | 8 | 1. An image scanning device comprising: a scanning unit that scans an original document with a scanning condition to produce image data; a first storage unit that stores a specific condition used by the scanning unit for scanning a specific document, the specific condition including a limited requirement required by the specific document, and a limited scanning condition conforming to the limited requirement; a first determination unit that determines whether the scanning condition satisfies the limited requirement for the specific document; a control unit that causes the scanning unit to scan the original document with the scanning condition, if the first determination unit determines that the scanning condition satisfies the limited requirement for the specific document, the control unit causing the scanning unit to scan the original document with an initial condition to produce initial image data if the first determination unit determines that the scanning condition does not satisfy the limited requirement for the specific document; and a second determination unit that determines based on the initial image data whether the original document is the specific document, wherein the control unit causes the scanning unit to scan the original document with the scanning condition, if the second determination unit determines that the original document is not the specific document, and the control unit reads the specific condition from the first storage unit and causes the scanning unit to scan the original document with the limited scanning condition if the second determination unit determines that the original document is the specific document. | 1. An image scanning device comprising: a scanning unit that scans an original document with a scanning condition to produce image data; a first storage unit that stores a specific condition used by the scanning unit for scanning a specific document, the specific condition including a limited requirement required by the specific document, and a limited scanning condition conforming to the limited requirement; a first determination unit that determines whether the scanning condition satisfies the limited requirement for the specific document; a control unit that causes the scanning unit to scan the original document with the scanning condition, if the first determination unit determines that the scanning condition satisfies the limited requirement for the specific document, the control unit causing the scanning unit to scan the original document with an initial condition to produce initial image data if the first determination unit determines that the scanning condition does not satisfy the limited requirement for the specific document; and a second determination unit that determines based on the initial image data whether the original document is the specific document, wherein the control unit causes the scanning unit to scan the original document with the scanning condition, if the second determination unit determines that the original document is not the specific document, and the control unit reads the specific condition from the first storage unit and causes the scanning unit to scan the original document with the limited scanning condition if the second determination unit determines that the original document is the specific document. 8. The image scanning device according to claim 1 , wherein the initial image data has a color distribution, and the second determination unit performs the determination based on the color distribution. | 0.836039 |
8,577,864 | 1 | 3 | 1. A system for providing a validation tool comprising: a local computing device that comprises a memory component, the memory component storing validation tool logic that causes the system to perform at least the following: identify a plurality of words within a document, the document being provided in a first window within a user interface, wherein identifying the plurality of words includes determining that the plurality of words are formatted as a potential term of interest; access a predetermined list that includes terms of interest, wherein the predetermined list that includes the terms of interest is distinct from the document, wherein the predetermined list is common to a plurality of different documents; determine, from a predetermined list that includes the terms of interest, whether the plurality of words are matching words with the terms of interest; in response to determining that the plurality of words are matching words with the terms of interest, highlight the matching words in the document; perform a search for other documents that include the terms of interest; access pieces of related data from the other documents for the matching words; replace each of the matching words in the document with a corresponding link to the pieces of related data in the other documents; and create a second window within the user interface and provide the pieces of related data in the second window as a virtual document stack, wherein selection of one of the pieces of related data in the virtual document stack causes the document in the first window to scroll to one of the matching words in the document. | 1. A system for providing a validation tool comprising: a local computing device that comprises a memory component, the memory component storing validation tool logic that causes the system to perform at least the following: identify a plurality of words within a document, the document being provided in a first window within a user interface, wherein identifying the plurality of words includes determining that the plurality of words are formatted as a potential term of interest; access a predetermined list that includes terms of interest, wherein the predetermined list that includes the terms of interest is distinct from the document, wherein the predetermined list is common to a plurality of different documents; determine, from a predetermined list that includes the terms of interest, whether the plurality of words are matching words with the terms of interest; in response to determining that the plurality of words are matching words with the terms of interest, highlight the matching words in the document; perform a search for other documents that include the terms of interest; access pieces of related data from the other documents for the matching words; replace each of the matching words in the document with a corresponding link to the pieces of related data in the other documents; and create a second window within the user interface and provide the pieces of related data in the second window as a virtual document stack, wherein selection of one of the pieces of related data in the virtual document stack causes the document in the first window to scroll to one of the matching words in the document. 3. The system of claim 1 , wherein the validation tool logic further causes the system to provide an option to provide a legal matter to which a user is authorized. | 0.783069 |
7,801,912 | 64 | 65 | 64. The computer-implemented method as recited in claim 35 , further comprising propagating at least some searchable data service information from each of the plurality of nodes to others of the plurality of nodes in accordance with a gossip protocol. | 64. The computer-implemented method as recited in claim 35 , further comprising propagating at least some searchable data service information from each of the plurality of nodes to others of the plurality of nodes in accordance with a gossip protocol. 65. The computer-implemented method as recited in claim 64 , wherein the propagated searchable data service information includes update information for partitions of a particular searchable index replicated to two or more of the plurality of nodes. | 0.593443 |
7,937,402 | 19 | 20 | 19. A natural language based and keyword based location query method, the method comprising: receiving a request for a query for a location of an target entity having a specified geographical relationship to a known entity in the keyword query from a user terminal; a determining step of determining whether the received request is one of a request for a natural language query or a request for a keyword query; when the request is a request for the natural language query, a natural language query processing step of parsing the natural language query to determine the known entity of the natural language query and performing at least one of a fuzzy processing and an indirection processing on the request for natural language query sent from the user terminal by searching a location ontology database and a location query language database for the known entity, and retrieving location information corresponding to the known entity from a location database, wherein the location query language database is generated by creation of a domain query language and a common query language, wherein the domain query language is created by collecting question sentences for each domain, extracting syntax and a constant table from the question sentences, and combing the extracted syntax and a query action corresponding to the syntax, and the common query language is created by calculating a similarity among all domain query languages, and extracting a common query language, wherein the fuzzy processing step comprises at least one step of deleting redundant words based on a grammar feature, detecting and completing incomplete words based on the location ontology, and finding words omitted by the user by using context-aware technology based on the user's query history, and the indirection processing step comprises converting an indirect description in the query corresponding category name in the location ontology database by searching the category table in the location ontology base; and a first transmitting step of sending the location information of the known entity to the user terminal; when the request is a request for keyword query, a keyword query processing step of parsing the keyword query to determine the known entity of the keyword query and performing at least one of a fuzzy processing and an indirection processing on a request for keyword query sent from a user terminal by searching the location ontology database and the location query language database for the known entity, retrieving location information corresponding to the known entity form a location database; and a second transmitting step of sending the location information of the known entity to the user terminal, wherein the location ontology database includes an index that geographically relates the target entity to the known entity and the location query language database includes a syntax for a query to access a database having a location of the target entity. | 19. A natural language based and keyword based location query method, the method comprising: receiving a request for a query for a location of an target entity having a specified geographical relationship to a known entity in the keyword query from a user terminal; a determining step of determining whether the received request is one of a request for a natural language query or a request for a keyword query; when the request is a request for the natural language query, a natural language query processing step of parsing the natural language query to determine the known entity of the natural language query and performing at least one of a fuzzy processing and an indirection processing on the request for natural language query sent from the user terminal by searching a location ontology database and a location query language database for the known entity, and retrieving location information corresponding to the known entity from a location database, wherein the location query language database is generated by creation of a domain query language and a common query language, wherein the domain query language is created by collecting question sentences for each domain, extracting syntax and a constant table from the question sentences, and combing the extracted syntax and a query action corresponding to the syntax, and the common query language is created by calculating a similarity among all domain query languages, and extracting a common query language, wherein the fuzzy processing step comprises at least one step of deleting redundant words based on a grammar feature, detecting and completing incomplete words based on the location ontology, and finding words omitted by the user by using context-aware technology based on the user's query history, and the indirection processing step comprises converting an indirect description in the query corresponding category name in the location ontology database by searching the category table in the location ontology base; and a first transmitting step of sending the location information of the known entity to the user terminal; when the request is a request for keyword query, a keyword query processing step of parsing the keyword query to determine the known entity of the keyword query and performing at least one of a fuzzy processing and an indirection processing on a request for keyword query sent from a user terminal by searching the location ontology database and the location query language database for the known entity, retrieving location information corresponding to the known entity form a location database; and a second transmitting step of sending the location information of the known entity to the user terminal, wherein the location ontology database includes an index that geographically relates the target entity to the known entity and the location query language database includes a syntax for a query to access a database having a location of the target entity. 20. The method of claim 19 , wherein the natural language query processing step comprises: a parsing step of parsing the request for natural language query by searching a category table, an entity table in the location ontology database and the constant table of the syntax part in the location query language database; a fuzzy processing step of performing, to the fuzzy description in the parsed request, at least one step of deleting redundant words based on a grammar feature, detecting and completing incomplete words based on the location ontology, and finding words omitted by the user by using context-aware technology based on the user's query history; an indirection processing step of converting indirect description in the query into the corresponding category name in the location ontology database by searching the category table in the location ontology database; a query language matching step of matching the processed request with the location query language database, and generating the query action corresponding to the query; a database searching step of retrieving the query result from a location database according to the query action corresponding the query; and an answer fusing and generating step of fusing the query result to generate an answer, and sending the answer to the user terminal. | 0.557383 |
8,572,218 | 7 | 8 | 7. The method of claim 1 , further comprising: responsive to receiving from the client a request for a subsequent chunk of data without a compression dictionary identifier, generating a new compression dictionary; compressing the subsequent chunk of data using the new compression dictionary to form a subsequent compressed chunk of data; and transmitting the subsequent compressed chunk of data and the new compression dictionary from the server to the client. | 7. The method of claim 1 , further comprising: responsive to receiving from the client a request for a subsequent chunk of data without a compression dictionary identifier, generating a new compression dictionary; compressing the subsequent chunk of data using the new compression dictionary to form a subsequent compressed chunk of data; and transmitting the subsequent compressed chunk of data and the new compression dictionary from the server to the client. 8. The method of claim 7 , wherein the server transmits a flag indicating that a new compression dictionary is included with the subsequent compressed chunk of data. | 0.5 |
8,984,098 | 11 | 18 | 11. A system comprising: a processor; a model generation engine stored on a memory and executed by the processor, the model generation engine for generating a model for a user comprising an interest of the user and prior interaction of the user with heterogeneous data sources; a scoring engine stored on the memory and executed by the processor, the scoring engine coupled to the model generation engine for obtaining a group of candidate content items for one or more streams of content from the heterogeneous data sources, computing an interestingness score for each candidate content item in the group by combining properties of each candidate content item over single-attribute properties using the model and based upon interestingness of each candidate content item to the user and an extent to which the candidate content item's popularity has changed within a geographic area associated with the user and comparing the interestingness score for each candidate content item with a threshold for a first interest type and a second interest type to determine which candidate content items have an interestingness score that exceeds the threshold for the first interest type or the second interest type; and a user interface engine coupled to the scoring engine, the user interface engine for organizing a first content item and a second content item in a first stream of content based on candidate content items that have an interestingness score that exceeds the threshold for the first interest type or the second interest type, providing the first stream of content for presentation in a first direction to the user, generating a user interface for configuring the one or more streams of content, the user interface comprising the first content item, the second content item and a marker, the marker associated with the second content item for the user to request a third content item related to the second content item, and responsive to receiving a selection of the marker associated with the second content item from the user, organizing the second and third content items in a second stream of content, providing the second stream of content for presentation in a second direction to the user, and updating the user interface to include the second stream of content. | 11. A system comprising: a processor; a model generation engine stored on a memory and executed by the processor, the model generation engine for generating a model for a user comprising an interest of the user and prior interaction of the user with heterogeneous data sources; a scoring engine stored on the memory and executed by the processor, the scoring engine coupled to the model generation engine for obtaining a group of candidate content items for one or more streams of content from the heterogeneous data sources, computing an interestingness score for each candidate content item in the group by combining properties of each candidate content item over single-attribute properties using the model and based upon interestingness of each candidate content item to the user and an extent to which the candidate content item's popularity has changed within a geographic area associated with the user and comparing the interestingness score for each candidate content item with a threshold for a first interest type and a second interest type to determine which candidate content items have an interestingness score that exceeds the threshold for the first interest type or the second interest type; and a user interface engine coupled to the scoring engine, the user interface engine for organizing a first content item and a second content item in a first stream of content based on candidate content items that have an interestingness score that exceeds the threshold for the first interest type or the second interest type, providing the first stream of content for presentation in a first direction to the user, generating a user interface for configuring the one or more streams of content, the user interface comprising the first content item, the second content item and a marker, the marker associated with the second content item for the user to request a third content item related to the second content item, and responsive to receiving a selection of the marker associated with the second content item from the user, organizing the second and third content items in a second stream of content, providing the second stream of content for presentation in a second direction to the user, and updating the user interface to include the second stream of content. 18. The system of claim 11 , wherein the first content item is displayed with a button for removing the first type of interest from the model. | 0.785498 |
9,836,301 | 1 | 3 | 1. A method for component discovery from source code, the method performed by a processor and comprising: receiving source code; determining business classes by determining a component identification boundary in the source code; extracting features from the business classes by extracting packaging information for each of the business classes, wherein extracting packaging information for each of the business classes includes extracting concept words embedded in business class names, extracting a packaging hierarchy as a string, and extracting a substring that describes the packaging hierarchy; estimating similarity for business class pairs based on the extracted features; clustering the business classes based on the similarity, wherein clusters generated by the clustering represent components of the source code; and determining interfaces for the components based on the clustering. | 1. A method for component discovery from source code, the method performed by a processor and comprising: receiving source code; determining business classes by determining a component identification boundary in the source code; extracting features from the business classes by extracting packaging information for each of the business classes, wherein extracting packaging information for each of the business classes includes extracting concept words embedded in business class names, extracting a packaging hierarchy as a string, and extracting a substring that describes the packaging hierarchy; estimating similarity for business class pairs based on the extracted features; clustering the business classes based on the similarity, wherein clusters generated by the clustering represent components of the source code; and determining interfaces for the components based on the clustering. 3. The method of claim 1 , wherein clustering the business classes based on the similarity further comprises: generating partitions for the clusters by determining, for each node in a cluster, whether the node belongs to the cluster or to a different cluster, wherein the node represents a business class; and moving, based on the determination that the node belongs to the different cluster, the node to the different cluster. | 0.5 |
7,982,737 | 20 | 21 | 20. A non-transitory computer-readable storage medium, comprising program instructions computer-executable to: receive an item, wherein the item indicates a text string comprising a plurality of characters, and a respective preferred font for each character of said plurality of characters; perform a character-by-character font substitution analysis on each character of said text string, wherein performing said analysis comprises: in response to determining that the preferred font is not available for a particular character, resolve the particular character with a particular glyph from a font of a set of multiple safe fonts, wherein said particular glyph matches said particular character, and wherein said set of safe fonts collectively spans a character set; in response to determining that the preferred font is not available for an other character of the same text string, resolve the other character with an other glyph from a different font of said set of safe fonts, wherein said other glyph matches said other character; and generate a resolved text string comprising said particular glyph and said other glyph. | 20. A non-transitory computer-readable storage medium, comprising program instructions computer-executable to: receive an item, wherein the item indicates a text string comprising a plurality of characters, and a respective preferred font for each character of said plurality of characters; perform a character-by-character font substitution analysis on each character of said text string, wherein performing said analysis comprises: in response to determining that the preferred font is not available for a particular character, resolve the particular character with a particular glyph from a font of a set of multiple safe fonts, wherein said particular glyph matches said particular character, and wherein said set of safe fonts collectively spans a character set; in response to determining that the preferred font is not available for an other character of the same text string, resolve the other character with an other glyph from a different font of said set of safe fonts, wherein said other glyph matches said other character; and generate a resolved text string comprising said particular glyph and said other glyph. 21. The medium of claim 20 , wherein said item indicates dimensions of a bounding box for the text string, wherein the program instructions are executable to scale the size of the resolved text string according to the dimensions of the bounding box. | 0.594463 |
9,741,138 | 14 | 17 | 14. A computer system comprising: a processor, a computer readable memory, and a computer readable storage medium; first program instructions to receive a data stream that describes graph nodes in a non-hierarchical graph database; second program instructions to define multiple graph node clusters from the graph nodes in the non-hierarchical graph database; and third program instructions to generate a cluster edge between two graph node clusters from the multiple graph node clusters in the non-hierarchical graph database, wherein the cluster edge describes a relationship between the two graph node clusters; fourth program instructions to associate a non-contextual data object with a context object to define a synthetic context-based object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, and wherein the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object; fifth program instructions to combine synthetic context-based objects that each contain a same non-contextual data object and a different context object from a first set of different context objects into a first synthetic context-based objects graph node cluster; sixth program instructions to combine synthetic context-based objects that each contain the same non-contextual data object and a different context object from a second set of different context objects into a second synthetic context-based objects graph node cluster; seventh program instructions to display the same non-contextual data object in a context-based cluster edge that links the first synthetic context-based objects graph node cluster to the second synthetic context-based objects graph node cluster; eighth program instructions to transmit only information in the cluster edge to a party that is not allowed to view contents of the graph nodes in the non-hierarchical graph database, wherein transmitting only the information in the cluster edge enhances security of the non-hierarchical graph database; ninth program instructions to communicate the information from the cluster edge without the content of the graph nodes to a cache at a remote location, wherein communicating the information from the cluster edge without the content of the graph nodes reduces communication bandwidth consumption for a network that is coupled to the cache, and wherein communicating the information from the cluster edge without the content of the graph nodes reduces an amount of storage consumed in the cache; and tenth program instructions to execute a computation using only information stored in the cache that came from the cluster edge without the content of the graph nodes, wherein execution of the computation is improved by using only information from the cluster edge without the content of the graph nodes; and wherein the first, second, third, fourth, fifth, sixth, seventh, eighth, ninth, and tenth program instructions are stored on the computer readable storage medium for execution by the processor via the computer readable memory. | 14. A computer system comprising: a processor, a computer readable memory, and a computer readable storage medium; first program instructions to receive a data stream that describes graph nodes in a non-hierarchical graph database; second program instructions to define multiple graph node clusters from the graph nodes in the non-hierarchical graph database; and third program instructions to generate a cluster edge between two graph node clusters from the multiple graph node clusters in the non-hierarchical graph database, wherein the cluster edge describes a relationship between the two graph node clusters; fourth program instructions to associate a non-contextual data object with a context object to define a synthetic context-based object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, and wherein the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object; fifth program instructions to combine synthetic context-based objects that each contain a same non-contextual data object and a different context object from a first set of different context objects into a first synthetic context-based objects graph node cluster; sixth program instructions to combine synthetic context-based objects that each contain the same non-contextual data object and a different context object from a second set of different context objects into a second synthetic context-based objects graph node cluster; seventh program instructions to display the same non-contextual data object in a context-based cluster edge that links the first synthetic context-based objects graph node cluster to the second synthetic context-based objects graph node cluster; eighth program instructions to transmit only information in the cluster edge to a party that is not allowed to view contents of the graph nodes in the non-hierarchical graph database, wherein transmitting only the information in the cluster edge enhances security of the non-hierarchical graph database; ninth program instructions to communicate the information from the cluster edge without the content of the graph nodes to a cache at a remote location, wherein communicating the information from the cluster edge without the content of the graph nodes reduces communication bandwidth consumption for a network that is coupled to the cache, and wherein communicating the information from the cluster edge without the content of the graph nodes reduces an amount of storage consumed in the cache; and tenth program instructions to execute a computation using only information stored in the cache that came from the cluster edge without the content of the graph nodes, wherein execution of the computation is improved by using only information from the cluster edge without the content of the graph nodes; and wherein the first, second, third, fourth, fifth, sixth, seventh, eighth, ninth, and tenth program instructions are stored on the computer readable storage medium for execution by the processor via the computer readable memory. 17. The computer system of claim 14 , wherein the relationship between the two graph node clusters comprises a description of an upstream connection from one of the graph node clusters to an upstream node cluster. | 0.741505 |
9,613,133 | 11 | 14 | 11. A system comprising: a memory having computer readable instructions; and a processor for executing the computer readable instructions, the computer readable instructions including: determining a set of search terms based on a given question; searching a document using the set of search terms; identifying a plurality of passages in the document in response to the searching, each of the plurality of passages including at least one search term in the set of search terms; selecting a passage from the plurality of passages; and generating, by the question answering computer system, a context based score of the selected passage that indicates a likelihood that the selected passage contains an answer to the question, the generating based on criteria that specify a relationship among the set of search terms, content of the passage, and content of at least one other passage in the plurality of passages comprising: calculating a first score based on the content of the selected passage and a first subset of the set of search terms, the content of the selected passage including the first subset; creating a list containing a second subset of the set of search terms, the second subset is different than the first subset and is not included in the content of the selected passage; performing repeatedly until the list is empty: determining whether there is at least one other passage in the plurality of passages; selecting one of the at least one other passage in response to determining that there is at least one other passage in the plurality of passages, the one of the at least one other passage contains at least one search term in the list, the selecting is performed in an order of closest proximity to the selected passage in the document; generating a second score by scoring the one of the at least one other passage based on the at least one search term in the list that is contained in the one of the at least one other passage, and removal of the first subset from the at least one other passage; updating the second score based on a distance in the document between the selected passage and the at least one other passage; aggregating the first score and the updated second score by adding the first score to the updated second score to generate the context based score; and in response to the adding, updating the list by removing from the list all search terms, including the at least one search term, contained in the at least one other passage. | 11. A system comprising: a memory having computer readable instructions; and a processor for executing the computer readable instructions, the computer readable instructions including: determining a set of search terms based on a given question; searching a document using the set of search terms; identifying a plurality of passages in the document in response to the searching, each of the plurality of passages including at least one search term in the set of search terms; selecting a passage from the plurality of passages; and generating, by the question answering computer system, a context based score of the selected passage that indicates a likelihood that the selected passage contains an answer to the question, the generating based on criteria that specify a relationship among the set of search terms, content of the passage, and content of at least one other passage in the plurality of passages comprising: calculating a first score based on the content of the selected passage and a first subset of the set of search terms, the content of the selected passage including the first subset; creating a list containing a second subset of the set of search terms, the second subset is different than the first subset and is not included in the content of the selected passage; performing repeatedly until the list is empty: determining whether there is at least one other passage in the plurality of passages; selecting one of the at least one other passage in response to determining that there is at least one other passage in the plurality of passages, the one of the at least one other passage contains at least one search term in the list, the selecting is performed in an order of closest proximity to the selected passage in the document; generating a second score by scoring the one of the at least one other passage based on the at least one search term in the list that is contained in the one of the at least one other passage, and removal of the first subset from the at least one other passage; updating the second score based on a distance in the document between the selected passage and the at least one other passage; aggregating the first score and the updated second score by adding the first score to the updated second score to generate the context based score; and in response to the adding, updating the list by removing from the list all search terms, including the at least one search term, contained in the at least one other passage. 14. The system of claim 11 , wherein the generating a context based score is further based on at least one of a vector space model, a BM25 model, and a query likelihood model. | 0.5 |
7,788,134 | 15 | 16 | 15. The method of claim 14 , wherein the map is provided with a modifiable map attribute. | 15. The method of claim 14 , wherein the map is provided with a modifiable map attribute. 16. The method of claim 15 , wherein a user can directly modify the map attribute. | 0.753012 |
8,370,127 | 8 | 13 | 8. At least one tangible non-transitory computer-readable storage medium having encoded thereon computer instructions that, when executed, perform a method for providing a statistical initial topic classification model for use in a natural language call routing application to map a natural language user statement to at least one of a plurality of topics in the natural language call routing application, the method comprising acts of: accessing a voice user interface (VUI) specification that specifies a VUI for allowing users to interact with the natural language call routing application, the VUI specification comprising a plurality of expressions of possible user intentions composed by at least one VUI designer, the VUI specification further comprising, for each one of the plurality of expressions of possible user intentions, at least one system response or action defined by the at least one VUI designer as corresponding to the one of the plurality of expressions of possible user intentions; analyzing the VUI specification to determine a plurality of topic descriptions, each one of the plurality of topic descriptions describing a meaning of a corresponding one of the plurality of topics; and using, as training data, the plurality of topic descriptions determined by analyzing the VUI specification to build the statistical initial topic classification model, comprising; identifying keywords in the plurality of topic descriptions used as training data to build the statistical initial topic classification model; providing an optimal feature set comprising at least one combination of at least some of the keywords; and using at least one computer to build the statistical initial topic classification model based at least partially on the optimal feature set. | 8. At least one tangible non-transitory computer-readable storage medium having encoded thereon computer instructions that, when executed, perform a method for providing a statistical initial topic classification model for use in a natural language call routing application to map a natural language user statement to at least one of a plurality of topics in the natural language call routing application, the method comprising acts of: accessing a voice user interface (VUI) specification that specifies a VUI for allowing users to interact with the natural language call routing application, the VUI specification comprising a plurality of expressions of possible user intentions composed by at least one VUI designer, the VUI specification further comprising, for each one of the plurality of expressions of possible user intentions, at least one system response or action defined by the at least one VUI designer as corresponding to the one of the plurality of expressions of possible user intentions; analyzing the VUI specification to determine a plurality of topic descriptions, each one of the plurality of topic descriptions describing a meaning of a corresponding one of the plurality of topics; and using, as training data, the plurality of topic descriptions determined by analyzing the VUI specification to build the statistical initial topic classification model, comprising; identifying keywords in the plurality of topic descriptions used as training data to build the statistical initial topic classification model; providing an optimal feature set comprising at least one combination of at least some of the keywords; and using at least one computer to build the statistical initial topic classification model based at least partially on the optimal feature set. 13. The at least one tangible non-transitory computer-readable storage medium of claim 8 , wherein each topic description describes a relationship between an intent of a user and a corresponding system response. | 0.779749 |
7,627,555 | 19 | 22 | 19. The method of claim 13 , further comprising providing a language schema for integrating the multidimensional expressions and the data mining extensions; and wherein integrating the multidimensional expressions and the data mining extensions into input for data mining model creation comprises integrating the multidimensional expressions and the data mining extensions into input for data mining model creation in accordance with the provided language schema. | 19. The method of claim 13 , further comprising providing a language schema for integrating the multidimensional expressions and the data mining extensions; and wherein integrating the multidimensional expressions and the data mining extensions into input for data mining model creation comprises integrating the multidimensional expressions and the data mining extensions into input for data mining model creation in accordance with the provided language schema. 22. The method as recited in claim 19 , wherein integrating the multidimensional expressions and the data mining extensions into input for data mining model creation in accordance with the provided language schema comprises integrating the multidimensional expressions and the data mining extensions by accepting a multidimensional extension that replaces an relational query with an integrated expression. | 0.540724 |
7,835,545 | 6 | 23 | 6. A system for enabling sighted persons who cannot read a standard alphanumeric text to pictorially communicate and interact with an environment via computer sensory perception, comprising: data entering means for acquiring alphanumeric text; encoding means for converting said alphanumeric text into a machine-readable set of informationally corresponding data; decoding means for correlating said informational content data set with one or more hieroglyphs that are representative of the actions, physical objects and the relationship between said actions and said physical objects presented by said informationally corresponding data set and arranging said one or more hieroglyphs syntactically to pictorially represent said informationally corresponding data set for said sighted persons thereby to inform said sighted person of said actions, objects and the relationship between said actions and said objects as was originally presented in said standard alphanumeric text; computer sensory perception means for enabling said sighted person to interact with an environment and act on the information conveyed by the hieroglyphs; and for recording inputs enabling said sighted person to record said sighted person's interaction with the environment; and said input analyzed via a computer processing means and added to the informational content data set, the computer processing means isolating those inputs not already present in the informational content data set and assigning additional hieroglyphs that are representative of the new actions, new physical objects and new relationships between said actions and physical objects presented by said informationally corresponding data set, the additional hieroglyphs used to allow the informational content data set to adapt to new environments and provide cognitive reasoning support and learning to the sighted person. | 6. A system for enabling sighted persons who cannot read a standard alphanumeric text to pictorially communicate and interact with an environment via computer sensory perception, comprising: data entering means for acquiring alphanumeric text; encoding means for converting said alphanumeric text into a machine-readable set of informationally corresponding data; decoding means for correlating said informational content data set with one or more hieroglyphs that are representative of the actions, physical objects and the relationship between said actions and said physical objects presented by said informationally corresponding data set and arranging said one or more hieroglyphs syntactically to pictorially represent said informationally corresponding data set for said sighted persons thereby to inform said sighted person of said actions, objects and the relationship between said actions and said objects as was originally presented in said standard alphanumeric text; computer sensory perception means for enabling said sighted person to interact with an environment and act on the information conveyed by the hieroglyphs; and for recording inputs enabling said sighted person to record said sighted person's interaction with the environment; and said input analyzed via a computer processing means and added to the informational content data set, the computer processing means isolating those inputs not already present in the informational content data set and assigning additional hieroglyphs that are representative of the new actions, new physical objects and new relationships between said actions and physical objects presented by said informationally corresponding data set, the additional hieroglyphs used to allow the informational content data set to adapt to new environments and provide cognitive reasoning support and learning to the sighted person. 23. The system according to claim 6 wherein said correlation of said informational content data set with one or more hieroglyphs includes a non-relational database. | 0.849817 |
8,554,599 | 1 | 3 | 1. A computer-implemented method of regulating user action affecting one or more work items of a work item tracking system for a software development environment, the method comprising acts of: providing a software development environment including software development work item rules that regulate user action affecting work items during software development using the software development environment, each work item comprising a software element that can be accessed or modified by a user based on one or more of the software development work item rules, the software element being an element under development in the software development environment, the software development work item rules selectively authorizing user access and modification of specified work items; in response to a first user action affecting a first work item of the work item tracking system, determining, in a client computing device, one or more software development work item rules corresponding to the first work item; interpreting, in the client computing device, the one or more determined software development work item rules; and responding, in the client computing device, to the first user action by authorizing user access or modification of the first work item based on the interpretation of the one or more determined software development work item rules, wherein the work item tracking system is distributed across at least a first network element and a second network element connected to the first network element by one or more communication media, the first network element comprising a first module, and the second network element comprising a second module, the method further comprising an act of: the first module receiving input from a user specifying a user action affecting the first work item, wherein the acts of determining, interpreting and responding are performed by the first module, and wherein the method further comprises: the second module interpreting the one or more determined work item rules. | 1. A computer-implemented method of regulating user action affecting one or more work items of a work item tracking system for a software development environment, the method comprising acts of: providing a software development environment including software development work item rules that regulate user action affecting work items during software development using the software development environment, each work item comprising a software element that can be accessed or modified by a user based on one or more of the software development work item rules, the software element being an element under development in the software development environment, the software development work item rules selectively authorizing user access and modification of specified work items; in response to a first user action affecting a first work item of the work item tracking system, determining, in a client computing device, one or more software development work item rules corresponding to the first work item; interpreting, in the client computing device, the one or more determined software development work item rules; and responding, in the client computing device, to the first user action by authorizing user access or modification of the first work item based on the interpretation of the one or more determined software development work item rules, wherein the work item tracking system is distributed across at least a first network element and a second network element connected to the first network element by one or more communication media, the first network element comprising a first module, and the second network element comprising a second module, the method further comprising an act of: the first module receiving input from a user specifying a user action affecting the first work item, wherein the acts of determining, interpreting and responding are performed by the first module, and wherein the method further comprises: the second module interpreting the one or more determined work item rules. 3. The method of claim 1 , wherein at least one of the one or more determined work item rules corresponds to content of a work item, and wherein the interpreting comprises interpreting the at least one determined work item rule. | 0.869863 |
9,646,055 | 10 | 11 | 10. The method of claim 1 , further comprising: accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising: a first node corresponding to the first user; and a plurality of second nodes that each correspond to a concept or a second user associated with the online social network. | 10. The method of claim 1 , further comprising: accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising: a first node corresponding to the first user; and a plurality of second nodes that each correspond to a concept or a second user associated with the online social network. 11. The method of claim 10 , wherein each search-result module corresponds to a structured query comprising references to one or more nodes and one or more edges, the structured query being based on the query command corresponding to the search-result module. | 0.5 |
9,600,842 | 82 | 87 | 82. The computer program product of claim 29 , wherein the computer program product is configured for identifying taxonomy software elements in connection with at least one source data document. | 82. The computer program product of claim 29 , wherein the computer program product is configured for identifying taxonomy software elements in connection with at least one source data document. 87. The computer program product of claim 82 , wherein the computer program product is configured such that the taxonomy software elements are transformed to new taxonomy software elements and are imported into a reusable data markup language computer program product. | 0.850613 |
8,750,630 | 18 | 19 | 18. A non-transitory computer readable medium storing computer instructions, which when executed, enables a computer system to watermark content stored in a plurality of corpora each having a plurality of corpuses, the executed computer instructions causing the computer system to perform a method comprising: receiving a data set of content from a corpus within one of the plurality of corpora; applying the data set to a natural language processing (NLP) stack including a plurality of NLP analytics each analyzing the data set; generating a feature watermark from each of the plurality of NLP analytics; and forming a watermark tree from each of the feature watermarks, the watermark tree representing a hierarchical relationship between each of the feature watermarks generated from each of the plurality of NLP analytics, the watermark tree defining hierarchical pointers that point out inherited watermarks that exist between the feature watermarks according to the hierarchical relationship, the watermark tree including a time stamp specifying a time that the data set was accessed. | 18. A non-transitory computer readable medium storing computer instructions, which when executed, enables a computer system to watermark content stored in a plurality of corpora each having a plurality of corpuses, the executed computer instructions causing the computer system to perform a method comprising: receiving a data set of content from a corpus within one of the plurality of corpora; applying the data set to a natural language processing (NLP) stack including a plurality of NLP analytics each analyzing the data set; generating a feature watermark from each of the plurality of NLP analytics; and forming a watermark tree from each of the feature watermarks, the watermark tree representing a hierarchical relationship between each of the feature watermarks generated from each of the plurality of NLP analytics, the watermark tree defining hierarchical pointers that point out inherited watermarks that exist between the feature watermarks according to the hierarchical relationship, the watermark tree including a time stamp specifying a time that the data set was accessed. 19. The non-transitory computer readable medium according to claim 18 , wherein the method performed by the computer system operating according to the executed computer instructions further comprises storing the watermark tree in the corpus with a corpus time stamp and applying a corpora time stamp to the corpora associated with the corpus in response to storing the watermark in the corpus, the corpus including a plurality of watermark trees each formed at a different time stamp, and the corpora including a plurality of corpora time stamps each associated with storing one of the plurality of watermark trees in the corpus. | 0.5 |
8,515,843 | 1 | 11 | 1. A computer-implemented method, comprising: obtaining, at a computing system, from a computing device, a request comprising a keyword context for a container document holding an embedded client application and a geographic context associated with the computing device on which the container document is located, wherein the computing system is separate from the computing device; using the keyword context and geographic context to generate, with the computing system, information that identifies one or more goods or services that are made available by an entity that is determined to be located in a geographic area that corresponds to the geographic context in contrast to other geographic areas; and sending the generated information from the computing system to the computing device. | 1. A computer-implemented method, comprising: obtaining, at a computing system, from a computing device, a request comprising a keyword context for a container document holding an embedded client application and a geographic context associated with the computing device on which the container document is located, wherein the computing system is separate from the computing device; using the keyword context and geographic context to generate, with the computing system, information that identifies one or more goods or services that are made available by an entity that is determined to be located in a geographic area that corresponds to the geographic context in contrast to other geographic areas; and sending the generated information from the computing system to the computing device. 11. The method of claim 1 , wherein the request from the computing device is encrypted. | 0.832046 |
9,430,738 | 16 | 23 | 16. A computer-implemented social media intelligence system comprising: a. a digital processor performing a computer program comprising executable instructions stored on a memory device; b. the computer program providing a social media intelligence application comprising: i. a first software module obtaining real-time social media conversations; ii. a second software module automatically classifying, categorizing and summarizing expressed emotions in said real-time social media conversations by using a knowledge base of emotional words, or phrases, or both words and phrases as an input, wherein the knowledge base comprises a list of emotional tokens and pairwise token distance using a degree of similarity, each pair associated with a valence and arousal score expressed on a scale; iii. a third software module defining a continuous distance metric between said real-time social media conversations comprising same or different number of the emotional tokens utilizing an expand-align-compare (EAC) algorithm; iv. a fourth software module conducting hierarchical clustering based on that distance metric; and vi. a fifth software module outputting a result associated with said hierarchical clustering. | 16. A computer-implemented social media intelligence system comprising: a. a digital processor performing a computer program comprising executable instructions stored on a memory device; b. the computer program providing a social media intelligence application comprising: i. a first software module obtaining real-time social media conversations; ii. a second software module automatically classifying, categorizing and summarizing expressed emotions in said real-time social media conversations by using a knowledge base of emotional words, or phrases, or both words and phrases as an input, wherein the knowledge base comprises a list of emotional tokens and pairwise token distance using a degree of similarity, each pair associated with a valence and arousal score expressed on a scale; iii. a third software module defining a continuous distance metric between said real-time social media conversations comprising same or different number of the emotional tokens utilizing an expand-align-compare (EAC) algorithm; iv. a fourth software module conducting hierarchical clustering based on that distance metric; and vi. a fifth software module outputting a result associated with said hierarchical clustering. 23. The system of claim 16 , wherein the valence and arousal scores are derived from a sample of social media communications containing at least one of the tokens. | 0.528902 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.