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
|
|---|---|---|---|---|---|
9,179,278 | 1 | 2 |
1. A method comprising: displaying in a camera view of a mobile device a captured image of one or more items available for selection at a point of interest, wherein the point of interest is identifiable, at least in part, by a location determined based, at least in part, on information associated with a location context identifier, wherein the location context identifier pertains to information to identify an area of a building; transmitting, by the mobile device to a server, a message comprising the location context identifier and parsed text of a particular item selected from among the one or more items based upon a user-input detected by the mobile device, wherein the transmitted location context identifier is separate from the captured image and is usable to search for information related to the particular item; and receiving, in response to said transmission of said message, one or more annotations that include information about the particular item to be displayed in said camera view, wherein said one or more annotations are superimposed in a portion of said camera view including said captured image of said particular item.
|
1. A method comprising: displaying in a camera view of a mobile device a captured image of one or more items available for selection at a point of interest, wherein the point of interest is identifiable, at least in part, by a location determined based, at least in part, on information associated with a location context identifier, wherein the location context identifier pertains to information to identify an area of a building; transmitting, by the mobile device to a server, a message comprising the location context identifier and parsed text of a particular item selected from among the one or more items based upon a user-input detected by the mobile device, wherein the transmitted location context identifier is separate from the captured image and is usable to search for information related to the particular item; and receiving, in response to said transmission of said message, one or more annotations that include information about the particular item to be displayed in said camera view, wherein said one or more annotations are superimposed in a portion of said camera view including said captured image of said particular item. 2. The method of claim 1 , wherein said one or more annotations comprise purchase prices of said particular item.
| 0.66369 |
5,491,796 | 1 | 4 |
1. An apparatus for remotely managing diverse information network resources, comprising: a plurality of heterogeneous, remote devices of functionally diverse classes, each device providing raw information in one of a plurality of heterogeneous formats, wherein said format is specific to each device and to each device functional class; a protocol module located at a network management site and in communication with said remote devices for scheduling remote device polls to optimize remote device polling and minimize use of said information network; a values module located at said network management site for storing data obtained by polling said remote devices, wherein said data are representative by events that occur at said remote devices as the events occur over time, said values module being operable to store, retrieve, and manipulate said raw information, said values module including a time stamp for use in connection with recording a time of occurrence of said remote device events, processing time varying data from said stored remote device events, and for storing common groupings of said raw information; a nonprocedural builder module located at said network management site and operable to generate a data specification module; said data specification module located at said network management site and operable to store information that specifies device content and behavior for each of said heterogeneous, functionally diverse, remote devices in the form of a device specific representation, wherein said representation appears to a user in the same format for each device within a device functional class even though each functional class may include a plurality of heterogeneous remote devices; an engine located at said network management site, said engine being operable to read information stored in said data specification module and to generate said device specific representation for each of said remote devices therefrom and, based on the contents of said data specification module and said raw information from said remote devices, to control operation of said remote devices, to enable polls of said remote devices by said protocol module, to process said raw information in accordance with said information stored in said data specification module, to process said common groupings of said raw information stored in said values module from two or more of said remote devices to generate information characterizing inter-device performance therefrom, and to generate poll results for each of said remote devices in the form of said device specific representations; and a user interface module located at said network management site, and, responsive to said engine, for displaying said device specific representations of said remote devices at said network management site as a user controlled virtual panel.
|
1. An apparatus for remotely managing diverse information network resources, comprising: a plurality of heterogeneous, remote devices of functionally diverse classes, each device providing raw information in one of a plurality of heterogeneous formats, wherein said format is specific to each device and to each device functional class; a protocol module located at a network management site and in communication with said remote devices for scheduling remote device polls to optimize remote device polling and minimize use of said information network; a values module located at said network management site for storing data obtained by polling said remote devices, wherein said data are representative by events that occur at said remote devices as the events occur over time, said values module being operable to store, retrieve, and manipulate said raw information, said values module including a time stamp for use in connection with recording a time of occurrence of said remote device events, processing time varying data from said stored remote device events, and for storing common groupings of said raw information; a nonprocedural builder module located at said network management site and operable to generate a data specification module; said data specification module located at said network management site and operable to store information that specifies device content and behavior for each of said heterogeneous, functionally diverse, remote devices in the form of a device specific representation, wherein said representation appears to a user in the same format for each device within a device functional class even though each functional class may include a plurality of heterogeneous remote devices; an engine located at said network management site, said engine being operable to read information stored in said data specification module and to generate said device specific representation for each of said remote devices therefrom and, based on the contents of said data specification module and said raw information from said remote devices, to control operation of said remote devices, to enable polls of said remote devices by said protocol module, to process said raw information in accordance with said information stored in said data specification module, to process said common groupings of said raw information stored in said values module from two or more of said remote devices to generate information characterizing inter-device performance therefrom, and to generate poll results for each of said remote devices in the form of said device specific representations; and a user interface module located at said network management site, and, responsive to said engine, for displaying said device specific representations of said remote devices at said network management site as a user controlled virtual panel. 4. The apparatus of claim 1, wherein said engine implements user directed control of remote device operational parameters.
| 0.659218 |
9,141,989 | 7 | 9 |
7. The computer-readable media as recited in claim 1 , wherein the webpage provides a link which, when activated, functions to invoke a dialogue for creating a document that will stored within the data repository and that will be cross-referenced to the product and the user within the data repository.
|
7. The computer-readable media as recited in claim 1 , wherein the webpage provides a link which, when activated, functions to invoke a dialogue for creating a document that will stored within the data repository and that will be cross-referenced to the product and the user within the data repository. 9. The computer-readable media as recited in claim 7 , wherein the document comprises a user comment about the product.
| 0.5 |
9,692,771 | 17 | 18 |
17. An apparatus configured to protect a computing apparatus by determining whether an Internet domain name is associated with a malicious Internet domain, the apparatus comprising: a communications interface configured to obtain over a network the Internet domain name from a user device; a module including computer program code, the module configured to: extract a first plurality of N-grams of a first N-gram size from the Internet domain name, and extract a second plurality of N-grams of the second N-gram size from the Internet domain name, analyze the first plurality of N-grams with respect to a first model, the first model being selected from a plurality of models based on the first N-gram size and associated with known typical Internet domain names, wherein analyzing the first plurality of N-grams with respect to the first model includes generating a first strangeness score that is dependent on respective locations of the first plurality of N-grams within the Internet domain name, and wherein the first model includes a set of N-grams being associated with a plurality of known typical Internet domain names, analyze the second plurality of N-grams with respect to a second model, the second model being selected from the plurality of models based on the determined second N-gram size and associated with known typical Internet domain names, wherein analyzing the second plurality of N-grams with respect to the second model includes generating a second strangeness score that is dependent on respective locations of the second plurality of N-grams within the Internet domain name, compare the first strangeness score and the second strangeness score with a threshold; determine whether the Internet domain name is typical based on the comparing, wherein the Internet domain name is typical when the first strangeness score and the second strangeness score are below the threshold, and in response to determining that the Internet domain name is not typical, determine that the Internet domain name is not safe, and perform, by the apparatus, a security action to protect the apparatus with respect to the unsafe Internet domain name; and a processing arrangement configured to execute the computer program code.
|
17. An apparatus configured to protect a computing apparatus by determining whether an Internet domain name is associated with a malicious Internet domain, the apparatus comprising: a communications interface configured to obtain over a network the Internet domain name from a user device; a module including computer program code, the module configured to: extract a first plurality of N-grams of a first N-gram size from the Internet domain name, and extract a second plurality of N-grams of the second N-gram size from the Internet domain name, analyze the first plurality of N-grams with respect to a first model, the first model being selected from a plurality of models based on the first N-gram size and associated with known typical Internet domain names, wherein analyzing the first plurality of N-grams with respect to the first model includes generating a first strangeness score that is dependent on respective locations of the first plurality of N-grams within the Internet domain name, and wherein the first model includes a set of N-grams being associated with a plurality of known typical Internet domain names, analyze the second plurality of N-grams with respect to a second model, the second model being selected from the plurality of models based on the determined second N-gram size and associated with known typical Internet domain names, wherein analyzing the second plurality of N-grams with respect to the second model includes generating a second strangeness score that is dependent on respective locations of the second plurality of N-grams within the Internet domain name, compare the first strangeness score and the second strangeness score with a threshold; determine whether the Internet domain name is typical based on the comparing, wherein the Internet domain name is typical when the first strangeness score and the second strangeness score are below the threshold, and in response to determining that the Internet domain name is not typical, determine that the Internet domain name is not safe, and perform, by the apparatus, a security action to protect the apparatus with respect to the unsafe Internet domain name; and a processing arrangement configured to execute the computer program code. 18. The apparatus of claim 17 , wherein the communications interface is further configured to obtain the Internet domain name from a device and to notify the device when the Internet domain name is determined to be typical.
| 0.5 |
9,875,239 | 1 | 8 |
1. A computer program product for implementing an online document sharing community in a network environment including a plurality of participant computers operated by participants in the online document sharing community and a storage system storing documents, wherein the computer program product is implemented in a non-transitory computer readable storage medium and includes a computer program executed to perform operations, the operations comprising: maintaining, in a database, participant information for a plurality of participants registered with the database, wherein the participant information for at least one of the participants is associated with document information in the database for at least one document owned by the participant, wherein the document information identifies a document in the storage system, an owner of the document, a public/private status flag indicating whether the document is public or private, a public description providing a description of the document that does not include all content of the document, a provide public description field indicating whether the public description is to be provided to requesting participants not in a group of participants allowed access to the document, and wherein the document information for at least one document indicated as private indicates the group of participants allowed to access the document; receiving a request for a page from a requesting participant computer, wherein the requesting participant computer comprises one of the participant computers operated by a requesting participant comprising one of the participants in the online document sharing community; determining a document to include in the page; determining whether the public/private status flag indicates whether the document is public or private; including in the page an access element to provide access to the content of the document in response to the determining that the public/private status flag indicates that the document is public; determining whether the requesting participant is a member of the group of participants allowed access to the document in response to determining that the public/private status flag indicates that the document is private; determining whether the provide public description field indicates that the public description is to be provided in response to the determining that the requesting participant is not a member of the group of participants allowed to access the document; including in the page access to the public description for the document in response to determining that the public/private status flag indicates that the document is private, in response to the determining that the requesting participant is not a member of the group of participants allowed to access the document, and in response to the determining that the provide public description field indicates that the public description is to be provided; including in the page the access element to provide access to the content of the document in response to the determining that the public/private status flag indicates that the document is private and in response to the determining that the requesting participant is a member of the group of participants allowed to access the document; and returning the page to the requesting participant computer.
|
1. A computer program product for implementing an online document sharing community in a network environment including a plurality of participant computers operated by participants in the online document sharing community and a storage system storing documents, wherein the computer program product is implemented in a non-transitory computer readable storage medium and includes a computer program executed to perform operations, the operations comprising: maintaining, in a database, participant information for a plurality of participants registered with the database, wherein the participant information for at least one of the participants is associated with document information in the database for at least one document owned by the participant, wherein the document information identifies a document in the storage system, an owner of the document, a public/private status flag indicating whether the document is public or private, a public description providing a description of the document that does not include all content of the document, a provide public description field indicating whether the public description is to be provided to requesting participants not in a group of participants allowed access to the document, and wherein the document information for at least one document indicated as private indicates the group of participants allowed to access the document; receiving a request for a page from a requesting participant computer, wherein the requesting participant computer comprises one of the participant computers operated by a requesting participant comprising one of the participants in the online document sharing community; determining a document to include in the page; determining whether the public/private status flag indicates whether the document is public or private; including in the page an access element to provide access to the content of the document in response to the determining that the public/private status flag indicates that the document is public; determining whether the requesting participant is a member of the group of participants allowed access to the document in response to determining that the public/private status flag indicates that the document is private; determining whether the provide public description field indicates that the public description is to be provided in response to the determining that the requesting participant is not a member of the group of participants allowed to access the document; including in the page access to the public description for the document in response to determining that the public/private status flag indicates that the document is private, in response to the determining that the requesting participant is not a member of the group of participants allowed to access the document, and in response to the determining that the provide public description field indicates that the public description is to be provided; including in the page the access element to provide access to the content of the document in response to the determining that the public/private status flag indicates that the document is private and in response to the determining that the requesting participant is a member of the group of participants allowed to access the document; and returning the page to the requesting participant computer. 8. The computer program product of claim 1 , wherein the public description of the document does not include that portion of the content eligible for legal protection under intellectual property laws.
| 0.838969 |
7,836,148 | 1 | 7 |
1. A method of dynamically generating a display page, comprising: using a processor to obtain an object tree comprising a plurality of hierarchically organized objects, each object containing data and methods for processing a corresponding definitional element of said display page; using the processor to modify said object tree at runtime; and using the processor to invoke said methods of the objects comprising the object tree as modified to generate, dynamically at runtime, a plurality of definitional statements, each definitional statement being associated with one or more definitional elements of said display page; wherein said methods for processing a corresponding definitional element of said display page comprise computer instructions which when executed generate said plurality of definitional statements; wherein said definitional statements comprise hypertext markup language (HTML) or other statements usable by a browser or other software to render the display page; and wherein the display page generated using the objects comprising the object tree as modified reflects the modification made to said object tree at runtime.
|
1. A method of dynamically generating a display page, comprising: using a processor to obtain an object tree comprising a plurality of hierarchically organized objects, each object containing data and methods for processing a corresponding definitional element of said display page; using the processor to modify said object tree at runtime; and using the processor to invoke said methods of the objects comprising the object tree as modified to generate, dynamically at runtime, a plurality of definitional statements, each definitional statement being associated with one or more definitional elements of said display page; wherein said methods for processing a corresponding definitional element of said display page comprise computer instructions which when executed generate said plurality of definitional statements; wherein said definitional statements comprise hypertext markup language (HTML) or other statements usable by a browser or other software to render the display page; and wherein the display page generated using the objects comprising the object tree as modified reflects the modification made to said object tree at runtime. 7. The method of claim 1 , wherein modifying said object tree at runtime comprises modifying a hierarchical structure of said object tree.
| 0.821705 |
7,630,879 | 6 | 7 |
6. A computer-implemented text sentence comparison method comprising: converting, using a processor, a first text sentence and a second text sentence into a first RO tree and a second RO tree, respectively; calculating a distance between the first RO tree and the second RO tree on the basis of a distance between two RO trees, which is defined at least in accordance with a condition of a mapping between vertexes of the two RO trees, the calculation of the distance between the first RO tree and the second RO tree being performed by the processor and including calculating: a distance between a forest, which the first RO tree includes, and a forest, which the second RO tree includes; a distance between a subtree, which the first RO tree includes, and a subtree, which the second RO tree includes; and a vertex mapping weight of a mapping from the first RO tree to the second RO tree; calculating a distance between the first text sentence and the second text sentence, using the processor, on the basis of the calculated distance between the first RO tree and the second RO tree, wherein in the converting, word information and case information in the first text sentence are assigned to respective vertexes of the first RO tree so that at least one of the vertexes of the first RO tree contains the word information and the case information in the first text sentence, and word information and case information in the second text sentence are assigned to respective vertexes of the second RO tree so that at least one of the vertexes of the second RO tree contains the word information and the case information in the second sentence, and the vertex mapping weight is calculated on the basis of word substitution weight, word deletion weight, word insertion weight, case substitution weight, case deletion weight and case insertion weight; and outputting the calculated distance between the first text sentence and the second text sentence as an indication of semantic content similarity between the sentences.
|
6. A computer-implemented text sentence comparison method comprising: converting, using a processor, a first text sentence and a second text sentence into a first RO tree and a second RO tree, respectively; calculating a distance between the first RO tree and the second RO tree on the basis of a distance between two RO trees, which is defined at least in accordance with a condition of a mapping between vertexes of the two RO trees, the calculation of the distance between the first RO tree and the second RO tree being performed by the processor and including calculating: a distance between a forest, which the first RO tree includes, and a forest, which the second RO tree includes; a distance between a subtree, which the first RO tree includes, and a subtree, which the second RO tree includes; and a vertex mapping weight of a mapping from the first RO tree to the second RO tree; calculating a distance between the first text sentence and the second text sentence, using the processor, on the basis of the calculated distance between the first RO tree and the second RO tree, wherein in the converting, word information and case information in the first text sentence are assigned to respective vertexes of the first RO tree so that at least one of the vertexes of the first RO tree contains the word information and the case information in the first text sentence, and word information and case information in the second text sentence are assigned to respective vertexes of the second RO tree so that at least one of the vertexes of the second RO tree contains the word information and the case information in the second sentence, and the vertex mapping weight is calculated on the basis of word substitution weight, word deletion weight, word insertion weight, case substitution weight, case deletion weight and case insertion weight; and outputting the calculated distance between the first text sentence and the second text sentence as an indication of semantic content similarity between the sentences. 7. The text sentence comparison method according to claim 6 , wherein: in the conversion: words included in the first text sentence are allotted to vertexes of the first RO trees; and words included in the second text sentence are allotted to vertexes of the second RO trees; and the vertex mapping weight is calculated on the basis of word substitution weight, word deletion weight, and word insertion weight.
| 0.5 |
8,214,360 | 1 | 2 |
1. A method, in a clustering search engine data processing system, for search disambiguation, the method comprising: receiving, from a requesting client of a requesting user, a search query, a bookmark data structure, and a viewed content history of the requesting user, wherein the viewed content history comprises at least a portion of a browser history maintained by the Web browser at the requesting client; performing a search to obtain a search result set comprising a plurality of data elements that satisfy the search query; classifying the search result set using the bookmark data structure to generate a clustered result set, wherein the clustered result set comprises the plurality of data elements clustered into a base taxonomy of categories and wherein the base taxonomy of categories is defined by the bookmark data structure; classifying, at the clustering search engine, the viewed content history of the requesting user into the base taxonomy of categories, wherein the base taxonomy of categories comprises a plurality of categories; and ranking, at the clustering search engine, the categories of the clustered result set according to the classification of the viewed content history to form a ranked cluster result set; and returning the raked clustered result set to the requesting client, wherein the bookmark data structure is maintained by a Web browser at the requesting client.
|
1. A method, in a clustering search engine data processing system, for search disambiguation, the method comprising: receiving, from a requesting client of a requesting user, a search query, a bookmark data structure, and a viewed content history of the requesting user, wherein the viewed content history comprises at least a portion of a browser history maintained by the Web browser at the requesting client; performing a search to obtain a search result set comprising a plurality of data elements that satisfy the search query; classifying the search result set using the bookmark data structure to generate a clustered result set, wherein the clustered result set comprises the plurality of data elements clustered into a base taxonomy of categories and wherein the base taxonomy of categories is defined by the bookmark data structure; classifying, at the clustering search engine, the viewed content history of the requesting user into the base taxonomy of categories, wherein the base taxonomy of categories comprises a plurality of categories; and ranking, at the clustering search engine, the categories of the clustered result set according to the classification of the viewed content history to form a ranked cluster result set; and returning the raked clustered result set to the requesting client, wherein the bookmark data structure is maintained by a Web browser at the requesting client. 2. The method of claim 1 , wherein the bookmark data structure comprises a hierarchy of folders and wherein at least one folder in the hierarchy of folders has at least one bookmark stored therein.
| 0.732337 |
7,617,096 | 11 | 13 |
11. The method of claim 9 , wherein step (a) comprises: (a)(i) determining whether each candidate codevector among the set of candidate codevectors belongs to an illegal space representing illegal vectors, wherein the illegal space is defined by the one or more illegal space definitions; and (a)(ii) declaring as a legal candidate codevector each candidate codevector that does not belong to the illegal space.
|
11. The method of claim 9 , wherein step (a) comprises: (a)(i) determining whether each candidate codevector among the set of candidate codevectors belongs to an illegal space representing illegal vectors, wherein the illegal space is defined by the one or more illegal space definitions; and (a)(ii) declaring as a legal candidate codevector each candidate codevector that does not belong to the illegal space. 13. The method of claim 11 , wherein: the illegal space is represented as an illegal vector criterion corresponding to only a portion of a codevector; and step (a)(i) includes determining whether only a portion of each candidate codevector satisfies the illegal vector criterion.
| 0.5 |
9,519,643 | 1 | 12 |
1. A computer-implemented process for translating map labels, comprising using a computing device for: receiving an entity's map label in a first language that is to be translated into a second language; generating translation candidates for each n-gram in the entity's map label and using these translation candidates to generate translation candidate sequences for the map label; selecting a prescribed number of translation candidate sequences; extracting features from the selected translation candidate sequences and the entity's map label by using geospatial and linguistic context information; using a probabilistic classifier trained at least in part with the extracted features to rank the selected translation candidate sequences; and re-ranking the selected translation candidate sequences using neighboring proximity information of the entity's location to disclose the highest re-ranked translation candidate sequence as the translated map label.
|
1. A computer-implemented process for translating map labels, comprising using a computing device for: receiving an entity's map label in a first language that is to be translated into a second language; generating translation candidates for each n-gram in the entity's map label and using these translation candidates to generate translation candidate sequences for the map label; selecting a prescribed number of translation candidate sequences; extracting features from the selected translation candidate sequences and the entity's map label by using geospatial and linguistic context information; using a probabilistic classifier trained at least in part with the extracted features to rank the selected translation candidate sequences; and re-ranking the selected translation candidate sequences using neighboring proximity information of the entity's location to disclose the highest re-ranked translation candidate sequence as the translated map label. 12. The computer-implemented process of claim 1 wherein the first language is Japanese and the second language is English.
| 0.886406 |
9,483,461 | 15 | 19 |
15. A system comprising: an electronic device with a display, one or more input devices, and one or more audio output devices; a memory configured to store text; and one or more processors coupled to the memory, the one or more processors configured to: display, on the display, a portion of displayed text that includes a plurality of words; receive a request to convert the plurality of words in the portion of the displayed text to speech; determine whether a language ambiguity exists based on an analysis of the plurality of words of the portion of the displayed text, wherein the language ambiguity indicates that a plurality of candidate languages are applicable for converting the plurality of words in the portion of displayed text to speech; in accordance with the determination that the language ambiguity exists, cause to be concurrently displayed, on the display, the plurality of candidate languages for converting the plurality of words in the portion of the displayed text to speech, wherein the plurality of candidate languages was selected based on the analysis of the plurality of words in the portion of the displayed text; and while concurrently displaying the plurality of candidate languages, receiving, with one or more input devices, input indicative of selection of a first candidate language from the concurrently displayed plurality of candidate languages, in response to receiving the input indicative of selection of the first candidate language, output, with one or more audio output devices, audio corresponding to the plurality of words in the portion of the displayed text, wherein the audio comprises a conversion of the plurality of words in the portion of the displayed text to speech in the first candidate language.
|
15. A system comprising: an electronic device with a display, one or more input devices, and one or more audio output devices; a memory configured to store text; and one or more processors coupled to the memory, the one or more processors configured to: display, on the display, a portion of displayed text that includes a plurality of words; receive a request to convert the plurality of words in the portion of the displayed text to speech; determine whether a language ambiguity exists based on an analysis of the plurality of words of the portion of the displayed text, wherein the language ambiguity indicates that a plurality of candidate languages are applicable for converting the plurality of words in the portion of displayed text to speech; in accordance with the determination that the language ambiguity exists, cause to be concurrently displayed, on the display, the plurality of candidate languages for converting the plurality of words in the portion of the displayed text to speech, wherein the plurality of candidate languages was selected based on the analysis of the plurality of words in the portion of the displayed text; and while concurrently displaying the plurality of candidate languages, receiving, with one or more input devices, input indicative of selection of a first candidate language from the concurrently displayed plurality of candidate languages, in response to receiving the input indicative of selection of the first candidate language, output, with one or more audio output devices, audio corresponding to the plurality of words in the portion of the displayed text, wherein the audio comprises a conversion of the plurality of words in the portion of the displayed text to speech in the first candidate language. 19. The system of claim 15 wherein the one or more processors are further configured to determine that the plurality of words corresponds to the plurality of candidate languages for converting the plurality of words in the portion of the displayed text to speech, wherein the determination comprises the one or more processors being configured to perform at least one of: determine a language for converting the plurality of words in the portion of the displayed text to speech based upon one or more loaded keyboards; determine a language for converting the plurality of words in the portion of the displayed text to speech based upon one or more tags associated with the displayed text; determine a language for converting the plurality of words in the portion of the displayed text to speech based upon character encoding information associated with one or more characters in the displayed text; determine a language for converting the plurality of words in the portion of the displayed text to speech based upon one or more user preferences; determine a language for converting the plurality of words in the portion of the displayed text to speech based upon a language selected for a prior text-to-speech conversion; determine a language for converting the plurality of words in the portion of the displayed text to speech based upon a source of the displayed text; determine a language for converting the plurality of words in the portion of the displayed text to speech based country code top-level domain information associated with the displayed text; or determine a language for converting the plurality of words in the portion of the displayed text to speech based upon global positioning system (GPS) information.
| 0.5 |
8,688,092 | 11 | 14 |
11. A method of processing a voice communication and enabling a first user to share information with other users, comprising: receiving, at an application software program installed on a mobile device associated with a first user, a voice communication including a plurality of spoken words from the first user; converting some or all of the voice communication received at the application program installed on the mobile device associated with the first user to text using at least in part a speech-to-text recognizer; identifying a voice communication gist from the translated text wherein the identification is based at least in part on: an identification of one or more words in the translated text that correspond to respective one or more words in a vocabulary of uncommon words that are uncommon in voice communications; providing the voice communication gist for transmission via a Short Messaging Service (SMS); and automatically posting, by a processing system, the voice communication gist on a social networking web page, wherein the social networking web page is configured to share first user information posted on the social networking web page with others.
|
11. A method of processing a voice communication and enabling a first user to share information with other users, comprising: receiving, at an application software program installed on a mobile device associated with a first user, a voice communication including a plurality of spoken words from the first user; converting some or all of the voice communication received at the application program installed on the mobile device associated with the first user to text using at least in part a speech-to-text recognizer; identifying a voice communication gist from the translated text wherein the identification is based at least in part on: an identification of one or more words in the translated text that correspond to respective one or more words in a vocabulary of uncommon words that are uncommon in voice communications; providing the voice communication gist for transmission via a Short Messaging Service (SMS); and automatically posting, by a processing system, the voice communication gist on a social networking web page, wherein the social networking web page is configured to share first user information posted on the social networking web page with others. 14. The method as defined in claim 11 , the method further comprising: converting the voice communication gist to speech; playing the speech to the first user; and requesting the first user indicate if the speech has one or more errors.
| 0.731207 |
8,478,588 | 1 | 5 |
1. A computer-implemented method for simulating a run-time user interaction with a voice application, said method comprising the steps of: providing a simulation environment including a simulation tool coupled to a voice application; loading a user simulation script to the simulation tool; processing the user simulation script by the simulation tool to generate both a simulated input to the voice application and a simulated output from the voice application; wherein the simulation tool and user simulation script replace actual inputs provided by a live user, actual outputs provided by the voice application and all speech technologies needed when the voice application is not in the simulation environment, and wherein all actual interactions between the user and the voice application are represented by scripted text-equivalents that simulate both the content and execution time of such interactions.
|
1. A computer-implemented method for simulating a run-time user interaction with a voice application, said method comprising the steps of: providing a simulation environment including a simulation tool coupled to a voice application; loading a user simulation script to the simulation tool; processing the user simulation script by the simulation tool to generate both a simulated input to the voice application and a simulated output from the voice application; wherein the simulation tool and user simulation script replace actual inputs provided by a live user, actual outputs provided by the voice application and all speech technologies needed when the voice application is not in the simulation environment, and wherein all actual interactions between the user and the voice application are represented by scripted text-equivalents that simulate both the content and execution time of such interactions. 5. The method of claim 1 , wherein the simulated output simulates an output from an automatic speech recognition engine in response to the simulated input.
| 0.571823 |
8,898,568 | 20 | 21 |
20. The portable media playback device of claim 10 , wherein the plurality of prepared audio prompts are voice recordings.
|
20. The portable media playback device of claim 10 , wherein the plurality of prepared audio prompts are voice recordings. 21. The portable media playback device of claim 20 , wherein the voice recordings are of higher quality than generated audio prompts.
| 0.5 |
7,617,184 | 13 | 17 |
13. A computer-readable storage medium storing computer-executable instructions that, when executed by a computer, cause the computer to perform a method for presenting materials corresponding to a navigation state, the method comprising: receiving a user selection of an expression of attribute-value pairs; producing a plurality of refinement options and a plurality of ancestors by processing, in each server of a plurality of servers, the expression of attribute-value pairs to produce at least one refinement option and at least one ancestor; combining the plurality of refinement options and plurality of ancestors to form combined refinement options, the combined refinement options including at least one refinement navigation state; determining the navigation state associated with the expression of attribute-value pairs; providing materials associated with the navigation state; and providing the combined refinement options, wherein the combining comprises: taking a union of the plurality of refinement options, determining a set of ancestors for each refinement option of the plurality of refinement options, from the plurality of ancestors produced in the plurality of servers, to form sets of ancestors, computing an intersection of all of the sets of ancestors, and computing the combined refinement options based on terms in the intersection of all sets of ancestors, including identifying at least two related terms among the plurality of refinement options, and computing, for the at least two related terms, a least common ancestor of the related terms, and wherein a first server of the plurality of servers acts as a master server and some of the plurality of servers act as slave servers, the method further comprising the master server distributing a request for a navigation state to a plurality of slave servers, the slave servers computing navigation states for requests and returning results to the master server, and the master server combining the results from the slave servers to obtain a navigation state corresponding to the request, wherein the combining of the results is based on the combining of the plurality of refinement options and plurality of ancestors.
|
13. A computer-readable storage medium storing computer-executable instructions that, when executed by a computer, cause the computer to perform a method for presenting materials corresponding to a navigation state, the method comprising: receiving a user selection of an expression of attribute-value pairs; producing a plurality of refinement options and a plurality of ancestors by processing, in each server of a plurality of servers, the expression of attribute-value pairs to produce at least one refinement option and at least one ancestor; combining the plurality of refinement options and plurality of ancestors to form combined refinement options, the combined refinement options including at least one refinement navigation state; determining the navigation state associated with the expression of attribute-value pairs; providing materials associated with the navigation state; and providing the combined refinement options, wherein the combining comprises: taking a union of the plurality of refinement options, determining a set of ancestors for each refinement option of the plurality of refinement options, from the plurality of ancestors produced in the plurality of servers, to form sets of ancestors, computing an intersection of all of the sets of ancestors, and computing the combined refinement options based on terms in the intersection of all sets of ancestors, including identifying at least two related terms among the plurality of refinement options, and computing, for the at least two related terms, a least common ancestor of the related terms, and wherein a first server of the plurality of servers acts as a master server and some of the plurality of servers act as slave servers, the method further comprising the master server distributing a request for a navigation state to a plurality of slave servers, the slave servers computing navigation states for requests and returning results to the master server, and the master server combining the results from the slave servers to obtain a navigation state corresponding to the request, wherein the combining of the results is based on the combining of the plurality of refinement options and plurality of ancestors. 17. The computer-readable storage medium of claim 13 , wherein the plurality of servers are slave servers, and wherein combining the plurality of refinement options includes storing a plurality of the attribute-value pairs on a master server.
| 0.551852 |
8,543,604 | 1 | 9 |
1. A computer-implemented system for drafting documents using an outline table, comprising: a database of outlines, each comprising an organizational framework into which document clauses are inserted to form a document; a request module to receive a request for one or more of the outlines from a user; a filtering module to filter the outlines by removing those outlines that the user is not authorized to access and to further filter the outlines by removing those outlines that are not preferred by the user; a presentation module to present to the user, the remaining outlines not removed; an input module to receive input from the user regarding the presented outlines; a selection module to select at least one of the presented outlines associated with the user input, wherein the selected outline is populated with predefined values; a display module to display to the user at least one annotation with the selected outline, the annotation comprising an explanatory description of the outline and at least one hyperlink to link the explanatory description to one of a local data source and an external data source; and a processor to execute the modules.
|
1. A computer-implemented system for drafting documents using an outline table, comprising: a database of outlines, each comprising an organizational framework into which document clauses are inserted to form a document; a request module to receive a request for one or more of the outlines from a user; a filtering module to filter the outlines by removing those outlines that the user is not authorized to access and to further filter the outlines by removing those outlines that are not preferred by the user; a presentation module to present to the user, the remaining outlines not removed; an input module to receive input from the user regarding the presented outlines; a selection module to select at least one of the presented outlines associated with the user input, wherein the selected outline is populated with predefined values; a display module to display to the user at least one annotation with the selected outline, the annotation comprising an explanatory description of the outline and at least one hyperlink to link the explanatory description to one of a local data source and an external data source; and a processor to execute the modules. 9. The computer-implemented system according to claim 1 , further comprising: an outline table to maintain the outlines; tables for the documents clauses, annotations, and learn topics; and a hierarchically structured table with the outline, document clause, annotation, and learn topics tables, wherein the structured table stores indices to the document clauses, outlines, annotations, and learn topics within the outlines.
| 0.5 |
7,818,332 | 1 | 7 |
1. A method performed by a computer with a processor, comprising: receiving a search query containing a representation of a text string having a plurality of search terms and identifying the search terms as being separated by spaces; accessing, with the processor, a lexicon of terms stored in a memory; generating, with the processor, a plurality of candidate spellings for each search term in the query based on a spelling similarity, a phonetic similarity, and a word boundary similarity, between the search terms and the terms in the lexicon, and organizing the candidate spellings in a structure to group candidate spellings for each search term; assigning a score to each of the candidate spellings based on the spelling similarity, the phonetic similarity and the word boundary similarity; generating, with the processor, a plurality of candidate query paths through the structure based on the scores that were previously assigned for each candidate spelling, each candidate query path containing a candidate spelling for each search term in the search query; determining, with the processor, a relationship among the candidate spellings in each candidate query path; and ranking, with a ranking model, the candidate query paths as a function of the scores of each candidate spelling and the relationship, the ranking model being generated by obtaining a set of feature functions for the ranking model that ranks candidate query paths of suggested spelling corrections given a search query; generating, with the processor, a weight for each feature function in the set of feature functions to create weighted ranking parameters for the ranking model; accessing, with a processor, a plurality of samples, each sample having a query and an expected spelling suggestion for the query; employing the ranking model to rank candidate paths generated for each query; and adjusting the weights for the weighted ranking parameters based on the ranking applied to the candidate paths for the plurality of samples.
|
1. A method performed by a computer with a processor, comprising: receiving a search query containing a representation of a text string having a plurality of search terms and identifying the search terms as being separated by spaces; accessing, with the processor, a lexicon of terms stored in a memory; generating, with the processor, a plurality of candidate spellings for each search term in the query based on a spelling similarity, a phonetic similarity, and a word boundary similarity, between the search terms and the terms in the lexicon, and organizing the candidate spellings in a structure to group candidate spellings for each search term; assigning a score to each of the candidate spellings based on the spelling similarity, the phonetic similarity and the word boundary similarity; generating, with the processor, a plurality of candidate query paths through the structure based on the scores that were previously assigned for each candidate spelling, each candidate query path containing a candidate spelling for each search term in the search query; determining, with the processor, a relationship among the candidate spellings in each candidate query path; and ranking, with a ranking model, the candidate query paths as a function of the scores of each candidate spelling and the relationship, the ranking model being generated by obtaining a set of feature functions for the ranking model that ranks candidate query paths of suggested spelling corrections given a search query; generating, with the processor, a weight for each feature function in the set of feature functions to create weighted ranking parameters for the ranking model; accessing, with a processor, a plurality of samples, each sample having a query and an expected spelling suggestion for the query; employing the ranking model to rank candidate paths generated for each query; and adjusting the weights for the weighted ranking parameters based on the ranking applied to the candidate paths for the plurality of samples. 7. The method of claim 1 wherein the phonetic similarity is computed as a function of phonetic encoding of the search query and terms in the lexicon.
| 0.849495 |
8,554,564 | 12 | 19 |
12. A speech end-pointing method, comprising: receiving an audio stream; analyzing energy and noise characteristics of a frame of the audio stream by a computer processor to determine whether the frame has energy above a background noise level; incrementing an energy counter by a length of the frame in response to a determination by the computer processor that the frame has energy above the background noise level; incrementing a lack of energy counter by the length of the frame in response to a determination by the computer processor that the frame does not have energy above the background noise level; and applying a plurality of rules by the computer processor to detect a beginning and an end of a speech segment of the audio stream based on the energy counter and the lack of energy counter.
|
12. A speech end-pointing method, comprising: receiving an audio stream; analyzing energy and noise characteristics of a frame of the audio stream by a computer processor to determine whether the frame has energy above a background noise level; incrementing an energy counter by a length of the frame in response to a determination by the computer processor that the frame has energy above the background noise level; incrementing a lack of energy counter by the length of the frame in response to a determination by the computer processor that the frame does not have energy above the background noise level; and applying a plurality of rules by the computer processor to detect a beginning and an end of a speech segment of the audio stream based on the energy counter and the lack of energy counter. 19. The method of claim 12 , further comprising: resetting the lack of energy counter in response to the determination by the computer processor that the frame has energy above the background noise level; and resetting the energy counter in response to the determination by the computer processor that the frame does not have energy above the background noise level.
| 0.598684 |
9,223,590 | 2 | 3 |
2. The system of claim 1 , wherein the contextual information relating to the text manipulation event includes a logical location and a predetermined unit of text relating to the text manipulation event.
|
2. The system of claim 1 , wherein the contextual information relating to the text manipulation event includes a logical location and a predetermined unit of text relating to the text manipulation event. 3. The system of claim 2 , wherein the predetermined unit of text is selected from the group consisting of: a character, a word, a sentence, a paragraph, a line of text, a section of a document, and a document.
| 0.670846 |
7,925,986 | 13 | 17 |
13. A user-interface method for entering an alphanumeric string, the method comprising: displaying on a presentation device an alphabet arranged into a row of letters; presenting visual cues grouping a series of letters of the row into a cluster of letters to aid in the navigation of the row and the selection of a desired cluster; receiving user actions from an input device to move the visual cues along the row of letters to change the letters grouped into the cluster from a first subset of letters to a second subset of letters, the visual cues moving along the row of letters in variable offsets based on a rate of input of the user actions, wherein the visual cues move by a single offset for each user action in response to user actions entered at or slower than a predetermined rate, and wherein the visual cues move by more than a single offset for each user action and the first subset of letters and the second subset of letters are contiguous in response to user actions entered faster than the predetermined rate; and receiving user actions from the input device to select the cluster of letters to cause at least one of the letters of the selected cluster to be displayed in a string field so that an alphanumeric string of characters selected by a user is presented on the presentation device.
|
13. A user-interface method for entering an alphanumeric string, the method comprising: displaying on a presentation device an alphabet arranged into a row of letters; presenting visual cues grouping a series of letters of the row into a cluster of letters to aid in the navigation of the row and the selection of a desired cluster; receiving user actions from an input device to move the visual cues along the row of letters to change the letters grouped into the cluster from a first subset of letters to a second subset of letters, the visual cues moving along the row of letters in variable offsets based on a rate of input of the user actions, wherein the visual cues move by a single offset for each user action in response to user actions entered at or slower than a predetermined rate, and wherein the visual cues move by more than a single offset for each user action and the first subset of letters and the second subset of letters are contiguous in response to user actions entered faster than the predetermined rate; and receiving user actions from the input device to select the cluster of letters to cause at least one of the letters of the selected cluster to be displayed in a string field so that an alphanumeric string of characters selected by a user is presented on the presentation device. 17. The method of claim 13 , wherein the presentation device is separate from the input device so that the user can enter the alphanumeric string while focusing on the presentation device.
| 0.676976 |
7,734,623 | 17 | 18 |
17. The method of claim 16 , wherein said first document is augmented with a retrieval weight determined at least in part by a degree to which said string augmentations are consistent with an underlying semantic model.
|
17. The method of claim 16 , wherein said first document is augmented with a retrieval weight determined at least in part by a degree to which said string augmentations are consistent with an underlying semantic model. 18. The method of claim 17 , wherein said retrieval weights are determined at least in part by applying a set of specific rules for combining said background knowledge with the contents of said first document.
| 0.5 |
9,069,963 | 10 | 11 |
10. A method of detecting genetic relationships, comprising: interrogating simultaneously, with at least one processor, each of a plurality of genomes for identifiable genes in each of the genomes; identifying dependencies between the identifiable genes based on the presence or absence of two or more identifiable genes in at least two of the plurality of genomes; constructing a plurality of component groups, wherein each group of the plurality of component groups includes genomes that share identical genes, wherein the genes of each component group are unique to that component group; constructing a directed graph representation of hierarchical relationships between the plurality of component groups based on the identified dependencies between the identifiable genes in the plurality of genomes, wherein the hierarchical relationships between the plurality of component groups indicate a dependency between a first component group and a second component group, wherein the directed graph includes each component group of the plurality of component groups as a node of the directed graph and a directed edge from a first node of the directed graph to a second node of the directed graph if all the genes of the component associated with the second node are also present in the component associated with the first node; eliminating a component group of the plurality of component groups that comprises exactly the same symbols as another component group of the plurality of component groups; and generating a report that details the hierarchical relationships between the plurality of component groups.
|
10. A method of detecting genetic relationships, comprising: interrogating simultaneously, with at least one processor, each of a plurality of genomes for identifiable genes in each of the genomes; identifying dependencies between the identifiable genes based on the presence or absence of two or more identifiable genes in at least two of the plurality of genomes; constructing a plurality of component groups, wherein each group of the plurality of component groups includes genomes that share identical genes, wherein the genes of each component group are unique to that component group; constructing a directed graph representation of hierarchical relationships between the plurality of component groups based on the identified dependencies between the identifiable genes in the plurality of genomes, wherein the hierarchical relationships between the plurality of component groups indicate a dependency between a first component group and a second component group, wherein the directed graph includes each component group of the plurality of component groups as a node of the directed graph and a directed edge from a first node of the directed graph to a second node of the directed graph if all the genes of the component associated with the second node are also present in the component associated with the first node; eliminating a component group of the plurality of component groups that comprises exactly the same symbols as another component group of the plurality of component groups; and generating a report that details the hierarchical relationships between the plurality of component groups. 11. The method of claim 10 , comprising: identifying component groups that are common to a set of genomes in the plurality of genomes.
| 0.5 |
9,842,089 | 1 | 2 |
1. A method for managing display of electronic documents in a client-server architecture, comprising: on the client: receiving, from the server, data that comprises i) document content for an electronic document, and ii) a visual style set of visual styles that affects display of the document content, wherein a visual style of the visual style set comprises a style element set of style elements, and a lock status that corresponds individually to a style element of the style element set indicates whether the corresponding style element is editable or non-editable by a user of the electronic document; and displaying a document user interface having i) a document display portion that displays the document content based on a selected visual style of the visual style set, and ii) a style editing portion for editing the visual characteristics of the document content based on the selected visual style and the lock status; wherein displaying the document user interface comprises generating the style editing portion to allow the user to view and modify an editable style element of the style element set and to view but not modify a non-editable style element of the style element set.
|
1. A method for managing display of electronic documents in a client-server architecture, comprising: on the client: receiving, from the server, data that comprises i) document content for an electronic document, and ii) a visual style set of visual styles that affects display of the document content, wherein a visual style of the visual style set comprises a style element set of style elements, and a lock status that corresponds individually to a style element of the style element set indicates whether the corresponding style element is editable or non-editable by a user of the electronic document; and displaying a document user interface having i) a document display portion that displays the document content based on a selected visual style of the visual style set, and ii) a style editing portion for editing the visual characteristics of the document content based on the selected visual style and the lock status; wherein displaying the document user interface comprises generating the style editing portion to allow the user to view and modify an editable style element of the style element set and to view but not modify a non-editable style element of the style element set. 2. The method of claim 1 , wherein: for a document content element of the document content that is affected by first and second visual styles of the visual style set that overlap, each of the first and second visual styles comprises a respective priority indicator; and displaying the document user interface comprises selecting the selected visual style from the first and second visual styles based on the respective priority indicators.
| 0.825794 |
9,904,668 | 11 | 13 |
11. The computer program product of claim 10 , wherein the computer readable program further causes the computing device to propagate the at least one knowledge value at least by iteratively applying, by the computing device, one or more knowledge reasoners to the logical parse hierarchical representation to propagate the at least one knowledge value of at least a subset of the nodes in the logical parse hierarchical representation to one or more other nodes in the logical parse hierarchical representation based on propagation rules, wherein each application of a knowledge reasoner generates a transaction record in the transaction knowledgebase data structure identifying nodes affected by the application of the knowledge reasoner.
|
11. The computer program product of claim 10 , wherein the computer readable program further causes the computing device to propagate the at least one knowledge value at least by iteratively applying, by the computing device, one or more knowledge reasoners to the logical parse hierarchical representation to propagate the at least one knowledge value of at least a subset of the nodes in the logical parse hierarchical representation to one or more other nodes in the logical parse hierarchical representation based on propagation rules, wherein each application of a knowledge reasoner generates a transaction record in the transaction knowledgebase data structure identifying nodes affected by the application of the knowledge reasoner. 13. The computer program product of claim 11 , wherein the one or more knowledge reasoners are iteratively applied until no further logical deductions are able to be made by further application of the one or more knowledge reasoners.
| 0.757796 |
5,551,040 | 2 | 3 |
2. The apparatus set forth in claim 1 wherein: the instructions are callback code; and the name represents an actual argument for the callback code.
|
2. The apparatus set forth in claim 1 wherein: the instructions are callback code; and the name represents an actual argument for the callback code. 3. The apparatus set forth in claim 2 wherein: there is a plurality of callback codes which are specified in a list thereof; and there is an operation for adding a callback code to the list thereof; and the use specification is part of a specification of the operation for adding the callback code to the list thereof.
| 0.5 |
9,596,378 | 1 | 2 |
1. A document authentication method implemented in a data processing system, comprising: (a) obtaining an original grayscale image representing an original document, the original grayscale image including one or more halftone or light text areas and one or more non-halftone or dark text areas; (b) separating the halftone or light text areas from the non-halftone or dark text areas in the original grayscale image; (c) separately binarizing the halftone or light text areas and the non-halftone or dark text areas generated by step (b); (d) down-sampling the binarized non-halftone or dark text areas generated by step (c), which correspond to the non-halftone or dark text areas of the original grayscale image, without down-sampling the binarized halftone or light text areas which correspond to the halftone or light text areas of the same original grayscale image, whereby a binarized original image is generated; (e) obtaining a target grayscale image representing a hardcopy target document, the target grayscale image including one or more halftone text areas and one or more non-halftone text areas; (f) separating the halftone text areas and the non-halftone text areas in the target grayscale image; (g) separately binarizing the halftone text areas and the non-halftone text areas generated by step (f); (h) down-sampling the binarized non-halftone text areas generated by step (g), which correspond to the non-halftone text areas of the target grayscale image, without down-sampling the binarized halftone text areas which correspond to the halftone text areas of the same target grayscale image, whereby a binarized target image is generated; and (i) comparing the binarized target image with the binarized original image to determine whether the target document is an authentic copy of the original document.
|
1. A document authentication method implemented in a data processing system, comprising: (a) obtaining an original grayscale image representing an original document, the original grayscale image including one or more halftone or light text areas and one or more non-halftone or dark text areas; (b) separating the halftone or light text areas from the non-halftone or dark text areas in the original grayscale image; (c) separately binarizing the halftone or light text areas and the non-halftone or dark text areas generated by step (b); (d) down-sampling the binarized non-halftone or dark text areas generated by step (c), which correspond to the non-halftone or dark text areas of the original grayscale image, without down-sampling the binarized halftone or light text areas which correspond to the halftone or light text areas of the same original grayscale image, whereby a binarized original image is generated; (e) obtaining a target grayscale image representing a hardcopy target document, the target grayscale image including one or more halftone text areas and one or more non-halftone text areas; (f) separating the halftone text areas and the non-halftone text areas in the target grayscale image; (g) separately binarizing the halftone text areas and the non-halftone text areas generated by step (f); (h) down-sampling the binarized non-halftone text areas generated by step (g), which correspond to the non-halftone text areas of the target grayscale image, without down-sampling the binarized halftone text areas which correspond to the halftone text areas of the same target grayscale image, whereby a binarized target image is generated; and (i) comparing the binarized target image with the binarized original image to determine whether the target document is an authentic copy of the original document. 2. The method of claim 1 , wherein step (a) includes scanning the hardcopy original document to generate the original grayscale image, and step (e) includes scanning the hardcopy target document to generate the target grayscale image.
| 0.898438 |
8,751,531 | 6 | 19 |
6. A text mining method for performing text mining on a first text data and a second text data, wherein each word of the first and second text data has a confidence, comprising (a) calculating a mutual information amount I(w i , w j ) at least based on a frequency of appearance of word w i in the first text data N 1st (w i ), a frequency of appearance of word w j in the second text data N 2nd (w j ), and a frequency of co-appearance of w i and w j in both text data N 1st,2nd (w i , w j ) using the confidence of w i and the confidence of w j ; and (b) using the mutual information amount I(w i , w j ) to calculate degrees to which w i and w j correspond to inherent portions of the first and second text data, wherein N 1 st ( w i ) = ∑ l R 1 st ( w i , l ) , [ Equation A ] N 2 nd ( w j ) = ∑ l R 2 nd ( w j , l ) , [ Equation B ] N 1 st , 2 nd ( w i , w j ) = ∑ l R 1 st ( w i , l ) R 2 nd ( w j , l ) , [ Equation C ] R 1st (w i ,l indicates a confidence of w i for record l, R 2nd (w j ,l) indicates a confidence of w j for record l.
|
6. A text mining method for performing text mining on a first text data and a second text data, wherein each word of the first and second text data has a confidence, comprising (a) calculating a mutual information amount I(w i , w j ) at least based on a frequency of appearance of word w i in the first text data N 1st (w i ), a frequency of appearance of word w j in the second text data N 2nd (w j ), and a frequency of co-appearance of w i and w j in both text data N 1st,2nd (w i , w j ) using the confidence of w i and the confidence of w j ; and (b) using the mutual information amount I(w i , w j ) to calculate degrees to which w i and w j correspond to inherent portions of the first and second text data, wherein N 1 st ( w i ) = ∑ l R 1 st ( w i , l ) , [ Equation A ] N 2 nd ( w j ) = ∑ l R 2 nd ( w j , l ) , [ Equation B ] N 1 st , 2 nd ( w i , w j ) = ∑ l R 1 st ( w i , l ) R 2 nd ( w j , l ) , [ Equation C ] R 1st (w i ,l indicates a confidence of w i for record l, R 2nd (w j ,l) indicates a confidence of w j for record l. 19. The text mining method of claim 6 , further comprising: (c) extracting the inherent portions based on the calculated degrees.
| 0.940934 |
8,977,535 | 16 | 18 |
16. A method for transliterating a complex character-based writing system including characters into an at least partially phonetic symbol-based writing system including symbols, said method comprising: entering, with a human-to-machine interface, a string of characters of the complex character-based writing system into a transliterating engine; parsing said string of characters into individual characters, each character corresponding to one of a plurality of substrings of symbols; transliterating each of said characters into a corresponding substring of symbols; displaying said substring of symbols; wherein said transliterating comprises matching, by database retrieval, each substring series of symbols with one and only one characters; wherein at least one substring of symbols includes at least three symbols, which corresponds to one and only one character, at least one first symbol provides phonetic information, at least one second symbol provides information about a radical of said character and at least one third symbol provides information about the shape of the part of said character other than said radical.
|
16. A method for transliterating a complex character-based writing system including characters into an at least partially phonetic symbol-based writing system including symbols, said method comprising: entering, with a human-to-machine interface, a string of characters of the complex character-based writing system into a transliterating engine; parsing said string of characters into individual characters, each character corresponding to one of a plurality of substrings of symbols; transliterating each of said characters into a corresponding substring of symbols; displaying said substring of symbols; wherein said transliterating comprises matching, by database retrieval, each substring series of symbols with one and only one characters; wherein at least one substring of symbols includes at least three symbols, which corresponds to one and only one character, at least one first symbol provides phonetic information, at least one second symbol provides information about a radical of said character and at least one third symbol provides information about the shape of the part of said character other than said radical. 18. The method of claim 16 , further comprising matching, in database retrieval, a part of each of said characters individually with at least one substring of symbols, said at least one substring of symbols comprising only phonetic symbols, wherein at least one character is a most commonly used character corresponding to the phonetic substring of symbols.
| 0.5 |
9,892,109 | 1 | 2 |
1. A method programmed in a non-transitory memory of a device comprising: a. analyzing a first social networking web page, including parsing the first social networking web page into parsed segments; b. fact checking the first social networking web page to determine a factual accuracy of the first social networking web page by comparing the parsed segments with source information to generate fact check results; c. generating a second social networking web page including generating and naming a new web page file; d. coding, using the device, the fact check results in the second social networking web page based on the comparison of the parsed segments with the source information, wherein coding the fact check results of the first social networking web page in the second social networking web page includes automatically writing programming information and the fact check results in the new web page file, including coding each fact check result after an associated parsed segment; and e. predicting when a user will visit the first social networking web page, and fact checking the first social networking web page before the user visits the first social networking web page, so that when the user attempts to visit the first social networking web page, the user visits the second social networking web page coded with the fact check results, wherein predicting when the user will visit the first social networking web page includes determining locations of links on a current web page by locating link tags and respective pixel positions on a screen, tracking input movements by detecting previous and current pixel positions of a cursor including determining if the cursor is over a link or if the cursor is moving toward the link by projecting a line along a current path of the cursor, and if the cursor is over or going towards the link, the link is predicted to be clicked.
|
1. A method programmed in a non-transitory memory of a device comprising: a. analyzing a first social networking web page, including parsing the first social networking web page into parsed segments; b. fact checking the first social networking web page to determine a factual accuracy of the first social networking web page by comparing the parsed segments with source information to generate fact check results; c. generating a second social networking web page including generating and naming a new web page file; d. coding, using the device, the fact check results in the second social networking web page based on the comparison of the parsed segments with the source information, wherein coding the fact check results of the first social networking web page in the second social networking web page includes automatically writing programming information and the fact check results in the new web page file, including coding each fact check result after an associated parsed segment; and e. predicting when a user will visit the first social networking web page, and fact checking the first social networking web page before the user visits the first social networking web page, so that when the user attempts to visit the first social networking web page, the user visits the second social networking web page coded with the fact check results, wherein predicting when the user will visit the first social networking web page includes determining locations of links on a current web page by locating link tags and respective pixel positions on a screen, tracking input movements by detecting previous and current pixel positions of a cursor including determining if the cursor is over a link or if the cursor is moving toward the link by projecting a line along a current path of the cursor, and if the cursor is over or going towards the link, the link is predicted to be clicked. 2. The method of claim 1 further comprising replacing the first social networking web page with the second social networking web page.
| 0.966766 |
6,130,670 | 5 | 6 |
5. The method of claim 4, wherein an object is not visible from a camera position if and only if all vertices of its bounding box are occluded by a single occluder node in camera space.
|
5. The method of claim 4, wherein an object is not visible from a camera position if and only if all vertices of its bounding box are occluded by a single occluder node in camera space. 6. The method of claim 5, wherein each object's bounding box can exist in any of three states relative to an occluder, including wherein said bounding box is completely unobstructed by said occluder, in which case said object is visible to said camera; where said bounding box is partially occluded by said occluder, in which case said object is partially visible to said camera; and wherein said bounding box is completely occluded by said occluder, in which case said object is not visible to said camera.
| 0.5 |
9,508,027 | 1 | 19 |
1. A method comprising: identifying, via a processor, an identifier in a text, wherein the identifier identifies an element of a figure in a first language, wherein the figure comprises a reference and a first line, wherein the first line extends between the element and the reference; accessing, via the processor, a data structure referencing between the first language and a second language; translating, via the processor, the identifier from the first language to the second language based at least in part on the data structure; modifying, via the processor, the figure based at least in part on the translating, wherein the modifying comprises at least one of: placing, via the processor, the identifier recited in the second language onto the figure adjacent to the reference without overlying the reference; placing, via the processor, a second line and the identifier recited in the second language onto the figure such that the reference is positioned between the first line and the second line and such that the second line is positioned between the reference and the identifier recited in the second language; replacing, via the processor, the reference in the figure with the identifier recited in the second language; placing, via the processor, the identifier recited in the second language onto the figure such that the identifier recited in the second language is positioned within the element; or placing, via the processor, a shape and the identifier recited in the second language onto the figure such that the shape encloses the reference and the identifier recited in the second language.
|
1. A method comprising: identifying, via a processor, an identifier in a text, wherein the identifier identifies an element of a figure in a first language, wherein the figure comprises a reference and a first line, wherein the first line extends between the element and the reference; accessing, via the processor, a data structure referencing between the first language and a second language; translating, via the processor, the identifier from the first language to the second language based at least in part on the data structure; modifying, via the processor, the figure based at least in part on the translating, wherein the modifying comprises at least one of: placing, via the processor, the identifier recited in the second language onto the figure adjacent to the reference without overlying the reference; placing, via the processor, a second line and the identifier recited in the second language onto the figure such that the reference is positioned between the first line and the second line and such that the second line is positioned between the reference and the identifier recited in the second language; replacing, via the processor, the reference in the figure with the identifier recited in the second language; placing, via the processor, the identifier recited in the second language onto the figure such that the identifier recited in the second language is positioned within the element; or placing, via the processor, a shape and the identifier recited in the second language onto the figure such that the shape encloses the reference and the identifier recited in the second language. 19. The method of claim 1 , wherein the modifying comprises placing, via the processor, the identifier recited in the second language onto the figure such that the identifier recited in the second language is positioned within the element.
| 0.673497 |
9,552,402 | 1 | 9 |
1. A computer program product for converting both a tabbed table in an XML format and a collapsible section in the XML format to forms configured for storage in a relational database and use by a web-based application, both the tabbed table in the XML format and the collapsible section in XML format derived from respective unstructured rich text, the computer program product comprising: one or more computer-readable tangible storage devices and program instructions stored on at least one of the one or more storage devices, said one or more computer-readable tangible storage devices not including a transitory signal, the program instructions comprising: program instructions to convert unstructured rich text information to XML files in the XML format, wherein the unstructured rich text information comprises the tabbed table as unstructured rich text and the collapsible section as unstructured rich text, wherein the tabbed table is a first type of unstructured rich text information that is tabbed table specific, wherein the collapsible section is a second type of unstructured rich text information that is collapsible section specific, and wherein the XML files in the XML format comprise the tabbed table in the XML format and the collapsible section in the XML format; program instructions to transform, using a first reusable stylesheet that is specific to the first type of unstructured rich text information that is tabbed table specific, the tabbed table in the XML format to an XHTML format configured for storage in a relational database by creating a parent, table object, creating a body for the parent table object to form a container including cells for the tabbed table and creating children of the parent, table object to record information contents of the cells in the container; program instructions to initiate storage of the tabbed table object, including the body of the parent table object and the children of the parent table object, in the XHTML format in a relational database; program instructions to subsequently export the tabbed table, including the body of the parent table object and the children of the parent table object, in the XHMTL format from the relational database to a web-based application; program instructions to transform, using a second reusable stylesheet that is specific to the second type of unstructured rich text information that is collapsible section specific, the collapsible section in the XML format to an XHTML format configured for storage in a relational database by creating a parent, collapsed object and creating children of the parent, collapsed object to record information content of an uncollapsed form of the collapsed parent object; program instructions to initiate storage of the collapsible section in the XHTML format in a relational database; and program instructions to subsequently export the collapsible section in the XHMTL format from the relational database to a web-based application.
|
1. A computer program product for converting both a tabbed table in an XML format and a collapsible section in the XML format to forms configured for storage in a relational database and use by a web-based application, both the tabbed table in the XML format and the collapsible section in XML format derived from respective unstructured rich text, the computer program product comprising: one or more computer-readable tangible storage devices and program instructions stored on at least one of the one or more storage devices, said one or more computer-readable tangible storage devices not including a transitory signal, the program instructions comprising: program instructions to convert unstructured rich text information to XML files in the XML format, wherein the unstructured rich text information comprises the tabbed table as unstructured rich text and the collapsible section as unstructured rich text, wherein the tabbed table is a first type of unstructured rich text information that is tabbed table specific, wherein the collapsible section is a second type of unstructured rich text information that is collapsible section specific, and wherein the XML files in the XML format comprise the tabbed table in the XML format and the collapsible section in the XML format; program instructions to transform, using a first reusable stylesheet that is specific to the first type of unstructured rich text information that is tabbed table specific, the tabbed table in the XML format to an XHTML format configured for storage in a relational database by creating a parent, table object, creating a body for the parent table object to form a container including cells for the tabbed table and creating children of the parent, table object to record information contents of the cells in the container; program instructions to initiate storage of the tabbed table object, including the body of the parent table object and the children of the parent table object, in the XHTML format in a relational database; program instructions to subsequently export the tabbed table, including the body of the parent table object and the children of the parent table object, in the XHMTL format from the relational database to a web-based application; program instructions to transform, using a second reusable stylesheet that is specific to the second type of unstructured rich text information that is collapsible section specific, the collapsible section in the XML format to an XHTML format configured for storage in a relational database by creating a parent, collapsed object and creating children of the parent, collapsed object to record information content of an uncollapsed form of the collapsed parent object; program instructions to initiate storage of the collapsible section in the XHTML format in a relational database; and program instructions to subsequently export the collapsible section in the XHMTL format from the relational database to a web-based application. 9. The computer program product of claim 1 , wherein the first stylesheet comprises program instructions to process a set of child nodes, including program instructions to process, for each child node, a set of rows of the tabbed table specific to each child node.
| 0.900452 |
7,991,615 | 1 | 4 |
1. A method performed by a computer comprising storage and a processor, the method comprising: modeling acoustic data, a phoneme sequence, a grapheme sequence and an alignment between the phoneme sequence and the grapheme sequence to provide a graphoneme model stored in the storage; and retraining, by the processor, a grapheme to phoneme model usable in speech recognition by optimizing the graphoneme model using acoustic data stored in the storage.
|
1. A method performed by a computer comprising storage and a processor, the method comprising: modeling acoustic data, a phoneme sequence, a grapheme sequence and an alignment between the phoneme sequence and the grapheme sequence to provide a graphoneme model stored in the storage; and retraining, by the processor, a grapheme to phoneme model usable in speech recognition by optimizing the graphoneme model using acoustic data stored in the storage. 4. The method of claim 1 wherein optimizing the graphoneme model comprises performing discriminative training of graphoneme model parameters using the acoustic data.
| 0.83631 |
8,584,085 | 1 | 11 |
1. In a computing device comprising a graphical user interface having at least one user input device, a method for concept identification in software, the method comprising: displaying, via the graphical user interface, concept specification prompts; receiving, via the at least one user input device based on the concept specification prompts, concept specification information corresponding to a concept, the concept comprising at least one of code abstraction, design abstraction, and architectural abstraction, the concept specification information comprising a code pattern illustrating the concept, and the code pattern including a predetermined length of source code or object code that defines the concept; parsing, by the computing device, the code pattern to identify at least one token; generating, by the computing device, at least one rule based on the at least one token and according to a mapping; identifying, by the computing device, occurrence of the concept in a code listing based on the at least one rule; and displaying, via the graphical user interface, information regarding the occurrence of the concept in the code listing as an indication of quality of the code listing, the displayed information comprising at least one of information concerning presence of the concept in the code listing and information concerning absence of the concept in the code listing.
|
1. In a computing device comprising a graphical user interface having at least one user input device, a method for concept identification in software, the method comprising: displaying, via the graphical user interface, concept specification prompts; receiving, via the at least one user input device based on the concept specification prompts, concept specification information corresponding to a concept, the concept comprising at least one of code abstraction, design abstraction, and architectural abstraction, the concept specification information comprising a code pattern illustrating the concept, and the code pattern including a predetermined length of source code or object code that defines the concept; parsing, by the computing device, the code pattern to identify at least one token; generating, by the computing device, at least one rule based on the at least one token and according to a mapping; identifying, by the computing device, occurrence of the concept in a code listing based on the at least one rule; and displaying, via the graphical user interface, information regarding the occurrence of the concept in the code listing as an indication of quality of the code listing, the displayed information comprising at least one of information concerning presence of the concept in the code listing and information concerning absence of the concept in the code listing. 11. The method of claim 1 , further comprising: augmenting the concept specification information with a multi-location pattern definition such that the code pattern provides for definition of a partial concept of the concept.
| 0.659091 |
9,280,340 | 1 | 5 |
1. A method of building a software system pipeline comprising a set of elements, comprising: storing dependency data for one or more elements, the dependency data for at least a particular element having been derived from a data model generated as a result of executing at least one other pipeline in which the particular element was included; identifying a first element; associating a second element to the first element to form a portion of the software system pipeline, wherein the particular element is one of the first and second elements; retrieving dependency data for at least one of the first and second elements, at least some of the retrieved dependency data being dependency data that was derived from the data model; and automatically generating descriptor data for the software system pipeline based on the retrieved dependency data; wherein at least one of the steps is carried out in software executing in a hardware element.
|
1. A method of building a software system pipeline comprising a set of elements, comprising: storing dependency data for one or more elements, the dependency data for at least a particular element having been derived from a data model generated as a result of executing at least one other pipeline in which the particular element was included; identifying a first element; associating a second element to the first element to form a portion of the software system pipeline, wherein the particular element is one of the first and second elements; retrieving dependency data for at least one of the first and second elements, at least some of the retrieved dependency data being dependency data that was derived from the data model; and automatically generating descriptor data for the software system pipeline based on the retrieved dependency data; wherein at least one of the steps is carried out in software executing in a hardware element. 5. The method as described in claim 1 wherein the first element is identified using a visual editor.
| 0.829932 |
6,122,361 | 2 | 3 |
2. An automated directory assistance system as defined in claim 1, wherein said weighing unit for weighing the candidates establishes for each candidate a compound probability value that is indicative of a likelihood of match of the candidate with the spoken utterance, the compound probability depending in part on a degree of acoustic match between the candidate and the spoken utterance and depending in part on a probability data elements in said one of said a priori data structures.
|
2. An automated directory assistance system as defined in claim 1, wherein said weighing unit for weighing the candidates establishes for each candidate a compound probability value that is indicative of a likelihood of match of the candidate with the spoken utterance, the compound probability depending in part on a degree of acoustic match between the candidate and the spoken utterance and depending in part on a probability data elements in said one of said a priori data structures. 3. An automated directory assistance system as defined in claim 2, wherein said selecting unit is operative for processing data indicative of at least a portion of a telephone number of a terminal from which the user is inputting the spoken utterance to select one of said a priori data structures.
| 0.5 |
7,720,282 | 1 | 3 |
1. One or more computer-readable storage media containing computer-executable instructions stored thereon, that when implemented by a computer, cause the computer to perform a method comprising: a) receiving a first image and a second image, at least a portion of the first image representing a first view of a scene and at least a portion of the second image representing a second view of the scene; b) determining a first image intensity function of the first image; c) determining a second image intensity function of the second image; d) determining a disparity map based on the first image and the second image; e) determining a cyclopean image based on the first image and the second image; f) determining an energy function including a matching likelihood, a color likelihood, and a stereo disparity likelihood based on the first image intensity function, the second image intensity function, the disparity map and the cyclopean image; g) optimizing the energy function to determine a segmentation state variable value for a plurality of pixels in a reference image, the reference image including the first image, the second image, or the cyclopean image, the segmentation state variable value indicating a segmentation layer of the pixel, the segmentation layer being a member of a group comprising a foreground layer and a background layer.
|
1. One or more computer-readable storage media containing computer-executable instructions stored thereon, that when implemented by a computer, cause the computer to perform a method comprising: a) receiving a first image and a second image, at least a portion of the first image representing a first view of a scene and at least a portion of the second image representing a second view of the scene; b) determining a first image intensity function of the first image; c) determining a second image intensity function of the second image; d) determining a disparity map based on the first image and the second image; e) determining a cyclopean image based on the first image and the second image; f) determining an energy function including a matching likelihood, a color likelihood, and a stereo disparity likelihood based on the first image intensity function, the second image intensity function, the disparity map and the cyclopean image; g) optimizing the energy function to determine a segmentation state variable value for a plurality of pixels in a reference image, the reference image including the first image, the second image, or the cyclopean image, the segmentation state variable value indicating a segmentation layer of the pixel, the segmentation layer being a member of a group comprising a foreground layer and a background layer. 3. The computer readable media of claim 1 , wherein determining the energy function includes weighting at least one member of a group consisting of the color likelihood, the stereo disparity likelihood, and a contrast likelihood in response to a confidence in the at least one member.
| 0.5 |
8,838,512 | 14 | 15 |
14. One or more computer-readable storage media storing computer-executable instructions that, when executed on one or more processors, cause the one or more processors to perform operations comprising: receiving an input query transmitted over a network; determining an input query pattern associated with the input query; accessing a library comprising one or more query patterns associated with one or more predefined search task categories by one or more transition probabilities, each of the one or more predefined search task categories associated with a task to be accomplished; classifying the input query pattern into one or more search tasks according to the one or more predefined search task categories, the classifying based at least in part on a lookup of the input query pattern in the library and identifying one or more tasks to be accomplished associated with the one or more predefined search task categories associated with a query pattern of the one or more query patterns similar to the input query pattern; and determining a search result based at least in part on the classified one or more search tasks, the search result based at least in part on the identified one or more tasks to be accomplished.
|
14. One or more computer-readable storage media storing computer-executable instructions that, when executed on one or more processors, cause the one or more processors to perform operations comprising: receiving an input query transmitted over a network; determining an input query pattern associated with the input query; accessing a library comprising one or more query patterns associated with one or more predefined search task categories by one or more transition probabilities, each of the one or more predefined search task categories associated with a task to be accomplished; classifying the input query pattern into one or more search tasks according to the one or more predefined search task categories, the classifying based at least in part on a lookup of the input query pattern in the library and identifying one or more tasks to be accomplished associated with the one or more predefined search task categories associated with a query pattern of the one or more query patterns similar to the input query pattern; and determining a search result based at least in part on the classified one or more search tasks, the search result based at least in part on the identified one or more tasks to be accomplished. 15. The one or more computer-readable storage media of claim 14 , wherein the determining comprises deconstructing the input query to ascertain an intent associated with the input query, the intent defined as computationally understanding a purpose or objective of the input query.
| 0.628307 |
8,386,450 | 14 | 15 |
14. The apparatus of claim 12 , further comprising: one or more computer programs for generating cardinality estimates for one or more query execution plans for the query using the statistics of one or more of the pre-defined queries that vertically overlap the query; and one or more computer programs for using the generated cardinality estimates to determine an optimal query execution plan for the query.
|
14. The apparatus of claim 12 , further comprising: one or more computer programs for generating cardinality estimates for one or more query execution plans for the query using the statistics of one or more of the pre-defined queries that vertically overlap the query; and one or more computer programs for using the generated cardinality estimates to determine an optimal query execution plan for the query. 15. The apparatus of claim 14 , wherein the statistics are used to improve a combined selectivity estimate of one or more predicates of the query.
| 0.5 |
7,484,960 | 1 | 2 |
1. A book suitable for concurrent use by a sighted person and a visually impaired person, comprising: at least one concordant page containing one or more conventional textual characters suitable for reading by a sighted person and one or more Braille characters corresponding to said textual characters, said textual and Braille characters being presented on the concordant page in a pattern such that each textual character is associated with its corresponding Braille character in a one-to-one relationship and such that each Braille character is embossed substantially directly below a corresponding textual character, wherein said pattern of said textual and Braille characters is presented in a first portion of said page, and wherein said concordant page further contains another copy of said textual characters in a second portion thereof, said second portion being sufficiently removed from said first portion so that a sighted person can read the text in said second portion while a visually impaired person is reading the Braille characters in said first portion.
|
1. A book suitable for concurrent use by a sighted person and a visually impaired person, comprising: at least one concordant page containing one or more conventional textual characters suitable for reading by a sighted person and one or more Braille characters corresponding to said textual characters, said textual and Braille characters being presented on the concordant page in a pattern such that each textual character is associated with its corresponding Braille character in a one-to-one relationship and such that each Braille character is embossed substantially directly below a corresponding textual character, wherein said pattern of said textual and Braille characters is presented in a first portion of said page, and wherein said concordant page further contains another copy of said textual characters in a second portion thereof, said second portion being sufficiently removed from said first portion so that a sighted person can read the text in said second portion while a visually impaired person is reading the Braille characters in said first portion. 2. The book of claim 1 , wherein said second portion is above said first portion.
| 0.853261 |
8,745,581 | 17 | 19 |
17. The system of claim 12 , wherein use of the code modification command set opens a new window that contains multiple panels, wherein the panels contain a copy of the code snippet, a display of the customized code snippet, and a place to enter or modify the command set.
|
17. The system of claim 12 , wherein use of the code modification command set opens a new window that contains multiple panels, wherein the panels contain a copy of the code snippet, a display of the customized code snippet, and a place to enter or modify the command set. 19. The system of claim 17 , wherein upon completion of the code modification command set closes the multiple paneled window, and duplicates and inserts the customized code snippet into the code editor based upon the code modification command set used.
| 0.5 |
10,095,789 | 3 | 4 |
3. The computer-implemented method of claim 2 further comprising: performing an image-recognition algorithm on the image file.
|
3. The computer-implemented method of claim 2 further comprising: performing an image-recognition algorithm on the image file. 4. The computer-implemented method of claim 3 , wherein the user-generated search query comprises a text result of the image-recognition algorithm on the image file.
| 0.5 |
7,548,462 | 16 | 17 |
16. The method of claim 10 , wherein the second programming and second program-verify operations during the second programming phase are conducted in a sequential order, comprising: programming one or more of the plurality of charge trapping memory cells along the word line to a first program level; verifying one or more of the plurality of charge trapping memory cells along the word line to a first program-verify level (PV 1 B); programming one or more of the plurality of charge trapping memory cells along the word line to a second program level; verifying one or more of the plurality of charge trapping memory cells along the word line to a second program-verify level (PV 2 B); programming one or more of the plurality of charge trapping memory cells along the word line to third program level; and verifying one or more of the plurality of charge trapping memory cells along the word line to a third program-verify level (PV 3 B).
|
16. The method of claim 10 , wherein the second programming and second program-verify operations during the second programming phase are conducted in a sequential order, comprising: programming one or more of the plurality of charge trapping memory cells along the word line to a first program level; verifying one or more of the plurality of charge trapping memory cells along the word line to a first program-verify level (PV 1 B); programming one or more of the plurality of charge trapping memory cells along the word line to a second program level; verifying one or more of the plurality of charge trapping memory cells along the word line to a second program-verify level (PV 2 B); programming one or more of the plurality of charge trapping memory cells along the word line to third program level; and verifying one or more of the plurality of charge trapping memory cells along the word line to a third program-verify level (PV 3 B). 17. The method of claim 16 , wherein the first program-verify level is less than the second program-verify level, and the second program-verify level is less than the third program-verify level.
| 0.505102 |
6,057,501 | 1 | 2 |
1. A method for teaching a set of musical notes to a child, said method comprising the steps of: providing a set of physical objects, each said object in said set of objects being characterized by a different color; matching each musical note i n said set of notes with a selected one of said different colors of said objects in said set of objects; forming a set of fanciful figures, each said figure in said set of figures prominently incorporating an image of a selected one of said physical objects in said set of objects; and matching each note in said set of notes with that figure in said set of figures which incorporates an image of that object in said set of objects which is characterized by that color with which that note has been matched.
|
1. A method for teaching a set of musical notes to a child, said method comprising the steps of: providing a set of physical objects, each said object in said set of objects being characterized by a different color; matching each musical note i n said set of notes with a selected one of said different colors of said objects in said set of objects; forming a set of fanciful figures, each said figure in said set of figures prominently incorporating an image of a selected one of said physical objects in said set of objects; and matching each note in said set of notes with that figure in said set of figures which incorporates an image of that object in said set of objects which is characterized by that color with which that note has been matched. 2. The method of claim 1, wherein the step of matching each said note with a figure further comprises: matching each object with said first display surface of that demonstration article which predominantly shows said color of that object thereon.
| 0.5 |
9,953,279 | 1 | 3 |
1. A computer implemented method for improving a business intelligence ecosystem, the method comprising: receiving, from a user device, a selection of a business intelligence artifact; determining one or more execution profiles for the selected business intelligence artifact; determining an initial examination score for the selected business intelligence artifact; identifying, via one or more improvement modules on a server, one or more candidate improvements to the business intelligence ecosystem based on a configurable set of rules; applying, via the one or more improvement modules on a server, one or more of the identified candidate improvements to modify the business intelligence ecosystem in which one or more of the candidate improvements was identified; executing the selected business intelligence artifact in the modified business intelligence ecosystem, wherein the selected business intelligence artifact is executed at least partially based on one or more of the execution profiles; determining examination data for the business intelligence artifact executed in the modified business intelligence ecosystem; reverting, via the one or more improvement modules, modifications to the modified business intelligence ecosystem by reverting the applied one or more candidate improvements; and identifying, via the one or more improvement modules, one or more qualified selected improvements based on a comparison of the examination data and the initial examination score, wherein at least one of the qualified selected improvements comprises at least one of the identified candidate improvements.
|
1. A computer implemented method for improving a business intelligence ecosystem, the method comprising: receiving, from a user device, a selection of a business intelligence artifact; determining one or more execution profiles for the selected business intelligence artifact; determining an initial examination score for the selected business intelligence artifact; identifying, via one or more improvement modules on a server, one or more candidate improvements to the business intelligence ecosystem based on a configurable set of rules; applying, via the one or more improvement modules on a server, one or more of the identified candidate improvements to modify the business intelligence ecosystem in which one or more of the candidate improvements was identified; executing the selected business intelligence artifact in the modified business intelligence ecosystem, wherein the selected business intelligence artifact is executed at least partially based on one or more of the execution profiles; determining examination data for the business intelligence artifact executed in the modified business intelligence ecosystem; reverting, via the one or more improvement modules, modifications to the modified business intelligence ecosystem by reverting the applied one or more candidate improvements; and identifying, via the one or more improvement modules, one or more qualified selected improvements based on a comparison of the examination data and the initial examination score, wherein at least one of the qualified selected improvements comprises at least one of the identified candidate improvements. 3. The method of claim 1 further comprising applying the qualified selected improvements to the business intelligence ecosystem.
| 0.892977 |
8,166,074 | 1 | 6 |
1. A digital storage medium having an index data structure for one or more data objects encoded thereon, the index data structure comprising: a) a plurality of index keys for uniquely identifying potential context nodes in a data object, each index key being associated with one or more potential context nodes, the index key having a label that provides semantic content to a user; and b) one or more routing tables associated with each index key, the one or more routing tables comprising at least 5 path references selected from a preceding peer-to-peer graph, a following peer-to-peer graph, an ancestor peer-to-peer graph, and descendent peer-to-peer graph.
|
1. A digital storage medium having an index data structure for one or more data objects encoded thereon, the index data structure comprising: a) a plurality of index keys for uniquely identifying potential context nodes in a data object, each index key being associated with one or more potential context nodes, the index key having a label that provides semantic content to a user; and b) one or more routing tables associated with each index key, the one or more routing tables comprising at least 5 path references selected from a preceding peer-to-peer graph, a following peer-to-peer graph, an ancestor peer-to-peer graph, and descendent peer-to-peer graph. 6. The digital storage medium of claim 1 wherein the one or more routing tables comprises: at least 2 path references selected from the preceding peer-to-peer graph; at least 2 path references selected from the following peer-to-peer graph; at least 2 path references selected from the ancestor peer-to-peer graph; and at least 2 path references selected from the descendent peer-to-peer graph.
| 0.632463 |
7,885,916 | 1 | 7 |
1. A system for providing real-time validation of text input fields in a Web page comprising: a validation-enhanced text input element configured to contain an attribute for a validation expression for a text field in a rendered Web page, wherein the validation-enhanced text input element is contained within a source code document corresponding to the rendered Web page; and an input text validator configured to validate a user-entered character of the text field against the validation expression in real-time and visually highlight invalid user-entered characters.
|
1. A system for providing real-time validation of text input fields in a Web page comprising: a validation-enhanced text input element configured to contain an attribute for a validation expression for a text field in a rendered Web page, wherein the validation-enhanced text input element is contained within a source code document corresponding to the rendered Web page; and an input text validator configured to validate a user-entered character of the text field against the validation expression in real-time and visually highlight invalid user-entered characters. 7. The system of claim 1 , wherein the input text validator is written in a scripting language.
| 0.915631 |
8,892,990 | 9 | 10 |
9. The computer-implemented method of claim 7 , wherein recreating the table comprises converting the column to symbolic representations and graphically changing at least one character in the symbolic representation.
|
9. The computer-implemented method of claim 7 , wherein recreating the table comprises converting the column to symbolic representations and graphically changing at least one character in the symbolic representation. 10. The computer-implemented method of claim 9 , further comprising sorting at least one row of the table by the symbolic representations under the column header.
| 0.5 |
8,290,777 | 31 | 36 |
31. A non-transitory computer-readable storage medium comprising instructions executable by a processor for: displaying a first portion of digital content on an electronic device; playing a segment of digital content as audio using a text to speech engine while the first portion of digital content is being displayed on the electronic device; and displaying a second portion of digital content if a current bookmark is greater than a last position in the displayed first portion of digital content.
|
31. A non-transitory computer-readable storage medium comprising instructions executable by a processor for: displaying a first portion of digital content on an electronic device; playing a segment of digital content as audio using a text to speech engine while the first portion of digital content is being displayed on the electronic device; and displaying a second portion of digital content if a current bookmark is greater than a last position in the displayed first portion of digital content. 36. The non-transitory computer-readable medium of claim 31 , further comprising instructions executable to wait a period of time before displaying the second portion of digital content based on a configurable delay value that is associated with the number of images that are included in the displayed first portion of digital content.
| 0.635076 |
7,765,224 | 14 | 18 |
14. A system for allocating hierarchically structured multi-dimensional data in a business application, the system comprising: a database configured to store data; an allocation engine configured to: receive a request for allocating the data; receive at least one first rule associated with allocation of the data, the at least one first rule being associated with an allocation target, an allocation source, and an allocation ratio; translate the at least one first rule to at least one second rule, wherein the at least one second rule comprises a query list comprising high-level language queries, each query in the query list being associated with a sub space of the database, the at least one second rule being configured to be modified to match at least one characteristic of the database, wherein the at least one characteristic of the database comprises at least one of the following: a dimension identifier and a hierarchical structure identifier; a modeling abstraction layer configured to: receive the query list; translate the query list to a physical query such that the physical query conforms to the at least one characteristic of the database; and a database engine configured to: receive the physical query; execute the physical query on the database; provide results of the physical query execution for allocating the data by the allocation engine to one of: an existing hierarchical structure and a new hierarchical structure in the database, the data being allocated to at least one of the following: a sub-space in the data space and the new hierarchy, wherein allocating the data comprises allocating the data according to at least one of the following: a weighted distribution scheme, and a user-defined formula, and the database engine being configured create an outline of dimensions and members.
|
14. A system for allocating hierarchically structured multi-dimensional data in a business application, the system comprising: a database configured to store data; an allocation engine configured to: receive a request for allocating the data; receive at least one first rule associated with allocation of the data, the at least one first rule being associated with an allocation target, an allocation source, and an allocation ratio; translate the at least one first rule to at least one second rule, wherein the at least one second rule comprises a query list comprising high-level language queries, each query in the query list being associated with a sub space of the database, the at least one second rule being configured to be modified to match at least one characteristic of the database, wherein the at least one characteristic of the database comprises at least one of the following: a dimension identifier and a hierarchical structure identifier; a modeling abstraction layer configured to: receive the query list; translate the query list to a physical query such that the physical query conforms to the at least one characteristic of the database; and a database engine configured to: receive the physical query; execute the physical query on the database; provide results of the physical query execution for allocating the data by the allocation engine to one of: an existing hierarchical structure and a new hierarchical structure in the database, the data being allocated to at least one of the following: a sub-space in the data space and the new hierarchy, wherein allocating the data comprises allocating the data according to at least one of the following: a weighted distribution scheme, and a user-defined formula, and the database engine being configured create an outline of dimensions and members. 18. The system of claim 14 , wherein the model includes the data and the at least one first rule associated with the allocation of the data.
| 0.675926 |
8,452,099 | 1 | 3 |
1. A method comprising: for each known text sample of a plurality of known text samples, each known text sample having a text type, generating, by a processor, an image of the known text sample; for each optical character recognition (OCR) engine of a plurality of OCR engines, inputting the image of the known text sample, by the processor, into the OCR engine; receiving output text corresponding to the image of the known text sample, by the processor, from the OCR engine; and, comparing the output text received from the OCR engine with the known text sample, by the processor, to determine a confidence value of the OCR engine for the text type of the known text sample, wherein for each OCR engine of one or more of the OCR engines, periodically redetermining the confidence values of the OCR engine.
|
1. A method comprising: for each known text sample of a plurality of known text samples, each known text sample having a text type, generating, by a processor, an image of the known text sample; for each optical character recognition (OCR) engine of a plurality of OCR engines, inputting the image of the known text sample, by the processor, into the OCR engine; receiving output text corresponding to the image of the known text sample, by the processor, from the OCR engine; and, comparing the output text received from the OCR engine with the known text sample, by the processor, to determine a confidence value of the OCR engine for the text type of the known text sample, wherein for each OCR engine of one or more of the OCR engines, periodically redetermining the confidence values of the OCR engine. 3. The method of claim 1 , wherein the confidence values of each OCR engine of the one or more of the OCR engines is redetermined responsive to an additional known text sample being added to the plurality of known text samples.
| 0.862591 |
9,304,984 | 1 | 6 |
1. A system comprising: at least one processor; a non-transitory storage medium storing instructions executable on the at least one processor to: ingest textual data from a text source; process the textual data and identify an intention statement within the textual data, wherein the intention statement includes a group of words or phrases expressing an intention of an author of the intention statement to perform an action; provide an interactive interface that includes representations of a plurality of patterns including respective different syntaxes of intention phrases, wherein a first syntax of intention phrases of a first pattern of the plurality of patterns includes an intention verb and an action verb, and a second syntax of intention phrases of a second pattern of the plurality of patterns includes an intention verb, a preposition, and an action verb; and receive user selection in the interactive interface of a selected pattern of the plurality of patterns comprising the first and second patterns, wherein the identified intention statement is according to the selected pattern.
|
1. A system comprising: at least one processor; a non-transitory storage medium storing instructions executable on the at least one processor to: ingest textual data from a text source; process the textual data and identify an intention statement within the textual data, wherein the intention statement includes a group of words or phrases expressing an intention of an author of the intention statement to perform an action; provide an interactive interface that includes representations of a plurality of patterns including respective different syntaxes of intention phrases, wherein a first syntax of intention phrases of a first pattern of the plurality of patterns includes an intention verb and an action verb, and a second syntax of intention phrases of a second pattern of the plurality of patterns includes an intention verb, a preposition, and an action verb; and receive user selection in the interactive interface of a selected pattern of the plurality of patterns comprising the first and second patterns, wherein the identified intention statement is according to the selected pattern. 6. The system of claim 1 , wherein the interactive interface facilitates analysis of a full text associated with the intention statement.
| 0.904463 |
9,959,098 | 1 | 11 |
1. A data processing system comprising: one or more repositories, each repository containing one or more spreadsheet module definitions, and each spreadsheet module definition comprising module definition software code specifying one or more spreadsheet objects; a computer software application or linked library used by a computing device having an operational memory, the computer software application or linked library acting as a module factory that executes module definition software code associated with the one or more spreadsheet module definitions to create a spreadsheet workbook and provides the created spreadsheet workbook in the operational memory of the computing device; and a spreadsheet engine used by the computing device into which the spreadsheet workbook is loaded after creation and which manages and executes the spreadsheet workbook; the data processing system thus providing a runtime dynamically generated spreadsheet workbook.
|
1. A data processing system comprising: one or more repositories, each repository containing one or more spreadsheet module definitions, and each spreadsheet module definition comprising module definition software code specifying one or more spreadsheet objects; a computer software application or linked library used by a computing device having an operational memory, the computer software application or linked library acting as a module factory that executes module definition software code associated with the one or more spreadsheet module definitions to create a spreadsheet workbook and provides the created spreadsheet workbook in the operational memory of the computing device; and a spreadsheet engine used by the computing device into which the spreadsheet workbook is loaded after creation and which manages and executes the spreadsheet workbook; the data processing system thus providing a runtime dynamically generated spreadsheet workbook. 11. The data processing system of claim 1 where the module definition software code from more than one spreadsheet module definitions is combined to create a composite workbook definition.
| 0.653137 |
7,490,099 | 5 | 6 |
5. The method of claim 3 , further comprising: c) receiving a user query based on the user interface; and d) displaying query results via the user interface.
|
5. The method of claim 3 , further comprising: c) receiving a user query based on the user interface; and d) displaying query results via the user interface. 6. The method of claim 5 , wherein step c) comprises: receiving user input of a first value into a first data entry field; and determining whether the first value already exists in a record of a database using the data model, and wherein step d) comprises retrieving the record and displaying record information to the user via the user interface.
| 0.5 |
8,874,589 | 10 | 12 |
10. A system for setting a threshold similarity score value for a first plurality of network device identifiers, comprising: a hardware processing circuit operable to: receive the first plurality of network device identifiers and characteristic data associated with network activity of each of the first plurality of network device identifiers; receive a second plurality of network device identifiers that do not appear in the first plurality of network device identifiers and characteristic data associated with network activity of each of the second plurality of network device identifiers; calculate, for each network device of the second plurality of network device identifiers, a similarity score that represents a degree of similarity between the characteristic data for the network device identifier of the second plurality and the characteristic data for the network device identifiers of the first plurality; designate a performance target relating to a factor indicative of an interest in or usefulness of content placed on a webpage, the performance target used to identify a smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target; designate a threshold similarity score value selected as a starting value for determining a lowest similarity score value that is used to identify the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target; identify a first number of network device identifiers from the second plurality that have similarity scores above the threshold similarity score value; receive, for each of the identified network device identifiers of the second plurality that have a similarity score above the threshold similarity score value, performance statistics data corresponding to the factor related to the designated performance target; aggregate the performance statistics data of each of the identified network device identifiers to determine an aggregate performance statistics data; determine, from the aggregate performance statistics data, that the first number of network device identifiers is not the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target; iteratively adjust, responsive to determining that the first number of network device identifiers is not the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target, the threshold similarity score value to identify the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target; and set the adjusted threshold similarity score value to an experimental threshold similarity score value that represents the lowest similarity score value that identifies the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target.
|
10. A system for setting a threshold similarity score value for a first plurality of network device identifiers, comprising: a hardware processing circuit operable to: receive the first plurality of network device identifiers and characteristic data associated with network activity of each of the first plurality of network device identifiers; receive a second plurality of network device identifiers that do not appear in the first plurality of network device identifiers and characteristic data associated with network activity of each of the second plurality of network device identifiers; calculate, for each network device of the second plurality of network device identifiers, a similarity score that represents a degree of similarity between the characteristic data for the network device identifier of the second plurality and the characteristic data for the network device identifiers of the first plurality; designate a performance target relating to a factor indicative of an interest in or usefulness of content placed on a webpage, the performance target used to identify a smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target; designate a threshold similarity score value selected as a starting value for determining a lowest similarity score value that is used to identify the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target; identify a first number of network device identifiers from the second plurality that have similarity scores above the threshold similarity score value; receive, for each of the identified network device identifiers of the second plurality that have a similarity score above the threshold similarity score value, performance statistics data corresponding to the factor related to the designated performance target; aggregate the performance statistics data of each of the identified network device identifiers to determine an aggregate performance statistics data; determine, from the aggregate performance statistics data, that the first number of network device identifiers is not the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target; iteratively adjust, responsive to determining that the first number of network device identifiers is not the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target, the threshold similarity score value to identify the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target; and set the adjusted threshold similarity score value to an experimental threshold similarity score value that represents the lowest similarity score value that identifies the smallest number of network device identifiers of the second plurality of network device users that have performance statistics data relating to the factor, which when aggregated, achieves the designated performance target. 12. The system of claim 10 , wherein in receiving the performance statistics data, the processing circuit is further operable to receive performance statistics data for a randomly selected subset of the second plurality of network device identifiers having a similarity score greater than or equal to the threshold similarity score value.
| 0.631808 |
6,072,461 | 1 | 4 |
1. A method for automatically tracking and synchronizing images displayed on a screen, the method comprising: simultaneously displaying on screen: a scanned image; and a corresponding typed-in image; automatically tracking a user's position within a first one of said images; and synchronizing the other image to the first image by displaying on the screen a position within the other image corresponding to said user's position within the first image.
|
1. A method for automatically tracking and synchronizing images displayed on a screen, the method comprising: simultaneously displaying on screen: a scanned image; and a corresponding typed-in image; automatically tracking a user's position within a first one of said images; and synchronizing the other image to the first image by displaying on the screen a position within the other image corresponding to said user's position within the first image. 4. A method according to claim 1 wherein said first one of said images comprises the typed-in image and said other one of said images comprises the scanned image.
| 0.672065 |
8,676,828 | 1 | 4 |
1. A computer-implemented method, comprising: determining completions for prefixes, wherein a prefix represents a portion of a search query and each completion represents a suggestion for completing the prefix and yielding a completed search query; identifying one or more content items for each determined completion; generating content item-completion pairs for the determined completions, each content item-completion pair being a pair of a determined completion and a content item identified for the determined completion; receiving user input in a control associated with a search engine, the user input including a series of input characters defining a prefix that when completed would form a completed search query; evaluating the characters of the prefix to identify one or more completions for the prefix; matching the one or more completions to one or more previously generated content item-completion pairs; identifying display data associated with the content item for a matching content item-completion pair for transmission to a user device along with one or more completions in response to receiving the user input; and providing, prior to a completed search query associated with the prefix being submitted to the search engine in a search request, the display data and the one or more completions to the user device, wherein the content item of the matching content item-completion pair is displayed proximate to a completion of the matching content item-completion pair on the user device.
|
1. A computer-implemented method, comprising: determining completions for prefixes, wherein a prefix represents a portion of a search query and each completion represents a suggestion for completing the prefix and yielding a completed search query; identifying one or more content items for each determined completion; generating content item-completion pairs for the determined completions, each content item-completion pair being a pair of a determined completion and a content item identified for the determined completion; receiving user input in a control associated with a search engine, the user input including a series of input characters defining a prefix that when completed would form a completed search query; evaluating the characters of the prefix to identify one or more completions for the prefix; matching the one or more completions to one or more previously generated content item-completion pairs; identifying display data associated with the content item for a matching content item-completion pair for transmission to a user device along with one or more completions in response to receiving the user input; and providing, prior to a completed search query associated with the prefix being submitted to the search engine in a search request, the display data and the one or more completions to the user device, wherein the content item of the matching content item-completion pair is displayed proximate to a completion of the matching content item-completion pair on the user device. 4. The method of claim 1 , wherein the prefix includes a first search term and a portion of a second search term.
| 0.772177 |
8,677,377 | 19 | 20 |
19. The computer readable storage medium of claim 14 , wherein the service-oriented architecture is interfaced to the active ontology via a service broker.
|
19. The computer readable storage medium of claim 14 , wherein the service-oriented architecture is interfaced to the active ontology via a service broker. 20. The computer readable storage medium of claim 19 , wherein the service broker is configured for at least one of: service selection, task delegation, query issuance, update issuance and service request monitoring.
| 0.5 |
7,657,432 | 3 | 4 |
3. The method according to claim 2 , wherein said resolving the at least one likelihood value comprises averaging the at least one likelihood value.
|
3. The method according to claim 2 , wherein said resolving the at least one likelihood value comprises averaging the at least one likelihood value. 4. The method according to claim 3 , wherein the likelihood value is determined via the following general equation: S ( U ❘ M ) = 1 T ∑ i = 1 L ∑ t = 1 T b i , j ( i , t ) P ( u t ❘ M { i , j ( i , t ) } ) ; wherein b_{i,j(i,t)} corresponds to grain-specific weights that satisfy ∑ i = 1 L ∑ j = 1 K ( i ) b ij = 1 ; and further wherein: S is the likelihood score; U is a test utterance, comprising T frames u 1 . . . , u T ; M(i,j) is a speaker model, with 1≦i≦L levels of detail and with 1≦j≦K(i) units on the i-th level; and P(u t |M(i,j)) is the probability that a frame u t corresponds to a speaker model unit j on the i-th level of phonetic detail of the speaker model.
| 0.5 |
7,483,908 | 1 | 2 |
1. A computer-implemented method for auditing data-access events occurring in a context management system, the method comprising: (A) collecting context data from a plurality of applications that use the context management system; (B) storing data corresponding to the collected context data on a centralized storage location; and (C) extracting audit information by processing at least a subset of the data stored on the centralized storage location, wherein the context data comprises patient context data items; and wherein the method further comprises: (D) appending an application-identifying tag to a URL to yield a compound URL; and (E) exchanging the compound URL with an application such that future communications with the application allow a context manager to identify the application from the application-identifying tag.
|
1. A computer-implemented method for auditing data-access events occurring in a context management system, the method comprising: (A) collecting context data from a plurality of applications that use the context management system; (B) storing data corresponding to the collected context data on a centralized storage location; and (C) extracting audit information by processing at least a subset of the data stored on the centralized storage location, wherein the context data comprises patient context data items; and wherein the method further comprises: (D) appending an application-identifying tag to a URL to yield a compound URL; and (E) exchanging the compound URL with an application such that future communications with the application allow a context manager to identify the application from the application-identifying tag. 2. The method of claim 1 , wherein any of the plurality of applications supports the CCOW standard set.
| 0.5 |
9,323,843 | 7 | 11 |
7. A non-transitory computer readable storage medium storing computer program instructions capable of being executed by a computer processor on a computing device, the computer program instructions defining the steps of: scanning, by a client-side module executing on a computing device, a Document Object Model (DOM) of a first web page displayed by a browser on a display of the computing device to determine a location of a primary search query user input area associated with the first web page; determining, by the client-side module, that a search query has been entered by a user into the primary search query user input area; in response to the determining, automatically entering, by the client-side module, the search query entered by the user into the primary search query user input area into a secondary search query user input area associated with a predetermined second web page, the second web page determined by the client-side module based on web browsing history of the user; displaying in a first content area of the browser the result of a search performed by a search tool represented by the first web page on the search query; and displaying in a second content area of the browser the result of a search performed by a search tool represented by the second web page on the search query.
|
7. A non-transitory computer readable storage medium storing computer program instructions capable of being executed by a computer processor on a computing device, the computer program instructions defining the steps of: scanning, by a client-side module executing on a computing device, a Document Object Model (DOM) of a first web page displayed by a browser on a display of the computing device to determine a location of a primary search query user input area associated with the first web page; determining, by the client-side module, that a search query has been entered by a user into the primary search query user input area; in response to the determining, automatically entering, by the client-side module, the search query entered by the user into the primary search query user input area into a secondary search query user input area associated with a predetermined second web page, the second web page determined by the client-side module based on web browsing history of the user; displaying in a first content area of the browser the result of a search performed by a search tool represented by the first web page on the search query; and displaying in a second content area of the browser the result of a search performed by a search tool represented by the second web page on the search query. 11. The non-transitory computer readable storage medium of claim 7 wherein the step of displaying results of the search performed by the search tool represented by the first web page further comprises the step of displaying personalized results of the search.
| 0.611111 |
8,848,026 | 12 | 15 |
12. The method of claim 1 , further comprising: presenting, by a computer, a configurable setting to the first device before connecting the first and second devices; receiving, by a computer, a selection regarding the configurable setting from the first device; sending, by a computer, a request to initiate the connection between the first and second devices to the second device; and displaying, by a computer, the selection regarding the configurable setting to the second user when sending a request to initiate the connection to the second device.
|
12. The method of claim 1 , further comprising: presenting, by a computer, a configurable setting to the first device before connecting the first and second devices; receiving, by a computer, a selection regarding the configurable setting from the first device; sending, by a computer, a request to initiate the connection between the first and second devices to the second device; and displaying, by a computer, the selection regarding the configurable setting to the second user when sending a request to initiate the connection to the second device. 15. The method of claim 12 , wherein the configurable setting is whether to display the keyword mentioned to social network connections of the first and second user.
| 0.641304 |
10,108,587 | 3 | 4 |
3. The method of claim 1 , further comprising: maintaining a data structure of variant mappings, wherein the variant mappings include the variant mapping, and wherein the variant mapping comprises a second code point of the variant; and identifying, as a part of the selecting, and corresponding to the location, the variant in the variant mapping.
|
3. The method of claim 1 , further comprising: maintaining a data structure of variant mappings, wherein the variant mappings include the variant mapping, and wherein the variant mapping comprises a second code point of the variant; and identifying, as a part of the selecting, and corresponding to the location, the variant in the variant mapping. 4. The method of claim 3 , further comprising: determining that a language of the second code point corresponds to a region of the location.
| 0.5 |
7,933,762 | 1 | 21 |
1. A machine-based method comprising: in connection with a project in which a predictive model is generated based on historical data about a system being modeled selecting variables having at least a first predetermined level of significance from a pool of potential predictor variables associated with the historical data, to form a first population of predictor variables, extending the first population of predictor variables to include cross products of at least two variables, each being from the first population of predictor variables, selecting variables having at least a second predetermined level of significance from the extended first population of predictor variables to form a second population of predictor variables, extending the second population of predictor variables to include cross products of at least two variables, at least one of the variables for at least one of the cross products being from the pool of potential predictor variables that are associated with the historical data and having less than the first predetermined level of significance, selecting variables having at least a third predetermined level of significance from the extended second population of predictor variables to form a third population of predictor variables, automatically selecting a model generation method from a set of available model generation methods to match characteristics of the historical data, generating a possible model of the third population of predictor variables using a subsample of the historical data by the model generation method, determining whether the possible model generalizes to the historical data other than the subsample, applying the possible model to all of the historical data to generate a final model, cross-validating the final model using random portions of the historical data, and interacting with the system being modeled based on the final model.
|
1. A machine-based method comprising: in connection with a project in which a predictive model is generated based on historical data about a system being modeled selecting variables having at least a first predetermined level of significance from a pool of potential predictor variables associated with the historical data, to form a first population of predictor variables, extending the first population of predictor variables to include cross products of at least two variables, each being from the first population of predictor variables, selecting variables having at least a second predetermined level of significance from the extended first population of predictor variables to form a second population of predictor variables, extending the second population of predictor variables to include cross products of at least two variables, at least one of the variables for at least one of the cross products being from the pool of potential predictor variables that are associated with the historical data and having less than the first predetermined level of significance, selecting variables having at least a third predetermined level of significance from the extended second population of predictor variables to form a third population of predictor variables, automatically selecting a model generation method from a set of available model generation methods to match characteristics of the historical data, generating a possible model of the third population of predictor variables using a subsample of the historical data by the model generation method, determining whether the possible model generalizes to the historical data other than the subsample, applying the possible model to all of the historical data to generate a final model, cross-validating the final model using random portions of the historical data, and interacting with the system being modeled based on the final model. 21. The method of claim 1 also including enabling a user to observe the performance of the possible model or the final model by means of links to a plurality of statistical and graphical reports.
| 0.688498 |
9,811,515 | 1 | 4 |
1. A method implemented by an information handling system that includes a memory and a processor, the method comprising: analyzing a plurality of posts included in a plurality of threads of one or more threaded discussions, wherein the analysis identifies a plurality of child posts that refer to a parent post selected from the plurality of posts by a user of a user interface; identifying a statement in the parent post, wherein the statement includes a possible answer to a question; analyzing the statement using agreement data found in the plurality of child posts, wherein one or more of the plurality of child posts includes one or more alternative answers to the question; identifying a structural support of each of the one or more alternative answers from one or more of the plurality of posts included in the thread, wherein the identifying further comprises scoring each of the one or more alternative answers; and displaying the parent post, an analysis of the statement in the parent post, and the one or more alternative answers to the user at the user interface, wherein the displaying further comprises displaying the identified structural support and the scoring for each of the one or more alternative answers.
|
1. A method implemented by an information handling system that includes a memory and a processor, the method comprising: analyzing a plurality of posts included in a plurality of threads of one or more threaded discussions, wherein the analysis identifies a plurality of child posts that refer to a parent post selected from the plurality of posts by a user of a user interface; identifying a statement in the parent post, wherein the statement includes a possible answer to a question; analyzing the statement using agreement data found in the plurality of child posts, wherein one or more of the plurality of child posts includes one or more alternative answers to the question; identifying a structural support of each of the one or more alternative answers from one or more of the plurality of posts included in the thread, wherein the identifying further comprises scoring each of the one or more alternative answers; and displaying the parent post, an analysis of the statement in the parent post, and the one or more alternative answers to the user at the user interface, wherein the displaying further comprises displaying the identified structural support and the scoring for each of the one or more alternative answers. 4. The method of claim 1 further comprising: analyzing a correctness of the statement using a question answering (QA) system; receiving an evaluation of the correctness of the statement from the QA system; and displaying, at the user interface, the evaluation of the correctness of the statement from the QA system.
| 0.827681 |
8,892,591 | 17 | 18 |
17. The medium of claim 15 , wherein the second content request comprises one or more search terms that are different from the one or more search terms associated with the first content request.
|
17. The medium of claim 15 , wherein the second content request comprises one or more search terms that are different from the one or more search terms associated with the first content request. 18. The medium of claim 17 , further comprising providing a control within the social networking application that, when activated, causes a plurality of search results associated with the first content request to be provided.
| 0.5 |
9,836,579 | 1 | 10 |
1. A hybrid electronic medical record system comprising: a structured database providing a plurality of records associated with particular patients and providing clinically derived medical data separated in different identified data fields: a medical record system computer processor configured to execute instructions loaded from a fixed memory to implement a database management engine communicating with the structured database and responding to structured queries to provide predefined reports collecting and organizing information from different fields of selected records according to the query; a document generator generating newly created pseudo-documents, wherein each newly created pseudo-document is correlated to a predefined report generated in response to a structured query, wherein the dynamic text in the newly created pseudo-document in linked to the data field of the single record, wherein the each pseudo-document are identified by a short document summary using predefined abstract templates; an inverted index indexing the newly created pseudo-documents according to text terms in the newly created pseudo-documents, wherein the inverted index is up-to-date ensures that returned information is never stale and permits a rapid response to text queries by pre-performing searching process; and a text search engine communicating with the inverted index and responding to the text queries to identify multiple ranked newly created pseudo-documents based on the indexing of the inverted index, wherein selection of an identified newly created pseudo-document provides the structured query to the database management engine, wherein the text search engine include a query expander to add additional medical words corresponding to the query and creates a union of reports that have linking words in the query.
|
1. A hybrid electronic medical record system comprising: a structured database providing a plurality of records associated with particular patients and providing clinically derived medical data separated in different identified data fields: a medical record system computer processor configured to execute instructions loaded from a fixed memory to implement a database management engine communicating with the structured database and responding to structured queries to provide predefined reports collecting and organizing information from different fields of selected records according to the query; a document generator generating newly created pseudo-documents, wherein each newly created pseudo-document is correlated to a predefined report generated in response to a structured query, wherein the dynamic text in the newly created pseudo-document in linked to the data field of the single record, wherein the each pseudo-document are identified by a short document summary using predefined abstract templates; an inverted index indexing the newly created pseudo-documents according to text terms in the newly created pseudo-documents, wherein the inverted index is up-to-date ensures that returned information is never stale and permits a rapid response to text queries by pre-performing searching process; and a text search engine communicating with the inverted index and responding to the text queries to identify multiple ranked newly created pseudo-documents based on the indexing of the inverted index, wherein selection of an identified newly created pseudo-document provides the structured query to the database management engine, wherein the text search engine include a query expander to add additional medical words corresponding to the query and creates a union of reports that have linking words in the query. 10. The hybrid electronic medical record system of claim 1 wherein further including a data entry interface allowing highlighting of data in the structured database as particularly significant for an information retrieval search and wherein the document generator ranks documents at least in part according to whether the data of a documents is highlighted.
| 0.5 |
7,783,614 | 7 | 8 |
7. The method of claim 2 , further comprising: writing a database query to the database for writing data entered into the document to a data field in the database linked to the given markup language element.
|
7. The method of claim 2 , further comprising: writing a database query to the database for writing data entered into the document to a data field in the database linked to the given markup language element. 8. The method of claim 7 , further comprising associating the database query with a given markup language element in the document for writing data entered into the document to a data field in the database linked to the given markup language element.
| 0.5 |
8,249,867 | 7 | 11 |
7. A target speech extraction method for a microphone-array-based speech recognition system, comprising: separating mixed signals input through a plurality of microphone into sound-source signals by an ICA; extracting one target speech spoken for speech recognition from the separated sound-source signals; and recognizing a desired speech from the extracted target speech, wherein the extracting of the target speech comprises: extracting feature vector sequence X i from the separated sound-source signals; calculating an ith LLR (logarithm likelihood ratio) LLR i of the extracted feature vector sequence; calculating a maximum value using the LLR i ; comparing the maximum value with a predetermined threshold value; and determining the maximum value to be the target speech when the maximum value is larger than the threshold value.
|
7. A target speech extraction method for a microphone-array-based speech recognition system, comprising: separating mixed signals input through a plurality of microphone into sound-source signals by an ICA; extracting one target speech spoken for speech recognition from the separated sound-source signals; and recognizing a desired speech from the extracted target speech, wherein the extracting of the target speech comprises: extracting feature vector sequence X i from the separated sound-source signals; calculating an ith LLR (logarithm likelihood ratio) LLR i of the extracted feature vector sequence; calculating a maximum value using the LLR i ; comparing the maximum value with a predetermined threshold value; and determining the maximum value to be the target speech when the maximum value is larger than the threshold value. 11. The target speech extraction method of claim 7 , wherein, when additional information representing speech-music information is provided, the LLR i is calculated as expressed by L L R i = log P ( X i | λ Speech ) P ( X i | λ Music ) by applying GMMs λ speech and λ Music generated based on the speech-music information to the extracted feature vector sequence X i .
| 0.742588 |
10,007,722 | 1 | 3 |
1. A method for improving engagement of user in collaboration activities, the method comprising: detecting a request to select an artifact in a communication system, wherein said artifact is a digital object displayed to said user on a user's computing device that is used for engaging in collaborative activity with other users, wherein said selecting said artifact comprises selecting to view a collaboration summary of said artifact, wherein said selection of said artifact is detected to have occurred in response to one of the following: said artifact having a threshold number of updates over a period of time and said artifact is associated with a threshold number of users; analyzing said communication system for identifying collaboration activities related to said artifact, wherein said collaboration activities comprise user actions that occur when using artifacts; retrieving details of said artifact upon detecting said user selecting said artifact; retrieving details concerning said identified collaboration activities related to said artifact, wherein said details are selected from the group consisting of: names of users who made postings and time and date of said postings; analyzing said details of said artifact and said details concerning said identified collaboration activities related to said artifact using natural language processing to identify other related artifacts; creating a list of artifacts related to said artifact based on said analysis of said details of said artifact and said details concerning said identified collaboration activities related to said artifact to identify other related activities; determining for each artifact in said list of related artifacts if the respective artifact is permitted for collaboration based on a policy associated with said respective artifact, wherein if said respective artifact is not permitted for collaboration, removing said respective artifact from said list of related artifacts; determining, by a processor of a collaboration mechanism, collaboration activities for each artifact in said list of related artifacts, wherein said collaboration activities for each artifact in said list of related artifacts are determined using natural language processing; analyzing, by said processor of said collaboration mechanism, said determined collaboration activities for each artifact in said list of related artifacts; forming, by said processor of said collaboration mechanism, said collaboration summary for each artifact in said list of related artifacts based on said analysis of said determined collaboration activities for each artifact in said list of related artifacts, wherein said collaboration summary comprises a summary of collaboration activities; weighting said collaboration activities in said collaboration summary for each artifact in said list of related artifacts based on time of said collaboration activities; ordering said collaboration activities in said collaboration summary for each artifact in said list of related artifacts based on said weights; and presenting said collaboration summary for each artifact in said list of related artifacts to a user based on said order.
|
1. A method for improving engagement of user in collaboration activities, the method comprising: detecting a request to select an artifact in a communication system, wherein said artifact is a digital object displayed to said user on a user's computing device that is used for engaging in collaborative activity with other users, wherein said selecting said artifact comprises selecting to view a collaboration summary of said artifact, wherein said selection of said artifact is detected to have occurred in response to one of the following: said artifact having a threshold number of updates over a period of time and said artifact is associated with a threshold number of users; analyzing said communication system for identifying collaboration activities related to said artifact, wherein said collaboration activities comprise user actions that occur when using artifacts; retrieving details of said artifact upon detecting said user selecting said artifact; retrieving details concerning said identified collaboration activities related to said artifact, wherein said details are selected from the group consisting of: names of users who made postings and time and date of said postings; analyzing said details of said artifact and said details concerning said identified collaboration activities related to said artifact using natural language processing to identify other related artifacts; creating a list of artifacts related to said artifact based on said analysis of said details of said artifact and said details concerning said identified collaboration activities related to said artifact to identify other related activities; determining for each artifact in said list of related artifacts if the respective artifact is permitted for collaboration based on a policy associated with said respective artifact, wherein if said respective artifact is not permitted for collaboration, removing said respective artifact from said list of related artifacts; determining, by a processor of a collaboration mechanism, collaboration activities for each artifact in said list of related artifacts, wherein said collaboration activities for each artifact in said list of related artifacts are determined using natural language processing; analyzing, by said processor of said collaboration mechanism, said determined collaboration activities for each artifact in said list of related artifacts; forming, by said processor of said collaboration mechanism, said collaboration summary for each artifact in said list of related artifacts based on said analysis of said determined collaboration activities for each artifact in said list of related artifacts, wherein said collaboration summary comprises a summary of collaboration activities; weighting said collaboration activities in said collaboration summary for each artifact in said list of related artifacts based on time of said collaboration activities; ordering said collaboration activities in said collaboration summary for each artifact in said list of related artifacts based on said weights; and presenting said collaboration summary for each artifact in said list of related artifacts to a user based on said order. 3. The method as recited in claim 1 , wherein said collaboration activities is selected from the group consisting of: comments, likes, dislikes, postings, sharings and resharings.
| 0.714968 |
9,547,832 | 12 | 22 |
12. A system comprising: one or more processors; a content monitor executable by the one or more processors and configured to: receive a content item from one or more of a plurality of communication channels, and determine the content item is to be processed further, the content item comprising: a communication from an individual, and a statement by the individual, the statement comprising committing language about an intent to attend an event; an analysis engine executable by the one or more processors and configured to determine a commitment score of the individual to attend the event by: identifying the event as a topic of interest in the content item; calculating a strength value of the intent of the individual to attend the event by performing a natural language analysis of the committing language of the statement by the individual in the content item, calculating a sentiment value of the intent of the individual to attend the event by performing a semantic analysis on the content item, the semantic analysis comprising identifying a description of a probability related to the event identified in the content item, calculating a social impact value of the intent of the individual to attend the event by performing a social impact analysis of the content item based on a number of receiving subscribers to the content item on the communication channel, and calculating a magnitude value of the intent of the individual to attend the event by performing a magnitude of commitment analysis of the content item based on a cost of attending the event, wherein: the commitment score comprises a combination of the strength value, the sentiment value, the social impact value, and the magnitude value; and determining an action based on the commitment score of the individual to attend the event.
|
12. A system comprising: one or more processors; a content monitor executable by the one or more processors and configured to: receive a content item from one or more of a plurality of communication channels, and determine the content item is to be processed further, the content item comprising: a communication from an individual, and a statement by the individual, the statement comprising committing language about an intent to attend an event; an analysis engine executable by the one or more processors and configured to determine a commitment score of the individual to attend the event by: identifying the event as a topic of interest in the content item; calculating a strength value of the intent of the individual to attend the event by performing a natural language analysis of the committing language of the statement by the individual in the content item, calculating a sentiment value of the intent of the individual to attend the event by performing a semantic analysis on the content item, the semantic analysis comprising identifying a description of a probability related to the event identified in the content item, calculating a social impact value of the intent of the individual to attend the event by performing a social impact analysis of the content item based on a number of receiving subscribers to the content item on the communication channel, and calculating a magnitude value of the intent of the individual to attend the event by performing a magnitude of commitment analysis of the content item based on a cost of attending the event, wherein: the commitment score comprises a combination of the strength value, the sentiment value, the social impact value, and the magnitude value; and determining an action based on the commitment score of the individual to attend the event. 22. The system of claim 12 , wherein the event comprises a conference, seminar, a training class, a promotional event, a user group, a meeting with coworkers, a meeting, a movie, a meal, or a vacation.
| 0.646127 |
10,097,483 | 6 | 9 |
6. A client computer configured for messaging integration of a business object comprising: at least one hardware processor configured to initiate the following executable operations: embedding, in a message session provided by a messenger, the business object into message text; applying, from within the message session, an action to the business object; forwarding, by the client and based upon the applied action, a copy of the message text to a backend business component separate from the client computer, indexing tags for the business object when indexing the message text for a message session in a message transcript; and searching the business object along with the message text of the message session in the message transcript with contextual relevance, wherein the business object encapsulates lower-level objects that implement a business process.
|
6. A client computer configured for messaging integration of a business object comprising: at least one hardware processor configured to initiate the following executable operations: embedding, in a message session provided by a messenger, the business object into message text; applying, from within the message session, an action to the business object; forwarding, by the client and based upon the applied action, a copy of the message text to a backend business component separate from the client computer, indexing tags for the business object when indexing the message text for a message session in a message transcript; and searching the business object along with the message text of the message session in the message transcript with contextual relevance, wherein the business object encapsulates lower-level objects that implement a business process. 9. The client computer of claim 6 , wherein the messenger is a discussion forum environment, the message text is discussion forum text and the messaging session is a threaded discussion forum.
| 0.505155 |
7,505,968 | 28 | 30 |
28. The method of claim 25 , wherein using the search linkages and the organizational linkages to calculate a relevance factor for each potentially relevant document comprises determining a baseline relevance factor and thereafter adjusting the relevance factor based on one or more specific comparisons.
|
28. The method of claim 25 , wherein using the search linkages and the organizational linkages to calculate a relevance factor for each potentially relevant document comprises determining a baseline relevance factor and thereafter adjusting the relevance factor based on one or more specific comparisons. 30. The method of claim 28 , wherein determining a baseline relevance factor comprises assigning a relevance factor of 100 if three or more search linkages exist with respect to the particular document.
| 0.632727 |
7,890,639 | 1 | 2 |
1. An apparatus for presenting content to a user, comprising: a first content; a first gadget to present the first content to the user; a second content, wherein the second content is unrelated to the first content; a second gadget independent of the first gadget to present the second content to the user; at least one server to store at least one of the first content, the second content, the first gadget, and the second gadget; a content page including the first gadget and the second gadget; a container hierarchy containing at least one container and a directory entry for the user; and an authorization server for verifying that the directory entry for the user authorizes the user to access the first content and the second content before permitting the user access to the content page, wherein each gadget includes at least one layout information file (LIF) specifying a layout for each gadget on the content page based on a combination of an identified device on which the content page is to be displayed and an identified user language in which the content gage is to be displayed and at least one layout strings file comprising strings to be displayed on each gadget, and wherein the first gadget includes a first LIF for use with a first combination of a device and a user language and a second LIF for use with a second combination of a device and a user language, where the first combination is different from the second combination.
|
1. An apparatus for presenting content to a user, comprising: a first content; a first gadget to present the first content to the user; a second content, wherein the second content is unrelated to the first content; a second gadget independent of the first gadget to present the second content to the user; at least one server to store at least one of the first content, the second content, the first gadget, and the second gadget; a content page including the first gadget and the second gadget; a container hierarchy containing at least one container and a directory entry for the user; and an authorization server for verifying that the directory entry for the user authorizes the user to access the first content and the second content before permitting the user access to the content page, wherein each gadget includes at least one layout information file (LIF) specifying a layout for each gadget on the content page based on a combination of an identified device on which the content page is to be displayed and an identified user language in which the content gage is to be displayed and at least one layout strings file comprising strings to be displayed on each gadget, and wherein the first gadget includes a first LIF for use with a first combination of a device and a user language and a second LIF for use with a second combination of a device and a user language, where the first combination is different from the second combination. 2. The apparatus according to claim 1 , further comprising software using the directory entry for the user in the container hierarchy to verify that the user is authorized to access the first content and the second content before permitting the user access to the content page.
| 0.5 |
8,375,072 | 7 | 9 |
7. A method comprising: using one or more processors to perform the following receiving data descriptive of a loss event, the loss event being associated with an insurance claim; identifying a hierarchy of a plurality of components for the loss event; correlating the data descriptive of the loss event to the plurality of components of the loss event to create a hierarchical data structure in response to the receiving of the data descriptive of the loss event and identifying the hierarchy, wherein the hierarchical data structure includes substructures that are created based on the received data descriptive of a loss event; automatically creating an electronic file folder hierarchy corresponding to the hierarchical data structure, wherein the electronic file folder hierarchy includes electronic file folders each including a one-to-one correspondence with a node of a navigation bar; scanning a paper document to an electronic document to be filed as an electronic file; creating a scan information sheet having a bar code thereon, the bar code containing data pertaining to: the paper document; and text data included on the scan information sheet; detecting a selection of a plurality of nodes of the navigation bar; and associating the electronic file, using the bar code of the scan information sheet, with a plurality of electronic file folders corresponding to the selected plurality of nodes of the navigation bar, wherein the association includes a hyperlink to display the electronic file.
|
7. A method comprising: using one or more processors to perform the following receiving data descriptive of a loss event, the loss event being associated with an insurance claim; identifying a hierarchy of a plurality of components for the loss event; correlating the data descriptive of the loss event to the plurality of components of the loss event to create a hierarchical data structure in response to the receiving of the data descriptive of the loss event and identifying the hierarchy, wherein the hierarchical data structure includes substructures that are created based on the received data descriptive of a loss event; automatically creating an electronic file folder hierarchy corresponding to the hierarchical data structure, wherein the electronic file folder hierarchy includes electronic file folders each including a one-to-one correspondence with a node of a navigation bar; scanning a paper document to an electronic document to be filed as an electronic file; creating a scan information sheet having a bar code thereon, the bar code containing data pertaining to: the paper document; and text data included on the scan information sheet; detecting a selection of a plurality of nodes of the navigation bar; and associating the electronic file, using the bar code of the scan information sheet, with a plurality of electronic file folders corresponding to the selected plurality of nodes of the navigation bar, wherein the association includes a hyperlink to display the electronic file. 9. The method as recited in claim 7 , wherein the hierarchical data structure comprises a plurality of predefined substructures, a particular predefined substructure of the plurality of predefined substructures selected in response to a categorization of a particular component of the plurality of components of the loss event.
| 0.5 |
7,716,199 | 1 | 2 |
1. A computer-implemented method comprising: receiving multiple context files from one or more third-party content providers, wherein each context file contains one or more commands for controlling an operation of the search engine in processing a search query input and in presenting search results, each context file is one of a plurality of predefined context files; receiving in a search engine the search query input, the search query input received from an interface provided by one of the third party content providers; aggregating the commands in the multiple context files into a set of aggregated commands; using the aggregated commands to control an organization and a presentation of the search results resulting from the processing of the search query input, including: processing the search query input using the aggregated commands to produce a context processed search query; generating context processed search results responsive to the context processed search query; storing the context processed search results on a memory; and providing the context processed search results in accordance with the aggregated commands.
|
1. A computer-implemented method comprising: receiving multiple context files from one or more third-party content providers, wherein each context file contains one or more commands for controlling an operation of the search engine in processing a search query input and in presenting search results, each context file is one of a plurality of predefined context files; receiving in a search engine the search query input, the search query input received from an interface provided by one of the third party content providers; aggregating the commands in the multiple context files into a set of aggregated commands; using the aggregated commands to control an organization and a presentation of the search results resulting from the processing of the search query input, including: processing the search query input using the aggregated commands to produce a context processed search query; generating context processed search results responsive to the context processed search query; storing the context processed search results on a memory; and providing the context processed search results in accordance with the aggregated commands. 2. The method of claim 1 , further comprising: receiving the multiple context files from different content providers, wherein each different content provider owns resources which have been crawled by the search engine.
| 0.674627 |
7,519,586 | 1 | 6 |
1. A method of searching comprising: receiving a user query from a user; after receiving said user query, performing a search based on said user query to produce results that are ranked, wherein said results comprise references to entities; contacting said entities to determine whether entities in said results desire to change their rank in said results; charging entities that increase their rank; after charging said entities and changing rankings of said results, reporting said results with changed rankings to said user; and crediting entities that decrease their rank.
|
1. A method of searching comprising: receiving a user query from a user; after receiving said user query, performing a search based on said user query to produce results that are ranked, wherein said results comprise references to entities; contacting said entities to determine whether entities in said results desire to change their rank in said results; charging entities that increase their rank; after charging said entities and changing rankings of said results, reporting said results with changed rankings to said user; and crediting entities that decrease their rank. 6. The method according to claim 1 , wherein said entities comprise Web sites.
| 0.791444 |
8,505,105 | 29 | 30 |
29. A system for managing a collaborative deal closing process that provides a means for tracking and managing signature pages of a closing deal using a taxonomy displayable by a computing device, the system comprising: means for receiving a list of users that are authorized to access the closing deal, the list including an identifier associated with each of the users; means for storing the list of authorized users; means for parsing the identifier associated with each user, wherein the identifier includes one from the group consisting of an email address, a domain name, a name of a company or group, and any combination thereof of the authorized users; means for grouping the users according to parties based on the identifier; means for creating a taxonomy including a listing of documents relevant to the deal and a listing of the parties of the deal; means for receiving at least one document at the server; and means for storing relevant pages of the at least one document, wherein each page is associated with a relevant party in the taxonomy.
|
29. A system for managing a collaborative deal closing process that provides a means for tracking and managing signature pages of a closing deal using a taxonomy displayable by a computing device, the system comprising: means for receiving a list of users that are authorized to access the closing deal, the list including an identifier associated with each of the users; means for storing the list of authorized users; means for parsing the identifier associated with each user, wherein the identifier includes one from the group consisting of an email address, a domain name, a name of a company or group, and any combination thereof of the authorized users; means for grouping the users according to parties based on the identifier; means for creating a taxonomy including a listing of documents relevant to the deal and a listing of the parties of the deal; means for receiving at least one document at the server; and means for storing relevant pages of the at least one document, wherein each page is associated with a relevant party in the taxonomy. 30. A system according to claim 29 , wherein the taxonomy is displayed in the form of a grid with the listing of the documents relevant to the deal on one axis, and the listing of the parties of the deal on another axis.
| 0.695291 |
9,807,216 | 8 | 13 |
8. A phone device comprising: a storage configured to store a registration table, in which phone numbers are associated with names of parties who own the phone numbers and each of the names is associated with a first language, with a second language, or with no valid language; and one or more processors coupled to the storage and configured to: in response to receiving a phone number, read a name of a party associated with the received phone number from the storage; responsive to the name associated with the first language, convert the name into voice data in the first language and output the voice data; responsive to the name associated with the second language, convert the name into voice data in the second language and output the voice data; responsive to the name associated with no valid language, convert the name into voice data in a default language and output the voice data, wherein the default language is one of the first language or the second language.
|
8. A phone device comprising: a storage configured to store a registration table, in which phone numbers are associated with names of parties who own the phone numbers and each of the names is associated with a first language, with a second language, or with no valid language; and one or more processors coupled to the storage and configured to: in response to receiving a phone number, read a name of a party associated with the received phone number from the storage; responsive to the name associated with the first language, convert the name into voice data in the first language and output the voice data; responsive to the name associated with the second language, convert the name into voice data in the second language and output the voice data; responsive to the name associated with no valid language, convert the name into voice data in a default language and output the voice data, wherein the default language is one of the first language or the second language. 13. The phone device of claim 8 , wherein the first language is English and the second language is Spanish.
| 0.904293 |
7,574,449 | 1 | 7 |
1. A computer storage medium having computer-executable instructions when executed by a computer cause the computer to perform steps comprising: receiving a first article for which to identify matching content; analyzing a set of raw text of the first article; analyzing a set of formatted text of the first article; analyzing one or more links contained in the first article; including the results of the analyzing the raw text step, the analyzing the formatted text step, and the analyzing the links step in a vector array; and using the vector array at least in part to find one or more other articles that are related to the first article.
|
1. A computer storage medium having computer-executable instructions when executed by a computer cause the computer to perform steps comprising: receiving a first article for which to identify matching content; analyzing a set of raw text of the first article; analyzing a set of formatted text of the first article; analyzing one or more links contained in the first article; including the results of the analyzing the raw text step, the analyzing the formatted text step, and the analyzing the links step in a vector array; and using the vector array at least in part to find one or more other articles that are related to the first article. 7. The computer storage medium of claim 1 , further comprising the steps of: performing transformations on the first article; and updating the vector array based on the transformations.
| 0.616183 |
8,612,424 | 5 | 6 |
5. The method of claim 1 further comprising receiving rankings of the plurality of search result sets for the at least one textual search query from the first user and the second user.
|
5. The method of claim 1 further comprising receiving rankings of the plurality of search result sets for the at least one textual search query from the first user and the second user. 6. The method of claim 5 further comprising generating a score based on an agreement between the rankings of the plurality of search result sets for the at least one query received from the first user and the second user.
| 0.5 |
8,949,214 | 1 | 18 |
1. A system for delivering a page including a plurality of widgets comprising: a processor configured to: receive a query; determine one or more subject type concepts associated with the query by computing an expected cooccurrence between the query and each selected one of the one or more subject type concepts and determining if the expected cooccurrence exceeds, by a threshold amount, an observed cooccurrence between the query and the selected one of the one or more subject type concepts, wherein a subject type concept is a concept included in a concept hierarchy; find candidate widgets that correspond to the one or more associated subject type concepts, wherein at least one candidate widget comprises an atomic unit of content; select a template that is mapped to the one or more associated subject type concepts; select a plurality of widgets based at least in part on the template; rank the plurality of widgets by determining a module to concept affinity score for each of the plurality of widgets; and generate a page to be delivered in response to the received query, wherein generating the page comprises placing the selected plurality of widgets in the generated page according to the template and the module to concept affinity score for each of the plurality of widgets; and a memory coupled to the processor and configured to provide the processor with instructions.
|
1. A system for delivering a page including a plurality of widgets comprising: a processor configured to: receive a query; determine one or more subject type concepts associated with the query by computing an expected cooccurrence between the query and each selected one of the one or more subject type concepts and determining if the expected cooccurrence exceeds, by a threshold amount, an observed cooccurrence between the query and the selected one of the one or more subject type concepts, wherein a subject type concept is a concept included in a concept hierarchy; find candidate widgets that correspond to the one or more associated subject type concepts, wherein at least one candidate widget comprises an atomic unit of content; select a template that is mapped to the one or more associated subject type concepts; select a plurality of widgets based at least in part on the template; rank the plurality of widgets by determining a module to concept affinity score for each of the plurality of widgets; and generate a page to be delivered in response to the received query, wherein generating the page comprises placing the selected plurality of widgets in the generated page according to the template and the module to concept affinity score for each of the plurality of widgets; and a memory coupled to the processor and configured to provide the processor with instructions. 18. The system of claim 1 wherein at least one widget in the plurality of selected widgets is configured to receive a version of the query.
| 0.639896 |
8,406,384 | 4 | 5 |
4. A method according to claim 1 , further comprising: automatically assigning query tags from the query tag database to user queries from a new call routing application.
|
4. A method according to claim 1 , further comprising: automatically assigning query tags from the query tag database to user queries from a new call routing application. 5. A method according to claim 4 , further comprising: establish a call routing ontology for the new application organizing the query tags for the new application in a class hierarchy reflecting associated semantic concepts.
| 0.683616 |
8,933,962 | 13 | 14 |
13. A method as recited in claim 12 , wherein changing the style of the clipart image comprises: recoloring the clipart image by using a palette comprising a combination of multiple colors.
|
13. A method as recited in claim 12 , wherein changing the style of the clipart image comprises: recoloring the clipart image by using a palette comprising a combination of multiple colors. 14. A method as recited in claim 13 , wherein recoloring the selected clipart image by using the palette comprises: providing an interface to a user to select different colors to form the palette.
| 0.5 |
8,832,080 | 1 | 3 |
1. A system for generating a dynamic representation of relations among individuals, the system comprising: a memory for storing computer executable instructions; and a processing unit coupled to the memory, operable to execute the computer executable instructions, and based at least in part on the execution of the computer executable instructions operable to perform operations comprising: classifying main characters of images in an image collection based on assignments of respective groups of the images in which the main characters appear to respective events, wherein each image has a time stamp, and wherein each main character is characterized by at least one attribute; determining relation circles of the main characters based on the event assignments; and constructing a dynamic relation tree representative of relations among the main characters, wherein the dynamic relation tree provides representations of the positions of the main characters in the relation circles, and wherein views and constituents of the dynamic relation tree change when different time periods are specified during display.
|
1. A system for generating a dynamic representation of relations among individuals, the system comprising: a memory for storing computer executable instructions; and a processing unit coupled to the memory, operable to execute the computer executable instructions, and based at least in part on the execution of the computer executable instructions operable to perform operations comprising: classifying main characters of images in an image collection based on assignments of respective groups of the images in which the main characters appear to respective events, wherein each image has a time stamp, and wherein each main character is characterized by at least one attribute; determining relation circles of the main characters based on the event assignments; and constructing a dynamic relation tree representative of relations among the main characters, wherein the dynamic relation tree provides representations of the positions of the main characters in the relation circles, and wherein views and constituents of the dynamic relation tree change when different time periods are specified during display. 3. The system of claim 1 , further comprising an interactive interface to provide a selective time feature that allows a user to select views of the dynamic relation tree that display images of the dynamic relation tree associated with a specified time period.
| 0.8 |
8,145,911 | 29 | 33 |
29. A non-transitory computer-readable medium embodying a program of instructions for generating a certified electronic document when executed by a computer, the program of instructions operable to cause the computer to perform steps comprising: receiving, from a single computer, first identification information associated with a first signatory user; receiving, from the single computer, second identification information associated with a second signatory user; receiving from the single computer, third identification information associated with a notary user; identifying, on a display, at least one unexecuted electronic document that requires execution by the first and second signatory users; receiving a first user command from the single computer identifying the assent of the first signatory user to the execution of the at least one unexecuted electronic document; receiving a second user command from the single computer identifying the assent of the second signatory user to the execution of the at least one unexecuted electronic document; receiving a third user command from the single computer identifying the presence of a notary user with the first signatory user; and in response to receiving the first user command and the second user command, electronically executing the at least one unexecuted document by applying official electronic notarization indicia associated with the notary user to the at least one unexecuted document to create at least one electronically executed document, the official electronic notarization indicia certifying the presence of the notary user at the execution of the at least one executed and certified electronic document by the first user and identifying the notary user as a registered and valid notary meeting at least one jurisdictional requirement.
|
29. A non-transitory computer-readable medium embodying a program of instructions for generating a certified electronic document when executed by a computer, the program of instructions operable to cause the computer to perform steps comprising: receiving, from a single computer, first identification information associated with a first signatory user; receiving, from the single computer, second identification information associated with a second signatory user; receiving from the single computer, third identification information associated with a notary user; identifying, on a display, at least one unexecuted electronic document that requires execution by the first and second signatory users; receiving a first user command from the single computer identifying the assent of the first signatory user to the execution of the at least one unexecuted electronic document; receiving a second user command from the single computer identifying the assent of the second signatory user to the execution of the at least one unexecuted electronic document; receiving a third user command from the single computer identifying the presence of a notary user with the first signatory user; and in response to receiving the first user command and the second user command, electronically executing the at least one unexecuted document by applying official electronic notarization indicia associated with the notary user to the at least one unexecuted document to create at least one electronically executed document, the official electronic notarization indicia certifying the presence of the notary user at the execution of the at least one executed and certified electronic document by the first user and identifying the notary user as a registered and valid notary meeting at least one jurisdictional requirement. 33. The non-transitory computer-readable medium of claim 29 , wherein the program of instructions is further operable to cause the computer to: electronically capture a representation of a signature of the first user; and electronically capture a representation of a signature of the second user, and wherein electronically executing the at least one unexecuted document comprises applying the electronically captured representations of the signatures of the first and second users to the at least one unexecuted document to create the electronically executed document.
| 0.5 |
8,234,174 | 5 | 6 |
5. The method of claim 1 , further comprising: a. configuring the host server with an interactive advertisement builder for generating advertisements; and b. enabling the remote company user to manage the advertisement builder and generate advertisements thereby.
|
5. The method of claim 1 , further comprising: a. configuring the host server with an interactive advertisement builder for generating advertisements; and b. enabling the remote company user to manage the advertisement builder and generate advertisements thereby. 6. The method of claim 5 , further comprising: a. configuring the host server to keep record of all advertisements placed per media.
| 0.728395 |
9,146,908 | 1 | 9 |
1. A method for validating an XML document, comprising: parsing at least one XML document to be validated and representing XML data in the at least one XML document as data objects in at least one data object model in a memory; parsing at least one rule document and creating a rule object model comprising rule objects in the memory; extracting part of the data objects from the at least one data object model and extracting part of the rule objects from the rule object model; searching an execution context for at least one rule object of the extracted part of the rule objects from a context registry; performing validation for the at least one rule object in the execution context; and performing a partial validation in a corresponding execution context comprising validating the extracted part of the data objects based upon the extracted part of the rule objects.
|
1. A method for validating an XML document, comprising: parsing at least one XML document to be validated and representing XML data in the at least one XML document as data objects in at least one data object model in a memory; parsing at least one rule document and creating a rule object model comprising rule objects in the memory; extracting part of the data objects from the at least one data object model and extracting part of the rule objects from the rule object model; searching an execution context for at least one rule object of the extracted part of the rule objects from a context registry; performing validation for the at least one rule object in the execution context; and performing a partial validation in a corresponding execution context comprising validating the extracted part of the data objects based upon the extracted part of the rule objects. 9. The method according to claim 1 , where each element in the at least one XML document is mapped to a data object in the at least one data object model and the data objects maintain a hierarchical relationship corresponding to elements in the at least one XML document to be validated.
| 0.5 |
9,418,125 | 7 | 9 |
7. The method of claim 1 comprising: replacing a copy of the configurable field mappings file with a revised field mappings file, wherein said updating the search index is based at least in part on the revised field mappings file.
|
7. The method of claim 1 comprising: replacing a copy of the configurable field mappings file with a revised field mappings file, wherein said updating the search index is based at least in part on the revised field mappings file. 9. The method of claim 7 wherein said replacing the copy of the configurable field mappings file comprises clearing a cache of the configurable field mappings file.
| 0.508982 |
9,984,239 | 1 | 3 |
1. A concealing apparatus comprising: one or more hardware processors configured to: generate a concealed text by concealing a plaintext with a concealing key; generate mapping information that is mapped to a keyword such that different mapping information is associated with each instance of the same keyword; generate a tag based on the keyword and the mapping information; and output the concealed text and the tag as a pair to external storage storing a plurality of concealed texts each of which is paired with a tag, wherein the tag is transmitted to the external storage when retrieving the concealed text.
|
1. A concealing apparatus comprising: one or more hardware processors configured to: generate a concealed text by concealing a plaintext with a concealing key; generate mapping information that is mapped to a keyword such that different mapping information is associated with each instance of the same keyword; generate a tag based on the keyword and the mapping information; and output the concealed text and the tag as a pair to external storage storing a plurality of concealed texts each of which is paired with a tag, wherein the tag is transmitted to the external storage when retrieving the concealed text. 3. The apparatus according to claim 1 , wherein the one or more hardware processors are further configured to output the keyword and the mapping information as a pair and to store the pair of the keyword and the mapping information in an internal storage that is accessible by a specific privileged user.
| 0.547619 |
7,877,343 | 15 | 17 |
15. The method of claim 14 , further comprising the step of applying the ranking model to automatically learn to assess the tuples that are extracted in regard to the quality of the relationships of the tuples, to determine which tuples are to be retained.
|
15. The method of claim 14 , further comprising the step of applying the ranking model to automatically learn to assess the tuples that are extracted in regard to the quality of the relationships of the tuples, to determine which tuples are to be retained. 17. The method of claim 15 , wherein the step of automatically learning to assess comprises the steps of: (a) automatically labeling each relationship extracted from the training data as either positive or negative, producing labeled data; and (b) training an independent feature model using the labeled data, so that the independent feature model is used to determine the quality of the relationships indicated by the tuples, in regard to whether each of the relationships of the tuples extracted from the corpus of text is trustworthy or not trustworthy.
| 0.5 |
7,599,580 | 1 | 12 |
1. A method in a computing system for processing a distinguished text capture operation, comprising: receiving human-readable text captured by a user via a portable capture device from a distinguished rendered document in the distinguished text capture operation; receiving supplemental information distinct from the captured text, said supplemental information comprising an identity associated with said user; and automatically determining, by the computing system in response to the distinguished text capture operation and based upon both the captured text and the supplemental information, which one of a predetermined plurality of actions is likely optimal for said user.
|
1. A method in a computing system for processing a distinguished text capture operation, comprising: receiving human-readable text captured by a user via a portable capture device from a distinguished rendered document in the distinguished text capture operation; receiving supplemental information distinct from the captured text, said supplemental information comprising an identity associated with said user; and automatically determining, by the computing system in response to the distinguished text capture operation and based upon both the captured text and the supplemental information, which one of a predetermined plurality of actions is likely optimal for said user. 12. The method of claim 1 wherein the received supplemental information indicates a geographic location at which the distinguished capture operation was performed, and wherein the determining comprises: identifying a plurality of electronic documents containing the received captured text; and ranking the likelihood of the identified electronic documents corresponding to the distinguished rendered document based upon the likelihood that a rendered version of each identified electronic document would be available in the indicated geographic location.
| 0.624661 |
9,747,555 | 9 | 10 |
9. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising: retrieving, from a data storage circuit, multiple label sets that contain labels that each classify data points in a corpus of data; generating a graph that includes a plurality of edges, each edge between two respective labels from different label sets of the multiple label sets; determining weights for the plurality of edges based upon a consistency between the data points classified by two labels connected by the edges; applying an algorithm that creates grouped labels from the multiple label sets and based upon the weights for the plurality of edges; and identifying data points from the corpus of data that represent conflicts within the grouped labels; transmitting an electronic message for presenting the grouped data points to entities for further classification; and generating a new label set based upon the grouped labels and further classification received from the entities.
|
9. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising: retrieving, from a data storage circuit, multiple label sets that contain labels that each classify data points in a corpus of data; generating a graph that includes a plurality of edges, each edge between two respective labels from different label sets of the multiple label sets; determining weights for the plurality of edges based upon a consistency between the data points classified by two labels connected by the edges; applying an algorithm that creates grouped labels from the multiple label sets and based upon the weights for the plurality of edges; and identifying data points from the corpus of data that represent conflicts within the grouped labels; transmitting an electronic message for presenting the grouped data points to entities for further classification; and generating a new label set based upon the grouped labels and further classification received from the entities. 10. The computer program product of claim 9 , wherein the method further comprises training a machine learning algorithm using the new label set and the corpus of data.
| 0.52 |
9,177,558 | 3 | 4 |
3. The method of claim 2 , wherein a confidence level is associated with each word in the word hypotheses identifying a likelihood that a word in a word hypothesis was correctly recognized in generating the word hypotheses.
|
3. The method of claim 2 , wherein a confidence level is associated with each word in the word hypotheses identifying a likelihood that a word in a word hypothesis was correctly recognized in generating the word hypotheses. 4. The method of claim 3 , wherein words having corresponding word hypotheses that do not meet a confidence threshold are not considered in calculating the assessment score.
| 0.5 |
10,019,708 | 1 | 25 |
1. A system for facilitating transactions comprising: a computing system, having a processor and a memory, for executing programmable instructions that implement a data store, the data store including processing information associated with one or more transaction phrase tokens, wherein the one or more transaction phrase tokens are associated with transaction accounts via the processing information, and wherein at least one transaction phrase token of the one or more transaction phrase tokens consists of an unambiguous set of characters selected in its entirety by a transaction phrase token holder; and a computing system, having a processor and a memory, for executing programmable instructions that implement a transaction phrase token processing service, the transaction phrase token processing service processing a request from a requestor to complete a transaction related to a good or service, wherein the request includes a representation of a selected transaction phrase token provided verbally or in writing by a transaction phrase token holder to the requestor, wherein the transaction phrase token processing service accesses the processing information associated with the selected transaction phrase token, wherein the processing information associated with the selected transaction phrase token: identifies a transaction account associated with the selected transaction phrase token based on a transaction account identifier distinct from the selected transaction phrase token, and comprises one or more rules for processing transactions related to goods or services, and wherein the transaction phrase token processing service: identifies a rule from the one or more rules included in the processing information, wherein the identified rule is associated with the good or service related to the request; processes the request using the identified rule; sends an approval request to the transaction phrase token holder regarding the processed request; receives a response to the approval request from the transaction phrase token holder; updates the identified rule based at least in part on the response to the approval request that is received from the transaction phrase token holder; and automatically accepts or rejects a subsequent request to complete a transaction based at least in part on the update of the identified rule.
|
1. A system for facilitating transactions comprising: a computing system, having a processor and a memory, for executing programmable instructions that implement a data store, the data store including processing information associated with one or more transaction phrase tokens, wherein the one or more transaction phrase tokens are associated with transaction accounts via the processing information, and wherein at least one transaction phrase token of the one or more transaction phrase tokens consists of an unambiguous set of characters selected in its entirety by a transaction phrase token holder; and a computing system, having a processor and a memory, for executing programmable instructions that implement a transaction phrase token processing service, the transaction phrase token processing service processing a request from a requestor to complete a transaction related to a good or service, wherein the request includes a representation of a selected transaction phrase token provided verbally or in writing by a transaction phrase token holder to the requestor, wherein the transaction phrase token processing service accesses the processing information associated with the selected transaction phrase token, wherein the processing information associated with the selected transaction phrase token: identifies a transaction account associated with the selected transaction phrase token based on a transaction account identifier distinct from the selected transaction phrase token, and comprises one or more rules for processing transactions related to goods or services, and wherein the transaction phrase token processing service: identifies a rule from the one or more rules included in the processing information, wherein the identified rule is associated with the good or service related to the request; processes the request using the identified rule; sends an approval request to the transaction phrase token holder regarding the processed request; receives a response to the approval request from the transaction phrase token holder; updates the identified rule based at least in part on the response to the approval request that is received from the transaction phrase token holder; and automatically accepts or rejects a subsequent request to complete a transaction based at least in part on the update of the identified rule. 25. The system as recited in claim 1 , wherein the processing information associated with the selected transaction phrase token includes a specification of at least one of an acceptable transaction amount, an acceptable vendor, an acceptable transmitting party, a qualification level for a transaction, an expiration date, an acceptable agreed upon element, an unacceptable transaction amount, an unacceptable vendor, an unacceptable agreed upon element, and a required reputation score.
| 0.5 |
7,747,427 | 14 | 15 |
14. The method according to claim 4 , wherein step (e) comprises the steps of: (e1) transforming a structure of an input document in the source language into a sentence structure of the target language using the syntax and sentence translation pattern constructed in step (c); (e2) selecting an optimal translated word for each source word according to the source language document using a simplex and compound noun dictionary, and performing term-by-term transformation; and (e3) producing a transformation data structure based on the structure and term transformation results.
|
14. The method according to claim 4 , wherein step (e) comprises the steps of: (e1) transforming a structure of an input document in the source language into a sentence structure of the target language using the syntax and sentence translation pattern constructed in step (c); (e2) selecting an optimal translated word for each source word according to the source language document using a simplex and compound noun dictionary, and performing term-by-term transformation; and (e3) producing a transformation data structure based on the structure and term transformation results. 15. The method according to claim 14 , wherein the structural transformation in step (e1) is performed in sentences, clauses and phrases.
| 0.5 |
10,034,053 | 11 | 13 |
11. The computer system of claim 9 , further comprising instructions for: receiving a second request from the user device to share the generated poll with a circle of friends of the user; and in response to the second request, sharing the generated poll with the circle of friends of the user.
|
11. The computer system of claim 9 , further comprising instructions for: receiving a second request from the user device to share the generated poll with a circle of friends of the user; and in response to the second request, sharing the generated poll with the circle of friends of the user. 13. The computer system of claim 11 , further comprising instructions for: receiving one or more responses to the poll from the circle of friends of the user; and verifying the identified one or more popular moments based on the received one or more responses to the poll.
| 0.546667 |
8,954,500 | 1 | 10 |
1. A computer-implemented method for identifying social relationships for a first user operating in a first network controlled by a first entity, comprising: ascertaining an identity of the first user with reference to a first data source associated with the first network and under control of the first entity, and at least one external data source outside of the first network and not under control of the first entity, wherein the at least one external data source are within one or more other networks, wherein each external data source employs a permissioning model for controlling access to information associated with the external data source; accessing the information associated with the at least one external data source according to the corresponding permissioning model, thereby aggregating the permissioning models associated with the external data sources; identifying a plurality of contacts having a relationship with the first user with reference to the first data source, the at least one external data source, and the identity of the first user, a first subset of the contacts not being identifiable from the first data source; aggregating vitality events from inside multiple social networks for particular ones of the plurality of contacts, the multiple social networks including the first network and the one or more other networks, wherein aggregating vitality events includes aggregating the vitality events from inside the first network and inside the one or more other networks for the particular ones of the plurality of contacts, wherein the first user is a member of the first network and the one or more other networks, thereby aggregating the vitality events for the particular ones of the plurality of contacts across the multiple social networks; wherein the vitality events indicate the nature and/or content of online activities inside the first network and the one or more other networks for the particular ones of the plurality of contacts.
|
1. A computer-implemented method for identifying social relationships for a first user operating in a first network controlled by a first entity, comprising: ascertaining an identity of the first user with reference to a first data source associated with the first network and under control of the first entity, and at least one external data source outside of the first network and not under control of the first entity, wherein the at least one external data source are within one or more other networks, wherein each external data source employs a permissioning model for controlling access to information associated with the external data source; accessing the information associated with the at least one external data source according to the corresponding permissioning model, thereby aggregating the permissioning models associated with the external data sources; identifying a plurality of contacts having a relationship with the first user with reference to the first data source, the at least one external data source, and the identity of the first user, a first subset of the contacts not being identifiable from the first data source; aggregating vitality events from inside multiple social networks for particular ones of the plurality of contacts, the multiple social networks including the first network and the one or more other networks, wherein aggregating vitality events includes aggregating the vitality events from inside the first network and inside the one or more other networks for the particular ones of the plurality of contacts, wherein the first user is a member of the first network and the one or more other networks, thereby aggregating the vitality events for the particular ones of the plurality of contacts across the multiple social networks; wherein the vitality events indicate the nature and/or content of online activities inside the first network and the one or more other networks for the particular ones of the plurality of contacts. 10. The method of claim 1 further comprising: determining that two or more of the plurality of the contacts correspond to one person; wherein aggregating vitality events from inside multiple social networks for particular ones of the plurality of contacts includes aggregating the vitality events from inside the first network and inside the one or more other networks for the one person, thereby aggregating the vitality events for the one person across the multiple social networks.
| 0.654286 |
8,504,380 | 26 | 27 |
26. A system to develop a clinical trial protocol, the system comprising: a memory device comprising a historical database, the historical database storing a plurality of individual tasks from multiple clinical trial protocols associated with past protocol dates, each individual task of said plurality of individual tasks being categorized for a particular clinical indication and particular trial phase; and a protocol design tool operatively connected to said historical database, said protocol design tool configured to: receive a request to query said historical database, said request including user-specified filtering criteria having a clinical indication, trial phase and past time window; retrieve a subset of individual tasks from said plurality of individual tasks based on said filtering criteria, at least a first individual task in said subset from a first clinical trial protocol and a second individual task in said subset from a second clinical trial protocol, said past protocol dates of said first clinical trial protocol and said second clinical trial protocol being within said past time window, each of the individual tasks included in said subset being associated with a numerical association strength criterion that indicates at least a predetermined strength of association of each of the individual tasks in said subset to other clinical trial protocols for the clinical indication and trial phase; receive a selection of at least one individual task from said subset; and instantiate, in a structured protocol modeling database, at least one object identifying said at least one individual task.
|
26. A system to develop a clinical trial protocol, the system comprising: a memory device comprising a historical database, the historical database storing a plurality of individual tasks from multiple clinical trial protocols associated with past protocol dates, each individual task of said plurality of individual tasks being categorized for a particular clinical indication and particular trial phase; and a protocol design tool operatively connected to said historical database, said protocol design tool configured to: receive a request to query said historical database, said request including user-specified filtering criteria having a clinical indication, trial phase and past time window; retrieve a subset of individual tasks from said plurality of individual tasks based on said filtering criteria, at least a first individual task in said subset from a first clinical trial protocol and a second individual task in said subset from a second clinical trial protocol, said past protocol dates of said first clinical trial protocol and said second clinical trial protocol being within said past time window, each of the individual tasks included in said subset being associated with a numerical association strength criterion that indicates at least a predetermined strength of association of each of the individual tasks in said subset to other clinical trial protocols for the clinical indication and trial phase; receive a selection of at least one individual task from said subset; and instantiate, in a structured protocol modeling database, at least one object identifying said at least one individual task. 27. A system according to claim 26 , wherein the protocol design tool is further configured to exclude from said subset individual tasks whose association with the previous clinical trial protocols fail a particular association strength criterion.
| 0.652113 |
7,983,921 | 1 | 2 |
1. An information processing apparatus comprising: at least one processor programmed to control: an analysis unit configured to analyze the suitability of input speech for speech recognition; a speech recognition unit configured to perform the speech recognition to the input speech; a display control unit configured to display a result of the speech recognition on a display unit; an acceptance unit configured to accept a user's operation for canceling the display of the result of the speech recognition; and an output unit configured to output a guidance message relating to the input speech based upon result of analysis by said analysis unit if the user's operation is accepted by said acceptance unit.
|
1. An information processing apparatus comprising: at least one processor programmed to control: an analysis unit configured to analyze the suitability of input speech for speech recognition; a speech recognition unit configured to perform the speech recognition to the input speech; a display control unit configured to display a result of the speech recognition on a display unit; an acceptance unit configured to accept a user's operation for canceling the display of the result of the speech recognition; and an output unit configured to output a guidance message relating to the input speech based upon result of analysis by said analysis unit if the user's operation is accepted by said acceptance unit. 2. The apparatus according to claim 1 , further comprising a storage unit configured to store, according to a category of the suitability, a frequency at which the user's operation has been accepted; wherein said output unit outputs the guidance message if the frequency exceeds a predetermined value.
| 0.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.