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
|
|---|---|---|---|---|---|
7,743,103 | 14 | 15 | 14. The system according to claim 1 , wherein the journalising means includes: a notification scheduler, and the electronic mail manager database. | 14. The system according to claim 1 , wherein the journalising means includes: a notification scheduler, and the electronic mail manager database. 15. The system according to claim 14 , wherein the notification scheduler includes means for updating the journalising means, said updating means include a predefined journalisable acceptance criterion. | 0.5 |
7,953,720 | 27 | 31 | 27. A non-transitory computer readable storage medium storing one or more programs for execution by one or more processors of a computer system, the one or more programs comprising instructions for: receiving a factual query; searching a fact repository to identify a set of possible factual answers to the factual query, wherein the fact repository stores factual information extracted from a plurality of documents; determining respective scores for at least a subset of the set of possible factual answers; identifying a first answer of the subset of possible factual answers, the first answer having a best score; identifying, as an answer that is contradictory to the first answer, a second answer of the subset, wherein the second answer is the best scoring answer that is contradictory to the first answer; and generating a response including the first answer only if the score of the first answer exceeds a predefined threshold and exceeds the score of the second answer by at least a first predefined margin. | 27. A non-transitory computer readable storage medium storing one or more programs for execution by one or more processors of a computer system, the one or more programs comprising instructions for: receiving a factual query; searching a fact repository to identify a set of possible factual answers to the factual query, wherein the fact repository stores factual information extracted from a plurality of documents; determining respective scores for at least a subset of the set of possible factual answers; identifying a first answer of the subset of possible factual answers, the first answer having a best score; identifying, as an answer that is contradictory to the first answer, a second answer of the subset, wherein the second answer is the best scoring answer that is contradictory to the first answer; and generating a response including the first answer only if the score of the first answer exceeds a predefined threshold and exceeds the score of the second answer by at least a first predefined margin. 31. The computer readable storage medium of claim 27 , wherein the instructions for identifying, as an answer that is contradictory to the first answer, a second answer of the subset include instructions for identifying, as an answer that is contradictory to the first answer, the second answer of the subset in accordance with a result of a pair-wise field comparison of the first answer and the second answer. | 0.63172 |
9,656,158 | 12 | 13 | 12. The method of claim 7 , further comprising: if there are multiple quiz participants, determining an identity of the person answering the quiz question. | 12. The method of claim 7 , further comprising: if there are multiple quiz participants, determining an identity of the person answering the quiz question. 13. The method of claim 12 , wherein determining the identity of the person answering the quiz question is performed by speech recognition. | 0.79003 |
9,864,918 | 1 | 5 | 1. A system comprising: a camera system configured to capture an image of a proximal vehicle; a boundary component configured to identify a sub-portion of the image corresponding to an area where a driver of the proximal vehicle is located, wherein the boundary component identifies the sub-portion by identifying one or more windows of the proximal vehicle; a body language component configured to detect a driver's body language by processing data within the sub-portion of the image; and a prediction component configured to predict future motion of the proximal vehicle based on the driver's body language detected by the body language component; wherein the prediction component is configured to access a database or model that correlates the driver's body language detected by the body language component with one or more future vehicle movements; wherein the database or model correlates a gesture with a current driving context, wherein the driving context comprises a stop at an intersection, an approach to an intersection, merging onto a roadway, exiting a roadway, entering a parking lot or parking spot, or exiting a parking lot or parking spot. | 1. A system comprising: a camera system configured to capture an image of a proximal vehicle; a boundary component configured to identify a sub-portion of the image corresponding to an area where a driver of the proximal vehicle is located, wherein the boundary component identifies the sub-portion by identifying one or more windows of the proximal vehicle; a body language component configured to detect a driver's body language by processing data within the sub-portion of the image; and a prediction component configured to predict future motion of the proximal vehicle based on the driver's body language detected by the body language component; wherein the prediction component is configured to access a database or model that correlates the driver's body language detected by the body language component with one or more future vehicle movements; wherein the database or model correlates a gesture with a current driving context, wherein the driving context comprises a stop at an intersection, an approach to an intersection, merging onto a roadway, exiting a roadway, entering a parking lot or parking spot, or exiting a parking lot or parking spot. 5. The system of claim 1 , wherein the database or model correlates one or more of the following with the one or more future vehicle movements: a waving motion of a hand; a hand gesture comprising a palm facing toward a parent vehicle with fingers upward; a gaze direction of the driver for a threshold period of time; a series of head movements; and a series of quick changes in gaze direction. | 0.5 |
8,631,071 | 10 | 14 | 10. A computer system comprising: one or more processors, one or more computer-readable memories and one or more computer-readable, tangible storage devices; program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to semantically search for available computing resources for a plurality of businesses conducting commerce in different industries, the available computing resources being searched using an industry model repository (IMR) architecture system comprising: (a) a first layer of abstraction comprising business specific model assets, (b) a second layer of abstraction comprising a plurality of topic maps, each of the topic maps comprising a set of topics of capturing characteristics and relationships among the business specific model assets and other topics, associations having a specific association type and association role played by a designated topic, and occurrences defining business specific instances of the business specific model assets, each of the occurrences having an occurrence type that links to a specific one of the topics and an occurrence locator indicating an accessible network location in a federated asset repository where a corresponding specific instance is stored; and (c) a third layer of abstraction comprising service oriented architecture (“SOA”) program services that utilize the topic maps of the second layer to semantically search for the business specific model assets, wherein one or more of the services of the third layer of abstraction and linkages between the topic maps of the second layer of abstraction change over time as indicated by different versions of the industry model repository (IMR) of the second layer, wherein the searching step searches the computing resources based on linkages specific to a particular one of the different versions of the industry model repository (IMR), wherein a plurality of different versions are concurrently active at runtime and are used by different ones of the plurality of different businesses to access the business specific model assets of the first layer using the SOA program services of the third layer; a first computing device executing a first SOA service available for the searching and use at a first time when a first version of the different versions of the industry model repository (IMR) is available to the first computing device and a second SOA available for the searching and use at a second, later time using a second version of the industry model repository but not available for the searching and use at the first time; a second computing device executing the second SOA service at approximately the first time when the first version of the industry model repository is available to the second computing device, the second computing device executing the second SOA service at approximately the second time; and at least one computing device of the industry model repository (IMR) enabling the first computing device to execute the first SOA service at the first time, enabling the first computing device to execute the second SOA at the second time, enabling the second computing device to execute the second SOA service at approximately the first and at approximately the second time, thereby permitting concurrent use of different versions of the industry model repository (IMR) by different devices without modification or redeployment of the industry model repository (IMR). | 10. A computer system comprising: one or more processors, one or more computer-readable memories and one or more computer-readable, tangible storage devices; program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to semantically search for available computing resources for a plurality of businesses conducting commerce in different industries, the available computing resources being searched using an industry model repository (IMR) architecture system comprising: (a) a first layer of abstraction comprising business specific model assets, (b) a second layer of abstraction comprising a plurality of topic maps, each of the topic maps comprising a set of topics of capturing characteristics and relationships among the business specific model assets and other topics, associations having a specific association type and association role played by a designated topic, and occurrences defining business specific instances of the business specific model assets, each of the occurrences having an occurrence type that links to a specific one of the topics and an occurrence locator indicating an accessible network location in a federated asset repository where a corresponding specific instance is stored; and (c) a third layer of abstraction comprising service oriented architecture (“SOA”) program services that utilize the topic maps of the second layer to semantically search for the business specific model assets, wherein one or more of the services of the third layer of abstraction and linkages between the topic maps of the second layer of abstraction change over time as indicated by different versions of the industry model repository (IMR) of the second layer, wherein the searching step searches the computing resources based on linkages specific to a particular one of the different versions of the industry model repository (IMR), wherein a plurality of different versions are concurrently active at runtime and are used by different ones of the plurality of different businesses to access the business specific model assets of the first layer using the SOA program services of the third layer; a first computing device executing a first SOA service available for the searching and use at a first time when a first version of the different versions of the industry model repository (IMR) is available to the first computing device and a second SOA available for the searching and use at a second, later time using a second version of the industry model repository but not available for the searching and use at the first time; a second computing device executing the second SOA service at approximately the first time when the first version of the industry model repository is available to the second computing device, the second computing device executing the second SOA service at approximately the second time; and at least one computing device of the industry model repository (IMR) enabling the first computing device to execute the first SOA service at the first time, enabling the first computing device to execute the second SOA at the second time, enabling the second computing device to execute the second SOA service at approximately the first and at approximately the second time, thereby permitting concurrent use of different versions of the industry model repository (IMR) by different devices without modification or redeployment of the industry model repository (IMR). 14. The computer system of claim 10 , further comprising: program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to determine from stored differences between the first version and the second version of the industry model repository that parameters differ between a first business specific asset and a corresponding business specific asset, said corresponding business specific asset being updated for the second version of the industry model repository, said first business specific asset being for the first version of the industry model repository; program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to, at the second layer of abstraction, receive a message from the third of second layer requesting the first business specific asset of the first layer, said message having parameters compliant with the first business specific asset and not for the corresponding business specific asset, at runtime, programs executing at the second layer of abstraction dynamically modifying the message to be compatible with the corresponding business specific asset using the stored differences; and program instructions, stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, to utilize the modified message to access the corresponding business specific asset. | 0.511131 |
8,346,701 | 18 | 19 | 18. One or more processor-readable storage mediums storing processor-readable program code implemented at least in part by one or more processors for executing acts comprising: providing a community question-answer (CQA) application for presenting a CQA website implemented at a first CQA server; obtaining a plurality of positive first question-answer (q-a) pairs, each positive first q-a pair containing a first question and a first answer previously identified as a high-quality answer, and a plurality of negative first q-a pairs, each negative first q-a pair containing a first question and a first answer that is not a high-quality answer; storing the plurality of positive and negative first q-a pairs in a knowledge base on a memory at the first CQA server; creating a link prediction model from the plurality of positive and negative first q-a pairs; receiving a second question from a first computer in communication with the first CQA server; receiving a plurality of candidate second answers from one or more second computers in communication with the first CQA server in response to the second question; identifying a set of the first questions that are similar to the second question by considering only the first questions that are part of the positive first q-a pairs; determining first linking features between the identified set of first questions and the corresponding first answers making up each first q-a pair in the identified set; identifying a plurality of candidate second q-a pairs, each comprising the second question and one of the candidate second answers; determining second linking features between the second question and each of the candidate second answers for each candidate second q-a pair; using the link prediction model in combination with the first linking features for determining a likelihood of the second linking features of each candidate second q-a pair being analogous to the first linking features; obtaining a score for each candidate second q-a pair based upon the determined likelihood; ranking the candidate second q-a pairs according to the scores; and selecting the candidate second q-a pair having a score indicating a highest probability of analogy to the first linking features as containing a best answer. | 18. One or more processor-readable storage mediums storing processor-readable program code implemented at least in part by one or more processors for executing acts comprising: providing a community question-answer (CQA) application for presenting a CQA website implemented at a first CQA server; obtaining a plurality of positive first question-answer (q-a) pairs, each positive first q-a pair containing a first question and a first answer previously identified as a high-quality answer, and a plurality of negative first q-a pairs, each negative first q-a pair containing a first question and a first answer that is not a high-quality answer; storing the plurality of positive and negative first q-a pairs in a knowledge base on a memory at the first CQA server; creating a link prediction model from the plurality of positive and negative first q-a pairs; receiving a second question from a first computer in communication with the first CQA server; receiving a plurality of candidate second answers from one or more second computers in communication with the first CQA server in response to the second question; identifying a set of the first questions that are similar to the second question by considering only the first questions that are part of the positive first q-a pairs; determining first linking features between the identified set of first questions and the corresponding first answers making up each first q-a pair in the identified set; identifying a plurality of candidate second q-a pairs, each comprising the second question and one of the candidate second answers; determining second linking features between the second question and each of the candidate second answers for each candidate second q-a pair; using the link prediction model in combination with the first linking features for determining a likelihood of the second linking features of each candidate second q-a pair being analogous to the first linking features; obtaining a score for each candidate second q-a pair based upon the determined likelihood; ranking the candidate second q-a pairs according to the scores; and selecting the candidate second q-a pair having a score indicating a highest probability of analogy to the first linking features as containing a best answer. 19. The one or more processor-accessible storage mediums according to claim 18 , further comprising: marking the selected second candidate answer determined to be the best answer and presenting the selected second candidate answer as the best answer to users of the CQA website in conjunction with the second question. | 0.582677 |
8,099,445 | 1 | 3 | 1. A computer-implemented method comprising: receiving a package containing multiple files; receiving a request to open a file of the multiple files, the file having a file type, where the file type identifies a distinct data format of data in files of the file type; launching a default application for opening files of the file type; running the default application to identify a plurality of applications in the computing environment that are capable of opening files of the file type, each application in the plurality of applications being associated with the file type based on the file type and file association data; using the default application to select an application from the plurality of identified applications, the selection of the application being based at least in part on context information; and launching the selected application to open the file where the action to open the file is dependent on the file type. | 1. A computer-implemented method comprising: receiving a package containing multiple files; receiving a request to open a file of the multiple files, the file having a file type, where the file type identifies a distinct data format of data in files of the file type; launching a default application for opening files of the file type; running the default application to identify a plurality of applications in the computing environment that are capable of opening files of the file type, each application in the plurality of applications being associated with the file type based on the file type and file association data; using the default application to select an application from the plurality of identified applications, the selection of the application being based at least in part on context information; and launching the selected application to open the file where the action to open the file is dependent on the file type. 3. The method of claim 1 , where the package is generated using an archiving application. | 0.906118 |
9,449,028 | 8 | 17 | 8. A computer-implemented method to access a definitive image, the method comprising: storing, in an image data store, one or more images or references to images stored in other data stores; receiving a request during a query for the definitive image that is representative of a topic of the query; maintaining an inverted index of images that maps one or more query terms to one or more images that are related to the one or more query terms; ranking one or more images identified in the inverted index that potentially match the query terms to sort the identified one or more images by a relative likelihood of being the definitive image for the topic of the query; selecting the definitive image based on one or more images returned from the inverted index, any overridden editor-chosen definitive image, and the ranking, wherein the editor-chosen definitive image is identified by manually overriding a system selected definitive image from a human editor; retrieving an image binary associated with the selected definitive image based on an image identifier associated with the selected definitive image; and sending the retrieved image binary associated with the selected definitive image in response to the received request; wherein the preceding steps are performed by at least one processor. | 8. A computer-implemented method to access a definitive image, the method comprising: storing, in an image data store, one or more images or references to images stored in other data stores; receiving a request during a query for the definitive image that is representative of a topic of the query; maintaining an inverted index of images that maps one or more query terms to one or more images that are related to the one or more query terms; ranking one or more images identified in the inverted index that potentially match the query terms to sort the identified one or more images by a relative likelihood of being the definitive image for the topic of the query; selecting the definitive image based on one or more images returned from the inverted index, any overridden editor-chosen definitive image, and the ranking, wherein the editor-chosen definitive image is identified by manually overriding a system selected definitive image from a human editor; retrieving an image binary associated with the selected definitive image based on an image identifier associated with the selected definitive image; and sending the retrieved image binary associated with the selected definitive image in response to the received request; wherein the preceding steps are performed by at least one processor. 17. The method of claim 8 wherein retrieving the image binary comprises providing image quality level information so that the image data store can return a matching stored version of the selected definitive image. | 0.572289 |
7,747,633 | 3 | 4 | 3. The computer-implemented method of claim 1 , further comprising incrementally reparsing a portion of the hierarchical tree based at least in part on the modification to the XML data string. | 3. The computer-implemented method of claim 1 , further comprising incrementally reparsing a portion of the hierarchical tree based at least in part on the modification to the XML data string. 4. The computer-implemented method of claim 3 , wherein the incremental reparsing comprises producing a tree substantially similar to a tree produced by a full reparsing of the modified XML data string. | 0.5 |
8,489,768 | 6 | 7 | 6. A method of personally selecting limitations on received data from an Application Programming Interface (API) website by inputting an identified URLv into a web exchange's individual's consolidated entity, the method comprising of: providing a plurality of URLvs each containing a first second-top domain name and a known identity of an individual; providing a web individuals' exchange with individual's consolidated entities that can exchange data with said exchange's other individual's consolidated entities wherein each said individual's consolidated entity has a URLv input access; providing an API website wherein API access can transmit said API website's data; providing a database containing said URLvs wherein each has its associated scripts for API access and for limiting received API data; providing Internet-connected processors and applications to generate and host said web individuals' exchange, said API website, said URLvs' webpages, and said database containing URLvs; inputting a said URLv into an individual's consolidated entity's URLv access; activating said database's said inputted URLv's associated API access script; receiving said API access's returned data; activating said database's said inputted URLv's associated script for limiting said API access's returned data; inputting said limited data into said individual's consolidated entity; whereby, an individual user can selectively input personal data originating from an API website into an individual's consolidated entity through use of a user-understandable URLv input instead of complex-programming API coding. | 6. A method of personally selecting limitations on received data from an Application Programming Interface (API) website by inputting an identified URLv into a web exchange's individual's consolidated entity, the method comprising of: providing a plurality of URLvs each containing a first second-top domain name and a known identity of an individual; providing a web individuals' exchange with individual's consolidated entities that can exchange data with said exchange's other individual's consolidated entities wherein each said individual's consolidated entity has a URLv input access; providing an API website wherein API access can transmit said API website's data; providing a database containing said URLvs wherein each has its associated scripts for API access and for limiting received API data; providing Internet-connected processors and applications to generate and host said web individuals' exchange, said API website, said URLvs' webpages, and said database containing URLvs; inputting a said URLv into an individual's consolidated entity's URLv access; activating said database's said inputted URLv's associated API access script; receiving said API access's returned data; activating said database's said inputted URLv's associated script for limiting said API access's returned data; inputting said limited data into said individual's consolidated entity; whereby, an individual user can selectively input personal data originating from an API website into an individual's consolidated entity through use of a user-understandable URLv input instead of complex-programming API coding. 7. The method of claim 6 , further comprising: inputting a second said URLv into said individual's consolidated entity's URLv access; deriving identities of said first and second inputted URLvs; confirming said identities are same; activating said database's said second-inputted URLv's associated API access script; receiving said second-inputted URLv's API's returned data; activating said database's said second-inputted URLv's associated script for limiting said second-inputted URLv's API's returned data; inputting said limited returned data of said second-inputted URLv into said individual's consolidated entity; whereby, a user can selectively input different URLvs of same identity in order to add differing portions of an API website's data into an individual's consolidated entity in a web exchange and wherein the web exchange can confirm these inputted URLvs belong to same identity. | 0.5 |
5,465,304 | 17 | 18 | 17. An apparatus for segmenting portions of a medium representation into text and non-text types, said apparatus comprising: a memory for storing said medium representation, said medium representation including a plurality of scanlines, said plurality of scanlines being organized into a plurality of groups of scanlines; a processor, being coupled to said memory, said processor for compressing said plurality of groups into a plurality of compressed scanlines, said processor for generating a plurality of run lengths by extracting a run length from each compressed scanline in said plurality of compressed scanlines, said processor for generating a plurality of run length classifications by generating a run length classification for each run length in said plurality of run lengths according to a length of each run length, said processor for constructing a set of rectangles from said plurality of run lengths and said plurality of run length classifications, said processor for assigning a classification to each rectangle of said set of rectangles as non-text type or unknown type using said run length classifications associated with each rectangle, and said processor for generating a plurality of text blocks from a set of rectangles of said set of rectangles having an unknown type and for storing said plurality of text blocks in said memory. | 17. An apparatus for segmenting portions of a medium representation into text and non-text types, said apparatus comprising: a memory for storing said medium representation, said medium representation including a plurality of scanlines, said plurality of scanlines being organized into a plurality of groups of scanlines; a processor, being coupled to said memory, said processor for compressing said plurality of groups into a plurality of compressed scanlines, said processor for generating a plurality of run lengths by extracting a run length from each compressed scanline in said plurality of compressed scanlines, said processor for generating a plurality of run length classifications by generating a run length classification for each run length in said plurality of run lengths according to a length of each run length, said processor for constructing a set of rectangles from said plurality of run lengths and said plurality of run length classifications, said processor for assigning a classification to each rectangle of said set of rectangles as non-text type or unknown type using said run length classifications associated with each rectangle, and said processor for generating a plurality of text blocks from a set of rectangles of said set of rectangles having an unknown type and for storing said plurality of text blocks in said memory. 18. The apparatus of claim 17 wherein said processor is further for providing an ordering of said plurality of text blocks. | 0.633929 |
8,712,868 | 1 | 10 | 1. A method comprising: selecting a user to receive one or more recommended listings hosted by a network-based commerce system; determining a term-category pair that pairs a term with a category of listings in which the term matches at least a predetermined number of listings and with which the selected user has interacted in an interaction; generating a user-specific query that corresponds to the selected user and that includes the term from the term-category pair, the generating of the user-specific query being performed by a processor of a machine; identifying a recommended listing from among a plurality of listings hosted by the network-based commerce system, the identifying of the recommended listing being based on the generated user-specific query and including identifying a set of listings within the plurality of listings, the set of listings being identified between an upper popularity boundary of the term-category pair and a lower popularity boundary of the term-category pair; and providing the recommended listing to a client machine of the selected user. | 1. A method comprising: selecting a user to receive one or more recommended listings hosted by a network-based commerce system; determining a term-category pair that pairs a term with a category of listings in which the term matches at least a predetermined number of listings and with which the selected user has interacted in an interaction; generating a user-specific query that corresponds to the selected user and that includes the term from the term-category pair, the generating of the user-specific query being performed by a processor of a machine; identifying a recommended listing from among a plurality of listings hosted by the network-based commerce system, the identifying of the recommended listing being based on the generated user-specific query and including identifying a set of listings within the plurality of listings, the set of listings being identified between an upper popularity boundary of the term-category pair and a lower popularity boundary of the term-category pair; and providing the recommended listing to a client machine of the selected user. 10. The method of claim 1 , wherein: the term from the term-category pair includes a plurality of words. | 0.842424 |
8,396,710 | 5 | 6 | 5. The method of claim 1 , wherein initiating the connection with the remote system comprises scanning speech input issued by a user at a local device. | 5. The method of claim 1 , wherein initiating the connection with the remote system comprises scanning speech input issued by a user at a local device. 6. The method of claim 5 , wherein transmitting the stored portion of the speech input to the remote system comprises transmitting the stored portion of the speech input from the local device to the remote system. | 0.5 |
8,230,354 | 8 | 10 | 8. The system as claimed in claim 7 , wherein said selection specific branding files comprise a plurality of enterprise specific branding files and a plurality of language specific branding files, and said selection criteria further includes an enterprise attribute and a language attribute. | 8. The system as claimed in claim 7 , wherein said selection specific branding files comprise a plurality of enterprise specific branding files and a plurality of language specific branding files, and said selection criteria further includes an enterprise attribute and a language attribute. 10. The system as claimed in claim 8 , wherein said enterprise specific branding files comprise one or more versions or one or more copies for each of said enterprise specific branding files, and said component for configuring is configured to retrieve a latest version of said enterprise specific branding file in the absence of said enterprise attribute. | 0.5 |
8,910,251 | 16 | 24 | 16. A computer implemented method comprising: maintaining user profiles for a plurality of users of a social networking system; maintaining a plurality of connections between the users of the social networking system; receiving a request from a requestor for generating a challenge question based on information related to a user of the social networking system, wherein the requestor receives a request for access from the user; selecting, for forming a challenge question, another user of the social networking system from a plurality of other users connected to the user via the social networking system, the selection based on a rate of on interactions between the user and the other user; obtaining information from a user profile of the other user; determining whether the request is received from a suspicious source; determining difficulty level of the challenge question based on whether the source is suspicious; forming the challenge question according to the determined difficulty level, by a processor, wherein an answer to the challenge question comprises information obtained from the user profile of the other user; and sending the challenge question to the requestor wherein the requestor allows a requested access to the user responsive to receiving a correct answer to the challenge question. | 16. A computer implemented method comprising: maintaining user profiles for a plurality of users of a social networking system; maintaining a plurality of connections between the users of the social networking system; receiving a request from a requestor for generating a challenge question based on information related to a user of the social networking system, wherein the requestor receives a request for access from the user; selecting, for forming a challenge question, another user of the social networking system from a plurality of other users connected to the user via the social networking system, the selection based on a rate of on interactions between the user and the other user; obtaining information from a user profile of the other user; determining whether the request is received from a suspicious source; determining difficulty level of the challenge question based on whether the source is suspicious; forming the challenge question according to the determined difficulty level, by a processor, wherein an answer to the challenge question comprises information obtained from the user profile of the other user; and sending the challenge question to the requestor wherein the requestor allows a requested access to the user responsive to receiving a correct answer to the challenge question. 24. The method of claim 16 , wherein the selection of the other user for forming a challenge question is based on a time of interaction between the user and the other user. | 0.580488 |
9,240,180 | 14 | 17 | 14. A system comprising: a processor; a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: receiving, from a client, text associated with a request for text-to-speech synthesis; performing, via a processor of a computing device, an analysis of the text to identify a plurality of intonational phrases in the text, wherein a size of the text being analyzed is based on a network latency; generating, via the processor, a first file containing text-to-speech data for a first intonational phrase of the plurality of intonational phrases using a first text-to-speech voice, wherein the first text-to-speech voice is selected based on user preferences, and wherein the first intonational phrase is indexed by a first unique identifier; generating, via the processor, a second file containing the text-to-speech data for a second intonational phrase of the plurality of intonational phrases using a second text-to-speech voice, wherein the second text-to-speech voice is selected based on the user preferences, and wherein the second intonational phrase is indexed by a second unique identifier; storing the first file and the second file in a cache on a web-server; transmitting the first file to the client in response to the request; and while the client plays the first file, generating additional files containing additional text-to-speech data for remaining intonational phrases of the plurality of intonational phrases, wherein the remaining intonational phrases comprise the second intonational phrase, and wherein each of the additional files is indexed by the first unique identifier plus a respective offset. | 14. A system comprising: a processor; a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: receiving, from a client, text associated with a request for text-to-speech synthesis; performing, via a processor of a computing device, an analysis of the text to identify a plurality of intonational phrases in the text, wherein a size of the text being analyzed is based on a network latency; generating, via the processor, a first file containing text-to-speech data for a first intonational phrase of the plurality of intonational phrases using a first text-to-speech voice, wherein the first text-to-speech voice is selected based on user preferences, and wherein the first intonational phrase is indexed by a first unique identifier; generating, via the processor, a second file containing the text-to-speech data for a second intonational phrase of the plurality of intonational phrases using a second text-to-speech voice, wherein the second text-to-speech voice is selected based on the user preferences, and wherein the second intonational phrase is indexed by a second unique identifier; storing the first file and the second file in a cache on a web-server; transmitting the first file to the client in response to the request; and while the client plays the first file, generating additional files containing additional text-to-speech data for remaining intonational phrases of the plurality of intonational phrases, wherein the remaining intonational phrases comprise the second intonational phrase, and wherein each of the additional files is indexed by the first unique identifier plus a respective offset. 17. The system of claim 14 , wherein the computer-readable storage medium has additional instructions stored which, when executed by the processor, result in operations comprising: receiving user input navigating to a different position within the text; identifying a new offset for the different position; and fetching a corresponding file from the server for playback based on the unique identifier and the new offset. | 0.5 |
9,368,108 | 4 | 5 | 4. A speech recognition method, comprising: acquiring a text file and extracting a command word from the text file according to a predetermined rule, to obtain a command word list; comparing the command word list with a command word library, to confirm whether the command word list comprises a new command word, wherein the new command word is a command word that is comprised in the command word list but not comprised in the command word library; if the command word list comprises the new command word, generating a corresponding new pronunciation dictionary according to the new command word and performing training to obtain a new language model; merging the new language model into a language model library corresponding to the command word library; receiving speech and performing speech recognition on the speech according to an acoustic model, a phonation dictionary, and the merged language model library; determining whether the text file changes; and if the text file changes, acquiring a changed text file. | 4. A speech recognition method, comprising: acquiring a text file and extracting a command word from the text file according to a predetermined rule, to obtain a command word list; comparing the command word list with a command word library, to confirm whether the command word list comprises a new command word, wherein the new command word is a command word that is comprised in the command word list but not comprised in the command word library; if the command word list comprises the new command word, generating a corresponding new pronunciation dictionary according to the new command word and performing training to obtain a new language model; merging the new language model into a language model library corresponding to the command word library; receiving speech and performing speech recognition on the speech according to an acoustic model, a phonation dictionary, and the merged language model library; determining whether the text file changes; and if the text file changes, acquiring a changed text file. 5. The method according to claim 4 , wherein acquiring a text file comprises: acquiring the text file from a specified address. | 0.83377 |
9,092,535 | 6 | 7 | 6. The method of claim 3 , wherein the object interacts with the body of text on the display. | 6. The method of claim 3 , wherein the object interacts with the body of text on the display. 7. The method of claim 6 , wherein the object moves from word to word in the body of text on the display. | 0.5 |
7,533,107 | 1 | 12 | 1. A method for integrating a plurality of data sources comprising the steps of: obtaining semantic information from each of the plurality of data sources; creating a conceptual model for each of the plurality of data sources using said semantic information; accessing a secondary knowledge source having information that relates the different data sources; creating an integrated semantic model of the plurality of data sources using said conceptual models and said secondary knowledge source; wherein said semantic information comprises characterization of at least one of constraints that hold for subsets of data in the plurality of data sources and relationships that hold between the data; wherein said semantic information further comprises information expressing properties of the data that have not been explicitly encoded in an alphanumeric representation of the data or in a syntactic structure that holds together different data elements. | 1. A method for integrating a plurality of data sources comprising the steps of: obtaining semantic information from each of the plurality of data sources; creating a conceptual model for each of the plurality of data sources using said semantic information; accessing a secondary knowledge source having information that relates the different data sources; creating an integrated semantic model of the plurality of data sources using said conceptual models and said secondary knowledge source; wherein said semantic information comprises characterization of at least one of constraints that hold for subsets of data in the plurality of data sources and relationships that hold between the data; wherein said semantic information further comprises information expressing properties of the data that have not been explicitly encoded in an alphanumeric representation of the data or in a syntactic structure that holds together different data elements. 12. A method as in claim 1 wherein each of the conceptual models from each of the plurality of data sources have at least a class, said semantic information comprises as least a class schema, and wherein said integrated semantic model comprises logic statements that define one of at least an instance, subclass, or method relation between at least a first class from one of the plurality of data sources and a second class from a second of the plurality of data sources. | 0.5 |
9,798,722 | 1 | 2 | 1. A method, comprising: establishing, by a processor, a communication, wherein the communication includes an audio communication from a first communication device; receiving, by the processor, an audio stream from the first communication device, wherein the audio stream comprises speech of a plurality of users of the first communication device; translating, by the processor, speech from the audio stream from the first communication device into a plurality of text streams, wherein the plurality of text streams are in different languages, and wherein each of the plurality of text streams in the different languages are directly translated from the audio stream from the first communication device; filtering, by the processor, a specific translated word, in a specific language, from a specific user of the plurality of users, in a specific one of the plurality of text steams based on a user definable list; and transmitting, by the processor, the plurality of text streams to at least one communication device involved in the communication. | 1. A method, comprising: establishing, by a processor, a communication, wherein the communication includes an audio communication from a first communication device; receiving, by the processor, an audio stream from the first communication device, wherein the audio stream comprises speech of a plurality of users of the first communication device; translating, by the processor, speech from the audio stream from the first communication device into a plurality of text streams, wherein the plurality of text streams are in different languages, and wherein each of the plurality of text streams in the different languages are directly translated from the audio stream from the first communication device; filtering, by the processor, a specific translated word, in a specific language, from a specific user of the plurality of users, in a specific one of the plurality of text steams based on a user definable list; and transmitting, by the processor, the plurality of text streams to at least one communication device involved in the communication. 2. The method of claim 1 , wherein each of the plurality of text streams are transmitted individually as a plurality of separate packets, wherein each of the plurality of separate packets contains a corresponding language identifier field. | 0.695153 |
9,449,052 | 2 | 3 | 2. The method of claim 1 , wherein identifying the first content distribution campaign and the second content distribution campaign comprises identifying at least one content distribution campaign in which a broad match distribution parameter differs from one or more of the search queries that match the broad match distribution parameter. | 2. The method of claim 1 , wherein identifying the first content distribution campaign and the second content distribution campaign comprises identifying at least one content distribution campaign in which a broad match distribution parameter differs from one or more of the search queries that match the broad match distribution parameter. 3. The method of claim 2 , wherein providing suggestion data suggesting the particular distribution parameter comprises providing suggestion data suggesting at least one of the one or more search queries that match the broad match distribution parameter as an additional distribution parameter for the second content distribution campaign. | 0.5 |
7,827,133 | 16 | 17 | 16. The computer-implemented method of claim 15 wherein said applying including converting said received document to said set of received document feature vectors. | 16. The computer-implemented method of claim 15 wherein said applying including converting said received document to said set of received document feature vectors. 17. The computer-implemented method of claim 16 wherein said converting said received document to said set of received document feature vectors employs a TF-IDF (Term Frequency-Inverse Document Frequency) technique. | 0.5 |
8,463,053 | 1 | 8 | 1. A method for multimodal data mining, comprising: defining a multimodal data set comprising image information; representing image information of a data object as a set of feature vectors in a feature space representing a plurality of constraints for each training example, wherein the feature vectors comprise a joint feature representation associated with Lagrange multipliers, the feature vectors being partitioned into a dual variable set comprising two partitions and having non-image representations associated with the respective image data object; clustering in the feature space to group similar features; associating a non-image representation with a respective data object based on the clustering; determining a joint feature representation of a respective data object as a mathematical weighted combination of a set of components of the joint feature representation; optimizing a weighting for a plurality of components of the mathematical weighted combination with respect to a prediction error between a predicted classification and a training classification by iteratively solving a Lagrange dual problem, with an automated data processor, by partitioning the Lagrange multipliers into an active set and an inactive set, wherein the Lagrange multiplier for a member of the active set is greater than or equal to zero and the Lagrange multiplier for a member of the inactive set is zero, the iteratively solving comprising moving members of the active set having zero-valued Lagrange multipliers to the inactive set without changing an objective function, and moving members of the inactive set to the active set which result in a decrease in the objective function; and employing the mathematical weighted combination for automatically classifying a new data object, wherein: the set of feature vectors in the feature space represents a plurality of constraints for each training example, the feature vectors comprise joint feature representation defined by Φ, having a Lagrange multiplier μ i, y for each constraint to form the Lagrangian, wherein i and j denote different elements of a respective set, y i is an annotation and a member of the set Y, x i and x j are each annotations and members of the set X, superscript T denotes a transpose matrix, n is the number of elements in the respective set, y represents a prediction of y i from the set Y i , {tilde over (y)} is an operator of y, α=Σ i, y μ i, y Φ i,y i , y , l( y ,y i ) is a loss function defined as the number of the different entries in vectors y and y i , Φ i,yi, y =Φ i (y i )−Φ i ( y ), and a kernel function K((x i , y ),(x j ,{tilde over (y)}))=<Φ i,yi, y , Φ j,yj, y >, the feature vectors being partitioned into a dual variable set μ comprising two partitions, μ B and μ N and non-image representations S associated with the respective image data object, the dual variable set μ having i examples such that μ=[μ 1 T . . . μ n T ] T and S=[S 1 T . . . S n T ] T , wherein the lengths of μ and S are the same, and A i is defined as a vector which has the same length as that of μ, where A i , y =1 and A j , y =0 for j≠i, such that A=[A 1 . . . A n ] T , matrix D represents a kernel matrix where each entry is K((x i , y ), (x j ,{tilde over (y)})), and C represents a vector where each entry is a constant C; the feature vectors comprise a dual variable set μ comprising labeled examples which is decomposed into two partitions, μ B and μ N ; and said optimizing comprises iteratively solving for each member of the set: min 1 2 μ T D μ - μ T S ; and s . t . A μ ⪯ C μ B ≽ 0 , μ N = 0 while there exist μ i, y ∈μ B such that μ i, y =0, moving that variable to partition μ N ; while there exists μ i, y ∈μ N satisfying the condition
∃ i, Σ y μ i, y <C
∃μ i, y ∈μ N , α T Φ i,y i , y −l ( y ,y i )<0, moving that variable to partition μ B ; and if no such μ i, y ∈μ N exists, ceasing an iteration. | 1. A method for multimodal data mining, comprising: defining a multimodal data set comprising image information; representing image information of a data object as a set of feature vectors in a feature space representing a plurality of constraints for each training example, wherein the feature vectors comprise a joint feature representation associated with Lagrange multipliers, the feature vectors being partitioned into a dual variable set comprising two partitions and having non-image representations associated with the respective image data object; clustering in the feature space to group similar features; associating a non-image representation with a respective data object based on the clustering; determining a joint feature representation of a respective data object as a mathematical weighted combination of a set of components of the joint feature representation; optimizing a weighting for a plurality of components of the mathematical weighted combination with respect to a prediction error between a predicted classification and a training classification by iteratively solving a Lagrange dual problem, with an automated data processor, by partitioning the Lagrange multipliers into an active set and an inactive set, wherein the Lagrange multiplier for a member of the active set is greater than or equal to zero and the Lagrange multiplier for a member of the inactive set is zero, the iteratively solving comprising moving members of the active set having zero-valued Lagrange multipliers to the inactive set without changing an objective function, and moving members of the inactive set to the active set which result in a decrease in the objective function; and employing the mathematical weighted combination for automatically classifying a new data object, wherein: the set of feature vectors in the feature space represents a plurality of constraints for each training example, the feature vectors comprise joint feature representation defined by Φ, having a Lagrange multiplier μ i, y for each constraint to form the Lagrangian, wherein i and j denote different elements of a respective set, y i is an annotation and a member of the set Y, x i and x j are each annotations and members of the set X, superscript T denotes a transpose matrix, n is the number of elements in the respective set, y represents a prediction of y i from the set Y i , {tilde over (y)} is an operator of y, α=Σ i, y μ i, y Φ i,y i , y , l( y ,y i ) is a loss function defined as the number of the different entries in vectors y and y i , Φ i,yi, y =Φ i (y i )−Φ i ( y ), and a kernel function K((x i , y ),(x j ,{tilde over (y)}))=<Φ i,yi, y , Φ j,yj, y >, the feature vectors being partitioned into a dual variable set μ comprising two partitions, μ B and μ N and non-image representations S associated with the respective image data object, the dual variable set μ having i examples such that μ=[μ 1 T . . . μ n T ] T and S=[S 1 T . . . S n T ] T , wherein the lengths of μ and S are the same, and A i is defined as a vector which has the same length as that of μ, where A i , y =1 and A j , y =0 for j≠i, such that A=[A 1 . . . A n ] T , matrix D represents a kernel matrix where each entry is K((x i , y ), (x j ,{tilde over (y)})), and C represents a vector where each entry is a constant C; the feature vectors comprise a dual variable set μ comprising labeled examples which is decomposed into two partitions, μ B and μ N ; and said optimizing comprises iteratively solving for each member of the set: min 1 2 μ T D μ - μ T S ; and s . t . A μ ⪯ C μ B ≽ 0 , μ N = 0 while there exist μ i, y ∈μ B such that μ i, y =0, moving that variable to partition μ N ; while there exists μ i, y ∈μ N satisfying the condition
∃ i, Σ y μ i, y <C
∃μ i, y ∈μ N , α T Φ i,y i , y −l ( y ,y i )<0, moving that variable to partition μ B ; and if no such μ i, y ∈μ N exists, ceasing an iteration. 8. The method according to claim 1 , further comprising using the partitions to inference between two different examples in the set μ. | 0.77592 |
8,903,835 | 8 | 10 | 8. An information presentation method, comprising: acquiring, through a first acquisition unit, situation data indicating situation and environmental information to which an information device is exposed; acquiring object information corresponding to the situation data through a second acquisition unit; searching by a search unit a database for related words related to the object information; weighting the related words, through the search unit, in accordance with a degree of adaptability by referring to a situation adaptability table having a degree of adaptability between the related words and the situation data; multiplying the degree of adaptability by values in a behavior adaptability table relating to specific actions, to adjust weights of the related words; displaying the related words in order of weights that have been adjusted, through a first display unit, in such a manner that any one of the related words can be selected; determining, through a determining unit, whether any one of the related words is selected; and displaying, through a second display unit, the object information related to the any one of the related words determined by the determining unit to have been selected. | 8. An information presentation method, comprising: acquiring, through a first acquisition unit, situation data indicating situation and environmental information to which an information device is exposed; acquiring object information corresponding to the situation data through a second acquisition unit; searching by a search unit a database for related words related to the object information; weighting the related words, through the search unit, in accordance with a degree of adaptability by referring to a situation adaptability table having a degree of adaptability between the related words and the situation data; multiplying the degree of adaptability by values in a behavior adaptability table relating to specific actions, to adjust weights of the related words; displaying the related words in order of weights that have been adjusted, through a first display unit, in such a manner that any one of the related words can be selected; determining, through a determining unit, whether any one of the related words is selected; and displaying, through a second display unit, the object information related to the any one of the related words determined by the determining unit to have been selected. 10. The method according to claim 8 , further comprising: inputting selected one of a character and a character string through an input unit; generating, through a generating unit, a plurality of related words analogous in reading to the selected one of the character and the character string, respectively, by referring to a synonym dictionary which stores a plurality of synonyms of the related words; and displaying the related words analogous in reading to the selected one of the character and the character string on the first display unit. | 0.5 |
8,856,691 | 8 | 17 | 8. A method for altering visualized parameters for a gesture filter of an application, the gesture filter being designed to recognize whether to recognize a user of the application has performed a particular gesture from data comprising information about position or movement of the user, the method comprising: receiving data captured by a capture device, the data comprising information about user position or movement; displaying a visual output of the application; displaying a visual representation of at least one aspect of the user data, the visual representation comprising a list comprising the gesture filter; displaying a skeletal map associated with the user data; in response to user selection of a gesture filter from the list, displaying an indication of at least one body part involved in the performance of the gesture that the gesture filter is designed to recognize; in response to the system processing the data with the gesture filter and the adjustable parameter, displaying a representation indicating whether the position or movement represented by the data would be recognized by the gesture filter as the performance of the gesture that the gesture filter is designed to recognize; receiving, via a user interface of the display, a change to a parameter of the gesture filter of the application; altering the gesture filter corresponding to the received change; and displaying a representation of whether processing the data with the gesture filter and the changed parameter causes the system to determine that the position or movement represented by the data would be recognized by the gesture filter as the performance of the gesture that the gesture filter is designed to recognize. | 8. A method for altering visualized parameters for a gesture filter of an application, the gesture filter being designed to recognize whether to recognize a user of the application has performed a particular gesture from data comprising information about position or movement of the user, the method comprising: receiving data captured by a capture device, the data comprising information about user position or movement; displaying a visual output of the application; displaying a visual representation of at least one aspect of the user data, the visual representation comprising a list comprising the gesture filter; displaying a skeletal map associated with the user data; in response to user selection of a gesture filter from the list, displaying an indication of at least one body part involved in the performance of the gesture that the gesture filter is designed to recognize; in response to the system processing the data with the gesture filter and the adjustable parameter, displaying a representation indicating whether the position or movement represented by the data would be recognized by the gesture filter as the performance of the gesture that the gesture filter is designed to recognize; receiving, via a user interface of the display, a change to a parameter of the gesture filter of the application; altering the gesture filter corresponding to the received change; and displaying a representation of whether processing the data with the gesture filter and the changed parameter causes the system to determine that the position or movement represented by the data would be recognized by the gesture filter as the performance of the gesture that the gesture filter is designed to recognize. 17. The method of claim 8 , wherein the visual representation comprises a value, a range of values, or a bound of the parameter. | 0.835897 |
9,715,488 | 2 | 3 | 2. The apparatus of claim 1 , wherein the instructions further cause the processor to propagate the at least one knowledge value at least by iteratively applying 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. | 2. The apparatus of claim 1 , wherein the instructions further cause the processor to propagate the at least one knowledge value at least by iteratively applying 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. 3. The apparatus of claim 2 , wherein the one or more knowledge reasoners comprises at least one of an evidential support reasoner, a relevance reasoner, or a co-reference knowledge reasoner. | 0.676271 |
8,679,015 | 1 | 6 | 1. An interactive television system configured to allow monitoring of at least one individual, the interactive television system comprising: a communication interface for establishing a communication link between the interactive television system and a server remotely situated from the interactive television system through at least one communication medium; a display for presenting (i) one or more queries and one or more predefined response choices corresponding to the one or more queries provided by a script program received from said server, wherein said script program includes (a) general information, (b) information specific to said individual, and (c) a message corresponding to said individual from a health care professional associated with said individual and (ii) entertainment or advertisement content received from the server through the at least one communication medium, wherein said one or more queries, said one or more predefined response choices, and said message from said script program are displayed along with said entertainment or advertisement content received from said server; a user interface for receiving responses to the one or more queries selected from said one or more predefined response choices by the at least one individual; a processing unit connected to the communication interface, the display and the user interface, wherein the processing unit comprises a non-transitory computer readable medium initialized with a unique identification code for the at least one individual by the healthcare professional prior to the at least one individual receiving the processor unit and the processor unit is configured to execute the script program to (i) present the one or more queries and the one or more predefined response choices on the display, (ii) receive the responses from the user interface, and (iii) transmit the responses to the server through the at least one communication medium, wherein said processor unit is further configured to send said unique identification code for the at least one individual to said server in order to receive said script program and said script program includes a program identifier received from said server by said processing unit and said program identifier (a) is transmitted back to said server with said responses and (b) causes said server to associate said responses with said script program sent by said server to said processing unit; and a device interface connected to the processing unit and configured for receiving measurements from at least one glucose monitoring device, wherein the at least one monitoring device is adapted for producing measurements of a blood glucose level of the at least one individual. | 1. An interactive television system configured to allow monitoring of at least one individual, the interactive television system comprising: a communication interface for establishing a communication link between the interactive television system and a server remotely situated from the interactive television system through at least one communication medium; a display for presenting (i) one or more queries and one or more predefined response choices corresponding to the one or more queries provided by a script program received from said server, wherein said script program includes (a) general information, (b) information specific to said individual, and (c) a message corresponding to said individual from a health care professional associated with said individual and (ii) entertainment or advertisement content received from the server through the at least one communication medium, wherein said one or more queries, said one or more predefined response choices, and said message from said script program are displayed along with said entertainment or advertisement content received from said server; a user interface for receiving responses to the one or more queries selected from said one or more predefined response choices by the at least one individual; a processing unit connected to the communication interface, the display and the user interface, wherein the processing unit comprises a non-transitory computer readable medium initialized with a unique identification code for the at least one individual by the healthcare professional prior to the at least one individual receiving the processor unit and the processor unit is configured to execute the script program to (i) present the one or more queries and the one or more predefined response choices on the display, (ii) receive the responses from the user interface, and (iii) transmit the responses to the server through the at least one communication medium, wherein said processor unit is further configured to send said unique identification code for the at least one individual to said server in order to receive said script program and said script program includes a program identifier received from said server by said processing unit and said program identifier (a) is transmitted back to said server with said responses and (b) causes said server to associate said responses with said script program sent by said server to said processing unit; and a device interface connected to the processing unit and configured for receiving measurements from at least one glucose monitoring device, wherein the at least one monitoring device is adapted for producing measurements of a blood glucose level of the at least one individual. 6. The interactive television system according to claim 1 , wherein said device interface is adapted for transmitting the measurements to the processing unit, and wherein the script program further includes a collect command to cause collection of the measurements from the at least one monitoring device, the processing unit comprises a memory configured to store the measurements and the communication interface is further configured to transmit the measurements to the server for storage in one or more databases. | 0.5 |
9,690,773 | 13 | 14 | 13. The system of claim 12 , wherein in altering the task entry by adding the additional value to the task entry, one or more of the processors are to: replace the given value with the additional value in the task entry. | 13. The system of claim 12 , wherein in altering the task entry by adding the additional value to the task entry, one or more of the processors are to: replace the given value with the additional value in the task entry. 14. The system of claim 13 , wherein in replacing the given value with the additional value one or more of the processors are to: determine that the given value is stored in association with a particular information field of the task entry; and replace the given value with the additional value based on determining that the additional value is associated with the particular information field with which the given value is stored in association. | 0.5 |
9,864,750 | 1 | 5 | 1. A method for generating a native file from an image, comprising: identifying a non-text object within the image and a formatting attribute of the non-text object; determining a tag for the non-text object by comparing the non-text object with a plurality of templates comprising a plurality of tags, wherein the tag corresponds to a matching template, and wherein the tag specifies a type of the non-text object and the formatting attribute of the non-text object in a format of the native file; generating metadata comprising composition information comprising the type and the formatting attribute of the non-text object, wherein at least part of the composition information is text data that is searchable by a native application for the native file to identify the non-text object within the native file; and generating the native file as an electronic document comprising: a markup comprising the tag specifying the type and the formatting attribute of the non-text object; and the metadata. | 1. A method for generating a native file from an image, comprising: identifying a non-text object within the image and a formatting attribute of the non-text object; determining a tag for the non-text object by comparing the non-text object with a plurality of templates comprising a plurality of tags, wherein the tag corresponds to a matching template, and wherein the tag specifies a type of the non-text object and the formatting attribute of the non-text object in a format of the native file; generating metadata comprising composition information comprising the type and the formatting attribute of the non-text object, wherein at least part of the composition information is text data that is searchable by a native application for the native file to identify the non-text object within the native file; and generating the native file as an electronic document comprising: a markup comprising the tag specifying the type and the formatting attribute of the non-text object; and the metadata. 5. The method of claim 1 , further comprising: receiving, from a user, the format for the native file, wherein determining the tag is based in part on the format. | 0.5 |
7,779,342 | 11 | 18 | 11. A processing device for finding documents which relate to a portion of a temporal document, comprising: (a) means for initiating a signal of interest at any time during the temporal document; (b) means for capturing content between the time the content is present in the temporal document and the time of initiating the signal of interest; and (c) means for finding the related documents based upon the content captured between the time the content is presented in the temporal document and the time of initiating the signal of interest by use of information retrieval techniques, including related documents not previously associated with the content captured; and (d) means for selecting the related documents from among a collection of documents which may be accessed through the Internet, by utilizing databases comprising information about the collection; wherein the related documents are accessed through the Internet; and wherein the related documents are selected from the collection according to the scores achieved when evaluating documents in the collection according to a formula giving scores to documents depending upon the occurrence in the documents of terms which occur in the content captured. | 11. A processing device for finding documents which relate to a portion of a temporal document, comprising: (a) means for initiating a signal of interest at any time during the temporal document; (b) means for capturing content between the time the content is present in the temporal document and the time of initiating the signal of interest; and (c) means for finding the related documents based upon the content captured between the time the content is presented in the temporal document and the time of initiating the signal of interest by use of information retrieval techniques, including related documents not previously associated with the content captured; and (d) means for selecting the related documents from among a collection of documents which may be accessed through the Internet, by utilizing databases comprising information about the collection; wherein the related documents are accessed through the Internet; and wherein the related documents are selected from the collection according to the scores achieved when evaluating documents in the collection according to a formula giving scores to documents depending upon the occurrence in the documents of terms which occur in the content captured. 18. The device of claim 11 , wherein the determination of the documents in the collection which receive the highest scores is carried out by a server which is distinct from the server which receives the signal of interest. | 0.5 |
8,392,441 | 13 | 15 | 13. A non-transitory computer-readable storage device storing instructions that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising: receiving a query submitted by a user to a search engine, wherein the query includes a first compound term; and in response to receiving the query, performing the following operations: generating one or more splits of the first compound term, wherein each split divides the compound term into two or more subterms, wherein at least one subterm is a term in a dictionary that associates terms with scores derived from a respective frequency of use of the subterm; assigning a score to one or more subterms of each split that are in the dictionary, wherein the score for a subterm is the score stored in the dictionary for the subterm; determining an overall score for each split from the scores for the subterms of the split; selecting a first split from the one or more splits according to the overall score for each split; and augmenting the query with a first synonym phrase, wherein the first synonym phrase is a synonym of a first subterm of the first split. | 13. A non-transitory computer-readable storage device storing instructions that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising: receiving a query submitted by a user to a search engine, wherein the query includes a first compound term; and in response to receiving the query, performing the following operations: generating one or more splits of the first compound term, wherein each split divides the compound term into two or more subterms, wherein at least one subterm is a term in a dictionary that associates terms with scores derived from a respective frequency of use of the subterm; assigning a score to one or more subterms of each split that are in the dictionary, wherein the score for a subterm is the score stored in the dictionary for the subterm; determining an overall score for each split from the scores for the subterms of the split; selecting a first split from the one or more splits according to the overall score for each split; and augmenting the query with a first synonym phrase, wherein the first synonym phrase is a synonym of a first subterm of the first split. 15. The non-transitory computer-readable storage device of claim 13 , wherein generating one or more splits of the first compound term comprises incrementally analyzing prefixes of increasing length of the first compound term to identify subterms of the prefixes that appear in the dictionary. | 0.5 |
9,185,125 | 52 | 56 | 52. The non-transitory computer-readable medium of claim 47 , wherein the one or more instructions, when executed by the processor, further cause the processor to: receive one or more representations of acceptable network traffic; and train each of one or more of the plurality of scoring algorithms to score target operations or events using the one or more representations of acceptable network traffic. | 52. The non-transitory computer-readable medium of claim 47 , wherein the one or more instructions, when executed by the processor, further cause the processor to: receive one or more representations of acceptable network traffic; and train each of one or more of the plurality of scoring algorithms to score target operations or events using the one or more representations of acceptable network traffic. 56. The non-transitory computer-readable medium of claim 52 , wherein training the one or more scoring algorithms comprises, for each of the one or more scoring algorithms, generating a model, for scoring operations or events, using the one or more representations of acceptable network traffic. | 0.81745 |
8,380,700 | 1 | 4 | 1. A method comprising: receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; optimizing execution by the computing device of the operation on the ad hoc geospatial directory; and the computing device returning to the user interface a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, modifying a state of at least a first of the entities, or accessing the first of the entities, wherein the optimizing includes: receiving a plurality of requests for execution of respective operations of the geospatial application, joining the requests into at least one locally-executable request and at least one remotely-executable request, sending the remotely-executable request to a second computing device; receiving from the second computing device a remote result responsive to the remotely-executable request, executing the locally-executable request for generation of a local result, and generating the responses for the respective requests based on selective partitioning of the local result and the remote result. | 1. A method comprising: receiving from a user interface, by a computing device, a request for execution of at least one lambda function in an operation of a geospatial application, the geospatial application having lambda functions for operating on one or more entities of an ad hoc geospatial directory accessible by the computing device, the lambda functions having strongly typed definitions according to a prescribed symbol manipulation language that is a non-Turing complete language, that does not permit partial functions, and that is independent of any attribute of any computing system; optimizing execution by the computing device of the operation on the ad hoc geospatial directory; and the computing device returning to the user interface a response to the request based on the optimizing execution of the operation, the response including a data structure including at least one of the lambda functions for a corresponding at least one of generating a query of the ad hoc geospatial directory, modifying a state of at least a first of the entities, or accessing the first of the entities, wherein the optimizing includes: receiving a plurality of requests for execution of respective operations of the geospatial application, joining the requests into at least one locally-executable request and at least one remotely-executable request, sending the remotely-executable request to a second computing device; receiving from the second computing device a remote result responsive to the remotely-executable request, executing the locally-executable request for generation of a local result, and generating the responses for the respective requests based on selective partitioning of the local result and the remote result. 4. The method of claim 1 , wherein the data structure in the response identifies at least one entity and includes accessor lambda functions for accessing the at least one entity via respective access protocols. | 0.876905 |
7,805,673 | 1 | 18 | 1. A method comprising: enabling a user to define a redaction of a part of a document in a corpus of documents, the redaction definition including a scope defining a range of documents in the corpus to which the redaction applies, wherein the document is produced as a bitmap image file in which a redacted region appears as a region of black pixel data; creating a temporary image file representing an unredacted version of the document; creating a temporary image file representing a redacted version of the document utilizing custom fonts in rendering which result in foreground and background colors of redaction regions being an inverse of the foreground and the background colors of fonts used for non-redaction regions; performing XOR operations between corresponding sections in the temporary image files of the unredacted and the redacted documents; and creating a mapping between a redacted token and pixel space bounds of the redacted token, thereby creating the region of black pixel data. | 1. A method comprising: enabling a user to define a redaction of a part of a document in a corpus of documents, the redaction definition including a scope defining a range of documents in the corpus to which the redaction applies, wherein the document is produced as a bitmap image file in which a redacted region appears as a region of black pixel data; creating a temporary image file representing an unredacted version of the document; creating a temporary image file representing a redacted version of the document utilizing custom fonts in rendering which result in foreground and background colors of redaction regions being an inverse of the foreground and the background colors of fonts used for non-redaction regions; performing XOR operations between corresponding sections in the temporary image files of the unredacted and the redacted documents; and creating a mapping between a redacted token and pixel space bounds of the redacted token, thereby creating the region of black pixel data. 18. The method of claim 1 , further comprising: identifying items having linked documents; and attempting to acquire and cache copies of embedded documents, to ensure that any referenced embedded documents can also be produced and redacted. | 0.630769 |
8,897,500 | 13 | 16 | 13. A computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform operations comprising: receiving a request to confirm a user identity; retrieving a user profile associated with the user identity; generating, based on the user profile and a level of security desired, a text challenge, wherein generating the text challenge is based on eliciting distinctive behavior of the speaker when compared to behavior of other users, the behavior of other users and the highly distinctive behavior of the speaker being stored in a database of dynamic image features; prompting the speaker to utter the text challenge; recording an audio recording and a video recording of the speaker as the speaker utters the text challenge; and performing an analysis of the audio recording and the video recording based on the user profile. | 13. A computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform operations comprising: receiving a request to confirm a user identity; retrieving a user profile associated with the user identity; generating, based on the user profile and a level of security desired, a text challenge, wherein generating the text challenge is based on eliciting distinctive behavior of the speaker when compared to behavior of other users, the behavior of other users and the highly distinctive behavior of the speaker being stored in a database of dynamic image features; prompting the speaker to utter the text challenge; recording an audio recording and a video recording of the speaker as the speaker utters the text challenge; and performing an analysis of the audio recording and the video recording based on the user profile. 16. The computer-readable storage device of claim 13 , further comprising: receiving from the user verification device an indication of desired user verification certainty; and setting the verification threshold based on the desired user verification certainty. | 0.5 |
9,772,981 | 22 | 28 | 22. The apparatus of claim 21 wherein the semantic unit is a word in a human language. | 22. The apparatus of claim 21 wherein the semantic unit is a word in a human language. 28. The apparatus of claim 22 wherein the processor ranks words in the index in terms of data reduction and assigns relatively shorter pointers to words having better potential data reduction ranking. | 0.5 |
9,288,275 | 1 | 21 | 1. An event-centric computer-implemented social networking platform, said social networking platform accessible to users via a computer network, said social networking platform comprising: a first repository configured to store at least user related information; a second repository configured to store the information corresponding to catalog offerings; a third repository configured to store at least event-related information corresponding to said users, information corresponding to resources uploaded onto a social networking platform by said users, information corresponding to access privileges and action permissions granted to respective users; an event planning module accessible to said users, said event planning module comprising: a receiving module configured to receive a request from a user towards organizing an event based on at least one of catalog offerings related activities/catalog offerings, said request including at least event related information; a first search module configured to search said second repository for catalog offerings related to said event related information, said first search module further configured to generate a list of catalog offerings related to event specified by a user based on user related information; a first selection module configured to enable selection of at least one catalog offering, from said list of catalog offerings; an updating module cooperating with said third repository, said updating module configured to update the event-related information stored in said third repository; a second search module cooperating with said first repository and third repository, said second search module configured to search friend list for users, based on a pre-defined criteria, said second search module configured to categorize users in search result into pre-determined invitee categories; an invitation module cooperating with said event planning module and configured to generate an invitee list for an event including user names selected from at least one of said pre-determined invitee categories and non-registered invitees, said invitation module configured to selectively transmit an invitation inviting users included in said invitee list to attend said event, said invitation module further configured to receive and track the responses of invited users; and a presentation module accessible to users, said presentation module configured to display a list of event invitations including past events and the events planned for future dates, said presentation manager configured to control users' access to said list of event invitations, said presentation manager configured to provide users with selective access to contents of a listed event invitation, said presentation manager further configured to enable said users to view the listed event invitation, edit the listed event invitation, comment on the listed event invitation and add photos/social media files on to the listed event invitation; a notification module configured to generate notifications corresponding to activities performed by said users on the social networking platform, said notification module further configured to transmit notifications to other users included in the friend list associated with said users. | 1. An event-centric computer-implemented social networking platform, said social networking platform accessible to users via a computer network, said social networking platform comprising: a first repository configured to store at least user related information; a second repository configured to store the information corresponding to catalog offerings; a third repository configured to store at least event-related information corresponding to said users, information corresponding to resources uploaded onto a social networking platform by said users, information corresponding to access privileges and action permissions granted to respective users; an event planning module accessible to said users, said event planning module comprising: a receiving module configured to receive a request from a user towards organizing an event based on at least one of catalog offerings related activities/catalog offerings, said request including at least event related information; a first search module configured to search said second repository for catalog offerings related to said event related information, said first search module further configured to generate a list of catalog offerings related to event specified by a user based on user related information; a first selection module configured to enable selection of at least one catalog offering, from said list of catalog offerings; an updating module cooperating with said third repository, said updating module configured to update the event-related information stored in said third repository; a second search module cooperating with said first repository and third repository, said second search module configured to search friend list for users, based on a pre-defined criteria, said second search module configured to categorize users in search result into pre-determined invitee categories; an invitation module cooperating with said event planning module and configured to generate an invitee list for an event including user names selected from at least one of said pre-determined invitee categories and non-registered invitees, said invitation module configured to selectively transmit an invitation inviting users included in said invitee list to attend said event, said invitation module further configured to receive and track the responses of invited users; and a presentation module accessible to users, said presentation module configured to display a list of event invitations including past events and the events planned for future dates, said presentation manager configured to control users' access to said list of event invitations, said presentation manager configured to provide users with selective access to contents of a listed event invitation, said presentation manager further configured to enable said users to view the listed event invitation, edit the listed event invitation, comment on the listed event invitation and add photos/social media files on to the listed event invitation; a notification module configured to generate notifications corresponding to activities performed by said users on the social networking platform, said notification module further configured to transmit notifications to other users included in the friend list associated with said users. 21. The social networking platform as claimed in claim 1 , wherein said invitation module is further configured to generate an open choice invitation with a limited number of choices provided to invitees regarding catalog offerings and related time/date schedules. | 0.856678 |
9,225,788 | 1 | 7 | 1. A method comprising: identifying, by a social networking system, a first content object with which a first user of the social networking system has interacted; identifying, by the social networking system, a second content object with which a second user of the social networking system has interacted; associating, by the social networking system, a first keyword phrase with the first user, wherein the first keyword phrase is associated with the first content object by conducting a reverse keyword search on the first content object, wherein the reverse keyword search includes searching a social network search pattern database containing information of social network relationships between content objects of the social network system and keyword phrases, and wherein the reverse keyword search receives the first content object or an identifier of the first content object as an input, and generates a keyword phrase that is related to the first content object as an output, and wherein the social network search pattern database is updated by results of a new reverse keyword search; associating, by the social networking system, a second keyword phrase with the second user, wherein the second keyword phrase is associated with the second content object by conducting a reverse keyword search of the second content object; and determining, by the social networking system, a common interest for the first user and the second user of the social networking system toward a topic by identifying a match between the first keyword phrase associated with the first user with the second keyword phrase associated with the second user. | 1. A method comprising: identifying, by a social networking system, a first content object with which a first user of the social networking system has interacted; identifying, by the social networking system, a second content object with which a second user of the social networking system has interacted; associating, by the social networking system, a first keyword phrase with the first user, wherein the first keyword phrase is associated with the first content object by conducting a reverse keyword search on the first content object, wherein the reverse keyword search includes searching a social network search pattern database containing information of social network relationships between content objects of the social network system and keyword phrases, and wherein the reverse keyword search receives the first content object or an identifier of the first content object as an input, and generates a keyword phrase that is related to the first content object as an output, and wherein the social network search pattern database is updated by results of a new reverse keyword search; associating, by the social networking system, a second keyword phrase with the second user, wherein the second keyword phrase is associated with the second content object by conducting a reverse keyword search of the second content object; and determining, by the social networking system, a common interest for the first user and the second user of the social networking system toward a topic by identifying a match between the first keyword phrase associated with the first user with the second keyword phrase associated with the second user. 7. The method of claim 1 , further comprising: notifying the first user that another user of the social networking system shares the mutual interest, wherein the other user plans to attend an event that the first user plans to attend. | 0.5 |
8,006,898 | 6 | 8 | 6. An apparatus for retracing a deposited counterfeit banknote, comprising: a control device configured to store characteristic data of deposited banknotes together with data of a depositor of said banknotes; a testing device in communication with said control device, the testing device being configured to recognize a banknote of said deposited banknotes as a counterfeit banknote and to determine and forward characteristic data of said counterfeit banknote to said control device; wherein said control device is configured to receive said characteristic data of a counterfeit banknote and to identify a depositor of the counterfeit banknote by comparing the stored characteristic data with the received characteristic data of the counterfeit banknote. | 6. An apparatus for retracing a deposited counterfeit banknote, comprising: a control device configured to store characteristic data of deposited banknotes together with data of a depositor of said banknotes; a testing device in communication with said control device, the testing device being configured to recognize a banknote of said deposited banknotes as a counterfeit banknote and to determine and forward characteristic data of said counterfeit banknote to said control device; wherein said control device is configured to receive said characteristic data of a counterfeit banknote and to identify a depositor of the counterfeit banknote by comparing the stored characteristic data with the received characteristic data of the counterfeit banknote. 8. The apparatus according to claim 6 , wherein the control device is a controller installed at a central provider of a commercial bank where the counterfeit banknote is deposited. | 0.5 |
8,545,538 | 1 | 2 | 1. A method of vertebral stabilization, comprising: affixing a first portion of a first bone fastener to a first vertebral bone; coupling a second portion of the first bone fastener to a first portion of an interconnecting member, the interconnecting member further comprising at least a second portion configured to be at least partially contained within a first housing; affixing a first portion of a bone fixation member to a second vertebral bone, the bone fixation member having a second portion configured to be at least partially contained within a second housing; seating the first housing and the second portion of the interconnecting member contained therein within a first socket of an outer housing member; seating the second housing and the second portion of the bone fixation member contained therein within a second socket of the outer housing member; and transitioning a locking member from a first to a second state, the second state immobilizing each of the first housing and the second housing relative to the outer housing; wherein each of the second portion of the interconnecting member and the second portion of the bone fixation member remain movable relative to the outer housing member when the locking feature is in both the first and the second state. | 1. A method of vertebral stabilization, comprising: affixing a first portion of a first bone fastener to a first vertebral bone; coupling a second portion of the first bone fastener to a first portion of an interconnecting member, the interconnecting member further comprising at least a second portion configured to be at least partially contained within a first housing; affixing a first portion of a bone fixation member to a second vertebral bone, the bone fixation member having a second portion configured to be at least partially contained within a second housing; seating the first housing and the second portion of the interconnecting member contained therein within a first socket of an outer housing member; seating the second housing and the second portion of the bone fixation member contained therein within a second socket of the outer housing member; and transitioning a locking member from a first to a second state, the second state immobilizing each of the first housing and the second housing relative to the outer housing; wherein each of the second portion of the interconnecting member and the second portion of the bone fixation member remain movable relative to the outer housing member when the locking feature is in both the first and the second state. 2. A method as in claim 1 , further comprising attaching the second vertebral bone to the interconnecting member in a manner configured to permit movement between the second vertebral bone and the interconnecting member. | 0.673591 |
8,117,223 | 23 | 28 | 23. A system comprising: a tangible computer readable medium storing instructions that when executed by one or more processors cause the system to: receive a user request to change a current top phrase for a limited document collection to a replacement top phrase; associate the replacement top phrase with a root document of the document collection; associate the current top phrase and the replacement top phrase with each other; add to phrase information for the replacement top phrase, phrase information for the current top phrase; and add to related phrase information of the replacement top phrase, related phrase information of the current top phrase and one or more processors configured for executing the instructions stored on the computer readable storage medium. | 23. A system comprising: a tangible computer readable medium storing instructions that when executed by one or more processors cause the system to: receive a user request to change a current top phrase for a limited document collection to a replacement top phrase; associate the replacement top phrase with a root document of the document collection; associate the current top phrase and the replacement top phrase with each other; add to phrase information for the replacement top phrase, phrase information for the current top phrase; and add to related phrase information of the replacement top phrase, related phrase information of the current top phrase and one or more processors configured for executing the instructions stored on the computer readable storage medium. 28. The system of claim 23 , wherein the tangible computer readable medium further stores instructions that when executed by one or more of the processors cause the system to deny the request to change the current top phrase to the curr ent top phrase, responsive to the current and replacement top phrases having no related phrases in common. | 0.732031 |
9,846,847 | 4 | 5 | 4. A computer-implemented system for creating entitlement rules and updating entitlements for controlling access to secured electronic resources of an organization, the system comprising: an organizational information system in communication with a plurality of organizational databases storing data associated with the organization; a plurality of entitlement engines associated with a plurality of corresponding domains, wherein each entitlement engine is associated with a corresponding application programmed to request access to at least one secured resource of the organization, and wherein each entitlement engine comprises: an integrator; an associated set of business entitlement rules; and an associated entitlement database that stores associated entitlement data; an entitlement generator container, accessible via an Internet portal, wherein the entitlement generator container comprises: a rule authoring module programmed to create an entitlement rule for any domain of the plurality of corresponding domains, wherein creating the entitlement rule comprises: defining a template rule, wherein the template rule specifies an action to be taken in response to an event; defining the entitlement rule, wherein the entitlement rule specifies entitlement data to be generated for the domain for which the entitlement rule is being created; and automatically generating an execution rule, wherein the execution rule comprises the template rule customized with at least one domain-specific element of the entitlement rule; and an entitlement generator in communication with the entitlement generator container, wherein the entitlement generator is programmed to: translate any execution rule generated by the entitlement generator container into executable code; and communicate the translated execution rule, to an entitlement engine that corresponds to the domain for which the execution rule was generated, as a new entitlement rule for incorporation with the associated set of business entitlement rules; wherein each integrator of each entitlement engine is programmed to: receive the data associated with the organization from the plurality of organizational databases; apply the data to any new entitlement rule communicated from the entitlement generator to generate updated entitlement data; and store the updated entitlement data in the associated entitlement database; and wherein each entitlement engine is programmed to: receive an entitlement request from the corresponding application to access the at least one secured resource of the organization; and determine whether a user using the corresponding application is entitled to access the at least one secured resource based on the associated entitlement data including any updated entitlement data. | 4. A computer-implemented system for creating entitlement rules and updating entitlements for controlling access to secured electronic resources of an organization, the system comprising: an organizational information system in communication with a plurality of organizational databases storing data associated with the organization; a plurality of entitlement engines associated with a plurality of corresponding domains, wherein each entitlement engine is associated with a corresponding application programmed to request access to at least one secured resource of the organization, and wherein each entitlement engine comprises: an integrator; an associated set of business entitlement rules; and an associated entitlement database that stores associated entitlement data; an entitlement generator container, accessible via an Internet portal, wherein the entitlement generator container comprises: a rule authoring module programmed to create an entitlement rule for any domain of the plurality of corresponding domains, wherein creating the entitlement rule comprises: defining a template rule, wherein the template rule specifies an action to be taken in response to an event; defining the entitlement rule, wherein the entitlement rule specifies entitlement data to be generated for the domain for which the entitlement rule is being created; and automatically generating an execution rule, wherein the execution rule comprises the template rule customized with at least one domain-specific element of the entitlement rule; and an entitlement generator in communication with the entitlement generator container, wherein the entitlement generator is programmed to: translate any execution rule generated by the entitlement generator container into executable code; and communicate the translated execution rule, to an entitlement engine that corresponds to the domain for which the execution rule was generated, as a new entitlement rule for incorporation with the associated set of business entitlement rules; wherein each integrator of each entitlement engine is programmed to: receive the data associated with the organization from the plurality of organizational databases; apply the data to any new entitlement rule communicated from the entitlement generator to generate updated entitlement data; and store the updated entitlement data in the associated entitlement database; and wherein each entitlement engine is programmed to: receive an entitlement request from the corresponding application to access the at least one secured resource of the organization; and determine whether a user using the corresponding application is entitled to access the at least one secured resource based on the associated entitlement data including any updated entitlement data. 5. The system of claim 4 , wherein creating the entitlement rule further comprises: displaying a rules creation screen; receiving a selection of at least one of a role construct having a role variable or a coverage construct having a coverage variable applicable to at least one of a team or an identity; receiving a selection of a value for the variable corresponding to the selected one of the role construct or the coverage construct; receiving a selection of an action construct having an action variable and a resource variable; and receiving a selection of a value for the action variable and a value for the resource variable for the action construct. | 0.5 |
8,762,358 | 1 | 2 | 1. A computer implemented method comprising: determining, using one or more data processing apparatus, an interface language associated with a user interface through which one or more query terms of a search query are received; identifying respective languages that are associated with search result selections for a plurality of previously submitted search queries, each of the previously submitted search queries matching the search query; determining, for each identified language and based on the respective languages that are associated with the search result selections, a respective likelihood that the search query is in the language; and selecting a likelihood for a language that matches the interface language as a likelihood that one or more of the query terms are in the interface language; determining, for each of the query terms, a vector corresponding to a set of likelihoods that the respective query term is in a plurality of languages; multiplying together the vectors corresponding to the sets of likelihoods that the query terms are in the plurality of languages to generate a resultant vector; multiplying the resultant vector by the likelihood that one or more of the query terms are in the determined interface language to generate a query probability vector; and selecting a query language of the query based at least on the query probability vector. | 1. A computer implemented method comprising: determining, using one or more data processing apparatus, an interface language associated with a user interface through which one or more query terms of a search query are received; identifying respective languages that are associated with search result selections for a plurality of previously submitted search queries, each of the previously submitted search queries matching the search query; determining, for each identified language and based on the respective languages that are associated with the search result selections, a respective likelihood that the search query is in the language; and selecting a likelihood for a language that matches the interface language as a likelihood that one or more of the query terms are in the interface language; determining, for each of the query terms, a vector corresponding to a set of likelihoods that the respective query term is in a plurality of languages; multiplying together the vectors corresponding to the sets of likelihoods that the query terms are in the plurality of languages to generate a resultant vector; multiplying the resultant vector by the likelihood that one or more of the query terms are in the determined interface language to generate a query probability vector; and selecting a query language of the query based at least on the query probability vector. 2. The method of claim 1 , further comprising: identifying, based on a language-specific mapping, a respective common form of the one or more query terms for one or more of the one or more query terms; identifying, for the one or more query terms, a respective synonym based on the respective common forms of the one or more query terms; and revising the search query based on the one or more identified synonyms. | 0.5 |
8,234,112 | 1 | 6 | 1. A method of generating a noise adaptive acoustic model, comprising: generating a baseline model parameter from large-capacity speech training data including an environment noise using a processor; and receiving the generated baseline model parameter and applying a discriminative adaptation method to generate a migrated acoustic model parameter, wherein the applying the discriminative adaptation method comprises: dividing the received baseline model parameter into a simplified phoneme like unit model parameter and a context-dependent model parameter; applying the divided simplified phoneme like unit model parameter to the predetermined environment adaptive speech data to perform viterbi decoding; and changing the simplified phoneme like unit model parameter and the context-dependent model parameter in response to the viterbi-decoded results. | 1. A method of generating a noise adaptive acoustic model, comprising: generating a baseline model parameter from large-capacity speech training data including an environment noise using a processor; and receiving the generated baseline model parameter and applying a discriminative adaptation method to generate a migrated acoustic model parameter, wherein the applying the discriminative adaptation method comprises: dividing the received baseline model parameter into a simplified phoneme like unit model parameter and a context-dependent model parameter; applying the divided simplified phoneme like unit model parameter to the predetermined environment adaptive speech data to perform viterbi decoding; and changing the simplified phoneme like unit model parameter and the context-dependent model parameter in response to the viterbi-decoded results. 6. The method of claim 1 , wherein the simplified phoneme like unit model parameter exists in an upper layer of the context-dependent model parameter. | 0.727273 |
8,812,300 | 1 | 3 | 1. A method for identifying related names, comprising: storing, using a processor of a computer, a collection of names from different languages, wherein each of the names has a native orthographic form and a romanized form; receiving an input name in a known encoding scheme; determining an alphabet of the input name based on the known encoding scheme; generating romanized names based on the input name and the determined alphabet using multiple transliteration schemas; identifying a culture associated with the input name; selecting one or more culture-sensitive regularization rules for the identified culture, wherein there are different culture-sensitive regularization rules for different cultures; applying the selected one or more culture-sensitive regularization rules to one of the romanized names to create an additional romanized name; matching the romanized names and the additional romanized name against the romanized names in the collection of names from the different languages; and returning data store records that have romanized names that match at least one of the romanized names and the additional romanized name. | 1. A method for identifying related names, comprising: storing, using a processor of a computer, a collection of names from different languages, wherein each of the names has a native orthographic form and a romanized form; receiving an input name in a known encoding scheme; determining an alphabet of the input name based on the known encoding scheme; generating romanized names based on the input name and the determined alphabet using multiple transliteration schemas; identifying a culture associated with the input name; selecting one or more culture-sensitive regularization rules for the identified culture, wherein there are different culture-sensitive regularization rules for different cultures; applying the selected one or more culture-sensitive regularization rules to one of the romanized names to create an additional romanized name; matching the romanized names and the additional romanized name against the romanized names in the collection of names from the different languages; and returning data store records that have romanized names that match at least one of the romanized names and the additional romanized name. 3. The method of claim 1 , wherein the culture-sensitive regularization rules are applied using a user-supplied cultural value. | 0.770758 |
8,380,733 | 1 | 8 | 1. A method comprising: detecting an original search input entered by a user on an electronic device; detecting an excluded term included within the original search input; deleting the excluded term from the original search input to create a modified search input without the excluded term; matching the modified search input without the excluded term with a plurality of stored terms as the original search input is entered by the user; in response to there being a match between the modified search input without the excluded term and one or more of the plurality of stored terms, dynamically displaying, by the electronic device, a suggestion of a search term to replace the original search input as the original search is entered by the user based on the match between the modified search input without the excluded term and one or more stored terms; and in response to there not being a match between the modified search input without the excluded term and one or more of the plurality of stored terms: adding the excluded term from the original search back to the modified search input; matching the modified search input with the excluded term to the plurality of stored terms to determine if there is a match; and dynamically displaying, by the electronic device, a suggestion of a search term to replace the original search input as the original search is entered by the user based on a match between the original search input and one or more of the plurality of stored terms. | 1. A method comprising: detecting an original search input entered by a user on an electronic device; detecting an excluded term included within the original search input; deleting the excluded term from the original search input to create a modified search input without the excluded term; matching the modified search input without the excluded term with a plurality of stored terms as the original search input is entered by the user; in response to there being a match between the modified search input without the excluded term and one or more of the plurality of stored terms, dynamically displaying, by the electronic device, a suggestion of a search term to replace the original search input as the original search is entered by the user based on the match between the modified search input without the excluded term and one or more stored terms; and in response to there not being a match between the modified search input without the excluded term and one or more of the plurality of stored terms: adding the excluded term from the original search back to the modified search input; matching the modified search input with the excluded term to the plurality of stored terms to determine if there is a match; and dynamically displaying, by the electronic device, a suggestion of a search term to replace the original search input as the original search is entered by the user based on a match between the original search input and one or more of the plurality of stored terms. 8. The method of claim 1 , wherein the partial search term comprises one or more characters of a search term, but not the entire search term. | 0.795058 |
9,489,624 | 8 | 9 | 8. The computer implemented method of claim 1 further comprising generating, by the one or more processors, a statistical model for each of the plurality of crowdsourcing platforms based on the one or more values corresponding to the one or more observable characteristics associated with respective crowdsourcing platform from the plurality of crowdsourcing platforms. | 8. The computer implemented method of claim 1 further comprising generating, by the one or more processors, a statistical model for each of the plurality of crowdsourcing platforms based on the one or more values corresponding to the one or more observable characteristics associated with respective crowdsourcing platform from the plurality of crowdsourcing platforms. 9. The computer-implemented method according to claim 8 further comprising updating, by the one or more processors, the statistical model for each of the plurality of crowdsourcing platforms based on one or more responses received for the one or more tasks. | 0.5 |
9,489,940 | 23 | 24 | 23. A method performed on at least one processor for dynamically updating a group of similarly situated user profiles with new words, wherein the new words are not contained in a language model, the method comprising the steps of: polling a plurality of client devices to determine that at least one user has added at least one new word to a vocabulary on at least one of the plurality of client devices; pulling from the at least one of the plurality of client devices the at least one new word for the language model; evaluating the efficiency of the language model; determining that the language model is applicable to at least one similarly situated user based at least in part on the evaluated efficiency; transmitting over the communication link the new word to a destination user profile to automatically update the destination user profile, wherein the group of similarly situated user profiles is updated dynamically based on the new word, wherein the updated destination user profile is used to train and update a destination language model, wherein the destination language model is utilized, by a speech recognition engine, to transcribe speech into text, and wherein the transcribed text is displayed on a user device. | 23. A method performed on at least one processor for dynamically updating a group of similarly situated user profiles with new words, wherein the new words are not contained in a language model, the method comprising the steps of: polling a plurality of client devices to determine that at least one user has added at least one new word to a vocabulary on at least one of the plurality of client devices; pulling from the at least one of the plurality of client devices the at least one new word for the language model; evaluating the efficiency of the language model; determining that the language model is applicable to at least one similarly situated user based at least in part on the evaluated efficiency; transmitting over the communication link the new word to a destination user profile to automatically update the destination user profile, wherein the group of similarly situated user profiles is updated dynamically based on the new word, wherein the updated destination user profile is used to train and update a destination language model, wherein the destination language model is utilized, by a speech recognition engine, to transcribe speech into text, and wherein the transcribed text is displayed on a user device. 24. The method of claim 23 wherein the step of pulling from the at least one of the plurality of client devices the new word for the language model comprises pulling an audio file of a pronunciation of the new word. | 0.5 |
9,977,830 | 3 | 4 | 3. The method of claim 1 , wherein the step of identifying one or more relevant themes includes presenting a list of themes in the ontology to a user and receiving a selection from the user of one or more of the themes presented in the list. | 3. The method of claim 1 , wherein the step of identifying one or more relevant themes includes presenting a list of themes in the ontology to a user and receiving a selection from the user of one or more of the themes presented in the list. 4. The method of claim 3 , wherein the list of themes includes all of the themes in the ontology. | 0.674497 |
8,316,004 | 5 | 7 | 5. A speech retrieval method for searching, in an audio file database including a memory, for one or more target audio files by using one or more input search terms, comprising: a related document obtaining step that includes searching with a processor, in a related document database where documents related to audio files in the audio file database are stored in the memory, for one or more related documents by using the one or more input search terms; a correspondence audio file obtaining step that includes that includes searching, in the audio file database, for one or more correspondence audio files corresponding to the one or more related documents obtained; and a speech-to-speech search step that includes searching, in the audio file database, for the one or more target audio files by using the one or more correspondence audio files obtained, wherein the speech-to-speech search step includes: a speech segment division step that includes obtaining a speech segment collection by dividing each of the obtained correspondence audio files into speech segments, a noise cancellation step that includes canceling noise by canceling one or more speech segments which are not related to the search terms, in the speech segment collection by using the search terms, and a segment-to-speech search step that includes searching, in the audio file database, for the target audio files by using the noise-cancelled speech segment collection. | 5. A speech retrieval method for searching, in an audio file database including a memory, for one or more target audio files by using one or more input search terms, comprising: a related document obtaining step that includes searching with a processor, in a related document database where documents related to audio files in the audio file database are stored in the memory, for one or more related documents by using the one or more input search terms; a correspondence audio file obtaining step that includes that includes searching, in the audio file database, for one or more correspondence audio files corresponding to the one or more related documents obtained; and a speech-to-speech search step that includes searching, in the audio file database, for the one or more target audio files by using the one or more correspondence audio files obtained, wherein the speech-to-speech search step includes: a speech segment division step that includes obtaining a speech segment collection by dividing each of the obtained correspondence audio files into speech segments, a noise cancellation step that includes canceling noise by canceling one or more speech segments which are not related to the search terms, in the speech segment collection by using the search terms, and a segment-to-speech search step that includes searching, in the audio file database, for the target audio files by using the noise-cancelled speech segment collection. 7. The speech retrieval method according to claim 5 , wherein: the search terms are one or more keywords, one or more sentences, or one or more documents. | 0.849609 |
8,321,406 | 1 | 10 | 1. A computer-implemented method comprising: receiving, from a user device of a first user, a first media object and a first query relating to content in the first media object, wherein the first query requests information identifying content presented in the first media object; providing for presentation the first media object and the first query to a plurality of second users different from the first user; receiving a suggested answer to the first query from each of a group of second users of the plurality of second users, where at least two of the suggested answers are distinct, and wherein a suggested answer from a particular second user is either a new suggested answer submitted by the particular second user in response to the first query or a previous suggested answer to the first query selected by the particular second user, the previous suggested answer being a suggested answer previously submitted by a different second user of the plurality of second users in response to the first query; grouping similar suggested answers based on a semantic similarity measure; ranking the suggested answers where each group of similar suggested answers is given a combined ranking; and providing for presentation one or more of the ranked suggested answers to the first user. | 1. A computer-implemented method comprising: receiving, from a user device of a first user, a first media object and a first query relating to content in the first media object, wherein the first query requests information identifying content presented in the first media object; providing for presentation the first media object and the first query to a plurality of second users different from the first user; receiving a suggested answer to the first query from each of a group of second users of the plurality of second users, where at least two of the suggested answers are distinct, and wherein a suggested answer from a particular second user is either a new suggested answer submitted by the particular second user in response to the first query or a previous suggested answer to the first query selected by the particular second user, the previous suggested answer being a suggested answer previously submitted by a different second user of the plurality of second users in response to the first query; grouping similar suggested answers based on a semantic similarity measure; ranking the suggested answers where each group of similar suggested answers is given a combined ranking; and providing for presentation one or more of the ranked suggested answers to the first user. 10. The method of claim 1 , where the media object is one of an image file, a video file, or an audio file. | 0.909628 |
9,916,540 | 10 | 12 | 10. The computing device of claim 8 , wherein the configuration of the processor to apply at least one biased first level of complexity to the input value to generate at least one class label includes the processor being configured to: apply a negatively biased level of complexity to the input value to generate a first class label; and apply a positively biased level of complexity to the input value to generate a second class label. | 10. The computing device of claim 8 , wherein the configuration of the processor to apply at least one biased first level of complexity to the input value to generate at least one class label includes the processor being configured to: apply a negatively biased level of complexity to the input value to generate a first class label; and apply a positively biased level of complexity to the input value to generate a second class label. 12. The computing device of claim 10 , wherein the processor is configured to: adjust the negatively biased level of complexity and/or the positively biased level of complexity to modify a likelihood that the level of complexity is able to classify the input value. | 0.579365 |
9,881,000 | 7 | 8 | 7. A system for mitigating sentiment model overfitting, the system comprising: a processor; and a memory communicably coupled to the processor, wherein the memory includes computer instructions configured to cause the processor to: determine, using a first sentiment model having a current list of keywords and respective weights, respective sentiment results for a plurality of posts; receive sentiment feedback for the respective sentiment results; display a first set of posts which are in the plurality of posts and have a sentiment feedback not matching the respective sentiment results; display: keywords which appear in the first set of posts; and the keywords' respective weights; receive a first change including at least one of: a first proposed change to a respective weight of one or more of the keywords; a first proposed deletion of one or more of the keywords; or a first proposed new keyword and a respective weight of the first proposed new keyword; maintain unchanged the current list of keywords and respective weights while creating a proposed list of keywords and respective weights by applying the first change to the current list of keywords and respective weights; analyze, using the proposed list of keywords and respective weights, the first set of posts; enable identifying overfitting by displaying sentiment results for the first set of posts produced using the proposed list of keywords and respective weights; receive a second change including at least one of: a second proposed change to a respective weight of one or more of the keywords; a second proposed deletion of one or more of the keywords; or a second proposed new keyword and a respective weight of the second proposed new keyword; update the proposed list of keywords and respective weights by applying the second change to the proposed list of keywords and respective weights; after applying the second change to the proposed list of keywords and respective weights, re-analyze the first set of posts using the proposed list of keywords and respective weights; enable the identification of overfitting by the display of sentiment results for the first set of posts produced using the proposed list of keywords and respective weights; and create a second sentiment model by replacing the current list of keywords and respective weights with the proposed list of keywords and respective weights. | 7. A system for mitigating sentiment model overfitting, the system comprising: a processor; and a memory communicably coupled to the processor, wherein the memory includes computer instructions configured to cause the processor to: determine, using a first sentiment model having a current list of keywords and respective weights, respective sentiment results for a plurality of posts; receive sentiment feedback for the respective sentiment results; display a first set of posts which are in the plurality of posts and have a sentiment feedback not matching the respective sentiment results; display: keywords which appear in the first set of posts; and the keywords' respective weights; receive a first change including at least one of: a first proposed change to a respective weight of one or more of the keywords; a first proposed deletion of one or more of the keywords; or a first proposed new keyword and a respective weight of the first proposed new keyword; maintain unchanged the current list of keywords and respective weights while creating a proposed list of keywords and respective weights by applying the first change to the current list of keywords and respective weights; analyze, using the proposed list of keywords and respective weights, the first set of posts; enable identifying overfitting by displaying sentiment results for the first set of posts produced using the proposed list of keywords and respective weights; receive a second change including at least one of: a second proposed change to a respective weight of one or more of the keywords; a second proposed deletion of one or more of the keywords; or a second proposed new keyword and a respective weight of the second proposed new keyword; update the proposed list of keywords and respective weights by applying the second change to the proposed list of keywords and respective weights; after applying the second change to the proposed list of keywords and respective weights, re-analyze the first set of posts using the proposed list of keywords and respective weights; enable the identification of overfitting by the display of sentiment results for the first set of posts produced using the proposed list of keywords and respective weights; and create a second sentiment model by replacing the current list of keywords and respective weights with the proposed list of keywords and respective weights. 8. The system of claim 7 , wherein the computer instructions further comprise computer instructions to cause the processor to: receive an indication of a post in the plurality of posts as being marked, wherein the mark indicates at least a partial error in the respective sentiment results for the post; and display the marked post as one of the displayed first set of posts. | 0.793275 |
10,042,613 | 4 | 5 | 4. The computer-implemented method of claim 3 , wherein the natural language processing pipeline process is selected from a group consisting of: tokenization; tagging; parsing; and mental detection. | 4. The computer-implemented method of claim 3 , wherein the natural language processing pipeline process is selected from a group consisting of: tokenization; tagging; parsing; and mental detection. 5. The computer-implemented method of claim 4 , wherein the highlighting highlights the back pointer when the detecting detects the error such that the location of the error can he hack traced by a human. | 0.5 |
9,792,414 | 1 | 6 | 1. A method comprising the steps of: performing a similarity distance computation between an input query case and a set of cases to retrieve a first subset of similar cases by using a default set of features and weights for assessment of similarity, wherein each feature comprises a case characterization and each weight corresponds to a feature; presenting the first subset of similar cases and the default set of features and weights to a user; receiving first input from the user, including: an indication of a number of cases to be retrieved; an indication of specific data or a specific image to be presented with each retrieved case; and an indication of a specific case to exclude from retrieval; (i) receiving second input from the user, including: an indication that an adaptation to the set of features and weights is needed, and at least one of (a) a modified weight for at least one of the default set of features, wherein the user directly modifies the weight or (b) at least one new feature in addition to the default set of features, wherein the user directly adds the new feature; (ii) modifying the similarity distance computation with the at least one new feature, and modified weights for retrieving a second subset of similar cases for the user; (iii) presenting the retrieved second subset of similar cases with the specific data or specific image for each retrieved case; repeating steps (i)-(iii) until receiving third input from the user indicating acceptance. | 1. A method comprising the steps of: performing a similarity distance computation between an input query case and a set of cases to retrieve a first subset of similar cases by using a default set of features and weights for assessment of similarity, wherein each feature comprises a case characterization and each weight corresponds to a feature; presenting the first subset of similar cases and the default set of features and weights to a user; receiving first input from the user, including: an indication of a number of cases to be retrieved; an indication of specific data or a specific image to be presented with each retrieved case; and an indication of a specific case to exclude from retrieval; (i) receiving second input from the user, including: an indication that an adaptation to the set of features and weights is needed, and at least one of (a) a modified weight for at least one of the default set of features, wherein the user directly modifies the weight or (b) at least one new feature in addition to the default set of features, wherein the user directly adds the new feature; (ii) modifying the similarity distance computation with the at least one new feature, and modified weights for retrieving a second subset of similar cases for the user; (iii) presenting the retrieved second subset of similar cases with the specific data or specific image for each retrieved case; repeating steps (i)-(iii) until receiving third input from the user indicating acceptance. 6. A method as claimed in claim 1 further comprising a step of generating a new set of features and weights as a new baseline for similarity distance computation based on a plurality of personal settings for features and weights collected from a group of users. | 0.585714 |
8,184,130 | 1 | 7 | 1. A method of implementing a user interface on a computing device, said method comprising: providing a display area for displaying a plurality of thumbnail images representing a plurality of images stored on the computing device by arranging the plurality of thumbnail images in a set of rows; and providing a single user movable two-dimensional shape having a surface area, said two-dimensional shape moveable in two directions to allow a user of said user interface to concurrently adjust sizes of the plurality of thumbnail images displayed in said display area, wherein a movement of said user movable shape in a first direction causes the sizes of the plurality of thumbnail images displayed in said display area to decrease, and a movement of said user movable shape in a second direction causes the sizes of the plurality of thumbnail images displayed in said display area to increase, wherein when said user movable shape moves in one of the two directions to decrease or increase the sizes of the plurality of thumbnail images, the number of thumbnail images that appear on a particular row changes based on a width of the display area, a size of each thumbnail image on the particular row, a minimum spacing to be placed between adjacent thumbnail images on the particular row, and any extra spacing that is determined to be placed between the adjacent thumbnail images on the particular row. | 1. A method of implementing a user interface on a computing device, said method comprising: providing a display area for displaying a plurality of thumbnail images representing a plurality of images stored on the computing device by arranging the plurality of thumbnail images in a set of rows; and providing a single user movable two-dimensional shape having a surface area, said two-dimensional shape moveable in two directions to allow a user of said user interface to concurrently adjust sizes of the plurality of thumbnail images displayed in said display area, wherein a movement of said user movable shape in a first direction causes the sizes of the plurality of thumbnail images displayed in said display area to decrease, and a movement of said user movable shape in a second direction causes the sizes of the plurality of thumbnail images displayed in said display area to increase, wherein when said user movable shape moves in one of the two directions to decrease or increase the sizes of the plurality of thumbnail images, the number of thumbnail images that appear on a particular row changes based on a width of the display area, a size of each thumbnail image on the particular row, a minimum spacing to be placed between adjacent thumbnail images on the particular row, and any extra spacing that is determined to be placed between the adjacent thumbnail images on the particular row. 7. The method of claim 1 , wherein said movement of said user movable shape in the second direction automatically removes at least one thumbnail image from the display area when the movement causes the display area to have not enough screen space to entirely fit the one additional thumbnail image. | 0.772171 |
8,612,466 | 1 | 7 | 1. A computer executable document search method for searching for a document, comprising: generating, based on user information represented as a group hierarchy having a user identifier and one or more groups joined by one or more operators, an inclusion relationship expression including an operator that designates an inclusion relationship for access authority; combining the inclusion relationship expression with a received search expression to generate a combined search expression; for searching at a private level, using the combined search expression to generate a first search expression using the received search expression and specifying the user identifier without specifying the one or more groups; and for searching at a shared level, using the combined search expression to generate a second search expression using the received search expression and specifying the one or more groups without specifying the user identifier. | 1. A computer executable document search method for searching for a document, comprising: generating, based on user information represented as a group hierarchy having a user identifier and one or more groups joined by one or more operators, an inclusion relationship expression including an operator that designates an inclusion relationship for access authority; combining the inclusion relationship expression with a received search expression to generate a combined search expression; for searching at a private level, using the combined search expression to generate a first search expression using the received search expression and specifying the user identifier without specifying the one or more groups; and for searching at a shared level, using the combined search expression to generate a second search expression using the received search expression and specifying the one or more groups without specifying the user identifier. 7. The document search method according to claim 1 , wherein an index that is searched comprises a full-text index generated as an inverted index, and wherein the full-text index further includes access authority indexes registered in a field where words are to be registered. | 0.662592 |
10,142,269 | 12 | 30 | 12. A system, comprising: a processing device; a network interface; non-transitory computer readable memory storing program code that when executed by the processing device is configured to cause the system to at least: provide a software program for download to a first computing device associated with a user; enable delivery of a voice message, directed to the user, to the first computing device associated with the user, wherein the delivered voice message is playable to the user via a user interface of the software program; enable the voice message to be played via a web browser of a second computing device associated with the user; enable the user to send a textual reply message, via the web browser of the second computing device associated with the user, to an originator of the voice message without the user entering an address of the originator of the voice message: receive, via the network interface, a user voice message deletion instruction from the web browser of the second computing device associated with the user; and in response to the user voice message deletion instruction received from the web browser of the second computing device associated with the user, enable, in cooperation with the software program on the first computing device associated with of the user, deletion of the voice message on the first computing device associated with the user. | 12. A system, comprising: a processing device; a network interface; non-transitory computer readable memory storing program code that when executed by the processing device is configured to cause the system to at least: provide a software program for download to a first computing device associated with a user; enable delivery of a voice message, directed to the user, to the first computing device associated with the user, wherein the delivered voice message is playable to the user via a user interface of the software program; enable the voice message to be played via a web browser of a second computing device associated with the user; enable the user to send a textual reply message, via the web browser of the second computing device associated with the user, to an originator of the voice message without the user entering an address of the originator of the voice message: receive, via the network interface, a user voice message deletion instruction from the web browser of the second computing device associated with the user; and in response to the user voice message deletion instruction received from the web browser of the second computing device associated with the user, enable, in cooperation with the software program on the first computing device associated with of the user, deletion of the voice message on the first computing device associated with the user. 30. The system as defined in claim 12 , wherein the provided software program includes a corporate brand identifier. | 0.851662 |
9,373,325 | 8 | 14 | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: generating a feature coefficient based on a speech signal from a user; comparing the feature coefficient to a user-specific codebook associated with the user, to yield a similarity value, wherein the user-specific codebook utilizes utterances from both the user and a group of non-users; and when the similarity value meets a threshold: adding the speech signal to a database of reference speech signals associated with the user-specific codebook; and adding the feature coefficient to the user-specific codebook. | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: generating a feature coefficient based on a speech signal from a user; comparing the feature coefficient to a user-specific codebook associated with the user, to yield a similarity value, wherein the user-specific codebook utilizes utterances from both the user and a group of non-users; and when the similarity value meets a threshold: adding the speech signal to a database of reference speech signals associated with the user-specific codebook; and adding the feature coefficient to the user-specific codebook. 14. The system of claim 8 , the computer-readable storage medium having additional instructions stored which result in operations comprising verifying an identity of the user based on the similarity value. | 0.715278 |
9,224,151 | 13 | 16 | 13. A method for presenting advertisements based on user interaction with a web page, the method comprising: determining that programmatic code that describes the web page is to be dynamically modified before being presented on a display device; identifying remotely stored supplemental information that is associated with the web page, the supplemental information including: a listing of words on the web page that are to be keywords, said keywords are to be associated with one or more descriptive terms that relate to the keywords, said descriptive terms might be generated after a rendering of the web page, a listing of triggering events associated with objects and the keywords of the web page such that if an object of the objects or a keyword of the keywords is interacted with in a predetermined way on the webpage, then an action is to follow, and a listing of actions that are to occur incident to one or more of the triggering events; dynamically modifying the programmatic code of the web page to include the supplemental information; receiving an indication of an occurrence of a certain event trigger in response to user interaction with the modified web page; gathering descriptive words associated with the occurrence of the event trigger; communicating the descriptive words to a remote computing device that returns advertising content based on the descriptive words; receiving the advertising content; and without obscuring an initial content of the web page, presenting information based on the advertising content. | 13. A method for presenting advertisements based on user interaction with a web page, the method comprising: determining that programmatic code that describes the web page is to be dynamically modified before being presented on a display device; identifying remotely stored supplemental information that is associated with the web page, the supplemental information including: a listing of words on the web page that are to be keywords, said keywords are to be associated with one or more descriptive terms that relate to the keywords, said descriptive terms might be generated after a rendering of the web page, a listing of triggering events associated with objects and the keywords of the web page such that if an object of the objects or a keyword of the keywords is interacted with in a predetermined way on the webpage, then an action is to follow, and a listing of actions that are to occur incident to one or more of the triggering events; dynamically modifying the programmatic code of the web page to include the supplemental information; receiving an indication of an occurrence of a certain event trigger in response to user interaction with the modified web page; gathering descriptive words associated with the occurrence of the event trigger; communicating the descriptive words to a remote computing device that returns advertising content based on the descriptive words; receiving the advertising content; and without obscuring an initial content of the web page, presenting information based on the advertising content. 16. The method of claim 13 , wherein receiving the indication of an occurrence of a certain trigger event includes invoking a scripting event handler that is associated with the triggering event. | 0.743421 |
7,970,616 | 8 | 12 | 8. A processing device comprising: at least one processor; and a memory connected to the at least one processor, the memory comprising: instructions for receiving language input including a plurality of words, instructions for producing and displaying language output based on the received language input, instructions for receiving a selection of a portion of a word included in the language output, instructions for providing a definition relating to the selected portion of the word, and instructions for presenting, one word at a time at a given rate, the plurality of words of the language output or the plurality of words of the received language input. | 8. A processing device comprising: at least one processor; and a memory connected to the at least one processor, the memory comprising: instructions for receiving language input including a plurality of words, instructions for producing and displaying language output based on the received language input, instructions for receiving a selection of a portion of a word included in the language output, instructions for providing a definition relating to the selected portion of the word, and instructions for presenting, one word at a time at a given rate, the plurality of words of the language output or the plurality of words of the received language input. 12. The processing device of claim 8 , wherein the instructions for presenting the received language input or the language output further comprise: instructions for displaying, at a same given position of a display screen, each of the words of the language input or the language output, one word at a time. | 0.5 |
7,620,942 | 9 | 15 | 9. A system for parameterizing imperative-language functions, comprising: a processor; means for representing at least one among a component input port and a component parameter using formal imperative function arguments; and means for distinguishing between formal imperative function arguments intended as component parameters from formal imperative function arguments intended as component input ports using the processor within an instantiating framework. | 9. A system for parameterizing imperative-language functions, comprising: a processor; means for representing at least one among a component input port and a component parameter using formal imperative function arguments; and means for distinguishing between formal imperative function arguments intended as component parameters from formal imperative function arguments intended as component input ports using the processor within an instantiating framework. 15. The system of claim 9 , wherein the system further comprises means for masking at least one among a plurality of output ports that are not translated. | 0.685714 |
8,774,515 | 1 | 9 | 1. An annotation system comprising: memory which stores: a structured prediction model comprising a graphical structure which represents predicted correlations between values assumed by labels in a set of labels, the graphical structure comprising at least one tree structure, wherein in at least one of the tree structures, each of the labels in the set of labels is in exactly one node of the tree structure, the nodes of the tree having at most a predefined number k of the labels, and each of a plurality of the nodes has more than one of the labels, and edges between the nodes define those pairs of nodes for which predicted correlations between the values of pairs of their labels is used in the label prediction; memory which stores instructions for: generating feature-based predictions for values of labels in the set of labels based on features extracted from an image; and predicting a value for at least one label from the set of labels for the image based on the feature-based label predictions, and the structured prediction model, and, when the instructions include instructions for receiving an assigned value for at least one label from the set of labels for the image, the predicted value being also based on an assigned value for at least one other label, if one has been assigned; and a processor for executing the instructions. | 1. An annotation system comprising: memory which stores: a structured prediction model comprising a graphical structure which represents predicted correlations between values assumed by labels in a set of labels, the graphical structure comprising at least one tree structure, wherein in at least one of the tree structures, each of the labels in the set of labels is in exactly one node of the tree structure, the nodes of the tree having at most a predefined number k of the labels, and each of a plurality of the nodes has more than one of the labels, and edges between the nodes define those pairs of nodes for which predicted correlations between the values of pairs of their labels is used in the label prediction; memory which stores instructions for: generating feature-based predictions for values of labels in the set of labels based on features extracted from an image; and predicting a value for at least one label from the set of labels for the image based on the feature-based label predictions, and the structured prediction model, and, when the instructions include instructions for receiving an assigned value for at least one label from the set of labels for the image, the predicted value being also based on an assigned value for at least one other label, if one has been assigned; and a processor for executing the instructions. 9. The system of claim 1 , wherein in every tree structure, each node has no more than one parent node and at least one of the nodes with a parent node has at least one child node. | 0.918256 |
9,621,662 | 9 | 17 | 9. A system, comprising: an annotation engine comprising a processor configured to annotate one or more reviews with one or more applicable tags; and an aggregation engine comprising a processor configured to: aggregate annotations of reviews associated with a subject of interest to identify an applicable insight into the subject of interest; and publish the identified insight determined from reviews of the subject of interest on a page associated with the subject of interest, wherein the published insight comprises a selectable hyperlink to navigate to pages of one or more other subjects of interest on which the same insight is published. | 9. A system, comprising: an annotation engine comprising a processor configured to annotate one or more reviews with one or more applicable tags; and an aggregation engine comprising a processor configured to: aggregate annotations of reviews associated with a subject of interest to identify an applicable insight into the subject of interest; and publish the identified insight determined from reviews of the subject of interest on a page associated with the subject of interest, wherein the published insight comprises a selectable hyperlink to navigate to pages of one or more other subjects of interest on which the same insight is published. 17. The system of claim 9 , wherein the aggregation engine comprises the annotation engine. | 0.83574 |
8,670,974 | 5 | 7 | 5. The method of claim 1 , wherein identifying the one or more candidate patterns comprises: identifying a first bilingual term pair; assigning a first generic token to a first term of the bilingual term pair; assigning a second generic token to a second term of the bilingual pair; assigning a non-generic token to a term or tab between the first term and the second term; and identifying, based on a layout pattern of the first generic token, the second generic token, and the non-generic token, a first candidate pattern. | 5. The method of claim 1 , wherein identifying the one or more candidate patterns comprises: identifying a first bilingual term pair; assigning a first generic token to a first term of the bilingual term pair; assigning a second generic token to a second term of the bilingual pair; assigning a non-generic token to a term or tab between the first term and the second term; and identifying, based on a layout pattern of the first generic token, the second generic token, and the non-generic token, a first candidate pattern. 7. The method of claim 5 , wherein a second bilingual term pair matches the first candidate pattern if tokens corresponding to the second bilingual term pair match tokens corresponding to the first bilingual term pair. | 0.658307 |
8,577,907 | 8 | 13 | 8. A system comprising: one or more computers and one or more storage devices storing instructions that are configured, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving a search query; generating a potential substitute term that is related to a query term of the search query; identifying an original set of documents that are responsive to the search query; weighting each potential substitute term that appears in a document in the original set based on a prevalence of the potential substitute term in the original set of documents; producing a pruned set of terms whose weight satisfies a condition; determining that the potential substitute term is a member of the pruned set of terms; and in response to determining that the potential substitute term is a member of the pruned set of terms, modifying the search query to include the potential substitute term. | 8. A system comprising: one or more computers and one or more storage devices storing instructions that are configured, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving a search query; generating a potential substitute term that is related to a query term of the search query; identifying an original set of documents that are responsive to the search query; weighting each potential substitute term that appears in a document in the original set based on a prevalence of the potential substitute term in the original set of documents; producing a pruned set of terms whose weight satisfies a condition; determining that the potential substitute term is a member of the pruned set of terms; and in response to determining that the potential substitute term is a member of the pruned set of terms, modifying the search query to include the potential substitute term. 13. The system of claim 8 , wherein weighting each potential substitute term comprises using inverse document frequency to measure the prevalence of the substitute term. | 0.635776 |
8,874,659 | 9 | 10 | 9. The method of claim 2 , wherein the information in the electronic message conversation data structure pertaining to each of the electronic message in the electronic message conversation comprises: (1) an indication of an electronic message type for that electronic message; (2) an indication of which participant in the electronic message conversation sent that electronic message; and (3) a sequence indicator indicating an order in which that electronic message was sent by that participant relative to other electronic messages of the same electronic message type sent by that participant in the electronic message conversation. | 9. The method of claim 2 , wherein the information in the electronic message conversation data structure pertaining to each of the electronic message in the electronic message conversation comprises: (1) an indication of an electronic message type for that electronic message; (2) an indication of which participant in the electronic message conversation sent that electronic message; and (3) a sequence indicator indicating an order in which that electronic message was sent by that participant relative to other electronic messages of the same electronic message type sent by that participant in the electronic message conversation. 10. The method of claim 9 , wherein the set of information pertaining to the received electronic message comprises: (1) an indication of a particular electronic message type for the received electronic message; (2) an indication that the received electronic message was sent by a particular participant in the electronic message conversation; and (3) a particular sequence indicator indicating an order in which the received electronic message was sent by the particular participant relative to other electronic messages of the particular electronic message type sent by the particular participant in the electronic message conversation. | 0.5 |
8,830,241 | 1 | 2 | 1. A method comprising: receiving an electronic document that includes hypertext markup language (HTML) code and a first raster graphics (RG) image having text-based content; converting the first RG image to a vector graphics (VG) image; determining a body size of a reference character that is located in the VG image; determining a baseline of the VG image relative to the text-based content; segmenting the VG image at one or more break points to create VG image segments; storing each of the VG image segments as separate but related VG image portions; identifying a second RG image included in the electronic document; determining that the second RG image is free from inclusion of text-based content; preserving the second RG image by refraining from converting the second RG image to a second VG image; and transmitting the electronic document comprising the VG image, the second RG image, and the HTML code to a viewing device for display, wherein the body size and the baseline enable the viewing device to resize and position the text-based content in the VG image to align with adjacent HTML text in the electronic document, and wherein the VG image portions enable the viewing device to reflow at least a portion of the text-based content. | 1. A method comprising: receiving an electronic document that includes hypertext markup language (HTML) code and a first raster graphics (RG) image having text-based content; converting the first RG image to a vector graphics (VG) image; determining a body size of a reference character that is located in the VG image; determining a baseline of the VG image relative to the text-based content; segmenting the VG image at one or more break points to create VG image segments; storing each of the VG image segments as separate but related VG image portions; identifying a second RG image included in the electronic document; determining that the second RG image is free from inclusion of text-based content; preserving the second RG image by refraining from converting the second RG image to a second VG image; and transmitting the electronic document comprising the VG image, the second RG image, and the HTML code to a viewing device for display, wherein the body size and the baseline enable the viewing device to resize and position the text-based content in the VG image to align with adjacent HTML text in the electronic document, and wherein the VG image portions enable the viewing device to reflow at least a portion of the text-based content. 2. The method of claim 1 , wherein the one or more breaks points comprise respective vertical white spaces located within the VG image, and further comprising detecting the one or more break points comprising the respective vertical white spaces via a computer-based analysis of the VG image. | 0.588732 |
8,161,131 | 27 | 28 | 27. The computer program product of claim 21 wherein computer readable program code configured provide collaborative event media content further comprises: computer readable program code configured create, in dependence upon original media content, a structured document, the structured document further comprising one or more structural elements; and computer readable program code configured create a grammar for the collaborative event media content, wherein the grammar includes grammar elements each of which includes an identifier for at least one structural element of the structured document. | 27. The computer program product of claim 21 wherein computer readable program code configured provide collaborative event media content further comprises: computer readable program code configured create, in dependence upon original media content, a structured document, the structured document further comprising one or more structural elements; and computer readable program code configured create a grammar for the collaborative event media content, wherein the grammar includes grammar elements each of which includes an identifier for at least one structural element of the structured document. 28. The computer program product of claim 27 further comprising computer readable program code configured classify a structural element of the structured document according to a presentation attribute. | 0.5 |
9,514,408 | 1 | 3 | 1. A method for acquiring facts to populate a knowledge representation system (KRS), the method comprising the steps of: defining and organizing the KRS as an ontology; creating a fact template, for a predetermined type of fact, that accepts, from predetermined information sources, a structured fact having the predetermined type, wherein the fact template constrains, based on the predetermined type of fact, an organization and permitted content within the fact template to be consistent with an organization of the ontology; providing the fact template upon receiving a selection of the predetermined type of fact, wherein the fact template includes a user interface that constrains user data entry, for completing the fact template, to a predetermined set of valid user entries insertable into the fact template at the user interface; providing a user entry field, in the user interface, that permits entry of new information, from the structured fact, not included in the predetermined set of valid user entries; acquiring the structured fact from a predetermined knowledge source by receiving the fact template completed with information of the structured fact; automatically flagging the completed fact template for review responsive to the entry of new information, wherein the fact template is completed with information extracted from the predetermined information sources; and inserting the structured fact into the KRS to create a knowledge base. | 1. A method for acquiring facts to populate a knowledge representation system (KRS), the method comprising the steps of: defining and organizing the KRS as an ontology; creating a fact template, for a predetermined type of fact, that accepts, from predetermined information sources, a structured fact having the predetermined type, wherein the fact template constrains, based on the predetermined type of fact, an organization and permitted content within the fact template to be consistent with an organization of the ontology; providing the fact template upon receiving a selection of the predetermined type of fact, wherein the fact template includes a user interface that constrains user data entry, for completing the fact template, to a predetermined set of valid user entries insertable into the fact template at the user interface; providing a user entry field, in the user interface, that permits entry of new information, from the structured fact, not included in the predetermined set of valid user entries; acquiring the structured fact from a predetermined knowledge source by receiving the fact template completed with information of the structured fact; automatically flagging the completed fact template for review responsive to the entry of new information, wherein the fact template is completed with information extracted from the predetermined information sources; and inserting the structured fact into the KRS to create a knowledge base. 3. The method of claim 1 , wherein the KRS is a frame-based KRS. | 0.879699 |
8,185,865 | 1 | 18 | 1. A method for generating a biased layout for making an integrated circuit, comprising: (a) identifying a nominal layout defined by one or more cells, each cell having one or more transistors having transistor gate features with a nominal gate length; (b) identifying an annotated layout, the annotated layout itself provides information for identifying gate-length biasing of one or more of the transistor gate features in one or more cells of the nominal layout; and (c) producing a biased layout by modifying the nominal layout using the information provided by the annotated layout, such that the biasing modifies a gate length of those transistor gate features identified by the information of the annotated layout, the method implemented by a processor executing a program. | 1. A method for generating a biased layout for making an integrated circuit, comprising: (a) identifying a nominal layout defined by one or more cells, each cell having one or more transistors having transistor gate features with a nominal gate length; (b) identifying an annotated layout, the annotated layout itself provides information for identifying gate-length biasing of one or more of the transistor gate features in one or more cells of the nominal layout; and (c) producing a biased layout by modifying the nominal layout using the information provided by the annotated layout, such that the biasing modifies a gate length of those transistor gate features identified by the information of the annotated layout, the method implemented by a processor executing a program. 18. The method of claim 1 , wherein the gate-length biasing defines an increase or decrease in the gate length of a selected transistor gate feature. | 0.673246 |
10,002,201 | 8 | 9 | 8. The system of claim 7 , the operations comprising calculating the observed historical click through rate as a ratio representing a total number of times users have selected the one single search result to a total number of times users have selected a second search result different from the one single search result. | 8. The system of claim 7 , the operations comprising calculating the observed historical click through rate as a ratio representing a total number of times users have selected the one single search result to a total number of times users have selected a second search result different from the one single search result. 9. The system of claim 8 , the operations comprising calculating the observed historical click through rate as a ratio representing a total number of times users have selected the one single search result in response to a search query to a total number of times users have selected other search results in response to the search query, the other search results being different from the one single search result. | 0.5 |
6,151,604 | 54 | 60 | 54. A method for storing and retrieving data in a computer memory, comprising the steps of: configuring said memory according to a logical table, said logical table including: a plurality of logical rows, each said logical row including an object identification number (OID) to identify each said logical row, each said logical row corresponding to a record of information; a plurality of logical columns intersecting said plurality of logical rows to define a plurality of logical cells, each said logical column including an OID to identify each said logical column; and wherein at least one of said logical cells includes a pointer to an index record; and indexing data stored in said table. | 54. A method for storing and retrieving data in a computer memory, comprising the steps of: configuring said memory according to a logical table, said logical table including: a plurality of logical rows, each said logical row including an object identification number (OID) to identify each said logical row, each said logical row corresponding to a record of information; a plurality of logical columns intersecting said plurality of logical rows to define a plurality of logical cells, each said logical column including an OID to identify each said logical column; and wherein at least one of said logical cells includes a pointer to an index record; and indexing data stored in said table. 60. The method of claim 54 wherein said step of indexing data further comprises the step of: indexing external documents. | 0.787719 |
9,852,111 | 1 | 2 | 1. A method for summarizing a document, the method comprising: receiving, by one or more processors, a reading speed of a reader, wherein the reader is a human reader, wherein the reading speed is based on a first source; determining, by one or more processors, a summary length of a summary of the document based on the received reading speed of the reader, wherein the document is a second source that is a different source from the first source, wherein a first reading speed is faster than a second reading speed, wherein the first reading speed results in a first summary length of the summary and the second reading speed results in a second summary length of the summary, and wherein the first summary length is longer than the second summary length; generating, by one or more processors, a summary of the document having the determined summary length; identifying, by one or more processors, an interest of the reader; modifying, by one or more processors, the summary of the document according to the interest of the reader in order to include, in the summary of the document, content from the document that is of interest to the reader, wherein the reader has multiple interests; weighting, by one or more processors, each interest from the multiple interests based on a reading history of the reader, wherein each interest is assigned a weight based on a percentage of the reading history of the reader that is devoted to said each interest; generating, by one or more processors, a weight ratio of interests of the reader from the multiple interests based on the percentage of the reading history of the reader that is devoted to said each interest; generating, by one or more processors, components of the summary based on the weight ratio of interests of the reader; and modifying, by one or more processors, the summary of the document to match the weight ratio such that a ratio of lengths of the components of the summary matches the weight ratio of the interests of the reader. | 1. A method for summarizing a document, the method comprising: receiving, by one or more processors, a reading speed of a reader, wherein the reader is a human reader, wherein the reading speed is based on a first source; determining, by one or more processors, a summary length of a summary of the document based on the received reading speed of the reader, wherein the document is a second source that is a different source from the first source, wherein a first reading speed is faster than a second reading speed, wherein the first reading speed results in a first summary length of the summary and the second reading speed results in a second summary length of the summary, and wherein the first summary length is longer than the second summary length; generating, by one or more processors, a summary of the document having the determined summary length; identifying, by one or more processors, an interest of the reader; modifying, by one or more processors, the summary of the document according to the interest of the reader in order to include, in the summary of the document, content from the document that is of interest to the reader, wherein the reader has multiple interests; weighting, by one or more processors, each interest from the multiple interests based on a reading history of the reader, wherein each interest is assigned a weight based on a percentage of the reading history of the reader that is devoted to said each interest; generating, by one or more processors, a weight ratio of interests of the reader from the multiple interests based on the percentage of the reading history of the reader that is devoted to said each interest; generating, by one or more processors, components of the summary based on the weight ratio of interests of the reader; and modifying, by one or more processors, the summary of the document to match the weight ratio such that a ratio of lengths of the components of the summary matches the weight ratio of the interests of the reader. 2. The method of claim 1 , wherein the reading speed of the reader is received as an input from the reader. | 0.790196 |
9,317,870 | 1 | 3 | 1. A non-transitory processor readable medium storing processor executable instructions that when executed by a processor cause the processor to: receive application data from a user device via a communications network, the application data being indicative of text entered into an application by a user via the user device; analyze the application data for one or more indicator, the one or more indicator being at least a portion of the text entered into the application, the one or more indicator having one or more meaning; retrieve one or more selected ideograph from a database populated with ideographs associated with one or more advertisers, the one or more selected ideograph being a graphical representation of the one or more indicator; transmit the one or more selected ideograph to the user device; and charge a fee to at least one advertiser associated with the one or more selected ideograph, wherein the one or more selected ideograph is retrieved and transmitted to the user device without immediate user action beyond entering the text into the application. | 1. A non-transitory processor readable medium storing processor executable instructions that when executed by a processor cause the processor to: receive application data from a user device via a communications network, the application data being indicative of text entered into an application by a user via the user device; analyze the application data for one or more indicator, the one or more indicator being at least a portion of the text entered into the application, the one or more indicator having one or more meaning; retrieve one or more selected ideograph from a database populated with ideographs associated with one or more advertisers, the one or more selected ideograph being a graphical representation of the one or more indicator; transmit the one or more selected ideograph to the user device; and charge a fee to at least one advertiser associated with the one or more selected ideograph, wherein the one or more selected ideograph is retrieved and transmitted to the user device without immediate user action beyond entering the text into the application. 3. The non-transitory processor readable medium of claim 1 , wherein the one or more ideograph is a non-textual graphic. | 0.817073 |
8,127,220 | 22 | 24 | 22. A computer-implemented method, comprising: identifying a document that is stored on a server in a network and that includes links to linked documents; determining scores for a plurality of the links in the identified document; comparing the determined scores to a threshold; deleting one of the plurality of links from the identified document when the determined score for the one of the links falls below the threshold; and providing, to a user, the identified document without the deleted link. | 22. A computer-implemented method, comprising: identifying a document that is stored on a server in a network and that includes links to linked documents; determining scores for a plurality of the links in the identified document; comparing the determined scores to a threshold; deleting one of the plurality of links from the identified document when the determined score for the one of the links falls below the threshold; and providing, to a user, the identified document without the deleted link. 24. The method of claim 22 , wherein determining the scores includes: determining a clickthrough rate for each of the linked documents, determining a score for each of the linked documents based on the determined clickthrough rates, and associating the determined scores for the linked documents with the corresponding links in the identified document. | 0.861089 |
9,799,333 | 1 | 3 | 1. An electronic system configured to perform speech processing comprising: a memory having stored therein a database of keyword models, wherein the database of keyword models includes an ensemble of filters describing an evolution of phonetic events associated with each keyword in the database; a processor configured to: i) receive a signal including speech; ii) decompose the signal including speech into a sparse set of phonetic impulses; iii) access the database of keyword models; iv) identify keywords within the signal including speech using the sparse set of phonetic impulses and the database of keywords; and v) generate an output indicating the keywords identified in iv). | 1. An electronic system configured to perform speech processing comprising: a memory having stored therein a database of keyword models, wherein the database of keyword models includes an ensemble of filters describing an evolution of phonetic events associated with each keyword in the database; a processor configured to: i) receive a signal including speech; ii) decompose the signal including speech into a sparse set of phonetic impulses; iii) access the database of keyword models; iv) identify keywords within the signal including speech using the sparse set of phonetic impulses and the database of keywords; and v) generate an output indicating the keywords identified in iv). 3. The system of claim 1 wherein the processor is further configured to generate a representation of speech as a sparse set of temporal phonetic events in response to the signal including speech in ii). | 0.724796 |
7,657,839 | 1 | 2 | 1. A system for replying to messages comprising: a display device that displays a graphical user interface that presents a list of messages and one or more reply options to a user, that permits the user to select a message and that permits the user to select one of the one or more reply options through the graphical user interface, wherein the graphical user interface includes one or more views; and a computer-readable medium that includes a reply module, the reply module including computer-readable instructions operable to be executed on a processor, that determines, in response to the selected one or more reply options, one or more related messages that are related to the selected massage, automatically populates one or more address fields of a reply message with a message address of a sender of the selected message and a message address of a recipient of the one or more related messages, wherein the recipient of the one or more related messages is neither a sender of the selected message nor a recipient of the selected message; and stores the message address of the sender of the selected message and the message address of the recipient of the one or more related messages, along with information regarding the field of the message from which each address originated. | 1. A system for replying to messages comprising: a display device that displays a graphical user interface that presents a list of messages and one or more reply options to a user, that permits the user to select a message and that permits the user to select one of the one or more reply options through the graphical user interface, wherein the graphical user interface includes one or more views; and a computer-readable medium that includes a reply module, the reply module including computer-readable instructions operable to be executed on a processor, that determines, in response to the selected one or more reply options, one or more related messages that are related to the selected massage, automatically populates one or more address fields of a reply message with a message address of a sender of the selected message and a message address of a recipient of the one or more related messages, wherein the recipient of the one or more related messages is neither a sender of the selected message nor a recipient of the selected message; and stores the message address of the sender of the selected message and the message address of the recipient of the one or more related messages, along with information regarding the field of the message from which each address originated. 2. The system of claim 1 , wherein the reply module further automatically populates one or more address fields of the reply message with a message address of a recipient of the selected message. | 0.731302 |
7,580,926 | 27 | 29 | 27. The method of claim 26 , wherein generating a category signature vector that represents a category comprises: for each of the aliases of the category, generating an alias vector representing the alias; and combining the alias vectors to obtain the category signature vector. | 27. The method of claim 26 , wherein generating a category signature vector that represents a category comprises: for each of the aliases of the category, generating an alias vector representing the alias; and combining the alias vectors to obtain the category signature vector. 29. The method of claim 27 , wherein combining the alias vectors representing the aliases of the category comprises: summing the alias vectors; and normalizing the sum of the alias vectors to obtain the category signature vector. | 0.799825 |
8,186,516 | 1 | 2 | 1. A document processing system comprising: one or more document guide components defining a path of travel of documents, the path of travel of documents including an intersection portion that separates a first portion from a second portion; and a component reposition element at the intersection portion of the path of travel of one or more documents, the component reposition element arranged to align a document processing component with a first portion of the path of travel when a first side of one of the documents is closer to the document processing component than a second side of one of the documents and a second portion of the path of travel when the second side of one of the documents is closer to the document processing component than the first side of one of the documents; wherein the component repositioning element is configured to move the image scanner between first and second positions, wherein in the first position the image scanner is oriented to scan a first side of the document and in the second position the image scanner is oriented to scan a second side of the document; and wherein the path of travel includes a turn-around loop. | 1. A document processing system comprising: one or more document guide components defining a path of travel of documents, the path of travel of documents including an intersection portion that separates a first portion from a second portion; and a component reposition element at the intersection portion of the path of travel of one or more documents, the component reposition element arranged to align a document processing component with a first portion of the path of travel when a first side of one of the documents is closer to the document processing component than a second side of one of the documents and a second portion of the path of travel when the second side of one of the documents is closer to the document processing component than the first side of one of the documents; wherein the component repositioning element is configured to move the image scanner between first and second positions, wherein in the first position the image scanner is oriented to scan a first side of the document and in the second position the image scanner is oriented to scan a second side of the document; and wherein the path of travel includes a turn-around loop. 2. The document processing system of claim 1 , wherein the one or more document guide components include a roller. | 0.744395 |
9,131,045 | 1 | 14 | 1. A method for providing captioned services to an assisted user communicating with a hearing person, the method comprising the steps of: providing a relay for providing captioned text of a telephonic communication, the relay including a computer, a relay input device and a relay display screen; providing an assisted user's captioned device that is linkable to at least first and second communication links, the captioned device including a display, a speaker, a microphone, a caption switch and a captioned device processor, the caption switch controllable by the assisted user to invoke a captioning service, the processor in communication with the caption switch and the display, the captioned device configured to perform the steps of: (i) initiating a voice call on the first communication link between the hearing person and the assisted user's captioned device during which voice communication occurs between the assisted user speaking into the microphone and the hearing person; (ii) while the voice call is progressing on the first communication link, receiving an indication that the caption switch has been selected via the assisted user's captioning device invoking the captioning service; (iii) initiating the second communication link from the captioned device processor to the relay for producing captioned text; (iv) after the second communication link is established, receiving words spoken in voice by a hearing person on the first communication link; (v) providing the words spoken by the hearing person over the second communication link to the relay so that the relay can convert the words spoken by the hearing person into text; (vi) receiving text corresponding to the converted words transmitted from the relay; (vii) displaying the received text on the display; and (viii) broadcasting the voice of the hearing person via the speaker; and the relay configured to perform the steps of: (i) transcribing the words spoken by the hearing person into a text message stream; (ii) displaying the text message stream on the relay display screen; (iii) receiving corrections to the text message stream entered by a call assistant using the relay input device to generate corrected text; and (iv) transmitting the corrected text to the captioned device for display to the assisted user. | 1. A method for providing captioned services to an assisted user communicating with a hearing person, the method comprising the steps of: providing a relay for providing captioned text of a telephonic communication, the relay including a computer, a relay input device and a relay display screen; providing an assisted user's captioned device that is linkable to at least first and second communication links, the captioned device including a display, a speaker, a microphone, a caption switch and a captioned device processor, the caption switch controllable by the assisted user to invoke a captioning service, the processor in communication with the caption switch and the display, the captioned device configured to perform the steps of: (i) initiating a voice call on the first communication link between the hearing person and the assisted user's captioned device during which voice communication occurs between the assisted user speaking into the microphone and the hearing person; (ii) while the voice call is progressing on the first communication link, receiving an indication that the caption switch has been selected via the assisted user's captioning device invoking the captioning service; (iii) initiating the second communication link from the captioned device processor to the relay for producing captioned text; (iv) after the second communication link is established, receiving words spoken in voice by a hearing person on the first communication link; (v) providing the words spoken by the hearing person over the second communication link to the relay so that the relay can convert the words spoken by the hearing person into text; (vi) receiving text corresponding to the converted words transmitted from the relay; (vii) displaying the received text on the display; and (viii) broadcasting the voice of the hearing person via the speaker; and the relay configured to perform the steps of: (i) transcribing the words spoken by the hearing person into a text message stream; (ii) displaying the text message stream on the relay display screen; (iii) receiving corrections to the text message stream entered by a call assistant using the relay input device to generate corrected text; and (iv) transmitting the corrected text to the captioned device for display to the assisted user. 14. The method of claim 1 wherein the caption switch includes a button. | 0.927846 |
8,996,975 | 2 | 3 | 2. The method of claim 1 , further comprising presenting a beginning of the frame on a display of the device. | 2. The method of claim 1 , further comprising presenting a beginning of the frame on a display of the device. 3. The method of claim 2 , wherein presenting the frame comprises presenting the Web page and automatically scrolling the Web page until the beginning of the frame is presented. | 0.516393 |
9,202,523 | 11 | 15 | 11. A method of providing information related to a broadcast program, the method comprising: detecting at least one object from a scene by an object detector; generating a keyword including a name and information relating to a meaning of the object; setting a scene section comprising a group of the scenes that deal with a same subject between the scenes displayed on a display by using the keyword that is generated based on the at least one object from the scenes, the scene section comprising a group of the scenes that deal with a same subject between the scenes displayed on the display; requesting searching of related information associated with the object by using the keyword and receiving the searched related information; and synchronizing the received related information along with the scene section comprising the group of the scenes that deal with the same subject between the scenes displayed on the display and providing the related information synchronized with the scene section, wherein the setting of the scene section comprises setting as the scene section a group of scenes between which an amount of preserved keywords is equal to or greater than a threshold value, the preserved keywords being defined by a number of keywords that exist in common between keywords generated from a first scene and keywords generated from a second scene, and wherein the generating of the keyword comprises determining an object name which corresponds to the object and a category to which the object name belongs by using an object name dictionary in which a plurality of object names are individually mapped to categories, thereby generating the keyword including the object name and the category. | 11. A method of providing information related to a broadcast program, the method comprising: detecting at least one object from a scene by an object detector; generating a keyword including a name and information relating to a meaning of the object; setting a scene section comprising a group of the scenes that deal with a same subject between the scenes displayed on a display by using the keyword that is generated based on the at least one object from the scenes, the scene section comprising a group of the scenes that deal with a same subject between the scenes displayed on the display; requesting searching of related information associated with the object by using the keyword and receiving the searched related information; and synchronizing the received related information along with the scene section comprising the group of the scenes that deal with the same subject between the scenes displayed on the display and providing the related information synchronized with the scene section, wherein the setting of the scene section comprises setting as the scene section a group of scenes between which an amount of preserved keywords is equal to or greater than a threshold value, the preserved keywords being defined by a number of keywords that exist in common between keywords generated from a first scene and keywords generated from a second scene, and wherein the generating of the keyword comprises determining an object name which corresponds to the object and a category to which the object name belongs by using an object name dictionary in which a plurality of object names are individually mapped to categories, thereby generating the keyword including the object name and the category. 15. The method of claim 11 , wherein the detecting of the object comprises detecting the object using at least one of video information, sound information, caption information, Electronic Program Guide information and telop character information, which are included in received broadcast streams. | 0.558209 |
8,209,178 | 1 | 2 | 1. A method comprising generating a compact language model, including: receiving, at a computing system including one or more processors, a collection of n-grams, each n-gram having one or more associated parameter values; determining, at the computing system, a fingerprint for each n-gram of the collection of n-grams; identifying, at the computing system, locations in an array for each n-gram using a plurality of hash functions; and encoding, at the computing system, the one or more parameter values associated with each n-gram in the identified array locations as a function of corresponding array values and the fingerprint for the n-gram, where identifying locations in the array further comprises: building an array having a specified number of locations; identifying a plurality of locations corresponding to each n-gram in the collection; identifying a first n-gram-location pair corresponding to a first n-gram associated with a first location of degree one, where the first location is of degree one when no other n-gram of the collection of n-grams is associated with the first location; and removing the first n-gram-location pair such that the n-gram no longer corresponds to any other locations in the array such that one or more other locations in the array are of degree one. | 1. A method comprising generating a compact language model, including: receiving, at a computing system including one or more processors, a collection of n-grams, each n-gram having one or more associated parameter values; determining, at the computing system, a fingerprint for each n-gram of the collection of n-grams; identifying, at the computing system, locations in an array for each n-gram using a plurality of hash functions; and encoding, at the computing system, the one or more parameter values associated with each n-gram in the identified array locations as a function of corresponding array values and the fingerprint for the n-gram, where identifying locations in the array further comprises: building an array having a specified number of locations; identifying a plurality of locations corresponding to each n-gram in the collection; identifying a first n-gram-location pair corresponding to a first n-gram associated with a first location of degree one, where the first location is of degree one when no other n-gram of the collection of n-grams is associated with the first location; and removing the first n-gram-location pair such that the n-gram no longer corresponds to any other locations in the array such that one or more other locations in the array are of degree one. 2. The method of claim 1 , further comprising: sequentially identifying additional locations of degree one and removing the corresponding n-gram-location pairs until each n-gram of the collection is matched with a unique location in the array. | 0.5 |
8,121,999 | 14 | 18 | 14. A method for displaying search results from a private social network database in combination with a web-based search, comprising: providing a graphical user interface (GUI) to a user; providing one or more databases including a plurality of database entries, a first portion of the database entries including private social network data and a second portion including non-social network data that is publicly accessible on the World Wide Web; associating a plurality of permission rules with the first portion of database entries, the plurality of permission rules individually defining access rights to a respective subset of the private social network data; receiving a keyword search request from a search request user; receiving authentication data associated with the user, wherein the authentication data identifies access rights of the user to a subset of the private social network data according to at least one of the permission rules; and searching the one or more databases or a keyword index thereof using one or more keywords received in the keyword search request and generating a search result comprising a plurality of search result items, at least a portion of which are displayed through the GUI as a plurality of selectable links, wherein a first portion of the selectable links link to one or more databases having private social network data and a second portion of the selectable links link to a database having non-social network data. | 14. A method for displaying search results from a private social network database in combination with a web-based search, comprising: providing a graphical user interface (GUI) to a user; providing one or more databases including a plurality of database entries, a first portion of the database entries including private social network data and a second portion including non-social network data that is publicly accessible on the World Wide Web; associating a plurality of permission rules with the first portion of database entries, the plurality of permission rules individually defining access rights to a respective subset of the private social network data; receiving a keyword search request from a search request user; receiving authentication data associated with the user, wherein the authentication data identifies access rights of the user to a subset of the private social network data according to at least one of the permission rules; and searching the one or more databases or a keyword index thereof using one or more keywords received in the keyword search request and generating a search result comprising a plurality of search result items, at least a portion of which are displayed through the GUI as a plurality of selectable links, wherein a first portion of the selectable links link to one or more databases having private social network data and a second portion of the selectable links link to a database having non-social network data. 18. the method as in claim 14 , further comprising determining a hierarchy for at least a portion of the search result items. | 0.736287 |
9,658,931 | 19 | 20 | 19. The monitoring system of claim 12 , wherein the at least one processing unit further executes the instructions to: automatically provide as the signal, a first signal to execute a first input action at the remote system, in response to a detected presence of the graphical element in the received representation of the remote system graphical user interface during the search. | 19. The monitoring system of claim 12 , wherein the at least one processing unit further executes the instructions to: automatically provide as the signal, a first signal to execute a first input action at the remote system, in response to a detected presence of the graphical element in the received representation of the remote system graphical user interface during the search. 20. The monitoring system of claim 19 , wherein the at least one processing unit further executes the instructions to: automatically provide as the signal, a second signal to execute a second input action at the remote system, in response to a detected absence of the graphical element in the received representation of the remote system graphical user interface during the search. | 0.5 |
8,843,490 | 1 | 3 | 1. A method for automatically identifying semi-structured data from a semi-structured web site, the method comprising: analyzing links and pages on the semi-structured web site using a set of heterogeneous experts, each of the experts focusing on a respective type of structure included in the semi-structured web site; identifying, by the set of experts, similarities and dissimilarities between the analyzed links and pages; clustering pages and text segments based on the similarities and dissimilarities identified by at least two experts in the set of heterogeneous experts, wherein each of the at least two experts produces hints indicating whether two items should be together in a cluster, the hints containing respective levels of confidence; and wherein the clustering text segments comprises: finding page clusters; determining a set of text segments for each of the found pare clusters; and clustering text segments of the set of text segments; identifying, based on the clustering of pages and text segments, at least some of the semi-structured data to be extracted from the semi-structured web site; extracting the at least some of the identified semi-structured data; and transforming the extracted semi-structured data into a relational structured form. | 1. A method for automatically identifying semi-structured data from a semi-structured web site, the method comprising: analyzing links and pages on the semi-structured web site using a set of heterogeneous experts, each of the experts focusing on a respective type of structure included in the semi-structured web site; identifying, by the set of experts, similarities and dissimilarities between the analyzed links and pages; clustering pages and text segments based on the similarities and dissimilarities identified by at least two experts in the set of heterogeneous experts, wherein each of the at least two experts produces hints indicating whether two items should be together in a cluster, the hints containing respective levels of confidence; and wherein the clustering text segments comprises: finding page clusters; determining a set of text segments for each of the found pare clusters; and clustering text segments of the set of text segments; identifying, based on the clustering of pages and text segments, at least some of the semi-structured data to be extracted from the semi-structured web site; extracting the at least some of the identified semi-structured data; and transforming the extracted semi-structured data into a relational structured form. 3. The method of claim 1 , wherein the clustering of pages and text segments provides at least two alternative clusterings. | 0.625 |
8,595,004 | 1 | 5 | 1. A pronunciation variation rule extraction apparatus comprising: a speech data storage unit which stores speech data; a base form pronunciation storage unit which stores base form pronunciation data representing base form pronunciation of said speech data; a sub word language model generation unit which generates a sub word language model from said base form pronunciation data; a speech recognition unit which recognizes said speech data by using said sub word language model; a difference extraction unit which extracts a difference between a recognition result outputted from said speech recognition unit and said base form pronunciation data by comparing said recognition result and said base form pronunciation data; and a language model weight control unit which controls one weight value for said sub word language model, wherein said language model weight control unit outputs a plurality of said weight values, wherein said speech recognition unit recognizes said speech data for each of said plurality of weight values, and wherein said language model weight control unit determines whether or not said weight value should be updated, based on said difference when said difference is extracted. | 1. A pronunciation variation rule extraction apparatus comprising: a speech data storage unit which stores speech data; a base form pronunciation storage unit which stores base form pronunciation data representing base form pronunciation of said speech data; a sub word language model generation unit which generates a sub word language model from said base form pronunciation data; a speech recognition unit which recognizes said speech data by using said sub word language model; a difference extraction unit which extracts a difference between a recognition result outputted from said speech recognition unit and said base form pronunciation data by comparing said recognition result and said base form pronunciation data; and a language model weight control unit which controls one weight value for said sub word language model, wherein said language model weight control unit outputs a plurality of said weight values, wherein said speech recognition unit recognizes said speech data for each of said plurality of weight values, and wherein said language model weight control unit determines whether or not said weight value should be updated, based on said difference when said difference is extracted. 5. The pronunciation variation rule extraction apparatus according to claim 1 , wherein said difference extraction unit extracts as said difference, a pronunciation variation example including a letter string pair of different portions between said recognition result and said base form pronunciation data and the weight value of said sub word language model received from said language model weight control unit by said speech recognition unit at a time of acquisition of said recognition result. | 0.5 |
8,805,083 | 18 | 28 | 18. The method as recited in claim 17 , wherein said simultaneous sparse approximation is of a greedy adaptive decomposition (GAD) type, said candidate spectral components being established within the general dictionary, said candidate spectral components each being defined either as a continuous function or as a discrete vector. | 18. The method as recited in claim 17 , wherein said simultaneous sparse approximation is of a greedy adaptive decomposition (GAD) type, said candidate spectral components being established within the general dictionary, said candidate spectral components each being defined either as a continuous function or as a discrete vector. 28. The method as recited in claim 18 , wherein said discovery processing includes hypothesis testing for adjustably optimizing said core spectral signatures with respect to predetermined statistical criteria. | 0.707283 |
7,631,343 | 1 | 5 | 1. A method for real time transcription of spoken words to a textual format comprising: communicatively coupling a computer aided transcription system to a remote system; identifying, by the remote system, the computer aided transcription system communicatively coupled thereto; communicating, by the remote system, to the computer aided transcription system an authorization for a predetermined amount of transcription; transcribing, by the computer aided transcription system, representations of spoken words to text in real time; disabling, by the computer aided transcription system, the transcribing after the predetermined amount of transcription has been reached; and charging by the remote system a credit card for the predetermined amount of transcription. | 1. A method for real time transcription of spoken words to a textual format comprising: communicatively coupling a computer aided transcription system to a remote system; identifying, by the remote system, the computer aided transcription system communicatively coupled thereto; communicating, by the remote system, to the computer aided transcription system an authorization for a predetermined amount of transcription; transcribing, by the computer aided transcription system, representations of spoken words to text in real time; disabling, by the computer aided transcription system, the transcribing after the predetermined amount of transcription has been reached; and charging by the remote system a credit card for the predetermined amount of transcription. 5. The method of claim 1 further comprising enabling by the computer aided transcription system the transcribing after a payment is made to the remote system. | 0.548571 |
8,554,537 | 19 | 27 | 19. An electronic device comprising: a receiver configured to receive text input in a source language from a user; a processor configured to create source language sub-phonetic units for each word in the text input, convert the source language sub-phonetic units for the each word in the text input to target language sub-phonetic units, retrieve ranking of each of the target language sub-phonetic units from a database, create target language words based on the target language sub-phonetic units and the ranking of the each of the target language sub-phonetic units, and identify candidate target language words performing a reverse transliteration for the created target language words; and a display configured to display the candidate target language words to the user. | 19. An electronic device comprising: a receiver configured to receive text input in a source language from a user; a processor configured to create source language sub-phonetic units for each word in the text input, convert the source language sub-phonetic units for the each word in the text input to target language sub-phonetic units, retrieve ranking of each of the target language sub-phonetic units from a database, create target language words based on the target language sub-phonetic units and the ranking of the each of the target language sub-phonetic units, and identify candidate target language words performing a reverse transliteration for the created target language words; and a display configured to display the candidate target language words to the user. 27. The electronic device of claim 19 , wherein, in order to identify candidate target language words by performing the reverse transliteration, the processor divides the target language words to form transliterated sub-phonetic units, retrieves ranking for each transliterated sub-phonetic unit from the database, forms words in the source language from the each translated sub-phonetic units, and identifies the candidate target language words according to a degree of matching between the formed source language words and the target language words. | 0.5 |
7,889,073 | 13 | 15 | 13. A method for using information in the form of passively collected emotional responses to a media presentation that is made to one or more individuals, comprising the steps of: perceivably exhibiting a media presentation to at least one individual having a profile; passively identifying detectable, emotional, visceral responses of said at least one individual to at least a portion of said media presentation; and identifying any of the type of media presentation that was associated with said responses, the time at which said responses occurred during said media presentation, the location of said media presentation that caused said responses, and a value of said responses for either profiling for or for collecting group responses, said identified value being used for the steps of: associating metadata with individual and group profiles; producing a correlation that reflects a relationship between said at least one individual's emotional responses and at least one portion of said media presentation which contained stimuli that elicited said emotional responses; identifying at least one group having a profile that is similar to the profile of said at least one individual; wherein at least one or more of said portions of said media presentation is perceivably exhibited to said group; wherein the at least one or more of said portions of said media that are perceivably exhibited to said group are selected based upon said correlation between said at least one individual's emotional responses and at least one portion of said media presentation that contained stimuli that elicited said emotional response; and wherein the at least one or more of said portions of said media that are perceivably exhibited to said group are presented to said group with some assurance of a positive reception by said group. | 13. A method for using information in the form of passively collected emotional responses to a media presentation that is made to one or more individuals, comprising the steps of: perceivably exhibiting a media presentation to at least one individual having a profile; passively identifying detectable, emotional, visceral responses of said at least one individual to at least a portion of said media presentation; and identifying any of the type of media presentation that was associated with said responses, the time at which said responses occurred during said media presentation, the location of said media presentation that caused said responses, and a value of said responses for either profiling for or for collecting group responses, said identified value being used for the steps of: associating metadata with individual and group profiles; producing a correlation that reflects a relationship between said at least one individual's emotional responses and at least one portion of said media presentation which contained stimuli that elicited said emotional responses; identifying at least one group having a profile that is similar to the profile of said at least one individual; wherein at least one or more of said portions of said media presentation is perceivably exhibited to said group; wherein the at least one or more of said portions of said media that are perceivably exhibited to said group are selected based upon said correlation between said at least one individual's emotional responses and at least one portion of said media presentation that contained stimuli that elicited said emotional response; and wherein the at least one or more of said portions of said media that are perceivably exhibited to said group are presented to said group with some assurance of a positive reception by said group. 15. The method of claim 13 , said identified value being used to collect a group response for the step of: identifying media presentations or portions of media presentations of particular merit. | 0.845541 |
9,152,702 | 13 | 14 | 13. A system having at least one processor, storage, and a communication platform connected to a network for providing a response to a search query, the system comprising: a search provider implemented on the at least one processor and operative to: receive a search query from a user; generate a search result set that comprises a plurality of search results with respect to a plurality of facets of the search query, each of the plurality of search results having a respective ranking; identify a number of facets to be selected from the plurality of facets based on a probability distribution that a given search result in the search result set is a search result desired by the user for the search query; obtain a model constructed based on the probability distribution and expected reduction of effort made by the user to reach the search result desired by the user given that the plurality of facets are shown to the user; select the number of facets from the plurality of facets, wherein each of the selected number of facets is associated with a maximum incremental value of the expected reduction of effort in accordance with the model; and provide the selected number of facets in response to the search query. | 13. A system having at least one processor, storage, and a communication platform connected to a network for providing a response to a search query, the system comprising: a search provider implemented on the at least one processor and operative to: receive a search query from a user; generate a search result set that comprises a plurality of search results with respect to a plurality of facets of the search query, each of the plurality of search results having a respective ranking; identify a number of facets to be selected from the plurality of facets based on a probability distribution that a given search result in the search result set is a search result desired by the user for the search query; obtain a model constructed based on the probability distribution and expected reduction of effort made by the user to reach the search result desired by the user given that the plurality of facets are shown to the user; select the number of facets from the plurality of facets, wherein each of the selected number of facets is associated with a maximum incremental value of the expected reduction of effort in accordance with the model; and provide the selected number of facets in response to the search query. 14. The system of claim 13 , wherein the identified number is based on a pre-computed value. | 0.806723 |
4,632,578 | 8 | 9 | 8. The method for translating a plurality of shorthand strokes, generated according to a preselected shorthand system, to text, comprising the steps of: (a) storing a dictionary of a preselected shorthand system in a computer, said shorthand system comprising the utilization of distinct parameter strokes to represent each homonym, thereby distinguishing a desired word from its homonym, and distinct parameter strokes to represent prefixes and suffixes, so that said distinct parameter strokes have an unambiguous text translation, at least some of the distinct parameter strokes being predefined as pointers; (b) then producing a computer readable record in accordance with said preselected shorthand system; (c) then applying the computer readable record to the computer for translating such shorthand strokes of said record, the step of applying the record to the computer comprising the steps of: (1) comparing the record against the dictionary to identify portions of the record corresponding to said predefined pointers to thereby locate the predefined pointers in the record; (2) using the located pointers in the record to locate beginnings of words not represented by distinct parameter strokes, said word beginnings being defined to be the portion of the record immediately following the location of the located pointers; (3) comparing a selected sequence of shorthand strokes starting with the first shorthand stroke immediately following the pointer, against the dictionary for locating an unambiguous match, the first located unambiguous match defining a translatable portion of the record and further defining a next pointer; and (4) repeating steps (2) and (3) for each pointer so defined which has an untranslated portion of the record which follows immediately thereafter to define additional pointers until all of said pointers have been located and defined. | 8. The method for translating a plurality of shorthand strokes, generated according to a preselected shorthand system, to text, comprising the steps of: (a) storing a dictionary of a preselected shorthand system in a computer, said shorthand system comprising the utilization of distinct parameter strokes to represent each homonym, thereby distinguishing a desired word from its homonym, and distinct parameter strokes to represent prefixes and suffixes, so that said distinct parameter strokes have an unambiguous text translation, at least some of the distinct parameter strokes being predefined as pointers; (b) then producing a computer readable record in accordance with said preselected shorthand system; (c) then applying the computer readable record to the computer for translating such shorthand strokes of said record, the step of applying the record to the computer comprising the steps of: (1) comparing the record against the dictionary to identify portions of the record corresponding to said predefined pointers to thereby locate the predefined pointers in the record; (2) using the located pointers in the record to locate beginnings of words not represented by distinct parameter strokes, said word beginnings being defined to be the portion of the record immediately following the location of the located pointers; (3) comparing a selected sequence of shorthand strokes starting with the first shorthand stroke immediately following the pointer, against the dictionary for locating an unambiguous match, the first located unambiguous match defining a translatable portion of the record and further defining a next pointer; and (4) repeating steps (2) and (3) for each pointer so defined which has an untranslated portion of the record which follows immediately thereafter to define additional pointers until all of said pointers have been located and defined. 9. The method of claim 8 further comprising the steps of: applying the record to a modem so that said record is encoded for operating a computerized typersetter; then transmitting said encoded record to a computerized typesetter associated with a printer so that the type of the printer is set in accordance with the encoded record. | 0.543956 |
9,679,018 | 2 | 3 | 2. The method of claim 1 , further comprising ranking the set of documents that are responsive to the request for one or more documents, wherein the at least one document is ranked based at least in part on the respective generated score. | 2. The method of claim 1 , further comprising ranking the set of documents that are responsive to the request for one or more documents, wherein the at least one document is ranked based at least in part on the respective generated score. 3. The method of claim 2 , further comprising transmitting information associated with one or more of the ranked documents to the user. | 0.5 |
8,554,539 | 13 | 14 | 13. The morpheme analyzer of claim 12 , wherein the additional information comprises category information and address information associated with the morpheme analysis target. | 13. The morpheme analyzer of claim 12 , wherein the additional information comprises category information and address information associated with the morpheme analysis target. 14. The morpheme analyzer of claim 13 , wherein the plural key creator comprises: a first key creator configured to create a first key by analyzing a morpheme of the category information; and a second key creator configured to create a second key by analyzing a morpheme of the address information. | 0.5 |
8,756,229 | 1 | 25 | 1. An apparatus for information retrieval, comprising: a computer system including a computer processor being programmed to receive a query from a remotely located user system via a network, the query specifying one or more numerical data constraints, and contextual constraints; said computer system including a memory storing a computer-searchable electronic index, the index comprising a plurality of entries, each of the index entries representing an item of numerical data extracted from at least one of a plurality of electronic source documents including one or more natural language documents, wherein the item of numerical data comprises a numerical value, a prefix corresponding to a degree of significant digits, and a unit of measure; said computer system processor being further programmed to determine the relevancy of the query to each of one or more of the index entries based at least partly on a comparison between the numerical data constraint and the index entry's item of numerical data, at least partly on a comparison between the contextual constraint and contextual information extracted from the corresponding source document from which the index entry's item of numerical data was extracted, and at least partly on an evaluation of at least one positional relationship between the index entry's item of numerical data and the contextual information within a given source document, and generate a response to the query based on the relevancy. | 1. An apparatus for information retrieval, comprising: a computer system including a computer processor being programmed to receive a query from a remotely located user system via a network, the query specifying one or more numerical data constraints, and contextual constraints; said computer system including a memory storing a computer-searchable electronic index, the index comprising a plurality of entries, each of the index entries representing an item of numerical data extracted from at least one of a plurality of electronic source documents including one or more natural language documents, wherein the item of numerical data comprises a numerical value, a prefix corresponding to a degree of significant digits, and a unit of measure; said computer system processor being further programmed to determine the relevancy of the query to each of one or more of the index entries based at least partly on a comparison between the numerical data constraint and the index entry's item of numerical data, at least partly on a comparison between the contextual constraint and contextual information extracted from the corresponding source document from which the index entry's item of numerical data was extracted, and at least partly on an evaluation of at least one positional relationship between the index entry's item of numerical data and the contextual information within a given source document, and generate a response to the query based on the relevancy. 25. The information retrieval apparatus of claim 1 , wherein the computer system programmed to determine relevancy is further programmed to perform Latent Semantic Analysis on at least some of the items of numerical data and the contextual information extracted from the source documents. | 0.682819 |
10,048,842 | 11 | 17 | 11. The computer-implemented method of claim 10 , comprising: providing another item for output at a third location on the proximity-sensitive display; determining a confidence value that reflects the mapping engine's confidence that the other item accurately represents another input; wherein determining whether the touch received through the proximity-sensitive display represents a selection of the item based at least on (i) the confidence value that reflects the mapping engine's confidence that the item is an accurate representation of the input, (ii) the first location of the item on the proximity-sensitive display, and (iii) the second location of the touch on the proximity-sensitive display, comprises determining whether the touch received through the proximity-sensitive display represents a selection of the item based at least on (i) the confidence value that reflects the mapping engine's confidence that the item is an accurate representation of the input, (ii) the first location of the item on the proximity-sensitive display, (iii) the second location of the touch on the proximity-sensitive display, (iv) the confidence value that reflects the mapping engine's confidence that the other item is an accurate representation of the other input, and (v) the third location of the other item on the proximity-sensitive display. | 11. The computer-implemented method of claim 10 , comprising: providing another item for output at a third location on the proximity-sensitive display; determining a confidence value that reflects the mapping engine's confidence that the other item accurately represents another input; wherein determining whether the touch received through the proximity-sensitive display represents a selection of the item based at least on (i) the confidence value that reflects the mapping engine's confidence that the item is an accurate representation of the input, (ii) the first location of the item on the proximity-sensitive display, and (iii) the second location of the touch on the proximity-sensitive display, comprises determining whether the touch received through the proximity-sensitive display represents a selection of the item based at least on (i) the confidence value that reflects the mapping engine's confidence that the item is an accurate representation of the input, (ii) the first location of the item on the proximity-sensitive display, (iii) the second location of the touch on the proximity-sensitive display, (iv) the confidence value that reflects the mapping engine's confidence that the other item is an accurate representation of the other input, and (v) the third location of the other item on the proximity-sensitive display. 17. The storage device of claim 11 , wherein the operations further comprise: determining a distance between the first location and the second location; and wherein determining whether the touch received through the proximity-sensitive display represents a selection of the text based at least on (i) the confidence value that reflects the input-to-text engine's confidence that the text is an accurate representation of the input, (ii) the first location of the text object on the proximity-sensitive display, and (iii) the second location of the touch on the proximity-sensitive display, comprises determining whether the touch received through the proximity-sensitive display represents a selection of the text based at least on (i) the confidence value that reflects the input-to-text engine's confidence that the text is an accurate representation of the input, (ii) the distance between the first location and the second location. | 0.5 |
7,529,763 | 6 | 7 | 6. A computer-implemented method for providing an application appropriate rendering to an application development environment, the application appropriate rendering provided via a dynamic client architecture platform hosted by a computing device, the dynamic client architecture platform used to create applications in response to a user-submitted programmatic request, the method comprising: defining an application framework with the dynamic client architecture platform, the application framework created using a plurality of elements selected from a configuration repository, at least one of the plurality of elements associated with a role category of a user, the application framework elements being development language-neutral; storing the application framework; receiving via the dynamic client architecture platform a request for an application appropriate rendering from a user; and generating the application appropriate rendering using the application framework and a rendering subsystem, the application appropriate rendering generated based on a role category of the user requesting the application appropriate rendering, the rendering subsystem selected based on a programmatic examination of the request by the dynamic client architecture platform. | 6. A computer-implemented method for providing an application appropriate rendering to an application development environment, the application appropriate rendering provided via a dynamic client architecture platform hosted by a computing device, the dynamic client architecture platform used to create applications in response to a user-submitted programmatic request, the method comprising: defining an application framework with the dynamic client architecture platform, the application framework created using a plurality of elements selected from a configuration repository, at least one of the plurality of elements associated with a role category of a user, the application framework elements being development language-neutral; storing the application framework; receiving via the dynamic client architecture platform a request for an application appropriate rendering from a user; and generating the application appropriate rendering using the application framework and a rendering subsystem, the application appropriate rendering generated based on a role category of the user requesting the application appropriate rendering, the rendering subsystem selected based on a programmatic examination of the request by the dynamic client architecture platform. 7. The method of claim 6 , further comprising: receiving a request from a requesting device for the application appropriate rendering in a specific development language; retrieving data with a data acquisition and manipulation subsystem; and creating the application appropriate rendering in the specific development language using the retrieved data. | 0.5 |
8,862,566 | 16 | 17 | 16. A system comprising: a non-transitory computer-readable medium configured to store instructions providing a search engine; a processor configured to execute the instructions stored in the non-transitory computer-readable medium to execute the search engine by performing operations comprising: receiving a request to access target data, wherein the target data is stored in at least one of a plurality of data sources, each of the plurality of data sources having a respective candidate index; accessing, by the search engine, a plurality of general indices, wherein each of the plurality of general indices comprises a respective index of relationships between data from at least two of the plurality of data sources; extracting a plurality of inquiry parameters from the request, wherein each of the extracted plurality of inquiry parameters corresponds to a respective sub-index from the plurality of general indices, wherein each sub-index from the plurality of general indices comprises a respective subset of at least one respective general index from the plurality of general indices; performing parallel searches of the plurality of general indices, wherein each parallel search comprises searching a respective sub-index from the plurality of general indices based on a respective inquiry parameter from the extracted plurality of inquiry parameters that corresponds to the respective sub-index; performing additional parallel searches of the candidate indices for the plurality of data sources based on the extracted plurality of inquiry parameters and at least one additional inquiry parameter obtained from the parallel searches of the plurality of general indices; and extracting an output based on results returned from the additional parallel searches of the candidate indices. | 16. A system comprising: a non-transitory computer-readable medium configured to store instructions providing a search engine; a processor configured to execute the instructions stored in the non-transitory computer-readable medium to execute the search engine by performing operations comprising: receiving a request to access target data, wherein the target data is stored in at least one of a plurality of data sources, each of the plurality of data sources having a respective candidate index; accessing, by the search engine, a plurality of general indices, wherein each of the plurality of general indices comprises a respective index of relationships between data from at least two of the plurality of data sources; extracting a plurality of inquiry parameters from the request, wherein each of the extracted plurality of inquiry parameters corresponds to a respective sub-index from the plurality of general indices, wherein each sub-index from the plurality of general indices comprises a respective subset of at least one respective general index from the plurality of general indices; performing parallel searches of the plurality of general indices, wherein each parallel search comprises searching a respective sub-index from the plurality of general indices based on a respective inquiry parameter from the extracted plurality of inquiry parameters that corresponds to the respective sub-index; performing additional parallel searches of the candidate indices for the plurality of data sources based on the extracted plurality of inquiry parameters and at least one additional inquiry parameter obtained from the parallel searches of the plurality of general indices; and extracting an output based on results returned from the additional parallel searches of the candidate indices. 17. The system of claim 16 , wherein a first data source of the plurality of data sources comprises structured data and wherein a second data source of the plurality of data sources comprises unstructured data. | 0.690265 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.