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
1
|
|---|---|---|---|---|---|
8,712,850 | 24 | 27 | 24. The method of claim 1 further comprising determining when promotion should occur including evaluating one or more metrics associated with the creative or delivery of the creative. | 24. The method of claim 1 further comprising determining when promotion should occur including evaluating one or more metrics associated with the creative or delivery of the creative. 27. The method of claim 24 wherein one metric relates to an environment associated with the serving of the creative. | 0.949521 |
7,496,687 | 3 | 4 | 3. The system of claim 1 , wherein the webflow is adapted to execute logic to render content for the portal. | 3. The system of claim 1 , wherein the webflow is adapted to execute logic to render content for the portal. 4. The system of claim 3 , wherein the webflow tracks and modifies the portal based upon at least one of information received through the portal, information received from an external service, and information received from the integration framework. | 0.898616 |
8,290,958 | 1 | 5 | 1. A computer-implemented method of identifying, from at least one of a plurality of documents stored in electronic storage, text for inclusion in a new document, the method comprising: issuing a user-specified query for documents in the electronic storage matching at least one parameter specified in the query, wherein the query is specified via at least one user interface; receiving, in response to issuance of the query, at least one document matching the at least one parameter; identifying topical sections in the at least one document; displaying, via the at least one user interface, names of the identified topical sections in the at least one document without displaying the entirety of the text of each of the identified topical sections; associating at least one indicator with each of the identified topical sections, each of the indicators being in either a selected state or a non-selected state; displaying for each of the identified topical sections, the at least one indicator associated with it, each displayed indicator comprising information indicating whether it is in the selected state or the non-selected state; providing, in the at least one user interface, a capability for a user to view text from at least one of the identified topical sections, a capability for the user to select at least one portion of the text of the at least one of the identified topical sections for inclusion in the new document, and a capability for the user to selectively alter the state of each displayed indicator for the identified topical sections; and in response to receiving user input via the at least one user interface indicating that the user has finished altering the states of the displayed indicators, copying into the new document text from each identified topical section for which the at least one displayed indicator associated therewith comprises information indicating it is in the selected state. | 1. A computer-implemented method of identifying, from at least one of a plurality of documents stored in electronic storage, text for inclusion in a new document, the method comprising: issuing a user-specified query for documents in the electronic storage matching at least one parameter specified in the query, wherein the query is specified via at least one user interface; receiving, in response to issuance of the query, at least one document matching the at least one parameter; identifying topical sections in the at least one document; displaying, via the at least one user interface, names of the identified topical sections in the at least one document without displaying the entirety of the text of each of the identified topical sections; associating at least one indicator with each of the identified topical sections, each of the indicators being in either a selected state or a non-selected state; displaying for each of the identified topical sections, the at least one indicator associated with it, each displayed indicator comprising information indicating whether it is in the selected state or the non-selected state; providing, in the at least one user interface, a capability for a user to view text from at least one of the identified topical sections, a capability for the user to select at least one portion of the text of the at least one of the identified topical sections for inclusion in the new document, and a capability for the user to selectively alter the state of each displayed indicator for the identified topical sections; and in response to receiving user input via the at least one user interface indicating that the user has finished altering the states of the displayed indicators, copying into the new document text from each identified topical section for which the at least one displayed indicator associated therewith comprises information indicating it is in the selected state. 5. The method of claim 1 , wherein the at least one parameter specifies a time of creation or a time range of creation. | 0.878323 |
7,917,847 | 10 | 11 | 10. The method according to claim 1 , further comprising: storing information regarding a focus position and a scrolling position in the text browsing mode; and restoring the focus position and the scrolling position, based on the stored information, in a mode in which the definition information is applied. | 10. The method according to claim 1 , further comprising: storing information regarding a focus position and a scrolling position in the text browsing mode; and restoring the focus position and the scrolling position, based on the stored information, in a mode in which the definition information is applied. 11. The method according to claim 10 , wherein the restoring includes: judging whether or not the focus position is within a displaying area defined by the scrolling position; and adjusting the focus position so that the focus position is within the displaying area if it is judged that the focus position is not within the displaying area. | 0.872372 |
7,636,855 | 24 | 26 | 24. A user authentication method, comprising: prompting, by a processor of a secure access control system, a user with multiple, selectable pass-phrases which are formed by selecting one or more pass-phrases from a set of pass-phrases satisfying a rule associated with the user and selecting one or more pass-phrases from a set of pass-phrases that do not satisfy the rule, where the rule associated with the user is determined prior to authentication and is not suggested to the user during authentication; receiving at least one user selection input and recognizing user selection of at least one of the pass-phrases based on the user selection input; making, by the processor of the secure access control system, a match based on biometrics of enrolled users and a user biometric input to yield biometric match result; analyzing, by the processor of the secure access control system, at least one potential user identity based on the match between the pass-phrases in the user selection and the rule associated with the user; recursively prompting, by the processor of the secure access control system, the user with new sets of multiple, selectable pass-phrases randomly assembled from a pass-phrase corpus over multiple dialogue turns; combining, by the processor of the secure access control system, the biometric match results with the selection results from each dialogue turn to yield dialogue turn results; combining, by the processor of the secure access control system, the dialogue turn results over the multiple dialogue turns to form a cumulative result and authorizing the user when the cumulative result exceeds a threshold. | 24. A user authentication method, comprising: prompting, by a processor of a secure access control system, a user with multiple, selectable pass-phrases which are formed by selecting one or more pass-phrases from a set of pass-phrases satisfying a rule associated with the user and selecting one or more pass-phrases from a set of pass-phrases that do not satisfy the rule, where the rule associated with the user is determined prior to authentication and is not suggested to the user during authentication; receiving at least one user selection input and recognizing user selection of at least one of the pass-phrases based on the user selection input; making, by the processor of the secure access control system, a match based on biometrics of enrolled users and a user biometric input to yield biometric match result; analyzing, by the processor of the secure access control system, at least one potential user identity based on the match between the pass-phrases in the user selection and the rule associated with the user; recursively prompting, by the processor of the secure access control system, the user with new sets of multiple, selectable pass-phrases randomly assembled from a pass-phrase corpus over multiple dialogue turns; combining, by the processor of the secure access control system, the biometric match results with the selection results from each dialogue turn to yield dialogue turn results; combining, by the processor of the secure access control system, the dialogue turn results over the multiple dialogue turns to form a cumulative result and authorizing the user when the cumulative result exceeds a threshold. 26. The method of claim 24 , further comprising: determining a user identity based on cumulative results of multiple dialogue turns; recursively assembling new pass-phrases; and prompting the user until the user identity is determined. | 0.898881 |
4,099,230 | 1 | 8 | 1. In a programmed digital computer, apparatus for loading a program into a memory in a manner to be location independent so that each segment of the program may be selectively accessed for modification or debugging without affecting the balance of the program, wherein each given program segment is identified by a program segment label comprised of a group of coded digital signals which precedes a plurality of instructions that follow said label and that comprise a program segment, comprising a program memory, a source of a plurality of program segments each including a program segment label followed by a plurality of instructions, means for sequentially transferring said plurality of program segments into and out of said program memory, a program counter means for counting storage addresses used in providing to said program memory the addresses for storage and for read out of program labels and instructions from said program memory, a label memory means, wherein each label memory address is represented by a program segment label, label detecting means for detecting when a program segment label has been transferred by said means for transferring said plurality of program segments, control means, responsive to a label being detected by said label detecting means, for loading in said program counter the address at which the first instruction after said detected program label is stored in said program memory, and for addressing said label memory means with the detected program segment label, and means responsive to said label detecting means and said control means for storing said loaded address in said label memory means at an address represented by said detected program segment label, whereby a program segment can be selectively read out for modification or debugging by addressing said label memory means with a programmed segment label to obtain the address in said program memory of the first instruction of the program segment. | 1. In a programmed digital computer, apparatus for loading a program into a memory in a manner to be location independent so that each segment of the program may be selectively accessed for modification or debugging without affecting the balance of the program, wherein each given program segment is identified by a program segment label comprised of a group of coded digital signals which precedes a plurality of instructions that follow said label and that comprise a program segment, comprising a program memory, a source of a plurality of program segments each including a program segment label followed by a plurality of instructions, means for sequentially transferring said plurality of program segments into and out of said program memory, a program counter means for counting storage addresses used in providing to said program memory the addresses for storage and for read out of program labels and instructions from said program memory, a label memory means, wherein each label memory address is represented by a program segment label, label detecting means for detecting when a program segment label has been transferred by said means for transferring said plurality of program segments, control means, responsive to a label being detected by said label detecting means, for loading in said program counter the address at which the first instruction after said detected program label is stored in said program memory, and for addressing said label memory means with the detected program segment label, and means responsive to said label detecting means and said control means for storing said loaded address in said label memory means at an address represented by said detected program segment label, whereby a program segment can be selectively read out for modification or debugging by addressing said label memory means with a programmed segment label to obtain the address in said program memory of the first instruction of the program segment. 8. Apparatus as recited in claim 1, wherein said computer is in an execute instruction mode and there is stored in said program memory an IF instruction and its associated label, and an associated condition followed by a first sequence of instructions, followed by an ELSEIF instruction followed by a second sequence of instructions, followed by an ELSE instruction, followed by a third sequence of instructions followed by an ENDIF instruction, wherein said ELSEIF has associated an alternative condition to the one associated with the IF label and said ELSE instruction immediately procedes the location of the first of the instructions which the computer should execute in the event that the conditions associated with IF and ELSEIF are not met, said apparatus comprising means for activating said program memory to read instructions stored therein from addresses provided by said program counter, means activated when an IF instruction and its associated label is read out of said program memory for detecting the condition associated with said IF instruction, a label stack memory means, means for activating said label memory means to store said IF label and the condition of data in said computer at the time said IF instruction is read out of said program memory, means for comparing said condition of data stored in said label stack memory means with the condition associated with said IF instruction and producing a first output when they are identical and a second output when they are not identical, means responsive to said first output to enable said computer to execute the instructions read out of said program memory between said IF instruction and said ELSEIF instruction, means, responsive to said ELSEIF being read out of said program memory, when said computer has executed said first sequence of instructions to read said IF label out of said label stack memory means and to apply it as an address to said label memory means, means responsive to the application of the IF label as an address to said label memory means, to read into said program counter means the address stored therein whereby the next instruction read from said program memory means is the one following ENDIF, means responsive to said second output to prevent said computer from executing any instructions until the ELSEIF Instruction and associated condition is read from said program memory, means activated when an ELSEIF instruction and associated condition is read from said program memory to compare the condition of data stored in said label stack memory means with the condition associated with said ELSEIF and producing a third output when they are identical and a fourth output when they are not identical, means responsive to said third output to enable said computer to execute instructions read out from said program memory between ELSEIF and ELSE, means responsive to the read out of ELSE from said program memory when said computer has executed the instructions immediately proceeding it for reading said IF label out of said label stack memory means and applying it as an address to said label memory means, means responsive to said label memory means being addressed by said IF label to enable said label memory means to read into said program counter means the address stored therein whereby the next instruction read out of said program memory means is the one following ENDIF, means responsive to said fourth output to prevent said computer from executing any instructions read from said program counter until an ELSE instruction is read from said program counter, and means responsive to said ELSE instruction, when said computer has not executed the instructions immediately proceeding it, to enable said computer to execute instructions read from said program memory means between said ELSE and said ENDIF. | 0.500131 |
7,617,232 | 23 | 24 | 23. One or more computer storage media having computer-executable components for developing terminology for use within an organization, said computer storage media comprising: a memory component for storing terminology data related to the organization; an interface component for receiving data representing a term for building a glossary of terms from a user and for receiving data representing a project to be associated with the term in the organization from the user, said term being used in association with the one or more projects and being associated with at least a definition included in the terminology data stored in the memory area; and a developing component for linking the received data representing the term with the received data representing the project in the memory component, for automatically extracting the definition associated with the term from the terminology data in the memory area, and for automatically generating a glossary for the project, said generated glossary including the term having the extracted definition linked to the one or more projects from the user, wherein a relationship is defined between the received data representing the term and the received data representing the one or more projects in the terminology data, said relationship defining at least one of the following: a project may include zero to many terms, a term may appear in zero to many projects, and a term may not appear in the same project more than once. | 23. One or more computer storage media having computer-executable components for developing terminology for use within an organization, said computer storage media comprising: a memory component for storing terminology data related to the organization; an interface component for receiving data representing a term for building a glossary of terms from a user and for receiving data representing a project to be associated with the term in the organization from the user, said term being used in association with the one or more projects and being associated with at least a definition included in the terminology data stored in the memory area; and a developing component for linking the received data representing the term with the received data representing the project in the memory component, for automatically extracting the definition associated with the term from the terminology data in the memory area, and for automatically generating a glossary for the project, said generated glossary including the term having the extracted definition linked to the one or more projects from the user, wherein a relationship is defined between the received data representing the term and the received data representing the one or more projects in the terminology data, said relationship defining at least one of the following: a project may include zero to many terms, a term may appear in zero to many projects, and a term may not appear in the same project more than once. 24. The computer storage media of claim 23 wherein the interface component is configured to receive data representing a definition of the term, and wherein the developing component is configured to associate the definition with the term. | 0.719194 |
10,152,209 | 4 | 8 | 4. The computer usable program product of claim 1 , further comprising: computer usable code for analyzing a user preference, wherein the user preference is used in a second threshold number of data in the first subset; computer usable code for concluding, for the first area in each data in the subset, that the user preference causes the sensitivity to reduce to below the level of sensitivity; and computer usable code for constructing, responsive to the concluding, a second instruction for the UI design tool, the second instruction causing the UI design tool to move a UI element in the future UI design to a second area when the future UI design is used with the user preference. | 4. The computer usable program product of claim 1 , further comprising: computer usable code for analyzing a user preference, wherein the user preference is used in a second threshold number of data in the first subset; computer usable code for concluding, for the first area in each data in the subset, that the user preference causes the sensitivity to reduce to below the level of sensitivity; and computer usable code for constructing, responsive to the concluding, a second instruction for the UI design tool, the second instruction causing the UI design tool to move a UI element in the future UI design to a second area when the future UI design is used with the user preference. 8. The computer usable program product of claim 4 , wherein the user preference is a language preference of a user of the future UI design. | 0.960823 |
8,175,333 | 17 | 19 | 17. A system comprising, a video input source configured to provide a sequence of video frames, each depicting a scene; a processor; and a memory containing a computer vision engine, which when executed by the processor is configured to perform an operation for analyzing an object being tracked in a sequence of video frames, the operation comprising: receiving a representation of the tracked object, as depicted by a current video frame, of the sequence of video frames, evaluating the representation of the tracked object using at least a first classifier and a second classifier, wherein the first classifier is configured to determine a first classification score indicating whether the tracked object depicts an instance of a first classification type, and wherein the second classifier is configured to determine a second classification score indicating whether the tracked object depicts an instance of a second classification type, adding the first classification score to a first rolling average, wherein the first rolling average provides an average of the first classification score determined for the tracked object for each of a specified number of previous video frames, of the plurality of video frames, adding the second classification score to a second rolling average, wherein the second rolling average provides an average of the second classification score determined for the tracked object for each of a specified number of previous video frames, of the plurality of video frames, wherein the final classification value is determined from the first rolling average and the second rolling average, determining a final classification value for the tracked object in the current video frame, based on the first and second rolling averages, and passing the final classification value for the tracked objects to a machine learning engine configured to identify patterns of behavior engaged in by the tracked object, based at least in part on the final classification value. | 17. A system comprising, a video input source configured to provide a sequence of video frames, each depicting a scene; a processor; and a memory containing a computer vision engine, which when executed by the processor is configured to perform an operation for analyzing an object being tracked in a sequence of video frames, the operation comprising: receiving a representation of the tracked object, as depicted by a current video frame, of the sequence of video frames, evaluating the representation of the tracked object using at least a first classifier and a second classifier, wherein the first classifier is configured to determine a first classification score indicating whether the tracked object depicts an instance of a first classification type, and wherein the second classifier is configured to determine a second classification score indicating whether the tracked object depicts an instance of a second classification type, adding the first classification score to a first rolling average, wherein the first rolling average provides an average of the first classification score determined for the tracked object for each of a specified number of previous video frames, of the plurality of video frames, adding the second classification score to a second rolling average, wherein the second rolling average provides an average of the second classification score determined for the tracked object for each of a specified number of previous video frames, of the plurality of video frames, wherein the final classification value is determined from the first rolling average and the second rolling average, determining a final classification value for the tracked object in the current video frame, based on the first and second rolling averages, and passing the final classification value for the tracked objects to a machine learning engine configured to identify patterns of behavior engaged in by the tracked object, based at least in part on the final classification value. 19. The system of claim 17 , wherein the final classification value specifies that the tracked object depicts one of a car, a person, an unknown-object, or an other-object, and wherein the classification value of other-object indicates that the tracked object does not depict an instance of either the first classification type or the second classification type. | 0.783234 |
7,672,951 | 7 | 8 | 7. The navigation system according to claim 6 wherein the processor is configured to operate different ones of the intra-document classifiers for different ones of the facets and to automatically identify portions less than all of the documents associated with the text representing the facets. | 7. The navigation system according to claim 6 wherein the processor is configured to operate different ones of the intra-document classifiers for different ones of the facets and to automatically identify portions less than all of the documents associated with the text representing the facets. 8. The navigation system according to claim 7 wherein the processor is further configured to use different intra-document classification gradations for identifying different granularities of document portions associated with the facets. | 0.953415 |
9,998,665 | 10 | 14 | 10. An electronic device, comprising: a display device; two or more cameras; one or more processors; and a memory operatively coupled to the one or more processors, the display device, and the two or more cameras of the device, the memory storing instructions executable by the one or more processors to: obtain contextual data relating to a picture taking context, wherein the picture taking context is associated with a side of the device selected from a first side of the device and a side substantially opposite of the first side of the device and wherein the contextual data is associated with a hand contact position with respect to the device; identify that the contextual data matches to a predetermined picture taking context, wherein the predetermined picture taking context is assigned to a camera from two or more cameras of the device; wherein one of the two or more cameras is disposed on the first side of the device and wherein a second of the two or more cameras is disposed on the side of the device substantially opposite of the first side of the device; activate, automatically without additional user input, the camera assigned to the predetermined picture taking context; determine that the predetermined picture taking context does not match a first camera; thereafter, automatically switch to a second camera; and responsive to switching, display a notification thereof. | 10. An electronic device, comprising: a display device; two or more cameras; one or more processors; and a memory operatively coupled to the one or more processors, the display device, and the two or more cameras of the device, the memory storing instructions executable by the one or more processors to: obtain contextual data relating to a picture taking context, wherein the picture taking context is associated with a side of the device selected from a first side of the device and a side substantially opposite of the first side of the device and wherein the contextual data is associated with a hand contact position with respect to the device; identify that the contextual data matches to a predetermined picture taking context, wherein the predetermined picture taking context is assigned to a camera from two or more cameras of the device; wherein one of the two or more cameras is disposed on the first side of the device and wherein a second of the two or more cameras is disposed on the side of the device substantially opposite of the first side of the device; activate, automatically without additional user input, the camera assigned to the predetermined picture taking context; determine that the predetermined picture taking context does not match a first camera; thereafter, automatically switch to a second camera; and responsive to switching, display a notification thereof. 14. The electronic device of claim 10 , further comprising one or more device sensors, wherein the contextual data includes sensed user-device contact data, device orientation data, and device accelerometer data. | 0.674847 |
8,577,893 | 1 | 11 | 1. A method performed by a device, comprising: identifying a link in a first document, the link being associated with a second document; analyzing a first portion of text to the left of the link in the first document; analyzing a second portion of text to the right of the link in the first document; identifying a first rare word from the text in the first portion, where the first rare word is identified as a rare word based on a frequency of occurrence of the first rare word in a set of documents; identifying a second rare word from the text in the second portion, where the second rare word is identified as a rare word based on a frequency of occurrence of the second rare word in the set of documents; creating a context identifier based only on the first and second rare words; and ranking the second document within a list of search results based on the context identifier. | 1. A method performed by a device, comprising: identifying a link in a first document, the link being associated with a second document; analyzing a first portion of text to the left of the link in the first document; analyzing a second portion of text to the right of the link in the first document; identifying a first rare word from the text in the first portion, where the first rare word is identified as a rare word based on a frequency of occurrence of the first rare word in a set of documents; identifying a second rare word from the text in the second portion, where the second rare word is identified as a rare word based on a frequency of occurrence of the second rare word in the set of documents; creating a context identifier based only on the first and second rare words; and ranking the second document within a list of search results based on the context identifier. 11. The method of claim 1 , where each of the first and second portions comprises a plurality of words. | 0.876202 |
9,159,324 | 1 | 8 | 1. A method for identifying a speaker with a mobile device, the method comprising: capturing, via a microphone on the mobile device, audio data comprising a speech signal; inferring, via the mobile device, a context of a user of the mobile device; identifying, via the mobile device, a social graph based at least partly on the inferred context, the social graph comprising a list of potential speakers; and identifying, via the mobile device, a speaker determined to have vocally contributed to the speech signal, the speaker identification based at least partly on the identified social graph. | 1. A method for identifying a speaker with a mobile device, the method comprising: capturing, via a microphone on the mobile device, audio data comprising a speech signal; inferring, via the mobile device, a context of a user of the mobile device; identifying, via the mobile device, a social graph based at least partly on the inferred context, the social graph comprising a list of potential speakers; and identifying, via the mobile device, a speaker determined to have vocally contributed to the speech signal, the speaker identification based at least partly on the identified social graph. 8. The method of claim 1 , wherein inferring the context of the user is based at least partly on one or more of email data, text message data, calendar data, social networking data and contact list data associated with the mobile device. | 0.689791 |
9,626,368 | 9 | 10 | 9. A computer program product for merging documents comprising: a computer readable storage device having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to: receive an update document and a target document, wherein the update document and target document are document instances of a common document schema; determine whether an item of information in the update document is associated with an eligible path of the document schema in a predefined update table; generate, responsive to affirming that the item of information is associated with the eligible path, a specification of an operation by which the item of information is merged into the target document in compliance with the document schema; and apply the specified operation to the target document to produce an updated document in compliance with the document schema. | 9. A computer program product for merging documents comprising: a computer readable storage device having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to: receive an update document and a target document, wherein the update document and target document are document instances of a common document schema; determine whether an item of information in the update document is associated with an eligible path of the document schema in a predefined update table; generate, responsive to affirming that the item of information is associated with the eligible path, a specification of an operation by which the item of information is merged into the target document in compliance with the document schema; and apply the specified operation to the target document to produce an updated document in compliance with the document schema. 10. The computer program product of claim 9 , wherein the specified operation is a selected one of insertion of a node, deletion of a node, and modification of a value. | 0.876289 |
9,208,440 | 8 | 9 | 8. The method according to claim 7 further comprising building a Laplacian matrix associated with the adjacency matrix and taking a pseudo-inverse of the Laplacian matrix. | 8. The method according to claim 7 further comprising building a Laplacian matrix associated with the adjacency matrix and taking a pseudo-inverse of the Laplacian matrix. 9. The method according to claim 8 further comprising using the pseudo-inverse of the Laplacian matrix to build graph-metrics measuring the connectedness or closeness between the entities in the knowledge base. | 0.920993 |
8,566,351 | 8 | 10 | 8. The Boolean search formula generation apparatus according to claim 1 , further comprising a display unit that displays the search results acquired by the search result acquisition unit, wherein the Boolean search formula generation unit generates the Boolean search formulas for obtaining the search results and displays the Boolean search formulas on the display unit along with the search results. | 8. The Boolean search formula generation apparatus according to claim 1 , further comprising a display unit that displays the search results acquired by the search result acquisition unit, wherein the Boolean search formula generation unit generates the Boolean search formulas for obtaining the search results and displays the Boolean search formulas on the display unit along with the search results. 10. The Boolean search formula generation apparatus according to claim 8 , wherein the Boolean search formula generation unit clusters the search results acquired by the search result acquisition unit, and the display unit displays the search results for each cluster obtained by the clustering. | 0.935477 |
9,305,530 | 5 | 6 | 5. A computer-implemented method, comprising: analyzing audio, using a processor, to extract features from the audio and identify voice segments in the audio where a human voice is present and to identify non-voice segments in proximity to the voice segments based on the extracted features; identifying segmented text associated with the audio, the segmented text having text segments; synchronizing the text segments to the voice segments using the processor; and soliciting group-sourced corrections to correct the synchronizing of the text segments to the voice segments. | 5. A computer-implemented method, comprising: analyzing audio, using a processor, to extract features from the audio and identify voice segments in the audio where a human voice is present and to identify non-voice segments in proximity to the voice segments based on the extracted features; identifying segmented text associated with the audio, the segmented text having text segments; synchronizing the text segments to the voice segments using the processor; and soliciting group-sourced corrections to correct the synchronizing of the text segments to the voice segments. 6. The method of claim 5 , further comprising using machine learning to identify the voice segment by analyzing other classified audio of a same genre or including a similar voice. | 0.868805 |
8,972,395 | 1 | 11 | 1. A computer-implemented method for enabling Internet users to interact with a graphical search interface, the method comprising: receiving, from a user over an electronic network, an initial search parameter to use for a search; receiving, from a search engine database, a plurality of related search parameters to use for the search, based on the received initial search parameter; generating, by a processor, a multi-dimensional search space defined by the received initial search parameter and the plurality of related search parameters; transmitting, for display to the user over the network, a graphical interface projecting the multi-dimensional search space, along with a plurality of user elements corresponding to the received initial search parameter and the plurality of related search parameters by which the user may adjust a weighting of one or more of the received initial search parameter and the plurality of related search parameters by interacting with at least one of the plurality of user elements, wherein the weighting of each of the received initial search parameter and the plurality of related search parameters is calculated based on one or both of (i) a spatial distance between each of the received initial search parameter and the plurality of related search parameters of the perimeter and a radial center of the multi-dimensional search space; and (ii) a spatial distance and an angle between two or more of each of the received initial search parameter and the plurality of related search parameters of the perimeter; and transmitting, for display to the user over the network, a plurality of search results, from the search engine database, automatically updated in real time based on the user-adjusted weighting of at least one of the received initial search parameter and the plurality of related search parameters. | 1. A computer-implemented method for enabling Internet users to interact with a graphical search interface, the method comprising: receiving, from a user over an electronic network, an initial search parameter to use for a search; receiving, from a search engine database, a plurality of related search parameters to use for the search, based on the received initial search parameter; generating, by a processor, a multi-dimensional search space defined by the received initial search parameter and the plurality of related search parameters; transmitting, for display to the user over the network, a graphical interface projecting the multi-dimensional search space, along with a plurality of user elements corresponding to the received initial search parameter and the plurality of related search parameters by which the user may adjust a weighting of one or more of the received initial search parameter and the plurality of related search parameters by interacting with at least one of the plurality of user elements, wherein the weighting of each of the received initial search parameter and the plurality of related search parameters is calculated based on one or both of (i) a spatial distance between each of the received initial search parameter and the plurality of related search parameters of the perimeter and a radial center of the multi-dimensional search space; and (ii) a spatial distance and an angle between two or more of each of the received initial search parameter and the plurality of related search parameters of the perimeter; and transmitting, for display to the user over the network, a plurality of search results, from the search engine database, automatically updated in real time based on the user-adjusted weighting of at least one of the received initial search parameter and the plurality of related search parameters. 11. The computer-implemented method of claim 1 , wherein the multi-dimensional search space has a center representing an optimal search output. | 0.914371 |
7,702,509 | 3 | 4 | 3. The computerized method of claim 1 , wherein the orthographic vector space comprises the vector representation of the out-of-vocabulary word and the orthographic anchors corresponding to in-vocabulary words. | 3. The computerized method of claim 1 , wherein the orthographic vector space comprises the vector representation of the out-of-vocabulary word and the orthographic anchors corresponding to in-vocabulary words. 4. The computerized method of claim 3 , wherein the representation of the out-of-vocabulary word and the orthographic anchors are feature vectors. | 0.922423 |
7,881,924 | 1 | 51 | 1. A method of computer analysis of at least one communication originated from a person comprising: receiving with a computer the at least one communication with each communication being comprised of a group of words originated by the person; processing a text of the received group of words in each of the received at least one communication with a computer to determine a psychological state of the person represented by the text of the group of words in each of the at least one communication; and in response to the determined psychological state, generating with a computer an output communication providing an assessment of risk posed by the determined psychological state of the person represented by the text of the group of words in each of the at least one communication. | 1. A method of computer analysis of at least one communication originated from a person comprising: receiving with a computer the at least one communication with each communication being comprised of a group of words originated by the person; processing a text of the received group of words in each of the received at least one communication with a computer to determine a psychological state of the person represented by the text of the group of words in each of the at least one communication; and in response to the determined psychological state, generating with a computer an output communication providing an assessment of risk posed by the determined psychological state of the person represented by the text of the group of words in each of the at least one communication. 51. A method in accordance with claim 1 wherein: the at least one communication is collected by an organization to which the person affiliated; and the output communication is present on a system of organization. | 0.664557 |
5,404,528 | 18 | 24 | 18. A computer--implemented method for scripting exported application program functions comprising the steps of: forming an initialization file that includes a dynamic link library list for an entry point to the exported application program function; instantiating a script interpreter, the script interpreter being responsive to a trigger event to trigger an attached script; attaching a script to the script interpreter, the script defining a script event by which the script is triggered, the script further including script commands including commands to execute the exported application program function; indexing into the script interpreter a correlation list of attached scripts and script events by which the attached scripts are triggered; executing the application program to detect a trigger event and providing the script interpreter with the detected trigger event; and executing the script interpreter in response to a detected trigger event, said executing step including the step of interpreting the script commands in the attached script that corresponds to the trigger event listed in the correlation list of attached scripts, said interpreting step including the step of executing the exported application program function based on the entry point listed in the dynamic link library in response to interpreting a script command to execute the exported application program function. | 18. A computer--implemented method for scripting exported application program functions comprising the steps of: forming an initialization file that includes a dynamic link library list for an entry point to the exported application program function; instantiating a script interpreter, the script interpreter being responsive to a trigger event to trigger an attached script; attaching a script to the script interpreter, the script defining a script event by which the script is triggered, the script further including script commands including commands to execute the exported application program function; indexing into the script interpreter a correlation list of attached scripts and script events by which the attached scripts are triggered; executing the application program to detect a trigger event and providing the script interpreter with the detected trigger event; and executing the script interpreter in response to a detected trigger event, said executing step including the step of interpreting the script commands in the attached script that corresponds to the trigger event listed in the correlation list of attached scripts, said interpreting step including the step of executing the exported application program function based on the entry point listed in the dynamic link library in response to interpreting a script command to execute the exported application program function. 24. A method according to claim 18, wherein said initialization file forming step includes the step of forming an initialization file to entry points for a function exported from a second application program. | 0.6 |
6,070,007 | 3 | 4 | 3. The method of claim 1, further comprising: when the current selection is the selection of the computational construct representing the terminal operand in the right selection mode and the user inputs a second indicator, setting the current selection to the selection of the computational construct representing the terminal operand in the tree selection mode; and when the current selection is the selection of the computational construct representing the terminal operand in the tree selection mode and the user inputs the second indicator, setting the current selection to the selection of the computational construct representing the terminal operand in the left selection mode. | 3. The method of claim 1, further comprising: when the current selection is the selection of the computational construct representing the terminal operand in the right selection mode and the user inputs a second indicator, setting the current selection to the selection of the computational construct representing the terminal operand in the tree selection mode; and when the current selection is the selection of the computational construct representing the terminal operand in the tree selection mode and the user inputs the second indicator, setting the current selection to the selection of the computational construct representing the terminal operand in the left selection mode. 4. The method of claim 3 wherein the first indicator is a tab and the second indicator is a shift-tab. | 0.983758 |
9,477,755 | 5 | 9 | 5. A computer program product comprising: a non-transitory computer readable storage medium; and computer usable code stored on the non-transitory computer readable storage medium, where, if executed by a processor, the computer usable code causes a computer to: determine a user-question affinity value between a user and a question that is to indicate an extent of affinity between the user and the question; determine a user-community affinity value between the user and each of a plurality of candidate social communities that is to indicate an extent of affinity between the user and each of the plurality of candidate social communities, wherein at least one of the plurality of candidate social communities includes a pre-existing online social community having a candidate member that is to proactively establish a relationship with another candidate member and is to form a group of candidate members that are to interact with each other; and determine a question-community affinity value between the question and each of the plurality of candidate social communities based on the user-question affinity value and the user-community affinity value to identify one or more relevant social communities for the question, wherein the question-community affinity value is to indicate an extent of affinity between the question and each of the plurality of candidate social communities, and wherein the question is to be available to each member of the group of candidate members to respond to the question when it is determined that the pre-existing online social community is to be one of the one or more relevant social communities. | 5. A computer program product comprising: a non-transitory computer readable storage medium; and computer usable code stored on the non-transitory computer readable storage medium, where, if executed by a processor, the computer usable code causes a computer to: determine a user-question affinity value between a user and a question that is to indicate an extent of affinity between the user and the question; determine a user-community affinity value between the user and each of a plurality of candidate social communities that is to indicate an extent of affinity between the user and each of the plurality of candidate social communities, wherein at least one of the plurality of candidate social communities includes a pre-existing online social community having a candidate member that is to proactively establish a relationship with another candidate member and is to form a group of candidate members that are to interact with each other; and determine a question-community affinity value between the question and each of the plurality of candidate social communities based on the user-question affinity value and the user-community affinity value to identify one or more relevant social communities for the question, wherein the question-community affinity value is to indicate an extent of affinity between the question and each of the plurality of candidate social communities, and wherein the question is to be available to each member of the group of candidate members to respond to the question when it is determined that the pre-existing online social community is to be one of the one or more relevant social communities. 9. The computer program product of claim 5 , wherein the computer usable code, if executed, further causes a computer to calculate a running average using a numerical user-question affinity value and a numerical user-community affinity value to determine a numerical question-community affinity value. | 0.783453 |
8,346,620 | 1 | 3 | 1. A method in a computing system for responding to the use of a distinguished rendered document, comprising: receiving, by a computing device, one or more capture indications from a database, wherein each capture indication includes information associated with a previous capture of text from the distinguished rendered document that was performed by a mobile device, and wherein each capture indication includes information identifying a user who has captured text from the distinguished rendered document and information indicating feedback that was provided from the identified user about the distinguished rendered document; and in response to receiving the one or more capture indications, the computing device causing the distinguished rendered document to be republished in a new form that is responsive to the provided feedback. | 1. A method in a computing system for responding to the use of a distinguished rendered document, comprising: receiving, by a computing device, one or more capture indications from a database, wherein each capture indication includes information associated with a previous capture of text from the distinguished rendered document that was performed by a mobile device, and wherein each capture indication includes information identifying a user who has captured text from the distinguished rendered document and information indicating feedback that was provided from the identified user about the distinguished rendered document; and in response to receiving the one or more capture indications, the computing device causing the distinguished rendered document to be republished in a new form that is responsive to the provided feedback. 3. The method of claim 1 , wherein the new form includes a change suggested by an identified user. | 0.936031 |
9,395,880 | 1 | 11 | 1. One or more non-transitory computer storage media storing computer executable instructions which when executed perform a method in a computer system for graphically defining a channel for processing messages, the method comprising: displaying, on a display device, a visual channel editor in which graphical representations of channel nodes can be arranged and interconnected to define a channel; receiving user input to the visual channel editor that creates a plurality of graphical representations of channel nodes in the visual channel editor, the plurality of graphical representations including a graphical representation of a source node and at least one graphical representation of a destination node; receiving user input that selects one of the graphical representations, the selected graphical representation corresponding to a first channel node; in response to the selection of the graphical representation, displaying, on the display device, a node configuration panel that displays one or more user interface controls that the user can manipulate to define configurable parameters for the first channel node, wherein the one or more user interface controls displayed in the node configuration panel include one or more fields that each list a number of predefined types for the first channel node that a user can select, and wherein the first channel node is a source node, and wherein the one or more fields include a source field and a format field, the source field for defining a source of messages to be processed in the channel, and the format field for defining a format for the messages; receiving user input to the one or more user interface controls, the user input defining configurable parameters for the first channel node; and using the user input to the one or more user interface controls to automatically generate one or more scripts to implement functionality specified in the defined configurable parameters on messages that are processed by the first channel node. | 1. One or more non-transitory computer storage media storing computer executable instructions which when executed perform a method in a computer system for graphically defining a channel for processing messages, the method comprising: displaying, on a display device, a visual channel editor in which graphical representations of channel nodes can be arranged and interconnected to define a channel; receiving user input to the visual channel editor that creates a plurality of graphical representations of channel nodes in the visual channel editor, the plurality of graphical representations including a graphical representation of a source node and at least one graphical representation of a destination node; receiving user input that selects one of the graphical representations, the selected graphical representation corresponding to a first channel node; in response to the selection of the graphical representation, displaying, on the display device, a node configuration panel that displays one or more user interface controls that the user can manipulate to define configurable parameters for the first channel node, wherein the one or more user interface controls displayed in the node configuration panel include one or more fields that each list a number of predefined types for the first channel node that a user can select, and wherein the first channel node is a source node, and wherein the one or more fields include a source field and a format field, the source field for defining a source of messages to be processed in the channel, and the format field for defining a format for the messages; receiving user input to the one or more user interface controls, the user input defining configurable parameters for the first channel node; and using the user input to the one or more user interface controls to automatically generate one or more scripts to implement functionality specified in the defined configurable parameters on messages that are processed by the first channel node. 11. The one or more computer storage media of claim 1 , wherein the first channel node is a mapping node, and the predefined types include one or more of change case, custom, date/time, database query, new message, published, replace, standard, substring, table lookup, template, or web service. | 0.63848 |
8,065,286 | 45 | 49 | 45. A method, comprising: presenting a searcher with a query and allowing the searcher to produce search results for the query based on a search conducted by the searcher, selecting an available searcher ranked highest for a highest ranking keyword of the query as the highest ranking searcher; selecting an available searcher ranked highest as a generalist searcher as the highest ranking searcher when determining that a searcher is not available for any keywords of the query; providing the query to the highest ranking searcher; selecting, by the highest ranking searcher, an alternate keyword of the query; selecting another searcher ranked highest for the alternate keyword as the searcher; providing the search results using a resource associated with a subject matter of the query by the searcher, the searcher reviewing the search results prior to delivery and selecting a result considered optimal for the query from among said search results and the searcher ranking the search results based on relevance to the query; increasing the ranking of the alternate keyword relative to the highest ranking keyword in a future query; and rewarding the searcher for accepted search results. | 45. A method, comprising: presenting a searcher with a query and allowing the searcher to produce search results for the query based on a search conducted by the searcher, selecting an available searcher ranked highest for a highest ranking keyword of the query as the highest ranking searcher; selecting an available searcher ranked highest as a generalist searcher as the highest ranking searcher when determining that a searcher is not available for any keywords of the query; providing the query to the highest ranking searcher; selecting, by the highest ranking searcher, an alternate keyword of the query; selecting another searcher ranked highest for the alternate keyword as the searcher; providing the search results using a resource associated with a subject matter of the query by the searcher, the searcher reviewing the search results prior to delivery and selecting a result considered optimal for the query from among said search results and the searcher ranking the search results based on relevance to the query; increasing the ranking of the alternate keyword relative to the highest ranking keyword in a future query; and rewarding the searcher for accepted search results. 49. The method as recited in claim 45 , wherein a searcher ranking is lowered responsive to non-accepted results. | 0.517094 |
9,471,672 | 1 | 3 | 1. A computer-implemented method of sorting a set of records comprising a list of responsive documents returned by a search, said search including a step of performing a query, said method comprising the steps of: for each record in said list of responsive documents, collecting, from a citation table, the number of times each said record in said list of responsive documents is referenced by records in another set of records; wherein said another set of records is a set of records contained in a database; sorting said list of responsive documents into an order based upon said number of times each said record of said list of responsive documents is referenced in records of said another set of records; and communicating results of said sorting step, in an order corresponding to the order in which records of said set of records are placed by said sorting step, to a user. | 1. A computer-implemented method of sorting a set of records comprising a list of responsive documents returned by a search, said search including a step of performing a query, said method comprising the steps of: for each record in said list of responsive documents, collecting, from a citation table, the number of times each said record in said list of responsive documents is referenced by records in another set of records; wherein said another set of records is a set of records contained in a database; sorting said list of responsive documents into an order based upon said number of times each said record of said list of responsive documents is referenced in records of said another set of records; and communicating results of said sorting step, in an order corresponding to the order in which records of said set of records are placed by said sorting step, to a user. 3. The method of claim 1 wherein the database and said another set of records are identical. | 0.853503 |
8,543,646 | 20 | 21 | 20. A method to implement an intermediate connected between a resource content publishing device and a subscriber device in a real-time communication for resource content, comprising: receiving, by the intermediate, identification information of a subscriber device from the subscriber device; receiving, by the intermediate, an event topic selected by the subscriber device based on an event topic list, wherein, the identification information comprises path information of a topic path created by the subscriber device for receiving a notification event related to the selected event topic, the event topic selected by the subscriber device is a complex event topic set constituted by at least two separate event topics, and the intermediate device comprises a complex event processing apparatus for processing a complex event; adding the identification information of the subscriber device and the selected event topic to an event topic subscription search table; determining whether an event topic of new resource content obtained by the resource content publishing device belongs to the complex event topic set; creating a complex event by applying a predefined rule describing a relation between the separate events related to the complex event topic set onto the new resource content if it is determined that the event topic of the new resource content belongs to the complex event topic set; obtaining based on the search table, the identification information of the subscriber device subscribing to an event topic related to the new resource content when new resource content is available; and sending a notification event including the event topic and the new resource content to the subscriber device. | 20. A method to implement an intermediate connected between a resource content publishing device and a subscriber device in a real-time communication for resource content, comprising: receiving, by the intermediate, identification information of a subscriber device from the subscriber device; receiving, by the intermediate, an event topic selected by the subscriber device based on an event topic list, wherein, the identification information comprises path information of a topic path created by the subscriber device for receiving a notification event related to the selected event topic, the event topic selected by the subscriber device is a complex event topic set constituted by at least two separate event topics, and the intermediate device comprises a complex event processing apparatus for processing a complex event; adding the identification information of the subscriber device and the selected event topic to an event topic subscription search table; determining whether an event topic of new resource content obtained by the resource content publishing device belongs to the complex event topic set; creating a complex event by applying a predefined rule describing a relation between the separate events related to the complex event topic set onto the new resource content if it is determined that the event topic of the new resource content belongs to the complex event topic set; obtaining based on the search table, the identification information of the subscriber device subscribing to an event topic related to the new resource content when new resource content is available; and sending a notification event including the event topic and the new resource content to the subscriber device. 21. The method according to claim 20 , further comprising: obtaining event change history information from the resource content publishing device; storing the obtained event change history information in a storage, and sending a link to the event change history information to a subscriber device subscribing to the predetermined event topic, in order for the subscriber device to obtain the event change history information via the link. | 0.829306 |
7,570,382 | 1 | 2 | 1. An error detection system for electronic document transfers comprising: means adapted for receiving setup data representative of a user-selected automated electronic document transfer scheme; testing means adapted for testing the setup data against error data representative of selected error conditions associated with document, wherein the setup data includes forwarding data representative of instructions to automatically forward electronic documents to at least one selected destination; the testing means further comprises graph generating means adapted for generating graph data representative of interrelationships between selected destinations as specified in the forwarding data; and means adapted for generating an error signal in accordance with a positive determination of an error condition via the testing means. | 1. An error detection system for electronic document transfers comprising: means adapted for receiving setup data representative of a user-selected automated electronic document transfer scheme; testing means adapted for testing the setup data against error data representative of selected error conditions associated with document, wherein the setup data includes forwarding data representative of instructions to automatically forward electronic documents to at least one selected destination; the testing means further comprises graph generating means adapted for generating graph data representative of interrelationships between selected destinations as specified in the forwarding data; and means adapted for generating an error signal in accordance with a positive determination of an error condition via the testing means. 2. The error detection system for electronic document transfers of claim 1 wherein the forwarding data includes data representative of routing at least one electronic document to at least one of a facsimile, electronic mail, storage, a printing device, and a scanning device. | 0.602601 |
9,980,016 | 13 | 14 | 13. A computer-implemented method comprising: identifying a video; identifying an audio portion of the video; performing speech recognition on the audio portion, using a speech recognizer, to obtain speech recognition data; dividing the video into a plurality of different chapters based on the speech recognition data; identifying a collection of supplemental content items, each supplemental content item comprising content other than the video; for each chapter of the plurality of different chapters, ranking, by a computer processor, the collection of supplemental content items for the chapter based on the speech recognition data corresponding to the chapter, selecting one of the supplemental content items based on the ranking, and assigning the selected supplemental content item to the chapter, wherein the selected supplemental content item supplements video content in the chapter, and rendering the video on a display device; and during rendering of the video, identifying occurrence of rendering each chapter in the video and, for each chapter, synchronizing display of the chapter with an indication of the supplemental content item assigned to the chapter. | 13. A computer-implemented method comprising: identifying a video; identifying an audio portion of the video; performing speech recognition on the audio portion, using a speech recognizer, to obtain speech recognition data; dividing the video into a plurality of different chapters based on the speech recognition data; identifying a collection of supplemental content items, each supplemental content item comprising content other than the video; for each chapter of the plurality of different chapters, ranking, by a computer processor, the collection of supplemental content items for the chapter based on the speech recognition data corresponding to the chapter, selecting one of the supplemental content items based on the ranking, and assigning the selected supplemental content item to the chapter, wherein the selected supplemental content item supplements video content in the chapter, and rendering the video on a display device; and during rendering of the video, identifying occurrence of rendering each chapter in the video and, for each chapter, synchronizing display of the chapter with an indication of the supplemental content item assigned to the chapter. 14. The method of claim 13 , wherein selecting one of the supplemental content items comprises selecting one of the supplemental content items based at least in part on a function that is based on an identity of a speaker identified in the chapter. | 0.713626 |
8,489,635 | 3 | 4 | 3. The method of claim 1 wherein said features comprise a subset of pairs of adjacent alpha-numeric characters. | 3. The method of claim 1 wherein said features comprise a subset of pairs of adjacent alpha-numeric characters. 4. The method of claim 3 wherein said feature measured values and said test values comprise values associated with key latency times between said adjacent alpha-numeric characters. | 0.963942 |
9,659,097 | 1 | 8 | 1. A computer-implemented method comprising: receiving, at a computer system, a request to classify a first query; obtaining, by the computer system, session data for the first query, wherein: the session data for the first query identifies a plurality of sessions in which the first query occurs, each session of the plurality of sessions includes (i) one or more queries submitted in succession by a single respective user for the session and (ii) one or more search entities returned in response to executing the one or more queries, and each search entity of the one or more search entities is assigned one or more classifications; selecting, by the computer system from the session data for the plurality of sessions in which the first query occurs, a first plurality of search entities, wherein the first plurality of search entities are the search entities that frequently occur in the plurality of sessions in response to executing the first query; identifying, by the computer system, one or more potential classifications for the first query; for each potential classification of the one or more potential classifications, determining a first measure of how many of the first plurality of search entities have been assigned the potential classification; determining that the first measure satisfies a classification threshold; and in response to determining that the first measure satisfies the classification threshold, assigning the respective potential classification to the first query; determining that a second query occurs in the same first session with the first query; and assigning the potential classification to the second query. | 1. A computer-implemented method comprising: receiving, at a computer system, a request to classify a first query; obtaining, by the computer system, session data for the first query, wherein: the session data for the first query identifies a plurality of sessions in which the first query occurs, each session of the plurality of sessions includes (i) one or more queries submitted in succession by a single respective user for the session and (ii) one or more search entities returned in response to executing the one or more queries, and each search entity of the one or more search entities is assigned one or more classifications; selecting, by the computer system from the session data for the plurality of sessions in which the first query occurs, a first plurality of search entities, wherein the first plurality of search entities are the search entities that frequently occur in the plurality of sessions in response to executing the first query; identifying, by the computer system, one or more potential classifications for the first query; for each potential classification of the one or more potential classifications, determining a first measure of how many of the first plurality of search entities have been assigned the potential classification; determining that the first measure satisfies a classification threshold; and in response to determining that the first measure satisfies the classification threshold, assigning the respective potential classification to the first query; determining that a second query occurs in the same first session with the first query; and assigning the potential classification to the second query. 8. The method of claim 1 , wherein determining the first measure of how many of the first plurality of search entities have been assigned the potential classification comprises weighting a classification assigned to each of the first plurality of search entities according to user behavior data relative to the first query. | 0.706897 |
8,078,559 | 15 | 16 | 15. The method of claim 13 , wherein processing unstructured data comprises: extracting evidence from unformatted text segments to produce an evidence template; clustering evidence templates as part of an unsupervised clustering algorithm according to characteristics of the evidence, the generated metric comprising an associated density of a cluster of evidence supporting at least one hypothesis in the generated story fragment. | 15. The method of claim 13 , wherein processing unstructured data comprises: extracting evidence from unformatted text segments to produce an evidence template; clustering evidence templates as part of an unsupervised clustering algorithm according to characteristics of the evidence, the generated metric comprising an associated density of a cluster of evidence supporting at least one hypothesis in the generated story fragment. 16. The method of claim 15 , wherein processing unstructured data further comprises computing a link value between two hypotheses, each hypothesis having an associated set of a plurality of evidence templates, with a given evidence template comprising a plurality of text fields describing an event of interest, the link value being computed according to a comparison of the sets of evidence templates associated with the two hypotheses. | 0.848158 |
8,417,691 | 18 | 19 | 18. The system of claim 15 , wherein the operations for combining further comprise: joining a table storing the client information with a table storing the database monitoring information to obtain a table of joined information. | 18. The system of claim 15 , wherein the operations for combining further comprise: joining a table storing the client information with a table storing the database monitoring information to obtain a table of joined information. 19. The system of claim 18 , wherein the operations further comprise: identifying at least one client application that issued the problem query by determining that the problem query is found in one row of the table of the joined information and locating the client application identifier in the one row. | 0.9146 |
9,361,331 | 10 | 15 | 10. A computer based method executed by one or more processors, the method comprising: receiving a search query, which includes at least a first phrase and a second phrase, at a server that is in communication with an index server system storing a plurality of posting lists, at least some of the posting lists being associated with a phrase and including document identifiers for documents containing the phrase, and wherein the document identifiers in at least some posting lists are partitioned based on a relevance score that indicates a respective document's relevance to the phrase of the posting list, such that a first portion of the posting list contains document identifiers of documents with a higher relevance score than documents identified in a second portion of the posting list; responsive to the first phrase having a partitioned posting list and the second phrase having a partitioned posting list, intersecting the first portion of the posting list of the first phrase with the first portion of the posting list of the second phrase; determining that the intersection includes a sufficient result set; and ranking the documents in the result set. | 10. A computer based method executed by one or more processors, the method comprising: receiving a search query, which includes at least a first phrase and a second phrase, at a server that is in communication with an index server system storing a plurality of posting lists, at least some of the posting lists being associated with a phrase and including document identifiers for documents containing the phrase, and wherein the document identifiers in at least some posting lists are partitioned based on a relevance score that indicates a respective document's relevance to the phrase of the posting list, such that a first portion of the posting list contains document identifiers of documents with a higher relevance score than documents identified in a second portion of the posting list; responsive to the first phrase having a partitioned posting list and the second phrase having a partitioned posting list, intersecting the first portion of the posting list of the first phrase with the first portion of the posting list of the second phrase; determining that the intersection includes a sufficient result set; and ranking the documents in the result set. 15. The method of claim 10 , wherein the posting lists are distributed intersection occurs without accessing the second portion of the posting list of the first phrase or the second portion of the posting list of the second phrase. | 0.693634 |
8,321,218 | 1 | 3 | 1. A computerized method of detecting a target word in a speech signal, the method comprising: providing a speech recognition engine and a previously constructed phoneme model; inputting the speech signal into the speech recognition engine; based on the phoneme model, indexing the input speech signal, thereby storing a time-ordered list representing n-best phoneme candidates of the input speech signal and phonemes in a plurality of phoneme frames, wherein n is an integer between two and eight; transcribing the target word into a transcription of target phonemes; searching through said time-ordered list of n-best phoneme candidates for a locus of said target phonemes; while said searching, scoring based on the ranking of the phoneme candidates among the n-best phoneme candidates and based on the number of said target phonemes found, thereby producing a composite score of the probability of an occurrence of the target word; when said composite score is higher than a threshold, outputting start and finish times bounding said locus; inputting said start and finish times into an algorithm adapted for sequence alignment based on dynamic programming; and using said algorithm aligning a first sequence with a second sequence, wherein said first sequence is a portion of said phoneme frames, wherein said portion is based on said start and finish times and wherein said second sequence is said target phonemes. | 1. A computerized method of detecting a target word in a speech signal, the method comprising: providing a speech recognition engine and a previously constructed phoneme model; inputting the speech signal into the speech recognition engine; based on the phoneme model, indexing the input speech signal, thereby storing a time-ordered list representing n-best phoneme candidates of the input speech signal and phonemes in a plurality of phoneme frames, wherein n is an integer between two and eight; transcribing the target word into a transcription of target phonemes; searching through said time-ordered list of n-best phoneme candidates for a locus of said target phonemes; while said searching, scoring based on the ranking of the phoneme candidates among the n-best phoneme candidates and based on the number of said target phonemes found, thereby producing a composite score of the probability of an occurrence of the target word; when said composite score is higher than a threshold, outputting start and finish times bounding said locus; inputting said start and finish times into an algorithm adapted for sequence alignment based on dynamic programming; and using said algorithm aligning a first sequence with a second sequence, wherein said first sequence is a portion of said phoneme frames, wherein said portion is based on said start and finish times and wherein said second sequence is said target phonemes. 3. The method of claim 1 , wherein said phoneme model includes dividing a plurality of phonemes into two or three sub-phonemes and modeling said sub-phonemes acoustically using a plurality of Gaussian parameters based on a mixture model of Gaussian functions and an explicit length dependency. | 0.501701 |
9,992,219 | 1 | 8 | 1. A method, comprising: generating a supply chain graph, the supply chain graph comprising a directed graph representation of a supply chain, wherein the supply chain graph comprises nodes that represent physical or logical locations in the supply chain and edges that represent objects and/or information that are stored and/or transmitted between locations in the supply chain; generating a first attack graph for the supply chain graph, the first attack graph representative of a sequence of attacks potentially performed at nodes of the supply chain graph, the first attack graph comprising data indicative of a first node of the supply chain graph at which the sequence of attacks can be initiated, the first node representative of a first physical or logical location in the supply chain; assigning a difficulty-consequence pair to the first node of the supply chain graph based upon the first attack graph, a difficulty value in the difficulty-consequence pair being based upon a determination of a degree of difficulty to perform an attack at the first node, and a consequence value in the difficulty-consequence pair being based upon a determination of an outcome of the attack occurring at the first node; generating a mitigation to the attack; determining an ability of the mitigation to at least one of increase a level of difficulty for the attack to occur at the first node or reduce the consequence of the attack occurring at the first node; in the event of determining that the mitigation increases the level of difficulty or reduces the consequence of the attack, outputting an indication that the mitigation is applicable at the first node; responsive to determining the ability of the mitigation to at least one of increase a level of difficulty for the attack to occur or reduce the consequence of the attack occurring, updating the supply chain graph based on the mitigation; and generating a second attack graph for the updated supply chain graph, the second attack graph representative of a sequence of attacks potentially performed at nodes of the supply chain graph subsequent to the mitigation being applied to the supply chain. | 1. A method, comprising: generating a supply chain graph, the supply chain graph comprising a directed graph representation of a supply chain, wherein the supply chain graph comprises nodes that represent physical or logical locations in the supply chain and edges that represent objects and/or information that are stored and/or transmitted between locations in the supply chain; generating a first attack graph for the supply chain graph, the first attack graph representative of a sequence of attacks potentially performed at nodes of the supply chain graph, the first attack graph comprising data indicative of a first node of the supply chain graph at which the sequence of attacks can be initiated, the first node representative of a first physical or logical location in the supply chain; assigning a difficulty-consequence pair to the first node of the supply chain graph based upon the first attack graph, a difficulty value in the difficulty-consequence pair being based upon a determination of a degree of difficulty to perform an attack at the first node, and a consequence value in the difficulty-consequence pair being based upon a determination of an outcome of the attack occurring at the first node; generating a mitigation to the attack; determining an ability of the mitigation to at least one of increase a level of difficulty for the attack to occur at the first node or reduce the consequence of the attack occurring at the first node; in the event of determining that the mitigation increases the level of difficulty or reduces the consequence of the attack, outputting an indication that the mitigation is applicable at the first node; responsive to determining the ability of the mitigation to at least one of increase a level of difficulty for the attack to occur or reduce the consequence of the attack occurring, updating the supply chain graph based on the mitigation; and generating a second attack graph for the updated supply chain graph, the second attack graph representative of a sequence of attacks potentially performed at nodes of the supply chain graph subsequent to the mitigation being applied to the supply chain. 8. The method of claim 1 , the method further comprising determining at the first node that a requirement pertaining to an object or information utilized at the first location has been satisfied. | 0.854478 |
4,888,730 | 1 | 5 | 1. A word-processing system having a memory; character, format and control data input to the system through a keyboard with a plurality of alphanumeric and function keys depressible by an operator, and a display; in combination with at least one discrete file of editable text stored within said memory, said file containing a plurality of words, some of said words being identical to previous words in said plurality and others being differentiable relative to previous words therein; a correction buffer in said memory normally storing data entered through said keyboard and held for editing purposes, said correction buffer having a number of storage positions corresponding to a full-page of characters; address means for accessing said storage position in said correction buffer, sequence control means for producing first a cleared state of said correction buffer in response to pressing at least one of said depressible keys after processing each full-page; reading means operable subsequent to producing said cleared state and causing at least a portion of said plurality of words in the file to be read word-by-word, beginning with a first word in said full-page of characters in said correction buffer; writing means likewise responsive to producing said cleared state and operable under control of said address means to store in the correction buffer said first word read by said reading means; a first frequency-of-use count element associated with said first word and located in said correction buffer at a predetermined position relative to said first word stored therein, said writing means concomitantly entering an initial count of unity in said first frequency-of-use count element; means, including an identity output, operable for comparison thereafter of each next word successively read from said file with each word currently stored in said correction buffer, said means for comparison issuing said identity output when said next word is identical to a particular one of said currently stored words upon comparison therewith, and absence of issuance of the identity output after comparison of the next word with all words currently stored in the correction buffer indicating the next word to be a differentiable word, said writing means then storing said differentiable word in said correction buffer in association with a respective frequency-of-use count element located at said predefined position relative to the differentiable word, said writing means concomitantly entering an initial count of unity in said respective frequency-of-use count element; and incrementing means responsive to said identity output, said incrementing means augmenting the count by one in the frequency-of-use count element respectively associated with said particular one of the currently stored words and located at said predefined position relative thereto when said identity output is produced; whereby for each word in the correction buffer a count of the number of times the word is used within the full-page is maintained and a determination may be made as to whether any words stored in the correction buffer are overused. | 1. A word-processing system having a memory; character, format and control data input to the system through a keyboard with a plurality of alphanumeric and function keys depressible by an operator, and a display; in combination with at least one discrete file of editable text stored within said memory, said file containing a plurality of words, some of said words being identical to previous words in said plurality and others being differentiable relative to previous words therein; a correction buffer in said memory normally storing data entered through said keyboard and held for editing purposes, said correction buffer having a number of storage positions corresponding to a full-page of characters; address means for accessing said storage position in said correction buffer, sequence control means for producing first a cleared state of said correction buffer in response to pressing at least one of said depressible keys after processing each full-page; reading means operable subsequent to producing said cleared state and causing at least a portion of said plurality of words in the file to be read word-by-word, beginning with a first word in said full-page of characters in said correction buffer; writing means likewise responsive to producing said cleared state and operable under control of said address means to store in the correction buffer said first word read by said reading means; a first frequency-of-use count element associated with said first word and located in said correction buffer at a predetermined position relative to said first word stored therein, said writing means concomitantly entering an initial count of unity in said first frequency-of-use count element; means, including an identity output, operable for comparison thereafter of each next word successively read from said file with each word currently stored in said correction buffer, said means for comparison issuing said identity output when said next word is identical to a particular one of said currently stored words upon comparison therewith, and absence of issuance of the identity output after comparison of the next word with all words currently stored in the correction buffer indicating the next word to be a differentiable word, said writing means then storing said differentiable word in said correction buffer in association with a respective frequency-of-use count element located at said predefined position relative to the differentiable word, said writing means concomitantly entering an initial count of unity in said respective frequency-of-use count element; and incrementing means responsive to said identity output, said incrementing means augmenting the count by one in the frequency-of-use count element respectively associated with said particular one of the currently stored words and located at said predefined position relative thereto when said identity output is produced; whereby for each word in the correction buffer a count of the number of times the word is used within the full-page is maintained and a determination may be made as to whether any words stored in the correction buffer are overused. 5. The word processing system of claim 1, further including means for clearance of said display, a detector for sensing completion of reading said plurality of words from said file, said detector thereupon issuing a signal; magnitude means determining the relative number of counts in said respective frequency-of-use count elements, including a maximum count, said means for clearance and said magnitude means both operating in response to issuance of said signal, and means for automatically presenting in the cleared display thereafter said maximum count and the word in the correction buffer associated with the frequency-of-use count element containing the maximum count. | 0.606977 |
10,147,122 | 11 | 12 | 11. The method of claim 8 , further comprising: producing, by the first computer system, a measurement of an effect of a second topic on the aggregate of the numerical information related to the set of the evaluations; and including, by the first computer system, the measurement of the effect of the second topic in the file to be transmitted to the second computer system to be used to control the operations performed by the second computer system to produce the modification to the specific product. | 11. The method of claim 8 , further comprising: producing, by the first computer system, a measurement of an effect of a second topic on the aggregate of the numerical information related to the set of the evaluations; and including, by the first computer system, the measurement of the effect of the second topic in the file to be transmitted to the second computer system to be used to control the operations performed by the second computer system to produce the modification to the specific product. 12. The method of claim 11 , wherein the second topic is predefined. | 0.984112 |
9,477,784 | 10 | 15 | 10. A computer having user interface devices including at least a display and a keyboard, and having memory separately storing configuration data and performance metric data of one or more configuration attributes and one or more performance metric data attributes of one or more instances of one or more resource types being monitored, said performance metric data comprising one or more time series of performance metric data numerical values of said one or more performance metric data attributes of said one or more instances of said one or more resource types being monitored, each said numerical value in each said time series of performance metric data numerical values having been converted to a Unicode character, said data organized as a non relational database file system stored in said memory, said computer having a programmable processor coupled to said user interface devices and said memory and under control of one or more computer programs to control said computer, said one or more computer programs structured to control said computer to implement a query definition language having rules of syntax and syntax building blocks, said one or more computer programs structured to control said computer to present a search query user interface where a user can define the start and stop times of a relevant interval and use said syntax building blocks and said rules of syntax to compose a search query defining one or more desired searches of said configuration data and/or said Unicode characters representing said performance metric data numerical values using a regular expression in each search which defines a match or filter condition to be matched or compared with relevant data retrieved from said memory, and wherein said one or more computer programs are structured to control said computer to provide reverse mapping syntax building blocks which a user can use to search said Unicode characters using a number or numerical range in a regular expression matching or filtering criteria, the use of a number or numerical range being made possible in a search because said one or more computer programs are structured to control said computer to convert any such number or numerical range in a regular expression matching or filtering criteria to an equivalent Unicode character or set of Unicode characters which will be used to match or compare to said relevant data comprising Unicode characters when performing said search containing said number or numerical range. | 10. A computer having user interface devices including at least a display and a keyboard, and having memory separately storing configuration data and performance metric data of one or more configuration attributes and one or more performance metric data attributes of one or more instances of one or more resource types being monitored, said performance metric data comprising one or more time series of performance metric data numerical values of said one or more performance metric data attributes of said one or more instances of said one or more resource types being monitored, each said numerical value in each said time series of performance metric data numerical values having been converted to a Unicode character, said data organized as a non relational database file system stored in said memory, said computer having a programmable processor coupled to said user interface devices and said memory and under control of one or more computer programs to control said computer, said one or more computer programs structured to control said computer to implement a query definition language having rules of syntax and syntax building blocks, said one or more computer programs structured to control said computer to present a search query user interface where a user can define the start and stop times of a relevant interval and use said syntax building blocks and said rules of syntax to compose a search query defining one or more desired searches of said configuration data and/or said Unicode characters representing said performance metric data numerical values using a regular expression in each search which defines a match or filter condition to be matched or compared with relevant data retrieved from said memory, and wherein said one or more computer programs are structured to control said computer to provide reverse mapping syntax building blocks which a user can use to search said Unicode characters using a number or numerical range in a regular expression matching or filtering criteria, the use of a number or numerical range being made possible in a search because said one or more computer programs are structured to control said computer to convert any such number or numerical range in a regular expression matching or filtering criteria to an equivalent Unicode character or set of Unicode characters which will be used to match or compare to said relevant data comprising Unicode characters when performing said search containing said number or numerical range. 15. The computer of claim 10 wherein said one or more computer programs are structured to provide syntax building blocks which allow a user to compose a tree search query comprised of a first search at a first level of nesting followed by two or more searches at a next level of nesting which will be executed simultaneously, and wherein said first search specifies a resource type and specifies a configuration attribute or performance metric data attribute whose configuration data or performance metric data gathered during said relevant interval is to be searched and specifies a match or filter condition in a regular expression, and wherein said two or more searches at said next level down each specifies a resource type which is related to said resource type specified by said first search, and wherein each of said two or more searches on said next level of nesting specifies a configuration attribute or performance metric data attribute whose data gathered during said relevant interval is to be searched and a match or filter condition specified in a regular expression, and wherein any of said searches in said tree search query may use said reverse mapping syntax building blocks, and wherein said one or more computer programs are structured to control said computer to execute said first search by retrieving from said non relational database file system relevant data collected during said relevant interval from all instances of said resource type specified in said first search, said relevant data being configuration data or performance metric data from all instances of said resource type specified in said first search of said configuration attribute or said performance metric data attribute specified in said first search and comparing said match or filter condition specified in said regular expression of said first search against said relevant data retrieved from said non relational database file system, and, if said first search contains said reverse mapping syntax building blocks in association with a number or numerical range, converting any number or numerical range associated with a said reverse mapping syntax building block in a match or filter to an equivalent Unicode character representing said number or an equivalent set of Unicode characters representing said numerical range prior to comparison of said match or condition against Unicode characters representing relevant performance metric data numerical values, and returning all instances of said resource type specified in said first search which meet said match or filter condition specified in said regular expression of said first search, and wherein said one or more computer programs are structured to control said computer to simultaneously execute said two or more searches at said next level of nesting by, for said search, retrieving from said non relational database file system relevant configuration attribute data or performance metric attribute data gathered or measured during said relevant interval from said configuration attribute or said performance metric data attribute specified in said search being processed only from instance of said resource type specified in said search being processed which are related to said instances of said resource type specified in said first search which were returned by said first search as having configuration data or performance metric attribute data which meets said filter or matching condition of said first search, and comparing said match or filter condition specified in said regular expression of said search being processed to said retrieved relevant configuration attribute data or performance metric attribute data, and, if said search being processed contains a reverse mapping syntax building block(s) associated with a number or numerical range, prior to said comparison, converting any number or numerical range associated with said reverse mapping syntax building block in said match or filter condition expressed in said regular expression of said search being processed to an equivalent Unicode character or range of Unicode characters, and returning all instances of said related resource type specified in said search being processed which meet said match or filter condition. | 0.667838 |
5,473,443 | 5 | 6 | 5. A video memory according to claim 4, further comprising means for rewriting at least a part of said at least one ancillary data word in a modified form from said recirculating buffer into said video store. | 5. A video memory according to claim 4, further comprising means for rewriting at least a part of said at least one ancillary data word in a modified form from said recirculating buffer into said video store. 6. A video memory according to claim 5, in which said at least one ancillary data word also includes a re-read error flag for indicating whether a repeatedly read one of said input video data blocks contains an error, and further comprising means for copying said error flag in said at least one ancillary data word associated with each said input video data block to said re-read error flag in the at least one ancillary data word, and for setting said error flag in the at least one ancillary data word to an error-indicating state after the associated input video data block is read once. | 0.816801 |
9,424,288 | 15 | 17 | 15. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a process to analyze performance of components of a database cluster by transforming discrete events into a time series to identify dominant signals, the process comprising: sampling a plurality of discrete event measurements of the database cluster to produce a set of timestamped events the database cluster comprising a plurality of nodes that share a shared resource, and the plurality of discrete event measurements obtained from multiple ones of the plurality of nodes; tagging at least one of the timestamped events sampled by one or more hardware components or one or more software components of the database cluster with a semantic tag, wherein tagging the at least one of the timestamped events with the semantic tag comprises assigning a state corresponding to the shared resource of the database cluster, the semantic tag includes at least a first state of waiting for the shared resource and a second state of obtaining access to the shared resource; generating a single magnitude value for a related set of the timestamped events for multiple sessions with respect to the semantic tag for the first state of waiting for the shared resource or the second state of obtaining access to the shared resource by applying a different weighting factors to some or all of the sessions of the timestamped events corresponding to the first and second state to derive the single magnitude value; formatting the set of timestamped events into a time series, wherein a time series entry comprises a time indication and a plurality of values, at least one of the plurality of values corresponding to the single magnitude value generated for the related set of the semantic tag for the multiple sessions in the database cluster; and processing the time series to identify at least one state signal. | 15. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a process to analyze performance of components of a database cluster by transforming discrete events into a time series to identify dominant signals, the process comprising: sampling a plurality of discrete event measurements of the database cluster to produce a set of timestamped events the database cluster comprising a plurality of nodes that share a shared resource, and the plurality of discrete event measurements obtained from multiple ones of the plurality of nodes; tagging at least one of the timestamped events sampled by one or more hardware components or one or more software components of the database cluster with a semantic tag, wherein tagging the at least one of the timestamped events with the semantic tag comprises assigning a state corresponding to the shared resource of the database cluster, the semantic tag includes at least a first state of waiting for the shared resource and a second state of obtaining access to the shared resource; generating a single magnitude value for a related set of the timestamped events for multiple sessions with respect to the semantic tag for the first state of waiting for the shared resource or the second state of obtaining access to the shared resource by applying a different weighting factors to some or all of the sessions of the timestamped events corresponding to the first and second state to derive the single magnitude value; formatting the set of timestamped events into a time series, wherein a time series entry comprises a time indication and a plurality of values, at least one of the plurality of values corresponding to the single magnitude value generated for the related set of the semantic tag for the multiple sessions in the database cluster; and processing the time series to identify at least one state signal. 17. The computer program product of claim 15 , wherein the time series comprises a series of vectors of state values. | 0.925856 |
8,539,359 | 123 | 126 | 123. The machine system of claim 86 wherein the user monitoring subsystem is configured to store recent ones of the report records. | 123. The machine system of claim 86 wherein the user monitoring subsystem is configured to store recent ones of the report records. 126. The machine system of claim 123 wherein the user monitoring subsystem is configured to respond to an externally supplied pull-request signal that includes filtering criteria for selectively identifying those of the stored recent report records that are to be next used for said automatically repeated determinations by the machine system of likely recent focusings of attention by the first user. | 0.959779 |
7,644,377 | 19 | 22 | 19. A computer-readable storage medium that when executed cause a computer to: provide models of corresponding components, wherein the models contain constraints, wherein the models specify a first relationship in which at least one of the components is composed of at least another one of the components, and wherein the models specify a second relationship among components in addition to the first relationship, wherein the second relationship comprises at least one of a reference relationship and an association relationship; input the models into a design tool; and invoke the design tool to generate a configuration of the system that includes the components, wherein the generated configuration satisfies the constraints contained in the models. | 19. A computer-readable storage medium that when executed cause a computer to: provide models of corresponding components, wherein the models contain constraints, wherein the models specify a first relationship in which at least one of the components is composed of at least another one of the components, and wherein the models specify a second relationship among components in addition to the first relationship, wherein the second relationship comprises at least one of a reference relationship and an association relationship; input the models into a design tool; and invoke the design tool to generate a configuration of the system that includes the components, wherein the generated configuration satisfies the constraints contained in the models. 22. The computer-readable storage medium of claim 19 , wherein generating the configuration comprises generating the configuration that includes a combination of the components and settings for the components. | 0.782744 |
9,594,744 | 11 | 15 | 11. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: obtaining a lexicon model that maps phones to spoken text, wherein spoken text includes only words that are spelled out; obtaining a language model that assigns probabilities to written text, wherein written text includes (i) words that are spelled out and (ii) sequences of characters that include abbreviations that are not spelled out words, acronyms that are not spelled out words, and numeric symbols; obtaining grammar rules for expanding written text into spoken text; generating, using the grammar rules, expansions of written text that includes sequences of characters that include abbreviations that are not spelled out words, acronyms that are not spelled out words, and numeric symbols into spoken text that includes only words that are spelled out, the expansions including mappings of multiple different items of written text to a particular item of the spoken text; generating a transducer that includes the expansions, where the transducer maps the written text to the spoken text, the transducer mapping the multiple different items of written text to the particular item of the spoken text; constructing a decoding network for transcribing utterances into written text, by composing the lexicon model, the inverse of the transducer, and the language model; and generating, by an automated speech recognizer, a transcription of a subsequently received utterance into written text using the decoding network. | 11. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: obtaining a lexicon model that maps phones to spoken text, wherein spoken text includes only words that are spelled out; obtaining a language model that assigns probabilities to written text, wherein written text includes (i) words that are spelled out and (ii) sequences of characters that include abbreviations that are not spelled out words, acronyms that are not spelled out words, and numeric symbols; obtaining grammar rules for expanding written text into spoken text; generating, using the grammar rules, expansions of written text that includes sequences of characters that include abbreviations that are not spelled out words, acronyms that are not spelled out words, and numeric symbols into spoken text that includes only words that are spelled out, the expansions including mappings of multiple different items of written text to a particular item of the spoken text; generating a transducer that includes the expansions, where the transducer maps the written text to the spoken text, the transducer mapping the multiple different items of written text to the particular item of the spoken text; constructing a decoding network for transcribing utterances into written text, by composing the lexicon model, the inverse of the transducer, and the language model; and generating, by an automated speech recognizer, a transcription of a subsequently received utterance into written text using the decoding network. 15. The system of claim 11 , wherein obtaining the grammar rules comprises: obtaining the grammar rules from a text-to-speech system. | 0.828608 |
8,768,240 | 17 | 21 | 17. One or more non-transitory processor-readable media storing code representing instructions to cause one or more processors to: arrange a plurality of learning objectives to define a learning objective sequence, each learning objective from the plurality of learning objectives being associated with a content including at least one of a learning object, an assessment or a teaching strategy item; insert a temporal content associated with a temporal event into the learning objective sequence at a position within the learning objective sequence based on a time associated with a presentation of the temporal content to a user; and produce an educational material including the content associated with each learning objective from the plurality of learning objectives and the temporal content, the content and the temporal content arranged to define at least one learning path within the learning objective sequence. | 17. One or more non-transitory processor-readable media storing code representing instructions to cause one or more processors to: arrange a plurality of learning objectives to define a learning objective sequence, each learning objective from the plurality of learning objectives being associated with a content including at least one of a learning object, an assessment or a teaching strategy item; insert a temporal content associated with a temporal event into the learning objective sequence at a position within the learning objective sequence based on a time associated with a presentation of the temporal content to a user; and produce an educational material including the content associated with each learning objective from the plurality of learning objectives and the temporal content, the content and the temporal content arranged to define at least one learning path within the learning objective sequence. 21. The one or more non-transitory processor-readable media of claim 17 , further comprising code representing instructions to cause the one or more processors to: format a portion of the temporal content of the educational material to include a skin associated with the presentation of the temporal content. | 0.85092 |
6,055,551 | 1 | 2 | 1. A method of using a computer network for developing a document, comprising the steps of: pre-loading a preliminary list of topics that need to be included in the document, into a computer network for display during a group meeting; selecting members of a group for participation in a facilitated, automated group meeting; reaching consensus on a working list of topics; inputting to provide the working list in the system; for each topic on the working list, in a group meeting, performing the steps of: inputting commands into a facilitator workstation to use team display means to display the topic simultaneously to a plurality of members of the group; simultaneously inputting text for the topic and comments about the text into multiple member workstations; simultaneously displaying the text and a plurality of the comments entered at other workstations at a plurality of member workstations; reaching consensus on the contents of the text for the topic; and editing to create verified text for the topic; said step of simultaneously inputting comments about the text into multiple member workstations comprises the step of simultaneously inputting comments regarding compliance with a Process Safety Management standard into multiple member workstations, and wherein said step of simultaneously displaying a plurality of the comments entered comprises the step of simultaneously displaying a plurality of the comments about compliance with the Process Safety Management standard. | 1. A method of using a computer network for developing a document, comprising the steps of: pre-loading a preliminary list of topics that need to be included in the document, into a computer network for display during a group meeting; selecting members of a group for participation in a facilitated, automated group meeting; reaching consensus on a working list of topics; inputting to provide the working list in the system; for each topic on the working list, in a group meeting, performing the steps of: inputting commands into a facilitator workstation to use team display means to display the topic simultaneously to a plurality of members of the group; simultaneously inputting text for the topic and comments about the text into multiple member workstations; simultaneously displaying the text and a plurality of the comments entered at other workstations at a plurality of member workstations; reaching consensus on the contents of the text for the topic; and editing to create verified text for the topic; said step of simultaneously inputting comments about the text into multiple member workstations comprises the step of simultaneously inputting comments regarding compliance with a Process Safety Management standard into multiple member workstations, and wherein said step of simultaneously displaying a plurality of the comments entered comprises the step of simultaneously displaying a plurality of the comments about compliance with the Process Safety Management standard. 2. The method of claim 1, further comprising the step of reaching consensus on compliance with the Process Safety Management standard. | 0.840095 |
8,041,119 | 2 | 3 | 2. The method of claim 1 further comprising the step of counting a plurality of numbers of crossing by counting the number of a specific pixel pattern for each of the horizontal coordinates. | 2. The method of claim 1 further comprising the step of counting a plurality of numbers of crossing by counting the number of a specific pixel pattern for each of the horizontal coordinates. 3. The method of claim 2 , wherein the pixel pattern is a bright pixel between two dark pixels. | 0.969707 |
7,590,224 | 27 | 28 | 27. The automated routing system of claim 24 , wherein if the task classifier cannot make a classification decision after the dialog is conducted with the user, the router routes the user's request to a human for assistance. | 27. The automated routing system of claim 24 , wherein if the task classifier cannot make a classification decision after the dialog is conducted with the user, the router routes the user's request to a human for assistance. 28. The automated routing system of claim 27 , wherein the task objective is performed after the user's request is routed. | 0.965692 |
9,817,825 | 2 | 4 | 2. The method of claim 1 , further comprising for at least a phrase of the identified phrases: selectively partitioning the posting list for the phrase into at least a first portion including identifiers of higher ranked documents and a second portion including identifiers of lesser ranked documents, the partitioning being based on a relevance score for a document identified in the posting list indicating the document's relevance to the phrase; storing the first portion in a primary index on the assigned index server; and storing the second portion in a secondary index on the assigned index server. | 2. The method of claim 1 , further comprising for at least a phrase of the identified phrases: selectively partitioning the posting list for the phrase into at least a first portion including identifiers of higher ranked documents and a second portion including identifiers of lesser ranked documents, the partitioning being based on a relevance score for a document identified in the posting list indicating the document's relevance to the phrase; storing the first portion in a primary index on the assigned index server; and storing the second portion in a secondary index on the assigned index server. 4. The method of claim 2 , further comprising storing, for each identifier of a document in the first portion of the posting list, relevance attributes of the document. | 0.910256 |
8,518,086 | 6 | 12 | 6. A spinal rod anchoring system comprising: a rod adapted to extend along a spine of a patient; and a first rod anchor adapted to be fixed to a vertebra of the spine, the first rod anchor comprising: a housing forming a receptacle portion having a substantially concave inner surface; and a sleeve having a passage receiving the rod such that the rod is secured against substantial lateral translation relative to the sleeve while being allowed to slide axially relative to the sleeve through a first pivot point, the sleeve having a substantially convex mating surface adapted to mate with the concave surface of the housing such that the sleeve is able to rotate to change in pitch and yaw relative to the housing while being substantially prevented from changing in roll relative to the housing. | 6. A spinal rod anchoring system comprising: a rod adapted to extend along a spine of a patient; and a first rod anchor adapted to be fixed to a vertebra of the spine, the first rod anchor comprising: a housing forming a receptacle portion having a substantially concave inner surface; and a sleeve having a passage receiving the rod such that the rod is secured against substantial lateral translation relative to the sleeve while being allowed to slide axially relative to the sleeve through a first pivot point, the sleeve having a substantially convex mating surface adapted to mate with the concave surface of the housing such that the sleeve is able to rotate to change in pitch and yaw relative to the housing while being substantially prevented from changing in roll relative to the housing. 12. The system of claim 6 , wherein the passage in the sleeve has a substantially D-shaped cross-section. | 0.901316 |
7,484,204 | 30 | 32 | 30. A machine readable storage medium having instructions stored thereon that when executed by a processor cause a system to: provide a plurality of type repositories, wherein each type repository maintains a hierarchical data structure that contains definitions of one or more types in a type system, wherein a first of the plurality of type repositories defines a first type in a first type system and a second of the plurality of type repositories defines a second type in a second type system; provide a plurality of type repository interfaces, wherein each type repository interface is associated with and provides access to a type repository in the plurality of type repositories and defines a set of services provided by the type repository; and create an object of the first type based on the second type system by creating the object of the first type to manipulate only instances of the second type. | 30. A machine readable storage medium having instructions stored thereon that when executed by a processor cause a system to: provide a plurality of type repositories, wherein each type repository maintains a hierarchical data structure that contains definitions of one or more types in a type system, wherein a first of the plurality of type repositories defines a first type in a first type system and a second of the plurality of type repositories defines a second type in a second type system; provide a plurality of type repository interfaces, wherein each type repository interface is associated with and provides access to a type repository in the plurality of type repositories and defines a set of services provided by the type repository; and create an object of the first type based on the second type system by creating the object of the first type to manipulate only instances of the second type. 32. The machine readable storage medium of claim 30 , further comprising instructions that when executed cause the system to: register a new type repository; and manage the one or more type repositories via a repository manager. | 0.696 |
8,676,827 | 19 | 20 | 19. The system of claim 18 , wherein the expanded queries stored in the query feature index comprise commercial queries, wherein the processor is further configured to: map, offline, the related expanded queries within the query feature index with features of their respective web search results and query logs. | 19. The system of claim 18 , wherein the expanded queries stored in the query feature index comprise commercial queries, wherein the processor is further configured to: map, offline, the related expanded queries within the query feature index with features of their respective web search results and query logs. 20. The system of claim 19 , wherein features of the received and expanded queries comprise one or more of unigrams, phrases, and semantic classes. | 0.964407 |
8,032,825 | 1 | 5 | 1. A method of dynamically creating a multimodal markup document, the method comprising: selecting a multimodal markup template, the multimodal markup template comprising visual markup and voice markup, the visual markup and voice markup operating to synchronize voice interactions specified by the voice markup and visual interactions specified by the visual markup, the multimodal markup template comprising identifications to dynamic content modules capable of creating dynamic content for insertion in the template; identifying in dependence upon the multimodal markup template a dynamic content module; instantiating the dynamic content module; executing a dynamic content creation function in the instantiated dynamic content module; receiving dynamic content from the dynamic content creation function; and including the dynamic content in the multimodal markup template. | 1. A method of dynamically creating a multimodal markup document, the method comprising: selecting a multimodal markup template, the multimodal markup template comprising visual markup and voice markup, the visual markup and voice markup operating to synchronize voice interactions specified by the voice markup and visual interactions specified by the visual markup, the multimodal markup template comprising identifications to dynamic content modules capable of creating dynamic content for insertion in the template; identifying in dependence upon the multimodal markup template a dynamic content module; instantiating the dynamic content module; executing a dynamic content creation function in the instantiated dynamic content module; receiving dynamic content from the dynamic content creation function; and including the dynamic content in the multimodal markup template. 5. The method of claim 1 further comprising sending the multimodal markup template including the dynamic content to a multimodal browser in a response message. | 0.870521 |
8,762,361 | 19 | 24 | 19. An apparatus, comprising: a memory configured to store instructions associated with an application program; and at least one processor that, in response to executing the instructions stored in the memory, is configured to: receive a group of input listings from at least two different sources in response to a search query, each input listing comprising different item listing variants corresponding to a particular item; identify at least one common attribute representing the item among at least a portion of the group of input listings; assign a weight to each of the at least two different sources based at least in part on a correlation of sample input listings from each of the at least two different sources to input listings from a trusted source or based at least in part on a correlation of the input listings from the at least the portion of the group of input listings to an existing consolidated listing; select an item listing variant from the group of input listings as a consolidated listing based at least in part on the at least one common attribute and the weight assigned to each of the at least two different sources; map each input listing of the at least the portion of the group of input listings to the consolidated listing; and cause display of the consolidated listing rather than the different item listing variants corresponding to the particular item. | 19. An apparatus, comprising: a memory configured to store instructions associated with an application program; and at least one processor that, in response to executing the instructions stored in the memory, is configured to: receive a group of input listings from at least two different sources in response to a search query, each input listing comprising different item listing variants corresponding to a particular item; identify at least one common attribute representing the item among at least a portion of the group of input listings; assign a weight to each of the at least two different sources based at least in part on a correlation of sample input listings from each of the at least two different sources to input listings from a trusted source or based at least in part on a correlation of the input listings from the at least the portion of the group of input listings to an existing consolidated listing; select an item listing variant from the group of input listings as a consolidated listing based at least in part on the at least one common attribute and the weight assigned to each of the at least two different sources; map each input listing of the at least the portion of the group of input listings to the consolidated listing; and cause display of the consolidated listing rather than the different item listing variants corresponding to the particular item. 24. The apparatus of claim 19 , wherein the at least one processor is further configured to: determine that there is at least one input listing in the at least the portion of the group of input listings that is mapped to the existing consolidated listing; and map the group of input listings by associating the group of input listings to the existing consolidated listing based on the at least one input listing that is mapped to the existing consolidated listing. | 0.564728 |
9,350,561 | 24 | 27 | 24. A network computer for generating a computer visualization of data, comprising: a transceiver that communicates over the network; a non-transitory memory that stores at least instructions; and one or more processor devices that execute instructions that perform actions, including: selecting a visualization model based on at least an allocation model, wherein the visualization model includes one or more visualization model items; mapping one or more allocation model items included in the allocation model to the one or more visualization model items; providing a resource value for each of the one or more visualization model items by at least aggregating an amount of resources corresponding to each of their one or more mapped allocation model items; storing the visualization model in the non-transitory memory of the computer, wherein the visualization model includes one or more resource values for the one or more visualization model items; displaying one or more portions of the visualization model that overlays the allocation model in a user interface of the network computer, wherein the allocation model underlies the visualization model; and when a visualization model item is selected using the user interface of the network computer perform further actions, including: traversing the underlying allocation model to identify one or more source allocation model items and one or more target allocation model items that are associated with the selected visualization model item; providing one or more source visualization model items that provide resources to the selected visualization model item based on the one or more identified source allocation model items; providing one or more target visualization model items that receive resources from the selected visualization model item based on the one or more identified target allocation model items; displaying on the user interface one or more input flow lines that start from the one or more source visualization model items and end at the selected visualization model item; and displaying on the user interface one or more output flow lines that start from the selected visualization model item and end at the one or more target visualization model items. | 24. A network computer for generating a computer visualization of data, comprising: a transceiver that communicates over the network; a non-transitory memory that stores at least instructions; and one or more processor devices that execute instructions that perform actions, including: selecting a visualization model based on at least an allocation model, wherein the visualization model includes one or more visualization model items; mapping one or more allocation model items included in the allocation model to the one or more visualization model items; providing a resource value for each of the one or more visualization model items by at least aggregating an amount of resources corresponding to each of their one or more mapped allocation model items; storing the visualization model in the non-transitory memory of the computer, wherein the visualization model includes one or more resource values for the one or more visualization model items; displaying one or more portions of the visualization model that overlays the allocation model in a user interface of the network computer, wherein the allocation model underlies the visualization model; and when a visualization model item is selected using the user interface of the network computer perform further actions, including: traversing the underlying allocation model to identify one or more source allocation model items and one or more target allocation model items that are associated with the selected visualization model item; providing one or more source visualization model items that provide resources to the selected visualization model item based on the one or more identified source allocation model items; providing one or more target visualization model items that receive resources from the selected visualization model item based on the one or more identified target allocation model items; displaying on the user interface one or more input flow lines that start from the one or more source visualization model items and end at the selected visualization model item; and displaying on the user interface one or more output flow lines that start from the selected visualization model item and end at the one or more target visualization model items. 27. The network computer claim 24 , wherein the one or more processor device execute instructions that performs actions further comprising: providing a remainder of visualization model items that are separate from the one or more source visualization model items, the one or more target visualization model items, and the selected visualization model item; and dimming on the user interface one or more user-interface controls that correspond to the remainder of visualization model items. | 0.78228 |
7,890,851 | 1 | 2 | 1. A method of preparing a patent application with a computer comprising the steps of: storing a document template in a computer program which contains headings equivalent to: “BACKGROUND OF THE INVENTION 1) Field of the Invention 2) Description of the Prior Art SUMMARY OF THE INVENTION AND ADVANTAGES BRIEF DESCRIPTION OF THE DRAWINGS DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT CLAIMS ABSTRACT OF THE DISCLOSURE”; storing a page break immediately before the “CLAIMS” heading in the computer program; storing a page break immediately before the “ABSTRACT OF THE DISCLOSURE” heading in the computer program; storing a footer in the computer program for displaying the attorney file identification on every page of the application; composing by a user an independent claim in the computer program ending in a clause beginning with the words “characterized by” and reciting and isolating the [patentable] novelty and preceded by at least one clause reciting prior art elements to the extent necessary to support and provide antecedent basis for the “characterized by” clause; drafting claims in the computer ultimately dependent upon the independent claim for successively more specifically defining the patentable novelty; and characterized by storing a duplicate set of all of the claims in the computer program, and creating the description by retrieving the duplicate set of claims under the heading “DESCRIPTION OF THE PREFERRED EMBODIMENT”, searching for each occurrence of the word “said” in the duplicate set of claims copied into the specification, programming the computer program to replace the word “said” with the word “the” in the duplicate set of claims copied into the specification, and editing the duplicate set of claims copied into the specification into grammatically correct sentence structure including adding verbs, and assigning reference numerals for the first time by the steps of storing the element names of the elements in the order recited in the duplicate set of claims, storing successive numbers beginning with a number above the highest Figure number to identify the respective element names, and searching for each occurrence of each respective element name in the order of occurrence in the duplicate set of claims, replacing each respective element name with that respective element name followed by successive ones of said numbers to provide identifying reference numerals for the element names in the order of occurrence in the duplicate set of claims and automatically shifting the reference numerals in response to changing the order of occurrence in the duplicate set of claims. | 1. A method of preparing a patent application with a computer comprising the steps of: storing a document template in a computer program which contains headings equivalent to: “BACKGROUND OF THE INVENTION 1) Field of the Invention 2) Description of the Prior Art SUMMARY OF THE INVENTION AND ADVANTAGES BRIEF DESCRIPTION OF THE DRAWINGS DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT CLAIMS ABSTRACT OF THE DISCLOSURE”; storing a page break immediately before the “CLAIMS” heading in the computer program; storing a page break immediately before the “ABSTRACT OF THE DISCLOSURE” heading in the computer program; storing a footer in the computer program for displaying the attorney file identification on every page of the application; composing by a user an independent claim in the computer program ending in a clause beginning with the words “characterized by” and reciting and isolating the [patentable] novelty and preceded by at least one clause reciting prior art elements to the extent necessary to support and provide antecedent basis for the “characterized by” clause; drafting claims in the computer ultimately dependent upon the independent claim for successively more specifically defining the patentable novelty; and characterized by storing a duplicate set of all of the claims in the computer program, and creating the description by retrieving the duplicate set of claims under the heading “DESCRIPTION OF THE PREFERRED EMBODIMENT”, searching for each occurrence of the word “said” in the duplicate set of claims copied into the specification, programming the computer program to replace the word “said” with the word “the” in the duplicate set of claims copied into the specification, and editing the duplicate set of claims copied into the specification into grammatically correct sentence structure including adding verbs, and assigning reference numerals for the first time by the steps of storing the element names of the elements in the order recited in the duplicate set of claims, storing successive numbers beginning with a number above the highest Figure number to identify the respective element names, and searching for each occurrence of each respective element name in the order of occurrence in the duplicate set of claims, replacing each respective element name with that respective element name followed by successive ones of said numbers to provide identifying reference numerals for the element names in the order of occurrence in the duplicate set of claims and automatically shifting the reference numerals in response to changing the order of occurrence in the duplicate set of claims. 2. The method as set forth in claim 1 including the steps of storing a duplicate of the independent claim in the computer program, retrieving the duplicate independent claim under the heading “SUMMARY OF THE INVENTION AND ADVANTAGES”, and editing the duplicate independent claim copied under the heading “SUMMARY OF THE INVENTION AND ADVANTAGES” into grammatically correct sentence structure including changing “said” to “the” and adding verbs without adding further description whereby the “SUMMARY OF THE INVENTION AND ADVANTAGES” is commensurate in scope to the independent claim. | 0.500856 |
8,751,236 | 5 | 6 | 5. The method of claim 1 , wherein the concatenation features of the first speech sound include one or more of a last Fundamental Frequency value (F0), at least one frame of a spectral representation of a beginning portion of the first speech sound, or at least one frame of a spectral representation of an ending portion of the first speech sound. | 5. The method of claim 1 , wherein the concatenation features of the first speech sound include one or more of a last Fundamental Frequency value (F0), at least one frame of a spectral representation of a beginning portion of the first speech sound, or at least one frame of a spectral representation of an ending portion of the first speech sound. 6. The method of claim 5 , wherein the first speech sound is indicative of a pronunciation of a diphone, wherein the concatenation features of the first speech sound include one or more of a duration of the pronunciation of a first half of the diphone, a duration of the pronunciation of a second half of the diphone, F0 of the pronunciation of the first half of the diphone, F0 of the pronunciation of a center portion of the diphone, or F0 of the pronunciation of the second half of the diphone. | 0.874495 |
10,146,816 | 7 | 9 | 7. A computer program product for providing content of a publish-subscribe topic tree, the computer program product including a computer readable storage medium having instructions stored thereon for execution by a computer system, wherein the instructions, when executed by the computer system, cause the computer system to implement a method comprising: receiving a path for a requested topic, wherein the path specifies topic names leading from highest to lowest level topic names in the path, wherein the topic tree includes topic names and an added node identifier associated with each respective topic name of the topic tree, wherein certain digits of the node identifiers for parent nodes in the tree correspond to certain digits of node identifiers of child node(s) of each respective parent; searching a hash table for the topic names specified in the path, wherein the hash table also includes the topic names of the topic tree and includes the node identifier associated with each respective topic name of the topic tree; finding, in the hash table, the topic tree node identifiers for the topic names specified in the path; designating a highest level topic in the path as a current highest level topic; performing parent-child node matching for the node identifiers found in the hash table, including matching certain digits of the found node identifier(s) for the current highest level topic in the path to corresponding digits of the found node identifier(s) for a next lower level topic in the path to find a matching next level node, and then designating a next topic after the current highest level topic in the path to be a new, current highest level topic; repeating the parent-child node matching for each successive topic in the path, in order to find the node identifier for the lowest level node in the path; and retrieving content in the topic tree only for matching topic names that match the lowest level topic name in the requested topic path independently of whether the matching topic names are on the requested topic path in the tree, including retrieving the content in the topic tree for the matching topic name(s) no later than at least partly in concurrence with the parent-child node matching; and sending, for a requestor, the content retrieved for only the one topic name that matches the lowest level topic name in the requested topic path and for which the topic tree node was identified as the lowest level node in the path by the parent-child node matching. | 7. A computer program product for providing content of a publish-subscribe topic tree, the computer program product including a computer readable storage medium having instructions stored thereon for execution by a computer system, wherein the instructions, when executed by the computer system, cause the computer system to implement a method comprising: receiving a path for a requested topic, wherein the path specifies topic names leading from highest to lowest level topic names in the path, wherein the topic tree includes topic names and an added node identifier associated with each respective topic name of the topic tree, wherein certain digits of the node identifiers for parent nodes in the tree correspond to certain digits of node identifiers of child node(s) of each respective parent; searching a hash table for the topic names specified in the path, wherein the hash table also includes the topic names of the topic tree and includes the node identifier associated with each respective topic name of the topic tree; finding, in the hash table, the topic tree node identifiers for the topic names specified in the path; designating a highest level topic in the path as a current highest level topic; performing parent-child node matching for the node identifiers found in the hash table, including matching certain digits of the found node identifier(s) for the current highest level topic in the path to corresponding digits of the found node identifier(s) for a next lower level topic in the path to find a matching next level node, and then designating a next topic after the current highest level topic in the path to be a new, current highest level topic; repeating the parent-child node matching for each successive topic in the path, in order to find the node identifier for the lowest level node in the path; and retrieving content in the topic tree only for matching topic names that match the lowest level topic name in the requested topic path independently of whether the matching topic names are on the requested topic path in the tree, including retrieving the content in the topic tree for the matching topic name(s) no later than at least partly in concurrence with the parent-child node matching; and sending, for a requestor, the content retrieved for only the one topic name that matches the lowest level topic name in the requested topic path and for which the topic tree node was identified as the lowest level node in the path by the parent-child node matching. 9. The computer program product of claim 7 , wherein the content of at least one of the matching topics is retrieved during at least one processing cycle when at least one other one of the matching topics is retrieved. | 0.600733 |
8,447,739 | 1 | 11 | 1. A non-transitory computer-readable medium having stored thereon processor-executable instructions that when executed by a processor result in the following: providing at least one event stream from at least one data source to an event processing engine; prior to establishing a connection with any user, automatically establishing, by a processor at a query technique engine, a first continuous meta-query for the event processing engine, the first continuous meta-query providing meta-output data based on the at least one event stream, the meta-output data being collected from a time prior to establishing a connection with any user and beginning at the creation of the first continuous meta-query; subsequent to establishment of the first continuous meta-query, establishing a connection with a remote user; receiving, at the query technique engine, continuous query definition parameters for a continuous user-query from the user via a graphical user interface; retrieving, at the query technique engine, semantic layer information associated with the event processing engine; automatically creating event processing language statements by the processor at the query technique engine, the event processing language statements being created based on (i) the continuous query definition parameters from the user and (ii) the semantic layer information; arranging for the event processing language statements to be provided to the event processing engine so as to establish the continuous user-query at the event processing engine, the continuous user-query providing user-output data based on a combination of newly occurring events in the event stream and at least a portion of said meta-output data that was provided before the connection with the user was established; subsequently de-establishing the connection with the user; and halting the continuous user-query without halting the first continuous meta-query. | 1. A non-transitory computer-readable medium having stored thereon processor-executable instructions that when executed by a processor result in the following: providing at least one event stream from at least one data source to an event processing engine; prior to establishing a connection with any user, automatically establishing, by a processor at a query technique engine, a first continuous meta-query for the event processing engine, the first continuous meta-query providing meta-output data based on the at least one event stream, the meta-output data being collected from a time prior to establishing a connection with any user and beginning at the creation of the first continuous meta-query; subsequent to establishment of the first continuous meta-query, establishing a connection with a remote user; receiving, at the query technique engine, continuous query definition parameters for a continuous user-query from the user via a graphical user interface; retrieving, at the query technique engine, semantic layer information associated with the event processing engine; automatically creating event processing language statements by the processor at the query technique engine, the event processing language statements being created based on (i) the continuous query definition parameters from the user and (ii) the semantic layer information; arranging for the event processing language statements to be provided to the event processing engine so as to establish the continuous user-query at the event processing engine, the continuous user-query providing user-output data based on a combination of newly occurring events in the event stream and at least a portion of said meta-output data that was provided before the connection with the user was established; subsequently de-establishing the connection with the user; and halting the continuous user-query without halting the first continuous meta-query. 11. The computer-readable medium of claim 1 , wherein the first continuous meta-query is further associated with a filter operation. | 0.897196 |
9,473,463 | 1 | 5 | 1. A method comprising: caching concurrently, by a computing device, a first set of control words and a first set of entitlement control messages (ECMs) associated with the first set of control words; encrypting a transport stream, for a first service, using a first control word of the first set of control words during a first cryptographic period; encrypting the transport stream, for the first service, using a second control word of the first set of control words different from the first control word during a second cryptographic period, wherein the second cryptographic period occurs after the first cryptographic period; encrypting the transport stream, for the first service, using the first control word of the first set of control words during a third cryptographic period, wherein the third cryptographic period occurs after the first cryptographic period and the second cryptographic period; inserting into the transport stream, for the first service, a first ECM, of the first set of ECMs, corresponding to the first control word; and sending, to a device downstream from the computing device, the transport stream. | 1. A method comprising: caching concurrently, by a computing device, a first set of control words and a first set of entitlement control messages (ECMs) associated with the first set of control words; encrypting a transport stream, for a first service, using a first control word of the first set of control words during a first cryptographic period; encrypting the transport stream, for the first service, using a second control word of the first set of control words different from the first control word during a second cryptographic period, wherein the second cryptographic period occurs after the first cryptographic period; encrypting the transport stream, for the first service, using the first control word of the first set of control words during a third cryptographic period, wherein the third cryptographic period occurs after the first cryptographic period and the second cryptographic period; inserting into the transport stream, for the first service, a first ECM, of the first set of ECMs, corresponding to the first control word; and sending, to a device downstream from the computing device, the transport stream. 5. The method of claim 1 , further comprising: in response to a determination that a number of control words cached at the computing device has exceeded a predetermined threshold number, preventing, by the computing device, receipt of a new set of control words and a new set of ECMs associated with the new set of control words. | 0.780374 |
9,053,202 | 8 | 9 | 8. An apparatus comprising at least a processor and a memory, wherein the processor and/or memory are configured to perform the following operations: receiving an indication of a user using a particular web property; determining that the user is authorized to provide translations for such particular web property; transmitting one or more web pages of the particular web property, the one or more web pages including a plurality of translatable text strings and a translation interface for receiving translations of the translatable text strings in a context of the one or more web pages of the particular web property, wherein the translation interface includes a list of options; receiving a first translation of a first one of the translatable text strings into a first language entered by the user in the translation interface in the context of the one or more web pages of the particular web property; receiving a selection of an option in the list of options to indicate whether the first translation is applied to a masculine or feminine version of a variable value or to indicate whether the first translation is applied to a plural or singular version of the variable value; and transmitting the first translation such that the first translatable text string is replaced with the first translation within the one or more web pages of the particular web property. | 8. An apparatus comprising at least a processor and a memory, wherein the processor and/or memory are configured to perform the following operations: receiving an indication of a user using a particular web property; determining that the user is authorized to provide translations for such particular web property; transmitting one or more web pages of the particular web property, the one or more web pages including a plurality of translatable text strings and a translation interface for receiving translations of the translatable text strings in a context of the one or more web pages of the particular web property, wherein the translation interface includes a list of options; receiving a first translation of a first one of the translatable text strings into a first language entered by the user in the translation interface in the context of the one or more web pages of the particular web property; receiving a selection of an option in the list of options to indicate whether the first translation is applied to a masculine or feminine version of a variable value or to indicate whether the first translation is applied to a plural or singular version of the variable value; and transmitting the first translation such that the first translatable text string is replaced with the first translation within the one or more web pages of the particular web property. 9. The apparatus as recited in claim 8 , wherein the processor and/or memory are configured for, in response to receiving the first translation, sending the first translation to a central server that is configured to store the first translation in association with the first translatable text string and the particular web property, and configured to publish the first translation to other users of the particular web property. | 0.743697 |
10,007,662 | 44 | 45 | 44. The method of claim 39 , adapted for application in data processing pipelines in Robotics wherein the step of receiving the input sequence comprises the step of receiving a sequence that was derived from sensory or motor feedback recorded by the robot. | 44. The method of claim 39 , adapted for application in data processing pipelines in Robotics wherein the step of receiving the input sequence comprises the step of receiving a sequence that was derived from sensory or motor feedback recorded by the robot. 45. The method of claim 44 , further comprising the step of replacing an existing standard machine learning representation with dual SSM Matrices. | 0.948772 |
9,368,107 | 14 | 17 | 14. A computing system for discovering speech recognition commands comprising a processor, a memory, and a bus linking the processor and memory, wherein said processor is able execute instructions of at least one computer program product that is stored in a non-transitory storage medium, wherein execution of the instructions causes the computing system to: automatically respond to a manually initiated action with voice command discovery by presenting speech command data configured to facilitate initiation of the action via speech, such that the presentation of the speech command data directs the user to use the speech command to initiate the action without manual intervention, wherein the computing system in communication with a discovery server through an application server, and wherein the automatically responding with voice command discovery causing the computing system to: receive at an application an input from a manually initiated action, wherein the computing system is associated with a speech component, wherein the input is associated with a computing system function, and wherein the computing system function is an operation within the computing system and is linked to a function identifier, the function identifier being associated with the manually initiated action in the context of the application; transmit a request containing the function identifier through the application server to the discovery server, the discovery server configured with a mapping of function identifiers linked to respective speech command data, wherein the discovery server determines the application based on an application identifier derived from the manually initiated action, and wherein the discovery server translates the function identifier contained in the request to the speech command data by using the function identifier contained in the request associated with the application to find in the mapping a corresponding function identifier linked to the speech command data; receive from the discovery server through the application server the speech command data, wherein the command data is associated with a command identifier and a command, and wherein the speech command data is a speech command registered within the speech component; and present the received speech command data within a speech interface of the speech component responsive to the translating. | 14. A computing system for discovering speech recognition commands comprising a processor, a memory, and a bus linking the processor and memory, wherein said processor is able execute instructions of at least one computer program product that is stored in a non-transitory storage medium, wherein execution of the instructions causes the computing system to: automatically respond to a manually initiated action with voice command discovery by presenting speech command data configured to facilitate initiation of the action via speech, such that the presentation of the speech command data directs the user to use the speech command to initiate the action without manual intervention, wherein the computing system in communication with a discovery server through an application server, and wherein the automatically responding with voice command discovery causing the computing system to: receive at an application an input from a manually initiated action, wherein the computing system is associated with a speech component, wherein the input is associated with a computing system function, and wherein the computing system function is an operation within the computing system and is linked to a function identifier, the function identifier being associated with the manually initiated action in the context of the application; transmit a request containing the function identifier through the application server to the discovery server, the discovery server configured with a mapping of function identifiers linked to respective speech command data, wherein the discovery server determines the application based on an application identifier derived from the manually initiated action, and wherein the discovery server translates the function identifier contained in the request to the speech command data by using the function identifier contained in the request associated with the application to find in the mapping a corresponding function identifier linked to the speech command data; receive from the discovery server through the application server the speech command data, wherein the command data is associated with a command identifier and a command, and wherein the speech command data is a speech command registered within the speech component; and present the received speech command data within a speech interface of the speech component responsive to the translating. 17. The system of claim 14 , further comprising: a discovery engine configured to present the command data within the speech user interface responsive to the manually initiated action, wherein the manually initiated action is linked to the system function; and a data store able to persist a command mapping associated with the speech component, wherein the mapping links the function identifier with the command data. | 0.735108 |
10,002,296 | 10 | 17 | 10. An apparatus, comprising: a computer including a non-transitory computer-readable medium storing program modules executable by the computer, the modules including: a first generation module, configured to segment a video in a sample video library according to a time sequence, to obtain a segmentation result having neighboring segments of the video that at least partially overlap in time, and generate a motion atom set, wherein the sample video library comprises at least one video, and wherein a motion atom in the motion atom set is generated according to the video in the sample video library; a second generation module, comprising a first generation unit configured to generate, by using the motion atom set and the segmentation result, a motion phrase set corresponding to the video in the sample video library, wherein the motion phrase set comprises at least two motion phrases, the second generation module further comprising a screening unit configured to screen the motion phrases and obtain a screening result, and the second generation module further comprising a second generation unit configured to generate, according to the screening result, a descriptive vector corresponding to the video in the sample video library; and a classification module, configured to determine, by using the descriptive vector, a to-be-detected video whose category is the same as that of the video in the sample video library. | 10. An apparatus, comprising: a computer including a non-transitory computer-readable medium storing program modules executable by the computer, the modules including: a first generation module, configured to segment a video in a sample video library according to a time sequence, to obtain a segmentation result having neighboring segments of the video that at least partially overlap in time, and generate a motion atom set, wherein the sample video library comprises at least one video, and wherein a motion atom in the motion atom set is generated according to the video in the sample video library; a second generation module, comprising a first generation unit configured to generate, by using the motion atom set and the segmentation result, a motion phrase set corresponding to the video in the sample video library, wherein the motion phrase set comprises at least two motion phrases, the second generation module further comprising a screening unit configured to screen the motion phrases and obtain a screening result, and the second generation module further comprising a second generation unit configured to generate, according to the screening result, a descriptive vector corresponding to the video in the sample video library; and a classification module, configured to determine, by using the descriptive vector, a to-be-detected video whose category is the same as that of the video in the sample video library. 17. The apparatus according to claim 10 , wherein the classification module comprises: a fourth generation unit, configured to generate a response vector corresponding to the to-be-detected video; a fourth acquiring unit, configured to obtain a second classification rule according to a descriptive vector corresponding to each video in the sample video library, wherein the second classification rule is used to detect whether the category of the to-be-detected video is the same as that of the video in the sample video library; a detection unit, configured to detect whether the response vector of the to-be-detected video conforms to the second classification rule; and a second classification unit, configured to: when the response vector of the to-be-detected video conforms to the second classification rule, determine that the category of the to-be-detected video is the same as that of the video in the sample video library. | 0.831284 |
8,503,624 | 1 | 5 | 1. A method of processing an incoming voice message, the method comprising: at a recipient system, receiving an incoming voice message from a message communicator; using a processor to automatically analyze message content of the incoming voice message to identity at least one keyword included in the message content, the message content analysis being performed while a caller is connected with the message communicator; identifying a predefined action associated with the at least one keyword, the predefined action including associating a priority with the incoming voice message; and performing the predefined action when the at least one keyword is identified in the message content, the predefined action including a search action wherein the message content includes a spoken search term used to obtain an equivalent textual search term which is used to search a database of stored incoming voice messages for the textual equivalent search term to identify any stored incoming voice messages including the spoken search term. | 1. A method of processing an incoming voice message, the method comprising: at a recipient system, receiving an incoming voice message from a message communicator; using a processor to automatically analyze message content of the incoming voice message to identity at least one keyword included in the message content, the message content analysis being performed while a caller is connected with the message communicator; identifying a predefined action associated with the at least one keyword, the predefined action including associating a priority with the incoming voice message; and performing the predefined action when the at least one keyword is identified in the message content, the predefined action including a search action wherein the message content includes a spoken search term used to obtain an equivalent textual search term which is used to search a database of stored incoming voice messages for the textual equivalent search term to identify any stored incoming voice messages including the spoken search term. 5. The method of claim 1 , wherein identifying the predefined action comprises investigating a keyword database including a plurality of keywords and at least one predefined action associated with each keyword. | 0.726563 |
9,448,992 | 10 | 12 | 10. The system of claim 9 , wherein the memory further stores instructions that, when executed by the at least one processor, cause the computer system to: retrieve a plurality of heading-text pairs from the data store, each heading-text pair being keyed by the topic and the question category; rank the plurality of heading-text pairs; and select a predetermined number of highest ranked heading-text pairs for the search result. | 10. The system of claim 9 , wherein the memory further stores instructions that, when executed by the at least one processor, cause the computer system to: retrieve a plurality of heading-text pairs from the data store, each heading-text pair being keyed by the topic and the question category; rank the plurality of heading-text pairs; and select a predetermined number of highest ranked heading-text pairs for the search result. 12. The system of claim 10 , wherein the plurality of heading-text pairs are ranked based on a length of the text portion of the heading-text pair or on a similarity of the text portion with text portions of other heading-text pairs in the plurality of heading-text pairs. | 0.902649 |
8,463,782 | 13 | 16 | 13. A system comprising: one or more computers; and a computer-readable medium coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, cause the one or more computers to perform operations comprising: traversing a corpus of documents to identify a plurality of lists within the documents, wherein each list comprises structured data delimited from other data in a document, and wherein each list specifies an enumeration of elements; selecting a pair of terms based on determining that both terms of the pair are contained in a first quantity of lists that are included in the documents in the corpus, wherein the first quantity is more than a first predetermined quantity, and wherein each list in the first quantity of lists includes more than a second predetermined quantity of terms; determining a first value that represents a quantity of documents in the corpus that include a list that contains both terms of the pair; determining a second value that represents a quantity of the documents in the set corpus that include a list that contains at least one of the terms of the pair; when both terms of the pair are contained in the first quantity of lists that are included in the documents in the corpus, determining a correlation value from the first value and the second value; determining that the correlation value satisfies a threshold; and designating the pair of terms as potentially non-synonymous terms by adding the pair of terms to a blacklist, based on determining that the correlation value satisfies the threshold, wherein the blacklist is accessed for synonym determination. | 13. A system comprising: one or more computers; and a computer-readable medium coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, cause the one or more computers to perform operations comprising: traversing a corpus of documents to identify a plurality of lists within the documents, wherein each list comprises structured data delimited from other data in a document, and wherein each list specifies an enumeration of elements; selecting a pair of terms based on determining that both terms of the pair are contained in a first quantity of lists that are included in the documents in the corpus, wherein the first quantity is more than a first predetermined quantity, and wherein each list in the first quantity of lists includes more than a second predetermined quantity of terms; determining a first value that represents a quantity of documents in the corpus that include a list that contains both terms of the pair; determining a second value that represents a quantity of the documents in the set corpus that include a list that contains at least one of the terms of the pair; when both terms of the pair are contained in the first quantity of lists that are included in the documents in the corpus, determining a correlation value from the first value and the second value; determining that the correlation value satisfies a threshold; and designating the pair of terms as potentially non-synonymous terms by adding the pair of terms to a blacklist, based on determining that the correlation value satisfies the threshold, wherein the blacklist is accessed for synonym determination. 16. The system of claim 13 , wherein selecting a pair of terms comprises: selecting a particular list included in a particular document in the corpus, wherein the particular list contains a particular set of terms; and selecting the pair of terms from the particular set of terms. | 0.734345 |
8,364,694 | 5 | 12 | 5. A method for searching for digital media information available from an online media store, said method comprising: receiving a search hints request from a client application operating on a client device, the search hints request including at least a character string including at least one character; determining a set of search hints based on the character string, wherein said determining of the set of search hints obtains the matching search hints from a hints data structure and wherein the set of search hints correspond to digital media assets available in an online media repository and at least sales popularity data; obtaining a location of the client device; eliminating from the set of search hints those of the search hints in the set of search hints that are associated with a location other than the location of the client device; obtaining a media popularity indication for each of a plurality of the search hints in the set of search hints; and sending a portion of the search hints in the set of search hints to the client application on the client device, the portion of the search hints sent to the client application being less than all the search hints in the set of search hints. | 5. A method for searching for digital media information available from an online media store, said method comprising: receiving a search hints request from a client application operating on a client device, the search hints request including at least a character string including at least one character; determining a set of search hints based on the character string, wherein said determining of the set of search hints obtains the matching search hints from a hints data structure and wherein the set of search hints correspond to digital media assets available in an online media repository and at least sales popularity data; obtaining a location of the client device; eliminating from the set of search hints those of the search hints in the set of search hints that are associated with a location other than the location of the client device; obtaining a media popularity indication for each of a plurality of the search hints in the set of search hints; and sending a portion of the search hints in the set of search hints to the client application on the client device, the portion of the search hints sent to the client application being less than all the search hints in the set of search hints. 12. The method of claim 5 , wherein the digital media information pertains to digital media assets available in an online media store, and wherein the media popularity indication for a particular one of the search hints pertains to popularity of the corresponding digital media asset with respect to the online media store. | 0.824457 |
7,739,354 | 1 | 12 | 1. A computer implemented method for embedding data in a text page at a proxy, the proxy comprising an intermediary between a resource and a request for the resource, the method comprising: receiving the request for the resource at the proxy from a client machine, wherein the proxy is configured to accept requests from a plurality of client machines, wherein the client machines are independent of the proxy; extracting, at the proxy, a resource identifier from the request and storing said the resource identifier, wherein the resource identifier identifies the resource being requested; forwarding the request for said resource from the proxy to a location having the resource; receiving the resource in response to forwarding the request; thereafter, at the proxy, parsing the received resource based at least partially on the resource identifier to match the received resource with the previously stored resource identifier; analyzing a plurality of templates using at least the previously stored resource identifier to obtain a template associated with the resource; using the template associated with the received resource identified by the previously stored resource identifier to identify one or more recognized elements in the received resource; and embedding data into the received resource based on the one or more recognized elements. | 1. A computer implemented method for embedding data in a text page at a proxy, the proxy comprising an intermediary between a resource and a request for the resource, the method comprising: receiving the request for the resource at the proxy from a client machine, wherein the proxy is configured to accept requests from a plurality of client machines, wherein the client machines are independent of the proxy; extracting, at the proxy, a resource identifier from the request and storing said the resource identifier, wherein the resource identifier identifies the resource being requested; forwarding the request for said resource from the proxy to a location having the resource; receiving the resource in response to forwarding the request; thereafter, at the proxy, parsing the received resource based at least partially on the resource identifier to match the received resource with the previously stored resource identifier; analyzing a plurality of templates using at least the previously stored resource identifier to obtain a template associated with the resource; using the template associated with the received resource identified by the previously stored resource identifier to identify one or more recognized elements in the received resource; and embedding data into the received resource based on the one or more recognized elements. 12. The computer implemented method of claim 1 wherein said request for a resource is a request for a document from a document management database. | 0.744792 |
8,935,664 | 9 | 12 | 9. A computer system for designing an a service oriented architecture (“SOA”) system, the computer system comprising: a processor set; a user interface hardware set; and a software storage device; wherein: the software storage device stores SOA design tool software; the user interface hardware set is structured and/or connected in data communication to communicate data between a user and the SOA design tool hardware; the processor set is structured and/or connected in data communication to perform machine readable instructions of the SOA design tool hardware; the SOA design tool includes an SOA operational rules database, an SOA operational rules categories database and a question-based logic module; the SOA operational rules database stores a plurality of SOA operational rules; the SOA operational rules categories database stores a plurality of SOA operational rule categories and an indication of which SOA operational rules of the plurality of SOA operational rules correspond to each SOA operational rules category of the plurality of SOA operational rules categories; and the question-based logic module is programmed to: (i) present the user with a plurality of questions, through the user interface hardware set, with regard to a SOA operational rule, wherein at least one question of the plurality of questions comprises whether the SOA operational rule changes frequently, (ii) to receive a plurality of answers from the user respectively in response to the plurality of questions, (iii) to categorize the SOA operational rule into at least a SOA operational rule category, from the plurality of SOA operational rule categories, based at least in part upon answers received from the user, wherein when an answer is false to the question comprising whether the SOA operational rule changes frequently, the question-based logic module is programmed to present a question comprising whether the SOA operational rule requires validation of user input to the user prior to categorizing, and wherein when an answer is true to the question comprising whether the SOA operational rule changes frequently, the question-based logic module is programmed to present a question comprising whether the SOA operational rule is used frequently to the user prior to categorizing, and (iv) store, in the SOA operational rules database, information indicating that the SOA operational rule is associated with at least the SOA operational rule category. | 9. A computer system for designing an a service oriented architecture (“SOA”) system, the computer system comprising: a processor set; a user interface hardware set; and a software storage device; wherein: the software storage device stores SOA design tool software; the user interface hardware set is structured and/or connected in data communication to communicate data between a user and the SOA design tool hardware; the processor set is structured and/or connected in data communication to perform machine readable instructions of the SOA design tool hardware; the SOA design tool includes an SOA operational rules database, an SOA operational rules categories database and a question-based logic module; the SOA operational rules database stores a plurality of SOA operational rules; the SOA operational rules categories database stores a plurality of SOA operational rule categories and an indication of which SOA operational rules of the plurality of SOA operational rules correspond to each SOA operational rules category of the plurality of SOA operational rules categories; and the question-based logic module is programmed to: (i) present the user with a plurality of questions, through the user interface hardware set, with regard to a SOA operational rule, wherein at least one question of the plurality of questions comprises whether the SOA operational rule changes frequently, (ii) to receive a plurality of answers from the user respectively in response to the plurality of questions, (iii) to categorize the SOA operational rule into at least a SOA operational rule category, from the plurality of SOA operational rule categories, based at least in part upon answers received from the user, wherein when an answer is false to the question comprising whether the SOA operational rule changes frequently, the question-based logic module is programmed to present a question comprising whether the SOA operational rule requires validation of user input to the user prior to categorizing, and wherein when an answer is true to the question comprising whether the SOA operational rule changes frequently, the question-based logic module is programmed to present a question comprising whether the SOA operational rule is used frequently to the user prior to categorizing, and (iv) store, in the SOA operational rules database, information indicating that the SOA operational rule is associated with at least the SOA operational rule category. 12. The system of claim 9 wherein each of the plurality of SOA operational rule categories respectively corresponds to an SOA component into which rules may be implemented. | 0.697183 |
7,623,711 | 27 | 41 | 27. A computer-readable storage medium having instructions stored therein, which when executed by a system, cause the system to perform a method comprising: identifying spatial relationships between document objects of a document image; determining space separating pairs of neighboring document objects, wherein the space separating pairs of neighboring document objects is represented as weights in a weighted graph model; and determining a scaling factor based on the space separating the document objects in the document image and based on display device characteristics. | 27. A computer-readable storage medium having instructions stored therein, which when executed by a system, cause the system to perform a method comprising: identifying spatial relationships between document objects of a document image; determining space separating pairs of neighboring document objects, wherein the space separating pairs of neighboring document objects is represented as weights in a weighted graph model; and determining a scaling factor based on the space separating the document objects in the document image and based on display device characteristics. 41. The computer-readable storage medium defined in claim 27 wherein determining at least one scaling factor based on the space separating the document objects in the document image and based on display device characteristics comprises determining the scaling factor using a constant reflecting a minimal visually recognizable space separation measured in pixels. | 0.58656 |
9,826,267 | 10 | 14 | 10. A method comprising: transmitting, by at least one computing device and via a network, first one or more signals identifying a plurality of items of scheduled video content and a plurality of services that are associated with the plurality of items of scheduled video content; receiving, from a client device via the network, second one or more signals indicating a user selection of a first service of the plurality of services; determining, in response to the second one or more signals and based on first data stored by at least one data storage device that is communicatively coupled with the at least one computing device, whether a first item of scheduled video content, that is associated with the first service, is also associated with any of a plurality of supplemental services, wherein the first data associates the plurality of items of scheduled video content with the plurality of services and with the plurality of supplemental services; and transmitting, via the network and in response to determining that the first item of scheduled video content is associated with a first supplemental service of the plurality of supplemental services, third one or more signals identifying the first supplemental service. | 10. A method comprising: transmitting, by at least one computing device and via a network, first one or more signals identifying a plurality of items of scheduled video content and a plurality of services that are associated with the plurality of items of scheduled video content; receiving, from a client device via the network, second one or more signals indicating a user selection of a first service of the plurality of services; determining, in response to the second one or more signals and based on first data stored by at least one data storage device that is communicatively coupled with the at least one computing device, whether a first item of scheduled video content, that is associated with the first service, is also associated with any of a plurality of supplemental services, wherein the first data associates the plurality of items of scheduled video content with the plurality of services and with the plurality of supplemental services; and transmitting, via the network and in response to determining that the first item of scheduled video content is associated with a first supplemental service of the plurality of supplemental services, third one or more signals identifying the first supplemental service. 14. The method of claim 10 , wherein the first supplemental service comprises one or both of a web site or a web page. | 0.883858 |
10,031,912 | 11 | 12 | 11. A computer program product, comprising: a non-transitory computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code executable by a processor to perform an operation for identifying, based at least in part on a machine learning (ML) model, candidate values to provide to a question answering (QA) system as part of a case, the operation comprising: receiving a case, wherein the case includes a plurality of documents for evaluation by the QA system; evaluating the plurality of documents using natural language processing (NLP) to identify one or more concepts reflected by text content within the plurality of documents in the case, wherein the text content within the plurality of documents includes a first distinct value and a second distinct value of a plurality of distinct values for at least a first one of the concepts, wherein one or more of the plurality of distinct values includes a respective collection of one or more attributes; computing by the machine learning (ML) model, wherein the ML mode is a logical regression model, executed by a processor, a respective confidence score for each of the plurality of distinct values, wherein the ML model is built to compute the scores to select concept values based on a plurality of training cases, wherein each training case provides a plurality of documents and an indication of a preferred value for each concept having multiple values, wherein the preferred value for each concept is determined by: assigning a weight to each of the one or more attributes, wherein the one or more attributes include: (i) a date of an observation in the training case, (ii) a decisiveness of language used for the observation, and (iii) an accuracy of a procedure undertaken to make the observation; determining whether the one or more attributes meets a previously established relevancy threshold, and i) if the relevancy threshold is met, correlating, based on the assigned weights, a predictive quality of the one or more attributes in relation to a respective concept value to determine the preferred value and ii) if the relevancy threshold is not met, foregoing correlating, based on the assigned weights, a predictive quality of the one or more attribute in relation to a respective concept value to determine the preferred value; and selecting, based on the respective confidence scores, the first distinct value of the plurality of distinct values as a candidate value for the first concept to provide to the deep QA system to process the case; prior to submitting the case to the QA system, returning at least the candidate value selected for the first concept to present in a user interface; and submitting the case to the QA system using at least one selected value. | 11. A computer program product, comprising: a non-transitory computer-readable storage medium having computer-readable program code embodied therewith, the computer-readable program code executable by a processor to perform an operation for identifying, based at least in part on a machine learning (ML) model, candidate values to provide to a question answering (QA) system as part of a case, the operation comprising: receiving a case, wherein the case includes a plurality of documents for evaluation by the QA system; evaluating the plurality of documents using natural language processing (NLP) to identify one or more concepts reflected by text content within the plurality of documents in the case, wherein the text content within the plurality of documents includes a first distinct value and a second distinct value of a plurality of distinct values for at least a first one of the concepts, wherein one or more of the plurality of distinct values includes a respective collection of one or more attributes; computing by the machine learning (ML) model, wherein the ML mode is a logical regression model, executed by a processor, a respective confidence score for each of the plurality of distinct values, wherein the ML model is built to compute the scores to select concept values based on a plurality of training cases, wherein each training case provides a plurality of documents and an indication of a preferred value for each concept having multiple values, wherein the preferred value for each concept is determined by: assigning a weight to each of the one or more attributes, wherein the one or more attributes include: (i) a date of an observation in the training case, (ii) a decisiveness of language used for the observation, and (iii) an accuracy of a procedure undertaken to make the observation; determining whether the one or more attributes meets a previously established relevancy threshold, and i) if the relevancy threshold is met, correlating, based on the assigned weights, a predictive quality of the one or more attributes in relation to a respective concept value to determine the preferred value and ii) if the relevancy threshold is not met, foregoing correlating, based on the assigned weights, a predictive quality of the one or more attribute in relation to a respective concept value to determine the preferred value; and selecting, based on the respective confidence scores, the first distinct value of the plurality of distinct values as a candidate value for the first concept to provide to the deep QA system to process the case; prior to submitting the case to the QA system, returning at least the candidate value selected for the first concept to present in a user interface; and submitting the case to the QA system using at least one selected value. 12. The computer-program product of claim 11 , the operation further comprising submitting the case and an indication of the candidate value to the QA system for processing. | 0.749275 |
7,953,295 | 11 | 16 | 11. A computer program product, encoded on a computer-readable medium, operable to cause data processing apparatus to perform operations comprising: receiving a plurality of images each including a corresponding version of an identified candidate text region; aligning each candidate text region from the plurality of images to a high resolution grid; compositing the aligned candidate text regions to create a single superresolution image; and performing character recognition on the superresolution image to identify text. | 11. A computer program product, encoded on a computer-readable medium, operable to cause data processing apparatus to perform operations comprising: receiving a plurality of images each including a corresponding version of an identified candidate text region; aligning each candidate text region from the plurality of images to a high resolution grid; compositing the aligned candidate text regions to create a single superresolution image; and performing character recognition on the superresolution image to identify text. 16. The computer program product of claim 11 , further comprising: supersampling the candidate text regions from each image of the plurality of images. | 0.796496 |
9,116,863 | 15 | 19 | 15. A method for assembling a final document from a plurality of mini-documents, said method comprising: receiving, at a processing device, a document outline that includes at least a template link section to insert a link to a template and at least a mini-document link section to insert links to each of the plurality of mini-documents; receiving, from a user, a request to insert a link to a template in the template link section; receiving, from the user, a request to insert a link to each of a plurality of mini-documents in the mini-document link section; and upon receiving a request to assemble the final document: retrieving, using the processing device, the template using the template link inserted in the document outline at the request of the user; retrieving, using the processing device, each of the plurality of mini-documents using the mini-document links inserted in the document outline at the request of the user; automatically assembling, using the processing device, the final document, the assembled final document including the retrieved plurality of mini-documents in a format specified by the template; generating the final document; and outputting the final document to a database. | 15. A method for assembling a final document from a plurality of mini-documents, said method comprising: receiving, at a processing device, a document outline that includes at least a template link section to insert a link to a template and at least a mini-document link section to insert links to each of the plurality of mini-documents; receiving, from a user, a request to insert a link to a template in the template link section; receiving, from the user, a request to insert a link to each of a plurality of mini-documents in the mini-document link section; and upon receiving a request to assemble the final document: retrieving, using the processing device, the template using the template link inserted in the document outline at the request of the user; retrieving, using the processing device, each of the plurality of mini-documents using the mini-document links inserted in the document outline at the request of the user; automatically assembling, using the processing device, the final document, the assembled final document including the retrieved plurality of mini-documents in a format specified by the template; generating the final document; and outputting the final document to a database. 19. A method in accordance with claim 15 , wherein automatically assembling the final document comprises automatically assembling the final document from the retrieved template, the retrieved plurality of mini-documents, and based on the document outline. | 0.739796 |
9,870,134 | 1 | 5 | 1. A method for presenting positional information of an object associated with a text, the method comprising: performing iteratively for each selected group of one or more lines of a text a) displaying in a first region of a user interface on an electronic device, one or more lines of a text, each of the one or more lines of the text including at least one of role names, dialogue, and stage directions; b) displaying in a second region of the user interface of the electronic device, an image of a venue associated with the one or more lines of the text, the first region being displayed simultaneously to the second region; c) receiving from a user, the user interface of the electronic device, using an input device, selection of at least one digital representation of an object to relocate the object from a first position to a second position within the image of the venue associated with a selected group of the one or more lines of the text; d) determining, by a processor, at least an x-position and y-position of the digital representation of the object that has been relocated within the image of the venue; e) storing a position of the digital representation of the object within the image of the venue into a positional information record, the positional information record including: an identifier, associated with the selected group of one or more lines of the text, an identifier associated with the digital representation of the object within the image of the venue, and the x-position and y-position of the digital representation of the object within the image of the venue; f) updating the display of the second region for the digital representation of the object at the x-position and y-position within the image of the venue, using information stored in the positional information record associated with the selected group of the one or more lines of the text, wherein the updating of the display comprises providing an animation of the object from a previous position to the relocated position for the selected group of the one or more lines of the text based on a relationship stored in the positional information record comprising a transition between multiple positions of the object in the venue with respect to a plurality of lines of a text, as a subsequent selected group of lines is displayed; and g) repeating steps a through f above for a next selected group of one or more lines of the text. | 1. A method for presenting positional information of an object associated with a text, the method comprising: performing iteratively for each selected group of one or more lines of a text a) displaying in a first region of a user interface on an electronic device, one or more lines of a text, each of the one or more lines of the text including at least one of role names, dialogue, and stage directions; b) displaying in a second region of the user interface of the electronic device, an image of a venue associated with the one or more lines of the text, the first region being displayed simultaneously to the second region; c) receiving from a user, the user interface of the electronic device, using an input device, selection of at least one digital representation of an object to relocate the object from a first position to a second position within the image of the venue associated with a selected group of the one or more lines of the text; d) determining, by a processor, at least an x-position and y-position of the digital representation of the object that has been relocated within the image of the venue; e) storing a position of the digital representation of the object within the image of the venue into a positional information record, the positional information record including: an identifier, associated with the selected group of one or more lines of the text, an identifier associated with the digital representation of the object within the image of the venue, and the x-position and y-position of the digital representation of the object within the image of the venue; f) updating the display of the second region for the digital representation of the object at the x-position and y-position within the image of the venue, using information stored in the positional information record associated with the selected group of the one or more lines of the text, wherein the updating of the display comprises providing an animation of the object from a previous position to the relocated position for the selected group of the one or more lines of the text based on a relationship stored in the positional information record comprising a transition between multiple positions of the object in the venue with respect to a plurality of lines of a text, as a subsequent selected group of lines is displayed; and g) repeating steps a through f above for a next selected group of one or more lines of the text. 5. The method of claim 1 , wherein the venue is one of a stage, an arena, a field, a stadium, or a combination thereof. | 0.918827 |
9,477,314 | 1 | 13 | 1. A method performed by an electronic device for selecting a gesture recognition system, the method comprising: determining a context of operation for the electronic device that affects a gesture recognition function performed by the electronic device, wherein determining the context of operation further comprises determining an ambient light level for the electronic device; and selecting, based on the ambient light level, one of a plurality of gesture recognition systems in the electronic device as an active gesture recognition system for receiving gesturing input to perform the gesture recognition function, wherein the plurality of gesture recognition systems comprises an image-based gesture recognition system and a non-image-based gesture recognition system. | 1. A method performed by an electronic device for selecting a gesture recognition system, the method comprising: determining a context of operation for the electronic device that affects a gesture recognition function performed by the electronic device, wherein determining the context of operation further comprises determining an ambient light level for the electronic device; and selecting, based on the ambient light level, one of a plurality of gesture recognition systems in the electronic device as an active gesture recognition system for receiving gesturing input to perform the gesture recognition function, wherein the plurality of gesture recognition systems comprises an image-based gesture recognition system and a non-image-based gesture recognition system. 13. The method of claim 1 , wherein determining the context of operation comprises determining that the electronic device is to exchange data with a second electronic device, and wherein the non-image-based gesture recognition system is selected as the active gesture recognition system to facilitate the exchange of data with the second device by performing at least one of: transmitting data to the second electronic device using an infrared transmitter of the non-image-based gesture recognition system; or receiving data from the second electronic device using an infrared receiver of the non-image-based gesture recognition system. | 0.634062 |
8,812,294 | 15 | 18 | 15. A computer program product for providing information, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for: receiving information to be communicated as sensory perceptible output; and applying an ordered set of rules to generate a representation that expresses the information in a manner that embodies applicable communication system rules of a target symbolic communication system in which the information is to be communicated; wherein the representation expresses the information in a symbolic communication system other than the target symbolic communication system but deviates from a communication system rule of the symbolic communication system other than the target symbolic communication system to comply instead with a corresponding communication system rule of the target symbolic communication system. | 15. A computer program product for providing information, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for: receiving information to be communicated as sensory perceptible output; and applying an ordered set of rules to generate a representation that expresses the information in a manner that embodies applicable communication system rules of a target symbolic communication system in which the information is to be communicated; wherein the representation expresses the information in a symbolic communication system other than the target symbolic communication system but deviates from a communication system rule of the symbolic communication system other than the target symbolic communication system to comply instead with a corresponding communication system rule of the target symbolic communication system. 18. The computer program product of claim 15 , wherein the corresponding communication system rule of the target symbolic communication system comprises one or more of the following: a syntactic rule; a rule prescribing a word order; a grammar rule; and a rule associated with number or gender. | 0.501695 |
9,454,964 | 7 | 10 | 7. An interfacing device for supporting a speech dialogue service, the interfacing device comprising: an input unit configured to receive a user input including a voice input and a non-voice input, the non-voice input being an image input; a communication unit configured to communicate with a server; a control unit configured to: execute an interface for the speech dialogue service, to receive the user input through the executed interface, transmit, as a request signal to the server, at least one of the voice input or a text extracted from the voice input when the received user input is the voice input, transmit, as the request signal to the server, a text extracted from the non-voice input when the received user input is the non-voice input, receive a result of dialogue recognition in response to the request signal from the server, and execute a response to the received user input on the basis of the received result of dialogue recognition; and an output unit configured to output a result of executing the response to the received user input. | 7. An interfacing device for supporting a speech dialogue service, the interfacing device comprising: an input unit configured to receive a user input including a voice input and a non-voice input, the non-voice input being an image input; a communication unit configured to communicate with a server; a control unit configured to: execute an interface for the speech dialogue service, to receive the user input through the executed interface, transmit, as a request signal to the server, at least one of the voice input or a text extracted from the voice input when the received user input is the voice input, transmit, as the request signal to the server, a text extracted from the non-voice input when the received user input is the non-voice input, receive a result of dialogue recognition in response to the request signal from the server, and execute a response to the received user input on the basis of the received result of dialogue recognition; and an output unit configured to output a result of executing the response to the received user input. 10. The interfacing device of claim 7 , wherein the control unit is further configured to: recognize text from the image input through an optical character recognition process, and select a specific part among the recognized text through a filtering process. | 0.63662 |
8,872,677 | 36 | 37 | 36. The computer-implemented method of claim 33 , wherein: selecting a subset of input data symbols S N comprises generating a respective input data hash value HV N for each N th input data symbol B N in the sequence of input data symbols, and wherein searching a dictionary-index comprises searching a hash index for an entry corresponding to each input data hash value HV N , where each hash index entry points to a dictionary data symbol HB and its corresponding location in the dictionary. | 36. The computer-implemented method of claim 33 , wherein: selecting a subset of input data symbols S N comprises generating a respective input data hash value HV N for each N th input data symbol B N in the sequence of input data symbols, and wherein searching a dictionary-index comprises searching a hash index for an entry corresponding to each input data hash value HV N , where each hash index entry points to a dictionary data symbol HB and its corresponding location in the dictionary. 37. The computer-implemented method of claim 36 , wherein determining a range of input data is symbols including the N th input data symbol B N that matches a range of dictionary data symbols that includes the dictionary data symbol HB N comprises: terminating the determination when a length of the matching range is at least equal to a predetermined threshold value. | 0.895395 |
8,568,144 | 28 | 45 | 28. A computer implemented reading comprehension training method, the method comprising: generating a reading comprehension challenge that comprises language micro-variables including one or more verb micro-variables, one or more agent micro-variables, and one or more reference micro-variables at a particular level of difficulty to test a user's comprehension of the reading comprehension challenge; generating a user interface for the reading comprehension challenge at the particular skill level wherein the user interface for the reading comprehension challenge at the particular skill level is displayed on a computing device to the user; receiving a response from the user to the reading comprehension challenge based on controlled manipulation of the language micro-variables in the reading comprehension challenge; isolating one or more language micro-variables that are impeding the user's comprehension of the reading comprehension challenge based on the response from the user; providing direct instruction to train the user to become more proficient at the isolated one or more language micro-variables based on controlled manipulation of the isolated one or more language micro-variables; and determining, once the user becomes more proficient at the isolated one or more language micro-variables, a next reading comprehension challenge that comprises language micro-variables including one or more verb micro-variables, one or more agent micro-variables, and one or more reference micro-variables at a particular level of difficulty to test the user's comprehension of the next reading comprehension challenge. | 28. A computer implemented reading comprehension training method, the method comprising: generating a reading comprehension challenge that comprises language micro-variables including one or more verb micro-variables, one or more agent micro-variables, and one or more reference micro-variables at a particular level of difficulty to test a user's comprehension of the reading comprehension challenge; generating a user interface for the reading comprehension challenge at the particular skill level wherein the user interface for the reading comprehension challenge at the particular skill level is displayed on a computing device to the user; receiving a response from the user to the reading comprehension challenge based on controlled manipulation of the language micro-variables in the reading comprehension challenge; isolating one or more language micro-variables that are impeding the user's comprehension of the reading comprehension challenge based on the response from the user; providing direct instruction to train the user to become more proficient at the isolated one or more language micro-variables based on controlled manipulation of the isolated one or more language micro-variables; and determining, once the user becomes more proficient at the isolated one or more language micro-variables, a next reading comprehension challenge that comprises language micro-variables including one or more verb micro-variables, one or more agent micro-variables, and one or more reference micro-variables at a particular level of difficulty to test the user's comprehension of the next reading comprehension challenge. 45. The method of claim 28 further comprising assessing the skill level of a student at a particular reading comprehension challenge further comprising asking the student what his skill level is for the particular reading comprehension challenge and testing the student at the skill level. | 0.800414 |
10,031,642 | 6 | 8 | 6. A method for configuring a tab in tab control, comprising: presenting, by one or more processors, a tab control tool stored on a server in response to providing an electronic form comprising a plurality of pages, the tab control tool including a first tab having a first descriptive label and at least one transformable tab having a non-descriptive label and corresponding to the pages of the electronic form; associating a transformable tab with the non-descriptive label, wherein the non-descriptive label is devoid of data content of the corresponding page and is adapted to be transformed by a user to a second descriptive label by editing the non-descriptive label; responsive to the user selecting the transformable tab having the non-descriptive label, changing, by the one or more processors, the non-descriptive label of the transformable tab into an editable text field tab that prompts the user to type text into the editable text field tab; responsive to the user typing text in the editable text field tab, changing, by the one or more processors, the text into the entered text so that the transformable tab displays the entered text; and responsive to the user selecting the first tab having the first descriptive label after the transformable tab displays the entered text, reverting the entered text of the transformable tab to the non-descriptive label. | 6. A method for configuring a tab in tab control, comprising: presenting, by one or more processors, a tab control tool stored on a server in response to providing an electronic form comprising a plurality of pages, the tab control tool including a first tab having a first descriptive label and at least one transformable tab having a non-descriptive label and corresponding to the pages of the electronic form; associating a transformable tab with the non-descriptive label, wherein the non-descriptive label is devoid of data content of the corresponding page and is adapted to be transformed by a user to a second descriptive label by editing the non-descriptive label; responsive to the user selecting the transformable tab having the non-descriptive label, changing, by the one or more processors, the non-descriptive label of the transformable tab into an editable text field tab that prompts the user to type text into the editable text field tab; responsive to the user typing text in the editable text field tab, changing, by the one or more processors, the text into the entered text so that the transformable tab displays the entered text; and responsive to the user selecting the first tab having the first descriptive label after the transformable tab displays the entered text, reverting the entered text of the transformable tab to the non-descriptive label. 8. The method of claim 6 , further comprising recording the text in the transformable tab. | 0.829545 |
9,262,459 | 5 | 6 | 5. The computer-implemented method of claim 4 , wherein the content described by the application page data further includes image data depicting an image of the application page. | 5. The computer-implemented method of claim 4 , wherein the content described by the application page data further includes image data depicting an image of the application page. 6. The computer-implemented method of claim 5 , wherein generating application page data describing content of the application page comprises: performing optical character recognition (OCR) on the image data to generate OCR text; and generating, based on the OCR text, text data describing the text that a user device displays on the application page. | 0.887572 |
8,286,171 | 22 | 23 | 22. A computer implemented method for preventing unauthorized disclosure of secure information as recited in claim 1 , wherein said fingerprint hash function includes any hash function that allows said fingerprint to be independent of the order of said words in said first word hash list. | 22. A computer implemented method for preventing unauthorized disclosure of secure information as recited in claim 1 , wherein said fingerprint hash function includes any hash function that allows said fingerprint to be independent of the order of said words in said first word hash list. 23. A computer implemented method for preventing unauthorized disclosure of secure information as recited in claim 22 , wherein said fingerprint hash function includes a symmetric hash function. | 0.954821 |
9,396,726 | 14 | 18 | 14. A method performed on at least one processor of speech recognition wherein the speech recognition system replaces a generic language model with a user specific language model, comprising: receiving analog audio from a specific speaker; digitizing the analog audio to generate a corpus of material associated with the specific speaker; receiving a user specific language model that is formed from the corpus of material associated with the specific speaker; determining whether a continuous speech recognition system should use a generic language model or the user specific language model, wherein the step of determining comprises: calculating a perplexity of the generic language model; calculating a perplexity of the user specific language model; and determining whether the perplexity of the user specific language model is less than or equal to the perplexity of the generic language model; and if it is determined that the continuous speech recognition system should use the generic language model, repeating the receiving step and the determining step until it is determined that the continuous speech recognition system should use the user specific language model; and if it is determined that the continuous speech recognition system should use the user specific language model, causing the continuous speech recognition system to replace the generic language model with the user specific language model. | 14. A method performed on at least one processor of speech recognition wherein the speech recognition system replaces a generic language model with a user specific language model, comprising: receiving analog audio from a specific speaker; digitizing the analog audio to generate a corpus of material associated with the specific speaker; receiving a user specific language model that is formed from the corpus of material associated with the specific speaker; determining whether a continuous speech recognition system should use a generic language model or the user specific language model, wherein the step of determining comprises: calculating a perplexity of the generic language model; calculating a perplexity of the user specific language model; and determining whether the perplexity of the user specific language model is less than or equal to the perplexity of the generic language model; and if it is determined that the continuous speech recognition system should use the generic language model, repeating the receiving step and the determining step until it is determined that the continuous speech recognition system should use the user specific language model; and if it is determined that the continuous speech recognition system should use the user specific language model, causing the continuous speech recognition system to replace the generic language model with the user specific language model. 18. The method of claim 14 wherein the generic language model comprises new n-grams developed from transcripts of the audio of the specific speaker. | 0.882911 |
7,613,365 | 19 | 27 | 19. A video summarization system, suitable for extracting a plurality of key frames and a plurality of key sentences from a video to form an abstract wherein the video comprises a plurality of sentences and a plurality of frames, the video summarization system comprising: a similarity computing apparatus, used for computing the similarity between each frame to obtain a plurality of similarity values; a key frame extracting apparatus, used for choosing the key frames from the frames wherein the sum of the similarity values between the key frames is minimum; a feature space mapping apparatus, used for converting the sentences into a plurality of corresponding sentence vectors and computing the distance between each sentence vector to obtain a plurality of distance values; a clustering apparatus, used for dividing the sentences into a plurality of clusters according to the distance values wherein the clusters are members of a set, and the clustering apparatus further computing the importance of each sentence of each cluster to obtain the importance of each cluster and applying a splitting step to split a most important member with the highest importance in the cluster into a plurality of new clusters, wherein the new clusters replace the original most important member and join the set as members of the set; and a key sentence extracting apparatus, used for choosing at least one key sentence from each members of the set, wherein the sum of the importance of the key sentences is maximum. | 19. A video summarization system, suitable for extracting a plurality of key frames and a plurality of key sentences from a video to form an abstract wherein the video comprises a plurality of sentences and a plurality of frames, the video summarization system comprising: a similarity computing apparatus, used for computing the similarity between each frame to obtain a plurality of similarity values; a key frame extracting apparatus, used for choosing the key frames from the frames wherein the sum of the similarity values between the key frames is minimum; a feature space mapping apparatus, used for converting the sentences into a plurality of corresponding sentence vectors and computing the distance between each sentence vector to obtain a plurality of distance values; a clustering apparatus, used for dividing the sentences into a plurality of clusters according to the distance values wherein the clusters are members of a set, and the clustering apparatus further computing the importance of each sentence of each cluster to obtain the importance of each cluster and applying a splitting step to split a most important member with the highest importance in the cluster into a plurality of new clusters, wherein the new clusters replace the original most important member and join the set as members of the set; and a key sentence extracting apparatus, used for choosing at least one key sentence from each members of the set, wherein the sum of the importance of the key sentences is maximum. 27. The video summarization system according to claim 19 , wherein the key sentences are centroid sentences of the members of the set. | 0.883882 |
9,922,015 | 1 | 2 | 1. A computer implemented method for providing solutions relating to abbreviations, the method comprising: receiving, by a computer system, a message that specifies a recipient and sender and that includes a text body; identifying, by the computer system and from within the text body, a first text portion associated with an abbreviation; retrieving, by the computer system, a profile of the sender and a profile of the recipient, wherein the profile of the sender contains online content exposure information that is generated from a history of the sender's online activities, and the profile of the recipient contains online content exposure information that is generated from a history of the recipients online activities; identifying, by the computer system and based on the profile of the sender, one or more solutions for the first text portion associated with the abbreviation; scoring, by the computer system, each of the one or more solutions using the profiles of the sender and recipient, wherein the scoring includes a first score which reflects the likelihood that the each of the one or more solutions is the abbreviation the sender intended based upon online content exposure information in the profile of the sender, and a second score which reflects the recipient's familiarity with and knowledge of the each of the one or more solutions based upon online content exposure information in the profile of the recipient; identifying, by the computer system and based upon the scoring, a particular solution of the one or more solutions for use, wherein the identifying based upon the scoring by combining the first score and the second score to calculate an overall confidence value that reflects the accuracy of the particular solution; modifying the text body of the message to include the particular solution, wherein the modifying the text body comprises expanding a first instance of the abbreviation and leaving other instances of the abbreviation collapsed, based on the profile of the recipient; and transmitting the message and the confidence value, as modified, to the recipient. | 1. A computer implemented method for providing solutions relating to abbreviations, the method comprising: receiving, by a computer system, a message that specifies a recipient and sender and that includes a text body; identifying, by the computer system and from within the text body, a first text portion associated with an abbreviation; retrieving, by the computer system, a profile of the sender and a profile of the recipient, wherein the profile of the sender contains online content exposure information that is generated from a history of the sender's online activities, and the profile of the recipient contains online content exposure information that is generated from a history of the recipients online activities; identifying, by the computer system and based on the profile of the sender, one or more solutions for the first text portion associated with the abbreviation; scoring, by the computer system, each of the one or more solutions using the profiles of the sender and recipient, wherein the scoring includes a first score which reflects the likelihood that the each of the one or more solutions is the abbreviation the sender intended based upon online content exposure information in the profile of the sender, and a second score which reflects the recipient's familiarity with and knowledge of the each of the one or more solutions based upon online content exposure information in the profile of the recipient; identifying, by the computer system and based upon the scoring, a particular solution of the one or more solutions for use, wherein the identifying based upon the scoring by combining the first score and the second score to calculate an overall confidence value that reflects the accuracy of the particular solution; modifying the text body of the message to include the particular solution, wherein the modifying the text body comprises expanding a first instance of the abbreviation and leaving other instances of the abbreviation collapsed, based on the profile of the recipient; and transmitting the message and the confidence value, as modified, to the recipient. 2. The method of claim 1 , further comprising: determining an inferred context of the message using information from the sender's profile; and determining a probable knowledge of the one or more solutions using information from the recipient's profile. | 0.73913 |
8,635,059 | 1 | 7 | 1. A method performed by a data processing apparatus, the method comprising: receiving data identifying source language text; receiving a translation for the source language text from a machine translation system, the translation including translated text corresponding to the source language text and segmentation data for the translated text, wherein the segmentation data includes a plurality of possible segmentations of the translated text, the plurality of possible segmentations dividing the translated text into a plurality of segments; receiving one or more alternative translations for each of the plurality of segments of the plurality of possible segmentations; and sending executable instructions that, when executed by a user device, cause the user device to perform operations comprising: displaying a user interface; presenting the source language text and the translated text in the user interface; presenting, in the user interface, a slider having a plurality of positions, each position of the plurality of positions corresponding to one of the plurality of possible segmentations; arranging the plurality of segmentations in an order from a smallest segmentation to a largest segmentation; and in response to a user input, presenting in the user interface each of the plurality of possible segmentations and the corresponding alternative translations for each of the plurality of possible segmentations, the user input providing for separately presenting each of the plurality of possible segmentations with their corresponding alternative translations, wherein moving the slider from a first position toward a second opposed position of the plurality of positions displays the switching starting with the smallest segmentation and progressing toward the largest segmentation. | 1. A method performed by a data processing apparatus, the method comprising: receiving data identifying source language text; receiving a translation for the source language text from a machine translation system, the translation including translated text corresponding to the source language text and segmentation data for the translated text, wherein the segmentation data includes a plurality of possible segmentations of the translated text, the plurality of possible segmentations dividing the translated text into a plurality of segments; receiving one or more alternative translations for each of the plurality of segments of the plurality of possible segmentations; and sending executable instructions that, when executed by a user device, cause the user device to perform operations comprising: displaying a user interface; presenting the source language text and the translated text in the user interface; presenting, in the user interface, a slider having a plurality of positions, each position of the plurality of positions corresponding to one of the plurality of possible segmentations; arranging the plurality of segmentations in an order from a smallest segmentation to a largest segmentation; and in response to a user input, presenting in the user interface each of the plurality of possible segmentations and the corresponding alternative translations for each of the plurality of possible segmentations, the user input providing for separately presenting each of the plurality of possible segmentations with their corresponding alternative translations, wherein moving the slider from a first position toward a second opposed position of the plurality of positions displays the switching starting with the smallest segmentation and progressing toward the largest segmentation. 7. The method of claim 1 , wherein receiving one or more alternative translations includes receiving a respective translation score for each alternative translation; and the operations further comprise presenting the one or more alternative translations in an order based on the respective translation scores. | 0.725577 |
7,539,343 | 26 | 27 | 26. The system of claim 25 , wherein the linking engine is operable to: identify a weighted set of words or phrases in each tessellated region classified as containing text; recognize tessellated regions that share a weighted word or phrase; and establish links between the recognized tessellated regions. | 26. The system of claim 25 , wherein the linking engine is operable to: identify a weighted set of words or phrases in each tessellated region classified as containing text; recognize tessellated regions that share a weighted word or phrase; and establish links between the recognized tessellated regions. 27. The system of claim 26 , wherein the linking engine is operable to identify a weighted word set for each tessellated region, by computing relative occurrences of words or phrases within that tessellated region as compared to a larger corpus. | 0.903391 |
8,180,787 | 8 | 9 | 8. The method of claim 1 , further comprising: transforming the abstract query into a physical query consistent with the particular schema; the transforming including generating query logic not explicitly defined by user selections made in composing the abstract query on the basis of the abstraction model. | 8. The method of claim 1 , further comprising: transforming the abstract query into a physical query consistent with the particular schema; the transforming including generating query logic not explicitly defined by user selections made in composing the abstract query on the basis of the abstraction model. 9. The method of claim 8 , wherein the physical query consistent with the particular schema is one of a SQL query and an XML query. | 0.969263 |
8,738,607 | 17 | 18 | 17. A system to reduce storage and transmission costs associated with remote error recreation for abstract database applications, the system comprising: one or more computer processors; a memory containing a program which, when executed by the one or more computer processors, is configured to perform an operation comprising: upon detecting an error condition when an application executes an abstract query against an abstract database having an underlying physical database in a first computing environment, generating, not in response to any user request, an abstract database application extraction sufficient to recreate the error condition and comprising at least a portion of each of the application, the abstract database, and the physical database, respectively, wherein the portion of the abstract database includes a definition of at least one logical field used by the abstract query and excludes a definition of at least one logical field not used by the abstract query; sending the abstract database application extraction for execution in a second computing environment different from the first computing environment; and recreating the error condition from the abstract database application extraction in order to facilitate resolving the error condition, whereby storage and transmission costs associated with recreating the error condition in the second computing environment are reduced relative to providing the entirety of each of the application, the abstract database, and the physical database, respectively, for execution in the second computing environment. | 17. A system to reduce storage and transmission costs associated with remote error recreation for abstract database applications, the system comprising: one or more computer processors; a memory containing a program which, when executed by the one or more computer processors, is configured to perform an operation comprising: upon detecting an error condition when an application executes an abstract query against an abstract database having an underlying physical database in a first computing environment, generating, not in response to any user request, an abstract database application extraction sufficient to recreate the error condition and comprising at least a portion of each of the application, the abstract database, and the physical database, respectively, wherein the portion of the abstract database includes a definition of at least one logical field used by the abstract query and excludes a definition of at least one logical field not used by the abstract query; sending the abstract database application extraction for execution in a second computing environment different from the first computing environment; and recreating the error condition from the abstract database application extraction in order to facilitate resolving the error condition, whereby storage and transmission costs associated with recreating the error condition in the second computing environment are reduced relative to providing the entirety of each of the application, the abstract database, and the physical database, respectively, for execution in the second computing environment. 18. The system of claim 17 , wherein the error condition is selected from at least: (i) an error in converting the abstract query to a concrete query; (ii) an error in executing the concrete query against the physical database; (iii) an error in retrieving query results from the physical database; and (iv) an error in converting the query results from the physical database to a logical representation. | 0.888767 |
8,626,768 | 16 | 17 | 16. The one or more computer storage media of claim 13 , wherein ranking the plurality of clusters against one another comprises generating a ranking for each cluster, and wherein the ranking for at least one cluster is based at least in part on presence of a hyperlink in social network data from a social network site to at least one content item in the at least one cluster. | 16. The one or more computer storage media of claim 13 , wherein ranking the plurality of clusters against one another comprises generating a ranking for each cluster, and wherein the ranking for at least one cluster is based at least in part on presence of a hyperlink in social network data from a social network site to at least one content item in the at least one cluster. 17. The one or more computer storage media of claim 16 , wherein the method further comprises adding, to the at least one cluster, a reference to the social network data from the social networking site that hyperlinks to the at least one content item in the at least one cluster. | 0.950984 |
8,583,931 | 1 | 9 | 1. A system comprising: a source device including: an interface configured to: receive an electronic document; transmit the electronic document to a dedicated signing device; and receive a signed electronic document from the dedicated signing device, the signed electronic document including the electronic document and an associated signature document including a digital image embedded with a digital watermark representing an encrypted one-way hash; memory configured to store a public key assigned to the dedicated signing device; a processor configured to: calculate a one-way hash of the electronic document; decode the digital watermark representing the encrypted one-way hash; decrypt the encrypted one-way hash using the stored public key assigned to the dedicated signing device; compare the decrypted one-way hash to the calculated one-way hash; and wherein the dedicated signing device includes: a signer interface configured to receive input from a signer; an external interface configured to: receive the electronic document from the source device; transmit the signed electronic document to the source device, the signed electronic document including the electronic document and the associated signature document; memory configured to store a private key assigned to the dedicated signing device; and a processor configured to: prevent alterations to the electronic document presented by the dedicated signing device; alter a characteristic of the signature document based on the signer input, the signature document comprising an arbitrary digital representation; calculate the one-way hash for the electronic document; encrypt the one-way hash using the stored private key assigned to the dedicated signing device; embed the digital watermark representing the encrypted one-way hash into the arbitrary digital representation, wherein the digital watermark is generated and embedded independent of any private key of the signer; and associating the electronic document with the altered signature document as the signed electronic document. | 1. A system comprising: a source device including: an interface configured to: receive an electronic document; transmit the electronic document to a dedicated signing device; and receive a signed electronic document from the dedicated signing device, the signed electronic document including the electronic document and an associated signature document including a digital image embedded with a digital watermark representing an encrypted one-way hash; memory configured to store a public key assigned to the dedicated signing device; a processor configured to: calculate a one-way hash of the electronic document; decode the digital watermark representing the encrypted one-way hash; decrypt the encrypted one-way hash using the stored public key assigned to the dedicated signing device; compare the decrypted one-way hash to the calculated one-way hash; and wherein the dedicated signing device includes: a signer interface configured to receive input from a signer; an external interface configured to: receive the electronic document from the source device; transmit the signed electronic document to the source device, the signed electronic document including the electronic document and the associated signature document; memory configured to store a private key assigned to the dedicated signing device; and a processor configured to: prevent alterations to the electronic document presented by the dedicated signing device; alter a characteristic of the signature document based on the signer input, the signature document comprising an arbitrary digital representation; calculate the one-way hash for the electronic document; encrypt the one-way hash using the stored private key assigned to the dedicated signing device; embed the digital watermark representing the encrypted one-way hash into the arbitrary digital representation, wherein the digital watermark is generated and embedded independent of any private key of the signer; and associating the electronic document with the altered signature document as the signed electronic document. 9. The system of claim 1 , wherein the signer input comprises biometric data. | 0.889368 |
9,465,879 | 16 | 21 | 16. A system comprising: at least one computing device, each computing device comprising a processor and a storage medium for tangibly storing thereon program logic for execution by the processor, the stored program logic comprising: receiving logic executed by the processor for receiving crawling data from a crawl of a content preview source; extracting logic executed by the processor for extracting, in connection with crawling the content preview source, data and a link from the content preview source, the link comprising a link to a target document, the data to be used to create a content preview document previewing the target document, the target document containing content being previewed by the content preview source; creating logic executed by the processor for creating, in connection with crawling the content preview source, the content preview document using the data extracted from the content preview source, the content preview document being different from the target document and the content preview source, the content preview document being created without using the target document; and making logic executed by the processor for making the created content preview document available for searching by a search engine in an index prior to the target document being made available for searching by the search engine in the index. | 16. A system comprising: at least one computing device, each computing device comprising a processor and a storage medium for tangibly storing thereon program logic for execution by the processor, the stored program logic comprising: receiving logic executed by the processor for receiving crawling data from a crawl of a content preview source; extracting logic executed by the processor for extracting, in connection with crawling the content preview source, data and a link from the content preview source, the link comprising a link to a target document, the data to be used to create a content preview document previewing the target document, the target document containing content being previewed by the content preview source; creating logic executed by the processor for creating, in connection with crawling the content preview source, the content preview document using the data extracted from the content preview source, the content preview document being different from the target document and the content preview source, the content preview document being created without using the target document; and making logic executed by the processor for making the created content preview document available for searching by a search engine in an index prior to the target document being made available for searching by the search engine in the index. 21. The system of claim 16 , the stored program logic further comprising: using logic executed by the processor for using at least a portion of the extracted data to present the content preview document as part of search results generated by the search engine in response to a search query. | 0.674888 |
8,386,468 | 12 | 15 | 12. A non-transitory computer-readable medium storing computer-executable instructions executed by a computer causing the computer to perform a method of spatial query processing, the method comprising: receiving a spatial query on spatial data that specifies a query window, where the spatial data has an associated spatial data index, and where the spatial data index includes a plurality of spatial data index elements; constructing a query window index structure describing a geometry of the query window, where the query window index structure includes a plurality of query window index structure elements; and comparing the query window index structure to the spatial data index and to the spatial data to determine a spatial relationship between the query window and the spatial data by: identifying a spatial data index element; searching the query window index structure to determine if the spatial data index element intersects a query window index structure element; if the spatial data index element intersects the query window index structure element, accessing a spatial data store that stores the spatial data to determine if spatial data represented by the spatial data index element intersects the query window; if the spatial data index element does not intersect the query window index structure element, determining whether a selected data point lying in the spatial data index element is contained within the query window; and if the selected data point is contained within the query window, determining that the spatial data represented by the spatial data index element is contained within the query window. | 12. A non-transitory computer-readable medium storing computer-executable instructions executed by a computer causing the computer to perform a method of spatial query processing, the method comprising: receiving a spatial query on spatial data that specifies a query window, where the spatial data has an associated spatial data index, and where the spatial data index includes a plurality of spatial data index elements; constructing a query window index structure describing a geometry of the query window, where the query window index structure includes a plurality of query window index structure elements; and comparing the query window index structure to the spatial data index and to the spatial data to determine a spatial relationship between the query window and the spatial data by: identifying a spatial data index element; searching the query window index structure to determine if the spatial data index element intersects a query window index structure element; if the spatial data index element intersects the query window index structure element, accessing a spatial data store that stores the spatial data to determine if spatial data represented by the spatial data index element intersects the query window; if the spatial data index element does not intersect the query window index structure element, determining whether a selected data point lying in the spatial data index element is contained within the query window; and if the selected data point is contained within the query window, determining that the spatial data represented by the spatial data index element is contained within the query window. 15. The non-transitory computer-readable medium of claim 12 , wherein the instructions for determining if the selected data point is contained within the query window comprise: finding a nearest point to the selected data point on the query window boundary; identifying one or more query window boundary edges that include the nearest point; traversing the query window index structure associated with the identified boundary edges to determine if the selected data point is within the query window; and if the data point is within the query window, determining that the spatial data index element is contained within the query window. | 0.707643 |
8,296,139 | 1 | 3 | 1. A speech processing method comprising: establishing a real-time communication session between a first client device and a second client device located remotely from the first client device, the real-time communication session involving a voice interface at the first client device; streaming speech during the real-time communication session from the first client device to a remotely located voice server via the voice interface; sending an endpoint identifier from the first client device to the voice server which identifies the second client device; converting the streamed speech from the first client device to a real-time stream of text at the voice server as the streamed speech arrives at the voice server during the real-time communication session; streaming the real-time stream of text from the voice server to the second client device in real time during the real-time communication session; and displaying the real-time stream of text at the second client device, as the real-time stream of text is received by the second client device during the communication session. | 1. A speech processing method comprising: establishing a real-time communication session between a first client device and a second client device located remotely from the first client device, the real-time communication session involving a voice interface at the first client device; streaming speech during the real-time communication session from the first client device to a remotely located voice server via the voice interface; sending an endpoint identifier from the first client device to the voice server which identifies the second client device; converting the streamed speech from the first client device to a real-time stream of text at the voice server as the streamed speech arrives at the voice server during the real-time communication session; streaming the real-time stream of text from the voice server to the second client device in real time during the real-time communication session; and displaying the real-time stream of text at the second client device, as the real-time stream of text is received by the second client device during the communication session. 3. The method of claim 1 , wherein the real time communication session is between two parties who both produce speech, and the streamed speech includes speech for both of the two parties. | 0.812249 |
9,589,579 | 7 | 11 | 7. A method comprising: identifying a natural language processing system that is associated with a virtual assistant; evaluating the natural language processing system by processing test user input with the natural language processing system, the test user input having been previously associated with a particular result; determining that the processing does not identify the particular result; and causing display of a user interface with an indicator associated with the test user input to enable a user to modify an element of the natural language processing system that is associated with at least one of the test user input or the particular result that has been previously associated with the test user input, the indicator indicating that the processing does not identify the particular result. | 7. A method comprising: identifying a natural language processing system that is associated with a virtual assistant; evaluating the natural language processing system by processing test user input with the natural language processing system, the test user input having been previously associated with a particular result; determining that the processing does not identify the particular result; and causing display of a user interface with an indicator associated with the test user input to enable a user to modify an element of the natural language processing system that is associated with at least one of the test user input or the particular result that has been previously associated with the test user input, the indicator indicating that the processing does not identify the particular result. 11. The method of claim 7 , wherein the natural language processing system utilizes a plurality of components, each of the plurality of components comprising at least one of: a unit that associates one or more concepts with a response; a concept; or a vocab term comprising a grouping of at least one of unambiguous synonyms of a word or spelling variations of a word. | 0.792559 |
9,087,337 | 13 | 14 | 13. The storage device of claim 9 , where the at least some of the text is vertically displayed in at least one column by a browser. | 13. The storage device of claim 9 , where the at least some of the text is vertically displayed in at least one column by a browser. 14. The storage device of claim 13 , where the at least one column is displayed on a left-hand side or a right-hand side of the mobile browser. | 0.964985 |
7,565,630 | 31 | 33 | 31. The system of claim 27 , wherein the operations further comprise: automatically generating the search customization profile by analysis of attributes of the third party website. | 31. The system of claim 27 , wherein the operations further comprise: automatically generating the search customization profile by analysis of attributes of the third party website. 33. The system of claim 31 , wherein the operations further comprise: identifying outbound links on at least one page of the third party website; determining domains corresponding to the outbound links; and determining topics from a topical directory that correspond to the keywords that are associated with the internet sites; and including topic identifiers associated with the determined topics in the search customization profile. | 0.876283 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.